@frontify/guideline-blocks-settings 1.0.13-alpha.2 → 1.0.13-alpha.4

package/dist/node_modules/.pnpm/slate@0.102.0/node_modules/slate/dist/index.es.es.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.es.es.js","sources":["../../../../../../../../../node_modules/.pnpm/slate@0.102.0/node_modules/slate/dist/index.es.js"],"sourcesContent":["import { isPlainObject } from 'is-plain-object';\nimport { createDraft, finishDraft, isDraft, produce } from 'immer';\n\n// eslint-disable-next-line no-redeclare\nvar PathRef = {\n  transform(ref, op) {\n    var {\n      current,\n      affinity\n    } = ref;\n    if (current == null) {\n      return;\n    }\n    var path = Path.transform(current, op, {\n      affinity\n    });\n    ref.current = path;\n    if (path == null) {\n      ref.unref();\n    }\n  }\n};\n\n// eslint-disable-next-line no-redeclare\nvar PointRef = {\n  transform(ref, op) {\n    var {\n      current,\n      affinity\n    } = ref;\n    if (current == null) {\n      return;\n    }\n    var point = Point.transform(current, op, {\n      affinity\n    });\n    ref.current = point;\n    if (point == null) {\n      ref.unref();\n    }\n  }\n};\n\n// eslint-disable-next-line no-redeclare\nvar RangeRef = {\n  transform(ref, op) {\n    var {\n      current,\n      affinity\n    } = ref;\n    if (current == null) {\n      return;\n    }\n    var path = Range.transform(current, op, {\n      affinity\n    });\n    ref.current = path;\n    if (path == null) {\n      ref.unref();\n    }\n  }\n};\n\nvar DIRTY_PATHS = new WeakMap();\nvar DIRTY_PATH_KEYS = new WeakMap();\nvar FLUSHING = new WeakMap();\nvar NORMALIZING = new WeakMap();\nvar PATH_REFS = new WeakMap();\nvar POINT_REFS = new WeakMap();\nvar RANGE_REFS = new WeakMap();\n\n// eslint-disable-next-line no-redeclare\nvar Path = {\n  ancestors(path) {\n    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    var {\n      reverse = false\n    } = options;\n    var paths = Path.levels(path, options);\n    if (reverse) {\n      paths = paths.slice(1);\n    } else {\n      paths = paths.slice(0, -1);\n    }\n    return paths;\n  },\n  common(path, another) {\n    var common = [];\n    for (var i = 0; i < path.length && i < another.length; i++) {\n      var av = path[i];\n      var bv = another[i];\n      if (av !== bv) {\n        break;\n      }\n      common.push(av);\n    }\n    return common;\n  },\n  compare(path, another) {\n    var min = Math.min(path.length, another.length);\n    for (var i = 0; i < min; i++) {\n      if (path[i] < another[i]) return -1;\n      if (path[i] > another[i]) return 1;\n    }\n    return 0;\n  },\n  endsAfter(path, another) {\n    var i = path.length - 1;\n    var as = path.slice(0, i);\n    var bs = another.slice(0, i);\n    var av = path[i];\n    var bv = another[i];\n    return Path.equals(as, bs) && av > bv;\n  },\n  endsAt(path, another) {\n    var i = path.length;\n    var as = path.slice(0, i);\n    var bs = another.slice(0, i);\n    return Path.equals(as, bs);\n  },\n  endsBefore(path, another) {\n    var i = path.length - 1;\n    var as = path.slice(0, i);\n    var bs = another.slice(0, i);\n    var av = path[i];\n    var bv = another[i];\n    return Path.equals(as, bs) && av < bv;\n  },\n  equals(path, another) {\n    return path.length === another.length && path.every((n, i) => n === another[i]);\n  },\n  hasPrevious(path) {\n    return path[path.length - 1] > 0;\n  },\n  isAfter(path, another) {\n    return Path.compare(path, another) === 1;\n  },\n  isAncestor(path, another) {\n    return path.length < another.length && Path.compare(path, another) === 0;\n  },\n  isBefore(path, another) {\n    return Path.compare(path, another) === -1;\n  },\n  isChild(path, another) {\n    return path.length === another.length + 1 && Path.compare(path, another) === 0;\n  },\n  isCommon(path, another) {\n    return path.length <= another.length && Path.compare(path, another) === 0;\n  },\n  isDescendant(path, another) {\n    return path.length > another.length && Path.compare(path, another) === 0;\n  },\n  isParent(path, another) {\n    return path.length + 1 === another.length && Path.compare(path, another) === 0;\n  },\n  isPath(value) {\n    return Array.isArray(value) && (value.length === 0 || typeof value[0] === 'number');\n  },\n  isSibling(path, another) {\n    if (path.length !== another.length) {\n      return false;\n    }\n    var as = path.slice(0, -1);\n    var bs = another.slice(0, -1);\n    var al = path[path.length - 1];\n    var bl = another[another.length - 1];\n    return al !== bl && Path.equals(as, bs);\n  },\n  levels(path) {\n    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    var {\n      reverse = false\n    } = options;\n    var list = [];\n    for (var i = 0; i <= path.length; i++) {\n      list.push(path.slice(0, i));\n    }\n    if (reverse) {\n      list.reverse();\n    }\n    return list;\n  },\n  next(path) {\n    if (path.length === 0) {\n      throw new Error(\"Cannot get the next path of a root path [\".concat(path, \"], because it has no next index.\"));\n    }\n    var last = path[path.length - 1];\n    return path.slice(0, -1).concat(last + 1);\n  },\n  operationCanTransformPath(operation) {\n    switch (operation.type) {\n      case 'insert_node':\n      case 'remove_node':\n      case 'merge_node':\n      case 'split_node':\n      case 'move_node':\n        return true;\n      default:\n        return false;\n    }\n  },\n  parent(path) {\n    if (path.length === 0) {\n      throw new Error(\"Cannot get the parent path of the root path [\".concat(path, \"].\"));\n    }\n    return path.slice(0, -1);\n  },\n  previous(path) {\n    if (path.length === 0) {\n      throw new Error(\"Cannot get the previous path of a root path [\".concat(path, \"], because it has no previous index.\"));\n    }\n    var last = path[path.length - 1];\n    if (last <= 0) {\n      throw new Error(\"Cannot get the previous path of a first child path [\".concat(path, \"] because it would result in a negative index.\"));\n    }\n    return path.slice(0, -1).concat(last - 1);\n  },\n  relative(path, ancestor) {\n    if (!Path.isAncestor(ancestor, path) && !Path.equals(path, ancestor)) {\n      throw new Error(\"Cannot get the relative path of [\".concat(path, \"] inside ancestor [\").concat(ancestor, \"], because it is not above or equal to the path.\"));\n    }\n    return path.slice(ancestor.length);\n  },\n  transform(path, operation) {\n    var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n    if (!path) return null;\n    // PERF: use destructing instead of immer\n    var p = [...path];\n    var {\n      affinity = 'forward'\n    } = options;\n    // PERF: Exit early if the operation is guaranteed not to have an effect.\n    if (path.length === 0) {\n      return p;\n    }\n    switch (operation.type) {\n      case 'insert_node':\n        {\n          var {\n            path: op\n          } = operation;\n          if (Path.equals(op, p) || Path.endsBefore(op, p) || Path.isAncestor(op, p)) {\n            p[op.length - 1] += 1;\n          }\n          break;\n        }\n      case 'remove_node':\n        {\n          var {\n            path: _op\n          } = operation;\n          if (Path.equals(_op, p) || Path.isAncestor(_op, p)) {\n            return null;\n          } else if (Path.endsBefore(_op, p)) {\n            p[_op.length - 1] -= 1;\n          }\n          break;\n        }\n      case 'merge_node':\n        {\n          var {\n            path: _op2,\n            position\n          } = operation;\n          if (Path.equals(_op2, p) || Path.endsBefore(_op2, p)) {\n            p[_op2.length - 1] -= 1;\n          } else if (Path.isAncestor(_op2, p)) {\n            p[_op2.length - 1] -= 1;\n            p[_op2.length] += position;\n          }\n          break;\n        }\n      case 'split_node':\n        {\n          var {\n            path: _op3,\n            position: _position\n          } = operation;\n          if (Path.equals(_op3, p)) {\n            if (affinity === 'forward') {\n              p[p.length - 1] += 1;\n            } else if (affinity === 'backward') ; else {\n              return null;\n            }\n          } else if (Path.endsBefore(_op3, p)) {\n            p[_op3.length - 1] += 1;\n          } else if (Path.isAncestor(_op3, p) && path[_op3.length] >= _position) {\n            p[_op3.length - 1] += 1;\n            p[_op3.length] -= _position;\n          }\n          break;\n        }\n      case 'move_node':\n        {\n          var {\n            path: _op4,\n            newPath: onp\n          } = operation;\n          // If the old and new path are the same, it's a no-op.\n          if (Path.equals(_op4, onp)) {\n            return p;\n          }\n          if (Path.isAncestor(_op4, p) || Path.equals(_op4, p)) {\n            var copy = onp.slice();\n            if (Path.endsBefore(_op4, onp) && _op4.length < onp.length) {\n              copy[_op4.length - 1] -= 1;\n            }\n            return copy.concat(p.slice(_op4.length));\n          } else if (Path.isSibling(_op4, onp) && (Path.isAncestor(onp, p) || Path.equals(onp, p))) {\n            if (Path.endsBefore(_op4, p)) {\n              p[_op4.length - 1] -= 1;\n            } else {\n              p[_op4.length - 1] += 1;\n            }\n          } else if (Path.endsBefore(onp, p) || Path.equals(onp, p) || Path.isAncestor(onp, p)) {\n            if (Path.endsBefore(_op4, p)) {\n              p[_op4.length - 1] -= 1;\n            }\n            p[onp.length - 1] += 1;\n          } else if (Path.endsBefore(_op4, p)) {\n            if (Path.equals(onp, p)) {\n              p[onp.length - 1] += 1;\n            }\n            p[_op4.length - 1] -= 1;\n          }\n          break;\n        }\n    }\n    return p;\n  }\n};\n\nfunction _typeof(o) {\n  \"@babel/helpers - typeof\";\n\n  return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) {\n    return typeof o;\n  } : function (o) {\n    return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o;\n  }, _typeof(o);\n}\n\nfunction _toPrimitive(input, hint) {\n  if (_typeof(input) !== \"object\" || input === null) return input;\n  var prim = input[Symbol.toPrimitive];\n  if (prim !== undefined) {\n    var res = prim.call(input, hint || \"default\");\n    if (_typeof(res) !== \"object\") return res;\n    throw new TypeError(\"@@toPrimitive must return a primitive value.\");\n  }\n  return (hint === \"string\" ? String : Number)(input);\n}\n\nfunction _toPropertyKey(arg) {\n  var key = _toPrimitive(arg, \"string\");\n  return _typeof(key) === \"symbol\" ? key : String(key);\n}\n\nfunction _defineProperty(obj, key, value) {\n  key = _toPropertyKey(key);\n  if (key in obj) {\n    Object.defineProperty(obj, key, {\n      value: value,\n      enumerable: true,\n      configurable: true,\n      writable: true\n    });\n  } else {\n    obj[key] = value;\n  }\n  return obj;\n}\n\nfunction ownKeys$e(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread$e(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$e(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$e(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nvar applyToDraft = (editor, selection, op) => {\n  switch (op.type) {\n    case 'insert_node':\n      {\n        var {\n          path,\n          node\n        } = op;\n        var parent = Node.parent(editor, path);\n        var index = path[path.length - 1];\n        if (index > parent.children.length) {\n          throw new Error(\"Cannot apply an \\\"insert_node\\\" operation at path [\".concat(path, \"] because the destination is past the end of the node.\"));\n        }\n        parent.children.splice(index, 0, node);\n        if (selection) {\n          for (var [point, key] of Range.points(selection)) {\n            selection[key] = Point.transform(point, op);\n          }\n        }\n        break;\n      }\n    case 'insert_text':\n      {\n        var {\n          path: _path,\n          offset,\n          text\n        } = op;\n        if (text.length === 0) break;\n        var _node = Node.leaf(editor, _path);\n        var before = _node.text.slice(0, offset);\n        var after = _node.text.slice(offset);\n        _node.text = before + text + after;\n        if (selection) {\n          for (var [_point, _key] of Range.points(selection)) {\n            selection[_key] = Point.transform(_point, op);\n          }\n        }\n        break;\n      }\n    case 'merge_node':\n      {\n        var {\n          path: _path2\n        } = op;\n        var _node2 = Node.get(editor, _path2);\n        var prevPath = Path.previous(_path2);\n        var prev = Node.get(editor, prevPath);\n        var _parent = Node.parent(editor, _path2);\n        var _index = _path2[_path2.length - 1];\n        if (Text.isText(_node2) && Text.isText(prev)) {\n          prev.text += _node2.text;\n        } else if (!Text.isText(_node2) && !Text.isText(prev)) {\n          prev.children.push(..._node2.children);\n        } else {\n          throw new Error(\"Cannot apply a \\\"merge_node\\\" operation at path [\".concat(_path2, \"] to nodes of different interfaces: \").concat(Scrubber.stringify(_node2), \" \").concat(Scrubber.stringify(prev)));\n        }\n        _parent.children.splice(_index, 1);\n        if (selection) {\n          for (var [_point2, _key2] of Range.points(selection)) {\n            selection[_key2] = Point.transform(_point2, op);\n          }\n        }\n        break;\n      }\n    case 'move_node':\n      {\n        var {\n          path: _path3,\n          newPath\n        } = op;\n        if (Path.isAncestor(_path3, newPath)) {\n          throw new Error(\"Cannot move a path [\".concat(_path3, \"] to new path [\").concat(newPath, \"] because the destination is inside itself.\"));\n        }\n        var _node3 = Node.get(editor, _path3);\n        var _parent2 = Node.parent(editor, _path3);\n        var _index2 = _path3[_path3.length - 1];\n        // This is tricky, but since the `path` and `newPath` both refer to\n        // the same snapshot in time, there's a mismatch. After either\n        // removing the original position, the second step's path can be out\n        // of date. So instead of using the `op.newPath` directly, we\n        // transform `op.path` to ascertain what the `newPath` would be after\n        // the operation was applied.\n        _parent2.children.splice(_index2, 1);\n        var truePath = Path.transform(_path3, op);\n        var newParent = Node.get(editor, Path.parent(truePath));\n        var newIndex = truePath[truePath.length - 1];\n        newParent.children.splice(newIndex, 0, _node3);\n        if (selection) {\n          for (var [_point3, _key3] of Range.points(selection)) {\n            selection[_key3] = Point.transform(_point3, op);\n          }\n        }\n        break;\n      }\n    case 'remove_node':\n      {\n        var {\n          path: _path4\n        } = op;\n        var _index3 = _path4[_path4.length - 1];\n        var _parent3 = Node.parent(editor, _path4);\n        _parent3.children.splice(_index3, 1);\n        // Transform all the points in the value, but if the point was in the\n        // node that was removed we need to update the range or remove it.\n        if (selection) {\n          for (var [_point4, _key4] of Range.points(selection)) {\n            var result = Point.transform(_point4, op);\n            if (selection != null && result != null) {\n              selection[_key4] = result;\n            } else {\n              var _prev = void 0;\n              var next = void 0;\n              for (var [n, p] of Node.texts(editor)) {\n                if (Path.compare(p, _path4) === -1) {\n                  _prev = [n, p];\n                } else {\n                  next = [n, p];\n                  break;\n                }\n              }\n              var preferNext = false;\n              if (_prev && next) {\n                if (Path.equals(next[1], _path4)) {\n                  preferNext = !Path.hasPrevious(next[1]);\n                } else {\n                  preferNext = Path.common(_prev[1], _path4).length < Path.common(next[1], _path4).length;\n                }\n              }\n              if (_prev && !preferNext) {\n                _point4.path = _prev[1];\n                _point4.offset = _prev[0].text.length;\n              } else if (next) {\n                _point4.path = next[1];\n                _point4.offset = 0;\n              } else {\n                selection = null;\n              }\n            }\n          }\n        }\n        break;\n      }\n    case 'remove_text':\n      {\n        var {\n          path: _path5,\n          offset: _offset,\n          text: _text\n        } = op;\n        if (_text.length === 0) break;\n        var _node4 = Node.leaf(editor, _path5);\n        var _before = _node4.text.slice(0, _offset);\n        var _after = _node4.text.slice(_offset + _text.length);\n        _node4.text = _before + _after;\n        if (selection) {\n          for (var [_point5, _key5] of Range.points(selection)) {\n            selection[_key5] = Point.transform(_point5, op);\n          }\n        }\n        break;\n      }\n    case 'set_node':\n      {\n        var {\n          path: _path6,\n          properties,\n          newProperties\n        } = op;\n        if (_path6.length === 0) {\n          throw new Error(\"Cannot set properties on the root node!\");\n        }\n        var _node5 = Node.get(editor, _path6);\n        for (var _key6 in newProperties) {\n          if (_key6 === 'children' || _key6 === 'text') {\n            throw new Error(\"Cannot set the \\\"\".concat(_key6, \"\\\" property of nodes!\"));\n          }\n          var value = newProperties[_key6];\n          if (value == null) {\n            delete _node5[_key6];\n          } else {\n            _node5[_key6] = value;\n          }\n        }\n        // properties that were previously defined, but are now missing, must be deleted\n        for (var _key7 in properties) {\n          if (!newProperties.hasOwnProperty(_key7)) {\n            delete _node5[_key7];\n          }\n        }\n        break;\n      }\n    case 'set_selection':\n      {\n        var {\n          newProperties: _newProperties\n        } = op;\n        if (_newProperties == null) {\n          selection = _newProperties;\n        } else {\n          if (selection == null) {\n            if (!Range.isRange(_newProperties)) {\n              throw new Error(\"Cannot apply an incomplete \\\"set_selection\\\" operation properties \".concat(Scrubber.stringify(_newProperties), \" when there is no current selection.\"));\n            }\n            selection = _objectSpread$e({}, _newProperties);\n          }\n          for (var _key8 in _newProperties) {\n            var _value = _newProperties[_key8];\n            if (_value == null) {\n              if (_key8 === 'anchor' || _key8 === 'focus') {\n                throw new Error(\"Cannot remove the \\\"\".concat(_key8, \"\\\" selection property\"));\n              }\n              delete selection[_key8];\n            } else {\n              selection[_key8] = _value;\n            }\n          }\n        }\n        break;\n      }\n    case 'split_node':\n      {\n        var {\n          path: _path7,\n          position,\n          properties: _properties\n        } = op;\n        if (_path7.length === 0) {\n          throw new Error(\"Cannot apply a \\\"split_node\\\" operation at path [\".concat(_path7, \"] because the root node cannot be split.\"));\n        }\n        var _node6 = Node.get(editor, _path7);\n        var _parent4 = Node.parent(editor, _path7);\n        var _index4 = _path7[_path7.length - 1];\n        var newNode;\n        if (Text.isText(_node6)) {\n          var _before2 = _node6.text.slice(0, position);\n          var _after2 = _node6.text.slice(position);\n          _node6.text = _before2;\n          newNode = _objectSpread$e(_objectSpread$e({}, _properties), {}, {\n            text: _after2\n          });\n        } else {\n          var _before3 = _node6.children.slice(0, position);\n          var _after3 = _node6.children.slice(position);\n          _node6.children = _before3;\n          newNode = _objectSpread$e(_objectSpread$e({}, _properties), {}, {\n            children: _after3\n          });\n        }\n        _parent4.children.splice(_index4 + 1, 0, newNode);\n        if (selection) {\n          for (var [_point6, _key9] of Range.points(selection)) {\n            selection[_key9] = Point.transform(_point6, op);\n          }\n        }\n        break;\n      }\n  }\n  return selection;\n};\n// eslint-disable-next-line no-redeclare\nvar GeneralTransforms = {\n  transform(editor, op) {\n    editor.children = createDraft(editor.children);\n    var selection = editor.selection && createDraft(editor.selection);\n    try {\n      selection = applyToDraft(editor, selection, op);\n    } finally {\n      editor.children = finishDraft(editor.children);\n      if (selection) {\n        editor.selection = isDraft(selection) ? finishDraft(selection) : selection;\n      } else {\n        editor.selection = null;\n      }\n    }\n  }\n};\n\n// eslint-disable-next-line no-redeclare\nvar NodeTransforms = {\n  insertNodes(editor, nodes, options) {\n    editor.insertNodes(nodes, options);\n  },\n  liftNodes(editor, options) {\n    editor.liftNodes(options);\n  },\n  mergeNodes(editor, options) {\n    editor.mergeNodes(options);\n  },\n  moveNodes(editor, options) {\n    editor.moveNodes(options);\n  },\n  removeNodes(editor, options) {\n    editor.removeNodes(options);\n  },\n  setNodes(editor, props, options) {\n    editor.setNodes(props, options);\n  },\n  splitNodes(editor, options) {\n    editor.splitNodes(options);\n  },\n  unsetNodes(editor, props, options) {\n    editor.unsetNodes(props, options);\n  },\n  unwrapNodes(editor, options) {\n    editor.unwrapNodes(options);\n  },\n  wrapNodes(editor, element, options) {\n    editor.wrapNodes(element, options);\n  }\n};\n\n// eslint-disable-next-line no-redeclare\nvar SelectionTransforms = {\n  collapse(editor, options) {\n    editor.collapse(options);\n  },\n  deselect(editor) {\n    editor.deselect();\n  },\n  move(editor, options) {\n    editor.move(options);\n  },\n  select(editor, target) {\n    editor.select(target);\n  },\n  setPoint(editor, props, options) {\n    editor.setPoint(props, options);\n  },\n  setSelection(editor, props) {\n    editor.setSelection(props);\n  }\n};\n\n/*\n  Custom deep equal comparison for Slate nodes.\n\n  We don't need general purpose deep equality;\n  Slate only supports plain values, Arrays, and nested objects.\n  Complex values nested inside Arrays are not supported.\n\n  Slate objects are designed to be serialised, so\n  missing keys are deliberately normalised to undefined.\n */\nvar isDeepEqual = (node, another) => {\n  for (var key in node) {\n    var a = node[key];\n    var b = another[key];\n    if (isPlainObject(a) && isPlainObject(b)) {\n      if (!isDeepEqual(a, b)) return false;\n    } else if (Array.isArray(a) && Array.isArray(b)) {\n      if (a.length !== b.length) return false;\n      for (var i = 0; i < a.length; i++) {\n        if (a[i] !== b[i]) return false;\n      }\n    } else if (a !== b) {\n      return false;\n    }\n  }\n  /*\n    Deep object equality is only necessary in one direction; in the reverse direction\n    we are only looking for keys that are missing.\n    As above, undefined keys are normalised to missing.\n  */\n  for (var _key in another) {\n    if (node[_key] === undefined && another[_key] !== undefined) {\n      return false;\n    }\n  }\n  return true;\n};\n\nfunction _objectWithoutPropertiesLoose(source, excluded) {\n  if (source == null) return {};\n  var target = {};\n  var sourceKeys = Object.keys(source);\n  var key, i;\n  for (i = 0; i < sourceKeys.length; i++) {\n    key = sourceKeys[i];\n    if (excluded.indexOf(key) >= 0) continue;\n    target[key] = source[key];\n  }\n  return target;\n}\n\nfunction _objectWithoutProperties(source, excluded) {\n  if (source == null) return {};\n  var target = _objectWithoutPropertiesLoose(source, excluded);\n  var key, i;\n  if (Object.getOwnPropertySymbols) {\n    var sourceSymbolKeys = Object.getOwnPropertySymbols(source);\n    for (i = 0; i < sourceSymbolKeys.length; i++) {\n      key = sourceSymbolKeys[i];\n      if (excluded.indexOf(key) >= 0) continue;\n      if (!Object.prototype.propertyIsEnumerable.call(source, key)) continue;\n      target[key] = source[key];\n    }\n  }\n  return target;\n}\n\nvar _excluded$4 = [\"anchor\", \"focus\"];\nfunction ownKeys$d(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread$d(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$d(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$d(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\n// eslint-disable-next-line no-redeclare\nvar Range = {\n  edges(range) {\n    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    var {\n      reverse = false\n    } = options;\n    var {\n      anchor,\n      focus\n    } = range;\n    return Range.isBackward(range) === reverse ? [anchor, focus] : [focus, anchor];\n  },\n  end(range) {\n    var [, end] = Range.edges(range);\n    return end;\n  },\n  equals(range, another) {\n    return Point.equals(range.anchor, another.anchor) && Point.equals(range.focus, another.focus);\n  },\n  includes(range, target) {\n    if (Range.isRange(target)) {\n      if (Range.includes(range, target.anchor) || Range.includes(range, target.focus)) {\n        return true;\n      }\n      var [rs, re] = Range.edges(range);\n      var [ts, te] = Range.edges(target);\n      return Point.isBefore(rs, ts) && Point.isAfter(re, te);\n    }\n    var [start, end] = Range.edges(range);\n    var isAfterStart = false;\n    var isBeforeEnd = false;\n    if (Point.isPoint(target)) {\n      isAfterStart = Point.compare(target, start) >= 0;\n      isBeforeEnd = Point.compare(target, end) <= 0;\n    } else {\n      isAfterStart = Path.compare(target, start.path) >= 0;\n      isBeforeEnd = Path.compare(target, end.path) <= 0;\n    }\n    return isAfterStart && isBeforeEnd;\n  },\n  intersection(range, another) {\n    var rest = _objectWithoutProperties(range, _excluded$4);\n    var [s1, e1] = Range.edges(range);\n    var [s2, e2] = Range.edges(another);\n    var start = Point.isBefore(s1, s2) ? s2 : s1;\n    var end = Point.isBefore(e1, e2) ? e1 : e2;\n    if (Point.isBefore(end, start)) {\n      return null;\n    } else {\n      return _objectSpread$d({\n        anchor: start,\n        focus: end\n      }, rest);\n    }\n  },\n  isBackward(range) {\n    var {\n      anchor,\n      focus\n    } = range;\n    return Point.isAfter(anchor, focus);\n  },\n  isCollapsed(range) {\n    var {\n      anchor,\n      focus\n    } = range;\n    return Point.equals(anchor, focus);\n  },\n  isExpanded(range) {\n    return !Range.isCollapsed(range);\n  },\n  isForward(range) {\n    return !Range.isBackward(range);\n  },\n  isRange(value) {\n    return isPlainObject(value) && Point.isPoint(value.anchor) && Point.isPoint(value.focus);\n  },\n  *points(range) {\n    yield [range.anchor, 'anchor'];\n    yield [range.focus, 'focus'];\n  },\n  start(range) {\n    var [start] = Range.edges(range);\n    return start;\n  },\n  transform(range, op) {\n    var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n    return produce(range, r => {\n      if (r === null) {\n        return null;\n      }\n      var {\n        affinity = 'inward'\n      } = options;\n      var affinityAnchor;\n      var affinityFocus;\n      if (affinity === 'inward') {\n        // If the range is collapsed, make sure to use the same affinity to\n        // avoid the two points passing each other and expanding in the opposite\n        // direction\n        var isCollapsed = Range.isCollapsed(r);\n        if (Range.isForward(r)) {\n          affinityAnchor = 'forward';\n          affinityFocus = isCollapsed ? affinityAnchor : 'backward';\n        } else {\n          affinityAnchor = 'backward';\n          affinityFocus = isCollapsed ? affinityAnchor : 'forward';\n        }\n      } else if (affinity === 'outward') {\n        if (Range.isForward(r)) {\n          affinityAnchor = 'backward';\n          affinityFocus = 'forward';\n        } else {\n          affinityAnchor = 'forward';\n          affinityFocus = 'backward';\n        }\n      } else {\n        affinityAnchor = affinity;\n        affinityFocus = affinity;\n      }\n      var anchor = Point.transform(r.anchor, op, {\n        affinity: affinityAnchor\n      });\n      var focus = Point.transform(r.focus, op, {\n        affinity: affinityFocus\n      });\n      if (!anchor || !focus) {\n        return null;\n      }\n      r.anchor = anchor;\n      r.focus = focus;\n    });\n  }\n};\n\n/**\n * Shared the function with isElementType utility\n */\nvar isElement = value => {\n  return isPlainObject(value) && Node.isNodeList(value.children) && !Editor.isEditor(value);\n};\n// eslint-disable-next-line no-redeclare\nvar Element = {\n  isAncestor(value) {\n    return isPlainObject(value) && Node.isNodeList(value.children);\n  },\n  isElement,\n  isElementList(value) {\n    return Array.isArray(value) && value.every(val => Element.isElement(val));\n  },\n  isElementProps(props) {\n    return props.children !== undefined;\n  },\n  isElementType: function isElementType(value, elementVal) {\n    var elementKey = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'type';\n    return isElement(value) && value[elementKey] === elementVal;\n  },\n  matches(element, props) {\n    for (var key in props) {\n      if (key === 'children') {\n        continue;\n      }\n      if (element[key] !== props[key]) {\n        return false;\n      }\n    }\n    return true;\n  }\n};\n\nvar _excluded$3 = [\"children\"],\n  _excluded2$3 = [\"text\"];\nvar IS_NODE_LIST_CACHE = new WeakMap();\n// eslint-disable-next-line no-redeclare\nvar Node = {\n  ancestor(root, path) {\n    var node = Node.get(root, path);\n    if (Text.isText(node)) {\n      throw new Error(\"Cannot get the ancestor node at path [\".concat(path, \"] because it refers to a text node instead: \").concat(Scrubber.stringify(node)));\n    }\n    return node;\n  },\n  ancestors(root, path) {\n    var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n    return function* () {\n      for (var p of Path.ancestors(path, options)) {\n        var n = Node.ancestor(root, p);\n        var entry = [n, p];\n        yield entry;\n      }\n    }();\n  },\n  child(root, index) {\n    if (Text.isText(root)) {\n      throw new Error(\"Cannot get the child of a text node: \".concat(Scrubber.stringify(root)));\n    }\n    var c = root.children[index];\n    if (c == null) {\n      throw new Error(\"Cannot get child at index `\".concat(index, \"` in node: \").concat(Scrubber.stringify(root)));\n    }\n    return c;\n  },\n  children(root, path) {\n    var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n    return function* () {\n      var {\n        reverse = false\n      } = options;\n      var ancestor = Node.ancestor(root, path);\n      var {\n        children\n      } = ancestor;\n      var index = reverse ? children.length - 1 : 0;\n      while (reverse ? index >= 0 : index < children.length) {\n        var child = Node.child(ancestor, index);\n        var childPath = path.concat(index);\n        yield [child, childPath];\n        index = reverse ? index - 1 : index + 1;\n      }\n    }();\n  },\n  common(root, path, another) {\n    var p = Path.common(path, another);\n    var n = Node.get(root, p);\n    return [n, p];\n  },\n  descendant(root, path) {\n    var node = Node.get(root, path);\n    if (Editor.isEditor(node)) {\n      throw new Error(\"Cannot get the descendant node at path [\".concat(path, \"] because it refers to the root editor node instead: \").concat(Scrubber.stringify(node)));\n    }\n    return node;\n  },\n  descendants(root) {\n    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    return function* () {\n      for (var [node, path] of Node.nodes(root, options)) {\n        if (path.length !== 0) {\n          // NOTE: we have to coerce here because checking the path's length does\n          // guarantee that `node` is not a `Editor`, but TypeScript doesn't know.\n          yield [node, path];\n        }\n      }\n    }();\n  },\n  elements(root) {\n    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    return function* () {\n      for (var [node, path] of Node.nodes(root, options)) {\n        if (Element.isElement(node)) {\n          yield [node, path];\n        }\n      }\n    }();\n  },\n  extractProps(node) {\n    if (Element.isAncestor(node)) {\n      var properties = _objectWithoutProperties(node, _excluded$3);\n      return properties;\n    } else {\n      var properties = _objectWithoutProperties(node, _excluded2$3);\n      return properties;\n    }\n  },\n  first(root, path) {\n    var p = path.slice();\n    var n = Node.get(root, p);\n    while (n) {\n      if (Text.isText(n) || n.children.length === 0) {\n        break;\n      } else {\n        n = n.children[0];\n        p.push(0);\n      }\n    }\n    return [n, p];\n  },\n  fragment(root, range) {\n    if (Text.isText(root)) {\n      throw new Error(\"Cannot get a fragment starting from a root text node: \".concat(Scrubber.stringify(root)));\n    }\n    var newRoot = produce({\n      children: root.children\n    }, r => {\n      var [start, end] = Range.edges(range);\n      var nodeEntries = Node.nodes(r, {\n        reverse: true,\n        pass: _ref => {\n          var [, path] = _ref;\n          return !Range.includes(range, path);\n        }\n      });\n      for (var [, path] of nodeEntries) {\n        if (!Range.includes(range, path)) {\n          var parent = Node.parent(r, path);\n          var index = path[path.length - 1];\n          parent.children.splice(index, 1);\n        }\n        if (Path.equals(path, end.path)) {\n          var leaf = Node.leaf(r, path);\n          leaf.text = leaf.text.slice(0, end.offset);\n        }\n        if (Path.equals(path, start.path)) {\n          var _leaf = Node.leaf(r, path);\n          _leaf.text = _leaf.text.slice(start.offset);\n        }\n      }\n      if (Editor.isEditor(r)) {\n        r.selection = null;\n      }\n    });\n    return newRoot.children;\n  },\n  get(root, path) {\n    var node = root;\n    for (var i = 0; i < path.length; i++) {\n      var p = path[i];\n      if (Text.isText(node) || !node.children[p]) {\n        throw new Error(\"Cannot find a descendant at path [\".concat(path, \"] in node: \").concat(Scrubber.stringify(root)));\n      }\n      node = node.children[p];\n    }\n    return node;\n  },\n  has(root, path) {\n    var node = root;\n    for (var i = 0; i < path.length; i++) {\n      var p = path[i];\n      if (Text.isText(node) || !node.children[p]) {\n        return false;\n      }\n      node = node.children[p];\n    }\n    return true;\n  },\n  isNode(value) {\n    return Text.isText(value) || Element.isElement(value) || Editor.isEditor(value);\n  },\n  isNodeList(value) {\n    if (!Array.isArray(value)) {\n      return false;\n    }\n    var cachedResult = IS_NODE_LIST_CACHE.get(value);\n    if (cachedResult !== undefined) {\n      return cachedResult;\n    }\n    var isNodeList = value.every(val => Node.isNode(val));\n    IS_NODE_LIST_CACHE.set(value, isNodeList);\n    return isNodeList;\n  },\n  last(root, path) {\n    var p = path.slice();\n    var n = Node.get(root, p);\n    while (n) {\n      if (Text.isText(n) || n.children.length === 0) {\n        break;\n      } else {\n        var i = n.children.length - 1;\n        n = n.children[i];\n        p.push(i);\n      }\n    }\n    return [n, p];\n  },\n  leaf(root, path) {\n    var node = Node.get(root, path);\n    if (!Text.isText(node)) {\n      throw new Error(\"Cannot get the leaf node at path [\".concat(path, \"] because it refers to a non-leaf node: \").concat(Scrubber.stringify(node)));\n    }\n    return node;\n  },\n  levels(root, path) {\n    var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n    return function* () {\n      for (var p of Path.levels(path, options)) {\n        var n = Node.get(root, p);\n        yield [n, p];\n      }\n    }();\n  },\n  matches(node, props) {\n    return Element.isElement(node) && Element.isElementProps(props) && Element.matches(node, props) || Text.isText(node) && Text.isTextProps(props) && Text.matches(node, props);\n  },\n  nodes(root) {\n    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    return function* () {\n      var {\n        pass,\n        reverse = false\n      } = options;\n      var {\n        from = [],\n        to\n      } = options;\n      var visited = new Set();\n      var p = [];\n      var n = root;\n      while (true) {\n        if (to && (reverse ? Path.isBefore(p, to) : Path.isAfter(p, to))) {\n          break;\n        }\n        if (!visited.has(n)) {\n          yield [n, p];\n        }\n        // If we're allowed to go downward and we haven't descended yet, do.\n        if (!visited.has(n) && !Text.isText(n) && n.children.length !== 0 && (pass == null || pass([n, p]) === false)) {\n          visited.add(n);\n          var nextIndex = reverse ? n.children.length - 1 : 0;\n          if (Path.isAncestor(p, from)) {\n            nextIndex = from[p.length];\n          }\n          p = p.concat(nextIndex);\n          n = Node.get(root, p);\n          continue;\n        }\n        // If we're at the root and we can't go down, we're done.\n        if (p.length === 0) {\n          break;\n        }\n        // If we're going forward...\n        if (!reverse) {\n          var newPath = Path.next(p);\n          if (Node.has(root, newPath)) {\n            p = newPath;\n            n = Node.get(root, p);\n            continue;\n          }\n        }\n        // If we're going backward...\n        if (reverse && p[p.length - 1] !== 0) {\n          var _newPath = Path.previous(p);\n          p = _newPath;\n          n = Node.get(root, p);\n          continue;\n        }\n        // Otherwise we're going upward...\n        p = Path.parent(p);\n        n = Node.get(root, p);\n        visited.add(n);\n      }\n    }();\n  },\n  parent(root, path) {\n    var parentPath = Path.parent(path);\n    var p = Node.get(root, parentPath);\n    if (Text.isText(p)) {\n      throw new Error(\"Cannot get the parent of path [\".concat(path, \"] because it does not exist in the root.\"));\n    }\n    return p;\n  },\n  string(node) {\n    if (Text.isText(node)) {\n      return node.text;\n    } else {\n      return node.children.map(Node.string).join('');\n    }\n  },\n  texts(root) {\n    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    return function* () {\n      for (var [node, path] of Node.nodes(root, options)) {\n        if (Text.isText(node)) {\n          yield [node, path];\n        }\n      }\n    }();\n  }\n};\n\nfunction ownKeys$c(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread$c(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$c(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$c(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\n// eslint-disable-next-line no-redeclare\nvar Operation = {\n  isNodeOperation(value) {\n    return Operation.isOperation(value) && value.type.endsWith('_node');\n  },\n  isOperation(value) {\n    if (!isPlainObject(value)) {\n      return false;\n    }\n    switch (value.type) {\n      case 'insert_node':\n        return Path.isPath(value.path) && Node.isNode(value.node);\n      case 'insert_text':\n        return typeof value.offset === 'number' && typeof value.text === 'string' && Path.isPath(value.path);\n      case 'merge_node':\n        return typeof value.position === 'number' && Path.isPath(value.path) && isPlainObject(value.properties);\n      case 'move_node':\n        return Path.isPath(value.path) && Path.isPath(value.newPath);\n      case 'remove_node':\n        return Path.isPath(value.path) && Node.isNode(value.node);\n      case 'remove_text':\n        return typeof value.offset === 'number' && typeof value.text === 'string' && Path.isPath(value.path);\n      case 'set_node':\n        return Path.isPath(value.path) && isPlainObject(value.properties) && isPlainObject(value.newProperties);\n      case 'set_selection':\n        return value.properties === null && Range.isRange(value.newProperties) || value.newProperties === null && Range.isRange(value.properties) || isPlainObject(value.properties) && isPlainObject(value.newProperties);\n      case 'split_node':\n        return Path.isPath(value.path) && typeof value.position === 'number' && isPlainObject(value.properties);\n      default:\n        return false;\n    }\n  },\n  isOperationList(value) {\n    return Array.isArray(value) && value.every(val => Operation.isOperation(val));\n  },\n  isSelectionOperation(value) {\n    return Operation.isOperation(value) && value.type.endsWith('_selection');\n  },\n  isTextOperation(value) {\n    return Operation.isOperation(value) && value.type.endsWith('_text');\n  },\n  inverse(op) {\n    switch (op.type) {\n      case 'insert_node':\n        {\n          return _objectSpread$c(_objectSpread$c({}, op), {}, {\n            type: 'remove_node'\n          });\n        }\n      case 'insert_text':\n        {\n          return _objectSpread$c(_objectSpread$c({}, op), {}, {\n            type: 'remove_text'\n          });\n        }\n      case 'merge_node':\n        {\n          return _objectSpread$c(_objectSpread$c({}, op), {}, {\n            type: 'split_node',\n            path: Path.previous(op.path)\n          });\n        }\n      case 'move_node':\n        {\n          var {\n            newPath,\n            path\n          } = op;\n          // PERF: in this case the move operation is a no-op anyways.\n          if (Path.equals(newPath, path)) {\n            return op;\n          }\n          // If the move happens completely within a single parent the path and\n          // newPath are stable with respect to each other.\n          if (Path.isSibling(path, newPath)) {\n            return _objectSpread$c(_objectSpread$c({}, op), {}, {\n              path: newPath,\n              newPath: path\n            });\n          }\n          // If the move does not happen within a single parent it is possible\n          // for the move to impact the true path to the location where the node\n          // was removed from and where it was inserted. We have to adjust for this\n          // and find the original path. We can accomplish this (only in non-sibling)\n          // moves by looking at the impact of the move operation on the node\n          // after the original move path.\n          var inversePath = Path.transform(path, op);\n          var inverseNewPath = Path.transform(Path.next(path), op);\n          return _objectSpread$c(_objectSpread$c({}, op), {}, {\n            path: inversePath,\n            newPath: inverseNewPath\n          });\n        }\n      case 'remove_node':\n        {\n          return _objectSpread$c(_objectSpread$c({}, op), {}, {\n            type: 'insert_node'\n          });\n        }\n      case 'remove_text':\n        {\n          return _objectSpread$c(_objectSpread$c({}, op), {}, {\n            type: 'insert_text'\n          });\n        }\n      case 'set_node':\n        {\n          var {\n            properties,\n            newProperties\n          } = op;\n          return _objectSpread$c(_objectSpread$c({}, op), {}, {\n            properties: newProperties,\n            newProperties: properties\n          });\n        }\n      case 'set_selection':\n        {\n          var {\n            properties: _properties,\n            newProperties: _newProperties\n          } = op;\n          if (_properties == null) {\n            return _objectSpread$c(_objectSpread$c({}, op), {}, {\n              properties: _newProperties,\n              newProperties: null\n            });\n          } else if (_newProperties == null) {\n            return _objectSpread$c(_objectSpread$c({}, op), {}, {\n              properties: null,\n              newProperties: _properties\n            });\n          } else {\n            return _objectSpread$c(_objectSpread$c({}, op), {}, {\n              properties: _newProperties,\n              newProperties: _properties\n            });\n          }\n        }\n      case 'split_node':\n        {\n          return _objectSpread$c(_objectSpread$c({}, op), {}, {\n            type: 'merge_node',\n            path: Path.next(op.path)\n          });\n        }\n    }\n  }\n};\n\nvar IS_EDITOR_CACHE = new WeakMap();\nvar isEditor = value => {\n  var cachedIsEditor = IS_EDITOR_CACHE.get(value);\n  if (cachedIsEditor !== undefined) {\n    return cachedIsEditor;\n  }\n  if (!isPlainObject(value)) {\n    return false;\n  }\n  var isEditor = typeof value.addMark === 'function' && typeof value.apply === 'function' && typeof value.deleteFragment === 'function' && typeof value.insertBreak === 'function' && typeof value.insertSoftBreak === 'function' && typeof value.insertFragment === 'function' && typeof value.insertNode === 'function' && typeof value.insertText === 'function' && typeof value.isElementReadOnly === 'function' && typeof value.isInline === 'function' && typeof value.isSelectable === 'function' && typeof value.isVoid === 'function' && typeof value.normalizeNode === 'function' && typeof value.onChange === 'function' && typeof value.removeMark === 'function' && typeof value.getDirtyPaths === 'function' && (value.marks === null || isPlainObject(value.marks)) && (value.selection === null || Range.isRange(value.selection)) && Node.isNodeList(value.children) && Operation.isOperationList(value.operations);\n  IS_EDITOR_CACHE.set(value, isEditor);\n  return isEditor;\n};\n\n// eslint-disable-next-line no-redeclare\nvar Editor = {\n  above(editor, options) {\n    return editor.above(options);\n  },\n  addMark(editor, key, value) {\n    editor.addMark(key, value);\n  },\n  after(editor, at, options) {\n    return editor.after(at, options);\n  },\n  before(editor, at, options) {\n    return editor.before(at, options);\n  },\n  deleteBackward(editor) {\n    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    var {\n      unit = 'character'\n    } = options;\n    editor.deleteBackward(unit);\n  },\n  deleteForward(editor) {\n    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    var {\n      unit = 'character'\n    } = options;\n    editor.deleteForward(unit);\n  },\n  deleteFragment(editor, options) {\n    editor.deleteFragment(options);\n  },\n  edges(editor, at) {\n    return editor.edges(at);\n  },\n  elementReadOnly(editor) {\n    var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n    return editor.elementReadOnly(options);\n  },\n  end(editor, at) {\n    return editor.end(at);\n  },\n  first(editor, at) {\n    return editor.first(at);\n  },\n  fragment(editor, at) {\n    return editor.fragment(at);\n  },\n  hasBlocks(editor, element) {\n    return editor.hasBlocks(element);\n  },\n  hasInlines(editor, element) {\n    return editor.hasInlines(element);\n  },\n  hasPath(editor, path) {\n    return editor.hasPath(path);\n  },\n  hasTexts(editor, element) {\n    return editor.hasTexts(element);\n  },\n  insertBreak(editor) {\n    editor.insertBreak();\n  },\n  insertFragment(editor, fragment, options) {\n    editor.insertFragment(fragment, options);\n  },\n  insertNode(editor, node) {\n    editor.insertNode(node);\n  },\n  insertSoftBreak(editor) {\n    editor.insertSoftBreak();\n  },\n  insertText(editor, text) {\n    editor.insertText(text);\n  },\n  isBlock(editor, value) {\n    return editor.isBlock(value);\n  },\n  isEdge(editor, point, at) {\n    return editor.isEdge(point, at);\n  },\n  isEditor(value) {\n    return isEditor(value);\n  },\n  isElementReadOnly(editor, element) {\n    return editor.isElementReadOnly(element);\n  },\n  isEmpty(editor, element) {\n    return editor.isEmpty(element);\n  },\n  isEnd(editor, point, at) {\n    return editor.isEnd(point, at);\n  },\n  isInline(editor, value) {\n    return editor.isInline(value);\n  },\n  isNormalizing(editor) {\n    return editor.isNormalizing();\n  },\n  isSelectable(editor, value) {\n    return editor.isSelectable(value);\n  },\n  isStart(editor, point, at) {\n    return editor.isStart(point, at);\n  },\n  isVoid(editor, value) {\n    return editor.isVoid(value);\n  },\n  last(editor, at) {\n    return editor.last(at);\n  },\n  leaf(editor, at, options) {\n    return editor.leaf(at, options);\n  },\n  levels(editor, options) {\n    return editor.levels(options);\n  },\n  marks(editor) {\n    return editor.getMarks();\n  },\n  next(editor, options) {\n    return editor.next(options);\n  },\n  node(editor, at, options) {\n    return editor.node(at, options);\n  },\n  nodes(editor, options) {\n    return editor.nodes(options);\n  },\n  normalize(editor, options) {\n    editor.normalize(options);\n  },\n  parent(editor, at, options) {\n    return editor.parent(at, options);\n  },\n  path(editor, at, options) {\n    return editor.path(at, options);\n  },\n  pathRef(editor, path, options) {\n    return editor.pathRef(path, options);\n  },\n  pathRefs(editor) {\n    return editor.pathRefs();\n  },\n  point(editor, at, options) {\n    return editor.point(at, options);\n  },\n  pointRef(editor, point, options) {\n    return editor.pointRef(point, options);\n  },\n  pointRefs(editor) {\n    return editor.pointRefs();\n  },\n  positions(editor, options) {\n    return editor.positions(options);\n  },\n  previous(editor, options) {\n    return editor.previous(options);\n  },\n  range(editor, at, to) {\n    return editor.range(at, to);\n  },\n  rangeRef(editor, range, options) {\n    return editor.rangeRef(range, options);\n  },\n  rangeRefs(editor) {\n    return editor.rangeRefs();\n  },\n  removeMark(editor, key) {\n    editor.removeMark(key);\n  },\n  setNormalizing(editor, isNormalizing) {\n    editor.setNormalizing(isNormalizing);\n  },\n  start(editor, at) {\n    return editor.start(at);\n  },\n  string(editor, at, options) {\n    return editor.string(at, options);\n  },\n  unhangRange(editor, range, options) {\n    return editor.unhangRange(range, options);\n  },\n  void(editor, options) {\n    return editor.void(options);\n  },\n  withoutNormalizing(editor, fn) {\n    editor.withoutNormalizing(fn);\n  }\n};\n\n// eslint-disable-next-line no-redeclare\nvar Location = {\n  isLocation(value) {\n    return Path.isPath(value) || Point.isPoint(value) || Range.isRange(value);\n  }\n};\n// eslint-disable-next-line no-redeclare\nvar Span = {\n  isSpan(value) {\n    return Array.isArray(value) && value.length === 2 && value.every(Path.isPath);\n  }\n};\n\nfunction ownKeys$b(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread$b(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$b(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$b(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\n// eslint-disable-next-line no-redeclare\nvar Point = {\n  compare(point, another) {\n    var result = Path.compare(point.path, another.path);\n    if (result === 0) {\n      if (point.offset < another.offset) return -1;\n      if (point.offset > another.offset) return 1;\n      return 0;\n    }\n    return result;\n  },\n  isAfter(point, another) {\n    return Point.compare(point, another) === 1;\n  },\n  isBefore(point, another) {\n    return Point.compare(point, another) === -1;\n  },\n  equals(point, another) {\n    // PERF: ensure the offsets are equal first since they are cheaper to check.\n    return point.offset === another.offset && Path.equals(point.path, another.path);\n  },\n  isPoint(value) {\n    return isPlainObject(value) && typeof value.offset === 'number' && Path.isPath(value.path);\n  },\n  transform(point, op) {\n    var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n    return produce(point, p => {\n      if (p === null) {\n        return null;\n      }\n      var {\n        affinity = 'forward'\n      } = options;\n      var {\n        path,\n        offset\n      } = p;\n      switch (op.type) {\n        case 'insert_node':\n        case 'move_node':\n          {\n            p.path = Path.transform(path, op, options);\n            break;\n          }\n        case 'insert_text':\n          {\n            if (Path.equals(op.path, path) && (op.offset < offset || op.offset === offset && affinity === 'forward')) {\n              p.offset += op.text.length;\n            }\n            break;\n          }\n        case 'merge_node':\n          {\n            if (Path.equals(op.path, path)) {\n              p.offset += op.position;\n            }\n            p.path = Path.transform(path, op, options);\n            break;\n          }\n        case 'remove_text':\n          {\n            if (Path.equals(op.path, path) && op.offset <= offset) {\n              p.offset -= Math.min(offset - op.offset, op.text.length);\n            }\n            break;\n          }\n        case 'remove_node':\n          {\n            if (Path.equals(op.path, path) || Path.isAncestor(op.path, path)) {\n              return null;\n            }\n            p.path = Path.transform(path, op, options);\n            break;\n          }\n        case 'split_node':\n          {\n            if (Path.equals(op.path, path)) {\n              if (op.position === offset && affinity == null) {\n                return null;\n              } else if (op.position < offset || op.position === offset && affinity === 'forward') {\n                p.offset -= op.position;\n                p.path = Path.transform(path, op, _objectSpread$b(_objectSpread$b({}, options), {}, {\n                  affinity: 'forward'\n                }));\n              }\n            } else {\n              p.path = Path.transform(path, op, options);\n            }\n            break;\n          }\n      }\n    });\n  }\n};\n\nvar _scrubber = undefined;\n/**\n * This interface implements a stringify() function, which is used by Slate\n * internally when generating exceptions containing end user data. Developers\n * using Slate may call Scrubber.setScrubber() to alter the behavior of this\n * stringify() function.\n *\n * For example, to prevent the cleartext logging of 'text' fields within Nodes:\n *\n *    import { Scrubber } from 'slate';\n *    Scrubber.setScrubber((key, val) => {\n *      if (key === 'text') return '...scrubbed...'\n *      return val\n *    });\n *\n */\n// eslint-disable-next-line no-redeclare\nvar Scrubber = {\n  setScrubber(scrubber) {\n    _scrubber = scrubber;\n  },\n  stringify(value) {\n    return JSON.stringify(value, _scrubber);\n  }\n};\n\nvar _excluded$2 = [\"text\"],\n  _excluded2$2 = [\"anchor\", \"focus\"];\nfunction ownKeys$a(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread$a(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$a(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$a(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\n// eslint-disable-next-line no-redeclare\nvar Text = {\n  equals(text, another) {\n    var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n    var {\n      loose = false\n    } = options;\n    function omitText(obj) {\n      var rest = _objectWithoutProperties(obj, _excluded$2);\n      return rest;\n    }\n    return isDeepEqual(loose ? omitText(text) : text, loose ? omitText(another) : another);\n  },\n  isText(value) {\n    return isPlainObject(value) && typeof value.text === 'string';\n  },\n  isTextList(value) {\n    return Array.isArray(value) && value.every(val => Text.isText(val));\n  },\n  isTextProps(props) {\n    return props.text !== undefined;\n  },\n  matches(text, props) {\n    for (var key in props) {\n      if (key === 'text') {\n        continue;\n      }\n      if (!text.hasOwnProperty(key) || text[key] !== props[key]) {\n        return false;\n      }\n    }\n    return true;\n  },\n  decorations(node, decorations) {\n    var leaves = [_objectSpread$a({}, node)];\n    for (var dec of decorations) {\n      var rest = _objectWithoutProperties(dec, _excluded2$2);\n      var [start, end] = Range.edges(dec);\n      var next = [];\n      var leafEnd = 0;\n      var decorationStart = start.offset;\n      var decorationEnd = end.offset;\n      for (var leaf of leaves) {\n        var {\n          length\n        } = leaf.text;\n        var leafStart = leafEnd;\n        leafEnd += length;\n        // If the range encompasses the entire leaf, add the range.\n        if (decorationStart <= leafStart && leafEnd <= decorationEnd) {\n          Object.assign(leaf, rest);\n          next.push(leaf);\n          continue;\n        }\n        // If the range expanded and match the leaf, or starts after, or ends before it, continue.\n        if (decorationStart !== decorationEnd && (decorationStart === leafEnd || decorationEnd === leafStart) || decorationStart > leafEnd || decorationEnd < leafStart || decorationEnd === leafStart && leafStart !== 0) {\n          next.push(leaf);\n          continue;\n        }\n        // Otherwise we need to split the leaf, at the start, end, or both,\n        // and add the range to the middle intersecting section. Do the end\n        // split first since we don't need to update the offset that way.\n        var middle = leaf;\n        var before = void 0;\n        var after = void 0;\n        if (decorationEnd < leafEnd) {\n          var off = decorationEnd - leafStart;\n          after = _objectSpread$a(_objectSpread$a({}, middle), {}, {\n            text: middle.text.slice(off)\n          });\n          middle = _objectSpread$a(_objectSpread$a({}, middle), {}, {\n            text: middle.text.slice(0, off)\n          });\n        }\n        if (decorationStart > leafStart) {\n          var _off = decorationStart - leafStart;\n          before = _objectSpread$a(_objectSpread$a({}, middle), {}, {\n            text: middle.text.slice(0, _off)\n          });\n          middle = _objectSpread$a(_objectSpread$a({}, middle), {}, {\n            text: middle.text.slice(_off)\n          });\n        }\n        Object.assign(middle, rest);\n        if (before) {\n          next.push(before);\n        }\n        next.push(middle);\n        if (after) {\n          next.push(after);\n        }\n      }\n      leaves = next;\n    }\n    return leaves;\n  }\n};\n\n/**\n * Get the default location to insert content into the editor.\n * By default, use the selection as the target location. But if there is\n * no selection, insert at the end of the document since that is such a\n * common use case when inserting from a non-selected state.\n */\nvar getDefaultInsertLocation = editor => {\n  if (editor.selection) {\n    return editor.selection;\n  } else if (editor.children.length > 0) {\n    return Editor.end(editor, []);\n  } else {\n    return [0];\n  }\n};\n\nvar matchPath = (editor, path) => {\n  var [node] = Editor.node(editor, path);\n  return n => n === node;\n};\n\n// Character (grapheme cluster) boundaries are determined according to\n// the default grapheme cluster boundary specification, extended grapheme clusters variant[1].\n//\n// References:\n//\n// [1] https://www.unicode.org/reports/tr29/#Default_Grapheme_Cluster_Table\n// [2] https://www.unicode.org/Public/UCD/latest/ucd/auxiliary/GraphemeBreakProperty.txt\n// [3] https://www.unicode.org/Public/UCD/latest/ucd/auxiliary/GraphemeBreakTest.html\n// [4] https://www.unicode.org/Public/UCD/latest/ucd/auxiliary/GraphemeBreakTest.txt\n/**\n * Get the distance to the end of the first character in a string of text.\n */\nvar getCharacterDistance = function getCharacterDistance(str) {\n  var isRTL = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n  var isLTR = !isRTL;\n  var codepoints = isRTL ? codepointsIteratorRTL(str) : str;\n  var left = CodepointType.None;\n  var right = CodepointType.None;\n  var distance = 0;\n  // Evaluation of these conditions are deferred.\n  var gb11 = null; // Is GB11 applicable?\n  var gb12Or13 = null; // Is GB12 or GB13 applicable?\n  for (var char of codepoints) {\n    var code = char.codePointAt(0);\n    if (!code) break;\n    var type = getCodepointType(char, code);\n    [left, right] = isLTR ? [right, type] : [type, left];\n    if (intersects(left, CodepointType.ZWJ) && intersects(right, CodepointType.ExtPict)) {\n      if (isLTR) {\n        gb11 = endsWithEmojiZWJ(str.substring(0, distance));\n      } else {\n        gb11 = endsWithEmojiZWJ(str.substring(0, str.length - distance));\n      }\n      if (!gb11) break;\n    }\n    if (intersects(left, CodepointType.RI) && intersects(right, CodepointType.RI)) {\n      if (gb12Or13 !== null) {\n        gb12Or13 = !gb12Or13;\n      } else {\n        if (isLTR) {\n          gb12Or13 = true;\n        } else {\n          gb12Or13 = endsWithOddNumberOfRIs(str.substring(0, str.length - distance));\n        }\n      }\n      if (!gb12Or13) break;\n    }\n    if (left !== CodepointType.None && right !== CodepointType.None && isBoundaryPair(left, right)) {\n      break;\n    }\n    distance += char.length;\n  }\n  return distance || 1;\n};\nvar SPACE = /\\s/;\nvar PUNCTUATION = /[\\u002B\\u0021-\\u0023\\u0025-\\u002A\\u002C-\\u002F\\u003A\\u003B\\u003F\\u0040\\u005B-\\u005D\\u005F\\u007B\\u007D\\u00A1\\u00A7\\u00AB\\u00B6\\u00B7\\u00BB\\u00BF\\u037E\\u0387\\u055A-\\u055F\\u0589\\u058A\\u05BE\\u05C0\\u05C3\\u05C6\\u05F3\\u05F4\\u0609\\u060A\\u060C\\u060D\\u061B\\u061E\\u061F\\u066A-\\u066D\\u06D4\\u0700-\\u070D\\u07F7-\\u07F9\\u0830-\\u083E\\u085E\\u0964\\u0965\\u0970\\u0AF0\\u0DF4\\u0E4F\\u0E5A\\u0E5B\\u0F04-\\u0F12\\u0F14\\u0F3A-\\u0F3D\\u0F85\\u0FD0-\\u0FD4\\u0FD9\\u0FDA\\u104A-\\u104F\\u10FB\\u1360-\\u1368\\u1400\\u166D\\u166E\\u169B\\u169C\\u16EB-\\u16ED\\u1735\\u1736\\u17D4-\\u17D6\\u17D8-\\u17DA\\u1800-\\u180A\\u1944\\u1945\\u1A1E\\u1A1F\\u1AA0-\\u1AA6\\u1AA8-\\u1AAD\\u1B5A-\\u1B60\\u1BFC-\\u1BFF\\u1C3B-\\u1C3F\\u1C7E\\u1C7F\\u1CC0-\\u1CC7\\u1CD3\\u2010-\\u2027\\u2030-\\u2043\\u2045-\\u2051\\u2053-\\u205E\\u207D\\u207E\\u208D\\u208E\\u2329\\u232A\\u2768-\\u2775\\u27C5\\u27C6\\u27E6-\\u27EF\\u2983-\\u2998\\u29D8-\\u29DB\\u29FC\\u29FD\\u2CF9-\\u2CFC\\u2CFE\\u2CFF\\u2D70\\u2E00-\\u2E2E\\u2E30-\\u2E3B\\u3001-\\u3003\\u3008-\\u3011\\u3014-\\u301F\\u3030\\u303D\\u30A0\\u30FB\\uA4FE\\uA4FF\\uA60D-\\uA60F\\uA673\\uA67E\\uA6F2-\\uA6F7\\uA874-\\uA877\\uA8CE\\uA8CF\\uA8F8-\\uA8FA\\uA92E\\uA92F\\uA95F\\uA9C1-\\uA9CD\\uA9DE\\uA9DF\\uAA5C-\\uAA5F\\uAADE\\uAADF\\uAAF0\\uAAF1\\uABEB\\uFD3E\\uFD3F\\uFE10-\\uFE19\\uFE30-\\uFE52\\uFE54-\\uFE61\\uFE63\\uFE68\\uFE6A\\uFE6B\\uFF01-\\uFF03\\uFF05-\\uFF0A\\uFF0C-\\uFF0F\\uFF1A\\uFF1B\\uFF1F\\uFF20\\uFF3B-\\uFF3D\\uFF3F\\uFF5B\\uFF5D\\uFF5F-\\uFF65]/;\nvar CHAMELEON = /['\\u2018\\u2019]/;\n/**\n * Get the distance to the end of the first word in a string of text.\n */\nvar getWordDistance = function getWordDistance(text) {\n  var isRTL = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;\n  var dist = 0;\n  var started = false;\n  while (text.length > 0) {\n    var charDist = getCharacterDistance(text, isRTL);\n    var [char, remaining] = splitByCharacterDistance(text, charDist, isRTL);\n    if (isWordCharacter(char, remaining, isRTL)) {\n      started = true;\n      dist += charDist;\n    } else if (!started) {\n      dist += charDist;\n    } else {\n      break;\n    }\n    text = remaining;\n  }\n  return dist;\n};\n/**\n * Split a string in two parts at a given distance starting from the end when\n * `isRTL` is set to `true`.\n */\nvar splitByCharacterDistance = (str, dist, isRTL) => {\n  if (isRTL) {\n    var at = str.length - dist;\n    return [str.slice(at, str.length), str.slice(0, at)];\n  }\n  return [str.slice(0, dist), str.slice(dist)];\n};\n/**\n * Check if a character is a word character. The `remaining` argument is used\n * because sometimes you must read subsequent characters to truly determine it.\n */\nvar isWordCharacter = function isWordCharacter(char, remaining) {\n  var isRTL = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;\n  if (SPACE.test(char)) {\n    return false;\n  }\n  // Chameleons count as word characters as long as they're in a word, so\n  // recurse to see if the next one is a word character or not.\n  if (CHAMELEON.test(char)) {\n    var charDist = getCharacterDistance(remaining, isRTL);\n    var [nextChar, nextRemaining] = splitByCharacterDistance(remaining, charDist, isRTL);\n    if (isWordCharacter(nextChar, nextRemaining, isRTL)) {\n      return true;\n    }\n  }\n  if (PUNCTUATION.test(char)) {\n    return false;\n  }\n  return true;\n};\n/**\n * Iterate on codepoints from right to left.\n */\nvar codepointsIteratorRTL = function* codepointsIteratorRTL(str) {\n  var end = str.length - 1;\n  for (var i = 0; i < str.length; i++) {\n    var char1 = str.charAt(end - i);\n    if (isLowSurrogate(char1.charCodeAt(0))) {\n      var char2 = str.charAt(end - i - 1);\n      if (isHighSurrogate(char2.charCodeAt(0))) {\n        yield char2 + char1;\n        i++;\n        continue;\n      }\n    }\n    yield char1;\n  }\n};\n/**\n * Is `charCode` a high surrogate.\n *\n * https://en.wikipedia.org/wiki/Universal_Character_Set_characters#Surrogates\n */\nvar isHighSurrogate = charCode => {\n  return charCode >= 0xd800 && charCode <= 0xdbff;\n};\n/**\n * Is `charCode` a low surrogate.\n *\n * https://en.wikipedia.org/wiki/Universal_Character_Set_characters#Surrogates\n */\nvar isLowSurrogate = charCode => {\n  return charCode >= 0xdc00 && charCode <= 0xdfff;\n};\nvar CodepointType;\n(function (CodepointType) {\n  CodepointType[CodepointType[\"None\"] = 0] = \"None\";\n  CodepointType[CodepointType[\"Extend\"] = 1] = \"Extend\";\n  CodepointType[CodepointType[\"ZWJ\"] = 2] = \"ZWJ\";\n  CodepointType[CodepointType[\"RI\"] = 4] = \"RI\";\n  CodepointType[CodepointType[\"Prepend\"] = 8] = \"Prepend\";\n  CodepointType[CodepointType[\"SpacingMark\"] = 16] = \"SpacingMark\";\n  CodepointType[CodepointType[\"L\"] = 32] = \"L\";\n  CodepointType[CodepointType[\"V\"] = 64] = \"V\";\n  CodepointType[CodepointType[\"T\"] = 128] = \"T\";\n  CodepointType[CodepointType[\"LV\"] = 256] = \"LV\";\n  CodepointType[CodepointType[\"LVT\"] = 512] = \"LVT\";\n  CodepointType[CodepointType[\"ExtPict\"] = 1024] = \"ExtPict\";\n  CodepointType[CodepointType[\"Any\"] = 2048] = \"Any\";\n})(CodepointType || (CodepointType = {}));\nvar reExtend = /^(?:[\\u0300-\\u036F\\u0483-\\u0489\\u0591-\\u05BD\\u05BF\\u05C1\\u05C2\\u05C4\\u05C5\\u05C7\\u0610-\\u061A\\u064B-\\u065F\\u0670\\u06D6-\\u06DC\\u06DF-\\u06E4\\u06E7\\u06E8\\u06EA-\\u06ED\\u0711\\u0730-\\u074A\\u07A6-\\u07B0\\u07EB-\\u07F3\\u07FD\\u0816-\\u0819\\u081B-\\u0823\\u0825-\\u0827\\u0829-\\u082D\\u0859-\\u085B\\u0898-\\u089F\\u08CA-\\u08E1\\u08E3-\\u0902\\u093A\\u093C\\u0941-\\u0948\\u094D\\u0951-\\u0957\\u0962\\u0963\\u0981\\u09BC\\u09BE\\u09C1-\\u09C4\\u09CD\\u09D7\\u09E2\\u09E3\\u09FE\\u0A01\\u0A02\\u0A3C\\u0A41\\u0A42\\u0A47\\u0A48\\u0A4B-\\u0A4D\\u0A51\\u0A70\\u0A71\\u0A75\\u0A81\\u0A82\\u0ABC\\u0AC1-\\u0AC5\\u0AC7\\u0AC8\\u0ACD\\u0AE2\\u0AE3\\u0AFA-\\u0AFF\\u0B01\\u0B3C\\u0B3E\\u0B3F\\u0B41-\\u0B44\\u0B4D\\u0B55-\\u0B57\\u0B62\\u0B63\\u0B82\\u0BBE\\u0BC0\\u0BCD\\u0BD7\\u0C00\\u0C04\\u0C3C\\u0C3E-\\u0C40\\u0C46-\\u0C48\\u0C4A-\\u0C4D\\u0C55\\u0C56\\u0C62\\u0C63\\u0C81\\u0CBC\\u0CBF\\u0CC2\\u0CC6\\u0CCC\\u0CCD\\u0CD5\\u0CD6\\u0CE2\\u0CE3\\u0D00\\u0D01\\u0D3B\\u0D3C\\u0D3E\\u0D41-\\u0D44\\u0D4D\\u0D57\\u0D62\\u0D63\\u0D81\\u0DCA\\u0DCF\\u0DD2-\\u0DD4\\u0DD6\\u0DDF\\u0E31\\u0E34-\\u0E3A\\u0E47-\\u0E4E\\u0EB1\\u0EB4-\\u0EBC\\u0EC8-\\u0ECE\\u0F18\\u0F19\\u0F35\\u0F37\\u0F39\\u0F71-\\u0F7E\\u0F80-\\u0F84\\u0F86\\u0F87\\u0F8D-\\u0F97\\u0F99-\\u0FBC\\u0FC6\\u102D-\\u1030\\u1032-\\u1037\\u1039\\u103A\\u103D\\u103E\\u1058\\u1059\\u105E-\\u1060\\u1071-\\u1074\\u1082\\u1085\\u1086\\u108D\\u109D\\u135D-\\u135F\\u1712-\\u1714\\u1732\\u1733\\u1752\\u1753\\u1772\\u1773\\u17B4\\u17B5\\u17B7-\\u17BD\\u17C6\\u17C9-\\u17D3\\u17DD\\u180B-\\u180D\\u180F\\u1885\\u1886\\u18A9\\u1920-\\u1922\\u1927\\u1928\\u1932\\u1939-\\u193B\\u1A17\\u1A18\\u1A1B\\u1A56\\u1A58-\\u1A5E\\u1A60\\u1A62\\u1A65-\\u1A6C\\u1A73-\\u1A7C\\u1A7F\\u1AB0-\\u1ACE\\u1B00-\\u1B03\\u1B34-\\u1B3A\\u1B3C\\u1B42\\u1B6B-\\u1B73\\u1B80\\u1B81\\u1BA2-\\u1BA5\\u1BA8\\u1BA9\\u1BAB-\\u1BAD\\u1BE6\\u1BE8\\u1BE9\\u1BED\\u1BEF-\\u1BF1\\u1C2C-\\u1C33\\u1C36\\u1C37\\u1CD0-\\u1CD2\\u1CD4-\\u1CE0\\u1CE2-\\u1CE8\\u1CED\\u1CF4\\u1CF8\\u1CF9\\u1DC0-\\u1DFF\\u200C\\u20D0-\\u20F0\\u2CEF-\\u2CF1\\u2D7F\\u2DE0-\\u2DFF\\u302A-\\u302F\\u3099\\u309A\\uA66F-\\uA672\\uA674-\\uA67D\\uA69E\\uA69F\\uA6F0\\uA6F1\\uA802\\uA806\\uA80B\\uA825\\uA826\\uA82C\\uA8C4\\uA8C5\\uA8E0-\\uA8F1\\uA8FF\\uA926-\\uA92D\\uA947-\\uA951\\uA980-\\uA982\\uA9B3\\uA9B6-\\uA9B9\\uA9BC\\uA9BD\\uA9E5\\uAA29-\\uAA2E\\uAA31\\uAA32\\uAA35\\uAA36\\uAA43\\uAA4C\\uAA7C\\uAAB0\\uAAB2-\\uAAB4\\uAAB7\\uAAB8\\uAABE\\uAABF\\uAAC1\\uAAEC\\uAAED\\uAAF6\\uABE5\\uABE8\\uABED\\uFB1E\\uFE00-\\uFE0F\\uFE20-\\uFE2F\\uFF9E\\uFF9F]|\\uD800[\\uDDFD\\uDEE0\\uDF76-\\uDF7A]|\\uD802[\\uDE01-\\uDE03\\uDE05\\uDE06\\uDE0C-\\uDE0F\\uDE38-\\uDE3A\\uDE3F\\uDEE5\\uDEE6]|\\uD803[\\uDD24-\\uDD27\\uDEAB\\uDEAC\\uDEFD-\\uDEFF\\uDF46-\\uDF50\\uDF82-\\uDF85]|\\uD804[\\uDC01\\uDC38-\\uDC46\\uDC70\\uDC73\\uDC74\\uDC7F-\\uDC81\\uDCB3-\\uDCB6\\uDCB9\\uDCBA\\uDCC2\\uDD00-\\uDD02\\uDD27-\\uDD2B\\uDD2D-\\uDD34\\uDD73\\uDD80\\uDD81\\uDDB6-\\uDDBE\\uDDC9-\\uDDCC\\uDDCF\\uDE2F-\\uDE31\\uDE34\\uDE36\\uDE37\\uDE3E\\uDE41\\uDEDF\\uDEE3-\\uDEEA\\uDF00\\uDF01\\uDF3B\\uDF3C\\uDF3E\\uDF40\\uDF57\\uDF66-\\uDF6C\\uDF70-\\uDF74]|\\uD805[\\uDC38-\\uDC3F\\uDC42-\\uDC44\\uDC46\\uDC5E\\uDCB0\\uDCB3-\\uDCB8\\uDCBA\\uDCBD\\uDCBF\\uDCC0\\uDCC2\\uDCC3\\uDDAF\\uDDB2-\\uDDB5\\uDDBC\\uDDBD\\uDDBF\\uDDC0\\uDDDC\\uDDDD\\uDE33-\\uDE3A\\uDE3D\\uDE3F\\uDE40\\uDEAB\\uDEAD\\uDEB0-\\uDEB5\\uDEB7\\uDF1D-\\uDF1F\\uDF22-\\uDF25\\uDF27-\\uDF2B]|\\uD806[\\uDC2F-\\uDC37\\uDC39\\uDC3A\\uDD30\\uDD3B\\uDD3C\\uDD3E\\uDD43\\uDDD4-\\uDDD7\\uDDDA\\uDDDB\\uDDE0\\uDE01-\\uDE0A\\uDE33-\\uDE38\\uDE3B-\\uDE3E\\uDE47\\uDE51-\\uDE56\\uDE59-\\uDE5B\\uDE8A-\\uDE96\\uDE98\\uDE99]|\\uD807[\\uDC30-\\uDC36\\uDC38-\\uDC3D\\uDC3F\\uDC92-\\uDCA7\\uDCAA-\\uDCB0\\uDCB2\\uDCB3\\uDCB5\\uDCB6\\uDD31-\\uDD36\\uDD3A\\uDD3C\\uDD3D\\uDD3F-\\uDD45\\uDD47\\uDD90\\uDD91\\uDD95\\uDD97\\uDEF3\\uDEF4\\uDF00\\uDF01\\uDF36-\\uDF3A\\uDF40\\uDF42]|\\uD80D[\\uDC40\\uDC47-\\uDC55]|\\uD81A[\\uDEF0-\\uDEF4\\uDF30-\\uDF36]|\\uD81B[\\uDF4F\\uDF8F-\\uDF92\\uDFE4]|\\uD82F[\\uDC9D\\uDC9E]|\\uD833[\\uDF00-\\uDF2D\\uDF30-\\uDF46]|\\uD834[\\uDD65\\uDD67-\\uDD69\\uDD6E-\\uDD72\\uDD7B-\\uDD82\\uDD85-\\uDD8B\\uDDAA-\\uDDAD\\uDE42-\\uDE44]|\\uD836[\\uDE00-\\uDE36\\uDE3B-\\uDE6C\\uDE75\\uDE84\\uDE9B-\\uDE9F\\uDEA1-\\uDEAF]|\\uD838[\\uDC00-\\uDC06\\uDC08-\\uDC18\\uDC1B-\\uDC21\\uDC23\\uDC24\\uDC26-\\uDC2A\\uDC8F\\uDD30-\\uDD36\\uDEAE\\uDEEC-\\uDEEF]|\\uD839[\\uDCEC-\\uDCEF]|\\uD83A[\\uDCD0-\\uDCD6\\uDD44-\\uDD4A]|\\uD83C[\\uDFFB-\\uDFFF]|\\uDB40[\\uDC20-\\uDC7F\\uDD00-\\uDDEF])$/;\nvar rePrepend = /^(?:[\\u0600-\\u0605\\u06DD\\u070F\\u0890\\u0891\\u08E2\\u0D4E]|\\uD804[\\uDCBD\\uDCCD\\uDDC2\\uDDC3]|\\uD806[\\uDD3F\\uDD41\\uDE3A\\uDE84-\\uDE89]|\\uD807\\uDD46)$/;\nvar reSpacingMark = /^(?:[\\u0903\\u093B\\u093E-\\u0940\\u0949-\\u094C\\u094E\\u094F\\u0982\\u0983\\u09BF\\u09C0\\u09C7\\u09C8\\u09CB\\u09CC\\u0A03\\u0A3E-\\u0A40\\u0A83\\u0ABE-\\u0AC0\\u0AC9\\u0ACB\\u0ACC\\u0B02\\u0B03\\u0B40\\u0B47\\u0B48\\u0B4B\\u0B4C\\u0BBF\\u0BC1\\u0BC2\\u0BC6-\\u0BC8\\u0BCA-\\u0BCC\\u0C01-\\u0C03\\u0C41-\\u0C44\\u0C82\\u0C83\\u0CBE\\u0CC0\\u0CC1\\u0CC3\\u0CC4\\u0CC7\\u0CC8\\u0CCA\\u0CCB\\u0D02\\u0D03\\u0D3F\\u0D40\\u0D46-\\u0D48\\u0D4A-\\u0D4C\\u0D82\\u0D83\\u0DD0\\u0DD1\\u0DD8-\\u0DDE\\u0DF2\\u0DF3\\u0E33\\u0EB3\\u0F3E\\u0F3F\\u0F7F\\u1031\\u103B\\u103C\\u1056\\u1057\\u1084\\u1715\\u1734\\u17B6\\u17BE-\\u17C5\\u17C7\\u17C8\\u1923-\\u1926\\u1929-\\u192B\\u1930\\u1931\\u1933-\\u1938\\u1A19\\u1A1A\\u1A55\\u1A57\\u1A6D-\\u1A72\\u1B04\\u1B3B\\u1B3D-\\u1B41\\u1B43\\u1B44\\u1B82\\u1BA1\\u1BA6\\u1BA7\\u1BAA\\u1BE7\\u1BEA-\\u1BEC\\u1BEE\\u1BF2\\u1BF3\\u1C24-\\u1C2B\\u1C34\\u1C35\\u1CE1\\u1CF7\\uA823\\uA824\\uA827\\uA880\\uA881\\uA8B4-\\uA8C3\\uA952\\uA953\\uA983\\uA9B4\\uA9B5\\uA9BA\\uA9BB\\uA9BE-\\uA9C0\\uAA2F\\uAA30\\uAA33\\uAA34\\uAA4D\\uAAEB\\uAAEE\\uAAEF\\uAAF5\\uABE3\\uABE4\\uABE6\\uABE7\\uABE9\\uABEA\\uABEC]|\\uD804[\\uDC00\\uDC02\\uDC82\\uDCB0-\\uDCB2\\uDCB7\\uDCB8\\uDD2C\\uDD45\\uDD46\\uDD82\\uDDB3-\\uDDB5\\uDDBF\\uDDC0\\uDDCE\\uDE2C-\\uDE2E\\uDE32\\uDE33\\uDE35\\uDEE0-\\uDEE2\\uDF02\\uDF03\\uDF3F\\uDF41-\\uDF44\\uDF47\\uDF48\\uDF4B-\\uDF4D\\uDF62\\uDF63]|\\uD805[\\uDC35-\\uDC37\\uDC40\\uDC41\\uDC45\\uDCB1\\uDCB2\\uDCB9\\uDCBB\\uDCBC\\uDCBE\\uDCC1\\uDDB0\\uDDB1\\uDDB8-\\uDDBB\\uDDBE\\uDE30-\\uDE32\\uDE3B\\uDE3C\\uDE3E\\uDEAC\\uDEAE\\uDEAF\\uDEB6\\uDF26]|\\uD806[\\uDC2C-\\uDC2E\\uDC38\\uDD31-\\uDD35\\uDD37\\uDD38\\uDD3D\\uDD40\\uDD42\\uDDD1-\\uDDD3\\uDDDC-\\uDDDF\\uDDE4\\uDE39\\uDE57\\uDE58\\uDE97]|\\uD807[\\uDC2F\\uDC3E\\uDCA9\\uDCB1\\uDCB4\\uDD8A-\\uDD8E\\uDD93\\uDD94\\uDD96\\uDEF5\\uDEF6]|\\uD81B[\\uDF51-\\uDF87\\uDFF0\\uDFF1]|\\uD834[\\uDD66\\uDD6D])$/;\nvar reL = /^[\\u1100-\\u115F\\uA960-\\uA97C]$/;\nvar reV = /^[\\u1160-\\u11A7\\uD7B0-\\uD7C6]$/;\nvar reT = /^[\\u11A8-\\u11FF\\uD7CB-\\uD7FB]$/;\nvar reLV = /^[\\uAC00\\uAC1C\\uAC38\\uAC54\\uAC70\\uAC8C\\uACA8\\uACC4\\uACE0\\uACFC\\uAD18\\uAD34\\uAD50\\uAD6C\\uAD88\\uADA4\\uADC0\\uADDC\\uADF8\\uAE14\\uAE30\\uAE4C\\uAE68\\uAE84\\uAEA0\\uAEBC\\uAED8\\uAEF4\\uAF10\\uAF2C\\uAF48\\uAF64\\uAF80\\uAF9C\\uAFB8\\uAFD4\\uAFF0\\uB00C\\uB028\\uB044\\uB060\\uB07C\\uB098\\uB0B4\\uB0D0\\uB0EC\\uB108\\uB124\\uB140\\uB15C\\uB178\\uB194\\uB1B0\\uB1CC\\uB1E8\\uB204\\uB220\\uB23C\\uB258\\uB274\\uB290\\uB2AC\\uB2C8\\uB2E4\\uB300\\uB31C\\uB338\\uB354\\uB370\\uB38C\\uB3A8\\uB3C4\\uB3E0\\uB3FC\\uB418\\uB434\\uB450\\uB46C\\uB488\\uB4A4\\uB4C0\\uB4DC\\uB4F8\\uB514\\uB530\\uB54C\\uB568\\uB584\\uB5A0\\uB5BC\\uB5D8\\uB5F4\\uB610\\uB62C\\uB648\\uB664\\uB680\\uB69C\\uB6B8\\uB6D4\\uB6F0\\uB70C\\uB728\\uB744\\uB760\\uB77C\\uB798\\uB7B4\\uB7D0\\uB7EC\\uB808\\uB824\\uB840\\uB85C\\uB878\\uB894\\uB8B0\\uB8CC\\uB8E8\\uB904\\uB920\\uB93C\\uB958\\uB974\\uB990\\uB9AC\\uB9C8\\uB9E4\\uBA00\\uBA1C\\uBA38\\uBA54\\uBA70\\uBA8C\\uBAA8\\uBAC4\\uBAE0\\uBAFC\\uBB18\\uBB34\\uBB50\\uBB6C\\uBB88\\uBBA4\\uBBC0\\uBBDC\\uBBF8\\uBC14\\uBC30\\uBC4C\\uBC68\\uBC84\\uBCA0\\uBCBC\\uBCD8\\uBCF4\\uBD10\\uBD2C\\uBD48\\uBD64\\uBD80\\uBD9C\\uBDB8\\uBDD4\\uBDF0\\uBE0C\\uBE28\\uBE44\\uBE60\\uBE7C\\uBE98\\uBEB4\\uBED0\\uBEEC\\uBF08\\uBF24\\uBF40\\uBF5C\\uBF78\\uBF94\\uBFB0\\uBFCC\\uBFE8\\uC004\\uC020\\uC03C\\uC058\\uC074\\uC090\\uC0AC\\uC0C8\\uC0E4\\uC100\\uC11C\\uC138\\uC154\\uC170\\uC18C\\uC1A8\\uC1C4\\uC1E0\\uC1FC\\uC218\\uC234\\uC250\\uC26C\\uC288\\uC2A4\\uC2C0\\uC2DC\\uC2F8\\uC314\\uC330\\uC34C\\uC368\\uC384\\uC3A0\\uC3BC\\uC3D8\\uC3F4\\uC410\\uC42C\\uC448\\uC464\\uC480\\uC49C\\uC4B8\\uC4D4\\uC4F0\\uC50C\\uC528\\uC544\\uC560\\uC57C\\uC598\\uC5B4\\uC5D0\\uC5EC\\uC608\\uC624\\uC640\\uC65C\\uC678\\uC694\\uC6B0\\uC6CC\\uC6E8\\uC704\\uC720\\uC73C\\uC758\\uC774\\uC790\\uC7AC\\uC7C8\\uC7E4\\uC800\\uC81C\\uC838\\uC854\\uC870\\uC88C\\uC8A8\\uC8C4\\uC8E0\\uC8FC\\uC918\\uC934\\uC950\\uC96C\\uC988\\uC9A4\\uC9C0\\uC9DC\\uC9F8\\uCA14\\uCA30\\uCA4C\\uCA68\\uCA84\\uCAA0\\uCABC\\uCAD8\\uCAF4\\uCB10\\uCB2C\\uCB48\\uCB64\\uCB80\\uCB9C\\uCBB8\\uCBD4\\uCBF0\\uCC0C\\uCC28\\uCC44\\uCC60\\uCC7C\\uCC98\\uCCB4\\uCCD0\\uCCEC\\uCD08\\uCD24\\uCD40\\uCD5C\\uCD78\\uCD94\\uCDB0\\uCDCC\\uCDE8\\uCE04\\uCE20\\uCE3C\\uCE58\\uCE74\\uCE90\\uCEAC\\uCEC8\\uCEE4\\uCF00\\uCF1C\\uCF38\\uCF54\\uCF70\\uCF8C\\uCFA8\\uCFC4\\uCFE0\\uCFFC\\uD018\\uD034\\uD050\\uD06C\\uD088\\uD0A4\\uD0C0\\uD0DC\\uD0F8\\uD114\\uD130\\uD14C\\uD168\\uD184\\uD1A0\\uD1BC\\uD1D8\\uD1F4\\uD210\\uD22C\\uD248\\uD264\\uD280\\uD29C\\uD2B8\\uD2D4\\uD2F0\\uD30C\\uD328\\uD344\\uD360\\uD37C\\uD398\\uD3B4\\uD3D0\\uD3EC\\uD408\\uD424\\uD440\\uD45C\\uD478\\uD494\\uD4B0\\uD4CC\\uD4E8\\uD504\\uD520\\uD53C\\uD558\\uD574\\uD590\\uD5AC\\uD5C8\\uD5E4\\uD600\\uD61C\\uD638\\uD654\\uD670\\uD68C\\uD6A8\\uD6C4\\uD6E0\\uD6FC\\uD718\\uD734\\uD750\\uD76C\\uD788]$/;\nvar reLVT = /^[\\uAC01-\\uAC1B\\uAC1D-\\uAC37\\uAC39-\\uAC53\\uAC55-\\uAC6F\\uAC71-\\uAC8B\\uAC8D-\\uACA7\\uACA9-\\uACC3\\uACC5-\\uACDF\\uACE1-\\uACFB\\uACFD-\\uAD17\\uAD19-\\uAD33\\uAD35-\\uAD4F\\uAD51-\\uAD6B\\uAD6D-\\uAD87\\uAD89-\\uADA3\\uADA5-\\uADBF\\uADC1-\\uADDB\\uADDD-\\uADF7\\uADF9-\\uAE13\\uAE15-\\uAE2F\\uAE31-\\uAE4B\\uAE4D-\\uAE67\\uAE69-\\uAE83\\uAE85-\\uAE9F\\uAEA1-\\uAEBB\\uAEBD-\\uAED7\\uAED9-\\uAEF3\\uAEF5-\\uAF0F\\uAF11-\\uAF2B\\uAF2D-\\uAF47\\uAF49-\\uAF63\\uAF65-\\uAF7F\\uAF81-\\uAF9B\\uAF9D-\\uAFB7\\uAFB9-\\uAFD3\\uAFD5-\\uAFEF\\uAFF1-\\uB00B\\uB00D-\\uB027\\uB029-\\uB043\\uB045-\\uB05F\\uB061-\\uB07B\\uB07D-\\uB097\\uB099-\\uB0B3\\uB0B5-\\uB0CF\\uB0D1-\\uB0EB\\uB0ED-\\uB107\\uB109-\\uB123\\uB125-\\uB13F\\uB141-\\uB15B\\uB15D-\\uB177\\uB179-\\uB193\\uB195-\\uB1AF\\uB1B1-\\uB1CB\\uB1CD-\\uB1E7\\uB1E9-\\uB203\\uB205-\\uB21F\\uB221-\\uB23B\\uB23D-\\uB257\\uB259-\\uB273\\uB275-\\uB28F\\uB291-\\uB2AB\\uB2AD-\\uB2C7\\uB2C9-\\uB2E3\\uB2E5-\\uB2FF\\uB301-\\uB31B\\uB31D-\\uB337\\uB339-\\uB353\\uB355-\\uB36F\\uB371-\\uB38B\\uB38D-\\uB3A7\\uB3A9-\\uB3C3\\uB3C5-\\uB3DF\\uB3E1-\\uB3FB\\uB3FD-\\uB417\\uB419-\\uB433\\uB435-\\uB44F\\uB451-\\uB46B\\uB46D-\\uB487\\uB489-\\uB4A3\\uB4A5-\\uB4BF\\uB4C1-\\uB4DB\\uB4DD-\\uB4F7\\uB4F9-\\uB513\\uB515-\\uB52F\\uB531-\\uB54B\\uB54D-\\uB567\\uB569-\\uB583\\uB585-\\uB59F\\uB5A1-\\uB5BB\\uB5BD-\\uB5D7\\uB5D9-\\uB5F3\\uB5F5-\\uB60F\\uB611-\\uB62B\\uB62D-\\uB647\\uB649-\\uB663\\uB665-\\uB67F\\uB681-\\uB69B\\uB69D-\\uB6B7\\uB6B9-\\uB6D3\\uB6D5-\\uB6EF\\uB6F1-\\uB70B\\uB70D-\\uB727\\uB729-\\uB743\\uB745-\\uB75F\\uB761-\\uB77B\\uB77D-\\uB797\\uB799-\\uB7B3\\uB7B5-\\uB7CF\\uB7D1-\\uB7EB\\uB7ED-\\uB807\\uB809-\\uB823\\uB825-\\uB83F\\uB841-\\uB85B\\uB85D-\\uB877\\uB879-\\uB893\\uB895-\\uB8AF\\uB8B1-\\uB8CB\\uB8CD-\\uB8E7\\uB8E9-\\uB903\\uB905-\\uB91F\\uB921-\\uB93B\\uB93D-\\uB957\\uB959-\\uB973\\uB975-\\uB98F\\uB991-\\uB9AB\\uB9AD-\\uB9C7\\uB9C9-\\uB9E3\\uB9E5-\\uB9FF\\uBA01-\\uBA1B\\uBA1D-\\uBA37\\uBA39-\\uBA53\\uBA55-\\uBA6F\\uBA71-\\uBA8B\\uBA8D-\\uBAA7\\uBAA9-\\uBAC3\\uBAC5-\\uBADF\\uBAE1-\\uBAFB\\uBAFD-\\uBB17\\uBB19-\\uBB33\\uBB35-\\uBB4F\\uBB51-\\uBB6B\\uBB6D-\\uBB87\\uBB89-\\uBBA3\\uBBA5-\\uBBBF\\uBBC1-\\uBBDB\\uBBDD-\\uBBF7\\uBBF9-\\uBC13\\uBC15-\\uBC2F\\uBC31-\\uBC4B\\uBC4D-\\uBC67\\uBC69-\\uBC83\\uBC85-\\uBC9F\\uBCA1-\\uBCBB\\uBCBD-\\uBCD7\\uBCD9-\\uBCF3\\uBCF5-\\uBD0F\\uBD11-\\uBD2B\\uBD2D-\\uBD47\\uBD49-\\uBD63\\uBD65-\\uBD7F\\uBD81-\\uBD9B\\uBD9D-\\uBDB7\\uBDB9-\\uBDD3\\uBDD5-\\uBDEF\\uBDF1-\\uBE0B\\uBE0D-\\uBE27\\uBE29-\\uBE43\\uBE45-\\uBE5F\\uBE61-\\uBE7B\\uBE7D-\\uBE97\\uBE99-\\uBEB3\\uBEB5-\\uBECF\\uBED1-\\uBEEB\\uBEED-\\uBF07\\uBF09-\\uBF23\\uBF25-\\uBF3F\\uBF41-\\uBF5B\\uBF5D-\\uBF77\\uBF79-\\uBF93\\uBF95-\\uBFAF\\uBFB1-\\uBFCB\\uBFCD-\\uBFE7\\uBFE9-\\uC003\\uC005-\\uC01F\\uC021-\\uC03B\\uC03D-\\uC057\\uC059-\\uC073\\uC075-\\uC08F\\uC091-\\uC0AB\\uC0AD-\\uC0C7\\uC0C9-\\uC0E3\\uC0E5-\\uC0FF\\uC101-\\uC11B\\uC11D-\\uC137\\uC139-\\uC153\\uC155-\\uC16F\\uC171-\\uC18B\\uC18D-\\uC1A7\\uC1A9-\\uC1C3\\uC1C5-\\uC1DF\\uC1E1-\\uC1FB\\uC1FD-\\uC217\\uC219-\\uC233\\uC235-\\uC24F\\uC251-\\uC26B\\uC26D-\\uC287\\uC289-\\uC2A3\\uC2A5-\\uC2BF\\uC2C1-\\uC2DB\\uC2DD-\\uC2F7\\uC2F9-\\uC313\\uC315-\\uC32F\\uC331-\\uC34B\\uC34D-\\uC367\\uC369-\\uC383\\uC385-\\uC39F\\uC3A1-\\uC3BB\\uC3BD-\\uC3D7\\uC3D9-\\uC3F3\\uC3F5-\\uC40F\\uC411-\\uC42B\\uC42D-\\uC447\\uC449-\\uC463\\uC465-\\uC47F\\uC481-\\uC49B\\uC49D-\\uC4B7\\uC4B9-\\uC4D3\\uC4D5-\\uC4EF\\uC4F1-\\uC50B\\uC50D-\\uC527\\uC529-\\uC543\\uC545-\\uC55F\\uC561-\\uC57B\\uC57D-\\uC597\\uC599-\\uC5B3\\uC5B5-\\uC5CF\\uC5D1-\\uC5EB\\uC5ED-\\uC607\\uC609-\\uC623\\uC625-\\uC63F\\uC641-\\uC65B\\uC65D-\\uC677\\uC679-\\uC693\\uC695-\\uC6AF\\uC6B1-\\uC6CB\\uC6CD-\\uC6E7\\uC6E9-\\uC703\\uC705-\\uC71F\\uC721-\\uC73B\\uC73D-\\uC757\\uC759-\\uC773\\uC775-\\uC78F\\uC791-\\uC7AB\\uC7AD-\\uC7C7\\uC7C9-\\uC7E3\\uC7E5-\\uC7FF\\uC801-\\uC81B\\uC81D-\\uC837\\uC839-\\uC853\\uC855-\\uC86F\\uC871-\\uC88B\\uC88D-\\uC8A7\\uC8A9-\\uC8C3\\uC8C5-\\uC8DF\\uC8E1-\\uC8FB\\uC8FD-\\uC917\\uC919-\\uC933\\uC935-\\uC94F\\uC951-\\uC96B\\uC96D-\\uC987\\uC989-\\uC9A3\\uC9A5-\\uC9BF\\uC9C1-\\uC9DB\\uC9DD-\\uC9F7\\uC9F9-\\uCA13\\uCA15-\\uCA2F\\uCA31-\\uCA4B\\uCA4D-\\uCA67\\uCA69-\\uCA83\\uCA85-\\uCA9F\\uCAA1-\\uCABB\\uCABD-\\uCAD7\\uCAD9-\\uCAF3\\uCAF5-\\uCB0F\\uCB11-\\uCB2B\\uCB2D-\\uCB47\\uCB49-\\uCB63\\uCB65-\\uCB7F\\uCB81-\\uCB9B\\uCB9D-\\uCBB7\\uCBB9-\\uCBD3\\uCBD5-\\uCBEF\\uCBF1-\\uCC0B\\uCC0D-\\uCC27\\uCC29-\\uCC43\\uCC45-\\uCC5F\\uCC61-\\uCC7B\\uCC7D-\\uCC97\\uCC99-\\uCCB3\\uCCB5-\\uCCCF\\uCCD1-\\uCCEB\\uCCED-\\uCD07\\uCD09-\\uCD23\\uCD25-\\uCD3F\\uCD41-\\uCD5B\\uCD5D-\\uCD77\\uCD79-\\uCD93\\uCD95-\\uCDAF\\uCDB1-\\uCDCB\\uCDCD-\\uCDE7\\uCDE9-\\uCE03\\uCE05-\\uCE1F\\uCE21-\\uCE3B\\uCE3D-\\uCE57\\uCE59-\\uCE73\\uCE75-\\uCE8F\\uCE91-\\uCEAB\\uCEAD-\\uCEC7\\uCEC9-\\uCEE3\\uCEE5-\\uCEFF\\uCF01-\\uCF1B\\uCF1D-\\uCF37\\uCF39-\\uCF53\\uCF55-\\uCF6F\\uCF71-\\uCF8B\\uCF8D-\\uCFA7\\uCFA9-\\uCFC3\\uCFC5-\\uCFDF\\uCFE1-\\uCFFB\\uCFFD-\\uD017\\uD019-\\uD033\\uD035-\\uD04F\\uD051-\\uD06B\\uD06D-\\uD087\\uD089-\\uD0A3\\uD0A5-\\uD0BF\\uD0C1-\\uD0DB\\uD0DD-\\uD0F7\\uD0F9-\\uD113\\uD115-\\uD12F\\uD131-\\uD14B\\uD14D-\\uD167\\uD169-\\uD183\\uD185-\\uD19F\\uD1A1-\\uD1BB\\uD1BD-\\uD1D7\\uD1D9-\\uD1F3\\uD1F5-\\uD20F\\uD211-\\uD22B\\uD22D-\\uD247\\uD249-\\uD263\\uD265-\\uD27F\\uD281-\\uD29B\\uD29D-\\uD2B7\\uD2B9-\\uD2D3\\uD2D5-\\uD2EF\\uD2F1-\\uD30B\\uD30D-\\uD327\\uD329-\\uD343\\uD345-\\uD35F\\uD361-\\uD37B\\uD37D-\\uD397\\uD399-\\uD3B3\\uD3B5-\\uD3CF\\uD3D1-\\uD3EB\\uD3ED-\\uD407\\uD409-\\uD423\\uD425-\\uD43F\\uD441-\\uD45B\\uD45D-\\uD477\\uD479-\\uD493\\uD495-\\uD4AF\\uD4B1-\\uD4CB\\uD4CD-\\uD4E7\\uD4E9-\\uD503\\uD505-\\uD51F\\uD521-\\uD53B\\uD53D-\\uD557\\uD559-\\uD573\\uD575-\\uD58F\\uD591-\\uD5AB\\uD5AD-\\uD5C7\\uD5C9-\\uD5E3\\uD5E5-\\uD5FF\\uD601-\\uD61B\\uD61D-\\uD637\\uD639-\\uD653\\uD655-\\uD66F\\uD671-\\uD68B\\uD68D-\\uD6A7\\uD6A9-\\uD6C3\\uD6C5-\\uD6DF\\uD6E1-\\uD6FB\\uD6FD-\\uD717\\uD719-\\uD733\\uD735-\\uD74F\\uD751-\\uD76B\\uD76D-\\uD787\\uD789-\\uD7A3]$/;\nvar reExtPict = /^(?:[\\xA9\\xAE\\u203C\\u2049\\u2122\\u2139\\u2194-\\u2199\\u21A9\\u21AA\\u231A\\u231B\\u2328\\u2388\\u23CF\\u23E9-\\u23F3\\u23F8-\\u23FA\\u24C2\\u25AA\\u25AB\\u25B6\\u25C0\\u25FB-\\u25FE\\u2600-\\u2605\\u2607-\\u2612\\u2614-\\u2685\\u2690-\\u2705\\u2708-\\u2712\\u2714\\u2716\\u271D\\u2721\\u2728\\u2733\\u2734\\u2744\\u2747\\u274C\\u274E\\u2753-\\u2755\\u2757\\u2763-\\u2767\\u2795-\\u2797\\u27A1\\u27B0\\u27BF\\u2934\\u2935\\u2B05-\\u2B07\\u2B1B\\u2B1C\\u2B50\\u2B55\\u3030\\u303D\\u3297\\u3299]|\\uD83C[\\uDC00-\\uDCFF\\uDD0D-\\uDD0F\\uDD2F\\uDD6C-\\uDD71\\uDD7E\\uDD7F\\uDD8E\\uDD91-\\uDD9A\\uDDAD-\\uDDE5\\uDE01-\\uDE0F\\uDE1A\\uDE2F\\uDE32-\\uDE3A\\uDE3C-\\uDE3F\\uDE49-\\uDFFA]|\\uD83D[\\uDC00-\\uDD3D\\uDD46-\\uDE4F\\uDE80-\\uDEFF\\uDF74-\\uDF7F\\uDFD5-\\uDFFF]|\\uD83E[\\uDC0C-\\uDC0F\\uDC48-\\uDC4F\\uDC5A-\\uDC5F\\uDC88-\\uDC8F\\uDCAE-\\uDCFF\\uDD0C-\\uDD3A\\uDD3C-\\uDD45\\uDD47-\\uDEFF]|\\uD83F[\\uDC00-\\uDFFD])$/;\nvar getCodepointType = (char, code) => {\n  var type = CodepointType.Any;\n  if (char.search(reExtend) !== -1) {\n    type |= CodepointType.Extend;\n  }\n  if (code === 0x200d) {\n    type |= CodepointType.ZWJ;\n  }\n  if (code >= 0x1f1e6 && code <= 0x1f1ff) {\n    type |= CodepointType.RI;\n  }\n  if (char.search(rePrepend) !== -1) {\n    type |= CodepointType.Prepend;\n  }\n  if (char.search(reSpacingMark) !== -1) {\n    type |= CodepointType.SpacingMark;\n  }\n  if (char.search(reL) !== -1) {\n    type |= CodepointType.L;\n  }\n  if (char.search(reV) !== -1) {\n    type |= CodepointType.V;\n  }\n  if (char.search(reT) !== -1) {\n    type |= CodepointType.T;\n  }\n  if (char.search(reLV) !== -1) {\n    type |= CodepointType.LV;\n  }\n  if (char.search(reLVT) !== -1) {\n    type |= CodepointType.LVT;\n  }\n  if (char.search(reExtPict) !== -1) {\n    type |= CodepointType.ExtPict;\n  }\n  return type;\n};\nfunction intersects(x, y) {\n  return (x & y) !== 0;\n}\nvar NonBoundaryPairs = [\n// GB6\n[CodepointType.L, CodepointType.L | CodepointType.V | CodepointType.LV | CodepointType.LVT],\n// GB7\n[CodepointType.LV | CodepointType.V, CodepointType.V | CodepointType.T],\n// GB8\n[CodepointType.LVT | CodepointType.T, CodepointType.T],\n// GB9\n[CodepointType.Any, CodepointType.Extend | CodepointType.ZWJ],\n// GB9a\n[CodepointType.Any, CodepointType.SpacingMark],\n// GB9b\n[CodepointType.Prepend, CodepointType.Any],\n// GB11\n[CodepointType.ZWJ, CodepointType.ExtPict],\n// GB12 and GB13\n[CodepointType.RI, CodepointType.RI]];\nfunction isBoundaryPair(left, right) {\n  return NonBoundaryPairs.findIndex(r => intersects(left, r[0]) && intersects(right, r[1])) === -1;\n}\nvar endingEmojiZWJ = /(?:[\\xA9\\xAE\\u203C\\u2049\\u2122\\u2139\\u2194-\\u2199\\u21A9\\u21AA\\u231A\\u231B\\u2328\\u2388\\u23CF\\u23E9-\\u23F3\\u23F8-\\u23FA\\u24C2\\u25AA\\u25AB\\u25B6\\u25C0\\u25FB-\\u25FE\\u2600-\\u2605\\u2607-\\u2612\\u2614-\\u2685\\u2690-\\u2705\\u2708-\\u2712\\u2714\\u2716\\u271D\\u2721\\u2728\\u2733\\u2734\\u2744\\u2747\\u274C\\u274E\\u2753-\\u2755\\u2757\\u2763-\\u2767\\u2795-\\u2797\\u27A1\\u27B0\\u27BF\\u2934\\u2935\\u2B05-\\u2B07\\u2B1B\\u2B1C\\u2B50\\u2B55\\u3030\\u303D\\u3297\\u3299]|\\uD83C[\\uDC00-\\uDCFF\\uDD0D-\\uDD0F\\uDD2F\\uDD6C-\\uDD71\\uDD7E\\uDD7F\\uDD8E\\uDD91-\\uDD9A\\uDDAD-\\uDDE5\\uDE01-\\uDE0F\\uDE1A\\uDE2F\\uDE32-\\uDE3A\\uDE3C-\\uDE3F\\uDE49-\\uDFFA]|\\uD83D[\\uDC00-\\uDD3D\\uDD46-\\uDE4F\\uDE80-\\uDEFF\\uDF74-\\uDF7F\\uDFD5-\\uDFFF]|\\uD83E[\\uDC0C-\\uDC0F\\uDC48-\\uDC4F\\uDC5A-\\uDC5F\\uDC88-\\uDC8F\\uDCAE-\\uDCFF\\uDD0C-\\uDD3A\\uDD3C-\\uDD45\\uDD47-\\uDEFF]|\\uD83F[\\uDC00-\\uDFFD])(?:[\\u0300-\\u036F\\u0483-\\u0489\\u0591-\\u05BD\\u05BF\\u05C1\\u05C2\\u05C4\\u05C5\\u05C7\\u0610-\\u061A\\u064B-\\u065F\\u0670\\u06D6-\\u06DC\\u06DF-\\u06E4\\u06E7\\u06E8\\u06EA-\\u06ED\\u0711\\u0730-\\u074A\\u07A6-\\u07B0\\u07EB-\\u07F3\\u07FD\\u0816-\\u0819\\u081B-\\u0823\\u0825-\\u0827\\u0829-\\u082D\\u0859-\\u085B\\u0898-\\u089F\\u08CA-\\u08E1\\u08E3-\\u0902\\u093A\\u093C\\u0941-\\u0948\\u094D\\u0951-\\u0957\\u0962\\u0963\\u0981\\u09BC\\u09BE\\u09C1-\\u09C4\\u09CD\\u09D7\\u09E2\\u09E3\\u09FE\\u0A01\\u0A02\\u0A3C\\u0A41\\u0A42\\u0A47\\u0A48\\u0A4B-\\u0A4D\\u0A51\\u0A70\\u0A71\\u0A75\\u0A81\\u0A82\\u0ABC\\u0AC1-\\u0AC5\\u0AC7\\u0AC8\\u0ACD\\u0AE2\\u0AE3\\u0AFA-\\u0AFF\\u0B01\\u0B3C\\u0B3E\\u0B3F\\u0B41-\\u0B44\\u0B4D\\u0B55-\\u0B57\\u0B62\\u0B63\\u0B82\\u0BBE\\u0BC0\\u0BCD\\u0BD7\\u0C00\\u0C04\\u0C3C\\u0C3E-\\u0C40\\u0C46-\\u0C48\\u0C4A-\\u0C4D\\u0C55\\u0C56\\u0C62\\u0C63\\u0C81\\u0CBC\\u0CBF\\u0CC2\\u0CC6\\u0CCC\\u0CCD\\u0CD5\\u0CD6\\u0CE2\\u0CE3\\u0D00\\u0D01\\u0D3B\\u0D3C\\u0D3E\\u0D41-\\u0D44\\u0D4D\\u0D57\\u0D62\\u0D63\\u0D81\\u0DCA\\u0DCF\\u0DD2-\\u0DD4\\u0DD6\\u0DDF\\u0E31\\u0E34-\\u0E3A\\u0E47-\\u0E4E\\u0EB1\\u0EB4-\\u0EBC\\u0EC8-\\u0ECE\\u0F18\\u0F19\\u0F35\\u0F37\\u0F39\\u0F71-\\u0F7E\\u0F80-\\u0F84\\u0F86\\u0F87\\u0F8D-\\u0F97\\u0F99-\\u0FBC\\u0FC6\\u102D-\\u1030\\u1032-\\u1037\\u1039\\u103A\\u103D\\u103E\\u1058\\u1059\\u105E-\\u1060\\u1071-\\u1074\\u1082\\u1085\\u1086\\u108D\\u109D\\u135D-\\u135F\\u1712-\\u1714\\u1732\\u1733\\u1752\\u1753\\u1772\\u1773\\u17B4\\u17B5\\u17B7-\\u17BD\\u17C6\\u17C9-\\u17D3\\u17DD\\u180B-\\u180D\\u180F\\u1885\\u1886\\u18A9\\u1920-\\u1922\\u1927\\u1928\\u1932\\u1939-\\u193B\\u1A17\\u1A18\\u1A1B\\u1A56\\u1A58-\\u1A5E\\u1A60\\u1A62\\u1A65-\\u1A6C\\u1A73-\\u1A7C\\u1A7F\\u1AB0-\\u1ACE\\u1B00-\\u1B03\\u1B34-\\u1B3A\\u1B3C\\u1B42\\u1B6B-\\u1B73\\u1B80\\u1B81\\u1BA2-\\u1BA5\\u1BA8\\u1BA9\\u1BAB-\\u1BAD\\u1BE6\\u1BE8\\u1BE9\\u1BED\\u1BEF-\\u1BF1\\u1C2C-\\u1C33\\u1C36\\u1C37\\u1CD0-\\u1CD2\\u1CD4-\\u1CE0\\u1CE2-\\u1CE8\\u1CED\\u1CF4\\u1CF8\\u1CF9\\u1DC0-\\u1DFF\\u200C\\u20D0-\\u20F0\\u2CEF-\\u2CF1\\u2D7F\\u2DE0-\\u2DFF\\u302A-\\u302F\\u3099\\u309A\\uA66F-\\uA672\\uA674-\\uA67D\\uA69E\\uA69F\\uA6F0\\uA6F1\\uA802\\uA806\\uA80B\\uA825\\uA826\\uA82C\\uA8C4\\uA8C5\\uA8E0-\\uA8F1\\uA8FF\\uA926-\\uA92D\\uA947-\\uA951\\uA980-\\uA982\\uA9B3\\uA9B6-\\uA9B9\\uA9BC\\uA9BD\\uA9E5\\uAA29-\\uAA2E\\uAA31\\uAA32\\uAA35\\uAA36\\uAA43\\uAA4C\\uAA7C\\uAAB0\\uAAB2-\\uAAB4\\uAAB7\\uAAB8\\uAABE\\uAABF\\uAAC1\\uAAEC\\uAAED\\uAAF6\\uABE5\\uABE8\\uABED\\uFB1E\\uFE00-\\uFE0F\\uFE20-\\uFE2F\\uFF9E\\uFF9F]|\\uD800[\\uDDFD\\uDEE0\\uDF76-\\uDF7A]|\\uD802[\\uDE01-\\uDE03\\uDE05\\uDE06\\uDE0C-\\uDE0F\\uDE38-\\uDE3A\\uDE3F\\uDEE5\\uDEE6]|\\uD803[\\uDD24-\\uDD27\\uDEAB\\uDEAC\\uDEFD-\\uDEFF\\uDF46-\\uDF50\\uDF82-\\uDF85]|\\uD804[\\uDC01\\uDC38-\\uDC46\\uDC70\\uDC73\\uDC74\\uDC7F-\\uDC81\\uDCB3-\\uDCB6\\uDCB9\\uDCBA\\uDCC2\\uDD00-\\uDD02\\uDD27-\\uDD2B\\uDD2D-\\uDD34\\uDD73\\uDD80\\uDD81\\uDDB6-\\uDDBE\\uDDC9-\\uDDCC\\uDDCF\\uDE2F-\\uDE31\\uDE34\\uDE36\\uDE37\\uDE3E\\uDE41\\uDEDF\\uDEE3-\\uDEEA\\uDF00\\uDF01\\uDF3B\\uDF3C\\uDF3E\\uDF40\\uDF57\\uDF66-\\uDF6C\\uDF70-\\uDF74]|\\uD805[\\uDC38-\\uDC3F\\uDC42-\\uDC44\\uDC46\\uDC5E\\uDCB0\\uDCB3-\\uDCB8\\uDCBA\\uDCBD\\uDCBF\\uDCC0\\uDCC2\\uDCC3\\uDDAF\\uDDB2-\\uDDB5\\uDDBC\\uDDBD\\uDDBF\\uDDC0\\uDDDC\\uDDDD\\uDE33-\\uDE3A\\uDE3D\\uDE3F\\uDE40\\uDEAB\\uDEAD\\uDEB0-\\uDEB5\\uDEB7\\uDF1D-\\uDF1F\\uDF22-\\uDF25\\uDF27-\\uDF2B]|\\uD806[\\uDC2F-\\uDC37\\uDC39\\uDC3A\\uDD30\\uDD3B\\uDD3C\\uDD3E\\uDD43\\uDDD4-\\uDDD7\\uDDDA\\uDDDB\\uDDE0\\uDE01-\\uDE0A\\uDE33-\\uDE38\\uDE3B-\\uDE3E\\uDE47\\uDE51-\\uDE56\\uDE59-\\uDE5B\\uDE8A-\\uDE96\\uDE98\\uDE99]|\\uD807[\\uDC30-\\uDC36\\uDC38-\\uDC3D\\uDC3F\\uDC92-\\uDCA7\\uDCAA-\\uDCB0\\uDCB2\\uDCB3\\uDCB5\\uDCB6\\uDD31-\\uDD36\\uDD3A\\uDD3C\\uDD3D\\uDD3F-\\uDD45\\uDD47\\uDD90\\uDD91\\uDD95\\uDD97\\uDEF3\\uDEF4\\uDF00\\uDF01\\uDF36-\\uDF3A\\uDF40\\uDF42]|\\uD80D[\\uDC40\\uDC47-\\uDC55]|\\uD81A[\\uDEF0-\\uDEF4\\uDF30-\\uDF36]|\\uD81B[\\uDF4F\\uDF8F-\\uDF92\\uDFE4]|\\uD82F[\\uDC9D\\uDC9E]|\\uD833[\\uDF00-\\uDF2D\\uDF30-\\uDF46]|\\uD834[\\uDD65\\uDD67-\\uDD69\\uDD6E-\\uDD72\\uDD7B-\\uDD82\\uDD85-\\uDD8B\\uDDAA-\\uDDAD\\uDE42-\\uDE44]|\\uD836[\\uDE00-\\uDE36\\uDE3B-\\uDE6C\\uDE75\\uDE84\\uDE9B-\\uDE9F\\uDEA1-\\uDEAF]|\\uD838[\\uDC00-\\uDC06\\uDC08-\\uDC18\\uDC1B-\\uDC21\\uDC23\\uDC24\\uDC26-\\uDC2A\\uDC8F\\uDD30-\\uDD36\\uDEAE\\uDEEC-\\uDEEF]|\\uD839[\\uDCEC-\\uDCEF]|\\uD83A[\\uDCD0-\\uDCD6\\uDD44-\\uDD4A]|\\uD83C[\\uDFFB-\\uDFFF]|\\uDB40[\\uDC20-\\uDC7F\\uDD00-\\uDDEF])*\\u200D$/;\nvar endsWithEmojiZWJ = str => {\n  return str.search(endingEmojiZWJ) !== -1;\n};\nvar endingRIs = /(?:\\uD83C[\\uDDE6-\\uDDFF])+$/g;\nvar endsWithOddNumberOfRIs = str => {\n  var match = str.match(endingRIs);\n  if (match === null) {\n    return false;\n  } else {\n    // A RI is represented by a surrogate pair.\n    var numRIs = match[0].length / 2;\n    return numRIs % 2 === 1;\n  }\n};\n\n// eslint-disable-next-line no-redeclare\nvar TextTransforms = {\n  delete(editor, options) {\n    editor.delete(options);\n  },\n  insertFragment(editor, fragment, options) {\n    editor.insertFragment(fragment, options);\n  },\n  insertText(editor, text) {\n    var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n    Editor.withoutNormalizing(editor, () => {\n      var {\n        voids = false\n      } = options;\n      var {\n        at = getDefaultInsertLocation(editor)\n      } = options;\n      if (Path.isPath(at)) {\n        at = Editor.range(editor, at);\n      }\n      if (Range.isRange(at)) {\n        if (Range.isCollapsed(at)) {\n          at = at.anchor;\n        } else {\n          var end = Range.end(at);\n          if (!voids && Editor.void(editor, {\n            at: end\n          })) {\n            return;\n          }\n          var start = Range.start(at);\n          var startRef = Editor.pointRef(editor, start);\n          var endRef = Editor.pointRef(editor, end);\n          Transforms.delete(editor, {\n            at,\n            voids\n          });\n          var startPoint = startRef.unref();\n          var endPoint = endRef.unref();\n          at = startPoint || endPoint;\n          Transforms.setSelection(editor, {\n            anchor: at,\n            focus: at\n          });\n        }\n      }\n      if (!voids && Editor.void(editor, {\n        at\n      }) || Editor.elementReadOnly(editor, {\n        at\n      })) {\n        return;\n      }\n      var {\n        path,\n        offset\n      } = at;\n      if (text.length > 0) editor.apply({\n        type: 'insert_text',\n        path,\n        offset,\n        text\n      });\n    });\n  }\n};\n\nfunction ownKeys$9(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread$9(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$9(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$9(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nvar Transforms = _objectSpread$9(_objectSpread$9(_objectSpread$9(_objectSpread$9({}, GeneralTransforms), NodeTransforms), SelectionTransforms), TextTransforms);\n\n// perf\nvar BATCHING_DIRTY_PATHS = new WeakMap();\nvar isBatchingDirtyPaths = editor => {\n  return BATCHING_DIRTY_PATHS.get(editor) || false;\n};\nvar batchDirtyPaths = (editor, fn, update) => {\n  var value = BATCHING_DIRTY_PATHS.get(editor) || false;\n  BATCHING_DIRTY_PATHS.set(editor, true);\n  try {\n    fn();\n    update();\n  } finally {\n    BATCHING_DIRTY_PATHS.set(editor, value);\n  }\n};\n\n/**\n * update editor dirty paths\n *\n * @param newDirtyPaths: Path[]; new dirty paths\n * @param transform: (p: Path) => Path | null; how to transform existing dirty paths\n */\nfunction updateDirtyPaths(editor, newDirtyPaths, transform) {\n  var oldDirtyPaths = DIRTY_PATHS.get(editor) || [];\n  var oldDirtyPathKeys = DIRTY_PATH_KEYS.get(editor) || new Set();\n  var dirtyPaths;\n  var dirtyPathKeys;\n  var add = path => {\n    if (path) {\n      var key = path.join(',');\n      if (!dirtyPathKeys.has(key)) {\n        dirtyPathKeys.add(key);\n        dirtyPaths.push(path);\n      }\n    }\n  };\n  if (transform) {\n    dirtyPaths = [];\n    dirtyPathKeys = new Set();\n    for (var path of oldDirtyPaths) {\n      var newPath = transform(path);\n      add(newPath);\n    }\n  } else {\n    dirtyPaths = oldDirtyPaths;\n    dirtyPathKeys = oldDirtyPathKeys;\n  }\n  for (var _path of newDirtyPaths) {\n    add(_path);\n  }\n  DIRTY_PATHS.set(editor, dirtyPaths);\n  DIRTY_PATH_KEYS.set(editor, dirtyPathKeys);\n}\n\nvar apply = (editor, op) => {\n  for (var ref of Editor.pathRefs(editor)) {\n    PathRef.transform(ref, op);\n  }\n  for (var _ref of Editor.pointRefs(editor)) {\n    PointRef.transform(_ref, op);\n  }\n  for (var _ref2 of Editor.rangeRefs(editor)) {\n    RangeRef.transform(_ref2, op);\n  }\n  // update dirty paths\n  if (!isBatchingDirtyPaths(editor)) {\n    var transform = Path.operationCanTransformPath(op) ? p => Path.transform(p, op) : undefined;\n    updateDirtyPaths(editor, editor.getDirtyPaths(op), transform);\n  }\n  Transforms.transform(editor, op);\n  editor.operations.push(op);\n  Editor.normalize(editor, {\n    operation: op\n  });\n  // Clear any formats applied to the cursor if the selection changes.\n  if (op.type === 'set_selection') {\n    editor.marks = null;\n  }\n  if (!FLUSHING.get(editor)) {\n    FLUSHING.set(editor, true);\n    Promise.resolve().then(() => {\n      FLUSHING.set(editor, false);\n      editor.onChange({\n        operation: op\n      });\n      editor.operations = [];\n    });\n  }\n};\n\n/**\n * Get the \"dirty\" paths generated from an operation.\n */\nvar getDirtyPaths = (editor, op) => {\n  switch (op.type) {\n    case 'insert_text':\n    case 'remove_text':\n    case 'set_node':\n      {\n        var {\n          path\n        } = op;\n        return Path.levels(path);\n      }\n    case 'insert_node':\n      {\n        var {\n          node,\n          path: _path\n        } = op;\n        var levels = Path.levels(_path);\n        var descendants = Text.isText(node) ? [] : Array.from(Node.nodes(node), _ref => {\n          var [, p] = _ref;\n          return _path.concat(p);\n        });\n        return [...levels, ...descendants];\n      }\n    case 'merge_node':\n      {\n        var {\n          path: _path2\n        } = op;\n        var ancestors = Path.ancestors(_path2);\n        var previousPath = Path.previous(_path2);\n        return [...ancestors, previousPath];\n      }\n    case 'move_node':\n      {\n        var {\n          path: _path3,\n          newPath\n        } = op;\n        if (Path.equals(_path3, newPath)) {\n          return [];\n        }\n        var oldAncestors = [];\n        var newAncestors = [];\n        for (var ancestor of Path.ancestors(_path3)) {\n          var p = Path.transform(ancestor, op);\n          oldAncestors.push(p);\n        }\n        for (var _ancestor of Path.ancestors(newPath)) {\n          var _p = Path.transform(_ancestor, op);\n          newAncestors.push(_p);\n        }\n        var newParent = newAncestors[newAncestors.length - 1];\n        var newIndex = newPath[newPath.length - 1];\n        var resultPath = newParent.concat(newIndex);\n        return [...oldAncestors, ...newAncestors, resultPath];\n      }\n    case 'remove_node':\n      {\n        var {\n          path: _path4\n        } = op;\n        var _ancestors = Path.ancestors(_path4);\n        return [..._ancestors];\n      }\n    case 'split_node':\n      {\n        var {\n          path: _path5\n        } = op;\n        var _levels = Path.levels(_path5);\n        var nextPath = Path.next(_path5);\n        return [..._levels, nextPath];\n      }\n    default:\n      {\n        return [];\n      }\n  }\n};\n\nvar getFragment = editor => {\n  var {\n    selection\n  } = editor;\n  if (selection) {\n    return Node.fragment(editor, selection);\n  }\n  return [];\n};\n\nvar normalizeNode = (editor, entry) => {\n  var [node, path] = entry;\n  // There are no core normalizations for text nodes.\n  if (Text.isText(node)) {\n    return;\n  }\n  // Ensure that block and inline nodes have at least one text child.\n  if (Element.isElement(node) && node.children.length === 0) {\n    var child = {\n      text: ''\n    };\n    Transforms.insertNodes(editor, child, {\n      at: path.concat(0),\n      voids: true\n    });\n    return;\n  }\n  // Determine whether the node should have block or inline children.\n  var shouldHaveInlines = Editor.isEditor(node) ? false : Element.isElement(node) && (editor.isInline(node) || node.children.length === 0 || Text.isText(node.children[0]) || editor.isInline(node.children[0]));\n  // Since we'll be applying operations while iterating, keep track of an\n  // index that accounts for any added/removed nodes.\n  var n = 0;\n  for (var i = 0; i < node.children.length; i++, n++) {\n    var currentNode = Node.get(editor, path);\n    if (Text.isText(currentNode)) continue;\n    var _child = currentNode.children[n];\n    var prev = currentNode.children[n - 1];\n    var isLast = i === node.children.length - 1;\n    var isInlineOrText = Text.isText(_child) || Element.isElement(_child) && editor.isInline(_child);\n    // Only allow block nodes in the top-level children and parent blocks\n    // that only contain block nodes. Similarly, only allow inline nodes in\n    // other inline nodes, or parent blocks that only contain inlines and\n    // text.\n    if (isInlineOrText !== shouldHaveInlines) {\n      Transforms.removeNodes(editor, {\n        at: path.concat(n),\n        voids: true\n      });\n      n--;\n    } else if (Element.isElement(_child)) {\n      // Ensure that inline nodes are surrounded by text nodes.\n      if (editor.isInline(_child)) {\n        if (prev == null || !Text.isText(prev)) {\n          var newChild = {\n            text: ''\n          };\n          Transforms.insertNodes(editor, newChild, {\n            at: path.concat(n),\n            voids: true\n          });\n          n++;\n        } else if (isLast) {\n          var _newChild = {\n            text: ''\n          };\n          Transforms.insertNodes(editor, _newChild, {\n            at: path.concat(n + 1),\n            voids: true\n          });\n          n++;\n        }\n      }\n    } else {\n      // Merge adjacent text nodes that are empty or match.\n      if (prev != null && Text.isText(prev)) {\n        if (Text.equals(_child, prev, {\n          loose: true\n        })) {\n          Transforms.mergeNodes(editor, {\n            at: path.concat(n),\n            voids: true\n          });\n          n--;\n        } else if (prev.text === '') {\n          Transforms.removeNodes(editor, {\n            at: path.concat(n - 1),\n            voids: true\n          });\n          n--;\n        } else if (_child.text === '') {\n          Transforms.removeNodes(editor, {\n            at: path.concat(n),\n            voids: true\n          });\n          n--;\n        }\n      }\n    }\n  }\n};\n\nvar shouldNormalize = (editor, _ref) => {\n  var {\n    iteration,\n    initialDirtyPathsLength\n  } = _ref;\n  var maxIterations = initialDirtyPathsLength * 42; // HACK: better way?\n  if (iteration > maxIterations) {\n    throw new Error(\"Could not completely normalize the editor after \".concat(maxIterations, \" iterations! This is usually due to incorrect normalization logic that leaves a node in an invalid state.\"));\n  }\n  return true;\n};\n\nvar above = function above(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  var {\n    voids = false,\n    mode = 'lowest',\n    at = editor.selection,\n    match\n  } = options;\n  if (!at) {\n    return;\n  }\n  var path = Editor.path(editor, at);\n  var reverse = mode === 'lowest';\n  for (var [n, p] of Editor.levels(editor, {\n    at: path,\n    voids,\n    match,\n    reverse\n  })) {\n    if (Text.isText(n)) continue;\n    if (Range.isRange(at)) {\n      if (Path.isAncestor(p, at.anchor.path) && Path.isAncestor(p, at.focus.path)) {\n        return [n, p];\n      }\n    } else {\n      if (!Path.equals(path, p)) {\n        return [n, p];\n      }\n    }\n  }\n};\n\nfunction ownKeys$8(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread$8(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$8(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$8(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nvar addMark = (editor, key, value) => {\n  var {\n    selection\n  } = editor;\n  if (selection) {\n    var match = (node, path) => {\n      if (!Text.isText(node)) {\n        return false; // marks can only be applied to text\n      }\n\n      var [parentNode, parentPath] = Editor.parent(editor, path);\n      return !editor.isVoid(parentNode) || editor.markableVoid(parentNode);\n    };\n    var expandedSelection = Range.isExpanded(selection);\n    var markAcceptingVoidSelected = false;\n    if (!expandedSelection) {\n      var [selectedNode, selectedPath] = Editor.node(editor, selection);\n      if (selectedNode && match(selectedNode, selectedPath)) {\n        var [parentNode] = Editor.parent(editor, selectedPath);\n        markAcceptingVoidSelected = parentNode && editor.markableVoid(parentNode);\n      }\n    }\n    if (expandedSelection || markAcceptingVoidSelected) {\n      Transforms.setNodes(editor, {\n        [key]: value\n      }, {\n        match,\n        split: true,\n        voids: true\n      });\n    } else {\n      var marks = _objectSpread$8(_objectSpread$8({}, Editor.marks(editor) || {}), {}, {\n        [key]: value\n      });\n      editor.marks = marks;\n      if (!FLUSHING.get(editor)) {\n        editor.onChange();\n      }\n    }\n  }\n};\n\nfunction ownKeys$7(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread$7(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$7(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$7(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nvar after = function after(editor, at) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var anchor = Editor.point(editor, at, {\n    edge: 'end'\n  });\n  var focus = Editor.end(editor, []);\n  var range = {\n    anchor,\n    focus\n  };\n  var {\n    distance = 1\n  } = options;\n  var d = 0;\n  var target;\n  for (var p of Editor.positions(editor, _objectSpread$7(_objectSpread$7({}, options), {}, {\n    at: range\n  }))) {\n    if (d > distance) {\n      break;\n    }\n    if (d !== 0) {\n      target = p;\n    }\n    d++;\n  }\n  return target;\n};\n\nfunction ownKeys$6(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread$6(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$6(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$6(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nvar before = function before(editor, at) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var anchor = Editor.start(editor, []);\n  var focus = Editor.point(editor, at, {\n    edge: 'start'\n  });\n  var range = {\n    anchor,\n    focus\n  };\n  var {\n    distance = 1\n  } = options;\n  var d = 0;\n  var target;\n  for (var p of Editor.positions(editor, _objectSpread$6(_objectSpread$6({}, options), {}, {\n    at: range,\n    reverse: true\n  }))) {\n    if (d > distance) {\n      break;\n    }\n    if (d !== 0) {\n      target = p;\n    }\n    d++;\n  }\n  return target;\n};\n\nvar deleteBackward = (editor, unit) => {\n  var {\n    selection\n  } = editor;\n  if (selection && Range.isCollapsed(selection)) {\n    Transforms.delete(editor, {\n      unit,\n      reverse: true\n    });\n  }\n};\n\nvar deleteForward = (editor, unit) => {\n  var {\n    selection\n  } = editor;\n  if (selection && Range.isCollapsed(selection)) {\n    Transforms.delete(editor, {\n      unit\n    });\n  }\n};\n\nvar deleteFragment = function deleteFragment(editor) {\n  var {\n    direction = 'forward'\n  } = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  var {\n    selection\n  } = editor;\n  if (selection && Range.isExpanded(selection)) {\n    Transforms.delete(editor, {\n      reverse: direction === 'backward'\n    });\n  }\n};\n\nvar edges = (editor, at) => {\n  return [Editor.start(editor, at), Editor.end(editor, at)];\n};\n\nfunction ownKeys$5(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread$5(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$5(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$5(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nvar elementReadOnly = function elementReadOnly(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  return Editor.above(editor, _objectSpread$5(_objectSpread$5({}, options), {}, {\n    match: n => Element.isElement(n) && Editor.isElementReadOnly(editor, n)\n  }));\n};\n\nvar end = (editor, at) => {\n  return Editor.point(editor, at, {\n    edge: 'end'\n  });\n};\n\nvar first = (editor, at) => {\n  var path = Editor.path(editor, at, {\n    edge: 'start'\n  });\n  return Editor.node(editor, path);\n};\n\nvar fragment = (editor, at) => {\n  var range = Editor.range(editor, at);\n  return Node.fragment(editor, range);\n};\n\nfunction ownKeys$4(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread$4(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$4(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$4(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nvar getVoid = function getVoid(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  return Editor.above(editor, _objectSpread$4(_objectSpread$4({}, options), {}, {\n    match: n => Element.isElement(n) && Editor.isVoid(editor, n)\n  }));\n};\n\nvar hasBlocks = (editor, element) => {\n  return element.children.some(n => Element.isElement(n) && Editor.isBlock(editor, n));\n};\n\nvar hasInlines = (editor, element) => {\n  return element.children.some(n => Text.isText(n) || Editor.isInline(editor, n));\n};\n\nvar hasPath = (editor, path) => {\n  return Node.has(editor, path);\n};\n\nvar hasTexts = (editor, element) => {\n  return element.children.every(n => Text.isText(n));\n};\n\nvar insertBreak = editor => {\n  Transforms.splitNodes(editor, {\n    always: true\n  });\n};\n\nvar insertNode = (editor, node, options) => {\n  Transforms.insertNodes(editor, node, options);\n};\n\nvar insertSoftBreak = editor => {\n  Transforms.splitNodes(editor, {\n    always: true\n  });\n};\n\nfunction ownKeys$3(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread$3(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$3(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$3(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nvar insertText = function insertText(editor, text) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var {\n    selection,\n    marks\n  } = editor;\n  if (selection) {\n    if (marks) {\n      var node = _objectSpread$3({\n        text\n      }, marks);\n      Transforms.insertNodes(editor, node, {\n        at: options.at,\n        voids: options.voids\n      });\n    } else {\n      Transforms.insertText(editor, text, options);\n    }\n    editor.marks = null;\n  }\n};\n\nvar isBlock = (editor, value) => {\n  return !editor.isInline(value);\n};\n\nvar isEdge = (editor, point, at) => {\n  return Editor.isStart(editor, point, at) || Editor.isEnd(editor, point, at);\n};\n\nvar isEmpty = (editor, element) => {\n  var {\n    children\n  } = element;\n  var [first] = children;\n  return children.length === 0 || children.length === 1 && Text.isText(first) && first.text === '' && !editor.isVoid(element);\n};\n\nvar isEnd = (editor, point, at) => {\n  var end = Editor.end(editor, at);\n  return Point.equals(point, end);\n};\n\nvar isNormalizing = editor => {\n  var isNormalizing = NORMALIZING.get(editor);\n  return isNormalizing === undefined ? true : isNormalizing;\n};\n\nvar isStart = (editor, point, at) => {\n  // PERF: If the offset isn't `0` we know it's not the start.\n  if (point.offset !== 0) {\n    return false;\n  }\n  var start = Editor.start(editor, at);\n  return Point.equals(point, start);\n};\n\nvar last = (editor, at) => {\n  var path = Editor.path(editor, at, {\n    edge: 'end'\n  });\n  return Editor.node(editor, path);\n};\n\nvar leaf = function leaf(editor, at) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var path = Editor.path(editor, at, options);\n  var node = Node.leaf(editor, path);\n  return [node, path];\n};\n\nfunction levels(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  return function* () {\n    var {\n      at = editor.selection,\n      reverse = false,\n      voids = false\n    } = options;\n    var {\n      match\n    } = options;\n    if (match == null) {\n      match = () => true;\n    }\n    if (!at) {\n      return;\n    }\n    var levels = [];\n    var path = Editor.path(editor, at);\n    for (var [n, p] of Node.levels(editor, path)) {\n      if (!match(n, p)) {\n        continue;\n      }\n      levels.push([n, p]);\n      if (!voids && Element.isElement(n) && Editor.isVoid(editor, n)) {\n        break;\n      }\n    }\n    if (reverse) {\n      levels.reverse();\n    }\n    yield* levels;\n  }();\n}\n\nvar _excluded$1 = [\"text\"],\n  _excluded2$1 = [\"text\"];\nvar marks = function marks(editor) {\n  var {\n    marks,\n    selection\n  } = editor;\n  if (!selection) {\n    return null;\n  }\n  var {\n    anchor,\n    focus\n  } = selection;\n  if (marks) {\n    return marks;\n  }\n  if (Range.isExpanded(selection)) {\n    /**\n     * COMPAT: Make sure hanging ranges (caused by double clicking in Firefox)\n     * do not adversely affect the returned marks.\n     */\n    var isEnd = Editor.isEnd(editor, anchor, anchor.path);\n    if (isEnd) {\n      var after = Editor.after(editor, anchor);\n      if (after) {\n        anchor = after;\n      }\n    }\n    var [match] = Editor.nodes(editor, {\n      match: Text.isText,\n      at: {\n        anchor,\n        focus\n      }\n    });\n    if (match) {\n      var [_node] = match;\n      var _rest = _objectWithoutProperties(_node, _excluded$1);\n      return _rest;\n    } else {\n      return {};\n    }\n  }\n  var {\n    path\n  } = anchor;\n  var [node] = Editor.leaf(editor, path);\n  if (anchor.offset === 0) {\n    var prev = Editor.previous(editor, {\n      at: path,\n      match: Text.isText\n    });\n    var markedVoid = Editor.above(editor, {\n      match: n => Element.isElement(n) && Editor.isVoid(editor, n) && editor.markableVoid(n)\n    });\n    if (!markedVoid) {\n      var block = Editor.above(editor, {\n        match: n => Element.isElement(n) && Editor.isBlock(editor, n)\n      });\n      if (prev && block) {\n        var [prevNode, prevPath] = prev;\n        var [, blockPath] = block;\n        if (Path.isAncestor(blockPath, prevPath)) {\n          node = prevNode;\n        }\n      }\n    }\n  }\n  var rest = _objectWithoutProperties(node, _excluded2$1);\n  return rest;\n};\n\nvar next = function next(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  var {\n    mode = 'lowest',\n    voids = false\n  } = options;\n  var {\n    match,\n    at = editor.selection\n  } = options;\n  if (!at) {\n    return;\n  }\n  var pointAfterLocation = Editor.after(editor, at, {\n    voids\n  });\n  if (!pointAfterLocation) return;\n  var [, to] = Editor.last(editor, []);\n  var span = [pointAfterLocation.path, to];\n  if (Path.isPath(at) && at.length === 0) {\n    throw new Error(\"Cannot get the next node from the root node!\");\n  }\n  if (match == null) {\n    if (Path.isPath(at)) {\n      var [parent] = Editor.parent(editor, at);\n      match = n => parent.children.includes(n);\n    } else {\n      match = () => true;\n    }\n  }\n  var [next] = Editor.nodes(editor, {\n    at: span,\n    match,\n    mode,\n    voids\n  });\n  return next;\n};\n\nvar node = function node(editor, at) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var path = Editor.path(editor, at, options);\n  var node = Node.get(editor, path);\n  return [node, path];\n};\n\nfunction nodes(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  return function* () {\n    var {\n      at = editor.selection,\n      mode = 'all',\n      universal = false,\n      reverse = false,\n      voids = false,\n      ignoreNonSelectable = false\n    } = options;\n    var {\n      match\n    } = options;\n    if (!match) {\n      match = () => true;\n    }\n    if (!at) {\n      return;\n    }\n    var from;\n    var to;\n    if (Span.isSpan(at)) {\n      from = at[0];\n      to = at[1];\n    } else {\n      var first = Editor.path(editor, at, {\n        edge: 'start'\n      });\n      var last = Editor.path(editor, at, {\n        edge: 'end'\n      });\n      from = reverse ? last : first;\n      to = reverse ? first : last;\n    }\n    var nodeEntries = Node.nodes(editor, {\n      reverse,\n      from,\n      to,\n      pass: _ref => {\n        var [node] = _ref;\n        if (!Element.isElement(node)) return false;\n        if (!voids && (Editor.isVoid(editor, node) || Editor.isElementReadOnly(editor, node))) return true;\n        if (ignoreNonSelectable && !Editor.isSelectable(editor, node)) return true;\n        return false;\n      }\n    });\n    var matches = [];\n    var hit;\n    for (var [node, path] of nodeEntries) {\n      if (ignoreNonSelectable && Element.isElement(node) && !Editor.isSelectable(editor, node)) {\n        continue;\n      }\n      var isLower = hit && Path.compare(path, hit[1]) === 0;\n      // In highest mode any node lower than the last hit is not a match.\n      if (mode === 'highest' && isLower) {\n        continue;\n      }\n      if (!match(node, path)) {\n        // If we've arrived at a leaf text node that is not lower than the last\n        // hit, then we've found a branch that doesn't include a match, which\n        // means the match is not universal.\n        if (universal && !isLower && Text.isText(node)) {\n          return;\n        } else {\n          continue;\n        }\n      }\n      // If there's a match and it's lower than the last, update the hit.\n      if (mode === 'lowest' && isLower) {\n        hit = [node, path];\n        continue;\n      }\n      // In lowest mode we emit the last hit, once it's guaranteed lowest.\n      var emit = mode === 'lowest' ? hit : [node, path];\n      if (emit) {\n        if (universal) {\n          matches.push(emit);\n        } else {\n          yield emit;\n        }\n      }\n      hit = [node, path];\n    }\n    // Since lowest is always emitting one behind, catch up at the end.\n    if (mode === 'lowest' && hit) {\n      if (universal) {\n        matches.push(hit);\n      } else {\n        yield hit;\n      }\n    }\n    // Universal defers to ensure that the match occurs in every branch, so we\n    // yield all of the matches after iterating.\n    if (universal) {\n      yield* matches;\n    }\n  }();\n}\n\nvar normalize = function normalize(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  var {\n    force = false,\n    operation\n  } = options;\n  var getDirtyPaths = editor => {\n    return DIRTY_PATHS.get(editor) || [];\n  };\n  var getDirtyPathKeys = editor => {\n    return DIRTY_PATH_KEYS.get(editor) || new Set();\n  };\n  var popDirtyPath = editor => {\n    var path = getDirtyPaths(editor).pop();\n    var key = path.join(',');\n    getDirtyPathKeys(editor).delete(key);\n    return path;\n  };\n  if (!Editor.isNormalizing(editor)) {\n    return;\n  }\n  if (force) {\n    var allPaths = Array.from(Node.nodes(editor), _ref => {\n      var [, p] = _ref;\n      return p;\n    });\n    var allPathKeys = new Set(allPaths.map(p => p.join(',')));\n    DIRTY_PATHS.set(editor, allPaths);\n    DIRTY_PATH_KEYS.set(editor, allPathKeys);\n  }\n  if (getDirtyPaths(editor).length === 0) {\n    return;\n  }\n  Editor.withoutNormalizing(editor, () => {\n    /*\n      Fix dirty elements with no children.\n      editor.normalizeNode() does fix this, but some normalization fixes also require it to work.\n      Running an initial pass avoids the catch-22 race condition.\n    */\n    for (var dirtyPath of getDirtyPaths(editor)) {\n      if (Node.has(editor, dirtyPath)) {\n        var entry = Editor.node(editor, dirtyPath);\n        var [node, _] = entry;\n        /*\n          The default normalizer inserts an empty text node in this scenario, but it can be customised.\n          So there is some risk here.\n                   As long as the normalizer only inserts child nodes for this case it is safe to do in any order;\n          by definition adding children to an empty node can't cause other paths to change.\n        */\n        if (Element.isElement(node) && node.children.length === 0) {\n          editor.normalizeNode(entry, {\n            operation\n          });\n        }\n      }\n    }\n    var dirtyPaths = getDirtyPaths(editor);\n    var initialDirtyPathsLength = dirtyPaths.length;\n    var iteration = 0;\n    while (dirtyPaths.length !== 0) {\n      if (!editor.shouldNormalize({\n        dirtyPaths,\n        iteration,\n        initialDirtyPathsLength,\n        operation\n      })) {\n        return;\n      }\n      var _dirtyPath = popDirtyPath(editor);\n      // If the node doesn't exist in the tree, it does not need to be normalized.\n      if (Node.has(editor, _dirtyPath)) {\n        var _entry = Editor.node(editor, _dirtyPath);\n        editor.normalizeNode(_entry, {\n          operation\n        });\n      }\n      iteration++;\n      dirtyPaths = getDirtyPaths(editor);\n    }\n  });\n};\n\nvar parent = function parent(editor, at) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var path = Editor.path(editor, at, options);\n  var parentPath = Path.parent(path);\n  var entry = Editor.node(editor, parentPath);\n  return entry;\n};\n\nvar pathRef = function pathRef(editor, path) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var {\n    affinity = 'forward'\n  } = options;\n  var ref = {\n    current: path,\n    affinity,\n    unref() {\n      var {\n        current\n      } = ref;\n      var pathRefs = Editor.pathRefs(editor);\n      pathRefs.delete(ref);\n      ref.current = null;\n      return current;\n    }\n  };\n  var refs = Editor.pathRefs(editor);\n  refs.add(ref);\n  return ref;\n};\n\nvar pathRefs = editor => {\n  var refs = PATH_REFS.get(editor);\n  if (!refs) {\n    refs = new Set();\n    PATH_REFS.set(editor, refs);\n  }\n  return refs;\n};\n\nvar path = function path(editor, at) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var {\n    depth,\n    edge\n  } = options;\n  if (Path.isPath(at)) {\n    if (edge === 'start') {\n      var [, firstPath] = Node.first(editor, at);\n      at = firstPath;\n    } else if (edge === 'end') {\n      var [, lastPath] = Node.last(editor, at);\n      at = lastPath;\n    }\n  }\n  if (Range.isRange(at)) {\n    if (edge === 'start') {\n      at = Range.start(at);\n    } else if (edge === 'end') {\n      at = Range.end(at);\n    } else {\n      at = Path.common(at.anchor.path, at.focus.path);\n    }\n  }\n  if (Point.isPoint(at)) {\n    at = at.path;\n  }\n  if (depth != null) {\n    at = at.slice(0, depth);\n  }\n  return at;\n};\n\nvar pointRef = function pointRef(editor, point) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var {\n    affinity = 'forward'\n  } = options;\n  var ref = {\n    current: point,\n    affinity,\n    unref() {\n      var {\n        current\n      } = ref;\n      var pointRefs = Editor.pointRefs(editor);\n      pointRefs.delete(ref);\n      ref.current = null;\n      return current;\n    }\n  };\n  var refs = Editor.pointRefs(editor);\n  refs.add(ref);\n  return ref;\n};\n\nvar pointRefs = editor => {\n  var refs = POINT_REFS.get(editor);\n  if (!refs) {\n    refs = new Set();\n    POINT_REFS.set(editor, refs);\n  }\n  return refs;\n};\n\nvar point = function point(editor, at) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var {\n    edge = 'start'\n  } = options;\n  if (Path.isPath(at)) {\n    var path;\n    if (edge === 'end') {\n      var [, lastPath] = Node.last(editor, at);\n      path = lastPath;\n    } else {\n      var [, firstPath] = Node.first(editor, at);\n      path = firstPath;\n    }\n    var node = Node.get(editor, path);\n    if (!Text.isText(node)) {\n      throw new Error(\"Cannot get the \".concat(edge, \" point in the node at path [\").concat(at, \"] because it has no \").concat(edge, \" text node.\"));\n    }\n    return {\n      path,\n      offset: edge === 'end' ? node.text.length : 0\n    };\n  }\n  if (Range.isRange(at)) {\n    var [start, end] = Range.edges(at);\n    return edge === 'start' ? start : end;\n  }\n  return at;\n};\n\nfunction positions(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  return function* () {\n    var {\n      at = editor.selection,\n      unit = 'offset',\n      reverse = false,\n      voids = false,\n      ignoreNonSelectable = false\n    } = options;\n    if (!at) {\n      return;\n    }\n    /**\n     * Algorithm notes:\n     *\n     * Each step `distance` is dynamic depending on the underlying text\n     * and the `unit` specified.  Each step, e.g., a line or word, may\n     * span multiple text nodes, so we iterate through the text both on\n     * two levels in step-sync:\n     *\n     * `leafText` stores the text on a text leaf level, and is advanced\n     * through using the counters `leafTextOffset` and `leafTextRemaining`.\n     *\n     * `blockText` stores the text on a block level, and is shortened\n     * by `distance` every time it is advanced.\n     *\n     * We only maintain a window of one blockText and one leafText because\n     * a block node always appears before all of its leaf nodes.\n     */\n    var range = Editor.range(editor, at);\n    var [start, end] = Range.edges(range);\n    var first = reverse ? end : start;\n    var isNewBlock = false;\n    var blockText = '';\n    var distance = 0; // Distance for leafText to catch up to blockText.\n    var leafTextRemaining = 0;\n    var leafTextOffset = 0;\n    // Iterate through all nodes in range, grabbing entire textual content\n    // of block nodes in blockText, and text nodes in leafText.\n    // Exploits the fact that nodes are sequenced in such a way that we first\n    // encounter the block node, then all of its text nodes, so when iterating\n    // through the blockText and leafText we just need to remember a window of\n    // one block node and leaf node, respectively.\n    for (var [node, path] of Editor.nodes(editor, {\n      at,\n      reverse,\n      voids,\n      ignoreNonSelectable\n    })) {\n      /*\n       * ELEMENT NODE - Yield position(s) for voids, collect blockText for blocks\n       */\n      if (Element.isElement(node)) {\n        // Void nodes are a special case, so by default we will always\n        // yield their first point. If the `voids` option is set to true,\n        // then we will iterate over their content.\n        if (!voids && (editor.isVoid(node) || editor.isElementReadOnly(node))) {\n          yield Editor.start(editor, path);\n          continue;\n        }\n        // Inline element nodes are ignored as they don't themselves\n        // contribute to `blockText` or `leafText` - their parent and\n        // children do.\n        if (editor.isInline(node)) continue;\n        // Block element node - set `blockText` to its text content.\n        if (Editor.hasInlines(editor, node)) {\n          // We always exhaust block nodes before encountering a new one:\n          //   console.assert(blockText === '',\n          //     `blockText='${blockText}' - `+\n          //     `not exhausted before new block node`, path)\n          // Ensure range considered is capped to `range`, in the\n          // start/end edge cases where block extends beyond range.\n          // Equivalent to this, but presumably more performant:\n          //   blockRange = Editor.range(editor, ...Editor.edges(editor, path))\n          //   blockRange = Range.intersection(range, blockRange) // intersect\n          //   blockText = Editor.string(editor, blockRange, { voids })\n          var e = Path.isAncestor(path, end.path) ? end : Editor.end(editor, path);\n          var s = Path.isAncestor(path, start.path) ? start : Editor.start(editor, path);\n          blockText = Editor.string(editor, {\n            anchor: s,\n            focus: e\n          }, {\n            voids\n          });\n          isNewBlock = true;\n        }\n      }\n      /*\n       * TEXT LEAF NODE - Iterate through text content, yielding\n       * positions every `distance` offset according to `unit`.\n       */\n      if (Text.isText(node)) {\n        var isFirst = Path.equals(path, first.path);\n        // Proof that we always exhaust text nodes before encountering a new one:\n        //   console.assert(leafTextRemaining <= 0,\n        //     `leafTextRemaining=${leafTextRemaining} - `+\n        //     `not exhausted before new leaf text node`, path)\n        // Reset `leafText` counters for new text node.\n        if (isFirst) {\n          leafTextRemaining = reverse ? first.offset : node.text.length - first.offset;\n          leafTextOffset = first.offset; // Works for reverse too.\n        } else {\n          leafTextRemaining = node.text.length;\n          leafTextOffset = reverse ? leafTextRemaining : 0;\n        }\n        // Yield position at the start of node (potentially).\n        if (isFirst || isNewBlock || unit === 'offset') {\n          yield {\n            path,\n            offset: leafTextOffset\n          };\n          isNewBlock = false;\n        }\n        // Yield positions every (dynamically calculated) `distance` offset.\n        while (true) {\n          // If `leafText` has caught up with `blockText` (distance=0),\n          // and if blockText is exhausted, break to get another block node,\n          // otherwise advance blockText forward by the new `distance`.\n          if (distance === 0) {\n            if (blockText === '') break;\n            distance = calcDistance(blockText, unit, reverse);\n            // Split the string at the previously found distance and use the\n            // remaining string for the next iteration.\n            blockText = splitByCharacterDistance(blockText, distance, reverse)[1];\n          }\n          // Advance `leafText` by the current `distance`.\n          leafTextOffset = reverse ? leafTextOffset - distance : leafTextOffset + distance;\n          leafTextRemaining = leafTextRemaining - distance;\n          // If `leafText` is exhausted, break to get a new leaf node\n          // and set distance to the overflow amount, so we'll (maybe)\n          // catch up to blockText in the next leaf text node.\n          if (leafTextRemaining < 0) {\n            distance = -leafTextRemaining;\n            break;\n          }\n          // Successfully walked `distance` offsets through `leafText`\n          // to catch up with `blockText`, so we can reset `distance`\n          // and yield this position in this node.\n          distance = 0;\n          yield {\n            path,\n            offset: leafTextOffset\n          };\n        }\n      }\n    }\n    // Proof that upon completion, we've exahusted both leaf and block text:\n    //   console.assert(leafTextRemaining <= 0, \"leafText wasn't exhausted\")\n    //   console.assert(blockText === '', \"blockText wasn't exhausted\")\n    // Helper:\n    // Return the distance in offsets for a step of size `unit` on given string.\n    function calcDistance(text, unit, reverse) {\n      if (unit === 'character') {\n        return getCharacterDistance(text, reverse);\n      } else if (unit === 'word') {\n        return getWordDistance(text, reverse);\n      } else if (unit === 'line' || unit === 'block') {\n        return text.length;\n      }\n      return 1;\n    }\n  }();\n}\n\nvar previous = function previous(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  var {\n    mode = 'lowest',\n    voids = false\n  } = options;\n  var {\n    match,\n    at = editor.selection\n  } = options;\n  if (!at) {\n    return;\n  }\n  var pointBeforeLocation = Editor.before(editor, at, {\n    voids\n  });\n  if (!pointBeforeLocation) {\n    return;\n  }\n  var [, to] = Editor.first(editor, []);\n  // The search location is from the start of the document to the path of\n  // the point before the location passed in\n  var span = [pointBeforeLocation.path, to];\n  if (Path.isPath(at) && at.length === 0) {\n    throw new Error(\"Cannot get the previous node from the root node!\");\n  }\n  if (match == null) {\n    if (Path.isPath(at)) {\n      var [parent] = Editor.parent(editor, at);\n      match = n => parent.children.includes(n);\n    } else {\n      match = () => true;\n    }\n  }\n  var [previous] = Editor.nodes(editor, {\n    reverse: true,\n    at: span,\n    match,\n    mode,\n    voids\n  });\n  return previous;\n};\n\nvar rangeRef = function rangeRef(editor, range) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var {\n    affinity = 'forward'\n  } = options;\n  var ref = {\n    current: range,\n    affinity,\n    unref() {\n      var {\n        current\n      } = ref;\n      var rangeRefs = Editor.rangeRefs(editor);\n      rangeRefs.delete(ref);\n      ref.current = null;\n      return current;\n    }\n  };\n  var refs = Editor.rangeRefs(editor);\n  refs.add(ref);\n  return ref;\n};\n\nvar rangeRefs = editor => {\n  var refs = RANGE_REFS.get(editor);\n  if (!refs) {\n    refs = new Set();\n    RANGE_REFS.set(editor, refs);\n  }\n  return refs;\n};\n\nvar range = (editor, at, to) => {\n  if (Range.isRange(at) && !to) {\n    return at;\n  }\n  var start = Editor.start(editor, at);\n  var end = Editor.end(editor, to || at);\n  return {\n    anchor: start,\n    focus: end\n  };\n};\n\nfunction ownKeys$2(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread$2(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$2(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$2(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nvar removeMark = (editor, key) => {\n  var {\n    selection\n  } = editor;\n  if (selection) {\n    var match = (node, path) => {\n      if (!Text.isText(node)) {\n        return false; // marks can only be applied to text\n      }\n\n      var [parentNode, parentPath] = Editor.parent(editor, path);\n      return !editor.isVoid(parentNode) || editor.markableVoid(parentNode);\n    };\n    var expandedSelection = Range.isExpanded(selection);\n    var markAcceptingVoidSelected = false;\n    if (!expandedSelection) {\n      var [selectedNode, selectedPath] = Editor.node(editor, selection);\n      if (selectedNode && match(selectedNode, selectedPath)) {\n        var [parentNode] = Editor.parent(editor, selectedPath);\n        markAcceptingVoidSelected = parentNode && editor.markableVoid(parentNode);\n      }\n    }\n    if (expandedSelection || markAcceptingVoidSelected) {\n      Transforms.unsetNodes(editor, key, {\n        match,\n        split: true,\n        voids: true\n      });\n    } else {\n      var marks = _objectSpread$2({}, Editor.marks(editor) || {});\n      delete marks[key];\n      editor.marks = marks;\n      if (!FLUSHING.get(editor)) {\n        editor.onChange();\n      }\n    }\n  }\n};\n\nvar setNormalizing = (editor, isNormalizing) => {\n  NORMALIZING.set(editor, isNormalizing);\n};\n\nvar start = (editor, at) => {\n  return Editor.point(editor, at, {\n    edge: 'start'\n  });\n};\n\nvar string = function string(editor, at) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var {\n    voids = false\n  } = options;\n  var range = Editor.range(editor, at);\n  var [start, end] = Range.edges(range);\n  var text = '';\n  for (var [node, path] of Editor.nodes(editor, {\n    at: range,\n    match: Text.isText,\n    voids\n  })) {\n    var t = node.text;\n    if (Path.equals(path, end.path)) {\n      t = t.slice(0, end.offset);\n    }\n    if (Path.equals(path, start.path)) {\n      t = t.slice(start.offset);\n    }\n    text += t;\n  }\n  return text;\n};\n\nvar unhangRange = function unhangRange(editor, range) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var {\n    voids = false\n  } = options;\n  var [start, end] = Range.edges(range);\n  // PERF: exit early if we can guarantee that the range isn't hanging.\n  if (start.offset !== 0 || end.offset !== 0 || Range.isCollapsed(range) || Path.hasPrevious(end.path)) {\n    return range;\n  }\n  var endBlock = Editor.above(editor, {\n    at: end,\n    match: n => Element.isElement(n) && Editor.isBlock(editor, n),\n    voids\n  });\n  var blockPath = endBlock ? endBlock[1] : [];\n  var first = Editor.start(editor, start);\n  var before = {\n    anchor: first,\n    focus: end\n  };\n  var skip = true;\n  for (var [node, path] of Editor.nodes(editor, {\n    at: before,\n    match: Text.isText,\n    reverse: true,\n    voids\n  })) {\n    if (skip) {\n      skip = false;\n      continue;\n    }\n    if (node.text !== '' || Path.isBefore(path, blockPath)) {\n      end = {\n        path,\n        offset: node.text.length\n      };\n      break;\n    }\n  }\n  return {\n    anchor: start,\n    focus: end\n  };\n};\n\nvar withoutNormalizing = (editor, fn) => {\n  var value = Editor.isNormalizing(editor);\n  Editor.setNormalizing(editor, false);\n  try {\n    fn();\n  } finally {\n    Editor.setNormalizing(editor, value);\n  }\n  Editor.normalize(editor);\n};\n\nvar deleteText = function deleteText(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  Editor.withoutNormalizing(editor, () => {\n    var _Editor$void, _Editor$void2;\n    var {\n      reverse = false,\n      unit = 'character',\n      distance = 1,\n      voids = false\n    } = options;\n    var {\n      at = editor.selection,\n      hanging = false\n    } = options;\n    if (!at) {\n      return;\n    }\n    var isCollapsed = false;\n    if (Range.isRange(at) && Range.isCollapsed(at)) {\n      isCollapsed = true;\n      at = at.anchor;\n    }\n    if (Point.isPoint(at)) {\n      var furthestVoid = Editor.void(editor, {\n        at,\n        mode: 'highest'\n      });\n      if (!voids && furthestVoid) {\n        var [, voidPath] = furthestVoid;\n        at = voidPath;\n      } else {\n        var opts = {\n          unit,\n          distance\n        };\n        var target = reverse ? Editor.before(editor, at, opts) || Editor.start(editor, []) : Editor.after(editor, at, opts) || Editor.end(editor, []);\n        at = {\n          anchor: at,\n          focus: target\n        };\n        hanging = true;\n      }\n    }\n    if (Path.isPath(at)) {\n      Transforms.removeNodes(editor, {\n        at,\n        voids\n      });\n      return;\n    }\n    if (Range.isCollapsed(at)) {\n      return;\n    }\n    if (!hanging) {\n      var [, _end] = Range.edges(at);\n      var endOfDoc = Editor.end(editor, []);\n      if (!Point.equals(_end, endOfDoc)) {\n        at = Editor.unhangRange(editor, at, {\n          voids\n        });\n      }\n    }\n    var [start, end] = Range.edges(at);\n    var startBlock = Editor.above(editor, {\n      match: n => Element.isElement(n) && Editor.isBlock(editor, n),\n      at: start,\n      voids\n    });\n    var endBlock = Editor.above(editor, {\n      match: n => Element.isElement(n) && Editor.isBlock(editor, n),\n      at: end,\n      voids\n    });\n    var isAcrossBlocks = startBlock && endBlock && !Path.equals(startBlock[1], endBlock[1]);\n    var isSingleText = Path.equals(start.path, end.path);\n    var startNonEditable = voids ? null : (_Editor$void = Editor.void(editor, {\n      at: start,\n      mode: 'highest'\n    })) !== null && _Editor$void !== void 0 ? _Editor$void : Editor.elementReadOnly(editor, {\n      at: start,\n      mode: 'highest'\n    });\n    var endNonEditable = voids ? null : (_Editor$void2 = Editor.void(editor, {\n      at: end,\n      mode: 'highest'\n    })) !== null && _Editor$void2 !== void 0 ? _Editor$void2 : Editor.elementReadOnly(editor, {\n      at: end,\n      mode: 'highest'\n    });\n    // If the start or end points are inside an inline void, nudge them out.\n    if (startNonEditable) {\n      var before = Editor.before(editor, start);\n      if (before && startBlock && Path.isAncestor(startBlock[1], before.path)) {\n        start = before;\n      }\n    }\n    if (endNonEditable) {\n      var after = Editor.after(editor, end);\n      if (after && endBlock && Path.isAncestor(endBlock[1], after.path)) {\n        end = after;\n      }\n    }\n    // Get the highest nodes that are completely inside the range, as well as\n    // the start and end nodes.\n    var matches = [];\n    var lastPath;\n    for (var entry of Editor.nodes(editor, {\n      at,\n      voids\n    })) {\n      var [node, path] = entry;\n      if (lastPath && Path.compare(path, lastPath) === 0) {\n        continue;\n      }\n      if (!voids && Element.isElement(node) && (Editor.isVoid(editor, node) || Editor.isElementReadOnly(editor, node)) || !Path.isCommon(path, start.path) && !Path.isCommon(path, end.path)) {\n        matches.push(entry);\n        lastPath = path;\n      }\n    }\n    var pathRefs = Array.from(matches, _ref => {\n      var [, p] = _ref;\n      return Editor.pathRef(editor, p);\n    });\n    var startRef = Editor.pointRef(editor, start);\n    var endRef = Editor.pointRef(editor, end);\n    var removedText = '';\n    if (!isSingleText && !startNonEditable) {\n      var _point = startRef.current;\n      var [_node] = Editor.leaf(editor, _point);\n      var {\n        path: _path\n      } = _point;\n      var {\n        offset\n      } = start;\n      var text = _node.text.slice(offset);\n      if (text.length > 0) {\n        editor.apply({\n          type: 'remove_text',\n          path: _path,\n          offset,\n          text\n        });\n        removedText = text;\n      }\n    }\n    pathRefs.reverse().map(r => r.unref()).filter(r => r !== null).forEach(p => Transforms.removeNodes(editor, {\n      at: p,\n      voids\n    }));\n    if (!endNonEditable) {\n      var _point2 = endRef.current;\n      var [_node2] = Editor.leaf(editor, _point2);\n      var {\n        path: _path2\n      } = _point2;\n      var _offset = isSingleText ? start.offset : 0;\n      var _text = _node2.text.slice(_offset, end.offset);\n      if (_text.length > 0) {\n        editor.apply({\n          type: 'remove_text',\n          path: _path2,\n          offset: _offset,\n          text: _text\n        });\n        removedText = _text;\n      }\n    }\n    if (!isSingleText && isAcrossBlocks && endRef.current && startRef.current) {\n      Transforms.mergeNodes(editor, {\n        at: endRef.current,\n        hanging: true,\n        voids\n      });\n    }\n    // For Thai script, deleting N character(s) backward should delete\n    // N code point(s) instead of an entire grapheme cluster.\n    // Therefore, the remaining code points should be inserted back.\n    if (isCollapsed && reverse && unit === 'character' && removedText.length > 1 && removedText.match(/[\\u0E00-\\u0E7F]+/)) {\n      Transforms.insertText(editor, removedText.slice(0, removedText.length - distance));\n    }\n    var startUnref = startRef.unref();\n    var endUnref = endRef.unref();\n    var point = reverse ? startUnref || endUnref : endUnref || startUnref;\n    if (options.at == null && point) {\n      Transforms.select(editor, point);\n    }\n  });\n};\n\nvar insertFragment = function insertFragment(editor, fragment) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  Editor.withoutNormalizing(editor, () => {\n    var {\n      hanging = false,\n      voids = false\n    } = options;\n    var {\n      at = getDefaultInsertLocation(editor),\n      batchDirty = true\n    } = options;\n    if (!fragment.length) {\n      return;\n    }\n    if (Range.isRange(at)) {\n      if (!hanging) {\n        at = Editor.unhangRange(editor, at, {\n          voids\n        });\n      }\n      if (Range.isCollapsed(at)) {\n        at = at.anchor;\n      } else {\n        var [, end] = Range.edges(at);\n        if (!voids && Editor.void(editor, {\n          at: end\n        })) {\n          return;\n        }\n        var pointRef = Editor.pointRef(editor, end);\n        Transforms.delete(editor, {\n          at\n        });\n        at = pointRef.unref();\n      }\n    } else if (Path.isPath(at)) {\n      at = Editor.start(editor, at);\n    }\n    if (!voids && Editor.void(editor, {\n      at\n    })) {\n      return;\n    }\n    // If the insert point is at the edge of an inline node, move it outside\n    // instead since it will need to be split otherwise.\n    var inlineElementMatch = Editor.above(editor, {\n      at,\n      match: n => Element.isElement(n) && Editor.isInline(editor, n),\n      mode: 'highest',\n      voids\n    });\n    if (inlineElementMatch) {\n      var [, _inlinePath] = inlineElementMatch;\n      if (Editor.isEnd(editor, at, _inlinePath)) {\n        var after = Editor.after(editor, _inlinePath);\n        at = after;\n      } else if (Editor.isStart(editor, at, _inlinePath)) {\n        var before = Editor.before(editor, _inlinePath);\n        at = before;\n      }\n    }\n    var blockMatch = Editor.above(editor, {\n      match: n => Element.isElement(n) && Editor.isBlock(editor, n),\n      at,\n      voids\n    });\n    var [, blockPath] = blockMatch;\n    var isBlockStart = Editor.isStart(editor, at, blockPath);\n    var isBlockEnd = Editor.isEnd(editor, at, blockPath);\n    var isBlockEmpty = isBlockStart && isBlockEnd;\n    var mergeStart = !isBlockStart || isBlockStart && isBlockEnd;\n    var mergeEnd = !isBlockEnd;\n    var [, firstPath] = Node.first({\n      children: fragment\n    }, []);\n    var [, lastPath] = Node.last({\n      children: fragment\n    }, []);\n    var matches = [];\n    var matcher = _ref => {\n      var [n, p] = _ref;\n      var isRoot = p.length === 0;\n      if (isRoot) {\n        return false;\n      }\n      if (isBlockEmpty) {\n        return true;\n      }\n      if (mergeStart && Path.isAncestor(p, firstPath) && Element.isElement(n) && !editor.isVoid(n) && !editor.isInline(n)) {\n        return false;\n      }\n      if (mergeEnd && Path.isAncestor(p, lastPath) && Element.isElement(n) && !editor.isVoid(n) && !editor.isInline(n)) {\n        return false;\n      }\n      return true;\n    };\n    for (var entry of Node.nodes({\n      children: fragment\n    }, {\n      pass: matcher\n    })) {\n      if (matcher(entry)) {\n        matches.push(entry);\n      }\n    }\n    var starts = [];\n    var middles = [];\n    var ends = [];\n    var starting = true;\n    var hasBlocks = false;\n    for (var [node] of matches) {\n      if (Element.isElement(node) && !editor.isInline(node)) {\n        starting = false;\n        hasBlocks = true;\n        middles.push(node);\n      } else if (starting) {\n        starts.push(node);\n      } else {\n        ends.push(node);\n      }\n    }\n    var [inlineMatch] = Editor.nodes(editor, {\n      at,\n      match: n => Text.isText(n) || Editor.isInline(editor, n),\n      mode: 'highest',\n      voids\n    });\n    var [, inlinePath] = inlineMatch;\n    var isInlineStart = Editor.isStart(editor, at, inlinePath);\n    var isInlineEnd = Editor.isEnd(editor, at, inlinePath);\n    var middleRef = Editor.pathRef(editor, isBlockEnd && !ends.length ? Path.next(blockPath) : blockPath);\n    var endRef = Editor.pathRef(editor, isInlineEnd ? Path.next(inlinePath) : inlinePath);\n    Transforms.splitNodes(editor, {\n      at,\n      match: n => hasBlocks ? Element.isElement(n) && Editor.isBlock(editor, n) : Text.isText(n) || Editor.isInline(editor, n),\n      mode: hasBlocks ? 'lowest' : 'highest',\n      always: hasBlocks && (!isBlockStart || starts.length > 0) && (!isBlockEnd || ends.length > 0),\n      voids\n    });\n    var startRef = Editor.pathRef(editor, !isInlineStart || isInlineStart && isInlineEnd ? Path.next(inlinePath) : inlinePath);\n    Transforms.insertNodes(editor, starts, {\n      at: startRef.current,\n      match: n => Text.isText(n) || Editor.isInline(editor, n),\n      mode: 'highest',\n      voids,\n      batchDirty\n    });\n    if (isBlockEmpty && !starts.length && middles.length && !ends.length) {\n      Transforms.delete(editor, {\n        at: blockPath,\n        voids\n      });\n    }\n    Transforms.insertNodes(editor, middles, {\n      at: middleRef.current,\n      match: n => Element.isElement(n) && Editor.isBlock(editor, n),\n      mode: 'lowest',\n      voids,\n      batchDirty\n    });\n    Transforms.insertNodes(editor, ends, {\n      at: endRef.current,\n      match: n => Text.isText(n) || Editor.isInline(editor, n),\n      mode: 'highest',\n      voids,\n      batchDirty\n    });\n    if (!options.at) {\n      var path;\n      if (ends.length > 0 && endRef.current) {\n        path = Path.previous(endRef.current);\n      } else if (middles.length > 0 && middleRef.current) {\n        path = Path.previous(middleRef.current);\n      } else if (startRef.current) {\n        path = Path.previous(startRef.current);\n      }\n      if (path) {\n        var _end = Editor.end(editor, path);\n        Transforms.select(editor, _end);\n      }\n    }\n    startRef.unref();\n    middleRef.unref();\n    endRef.unref();\n  });\n};\n\nvar collapse = function collapse(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  var {\n    edge = 'anchor'\n  } = options;\n  var {\n    selection\n  } = editor;\n  if (!selection) {\n    return;\n  } else if (edge === 'anchor') {\n    Transforms.select(editor, selection.anchor);\n  } else if (edge === 'focus') {\n    Transforms.select(editor, selection.focus);\n  } else if (edge === 'start') {\n    var [start] = Range.edges(selection);\n    Transforms.select(editor, start);\n  } else if (edge === 'end') {\n    var [, end] = Range.edges(selection);\n    Transforms.select(editor, end);\n  }\n};\n\nvar deselect = editor => {\n  var {\n    selection\n  } = editor;\n  if (selection) {\n    editor.apply({\n      type: 'set_selection',\n      properties: selection,\n      newProperties: null\n    });\n  }\n};\n\nvar move = function move(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  var {\n    selection\n  } = editor;\n  var {\n    distance = 1,\n    unit = 'character',\n    reverse = false\n  } = options;\n  var {\n    edge = null\n  } = options;\n  if (!selection) {\n    return;\n  }\n  if (edge === 'start') {\n    edge = Range.isBackward(selection) ? 'focus' : 'anchor';\n  }\n  if (edge === 'end') {\n    edge = Range.isBackward(selection) ? 'anchor' : 'focus';\n  }\n  var {\n    anchor,\n    focus\n  } = selection;\n  var opts = {\n    distance,\n    unit,\n    ignoreNonSelectable: true\n  };\n  var props = {};\n  if (edge == null || edge === 'anchor') {\n    var point = reverse ? Editor.before(editor, anchor, opts) : Editor.after(editor, anchor, opts);\n    if (point) {\n      props.anchor = point;\n    }\n  }\n  if (edge == null || edge === 'focus') {\n    var _point = reverse ? Editor.before(editor, focus, opts) : Editor.after(editor, focus, opts);\n    if (_point) {\n      props.focus = _point;\n    }\n  }\n  Transforms.setSelection(editor, props);\n};\n\nvar select = (editor, target) => {\n  var {\n    selection\n  } = editor;\n  target = Editor.range(editor, target);\n  if (selection) {\n    Transforms.setSelection(editor, target);\n    return;\n  }\n  if (!Range.isRange(target)) {\n    throw new Error(\"When setting the selection and the current selection is `null` you must provide at least an `anchor` and `focus`, but you passed: \".concat(Scrubber.stringify(target)));\n  }\n  editor.apply({\n    type: 'set_selection',\n    properties: selection,\n    newProperties: target\n  });\n};\n\nfunction ownKeys$1(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread$1(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys$1(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys$1(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nvar setPoint = function setPoint(editor, props) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  var {\n    selection\n  } = editor;\n  var {\n    edge = 'both'\n  } = options;\n  if (!selection) {\n    return;\n  }\n  if (edge === 'start') {\n    edge = Range.isBackward(selection) ? 'focus' : 'anchor';\n  }\n  if (edge === 'end') {\n    edge = Range.isBackward(selection) ? 'anchor' : 'focus';\n  }\n  var {\n    anchor,\n    focus\n  } = selection;\n  var point = edge === 'anchor' ? anchor : focus;\n  Transforms.setSelection(editor, {\n    [edge === 'anchor' ? 'anchor' : 'focus']: _objectSpread$1(_objectSpread$1({}, point), props)\n  });\n};\n\nvar setSelection = (editor, props) => {\n  var {\n    selection\n  } = editor;\n  var oldProps = {};\n  var newProps = {};\n  if (!selection) {\n    return;\n  }\n  for (var k in props) {\n    if (k === 'anchor' && props.anchor != null && !Point.equals(props.anchor, selection.anchor) || k === 'focus' && props.focus != null && !Point.equals(props.focus, selection.focus) || k !== 'anchor' && k !== 'focus' && props[k] !== selection[k]) {\n      oldProps[k] = selection[k];\n      newProps[k] = props[k];\n    }\n  }\n  if (Object.keys(oldProps).length > 0) {\n    editor.apply({\n      type: 'set_selection',\n      properties: oldProps,\n      newProperties: newProps\n    });\n  }\n};\n\nvar insertNodes = function insertNodes(editor, nodes) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  Editor.withoutNormalizing(editor, () => {\n    var {\n      hanging = false,\n      voids = false,\n      mode = 'lowest',\n      batchDirty = true\n    } = options;\n    var {\n      at,\n      match,\n      select\n    } = options;\n    if (Node.isNode(nodes)) {\n      nodes = [nodes];\n    }\n    if (nodes.length === 0) {\n      return;\n    }\n    var [node] = nodes;\n    if (!at) {\n      at = getDefaultInsertLocation(editor);\n      if (select !== false) {\n        select = true;\n      }\n    }\n    if (select == null) {\n      select = false;\n    }\n    if (Range.isRange(at)) {\n      if (!hanging) {\n        at = Editor.unhangRange(editor, at, {\n          voids\n        });\n      }\n      if (Range.isCollapsed(at)) {\n        at = at.anchor;\n      } else {\n        var [, end] = Range.edges(at);\n        var pointRef = Editor.pointRef(editor, end);\n        Transforms.delete(editor, {\n          at\n        });\n        at = pointRef.unref();\n      }\n    }\n    if (Point.isPoint(at)) {\n      if (match == null) {\n        if (Text.isText(node)) {\n          match = n => Text.isText(n);\n        } else if (editor.isInline(node)) {\n          match = n => Text.isText(n) || Editor.isInline(editor, n);\n        } else {\n          match = n => Element.isElement(n) && Editor.isBlock(editor, n);\n        }\n      }\n      var [entry] = Editor.nodes(editor, {\n        at: at.path,\n        match,\n        mode,\n        voids\n      });\n      if (entry) {\n        var [, matchPath] = entry;\n        var pathRef = Editor.pathRef(editor, matchPath);\n        var isAtEnd = Editor.isEnd(editor, at, matchPath);\n        Transforms.splitNodes(editor, {\n          at,\n          match,\n          mode,\n          voids\n        });\n        var path = pathRef.unref();\n        at = isAtEnd ? Path.next(path) : path;\n      } else {\n        return;\n      }\n    }\n    var parentPath = Path.parent(at);\n    var index = at[at.length - 1];\n    if (!voids && Editor.void(editor, {\n      at: parentPath\n    })) {\n      return;\n    }\n    if (batchDirty) {\n      // PERF: batch update dirty paths\n      // batched ops used to transform existing dirty paths\n      var batchedOps = [];\n      var newDirtyPaths = Path.levels(parentPath);\n      batchDirtyPaths(editor, () => {\n        var _loop = function _loop() {\n          var path = parentPath.concat(index);\n          index++;\n          var op = {\n            type: 'insert_node',\n            path,\n            node: _node\n          };\n          editor.apply(op);\n          at = Path.next(at);\n          batchedOps.push(op);\n          if (!Text.isText) {\n            newDirtyPaths.push(path);\n          } else {\n            newDirtyPaths.push(...Array.from(Node.nodes(_node), _ref => {\n              var [, p] = _ref;\n              return path.concat(p);\n            }));\n          }\n        };\n        for (var _node of nodes) {\n          _loop();\n        }\n      }, () => {\n        updateDirtyPaths(editor, newDirtyPaths, p => {\n          var newPath = p;\n          for (var op of batchedOps) {\n            if (Path.operationCanTransformPath(op)) {\n              newPath = Path.transform(newPath, op);\n              if (!newPath) {\n                return null;\n              }\n            }\n          }\n          return newPath;\n        });\n      });\n    } else {\n      for (var _node2 of nodes) {\n        var _path = parentPath.concat(index);\n        index++;\n        editor.apply({\n          type: 'insert_node',\n          path: _path,\n          node: _node2\n        });\n        at = Path.next(at);\n      }\n    }\n    at = Path.previous(at);\n    if (select) {\n      var point = Editor.end(editor, at);\n      if (point) {\n        Transforms.select(editor, point);\n      }\n    }\n  });\n};\n\nvar liftNodes = function liftNodes(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  Editor.withoutNormalizing(editor, () => {\n    var {\n      at = editor.selection,\n      mode = 'lowest',\n      voids = false\n    } = options;\n    var {\n      match\n    } = options;\n    if (match == null) {\n      match = Path.isPath(at) ? matchPath(editor, at) : n => Element.isElement(n) && Editor.isBlock(editor, n);\n    }\n    if (!at) {\n      return;\n    }\n    var matches = Editor.nodes(editor, {\n      at,\n      match,\n      mode,\n      voids\n    });\n    var pathRefs = Array.from(matches, _ref => {\n      var [, p] = _ref;\n      return Editor.pathRef(editor, p);\n    });\n    for (var pathRef of pathRefs) {\n      var path = pathRef.unref();\n      if (path.length < 2) {\n        throw new Error(\"Cannot lift node at a path [\".concat(path, \"] because it has a depth of less than `2`.\"));\n      }\n      var parentNodeEntry = Editor.node(editor, Path.parent(path));\n      var [parent, parentPath] = parentNodeEntry;\n      var index = path[path.length - 1];\n      var {\n        length\n      } = parent.children;\n      if (length === 1) {\n        var toPath = Path.next(parentPath);\n        Transforms.moveNodes(editor, {\n          at: path,\n          to: toPath,\n          voids\n        });\n        Transforms.removeNodes(editor, {\n          at: parentPath,\n          voids\n        });\n      } else if (index === 0) {\n        Transforms.moveNodes(editor, {\n          at: path,\n          to: parentPath,\n          voids\n        });\n      } else if (index === length - 1) {\n        var _toPath = Path.next(parentPath);\n        Transforms.moveNodes(editor, {\n          at: path,\n          to: _toPath,\n          voids\n        });\n      } else {\n        var splitPath = Path.next(path);\n        var _toPath2 = Path.next(parentPath);\n        Transforms.splitNodes(editor, {\n          at: splitPath,\n          voids\n        });\n        Transforms.moveNodes(editor, {\n          at: path,\n          to: _toPath2,\n          voids\n        });\n      }\n    }\n  });\n};\n\nvar _excluded = [\"text\"],\n  _excluded2 = [\"children\"];\nvar hasSingleChildNest = (editor, node) => {\n  if (Element.isElement(node)) {\n    var element = node;\n    if (Editor.isVoid(editor, node)) {\n      return true;\n    } else if (element.children.length === 1) {\n      return hasSingleChildNest(editor, element.children[0]);\n    } else {\n      return false;\n    }\n  } else if (Editor.isEditor(node)) {\n    return false;\n  } else {\n    return true;\n  }\n};\nvar mergeNodes = function mergeNodes(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  Editor.withoutNormalizing(editor, () => {\n    var {\n      match,\n      at = editor.selection\n    } = options;\n    var {\n      hanging = false,\n      voids = false,\n      mode = 'lowest'\n    } = options;\n    if (!at) {\n      return;\n    }\n    if (match == null) {\n      if (Path.isPath(at)) {\n        var [parent] = Editor.parent(editor, at);\n        match = n => parent.children.includes(n);\n      } else {\n        match = n => Element.isElement(n) && Editor.isBlock(editor, n);\n      }\n    }\n    if (!hanging && Range.isRange(at)) {\n      at = Editor.unhangRange(editor, at, {\n        voids\n      });\n    }\n    if (Range.isRange(at)) {\n      if (Range.isCollapsed(at)) {\n        at = at.anchor;\n      } else {\n        var [, end] = Range.edges(at);\n        var pointRef = Editor.pointRef(editor, end);\n        Transforms.delete(editor, {\n          at\n        });\n        at = pointRef.unref();\n        if (options.at == null) {\n          Transforms.select(editor, at);\n        }\n      }\n    }\n    var [current] = Editor.nodes(editor, {\n      at,\n      match,\n      voids,\n      mode\n    });\n    var prev = Editor.previous(editor, {\n      at,\n      match,\n      voids,\n      mode\n    });\n    if (!current || !prev) {\n      return;\n    }\n    var [node, path] = current;\n    var [prevNode, prevPath] = prev;\n    if (path.length === 0 || prevPath.length === 0) {\n      return;\n    }\n    var newPath = Path.next(prevPath);\n    var commonPath = Path.common(path, prevPath);\n    var isPreviousSibling = Path.isSibling(path, prevPath);\n    var levels = Array.from(Editor.levels(editor, {\n      at: path\n    }), _ref => {\n      var [n] = _ref;\n      return n;\n    }).slice(commonPath.length).slice(0, -1);\n    // Determine if the merge will leave an ancestor of the path empty as a\n    // result, in which case we'll want to remove it after merging.\n    var emptyAncestor = Editor.above(editor, {\n      at: path,\n      mode: 'highest',\n      match: n => levels.includes(n) && hasSingleChildNest(editor, n)\n    });\n    var emptyRef = emptyAncestor && Editor.pathRef(editor, emptyAncestor[1]);\n    var properties;\n    var position;\n    // Ensure that the nodes are equivalent, and figure out what the position\n    // and extra properties of the merge will be.\n    if (Text.isText(node) && Text.isText(prevNode)) {\n      var rest = _objectWithoutProperties(node, _excluded);\n      position = prevNode.text.length;\n      properties = rest;\n    } else if (Element.isElement(node) && Element.isElement(prevNode)) {\n      var rest = _objectWithoutProperties(node, _excluded2);\n      position = prevNode.children.length;\n      properties = rest;\n    } else {\n      throw new Error(\"Cannot merge the node at path [\".concat(path, \"] with the previous sibling because it is not the same kind: \").concat(Scrubber.stringify(node), \" \").concat(Scrubber.stringify(prevNode)));\n    }\n    // If the node isn't already the next sibling of the previous node, move\n    // it so that it is before merging.\n    if (!isPreviousSibling) {\n      Transforms.moveNodes(editor, {\n        at: path,\n        to: newPath,\n        voids\n      });\n    }\n    // If there was going to be an empty ancestor of the node that was merged,\n    // we remove it from the tree.\n    if (emptyRef) {\n      Transforms.removeNodes(editor, {\n        at: emptyRef.current,\n        voids\n      });\n    }\n    // If the target node that we're merging with is empty, remove it instead\n    // of merging the two. This is a common rich text editor behavior to\n    // prevent losing formatting when deleting entire nodes when you have a\n    // hanging selection.\n    // if prevNode is first child in parent,don't remove it.\n    if (Element.isElement(prevNode) && Editor.isEmpty(editor, prevNode) || Text.isText(prevNode) && prevNode.text === '' && prevPath[prevPath.length - 1] !== 0) {\n      Transforms.removeNodes(editor, {\n        at: prevPath,\n        voids\n      });\n    } else {\n      editor.apply({\n        type: 'merge_node',\n        path: newPath,\n        position,\n        properties\n      });\n    }\n    if (emptyRef) {\n      emptyRef.unref();\n    }\n  });\n};\n\nvar moveNodes = (editor, options) => {\n  Editor.withoutNormalizing(editor, () => {\n    var {\n      to,\n      at = editor.selection,\n      mode = 'lowest',\n      voids = false\n    } = options;\n    var {\n      match\n    } = options;\n    if (!at) {\n      return;\n    }\n    if (match == null) {\n      match = Path.isPath(at) ? matchPath(editor, at) : n => Element.isElement(n) && Editor.isBlock(editor, n);\n    }\n    var toRef = Editor.pathRef(editor, to);\n    var targets = Editor.nodes(editor, {\n      at,\n      match,\n      mode,\n      voids\n    });\n    var pathRefs = Array.from(targets, _ref => {\n      var [, p] = _ref;\n      return Editor.pathRef(editor, p);\n    });\n    for (var pathRef of pathRefs) {\n      var path = pathRef.unref();\n      var newPath = toRef.current;\n      if (path.length !== 0) {\n        editor.apply({\n          type: 'move_node',\n          path,\n          newPath\n        });\n      }\n      if (toRef.current && Path.isSibling(newPath, path) && Path.isAfter(newPath, path)) {\n        // When performing a sibling move to a later index, the path at the destination is shifted\n        // to before the insertion point instead of after. To ensure our group of nodes are inserted\n        // in the correct order we increment toRef to account for that\n        toRef.current = Path.next(toRef.current);\n      }\n    }\n    toRef.unref();\n  });\n};\n\nvar removeNodes = function removeNodes(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  Editor.withoutNormalizing(editor, () => {\n    var {\n      hanging = false,\n      voids = false,\n      mode = 'lowest'\n    } = options;\n    var {\n      at = editor.selection,\n      match\n    } = options;\n    if (!at) {\n      return;\n    }\n    if (match == null) {\n      match = Path.isPath(at) ? matchPath(editor, at) : n => Element.isElement(n) && Editor.isBlock(editor, n);\n    }\n    if (!hanging && Range.isRange(at)) {\n      at = Editor.unhangRange(editor, at, {\n        voids\n      });\n    }\n    var depths = Editor.nodes(editor, {\n      at,\n      match,\n      mode,\n      voids\n    });\n    var pathRefs = Array.from(depths, _ref => {\n      var [, p] = _ref;\n      return Editor.pathRef(editor, p);\n    });\n    for (var pathRef of pathRefs) {\n      var path = pathRef.unref();\n      if (path) {\n        var [node] = Editor.node(editor, path);\n        editor.apply({\n          type: 'remove_node',\n          path,\n          node\n        });\n      }\n    }\n  });\n};\n\nvar setNodes = function setNodes(editor, props) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  Editor.withoutNormalizing(editor, () => {\n    var {\n      match,\n      at = editor.selection,\n      compare,\n      merge\n    } = options;\n    var {\n      hanging = false,\n      mode = 'lowest',\n      split = false,\n      voids = false\n    } = options;\n    if (!at) {\n      return;\n    }\n    if (match == null) {\n      match = Path.isPath(at) ? matchPath(editor, at) : n => Element.isElement(n) && Editor.isBlock(editor, n);\n    }\n    if (!hanging && Range.isRange(at)) {\n      at = Editor.unhangRange(editor, at, {\n        voids\n      });\n    }\n    if (split && Range.isRange(at)) {\n      if (Range.isCollapsed(at) && Editor.leaf(editor, at.anchor)[0].text.length > 0) {\n        // If the range is collapsed in a non-empty node and 'split' is true, there's nothing to\n        // set that won't get normalized away\n        return;\n      }\n      var rangeRef = Editor.rangeRef(editor, at, {\n        affinity: 'inward'\n      });\n      var [start, end] = Range.edges(at);\n      var splitMode = mode === 'lowest' ? 'lowest' : 'highest';\n      var endAtEndOfNode = Editor.isEnd(editor, end, end.path);\n      Transforms.splitNodes(editor, {\n        at: end,\n        match,\n        mode: splitMode,\n        voids,\n        always: !endAtEndOfNode\n      });\n      var startAtStartOfNode = Editor.isStart(editor, start, start.path);\n      Transforms.splitNodes(editor, {\n        at: start,\n        match,\n        mode: splitMode,\n        voids,\n        always: !startAtStartOfNode\n      });\n      at = rangeRef.unref();\n      if (options.at == null) {\n        Transforms.select(editor, at);\n      }\n    }\n    if (!compare) {\n      compare = (prop, nodeProp) => prop !== nodeProp;\n    }\n    for (var [node, path] of Editor.nodes(editor, {\n      at,\n      match,\n      mode,\n      voids\n    })) {\n      var properties = {};\n      // FIXME: is this correct?\n      var newProperties = {};\n      // You can't set properties on the editor node.\n      if (path.length === 0) {\n        continue;\n      }\n      var hasChanges = false;\n      for (var k in props) {\n        if (k === 'children' || k === 'text') {\n          continue;\n        }\n        if (compare(props[k], node[k])) {\n          hasChanges = true;\n          // Omit new properties from the old properties list\n          if (node.hasOwnProperty(k)) properties[k] = node[k];\n          // Omit properties that have been removed from the new properties list\n          if (merge) {\n            if (props[k] != null) newProperties[k] = merge(node[k], props[k]);\n          } else {\n            if (props[k] != null) newProperties[k] = props[k];\n          }\n        }\n      }\n      if (hasChanges) {\n        editor.apply({\n          type: 'set_node',\n          path,\n          properties,\n          newProperties\n        });\n      }\n    }\n  });\n};\n\n/**\n * Convert a range into a point by deleting it's content.\n */\nvar deleteRange = (editor, range) => {\n  if (Range.isCollapsed(range)) {\n    return range.anchor;\n  } else {\n    var [, end] = Range.edges(range);\n    var pointRef = Editor.pointRef(editor, end);\n    Transforms.delete(editor, {\n      at: range\n    });\n    return pointRef.unref();\n  }\n};\nvar splitNodes = function splitNodes(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  Editor.withoutNormalizing(editor, () => {\n    var {\n      mode = 'lowest',\n      voids = false\n    } = options;\n    var {\n      match,\n      at = editor.selection,\n      height = 0,\n      always = false\n    } = options;\n    if (match == null) {\n      match = n => Element.isElement(n) && Editor.isBlock(editor, n);\n    }\n    if (Range.isRange(at)) {\n      at = deleteRange(editor, at);\n    }\n    // If the target is a path, the default height-skipping and position\n    // counters need to account for us potentially splitting at a non-leaf.\n    if (Path.isPath(at)) {\n      var path = at;\n      var point = Editor.point(editor, path);\n      var [parent] = Editor.parent(editor, path);\n      match = n => n === parent;\n      height = point.path.length - path.length + 1;\n      at = point;\n      always = true;\n    }\n    if (!at) {\n      return;\n    }\n    var beforeRef = Editor.pointRef(editor, at, {\n      affinity: 'backward'\n    });\n    var afterRef;\n    try {\n      var [highest] = Editor.nodes(editor, {\n        at,\n        match,\n        mode,\n        voids\n      });\n      if (!highest) {\n        return;\n      }\n      var voidMatch = Editor.void(editor, {\n        at,\n        mode: 'highest'\n      });\n      var nudge = 0;\n      if (!voids && voidMatch) {\n        var [voidNode, voidPath] = voidMatch;\n        if (Element.isElement(voidNode) && editor.isInline(voidNode)) {\n          var after = Editor.after(editor, voidPath);\n          if (!after) {\n            var text = {\n              text: ''\n            };\n            var afterPath = Path.next(voidPath);\n            Transforms.insertNodes(editor, text, {\n              at: afterPath,\n              voids\n            });\n            after = Editor.point(editor, afterPath);\n          }\n          at = after;\n          always = true;\n        }\n        var siblingHeight = at.path.length - voidPath.length;\n        height = siblingHeight + 1;\n        always = true;\n      }\n      afterRef = Editor.pointRef(editor, at);\n      var depth = at.path.length - height;\n      var [, highestPath] = highest;\n      var lowestPath = at.path.slice(0, depth);\n      var position = height === 0 ? at.offset : at.path[depth] + nudge;\n      for (var [node, _path] of Editor.levels(editor, {\n        at: lowestPath,\n        reverse: true,\n        voids\n      })) {\n        var split = false;\n        if (_path.length < highestPath.length || _path.length === 0 || !voids && Element.isElement(node) && Editor.isVoid(editor, node)) {\n          break;\n        }\n        var _point = beforeRef.current;\n        var isEnd = Editor.isEnd(editor, _point, _path);\n        if (always || !beforeRef || !Editor.isEdge(editor, _point, _path)) {\n          split = true;\n          var properties = Node.extractProps(node);\n          editor.apply({\n            type: 'split_node',\n            path: _path,\n            position,\n            properties\n          });\n        }\n        position = _path[_path.length - 1] + (split || isEnd ? 1 : 0);\n      }\n      if (options.at == null) {\n        var _point2 = afterRef.current || Editor.end(editor, []);\n        Transforms.select(editor, _point2);\n      }\n    } finally {\n      var _afterRef;\n      beforeRef.unref();\n      (_afterRef = afterRef) === null || _afterRef === void 0 || _afterRef.unref();\n    }\n  });\n};\n\nvar unsetNodes = function unsetNodes(editor, props) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  if (!Array.isArray(props)) {\n    props = [props];\n  }\n  var obj = {};\n  for (var key of props) {\n    obj[key] = null;\n  }\n  Transforms.setNodes(editor, obj, options);\n};\n\nvar unwrapNodes = function unwrapNodes(editor) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n  Editor.withoutNormalizing(editor, () => {\n    var {\n      mode = 'lowest',\n      split = false,\n      voids = false\n    } = options;\n    var {\n      at = editor.selection,\n      match\n    } = options;\n    if (!at) {\n      return;\n    }\n    if (match == null) {\n      match = Path.isPath(at) ? matchPath(editor, at) : n => Element.isElement(n) && Editor.isBlock(editor, n);\n    }\n    if (Path.isPath(at)) {\n      at = Editor.range(editor, at);\n    }\n    var rangeRef = Range.isRange(at) ? Editor.rangeRef(editor, at) : null;\n    var matches = Editor.nodes(editor, {\n      at,\n      match,\n      mode,\n      voids\n    });\n    var pathRefs = Array.from(matches, _ref => {\n      var [, p] = _ref;\n      return Editor.pathRef(editor, p);\n    }\n    // unwrapNode will call liftNode which does not support splitting the node when nested.\n    // If we do not reverse the order and call it from top to the bottom, it will remove all blocks\n    // that wrap target node. So we reverse the order.\n    ).reverse();\n    var _loop = function _loop() {\n      var path = pathRef.unref();\n      var [node] = Editor.node(editor, path);\n      var range = Editor.range(editor, path);\n      if (split && rangeRef) {\n        range = Range.intersection(rangeRef.current, range);\n      }\n      Transforms.liftNodes(editor, {\n        at: range,\n        match: n => Element.isAncestor(node) && node.children.includes(n),\n        voids\n      });\n    };\n    for (var pathRef of pathRefs) {\n      _loop();\n    }\n    if (rangeRef) {\n      rangeRef.unref();\n    }\n  });\n};\n\nfunction ownKeys(e, r) { var t = Object.keys(e); if (Object.getOwnPropertySymbols) { var o = Object.getOwnPropertySymbols(e); r && (o = o.filter(function (r) { return Object.getOwnPropertyDescriptor(e, r).enumerable; })), t.push.apply(t, o); } return t; }\nfunction _objectSpread(e) { for (var r = 1; r < arguments.length; r++) { var t = null != arguments[r] ? arguments[r] : {}; r % 2 ? ownKeys(Object(t), !0).forEach(function (r) { _defineProperty(e, r, t[r]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(e, Object.getOwnPropertyDescriptors(t)) : ownKeys(Object(t)).forEach(function (r) { Object.defineProperty(e, r, Object.getOwnPropertyDescriptor(t, r)); }); } return e; }\nvar wrapNodes = function wrapNodes(editor, element) {\n  var options = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : {};\n  Editor.withoutNormalizing(editor, () => {\n    var {\n      mode = 'lowest',\n      split = false,\n      voids = false\n    } = options;\n    var {\n      match,\n      at = editor.selection\n    } = options;\n    if (!at) {\n      return;\n    }\n    if (match == null) {\n      if (Path.isPath(at)) {\n        match = matchPath(editor, at);\n      } else if (editor.isInline(element)) {\n        match = n => Element.isElement(n) && Editor.isInline(editor, n) || Text.isText(n);\n      } else {\n        match = n => Element.isElement(n) && Editor.isBlock(editor, n);\n      }\n    }\n    if (split && Range.isRange(at)) {\n      var [start, end] = Range.edges(at);\n      var rangeRef = Editor.rangeRef(editor, at, {\n        affinity: 'inward'\n      });\n      Transforms.splitNodes(editor, {\n        at: end,\n        match,\n        voids\n      });\n      Transforms.splitNodes(editor, {\n        at: start,\n        match,\n        voids\n      });\n      at = rangeRef.unref();\n      if (options.at == null) {\n        Transforms.select(editor, at);\n      }\n    }\n    var roots = Array.from(Editor.nodes(editor, {\n      at,\n      match: editor.isInline(element) ? n => Element.isElement(n) && Editor.isBlock(editor, n) : n => Editor.isEditor(n),\n      mode: 'lowest',\n      voids\n    }));\n    var _loop = function _loop() {\n        var a = Range.isRange(at) ? Range.intersection(at, Editor.range(editor, rootPath)) : at;\n        if (!a) {\n          return 0; // continue\n        }\n        var matches = Array.from(Editor.nodes(editor, {\n          at: a,\n          match,\n          mode,\n          voids\n        }));\n        if (matches.length > 0) {\n          var [first] = matches;\n          var last = matches[matches.length - 1];\n          var [, firstPath] = first;\n          var [, lastPath] = last;\n          if (firstPath.length === 0 && lastPath.length === 0) {\n            // if there's no matching parent - usually means the node is an editor - don't do anything\n            return 0; // continue\n          }\n          var commonPath = Path.equals(firstPath, lastPath) ? Path.parent(firstPath) : Path.common(firstPath, lastPath);\n          var range = Editor.range(editor, firstPath, lastPath);\n          var commonNodeEntry = Editor.node(editor, commonPath);\n          var [commonNode] = commonNodeEntry;\n          var depth = commonPath.length + 1;\n          var wrapperPath = Path.next(lastPath.slice(0, depth));\n          var wrapper = _objectSpread(_objectSpread({}, element), {}, {\n            children: []\n          });\n          Transforms.insertNodes(editor, wrapper, {\n            at: wrapperPath,\n            voids\n          });\n          Transforms.moveNodes(editor, {\n            at: range,\n            match: n => Element.isAncestor(commonNode) && commonNode.children.includes(n),\n            to: wrapperPath.concat(0),\n            voids\n          });\n        }\n      },\n      _ret;\n    for (var [, rootPath] of roots) {\n      _ret = _loop();\n      if (_ret === 0) continue;\n    }\n  });\n};\n\n/**\n * Create a new Slate `Editor` object.\n */\nvar createEditor = () => {\n  var editor = {\n    children: [],\n    operations: [],\n    selection: null,\n    marks: null,\n    isElementReadOnly: () => false,\n    isInline: () => false,\n    isSelectable: () => true,\n    isVoid: () => false,\n    markableVoid: () => false,\n    onChange: () => {},\n    // Core\n    apply: function apply$1() {\n      for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n        args[_key] = arguments[_key];\n      }\n      return apply(editor, ...args);\n    },\n    // Editor\n    addMark: function addMark$1() {\n      for (var _len2 = arguments.length, args = new Array(_len2), _key2 = 0; _key2 < _len2; _key2++) {\n        args[_key2] = arguments[_key2];\n      }\n      return addMark(editor, ...args);\n    },\n    deleteBackward: function deleteBackward$1() {\n      for (var _len3 = arguments.length, args = new Array(_len3), _key3 = 0; _key3 < _len3; _key3++) {\n        args[_key3] = arguments[_key3];\n      }\n      return deleteBackward(editor, ...args);\n    },\n    deleteForward: function deleteForward$1() {\n      for (var _len4 = arguments.length, args = new Array(_len4), _key4 = 0; _key4 < _len4; _key4++) {\n        args[_key4] = arguments[_key4];\n      }\n      return deleteForward(editor, ...args);\n    },\n    deleteFragment: function deleteFragment$1() {\n      for (var _len5 = arguments.length, args = new Array(_len5), _key5 = 0; _key5 < _len5; _key5++) {\n        args[_key5] = arguments[_key5];\n      }\n      return deleteFragment(editor, ...args);\n    },\n    getFragment: function getFragment$1() {\n      for (var _len6 = arguments.length, args = new Array(_len6), _key6 = 0; _key6 < _len6; _key6++) {\n        args[_key6] = arguments[_key6];\n      }\n      return getFragment(editor, ...args);\n    },\n    insertBreak: function insertBreak$1() {\n      for (var _len7 = arguments.length, args = new Array(_len7), _key7 = 0; _key7 < _len7; _key7++) {\n        args[_key7] = arguments[_key7];\n      }\n      return insertBreak(editor, ...args);\n    },\n    insertSoftBreak: function insertSoftBreak$1() {\n      for (var _len8 = arguments.length, args = new Array(_len8), _key8 = 0; _key8 < _len8; _key8++) {\n        args[_key8] = arguments[_key8];\n      }\n      return insertSoftBreak(editor, ...args);\n    },\n    insertFragment: function insertFragment$1() {\n      for (var _len9 = arguments.length, args = new Array(_len9), _key9 = 0; _key9 < _len9; _key9++) {\n        args[_key9] = arguments[_key9];\n      }\n      return insertFragment(editor, ...args);\n    },\n    insertNode: function insertNode$1() {\n      for (var _len10 = arguments.length, args = new Array(_len10), _key10 = 0; _key10 < _len10; _key10++) {\n        args[_key10] = arguments[_key10];\n      }\n      return insertNode(editor, ...args);\n    },\n    insertText: function insertText$1() {\n      for (var _len11 = arguments.length, args = new Array(_len11), _key11 = 0; _key11 < _len11; _key11++) {\n        args[_key11] = arguments[_key11];\n      }\n      return insertText(editor, ...args);\n    },\n    normalizeNode: function normalizeNode$1() {\n      for (var _len12 = arguments.length, args = new Array(_len12), _key12 = 0; _key12 < _len12; _key12++) {\n        args[_key12] = arguments[_key12];\n      }\n      return normalizeNode(editor, ...args);\n    },\n    removeMark: function removeMark$1() {\n      for (var _len13 = arguments.length, args = new Array(_len13), _key13 = 0; _key13 < _len13; _key13++) {\n        args[_key13] = arguments[_key13];\n      }\n      return removeMark(editor, ...args);\n    },\n    getDirtyPaths: function getDirtyPaths$1() {\n      for (var _len14 = arguments.length, args = new Array(_len14), _key14 = 0; _key14 < _len14; _key14++) {\n        args[_key14] = arguments[_key14];\n      }\n      return getDirtyPaths(editor, ...args);\n    },\n    shouldNormalize: function shouldNormalize$1() {\n      for (var _len15 = arguments.length, args = new Array(_len15), _key15 = 0; _key15 < _len15; _key15++) {\n        args[_key15] = arguments[_key15];\n      }\n      return shouldNormalize(editor, ...args);\n    },\n    // Editor interface\n    above: function above$1() {\n      for (var _len16 = arguments.length, args = new Array(_len16), _key16 = 0; _key16 < _len16; _key16++) {\n        args[_key16] = arguments[_key16];\n      }\n      return above(editor, ...args);\n    },\n    after: function after$1() {\n      for (var _len17 = arguments.length, args = new Array(_len17), _key17 = 0; _key17 < _len17; _key17++) {\n        args[_key17] = arguments[_key17];\n      }\n      return after(editor, ...args);\n    },\n    before: function before$1() {\n      for (var _len18 = arguments.length, args = new Array(_len18), _key18 = 0; _key18 < _len18; _key18++) {\n        args[_key18] = arguments[_key18];\n      }\n      return before(editor, ...args);\n    },\n    collapse: function collapse$1() {\n      for (var _len19 = arguments.length, args = new Array(_len19), _key19 = 0; _key19 < _len19; _key19++) {\n        args[_key19] = arguments[_key19];\n      }\n      return collapse(editor, ...args);\n    },\n    delete: function _delete() {\n      for (var _len20 = arguments.length, args = new Array(_len20), _key20 = 0; _key20 < _len20; _key20++) {\n        args[_key20] = arguments[_key20];\n      }\n      return deleteText(editor, ...args);\n    },\n    deselect: function deselect$1() {\n      for (var _len21 = arguments.length, args = new Array(_len21), _key21 = 0; _key21 < _len21; _key21++) {\n        args[_key21] = arguments[_key21];\n      }\n      return deselect(editor, ...args);\n    },\n    edges: function edges$1() {\n      for (var _len22 = arguments.length, args = new Array(_len22), _key22 = 0; _key22 < _len22; _key22++) {\n        args[_key22] = arguments[_key22];\n      }\n      return edges(editor, ...args);\n    },\n    elementReadOnly: function elementReadOnly$1() {\n      for (var _len23 = arguments.length, args = new Array(_len23), _key23 = 0; _key23 < _len23; _key23++) {\n        args[_key23] = arguments[_key23];\n      }\n      return elementReadOnly(editor, ...args);\n    },\n    end: function end$1() {\n      for (var _len24 = arguments.length, args = new Array(_len24), _key24 = 0; _key24 < _len24; _key24++) {\n        args[_key24] = arguments[_key24];\n      }\n      return end(editor, ...args);\n    },\n    first: function first$1() {\n      for (var _len25 = arguments.length, args = new Array(_len25), _key25 = 0; _key25 < _len25; _key25++) {\n        args[_key25] = arguments[_key25];\n      }\n      return first(editor, ...args);\n    },\n    fragment: function fragment$1() {\n      for (var _len26 = arguments.length, args = new Array(_len26), _key26 = 0; _key26 < _len26; _key26++) {\n        args[_key26] = arguments[_key26];\n      }\n      return fragment(editor, ...args);\n    },\n    getMarks: function getMarks() {\n      for (var _len27 = arguments.length, args = new Array(_len27), _key27 = 0; _key27 < _len27; _key27++) {\n        args[_key27] = arguments[_key27];\n      }\n      return marks(editor, ...args);\n    },\n    hasBlocks: function hasBlocks$1() {\n      for (var _len28 = arguments.length, args = new Array(_len28), _key28 = 0; _key28 < _len28; _key28++) {\n        args[_key28] = arguments[_key28];\n      }\n      return hasBlocks(editor, ...args);\n    },\n    hasInlines: function hasInlines$1() {\n      for (var _len29 = arguments.length, args = new Array(_len29), _key29 = 0; _key29 < _len29; _key29++) {\n        args[_key29] = arguments[_key29];\n      }\n      return hasInlines(editor, ...args);\n    },\n    hasPath: function hasPath$1() {\n      for (var _len30 = arguments.length, args = new Array(_len30), _key30 = 0; _key30 < _len30; _key30++) {\n        args[_key30] = arguments[_key30];\n      }\n      return hasPath(editor, ...args);\n    },\n    hasTexts: function hasTexts$1() {\n      for (var _len31 = arguments.length, args = new Array(_len31), _key31 = 0; _key31 < _len31; _key31++) {\n        args[_key31] = arguments[_key31];\n      }\n      return hasTexts(editor, ...args);\n    },\n    insertNodes: function insertNodes$1() {\n      for (var _len32 = arguments.length, args = new Array(_len32), _key32 = 0; _key32 < _len32; _key32++) {\n        args[_key32] = arguments[_key32];\n      }\n      return insertNodes(editor, ...args);\n    },\n    isBlock: function isBlock$1() {\n      for (var _len33 = arguments.length, args = new Array(_len33), _key33 = 0; _key33 < _len33; _key33++) {\n        args[_key33] = arguments[_key33];\n      }\n      return isBlock(editor, ...args);\n    },\n    isEdge: function isEdge$1() {\n      for (var _len34 = arguments.length, args = new Array(_len34), _key34 = 0; _key34 < _len34; _key34++) {\n        args[_key34] = arguments[_key34];\n      }\n      return isEdge(editor, ...args);\n    },\n    isEmpty: function isEmpty$1() {\n      for (var _len35 = arguments.length, args = new Array(_len35), _key35 = 0; _key35 < _len35; _key35++) {\n        args[_key35] = arguments[_key35];\n      }\n      return isEmpty(editor, ...args);\n    },\n    isEnd: function isEnd$1() {\n      for (var _len36 = arguments.length, args = new Array(_len36), _key36 = 0; _key36 < _len36; _key36++) {\n        args[_key36] = arguments[_key36];\n      }\n      return isEnd(editor, ...args);\n    },\n    isNormalizing: function isNormalizing$1() {\n      for (var _len37 = arguments.length, args = new Array(_len37), _key37 = 0; _key37 < _len37; _key37++) {\n        args[_key37] = arguments[_key37];\n      }\n      return isNormalizing(editor, ...args);\n    },\n    isStart: function isStart$1() {\n      for (var _len38 = arguments.length, args = new Array(_len38), _key38 = 0; _key38 < _len38; _key38++) {\n        args[_key38] = arguments[_key38];\n      }\n      return isStart(editor, ...args);\n    },\n    last: function last$1() {\n      for (var _len39 = arguments.length, args = new Array(_len39), _key39 = 0; _key39 < _len39; _key39++) {\n        args[_key39] = arguments[_key39];\n      }\n      return last(editor, ...args);\n    },\n    leaf: function leaf$1() {\n      for (var _len40 = arguments.length, args = new Array(_len40), _key40 = 0; _key40 < _len40; _key40++) {\n        args[_key40] = arguments[_key40];\n      }\n      return leaf(editor, ...args);\n    },\n    levels: function levels$1() {\n      for (var _len41 = arguments.length, args = new Array(_len41), _key41 = 0; _key41 < _len41; _key41++) {\n        args[_key41] = arguments[_key41];\n      }\n      return levels(editor, ...args);\n    },\n    liftNodes: function liftNodes$1() {\n      for (var _len42 = arguments.length, args = new Array(_len42), _key42 = 0; _key42 < _len42; _key42++) {\n        args[_key42] = arguments[_key42];\n      }\n      return liftNodes(editor, ...args);\n    },\n    mergeNodes: function mergeNodes$1() {\n      for (var _len43 = arguments.length, args = new Array(_len43), _key43 = 0; _key43 < _len43; _key43++) {\n        args[_key43] = arguments[_key43];\n      }\n      return mergeNodes(editor, ...args);\n    },\n    move: function move$1() {\n      for (var _len44 = arguments.length, args = new Array(_len44), _key44 = 0; _key44 < _len44; _key44++) {\n        args[_key44] = arguments[_key44];\n      }\n      return move(editor, ...args);\n    },\n    moveNodes: function moveNodes$1() {\n      for (var _len45 = arguments.length, args = new Array(_len45), _key45 = 0; _key45 < _len45; _key45++) {\n        args[_key45] = arguments[_key45];\n      }\n      return moveNodes(editor, ...args);\n    },\n    next: function next$1() {\n      for (var _len46 = arguments.length, args = new Array(_len46), _key46 = 0; _key46 < _len46; _key46++) {\n        args[_key46] = arguments[_key46];\n      }\n      return next(editor, ...args);\n    },\n    node: function node$1() {\n      for (var _len47 = arguments.length, args = new Array(_len47), _key47 = 0; _key47 < _len47; _key47++) {\n        args[_key47] = arguments[_key47];\n      }\n      return node(editor, ...args);\n    },\n    nodes: function nodes$1() {\n      for (var _len48 = arguments.length, args = new Array(_len48), _key48 = 0; _key48 < _len48; _key48++) {\n        args[_key48] = arguments[_key48];\n      }\n      return nodes(editor, ...args);\n    },\n    normalize: function normalize$1() {\n      for (var _len49 = arguments.length, args = new Array(_len49), _key49 = 0; _key49 < _len49; _key49++) {\n        args[_key49] = arguments[_key49];\n      }\n      return normalize(editor, ...args);\n    },\n    parent: function parent$1() {\n      for (var _len50 = arguments.length, args = new Array(_len50), _key50 = 0; _key50 < _len50; _key50++) {\n        args[_key50] = arguments[_key50];\n      }\n      return parent(editor, ...args);\n    },\n    path: function path$1() {\n      for (var _len51 = arguments.length, args = new Array(_len51), _key51 = 0; _key51 < _len51; _key51++) {\n        args[_key51] = arguments[_key51];\n      }\n      return path(editor, ...args);\n    },\n    pathRef: function pathRef$1() {\n      for (var _len52 = arguments.length, args = new Array(_len52), _key52 = 0; _key52 < _len52; _key52++) {\n        args[_key52] = arguments[_key52];\n      }\n      return pathRef(editor, ...args);\n    },\n    pathRefs: function pathRefs$1() {\n      for (var _len53 = arguments.length, args = new Array(_len53), _key53 = 0; _key53 < _len53; _key53++) {\n        args[_key53] = arguments[_key53];\n      }\n      return pathRefs(editor, ...args);\n    },\n    point: function point$1() {\n      for (var _len54 = arguments.length, args = new Array(_len54), _key54 = 0; _key54 < _len54; _key54++) {\n        args[_key54] = arguments[_key54];\n      }\n      return point(editor, ...args);\n    },\n    pointRef: function pointRef$1() {\n      for (var _len55 = arguments.length, args = new Array(_len55), _key55 = 0; _key55 < _len55; _key55++) {\n        args[_key55] = arguments[_key55];\n      }\n      return pointRef(editor, ...args);\n    },\n    pointRefs: function pointRefs$1() {\n      for (var _len56 = arguments.length, args = new Array(_len56), _key56 = 0; _key56 < _len56; _key56++) {\n        args[_key56] = arguments[_key56];\n      }\n      return pointRefs(editor, ...args);\n    },\n    positions: function positions$1() {\n      for (var _len57 = arguments.length, args = new Array(_len57), _key57 = 0; _key57 < _len57; _key57++) {\n        args[_key57] = arguments[_key57];\n      }\n      return positions(editor, ...args);\n    },\n    previous: function previous$1() {\n      for (var _len58 = arguments.length, args = new Array(_len58), _key58 = 0; _key58 < _len58; _key58++) {\n        args[_key58] = arguments[_key58];\n      }\n      return previous(editor, ...args);\n    },\n    range: function range$1() {\n      for (var _len59 = arguments.length, args = new Array(_len59), _key59 = 0; _key59 < _len59; _key59++) {\n        args[_key59] = arguments[_key59];\n      }\n      return range(editor, ...args);\n    },\n    rangeRef: function rangeRef$1() {\n      for (var _len60 = arguments.length, args = new Array(_len60), _key60 = 0; _key60 < _len60; _key60++) {\n        args[_key60] = arguments[_key60];\n      }\n      return rangeRef(editor, ...args);\n    },\n    rangeRefs: function rangeRefs$1() {\n      for (var _len61 = arguments.length, args = new Array(_len61), _key61 = 0; _key61 < _len61; _key61++) {\n        args[_key61] = arguments[_key61];\n      }\n      return rangeRefs(editor, ...args);\n    },\n    removeNodes: function removeNodes$1() {\n      for (var _len62 = arguments.length, args = new Array(_len62), _key62 = 0; _key62 < _len62; _key62++) {\n        args[_key62] = arguments[_key62];\n      }\n      return removeNodes(editor, ...args);\n    },\n    select: function select$1() {\n      for (var _len63 = arguments.length, args = new Array(_len63), _key63 = 0; _key63 < _len63; _key63++) {\n        args[_key63] = arguments[_key63];\n      }\n      return select(editor, ...args);\n    },\n    setNodes: function setNodes$1() {\n      for (var _len64 = arguments.length, args = new Array(_len64), _key64 = 0; _key64 < _len64; _key64++) {\n        args[_key64] = arguments[_key64];\n      }\n      return setNodes(editor, ...args);\n    },\n    setNormalizing: function setNormalizing$1() {\n      for (var _len65 = arguments.length, args = new Array(_len65), _key65 = 0; _key65 < _len65; _key65++) {\n        args[_key65] = arguments[_key65];\n      }\n      return setNormalizing(editor, ...args);\n    },\n    setPoint: function setPoint$1() {\n      for (var _len66 = arguments.length, args = new Array(_len66), _key66 = 0; _key66 < _len66; _key66++) {\n        args[_key66] = arguments[_key66];\n      }\n      return setPoint(editor, ...args);\n    },\n    setSelection: function setSelection$1() {\n      for (var _len67 = arguments.length, args = new Array(_len67), _key67 = 0; _key67 < _len67; _key67++) {\n        args[_key67] = arguments[_key67];\n      }\n      return setSelection(editor, ...args);\n    },\n    splitNodes: function splitNodes$1() {\n      for (var _len68 = arguments.length, args = new Array(_len68), _key68 = 0; _key68 < _len68; _key68++) {\n        args[_key68] = arguments[_key68];\n      }\n      return splitNodes(editor, ...args);\n    },\n    start: function start$1() {\n      for (var _len69 = arguments.length, args = new Array(_len69), _key69 = 0; _key69 < _len69; _key69++) {\n        args[_key69] = arguments[_key69];\n      }\n      return start(editor, ...args);\n    },\n    string: function string$1() {\n      for (var _len70 = arguments.length, args = new Array(_len70), _key70 = 0; _key70 < _len70; _key70++) {\n        args[_key70] = arguments[_key70];\n      }\n      return string(editor, ...args);\n    },\n    unhangRange: function unhangRange$1() {\n      for (var _len71 = arguments.length, args = new Array(_len71), _key71 = 0; _key71 < _len71; _key71++) {\n        args[_key71] = arguments[_key71];\n      }\n      return unhangRange(editor, ...args);\n    },\n    unsetNodes: function unsetNodes$1() {\n      for (var _len72 = arguments.length, args = new Array(_len72), _key72 = 0; _key72 < _len72; _key72++) {\n        args[_key72] = arguments[_key72];\n      }\n      return unsetNodes(editor, ...args);\n    },\n    unwrapNodes: function unwrapNodes$1() {\n      for (var _len73 = arguments.length, args = new Array(_len73), _key73 = 0; _key73 < _len73; _key73++) {\n        args[_key73] = arguments[_key73];\n      }\n      return unwrapNodes(editor, ...args);\n    },\n    void: function _void() {\n      for (var _len74 = arguments.length, args = new Array(_len74), _key74 = 0; _key74 < _len74; _key74++) {\n        args[_key74] = arguments[_key74];\n      }\n      return getVoid(editor, ...args);\n    },\n    withoutNormalizing: function withoutNormalizing$1() {\n      for (var _len75 = arguments.length, args = new Array(_len75), _key75 = 0; _key75 < _len75; _key75++) {\n        args[_key75] = arguments[_key75];\n      }\n      return withoutNormalizing(editor, ...args);\n    },\n    wrapNodes: function wrapNodes$1() {\n      for (var _len76 = arguments.length, args = new Array(_len76), _key76 = 0; _key76 < _len76; _key76++) {\n        args[_key76] = arguments[_key76];\n      }\n      return wrapNodes(editor, ...args);\n    }\n  };\n  return editor;\n};\n\nexport { Editor, Element, Location, Node, Operation, Path, PathRef, Point, PointRef, Range, RangeRef, Scrubber, Span, Text, Transforms, above, addMark, after, apply, before, collapse, createEditor, deleteBackward, deleteForward, deleteFragment, deleteText, deselect, edges, elementReadOnly, end, first, fragment, getDirtyPaths, getFragment, getVoid, hasBlocks, hasInlines, hasPath, hasTexts, insertBreak, insertFragment, insertNode, insertNodes, insertSoftBreak, insertText, isBlock, isEdge, isEditor, isEmpty, isEnd, isNormalizing, isStart, last, leaf, levels, liftNodes, marks, mergeNodes, move, moveNodes, next, node, nodes, normalize, normalizeNode, parent, path, pathRef, pathRefs, point, pointRef, pointRefs, positions, previous, range, rangeRef, rangeRefs, removeMark, removeNodes, select, setNodes, setNormalizing, setPoint, setSelection, shouldNormalize, splitNodes, start, string, unhangRange, unsetNodes, unwrapNodes, withoutNormalizing, wrapNodes };\n//# sourceMappingURL=index.es.js.map\n"],"names":["PathRef","ref","op","current","affinity","path","Path","PointRef","point","Point","RangeRef","Range","DIRTY_PATHS","DIRTY_PATH_KEYS","FLUSHING","NORMALIZING","PATH_REFS","POINT_REFS","RANGE_REFS","options","reverse","paths","another","common","i","av","bv","min","as","bs","n","value","al","bl","list","last","operation","ancestor","p","_op","_op2","position","_op3","_position","_op4","onp","copy","_typeof","o","_toPrimitive","input","hint","prim","res","_toPropertyKey","arg","key","_defineProperty","obj","ownKeys$e","r","t","_objectSpread$e","applyToDraft","editor","selection","node","parent","Node","index","_path","offset","text","_node","before","after","_point","_key","_path2","_node2","prevPath","prev","_parent","_index","Text","Scrubber","_point2","_key2","_path3","newPath","_node3","_parent2","_index2","truePath","newParent","newIndex","_point3","_key3","_path4","_index3","_parent3","_point4","_key4","result","_prev","next","preferNext","_path5","_offset","_text","_node4","_before","_after","_point5","_key5","_path6","properties","newProperties","_node5","_key6","_key7","_newProperties","_key8","_value","_path7","_properties","_node6","_parent4","_index4","newNode","_before2","_after2","_before3","_after3","_point6","_key9","GeneralTransforms","createDraft","finishDraft","isDraft","NodeTransforms","nodes","props","element","SelectionTransforms","target","isDeepEqual","a","b","isPlainObject","_objectWithoutPropertiesLoose","source","excluded","sourceKeys","_objectWithoutProperties","sourceSymbolKeys","_excluded$4","ownKeys$d","_objectSpread$d","range","anchor","focus","end","rs","re","ts","te","start","isAfterStart","isBeforeEnd","rest","s1","e1","s2","e2","produce","affinityAnchor","affinityFocus","isCollapsed","isElement","Editor","Element","val","elementVal","elementKey","_excluded$3","_excluded2$3","IS_NODE_LIST_CACHE","root","entry","c","children","child","childPath","newRoot","nodeEntries","_ref","leaf","_leaf","cachedResult","isNodeList","pass","from","to","visited","nextIndex","_newPath","parentPath","ownKeys$c","_objectSpread$c","Operation","inversePath","inverseNewPath","IS_EDITOR_CACHE","isEditor","cachedIsEditor","at","unit","fragment","isNormalizing","fn","Span","ownKeys$b","_objectSpread$b","_scrubber","scrubber","_excluded$2","_excluded2$2","ownKeys$a","_objectSpread$a","loose","omitText","decorations","leaves","dec","leafEnd","decorationStart","decorationEnd","length","leafStart","middle","off","_off","getDefaultInsertLocation","matchPath","getCharacterDistance","str","isRTL","isLTR","codepoints","codepointsIteratorRTL","left","CodepointType","right","distance","gb11","gb12Or13","char","code","type","getCodepointType","intersects","endsWithEmojiZWJ","endsWithOddNumberOfRIs","isBoundaryPair","SPACE","PUNCTUATION","CHAMELEON","getWordDistance","dist","started","charDist","remaining","splitByCharacterDistance","isWordCharacter","nextChar","nextRemaining","char1","isLowSurrogate","char2","isHighSurrogate","charCode","reExtend","rePrepend","reSpacingMark","reL","reV","reT","reLV","reLVT","reExtPict","x","y","NonBoundaryPairs","endingEmojiZWJ","endingRIs","match","numRIs","TextTransforms","voids","startRef","endRef","Transforms","startPoint","endPoint","ownKeys$9","_objectSpread$9","BATCHING_DIRTY_PATHS","isBatchingDirtyPaths","batchDirtyPaths","update","updateDirtyPaths","newDirtyPaths","transform","oldDirtyPaths","oldDirtyPathKeys","dirtyPaths","dirtyPathKeys","add","apply","_ref2","getDirtyPaths","levels","descendants","ancestors","previousPath","oldAncestors","newAncestors","_ancestor","_p","resultPath","_ancestors","_levels","nextPath","getFragment","normalizeNode","shouldHaveInlines","currentNode","_child","isLast","isInlineOrText","newChild","_newChild","shouldNormalize","iteration","initialDirtyPathsLength","maxIterations","above","mode","ownKeys$8","_objectSpread$8","addMark","parentNode","expandedSelection","markAcceptingVoidSelected","selectedNode","selectedPath","marks","ownKeys$7","_objectSpread$7","d","ownKeys$6","_objectSpread$6","deleteBackward","deleteForward","deleteFragment","direction","edges","ownKeys$5","_objectSpread$5","elementReadOnly","first","ownKeys$4","_objectSpread$4","getVoid","hasBlocks","hasInlines","hasPath","hasTexts","insertBreak","insertNode","insertSoftBreak","ownKeys$3","_objectSpread$3","insertText","isBlock","isEdge","isEmpty","isEnd","isStart","_excluded$1","_excluded2$1","_rest","markedVoid","block","prevNode","blockPath","pointAfterLocation","span","universal","ignoreNonSelectable","matches","hit","isLower","emit","normalize","force","getDirtyPathKeys","popDirtyPath","allPaths","allPathKeys","dirtyPath","_","_dirtyPath","_entry","pathRef","pathRefs","refs","depth","edge","firstPath","lastPath","pointRef","pointRefs","positions","isNewBlock","blockText","leafTextRemaining","leafTextOffset","e","s","isFirst","calcDistance","previous","pointBeforeLocation","rangeRef","rangeRefs","ownKeys$2","_objectSpread$2","removeMark","setNormalizing","string","unhangRange","endBlock","skip","withoutNormalizing","deleteText","_Editor$void","_Editor$void2","hanging","furthestVoid","voidPath","opts","_end","endOfDoc","startBlock","isAcrossBlocks","isSingleText","startNonEditable","endNonEditable","removedText","startUnref","endUnref","insertFragment","batchDirty","inlineElementMatch","_inlinePath","blockMatch","isBlockStart","isBlockEnd","isBlockEmpty","mergeStart","mergeEnd","matcher","isRoot","starts","middles","ends","starting","inlineMatch","inlinePath","isInlineStart","isInlineEnd","middleRef","collapse","deselect","move","select","ownKeys$1","_objectSpread$1","setPoint","setSelection","oldProps","newProps","k","insertNodes","isAtEnd","batchedOps","_loop","liftNodes","parentNodeEntry","toPath","_toPath","splitPath","_toPath2","_excluded","_excluded2","hasSingleChildNest","mergeNodes","commonPath","isPreviousSibling","emptyAncestor","emptyRef","moveNodes","toRef","targets","removeNodes","depths","setNodes","compare","merge","split","splitMode","endAtEndOfNode","startAtStartOfNode","prop","nodeProp","hasChanges","deleteRange","splitNodes","height","always","beforeRef","afterRef","highest","voidMatch","nudge","voidNode","afterPath","siblingHeight","highestPath","lowestPath","_afterRef","unsetNodes","unwrapNodes","ownKeys","_objectSpread","wrapNodes","roots","rootPath","commonNodeEntry","commonNode","wrapperPath","wrapper","_ret","createEditor","_len","args","_len2","_len3","_len4","_len5","_len6","_len7","_len8","_len9","_len10","_key10","_len11","_key11","_len12","_key12","_len13","_key13","_len14","_key14","_len15","_key15","_len16","_key16","_len17","_key17","_len18","_key18","_len19","_key19","_len20","_key20","_len21","_key21","_len22","_key22","_len23","_key23","_len24","_key24","_len25","_key25","_len26","_key26","_len27","_key27","_len28","_key28","_len29","_key29","_len30","_key30","_len31","_key31","_len32","_key32","_len33","_key33","_len34","_key34","_len35","_key35","_len36","_key36","_len37","_key37","_len38","_key38","_len39","_key39","_len40","_key40","_len41","_key41","_len42","_key42","_len43","_key43","_len44","_key44","_len45","_key45","_len46","_key46","_len47","_key47","_len48","_key48","_len49","_key49","_len50","_key50","_len51","_key51","_len52","_key52","_len53","_key53","_len54","_key54","_len55","_key55","_len56","_key56","_len57","_key57","_len58","_key58","_len59","_key59","_len60","_key60","_len61","_key61","_len62","_key62","_len63","_key63","_len64","_key64","_len65","_key65","_len66","_key66","_len67","_key67","_len68","_key68","_len69","_key69","_len70","_key70","_len71","_key71","_len72","_key72","_len73","_key73","_len74","_key74","_len75","_key75","_len76","_key76"],"mappings":";;AAIG,IAACA,KAAU;AAAA,EACZ,UAAUC,GAAKC,GAAI;AACjB,QAAI;AAAA,MACF,SAAAC;AAAA,MACA,UAAAC;AAAA,IACN,IAAQH;AACJ,QAAIE,KAAW,MAGf;AAAA,UAAIE,IAAOC,EAAK,UAAUH,GAASD,GAAI;AAAA,QACrC,UAAAE;AAAA,MACN,CAAK;AACD,MAAAH,EAAI,UAAUI,GACVA,KAAQ,QACVJ,EAAI,MAAK;AAAA;AAAA,EAEb;AACF,GAGIM,KAAW;AAAA,EACb,UAAUN,GAAKC,GAAI;AACjB,QAAI;AAAA,MACF,SAAAC;AAAA,MACA,UAAAC;AAAA,IACN,IAAQH;AACJ,QAAIE,KAAW,MAGf;AAAA,UAAIK,IAAQC,EAAM,UAAUN,GAASD,GAAI;AAAA,QACvC,UAAAE;AAAA,MACN,CAAK;AACD,MAAAH,EAAI,UAAUO,GACVA,KAAS,QACXP,EAAI,MAAK;AAAA;AAAA,EAEb;AACF,GAGIS,KAAW;AAAA,EACb,UAAUT,GAAKC,GAAI;AACjB,QAAI;AAAA,MACF,SAAAC;AAAA,MACA,UAAAC;AAAA,IACN,IAAQH;AACJ,QAAIE,KAAW,MAGf;AAAA,UAAIE,IAAOM,EAAM,UAAUR,GAASD,GAAI;AAAA,QACtC,UAAAE;AAAA,MACN,CAAK;AACD,MAAAH,EAAI,UAAUI,GACVA,KAAQ,QACVJ,EAAI,MAAK;AAAA;AAAA,EAEb;AACF,GAEIW,KAAc,oBAAI,QAAO,GACzBC,KAAkB,oBAAI,QAAO,GAC7BC,KAAW,oBAAI,QAAO,GACtBC,KAAc,oBAAI,QAAO,GACzBC,KAAY,oBAAI,QAAO,GACvBC,KAAa,oBAAI,QAAO,GACxBC,KAAa,oBAAI,QAAO,GAGxBZ,IAAO;AAAA,EACT,UAAUD,GAAM;AACd,QAAIc,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,MACF,SAAAC,IAAU;AAAA,IAChB,IAAQD,GACAE,IAAQf,EAAK,OAAOD,GAAMc,CAAO;AACrC,WAAIC,IACFC,IAAQA,EAAM,MAAM,CAAC,IAErBA,IAAQA,EAAM,MAAM,GAAG,EAAE,GAEpBA;AAAA,EACT;AAAA,EACA,OAAOhB,GAAMiB,GAAS;AAEpB,aADIC,IAAS,CAAA,GACJC,IAAI,GAAGA,IAAInB,EAAK,UAAUmB,IAAIF,EAAQ,QAAQE,KAAK;AAC1D,UAAIC,IAAKpB,EAAKmB,CAAC,GACXE,IAAKJ,EAAQE,CAAC;AAClB,UAAIC,MAAOC;AACT;AAEF,MAAAH,EAAO,KAAKE,CAAE;AAAA,IAChB;AACA,WAAOF;AAAA,EACT;AAAA,EACA,QAAQlB,GAAMiB,GAAS;AAErB,aADIK,IAAM,KAAK,IAAItB,EAAK,QAAQiB,EAAQ,MAAM,GACrCE,IAAI,GAAGA,IAAIG,GAAKH,KAAK;AAC5B,UAAInB,EAAKmB,CAAC,IAAIF,EAAQE,CAAC,EAAG,QAAO;AACjC,UAAInB,EAAKmB,CAAC,IAAIF,EAAQE,CAAC,EAAG,QAAO;AAAA,IACnC;AACA,WAAO;AAAA,EACT;AAAA,EACA,UAAUnB,GAAMiB,GAAS;AACvB,QAAIE,IAAInB,EAAK,SAAS,GAClBuB,IAAKvB,EAAK,MAAM,GAAGmB,CAAC,GACpBK,IAAKP,EAAQ,MAAM,GAAGE,CAAC,GACvBC,IAAKpB,EAAKmB,CAAC,GACXE,IAAKJ,EAAQE,CAAC;AAClB,WAAOlB,EAAK,OAAOsB,GAAIC,CAAE,KAAKJ,IAAKC;AAAA,EACrC;AAAA,EACA,OAAOrB,GAAMiB,GAAS;AACpB,QAAIE,IAAInB,EAAK,QACTuB,IAAKvB,EAAK,MAAM,GAAGmB,CAAC,GACpBK,IAAKP,EAAQ,MAAM,GAAGE,CAAC;AAC3B,WAAOlB,EAAK,OAAOsB,GAAIC,CAAE;AAAA,EAC3B;AAAA,EACA,WAAWxB,GAAMiB,GAAS;AACxB,QAAIE,IAAInB,EAAK,SAAS,GAClBuB,IAAKvB,EAAK,MAAM,GAAGmB,CAAC,GACpBK,IAAKP,EAAQ,MAAM,GAAGE,CAAC,GACvBC,IAAKpB,EAAKmB,CAAC,GACXE,IAAKJ,EAAQE,CAAC;AAClB,WAAOlB,EAAK,OAAOsB,GAAIC,CAAE,KAAKJ,IAAKC;AAAA,EACrC;AAAA,EACA,OAAOrB,GAAMiB,GAAS;AACpB,WAAOjB,EAAK,WAAWiB,EAAQ,UAAUjB,EAAK,MAAM,CAACyB,GAAGN,MAAMM,MAAMR,EAAQE,CAAC,CAAC;AAAA,EAChF;AAAA,EACA,YAAYnB,GAAM;AAChB,WAAOA,EAAKA,EAAK,SAAS,CAAC,IAAI;AAAA,EACjC;AAAA,EACA,QAAQA,GAAMiB,GAAS;AACrB,WAAOhB,EAAK,QAAQD,GAAMiB,CAAO,MAAM;AAAA,EACzC;AAAA,EACA,WAAWjB,GAAMiB,GAAS;AACxB,WAAOjB,EAAK,SAASiB,EAAQ,UAAUhB,EAAK,QAAQD,GAAMiB,CAAO,MAAM;AAAA,EACzE;AAAA,EACA,SAASjB,GAAMiB,GAAS;AACtB,WAAOhB,EAAK,QAAQD,GAAMiB,CAAO,MAAM;AAAA,EACzC;AAAA,EACA,QAAQjB,GAAMiB,GAAS;AACrB,WAAOjB,EAAK,WAAWiB,EAAQ,SAAS,KAAKhB,EAAK,QAAQD,GAAMiB,CAAO,MAAM;AAAA,EAC/E;AAAA,EACA,SAASjB,GAAMiB,GAAS;AACtB,WAAOjB,EAAK,UAAUiB,EAAQ,UAAUhB,EAAK,QAAQD,GAAMiB,CAAO,MAAM;AAAA,EAC1E;AAAA,EACA,aAAajB,GAAMiB,GAAS;AAC1B,WAAOjB,EAAK,SAASiB,EAAQ,UAAUhB,EAAK,QAAQD,GAAMiB,CAAO,MAAM;AAAA,EACzE;AAAA,EACA,SAASjB,GAAMiB,GAAS;AACtB,WAAOjB,EAAK,SAAS,MAAMiB,EAAQ,UAAUhB,EAAK,QAAQD,GAAMiB,CAAO,MAAM;AAAA,EAC/E;AAAA,EACA,OAAOS,GAAO;AACZ,WAAO,MAAM,QAAQA,CAAK,MAAMA,EAAM,WAAW,KAAK,OAAOA,EAAM,CAAC,KAAM;AAAA,EAC5E;AAAA,EACA,UAAU1B,GAAMiB,GAAS;AACvB,QAAIjB,EAAK,WAAWiB,EAAQ;AAC1B,aAAO;AAET,QAAIM,IAAKvB,EAAK,MAAM,GAAG,EAAE,GACrBwB,IAAKP,EAAQ,MAAM,GAAG,EAAE,GACxBU,IAAK3B,EAAKA,EAAK,SAAS,CAAC,GACzB4B,IAAKX,EAAQA,EAAQ,SAAS,CAAC;AACnC,WAAOU,MAAOC,KAAM3B,EAAK,OAAOsB,GAAIC,CAAE;AAAA,EACxC;AAAA,EACA,OAAOxB,GAAM;AAMX,aALIc,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,MACF,SAAAC,IAAU;AAAA,IAChB,IAAQD,GACAe,IAAO,CAAA,GACFV,IAAI,GAAGA,KAAKnB,EAAK,QAAQmB;AAChC,MAAAU,EAAK,KAAK7B,EAAK,MAAM,GAAGmB,CAAC,CAAC;AAE5B,WAAIJ,KACFc,EAAK,QAAO,GAEPA;AAAA,EACT;AAAA,EACA,KAAK7B,GAAM;AACT,QAAIA,EAAK,WAAW;AAClB,YAAM,IAAI,MAAM,4CAA4C,OAAOA,GAAM,kCAAkC,CAAC;AAE9G,QAAI8B,IAAO9B,EAAKA,EAAK,SAAS,CAAC;AAC/B,WAAOA,EAAK,MAAM,GAAG,EAAE,EAAE,OAAO8B,IAAO,CAAC;AAAA,EAC1C;AAAA,EACA,0BAA0BC,GAAW;AACnC,YAAQA,EAAU,MAAI;AAAA,MACpB,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AAAA,MACL,KAAK;AACH,eAAO;AAAA,MACT;AACE,eAAO;AAAA,IACf;AAAA,EACE;AAAA,EACA,OAAO/B,GAAM;AACX,QAAIA,EAAK,WAAW;AAClB,YAAM,IAAI,MAAM,gDAAgD,OAAOA,GAAM,IAAI,CAAC;AAEpF,WAAOA,EAAK,MAAM,GAAG,EAAE;AAAA,EACzB;AAAA,EACA,SAASA,GAAM;AACb,QAAIA,EAAK,WAAW;AAClB,YAAM,IAAI,MAAM,gDAAgD,OAAOA,GAAM,sCAAsC,CAAC;AAEtH,QAAI8B,IAAO9B,EAAKA,EAAK,SAAS,CAAC;AAC/B,QAAI8B,KAAQ;AACV,YAAM,IAAI,MAAM,uDAAuD,OAAO9B,GAAM,gDAAgD,CAAC;AAEvI,WAAOA,EAAK,MAAM,GAAG,EAAE,EAAE,OAAO8B,IAAO,CAAC;AAAA,EAC1C;AAAA,EACA,SAAS9B,GAAMgC,GAAU;AACvB,QAAI,CAAC/B,EAAK,WAAW+B,GAAUhC,CAAI,KAAK,CAACC,EAAK,OAAOD,GAAMgC,CAAQ;AACjE,YAAM,IAAI,MAAM,oCAAoC,OAAOhC,GAAM,qBAAqB,EAAE,OAAOgC,GAAU,kDAAkD,CAAC;AAE9J,WAAOhC,EAAK,MAAMgC,EAAS,MAAM;AAAA,EACnC;AAAA,EACA,UAAUhC,GAAM+B,GAAW;AACzB,QAAIjB,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,QAAI,CAACd,EAAM,QAAO;AAElB,QAAIiC,IAAI,CAAC,GAAGjC,CAAI,GACZ;AAAA,MACF,UAAAD,IAAW;AAAA,IACjB,IAAQe;AAEJ,QAAId,EAAK,WAAW;AAClB,aAAOiC;AAET,YAAQF,EAAU,MAAI;AAAA,MACpB,KAAK,eACH;AACE,YAAI;AAAA,UACF,MAAMlC;AAAA,QAClB,IAAckC;AACJ,SAAI9B,EAAK,OAAOJ,GAAIoC,CAAC,KAAKhC,EAAK,WAAWJ,GAAIoC,CAAC,KAAKhC,EAAK,WAAWJ,GAAIoC,CAAC,OACvEA,EAAEpC,EAAG,SAAS,CAAC,KAAK;AAEtB;AAAA,MACF;AAAA,MACF,KAAK,eACH;AACE,YAAI;AAAA,UACF,MAAMqC;AAAA,QAClB,IAAcH;AACJ,YAAI9B,EAAK,OAAOiC,GAAKD,CAAC,KAAKhC,EAAK,WAAWiC,GAAKD,CAAC;AAC/C,iBAAO;AACF,QAAIhC,EAAK,WAAWiC,GAAKD,CAAC,MAC/BA,EAAEC,EAAI,SAAS,CAAC,KAAK;AAEvB;AAAA,MACF;AAAA,MACF,KAAK,cACH;AACE,YAAI;AAAA,UACF,MAAMC;AAAA,UACN,UAAAC;AAAA,QACZ,IAAcL;AACJ,QAAI9B,EAAK,OAAOkC,GAAMF,CAAC,KAAKhC,EAAK,WAAWkC,GAAMF,CAAC,IACjDA,EAAEE,EAAK,SAAS,CAAC,KAAK,IACblC,EAAK,WAAWkC,GAAMF,CAAC,MAChCA,EAAEE,EAAK,SAAS,CAAC,KAAK,GACtBF,EAAEE,EAAK,MAAM,KAAKC;AAEpB;AAAA,MACF;AAAA,MACF,KAAK,cACH;AACE,YAAI;AAAA,UACF,MAAMC;AAAA,UACN,UAAUC;AAAA,QACtB,IAAcP;AACJ,YAAI9B,EAAK,OAAOoC,GAAMJ,CAAC;AACrB,cAAIlC,MAAa;AACf,YAAAkC,EAAEA,EAAE,SAAS,CAAC,KAAK;AAAA,mBACVlC,MAAa,WACtB,QAAO;AAAA,cAEJ,CAAIE,EAAK,WAAWoC,GAAMJ,CAAC,IAChCA,EAAEI,EAAK,SAAS,CAAC,KAAK,IACbpC,EAAK,WAAWoC,GAAMJ,CAAC,KAAKjC,EAAKqC,EAAK,MAAM,KAAKC,MAC1DL,EAAEI,EAAK,SAAS,CAAC,KAAK,GACtBJ,EAAEI,EAAK,MAAM,KAAKC;AAEpB;AAAA,MACF;AAAA,MACF,KAAK,aACH;AACE,YAAI;AAAA,UACF,MAAMC;AAAA,UACN,SAASC;AAAA,QACrB,IAAcT;AAEJ,YAAI9B,EAAK,OAAOsC,GAAMC,CAAG;AACvB,iBAAOP;AAET,YAAIhC,EAAK,WAAWsC,GAAMN,CAAC,KAAKhC,EAAK,OAAOsC,GAAMN,CAAC,GAAG;AACpD,cAAIQ,IAAOD,EAAI,MAAK;AACpB,iBAAIvC,EAAK,WAAWsC,GAAMC,CAAG,KAAKD,EAAK,SAASC,EAAI,WAClDC,EAAKF,EAAK,SAAS,CAAC,KAAK,IAEpBE,EAAK,OAAOR,EAAE,MAAMM,EAAK,MAAM,CAAC;AAAA,QACzC,MAAO,CAAItC,EAAK,UAAUsC,GAAMC,CAAG,MAAMvC,EAAK,WAAWuC,GAAKP,CAAC,KAAKhC,EAAK,OAAOuC,GAAKP,CAAC,KAChFhC,EAAK,WAAWsC,GAAMN,CAAC,IACzBA,EAAEM,EAAK,SAAS,CAAC,KAAK,IAEtBN,EAAEM,EAAK,SAAS,CAAC,KAAK,IAEftC,EAAK,WAAWuC,GAAKP,CAAC,KAAKhC,EAAK,OAAOuC,GAAKP,CAAC,KAAKhC,EAAK,WAAWuC,GAAKP,CAAC,KAC7EhC,EAAK,WAAWsC,GAAMN,CAAC,MACzBA,EAAEM,EAAK,SAAS,CAAC,KAAK,IAExBN,EAAEO,EAAI,SAAS,CAAC,KAAK,KACZvC,EAAK,WAAWsC,GAAMN,CAAC,MAC5BhC,EAAK,OAAOuC,GAAKP,CAAC,MACpBA,EAAEO,EAAI,SAAS,CAAC,KAAK,IAEvBP,EAAEM,EAAK,SAAS,CAAC,KAAK;AAExB;AAAA,MACF;AAAA,IACR;AACI,WAAON;AAAA,EACT;AACF;AAEA,SAASS,GAAQC,GAAG;AAClB;AAEA,SAAOD,KAAwB,OAAO,UAArB,cAA2C,OAAO,OAAO,YAA1B,WAAqC,SAAUC,GAAG;AAChG,WAAO,OAAOA;AAAA,EAChB,IAAI,SAAUA,GAAG;AACf,WAAOA,KAAmB,OAAO,UAArB,cAA+BA,EAAE,gBAAgB,UAAUA,MAAM,OAAO,YAAY,WAAW,OAAOA;AAAA,EACpH,GAAGD,GAAQC,CAAC;AACd;AAEA,SAASC,GAAaC,GAAOC,GAAM;AACjC,MAAIJ,GAAQG,CAAK,MAAM,YAAYA,MAAU,KAAM,QAAOA;AAC1D,MAAIE,IAAOF,EAAM,OAAO,WAAW;AACnC,MAAIE,MAAS,QAAW;AACtB,QAAIC,IAAMD,EAAK,KAAKF,GAAOC,CAAiB;AAC5C,QAAIJ,GAAQM,CAAG,MAAM,SAAU,QAAOA;AACtC,UAAM,IAAI,UAAU,8CAA8C;AAAA,EACpE;AACA,UAAQF,MAAS,WAAW,SAAS,QAAQD,CAAK;AACpD;AAEA,SAASI,GAAeC,GAAK;AAC3B,MAAIC,IAAMP,GAAaM,GAAK,QAAQ;AACpC,SAAOR,GAAQS,CAAG,MAAM,WAAWA,IAAM,OAAOA,CAAG;AACrD;AAEA,SAASC,EAAgBC,GAAKF,GAAKzB,GAAO;AACxC,SAAAyB,IAAMF,GAAeE,CAAG,GACpBA,KAAOE,IACT,OAAO,eAAeA,GAAKF,GAAK;AAAA,IAC9B,OAAOzB;AAAA,IACP,YAAY;AAAA,IACZ,cAAc;AAAA,IACd,UAAU;AAAA,EAChB,CAAK,IAED2B,EAAIF,CAAG,IAAIzB,GAEN2B;AACT;AAEA,SAASC,GAAU,GAAGC,GAAG;AAAE,MAAIC,IAAI,OAAO,KAAK,CAAC;AAAG,MAAI,OAAO,uBAAuB;AAAE,QAAIb,IAAI,OAAO,sBAAsB,CAAC;AAAG,IAAAY,MAAMZ,IAAIA,EAAE,OAAO,SAAUY,GAAG;AAAE,aAAO,OAAO,yBAAyB,GAAGA,CAAC,EAAE;AAAA,IAAY,CAAC,IAAIC,EAAE,KAAK,MAAMA,GAAGb,CAAC;AAAA,EAAG;AAAE,SAAOa;AAAG;AAChQ,SAASC,GAAgB,GAAG;AAAE,WAASF,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAE,QAAIC,IAAY,UAAUD,CAAC,KAAnB,OAAuB,UAAUA,CAAC,IAAI,CAAA;AAAI,IAAAA,IAAI,IAAID,GAAU,OAAOE,CAAC,GAAG,EAAE,EAAE,QAAQ,SAAUD,GAAG;AAAE,MAAAH,EAAgB,GAAGG,GAAGC,EAAED,CAAC,CAAC;AAAA,IAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiB,GAAG,OAAO,0BAA0BC,CAAC,CAAC,IAAIF,GAAU,OAAOE,CAAC,CAAC,EAAE,QAAQ,SAAUD,GAAG;AAAE,aAAO,eAAe,GAAGA,GAAG,OAAO,yBAAyBC,GAAGD,CAAC,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AAAE,SAAO;AAAG;AAC5b,IAAIG,KAAe,CAACC,GAAQC,GAAW/D,MAAO;AAC5C,UAAQA,EAAG,MAAI;AAAA,IACb,KAAK,eACH;AACE,UAAI;AAAA,QACF,MAAAG;AAAA,QACA,MAAA6D;AAAA,MACV,IAAYhE,GACAiE,IAASC,EAAK,OAAOJ,GAAQ3D,CAAI,GACjCgE,IAAQhE,EAAKA,EAAK,SAAS,CAAC;AAChC,UAAIgE,IAAQF,EAAO,SAAS;AAC1B,cAAM,IAAI,MAAM,oDAAsD,OAAO9D,GAAM,wDAAwD,CAAC;AAG9I,UADA8D,EAAO,SAAS,OAAOE,GAAO,GAAGH,CAAI,GACjCD;AACF,iBAAS,CAACzD,GAAOgD,CAAG,KAAK7C,EAAM,OAAOsD,CAAS;AAC7C,UAAAA,EAAUT,CAAG,IAAI/C,EAAM,UAAUD,GAAON,CAAE;AAG9C;AAAA,IACF;AAAA,IACF,KAAK,eACH;AACE,UAAI;AAAA,QACF,MAAMoE;AAAA,QACN,QAAAC;AAAA,QACA,MAAAC;AAAA,MACV,IAAYtE;AACJ,UAAIsE,EAAK,WAAW,EAAG;AACvB,UAAIC,IAAQL,EAAK,KAAKJ,GAAQM,CAAK,GAC/BI,IAASD,EAAM,KAAK,MAAM,GAAGF,CAAM,GACnCI,IAAQF,EAAM,KAAK,MAAMF,CAAM;AAEnC,UADAE,EAAM,OAAOC,IAASF,IAAOG,GACzBV;AACF,iBAAS,CAACW,GAAQC,CAAI,KAAKlE,EAAM,OAAOsD,CAAS;AAC/C,UAAAA,EAAUY,CAAI,IAAIpE,EAAM,UAAUmE,GAAQ1E,CAAE;AAGhD;AAAA,IACF;AAAA,IACF,KAAK,cACH;AACE,UAAI;AAAA,QACF,MAAM4E;AAAA,MAChB,IAAY5E,GACA6E,IAASX,EAAK,IAAIJ,GAAQc,CAAM,GAChCE,IAAW1E,EAAK,SAASwE,CAAM,GAC/BG,IAAOb,EAAK,IAAIJ,GAAQgB,CAAQ,GAChCE,IAAUd,EAAK,OAAOJ,GAAQc,CAAM,GACpCK,IAASL,EAAOA,EAAO,SAAS,CAAC;AACrC,UAAIM,EAAK,OAAOL,CAAM,KAAKK,EAAK,OAAOH,CAAI;AACzC,QAAAA,EAAK,QAAQF,EAAO;AAAA,eACX,CAACK,EAAK,OAAOL,CAAM,KAAK,CAACK,EAAK,OAAOH,CAAI;AAClD,QAAAA,EAAK,SAAS,KAAK,GAAGF,EAAO,QAAQ;AAAA;AAErC,cAAM,IAAI,MAAM,kDAAoD,OAAOD,GAAQ,sCAAsC,EAAE,OAAOO,EAAS,UAAUN,CAAM,GAAG,GAAG,EAAE,OAAOM,EAAS,UAAUJ,CAAI,CAAC,CAAC;AAGrM,UADAC,EAAQ,SAAS,OAAOC,GAAQ,CAAC,GAC7BlB;AACF,iBAAS,CAACqB,GAASC,CAAK,KAAK5E,EAAM,OAAOsD,CAAS;AACjD,UAAAA,EAAUsB,CAAK,IAAI9E,EAAM,UAAU6E,GAASpF,CAAE;AAGlD;AAAA,IACF;AAAA,IACF,KAAK,aACH;AACE,UAAI;AAAA,QACF,MAAMsF;AAAA,QACN,SAAAC;AAAA,MACV,IAAYvF;AACJ,UAAII,EAAK,WAAWkF,GAAQC,CAAO;AACjC,cAAM,IAAI,MAAM,uBAAuB,OAAOD,GAAQ,iBAAiB,EAAE,OAAOC,GAAS,6CAA6C,CAAC;AAEzI,UAAIC,IAAStB,EAAK,IAAIJ,GAAQwB,CAAM,GAChCG,IAAWvB,EAAK,OAAOJ,GAAQwB,CAAM,GACrCI,IAAUJ,EAAOA,EAAO,SAAS,CAAC;AAOtC,MAAAG,EAAS,SAAS,OAAOC,GAAS,CAAC;AACnC,UAAIC,IAAWvF,EAAK,UAAUkF,GAAQtF,CAAE,GACpC4F,IAAY1B,EAAK,IAAIJ,GAAQ1D,EAAK,OAAOuF,CAAQ,CAAC,GAClDE,IAAWF,EAASA,EAAS,SAAS,CAAC;AAE3C,UADAC,EAAU,SAAS,OAAOC,GAAU,GAAGL,CAAM,GACzCzB;AACF,iBAAS,CAAC+B,GAASC,CAAK,KAAKtF,EAAM,OAAOsD,CAAS;AACjD,UAAAA,EAAUgC,CAAK,IAAIxF,EAAM,UAAUuF,GAAS9F,CAAE;AAGlD;AAAA,IACF;AAAA,IACF,KAAK,eACH;AACE,UAAI;AAAA,QACF,MAAMgG;AAAA,MAChB,IAAYhG,GACAiG,IAAUD,EAAOA,EAAO,SAAS,CAAC,GAClCE,KAAWhC,EAAK,OAAOJ,GAAQkC,CAAM;AAIzC,UAHAE,GAAS,SAAS,OAAOD,GAAS,CAAC,GAG/BlC;AACF,iBAAS,CAACoC,GAASC,EAAK,KAAK3F,EAAM,OAAOsD,CAAS,GAAG;AACpD,cAAIsC,KAAS9F,EAAM,UAAU4F,GAASnG,CAAE;AACxC,cAAI+D,KAAa,QAAQsC,MAAU;AACjC,YAAAtC,EAAUqC,EAAK,IAAIC;AAAA,eACd;AACL,gBAAIC,IAAQ,QACRC,IAAO;AACX,qBAAS,CAAC3E,IAAGQ,EAAC,KAAK8B,EAAK,MAAMJ,CAAM;AAClC,kBAAI1D,EAAK,QAAQgC,IAAG4D,CAAM,MAAM;AAC9B,gBAAAM,IAAQ,CAAC1E,IAAGQ,EAAC;AAAA,mBACR;AACL,gBAAAmE,IAAO,CAAC3E,IAAGQ,EAAC;AACZ;AAAA,cACF;AAEF,gBAAIoE,KAAa;AACjB,YAAIF,KAASC,MACPnG,EAAK,OAAOmG,EAAK,CAAC,GAAGP,CAAM,IAC7BQ,KAAa,CAACpG,EAAK,YAAYmG,EAAK,CAAC,CAAC,IAEtCC,KAAapG,EAAK,OAAOkG,EAAM,CAAC,GAAGN,CAAM,EAAE,SAAS5F,EAAK,OAAOmG,EAAK,CAAC,GAAGP,CAAM,EAAE,SAGjFM,KAAS,CAACE,MACZL,EAAQ,OAAOG,EAAM,CAAC,GACtBH,EAAQ,SAASG,EAAM,CAAC,EAAE,KAAK,UACtBC,KACTJ,EAAQ,OAAOI,EAAK,CAAC,GACrBJ,EAAQ,SAAS,KAEjBpC,IAAY;AAAA,UAEhB;AAAA,QACF;AAEF;AAAA,IACF;AAAA,IACF,KAAK,eACH;AACE,UAAI;AAAA,QACF,MAAM0C;AAAA,QACN,QAAQC;AAAA,QACR,MAAMC;AAAA,MAChB,IAAY3G;AACJ,UAAI2G,GAAM,WAAW,EAAG;AACxB,UAAIC,KAAS1C,EAAK,KAAKJ,GAAQ2C,EAAM,GACjCI,IAAUD,GAAO,KAAK,MAAM,GAAGF,EAAO,GACtCI,KAASF,GAAO,KAAK,MAAMF,KAAUC,GAAM,MAAM;AAErD,UADAC,GAAO,OAAOC,IAAUC,IACpB/C;AACF,iBAAS,CAACgD,IAASC,EAAK,KAAKvG,EAAM,OAAOsD,CAAS;AACjD,UAAAA,EAAUiD,EAAK,IAAIzG,EAAM,UAAUwG,IAAS/G,CAAE;AAGlD;AAAA,IACF;AAAA,IACF,KAAK,YACH;AACE,UAAI;AAAA,QACF,MAAMiH;AAAA,QACN,YAAAC;AAAA,QACA,eAAAC;AAAA,MACV,IAAYnH;AACJ,UAAIiH,GAAO,WAAW;AACpB,cAAM,IAAI,MAAM,yCAAyC;AAE3D,UAAIG,KAASlD,EAAK,IAAIJ,GAAQmD,EAAM;AACpC,eAASI,MAASF,IAAe;AAC/B,YAAIE,OAAU,cAAcA,OAAU;AACpC,gBAAM,IAAI,MAAM,mBAAoB,OAAOA,IAAO,sBAAuB,CAAC;AAE5E,YAAIxF,KAAQsF,GAAcE,EAAK;AAC/B,QAAIxF,MAAS,OACX,OAAOuF,GAAOC,EAAK,IAEnBD,GAAOC,EAAK,IAAIxF;AAAA,MAEpB;AAEA,eAASyF,MAASJ;AAChB,QAAKC,GAAc,eAAeG,EAAK,KACrC,OAAOF,GAAOE,EAAK;AAGvB;AAAA,IACF;AAAA,IACF,KAAK,iBACH;AACE,UAAI;AAAA,QACF,eAAeC;AAAA,MACzB,IAAYvH;AACJ,UAAIuH,MAAkB;AACpB,QAAAxD,IAAYwD;AAAA,WACP;AACL,YAAIxD,KAAa,MAAM;AACrB,cAAI,CAACtD,EAAM,QAAQ8G,EAAc;AAC/B,kBAAM,IAAI,MAAM,mEAAqE,OAAOpC,EAAS,UAAUoC,EAAc,GAAG,sCAAsC,CAAC;AAEzK,UAAAxD,IAAYH,GAAgB,CAAA,GAAI2D,EAAc;AAAA,QAChD;AACA,iBAASC,MAASD,IAAgB;AAChC,cAAIE,KAASF,GAAeC,EAAK;AACjC,cAAIC,MAAU,MAAM;AAClB,gBAAID,OAAU,YAAYA,OAAU;AAClC,oBAAM,IAAI,MAAM,sBAAuB,OAAOA,IAAO,sBAAuB,CAAC;AAE/E,mBAAOzD,EAAUyD,EAAK;AAAA,UACxB;AACE,YAAAzD,EAAUyD,EAAK,IAAIC;AAAA,QAEvB;AAAA,MACF;AACA;AAAA,IACF;AAAA,IACF,KAAK,cACH;AACE,UAAI;AAAA,QACF,MAAMC;AAAA,QACN,UAAAnF;AAAA,QACA,YAAYoF;AAAA,MACtB,IAAY3H;AACJ,UAAI0H,GAAO,WAAW;AACpB,cAAM,IAAI,MAAM,kDAAoD,OAAOA,IAAQ,0CAA0C,CAAC;AAEhI,UAAIE,KAAS1D,EAAK,IAAIJ,GAAQ4D,EAAM,GAChCG,KAAW3D,EAAK,OAAOJ,GAAQ4D,EAAM,GACrCI,KAAUJ,GAAOA,GAAO,SAAS,CAAC,GAClCK;AACJ,UAAI7C,EAAK,OAAO0C,EAAM,GAAG;AACvB,YAAII,KAAWJ,GAAO,KAAK,MAAM,GAAGrF,EAAQ,GACxC0F,KAAUL,GAAO,KAAK,MAAMrF,EAAQ;AACxC,QAAAqF,GAAO,OAAOI,IACdD,KAAUnE,GAAgBA,GAAgB,CAAA,GAAI+D,EAAW,GAAG,CAAA,GAAI;AAAA,UAC9D,MAAMM;AAAA,QAClB,CAAW;AAAA,MACH,OAAO;AACL,YAAIC,KAAWN,GAAO,SAAS,MAAM,GAAGrF,EAAQ,GAC5C4F,KAAUP,GAAO,SAAS,MAAMrF,EAAQ;AAC5C,QAAAqF,GAAO,WAAWM,IAClBH,KAAUnE,GAAgBA,GAAgB,CAAA,GAAI+D,EAAW,GAAG,CAAA,GAAI;AAAA,UAC9D,UAAUQ;AAAA,QACtB,CAAW;AAAA,MACH;AAEA,UADAN,GAAS,SAAS,OAAOC,KAAU,GAAG,GAAGC,EAAO,GAC5ChE;AACF,iBAAS,CAACqE,IAASC,EAAK,KAAK5H,EAAM,OAAOsD,CAAS;AACjD,UAAAA,EAAUsE,EAAK,IAAI9H,EAAM,UAAU6H,IAASpI,CAAE;AAGlD;AAAA,IACF;AAAA,EACN;AACE,SAAO+D;AACT,GAEIuE,KAAoB;AAAA,EACtB,UAAUxE,GAAQ9D,GAAI;AACpB,IAAA8D,EAAO,WAAWyE,GAAYzE,EAAO,QAAQ;AAC7C,QAAIC,IAAYD,EAAO,aAAayE,GAAYzE,EAAO,SAAS;AAChE,QAAI;AACF,MAAAC,IAAYF,GAAaC,GAAQC,GAAW/D,CAAE;AAAA,IAChD,UAAC;AACC,MAAA8D,EAAO,WAAW0E,GAAY1E,EAAO,QAAQ,GACzCC,IACFD,EAAO,YAAY2E,GAAQ1E,CAAS,IAAIyE,GAAYzE,CAAS,IAAIA,IAEjED,EAAO,YAAY;AAAA,IAEvB;AAAA,EACF;AACF,GAGI4E,KAAiB;AAAA,EACnB,YAAY5E,GAAQ6E,GAAO1H,GAAS;AAClC,IAAA6C,EAAO,YAAY6E,GAAO1H,CAAO;AAAA,EACnC;AAAA,EACA,UAAU6C,GAAQ7C,GAAS;AACzB,IAAA6C,EAAO,UAAU7C,CAAO;AAAA,EAC1B;AAAA,EACA,WAAW6C,GAAQ7C,GAAS;AAC1B,IAAA6C,EAAO,WAAW7C,CAAO;AAAA,EAC3B;AAAA,EACA,UAAU6C,GAAQ7C,GAAS;AACzB,IAAA6C,EAAO,UAAU7C,CAAO;AAAA,EAC1B;AAAA,EACA,YAAY6C,GAAQ7C,GAAS;AAC3B,IAAA6C,EAAO,YAAY7C,CAAO;AAAA,EAC5B;AAAA,EACA,SAAS6C,GAAQ8E,GAAO3H,GAAS;AAC/B,IAAA6C,EAAO,SAAS8E,GAAO3H,CAAO;AAAA,EAChC;AAAA,EACA,WAAW6C,GAAQ7C,GAAS;AAC1B,IAAA6C,EAAO,WAAW7C,CAAO;AAAA,EAC3B;AAAA,EACA,WAAW6C,GAAQ8E,GAAO3H,GAAS;AACjC,IAAA6C,EAAO,WAAW8E,GAAO3H,CAAO;AAAA,EAClC;AAAA,EACA,YAAY6C,GAAQ7C,GAAS;AAC3B,IAAA6C,EAAO,YAAY7C,CAAO;AAAA,EAC5B;AAAA,EACA,UAAU6C,GAAQ+E,GAAS5H,GAAS;AAClC,IAAA6C,EAAO,UAAU+E,GAAS5H,CAAO;AAAA,EACnC;AACF,GAGI6H,KAAsB;AAAA,EACxB,SAAShF,GAAQ7C,GAAS;AACxB,IAAA6C,EAAO,SAAS7C,CAAO;AAAA,EACzB;AAAA,EACA,SAAS6C,GAAQ;AACf,IAAAA,EAAO,SAAQ;AAAA,EACjB;AAAA,EACA,KAAKA,GAAQ7C,GAAS;AACpB,IAAA6C,EAAO,KAAK7C,CAAO;AAAA,EACrB;AAAA,EACA,OAAO6C,GAAQiF,GAAQ;AACrB,IAAAjF,EAAO,OAAOiF,CAAM;AAAA,EACtB;AAAA,EACA,SAASjF,GAAQ8E,GAAO3H,GAAS;AAC/B,IAAA6C,EAAO,SAAS8E,GAAO3H,CAAO;AAAA,EAChC;AAAA,EACA,aAAa6C,GAAQ8E,GAAO;AAC1B,IAAA9E,EAAO,aAAa8E,CAAK;AAAA,EAC3B;AACF,GAYII,KAAc,CAAChF,GAAM5C,MAAY;AACnC,WAASkC,KAAOU,GAAM;AACpB,QAAIiF,IAAIjF,EAAKV,CAAG,GACZ4F,IAAI9H,EAAQkC,CAAG;AACnB,QAAI6F,EAAcF,CAAC,KAAKE,EAAcD,CAAC;AACrC,UAAI,CAACF,GAAYC,GAAGC,CAAC,EAAG,QAAO;AAAA,eACtB,MAAM,QAAQD,CAAC,KAAK,MAAM,QAAQC,CAAC,GAAG;AAC/C,UAAID,EAAE,WAAWC,EAAE,OAAQ,QAAO;AAClC,eAAS5H,IAAI,GAAGA,IAAI2H,EAAE,QAAQ3H;AAC5B,YAAI2H,EAAE3H,CAAC,MAAM4H,EAAE5H,CAAC,EAAG,QAAO;AAAA,IAE9B,WAAW2H,MAAMC;AACf,aAAO;AAAA,EAEX;AAMA,WAASvE,KAAQvD;AACf,QAAI4C,EAAKW,CAAI,MAAM,UAAavD,EAAQuD,CAAI,MAAM;AAChD,aAAO;AAGX,SAAO;AACT;AAEA,SAASyE,GAA8BC,GAAQC,GAAU;AACvD,MAAID,KAAU,KAAM,QAAO,CAAA;AAC3B,MAAIN,IAAS,CAAA,GACTQ,IAAa,OAAO,KAAKF,CAAM,GAC/B/F,GAAKhC;AACT,OAAKA,IAAI,GAAGA,IAAIiI,EAAW,QAAQjI;AAEjC,IADAgC,IAAMiG,EAAWjI,CAAC,GACd,EAAAgI,EAAS,QAAQhG,CAAG,KAAK,OAC7ByF,EAAOzF,CAAG,IAAI+F,EAAO/F,CAAG;AAE1B,SAAOyF;AACT;AAEA,SAASS,GAAyBH,GAAQC,GAAU;AAClD,MAAID,KAAU,KAAM,QAAO,CAAA;AAC3B,MAAIN,IAASK,GAA8BC,GAAQC,CAAQ,GACvDhG,GAAKhC;AACT,MAAI,OAAO,uBAAuB;AAChC,QAAImI,IAAmB,OAAO,sBAAsBJ,CAAM;AAC1D,SAAK/H,IAAI,GAAGA,IAAImI,EAAiB,QAAQnI;AAEvC,MADAgC,IAAMmG,EAAiBnI,CAAC,GACpB,EAAAgI,EAAS,QAAQhG,CAAG,KAAK,MACxB,OAAO,UAAU,qBAAqB,KAAK+F,GAAQ/F,CAAG,MAC3DyF,EAAOzF,CAAG,IAAI+F,EAAO/F,CAAG;AAAA,EAE5B;AACA,SAAOyF;AACT;AAEA,IAAIW,KAAc,CAAC,UAAU,OAAO;AACpC,SAASC,GAAU,GAAGjG,GAAG;AAAE,MAAIC,IAAI,OAAO,KAAK,CAAC;AAAG,MAAI,OAAO,uBAAuB;AAAE,QAAIb,IAAI,OAAO,sBAAsB,CAAC;AAAG,IAAAY,MAAMZ,IAAIA,EAAE,OAAO,SAAUY,GAAG;AAAE,aAAO,OAAO,yBAAyB,GAAGA,CAAC,EAAE;AAAA,IAAY,CAAC,IAAIC,EAAE,KAAK,MAAMA,GAAGb,CAAC;AAAA,EAAG;AAAE,SAAOa;AAAG;AAChQ,SAASiG,GAAgB,GAAG;AAAE,WAASlG,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAE,QAAIC,IAAY,UAAUD,CAAC,KAAnB,OAAuB,UAAUA,CAAC,IAAI,CAAA;AAAI,IAAAA,IAAI,IAAIiG,GAAU,OAAOhG,CAAC,GAAG,EAAE,EAAE,QAAQ,SAAUD,GAAG;AAAE,MAAAH,EAAgB,GAAGG,GAAGC,EAAED,CAAC,CAAC;AAAA,IAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiB,GAAG,OAAO,0BAA0BC,CAAC,CAAC,IAAIgG,GAAU,OAAOhG,CAAC,CAAC,EAAE,QAAQ,SAAUD,GAAG;AAAE,aAAO,eAAe,GAAGA,GAAG,OAAO,yBAAyBC,GAAGD,CAAC,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AAAE,SAAO;AAAG;AAEzb,IAACjD,IAAQ;AAAA,EACV,MAAMoJ,GAAO;AACX,QAAI5I,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,MACF,SAAAC,IAAU;AAAA,IAChB,IAAQD,GACA;AAAA,MACF,QAAA6I;AAAA,MACA,OAAAC;AAAA,IACN,IAAQF;AACJ,WAAOpJ,EAAM,WAAWoJ,CAAK,MAAM3I,IAAU,CAAC4I,GAAQC,CAAK,IAAI,CAACA,GAAOD,CAAM;AAAA,EAC/E;AAAA,EACA,IAAID,GAAO;AACT,QAAI,CAAA,EAAGG,CAAG,IAAIvJ,EAAM,MAAMoJ,CAAK;AAC/B,WAAOG;AAAA,EACT;AAAA,EACA,OAAOH,GAAOzI,GAAS;AACrB,WAAOb,EAAM,OAAOsJ,EAAM,QAAQzI,EAAQ,MAAM,KAAKb,EAAM,OAAOsJ,EAAM,OAAOzI,EAAQ,KAAK;AAAA,EAC9F;AAAA,EACA,SAASyI,GAAOd,GAAQ;AACtB,QAAItI,EAAM,QAAQsI,CAAM,GAAG;AACzB,UAAItI,EAAM,SAASoJ,GAAOd,EAAO,MAAM,KAAKtI,EAAM,SAASoJ,GAAOd,EAAO,KAAK;AAC5E,eAAO;AAET,UAAI,CAACkB,GAAIC,CAAE,IAAIzJ,EAAM,MAAMoJ,CAAK,GAC5B,CAACM,GAAIC,CAAE,IAAI3J,EAAM,MAAMsI,CAAM;AACjC,aAAOxI,EAAM,SAAS0J,GAAIE,CAAE,KAAK5J,EAAM,QAAQ2J,GAAIE,CAAE;AAAA,IACvD;AACA,QAAI,CAACC,GAAOL,CAAG,IAAIvJ,EAAM,MAAMoJ,CAAK,GAChCS,IAAe,IACfC,IAAc;AAClB,WAAIhK,EAAM,QAAQwI,CAAM,KACtBuB,IAAe/J,EAAM,QAAQwI,GAAQsB,CAAK,KAAK,GAC/CE,IAAchK,EAAM,QAAQwI,GAAQiB,CAAG,KAAK,MAE5CM,IAAelK,EAAK,QAAQ2I,GAAQsB,EAAM,IAAI,KAAK,GACnDE,IAAcnK,EAAK,QAAQ2I,GAAQiB,EAAI,IAAI,KAAK,IAE3CM,KAAgBC;AAAA,EACzB;AAAA,EACA,aAAaV,GAAOzI,GAAS;AAC3B,QAAIoJ,IAAOhB,GAAyBK,GAAOH,EAAW,GAClD,CAACe,GAAIC,CAAE,IAAIjK,EAAM,MAAMoJ,CAAK,GAC5B,CAACc,GAAIC,CAAE,IAAInK,EAAM,MAAMW,CAAO,GAC9BiJ,IAAQ9J,EAAM,SAASkK,GAAIE,CAAE,IAAIA,IAAKF,GACtCT,IAAMzJ,EAAM,SAASmK,GAAIE,CAAE,IAAIF,IAAKE;AACxC,WAAIrK,EAAM,SAASyJ,GAAKK,CAAK,IACpB,OAEAT,GAAgB;AAAA,MACrB,QAAQS;AAAA,MACR,OAAOL;AAAA,IACf,GAASQ,CAAI;AAAA,EAEX;AAAA,EACA,WAAWX,GAAO;AAChB,QAAI;AAAA,MACF,QAAAC;AAAA,MACA,OAAAC;AAAA,IACN,IAAQF;AACJ,WAAOtJ,EAAM,QAAQuJ,GAAQC,CAAK;AAAA,EACpC;AAAA,EACA,YAAYF,GAAO;AACjB,QAAI;AAAA,MACF,QAAAC;AAAA,MACA,OAAAC;AAAA,IACN,IAAQF;AACJ,WAAOtJ,EAAM,OAAOuJ,GAAQC,CAAK;AAAA,EACnC;AAAA,EACA,WAAWF,GAAO;AAChB,WAAO,CAACpJ,EAAM,YAAYoJ,CAAK;AAAA,EACjC;AAAA,EACA,UAAUA,GAAO;AACf,WAAO,CAACpJ,EAAM,WAAWoJ,CAAK;AAAA,EAChC;AAAA,EACA,QAAQhI,GAAO;AACb,WAAOsH,EAActH,CAAK,KAAKtB,EAAM,QAAQsB,EAAM,MAAM,KAAKtB,EAAM,QAAQsB,EAAM,KAAK;AAAA,EACzF;AAAA,EACA,CAAC,OAAOgI,GAAO;AACb,UAAM,CAACA,EAAM,QAAQ,QAAQ,GAC7B,MAAM,CAACA,EAAM,OAAO,OAAO;AAAA,EAC7B;AAAA,EACA,MAAMA,GAAO;AACX,QAAI,CAACQ,CAAK,IAAI5J,EAAM,MAAMoJ,CAAK;AAC/B,WAAOQ;AAAA,EACT;AAAA,EACA,UAAUR,GAAO7J,GAAI;AACnB,QAAIiB,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,WAAO4J,GAAQhB,GAAO,CAAAnG,MAAK;AACzB,UAAIA,MAAM;AACR,eAAO;AAET,UAAI;AAAA,QACF,UAAAxD,IAAW;AAAA,MACnB,IAAUe,GACA6J,GACAC;AACJ,UAAI7K,MAAa,UAAU;AAIzB,YAAI8K,IAAcvK,EAAM,YAAYiD,CAAC;AACrC,QAAIjD,EAAM,UAAUiD,CAAC,KACnBoH,IAAiB,WACjBC,IAAgBC,IAAcF,IAAiB,eAE/CA,IAAiB,YACjBC,IAAgBC,IAAcF,IAAiB;AAAA,MAEnD,MAAO,CAAI5K,MAAa,YAClBO,EAAM,UAAUiD,CAAC,KACnBoH,IAAiB,YACjBC,IAAgB,cAEhBD,IAAiB,WACjBC,IAAgB,eAGlBD,IAAiB5K,GACjB6K,IAAgB7K;AAElB,UAAI4J,IAASvJ,EAAM,UAAUmD,EAAE,QAAQ1D,GAAI;AAAA,QACzC,UAAU8K;AAAA,MAClB,CAAO,GACGf,IAAQxJ,EAAM,UAAUmD,EAAE,OAAO1D,GAAI;AAAA,QACvC,UAAU+K;AAAA,MAClB,CAAO;AACD,UAAI,CAACjB,KAAU,CAACC;AACd,eAAO;AAET,MAAArG,EAAE,SAASoG,GACXpG,EAAE,QAAQqG;AAAA,IACZ,CAAC;AAAA,EACH;AACF,GAKIkB,KAAY,CAAApJ,MACPsH,EAActH,CAAK,KAAKqC,EAAK,WAAWrC,EAAM,QAAQ,KAAK,CAACqJ,EAAO,SAASrJ,CAAK,GAGtFsJ,IAAU;AAAA,EACZ,WAAWtJ,GAAO;AAChB,WAAOsH,EAActH,CAAK,KAAKqC,EAAK,WAAWrC,EAAM,QAAQ;AAAA,EAC/D;AAAA,EACA,WAAAoJ;AAAA,EACA,cAAcpJ,GAAO;AACnB,WAAO,MAAM,QAAQA,CAAK,KAAKA,EAAM,MAAM,CAAAuJ,MAAOD,EAAQ,UAAUC,CAAG,CAAC;AAAA,EAC1E;AAAA,EACA,eAAexC,GAAO;AACpB,WAAOA,EAAM,aAAa;AAAA,EAC5B;AAAA,EACA,eAAe,SAAuB/G,GAAOwJ,GAAY;AACvD,QAAIC,IAAa,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AACrF,WAAOL,GAAUpJ,CAAK,KAAKA,EAAMyJ,CAAU,MAAMD;AAAA,EACnD;AAAA,EACA,QAAQxC,GAASD,GAAO;AACtB,aAAStF,KAAOsF;AACd,UAAItF,MAAQ,cAGRuF,EAAQvF,CAAG,MAAMsF,EAAMtF,CAAG;AAC5B,eAAO;AAGX,WAAO;AAAA,EACT;AACF,GAEIiI,KAAc,CAAC,UAAU,GAC3BC,KAAe,CAAC,MAAM,GACpBC,KAAqB,oBAAI,QAAO,GAEhCvH,IAAO;AAAA,EACT,SAASwH,GAAMvL,GAAM;AACnB,QAAI6D,IAAOE,EAAK,IAAIwH,GAAMvL,CAAI;AAC9B,QAAI+E,EAAK,OAAOlB,CAAI;AAClB,YAAM,IAAI,MAAM,yCAAyC,OAAO7D,GAAM,8CAA8C,EAAE,OAAOgF,EAAS,UAAUnB,CAAI,CAAC,CAAC;AAExJ,WAAOA;AAAA,EACT;AAAA,EACA,UAAU0H,GAAMvL,GAAM;AACpB,QAAIc,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,WAAO,aAAa;AAClB,eAASmB,KAAKhC,EAAK,UAAUD,GAAMc,CAAO,GAAG;AAC3C,YAAIW,IAAIsC,EAAK,SAASwH,GAAMtJ,CAAC,GACzBuJ,IAAQ,CAAC/J,GAAGQ,CAAC;AACjB,cAAMuJ;AAAA,MACR;AAAA,IACF,EAAC;AAAA,EACH;AAAA,EACA,MAAMD,GAAMvH,GAAO;AACjB,QAAIe,EAAK,OAAOwG,CAAI;AAClB,YAAM,IAAI,MAAM,wCAAwC,OAAOvG,EAAS,UAAUuG,CAAI,CAAC,CAAC;AAE1F,QAAIE,IAAIF,EAAK,SAASvH,CAAK;AAC3B,QAAIyH,KAAK;AACP,YAAM,IAAI,MAAM,8BAA8B,OAAOzH,GAAO,aAAa,EAAE,OAAOgB,EAAS,UAAUuG,CAAI,CAAC,CAAC;AAE7G,WAAOE;AAAA,EACT;AAAA,EACA,SAASF,GAAMvL,GAAM;AACnB,QAAIc,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,WAAO,aAAa;AASlB,eARI;AAAA,QACF,SAAAC,IAAU;AAAA,MAClB,IAAUD,GACAkB,IAAW+B,EAAK,SAASwH,GAAMvL,CAAI,GACnC;AAAA,QACF,UAAA0L;AAAA,MACR,IAAU1J,GACAgC,IAAQjD,IAAU2K,EAAS,SAAS,IAAI,GACrC3K,IAAUiD,KAAS,IAAIA,IAAQ0H,EAAS,UAAQ;AACrD,YAAIC,IAAQ5H,EAAK,MAAM/B,GAAUgC,CAAK,GAClC4H,IAAY5L,EAAK,OAAOgE,CAAK;AACjC,cAAM,CAAC2H,GAAOC,CAAS,GACvB5H,IAAQjD,IAAUiD,IAAQ,IAAIA,IAAQ;AAAA,MACxC;AAAA,IACF,EAAC;AAAA,EACH;AAAA,EACA,OAAOuH,GAAMvL,GAAMiB,GAAS;AAC1B,QAAIgB,IAAIhC,EAAK,OAAOD,GAAMiB,CAAO,GAC7BQ,IAAIsC,EAAK,IAAIwH,GAAMtJ,CAAC;AACxB,WAAO,CAACR,GAAGQ,CAAC;AAAA,EACd;AAAA,EACA,WAAWsJ,GAAMvL,GAAM;AACrB,QAAI6D,IAAOE,EAAK,IAAIwH,GAAMvL,CAAI;AAC9B,QAAI+K,EAAO,SAASlH,CAAI;AACtB,YAAM,IAAI,MAAM,2CAA2C,OAAO7D,GAAM,uDAAuD,EAAE,OAAOgF,EAAS,UAAUnB,CAAI,CAAC,CAAC;AAEnK,WAAOA;AAAA,EACT;AAAA,EACA,YAAY0H,GAAM;AAChB,QAAIzK,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,WAAO,aAAa;AAClB,eAAS,CAAC+C,GAAM7D,CAAI,KAAK+D,EAAK,MAAMwH,GAAMzK,CAAO;AAC/C,QAAId,EAAK,WAAW,MAGlB,MAAM,CAAC6D,GAAM7D,CAAI;AAAA,IAGvB,EAAC;AAAA,EACH;AAAA,EACA,SAASuL,GAAM;AACb,QAAIzK,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,WAAO,aAAa;AAClB,eAAS,CAAC+C,GAAM7D,CAAI,KAAK+D,EAAK,MAAMwH,GAAMzK,CAAO;AAC/C,QAAIkK,EAAQ,UAAUnH,CAAI,MACxB,MAAM,CAACA,GAAM7D,CAAI;AAAA,IAGvB,EAAC;AAAA,EACH;AAAA,EACA,aAAa6D,GAAM;AACjB,QAAImH,EAAQ,WAAWnH,CAAI,GAAG;AAC5B,UAAIkD,IAAasC,GAAyBxF,GAAMuH,EAAW;AAC3D,aAAOrE;AAAA,IACT,OAAO;AACL,UAAIA,IAAasC,GAAyBxF,GAAMwH,EAAY;AAC5D,aAAOtE;AAAA,IACT;AAAA,EACF;AAAA,EACA,MAAMwE,GAAMvL,GAAM;AAGhB,aAFIiC,IAAIjC,EAAK,MAAK,GACd,IAAI+D,EAAK,IAAIwH,GAAMtJ,CAAC,GACjB,KACD,EAAA8C,EAAK,OAAO,CAAC,KAAK,EAAE,SAAS,WAAW;AAG1C,UAAI,EAAE,SAAS,CAAC,GAChB9C,EAAE,KAAK,CAAC;AAGZ,WAAO,CAAC,GAAGA,CAAC;AAAA,EACd;AAAA,EACA,SAASsJ,GAAM7B,GAAO;AACpB,QAAI3E,EAAK,OAAOwG,CAAI;AAClB,YAAM,IAAI,MAAM,yDAAyD,OAAOvG,EAAS,UAAUuG,CAAI,CAAC,CAAC;AAE3G,QAAIM,IAAUnB,GAAQ;AAAA,MACpB,UAAUa,EAAK;AAAA,IACrB,GAAO,CAAAhI,MAAK;AACN,UAAI,CAAC2G,GAAOL,CAAG,IAAIvJ,EAAM,MAAMoJ,CAAK,GAChCoC,IAAc/H,EAAK,MAAMR,GAAG;AAAA,QAC9B,SAAS;AAAA,QACT,MAAM,CAAAwI,MAAQ;AACZ,cAAI,CAAA,EAAG/L,CAAI,IAAI+L;AACf,iBAAO,CAACzL,EAAM,SAASoJ,GAAO1J,CAAI;AAAA,QACpC;AAAA,MACR,CAAO;AACD,eAAS,CAAA,EAAGA,CAAI,KAAK8L,GAAa;AAChC,YAAI,CAACxL,EAAM,SAASoJ,GAAO1J,CAAI,GAAG;AAChC,cAAI8D,IAASC,EAAK,OAAOR,GAAGvD,CAAI,GAC5BgE,IAAQhE,EAAKA,EAAK,SAAS,CAAC;AAChC,UAAA8D,EAAO,SAAS,OAAOE,GAAO,CAAC;AAAA,QACjC;AACA,YAAI/D,EAAK,OAAOD,GAAM6J,EAAI,IAAI,GAAG;AAC/B,cAAImC,IAAOjI,EAAK,KAAKR,GAAGvD,CAAI;AAC5B,UAAAgM,EAAK,OAAOA,EAAK,KAAK,MAAM,GAAGnC,EAAI,MAAM;AAAA,QAC3C;AACA,YAAI5J,EAAK,OAAOD,GAAMkK,EAAM,IAAI,GAAG;AACjC,cAAI+B,IAAQlI,EAAK,KAAKR,GAAGvD,CAAI;AAC7B,UAAAiM,EAAM,OAAOA,EAAM,KAAK,MAAM/B,EAAM,MAAM;AAAA,QAC5C;AAAA,MACF;AACA,MAAIa,EAAO,SAASxH,CAAC,MACnBA,EAAE,YAAY;AAAA,IAElB,CAAC;AACD,WAAOsI,EAAQ;AAAA,EACjB;AAAA,EACA,IAAIN,GAAMvL,GAAM;AAEd,aADI6D,IAAO0H,GACFpK,IAAI,GAAGA,IAAInB,EAAK,QAAQmB,KAAK;AACpC,UAAIc,IAAIjC,EAAKmB,CAAC;AACd,UAAI4D,EAAK,OAAOlB,CAAI,KAAK,CAACA,EAAK,SAAS5B,CAAC;AACvC,cAAM,IAAI,MAAM,qCAAqC,OAAOjC,GAAM,aAAa,EAAE,OAAOgF,EAAS,UAAUuG,CAAI,CAAC,CAAC;AAEnH,MAAA1H,IAAOA,EAAK,SAAS5B,CAAC;AAAA,IACxB;AACA,WAAO4B;AAAA,EACT;AAAA,EACA,IAAI0H,GAAMvL,GAAM;AAEd,aADI6D,IAAO0H,GACFpK,IAAI,GAAGA,IAAInB,EAAK,QAAQmB,KAAK;AACpC,UAAIc,IAAIjC,EAAKmB,CAAC;AACd,UAAI4D,EAAK,OAAOlB,CAAI,KAAK,CAACA,EAAK,SAAS5B,CAAC;AACvC,eAAO;AAET,MAAA4B,IAAOA,EAAK,SAAS5B,CAAC;AAAA,IACxB;AACA,WAAO;AAAA,EACT;AAAA,EACA,OAAOP,GAAO;AACZ,WAAOqD,EAAK,OAAOrD,CAAK,KAAKsJ,EAAQ,UAAUtJ,CAAK,KAAKqJ,EAAO,SAASrJ,CAAK;AAAA,EAChF;AAAA,EACA,WAAWA,GAAO;AAChB,QAAI,CAAC,MAAM,QAAQA,CAAK;AACtB,aAAO;AAET,QAAIwK,IAAeZ,GAAmB,IAAI5J,CAAK;AAC/C,QAAIwK,MAAiB;AACnB,aAAOA;AAET,QAAIC,IAAazK,EAAM,MAAM,CAAAuJ,MAAOlH,EAAK,OAAOkH,CAAG,CAAC;AACpD,WAAAK,GAAmB,IAAI5J,GAAOyK,CAAU,GACjCA;AAAA,EACT;AAAA,EACA,KAAKZ,GAAMvL,GAAM;AAGf,aAFIiC,IAAIjC,EAAK,MAAK,GACd,IAAI+D,EAAK,IAAIwH,GAAMtJ,CAAC,GACjB,KACD,EAAA8C,EAAK,OAAO,CAAC,KAAK,EAAE,SAAS,WAAW,MADpC;AAIN,UAAI5D,IAAI,EAAE,SAAS,SAAS;AAC5B,UAAI,EAAE,SAASA,CAAC,GAChBc,EAAE,KAAKd,CAAC;AAAA,IAEZ;AACA,WAAO,CAAC,GAAGc,CAAC;AAAA,EACd;AAAA,EACA,KAAKsJ,GAAMvL,GAAM;AACf,QAAI6D,IAAOE,EAAK,IAAIwH,GAAMvL,CAAI;AAC9B,QAAI,CAAC+E,EAAK,OAAOlB,CAAI;AACnB,YAAM,IAAI,MAAM,qCAAqC,OAAO7D,GAAM,0CAA0C,EAAE,OAAOgF,EAAS,UAAUnB,CAAI,CAAC,CAAC;AAEhJ,WAAOA;AAAA,EACT;AAAA,EACA,OAAO0H,GAAMvL,GAAM;AACjB,QAAIc,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,WAAO,aAAa;AAClB,eAASmB,KAAKhC,EAAK,OAAOD,GAAMc,CAAO,GAAG;AACxC,YAAIW,IAAIsC,EAAK,IAAIwH,GAAMtJ,CAAC;AACxB,cAAM,CAACR,GAAGQ,CAAC;AAAA,MACb;AAAA,IACF,EAAC;AAAA,EACH;AAAA,EACA,QAAQ4B,GAAM4E,GAAO;AACnB,WAAOuC,EAAQ,UAAUnH,CAAI,KAAKmH,EAAQ,eAAevC,CAAK,KAAKuC,EAAQ,QAAQnH,GAAM4E,CAAK,KAAK1D,EAAK,OAAOlB,CAAI,KAAKkB,EAAK,YAAY0D,CAAK,KAAK1D,EAAK,QAAQlB,GAAM4E,CAAK;AAAA,EAC7K;AAAA,EACA,MAAM8C,GAAM;AACV,QAAIzK,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,WAAO,aAAa;AAYlB,eAXI;AAAA,QACF,MAAAsL;AAAA,QACA,SAAArL,IAAU;AAAA,MAClB,IAAUD,GACA;AAAA,QACF,MAAAuL,IAAO,CAAA;AAAA,QACP,IAAAC;AAAA,MACR,IAAUxL,GACAyL,IAAU,oBAAI,IAAG,GACjBtK,IAAI,CAAA,GACJR,IAAI8J,GAEF,EAAAe,MAAOvL,IAAUd,EAAK,SAASgC,GAAGqK,CAAE,IAAIrM,EAAK,QAAQgC,GAAGqK,CAAE,OADnD;AAQX,YAJKC,EAAQ,IAAI9K,CAAC,MAChB,MAAM,CAACA,GAAGQ,CAAC,IAGT,CAACsK,EAAQ,IAAI9K,CAAC,KAAK,CAACsD,EAAK,OAAOtD,CAAC,KAAKA,EAAE,SAAS,WAAW,MAAM2K,KAAQ,QAAQA,EAAK,CAAC3K,GAAGQ,CAAC,CAAC,MAAM,KAAQ;AAC7G,UAAAsK,EAAQ,IAAI9K,CAAC;AACb,cAAI+K,IAAYzL,IAAUU,EAAE,SAAS,SAAS,IAAI;AAClD,UAAIxB,EAAK,WAAWgC,GAAGoK,CAAI,MACzBG,IAAYH,EAAKpK,EAAE,MAAM,IAE3BA,IAAIA,EAAE,OAAOuK,CAAS,GACtB/K,IAAIsC,EAAK,IAAIwH,GAAMtJ,CAAC;AACpB;AAAA,QACF;AAEA,YAAIA,EAAE,WAAW;AACf;AAGF,YAAI,CAAClB,GAAS;AACZ,cAAIqE,IAAUnF,EAAK,KAAKgC,CAAC;AACzB,cAAI8B,EAAK,IAAIwH,GAAMnG,CAAO,GAAG;AAC3B,YAAAnD,IAAImD,GACJ3D,IAAIsC,EAAK,IAAIwH,GAAMtJ,CAAC;AACpB;AAAA,UACF;AAAA,QACF;AAEA,YAAIlB,KAAWkB,EAAEA,EAAE,SAAS,CAAC,MAAM,GAAG;AACpC,cAAIwK,IAAWxM,EAAK,SAASgC,CAAC;AAC9B,UAAAA,IAAIwK,GACJhL,IAAIsC,EAAK,IAAIwH,GAAMtJ,CAAC;AACpB;AAAA,QACF;AAEA,QAAAA,IAAIhC,EAAK,OAAOgC,CAAC,GACjBR,IAAIsC,EAAK,IAAIwH,GAAMtJ,CAAC,GACpBsK,EAAQ,IAAI9K,CAAC;AAAA,MACf;AAAA,IACF,EAAC;AAAA,EACH;AAAA,EACA,OAAO8J,GAAMvL,GAAM;AACjB,QAAI0M,IAAazM,EAAK,OAAOD,CAAI,GAC7BiC,IAAI8B,EAAK,IAAIwH,GAAMmB,CAAU;AACjC,QAAI3H,EAAK,OAAO9C,CAAC;AACf,YAAM,IAAI,MAAM,kCAAkC,OAAOjC,GAAM,0CAA0C,CAAC;AAE5G,WAAOiC;AAAA,EACT;AAAA,EACA,OAAO4B,GAAM;AACX,WAAIkB,EAAK,OAAOlB,CAAI,IACXA,EAAK,OAELA,EAAK,SAAS,IAAIE,EAAK,MAAM,EAAE,KAAK,EAAE;AAAA,EAEjD;AAAA,EACA,MAAMwH,GAAM;AACV,QAAIzK,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,WAAO,aAAa;AAClB,eAAS,CAAC+C,GAAM7D,CAAI,KAAK+D,EAAK,MAAMwH,GAAMzK,CAAO;AAC/C,QAAIiE,EAAK,OAAOlB,CAAI,MAClB,MAAM,CAACA,GAAM7D,CAAI;AAAA,IAGvB,EAAC;AAAA,EACH;AACF;AAEA,SAAS2M,GAAU,GAAGpJ,GAAG;AAAE,MAAIC,IAAI,OAAO,KAAK,CAAC;AAAG,MAAI,OAAO,uBAAuB;AAAE,QAAIb,IAAI,OAAO,sBAAsB,CAAC;AAAG,IAAAY,MAAMZ,IAAIA,EAAE,OAAO,SAAUY,GAAG;AAAE,aAAO,OAAO,yBAAyB,GAAGA,CAAC,EAAE;AAAA,IAAY,CAAC,IAAIC,EAAE,KAAK,MAAMA,GAAGb,CAAC;AAAA,EAAG;AAAE,SAAOa;AAAG;AAChQ,SAASoJ,EAAgB,GAAG;AAAE,WAASrJ,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAE,QAAIC,IAAY,UAAUD,CAAC,KAAnB,OAAuB,UAAUA,CAAC,IAAI,CAAA;AAAI,IAAAA,IAAI,IAAIoJ,GAAU,OAAOnJ,CAAC,GAAG,EAAE,EAAE,QAAQ,SAAUD,GAAG;AAAE,MAAAH,EAAgB,GAAGG,GAAGC,EAAED,CAAC,CAAC;AAAA,IAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiB,GAAG,OAAO,0BAA0BC,CAAC,CAAC,IAAImJ,GAAU,OAAOnJ,CAAC,CAAC,EAAE,QAAQ,SAAUD,GAAG;AAAE,aAAO,eAAe,GAAGA,GAAG,OAAO,yBAAyBC,GAAGD,CAAC,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AAAE,SAAO;AAAG;AAEzb,IAACsJ,KAAY;AAAA,EACd,gBAAgBnL,GAAO;AACrB,WAAOmL,GAAU,YAAYnL,CAAK,KAAKA,EAAM,KAAK,SAAS,OAAO;AAAA,EACpE;AAAA,EACA,YAAYA,GAAO;AACjB,QAAI,CAACsH,EAActH,CAAK;AACtB,aAAO;AAET,YAAQA,EAAM,MAAI;AAAA,MAChB,KAAK;AACH,eAAOzB,EAAK,OAAOyB,EAAM,IAAI,KAAKqC,EAAK,OAAOrC,EAAM,IAAI;AAAA,MAC1D,KAAK;AACH,eAAO,OAAOA,EAAM,UAAW,YAAY,OAAOA,EAAM,QAAS,YAAYzB,EAAK,OAAOyB,EAAM,IAAI;AAAA,MACrG,KAAK;AACH,eAAO,OAAOA,EAAM,YAAa,YAAYzB,EAAK,OAAOyB,EAAM,IAAI,KAAKsH,EAActH,EAAM,UAAU;AAAA,MACxG,KAAK;AACH,eAAOzB,EAAK,OAAOyB,EAAM,IAAI,KAAKzB,EAAK,OAAOyB,EAAM,OAAO;AAAA,MAC7D,KAAK;AACH,eAAOzB,EAAK,OAAOyB,EAAM,IAAI,KAAKqC,EAAK,OAAOrC,EAAM,IAAI;AAAA,MAC1D,KAAK;AACH,eAAO,OAAOA,EAAM,UAAW,YAAY,OAAOA,EAAM,QAAS,YAAYzB,EAAK,OAAOyB,EAAM,IAAI;AAAA,MACrG,KAAK;AACH,eAAOzB,EAAK,OAAOyB,EAAM,IAAI,KAAKsH,EAActH,EAAM,UAAU,KAAKsH,EAActH,EAAM,aAAa;AAAA,MACxG,KAAK;AACH,eAAOA,EAAM,eAAe,QAAQpB,EAAM,QAAQoB,EAAM,aAAa,KAAKA,EAAM,kBAAkB,QAAQpB,EAAM,QAAQoB,EAAM,UAAU,KAAKsH,EAActH,EAAM,UAAU,KAAKsH,EAActH,EAAM,aAAa;AAAA,MACnN,KAAK;AACH,eAAOzB,EAAK,OAAOyB,EAAM,IAAI,KAAK,OAAOA,EAAM,YAAa,YAAYsH,EAActH,EAAM,UAAU;AAAA,MACxG;AACE,eAAO;AAAA,IACf;AAAA,EACE;AAAA,EACA,gBAAgBA,GAAO;AACrB,WAAO,MAAM,QAAQA,CAAK,KAAKA,EAAM,MAAM,CAAAuJ,MAAO4B,GAAU,YAAY5B,CAAG,CAAC;AAAA,EAC9E;AAAA,EACA,qBAAqBvJ,GAAO;AAC1B,WAAOmL,GAAU,YAAYnL,CAAK,KAAKA,EAAM,KAAK,SAAS,YAAY;AAAA,EACzE;AAAA,EACA,gBAAgBA,GAAO;AACrB,WAAOmL,GAAU,YAAYnL,CAAK,KAAKA,EAAM,KAAK,SAAS,OAAO;AAAA,EACpE;AAAA,EACA,QAAQ7B,GAAI;AACV,YAAQA,EAAG,MAAI;AAAA,MACb,KAAK;AAED,eAAO+M,EAAgBA,EAAgB,CAAA,GAAI/M,CAAE,GAAG,CAAA,GAAI;AAAA,UAClD,MAAM;AAAA,QAClB,CAAW;AAAA,MAEL,KAAK;AAED,eAAO+M,EAAgBA,EAAgB,CAAA,GAAI/M,CAAE,GAAG,CAAA,GAAI;AAAA,UAClD,MAAM;AAAA,QAClB,CAAW;AAAA,MAEL,KAAK;AAED,eAAO+M,EAAgBA,EAAgB,CAAA,GAAI/M,CAAE,GAAG,CAAA,GAAI;AAAA,UAClD,MAAM;AAAA,UACN,MAAMI,EAAK,SAASJ,EAAG,IAAI;AAAA,QACvC,CAAW;AAAA,MAEL,KAAK,aACH;AACE,YAAI;AAAA,UACF,SAAAuF;AAAA,UACA,MAAApF;AAAA,QACZ,IAAcH;AAEJ,YAAII,EAAK,OAAOmF,GAASpF,CAAI;AAC3B,iBAAOH;AAIT,YAAII,EAAK,UAAUD,GAAMoF,CAAO;AAC9B,iBAAOwH,EAAgBA,EAAgB,CAAA,GAAI/M,CAAE,GAAG,CAAA,GAAI;AAAA,YAClD,MAAMuF;AAAA,YACN,SAASpF;AAAA,UACvB,CAAa;AAQH,YAAI8M,IAAc7M,EAAK,UAAUD,GAAMH,CAAE,GACrCkN,IAAiB9M,EAAK,UAAUA,EAAK,KAAKD,CAAI,GAAGH,CAAE;AACvD,eAAO+M,EAAgBA,EAAgB,CAAA,GAAI/M,CAAE,GAAG,CAAA,GAAI;AAAA,UAClD,MAAMiN;AAAA,UACN,SAASC;AAAA,QACrB,CAAW;AAAA,MACH;AAAA,MACF,KAAK;AAED,eAAOH,EAAgBA,EAAgB,CAAA,GAAI/M,CAAE,GAAG,CAAA,GAAI;AAAA,UAClD,MAAM;AAAA,QAClB,CAAW;AAAA,MAEL,KAAK;AAED,eAAO+M,EAAgBA,EAAgB,CAAA,GAAI/M,CAAE,GAAG,CAAA,GAAI;AAAA,UAClD,MAAM;AAAA,QAClB,CAAW;AAAA,MAEL,KAAK,YACH;AACE,YAAI;AAAA,UACF,YAAAkH;AAAA,UACA,eAAAC;AAAA,QACZ,IAAcnH;AACJ,eAAO+M,EAAgBA,EAAgB,CAAA,GAAI/M,CAAE,GAAG,CAAA,GAAI;AAAA,UAClD,YAAYmH;AAAA,UACZ,eAAeD;AAAA,QAC3B,CAAW;AAAA,MACH;AAAA,MACF,KAAK,iBACH;AACE,YAAI;AAAA,UACF,YAAYS;AAAA,UACZ,eAAeJ;AAAA,QAC3B,IAAcvH;AACJ,eAAI2H,KAAe,OACVoF,EAAgBA,EAAgB,CAAA,GAAI/M,CAAE,GAAG,CAAA,GAAI;AAAA,UAClD,YAAYuH;AAAA,UACZ,eAAe;AAAA,QAC7B,CAAa,IACQA,KAAkB,OACpBwF,EAAgBA,EAAgB,CAAA,GAAI/M,CAAE,GAAG,CAAA,GAAI;AAAA,UAClD,YAAY;AAAA,UACZ,eAAe2H;AAAA,QAC7B,CAAa,IAEMoF,EAAgBA,EAAgB,CAAA,GAAI/M,CAAE,GAAG,CAAA,GAAI;AAAA,UAClD,YAAYuH;AAAA,UACZ,eAAeI;AAAA,QAC7B,CAAa;AAAA,MAEL;AAAA,MACF,KAAK;AAED,eAAOoF,EAAgBA,EAAgB,CAAA,GAAI/M,CAAE,GAAG,CAAA,GAAI;AAAA,UAClD,MAAM;AAAA,UACN,MAAMI,EAAK,KAAKJ,EAAG,IAAI;AAAA,QACnC,CAAW;AAAA,IAEX;AAAA,EACE;AACF,GAEImN,KAAkB,oBAAI,QAAO,GAC7BC,KAAW,CAAAvL,MAAS;AACtB,MAAIwL,IAAiBF,GAAgB,IAAItL,CAAK;AAC9C,MAAIwL,MAAmB;AACrB,WAAOA;AAET,MAAI,CAAClE,EAActH,CAAK;AACtB,WAAO;AAET,MAAIuL,IAAW,OAAOvL,EAAM,WAAY,cAAc,OAAOA,EAAM,SAAU,cAAc,OAAOA,EAAM,kBAAmB,cAAc,OAAOA,EAAM,eAAgB,cAAc,OAAOA,EAAM,mBAAoB,cAAc,OAAOA,EAAM,kBAAmB,cAAc,OAAOA,EAAM,cAAe,cAAc,OAAOA,EAAM,cAAe,cAAc,OAAOA,EAAM,qBAAsB,cAAc,OAAOA,EAAM,YAAa,cAAc,OAAOA,EAAM,gBAAiB,cAAc,OAAOA,EAAM,UAAW,cAAc,OAAOA,EAAM,iBAAkB,cAAc,OAAOA,EAAM,YAAa,cAAc,OAAOA,EAAM,cAAe,cAAc,OAAOA,EAAM,iBAAkB,eAAeA,EAAM,UAAU,QAAQsH,EAActH,EAAM,KAAK,OAAOA,EAAM,cAAc,QAAQpB,EAAM,QAAQoB,EAAM,SAAS,MAAMqC,EAAK,WAAWrC,EAAM,QAAQ,KAAKmL,GAAU,gBAAgBnL,EAAM,UAAU;AACj4B,SAAAsL,GAAgB,IAAItL,GAAOuL,CAAQ,GAC5BA;AACT,GAGIlC,IAAS;AAAA,EACX,MAAMpH,GAAQ7C,GAAS;AACrB,WAAO6C,EAAO,MAAM7C,CAAO;AAAA,EAC7B;AAAA,EACA,QAAQ6C,GAAQR,GAAKzB,GAAO;AAC1B,IAAAiC,EAAO,QAAQR,GAAKzB,CAAK;AAAA,EAC3B;AAAA,EACA,MAAMiC,GAAQwJ,GAAIrM,GAAS;AACzB,WAAO6C,EAAO,MAAMwJ,GAAIrM,CAAO;AAAA,EACjC;AAAA,EACA,OAAO6C,GAAQwJ,GAAIrM,GAAS;AAC1B,WAAO6C,EAAO,OAAOwJ,GAAIrM,CAAO;AAAA,EAClC;AAAA,EACA,eAAe6C,GAAQ;AACrB,QAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,MACF,MAAAsM,IAAO;AAAA,IACb,IAAQtM;AACJ,IAAA6C,EAAO,eAAeyJ,CAAI;AAAA,EAC5B;AAAA,EACA,cAAczJ,GAAQ;AACpB,QAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,MACF,MAAAsM,IAAO;AAAA,IACb,IAAQtM;AACJ,IAAA6C,EAAO,cAAcyJ,CAAI;AAAA,EAC3B;AAAA,EACA,eAAezJ,GAAQ7C,GAAS;AAC9B,IAAA6C,EAAO,eAAe7C,CAAO;AAAA,EAC/B;AAAA,EACA,MAAM6C,GAAQwJ,GAAI;AAChB,WAAOxJ,EAAO,MAAMwJ,CAAE;AAAA,EACxB;AAAA,EACA,gBAAgBxJ,GAAQ;AACtB,QAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,WAAO6C,EAAO,gBAAgB7C,CAAO;AAAA,EACvC;AAAA,EACA,IAAI6C,GAAQwJ,GAAI;AACd,WAAOxJ,EAAO,IAAIwJ,CAAE;AAAA,EACtB;AAAA,EACA,MAAMxJ,GAAQwJ,GAAI;AAChB,WAAOxJ,EAAO,MAAMwJ,CAAE;AAAA,EACxB;AAAA,EACA,SAASxJ,GAAQwJ,GAAI;AACnB,WAAOxJ,EAAO,SAASwJ,CAAE;AAAA,EAC3B;AAAA,EACA,UAAUxJ,GAAQ+E,GAAS;AACzB,WAAO/E,EAAO,UAAU+E,CAAO;AAAA,EACjC;AAAA,EACA,WAAW/E,GAAQ+E,GAAS;AAC1B,WAAO/E,EAAO,WAAW+E,CAAO;AAAA,EAClC;AAAA,EACA,QAAQ/E,GAAQ3D,GAAM;AACpB,WAAO2D,EAAO,QAAQ3D,CAAI;AAAA,EAC5B;AAAA,EACA,SAAS2D,GAAQ+E,GAAS;AACxB,WAAO/E,EAAO,SAAS+E,CAAO;AAAA,EAChC;AAAA,EACA,YAAY/E,GAAQ;AAClB,IAAAA,EAAO,YAAW;AAAA,EACpB;AAAA,EACA,eAAeA,GAAQ0J,GAAUvM,GAAS;AACxC,IAAA6C,EAAO,eAAe0J,GAAUvM,CAAO;AAAA,EACzC;AAAA,EACA,WAAW6C,GAAQE,GAAM;AACvB,IAAAF,EAAO,WAAWE,CAAI;AAAA,EACxB;AAAA,EACA,gBAAgBF,GAAQ;AACtB,IAAAA,EAAO,gBAAe;AAAA,EACxB;AAAA,EACA,WAAWA,GAAQQ,GAAM;AACvB,IAAAR,EAAO,WAAWQ,CAAI;AAAA,EACxB;AAAA,EACA,QAAQR,GAAQjC,GAAO;AACrB,WAAOiC,EAAO,QAAQjC,CAAK;AAAA,EAC7B;AAAA,EACA,OAAOiC,GAAQxD,GAAOgN,GAAI;AACxB,WAAOxJ,EAAO,OAAOxD,GAAOgN,CAAE;AAAA,EAChC;AAAA,EACA,SAASzL,GAAO;AACd,WAAOuL,GAASvL,CAAK;AAAA,EACvB;AAAA,EACA,kBAAkBiC,GAAQ+E,GAAS;AACjC,WAAO/E,EAAO,kBAAkB+E,CAAO;AAAA,EACzC;AAAA,EACA,QAAQ/E,GAAQ+E,GAAS;AACvB,WAAO/E,EAAO,QAAQ+E,CAAO;AAAA,EAC/B;AAAA,EACA,MAAM/E,GAAQxD,GAAOgN,GAAI;AACvB,WAAOxJ,EAAO,MAAMxD,GAAOgN,CAAE;AAAA,EAC/B;AAAA,EACA,SAASxJ,GAAQjC,GAAO;AACtB,WAAOiC,EAAO,SAASjC,CAAK;AAAA,EAC9B;AAAA,EACA,cAAciC,GAAQ;AACpB,WAAOA,EAAO,cAAa;AAAA,EAC7B;AAAA,EACA,aAAaA,GAAQjC,GAAO;AAC1B,WAAOiC,EAAO,aAAajC,CAAK;AAAA,EAClC;AAAA,EACA,QAAQiC,GAAQxD,GAAOgN,GAAI;AACzB,WAAOxJ,EAAO,QAAQxD,GAAOgN,CAAE;AAAA,EACjC;AAAA,EACA,OAAOxJ,GAAQjC,GAAO;AACpB,WAAOiC,EAAO,OAAOjC,CAAK;AAAA,EAC5B;AAAA,EACA,KAAKiC,GAAQwJ,GAAI;AACf,WAAOxJ,EAAO,KAAKwJ,CAAE;AAAA,EACvB;AAAA,EACA,KAAKxJ,GAAQwJ,GAAIrM,GAAS;AACxB,WAAO6C,EAAO,KAAKwJ,GAAIrM,CAAO;AAAA,EAChC;AAAA,EACA,OAAO6C,GAAQ7C,GAAS;AACtB,WAAO6C,EAAO,OAAO7C,CAAO;AAAA,EAC9B;AAAA,EACA,MAAM6C,GAAQ;AACZ,WAAOA,EAAO,SAAQ;AAAA,EACxB;AAAA,EACA,KAAKA,GAAQ7C,GAAS;AACpB,WAAO6C,EAAO,KAAK7C,CAAO;AAAA,EAC5B;AAAA,EACA,KAAK6C,GAAQwJ,GAAIrM,GAAS;AACxB,WAAO6C,EAAO,KAAKwJ,GAAIrM,CAAO;AAAA,EAChC;AAAA,EACA,MAAM6C,GAAQ7C,GAAS;AACrB,WAAO6C,EAAO,MAAM7C,CAAO;AAAA,EAC7B;AAAA,EACA,UAAU6C,GAAQ7C,GAAS;AACzB,IAAA6C,EAAO,UAAU7C,CAAO;AAAA,EAC1B;AAAA,EACA,OAAO6C,GAAQwJ,GAAIrM,GAAS;AAC1B,WAAO6C,EAAO,OAAOwJ,GAAIrM,CAAO;AAAA,EAClC;AAAA,EACA,KAAK6C,GAAQwJ,GAAIrM,GAAS;AACxB,WAAO6C,EAAO,KAAKwJ,GAAIrM,CAAO;AAAA,EAChC;AAAA,EACA,QAAQ6C,GAAQ3D,GAAMc,GAAS;AAC7B,WAAO6C,EAAO,QAAQ3D,GAAMc,CAAO;AAAA,EACrC;AAAA,EACA,SAAS6C,GAAQ;AACf,WAAOA,EAAO,SAAQ;AAAA,EACxB;AAAA,EACA,MAAMA,GAAQwJ,GAAIrM,GAAS;AACzB,WAAO6C,EAAO,MAAMwJ,GAAIrM,CAAO;AAAA,EACjC;AAAA,EACA,SAAS6C,GAAQxD,GAAOW,GAAS;AAC/B,WAAO6C,EAAO,SAASxD,GAAOW,CAAO;AAAA,EACvC;AAAA,EACA,UAAU6C,GAAQ;AAChB,WAAOA,EAAO,UAAS;AAAA,EACzB;AAAA,EACA,UAAUA,GAAQ7C,GAAS;AACzB,WAAO6C,EAAO,UAAU7C,CAAO;AAAA,EACjC;AAAA,EACA,SAAS6C,GAAQ7C,GAAS;AACxB,WAAO6C,EAAO,SAAS7C,CAAO;AAAA,EAChC;AAAA,EACA,MAAM6C,GAAQwJ,GAAIb,GAAI;AACpB,WAAO3I,EAAO,MAAMwJ,GAAIb,CAAE;AAAA,EAC5B;AAAA,EACA,SAAS3I,GAAQ+F,GAAO5I,GAAS;AAC/B,WAAO6C,EAAO,SAAS+F,GAAO5I,CAAO;AAAA,EACvC;AAAA,EACA,UAAU6C,GAAQ;AAChB,WAAOA,EAAO,UAAS;AAAA,EACzB;AAAA,EACA,WAAWA,GAAQR,GAAK;AACtB,IAAAQ,EAAO,WAAWR,CAAG;AAAA,EACvB;AAAA,EACA,eAAeQ,GAAQ2J,GAAe;AACpC,IAAA3J,EAAO,eAAe2J,CAAa;AAAA,EACrC;AAAA,EACA,MAAM3J,GAAQwJ,GAAI;AAChB,WAAOxJ,EAAO,MAAMwJ,CAAE;AAAA,EACxB;AAAA,EACA,OAAOxJ,GAAQwJ,GAAIrM,GAAS;AAC1B,WAAO6C,EAAO,OAAOwJ,GAAIrM,CAAO;AAAA,EAClC;AAAA,EACA,YAAY6C,GAAQ+F,GAAO5I,GAAS;AAClC,WAAO6C,EAAO,YAAY+F,GAAO5I,CAAO;AAAA,EAC1C;AAAA,EACA,KAAK6C,GAAQ7C,GAAS;AACpB,WAAO6C,EAAO,KAAK7C,CAAO;AAAA,EAC5B;AAAA,EACA,mBAAmB6C,GAAQ4J,GAAI;AAC7B,IAAA5J,EAAO,mBAAmB4J,CAAE;AAAA,EAC9B;AACF,GASIC,KAAO;AAAA,EACT,OAAO9L,GAAO;AACZ,WAAO,MAAM,QAAQA,CAAK,KAAKA,EAAM,WAAW,KAAKA,EAAM,MAAMzB,EAAK,MAAM;AAAA,EAC9E;AACF;AAEA,SAASwN,GAAU,GAAGlK,GAAG;AAAE,MAAIC,IAAI,OAAO,KAAK,CAAC;AAAG,MAAI,OAAO,uBAAuB;AAAE,QAAIb,IAAI,OAAO,sBAAsB,CAAC;AAAG,IAAAY,MAAMZ,IAAIA,EAAE,OAAO,SAAUY,GAAG;AAAE,aAAO,OAAO,yBAAyB,GAAGA,CAAC,EAAE;AAAA,IAAY,CAAC,IAAIC,EAAE,KAAK,MAAMA,GAAGb,CAAC;AAAA,EAAG;AAAE,SAAOa;AAAG;AAChQ,SAASkK,GAAgB,GAAG;AAAE,WAASnK,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAE,QAAIC,IAAY,UAAUD,CAAC,KAAnB,OAAuB,UAAUA,CAAC,IAAI,CAAA;AAAI,IAAAA,IAAI,IAAIkK,GAAU,OAAOjK,CAAC,GAAG,EAAE,EAAE,QAAQ,SAAUD,GAAG;AAAE,MAAAH,EAAgB,GAAGG,GAAGC,EAAED,CAAC,CAAC;AAAA,IAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiB,GAAG,OAAO,0BAA0BC,CAAC,CAAC,IAAIiK,GAAU,OAAOjK,CAAC,CAAC,EAAE,QAAQ,SAAUD,GAAG;AAAE,aAAO,eAAe,GAAGA,GAAG,OAAO,yBAAyBC,GAAGD,CAAC,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AAAE,SAAO;AAAG;AAEzb,IAACnD,IAAQ;AAAA,EACV,QAAQD,GAAOc,GAAS;AACtB,QAAIiF,IAASjG,EAAK,QAAQE,EAAM,MAAMc,EAAQ,IAAI;AAClD,WAAIiF,MAAW,IACT/F,EAAM,SAASc,EAAQ,SAAe,KACtCd,EAAM,SAASc,EAAQ,SAAe,IACnC,IAEFiF;AAAA,EACT;AAAA,EACA,QAAQ/F,GAAOc,GAAS;AACtB,WAAOb,EAAM,QAAQD,GAAOc,CAAO,MAAM;AAAA,EAC3C;AAAA,EACA,SAASd,GAAOc,GAAS;AACvB,WAAOb,EAAM,QAAQD,GAAOc,CAAO,MAAM;AAAA,EAC3C;AAAA,EACA,OAAOd,GAAOc,GAAS;AAErB,WAAOd,EAAM,WAAWc,EAAQ,UAAUhB,EAAK,OAAOE,EAAM,MAAMc,EAAQ,IAAI;AAAA,EAChF;AAAA,EACA,QAAQS,GAAO;AACb,WAAOsH,EAActH,CAAK,KAAK,OAAOA,EAAM,UAAW,YAAYzB,EAAK,OAAOyB,EAAM,IAAI;AAAA,EAC3F;AAAA,EACA,UAAUvB,GAAON,GAAI;AACnB,QAAIiB,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,WAAO4J,GAAQvK,GAAO,CAAA8B,MAAK;AACzB,UAAIA,MAAM;AACR,eAAO;AAET,UAAI;AAAA,QACF,UAAAlC,IAAW;AAAA,MACnB,IAAUe,GACA;AAAA,QACF,MAAAd;AAAA,QACA,QAAAkE;AAAA,MACR,IAAUjC;AACJ,cAAQpC,EAAG,MAAI;AAAA,QACb,KAAK;AAAA,QACL,KAAK,aACH;AACE,UAAAoC,EAAE,OAAOhC,EAAK,UAAUD,GAAMH,GAAIiB,CAAO;AACzC;AAAA,QACF;AAAA,QACF,KAAK,eACH;AACE,UAAIb,EAAK,OAAOJ,EAAG,MAAMG,CAAI,MAAMH,EAAG,SAASqE,KAAUrE,EAAG,WAAWqE,KAAUnE,MAAa,eAC5FkC,EAAE,UAAUpC,EAAG,KAAK;AAEtB;AAAA,QACF;AAAA,QACF,KAAK,cACH;AACE,UAAII,EAAK,OAAOJ,EAAG,MAAMG,CAAI,MAC3BiC,EAAE,UAAUpC,EAAG,WAEjBoC,EAAE,OAAOhC,EAAK,UAAUD,GAAMH,GAAIiB,CAAO;AACzC;AAAA,QACF;AAAA,QACF,KAAK,eACH;AACE,UAAIb,EAAK,OAAOJ,EAAG,MAAMG,CAAI,KAAKH,EAAG,UAAUqE,MAC7CjC,EAAE,UAAU,KAAK,IAAIiC,IAASrE,EAAG,QAAQA,EAAG,KAAK,MAAM;AAEzD;AAAA,QACF;AAAA,QACF,KAAK,eACH;AACE,cAAII,EAAK,OAAOJ,EAAG,MAAMG,CAAI,KAAKC,EAAK,WAAWJ,EAAG,MAAMG,CAAI;AAC7D,mBAAO;AAET,UAAAiC,EAAE,OAAOhC,EAAK,UAAUD,GAAMH,GAAIiB,CAAO;AACzC;AAAA,QACF;AAAA,QACF,KAAK,cACH;AACE,cAAIb,EAAK,OAAOJ,EAAG,MAAMG,CAAI,GAAG;AAC9B,gBAAIH,EAAG,aAAaqE,KAAUnE,KAAY;AACxC,qBAAO;AACF,aAAIF,EAAG,WAAWqE,KAAUrE,EAAG,aAAaqE,KAAUnE,MAAa,eACxEkC,EAAE,UAAUpC,EAAG,UACfoC,EAAE,OAAOhC,EAAK,UAAUD,GAAMH,GAAI6N,GAAgBA,GAAgB,CAAA,GAAI5M,CAAO,GAAG,CAAA,GAAI;AAAA,cAClF,UAAU;AAAA,YAC5B,CAAiB,CAAC;AAAA,UAEN;AACE,YAAAmB,EAAE,OAAOhC,EAAK,UAAUD,GAAMH,GAAIiB,CAAO;AAE3C;AAAA,QACF;AAAA,MACV;AAAA,IACI,CAAC;AAAA,EACH;AACF,GAEI6M,KAAY,QAiBZ3I,IAAW;AAAA,EACb,YAAY4I,GAAU;AACpB,IAAAD,KAAYC;AAAA,EACd;AAAA,EACA,UAAUlM,GAAO;AACf,WAAO,KAAK,UAAUA,GAAOiM,EAAS;AAAA,EACxC;AACF,GAEIE,KAAc,CAAC,MAAM,GACvBC,KAAe,CAAC,UAAU,OAAO;AACnC,SAASC,GAAU,GAAGxK,GAAG;AAAE,MAAIC,IAAI,OAAO,KAAK,CAAC;AAAG,MAAI,OAAO,uBAAuB;AAAE,QAAIb,IAAI,OAAO,sBAAsB,CAAC;AAAG,IAAAY,MAAMZ,IAAIA,EAAE,OAAO,SAAUY,GAAG;AAAE,aAAO,OAAO,yBAAyB,GAAGA,CAAC,EAAE;AAAA,IAAY,CAAC,IAAIC,EAAE,KAAK,MAAMA,GAAGb,CAAC;AAAA,EAAG;AAAE,SAAOa;AAAG;AAChQ,SAASwK,GAAgB,GAAG;AAAE,WAASzK,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAE,QAAIC,IAAY,UAAUD,CAAC,KAAnB,OAAuB,UAAUA,CAAC,IAAI,CAAA;AAAI,IAAAA,IAAI,IAAIwK,GAAU,OAAOvK,CAAC,GAAG,EAAE,EAAE,QAAQ,SAAUD,GAAG;AAAE,MAAAH,EAAgB,GAAGG,GAAGC,EAAED,CAAC,CAAC;AAAA,IAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiB,GAAG,OAAO,0BAA0BC,CAAC,CAAC,IAAIuK,GAAU,OAAOvK,CAAC,CAAC,EAAE,QAAQ,SAAUD,GAAG;AAAE,aAAO,eAAe,GAAGA,GAAG,OAAO,yBAAyBC,GAAGD,CAAC,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AAAE,SAAO;AAAG;AAEzb,IAACwB,IAAO;AAAA,EACT,OAAOZ,GAAMlD,GAAS;AACpB,QAAIH,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,MACF,OAAAmN,IAAQ;AAAA,IACd,IAAQnN;AACJ,aAASoN,EAAS7K,GAAK;AACrB,UAAIgH,IAAOhB,GAAyBhG,GAAKwK,EAAW;AACpD,aAAOxD;AAAA,IACT;AACA,WAAOxB,GAAYoF,IAAQC,EAAS/J,CAAI,IAAIA,GAAM8J,IAAQC,EAASjN,CAAO,IAAIA,CAAO;AAAA,EACvF;AAAA,EACA,OAAOS,GAAO;AACZ,WAAOsH,EAActH,CAAK,KAAK,OAAOA,EAAM,QAAS;AAAA,EACvD;AAAA,EACA,WAAWA,GAAO;AAChB,WAAO,MAAM,QAAQA,CAAK,KAAKA,EAAM,MAAM,CAAAuJ,MAAOlG,EAAK,OAAOkG,CAAG,CAAC;AAAA,EACpE;AAAA,EACA,YAAYxC,GAAO;AACjB,WAAOA,EAAM,SAAS;AAAA,EACxB;AAAA,EACA,QAAQtE,GAAMsE,GAAO;AACnB,aAAStF,KAAOsF;AACd,UAAItF,MAAQ,WAGR,CAACgB,EAAK,eAAehB,CAAG,KAAKgB,EAAKhB,CAAG,MAAMsF,EAAMtF,CAAG;AACtD,eAAO;AAGX,WAAO;AAAA,EACT;AAAA,EACA,YAAYU,GAAMsK,GAAa;AAC7B,QAAIC,IAAS,CAACJ,GAAgB,CAAA,GAAInK,CAAI,CAAC;AACvC,aAASwK,KAAOF,GAAa;AAC3B,UAAI9D,IAAOhB,GAAyBgF,GAAKP,EAAY,GACjD,CAAC5D,GAAOL,CAAG,IAAIvJ,EAAM,MAAM+N,CAAG,GAC9BjI,IAAO,CAAA,GACPkI,IAAU,GACVC,IAAkBrE,EAAM,QACxBsE,IAAgB3E,EAAI;AACxB,eAASmC,KAAQoC,GAAQ;AACvB,YAAI;AAAA,UACF,QAAAK;AAAA,QACV,IAAYzC,EAAK,MACL0C,IAAYJ;AAGhB,YAFAA,KAAWG,GAEPF,KAAmBG,KAAaJ,KAAWE,GAAe;AAC5D,iBAAO,OAAOxC,GAAM3B,CAAI,GACxBjE,EAAK,KAAK4F,CAAI;AACd;AAAA,QACF;AAEA,YAAIuC,MAAoBC,MAAkBD,MAAoBD,KAAWE,MAAkBE,MAAcH,IAAkBD,KAAWE,IAAgBE,KAAaF,MAAkBE,KAAaA,MAAc,GAAG;AACjN,UAAAtI,EAAK,KAAK4F,CAAI;AACd;AAAA,QACF;AAIA,YAAI2C,IAAS3C,GACT3H,IAAS,QACTC,IAAQ;AACZ,YAAIkK,IAAgBF,GAAS;AAC3B,cAAIM,IAAMJ,IAAgBE;AAC1B,UAAApK,IAAQ0J,GAAgBA,GAAgB,CAAA,GAAIW,CAAM,GAAG,CAAA,GAAI;AAAA,YACvD,MAAMA,EAAO,KAAK,MAAMC,CAAG;AAAA,UACvC,CAAW,GACDD,IAASX,GAAgBA,GAAgB,CAAA,GAAIW,CAAM,GAAG,CAAA,GAAI;AAAA,YACxD,MAAMA,EAAO,KAAK,MAAM,GAAGC,CAAG;AAAA,UAC1C,CAAW;AAAA,QACH;AACA,YAAIL,IAAkBG,GAAW;AAC/B,cAAIG,IAAON,IAAkBG;AAC7B,UAAArK,IAAS2J,GAAgBA,GAAgB,CAAA,GAAIW,CAAM,GAAG,CAAA,GAAI;AAAA,YACxD,MAAMA,EAAO,KAAK,MAAM,GAAGE,CAAI;AAAA,UAC3C,CAAW,GACDF,IAASX,GAAgBA,GAAgB,CAAA,GAAIW,CAAM,GAAG,CAAA,GAAI;AAAA,YACxD,MAAMA,EAAO,KAAK,MAAME,CAAI;AAAA,UACxC,CAAW;AAAA,QACH;AACA,eAAO,OAAOF,GAAQtE,CAAI,GACtBhG,KACF+B,EAAK,KAAK/B,CAAM,GAElB+B,EAAK,KAAKuI,CAAM,GACZrK,KACF8B,EAAK,KAAK9B,CAAK;AAAA,MAEnB;AACA,MAAA8J,IAAShI;AAAA,IACX;AACA,WAAOgI;AAAA,EACT;AACF,GAQIU,KAA2B,CAAAnL,MACzBA,EAAO,YACFA,EAAO,YACLA,EAAO,SAAS,SAAS,IAC3BoH,EAAO,IAAIpH,GAAQ,EAAE,IAErB,CAAC,CAAC,GAIToL,KAAY,CAACpL,GAAQ3D,MAAS;AAChC,MAAI,CAAC6D,CAAI,IAAIkH,EAAO,KAAKpH,GAAQ3D,CAAI;AACrC,SAAO,OAAK,MAAM6D;AACpB,GAcImL,KAAuB,SAA8BC,GAAK;AAC5D,MAAIC,IAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,IAC5EC,IAAQ,CAACD,GACTE,IAAaF,IAAQG,GAAsBJ,CAAG,IAAIA,GAClDK,IAAOC,EAAc,MACrBC,IAAQD,EAAc,MACtBE,IAAW,GAEXC,IAAO,MACPC,IAAW;AACf,WAASC,KAAQR,GAAY;AAC3B,QAAIS,IAAOD,EAAK,YAAY,CAAC;AAC7B,QAAI,CAACC,EAAM;AACX,QAAIC,IAAOC,GAAiBH,GAAMC,CAAI;AAsBtC,QArBA,CAACP,GAAME,CAAK,IAAIL,IAAQ,CAACK,GAAOM,CAAI,IAAI,CAACA,GAAMR,CAAI,GAC/CU,GAAWV,GAAMC,EAAc,GAAG,KAAKS,GAAWR,GAAOD,EAAc,OAAO,MAC5EJ,IACFO,IAAOO,GAAiBhB,EAAI,UAAU,GAAGQ,CAAQ,CAAC,IAElDC,IAAOO,GAAiBhB,EAAI,UAAU,GAAGA,EAAI,SAASQ,CAAQ,CAAC,GAE7D,CAACC,MAEHM,GAAWV,GAAMC,EAAc,EAAE,KAAKS,GAAWR,GAAOD,EAAc,EAAE,MACtEI,MAAa,OACfA,IAAW,CAACA,IAERR,IACFQ,IAAW,KAEXA,IAAWO,GAAuBjB,EAAI,UAAU,GAAGA,EAAI,SAASQ,CAAQ,CAAC,GAGzE,CAACE,MAEHL,MAASC,EAAc,QAAQC,MAAUD,EAAc,QAAQY,GAAeb,GAAME,CAAK;AAC3F;AAEF,IAAAC,KAAYG,EAAK;AAAA,EACnB;AACA,SAAOH,KAAY;AACrB,GACIW,KAAQ,MACRC,KAAc,4yCACdC,KAAY,mBAIZC,KAAkB,SAAyBpM,GAAM;AAInD,WAHI+K,IAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,IAC5EsB,IAAO,GACPC,IAAU,IACPtM,EAAK,SAAS,KAAG;AACtB,QAAIuM,IAAW1B,GAAqB7K,GAAM+K,CAAK,GAC3C,CAACU,GAAMe,CAAS,IAAIC,GAAyBzM,GAAMuM,GAAUxB,CAAK;AACtE,QAAI2B,GAAgBjB,GAAMe,GAAWzB,CAAK;AACxC,MAAAuB,IAAU,IACVD,KAAQE;AAAA,aACC,CAACD;AACV,MAAAD,KAAQE;AAAA;AAER;AAEF,IAAAvM,IAAOwM;AAAA,EACT;AACA,SAAOH;AACT,GAKII,KAA2B,CAAC3B,GAAKuB,GAAMtB,MAAU;AACnD,MAAIA,GAAO;AACT,QAAI/B,IAAK8B,EAAI,SAASuB;AACtB,WAAO,CAACvB,EAAI,MAAM9B,GAAI8B,EAAI,MAAM,GAAGA,EAAI,MAAM,GAAG9B,CAAE,CAAC;AAAA,EACrD;AACA,SAAO,CAAC8B,EAAI,MAAM,GAAGuB,CAAI,GAAGvB,EAAI,MAAMuB,CAAI,CAAC;AAC7C,GAKIK,KAAkB,SAASA,EAAgBjB,GAAMe,GAAW;AAC9D,MAAIzB,IAAQ,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI;AAChF,MAAIkB,GAAM,KAAKR,CAAI;AACjB,WAAO;AAIT,MAAIU,GAAU,KAAKV,CAAI,GAAG;AACxB,QAAIc,IAAW1B,GAAqB2B,GAAWzB,CAAK,GAChD,CAAC4B,GAAUC,CAAa,IAAIH,GAAyBD,GAAWD,GAAUxB,CAAK;AACnF,QAAI2B,EAAgBC,GAAUC,GAAe7B,CAAK;AAChD,aAAO;AAAA,EAEX;AACA,SAAI,CAAAmB,GAAY,KAAKT,CAAI;AAI3B,GAIIP,KAAwB,WAAgCJ,GAAK;AAE/D,WADIpF,IAAMoF,EAAI,SAAS,GACd9N,IAAI,GAAGA,IAAI8N,EAAI,QAAQ9N,KAAK;AACnC,QAAI6P,IAAQ/B,EAAI,OAAOpF,IAAM1I,CAAC;AAC9B,QAAI8P,GAAeD,EAAM,WAAW,CAAC,CAAC,GAAG;AACvC,UAAIE,IAAQjC,EAAI,OAAOpF,IAAM1I,IAAI,CAAC;AAClC,UAAIgQ,GAAgBD,EAAM,WAAW,CAAC,CAAC,GAAG;AACxC,cAAMA,IAAQF,GACd7P;AACA;AAAA,MACF;AAAA,IACF;AACA,UAAM6P;AAAA,EACR;AACF,GAMIG,KAAkB,CAAAC,MACbA,KAAY,SAAUA,KAAY,OAOvCH,KAAiB,CAAAG,MACZA,KAAY,SAAUA,KAAY,OAEvC7B;AAAA,CACH,SAAUA,GAAe;AACxB,EAAAA,EAAcA,EAAc,OAAU,CAAC,IAAI,QAC3CA,EAAcA,EAAc,SAAY,CAAC,IAAI,UAC7CA,EAAcA,EAAc,MAAS,CAAC,IAAI,OAC1CA,EAAcA,EAAc,KAAQ,CAAC,IAAI,MACzCA,EAAcA,EAAc,UAAa,CAAC,IAAI,WAC9CA,EAAcA,EAAc,cAAiB,EAAE,IAAI,eACnDA,EAAcA,EAAc,IAAO,EAAE,IAAI,KACzCA,EAAcA,EAAc,IAAO,EAAE,IAAI,KACzCA,EAAcA,EAAc,IAAO,GAAG,IAAI,KAC1CA,EAAcA,EAAc,KAAQ,GAAG,IAAI,MAC3CA,EAAcA,EAAc,MAAS,GAAG,IAAI,OAC5CA,EAAcA,EAAc,UAAa,IAAI,IAAI,WACjDA,EAAcA,EAAc,MAAS,IAAI,IAAI;AAC/C,GAAGA,MAAkBA,IAAgB,CAAA,EAAG;AACxC,IAAI8B,KAAW,w0HACXC,KAAY,mJACZC,KAAgB,gmDAChBC,KAAM,kCACNC,KAAM,kCACNC,KAAM,kCACNC,KAAO,k2EACPC,KAAQ,2kKACRC,KAAY,syBACZ9B,KAAmB,CAACH,GAAMC,MAAS;AACrC,MAAIC,IAAOP,EAAc;AACzB,SAAIK,EAAK,OAAOyB,EAAQ,MAAM,OAC5BvB,KAAQP,EAAc,SAEpBM,MAAS,SACXC,KAAQP,EAAc,MAEpBM,KAAQ,UAAWA,KAAQ,WAC7BC,KAAQP,EAAc,KAEpBK,EAAK,OAAO0B,EAAS,MAAM,OAC7BxB,KAAQP,EAAc,UAEpBK,EAAK,OAAO2B,EAAa,MAAM,OACjCzB,KAAQP,EAAc,cAEpBK,EAAK,OAAO4B,EAAG,MAAM,OACvB1B,KAAQP,EAAc,IAEpBK,EAAK,OAAO6B,EAAG,MAAM,OACvB3B,KAAQP,EAAc,IAEpBK,EAAK,OAAO8B,EAAG,MAAM,OACvB5B,KAAQP,EAAc,IAEpBK,EAAK,OAAO+B,EAAI,MAAM,OACxB7B,KAAQP,EAAc,KAEpBK,EAAK,OAAOgC,EAAK,MAAM,OACzB9B,KAAQP,EAAc,MAEpBK,EAAK,OAAOiC,EAAS,MAAM,OAC7B/B,KAAQP,EAAc,UAEjBO;AACT;AACA,SAASE,GAAW8B,GAAGC,GAAG;AACxB,UAAQD,IAAIC,OAAO;AACrB;AACA,IAAIC,KAAmB;AAAA;AAAA,EAEvB,CAACzC,EAAc,GAAGA,EAAc,IAAIA,EAAc,IAAIA,EAAc,KAAKA,EAAc,GAAG;AAAA;AAAA,EAE1F,CAACA,EAAc,KAAKA,EAAc,GAAGA,EAAc,IAAIA,EAAc,CAAC;AAAA;AAAA,EAEtE,CAACA,EAAc,MAAMA,EAAc,GAAGA,EAAc,CAAC;AAAA;AAAA,EAErD,CAACA,EAAc,KAAKA,EAAc,SAASA,EAAc,GAAG;AAAA;AAAA,EAE5D,CAACA,EAAc,KAAKA,EAAc,WAAW;AAAA;AAAA,EAE7C,CAACA,EAAc,SAASA,EAAc,GAAG;AAAA;AAAA,EAEzC,CAACA,EAAc,KAAKA,EAAc,OAAO;AAAA;AAAA,EAEzC,CAACA,EAAc,IAAIA,EAAc,EAAE;AAAC;AACpC,SAASY,GAAeb,GAAME,GAAO;AACnC,SAAOwC,GAAiB,UAAU,OAAKhC,GAAWV,GAAM,EAAE,CAAC,CAAC,KAAKU,GAAWR,GAAO,EAAE,CAAC,CAAC,CAAC,MAAM;AAChG;AACA,IAAIyC,KAAiB,8mJACjBhC,KAAmB,CAAAhB,MACdA,EAAI,OAAOgD,EAAc,MAAM,IAEpCC,KAAY,gCACZhC,KAAyB,CAAAjB,MAAO;AAClC,MAAIkD,IAAQlD,EAAI,MAAMiD,EAAS;AAC/B,MAAIC,MAAU;AACZ,WAAO;AAGP,MAAIC,IAASD,EAAM,CAAC,EAAE,SAAS;AAC/B,SAAOC,IAAS,MAAM;AAE1B,GAGIC,KAAiB;AAAA,EACnB,OAAO1O,GAAQ7C,GAAS;AACtB,IAAA6C,EAAO,OAAO7C,CAAO;AAAA,EACvB;AAAA,EACA,eAAe6C,GAAQ0J,GAAUvM,GAAS;AACxC,IAAA6C,EAAO,eAAe0J,GAAUvM,CAAO;AAAA,EACzC;AAAA,EACA,WAAW6C,GAAQQ,GAAM;AACvB,QAAIrD,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,IAAAiK,EAAO,mBAAmBpH,GAAQ,MAAM;AACtC,UAAI;AAAA,QACF,OAAA2O,IAAQ;AAAA,MAChB,IAAUxR,GACA;AAAA,QACF,IAAAqM,IAAK2B,GAAyBnL,CAAM;AAAA,MAC5C,IAAU7C;AAIJ,UAHIb,EAAK,OAAOkN,CAAE,MAChBA,IAAKpC,EAAO,MAAMpH,GAAQwJ,CAAE,IAE1B7M,EAAM,QAAQ6M,CAAE;AAClB,YAAI7M,EAAM,YAAY6M,CAAE;AACtB,UAAAA,IAAKA,EAAG;AAAA,aACH;AACL,cAAItD,IAAMvJ,EAAM,IAAI6M,CAAE;AACtB,cAAI,CAACmF,KAASvH,EAAO,KAAKpH,GAAQ;AAAA,YAChC,IAAIkG;AAAA,UAChB,CAAW;AACC;AAEF,cAAIK,IAAQ5J,EAAM,MAAM6M,CAAE,GACtBoF,IAAWxH,EAAO,SAASpH,GAAQuG,CAAK,GACxCsI,IAASzH,EAAO,SAASpH,GAAQkG,CAAG;AACxC,UAAA4I,EAAW,OAAO9O,GAAQ;AAAA,YACxB,IAAAwJ;AAAA,YACA,OAAAmF;AAAA,UACZ,CAAW;AACD,cAAII,IAAaH,EAAS,MAAK,GAC3BI,IAAWH,EAAO,MAAK;AAC3B,UAAArF,IAAKuF,KAAcC,GACnBF,EAAW,aAAa9O,GAAQ;AAAA,YAC9B,QAAQwJ;AAAA,YACR,OAAOA;AAAA,UACnB,CAAW;AAAA,QACH;AAEF,UAAI,GAACmF,KAASvH,EAAO,KAAKpH,GAAQ;AAAA,QAChC,IAAAwJ;AAAA,MACR,CAAO,KAAKpC,EAAO,gBAAgBpH,GAAQ;AAAA,QACnC,IAAAwJ;AAAA,MACR,CAAO,IAGD;AAAA,YAAI;AAAA,UACF,MAAAnN;AAAA,UACA,QAAAkE;AAAA,QACR,IAAUiJ;AACJ,QAAIhJ,EAAK,SAAS,KAAGR,EAAO,MAAM;AAAA,UAChC,MAAM;AAAA,UACN,MAAA3D;AAAA,UACA,QAAAkE;AAAA,UACA,MAAAC;AAAA,QACR,CAAO;AAAA;AAAA,IACH,CAAC;AAAA,EACH;AACF;AAEA,SAASyO,GAAU,GAAGrP,GAAG;AAAE,MAAIC,IAAI,OAAO,KAAK,CAAC;AAAG,MAAI,OAAO,uBAAuB;AAAE,QAAIb,IAAI,OAAO,sBAAsB,CAAC;AAAG,IAAAY,MAAMZ,IAAIA,EAAE,OAAO,SAAUY,GAAG;AAAE,aAAO,OAAO,yBAAyB,GAAGA,CAAC,EAAE;AAAA,IAAY,CAAC,IAAIC,EAAE,KAAK,MAAMA,GAAGb,CAAC;AAAA,EAAG;AAAE,SAAOa;AAAG;AAChQ,SAASqP,GAAgB,GAAG;AAAE,WAAStP,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAE,QAAIC,IAAY,UAAUD,CAAC,KAAnB,OAAuB,UAAUA,CAAC,IAAI,CAAA;AAAI,IAAAA,IAAI,IAAIqP,GAAU,OAAOpP,CAAC,GAAG,EAAE,EAAE,QAAQ,SAAUD,GAAG;AAAE,MAAAH,EAAgB,GAAGG,GAAGC,EAAED,CAAC,CAAC;AAAA,IAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiB,GAAG,OAAO,0BAA0BC,CAAC,CAAC,IAAIoP,GAAU,OAAOpP,CAAC,CAAC,EAAE,QAAQ,SAAUD,GAAG;AAAE,aAAO,eAAe,GAAGA,GAAG,OAAO,yBAAyBC,GAAGD,CAAC,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AAAE,SAAO;AAAG;AACzb,IAACkP,IAAaI,GAAgBA,GAAgBA,GAAgBA,GAAgB,IAAI1K,EAAiB,GAAGI,EAAc,GAAGI,EAAmB,GAAG0J,EAAc,GAG1JS,KAAuB,oBAAI,QAAO,GAClCC,KAAuB,CAAApP,MAClBmP,GAAqB,IAAInP,CAAM,KAAK,IAEzCqP,KAAkB,CAACrP,GAAQ4J,GAAI0F,MAAW;AAC5C,MAAIvR,IAAQoR,GAAqB,IAAInP,CAAM,KAAK;AAChD,EAAAmP,GAAqB,IAAInP,GAAQ,EAAI;AACrC,MAAI;AACF,IAAA4J,EAAE,GACF0F,EAAM;AAAA,EACR,UAAC;AACC,IAAAH,GAAqB,IAAInP,GAAQjC,CAAK;AAAA,EACxC;AACF;AAQA,SAASwR,GAAiBvP,GAAQwP,GAAeC,GAAW;AAC1D,MAAIC,IAAgB9S,GAAY,IAAIoD,CAAM,KAAK,CAAA,GAC3C2P,IAAmB9S,GAAgB,IAAImD,CAAM,KAAK,oBAAI,IAAG,GACzD4P,GACAC,GACAC,IAAM,CAAAzT,MAAQ;AAChB,QAAIA,GAAM;AACR,UAAImD,IAAMnD,EAAK,KAAK,GAAG;AACvB,MAAKwT,EAAc,IAAIrQ,CAAG,MACxBqQ,EAAc,IAAIrQ,CAAG,GACrBoQ,EAAW,KAAKvT,CAAI;AAAA,IAExB;AAAA,EACF;AACA,MAAIoT,GAAW;AACb,IAAAG,IAAa,CAAA,GACbC,IAAgB,oBAAI,IAAG;AACvB,aAASxT,KAAQqT,GAAe;AAC9B,UAAIjO,IAAUgO,EAAUpT,CAAI;AAC5B,MAAAyT,EAAIrO,CAAO;AAAA,IACb;AAAA,EACF;AACE,IAAAmO,IAAaF,GACbG,IAAgBF;AAElB,WAASrP,KAASkP;AAChB,IAAAM,EAAIxP,CAAK;AAEX,EAAA1D,GAAY,IAAIoD,GAAQ4P,CAAU,GAClC/S,GAAgB,IAAImD,GAAQ6P,CAAa;AAC3C;AAEG,IAACE,KAAQ,CAAC/P,GAAQ9D,MAAO;AAC1B,WAASD,KAAOmL,EAAO,SAASpH,CAAM;AACpC,IAAAhE,GAAQ,UAAUC,GAAKC,CAAE;AAE3B,WAASkM,KAAQhB,EAAO,UAAUpH,CAAM;AACtC,IAAAzD,GAAS,UAAU6L,GAAMlM,CAAE;AAE7B,WAAS8T,KAAS5I,EAAO,UAAUpH,CAAM;AACvC,IAAAtD,GAAS,UAAUsT,GAAO9T,CAAE;AAG9B,MAAI,CAACkT,GAAqBpP,CAAM,GAAG;AACjC,QAAIyP,IAAYnT,EAAK,0BAA0BJ,CAAE,IAAI,CAAAoC,MAAKhC,EAAK,UAAUgC,GAAGpC,CAAE,IAAI;AAClF,IAAAqT,GAAiBvP,GAAQA,EAAO,cAAc9D,CAAE,GAAGuT,CAAS;AAAA,EAC9D;AACA,EAAAX,EAAW,UAAU9O,GAAQ9D,CAAE,GAC/B8D,EAAO,WAAW,KAAK9D,CAAE,GACzBkL,EAAO,UAAUpH,GAAQ;AAAA,IACvB,WAAW9D;AAAA,EACf,CAAG,GAEGA,EAAG,SAAS,oBACd8D,EAAO,QAAQ,OAEZlD,GAAS,IAAIkD,CAAM,MACtBlD,GAAS,IAAIkD,GAAQ,EAAI,GACzB,QAAQ,UAAU,KAAK,MAAM;AAC3B,IAAAlD,GAAS,IAAIkD,GAAQ,EAAK,GAC1BA,EAAO,SAAS;AAAA,MACd,WAAW9D;AAAA,IACnB,CAAO,GACD8D,EAAO,aAAa,CAAA;AAAA,EACtB,CAAC;AAEL,GAKIiQ,KAAgB,CAACjQ,GAAQ9D,MAAO;AAClC,UAAQA,EAAG,MAAI;AAAA,IACb,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK,YACH;AACE,UAAI;AAAA,QACF,MAAAG;AAAA,MACV,IAAYH;AACJ,aAAOI,EAAK,OAAOD,CAAI;AAAA,IACzB;AAAA,IACF,KAAK,eACH;AACE,UAAI;AAAA,QACF,MAAA6D;AAAA,QACA,MAAMI;AAAA,MAChB,IAAYpE,GACAgU,IAAS5T,EAAK,OAAOgE,CAAK,GAC1B6P,IAAc/O,EAAK,OAAOlB,CAAI,IAAI,CAAA,IAAK,MAAM,KAAKE,EAAK,MAAMF,CAAI,GAAG,CAAAkI,MAAQ;AAC9E,YAAI,CAAA,EAAG9J,CAAC,IAAI8J;AACZ,eAAO9H,EAAM,OAAOhC,CAAC;AAAA,MACvB,CAAC;AACD,aAAO,CAAC,GAAG4R,GAAQ,GAAGC,CAAW;AAAA,IACnC;AAAA,IACF,KAAK,cACH;AACE,UAAI;AAAA,QACF,MAAMrP;AAAA,MAChB,IAAY5E,GACAkU,IAAY9T,EAAK,UAAUwE,CAAM,GACjCuP,IAAe/T,EAAK,SAASwE,CAAM;AACvC,aAAO,CAAC,GAAGsP,GAAWC,CAAY;AAAA,IACpC;AAAA,IACF,KAAK,aACH;AACE,UAAI;AAAA,QACF,MAAM7O;AAAA,QACN,SAAAC;AAAA,MACV,IAAYvF;AACJ,UAAII,EAAK,OAAOkF,GAAQC,CAAO;AAC7B,eAAO,CAAA;AAET,UAAI6O,IAAe,CAAA,GACfC,IAAe,CAAA;AACnB,eAASlS,KAAY/B,EAAK,UAAUkF,CAAM,GAAG;AAC3C,YAAIlD,IAAIhC,EAAK,UAAU+B,GAAUnC,CAAE;AACnC,QAAAoU,EAAa,KAAKhS,CAAC;AAAA,MACrB;AACA,eAASkS,KAAalU,EAAK,UAAUmF,CAAO,GAAG;AAC7C,YAAIgP,IAAKnU,EAAK,UAAUkU,GAAWtU,CAAE;AACrC,QAAAqU,EAAa,KAAKE,CAAE;AAAA,MACtB;AACA,UAAI3O,IAAYyO,EAAaA,EAAa,SAAS,CAAC,GAChDxO,IAAWN,EAAQA,EAAQ,SAAS,CAAC,GACrCiP,IAAa5O,EAAU,OAAOC,CAAQ;AAC1C,aAAO,CAAC,GAAGuO,GAAc,GAAGC,GAAcG,CAAU;AAAA,IACtD;AAAA,IACF,KAAK,eACH;AACE,UAAI;AAAA,QACF,MAAMxO;AAAA,MAChB,IAAYhG,GACAyU,IAAarU,EAAK,UAAU4F,CAAM;AACtC,aAAO,CAAC,GAAGyO,CAAU;AAAA,IACvB;AAAA,IACF,KAAK,cACH;AACE,UAAI;AAAA,QACF,MAAMhO;AAAA,MAChB,IAAYzG,GACA0U,IAAUtU,EAAK,OAAOqG,CAAM,GAC5BkO,IAAWvU,EAAK,KAAKqG,CAAM;AAC/B,aAAO,CAAC,GAAGiO,GAASC,CAAQ;AAAA,IAC9B;AAAA,IACF;AAEI,aAAO,CAAA;AAAA,EAEf;AACA,GAEIC,KAAc,CAAA9Q,MAAU;AAC1B,MAAI;AAAA,IACF,WAAAC;AAAA,EACJ,IAAMD;AACJ,SAAIC,IACKG,EAAK,SAASJ,GAAQC,CAAS,IAEjC,CAAA;AACT,GAEI8Q,KAAgB,CAAC/Q,GAAQ6H,MAAU;AACrC,MAAI,CAAC3H,GAAM7D,CAAI,IAAIwL;AAEnB,MAAI,CAAAzG,EAAK,OAAOlB,CAAI,GAIpB;AAAA,QAAImH,EAAQ,UAAUnH,CAAI,KAAKA,EAAK,SAAS,WAAW,GAAG;AACzD,UAAI8H,IAAQ;AAAA,QACV,MAAM;AAAA,MACZ;AACI,MAAA8G,EAAW,YAAY9O,GAAQgI,GAAO;AAAA,QACpC,IAAI3L,EAAK,OAAO,CAAC;AAAA,QACjB,OAAO;AAAA,MACb,CAAK;AACD;AAAA,IACF;AAMA,aAJI2U,IAAoB5J,EAAO,SAASlH,CAAI,IAAI,KAAQmH,EAAQ,UAAUnH,CAAI,MAAMF,EAAO,SAASE,CAAI,KAAKA,EAAK,SAAS,WAAW,KAAKkB,EAAK,OAAOlB,EAAK,SAAS,CAAC,CAAC,KAAKF,EAAO,SAASE,EAAK,SAAS,CAAC,CAAC,IAGxMpC,IAAI,GACCN,IAAI,GAAGA,IAAI0C,EAAK,SAAS,QAAQ1C,KAAKM,KAAK;AAClD,UAAImT,IAAc7Q,EAAK,IAAIJ,GAAQ3D,CAAI;AACvC,UAAI,CAAA+E,EAAK,OAAO6P,CAAW,GAC3B;AAAA,YAAIC,IAASD,EAAY,SAASnT,CAAC,GAC/BmD,IAAOgQ,EAAY,SAASnT,IAAI,CAAC,GACjCqT,IAAS3T,MAAM0C,EAAK,SAAS,SAAS,GACtCkR,IAAiBhQ,EAAK,OAAO8P,CAAM,KAAK7J,EAAQ,UAAU6J,CAAM,KAAKlR,EAAO,SAASkR,CAAM;AAK/F,YAAIE,MAAmBJ;AACrB,UAAAlC,EAAW,YAAY9O,GAAQ;AAAA,YAC7B,IAAI3D,EAAK,OAAOyB,CAAC;AAAA,YACjB,OAAO;AAAA,UACf,CAAO,GACDA;AAAA,iBACSuJ,EAAQ,UAAU6J,CAAM;AAEjC,cAAIlR,EAAO,SAASkR,CAAM;AACxB,gBAAIjQ,KAAQ,QAAQ,CAACG,EAAK,OAAOH,CAAI,GAAG;AACtC,kBAAIoQ,IAAW;AAAA,gBACb,MAAM;AAAA,cAClB;AACU,cAAAvC,EAAW,YAAY9O,GAAQqR,GAAU;AAAA,gBACvC,IAAIhV,EAAK,OAAOyB,CAAC;AAAA,gBACjB,OAAO;AAAA,cACnB,CAAW,GACDA;AAAA,YACF,WAAWqT,GAAQ;AACjB,kBAAIG,IAAY;AAAA,gBACd,MAAM;AAAA,cAClB;AACU,cAAAxC,EAAW,YAAY9O,GAAQsR,GAAW;AAAA,gBACxC,IAAIjV,EAAK,OAAOyB,IAAI,CAAC;AAAA,gBACrB,OAAO;AAAA,cACnB,CAAW,GACDA;AAAA,YACF;AAAA;AAAA;AAIF,UAAImD,KAAQ,QAAQG,EAAK,OAAOH,CAAI,MAC9BG,EAAK,OAAO8P,GAAQjQ,GAAM;AAAA,YAC5B,OAAO;AAAA,UACjB,CAAS,KACC6N,EAAW,WAAW9O,GAAQ;AAAA,YAC5B,IAAI3D,EAAK,OAAOyB,CAAC;AAAA,YACjB,OAAO;AAAA,UACnB,CAAW,GACDA,OACSmD,EAAK,SAAS,MACvB6N,EAAW,YAAY9O,GAAQ;AAAA,YAC7B,IAAI3D,EAAK,OAAOyB,IAAI,CAAC;AAAA,YACrB,OAAO;AAAA,UACnB,CAAW,GACDA,OACSoT,EAAO,SAAS,OACzBpC,EAAW,YAAY9O,GAAQ;AAAA,YAC7B,IAAI3D,EAAK,OAAOyB,CAAC;AAAA,YACjB,OAAO;AAAA,UACnB,CAAW,GACDA;AAAA;AAAA,IAIR;AAAA;AACF,GAEIyT,KAAkB,CAACvR,GAAQoI,MAAS;AACtC,MAAI;AAAA,IACF,WAAAoJ;AAAA,IACA,yBAAAC;AAAA,EACJ,IAAMrJ,GACAsJ,IAAgBD,IAA0B;AAC9C,MAAID,IAAYE;AACd,UAAM,IAAI,MAAM,mDAAmD,OAAOA,GAAe,2GAA2G,CAAC;AAEvM,SAAO;AACT,GAEIC,KAAQ,SAAe3R,GAAQ;AACjC,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,IACF,OAAAwR,IAAQ;AAAA,IACR,MAAAiD,IAAO;AAAA,IACP,IAAApI,IAAKxJ,EAAO;AAAA,IACZ,OAAAwO;AAAA,EACJ,IAAMrR;AACJ,MAAKqM,GAGL;AAAA,QAAInN,IAAO+K,EAAO,KAAKpH,GAAQwJ,CAAE,GAC7BpM,IAAUwU,MAAS;AACvB,aAAS,CAAC9T,GAAGQ,CAAC,KAAK8I,EAAO,OAAOpH,GAAQ;AAAA,MACvC,IAAI3D;AAAA,MACJ,OAAAsS;AAAA,MACA,OAAAH;AAAA,MACA,SAAApR;AAAA,IACJ,CAAG;AACC,UAAI,CAAAgE,EAAK,OAAOtD,CAAC;AACjB,YAAInB,EAAM,QAAQ6M,CAAE;AAClB,cAAIlN,EAAK,WAAWgC,GAAGkL,EAAG,OAAO,IAAI,KAAKlN,EAAK,WAAWgC,GAAGkL,EAAG,MAAM,IAAI;AACxE,mBAAO,CAAC1L,GAAGQ,CAAC;AAAA,mBAGV,CAAChC,EAAK,OAAOD,GAAMiC,CAAC;AACtB,iBAAO,CAACR,GAAGQ,CAAC;AAAA;AAAA;AAIpB;AAEA,SAASuT,GAAU,GAAGjS,GAAG;AAAE,MAAIC,IAAI,OAAO,KAAK,CAAC;AAAG,MAAI,OAAO,uBAAuB;AAAE,QAAIb,IAAI,OAAO,sBAAsB,CAAC;AAAG,IAAAY,MAAMZ,IAAIA,EAAE,OAAO,SAAUY,GAAG;AAAE,aAAO,OAAO,yBAAyB,GAAGA,CAAC,EAAE;AAAA,IAAY,CAAC,IAAIC,EAAE,KAAK,MAAMA,GAAGb,CAAC;AAAA,EAAG;AAAE,SAAOa;AAAG;AAChQ,SAASiS,GAAgB,GAAG;AAAE,WAASlS,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAE,QAAIC,IAAY,UAAUD,CAAC,KAAnB,OAAuB,UAAUA,CAAC,IAAI,CAAA;AAAI,IAAAA,IAAI,IAAIiS,GAAU,OAAOhS,CAAC,GAAG,EAAE,EAAE,QAAQ,SAAUD,GAAG;AAAE,MAAAH,EAAgB,GAAGG,GAAGC,EAAED,CAAC,CAAC;AAAA,IAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiB,GAAG,OAAO,0BAA0BC,CAAC,CAAC,IAAIgS,GAAU,OAAOhS,CAAC,CAAC,EAAE,QAAQ,SAAUD,GAAG;AAAE,aAAO,eAAe,GAAGA,GAAG,OAAO,yBAAyBC,GAAGD,CAAC,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AAAE,SAAO;AAAG;AACzb,IAACmS,KAAU,CAAC/R,GAAQR,GAAKzB,MAAU;AACpC,MAAI;AAAA,IACF,WAAAkC;AAAA,EACJ,IAAMD;AACJ,MAAIC,GAAW;AACb,QAAIuO,IAAQ,CAACtO,GAAM7D,MAAS;AAC1B,UAAI,CAAC+E,EAAK,OAAOlB,CAAI;AACnB,eAAO;AAGT,UAAI,CAAC8R,GAAYjJ,CAAU,IAAI3B,EAAO,OAAOpH,GAAQ3D,CAAI;AACzD,aAAO,CAAC2D,EAAO,OAAOgS,CAAU,KAAKhS,EAAO,aAAagS,CAAU;AAAA,IACrE,GACIC,IAAoBtV,EAAM,WAAWsD,CAAS,GAC9CiS,IAA4B;AAChC,QAAI,CAACD,GAAmB;AACtB,UAAI,CAACE,GAAcC,CAAY,IAAIhL,EAAO,KAAKpH,GAAQC,CAAS;AAChE,UAAIkS,KAAgB3D,EAAM2D,GAAcC,CAAY,GAAG;AACrD,YAAI,CAACJ,CAAU,IAAI5K,EAAO,OAAOpH,GAAQoS,CAAY;AACrD,QAAAF,IAA4BF,KAAchS,EAAO,aAAagS,CAAU;AAAA,MAC1E;AAAA,IACF;AACA,QAAIC,KAAqBC;AACvB,MAAApD,EAAW,SAAS9O,GAAQ;AAAA,QAC1B,CAACR,CAAG,GAAGzB;AAAA,MACf,GAAS;AAAA,QACD,OAAAyQ;AAAA,QACA,OAAO;AAAA,QACP,OAAO;AAAA,MACf,CAAO;AAAA,SACI;AACL,UAAI6D,IAAQP,GAAgBA,GAAgB,IAAI1K,EAAO,MAAMpH,CAAM,KAAK,EAAE,GAAG,IAAI;AAAA,QAC/E,CAACR,CAAG,GAAGzB;AAAA,MACf,CAAO;AACD,MAAAiC,EAAO,QAAQqS,GACVvV,GAAS,IAAIkD,CAAM,KACtBA,EAAO,SAAQ;AAAA,IAEnB;AAAA,EACF;AACF;AAEA,SAASsS,GAAU,GAAG1S,GAAG;AAAE,MAAIC,IAAI,OAAO,KAAK,CAAC;AAAG,MAAI,OAAO,uBAAuB;AAAE,QAAIb,IAAI,OAAO,sBAAsB,CAAC;AAAG,IAAAY,MAAMZ,IAAIA,EAAE,OAAO,SAAUY,GAAG;AAAE,aAAO,OAAO,yBAAyB,GAAGA,CAAC,EAAE;AAAA,IAAY,CAAC,IAAIC,EAAE,KAAK,MAAMA,GAAGb,CAAC;AAAA,EAAG;AAAE,SAAOa;AAAG;AAChQ,SAAS0S,GAAgB,GAAG;AAAE,WAAS3S,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAE,QAAIC,IAAY,UAAUD,CAAC,KAAnB,OAAuB,UAAUA,CAAC,IAAI,CAAA;AAAI,IAAAA,IAAI,IAAI0S,GAAU,OAAOzS,CAAC,GAAG,EAAE,EAAE,QAAQ,SAAUD,GAAG;AAAE,MAAAH,EAAgB,GAAGG,GAAGC,EAAED,CAAC,CAAC;AAAA,IAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiB,GAAG,OAAO,0BAA0BC,CAAC,CAAC,IAAIyS,GAAU,OAAOzS,CAAC,CAAC,EAAE,QAAQ,SAAUD,GAAG;AAAE,aAAO,eAAe,GAAGA,GAAG,OAAO,yBAAyBC,GAAGD,CAAC,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AAAE,SAAO;AAAG;AACzb,IAACe,KAAQ,SAAeX,GAAQwJ,GAAI;AACrC,MAAIrM,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E6I,IAASoB,EAAO,MAAMpH,GAAQwJ,GAAI;AAAA,IACpC,MAAM;AAAA,EACV,CAAG,GACGvD,IAAQmB,EAAO,IAAIpH,GAAQ,CAAA,CAAE,GAC7B+F,IAAQ;AAAA,IACV,QAAAC;AAAA,IACA,OAAAC;AAAA,EACJ,GACM;AAAA,IACF,UAAA6F,IAAW;AAAA,EACf,IAAM3O,GACAqV,IAAI,GACJvN;AACJ,WAAS3G,KAAK8I,EAAO,UAAUpH,GAAQuS,GAAgBA,GAAgB,CAAA,GAAIpV,CAAO,GAAG,IAAI;AAAA,IACvF,IAAI4I;AAAA,EACR,CAAG,CAAC,GAAG;AACH,QAAIyM,IAAI1G;AACN;AAEF,IAAI0G,MAAM,MACRvN,IAAS3G,IAEXkU;AAAA,EACF;AACA,SAAOvN;AACT;AAEA,SAASwN,GAAU,GAAG7S,GAAG;AAAE,MAAIC,IAAI,OAAO,KAAK,CAAC;AAAG,MAAI,OAAO,uBAAuB;AAAE,QAAIb,IAAI,OAAO,sBAAsB,CAAC;AAAG,IAAAY,MAAMZ,IAAIA,EAAE,OAAO,SAAUY,GAAG;AAAE,aAAO,OAAO,yBAAyB,GAAGA,CAAC,EAAE;AAAA,IAAY,CAAC,IAAIC,EAAE,KAAK,MAAMA,GAAGb,CAAC;AAAA,EAAG;AAAE,SAAOa;AAAG;AAChQ,SAAS6S,GAAgB,GAAG;AAAE,WAAS9S,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAE,QAAIC,IAAY,UAAUD,CAAC,KAAnB,OAAuB,UAAUA,CAAC,IAAI,CAAA;AAAI,IAAAA,IAAI,IAAI6S,GAAU,OAAO5S,CAAC,GAAG,EAAE,EAAE,QAAQ,SAAUD,GAAG;AAAE,MAAAH,EAAgB,GAAGG,GAAGC,EAAED,CAAC,CAAC;AAAA,IAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiB,GAAG,OAAO,0BAA0BC,CAAC,CAAC,IAAI4S,GAAU,OAAO5S,CAAC,CAAC,EAAE,QAAQ,SAAUD,GAAG;AAAE,aAAO,eAAe,GAAGA,GAAG,OAAO,yBAAyBC,GAAGD,CAAC,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AAAE,SAAO;AAAG;AACzb,IAACc,KAAS,SAAgBV,GAAQwJ,GAAI;AACvC,MAAIrM,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E6I,IAASoB,EAAO,MAAMpH,GAAQ,CAAA,CAAE,GAChCiG,IAAQmB,EAAO,MAAMpH,GAAQwJ,GAAI;AAAA,IACnC,MAAM;AAAA,EACV,CAAG,GACGzD,IAAQ;AAAA,IACV,QAAAC;AAAA,IACA,OAAAC;AAAA,EACJ,GACM;AAAA,IACF,UAAA6F,IAAW;AAAA,EACf,IAAM3O,GACAqV,IAAI,GACJvN;AACJ,WAAS3G,KAAK8I,EAAO,UAAUpH,GAAQ0S,GAAgBA,GAAgB,CAAA,GAAIvV,CAAO,GAAG,IAAI;AAAA,IACvF,IAAI4I;AAAA,IACJ,SAAS;AAAA,EACb,CAAG,CAAC,GAAG;AACH,QAAIyM,IAAI1G;AACN;AAEF,IAAI0G,MAAM,MACRvN,IAAS3G,IAEXkU;AAAA,EACF;AACA,SAAOvN;AACT,GAEI0N,KAAiB,CAAC3S,GAAQyJ,MAAS;AACrC,MAAI;AAAA,IACF,WAAAxJ;AAAA,EACJ,IAAMD;AACJ,EAAIC,KAAatD,EAAM,YAAYsD,CAAS,KAC1C6O,EAAW,OAAO9O,GAAQ;AAAA,IACxB,MAAAyJ;AAAA,IACA,SAAS;AAAA,EACf,CAAK;AAEL,GAEImJ,KAAgB,CAAC5S,GAAQyJ,MAAS;AACpC,MAAI;AAAA,IACF,WAAAxJ;AAAA,EACJ,IAAMD;AACJ,EAAIC,KAAatD,EAAM,YAAYsD,CAAS,KAC1C6O,EAAW,OAAO9O,GAAQ;AAAA,IACxB,MAAAyJ;AAAA,EACN,CAAK;AAEL,GAEIoJ,KAAiB,SAAwB7S,GAAQ;AACnD,MAAI;AAAA,IACF,WAAA8S,IAAY;AAAA,EAChB,IAAM,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GACpE;AAAA,IACF,WAAA7S;AAAA,EACJ,IAAMD;AACJ,EAAIC,KAAatD,EAAM,WAAWsD,CAAS,KACzC6O,EAAW,OAAO9O,GAAQ;AAAA,IACxB,SAAS8S,MAAc;AAAA,EAC7B,CAAK;AAEL,GAEIC,KAAQ,CAAC/S,GAAQwJ,MACZ,CAACpC,EAAO,MAAMpH,GAAQwJ,CAAE,GAAGpC,EAAO,IAAIpH,GAAQwJ,CAAE,CAAC;AAG1D,SAASwJ,GAAU,GAAGpT,GAAG;AAAE,MAAIC,IAAI,OAAO,KAAK,CAAC;AAAG,MAAI,OAAO,uBAAuB;AAAE,QAAIb,IAAI,OAAO,sBAAsB,CAAC;AAAG,IAAAY,MAAMZ,IAAIA,EAAE,OAAO,SAAUY,GAAG;AAAE,aAAO,OAAO,yBAAyB,GAAGA,CAAC,EAAE;AAAA,IAAY,CAAC,IAAIC,EAAE,KAAK,MAAMA,GAAGb,CAAC;AAAA,EAAG;AAAE,SAAOa;AAAG;AAChQ,SAASoT,GAAgB,GAAG;AAAE,WAASrT,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAE,QAAIC,IAAY,UAAUD,CAAC,KAAnB,OAAuB,UAAUA,CAAC,IAAI,CAAA;AAAI,IAAAA,IAAI,IAAIoT,GAAU,OAAOnT,CAAC,GAAG,EAAE,EAAE,QAAQ,SAAUD,GAAG;AAAE,MAAAH,EAAgB,GAAGG,GAAGC,EAAED,CAAC,CAAC;AAAA,IAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiB,GAAG,OAAO,0BAA0BC,CAAC,CAAC,IAAImT,GAAU,OAAOnT,CAAC,CAAC,EAAE,QAAQ,SAAUD,GAAG;AAAE,aAAO,eAAe,GAAGA,GAAG,OAAO,yBAAyBC,GAAGD,CAAC,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AAAE,SAAO;AAAG;AACzb,IAACsT,KAAkB,SAAyBlT,GAAQ;AACrD,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,SAAOiK,EAAO,MAAMpH,GAAQiT,GAAgBA,GAAgB,CAAA,GAAI9V,CAAO,GAAG,IAAI;AAAA,IAC5E,OAAO,OAAKkK,EAAQ,UAAU,CAAC,KAAKD,EAAO,kBAAkBpH,GAAQ,CAAC;AAAA,EAC1E,CAAG,CAAC;AACJ,GAEIkG,KAAM,CAAClG,GAAQwJ,MACVpC,EAAO,MAAMpH,GAAQwJ,GAAI;AAAA,EAC9B,MAAM;AACV,CAAG,GAGC2J,KAAQ,CAACnT,GAAQwJ,MAAO;AAC1B,MAAInN,IAAO+K,EAAO,KAAKpH,GAAQwJ,GAAI;AAAA,IACjC,MAAM;AAAA,EACV,CAAG;AACD,SAAOpC,EAAO,KAAKpH,GAAQ3D,CAAI;AACjC,GAEIqN,KAAW,CAAC1J,GAAQwJ,MAAO;AAC7B,MAAIzD,IAAQqB,EAAO,MAAMpH,GAAQwJ,CAAE;AACnC,SAAOpJ,EAAK,SAASJ,GAAQ+F,CAAK;AACpC;AAEA,SAASqN,GAAU,GAAGxT,GAAG;AAAE,MAAIC,IAAI,OAAO,KAAK,CAAC;AAAG,MAAI,OAAO,uBAAuB;AAAE,QAAIb,IAAI,OAAO,sBAAsB,CAAC;AAAG,IAAAY,MAAMZ,IAAIA,EAAE,OAAO,SAAUY,GAAG;AAAE,aAAO,OAAO,yBAAyB,GAAGA,CAAC,EAAE;AAAA,IAAY,CAAC,IAAIC,EAAE,KAAK,MAAMA,GAAGb,CAAC;AAAA,EAAG;AAAE,SAAOa;AAAG;AAChQ,SAASwT,GAAgB,GAAG;AAAE,WAASzT,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAE,QAAIC,IAAY,UAAUD,CAAC,KAAnB,OAAuB,UAAUA,CAAC,IAAI,CAAA;AAAI,IAAAA,IAAI,IAAIwT,GAAU,OAAOvT,CAAC,GAAG,EAAE,EAAE,QAAQ,SAAUD,GAAG;AAAE,MAAAH,EAAgB,GAAGG,GAAGC,EAAED,CAAC,CAAC;AAAA,IAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiB,GAAG,OAAO,0BAA0BC,CAAC,CAAC,IAAIuT,GAAU,OAAOvT,CAAC,CAAC,EAAE,QAAQ,SAAUD,GAAG;AAAE,aAAO,eAAe,GAAGA,GAAG,OAAO,yBAAyBC,GAAGD,CAAC,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AAAE,SAAO;AAAG;AACzb,IAAC0T,KAAU,SAAiBtT,GAAQ;AACrC,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,SAAOiK,EAAO,MAAMpH,GAAQqT,GAAgBA,GAAgB,CAAA,GAAIlW,CAAO,GAAG,IAAI;AAAA,IAC5E,OAAO,OAAKkK,EAAQ,UAAU,CAAC,KAAKD,EAAO,OAAOpH,GAAQ,CAAC;AAAA,EAC/D,CAAG,CAAC;AACJ,GAEIuT,KAAY,CAACvT,GAAQ+E,MAChBA,EAAQ,SAAS,KAAK,CAAAjH,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC,CAAC,GAGjF0V,KAAa,CAACxT,GAAQ+E,MACjBA,EAAQ,SAAS,KAAK,CAAAjH,MAAKsD,EAAK,OAAOtD,CAAC,KAAKsJ,EAAO,SAASpH,GAAQlC,CAAC,CAAC,GAG5E2V,KAAU,CAACzT,GAAQ3D,MACd+D,EAAK,IAAIJ,GAAQ3D,CAAI,GAG1BqX,KAAW,CAAC1T,GAAQ+E,MACfA,EAAQ,SAAS,MAAM,CAAAjH,MAAKsD,EAAK,OAAOtD,CAAC,CAAC,GAG/C6V,KAAc,CAAA3T,MAAU;AAC1B,EAAA8O,EAAW,WAAW9O,GAAQ;AAAA,IAC5B,QAAQ;AAAA,EACZ,CAAG;AACH,GAEI4T,KAAa,CAAC5T,GAAQE,GAAM/C,MAAY;AAC1C,EAAA2R,EAAW,YAAY9O,GAAQE,GAAM/C,CAAO;AAC9C,GAEI0W,KAAkB,CAAA7T,MAAU;AAC9B,EAAA8O,EAAW,WAAW9O,GAAQ;AAAA,IAC5B,QAAQ;AAAA,EACZ,CAAG;AACH;AAEA,SAAS8T,GAAU,GAAGlU,GAAG;AAAE,MAAIC,IAAI,OAAO,KAAK,CAAC;AAAG,MAAI,OAAO,uBAAuB;AAAE,QAAIb,IAAI,OAAO,sBAAsB,CAAC;AAAG,IAAAY,MAAMZ,IAAIA,EAAE,OAAO,SAAUY,GAAG;AAAE,aAAO,OAAO,yBAAyB,GAAGA,CAAC,EAAE;AAAA,IAAY,CAAC,IAAIC,EAAE,KAAK,MAAMA,GAAGb,CAAC;AAAA,EAAG;AAAE,SAAOa;AAAG;AAChQ,SAASkU,GAAgB,GAAG;AAAE,WAASnU,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAE,QAAIC,IAAY,UAAUD,CAAC,KAAnB,OAAuB,UAAUA,CAAC,IAAI,CAAA;AAAI,IAAAA,IAAI,IAAIkU,GAAU,OAAOjU,CAAC,GAAG,EAAE,EAAE,QAAQ,SAAUD,GAAG;AAAE,MAAAH,EAAgB,GAAGG,GAAGC,EAAED,CAAC,CAAC;AAAA,IAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiB,GAAG,OAAO,0BAA0BC,CAAC,CAAC,IAAIiU,GAAU,OAAOjU,CAAC,CAAC,EAAE,QAAQ,SAAUD,GAAG;AAAE,aAAO,eAAe,GAAGA,GAAG,OAAO,yBAAyBC,GAAGD,CAAC,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AAAE,SAAO;AAAG;AACzb,IAACoU,KAAa,SAAoBhU,GAAQQ,GAAM;AACjD,MAAIrD,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,IACF,WAAA8C;AAAA,IACA,OAAAoS;AAAA,EACJ,IAAMrS;AACJ,MAAIC,GAAW;AACb,QAAIoS,GAAO;AACT,UAAInS,IAAO6T,GAAgB;AAAA,QACzB,MAAAvT;AAAA,MACR,GAAS6R,CAAK;AACR,MAAAvD,EAAW,YAAY9O,GAAQE,GAAM;AAAA,QACnC,IAAI/C,EAAQ;AAAA,QACZ,OAAOA,EAAQ;AAAA,MACvB,CAAO;AAAA,IACH;AACE,MAAA2R,EAAW,WAAW9O,GAAQQ,GAAMrD,CAAO;AAE7C,IAAA6C,EAAO,QAAQ;AAAA,EACjB;AACF,GAEIiU,KAAU,CAACjU,GAAQjC,MACd,CAACiC,EAAO,SAASjC,CAAK,GAG3BmW,KAAS,CAAClU,GAAQxD,GAAOgN,MACpBpC,EAAO,QAAQpH,GAAQxD,GAAOgN,CAAE,KAAKpC,EAAO,MAAMpH,GAAQxD,GAAOgN,CAAE,GAGxE2K,KAAU,CAACnU,GAAQ+E,MAAY;AACjC,MAAI;AAAA,IACF,UAAAgD;AAAA,EACJ,IAAMhD,GACA,CAACoO,CAAK,IAAIpL;AACd,SAAOA,EAAS,WAAW,KAAKA,EAAS,WAAW,KAAK3G,EAAK,OAAO+R,CAAK,KAAKA,EAAM,SAAS,MAAM,CAACnT,EAAO,OAAO+E,CAAO;AAC5H,GAEIqP,KAAQ,CAACpU,GAAQxD,GAAOgN,MAAO;AACjC,MAAItD,IAAMkB,EAAO,IAAIpH,GAAQwJ,CAAE;AAC/B,SAAO/M,EAAM,OAAOD,GAAO0J,CAAG;AAChC,GAEIyD,KAAgB,CAAA3J,MAAU;AAC5B,MAAI2J,IAAgB5M,GAAY,IAAIiD,CAAM;AAC1C,SAAO2J,MAAkB,SAAY,KAAOA;AAC9C,GAEI0K,KAAU,CAACrU,GAAQxD,GAAOgN,MAAO;AAEnC,MAAIhN,EAAM,WAAW;AACnB,WAAO;AAET,MAAI+J,IAAQa,EAAO,MAAMpH,GAAQwJ,CAAE;AACnC,SAAO/M,EAAM,OAAOD,GAAO+J,CAAK;AAClC,GAEIpI,KAAO,CAAC6B,GAAQwJ,MAAO;AACzB,MAAInN,IAAO+K,EAAO,KAAKpH,GAAQwJ,GAAI;AAAA,IACjC,MAAM;AAAA,EACV,CAAG;AACD,SAAOpC,EAAO,KAAKpH,GAAQ3D,CAAI;AACjC,GAEIgM,KAAO,SAAcrI,GAAQwJ,GAAI;AACnC,MAAIrM,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9Ed,IAAO+K,EAAO,KAAKpH,GAAQwJ,GAAIrM,CAAO,GACtC+C,IAAOE,EAAK,KAAKJ,GAAQ3D,CAAI;AACjC,SAAO,CAAC6D,GAAM7D,CAAI;AACpB;AAEA,SAAS6T,GAAOlQ,GAAQ;AACtB,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,SAAO,aAAa;AAClB,QAAI;AAAA,MACF,IAAAqM,IAAKxJ,EAAO;AAAA,MACZ,SAAA5C,IAAU;AAAA,MACV,OAAAuR,IAAQ;AAAA,IACd,IAAQxR,GACA;AAAA,MACF,OAAAqR;AAAA,IACN,IAAQrR;AAIJ,QAHIqR,KAAS,SACXA,IAAQ,MAAM,KAEZ,EAAChF,GAGL;AAAA,UAAI0G,IAAS,CAAA,GACT7T,IAAO+K,EAAO,KAAKpH,GAAQwJ,CAAE;AACjC,eAAS,CAAC1L,GAAGQ,CAAC,KAAK8B,EAAK,OAAOJ,GAAQ3D,CAAI;AACzC,YAAKmS,EAAM1Q,GAAGQ,CAAC,MAGf4R,EAAO,KAAK,CAACpS,GAAGQ,CAAC,CAAC,GACd,CAACqQ,KAAStH,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,OAAOpH,GAAQlC,CAAC;AAC3D;AAGJ,MAAIV,KACF8S,EAAO,QAAO,GAEhB,OAAOA;AAAA;AAAA,EACT,EAAC;AACH;AAEA,IAAIoE,KAAc,CAAC,MAAM,GACvBC,KAAe,CAAC,MAAM,GACpBlC,KAAQ,SAAerS,GAAQ;AACjC,MAAI;AAAA,IACF,OAAAqS;AAAA,IACA,WAAApS;AAAA,EACJ,IAAMD;AACJ,MAAI,CAACC;AACH,WAAO;AAET,MAAI;AAAA,IACF,QAAA+F;AAAA,IACA,OAAAC;AAAA,EACJ,IAAMhG;AACJ,MAAIoS;AACF,WAAOA;AAET,MAAI1V,EAAM,WAAWsD,CAAS,GAAG;AAK/B,QAAImU,IAAQhN,EAAO,MAAMpH,GAAQgG,GAAQA,EAAO,IAAI;AACpD,QAAIoO,GAAO;AACT,UAAIzT,IAAQyG,EAAO,MAAMpH,GAAQgG,CAAM;AACvC,MAAIrF,MACFqF,IAASrF;AAAA,IAEb;AACA,QAAI,CAAC6N,CAAK,IAAIpH,EAAO,MAAMpH,GAAQ;AAAA,MACjC,OAAOoB,EAAK;AAAA,MACZ,IAAI;AAAA,QACF,QAAA4E;AAAA,QACA,OAAAC;AAAA,MACR;AAAA,IACA,CAAK;AACD,QAAIuI,GAAO;AACT,UAAI,CAAC/N,CAAK,IAAI+N,GACVgG,IAAQ9O,GAAyBjF,GAAO6T,EAAW;AACvD,aAAOE;AAAA,IACT;AACE,aAAO,CAAA;AAAA,EAEX;AACA,MAAI;AAAA,IACF,MAAAnY;AAAA,EACJ,IAAM2J,GACA,CAAC9F,CAAI,IAAIkH,EAAO,KAAKpH,GAAQ3D,CAAI;AACrC,MAAI2J,EAAO,WAAW,GAAG;AACvB,QAAI/E,IAAOmG,EAAO,SAASpH,GAAQ;AAAA,MACjC,IAAI3D;AAAA,MACJ,OAAO+E,EAAK;AAAA,IAClB,CAAK,GACGqT,IAAarN,EAAO,MAAMpH,GAAQ;AAAA,MACpC,OAAO,CAAAlC,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,OAAOpH,GAAQlC,CAAC,KAAKkC,EAAO,aAAalC,CAAC;AAAA,IAC3F,CAAK;AACD,QAAI,CAAC2W,GAAY;AACf,UAAIC,IAAQtN,EAAO,MAAMpH,GAAQ;AAAA,QAC/B,OAAO,CAAAlC,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC;AAAA,MACpE,CAAO;AACD,UAAImD,KAAQyT,GAAO;AACjB,YAAI,CAACC,GAAU3T,CAAQ,IAAIC,GACvB,CAAA,EAAG2T,CAAS,IAAIF;AACpB,QAAIpY,EAAK,WAAWsY,GAAW5T,CAAQ,MACrCd,IAAOyU;AAAA,MAEX;AAAA,IACF;AAAA,EACF;AACA,MAAIjO,IAAOhB,GAAyBxF,GAAMqU,EAAY;AACtD,SAAO7N;AACT,GAEIjE,KAAO,SAAczC,GAAQ;AAC/B,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,IACF,MAAAyU,IAAO;AAAA,IACP,OAAAjD,IAAQ;AAAA,EACZ,IAAMxR,GACA;AAAA,IACF,OAAAqR;AAAA,IACA,IAAAhF,IAAKxJ,EAAO;AAAA,EAChB,IAAM7C;AACJ,MAAKqM,GAGL;AAAA,QAAIqL,IAAqBzN,EAAO,MAAMpH,GAAQwJ,GAAI;AAAA,MAChD,OAAAmF;AAAA,IACJ,CAAG;AACD,QAAKkG,GACL;AAAA,UAAI,CAAA,EAAGlM,CAAE,IAAIvB,EAAO,KAAKpH,GAAQ,CAAA,CAAE,GAC/B8U,IAAO,CAACD,EAAmB,MAAMlM,CAAE;AACvC,UAAIrM,EAAK,OAAOkN,CAAE,KAAKA,EAAG,WAAW;AACnC,cAAM,IAAI,MAAM,8CAA8C;AAEhE,UAAIgF,KAAS;AACX,YAAIlS,EAAK,OAAOkN,CAAE,GAAG;AACnB,cAAI,CAACrJ,CAAM,IAAIiH,EAAO,OAAOpH,GAAQwJ,CAAE;AACvC,UAAAgF,IAAQ,CAAA1Q,MAAKqC,EAAO,SAAS,SAASrC,CAAC;AAAA,QACzC;AACE,UAAA0Q,IAAQ,MAAM;AAGlB,UAAI,CAAC/L,CAAI,IAAI2E,EAAO,MAAMpH,GAAQ;AAAA,QAChC,IAAI8U;AAAA,QACJ,OAAAtG;AAAA,QACA,MAAAoD;AAAA,QACA,OAAAjD;AAAA,MACJ,CAAG;AACD,aAAOlM;AAAA;AAAA;AACT,GAEIvC,KAAO,SAAcF,GAAQwJ,GAAI;AACnC,MAAIrM,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9Ed,IAAO+K,EAAO,KAAKpH,GAAQwJ,GAAIrM,CAAO,GACtC+C,IAAOE,EAAK,IAAIJ,GAAQ3D,CAAI;AAChC,SAAO,CAAC6D,GAAM7D,CAAI;AACpB;AAEA,SAASwI,GAAM7E,GAAQ;AACrB,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,SAAO,aAAa;AAClB,QAAI;AAAA,MACF,IAAAqM,IAAKxJ,EAAO;AAAA,MACZ,MAAA4R,IAAO;AAAA,MACP,WAAAmD,IAAY;AAAA,MACZ,SAAA3X,IAAU;AAAA,MACV,OAAAuR,IAAQ;AAAA,MACR,qBAAAqG,IAAsB;AAAA,IAC5B,IAAQ7X,GACA;AAAA,MACF,OAAAqR;AAAA,IACN,IAAQrR;AAIJ,QAHKqR,MACHA,IAAQ,MAAM,KAEZ,EAAChF,GAGL;AAAA,UAAId,GACAC;AACJ,UAAIkB,GAAK,OAAOL,CAAE;AAChB,QAAAd,IAAOc,EAAG,CAAC,GACXb,IAAKa,EAAG,CAAC;AAAA,WACJ;AACL,YAAI2J,IAAQ/L,EAAO,KAAKpH,GAAQwJ,GAAI;AAAA,UAClC,MAAM;AAAA,QACd,CAAO,GACGrL,IAAOiJ,EAAO,KAAKpH,GAAQwJ,GAAI;AAAA,UACjC,MAAM;AAAA,QACd,CAAO;AACD,QAAAd,IAAOtL,IAAUe,IAAOgV,GACxBxK,IAAKvL,IAAU+V,IAAQhV;AAAA,MACzB;AACA,UAAIgK,IAAc/H,EAAK,MAAMJ,GAAQ;AAAA,QACnC,SAAA5C;AAAA,QACA,MAAAsL;AAAA,QACA,IAAAC;AAAA,QACA,MAAM,CAAAP,MAAQ;AACZ,cAAI,CAAClI,CAAI,IAAIkI;AACb,iBAAKf,EAAQ,UAAUnH,CAAI,IACvB,IAACyO,MAAUvH,EAAO,OAAOpH,GAAQE,CAAI,KAAKkH,EAAO,kBAAkBpH,GAAQE,CAAI,MAC/E8U,KAAuB,CAAC5N,EAAO,aAAapH,GAAQE,CAAI,KAFvB;AAAA,QAIvC;AAAA,MACN,CAAK,GACG+U,IAAU,CAAA,GACVC;AACJ,eAAS,CAAChV,GAAM7D,CAAI,KAAK8L;AACvB,YAAI,EAAA6M,KAAuB3N,EAAQ,UAAUnH,CAAI,KAAK,CAACkH,EAAO,aAAapH,GAAQE,CAAI,IAGvF;AAAA,cAAIiV,IAAUD,KAAO5Y,EAAK,QAAQD,GAAM6Y,EAAI,CAAC,CAAC,MAAM;AAEpD,cAAI,EAAAtD,MAAS,aAAauD,IAG1B;AAAA,gBAAI,CAAC3G,EAAMtO,GAAM7D,CAAI,GAAG;AAItB,kBAAI0Y,KAAa,CAACI,KAAW/T,EAAK,OAAOlB,CAAI;AAC3C;AAEA;AAAA,YAEJ;AAEA,gBAAI0R,MAAS,YAAYuD,GAAS;AAChC,cAAAD,IAAM,CAAChV,GAAM7D,CAAI;AACjB;AAAA,YACF;AAEA,gBAAI+Y,IAAOxD,MAAS,WAAWsD,IAAM,CAAChV,GAAM7D,CAAI;AAChD,YAAI+Y,MACEL,IACFE,EAAQ,KAAKG,CAAI,IAEjB,MAAMA,IAGVF,IAAM,CAAChV,GAAM7D,CAAI;AAAA;AAAA;AAGnB,MAAIuV,MAAS,YAAYsD,MACnBH,IACFE,EAAQ,KAAKC,CAAG,IAEhB,MAAMA,IAKNH,MACF,OAAOE;AAAA;AAAA,EAEX,EAAC;AACH;AAEG,IAACI,KAAY,SAAmBrV,GAAQ;AACzC,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,IACF,OAAAmY,IAAQ;AAAA,IACR,WAAAlX;AAAA,EACJ,IAAMjB,GACA8S,IAAgB,CAAAjQ,MACXpD,GAAY,IAAIoD,CAAM,KAAK,CAAA,GAEhCuV,IAAmB,CAAAvV,MACdnD,GAAgB,IAAImD,CAAM,KAAK,oBAAI,IAAG,GAE3CwV,IAAe,CAAAxV,MAAU;AAC3B,QAAI3D,IAAO4T,EAAcjQ,CAAM,EAAE,IAAG,GAChCR,IAAMnD,EAAK,KAAK,GAAG;AACvB,WAAAkZ,EAAiBvV,CAAM,EAAE,OAAOR,CAAG,GAC5BnD;AAAA,EACT;AACA,MAAK+K,EAAO,cAAcpH,CAAM,GAGhC;AAAA,QAAIsV,GAAO;AACT,UAAIG,IAAW,MAAM,KAAKrV,EAAK,MAAMJ,CAAM,GAAG,CAAAoI,MAAQ;AACpD,YAAI,CAAA,EAAG9J,CAAC,IAAI8J;AACZ,eAAO9J;AAAA,MACT,CAAC,GACGoX,IAAc,IAAI,IAAID,EAAS,IAAI,CAAAnX,MAAKA,EAAE,KAAK,GAAG,CAAC,CAAC;AACxD,MAAA1B,GAAY,IAAIoD,GAAQyV,CAAQ,GAChC5Y,GAAgB,IAAImD,GAAQ0V,CAAW;AAAA,IACzC;AACA,IAAIzF,EAAcjQ,CAAM,EAAE,WAAW,KAGrCoH,EAAO,mBAAmBpH,GAAQ,MAAM;AAMtC,eAAS2V,KAAa1F,EAAcjQ,CAAM;AACxC,YAAII,EAAK,IAAIJ,GAAQ2V,CAAS,GAAG;AAC/B,cAAI9N,IAAQT,EAAO,KAAKpH,GAAQ2V,CAAS,GACrC,CAACzV,GAAM0V,CAAC,IAAI/N;AAOhB,UAAIR,EAAQ,UAAUnH,CAAI,KAAKA,EAAK,SAAS,WAAW,KACtDF,EAAO,cAAc6H,GAAO;AAAA,YAC1B,WAAAzJ;AAAA,UACZ,CAAW;AAAA,QAEL;AAKF,eAHIwR,IAAaK,EAAcjQ,CAAM,GACjCyR,IAA0B7B,EAAW,QACrC4B,IAAY,GACT5B,EAAW,WAAW,KAAG;AAC9B,YAAI,CAAC5P,EAAO,gBAAgB;AAAA,UAC1B,YAAA4P;AAAA,UACA,WAAA4B;AAAA,UACA,yBAAAC;AAAA,UACA,WAAArT;AAAA,QACR,CAAO;AACC;AAEF,YAAIyX,IAAaL,EAAaxV,CAAM;AAEpC,YAAII,EAAK,IAAIJ,GAAQ6V,CAAU,GAAG;AAChC,cAAIC,IAAS1O,EAAO,KAAKpH,GAAQ6V,CAAU;AAC3C,UAAA7V,EAAO,cAAc8V,GAAQ;AAAA,YAC3B,WAAA1X;AAAA,UACV,CAAS;AAAA,QACH;AACA,QAAAoT,KACA5B,IAAaK,EAAcjQ,CAAM;AAAA,MACnC;AAAA,IACF,CAAC;AAAA;AACH,GAEIG,KAAS,SAAgBH,GAAQwJ,GAAI;AACvC,MAAIrM,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9Ed,IAAO+K,EAAO,KAAKpH,GAAQwJ,GAAIrM,CAAO,GACtC4L,IAAazM,EAAK,OAAOD,CAAI,GAC7BwL,IAAQT,EAAO,KAAKpH,GAAQ+I,CAAU;AAC1C,SAAOlB;AACT,GAEIkO,KAAU,SAAiB/V,GAAQ3D,GAAM;AAC3C,MAAIc,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,IACF,UAAAf,IAAW;AAAA,EACf,IAAMe,GACAlB,IAAM;AAAA,IACR,SAASI;AAAA,IACT,UAAAD;AAAA,IACA,QAAQ;AACN,UAAI;AAAA,QACF,SAAAD;AAAA,MACR,IAAUF,GACA+Z,IAAW5O,EAAO,SAASpH,CAAM;AACrC,aAAAgW,EAAS,OAAO/Z,CAAG,GACnBA,EAAI,UAAU,MACPE;AAAA,IACT;AAAA,EACJ,GACM8Z,IAAO7O,EAAO,SAASpH,CAAM;AACjC,SAAAiW,EAAK,IAAIha,CAAG,GACLA;AACT,GAEI+Z,KAAW,CAAAhW,MAAU;AACvB,MAAIiW,IAAOjZ,GAAU,IAAIgD,CAAM;AAC/B,SAAKiW,MACHA,IAAO,oBAAI,IAAG,GACdjZ,GAAU,IAAIgD,GAAQiW,CAAI,IAErBA;AACT,GAEI5Z,KAAO,SAAc2D,GAAQwJ,GAAI;AACnC,MAAIrM,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,IACF,OAAA+Y;AAAA,IACA,MAAAC;AAAA,EACJ,IAAMhZ;AACJ,MAAIb,EAAK,OAAOkN,CAAE;AAChB,QAAI2M,MAAS,SAAS;AACpB,UAAI,CAAA,EAAGC,CAAS,IAAIhW,EAAK,MAAMJ,GAAQwJ,CAAE;AACzC,MAAAA,IAAK4M;AAAA,IACP,WAAWD,MAAS,OAAO;AACzB,UAAI,CAAA,EAAGE,CAAQ,IAAIjW,EAAK,KAAKJ,GAAQwJ,CAAE;AACvC,MAAAA,IAAK6M;AAAA,IACP;AAAA;AAEF,SAAI1Z,EAAM,QAAQ6M,CAAE,MACd2M,MAAS,UACX3M,IAAK7M,EAAM,MAAM6M,CAAE,IACV2M,MAAS,QAClB3M,IAAK7M,EAAM,IAAI6M,CAAE,IAEjBA,IAAKlN,EAAK,OAAOkN,EAAG,OAAO,MAAMA,EAAG,MAAM,IAAI,IAG9C/M,EAAM,QAAQ+M,CAAE,MAClBA,IAAKA,EAAG,OAEN0M,KAAS,SACX1M,IAAKA,EAAG,MAAM,GAAG0M,CAAK,IAEjB1M;AACT,GAEI8M,KAAW,SAAkBtW,GAAQxD,GAAO;AAC9C,MAAIW,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,IACF,UAAAf,IAAW;AAAA,EACf,IAAMe,GACAlB,IAAM;AAAA,IACR,SAASO;AAAA,IACT,UAAAJ;AAAA,IACA,QAAQ;AACN,UAAI;AAAA,QACF,SAAAD;AAAA,MACR,IAAUF,GACAsa,IAAYnP,EAAO,UAAUpH,CAAM;AACvC,aAAAuW,EAAU,OAAOta,CAAG,GACpBA,EAAI,UAAU,MACPE;AAAA,IACT;AAAA,EACJ,GACM8Z,IAAO7O,EAAO,UAAUpH,CAAM;AAClC,SAAAiW,EAAK,IAAIha,CAAG,GACLA;AACT,GAEIsa,KAAY,CAAAvW,MAAU;AACxB,MAAIiW,IAAOhZ,GAAW,IAAI+C,CAAM;AAChC,SAAKiW,MACHA,IAAO,oBAAI,IAAG,GACdhZ,GAAW,IAAI+C,GAAQiW,CAAI,IAEtBA;AACT,GAEIzZ,KAAQ,SAAewD,GAAQwJ,GAAI;AACrC,MAAIrM,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,IACF,MAAAgZ,IAAO;AAAA,EACX,IAAMhZ;AACJ,MAAIb,EAAK,OAAOkN,CAAE,GAAG;AACnB,QAAInN;AACJ,QAAI8Z,MAAS,OAAO;AAClB,UAAI,CAAA,EAAGE,CAAQ,IAAIjW,EAAK,KAAKJ,GAAQwJ,CAAE;AACvC,MAAAnN,IAAOga;AAAA,IACT,OAAO;AACL,UAAI,CAAA,EAAGD,CAAS,IAAIhW,EAAK,MAAMJ,GAAQwJ,CAAE;AACzC,MAAAnN,IAAO+Z;AAAA,IACT;AACA,QAAIlW,IAAOE,EAAK,IAAIJ,GAAQ3D,CAAI;AAChC,QAAI,CAAC+E,EAAK,OAAOlB,CAAI;AACnB,YAAM,IAAI,MAAM,kBAAkB,OAAOiW,GAAM,8BAA8B,EAAE,OAAO3M,GAAI,sBAAsB,EAAE,OAAO2M,GAAM,aAAa,CAAC;AAE/I,WAAO;AAAA,MACL,MAAA9Z;AAAA,MACA,QAAQ8Z,MAAS,QAAQjW,EAAK,KAAK,SAAS;AAAA,IAClD;AAAA,EACE;AACA,MAAIvD,EAAM,QAAQ6M,CAAE,GAAG;AACrB,QAAI,CAACjD,GAAOL,CAAG,IAAIvJ,EAAM,MAAM6M,CAAE;AACjC,WAAO2M,MAAS,UAAU5P,IAAQL;AAAA,EACpC;AACA,SAAOsD;AACT;AAEA,SAASgN,GAAUxW,GAAQ;AACzB,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,SAAO,aAAa;AAClB,QAAI;AAAA,MACF,IAAAqM,IAAKxJ,EAAO;AAAA,MACZ,MAAAyJ,IAAO;AAAA,MACP,SAAArM,IAAU;AAAA,MACV,OAAAuR,IAAQ;AAAA,MACR,qBAAAqG,IAAsB;AAAA,IAC5B,IAAQ7X;AACJ,QAAI,CAACqM;AACH;AAmBF,QAAIzD,IAAQqB,EAAO,MAAMpH,GAAQwJ,CAAE,GAC/B,CAACjD,GAAOL,CAAG,IAAIvJ,EAAM,MAAMoJ,CAAK,GAChCoN,IAAQ/V,IAAU8I,IAAMK,GACxBkQ,IAAa,IACbC,IAAY,IACZ5K,IAAW,GACX6K,IAAoB,GACpBC,IAAiB;AAOrB,aAAS,CAAC1W,GAAM7D,CAAI,KAAK+K,EAAO,MAAMpH,GAAQ;AAAA,MAC5C,IAAAwJ;AAAA,MACA,SAAApM;AAAA,MACA,OAAAuR;AAAA,MACA,qBAAAqG;AAAA,IACN,CAAK,GAAG;AAIF,UAAI3N,EAAQ,UAAUnH,CAAI,GAAG;AAI3B,YAAI,CAACyO,MAAU3O,EAAO,OAAOE,CAAI,KAAKF,EAAO,kBAAkBE,CAAI,IAAI;AACrE,gBAAMkH,EAAO,MAAMpH,GAAQ3D,CAAI;AAC/B;AAAA,QACF;AAIA,YAAI2D,EAAO,SAASE,CAAI,EAAG;AAE3B,YAAIkH,EAAO,WAAWpH,GAAQE,CAAI,GAAG;AAWnC,cAAI2W,IAAIva,EAAK,WAAWD,GAAM6J,EAAI,IAAI,IAAIA,IAAMkB,EAAO,IAAIpH,GAAQ3D,CAAI,GACnEya,IAAIxa,EAAK,WAAWD,GAAMkK,EAAM,IAAI,IAAIA,IAAQa,EAAO,MAAMpH,GAAQ3D,CAAI;AAC7E,UAAAqa,IAAYtP,EAAO,OAAOpH,GAAQ;AAAA,YAChC,QAAQ8W;AAAA,YACR,OAAOD;AAAA,UACnB,GAAa;AAAA,YACD,OAAAlI;AAAA,UACZ,CAAW,GACD8H,IAAa;AAAA,QACf;AAAA,MACF;AAKA,UAAIrV,EAAK,OAAOlB,CAAI,GAAG;AACrB,YAAI6W,IAAUza,EAAK,OAAOD,GAAM8W,EAAM,IAAI;AAsB1C,aAhBI4D,KACFJ,IAAoBvZ,IAAU+V,EAAM,SAASjT,EAAK,KAAK,SAASiT,EAAM,QACtEyD,IAAiBzD,EAAM,WAEvBwD,IAAoBzW,EAAK,KAAK,QAC9B0W,IAAiBxZ,IAAUuZ,IAAoB,KAG7CI,KAAWN,KAAchN,MAAS,cACpC,MAAM;AAAA,UACJ,MAAApN;AAAA,UACA,QAAQua;AAAA,QACpB,GACUH,IAAa,SAGF;AAIX,cAAI3K,MAAa,GAAG;AAClB,gBAAI4K,MAAc,GAAI;AACtB,YAAA5K,IAAWkL,EAAaN,GAAWjN,GAAMrM,CAAO,GAGhDsZ,IAAYzJ,GAAyByJ,GAAW5K,GAAU1O,CAAO,EAAE,CAAC;AAAA,UACtE;AAOA,cALAwZ,IAAiBxZ,IAAUwZ,IAAiB9K,IAAW8K,IAAiB9K,GACxE6K,IAAoBA,IAAoB7K,GAIpC6K,IAAoB,GAAG;AACzB,YAAA7K,IAAW,CAAC6K;AACZ;AAAA,UACF;AAIA,UAAA7K,IAAW,GACX,MAAM;AAAA,YACJ,MAAAzP;AAAA,YACA,QAAQua;AAAA,UACpB;AAAA,QACQ;AAAA,MACF;AAAA,IACF;AAMA,aAASI,EAAaxW,GAAMiJ,GAAMrM,GAAS;AACzC,aAAIqM,MAAS,cACJ4B,GAAqB7K,GAAMpD,CAAO,IAChCqM,MAAS,SACXmD,GAAgBpM,GAAMpD,CAAO,IAC3BqM,MAAS,UAAUA,MAAS,UAC9BjJ,EAAK,SAEP;AAAA,IACT;AAAA,EACF,EAAC;AACH;AAEG,IAACyW,KAAW,SAAkBjX,GAAQ;AACvC,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,IACF,MAAAyU,IAAO;AAAA,IACP,OAAAjD,IAAQ;AAAA,EACZ,IAAMxR,GACA;AAAA,IACF,OAAAqR;AAAA,IACA,IAAAhF,IAAKxJ,EAAO;AAAA,EAChB,IAAM7C;AACJ,MAAKqM,GAGL;AAAA,QAAI0N,IAAsB9P,EAAO,OAAOpH,GAAQwJ,GAAI;AAAA,MAClD,OAAAmF;AAAA,IACJ,CAAG;AACD,QAAKuI,GAGL;AAAA,UAAI,CAAA,EAAGvO,CAAE,IAAIvB,EAAO,MAAMpH,GAAQ,CAAA,CAAE,GAGhC8U,IAAO,CAACoC,EAAoB,MAAMvO,CAAE;AACxC,UAAIrM,EAAK,OAAOkN,CAAE,KAAKA,EAAG,WAAW;AACnC,cAAM,IAAI,MAAM,kDAAkD;AAEpE,UAAIgF,KAAS;AACX,YAAIlS,EAAK,OAAOkN,CAAE,GAAG;AACnB,cAAI,CAACrJ,CAAM,IAAIiH,EAAO,OAAOpH,GAAQwJ,CAAE;AACvC,UAAAgF,IAAQ,CAAA1Q,MAAKqC,EAAO,SAAS,SAASrC,CAAC;AAAA,QACzC;AACE,UAAA0Q,IAAQ,MAAM;AAGlB,UAAI,CAACyI,CAAQ,IAAI7P,EAAO,MAAMpH,GAAQ;AAAA,QACpC,SAAS;AAAA,QACT,IAAI8U;AAAA,QACJ,OAAAtG;AAAA,QACA,MAAAoD;AAAA,QACA,OAAAjD;AAAA,MACJ,CAAG;AACD,aAAOsI;AAAA;AAAA;AACT,GAEIE,KAAW,SAAkBnX,GAAQ+F,GAAO;AAC9C,MAAI5I,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,IACF,UAAAf,IAAW;AAAA,EACf,IAAMe,GACAlB,IAAM;AAAA,IACR,SAAS8J;AAAA,IACT,UAAA3J;AAAA,IACA,QAAQ;AACN,UAAI;AAAA,QACF,SAAAD;AAAA,MACR,IAAUF,GACAmb,IAAYhQ,EAAO,UAAUpH,CAAM;AACvC,aAAAoX,EAAU,OAAOnb,CAAG,GACpBA,EAAI,UAAU,MACPE;AAAA,IACT;AAAA,EACJ,GACM8Z,IAAO7O,EAAO,UAAUpH,CAAM;AAClC,SAAAiW,EAAK,IAAIha,CAAG,GACLA;AACT,GAEImb,KAAY,CAAApX,MAAU;AACxB,MAAIiW,IAAO/Y,GAAW,IAAI8C,CAAM;AAChC,SAAKiW,MACHA,IAAO,oBAAI,IAAG,GACd/Y,GAAW,IAAI8C,GAAQiW,CAAI,IAEtBA;AACT,GAEIlQ,KAAQ,CAAC/F,GAAQwJ,GAAIb,MAAO;AAC9B,MAAIhM,EAAM,QAAQ6M,CAAE,KAAK,CAACb;AACxB,WAAOa;AAET,MAAIjD,IAAQa,EAAO,MAAMpH,GAAQwJ,CAAE,GAC/BtD,IAAMkB,EAAO,IAAIpH,GAAQ2I,KAAMa,CAAE;AACrC,SAAO;AAAA,IACL,QAAQjD;AAAA,IACR,OAAOL;AAAA,EACX;AACA;AAEA,SAASmR,GAAU,GAAGzX,GAAG;AAAE,MAAIC,IAAI,OAAO,KAAK,CAAC;AAAG,MAAI,OAAO,uBAAuB;AAAE,QAAIb,IAAI,OAAO,sBAAsB,CAAC;AAAG,IAAAY,MAAMZ,IAAIA,EAAE,OAAO,SAAUY,GAAG;AAAE,aAAO,OAAO,yBAAyB,GAAGA,CAAC,EAAE;AAAA,IAAY,CAAC,IAAIC,EAAE,KAAK,MAAMA,GAAGb,CAAC;AAAA,EAAG;AAAE,SAAOa;AAAG;AAChQ,SAASyX,GAAgB,GAAG;AAAE,WAAS1X,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAE,QAAIC,IAAY,UAAUD,CAAC,KAAnB,OAAuB,UAAUA,CAAC,IAAI,CAAA;AAAI,IAAAA,IAAI,IAAIyX,GAAU,OAAOxX,CAAC,GAAG,EAAE,EAAE,QAAQ,SAAUD,GAAG;AAAE,MAAAH,EAAgB,GAAGG,GAAGC,EAAED,CAAC,CAAC;AAAA,IAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiB,GAAG,OAAO,0BAA0BC,CAAC,CAAC,IAAIwX,GAAU,OAAOxX,CAAC,CAAC,EAAE,QAAQ,SAAUD,GAAG;AAAE,aAAO,eAAe,GAAGA,GAAG,OAAO,yBAAyBC,GAAGD,CAAC,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AAAE,SAAO;AAAG;AACzb,IAAC2X,KAAa,CAACvX,GAAQR,MAAQ;AAChC,MAAI;AAAA,IACF,WAAAS;AAAA,EACJ,IAAMD;AACJ,MAAIC,GAAW;AACb,QAAIuO,IAAQ,CAACtO,GAAM7D,MAAS;AAC1B,UAAI,CAAC+E,EAAK,OAAOlB,CAAI;AACnB,eAAO;AAGT,UAAI,CAAC8R,GAAYjJ,CAAU,IAAI3B,EAAO,OAAOpH,GAAQ3D,CAAI;AACzD,aAAO,CAAC2D,EAAO,OAAOgS,CAAU,KAAKhS,EAAO,aAAagS,CAAU;AAAA,IACrE,GACIC,IAAoBtV,EAAM,WAAWsD,CAAS,GAC9CiS,IAA4B;AAChC,QAAI,CAACD,GAAmB;AACtB,UAAI,CAACE,GAAcC,CAAY,IAAIhL,EAAO,KAAKpH,GAAQC,CAAS;AAChE,UAAIkS,KAAgB3D,EAAM2D,GAAcC,CAAY,GAAG;AACrD,YAAI,CAACJ,CAAU,IAAI5K,EAAO,OAAOpH,GAAQoS,CAAY;AACrD,QAAAF,IAA4BF,KAAchS,EAAO,aAAagS,CAAU;AAAA,MAC1E;AAAA,IACF;AACA,QAAIC,KAAqBC;AACvB,MAAApD,EAAW,WAAW9O,GAAQR,GAAK;AAAA,QACjC,OAAAgP;AAAA,QACA,OAAO;AAAA,QACP,OAAO;AAAA,MACf,CAAO;AAAA,SACI;AACL,UAAI6D,IAAQiF,GAAgB,CAAA,GAAIlQ,EAAO,MAAMpH,CAAM,KAAK,EAAE;AAC1D,aAAOqS,EAAM7S,CAAG,GAChBQ,EAAO,QAAQqS,GACVvV,GAAS,IAAIkD,CAAM,KACtBA,EAAO,SAAQ;AAAA,IAEnB;AAAA,EACF;AACF,GAEIwX,KAAiB,CAACxX,GAAQ2J,MAAkB;AAC9C,EAAA5M,GAAY,IAAIiD,GAAQ2J,CAAa;AACvC,GAEIpD,KAAQ,CAACvG,GAAQwJ,MACZpC,EAAO,MAAMpH,GAAQwJ,GAAI;AAAA,EAC9B,MAAM;AACV,CAAG,GAGCiO,KAAS,SAAgBzX,GAAQwJ,GAAI;AACvC,MAAIrM,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,IACF,OAAAwR,IAAQ;AAAA,EACZ,IAAMxR,GACA4I,IAAQqB,EAAO,MAAMpH,GAAQwJ,CAAE,GAC/B,CAACjD,GAAOL,CAAG,IAAIvJ,EAAM,MAAMoJ,CAAK,GAChCvF,IAAO;AACX,WAAS,CAACN,GAAM7D,CAAI,KAAK+K,EAAO,MAAMpH,GAAQ;AAAA,IAC5C,IAAI+F;AAAA,IACJ,OAAO3E,EAAK;AAAA,IACZ,OAAAuN;AAAA,EACJ,CAAG,GAAG;AACF,QAAI9O,IAAIK,EAAK;AACb,IAAI5D,EAAK,OAAOD,GAAM6J,EAAI,IAAI,MAC5BrG,IAAIA,EAAE,MAAM,GAAGqG,EAAI,MAAM,IAEvB5J,EAAK,OAAOD,GAAMkK,EAAM,IAAI,MAC9B1G,IAAIA,EAAE,MAAM0G,EAAM,MAAM,IAE1B/F,KAAQX;AAAA,EACV;AACA,SAAOW;AACT,GAEIkX,KAAc,SAAqB1X,GAAQ+F,GAAO;AACpD,MAAI5I,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,IACF,OAAAwR,IAAQ;AAAA,EACZ,IAAMxR,GACA,CAACoJ,GAAOL,CAAG,IAAIvJ,EAAM,MAAMoJ,CAAK;AAEpC,MAAIQ,EAAM,WAAW,KAAKL,EAAI,WAAW,KAAKvJ,EAAM,YAAYoJ,CAAK,KAAKzJ,EAAK,YAAY4J,EAAI,IAAI;AACjG,WAAOH;AAET,MAAI4R,IAAWvQ,EAAO,MAAMpH,GAAQ;AAAA,IAClC,IAAIkG;AAAA,IACJ,OAAO,CAAApI,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC;AAAA,IAC5D,OAAA6Q;AAAA,EACJ,CAAG,GACGiG,IAAY+C,IAAWA,EAAS,CAAC,IAAI,CAAA,GACrCxE,IAAQ/L,EAAO,MAAMpH,GAAQuG,CAAK,GAClC7F,IAAS;AAAA,IACX,QAAQyS;AAAA,IACR,OAAOjN;AAAA,EACX,GACM0R,IAAO;AACX,WAAS,CAAC1X,GAAM7D,CAAI,KAAK+K,EAAO,MAAMpH,GAAQ;AAAA,IAC5C,IAAIU;AAAA,IACJ,OAAOU,EAAK;AAAA,IACZ,SAAS;AAAA,IACT,OAAAuN;AAAA,EACJ,CAAG,GAAG;AACF,QAAIiJ,GAAM;AACR,MAAAA,IAAO;AACP;AAAA,IACF;AACA,QAAI1X,EAAK,SAAS,MAAM5D,EAAK,SAASD,GAAMuY,CAAS,GAAG;AACtD,MAAA1O,IAAM;AAAA,QACJ,MAAA7J;AAAA,QACA,QAAQ6D,EAAK,KAAK;AAAA,MAC1B;AACM;AAAA,IACF;AAAA,EACF;AACA,SAAO;AAAA,IACL,QAAQqG;AAAA,IACR,OAAOL;AAAA,EACX;AACA,GAEI2R,KAAqB,CAAC7X,GAAQ4J,MAAO;AACvC,MAAI7L,IAAQqJ,EAAO,cAAcpH,CAAM;AACvC,EAAAoH,EAAO,eAAepH,GAAQ,EAAK;AACnC,MAAI;AACF,IAAA4J,EAAE;AAAA,EACJ,UAAC;AACC,IAAAxC,EAAO,eAAepH,GAAQjC,CAAK;AAAA,EACrC;AACA,EAAAqJ,EAAO,UAAUpH,CAAM;AACzB,GAEI8X,KAAa,SAAoB9X,GAAQ;AAC3C,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,EAAAiK,EAAO,mBAAmBpH,GAAQ,MAAM;AACtC,QAAI+X,GAAcC,GACd;AAAA,MACF,SAAA5a,IAAU;AAAA,MACV,MAAAqM,IAAO;AAAA,MACP,UAAAqC,IAAW;AAAA,MACX,OAAA6C,IAAQ;AAAA,IACd,IAAQxR,GACA;AAAA,MACF,IAAAqM,IAAKxJ,EAAO;AAAA,MACZ,SAAAiY,IAAU;AAAA,IAChB,IAAQ9a;AACJ,QAAKqM,GAGL;AAAA,UAAItC,IAAc;AAKlB,UAJIvK,EAAM,QAAQ6M,CAAE,KAAK7M,EAAM,YAAY6M,CAAE,MAC3CtC,IAAc,IACdsC,IAAKA,EAAG,SAEN/M,EAAM,QAAQ+M,CAAE,GAAG;AACrB,YAAI0O,IAAe9Q,EAAO,KAAKpH,GAAQ;AAAA,UACrC,IAAAwJ;AAAA,UACA,MAAM;AAAA,QACd,CAAO;AACD,YAAI,CAACmF,KAASuJ,GAAc;AAC1B,cAAI,CAAA,EAAGC,CAAQ,IAAID;AACnB,UAAA1O,IAAK2O;AAAA,QACP,OAAO;AACL,cAAIC,IAAO;AAAA,YACT,MAAA3O;AAAA,YACA,UAAAqC;AAAA,UACV,GACY7G,IAAS7H,IAAUgK,EAAO,OAAOpH,GAAQwJ,GAAI4O,CAAI,KAAKhR,EAAO,MAAMpH,GAAQ,CAAA,CAAE,IAAIoH,EAAO,MAAMpH,GAAQwJ,GAAI4O,CAAI,KAAKhR,EAAO,IAAIpH,GAAQ,EAAE;AAC5I,UAAAwJ,IAAK;AAAA,YACH,QAAQA;AAAA,YACR,OAAOvE;AAAA,UACjB,GACQgT,IAAU;AAAA,QACZ;AAAA,MACF;AACA,UAAI3b,EAAK,OAAOkN,CAAE,GAAG;AACnB,QAAAsF,EAAW,YAAY9O,GAAQ;AAAA,UAC7B,IAAAwJ;AAAA,UACA,OAAAmF;AAAA,QACR,CAAO;AACD;AAAA,MACF;AACA,UAAI,CAAAhS,EAAM,YAAY6M,CAAE,GAGxB;AAAA,YAAI,CAACyO,GAAS;AACZ,cAAI,CAAA,EAAGI,CAAI,IAAI1b,EAAM,MAAM6M,CAAE,GACzB8O,IAAWlR,EAAO,IAAIpH,GAAQ,CAAA,CAAE;AACpC,UAAKvD,EAAM,OAAO4b,GAAMC,CAAQ,MAC9B9O,IAAKpC,EAAO,YAAYpH,GAAQwJ,GAAI;AAAA,YAClC,OAAAmF;AAAA,UACV,CAAS;AAAA,QAEL;AACA,YAAI,CAACpI,GAAOL,CAAG,IAAIvJ,EAAM,MAAM6M,CAAE,GAC7B+O,IAAanR,EAAO,MAAMpH,GAAQ;AAAA,UACpC,OAAO,CAAAlC,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC;AAAA,UAC5D,IAAIyI;AAAA,UACJ,OAAAoI;AAAA,QACN,CAAK,GACGgJ,IAAWvQ,EAAO,MAAMpH,GAAQ;AAAA,UAClC,OAAO,CAAAlC,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC;AAAA,UAC5D,IAAIoI;AAAA,UACJ,OAAAyI;AAAA,QACN,CAAK,GACG6J,IAAiBD,KAAcZ,KAAY,CAACrb,EAAK,OAAOic,EAAW,CAAC,GAAGZ,EAAS,CAAC,CAAC,GAClFc,IAAenc,EAAK,OAAOiK,EAAM,MAAML,EAAI,IAAI,GAC/CwS,IAAmB/J,IAAQ,QAAQoJ,IAAe3Q,EAAO,KAAKpH,GAAQ;AAAA,UACxE,IAAIuG;AAAA,UACJ,MAAM;AAAA,QACZ,CAAK,OAAO,QAAQwR,MAAiB,SAASA,IAAe3Q,EAAO,gBAAgBpH,GAAQ;AAAA,UACtF,IAAIuG;AAAA,UACJ,MAAM;AAAA,QACZ,CAAK,GACGoS,IAAiBhK,IAAQ,QAAQqJ,IAAgB5Q,EAAO,KAAKpH,GAAQ;AAAA,UACvE,IAAIkG;AAAA,UACJ,MAAM;AAAA,QACZ,CAAK,OAAO,QAAQ8R,MAAkB,SAASA,IAAgB5Q,EAAO,gBAAgBpH,GAAQ;AAAA,UACxF,IAAIkG;AAAA,UACJ,MAAM;AAAA,QACZ,CAAK;AAED,YAAIwS,GAAkB;AACpB,cAAIhY,IAAS0G,EAAO,OAAOpH,GAAQuG,CAAK;AACxC,UAAI7F,KAAU6X,KAAcjc,EAAK,WAAWic,EAAW,CAAC,GAAG7X,EAAO,IAAI,MACpE6F,IAAQ7F;AAAA,QAEZ;AACA,YAAIiY,GAAgB;AAClB,cAAIhY,IAAQyG,EAAO,MAAMpH,GAAQkG,CAAG;AACpC,UAAIvF,KAASgX,KAAYrb,EAAK,WAAWqb,EAAS,CAAC,GAAGhX,EAAM,IAAI,MAC9DuF,IAAMvF;AAAA,QAEV;AAGA,YAAIsU,IAAU,CAAA,GACVoB;AACJ,iBAASxO,KAAST,EAAO,MAAMpH,GAAQ;AAAA,UACrC,IAAAwJ;AAAA,UACA,OAAAmF;AAAA,QACN,CAAK,GAAG;AACF,cAAI,CAACzO,GAAM7D,CAAI,IAAIwL;AACnB,UAAIwO,KAAY/Z,EAAK,QAAQD,GAAMga,CAAQ,MAAM,MAG7C,CAAC1H,KAAStH,EAAQ,UAAUnH,CAAI,MAAMkH,EAAO,OAAOpH,GAAQE,CAAI,KAAKkH,EAAO,kBAAkBpH,GAAQE,CAAI,MAAM,CAAC5D,EAAK,SAASD,GAAMkK,EAAM,IAAI,KAAK,CAACjK,EAAK,SAASD,GAAM6J,EAAI,IAAI,OACnL+O,EAAQ,KAAKpN,CAAK,GAClBwO,IAAWha;AAAA,QAEf;AACA,YAAI2Z,IAAW,MAAM,KAAKf,GAAS,CAAA7M,MAAQ;AACzC,cAAI,CAAA,EAAG9J,EAAC,IAAI8J;AACZ,iBAAOhB,EAAO,QAAQpH,GAAQ1B,EAAC;AAAA,QACjC,CAAC,GACGsQ,IAAWxH,EAAO,SAASpH,GAAQuG,CAAK,GACxCsI,IAASzH,EAAO,SAASpH,GAAQkG,CAAG,GACpC0S,IAAc;AAClB,YAAI,CAACH,KAAgB,CAACC,GAAkB;AACtC,cAAI9X,KAASgO,EAAS,SAClB,CAACnO,CAAK,IAAI2G,EAAO,KAAKpH,GAAQY,EAAM,GACpC;AAAA,YACF,MAAMN;AAAA,UACd,IAAUM,IACA;AAAA,YACF,QAAAL;AAAA,UACR,IAAUgG,GACA/F,IAAOC,EAAM,KAAK,MAAMF,EAAM;AAClC,UAAIC,EAAK,SAAS,MAChBR,EAAO,MAAM;AAAA,YACX,MAAM;AAAA,YACN,MAAMM;AAAA,YACN,QAAAC;AAAA,YACA,MAAAC;AAAA,UACV,CAAS,GACDoY,IAAcpY;AAAA,QAElB;AAKA,YAJAwV,EAAS,QAAO,EAAG,IAAI,CAAApW,MAAKA,EAAE,MAAK,CAAE,EAAE,OAAO,CAAAA,MAAKA,MAAM,IAAI,EAAE,QAAQ,CAAAtB,MAAKwQ,EAAW,YAAY9O,GAAQ;AAAA,UACzG,IAAI1B;AAAA,UACJ,OAAAqQ;AAAA,QACN,CAAK,CAAC,GACE,CAACgK,GAAgB;AACnB,cAAIrX,IAAUuN,EAAO,SACjB,CAAC9N,EAAM,IAAIqG,EAAO,KAAKpH,GAAQsB,CAAO,GACtC;AAAA,YACF,MAAMR;AAAA,UACd,IAAUQ,GACAsB,KAAU6V,IAAelS,EAAM,SAAS,GACxC1D,KAAQ9B,GAAO,KAAK,MAAM6B,IAASsD,EAAI,MAAM;AACjD,UAAIrD,GAAM,SAAS,MACjB7C,EAAO,MAAM;AAAA,YACX,MAAM;AAAA,YACN,MAAMc;AAAA,YACN,QAAQ8B;AAAA,YACR,MAAMC;AAAA,UAChB,CAAS,GACD+V,IAAc/V;AAAA,QAElB;AACA,QAAI,CAAC4V,KAAgBD,KAAkB3J,EAAO,WAAWD,EAAS,WAChEE,EAAW,WAAW9O,GAAQ;AAAA,UAC5B,IAAI6O,EAAO;AAAA,UACX,SAAS;AAAA,UACT,OAAAF;AAAA,QACR,CAAO,GAKCzH,KAAe9J,KAAWqM,MAAS,eAAemP,EAAY,SAAS,KAAKA,EAAY,MAAM,kBAAkB,KAClH9J,EAAW,WAAW9O,GAAQ4Y,EAAY,MAAM,GAAGA,EAAY,SAAS9M,CAAQ,CAAC;AAEnF,YAAI+M,KAAajK,EAAS,MAAK,GAC3BkK,KAAWjK,EAAO,MAAK,GACvBrS,KAAQY,IAAUyb,MAAcC,KAAWA,MAAYD;AAC3D,QAAI1b,EAAQ,MAAM,QAAQX,MACxBsS,EAAW,OAAO9O,GAAQxD,EAAK;AAAA;AAAA;AAAA,EAEnC,CAAC;AACH,GAEIuc,KAAiB,SAAwB/Y,GAAQ0J,GAAU;AAC7D,MAAIvM,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,EAAAiK,EAAO,mBAAmBpH,GAAQ,MAAM;AACtC,QAAI;AAAA,MACF,SAAAiY,IAAU;AAAA,MACV,OAAAtJ,IAAQ;AAAA,IACd,IAAQxR,GACA;AAAA,MACF,IAAAqM,IAAK2B,GAAyBnL,CAAM;AAAA,MACpC,YAAAgZ,IAAa;AAAA,IACnB,IAAQ7b;AACJ,QAAKuM,EAAS,QAGd;AAAA,UAAI/M,EAAM,QAAQ6M,CAAE;AAMlB,YALKyO,MACHzO,IAAKpC,EAAO,YAAYpH,GAAQwJ,GAAI;AAAA,UAClC,OAAAmF;AAAA,QACV,CAAS,IAEChS,EAAM,YAAY6M,CAAE;AACtB,UAAAA,IAAKA,EAAG;AAAA,aACH;AACL,cAAI,CAAA,EAAGtD,CAAG,IAAIvJ,EAAM,MAAM6M,CAAE;AAC5B,cAAI,CAACmF,KAASvH,EAAO,KAAKpH,GAAQ;AAAA,YAChC,IAAIkG;AAAA,UACd,CAAS;AACC;AAEF,cAAIoQ,IAAWlP,EAAO,SAASpH,GAAQkG,CAAG;AAC1C,UAAA4I,EAAW,OAAO9O,GAAQ;AAAA,YACxB,IAAAwJ;AAAA,UACV,CAAS,GACDA,IAAK8M,EAAS,MAAK;AAAA,QACrB;AAAA,UACK,CAAIha,EAAK,OAAOkN,CAAE,MACvBA,IAAKpC,EAAO,MAAMpH,GAAQwJ,CAAE;AAE9B,UAAI,GAACmF,KAASvH,EAAO,KAAKpH,GAAQ;AAAA,QAChC,IAAAwJ;AAAA,MACN,CAAK,IAKD;AAAA,YAAIyP,IAAqB7R,EAAO,MAAMpH,GAAQ;AAAA,UAC5C,IAAAwJ;AAAA,UACA,OAAO,CAAA1L,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,SAASpH,GAAQlC,CAAC;AAAA,UAC7D,MAAM;AAAA,UACN,OAAA6Q;AAAA,QACN,CAAK;AACD,YAAIsK,GAAoB;AACtB,cAAI,CAAA,EAAGC,CAAW,IAAID;AACtB,cAAI7R,EAAO,MAAMpH,GAAQwJ,GAAI0P,CAAW,GAAG;AACzC,gBAAIvY,IAAQyG,EAAO,MAAMpH,GAAQkZ,CAAW;AAC5C,YAAA1P,IAAK7I;AAAA,UACP,WAAWyG,EAAO,QAAQpH,GAAQwJ,GAAI0P,CAAW,GAAG;AAClD,gBAAIxY,IAAS0G,EAAO,OAAOpH,GAAQkZ,CAAW;AAC9C,YAAA1P,IAAK9I;AAAA,UACP;AAAA,QACF;AACA,YAAIyY,IAAa/R,EAAO,MAAMpH,GAAQ;AAAA,UACpC,OAAO,CAAAlC,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC;AAAA,UAC5D,IAAA0L;AAAA,UACA,OAAAmF;AAAA,QACN,CAAK,GACG,CAAA,EAAGiG,CAAS,IAAIuE,GAChBC,IAAehS,EAAO,QAAQpH,GAAQwJ,GAAIoL,CAAS,GACnDyE,IAAajS,EAAO,MAAMpH,GAAQwJ,GAAIoL,CAAS,GAC/C0E,IAAeF,KAAgBC,GAC/BE,IAAa,CAACH,KAAgBA,KAAgBC,GAC9CG,IAAW,CAACH,GACZ,GAAGjD,CAAS,IAAIhW,EAAK,MAAM;AAAA,UAC7B,UAAUsJ;AAAA,QAChB,GAAO,EAAE,GACD,GAAG2M,CAAQ,IAAIjW,EAAK,KAAK;AAAA,UAC3B,UAAUsJ;AAAA,QAChB,GAAO,EAAE,GACDuL,IAAU,CAAA,GACVwE,IAAU,CAAArR,MAAQ;AACpB,cAAI,CAACtK,GAAGQ,EAAC,IAAI8J,GACTsR,KAASpb,GAAE,WAAW;AAC1B,iBAAIob,KACK,KAELJ,IACK,KAEL,EAAAC,KAAcjd,EAAK,WAAWgC,IAAG8X,CAAS,KAAK/O,EAAQ,UAAUvJ,CAAC,KAAK,CAACkC,EAAO,OAAOlC,CAAC,KAAK,CAACkC,EAAO,SAASlC,CAAC,KAG9G0b,KAAYld,EAAK,WAAWgC,IAAG+X,CAAQ,KAAKhP,EAAQ,UAAUvJ,CAAC,KAAK,CAACkC,EAAO,OAAOlC,CAAC,KAAK,CAACkC,EAAO,SAASlC,CAAC;AAAA,QAIjH;AACA,iBAAS+J,KAASzH,EAAK,MAAM;AAAA,UAC3B,UAAUsJ;AAAA,QAChB,GAAO;AAAA,UACD,MAAM+P;AAAA,QACZ,CAAK;AACC,UAAIA,EAAQ5R,CAAK,KACfoN,EAAQ,KAAKpN,CAAK;AAGtB,YAAI8R,IAAS,CAAA,GACTC,IAAU,CAAA,GACVC,IAAO,CAAA,GACPC,IAAW,IACXvG,IAAY;AAChB,iBAAS,CAACrT,CAAI,KAAK+U;AACjB,UAAI5N,EAAQ,UAAUnH,CAAI,KAAK,CAACF,EAAO,SAASE,CAAI,KAClD4Z,IAAW,IACXvG,IAAY,IACZqG,EAAQ,KAAK1Z,CAAI,KACR4Z,IACTH,EAAO,KAAKzZ,CAAI,IAEhB2Z,EAAK,KAAK3Z,CAAI;AAGlB,YAAI,CAAC6Z,CAAW,IAAI3S,EAAO,MAAMpH,GAAQ;AAAA,UACvC,IAAAwJ;AAAA,UACA,OAAO,CAAA1L,MAAKsD,EAAK,OAAOtD,CAAC,KAAKsJ,EAAO,SAASpH,GAAQlC,CAAC;AAAA,UACvD,MAAM;AAAA,UACN,OAAA6Q;AAAA,QACN,CAAK,GACG,CAAA,EAAGqL,CAAU,IAAID,GACjBE,IAAgB7S,EAAO,QAAQpH,GAAQwJ,GAAIwQ,CAAU,GACrDE,IAAc9S,EAAO,MAAMpH,GAAQwJ,GAAIwQ,CAAU,GACjDG,IAAY/S,EAAO,QAAQpH,GAAQqZ,KAAc,CAACQ,EAAK,SAASvd,EAAK,KAAKsY,CAAS,IAAIA,CAAS,GAChG/F,KAASzH,EAAO,QAAQpH,GAAQka,IAAc5d,EAAK,KAAK0d,CAAU,IAAIA,CAAU;AACpF,QAAAlL,EAAW,WAAW9O,GAAQ;AAAA,UAC5B,IAAAwJ;AAAA,UACA,OAAO,CAAA1L,MAAKyV,IAAYlM,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC,IAAIsD,EAAK,OAAOtD,CAAC,KAAKsJ,EAAO,SAASpH,GAAQlC,CAAC;AAAA,UACvH,MAAMyV,IAAY,WAAW;AAAA,UAC7B,QAAQA,MAAc,CAAC6F,KAAgBO,EAAO,SAAS,OAAO,CAACN,KAAcQ,EAAK,SAAS;AAAA,UAC3F,OAAAlL;AAAA,QACN,CAAK;AACD,YAAIC,IAAWxH,EAAO,QAAQpH,GAAQ,CAACia,KAAiBA,KAAiBC,IAAc5d,EAAK,KAAK0d,CAAU,IAAIA,CAAU;AA4BzH,YA3BAlL,EAAW,YAAY9O,GAAQ2Z,GAAQ;AAAA,UACrC,IAAI/K,EAAS;AAAA,UACb,OAAO,CAAA9Q,MAAKsD,EAAK,OAAOtD,CAAC,KAAKsJ,EAAO,SAASpH,GAAQlC,CAAC;AAAA,UACvD,MAAM;AAAA,UACN,OAAA6Q;AAAA,UACA,YAAAqK;AAAA,QACN,CAAK,GACGM,KAAgB,CAACK,EAAO,UAAUC,EAAQ,UAAU,CAACC,EAAK,UAC5D/K,EAAW,OAAO9O,GAAQ;AAAA,UACxB,IAAI4U;AAAA,UACJ,OAAAjG;AAAA,QACR,CAAO,GAEHG,EAAW,YAAY9O,GAAQ4Z,GAAS;AAAA,UACtC,IAAIO,EAAU;AAAA,UACd,OAAO,CAAArc,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC;AAAA,UAC5D,MAAM;AAAA,UACN,OAAA6Q;AAAA,UACA,YAAAqK;AAAA,QACN,CAAK,GACDlK,EAAW,YAAY9O,GAAQ6Z,GAAM;AAAA,UACnC,IAAIhL,GAAO;AAAA,UACX,OAAO,CAAA/Q,MAAKsD,EAAK,OAAOtD,CAAC,KAAKsJ,EAAO,SAASpH,GAAQlC,CAAC;AAAA,UACvD,MAAM;AAAA,UACN,OAAA6Q;AAAA,UACA,YAAAqK;AAAA,QACN,CAAK,GACG,CAAC7b,EAAQ,IAAI;AACf,cAAId;AAQJ,cAPIwd,EAAK,SAAS,KAAKhL,GAAO,UAC5BxS,KAAOC,EAAK,SAASuS,GAAO,OAAO,IAC1B+K,EAAQ,SAAS,KAAKO,EAAU,UACzC9d,KAAOC,EAAK,SAAS6d,EAAU,OAAO,IAC7BvL,EAAS,YAClBvS,KAAOC,EAAK,SAASsS,EAAS,OAAO,IAEnCvS,IAAM;AACR,gBAAIgc,KAAOjR,EAAO,IAAIpH,GAAQ3D,EAAI;AAClC,YAAAyS,EAAW,OAAO9O,GAAQqY,EAAI;AAAA,UAChC;AAAA,QACF;AACA,QAAAzJ,EAAS,MAAK,GACduL,EAAU,MAAK,GACftL,GAAO,MAAK;AAAA;AAAA;AAAA,EACd,CAAC;AACH,GAEIuL,KAAW,SAAkBpa,GAAQ;AACvC,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,IACF,MAAAgZ,IAAO;AAAA,EACX,IAAMhZ,GACA;AAAA,IACF,WAAA8C;AAAA,EACJ,IAAMD;AACJ,MAAKC;AAEE,QAAIkW,MAAS;AAClB,MAAArH,EAAW,OAAO9O,GAAQC,EAAU,MAAM;AAAA,aACjCkW,MAAS;AAClB,MAAArH,EAAW,OAAO9O,GAAQC,EAAU,KAAK;AAAA,aAChCkW,MAAS,SAAS;AAC3B,UAAI,CAAC5P,CAAK,IAAI5J,EAAM,MAAMsD,CAAS;AACnC,MAAA6O,EAAW,OAAO9O,GAAQuG,CAAK;AAAA,IACjC,WAAW4P,MAAS,OAAO;AACzB,UAAI,CAAA,EAAGjQ,CAAG,IAAIvJ,EAAM,MAAMsD,CAAS;AACnC,MAAA6O,EAAW,OAAO9O,GAAQkG,CAAG;AAAA,IAC/B;AAAA,QAXE;AAYJ,GAEImU,KAAW,CAAAra,MAAU;AACvB,MAAI;AAAA,IACF,WAAAC;AAAA,EACJ,IAAMD;AACJ,EAAIC,KACFD,EAAO,MAAM;AAAA,IACX,MAAM;AAAA,IACN,YAAYC;AAAA,IACZ,eAAe;AAAA,EACrB,CAAK;AAEL,GAEIqa,KAAO,SAActa,GAAQ;AAC/B,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,IACF,WAAA8C;AAAA,EACJ,IAAMD,GACA;AAAA,IACF,UAAA8L,IAAW;AAAA,IACX,MAAArC,IAAO;AAAA,IACP,SAAArM,IAAU;AAAA,EACd,IAAMD,GACA;AAAA,IACF,MAAAgZ,IAAO;AAAA,EACX,IAAMhZ;AACJ,MAAK8C,GAGL;AAAA,IAAIkW,MAAS,YACXA,IAAOxZ,EAAM,WAAWsD,CAAS,IAAI,UAAU,WAE7CkW,MAAS,UACXA,IAAOxZ,EAAM,WAAWsD,CAAS,IAAI,WAAW;AAElD,QAAI;AAAA,MACF,QAAA+F;AAAA,MACA,OAAAC;AAAA,IACJ,IAAMhG,GACAmY,IAAO;AAAA,MACT,UAAAtM;AAAA,MACA,MAAArC;AAAA,MACA,qBAAqB;AAAA,IACzB,GACM3E,IAAQ,CAAA;AACZ,QAAIqR,KAAQ,QAAQA,MAAS,UAAU;AACrC,UAAI3Z,IAAQY,IAAUgK,EAAO,OAAOpH,GAAQgG,GAAQoS,CAAI,IAAIhR,EAAO,MAAMpH,GAAQgG,GAAQoS,CAAI;AAC7F,MAAI5b,MACFsI,EAAM,SAAStI;AAAA,IAEnB;AACA,QAAI2Z,KAAQ,QAAQA,MAAS,SAAS;AACpC,UAAIvV,IAASxD,IAAUgK,EAAO,OAAOpH,GAAQiG,GAAOmS,CAAI,IAAIhR,EAAO,MAAMpH,GAAQiG,GAAOmS,CAAI;AAC5F,MAAIxX,MACFkE,EAAM,QAAQlE;AAAA,IAElB;AACA,IAAAkO,EAAW,aAAa9O,GAAQ8E,CAAK;AAAA;AACvC,GAEIyV,KAAS,CAACva,GAAQiF,MAAW;AAC/B,MAAI;AAAA,IACF,WAAAhF;AAAA,EACJ,IAAMD;AAEJ,MADAiF,IAASmC,EAAO,MAAMpH,GAAQiF,CAAM,GAChChF,GAAW;AACb,IAAA6O,EAAW,aAAa9O,GAAQiF,CAAM;AACtC;AAAA,EACF;AACA,MAAI,CAACtI,EAAM,QAAQsI,CAAM;AACvB,UAAM,IAAI,MAAM,qIAAqI,OAAO5D,EAAS,UAAU4D,CAAM,CAAC,CAAC;AAEzL,EAAAjF,EAAO,MAAM;AAAA,IACX,MAAM;AAAA,IACN,YAAYC;AAAA,IACZ,eAAegF;AAAA,EACnB,CAAG;AACH;AAEA,SAASuV,GAAU,GAAG5a,GAAG;AAAE,MAAIC,IAAI,OAAO,KAAK,CAAC;AAAG,MAAI,OAAO,uBAAuB;AAAE,QAAIb,IAAI,OAAO,sBAAsB,CAAC;AAAG,IAAAY,MAAMZ,IAAIA,EAAE,OAAO,SAAUY,GAAG;AAAE,aAAO,OAAO,yBAAyB,GAAGA,CAAC,EAAE;AAAA,IAAY,CAAC,IAAIC,EAAE,KAAK,MAAMA,GAAGb,CAAC;AAAA,EAAG;AAAE,SAAOa;AAAG;AAChQ,SAAS4a,GAAgB,GAAG;AAAE,WAAS7a,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAE,QAAIC,IAAY,UAAUD,CAAC,KAAnB,OAAuB,UAAUA,CAAC,IAAI,CAAA;AAAI,IAAAA,IAAI,IAAI4a,GAAU,OAAO3a,CAAC,GAAG,EAAE,EAAE,QAAQ,SAAUD,GAAG;AAAE,MAAAH,EAAgB,GAAGG,GAAGC,EAAED,CAAC,CAAC;AAAA,IAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiB,GAAG,OAAO,0BAA0BC,CAAC,CAAC,IAAI2a,GAAU,OAAO3a,CAAC,CAAC,EAAE,QAAQ,SAAUD,GAAG;AAAE,aAAO,eAAe,GAAGA,GAAG,OAAO,yBAAyBC,GAAGD,CAAC,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AAAE,SAAO;AAAG;AACzb,IAAC8a,KAAW,SAAkB1a,GAAQ8E,GAAO;AAC9C,MAAI3H,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA,GAC9E;AAAA,IACF,WAAA8C;AAAA,EACJ,IAAMD,GACA;AAAA,IACF,MAAAmW,IAAO;AAAA,EACX,IAAMhZ;AACJ,MAAK8C,GAGL;AAAA,IAAIkW,MAAS,YACXA,IAAOxZ,EAAM,WAAWsD,CAAS,IAAI,UAAU,WAE7CkW,MAAS,UACXA,IAAOxZ,EAAM,WAAWsD,CAAS,IAAI,WAAW;AAElD,QAAI;AAAA,MACF,QAAA+F;AAAA,MACA,OAAAC;AAAA,IACJ,IAAMhG,GACAzD,IAAQ2Z,MAAS,WAAWnQ,IAASC;AACzC,IAAA6I,EAAW,aAAa9O,GAAQ;AAAA,MAC9B,CAACmW,MAAS,WAAW,WAAW,OAAO,GAAGsE,GAAgBA,GAAgB,CAAA,GAAIje,CAAK,GAAGsI,CAAK;AAAA,IAC/F,CAAG;AAAA;AACH,GAEI6V,KAAe,CAAC3a,GAAQ8E,MAAU;AACpC,MAAI;AAAA,IACF,WAAA7E;AAAA,EACJ,IAAMD,GACA4a,IAAW,CAAA,GACXC,IAAW,CAAA;AACf,MAAK5a,GAGL;AAAA,aAAS6a,KAAKhW;AACZ,OAAIgW,MAAM,YAAYhW,EAAM,UAAU,QAAQ,CAACrI,EAAM,OAAOqI,EAAM,QAAQ7E,EAAU,MAAM,KAAK6a,MAAM,WAAWhW,EAAM,SAAS,QAAQ,CAACrI,EAAM,OAAOqI,EAAM,OAAO7E,EAAU,KAAK,KAAK6a,MAAM,YAAYA,MAAM,WAAWhW,EAAMgW,CAAC,MAAM7a,EAAU6a,CAAC,OAC/OF,EAASE,CAAC,IAAI7a,EAAU6a,CAAC,GACzBD,EAASC,CAAC,IAAIhW,EAAMgW,CAAC;AAGzB,IAAI,OAAO,KAAKF,CAAQ,EAAE,SAAS,KACjC5a,EAAO,MAAM;AAAA,MACX,MAAM;AAAA,MACN,YAAY4a;AAAA,MACZ,eAAeC;AAAA,IACrB,CAAK;AAAA;AAEL,GAEIE,KAAc,SAAqB/a,GAAQ6E,GAAO;AACpD,MAAI1H,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,EAAAiK,EAAO,mBAAmBpH,GAAQ,MAAM;AACtC,QAAI;AAAA,MACF,SAAAiY,IAAU;AAAA,MACV,OAAAtJ,IAAQ;AAAA,MACR,MAAAiD,IAAO;AAAA,MACP,YAAAoH,IAAa;AAAA,IACnB,IAAQ7b,GACA;AAAA,MACF,IAAAqM;AAAA,MACA,OAAAgF;AAAA,MACA,QAAA+L;AAAA,IACN,IAAQpd;AAIJ,QAHIiD,EAAK,OAAOyE,CAAK,MACnBA,IAAQ,CAACA,CAAK,IAEZA,EAAM,WAAW,GAGrB;AAAA,UAAI,CAAC3E,CAAI,IAAI2E;AAUb,UATK2E,MACHA,IAAK2B,GAAyBnL,CAAM,GAChCua,MAAW,OACbA,IAAS,MAGTA,KAAU,SACZA,IAAS,KAEP5d,EAAM,QAAQ6M,CAAE;AAMlB,YALKyO,MACHzO,IAAKpC,EAAO,YAAYpH,GAAQwJ,GAAI;AAAA,UAClC,OAAAmF;AAAA,QACV,CAAS,IAEChS,EAAM,YAAY6M,CAAE;AACtB,UAAAA,IAAKA,EAAG;AAAA,aACH;AACL,cAAI,CAAA,EAAGtD,CAAG,IAAIvJ,EAAM,MAAM6M,CAAE,GACxB8M,IAAWlP,EAAO,SAASpH,GAAQkG,CAAG;AAC1C,UAAA4I,EAAW,OAAO9O,GAAQ;AAAA,YACxB,IAAAwJ;AAAA,UACV,CAAS,GACDA,IAAK8M,EAAS,MAAK;AAAA,QACrB;AAEF,UAAI7Z,EAAM,QAAQ+M,CAAE,GAAG;AACrB,QAAIgF,KAAS,SACPpN,EAAK,OAAOlB,CAAI,IAClBsO,IAAQ,CAAA1Q,MAAKsD,EAAK,OAAOtD,CAAC,IACjBkC,EAAO,SAASE,CAAI,IAC7BsO,IAAQ,CAAA1Q,MAAKsD,EAAK,OAAOtD,CAAC,KAAKsJ,EAAO,SAASpH,GAAQlC,CAAC,IAExD0Q,IAAQ,CAAA1Q,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC;AAGjE,YAAI,CAAC+J,CAAK,IAAIT,EAAO,MAAMpH,GAAQ;AAAA,UACjC,IAAIwJ,EAAG;AAAA,UACP,OAAAgF;AAAA,UACA,MAAAoD;AAAA,UACA,OAAAjD;AAAA,QACR,CAAO;AACD,YAAI9G,GAAO;AACT,cAAI,CAAA,EAAGuD,CAAS,IAAIvD,GAChBkO,IAAU3O,EAAO,QAAQpH,GAAQoL,CAAS,GAC1C4P,IAAU5T,EAAO,MAAMpH,GAAQwJ,GAAI4B,CAAS;AAChD,UAAA0D,EAAW,WAAW9O,GAAQ;AAAA,YAC5B,IAAAwJ;AAAA,YACA,OAAAgF;AAAA,YACA,MAAAoD;AAAA,YACA,OAAAjD;AAAA,UACV,CAAS;AACD,cAAItS,IAAO0Z,EAAQ,MAAK;AACxB,UAAAvM,IAAKwR,IAAU1e,EAAK,KAAKD,CAAI,IAAIA;AAAA,QACnC;AACE;AAAA,MAEJ;AACA,UAAI0M,IAAazM,EAAK,OAAOkN,CAAE,GAC3BnJ,IAAQmJ,EAAGA,EAAG,SAAS,CAAC;AAC5B,UAAI,GAACmF,KAASvH,EAAO,KAAKpH,GAAQ;AAAA,QAChC,IAAI+I;AAAA,MACV,CAAK,IAGD;AAAA,YAAIiQ,GAAY;AAGd,cAAIiC,IAAa,CAAA,GACbzL,IAAgBlT,EAAK,OAAOyM,CAAU;AAC1C,UAAAsG,GAAgBrP,GAAQ,MAAM;AAC5B,gBAAIkb,IAAQ,WAAiB;AAC3B,kBAAI7e,IAAO0M,EAAW,OAAO1I,CAAK;AAClC,cAAAA;AACA,kBAAInE,IAAK;AAAA,gBACP,MAAM;AAAA,gBACN,MAAAG;AAAA,gBACA,MAAMoE;AAAA,cAClB;AACU,cAAAT,EAAO,MAAM9D,CAAE,GACfsN,IAAKlN,EAAK,KAAKkN,CAAE,GACjByR,EAAW,KAAK/e,CAAE,GACbkF,EAAK,SAGRoO,EAAc,KAAK,GAAG,MAAM,KAAKpP,EAAK,MAAMK,CAAK,GAAG,CAAA2H,MAAQ;AAC1D,oBAAI,CAAA,EAAG9J,CAAC,IAAI8J;AACZ,uBAAO/L,EAAK,OAAOiC,CAAC;AAAA,cACtB,CAAC,CAAC,IALFkR,EAAc,KAAKnT,CAAI;AAAA,YAO3B;AACA,qBAASoE,KAASoE;AAChB,cAAAqW,EAAK;AAAA,UAET,GAAG,MAAM;AACP,YAAA3L,GAAiBvP,GAAQwP,GAAe,CAAAlR,MAAK;AAC3C,kBAAImD,IAAUnD;AACd,uBAASpC,KAAM+e;AACb,oBAAI3e,EAAK,0BAA0BJ,CAAE,MACnCuF,IAAUnF,EAAK,UAAUmF,GAASvF,CAAE,GAChC,CAACuF;AACH,yBAAO;AAIb,qBAAOA;AAAA,YACT,CAAC;AAAA,UACH,CAAC;AAAA,QACH;AACE,mBAASV,KAAU8D,GAAO;AACxB,gBAAIvE,IAAQyI,EAAW,OAAO1I,CAAK;AACnC,YAAAA,KACAL,EAAO,MAAM;AAAA,cACX,MAAM;AAAA,cACN,MAAMM;AAAA,cACN,MAAMS;AAAA,YAChB,CAAS,GACDyI,IAAKlN,EAAK,KAAKkN,CAAE;AAAA,UACnB;AAGF,YADAA,IAAKlN,EAAK,SAASkN,CAAE,GACjB+Q,GAAQ;AACV,cAAI/d,IAAQ4K,EAAO,IAAIpH,GAAQwJ,CAAE;AACjC,UAAIhN,KACFsS,EAAW,OAAO9O,GAAQxD,CAAK;AAAA,QAEnC;AAAA;AAAA;AAAA,EACF,CAAC;AACH,GAEI2e,KAAY,SAAmBnb,GAAQ;AACzC,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,EAAAiK,EAAO,mBAAmBpH,GAAQ,MAAM;AACtC,QAAI;AAAA,MACF,IAAAwJ,IAAKxJ,EAAO;AAAA,MACZ,MAAA4R,IAAO;AAAA,MACP,OAAAjD,IAAQ;AAAA,IACd,IAAQxR,GACA;AAAA,MACF,OAAAqR;AAAA,IACN,IAAQrR;AAIJ,QAHIqR,KAAS,SACXA,IAAQlS,EAAK,OAAOkN,CAAE,IAAI4B,GAAUpL,GAAQwJ,CAAE,IAAI,CAAA1L,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC,IAErG,EAAC0L,GAGL;AAAA,UAAIyL,IAAU7N,EAAO,MAAMpH,GAAQ;AAAA,QACjC,IAAAwJ;AAAA,QACA,OAAAgF;AAAA,QACA,MAAAoD;AAAA,QACA,OAAAjD;AAAA,MACN,CAAK,GACGqH,IAAW,MAAM,KAAKf,GAAS,CAAA7M,MAAQ;AACzC,YAAI,CAAA,EAAG9J,CAAC,IAAI8J;AACZ,eAAOhB,EAAO,QAAQpH,GAAQ1B,CAAC;AAAA,MACjC,CAAC;AACD,eAASyX,KAAWC,GAAU;AAC5B,YAAI3Z,IAAO0Z,EAAQ,MAAK;AACxB,YAAI1Z,EAAK,SAAS;AAChB,gBAAM,IAAI,MAAM,+BAA+B,OAAOA,GAAM,4CAA4C,CAAC;AAE3G,YAAI+e,IAAkBhU,EAAO,KAAKpH,GAAQ1D,EAAK,OAAOD,CAAI,CAAC,GACvD,CAAC8D,GAAQ4I,CAAU,IAAIqS,GACvB/a,IAAQhE,EAAKA,EAAK,SAAS,CAAC,GAC5B;AAAA,UACF,QAAAyO;AAAA,QACR,IAAU3K,EAAO;AACX,YAAI2K,MAAW,GAAG;AAChB,cAAIuQ,IAAS/e,EAAK,KAAKyM,CAAU;AACjC,UAAA+F,EAAW,UAAU9O,GAAQ;AAAA,YAC3B,IAAI3D;AAAA,YACJ,IAAIgf;AAAA,YACJ,OAAA1M;AAAA,UACV,CAAS,GACDG,EAAW,YAAY9O,GAAQ;AAAA,YAC7B,IAAI+I;AAAA,YACJ,OAAA4F;AAAA,UACV,CAAS;AAAA,QACH,WAAWtO,MAAU;AACnB,UAAAyO,EAAW,UAAU9O,GAAQ;AAAA,YAC3B,IAAI3D;AAAA,YACJ,IAAI0M;AAAA,YACJ,OAAA4F;AAAA,UACV,CAAS;AAAA,iBACQtO,MAAUyK,IAAS,GAAG;AAC/B,cAAIwQ,IAAUhf,EAAK,KAAKyM,CAAU;AAClC,UAAA+F,EAAW,UAAU9O,GAAQ;AAAA,YAC3B,IAAI3D;AAAA,YACJ,IAAIif;AAAA,YACJ,OAAA3M;AAAA,UACV,CAAS;AAAA,QACH,OAAO;AACL,cAAI4M,IAAYjf,EAAK,KAAKD,CAAI,GAC1Bmf,IAAWlf,EAAK,KAAKyM,CAAU;AACnC,UAAA+F,EAAW,WAAW9O,GAAQ;AAAA,YAC5B,IAAIub;AAAA,YACJ,OAAA5M;AAAA,UACV,CAAS,GACDG,EAAW,UAAU9O,GAAQ;AAAA,YAC3B,IAAI3D;AAAA,YACJ,IAAImf;AAAA,YACJ,OAAA7M;AAAA,UACV,CAAS;AAAA,QACH;AAAA,MACF;AAAA;AAAA,EACF,CAAC;AACH,GAEI8M,KAAY,CAAC,MAAM,GACrBC,KAAa,CAAC,UAAU,GACtBC,KAAqB,CAAC3b,GAAQE,MAAS;AACzC,MAAImH,EAAQ,UAAUnH,CAAI,GAAG;AAC3B,QAAI6E,IAAU7E;AACd,WAAIkH,EAAO,OAAOpH,GAAQE,CAAI,IACrB,KACE6E,EAAQ,SAAS,WAAW,IAC9B4W,GAAmB3b,GAAQ+E,EAAQ,SAAS,CAAC,CAAC,IAE9C;AAAA,EAEX,MAAO,QAAI,CAAAqC,EAAO,SAASlH,CAAI;AAKjC,GACI0b,KAAa,SAAoB5b,GAAQ;AAC3C,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,EAAAiK,EAAO,mBAAmBpH,GAAQ,MAAM;AACtC,QAAI;AAAA,MACF,OAAAwO;AAAA,MACA,IAAAhF,IAAKxJ,EAAO;AAAA,IAClB,IAAQ7C,GACA;AAAA,MACF,SAAA8a,IAAU;AAAA,MACV,OAAAtJ,IAAQ;AAAA,MACR,MAAAiD,IAAO;AAAA,IACb,IAAQzU;AACJ,QAAKqM,GAGL;AAAA,UAAIgF,KAAS;AACX,YAAIlS,EAAK,OAAOkN,CAAE,GAAG;AACnB,cAAI,CAACrJ,CAAM,IAAIiH,EAAO,OAAOpH,GAAQwJ,CAAE;AACvC,UAAAgF,IAAQ,CAAA1Q,MAAKqC,EAAO,SAAS,SAASrC,CAAC;AAAA,QACzC;AACE,UAAA0Q,IAAQ,CAAA1Q,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC;AAQjE,UALI,CAACma,KAAWtb,EAAM,QAAQ6M,CAAE,MAC9BA,IAAKpC,EAAO,YAAYpH,GAAQwJ,GAAI;AAAA,QAClC,OAAAmF;AAAA,MACR,CAAO,IAEChS,EAAM,QAAQ6M,CAAE;AAClB,YAAI7M,EAAM,YAAY6M,CAAE;AACtB,UAAAA,IAAKA,EAAG;AAAA,aACH;AACL,cAAI,CAAA,EAAGtD,CAAG,IAAIvJ,EAAM,MAAM6M,CAAE,GACxB8M,IAAWlP,EAAO,SAASpH,GAAQkG,CAAG;AAC1C,UAAA4I,EAAW,OAAO9O,GAAQ;AAAA,YACxB,IAAAwJ;AAAA,UACV,CAAS,GACDA,IAAK8M,EAAS,MAAK,GACfnZ,EAAQ,MAAM,QAChB2R,EAAW,OAAO9O,GAAQwJ,CAAE;AAAA,QAEhC;AAEF,UAAI,CAACrN,CAAO,IAAIiL,EAAO,MAAMpH,GAAQ;AAAA,QACnC,IAAAwJ;AAAA,QACA,OAAAgF;AAAA,QACA,OAAAG;AAAA,QACA,MAAAiD;AAAA,MACN,CAAK,GACG3Q,IAAOmG,EAAO,SAASpH,GAAQ;AAAA,QACjC,IAAAwJ;AAAA,QACA,OAAAgF;AAAA,QACA,OAAAG;AAAA,QACA,MAAAiD;AAAA,MACN,CAAK;AACD,UAAI,GAACzV,KAAW,CAAC8E,IAGjB;AAAA,YAAI,CAACf,GAAM7D,CAAI,IAAIF,GACf,CAACwY,GAAU3T,CAAQ,IAAIC;AAC3B,YAAI,EAAA5E,EAAK,WAAW,KAAK2E,EAAS,WAAW,IAG7C;AAAA,cAAIS,IAAUnF,EAAK,KAAK0E,CAAQ,GAC5B6a,IAAavf,EAAK,OAAOD,GAAM2E,CAAQ,GACvC8a,IAAoBxf,EAAK,UAAUD,GAAM2E,CAAQ,GACjDkP,IAAS,MAAM,KAAK9I,EAAO,OAAOpH,GAAQ;AAAA,YAC5C,IAAI3D;AAAA,UACV,CAAK,GAAG,CAAA+L,MAAQ;AACV,gBAAI,CAACtK,CAAC,IAAIsK;AACV,mBAAOtK;AAAA,UACT,CAAC,EAAE,MAAM+d,EAAW,MAAM,EAAE,MAAM,GAAG,EAAE,GAGnCE,IAAgB3U,EAAO,MAAMpH,GAAQ;AAAA,YACvC,IAAI3D;AAAA,YACJ,MAAM;AAAA,YACN,OAAO,CAAAyB,MAAKoS,EAAO,SAASpS,CAAC,KAAK6d,GAAmB3b,GAAQlC,CAAC;AAAA,UACpE,CAAK,GACGke,IAAWD,KAAiB3U,EAAO,QAAQpH,GAAQ+b,EAAc,CAAC,CAAC,GACnE3Y,GACA3E;AAGJ,cAAI2C,EAAK,OAAOlB,CAAI,KAAKkB,EAAK,OAAOuT,CAAQ,GAAG;AAC9C,gBAAIjO,IAAOhB,GAAyBxF,GAAMub,EAAS;AACnD,YAAAhd,IAAWkW,EAAS,KAAK,QACzBvR,IAAasD;AAAA,UACf,WAAWW,EAAQ,UAAUnH,CAAI,KAAKmH,EAAQ,UAAUsN,CAAQ,GAAG;AACjE,gBAAIjO,IAAOhB,GAAyBxF,GAAMwb,EAAU;AACpD,YAAAjd,IAAWkW,EAAS,SAAS,QAC7BvR,IAAasD;AAAA,UACf;AACE,kBAAM,IAAI,MAAM,kCAAkC,OAAOrK,GAAM,+DAA+D,EAAE,OAAOgF,EAAS,UAAUnB,CAAI,GAAG,GAAG,EAAE,OAAOmB,EAAS,UAAUsT,CAAQ,CAAC,CAAC;AAI5M,UAAKmH,KACHhN,EAAW,UAAU9O,GAAQ;AAAA,YAC3B,IAAI3D;AAAA,YACJ,IAAIoF;AAAA,YACJ,OAAAkN;AAAA,UACR,CAAO,GAICqN,KACFlN,EAAW,YAAY9O,GAAQ;AAAA,YAC7B,IAAIgc,EAAS;AAAA,YACb,OAAArN;AAAA,UACR,CAAO,GAOCtH,EAAQ,UAAUsN,CAAQ,KAAKvN,EAAO,QAAQpH,GAAQ2U,CAAQ,KAAKvT,EAAK,OAAOuT,CAAQ,KAAKA,EAAS,SAAS,MAAM3T,EAASA,EAAS,SAAS,CAAC,MAAM,IACxJ8N,EAAW,YAAY9O,GAAQ;AAAA,YAC7B,IAAIgB;AAAA,YACJ,OAAA2N;AAAA,UACR,CAAO,IAED3O,EAAO,MAAM;AAAA,YACX,MAAM;AAAA,YACN,MAAMyB;AAAA,YACN,UAAAhD;AAAA,YACA,YAAA2E;AAAA,UACR,CAAO,GAEC4Y,KACFA,EAAS,MAAK;AAAA;AAAA;AAAA;AAAA,EAElB,CAAC;AACH,GAEIC,KAAY,CAACjc,GAAQ7C,MAAY;AACnC,EAAAiK,EAAO,mBAAmBpH,GAAQ,MAAM;AACtC,QAAI;AAAA,MACF,IAAA2I;AAAA,MACA,IAAAa,IAAKxJ,EAAO;AAAA,MACZ,MAAA4R,IAAO;AAAA,MACP,OAAAjD,IAAQ;AAAA,IACd,IAAQxR,GACA;AAAA,MACF,OAAAqR;AAAA,IACN,IAAQrR;AACJ,QAAKqM,GAGL;AAAA,MAAIgF,KAAS,SACXA,IAAQlS,EAAK,OAAOkN,CAAE,IAAI4B,GAAUpL,GAAQwJ,CAAE,IAAI,CAAA1L,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC;AAEzG,UAAIoe,IAAQ9U,EAAO,QAAQpH,GAAQ2I,CAAE,GACjCwT,IAAU/U,EAAO,MAAMpH,GAAQ;AAAA,QACjC,IAAAwJ;AAAA,QACA,OAAAgF;AAAA,QACA,MAAAoD;AAAA,QACA,OAAAjD;AAAA,MACN,CAAK,GACGqH,IAAW,MAAM,KAAKmG,GAAS,CAAA/T,MAAQ;AACzC,YAAI,CAAA,EAAG9J,CAAC,IAAI8J;AACZ,eAAOhB,EAAO,QAAQpH,GAAQ1B,CAAC;AAAA,MACjC,CAAC;AACD,eAASyX,KAAWC,GAAU;AAC5B,YAAI3Z,IAAO0Z,EAAQ,MAAK,GACpBtU,IAAUya,EAAM;AACpB,QAAI7f,EAAK,WAAW,KAClB2D,EAAO,MAAM;AAAA,UACX,MAAM;AAAA,UACN,MAAA3D;AAAA,UACA,SAAAoF;AAAA,QACV,CAAS,GAECya,EAAM,WAAW5f,EAAK,UAAUmF,GAASpF,CAAI,KAAKC,EAAK,QAAQmF,GAASpF,CAAI,MAI9E6f,EAAM,UAAU5f,EAAK,KAAK4f,EAAM,OAAO;AAAA,MAE3C;AACA,MAAAA,EAAM,MAAK;AAAA;AAAA,EACb,CAAC;AACH,GAEIE,KAAc,SAAqBpc,GAAQ;AAC7C,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,EAAAiK,EAAO,mBAAmBpH,GAAQ,MAAM;AACtC,QAAI;AAAA,MACF,SAAAiY,IAAU;AAAA,MACV,OAAAtJ,IAAQ;AAAA,MACR,MAAAiD,IAAO;AAAA,IACb,IAAQzU,GACA;AAAA,MACF,IAAAqM,IAAKxJ,EAAO;AAAA,MACZ,OAAAwO;AAAA,IACN,IAAQrR;AACJ,QAAKqM,GAGL;AAAA,MAAIgF,KAAS,SACXA,IAAQlS,EAAK,OAAOkN,CAAE,IAAI4B,GAAUpL,GAAQwJ,CAAE,IAAI,CAAA1L,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC,IAErG,CAACma,KAAWtb,EAAM,QAAQ6M,CAAE,MAC9BA,IAAKpC,EAAO,YAAYpH,GAAQwJ,GAAI;AAAA,QAClC,OAAAmF;AAAA,MACR,CAAO;AAEH,UAAI0N,IAASjV,EAAO,MAAMpH,GAAQ;AAAA,QAChC,IAAAwJ;AAAA,QACA,OAAAgF;AAAA,QACA,MAAAoD;AAAA,QACA,OAAAjD;AAAA,MACN,CAAK,GACGqH,IAAW,MAAM,KAAKqG,GAAQ,CAAAjU,MAAQ;AACxC,YAAI,CAAA,EAAG9J,CAAC,IAAI8J;AACZ,eAAOhB,EAAO,QAAQpH,GAAQ1B,CAAC;AAAA,MACjC,CAAC;AACD,eAASyX,KAAWC,GAAU;AAC5B,YAAI3Z,IAAO0Z,EAAQ,MAAK;AACxB,YAAI1Z,GAAM;AACR,cAAI,CAAC6D,CAAI,IAAIkH,EAAO,KAAKpH,GAAQ3D,CAAI;AACrC,UAAA2D,EAAO,MAAM;AAAA,YACX,MAAM;AAAA,YACN,MAAA3D;AAAA,YACA,MAAA6D;AAAA,UACV,CAAS;AAAA,QACH;AAAA,MACF;AAAA;AAAA,EACF,CAAC;AACH,GAEIoc,KAAW,SAAkBtc,GAAQ8E,GAAO;AAC9C,MAAI3H,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,EAAAiK,EAAO,mBAAmBpH,GAAQ,MAAM;AACtC,QAAI;AAAA,MACF,OAAAwO;AAAA,MACA,IAAAhF,IAAKxJ,EAAO;AAAA,MACZ,SAAAuc;AAAA,MACA,OAAAC;AAAA,IACN,IAAQrf,GACA;AAAA,MACF,SAAA8a,IAAU;AAAA,MACV,MAAArG,IAAO;AAAA,MACP,OAAA6K,IAAQ;AAAA,MACR,OAAA9N,IAAQ;AAAA,IACd,IAAQxR;AACJ,QAAKqM,GAWL;AAAA,UARIgF,KAAS,SACXA,IAAQlS,EAAK,OAAOkN,CAAE,IAAI4B,GAAUpL,GAAQwJ,CAAE,IAAI,CAAA1L,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC,IAErG,CAACma,KAAWtb,EAAM,QAAQ6M,CAAE,MAC9BA,IAAKpC,EAAO,YAAYpH,GAAQwJ,GAAI;AAAA,QAClC,OAAAmF;AAAA,MACR,CAAO,IAEC8N,KAAS9f,EAAM,QAAQ6M,CAAE,GAAG;AAC9B,YAAI7M,EAAM,YAAY6M,CAAE,KAAKpC,EAAO,KAAKpH,GAAQwJ,EAAG,MAAM,EAAE,CAAC,EAAE,KAAK,SAAS;AAG3E;AAEF,YAAI2N,IAAW/P,EAAO,SAASpH,GAAQwJ,GAAI;AAAA,UACzC,UAAU;AAAA,QAClB,CAAO,GACG,CAACjD,GAAOL,CAAG,IAAIvJ,EAAM,MAAM6M,CAAE,GAC7BkT,IAAY9K,MAAS,WAAW,WAAW,WAC3C+K,IAAiBvV,EAAO,MAAMpH,GAAQkG,GAAKA,EAAI,IAAI;AACvD,QAAA4I,EAAW,WAAW9O,GAAQ;AAAA,UAC5B,IAAIkG;AAAA,UACJ,OAAAsI;AAAA,UACA,MAAMkO;AAAA,UACN,OAAA/N;AAAA,UACA,QAAQ,CAACgO;AAAA,QACjB,CAAO;AACD,YAAIC,IAAqBxV,EAAO,QAAQpH,GAAQuG,GAAOA,EAAM,IAAI;AACjE,QAAAuI,EAAW,WAAW9O,GAAQ;AAAA,UAC5B,IAAIuG;AAAA,UACJ,OAAAiI;AAAA,UACA,MAAMkO;AAAA,UACN,OAAA/N;AAAA,UACA,QAAQ,CAACiO;AAAA,QACjB,CAAO,GACDpT,IAAK2N,EAAS,MAAK,GACfha,EAAQ,MAAM,QAChB2R,EAAW,OAAO9O,GAAQwJ,CAAE;AAAA,MAEhC;AACA,MAAK+S,MACHA,IAAU,CAACM,GAAMC,MAAaD,MAASC;AAEzC,eAAS,CAAC5c,GAAM7D,CAAI,KAAK+K,EAAO,MAAMpH,GAAQ;AAAA,QAC5C,IAAAwJ;AAAA,QACA,OAAAgF;AAAA,QACA,MAAAoD;AAAA,QACA,OAAAjD;AAAA,MACN,CAAK,GAAG;AACF,YAAIvL,IAAa,CAAA,GAEbC,IAAgB,CAAA;AAEpB,YAAIhH,EAAK,WAAW,GAGpB;AAAA,cAAI0gB,IAAa;AACjB,mBAASjC,KAAKhW;AACZ,YAAIgW,MAAM,cAAcA,MAAM,UAG1ByB,EAAQzX,EAAMgW,CAAC,GAAG5a,EAAK4a,CAAC,CAAC,MAC3BiC,IAAa,IAET7c,EAAK,eAAe4a,CAAC,MAAG1X,EAAW0X,CAAC,IAAI5a,EAAK4a,CAAC,IAE9C0B,IACE1X,EAAMgW,CAAC,KAAK,SAAMzX,EAAcyX,CAAC,IAAI0B,EAAMtc,EAAK4a,CAAC,GAAGhW,EAAMgW,CAAC,CAAC,KAE5DhW,EAAMgW,CAAC,KAAK,SAAMzX,EAAcyX,CAAC,IAAIhW,EAAMgW,CAAC;AAItD,UAAIiC,KACF/c,EAAO,MAAM;AAAA,YACX,MAAM;AAAA,YACN,MAAA3D;AAAA,YACA,YAAA+G;AAAA,YACA,eAAAC;AAAA,UACV,CAAS;AAAA;AAAA,MAEL;AAAA;AAAA,EACF,CAAC;AACH,GAKI2Z,KAAc,CAAChd,GAAQ+F,MAAU;AACnC,MAAIpJ,EAAM,YAAYoJ,CAAK;AACzB,WAAOA,EAAM;AAEb,MAAI,CAAA,EAAGG,CAAG,IAAIvJ,EAAM,MAAMoJ,CAAK,GAC3BuQ,IAAWlP,EAAO,SAASpH,GAAQkG,CAAG;AAC1C,SAAA4I,EAAW,OAAO9O,GAAQ;AAAA,IACxB,IAAI+F;AAAA,EACV,CAAK,GACMuQ,EAAS,MAAK;AAEzB,GACI2G,KAAa,SAAoBjd,GAAQ;AAC3C,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,EAAAiK,EAAO,mBAAmBpH,GAAQ,MAAM;AACtC,QAAI;AAAA,MACF,MAAA4R,IAAO;AAAA,MACP,OAAAjD,IAAQ;AAAA,IACd,IAAQxR,GACA;AAAA,MACF,OAAAqR;AAAA,MACA,IAAAhF,IAAKxJ,EAAO;AAAA,MACZ,QAAAkd,IAAS;AAAA,MACT,QAAAC,IAAS;AAAA,IACf,IAAQhgB;AASJ,QARIqR,KAAS,SACXA,IAAQ,CAAA1Q,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC,IAE3DnB,EAAM,QAAQ6M,CAAE,MAClBA,IAAKwT,GAAYhd,GAAQwJ,CAAE,IAIzBlN,EAAK,OAAOkN,CAAE,GAAG;AACnB,UAAInN,IAAOmN,GACPhN,IAAQ4K,EAAO,MAAMpH,GAAQ3D,CAAI,GACjC,CAAC8D,CAAM,IAAIiH,EAAO,OAAOpH,GAAQ3D,CAAI;AACzC,MAAAmS,IAAQ,CAAA1Q,MAAKA,MAAMqC,GACnB+c,IAAS1gB,EAAM,KAAK,SAASH,EAAK,SAAS,GAC3CmN,IAAKhN,GACL2gB,IAAS;AAAA,IACX;AACA,QAAK3T,GAGL;AAAA,UAAI4T,IAAYhW,EAAO,SAASpH,GAAQwJ,GAAI;AAAA,QAC1C,UAAU;AAAA,MAChB,CAAK,GACG6T;AACJ,UAAI;AACF,YAAI,CAACC,CAAO,IAAIlW,EAAO,MAAMpH,GAAQ;AAAA,UACnC,IAAAwJ;AAAA,UACA,OAAAgF;AAAA,UACA,MAAAoD;AAAA,UACA,OAAAjD;AAAA,QACR,CAAO;AACD,YAAI,CAAC2O;AACH;AAEF,YAAIC,IAAYnW,EAAO,KAAKpH,GAAQ;AAAA,UAClC,IAAAwJ;AAAA,UACA,MAAM;AAAA,QACd,CAAO,GACGgU,IAAQ;AACZ,YAAI,CAAC7O,KAAS4O,GAAW;AACvB,cAAI,CAACE,GAAUtF,CAAQ,IAAIoF;AAC3B,cAAIlW,EAAQ,UAAUoW,CAAQ,KAAKzd,EAAO,SAASyd,CAAQ,GAAG;AAC5D,gBAAI9c,IAAQyG,EAAO,MAAMpH,GAAQmY,CAAQ;AACzC,gBAAI,CAACxX,GAAO;AACV,kBAAIH,IAAO;AAAA,gBACT,MAAM;AAAA,cACpB,GACgBkd,IAAYphB,EAAK,KAAK6b,CAAQ;AAClC,cAAArJ,EAAW,YAAY9O,GAAQQ,GAAM;AAAA,gBACnC,IAAIkd;AAAA,gBACJ,OAAA/O;AAAA,cACd,CAAa,GACDhO,IAAQyG,EAAO,MAAMpH,GAAQ0d,CAAS;AAAA,YACxC;AACA,YAAAlU,IAAK7I,GACLwc,IAAS;AAAA,UACX;AACA,cAAIQ,IAAgBnU,EAAG,KAAK,SAAS2O,EAAS;AAC9C,UAAA+E,IAASS,IAAgB,GACzBR,IAAS;AAAA,QACX;AACA,QAAAE,IAAWjW,EAAO,SAASpH,GAAQwJ,CAAE;AACrC,YAAI0M,IAAQ1M,EAAG,KAAK,SAAS0T,GACzB,CAAA,EAAGU,CAAW,IAAIN,GAClBO,IAAarU,EAAG,KAAK,MAAM,GAAG0M,CAAK,GACnCzX,IAAWye,MAAW,IAAI1T,EAAG,SAASA,EAAG,KAAK0M,CAAK,IAAIsH;AAC3D,iBAAS,CAACtd,GAAMI,CAAK,KAAK8G,EAAO,OAAOpH,GAAQ;AAAA,UAC9C,IAAI6d;AAAA,UACJ,SAAS;AAAA,UACT,OAAAlP;AAAA,QACR,CAAO,GAAG;AACF,cAAI8N,IAAQ;AACZ,cAAInc,EAAM,SAASsd,EAAY,UAAUtd,EAAM,WAAW,KAAK,CAACqO,KAAStH,EAAQ,UAAUnH,CAAI,KAAKkH,EAAO,OAAOpH,GAAQE,CAAI;AAC5H;AAEF,cAAIU,IAASwc,EAAU,SACnBhJ,IAAQhN,EAAO,MAAMpH,GAAQY,GAAQN,CAAK;AAC9C,cAAI6c,KAAU,CAACC,KAAa,CAAChW,EAAO,OAAOpH,GAAQY,GAAQN,CAAK,GAAG;AACjE,YAAAmc,IAAQ;AACR,gBAAIrZ,IAAahD,EAAK,aAAaF,CAAI;AACvC,YAAAF,EAAO,MAAM;AAAA,cACX,MAAM;AAAA,cACN,MAAMM;AAAA,cACN,UAAA7B;AAAA,cACA,YAAA2E;AAAA,YACZ,CAAW;AAAA,UACH;AACA,UAAA3E,IAAW6B,EAAMA,EAAM,SAAS,CAAC,KAAKmc,KAASrI,IAAQ,IAAI;AAAA,QAC7D;AACA,YAAIjX,EAAQ,MAAM,MAAM;AACtB,cAAImE,IAAU+b,EAAS,WAAWjW,EAAO,IAAIpH,GAAQ,EAAE;AACvD,UAAA8O,EAAW,OAAO9O,GAAQsB,CAAO;AAAA,QACnC;AAAA,MACF,UAAC;AACC,YAAIwc;AACJ,QAAAV,EAAU,MAAK,IACdU,IAAYT,OAAc,QAAQS,MAAc,UAAUA,EAAU,MAAK;AAAA,MAC5E;AAAA;AAAA,EACF,CAAC;AACH,GAEIC,KAAa,SAAoB/d,GAAQ8E,GAAO;AAClD,MAAI3H,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,EAAK,MAAM,QAAQ2H,CAAK,MACtBA,IAAQ,CAACA,CAAK;AAEhB,MAAIpF,IAAM,CAAA;AACV,WAASF,KAAOsF;AACd,IAAApF,EAAIF,CAAG,IAAI;AAEb,EAAAsP,EAAW,SAAS9O,GAAQN,GAAKvC,CAAO;AAC1C,GAEI6gB,KAAc,SAAqBhe,GAAQ;AAC7C,MAAI7C,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,EAAAiK,EAAO,mBAAmBpH,GAAQ,MAAM;AACtC,QAAI;AAAA,MACF,MAAA4R,IAAO;AAAA,MACP,OAAA6K,IAAQ;AAAA,MACR,OAAA9N,IAAQ;AAAA,IACd,IAAQxR,GACA;AAAA,MACF,IAAAqM,IAAKxJ,EAAO;AAAA,MACZ,OAAAwO;AAAA,IACN,IAAQrR;AACJ,QAAKqM,GAGL;AAAA,MAAIgF,KAAS,SACXA,IAAQlS,EAAK,OAAOkN,CAAE,IAAI4B,GAAUpL,GAAQwJ,CAAE,IAAI,CAAA1L,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC,IAErGxB,EAAK,OAAOkN,CAAE,MAChBA,IAAKpC,EAAO,MAAMpH,GAAQwJ,CAAE;AAE9B,UAAI2N,IAAWxa,EAAM,QAAQ6M,CAAE,IAAIpC,EAAO,SAASpH,GAAQwJ,CAAE,IAAI,MAC7DyL,IAAU7N,EAAO,MAAMpH,GAAQ;AAAA,QACjC,IAAAwJ;AAAA,QACA,OAAAgF;AAAA,QACA,MAAAoD;AAAA,QACA,OAAAjD;AAAA,MACN,CAAK,GACGqH,IAAW,MAAM;AAAA,QAAKf;AAAA,QAAS,CAAA7M,MAAQ;AACzC,cAAI,CAAA,EAAG9J,CAAC,IAAI8J;AACZ,iBAAOhB,EAAO,QAAQpH,GAAQ1B,CAAC;AAAA,QACjC;AAAA;AAAA;AAAA;AAAA,MAIJ,EAAM,QAAO,GACL4c,IAAQ,WAAiB;AAC3B,YAAI7e,IAAO0Z,EAAQ,MAAK,GACpB,CAAC7V,CAAI,IAAIkH,EAAO,KAAKpH,GAAQ3D,CAAI,GACjC0J,IAAQqB,EAAO,MAAMpH,GAAQ3D,CAAI;AACrC,QAAIogB,KAAStF,MACXpR,IAAQpJ,EAAM,aAAawa,EAAS,SAASpR,CAAK,IAEpD+I,EAAW,UAAU9O,GAAQ;AAAA,UAC3B,IAAI+F;AAAA,UACJ,OAAO,CAAAjI,MAAKuJ,EAAQ,WAAWnH,CAAI,KAAKA,EAAK,SAAS,SAASpC,CAAC;AAAA,UAChE,OAAA6Q;AAAA,QACR,CAAO;AAAA,MACH;AACA,eAASoH,KAAWC;AAClB,QAAAkF,EAAK;AAEP,MAAI/D,KACFA,EAAS,MAAK;AAAA;AAAA,EAElB,CAAC;AACH;AAEA,SAAS8G,GAAQ,GAAGre,GAAG;AAAE,MAAIC,IAAI,OAAO,KAAK,CAAC;AAAG,MAAI,OAAO,uBAAuB;AAAE,QAAIb,IAAI,OAAO,sBAAsB,CAAC;AAAG,IAAAY,MAAMZ,IAAIA,EAAE,OAAO,SAAUY,GAAG;AAAE,aAAO,OAAO,yBAAyB,GAAGA,CAAC,EAAE;AAAA,IAAY,CAAC,IAAIC,EAAE,KAAK,MAAMA,GAAGb,CAAC;AAAA,EAAG;AAAE,SAAOa;AAAG;AAC9P,SAASqe,GAAc,GAAG;AAAE,WAASte,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AAAE,QAAIC,IAAY,UAAUD,CAAC,KAAnB,OAAuB,UAAUA,CAAC,IAAI,CAAA;AAAI,IAAAA,IAAI,IAAIqe,GAAQ,OAAOpe,CAAC,GAAG,EAAE,EAAE,QAAQ,SAAUD,GAAG;AAAE,MAAAH,EAAgB,GAAGG,GAAGC,EAAED,CAAC,CAAC;AAAA,IAAG,CAAC,IAAI,OAAO,4BAA4B,OAAO,iBAAiB,GAAG,OAAO,0BAA0BC,CAAC,CAAC,IAAIoe,GAAQ,OAAOpe,CAAC,CAAC,EAAE,QAAQ,SAAUD,GAAG;AAAE,aAAO,eAAe,GAAGA,GAAG,OAAO,yBAAyBC,GAAGD,CAAC,CAAC;AAAA,IAAG,CAAC;AAAA,EAAG;AAAE,SAAO;AAAG;AACnb,IAACue,KAAY,SAAmBne,GAAQ+E,GAAS;AAClD,MAAI5H,IAAU,UAAU,SAAS,KAAK,UAAU,CAAC,MAAM,SAAY,UAAU,CAAC,IAAI,CAAA;AAClF,EAAAiK,EAAO,mBAAmBpH,GAAQ,MAAM;AACtC,QAAI;AAAA,MACF,MAAA4R,IAAO;AAAA,MACP,OAAA6K,IAAQ;AAAA,MACR,OAAA9N,IAAQ;AAAA,IACd,IAAQxR,GACA;AAAA,MACF,OAAAqR;AAAA,MACA,IAAAhF,IAAKxJ,EAAO;AAAA,IAClB,IAAQ7C;AACJ,QAAKqM,GAYL;AAAA,UATIgF,KAAS,SACPlS,EAAK,OAAOkN,CAAE,IAChBgF,IAAQpD,GAAUpL,GAAQwJ,CAAE,IACnBxJ,EAAO,SAAS+E,CAAO,IAChCyJ,IAAQ,CAAA1Q,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,SAASpH,GAAQlC,CAAC,KAAKsD,EAAK,OAAOtD,CAAC,IAEhF0Q,IAAQ,CAAA1Q,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC,IAG7D2e,KAAS9f,EAAM,QAAQ6M,CAAE,GAAG;AAC9B,YAAI,CAACjD,GAAOL,CAAG,IAAIvJ,EAAM,MAAM6M,CAAE,GAC7B2N,IAAW/P,EAAO,SAASpH,GAAQwJ,GAAI;AAAA,UACzC,UAAU;AAAA,QAClB,CAAO;AACD,QAAAsF,EAAW,WAAW9O,GAAQ;AAAA,UAC5B,IAAIkG;AAAA,UACJ,OAAAsI;AAAA,UACA,OAAAG;AAAA,QACR,CAAO,GACDG,EAAW,WAAW9O,GAAQ;AAAA,UAC5B,IAAIuG;AAAA,UACJ,OAAAiI;AAAA,UACA,OAAAG;AAAA,QACR,CAAO,GACDnF,IAAK2N,EAAS,MAAK,GACfha,EAAQ,MAAM,QAChB2R,EAAW,OAAO9O,GAAQwJ,CAAE;AAAA,MAEhC;AACA,UAAI4U,IAAQ,MAAM,KAAKhX,EAAO,MAAMpH,GAAQ;AAAA,QAC1C,IAAAwJ;AAAA,QACA,OAAOxJ,EAAO,SAAS+E,CAAO,IAAI,CAAAjH,MAAKuJ,EAAQ,UAAUvJ,CAAC,KAAKsJ,EAAO,QAAQpH,GAAQlC,CAAC,IAAI,CAAAA,MAAKsJ,EAAO,SAAStJ,CAAC;AAAA,QACjH,MAAM;AAAA,QACN,OAAA6Q;AAAA,MACN,CAAK,CAAC,GACEuM,IAAQ,WAAiB;AACzB,YAAI/V,IAAIxI,EAAM,QAAQ6M,CAAE,IAAI7M,EAAM,aAAa6M,GAAIpC,EAAO,MAAMpH,GAAQqe,CAAQ,CAAC,IAAI7U;AACrF,YAAI,CAACrE;AACH,iBAAO;AAET,YAAI8P,IAAU,MAAM,KAAK7N,EAAO,MAAMpH,GAAQ;AAAA,UAC5C,IAAImF;AAAA,UACJ,OAAAqJ;AAAA,UACA,MAAAoD;AAAA,UACA,OAAAjD;AAAA,QACV,CAAS,CAAC;AACF,YAAIsG,EAAQ,SAAS,GAAG;AACtB,cAAI,CAAC9B,CAAK,IAAI8B,GACV9W,IAAO8W,EAAQA,EAAQ,SAAS,CAAC,GACjC,CAAA,EAAGmB,CAAS,IAAIjD,GAChB,CAAA,EAAGkD,CAAQ,IAAIlY;AACnB,cAAIiY,EAAU,WAAW,KAAKC,EAAS,WAAW;AAEhD,mBAAO;AAET,cAAIwF,IAAavf,EAAK,OAAO8Z,GAAWC,CAAQ,IAAI/Z,EAAK,OAAO8Z,CAAS,IAAI9Z,EAAK,OAAO8Z,GAAWC,CAAQ,GACxGtQ,IAAQqB,EAAO,MAAMpH,GAAQoW,GAAWC,CAAQ,GAChDiI,IAAkBlX,EAAO,KAAKpH,GAAQ6b,CAAU,GAChD,CAAC0C,CAAU,IAAID,GACfpI,IAAQ2F,EAAW,SAAS,GAC5B2C,IAAcliB,EAAK,KAAK+Z,EAAS,MAAM,GAAGH,CAAK,CAAC,GAChDuI,IAAUP,GAAcA,GAAc,CAAA,GAAInZ,CAAO,GAAG,IAAI;AAAA,YAC1D,UAAU,CAAA;AAAA,UACtB,CAAW;AACD,UAAA+J,EAAW,YAAY9O,GAAQye,GAAS;AAAA,YACtC,IAAID;AAAA,YACJ,OAAA7P;AAAA,UACZ,CAAW,GACDG,EAAW,UAAU9O,GAAQ;AAAA,YAC3B,IAAI+F;AAAA,YACJ,OAAO,CAAAjI,MAAKuJ,EAAQ,WAAWkX,CAAU,KAAKA,EAAW,SAAS,SAASzgB,CAAC;AAAA,YAC5E,IAAI0gB,EAAY,OAAO,CAAC;AAAA,YACxB,OAAA7P;AAAA,UACZ,CAAW;AAAA,QACH;AAAA,MACF,GACA+P;AACF,eAAS,CAAA,EAAGL,CAAQ,KAAKD;AAEvB,QADAM,IAAOxD,EAAK;AAAA;AAAA,EAGhB,CAAC;AACH,GAKIyD,KAAe,MAAM;AACvB,MAAI3e,IAAS;AAAA,IACX,UAAU,CAAA;AAAA,IACV,YAAY,CAAA;AAAA,IACZ,WAAW;AAAA,IACX,OAAO;AAAA,IACP,mBAAmB,MAAM;AAAA,IACzB,UAAU,MAAM;AAAA,IAChB,cAAc,MAAM;AAAA,IACpB,QAAQ,MAAM;AAAA,IACd,cAAc,MAAM;AAAA,IACpB,UAAU,MAAM;AAAA,IAAC;AAAA;AAAA,IAEjB,OAAO,WAAmB;AACxB,eAAS4e,IAAO,UAAU,QAAQC,IAAO,IAAI,MAAMD,CAAI,GAAG/d,IAAO,GAAGA,IAAO+d,GAAM/d;AAC/E,QAAAge,EAAKhe,CAAI,IAAI,UAAUA,CAAI;AAE7B,aAAOkP,GAAM/P,GAAQ,GAAG6e,CAAI;AAAA,IAC9B;AAAA;AAAA,IAEA,SAAS,WAAqB;AAC5B,eAASC,IAAQ,UAAU,QAAQD,IAAO,IAAI,MAAMC,CAAK,GAAGvd,IAAQ,GAAGA,IAAQud,GAAOvd;AACpF,QAAAsd,EAAKtd,CAAK,IAAI,UAAUA,CAAK;AAE/B,aAAOwQ,GAAQ/R,GAAQ,GAAG6e,CAAI;AAAA,IAChC;AAAA,IACA,gBAAgB,WAA4B;AAC1C,eAASE,IAAQ,UAAU,QAAQF,IAAO,IAAI,MAAME,CAAK,GAAG9c,IAAQ,GAAGA,IAAQ8c,GAAO9c;AACpF,QAAA4c,EAAK5c,CAAK,IAAI,UAAUA,CAAK;AAE/B,aAAO0Q,GAAe3S,GAAQ,GAAG6e,CAAI;AAAA,IACvC;AAAA,IACA,eAAe,WAA2B;AACxC,eAASG,IAAQ,UAAU,QAAQH,IAAO,IAAI,MAAMG,CAAK,GAAG1c,IAAQ,GAAGA,IAAQ0c,GAAO1c;AACpF,QAAAuc,EAAKvc,CAAK,IAAI,UAAUA,CAAK;AAE/B,aAAOsQ,GAAc5S,GAAQ,GAAG6e,CAAI;AAAA,IACtC;AAAA,IACA,gBAAgB,WAA4B;AAC1C,eAASI,IAAQ,UAAU,QAAQJ,IAAO,IAAI,MAAMI,CAAK,GAAG/b,IAAQ,GAAGA,IAAQ+b,GAAO/b;AACpF,QAAA2b,EAAK3b,CAAK,IAAI,UAAUA,CAAK;AAE/B,aAAO2P,GAAe7S,GAAQ,GAAG6e,CAAI;AAAA,IACvC;AAAA,IACA,aAAa,WAAyB;AACpC,eAASK,IAAQ,UAAU,QAAQL,IAAO,IAAI,MAAMK,CAAK,GAAG3b,IAAQ,GAAGA,IAAQ2b,GAAO3b;AACpF,QAAAsb,EAAKtb,CAAK,IAAI,UAAUA,CAAK;AAE/B,aAAOuN,GAAY9Q,GAAQ,GAAG6e,CAAI;AAAA,IACpC;AAAA,IACA,aAAa,WAAyB;AACpC,eAASM,IAAQ,UAAU,QAAQN,IAAO,IAAI,MAAMM,CAAK,GAAG3b,IAAQ,GAAGA,IAAQ2b,GAAO3b;AACpF,QAAAqb,EAAKrb,CAAK,IAAI,UAAUA,CAAK;AAE/B,aAAOmQ,GAAY3T,GAAQ,GAAG6e,CAAI;AAAA,IACpC;AAAA,IACA,iBAAiB,WAA6B;AAC5C,eAASO,IAAQ,UAAU,QAAQP,IAAO,IAAI,MAAMO,CAAK,GAAG1b,IAAQ,GAAGA,IAAQ0b,GAAO1b;AACpF,QAAAmb,EAAKnb,CAAK,IAAI,UAAUA,CAAK;AAE/B,aAAOmQ,GAAgB7T,GAAQ,GAAG6e,CAAI;AAAA,IACxC;AAAA,IACA,gBAAgB,WAA4B;AAC1C,eAASQ,IAAQ,UAAU,QAAQR,IAAO,IAAI,MAAMQ,CAAK,GAAG9a,IAAQ,GAAGA,IAAQ8a,GAAO9a;AACpF,QAAAsa,EAAKta,CAAK,IAAI,UAAUA,CAAK;AAE/B,aAAOwU,GAAe/Y,GAAQ,GAAG6e,CAAI;AAAA,IACvC;AAAA,IACA,YAAY,WAAwB;AAClC,eAASS,IAAS,UAAU,QAAQT,IAAO,IAAI,MAAMS,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAV,EAAKU,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO3L,GAAW5T,GAAQ,GAAG6e,CAAI;AAAA,IACnC;AAAA,IACA,YAAY,WAAwB;AAClC,eAASW,IAAS,UAAU,QAAQX,IAAO,IAAI,MAAMW,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAZ,EAAKY,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOzL,GAAWhU,GAAQ,GAAG6e,CAAI;AAAA,IACnC;AAAA,IACA,eAAe,WAA2B;AACxC,eAASa,IAAS,UAAU,QAAQb,IAAO,IAAI,MAAMa,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAd,EAAKc,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO5O,GAAc/Q,GAAQ,GAAG6e,CAAI;AAAA,IACtC;AAAA,IACA,YAAY,WAAwB;AAClC,eAASe,IAAS,UAAU,QAAQf,IAAO,IAAI,MAAMe,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAhB,EAAKgB,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOtI,GAAWvX,GAAQ,GAAG6e,CAAI;AAAA,IACnC;AAAA,IACA,eAAe,WAA2B;AACxC,eAASiB,IAAS,UAAU,QAAQjB,IAAO,IAAI,MAAMiB,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAlB,EAAKkB,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO9P,GAAcjQ,GAAQ,GAAG6e,CAAI;AAAA,IACtC;AAAA,IACA,iBAAiB,WAA6B;AAC5C,eAASmB,IAAS,UAAU,QAAQnB,IAAO,IAAI,MAAMmB,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAApB,EAAKoB,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO1O,GAAgBvR,GAAQ,GAAG6e,CAAI;AAAA,IACxC;AAAA;AAAA,IAEA,OAAO,WAAmB;AACxB,eAASqB,IAAS,UAAU,QAAQrB,IAAO,IAAI,MAAMqB,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAtB,EAAKsB,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOxO,GAAM3R,GAAQ,GAAG6e,CAAI;AAAA,IAC9B;AAAA,IACA,OAAO,WAAmB;AACxB,eAASuB,IAAS,UAAU,QAAQvB,IAAO,IAAI,MAAMuB,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAxB,EAAKwB,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO1f,GAAMX,GAAQ,GAAG6e,CAAI;AAAA,IAC9B;AAAA,IACA,QAAQ,WAAoB;AAC1B,eAASyB,IAAS,UAAU,QAAQzB,IAAO,IAAI,MAAMyB,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA1B,EAAK0B,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO7f,GAAOV,GAAQ,GAAG6e,CAAI;AAAA,IAC/B;AAAA,IACA,UAAU,WAAsB;AAC9B,eAAS2B,IAAS,UAAU,QAAQ3B,IAAO,IAAI,MAAM2B,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA5B,EAAK4B,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOrG,GAASpa,GAAQ,GAAG6e,CAAI;AAAA,IACjC;AAAA,IACA,QAAQ,WAAmB;AACzB,eAAS6B,IAAS,UAAU,QAAQ7B,IAAO,IAAI,MAAM6B,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA9B,EAAK8B,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO7I,GAAW9X,GAAQ,GAAG6e,CAAI;AAAA,IACnC;AAAA,IACA,UAAU,WAAsB;AAC9B,eAAS+B,IAAS,UAAU,QAAQ/B,IAAO,IAAI,MAAM+B,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAhC,EAAKgC,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOxG,GAASra,GAAQ,GAAG6e,CAAI;AAAA,IACjC;AAAA,IACA,OAAO,WAAmB;AACxB,eAASiC,IAAS,UAAU,QAAQjC,IAAO,IAAI,MAAMiC,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAlC,EAAKkC,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOhO,GAAM/S,GAAQ,GAAG6e,CAAI;AAAA,IAC9B;AAAA,IACA,iBAAiB,WAA6B;AAC5C,eAASmC,IAAS,UAAU,QAAQnC,IAAO,IAAI,MAAMmC,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAApC,EAAKoC,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO/N,GAAgBlT,GAAQ,GAAG6e,CAAI;AAAA,IACxC;AAAA,IACA,KAAK,WAAiB;AACpB,eAASqC,IAAS,UAAU,QAAQrC,IAAO,IAAI,MAAMqC,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAtC,EAAKsC,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOjb,GAAIlG,GAAQ,GAAG6e,CAAI;AAAA,IAC5B;AAAA,IACA,OAAO,WAAmB;AACxB,eAASuC,IAAS,UAAU,QAAQvC,IAAO,IAAI,MAAMuC,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAxC,EAAKwC,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOlO,GAAMnT,GAAQ,GAAG6e,CAAI;AAAA,IAC9B;AAAA,IACA,UAAU,WAAsB;AAC9B,eAASyC,IAAS,UAAU,QAAQzC,IAAO,IAAI,MAAMyC,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA1C,EAAK0C,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO7X,GAAS1J,GAAQ,GAAG6e,CAAI;AAAA,IACjC;AAAA,IACA,UAAU,WAAoB;AAC5B,eAAS2C,IAAS,UAAU,QAAQ3C,IAAO,IAAI,MAAM2C,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA5C,EAAK4C,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOpP,GAAMrS,GAAQ,GAAG6e,CAAI;AAAA,IAC9B;AAAA,IACA,WAAW,WAAuB;AAChC,eAAS6C,IAAS,UAAU,QAAQ7C,IAAO,IAAI,MAAM6C,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA9C,EAAK8C,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOpO,GAAUvT,GAAQ,GAAG6e,CAAI;AAAA,IAClC;AAAA,IACA,YAAY,WAAwB;AAClC,eAAS+C,IAAS,UAAU,QAAQ/C,IAAO,IAAI,MAAM+C,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAhD,EAAKgD,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOrO,GAAWxT,GAAQ,GAAG6e,CAAI;AAAA,IACnC;AAAA,IACA,SAAS,WAAqB;AAC5B,eAASiD,IAAS,UAAU,QAAQjD,IAAO,IAAI,MAAMiD,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAlD,EAAKkD,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOtO,GAAQzT,GAAQ,GAAG6e,CAAI;AAAA,IAChC;AAAA,IACA,UAAU,WAAsB;AAC9B,eAASmD,IAAS,UAAU,QAAQnD,IAAO,IAAI,MAAMmD,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAApD,EAAKoD,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOvO,GAAS1T,GAAQ,GAAG6e,CAAI;AAAA,IACjC;AAAA,IACA,aAAa,WAAyB;AACpC,eAASqD,IAAS,UAAU,QAAQrD,IAAO,IAAI,MAAMqD,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAtD,EAAKsD,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOpH,GAAY/a,GAAQ,GAAG6e,CAAI;AAAA,IACpC;AAAA,IACA,SAAS,WAAqB;AAC5B,eAASuD,IAAS,UAAU,QAAQvD,IAAO,IAAI,MAAMuD,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAxD,EAAKwD,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOpO,GAAQjU,GAAQ,GAAG6e,CAAI;AAAA,IAChC;AAAA,IACA,QAAQ,WAAoB;AAC1B,eAASyD,IAAS,UAAU,QAAQzD,IAAO,IAAI,MAAMyD,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA1D,EAAK0D,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOrO,GAAOlU,GAAQ,GAAG6e,CAAI;AAAA,IAC/B;AAAA,IACA,SAAS,WAAqB;AAC5B,eAAS2D,IAAS,UAAU,QAAQ3D,IAAO,IAAI,MAAM2D,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA5D,EAAK4D,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOtO,GAAQnU,GAAQ,GAAG6e,CAAI;AAAA,IAChC;AAAA,IACA,OAAO,WAAmB;AACxB,eAAS6D,IAAS,UAAU,QAAQ7D,IAAO,IAAI,MAAM6D,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA9D,EAAK8D,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOvO,GAAMpU,GAAQ,GAAG6e,CAAI;AAAA,IAC9B;AAAA,IACA,eAAe,WAA2B;AACxC,eAAS+D,IAAS,UAAU,QAAQ/D,IAAO,IAAI,MAAM+D,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAhE,EAAKgE,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOlZ,GAAc3J,GAAQ,GAAG6e,CAAI;AAAA,IACtC;AAAA,IACA,SAAS,WAAqB;AAC5B,eAASiE,IAAS,UAAU,QAAQjE,IAAO,IAAI,MAAMiE,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAlE,EAAKkE,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO1O,GAAQrU,GAAQ,GAAG6e,CAAI;AAAA,IAChC;AAAA,IACA,MAAM,WAAkB;AACtB,eAASmE,IAAS,UAAU,QAAQnE,IAAO,IAAI,MAAMmE,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAApE,EAAKoE,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO9kB,GAAK6B,GAAQ,GAAG6e,CAAI;AAAA,IAC7B;AAAA,IACA,MAAM,WAAkB;AACtB,eAASqE,IAAS,UAAU,QAAQrE,IAAO,IAAI,MAAMqE,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAtE,EAAKsE,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO9a,GAAKrI,GAAQ,GAAG6e,CAAI;AAAA,IAC7B;AAAA,IACA,QAAQ,WAAoB;AAC1B,eAASuE,IAAS,UAAU,QAAQvE,IAAO,IAAI,MAAMuE,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAxE,EAAKwE,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOnT,GAAOlQ,GAAQ,GAAG6e,CAAI;AAAA,IAC/B;AAAA,IACA,WAAW,WAAuB;AAChC,eAASyE,IAAS,UAAU,QAAQzE,IAAO,IAAI,MAAMyE,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA1E,EAAK0E,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOpI,GAAUnb,GAAQ,GAAG6e,CAAI;AAAA,IAClC;AAAA,IACA,YAAY,WAAwB;AAClC,eAAS2E,IAAS,UAAU,QAAQ3E,IAAO,IAAI,MAAM2E,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA5E,EAAK4E,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO7H,GAAW5b,GAAQ,GAAG6e,CAAI;AAAA,IACnC;AAAA,IACA,MAAM,WAAkB;AACtB,eAAS6E,IAAS,UAAU,QAAQ7E,IAAO,IAAI,MAAM6E,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA9E,EAAK8E,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOrJ,GAAKta,GAAQ,GAAG6e,CAAI;AAAA,IAC7B;AAAA,IACA,WAAW,WAAuB;AAChC,eAAS+E,IAAS,UAAU,QAAQ/E,IAAO,IAAI,MAAM+E,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAhF,EAAKgF,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO5H,GAAUjc,GAAQ,GAAG6e,CAAI;AAAA,IAClC;AAAA,IACA,MAAM,WAAkB;AACtB,eAASiF,IAAS,UAAU,QAAQjF,IAAO,IAAI,MAAMiF,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAlF,EAAKkF,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOthB,GAAKzC,GAAQ,GAAG6e,CAAI;AAAA,IAC7B;AAAA,IACA,MAAM,WAAkB;AACtB,eAASmF,IAAS,UAAU,QAAQnF,IAAO,IAAI,MAAMmF,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAApF,EAAKoF,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO/jB,GAAKF,GAAQ,GAAG6e,CAAI;AAAA,IAC7B;AAAA,IACA,OAAO,WAAmB;AACxB,eAASqF,IAAS,UAAU,QAAQrF,IAAO,IAAI,MAAMqF,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAtF,EAAKsF,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOtf,GAAM7E,GAAQ,GAAG6e,CAAI;AAAA,IAC9B;AAAA,IACA,WAAW,WAAuB;AAChC,eAASuF,IAAS,UAAU,QAAQvF,IAAO,IAAI,MAAMuF,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAxF,EAAKwF,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOhP,GAAUrV,GAAQ,GAAG6e,CAAI;AAAA,IAClC;AAAA,IACA,QAAQ,WAAoB;AAC1B,eAASyF,IAAS,UAAU,QAAQzF,IAAO,IAAI,MAAMyF,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA1F,EAAK0F,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOpkB,GAAOH,GAAQ,GAAG6e,CAAI;AAAA,IAC/B;AAAA,IACA,MAAM,WAAkB;AACtB,eAAS2F,IAAS,UAAU,QAAQ3F,IAAO,IAAI,MAAM2F,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA5F,EAAK4F,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOpoB,GAAK2D,GAAQ,GAAG6e,CAAI;AAAA,IAC7B;AAAA,IACA,SAAS,WAAqB;AAC5B,eAAS6F,IAAS,UAAU,QAAQ7F,IAAO,IAAI,MAAM6F,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA9F,EAAK8F,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO5O,GAAQ/V,GAAQ,GAAG6e,CAAI;AAAA,IAChC;AAAA,IACA,UAAU,WAAsB;AAC9B,eAAS+F,IAAS,UAAU,QAAQ/F,IAAO,IAAI,MAAM+F,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAhG,EAAKgG,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO7O,GAAShW,GAAQ,GAAG6e,CAAI;AAAA,IACjC;AAAA,IACA,OAAO,WAAmB;AACxB,eAASiG,IAAS,UAAU,QAAQjG,IAAO,IAAI,MAAMiG,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAlG,EAAKkG,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOvoB,GAAMwD,GAAQ,GAAG6e,CAAI;AAAA,IAC9B;AAAA,IACA,UAAU,WAAsB;AAC9B,eAASmG,IAAS,UAAU,QAAQnG,IAAO,IAAI,MAAMmG,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAApG,EAAKoG,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO3O,GAAStW,GAAQ,GAAG6e,CAAI;AAAA,IACjC;AAAA,IACA,WAAW,WAAuB;AAChC,eAASqG,IAAS,UAAU,QAAQrG,IAAO,IAAI,MAAMqG,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAtG,EAAKsG,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO5O,GAAUvW,GAAQ,GAAG6e,CAAI;AAAA,IAClC;AAAA,IACA,WAAW,WAAuB;AAChC,eAASuG,IAAS,UAAU,QAAQvG,IAAO,IAAI,MAAMuG,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAxG,EAAKwG,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO7O,GAAUxW,GAAQ,GAAG6e,CAAI;AAAA,IAClC;AAAA,IACA,UAAU,WAAsB;AAC9B,eAASyG,IAAS,UAAU,QAAQzG,IAAO,IAAI,MAAMyG,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA1G,EAAK0G,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOtO,GAASjX,GAAQ,GAAG6e,CAAI;AAAA,IACjC;AAAA,IACA,OAAO,WAAmB;AACxB,eAAS2G,IAAS,UAAU,QAAQ3G,IAAO,IAAI,MAAM2G,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA5G,EAAK4G,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO1f,GAAM/F,GAAQ,GAAG6e,CAAI;AAAA,IAC9B;AAAA,IACA,UAAU,WAAsB;AAC9B,eAAS6G,IAAS,UAAU,QAAQ7G,IAAO,IAAI,MAAM6G,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA9G,EAAK8G,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOxO,GAASnX,GAAQ,GAAG6e,CAAI;AAAA,IACjC;AAAA,IACA,WAAW,WAAuB;AAChC,eAAS+G,IAAS,UAAU,QAAQ/G,IAAO,IAAI,MAAM+G,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAhH,EAAKgH,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOzO,GAAUpX,GAAQ,GAAG6e,CAAI;AAAA,IAClC;AAAA,IACA,aAAa,WAAyB;AACpC,eAASiH,IAAS,UAAU,QAAQjH,IAAO,IAAI,MAAMiH,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAlH,EAAKkH,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO3J,GAAYpc,GAAQ,GAAG6e,CAAI;AAAA,IACpC;AAAA,IACA,QAAQ,WAAoB;AAC1B,eAASmH,IAAS,UAAU,QAAQnH,IAAO,IAAI,MAAMmH,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAApH,EAAKoH,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO1L,GAAOva,GAAQ,GAAG6e,CAAI;AAAA,IAC/B;AAAA,IACA,UAAU,WAAsB;AAC9B,eAASqH,IAAS,UAAU,QAAQrH,IAAO,IAAI,MAAMqH,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAtH,EAAKsH,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO7J,GAAStc,GAAQ,GAAG6e,CAAI;AAAA,IACjC;AAAA,IACA,gBAAgB,WAA4B;AAC1C,eAASuH,IAAS,UAAU,QAAQvH,IAAO,IAAI,MAAMuH,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAxH,EAAKwH,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO7O,GAAexX,GAAQ,GAAG6e,CAAI;AAAA,IACvC;AAAA,IACA,UAAU,WAAsB;AAC9B,eAASyH,IAAS,UAAU,QAAQzH,IAAO,IAAI,MAAMyH,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA1H,EAAK0H,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO7L,GAAS1a,GAAQ,GAAG6e,CAAI;AAAA,IACjC;AAAA,IACA,cAAc,WAA0B;AACtC,eAAS2H,IAAS,UAAU,QAAQ3H,IAAO,IAAI,MAAM2H,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA5H,EAAK4H,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO9L,GAAa3a,GAAQ,GAAG6e,CAAI;AAAA,IACrC;AAAA,IACA,YAAY,WAAwB;AAClC,eAAS6H,IAAS,UAAU,QAAQ7H,IAAO,IAAI,MAAM6H,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA9H,EAAK8H,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO1J,GAAWjd,GAAQ,GAAG6e,CAAI;AAAA,IACnC;AAAA,IACA,OAAO,WAAmB;AACxB,eAAS+H,IAAS,UAAU,QAAQ/H,IAAO,IAAI,MAAM+H,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAhI,EAAKgI,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOtgB,GAAMvG,GAAQ,GAAG6e,CAAI;AAAA,IAC9B;AAAA,IACA,QAAQ,WAAoB;AAC1B,eAASiI,IAAS,UAAU,QAAQjI,IAAO,IAAI,MAAMiI,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAlI,EAAKkI,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOtP,GAAOzX,GAAQ,GAAG6e,CAAI;AAAA,IAC/B;AAAA,IACA,aAAa,WAAyB;AACpC,eAASmI,IAAS,UAAU,QAAQnI,IAAO,IAAI,MAAMmI,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAApI,EAAKoI,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOvP,GAAY1X,GAAQ,GAAG6e,CAAI;AAAA,IACpC;AAAA,IACA,YAAY,WAAwB;AAClC,eAASqI,IAAS,UAAU,QAAQrI,IAAO,IAAI,MAAMqI,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAtI,EAAKsI,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOpJ,GAAW/d,GAAQ,GAAG6e,CAAI;AAAA,IACnC;AAAA,IACA,aAAa,WAAyB;AACpC,eAASuI,IAAS,UAAU,QAAQvI,IAAO,IAAI,MAAMuI,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAAxI,EAAKwI,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOrJ,GAAYhe,GAAQ,GAAG6e,CAAI;AAAA,IACpC;AAAA,IACA,MAAM,WAAiB;AACrB,eAASyI,IAAS,UAAU,QAAQzI,IAAO,IAAI,MAAMyI,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA1I,EAAK0I,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOjU,GAAQtT,GAAQ,GAAG6e,CAAI;AAAA,IAChC;AAAA,IACA,oBAAoB,WAAgC;AAClD,eAAS2I,IAAS,UAAU,QAAQ3I,IAAO,IAAI,MAAM2I,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA5I,EAAK4I,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAO5P,GAAmB7X,GAAQ,GAAG6e,CAAI;AAAA,IAC3C;AAAA,IACA,WAAW,WAAuB;AAChC,eAAS6I,IAAS,UAAU,QAAQ7I,IAAO,IAAI,MAAM6I,CAAM,GAAGC,IAAS,GAAGA,IAASD,GAAQC;AACzF,QAAA9I,EAAK8I,CAAM,IAAI,UAAUA,CAAM;AAEjC,aAAOxJ,GAAUne,GAAQ,GAAG6e,CAAI;AAAA,IAClC;AAAA,EACJ;AACE,SAAO7e;AACT;","x_google_ignoreList":[0]}