{"version":3,"file":"immutable-bLzW9msJ.js","sources":["../../node_modules/immutable/dist/immutable.js"],"sourcesContent":["/**\n *  Copyright (c) 2014-2015, Facebook, Inc.\n *  All rights reserved.\n *\n *  This source code is licensed under the BSD-style license found in the\n *  LICENSE file in the root directory of this source tree. An additional grant\n *  of patent rights can be found in the PATENTS file in the same directory.\n */\n\n(function (global, factory) {\n  typeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n  typeof define === 'function' && define.amd ? define(factory) :\n  global.Immutable = factory();\n}(this, function () { 'use strict';var SLICE$0 = Array.prototype.slice;\n\n  function createClass(ctor, superClass) {\n    if (superClass) {\n      ctor.prototype = Object.create(superClass.prototype);\n    }\n    ctor.prototype.constructor = ctor;\n  }\n\n  function Iterable(value) {\n      return isIterable(value) ? value : Seq(value);\n    }\n\n\n  createClass(KeyedIterable, Iterable);\n    function KeyedIterable(value) {\n      return isKeyed(value) ? value : KeyedSeq(value);\n    }\n\n\n  createClass(IndexedIterable, Iterable);\n    function IndexedIterable(value) {\n      return isIndexed(value) ? value : IndexedSeq(value);\n    }\n\n\n  createClass(SetIterable, Iterable);\n    function SetIterable(value) {\n      return isIterable(value) && !isAssociative(value) ? value : SetSeq(value);\n    }\n\n\n\n  function isIterable(maybeIterable) {\n    return !!(maybeIterable && maybeIterable[IS_ITERABLE_SENTINEL]);\n  }\n\n  function isKeyed(maybeKeyed) {\n    return !!(maybeKeyed && maybeKeyed[IS_KEYED_SENTINEL]);\n  }\n\n  function isIndexed(maybeIndexed) {\n    return !!(maybeIndexed && maybeIndexed[IS_INDEXED_SENTINEL]);\n  }\n\n  function isAssociative(maybeAssociative) {\n    return isKeyed(maybeAssociative) || isIndexed(maybeAssociative);\n  }\n\n  function isOrdered(maybeOrdered) {\n    return !!(maybeOrdered && maybeOrdered[IS_ORDERED_SENTINEL]);\n  }\n\n  Iterable.isIterable = isIterable;\n  Iterable.isKeyed = isKeyed;\n  Iterable.isIndexed = isIndexed;\n  Iterable.isAssociative = isAssociative;\n  Iterable.isOrdered = isOrdered;\n\n  Iterable.Keyed = KeyedIterable;\n  Iterable.Indexed = IndexedIterable;\n  Iterable.Set = SetIterable;\n\n\n  var IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\n  var IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\n  var IS_INDEXED_SENTINEL = '@@__IMMUTABLE_INDEXED__@@';\n  var IS_ORDERED_SENTINEL = '@@__IMMUTABLE_ORDERED__@@';\n\n  // Used for setting prototype methods that IE8 chokes on.\n  var DELETE = 'delete';\n\n  // Constants describing the size of trie nodes.\n  var SHIFT = 5; // Resulted in best performance after ______?\n  var SIZE = 1 << SHIFT;\n  var MASK = SIZE - 1;\n\n  // A consistent shared value representing \"not set\" which equals nothing other\n  // than itself, and nothing that could be provided externally.\n  var NOT_SET = {};\n\n  // Boolean references, Rough equivalent of `bool &`.\n  var CHANGE_LENGTH = { value: false };\n  var DID_ALTER = { value: false };\n\n  function MakeRef(ref) {\n    ref.value = false;\n    return ref;\n  }\n\n  function SetRef(ref) {\n    ref && (ref.value = true);\n  }\n\n  // A function which returns a value representing an \"owner\" for transient writes\n  // to tries. The return value will only ever equal itself, and will not equal\n  // the return of any subsequent call of this function.\n  function OwnerID() {}\n\n  // http://jsperf.com/copy-array-inline\n  function arrCopy(arr, offset) {\n    offset = offset || 0;\n    var len = Math.max(0, arr.length - offset);\n    var newArr = new Array(len);\n    for (var ii = 0; ii < len; ii++) {\n      newArr[ii] = arr[ii + offset];\n    }\n    return newArr;\n  }\n\n  function ensureSize(iter) {\n    if (iter.size === undefined) {\n      iter.size = iter.__iterate(returnTrue);\n    }\n    return iter.size;\n  }\n\n  function wrapIndex(iter, index) {\n    // This implements \"is array index\" which the ECMAString spec defines as:\n    //\n    //     A String property name P is an array index if and only if\n    //     ToString(ToUint32(P)) is equal to P and ToUint32(P) is not equal\n    //     to 2^32−1.\n    //\n    // http://www.ecma-international.org/ecma-262/6.0/#sec-array-exotic-objects\n    if (typeof index !== 'number') {\n      var uint32Index = index >>> 0; // N >>> 0 is shorthand for ToUint32\n      if ('' + uint32Index !== index || uint32Index === 4294967295) {\n        return NaN;\n      }\n      index = uint32Index;\n    }\n    return index < 0 ? ensureSize(iter) + index : index;\n  }\n\n  function returnTrue() {\n    return true;\n  }\n\n  function wholeSlice(begin, end, size) {\n    return (begin === 0 || (size !== undefined && begin <= -size)) &&\n      (end === undefined || (size !== undefined && end >= size));\n  }\n\n  function resolveBegin(begin, size) {\n    return resolveIndex(begin, size, 0);\n  }\n\n  function resolveEnd(end, size) {\n    return resolveIndex(end, size, size);\n  }\n\n  function resolveIndex(index, size, defaultIndex) {\n    return index === undefined ?\n      defaultIndex :\n      index < 0 ?\n        Math.max(0, size + index) :\n        size === undefined ?\n          index :\n          Math.min(size, index);\n  }\n\n  /* global Symbol */\n\n  var ITERATE_KEYS = 0;\n  var ITERATE_VALUES = 1;\n  var ITERATE_ENTRIES = 2;\n\n  var REAL_ITERATOR_SYMBOL = typeof Symbol === 'function' && Symbol.iterator;\n  var FAUX_ITERATOR_SYMBOL = '@@iterator';\n\n  var ITERATOR_SYMBOL = REAL_ITERATOR_SYMBOL || FAUX_ITERATOR_SYMBOL;\n\n\n  function Iterator(next) {\n      this.next = next;\n    }\n\n    Iterator.prototype.toString = function() {\n      return '[Iterator]';\n    };\n\n\n  Iterator.KEYS = ITERATE_KEYS;\n  Iterator.VALUES = ITERATE_VALUES;\n  Iterator.ENTRIES = ITERATE_ENTRIES;\n\n  Iterator.prototype.inspect =\n  Iterator.prototype.toSource = function () { return this.toString(); }\n  Iterator.prototype[ITERATOR_SYMBOL] = function () {\n    return this;\n  };\n\n\n  function iteratorValue(type, k, v, iteratorResult) {\n    var value = type === 0 ? k : type === 1 ? v : [k, v];\n    iteratorResult ? (iteratorResult.value = value) : (iteratorResult = {\n      value: value, done: false\n    });\n    return iteratorResult;\n  }\n\n  function iteratorDone() {\n    return { value: undefined, done: true };\n  }\n\n  function hasIterator(maybeIterable) {\n    return !!getIteratorFn(maybeIterable);\n  }\n\n  function isIterator(maybeIterator) {\n    return maybeIterator && typeof maybeIterator.next === 'function';\n  }\n\n  function getIterator(iterable) {\n    var iteratorFn = getIteratorFn(iterable);\n    return iteratorFn && iteratorFn.call(iterable);\n  }\n\n  function getIteratorFn(iterable) {\n    var iteratorFn = iterable && (\n      (REAL_ITERATOR_SYMBOL && iterable[REAL_ITERATOR_SYMBOL]) ||\n      iterable[FAUX_ITERATOR_SYMBOL]\n    );\n    if (typeof iteratorFn === 'function') {\n      return iteratorFn;\n    }\n  }\n\n  function isArrayLike(value) {\n    return value && typeof value.length === 'number';\n  }\n\n  createClass(Seq, Iterable);\n    function Seq(value) {\n      return value === null || value === undefined ? emptySequence() :\n        isIterable(value) ? value.toSeq() : seqFromValue(value);\n    }\n\n    Seq.of = function(/*...values*/) {\n      return Seq(arguments);\n    };\n\n    Seq.prototype.toSeq = function() {\n      return this;\n    };\n\n    Seq.prototype.toString = function() {\n      return this.__toString('Seq {', '}');\n    };\n\n    Seq.prototype.cacheResult = function() {\n      if (!this._cache && this.__iterateUncached) {\n        this._cache = this.entrySeq().toArray();\n        this.size = this._cache.length;\n      }\n      return this;\n    };\n\n    // abstract __iterateUncached(fn, reverse)\n\n    Seq.prototype.__iterate = function(fn, reverse) {\n      return seqIterate(this, fn, reverse, true);\n    };\n\n    // abstract __iteratorUncached(type, reverse)\n\n    Seq.prototype.__iterator = function(type, reverse) {\n      return seqIterator(this, type, reverse, true);\n    };\n\n\n\n  createClass(KeyedSeq, Seq);\n    function KeyedSeq(value) {\n      return value === null || value === undefined ?\n        emptySequence().toKeyedSeq() :\n        isIterable(value) ?\n          (isKeyed(value) ? value.toSeq() : value.fromEntrySeq()) :\n          keyedSeqFromValue(value);\n    }\n\n    KeyedSeq.prototype.toKeyedSeq = function() {\n      return this;\n    };\n\n\n\n  createClass(IndexedSeq, Seq);\n    function IndexedSeq(value) {\n      return value === null || value === undefined ? emptySequence() :\n        !isIterable(value) ? indexedSeqFromValue(value) :\n        isKeyed(value) ? value.entrySeq() : value.toIndexedSeq();\n    }\n\n    IndexedSeq.of = function(/*...values*/) {\n      return IndexedSeq(arguments);\n    };\n\n    IndexedSeq.prototype.toIndexedSeq = function() {\n      return this;\n    };\n\n    IndexedSeq.prototype.toString = function() {\n      return this.__toString('Seq [', ']');\n    };\n\n    IndexedSeq.prototype.__iterate = function(fn, reverse) {\n      return seqIterate(this, fn, reverse, false);\n    };\n\n    IndexedSeq.prototype.__iterator = function(type, reverse) {\n      return seqIterator(this, type, reverse, false);\n    };\n\n\n\n  createClass(SetSeq, Seq);\n    function SetSeq(value) {\n      return (\n        value === null || value === undefined ? emptySequence() :\n        !isIterable(value) ? indexedSeqFromValue(value) :\n        isKeyed(value) ? value.entrySeq() : value\n      ).toSetSeq();\n    }\n\n    SetSeq.of = function(/*...values*/) {\n      return SetSeq(arguments);\n    };\n\n    SetSeq.prototype.toSetSeq = function() {\n      return this;\n    };\n\n\n\n  Seq.isSeq = isSeq;\n  Seq.Keyed = KeyedSeq;\n  Seq.Set = SetSeq;\n  Seq.Indexed = IndexedSeq;\n\n  var IS_SEQ_SENTINEL = '@@__IMMUTABLE_SEQ__@@';\n\n  Seq.prototype[IS_SEQ_SENTINEL] = true;\n\n\n\n  createClass(ArraySeq, IndexedSeq);\n    function ArraySeq(array) {\n      this._array = array;\n      this.size = array.length;\n    }\n\n    ArraySeq.prototype.get = function(index, notSetValue) {\n      return this.has(index) ? this._array[wrapIndex(this, index)] : notSetValue;\n    };\n\n    ArraySeq.prototype.__iterate = function(fn, reverse) {\n      var array = this._array;\n      var maxIndex = array.length - 1;\n      for (var ii = 0; ii <= maxIndex; ii++) {\n        if (fn(array[reverse ? maxIndex - ii : ii], ii, this) === false) {\n          return ii + 1;\n        }\n      }\n      return ii;\n    };\n\n    ArraySeq.prototype.__iterator = function(type, reverse) {\n      var array = this._array;\n      var maxIndex = array.length - 1;\n      var ii = 0;\n      return new Iterator(function() \n        {return ii > maxIndex ?\n          iteratorDone() :\n          iteratorValue(type, ii, array[reverse ? maxIndex - ii++ : ii++])}\n      );\n    };\n\n\n\n  createClass(ObjectSeq, KeyedSeq);\n    function ObjectSeq(object) {\n      var keys = Object.keys(object);\n      this._object = object;\n      this._keys = keys;\n      this.size = keys.length;\n    }\n\n    ObjectSeq.prototype.get = function(key, notSetValue) {\n      if (notSetValue !== undefined && !this.has(key)) {\n        return notSetValue;\n      }\n      return this._object[key];\n    };\n\n    ObjectSeq.prototype.has = function(key) {\n      return this._object.hasOwnProperty(key);\n    };\n\n    ObjectSeq.prototype.__iterate = function(fn, reverse) {\n      var object = this._object;\n      var keys = this._keys;\n      var maxIndex = keys.length - 1;\n      for (var ii = 0; ii <= maxIndex; ii++) {\n        var key = keys[reverse ? maxIndex - ii : ii];\n        if (fn(object[key], key, this) === false) {\n          return ii + 1;\n        }\n      }\n      return ii;\n    };\n\n    ObjectSeq.prototype.__iterator = function(type, reverse) {\n      var object = this._object;\n      var keys = this._keys;\n      var maxIndex = keys.length - 1;\n      var ii = 0;\n      return new Iterator(function()  {\n        var key = keys[reverse ? maxIndex - ii : ii];\n        return ii++ > maxIndex ?\n          iteratorDone() :\n          iteratorValue(type, key, object[key]);\n      });\n    };\n\n  ObjectSeq.prototype[IS_ORDERED_SENTINEL] = true;\n\n\n  createClass(IterableSeq, IndexedSeq);\n    function IterableSeq(iterable) {\n      this._iterable = iterable;\n      this.size = iterable.length || iterable.size;\n    }\n\n    IterableSeq.prototype.__iterateUncached = function(fn, reverse) {\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var iterable = this._iterable;\n      var iterator = getIterator(iterable);\n      var iterations = 0;\n      if (isIterator(iterator)) {\n        var step;\n        while (!(step = iterator.next()).done) {\n          if (fn(step.value, iterations++, this) === false) {\n            break;\n          }\n        }\n      }\n      return iterations;\n    };\n\n    IterableSeq.prototype.__iteratorUncached = function(type, reverse) {\n      if (reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      var iterable = this._iterable;\n      var iterator = getIterator(iterable);\n      if (!isIterator(iterator)) {\n        return new Iterator(iteratorDone);\n      }\n      var iterations = 0;\n      return new Iterator(function()  {\n        var step = iterator.next();\n        return step.done ? step : iteratorValue(type, iterations++, step.value);\n      });\n    };\n\n\n\n  createClass(IteratorSeq, IndexedSeq);\n    function IteratorSeq(iterator) {\n      this._iterator = iterator;\n      this._iteratorCache = [];\n    }\n\n    IteratorSeq.prototype.__iterateUncached = function(fn, reverse) {\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var iterator = this._iterator;\n      var cache = this._iteratorCache;\n      var iterations = 0;\n      while (iterations < cache.length) {\n        if (fn(cache[iterations], iterations++, this) === false) {\n          return iterations;\n        }\n      }\n      var step;\n      while (!(step = iterator.next()).done) {\n        var val = step.value;\n        cache[iterations] = val;\n        if (fn(val, iterations++, this) === false) {\n          break;\n        }\n      }\n      return iterations;\n    };\n\n    IteratorSeq.prototype.__iteratorUncached = function(type, reverse) {\n      if (reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      var iterator = this._iterator;\n      var cache = this._iteratorCache;\n      var iterations = 0;\n      return new Iterator(function()  {\n        if (iterations >= cache.length) {\n          var step = iterator.next();\n          if (step.done) {\n            return step;\n          }\n          cache[iterations] = step.value;\n        }\n        return iteratorValue(type, iterations, cache[iterations++]);\n      });\n    };\n\n\n\n\n  // # pragma Helper functions\n\n  function isSeq(maybeSeq) {\n    return !!(maybeSeq && maybeSeq[IS_SEQ_SENTINEL]);\n  }\n\n  var EMPTY_SEQ;\n\n  function emptySequence() {\n    return EMPTY_SEQ || (EMPTY_SEQ = new ArraySeq([]));\n  }\n\n  function keyedSeqFromValue(value) {\n    var seq =\n      Array.isArray(value) ? new ArraySeq(value).fromEntrySeq() :\n      isIterator(value) ? new IteratorSeq(value).fromEntrySeq() :\n      hasIterator(value) ? new IterableSeq(value).fromEntrySeq() :\n      typeof value === 'object' ? new ObjectSeq(value) :\n      undefined;\n    if (!seq) {\n      throw new TypeError(\n        'Expected Array or iterable object of [k, v] entries, '+\n        'or keyed object: ' + value\n      );\n    }\n    return seq;\n  }\n\n  function indexedSeqFromValue(value) {\n    var seq = maybeIndexedSeqFromValue(value);\n    if (!seq) {\n      throw new TypeError(\n        'Expected Array or iterable object of values: ' + value\n      );\n    }\n    return seq;\n  }\n\n  function seqFromValue(value) {\n    var seq = maybeIndexedSeqFromValue(value) ||\n      (typeof value === 'object' && new ObjectSeq(value));\n    if (!seq) {\n      throw new TypeError(\n        'Expected Array or iterable object of values, or keyed object: ' + value\n      );\n    }\n    return seq;\n  }\n\n  function maybeIndexedSeqFromValue(value) {\n    return (\n      isArrayLike(value) ? new ArraySeq(value) :\n      isIterator(value) ? new IteratorSeq(value) :\n      hasIterator(value) ? new IterableSeq(value) :\n      undefined\n    );\n  }\n\n  function seqIterate(seq, fn, reverse, useKeys) {\n    var cache = seq._cache;\n    if (cache) {\n      var maxIndex = cache.length - 1;\n      for (var ii = 0; ii <= maxIndex; ii++) {\n        var entry = cache[reverse ? maxIndex - ii : ii];\n        if (fn(entry[1], useKeys ? entry[0] : ii, seq) === false) {\n          return ii + 1;\n        }\n      }\n      return ii;\n    }\n    return seq.__iterateUncached(fn, reverse);\n  }\n\n  function seqIterator(seq, type, reverse, useKeys) {\n    var cache = seq._cache;\n    if (cache) {\n      var maxIndex = cache.length - 1;\n      var ii = 0;\n      return new Iterator(function()  {\n        var entry = cache[reverse ? maxIndex - ii : ii];\n        return ii++ > maxIndex ?\n          iteratorDone() :\n          iteratorValue(type, useKeys ? entry[0] : ii - 1, entry[1]);\n      });\n    }\n    return seq.__iteratorUncached(type, reverse);\n  }\n\n  function fromJS(json, converter) {\n    return converter ?\n      fromJSWith(converter, json, '', {'': json}) :\n      fromJSDefault(json);\n  }\n\n  function fromJSWith(converter, json, key, parentJSON) {\n    if (Array.isArray(json)) {\n      return converter.call(parentJSON, key, IndexedSeq(json).map(function(v, k)  {return fromJSWith(converter, v, k, json)}));\n    }\n    if (isPlainObj(json)) {\n      return converter.call(parentJSON, key, KeyedSeq(json).map(function(v, k)  {return fromJSWith(converter, v, k, json)}));\n    }\n    return json;\n  }\n\n  function fromJSDefault(json) {\n    if (Array.isArray(json)) {\n      return IndexedSeq(json).map(fromJSDefault).toList();\n    }\n    if (isPlainObj(json)) {\n      return KeyedSeq(json).map(fromJSDefault).toMap();\n    }\n    return json;\n  }\n\n  function isPlainObj(value) {\n    return value && (value.constructor === Object || value.constructor === undefined);\n  }\n\n  /**\n   * An extension of the \"same-value\" algorithm as [described for use by ES6 Map\n   * and Set](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map#Key_equality)\n   *\n   * NaN is considered the same as NaN, however -0 and 0 are considered the same\n   * value, which is different from the algorithm described by\n   * [`Object.is`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is).\n   *\n   * This is extended further to allow Objects to describe the values they\n   * represent, by way of `valueOf` or `equals` (and `hashCode`).\n   *\n   * Note: because of this extension, the key equality of Immutable.Map and the\n   * value equality of Immutable.Set will differ from ES6 Map and Set.\n   *\n   * ### Defining custom values\n   *\n   * The easiest way to describe the value an object represents is by implementing\n   * `valueOf`. For example, `Date` represents a value by returning a unix\n   * timestamp for `valueOf`:\n   *\n   *     var date1 = new Date(1234567890000); // Fri Feb 13 2009 ...\n   *     var date2 = new Date(1234567890000);\n   *     date1.valueOf(); // 1234567890000\n   *     assert( date1 !== date2 );\n   *     assert( Immutable.is( date1, date2 ) );\n   *\n   * Note: overriding `valueOf` may have other implications if you use this object\n   * where JavaScript expects a primitive, such as implicit string coercion.\n   *\n   * For more complex types, especially collections, implementing `valueOf` may\n   * not be performant. An alternative is to implement `equals` and `hashCode`.\n   *\n   * `equals` takes another object, presumably of similar type, and returns true\n   * if the it is equal. Equality is symmetrical, so the same result should be\n   * returned if this and the argument are flipped.\n   *\n   *     assert( a.equals(b) === b.equals(a) );\n   *\n   * `hashCode` returns a 32bit integer number representing the object which will\n   * be used to determine how to store the value object in a Map or Set. You must\n   * provide both or neither methods, one must not exist without the other.\n   *\n   * Also, an important relationship between these methods must be upheld: if two\n   * values are equal, they *must* return the same hashCode. If the values are not\n   * equal, they might have the same hashCode; this is called a hash collision,\n   * and while undesirable for performance reasons, it is acceptable.\n   *\n   *     if (a.equals(b)) {\n   *       assert( a.hashCode() === b.hashCode() );\n   *     }\n   *\n   * All Immutable collections implement `equals` and `hashCode`.\n   *\n   */\n  function is(valueA, valueB) {\n    if (valueA === valueB || (valueA !== valueA && valueB !== valueB)) {\n      return true;\n    }\n    if (!valueA || !valueB) {\n      return false;\n    }\n    if (typeof valueA.valueOf === 'function' &&\n        typeof valueB.valueOf === 'function') {\n      valueA = valueA.valueOf();\n      valueB = valueB.valueOf();\n      if (valueA === valueB || (valueA !== valueA && valueB !== valueB)) {\n        return true;\n      }\n      if (!valueA || !valueB) {\n        return false;\n      }\n    }\n    if (typeof valueA.equals === 'function' &&\n        typeof valueB.equals === 'function' &&\n        valueA.equals(valueB)) {\n      return true;\n    }\n    return false;\n  }\n\n  function deepEqual(a, b) {\n    if (a === b) {\n      return true;\n    }\n\n    if (\n      !isIterable(b) ||\n      a.size !== undefined && b.size !== undefined && a.size !== b.size ||\n      a.__hash !== undefined && b.__hash !== undefined && a.__hash !== b.__hash ||\n      isKeyed(a) !== isKeyed(b) ||\n      isIndexed(a) !== isIndexed(b) ||\n      isOrdered(a) !== isOrdered(b)\n    ) {\n      return false;\n    }\n\n    if (a.size === 0 && b.size === 0) {\n      return true;\n    }\n\n    var notAssociative = !isAssociative(a);\n\n    if (isOrdered(a)) {\n      var entries = a.entries();\n      return b.every(function(v, k)  {\n        var entry = entries.next().value;\n        return entry && is(entry[1], v) && (notAssociative || is(entry[0], k));\n      }) && entries.next().done;\n    }\n\n    var flipped = false;\n\n    if (a.size === undefined) {\n      if (b.size === undefined) {\n        if (typeof a.cacheResult === 'function') {\n          a.cacheResult();\n        }\n      } else {\n        flipped = true;\n        var _ = a;\n        a = b;\n        b = _;\n      }\n    }\n\n    var allEqual = true;\n    var bSize = b.__iterate(function(v, k)  {\n      if (notAssociative ? !a.has(v) :\n          flipped ? !is(v, a.get(k, NOT_SET)) : !is(a.get(k, NOT_SET), v)) {\n        allEqual = false;\n        return false;\n      }\n    });\n\n    return allEqual && a.size === bSize;\n  }\n\n  createClass(Repeat, IndexedSeq);\n\n    function Repeat(value, times) {\n      if (!(this instanceof Repeat)) {\n        return new Repeat(value, times);\n      }\n      this._value = value;\n      this.size = times === undefined ? Infinity : Math.max(0, times);\n      if (this.size === 0) {\n        if (EMPTY_REPEAT) {\n          return EMPTY_REPEAT;\n        }\n        EMPTY_REPEAT = this;\n      }\n    }\n\n    Repeat.prototype.toString = function() {\n      if (this.size === 0) {\n        return 'Repeat []';\n      }\n      return 'Repeat [ ' + this._value + ' ' + this.size + ' times ]';\n    };\n\n    Repeat.prototype.get = function(index, notSetValue) {\n      return this.has(index) ? this._value : notSetValue;\n    };\n\n    Repeat.prototype.includes = function(searchValue) {\n      return is(this._value, searchValue);\n    };\n\n    Repeat.prototype.slice = function(begin, end) {\n      var size = this.size;\n      return wholeSlice(begin, end, size) ? this :\n        new Repeat(this._value, resolveEnd(end, size) - resolveBegin(begin, size));\n    };\n\n    Repeat.prototype.reverse = function() {\n      return this;\n    };\n\n    Repeat.prototype.indexOf = function(searchValue) {\n      if (is(this._value, searchValue)) {\n        return 0;\n      }\n      return -1;\n    };\n\n    Repeat.prototype.lastIndexOf = function(searchValue) {\n      if (is(this._value, searchValue)) {\n        return this.size;\n      }\n      return -1;\n    };\n\n    Repeat.prototype.__iterate = function(fn, reverse) {\n      for (var ii = 0; ii < this.size; ii++) {\n        if (fn(this._value, ii, this) === false) {\n          return ii + 1;\n        }\n      }\n      return ii;\n    };\n\n    Repeat.prototype.__iterator = function(type, reverse) {var this$0 = this;\n      var ii = 0;\n      return new Iterator(function() \n        {return ii < this$0.size ? iteratorValue(type, ii++, this$0._value) : iteratorDone()}\n      );\n    };\n\n    Repeat.prototype.equals = function(other) {\n      return other instanceof Repeat ?\n        is(this._value, other._value) :\n        deepEqual(other);\n    };\n\n\n  var EMPTY_REPEAT;\n\n  function invariant(condition, error) {\n    if (!condition) throw new Error(error);\n  }\n\n  createClass(Range, IndexedSeq);\n\n    function Range(start, end, step) {\n      if (!(this instanceof Range)) {\n        return new Range(start, end, step);\n      }\n      invariant(step !== 0, 'Cannot step a Range by 0');\n      start = start || 0;\n      if (end === undefined) {\n        end = Infinity;\n      }\n      step = step === undefined ? 1 : Math.abs(step);\n      if (end < start) {\n        step = -step;\n      }\n      this._start = start;\n      this._end = end;\n      this._step = step;\n      this.size = Math.max(0, Math.ceil((end - start) / step - 1) + 1);\n      if (this.size === 0) {\n        if (EMPTY_RANGE) {\n          return EMPTY_RANGE;\n        }\n        EMPTY_RANGE = this;\n      }\n    }\n\n    Range.prototype.toString = function() {\n      if (this.size === 0) {\n        return 'Range []';\n      }\n      return 'Range [ ' +\n        this._start + '...' + this._end +\n        (this._step > 1 ? ' by ' + this._step : '') +\n      ' ]';\n    };\n\n    Range.prototype.get = function(index, notSetValue) {\n      return this.has(index) ?\n        this._start + wrapIndex(this, index) * this._step :\n        notSetValue;\n    };\n\n    Range.prototype.includes = function(searchValue) {\n      var possibleIndex = (searchValue - this._start) / this._step;\n      return possibleIndex >= 0 &&\n        possibleIndex < this.size &&\n        possibleIndex === Math.floor(possibleIndex);\n    };\n\n    Range.prototype.slice = function(begin, end) {\n      if (wholeSlice(begin, end, this.size)) {\n        return this;\n      }\n      begin = resolveBegin(begin, this.size);\n      end = resolveEnd(end, this.size);\n      if (end <= begin) {\n        return new Range(0, 0);\n      }\n      return new Range(this.get(begin, this._end), this.get(end, this._end), this._step);\n    };\n\n    Range.prototype.indexOf = function(searchValue) {\n      var offsetValue = searchValue - this._start;\n      if (offsetValue % this._step === 0) {\n        var index = offsetValue / this._step;\n        if (index >= 0 && index < this.size) {\n          return index\n        }\n      }\n      return -1;\n    };\n\n    Range.prototype.lastIndexOf = function(searchValue) {\n      return this.indexOf(searchValue);\n    };\n\n    Range.prototype.__iterate = function(fn, reverse) {\n      var maxIndex = this.size - 1;\n      var step = this._step;\n      var value = reverse ? this._start + maxIndex * step : this._start;\n      for (var ii = 0; ii <= maxIndex; ii++) {\n        if (fn(value, ii, this) === false) {\n          return ii + 1;\n        }\n        value += reverse ? -step : step;\n      }\n      return ii;\n    };\n\n    Range.prototype.__iterator = function(type, reverse) {\n      var maxIndex = this.size - 1;\n      var step = this._step;\n      var value = reverse ? this._start + maxIndex * step : this._start;\n      var ii = 0;\n      return new Iterator(function()  {\n        var v = value;\n        value += reverse ? -step : step;\n        return ii > maxIndex ? iteratorDone() : iteratorValue(type, ii++, v);\n      });\n    };\n\n    Range.prototype.equals = function(other) {\n      return other instanceof Range ?\n        this._start === other._start &&\n        this._end === other._end &&\n        this._step === other._step :\n        deepEqual(this, other);\n    };\n\n\n  var EMPTY_RANGE;\n\n  createClass(Collection, Iterable);\n    function Collection() {\n      throw TypeError('Abstract');\n    }\n\n\n  createClass(KeyedCollection, Collection);function KeyedCollection() {}\n\n  createClass(IndexedCollection, Collection);function IndexedCollection() {}\n\n  createClass(SetCollection, Collection);function SetCollection() {}\n\n\n  Collection.Keyed = KeyedCollection;\n  Collection.Indexed = IndexedCollection;\n  Collection.Set = SetCollection;\n\n  var imul =\n    typeof Math.imul === 'function' && Math.imul(0xffffffff, 2) === -2 ?\n    Math.imul :\n    function imul(a, b) {\n      a = a | 0; // int\n      b = b | 0; // int\n      var c = a & 0xffff;\n      var d = b & 0xffff;\n      // Shift by 0 fixes the sign on the high part.\n      return (c * d) + ((((a >>> 16) * d + c * (b >>> 16)) << 16) >>> 0) | 0; // int\n    };\n\n  // v8 has an optimization for storing 31-bit signed numbers.\n  // Values which have either 00 or 11 as the high order bits qualify.\n  // This function drops the highest order bit in a signed number, maintaining\n  // the sign bit.\n  function smi(i32) {\n    return ((i32 >>> 1) & 0x40000000) | (i32 & 0xBFFFFFFF);\n  }\n\n  function hash(o) {\n    if (o === false || o === null || o === undefined) {\n      return 0;\n    }\n    if (typeof o.valueOf === 'function') {\n      o = o.valueOf();\n      if (o === false || o === null || o === undefined) {\n        return 0;\n      }\n    }\n    if (o === true) {\n      return 1;\n    }\n    var type = typeof o;\n    if (type === 'number') {\n      var h = o | 0;\n      if (h !== o) {\n        h ^= o * 0xFFFFFFFF;\n      }\n      while (o > 0xFFFFFFFF) {\n        o /= 0xFFFFFFFF;\n        h ^= o;\n      }\n      return smi(h);\n    }\n    if (type === 'string') {\n      return o.length > STRING_HASH_CACHE_MIN_STRLEN ? cachedHashString(o) : hashString(o);\n    }\n    if (typeof o.hashCode === 'function') {\n      return o.hashCode();\n    }\n    if (type === 'object') {\n      return hashJSObj(o);\n    }\n    if (typeof o.toString === 'function') {\n      return hashString(o.toString());\n    }\n    throw new Error('Value type ' + type + ' cannot be hashed.');\n  }\n\n  function cachedHashString(string) {\n    var hash = stringHashCache[string];\n    if (hash === undefined) {\n      hash = hashString(string);\n      if (STRING_HASH_CACHE_SIZE === STRING_HASH_CACHE_MAX_SIZE) {\n        STRING_HASH_CACHE_SIZE = 0;\n        stringHashCache = {};\n      }\n      STRING_HASH_CACHE_SIZE++;\n      stringHashCache[string] = hash;\n    }\n    return hash;\n  }\n\n  // http://jsperf.com/hashing-strings\n  function hashString(string) {\n    // This is the hash from JVM\n    // The hash code for a string is computed as\n    // s[0] * 31 ^ (n - 1) + s[1] * 31 ^ (n - 2) + ... + s[n - 1],\n    // where s[i] is the ith character of the string and n is the length of\n    // the string. We \"mod\" the result to make it between 0 (inclusive) and 2^31\n    // (exclusive) by dropping high bits.\n    var hash = 0;\n    for (var ii = 0; ii < string.length; ii++) {\n      hash = 31 * hash + string.charCodeAt(ii) | 0;\n    }\n    return smi(hash);\n  }\n\n  function hashJSObj(obj) {\n    var hash;\n    if (usingWeakMap) {\n      hash = weakMap.get(obj);\n      if (hash !== undefined) {\n        return hash;\n      }\n    }\n\n    hash = obj[UID_HASH_KEY];\n    if (hash !== undefined) {\n      return hash;\n    }\n\n    if (!canDefineProperty) {\n      hash = obj.propertyIsEnumerable && obj.propertyIsEnumerable[UID_HASH_KEY];\n      if (hash !== undefined) {\n        return hash;\n      }\n\n      hash = getIENodeHash(obj);\n      if (hash !== undefined) {\n        return hash;\n      }\n    }\n\n    hash = ++objHashUID;\n    if (objHashUID & 0x40000000) {\n      objHashUID = 0;\n    }\n\n    if (usingWeakMap) {\n      weakMap.set(obj, hash);\n    } else if (isExtensible !== undefined && isExtensible(obj) === false) {\n      throw new Error('Non-extensible objects are not allowed as keys.');\n    } else if (canDefineProperty) {\n      Object.defineProperty(obj, UID_HASH_KEY, {\n        'enumerable': false,\n        'configurable': false,\n        'writable': false,\n        'value': hash\n      });\n    } else if (obj.propertyIsEnumerable !== undefined &&\n               obj.propertyIsEnumerable === obj.constructor.prototype.propertyIsEnumerable) {\n      // Since we can't define a non-enumerable property on the object\n      // we'll hijack one of the less-used non-enumerable properties to\n      // save our hash on it. Since this is a function it will not show up in\n      // `JSON.stringify` which is what we want.\n      obj.propertyIsEnumerable = function() {\n        return this.constructor.prototype.propertyIsEnumerable.apply(this, arguments);\n      };\n      obj.propertyIsEnumerable[UID_HASH_KEY] = hash;\n    } else if (obj.nodeType !== undefined) {\n      // At this point we couldn't get the IE `uniqueID` to use as a hash\n      // and we couldn't use a non-enumerable property to exploit the\n      // dontEnum bug so we simply add the `UID_HASH_KEY` on the node\n      // itself.\n      obj[UID_HASH_KEY] = hash;\n    } else {\n      throw new Error('Unable to set a non-enumerable property on object.');\n    }\n\n    return hash;\n  }\n\n  // Get references to ES5 object methods.\n  var isExtensible = Object.isExtensible;\n\n  // True if Object.defineProperty works as expected. IE8 fails this test.\n  var canDefineProperty = (function() {\n    try {\n      Object.defineProperty({}, '@', {});\n      return true;\n    } catch (e) {\n      return false;\n    }\n  }());\n\n  // IE has a `uniqueID` property on DOM nodes. We can construct the hash from it\n  // and avoid memory leaks from the IE cloneNode bug.\n  function getIENodeHash(node) {\n    if (node && node.nodeType > 0) {\n      switch (node.nodeType) {\n        case 1: // Element\n          return node.uniqueID;\n        case 9: // Document\n          return node.documentElement && node.documentElement.uniqueID;\n      }\n    }\n  }\n\n  // If possible, use a WeakMap.\n  var usingWeakMap = typeof WeakMap === 'function';\n  var weakMap;\n  if (usingWeakMap) {\n    weakMap = new WeakMap();\n  }\n\n  var objHashUID = 0;\n\n  var UID_HASH_KEY = '__immutablehash__';\n  if (typeof Symbol === 'function') {\n    UID_HASH_KEY = Symbol(UID_HASH_KEY);\n  }\n\n  var STRING_HASH_CACHE_MIN_STRLEN = 16;\n  var STRING_HASH_CACHE_MAX_SIZE = 255;\n  var STRING_HASH_CACHE_SIZE = 0;\n  var stringHashCache = {};\n\n  function assertNotInfinite(size) {\n    invariant(\n      size !== Infinity,\n      'Cannot perform this action with an infinite size.'\n    );\n  }\n\n  createClass(Map, KeyedCollection);\n\n    // @pragma Construction\n\n    function Map(value) {\n      return value === null || value === undefined ? emptyMap() :\n        isMap(value) && !isOrdered(value) ? value :\n        emptyMap().withMutations(function(map ) {\n          var iter = KeyedIterable(value);\n          assertNotInfinite(iter.size);\n          iter.forEach(function(v, k)  {return map.set(k, v)});\n        });\n    }\n\n    Map.prototype.toString = function() {\n      return this.__toString('Map {', '}');\n    };\n\n    // @pragma Access\n\n    Map.prototype.get = function(k, notSetValue) {\n      return this._root ?\n        this._root.get(0, undefined, k, notSetValue) :\n        notSetValue;\n    };\n\n    // @pragma Modification\n\n    Map.prototype.set = function(k, v) {\n      return updateMap(this, k, v);\n    };\n\n    Map.prototype.setIn = function(keyPath, v) {\n      return this.updateIn(keyPath, NOT_SET, function()  {return v});\n    };\n\n    Map.prototype.remove = function(k) {\n      return updateMap(this, k, NOT_SET);\n    };\n\n    Map.prototype.deleteIn = function(keyPath) {\n      return this.updateIn(keyPath, function()  {return NOT_SET});\n    };\n\n    Map.prototype.update = function(k, notSetValue, updater) {\n      return arguments.length === 1 ?\n        k(this) :\n        this.updateIn([k], notSetValue, updater);\n    };\n\n    Map.prototype.updateIn = function(keyPath, notSetValue, updater) {\n      if (!updater) {\n        updater = notSetValue;\n        notSetValue = undefined;\n      }\n      var updatedValue = updateInDeepMap(\n        this,\n        forceIterator(keyPath),\n        notSetValue,\n        updater\n      );\n      return updatedValue === NOT_SET ? undefined : updatedValue;\n    };\n\n    Map.prototype.clear = function() {\n      if (this.size === 0) {\n        return this;\n      }\n      if (this.__ownerID) {\n        this.size = 0;\n        this._root = null;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return emptyMap();\n    };\n\n    // @pragma Composition\n\n    Map.prototype.merge = function(/*...iters*/) {\n      return mergeIntoMapWith(this, undefined, arguments);\n    };\n\n    Map.prototype.mergeWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return mergeIntoMapWith(this, merger, iters);\n    };\n\n    Map.prototype.mergeIn = function(keyPath) {var iters = SLICE$0.call(arguments, 1);\n      return this.updateIn(\n        keyPath,\n        emptyMap(),\n        function(m ) {return typeof m.merge === 'function' ?\n          m.merge.apply(m, iters) :\n          iters[iters.length - 1]}\n      );\n    };\n\n    Map.prototype.mergeDeep = function(/*...iters*/) {\n      return mergeIntoMapWith(this, deepMerger, arguments);\n    };\n\n    Map.prototype.mergeDeepWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return mergeIntoMapWith(this, deepMergerWith(merger), iters);\n    };\n\n    Map.prototype.mergeDeepIn = function(keyPath) {var iters = SLICE$0.call(arguments, 1);\n      return this.updateIn(\n        keyPath,\n        emptyMap(),\n        function(m ) {return typeof m.mergeDeep === 'function' ?\n          m.mergeDeep.apply(m, iters) :\n          iters[iters.length - 1]}\n      );\n    };\n\n    Map.prototype.sort = function(comparator) {\n      // Late binding\n      return OrderedMap(sortFactory(this, comparator));\n    };\n\n    Map.prototype.sortBy = function(mapper, comparator) {\n      // Late binding\n      return OrderedMap(sortFactory(this, comparator, mapper));\n    };\n\n    // @pragma Mutability\n\n    Map.prototype.withMutations = function(fn) {\n      var mutable = this.asMutable();\n      fn(mutable);\n      return mutable.wasAltered() ? mutable.__ensureOwner(this.__ownerID) : this;\n    };\n\n    Map.prototype.asMutable = function() {\n      return this.__ownerID ? this : this.__ensureOwner(new OwnerID());\n    };\n\n    Map.prototype.asImmutable = function() {\n      return this.__ensureOwner();\n    };\n\n    Map.prototype.wasAltered = function() {\n      return this.__altered;\n    };\n\n    Map.prototype.__iterator = function(type, reverse) {\n      return new MapIterator(this, type, reverse);\n    };\n\n    Map.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      var iterations = 0;\n      this._root && this._root.iterate(function(entry ) {\n        iterations++;\n        return fn(entry[1], entry[0], this$0);\n      }, reverse);\n      return iterations;\n    };\n\n    Map.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this.__altered = false;\n        return this;\n      }\n      return makeMap(this.size, this._root, ownerID, this.__hash);\n    };\n\n\n  function isMap(maybeMap) {\n    return !!(maybeMap && maybeMap[IS_MAP_SENTINEL]);\n  }\n\n  Map.isMap = isMap;\n\n  var IS_MAP_SENTINEL = '@@__IMMUTABLE_MAP__@@';\n\n  var MapPrototype = Map.prototype;\n  MapPrototype[IS_MAP_SENTINEL] = true;\n  MapPrototype[DELETE] = MapPrototype.remove;\n  MapPrototype.removeIn = MapPrototype.deleteIn;\n\n\n  // #pragma Trie Nodes\n\n\n\n    function ArrayMapNode(ownerID, entries) {\n      this.ownerID = ownerID;\n      this.entries = entries;\n    }\n\n    ArrayMapNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      var entries = this.entries;\n      for (var ii = 0, len = entries.length; ii < len; ii++) {\n        if (is(key, entries[ii][0])) {\n          return entries[ii][1];\n        }\n      }\n      return notSetValue;\n    };\n\n    ArrayMapNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      var removed = value === NOT_SET;\n\n      var entries = this.entries;\n      var idx = 0;\n      for (var len = entries.length; idx < len; idx++) {\n        if (is(key, entries[idx][0])) {\n          break;\n        }\n      }\n      var exists = idx < len;\n\n      if (exists ? entries[idx][1] === value : removed) {\n        return this;\n      }\n\n      SetRef(didAlter);\n      (removed || !exists) && SetRef(didChangeSize);\n\n      if (removed && entries.length === 1) {\n        return; // undefined\n      }\n\n      if (!exists && !removed && entries.length >= MAX_ARRAY_MAP_SIZE) {\n        return createNodes(ownerID, entries, key, value);\n      }\n\n      var isEditable = ownerID && ownerID === this.ownerID;\n      var newEntries = isEditable ? entries : arrCopy(entries);\n\n      if (exists) {\n        if (removed) {\n          idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\n        } else {\n          newEntries[idx] = [key, value];\n        }\n      } else {\n        newEntries.push([key, value]);\n      }\n\n      if (isEditable) {\n        this.entries = newEntries;\n        return this;\n      }\n\n      return new ArrayMapNode(ownerID, newEntries);\n    };\n\n\n\n\n    function BitmapIndexedNode(ownerID, bitmap, nodes) {\n      this.ownerID = ownerID;\n      this.bitmap = bitmap;\n      this.nodes = nodes;\n    }\n\n    BitmapIndexedNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n      var bit = (1 << ((shift === 0 ? keyHash : keyHash >>> shift) & MASK));\n      var bitmap = this.bitmap;\n      return (bitmap & bit) === 0 ? notSetValue :\n        this.nodes[popCount(bitmap & (bit - 1))].get(shift + SHIFT, keyHash, key, notSetValue);\n    };\n\n    BitmapIndexedNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n      var keyHashFrag = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n      var bit = 1 << keyHashFrag;\n      var bitmap = this.bitmap;\n      var exists = (bitmap & bit) !== 0;\n\n      if (!exists && value === NOT_SET) {\n        return this;\n      }\n\n      var idx = popCount(bitmap & (bit - 1));\n      var nodes = this.nodes;\n      var node = exists ? nodes[idx] : undefined;\n      var newNode = updateNode(node, ownerID, shift + SHIFT, keyHash, key, value, didChangeSize, didAlter);\n\n      if (newNode === node) {\n        return this;\n      }\n\n      if (!exists && newNode && nodes.length >= MAX_BITMAP_INDEXED_SIZE) {\n        return expandNodes(ownerID, nodes, bitmap, keyHashFrag, newNode);\n      }\n\n      if (exists && !newNode && nodes.length === 2 && isLeafNode(nodes[idx ^ 1])) {\n        return nodes[idx ^ 1];\n      }\n\n      if (exists && newNode && nodes.length === 1 && isLeafNode(newNode)) {\n        return newNode;\n      }\n\n      var isEditable = ownerID && ownerID === this.ownerID;\n      var newBitmap = exists ? newNode ? bitmap : bitmap ^ bit : bitmap | bit;\n      var newNodes = exists ? newNode ?\n        setIn(nodes, idx, newNode, isEditable) :\n        spliceOut(nodes, idx, isEditable) :\n        spliceIn(nodes, idx, newNode, isEditable);\n\n      if (isEditable) {\n        this.bitmap = newBitmap;\n        this.nodes = newNodes;\n        return this;\n      }\n\n      return new BitmapIndexedNode(ownerID, newBitmap, newNodes);\n    };\n\n\n\n\n    function HashArrayMapNode(ownerID, count, nodes) {\n      this.ownerID = ownerID;\n      this.count = count;\n      this.nodes = nodes;\n    }\n\n    HashArrayMapNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n      var idx = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n      var node = this.nodes[idx];\n      return node ? node.get(shift + SHIFT, keyHash, key, notSetValue) : notSetValue;\n    };\n\n    HashArrayMapNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n      var idx = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n      var removed = value === NOT_SET;\n      var nodes = this.nodes;\n      var node = nodes[idx];\n\n      if (removed && !node) {\n        return this;\n      }\n\n      var newNode = updateNode(node, ownerID, shift + SHIFT, keyHash, key, value, didChangeSize, didAlter);\n      if (newNode === node) {\n        return this;\n      }\n\n      var newCount = this.count;\n      if (!node) {\n        newCount++;\n      } else if (!newNode) {\n        newCount--;\n        if (newCount < MIN_HASH_ARRAY_MAP_SIZE) {\n          return packNodes(ownerID, nodes, newCount, idx);\n        }\n      }\n\n      var isEditable = ownerID && ownerID === this.ownerID;\n      var newNodes = setIn(nodes, idx, newNode, isEditable);\n\n      if (isEditable) {\n        this.count = newCount;\n        this.nodes = newNodes;\n        return this;\n      }\n\n      return new HashArrayMapNode(ownerID, newCount, newNodes);\n    };\n\n\n\n\n    function HashCollisionNode(ownerID, keyHash, entries) {\n      this.ownerID = ownerID;\n      this.keyHash = keyHash;\n      this.entries = entries;\n    }\n\n    HashCollisionNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      var entries = this.entries;\n      for (var ii = 0, len = entries.length; ii < len; ii++) {\n        if (is(key, entries[ii][0])) {\n          return entries[ii][1];\n        }\n      }\n      return notSetValue;\n    };\n\n    HashCollisionNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      if (keyHash === undefined) {\n        keyHash = hash(key);\n      }\n\n      var removed = value === NOT_SET;\n\n      if (keyHash !== this.keyHash) {\n        if (removed) {\n          return this;\n        }\n        SetRef(didAlter);\n        SetRef(didChangeSize);\n        return mergeIntoNode(this, ownerID, shift, keyHash, [key, value]);\n      }\n\n      var entries = this.entries;\n      var idx = 0;\n      for (var len = entries.length; idx < len; idx++) {\n        if (is(key, entries[idx][0])) {\n          break;\n        }\n      }\n      var exists = idx < len;\n\n      if (exists ? entries[idx][1] === value : removed) {\n        return this;\n      }\n\n      SetRef(didAlter);\n      (removed || !exists) && SetRef(didChangeSize);\n\n      if (removed && len === 2) {\n        return new ValueNode(ownerID, this.keyHash, entries[idx ^ 1]);\n      }\n\n      var isEditable = ownerID && ownerID === this.ownerID;\n      var newEntries = isEditable ? entries : arrCopy(entries);\n\n      if (exists) {\n        if (removed) {\n          idx === len - 1 ? newEntries.pop() : (newEntries[idx] = newEntries.pop());\n        } else {\n          newEntries[idx] = [key, value];\n        }\n      } else {\n        newEntries.push([key, value]);\n      }\n\n      if (isEditable) {\n        this.entries = newEntries;\n        return this;\n      }\n\n      return new HashCollisionNode(ownerID, this.keyHash, newEntries);\n    };\n\n\n\n\n    function ValueNode(ownerID, keyHash, entry) {\n      this.ownerID = ownerID;\n      this.keyHash = keyHash;\n      this.entry = entry;\n    }\n\n    ValueNode.prototype.get = function(shift, keyHash, key, notSetValue) {\n      return is(key, this.entry[0]) ? this.entry[1] : notSetValue;\n    };\n\n    ValueNode.prototype.update = function(ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n      var removed = value === NOT_SET;\n      var keyMatch = is(key, this.entry[0]);\n      if (keyMatch ? value === this.entry[1] : removed) {\n        return this;\n      }\n\n      SetRef(didAlter);\n\n      if (removed) {\n        SetRef(didChangeSize);\n        return; // undefined\n      }\n\n      if (keyMatch) {\n        if (ownerID && ownerID === this.ownerID) {\n          this.entry[1] = value;\n          return this;\n        }\n        return new ValueNode(ownerID, this.keyHash, [key, value]);\n      }\n\n      SetRef(didChangeSize);\n      return mergeIntoNode(this, ownerID, shift, hash(key), [key, value]);\n    };\n\n\n\n  // #pragma Iterators\n\n  ArrayMapNode.prototype.iterate =\n  HashCollisionNode.prototype.iterate = function (fn, reverse) {\n    var entries = this.entries;\n    for (var ii = 0, maxIndex = entries.length - 1; ii <= maxIndex; ii++) {\n      if (fn(entries[reverse ? maxIndex - ii : ii]) === false) {\n        return false;\n      }\n    }\n  }\n\n  BitmapIndexedNode.prototype.iterate =\n  HashArrayMapNode.prototype.iterate = function (fn, reverse) {\n    var nodes = this.nodes;\n    for (var ii = 0, maxIndex = nodes.length - 1; ii <= maxIndex; ii++) {\n      var node = nodes[reverse ? maxIndex - ii : ii];\n      if (node && node.iterate(fn, reverse) === false) {\n        return false;\n      }\n    }\n  }\n\n  ValueNode.prototype.iterate = function (fn, reverse) {\n    return fn(this.entry);\n  }\n\n  createClass(MapIterator, Iterator);\n\n    function MapIterator(map, type, reverse) {\n      this._type = type;\n      this._reverse = reverse;\n      this._stack = map._root && mapIteratorFrame(map._root);\n    }\n\n    MapIterator.prototype.next = function() {\n      var type = this._type;\n      var stack = this._stack;\n      while (stack) {\n        var node = stack.node;\n        var index = stack.index++;\n        var maxIndex;\n        if (node.entry) {\n          if (index === 0) {\n            return mapIteratorValue(type, node.entry);\n          }\n        } else if (node.entries) {\n          maxIndex = node.entries.length - 1;\n          if (index <= maxIndex) {\n            return mapIteratorValue(type, node.entries[this._reverse ? maxIndex - index : index]);\n          }\n        } else {\n          maxIndex = node.nodes.length - 1;\n          if (index <= maxIndex) {\n            var subNode = node.nodes[this._reverse ? maxIndex - index : index];\n            if (subNode) {\n              if (subNode.entry) {\n                return mapIteratorValue(type, subNode.entry);\n              }\n              stack = this._stack = mapIteratorFrame(subNode, stack);\n            }\n            continue;\n          }\n        }\n        stack = this._stack = this._stack.__prev;\n      }\n      return iteratorDone();\n    };\n\n\n  function mapIteratorValue(type, entry) {\n    return iteratorValue(type, entry[0], entry[1]);\n  }\n\n  function mapIteratorFrame(node, prev) {\n    return {\n      node: node,\n      index: 0,\n      __prev: prev\n    };\n  }\n\n  function makeMap(size, root, ownerID, hash) {\n    var map = Object.create(MapPrototype);\n    map.size = size;\n    map._root = root;\n    map.__ownerID = ownerID;\n    map.__hash = hash;\n    map.__altered = false;\n    return map;\n  }\n\n  var EMPTY_MAP;\n  function emptyMap() {\n    return EMPTY_MAP || (EMPTY_MAP = makeMap(0));\n  }\n\n  function updateMap(map, k, v) {\n    var newRoot;\n    var newSize;\n    if (!map._root) {\n      if (v === NOT_SET) {\n        return map;\n      }\n      newSize = 1;\n      newRoot = new ArrayMapNode(map.__ownerID, [[k, v]]);\n    } else {\n      var didChangeSize = MakeRef(CHANGE_LENGTH);\n      var didAlter = MakeRef(DID_ALTER);\n      newRoot = updateNode(map._root, map.__ownerID, 0, undefined, k, v, didChangeSize, didAlter);\n      if (!didAlter.value) {\n        return map;\n      }\n      newSize = map.size + (didChangeSize.value ? v === NOT_SET ? -1 : 1 : 0);\n    }\n    if (map.__ownerID) {\n      map.size = newSize;\n      map._root = newRoot;\n      map.__hash = undefined;\n      map.__altered = true;\n      return map;\n    }\n    return newRoot ? makeMap(newSize, newRoot) : emptyMap();\n  }\n\n  function updateNode(node, ownerID, shift, keyHash, key, value, didChangeSize, didAlter) {\n    if (!node) {\n      if (value === NOT_SET) {\n        return node;\n      }\n      SetRef(didAlter);\n      SetRef(didChangeSize);\n      return new ValueNode(ownerID, keyHash, [key, value]);\n    }\n    return node.update(ownerID, shift, keyHash, key, value, didChangeSize, didAlter);\n  }\n\n  function isLeafNode(node) {\n    return node.constructor === ValueNode || node.constructor === HashCollisionNode;\n  }\n\n  function mergeIntoNode(node, ownerID, shift, keyHash, entry) {\n    if (node.keyHash === keyHash) {\n      return new HashCollisionNode(ownerID, keyHash, [node.entry, entry]);\n    }\n\n    var idx1 = (shift === 0 ? node.keyHash : node.keyHash >>> shift) & MASK;\n    var idx2 = (shift === 0 ? keyHash : keyHash >>> shift) & MASK;\n\n    var newNode;\n    var nodes = idx1 === idx2 ?\n      [mergeIntoNode(node, ownerID, shift + SHIFT, keyHash, entry)] :\n      ((newNode = new ValueNode(ownerID, keyHash, entry)), idx1 < idx2 ? [node, newNode] : [newNode, node]);\n\n    return new BitmapIndexedNode(ownerID, (1 << idx1) | (1 << idx2), nodes);\n  }\n\n  function createNodes(ownerID, entries, key, value) {\n    if (!ownerID) {\n      ownerID = new OwnerID();\n    }\n    var node = new ValueNode(ownerID, hash(key), [key, value]);\n    for (var ii = 0; ii < entries.length; ii++) {\n      var entry = entries[ii];\n      node = node.update(ownerID, 0, undefined, entry[0], entry[1]);\n    }\n    return node;\n  }\n\n  function packNodes(ownerID, nodes, count, excluding) {\n    var bitmap = 0;\n    var packedII = 0;\n    var packedNodes = new Array(count);\n    for (var ii = 0, bit = 1, len = nodes.length; ii < len; ii++, bit <<= 1) {\n      var node = nodes[ii];\n      if (node !== undefined && ii !== excluding) {\n        bitmap |= bit;\n        packedNodes[packedII++] = node;\n      }\n    }\n    return new BitmapIndexedNode(ownerID, bitmap, packedNodes);\n  }\n\n  function expandNodes(ownerID, nodes, bitmap, including, node) {\n    var count = 0;\n    var expandedNodes = new Array(SIZE);\n    for (var ii = 0; bitmap !== 0; ii++, bitmap >>>= 1) {\n      expandedNodes[ii] = bitmap & 1 ? nodes[count++] : undefined;\n    }\n    expandedNodes[including] = node;\n    return new HashArrayMapNode(ownerID, count + 1, expandedNodes);\n  }\n\n  function mergeIntoMapWith(map, merger, iterables) {\n    var iters = [];\n    for (var ii = 0; ii < iterables.length; ii++) {\n      var value = iterables[ii];\n      var iter = KeyedIterable(value);\n      if (!isIterable(value)) {\n        iter = iter.map(function(v ) {return fromJS(v)});\n      }\n      iters.push(iter);\n    }\n    return mergeIntoCollectionWith(map, merger, iters);\n  }\n\n  function deepMerger(existing, value, key) {\n    return existing && existing.mergeDeep && isIterable(value) ?\n      existing.mergeDeep(value) :\n      is(existing, value) ? existing : value;\n  }\n\n  function deepMergerWith(merger) {\n    return function(existing, value, key)  {\n      if (existing && existing.mergeDeepWith && isIterable(value)) {\n        return existing.mergeDeepWith(merger, value);\n      }\n      var nextValue = merger(existing, value, key);\n      return is(existing, nextValue) ? existing : nextValue;\n    };\n  }\n\n  function mergeIntoCollectionWith(collection, merger, iters) {\n    iters = iters.filter(function(x ) {return x.size !== 0});\n    if (iters.length === 0) {\n      return collection;\n    }\n    if (collection.size === 0 && !collection.__ownerID && iters.length === 1) {\n      return collection.constructor(iters[0]);\n    }\n    return collection.withMutations(function(collection ) {\n      var mergeIntoMap = merger ?\n        function(value, key)  {\n          collection.update(key, NOT_SET, function(existing )\n            {return existing === NOT_SET ? value : merger(existing, value, key)}\n          );\n        } :\n        function(value, key)  {\n          collection.set(key, value);\n        }\n      for (var ii = 0; ii < iters.length; ii++) {\n        iters[ii].forEach(mergeIntoMap);\n      }\n    });\n  }\n\n  function updateInDeepMap(existing, keyPathIter, notSetValue, updater) {\n    var isNotSet = existing === NOT_SET;\n    var step = keyPathIter.next();\n    if (step.done) {\n      var existingValue = isNotSet ? notSetValue : existing;\n      var newValue = updater(existingValue);\n      return newValue === existingValue ? existing : newValue;\n    }\n    invariant(\n      isNotSet || (existing && existing.set),\n      'invalid keyPath'\n    );\n    var key = step.value;\n    var nextExisting = isNotSet ? NOT_SET : existing.get(key, NOT_SET);\n    var nextUpdated = updateInDeepMap(\n      nextExisting,\n      keyPathIter,\n      notSetValue,\n      updater\n    );\n    return nextUpdated === nextExisting ? existing :\n      nextUpdated === NOT_SET ? existing.remove(key) :\n      (isNotSet ? emptyMap() : existing).set(key, nextUpdated);\n  }\n\n  function popCount(x) {\n    x = x - ((x >> 1) & 0x55555555);\n    x = (x & 0x33333333) + ((x >> 2) & 0x33333333);\n    x = (x + (x >> 4)) & 0x0f0f0f0f;\n    x = x + (x >> 8);\n    x = x + (x >> 16);\n    return x & 0x7f;\n  }\n\n  function setIn(array, idx, val, canEdit) {\n    var newArray = canEdit ? array : arrCopy(array);\n    newArray[idx] = val;\n    return newArray;\n  }\n\n  function spliceIn(array, idx, val, canEdit) {\n    var newLen = array.length + 1;\n    if (canEdit && idx + 1 === newLen) {\n      array[idx] = val;\n      return array;\n    }\n    var newArray = new Array(newLen);\n    var after = 0;\n    for (var ii = 0; ii < newLen; ii++) {\n      if (ii === idx) {\n        newArray[ii] = val;\n        after = -1;\n      } else {\n        newArray[ii] = array[ii + after];\n      }\n    }\n    return newArray;\n  }\n\n  function spliceOut(array, idx, canEdit) {\n    var newLen = array.length - 1;\n    if (canEdit && idx === newLen) {\n      array.pop();\n      return array;\n    }\n    var newArray = new Array(newLen);\n    var after = 0;\n    for (var ii = 0; ii < newLen; ii++) {\n      if (ii === idx) {\n        after = 1;\n      }\n      newArray[ii] = array[ii + after];\n    }\n    return newArray;\n  }\n\n  var MAX_ARRAY_MAP_SIZE = SIZE / 4;\n  var MAX_BITMAP_INDEXED_SIZE = SIZE / 2;\n  var MIN_HASH_ARRAY_MAP_SIZE = SIZE / 4;\n\n  createClass(List, IndexedCollection);\n\n    // @pragma Construction\n\n    function List(value) {\n      var empty = emptyList();\n      if (value === null || value === undefined) {\n        return empty;\n      }\n      if (isList(value)) {\n        return value;\n      }\n      var iter = IndexedIterable(value);\n      var size = iter.size;\n      if (size === 0) {\n        return empty;\n      }\n      assertNotInfinite(size);\n      if (size > 0 && size < SIZE) {\n        return makeList(0, size, SHIFT, null, new VNode(iter.toArray()));\n      }\n      return empty.withMutations(function(list ) {\n        list.setSize(size);\n        iter.forEach(function(v, i)  {return list.set(i, v)});\n      });\n    }\n\n    List.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    List.prototype.toString = function() {\n      return this.__toString('List [', ']');\n    };\n\n    // @pragma Access\n\n    List.prototype.get = function(index, notSetValue) {\n      index = wrapIndex(this, index);\n      if (index >= 0 && index < this.size) {\n        index += this._origin;\n        var node = listNodeFor(this, index);\n        return node && node.array[index & MASK];\n      }\n      return notSetValue;\n    };\n\n    // @pragma Modification\n\n    List.prototype.set = function(index, value) {\n      return updateList(this, index, value);\n    };\n\n    List.prototype.remove = function(index) {\n      return !this.has(index) ? this :\n        index === 0 ? this.shift() :\n        index === this.size - 1 ? this.pop() :\n        this.splice(index, 1);\n    };\n\n    List.prototype.insert = function(index, value) {\n      return this.splice(index, 0, value);\n    };\n\n    List.prototype.clear = function() {\n      if (this.size === 0) {\n        return this;\n      }\n      if (this.__ownerID) {\n        this.size = this._origin = this._capacity = 0;\n        this._level = SHIFT;\n        this._root = this._tail = null;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return emptyList();\n    };\n\n    List.prototype.push = function(/*...values*/) {\n      var values = arguments;\n      var oldSize = this.size;\n      return this.withMutations(function(list ) {\n        setListBounds(list, 0, oldSize + values.length);\n        for (var ii = 0; ii < values.length; ii++) {\n          list.set(oldSize + ii, values[ii]);\n        }\n      });\n    };\n\n    List.prototype.pop = function() {\n      return setListBounds(this, 0, -1);\n    };\n\n    List.prototype.unshift = function(/*...values*/) {\n      var values = arguments;\n      return this.withMutations(function(list ) {\n        setListBounds(list, -values.length);\n        for (var ii = 0; ii < values.length; ii++) {\n          list.set(ii, values[ii]);\n        }\n      });\n    };\n\n    List.prototype.shift = function() {\n      return setListBounds(this, 1);\n    };\n\n    // @pragma Composition\n\n    List.prototype.merge = function(/*...iters*/) {\n      return mergeIntoListWith(this, undefined, arguments);\n    };\n\n    List.prototype.mergeWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return mergeIntoListWith(this, merger, iters);\n    };\n\n    List.prototype.mergeDeep = function(/*...iters*/) {\n      return mergeIntoListWith(this, deepMerger, arguments);\n    };\n\n    List.prototype.mergeDeepWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return mergeIntoListWith(this, deepMergerWith(merger), iters);\n    };\n\n    List.prototype.setSize = function(size) {\n      return setListBounds(this, 0, size);\n    };\n\n    // @pragma Iteration\n\n    List.prototype.slice = function(begin, end) {\n      var size = this.size;\n      if (wholeSlice(begin, end, size)) {\n        return this;\n      }\n      return setListBounds(\n        this,\n        resolveBegin(begin, size),\n        resolveEnd(end, size)\n      );\n    };\n\n    List.prototype.__iterator = function(type, reverse) {\n      var index = 0;\n      var values = iterateList(this, reverse);\n      return new Iterator(function()  {\n        var value = values();\n        return value === DONE ?\n          iteratorDone() :\n          iteratorValue(type, index++, value);\n      });\n    };\n\n    List.prototype.__iterate = function(fn, reverse) {\n      var index = 0;\n      var values = iterateList(this, reverse);\n      var value;\n      while ((value = values()) !== DONE) {\n        if (fn(value, index++, this) === false) {\n          break;\n        }\n      }\n      return index;\n    };\n\n    List.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        return this;\n      }\n      return makeList(this._origin, this._capacity, this._level, this._root, this._tail, ownerID, this.__hash);\n    };\n\n\n  function isList(maybeList) {\n    return !!(maybeList && maybeList[IS_LIST_SENTINEL]);\n  }\n\n  List.isList = isList;\n\n  var IS_LIST_SENTINEL = '@@__IMMUTABLE_LIST__@@';\n\n  var ListPrototype = List.prototype;\n  ListPrototype[IS_LIST_SENTINEL] = true;\n  ListPrototype[DELETE] = ListPrototype.remove;\n  ListPrototype.setIn = MapPrototype.setIn;\n  ListPrototype.deleteIn =\n  ListPrototype.removeIn = MapPrototype.removeIn;\n  ListPrototype.update = MapPrototype.update;\n  ListPrototype.updateIn = MapPrototype.updateIn;\n  ListPrototype.mergeIn = MapPrototype.mergeIn;\n  ListPrototype.mergeDeepIn = MapPrototype.mergeDeepIn;\n  ListPrototype.withMutations = MapPrototype.withMutations;\n  ListPrototype.asMutable = MapPrototype.asMutable;\n  ListPrototype.asImmutable = MapPrototype.asImmutable;\n  ListPrototype.wasAltered = MapPrototype.wasAltered;\n\n\n\n    function VNode(array, ownerID) {\n      this.array = array;\n      this.ownerID = ownerID;\n    }\n\n    // TODO: seems like these methods are very similar\n\n    VNode.prototype.removeBefore = function(ownerID, level, index) {\n      if (index === level ? 1 << level : 0 || this.array.length === 0) {\n        return this;\n      }\n      var originIndex = (index >>> level) & MASK;\n      if (originIndex >= this.array.length) {\n        return new VNode([], ownerID);\n      }\n      var removingFirst = originIndex === 0;\n      var newChild;\n      if (level > 0) {\n        var oldChild = this.array[originIndex];\n        newChild = oldChild && oldChild.removeBefore(ownerID, level - SHIFT, index);\n        if (newChild === oldChild && removingFirst) {\n          return this;\n        }\n      }\n      if (removingFirst && !newChild) {\n        return this;\n      }\n      var editable = editableVNode(this, ownerID);\n      if (!removingFirst) {\n        for (var ii = 0; ii < originIndex; ii++) {\n          editable.array[ii] = undefined;\n        }\n      }\n      if (newChild) {\n        editable.array[originIndex] = newChild;\n      }\n      return editable;\n    };\n\n    VNode.prototype.removeAfter = function(ownerID, level, index) {\n      if (index === (level ? 1 << level : 0) || this.array.length === 0) {\n        return this;\n      }\n      var sizeIndex = ((index - 1) >>> level) & MASK;\n      if (sizeIndex >= this.array.length) {\n        return this;\n      }\n\n      var newChild;\n      if (level > 0) {\n        var oldChild = this.array[sizeIndex];\n        newChild = oldChild && oldChild.removeAfter(ownerID, level - SHIFT, index);\n        if (newChild === oldChild && sizeIndex === this.array.length - 1) {\n          return this;\n        }\n      }\n\n      var editable = editableVNode(this, ownerID);\n      editable.array.splice(sizeIndex + 1);\n      if (newChild) {\n        editable.array[sizeIndex] = newChild;\n      }\n      return editable;\n    };\n\n\n\n  var DONE = {};\n\n  function iterateList(list, reverse) {\n    var left = list._origin;\n    var right = list._capacity;\n    var tailPos = getTailOffset(right);\n    var tail = list._tail;\n\n    return iterateNodeOrLeaf(list._root, list._level, 0);\n\n    function iterateNodeOrLeaf(node, level, offset) {\n      return level === 0 ?\n        iterateLeaf(node, offset) :\n        iterateNode(node, level, offset);\n    }\n\n    function iterateLeaf(node, offset) {\n      var array = offset === tailPos ? tail && tail.array : node && node.array;\n      var from = offset > left ? 0 : left - offset;\n      var to = right - offset;\n      if (to > SIZE) {\n        to = SIZE;\n      }\n      return function()  {\n        if (from === to) {\n          return DONE;\n        }\n        var idx = reverse ? --to : from++;\n        return array && array[idx];\n      };\n    }\n\n    function iterateNode(node, level, offset) {\n      var values;\n      var array = node && node.array;\n      var from = offset > left ? 0 : (left - offset) >> level;\n      var to = ((right - offset) >> level) + 1;\n      if (to > SIZE) {\n        to = SIZE;\n      }\n      return function()  {\n        do {\n          if (values) {\n            var value = values();\n            if (value !== DONE) {\n              return value;\n            }\n            values = null;\n          }\n          if (from === to) {\n            return DONE;\n          }\n          var idx = reverse ? --to : from++;\n          values = iterateNodeOrLeaf(\n            array && array[idx], level - SHIFT, offset + (idx << level)\n          );\n        } while (true);\n      };\n    }\n  }\n\n  function makeList(origin, capacity, level, root, tail, ownerID, hash) {\n    var list = Object.create(ListPrototype);\n    list.size = capacity - origin;\n    list._origin = origin;\n    list._capacity = capacity;\n    list._level = level;\n    list._root = root;\n    list._tail = tail;\n    list.__ownerID = ownerID;\n    list.__hash = hash;\n    list.__altered = false;\n    return list;\n  }\n\n  var EMPTY_LIST;\n  function emptyList() {\n    return EMPTY_LIST || (EMPTY_LIST = makeList(0, 0, SHIFT));\n  }\n\n  function updateList(list, index, value) {\n    index = wrapIndex(list, index);\n\n    if (index !== index) {\n      return list;\n    }\n\n    if (index >= list.size || index < 0) {\n      return list.withMutations(function(list ) {\n        index < 0 ?\n          setListBounds(list, index).set(0, value) :\n          setListBounds(list, 0, index + 1).set(index, value)\n      });\n    }\n\n    index += list._origin;\n\n    var newTail = list._tail;\n    var newRoot = list._root;\n    var didAlter = MakeRef(DID_ALTER);\n    if (index >= getTailOffset(list._capacity)) {\n      newTail = updateVNode(newTail, list.__ownerID, 0, index, value, didAlter);\n    } else {\n      newRoot = updateVNode(newRoot, list.__ownerID, list._level, index, value, didAlter);\n    }\n\n    if (!didAlter.value) {\n      return list;\n    }\n\n    if (list.__ownerID) {\n      list._root = newRoot;\n      list._tail = newTail;\n      list.__hash = undefined;\n      list.__altered = true;\n      return list;\n    }\n    return makeList(list._origin, list._capacity, list._level, newRoot, newTail);\n  }\n\n  function updateVNode(node, ownerID, level, index, value, didAlter) {\n    var idx = (index >>> level) & MASK;\n    var nodeHas = node && idx < node.array.length;\n    if (!nodeHas && value === undefined) {\n      return node;\n    }\n\n    var newNode;\n\n    if (level > 0) {\n      var lowerNode = node && node.array[idx];\n      var newLowerNode = updateVNode(lowerNode, ownerID, level - SHIFT, index, value, didAlter);\n      if (newLowerNode === lowerNode) {\n        return node;\n      }\n      newNode = editableVNode(node, ownerID);\n      newNode.array[idx] = newLowerNode;\n      return newNode;\n    }\n\n    if (nodeHas && node.array[idx] === value) {\n      return node;\n    }\n\n    SetRef(didAlter);\n\n    newNode = editableVNode(node, ownerID);\n    if (value === undefined && idx === newNode.array.length - 1) {\n      newNode.array.pop();\n    } else {\n      newNode.array[idx] = value;\n    }\n    return newNode;\n  }\n\n  function editableVNode(node, ownerID) {\n    if (ownerID && node && ownerID === node.ownerID) {\n      return node;\n    }\n    return new VNode(node ? node.array.slice() : [], ownerID);\n  }\n\n  function listNodeFor(list, rawIndex) {\n    if (rawIndex >= getTailOffset(list._capacity)) {\n      return list._tail;\n    }\n    if (rawIndex < 1 << (list._level + SHIFT)) {\n      var node = list._root;\n      var level = list._level;\n      while (node && level > 0) {\n        node = node.array[(rawIndex >>> level) & MASK];\n        level -= SHIFT;\n      }\n      return node;\n    }\n  }\n\n  function setListBounds(list, begin, end) {\n    // Sanitize begin & end using this shorthand for ToInt32(argument)\n    // http://www.ecma-international.org/ecma-262/6.0/#sec-toint32\n    if (begin !== undefined) {\n      begin = begin | 0;\n    }\n    if (end !== undefined) {\n      end = end | 0;\n    }\n    var owner = list.__ownerID || new OwnerID();\n    var oldOrigin = list._origin;\n    var oldCapacity = list._capacity;\n    var newOrigin = oldOrigin + begin;\n    var newCapacity = end === undefined ? oldCapacity : end < 0 ? oldCapacity + end : oldOrigin + end;\n    if (newOrigin === oldOrigin && newCapacity === oldCapacity) {\n      return list;\n    }\n\n    // If it's going to end after it starts, it's empty.\n    if (newOrigin >= newCapacity) {\n      return list.clear();\n    }\n\n    var newLevel = list._level;\n    var newRoot = list._root;\n\n    // New origin might need creating a higher root.\n    var offsetShift = 0;\n    while (newOrigin + offsetShift < 0) {\n      newRoot = new VNode(newRoot && newRoot.array.length ? [undefined, newRoot] : [], owner);\n      newLevel += SHIFT;\n      offsetShift += 1 << newLevel;\n    }\n    if (offsetShift) {\n      newOrigin += offsetShift;\n      oldOrigin += offsetShift;\n      newCapacity += offsetShift;\n      oldCapacity += offsetShift;\n    }\n\n    var oldTailOffset = getTailOffset(oldCapacity);\n    var newTailOffset = getTailOffset(newCapacity);\n\n    // New size might need creating a higher root.\n    while (newTailOffset >= 1 << (newLevel + SHIFT)) {\n      newRoot = new VNode(newRoot && newRoot.array.length ? [newRoot] : [], owner);\n      newLevel += SHIFT;\n    }\n\n    // Locate or create the new tail.\n    var oldTail = list._tail;\n    var newTail = newTailOffset < oldTailOffset ?\n      listNodeFor(list, newCapacity - 1) :\n      newTailOffset > oldTailOffset ? new VNode([], owner) : oldTail;\n\n    // Merge Tail into tree.\n    if (oldTail && newTailOffset > oldTailOffset && newOrigin < oldCapacity && oldTail.array.length) {\n      newRoot = editableVNode(newRoot, owner);\n      var node = newRoot;\n      for (var level = newLevel; level > SHIFT; level -= SHIFT) {\n        var idx = (oldTailOffset >>> level) & MASK;\n        node = node.array[idx] = editableVNode(node.array[idx], owner);\n      }\n      node.array[(oldTailOffset >>> SHIFT) & MASK] = oldTail;\n    }\n\n    // If the size has been reduced, there's a chance the tail needs to be trimmed.\n    if (newCapacity < oldCapacity) {\n      newTail = newTail && newTail.removeAfter(owner, 0, newCapacity);\n    }\n\n    // If the new origin is within the tail, then we do not need a root.\n    if (newOrigin >= newTailOffset) {\n      newOrigin -= newTailOffset;\n      newCapacity -= newTailOffset;\n      newLevel = SHIFT;\n      newRoot = null;\n      newTail = newTail && newTail.removeBefore(owner, 0, newOrigin);\n\n    // Otherwise, if the root has been trimmed, garbage collect.\n    } else if (newOrigin > oldOrigin || newTailOffset < oldTailOffset) {\n      offsetShift = 0;\n\n      // Identify the new top root node of the subtree of the old root.\n      while (newRoot) {\n        var beginIndex = (newOrigin >>> newLevel) & MASK;\n        if (beginIndex !== (newTailOffset >>> newLevel) & MASK) {\n          break;\n        }\n        if (beginIndex) {\n          offsetShift += (1 << newLevel) * beginIndex;\n        }\n        newLevel -= SHIFT;\n        newRoot = newRoot.array[beginIndex];\n      }\n\n      // Trim the new sides of the new root.\n      if (newRoot && newOrigin > oldOrigin) {\n        newRoot = newRoot.removeBefore(owner, newLevel, newOrigin - offsetShift);\n      }\n      if (newRoot && newTailOffset < oldTailOffset) {\n        newRoot = newRoot.removeAfter(owner, newLevel, newTailOffset - offsetShift);\n      }\n      if (offsetShift) {\n        newOrigin -= offsetShift;\n        newCapacity -= offsetShift;\n      }\n    }\n\n    if (list.__ownerID) {\n      list.size = newCapacity - newOrigin;\n      list._origin = newOrigin;\n      list._capacity = newCapacity;\n      list._level = newLevel;\n      list._root = newRoot;\n      list._tail = newTail;\n      list.__hash = undefined;\n      list.__altered = true;\n      return list;\n    }\n    return makeList(newOrigin, newCapacity, newLevel, newRoot, newTail);\n  }\n\n  function mergeIntoListWith(list, merger, iterables) {\n    var iters = [];\n    var maxSize = 0;\n    for (var ii = 0; ii < iterables.length; ii++) {\n      var value = iterables[ii];\n      var iter = IndexedIterable(value);\n      if (iter.size > maxSize) {\n        maxSize = iter.size;\n      }\n      if (!isIterable(value)) {\n        iter = iter.map(function(v ) {return fromJS(v)});\n      }\n      iters.push(iter);\n    }\n    if (maxSize > list.size) {\n      list = list.setSize(maxSize);\n    }\n    return mergeIntoCollectionWith(list, merger, iters);\n  }\n\n  function getTailOffset(size) {\n    return size < SIZE ? 0 : (((size - 1) >>> SHIFT) << SHIFT);\n  }\n\n  createClass(OrderedMap, Map);\n\n    // @pragma Construction\n\n    function OrderedMap(value) {\n      return value === null || value === undefined ? emptyOrderedMap() :\n        isOrderedMap(value) ? value :\n        emptyOrderedMap().withMutations(function(map ) {\n          var iter = KeyedIterable(value);\n          assertNotInfinite(iter.size);\n          iter.forEach(function(v, k)  {return map.set(k, v)});\n        });\n    }\n\n    OrderedMap.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    OrderedMap.prototype.toString = function() {\n      return this.__toString('OrderedMap {', '}');\n    };\n\n    // @pragma Access\n\n    OrderedMap.prototype.get = function(k, notSetValue) {\n      var index = this._map.get(k);\n      return index !== undefined ? this._list.get(index)[1] : notSetValue;\n    };\n\n    // @pragma Modification\n\n    OrderedMap.prototype.clear = function() {\n      if (this.size === 0) {\n        return this;\n      }\n      if (this.__ownerID) {\n        this.size = 0;\n        this._map.clear();\n        this._list.clear();\n        return this;\n      }\n      return emptyOrderedMap();\n    };\n\n    OrderedMap.prototype.set = function(k, v) {\n      return updateOrderedMap(this, k, v);\n    };\n\n    OrderedMap.prototype.remove = function(k) {\n      return updateOrderedMap(this, k, NOT_SET);\n    };\n\n    OrderedMap.prototype.wasAltered = function() {\n      return this._map.wasAltered() || this._list.wasAltered();\n    };\n\n    OrderedMap.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return this._list.__iterate(\n        function(entry ) {return entry && fn(entry[1], entry[0], this$0)},\n        reverse\n      );\n    };\n\n    OrderedMap.prototype.__iterator = function(type, reverse) {\n      return this._list.fromEntrySeq().__iterator(type, reverse);\n    };\n\n    OrderedMap.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      var newMap = this._map.__ensureOwner(ownerID);\n      var newList = this._list.__ensureOwner(ownerID);\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this._map = newMap;\n        this._list = newList;\n        return this;\n      }\n      return makeOrderedMap(newMap, newList, ownerID, this.__hash);\n    };\n\n\n  function isOrderedMap(maybeOrderedMap) {\n    return isMap(maybeOrderedMap) && isOrdered(maybeOrderedMap);\n  }\n\n  OrderedMap.isOrderedMap = isOrderedMap;\n\n  OrderedMap.prototype[IS_ORDERED_SENTINEL] = true;\n  OrderedMap.prototype[DELETE] = OrderedMap.prototype.remove;\n\n\n\n  function makeOrderedMap(map, list, ownerID, hash) {\n    var omap = Object.create(OrderedMap.prototype);\n    omap.size = map ? map.size : 0;\n    omap._map = map;\n    omap._list = list;\n    omap.__ownerID = ownerID;\n    omap.__hash = hash;\n    return omap;\n  }\n\n  var EMPTY_ORDERED_MAP;\n  function emptyOrderedMap() {\n    return EMPTY_ORDERED_MAP || (EMPTY_ORDERED_MAP = makeOrderedMap(emptyMap(), emptyList()));\n  }\n\n  function updateOrderedMap(omap, k, v) {\n    var map = omap._map;\n    var list = omap._list;\n    var i = map.get(k);\n    var has = i !== undefined;\n    var newMap;\n    var newList;\n    if (v === NOT_SET) { // removed\n      if (!has) {\n        return omap;\n      }\n      if (list.size >= SIZE && list.size >= map.size * 2) {\n        newList = list.filter(function(entry, idx)  {return entry !== undefined && i !== idx});\n        newMap = newList.toKeyedSeq().map(function(entry ) {return entry[0]}).flip().toMap();\n        if (omap.__ownerID) {\n          newMap.__ownerID = newList.__ownerID = omap.__ownerID;\n        }\n      } else {\n        newMap = map.remove(k);\n        newList = i === list.size - 1 ? list.pop() : list.set(i, undefined);\n      }\n    } else {\n      if (has) {\n        if (v === list.get(i)[1]) {\n          return omap;\n        }\n        newMap = map;\n        newList = list.set(i, [k, v]);\n      } else {\n        newMap = map.set(k, list.size);\n        newList = list.set(list.size, [k, v]);\n      }\n    }\n    if (omap.__ownerID) {\n      omap.size = newMap.size;\n      omap._map = newMap;\n      omap._list = newList;\n      omap.__hash = undefined;\n      return omap;\n    }\n    return makeOrderedMap(newMap, newList);\n  }\n\n  createClass(ToKeyedSequence, KeyedSeq);\n    function ToKeyedSequence(indexed, useKeys) {\n      this._iter = indexed;\n      this._useKeys = useKeys;\n      this.size = indexed.size;\n    }\n\n    ToKeyedSequence.prototype.get = function(key, notSetValue) {\n      return this._iter.get(key, notSetValue);\n    };\n\n    ToKeyedSequence.prototype.has = function(key) {\n      return this._iter.has(key);\n    };\n\n    ToKeyedSequence.prototype.valueSeq = function() {\n      return this._iter.valueSeq();\n    };\n\n    ToKeyedSequence.prototype.reverse = function() {var this$0 = this;\n      var reversedSequence = reverseFactory(this, true);\n      if (!this._useKeys) {\n        reversedSequence.valueSeq = function()  {return this$0._iter.toSeq().reverse()};\n      }\n      return reversedSequence;\n    };\n\n    ToKeyedSequence.prototype.map = function(mapper, context) {var this$0 = this;\n      var mappedSequence = mapFactory(this, mapper, context);\n      if (!this._useKeys) {\n        mappedSequence.valueSeq = function()  {return this$0._iter.toSeq().map(mapper, context)};\n      }\n      return mappedSequence;\n    };\n\n    ToKeyedSequence.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      var ii;\n      return this._iter.__iterate(\n        this._useKeys ?\n          function(v, k)  {return fn(v, k, this$0)} :\n          ((ii = reverse ? resolveSize(this) : 0),\n            function(v ) {return fn(v, reverse ? --ii : ii++, this$0)}),\n        reverse\n      );\n    };\n\n    ToKeyedSequence.prototype.__iterator = function(type, reverse) {\n      if (this._useKeys) {\n        return this._iter.__iterator(type, reverse);\n      }\n      var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n      var ii = reverse ? resolveSize(this) : 0;\n      return new Iterator(function()  {\n        var step = iterator.next();\n        return step.done ? step :\n          iteratorValue(type, reverse ? --ii : ii++, step.value, step);\n      });\n    };\n\n  ToKeyedSequence.prototype[IS_ORDERED_SENTINEL] = true;\n\n\n  createClass(ToIndexedSequence, IndexedSeq);\n    function ToIndexedSequence(iter) {\n      this._iter = iter;\n      this.size = iter.size;\n    }\n\n    ToIndexedSequence.prototype.includes = function(value) {\n      return this._iter.includes(value);\n    };\n\n    ToIndexedSequence.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      var iterations = 0;\n      return this._iter.__iterate(function(v ) {return fn(v, iterations++, this$0)}, reverse);\n    };\n\n    ToIndexedSequence.prototype.__iterator = function(type, reverse) {\n      var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n      var iterations = 0;\n      return new Iterator(function()  {\n        var step = iterator.next();\n        return step.done ? step :\n          iteratorValue(type, iterations++, step.value, step)\n      });\n    };\n\n\n\n  createClass(ToSetSequence, SetSeq);\n    function ToSetSequence(iter) {\n      this._iter = iter;\n      this.size = iter.size;\n    }\n\n    ToSetSequence.prototype.has = function(key) {\n      return this._iter.includes(key);\n    };\n\n    ToSetSequence.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return this._iter.__iterate(function(v ) {return fn(v, v, this$0)}, reverse);\n    };\n\n    ToSetSequence.prototype.__iterator = function(type, reverse) {\n      var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n      return new Iterator(function()  {\n        var step = iterator.next();\n        return step.done ? step :\n          iteratorValue(type, step.value, step.value, step);\n      });\n    };\n\n\n\n  createClass(FromEntriesSequence, KeyedSeq);\n    function FromEntriesSequence(entries) {\n      this._iter = entries;\n      this.size = entries.size;\n    }\n\n    FromEntriesSequence.prototype.entrySeq = function() {\n      return this._iter.toSeq();\n    };\n\n    FromEntriesSequence.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return this._iter.__iterate(function(entry ) {\n        // Check if entry exists first so array access doesn't throw for holes\n        // in the parent iteration.\n        if (entry) {\n          validateEntry(entry);\n          var indexedIterable = isIterable(entry);\n          return fn(\n            indexedIterable ? entry.get(1) : entry[1],\n            indexedIterable ? entry.get(0) : entry[0],\n            this$0\n          );\n        }\n      }, reverse);\n    };\n\n    FromEntriesSequence.prototype.__iterator = function(type, reverse) {\n      var iterator = this._iter.__iterator(ITERATE_VALUES, reverse);\n      return new Iterator(function()  {\n        while (true) {\n          var step = iterator.next();\n          if (step.done) {\n            return step;\n          }\n          var entry = step.value;\n          // Check if entry exists first so array access doesn't throw for holes\n          // in the parent iteration.\n          if (entry) {\n            validateEntry(entry);\n            var indexedIterable = isIterable(entry);\n            return iteratorValue(\n              type,\n              indexedIterable ? entry.get(0) : entry[0],\n              indexedIterable ? entry.get(1) : entry[1],\n              step\n            );\n          }\n        }\n      });\n    };\n\n\n  ToIndexedSequence.prototype.cacheResult =\n  ToKeyedSequence.prototype.cacheResult =\n  ToSetSequence.prototype.cacheResult =\n  FromEntriesSequence.prototype.cacheResult =\n    cacheResultThrough;\n\n\n  function flipFactory(iterable) {\n    var flipSequence = makeSequence(iterable);\n    flipSequence._iter = iterable;\n    flipSequence.size = iterable.size;\n    flipSequence.flip = function()  {return iterable};\n    flipSequence.reverse = function () {\n      var reversedSequence = iterable.reverse.apply(this); // super.reverse()\n      reversedSequence.flip = function()  {return iterable.reverse()};\n      return reversedSequence;\n    };\n    flipSequence.has = function(key ) {return iterable.includes(key)};\n    flipSequence.includes = function(key ) {return iterable.has(key)};\n    flipSequence.cacheResult = cacheResultThrough;\n    flipSequence.__iterateUncached = function (fn, reverse) {var this$0 = this;\n      return iterable.__iterate(function(v, k)  {return fn(k, v, this$0) !== false}, reverse);\n    }\n    flipSequence.__iteratorUncached = function(type, reverse) {\n      if (type === ITERATE_ENTRIES) {\n        var iterator = iterable.__iterator(type, reverse);\n        return new Iterator(function()  {\n          var step = iterator.next();\n          if (!step.done) {\n            var k = step.value[0];\n            step.value[0] = step.value[1];\n            step.value[1] = k;\n          }\n          return step;\n        });\n      }\n      return iterable.__iterator(\n        type === ITERATE_VALUES ? ITERATE_KEYS : ITERATE_VALUES,\n        reverse\n      );\n    }\n    return flipSequence;\n  }\n\n\n  function mapFactory(iterable, mapper, context) {\n    var mappedSequence = makeSequence(iterable);\n    mappedSequence.size = iterable.size;\n    mappedSequence.has = function(key ) {return iterable.has(key)};\n    mappedSequence.get = function(key, notSetValue)  {\n      var v = iterable.get(key, NOT_SET);\n      return v === NOT_SET ?\n        notSetValue :\n        mapper.call(context, v, key, iterable);\n    };\n    mappedSequence.__iterateUncached = function (fn, reverse) {var this$0 = this;\n      return iterable.__iterate(\n        function(v, k, c)  {return fn(mapper.call(context, v, k, c), k, this$0) !== false},\n        reverse\n      );\n    }\n    mappedSequence.__iteratorUncached = function (type, reverse) {\n      var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n      return new Iterator(function()  {\n        var step = iterator.next();\n        if (step.done) {\n          return step;\n        }\n        var entry = step.value;\n        var key = entry[0];\n        return iteratorValue(\n          type,\n          key,\n          mapper.call(context, entry[1], key, iterable),\n          step\n        );\n      });\n    }\n    return mappedSequence;\n  }\n\n\n  function reverseFactory(iterable, useKeys) {\n    var reversedSequence = makeSequence(iterable);\n    reversedSequence._iter = iterable;\n    reversedSequence.size = iterable.size;\n    reversedSequence.reverse = function()  {return iterable};\n    if (iterable.flip) {\n      reversedSequence.flip = function () {\n        var flipSequence = flipFactory(iterable);\n        flipSequence.reverse = function()  {return iterable.flip()};\n        return flipSequence;\n      };\n    }\n    reversedSequence.get = function(key, notSetValue) \n      {return iterable.get(useKeys ? key : -1 - key, notSetValue)};\n    reversedSequence.has = function(key )\n      {return iterable.has(useKeys ? key : -1 - key)};\n    reversedSequence.includes = function(value ) {return iterable.includes(value)};\n    reversedSequence.cacheResult = cacheResultThrough;\n    reversedSequence.__iterate = function (fn, reverse) {var this$0 = this;\n      return iterable.__iterate(function(v, k)  {return fn(v, k, this$0)}, !reverse);\n    };\n    reversedSequence.__iterator =\n      function(type, reverse)  {return iterable.__iterator(type, !reverse)};\n    return reversedSequence;\n  }\n\n\n  function filterFactory(iterable, predicate, context, useKeys) {\n    var filterSequence = makeSequence(iterable);\n    if (useKeys) {\n      filterSequence.has = function(key ) {\n        var v = iterable.get(key, NOT_SET);\n        return v !== NOT_SET && !!predicate.call(context, v, key, iterable);\n      };\n      filterSequence.get = function(key, notSetValue)  {\n        var v = iterable.get(key, NOT_SET);\n        return v !== NOT_SET && predicate.call(context, v, key, iterable) ?\n          v : notSetValue;\n      };\n    }\n    filterSequence.__iterateUncached = function (fn, reverse) {var this$0 = this;\n      var iterations = 0;\n      iterable.__iterate(function(v, k, c)  {\n        if (predicate.call(context, v, k, c)) {\n          iterations++;\n          return fn(v, useKeys ? k : iterations - 1, this$0);\n        }\n      }, reverse);\n      return iterations;\n    };\n    filterSequence.__iteratorUncached = function (type, reverse) {\n      var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n      var iterations = 0;\n      return new Iterator(function()  {\n        while (true) {\n          var step = iterator.next();\n          if (step.done) {\n            return step;\n          }\n          var entry = step.value;\n          var key = entry[0];\n          var value = entry[1];\n          if (predicate.call(context, value, key, iterable)) {\n            return iteratorValue(type, useKeys ? key : iterations++, value, step);\n          }\n        }\n      });\n    }\n    return filterSequence;\n  }\n\n\n  function countByFactory(iterable, grouper, context) {\n    var groups = Map().asMutable();\n    iterable.__iterate(function(v, k)  {\n      groups.update(\n        grouper.call(context, v, k, iterable),\n        0,\n        function(a ) {return a + 1}\n      );\n    });\n    return groups.asImmutable();\n  }\n\n\n  function groupByFactory(iterable, grouper, context) {\n    var isKeyedIter = isKeyed(iterable);\n    var groups = (isOrdered(iterable) ? OrderedMap() : Map()).asMutable();\n    iterable.__iterate(function(v, k)  {\n      groups.update(\n        grouper.call(context, v, k, iterable),\n        function(a ) {return (a = a || [], a.push(isKeyedIter ? [k, v] : v), a)}\n      );\n    });\n    var coerce = iterableClass(iterable);\n    return groups.map(function(arr ) {return reify(iterable, coerce(arr))});\n  }\n\n\n  function sliceFactory(iterable, begin, end, useKeys) {\n    var originalSize = iterable.size;\n\n    // Sanitize begin & end using this shorthand for ToInt32(argument)\n    // http://www.ecma-international.org/ecma-262/6.0/#sec-toint32\n    if (begin !== undefined) {\n      begin = begin | 0;\n    }\n    if (end !== undefined) {\n      end = end | 0;\n    }\n\n    if (wholeSlice(begin, end, originalSize)) {\n      return iterable;\n    }\n\n    var resolvedBegin = resolveBegin(begin, originalSize);\n    var resolvedEnd = resolveEnd(end, originalSize);\n\n    // begin or end will be NaN if they were provided as negative numbers and\n    // this iterable's size is unknown. In that case, cache first so there is\n    // a known size and these do not resolve to NaN.\n    if (resolvedBegin !== resolvedBegin || resolvedEnd !== resolvedEnd) {\n      return sliceFactory(iterable.toSeq().cacheResult(), begin, end, useKeys);\n    }\n\n    // Note: resolvedEnd is undefined when the original sequence's length is\n    // unknown and this slice did not supply an end and should contain all\n    // elements after resolvedBegin.\n    // In that case, resolvedSize will be NaN and sliceSize will remain undefined.\n    var resolvedSize = resolvedEnd - resolvedBegin;\n    var sliceSize;\n    if (resolvedSize === resolvedSize) {\n      sliceSize = resolvedSize < 0 ? 0 : resolvedSize;\n    }\n\n    var sliceSeq = makeSequence(iterable);\n\n    // If iterable.size is undefined, the size of the realized sliceSeq is\n    // unknown at this point unless the number of items to slice is 0\n    sliceSeq.size = sliceSize === 0 ? sliceSize : iterable.size && sliceSize || undefined;\n\n    if (!useKeys && isSeq(iterable) && sliceSize >= 0) {\n      sliceSeq.get = function (index, notSetValue) {\n        index = wrapIndex(this, index);\n        return index >= 0 && index < sliceSize ?\n          iterable.get(index + resolvedBegin, notSetValue) :\n          notSetValue;\n      }\n    }\n\n    sliceSeq.__iterateUncached = function(fn, reverse) {var this$0 = this;\n      if (sliceSize === 0) {\n        return 0;\n      }\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var skipped = 0;\n      var isSkipping = true;\n      var iterations = 0;\n      iterable.__iterate(function(v, k)  {\n        if (!(isSkipping && (isSkipping = skipped++ < resolvedBegin))) {\n          iterations++;\n          return fn(v, useKeys ? k : iterations - 1, this$0) !== false &&\n                 iterations !== sliceSize;\n        }\n      });\n      return iterations;\n    };\n\n    sliceSeq.__iteratorUncached = function(type, reverse) {\n      if (sliceSize !== 0 && reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      // Don't bother instantiating parent iterator if taking 0.\n      var iterator = sliceSize !== 0 && iterable.__iterator(type, reverse);\n      var skipped = 0;\n      var iterations = 0;\n      return new Iterator(function()  {\n        while (skipped++ < resolvedBegin) {\n          iterator.next();\n        }\n        if (++iterations > sliceSize) {\n          return iteratorDone();\n        }\n        var step = iterator.next();\n        if (useKeys || type === ITERATE_VALUES) {\n          return step;\n        } else if (type === ITERATE_KEYS) {\n          return iteratorValue(type, iterations - 1, undefined, step);\n        } else {\n          return iteratorValue(type, iterations - 1, step.value[1], step);\n        }\n      });\n    }\n\n    return sliceSeq;\n  }\n\n\n  function takeWhileFactory(iterable, predicate, context) {\n    var takeSequence = makeSequence(iterable);\n    takeSequence.__iterateUncached = function(fn, reverse) {var this$0 = this;\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var iterations = 0;\n      iterable.__iterate(function(v, k, c) \n        {return predicate.call(context, v, k, c) && ++iterations && fn(v, k, this$0)}\n      );\n      return iterations;\n    };\n    takeSequence.__iteratorUncached = function(type, reverse) {var this$0 = this;\n      if (reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n      var iterating = true;\n      return new Iterator(function()  {\n        if (!iterating) {\n          return iteratorDone();\n        }\n        var step = iterator.next();\n        if (step.done) {\n          return step;\n        }\n        var entry = step.value;\n        var k = entry[0];\n        var v = entry[1];\n        if (!predicate.call(context, v, k, this$0)) {\n          iterating = false;\n          return iteratorDone();\n        }\n        return type === ITERATE_ENTRIES ? step :\n          iteratorValue(type, k, v, step);\n      });\n    };\n    return takeSequence;\n  }\n\n\n  function skipWhileFactory(iterable, predicate, context, useKeys) {\n    var skipSequence = makeSequence(iterable);\n    skipSequence.__iterateUncached = function (fn, reverse) {var this$0 = this;\n      if (reverse) {\n        return this.cacheResult().__iterate(fn, reverse);\n      }\n      var isSkipping = true;\n      var iterations = 0;\n      iterable.__iterate(function(v, k, c)  {\n        if (!(isSkipping && (isSkipping = predicate.call(context, v, k, c)))) {\n          iterations++;\n          return fn(v, useKeys ? k : iterations - 1, this$0);\n        }\n      });\n      return iterations;\n    };\n    skipSequence.__iteratorUncached = function(type, reverse) {var this$0 = this;\n      if (reverse) {\n        return this.cacheResult().__iterator(type, reverse);\n      }\n      var iterator = iterable.__iterator(ITERATE_ENTRIES, reverse);\n      var skipping = true;\n      var iterations = 0;\n      return new Iterator(function()  {\n        var step, k, v;\n        do {\n          step = iterator.next();\n          if (step.done) {\n            if (useKeys || type === ITERATE_VALUES) {\n              return step;\n            } else if (type === ITERATE_KEYS) {\n              return iteratorValue(type, iterations++, undefined, step);\n            } else {\n              return iteratorValue(type, iterations++, step.value[1], step);\n            }\n          }\n          var entry = step.value;\n          k = entry[0];\n          v = entry[1];\n          skipping && (skipping = predicate.call(context, v, k, this$0));\n        } while (skipping);\n        return type === ITERATE_ENTRIES ? step :\n          iteratorValue(type, k, v, step);\n      });\n    };\n    return skipSequence;\n  }\n\n\n  function concatFactory(iterable, values) {\n    var isKeyedIterable = isKeyed(iterable);\n    var iters = [iterable].concat(values).map(function(v ) {\n      if (!isIterable(v)) {\n        v = isKeyedIterable ?\n          keyedSeqFromValue(v) :\n          indexedSeqFromValue(Array.isArray(v) ? v : [v]);\n      } else if (isKeyedIterable) {\n        v = KeyedIterable(v);\n      }\n      return v;\n    }).filter(function(v ) {return v.size !== 0});\n\n    if (iters.length === 0) {\n      return iterable;\n    }\n\n    if (iters.length === 1) {\n      var singleton = iters[0];\n      if (singleton === iterable ||\n          isKeyedIterable && isKeyed(singleton) ||\n          isIndexed(iterable) && isIndexed(singleton)) {\n        return singleton;\n      }\n    }\n\n    var concatSeq = new ArraySeq(iters);\n    if (isKeyedIterable) {\n      concatSeq = concatSeq.toKeyedSeq();\n    } else if (!isIndexed(iterable)) {\n      concatSeq = concatSeq.toSetSeq();\n    }\n    concatSeq = concatSeq.flatten(true);\n    concatSeq.size = iters.reduce(\n      function(sum, seq)  {\n        if (sum !== undefined) {\n          var size = seq.size;\n          if (size !== undefined) {\n            return sum + size;\n          }\n        }\n      },\n      0\n    );\n    return concatSeq;\n  }\n\n\n  function flattenFactory(iterable, depth, useKeys) {\n    var flatSequence = makeSequence(iterable);\n    flatSequence.__iterateUncached = function(fn, reverse) {\n      var iterations = 0;\n      var stopped = false;\n      function flatDeep(iter, currentDepth) {var this$0 = this;\n        iter.__iterate(function(v, k)  {\n          if ((!depth || currentDepth < depth) && isIterable(v)) {\n            flatDeep(v, currentDepth + 1);\n          } else if (fn(v, useKeys ? k : iterations++, this$0) === false) {\n            stopped = true;\n          }\n          return !stopped;\n        }, reverse);\n      }\n      flatDeep(iterable, 0);\n      return iterations;\n    }\n    flatSequence.__iteratorUncached = function(type, reverse) {\n      var iterator = iterable.__iterator(type, reverse);\n      var stack = [];\n      var iterations = 0;\n      return new Iterator(function()  {\n        while (iterator) {\n          var step = iterator.next();\n          if (step.done !== false) {\n            iterator = stack.pop();\n            continue;\n          }\n          var v = step.value;\n          if (type === ITERATE_ENTRIES) {\n            v = v[1];\n          }\n          if ((!depth || stack.length < depth) && isIterable(v)) {\n            stack.push(iterator);\n            iterator = v.__iterator(type, reverse);\n          } else {\n            return useKeys ? step : iteratorValue(type, iterations++, v, step);\n          }\n        }\n        return iteratorDone();\n      });\n    }\n    return flatSequence;\n  }\n\n\n  function flatMapFactory(iterable, mapper, context) {\n    var coerce = iterableClass(iterable);\n    return iterable.toSeq().map(\n      function(v, k)  {return coerce(mapper.call(context, v, k, iterable))}\n    ).flatten(true);\n  }\n\n\n  function interposeFactory(iterable, separator) {\n    var interposedSequence = makeSequence(iterable);\n    interposedSequence.size = iterable.size && iterable.size * 2 -1;\n    interposedSequence.__iterateUncached = function(fn, reverse) {var this$0 = this;\n      var iterations = 0;\n      iterable.__iterate(function(v, k) \n        {return (!iterations || fn(separator, iterations++, this$0) !== false) &&\n        fn(v, iterations++, this$0) !== false},\n        reverse\n      );\n      return iterations;\n    };\n    interposedSequence.__iteratorUncached = function(type, reverse) {\n      var iterator = iterable.__iterator(ITERATE_VALUES, reverse);\n      var iterations = 0;\n      var step;\n      return new Iterator(function()  {\n        if (!step || iterations % 2) {\n          step = iterator.next();\n          if (step.done) {\n            return step;\n          }\n        }\n        return iterations % 2 ?\n          iteratorValue(type, iterations++, separator) :\n          iteratorValue(type, iterations++, step.value, step);\n      });\n    };\n    return interposedSequence;\n  }\n\n\n  function sortFactory(iterable, comparator, mapper) {\n    if (!comparator) {\n      comparator = defaultComparator;\n    }\n    var isKeyedIterable = isKeyed(iterable);\n    var index = 0;\n    var entries = iterable.toSeq().map(\n      function(v, k)  {return [k, v, index++, mapper ? mapper(v, k, iterable) : v]}\n    ).toArray();\n    entries.sort(function(a, b)  {return comparator(a[3], b[3]) || a[2] - b[2]}).forEach(\n      isKeyedIterable ?\n      function(v, i)  { entries[i].length = 2; } :\n      function(v, i)  { entries[i] = v[1]; }\n    );\n    return isKeyedIterable ? KeyedSeq(entries) :\n      isIndexed(iterable) ? IndexedSeq(entries) :\n      SetSeq(entries);\n  }\n\n\n  function maxFactory(iterable, comparator, mapper) {\n    if (!comparator) {\n      comparator = defaultComparator;\n    }\n    if (mapper) {\n      var entry = iterable.toSeq()\n        .map(function(v, k)  {return [v, mapper(v, k, iterable)]})\n        .reduce(function(a, b)  {return maxCompare(comparator, a[1], b[1]) ? b : a});\n      return entry && entry[0];\n    } else {\n      return iterable.reduce(function(a, b)  {return maxCompare(comparator, a, b) ? b : a});\n    }\n  }\n\n  function maxCompare(comparator, a, b) {\n    var comp = comparator(b, a);\n    // b is considered the new max if the comparator declares them equal, but\n    // they are not equal and b is in fact a nullish value.\n    return (comp === 0 && b !== a && (b === undefined || b === null || b !== b)) || comp > 0;\n  }\n\n\n  function zipWithFactory(keyIter, zipper, iters) {\n    var zipSequence = makeSequence(keyIter);\n    zipSequence.size = new ArraySeq(iters).map(function(i ) {return i.size}).min();\n    // Note: this a generic base implementation of __iterate in terms of\n    // __iterator which may be more generically useful in the future.\n    zipSequence.__iterate = function(fn, reverse) {\n      /* generic:\n      var iterator = this.__iterator(ITERATE_ENTRIES, reverse);\n      var step;\n      var iterations = 0;\n      while (!(step = iterator.next()).done) {\n        iterations++;\n        if (fn(step.value[1], step.value[0], this) === false) {\n          break;\n        }\n      }\n      return iterations;\n      */\n      // indexed:\n      var iterator = this.__iterator(ITERATE_VALUES, reverse);\n      var step;\n      var iterations = 0;\n      while (!(step = iterator.next()).done) {\n        if (fn(step.value, iterations++, this) === false) {\n          break;\n        }\n      }\n      return iterations;\n    };\n    zipSequence.__iteratorUncached = function(type, reverse) {\n      var iterators = iters.map(function(i )\n        {return (i = Iterable(i), getIterator(reverse ? i.reverse() : i))}\n      );\n      var iterations = 0;\n      var isDone = false;\n      return new Iterator(function()  {\n        var steps;\n        if (!isDone) {\n          steps = iterators.map(function(i ) {return i.next()});\n          isDone = steps.some(function(s ) {return s.done});\n        }\n        if (isDone) {\n          return iteratorDone();\n        }\n        return iteratorValue(\n          type,\n          iterations++,\n          zipper.apply(null, steps.map(function(s ) {return s.value}))\n        );\n      });\n    };\n    return zipSequence\n  }\n\n\n  // #pragma Helper Functions\n\n  function reify(iter, seq) {\n    return isSeq(iter) ? seq : iter.constructor(seq);\n  }\n\n  function validateEntry(entry) {\n    if (entry !== Object(entry)) {\n      throw new TypeError('Expected [K, V] tuple: ' + entry);\n    }\n  }\n\n  function resolveSize(iter) {\n    assertNotInfinite(iter.size);\n    return ensureSize(iter);\n  }\n\n  function iterableClass(iterable) {\n    return isKeyed(iterable) ? KeyedIterable :\n      isIndexed(iterable) ? IndexedIterable :\n      SetIterable;\n  }\n\n  function makeSequence(iterable) {\n    return Object.create(\n      (\n        isKeyed(iterable) ? KeyedSeq :\n        isIndexed(iterable) ? IndexedSeq :\n        SetSeq\n      ).prototype\n    );\n  }\n\n  function cacheResultThrough() {\n    if (this._iter.cacheResult) {\n      this._iter.cacheResult();\n      this.size = this._iter.size;\n      return this;\n    } else {\n      return Seq.prototype.cacheResult.call(this);\n    }\n  }\n\n  function defaultComparator(a, b) {\n    return a > b ? 1 : a < b ? -1 : 0;\n  }\n\n  function forceIterator(keyPath) {\n    var iter = getIterator(keyPath);\n    if (!iter) {\n      // Array might not be iterable in this environment, so we need a fallback\n      // to our wrapped type.\n      if (!isArrayLike(keyPath)) {\n        throw new TypeError('Expected iterable or array-like: ' + keyPath);\n      }\n      iter = getIterator(Iterable(keyPath));\n    }\n    return iter;\n  }\n\n  createClass(Record, KeyedCollection);\n\n    function Record(defaultValues, name) {\n      var hasInitialized;\n\n      var RecordType = function Record(values) {\n        if (values instanceof RecordType) {\n          return values;\n        }\n        if (!(this instanceof RecordType)) {\n          return new RecordType(values);\n        }\n        if (!hasInitialized) {\n          hasInitialized = true;\n          var keys = Object.keys(defaultValues);\n          setProps(RecordTypePrototype, keys);\n          RecordTypePrototype.size = keys.length;\n          RecordTypePrototype._name = name;\n          RecordTypePrototype._keys = keys;\n          RecordTypePrototype._defaultValues = defaultValues;\n        }\n        this._map = Map(values);\n      };\n\n      var RecordTypePrototype = RecordType.prototype = Object.create(RecordPrototype);\n      RecordTypePrototype.constructor = RecordType;\n\n      return RecordType;\n    }\n\n    Record.prototype.toString = function() {\n      return this.__toString(recordName(this) + ' {', '}');\n    };\n\n    // @pragma Access\n\n    Record.prototype.has = function(k) {\n      return this._defaultValues.hasOwnProperty(k);\n    };\n\n    Record.prototype.get = function(k, notSetValue) {\n      if (!this.has(k)) {\n        return notSetValue;\n      }\n      var defaultVal = this._defaultValues[k];\n      return this._map ? this._map.get(k, defaultVal) : defaultVal;\n    };\n\n    // @pragma Modification\n\n    Record.prototype.clear = function() {\n      if (this.__ownerID) {\n        this._map && this._map.clear();\n        return this;\n      }\n      var RecordType = this.constructor;\n      return RecordType._empty || (RecordType._empty = makeRecord(this, emptyMap()));\n    };\n\n    Record.prototype.set = function(k, v) {\n      if (!this.has(k)) {\n        throw new Error('Cannot set unknown key \"' + k + '\" on ' + recordName(this));\n      }\n      var newMap = this._map && this._map.set(k, v);\n      if (this.__ownerID || newMap === this._map) {\n        return this;\n      }\n      return makeRecord(this, newMap);\n    };\n\n    Record.prototype.remove = function(k) {\n      if (!this.has(k)) {\n        return this;\n      }\n      var newMap = this._map && this._map.remove(k);\n      if (this.__ownerID || newMap === this._map) {\n        return this;\n      }\n      return makeRecord(this, newMap);\n    };\n\n    Record.prototype.wasAltered = function() {\n      return this._map.wasAltered();\n    };\n\n    Record.prototype.__iterator = function(type, reverse) {var this$0 = this;\n      return KeyedIterable(this._defaultValues).map(function(_, k)  {return this$0.get(k)}).__iterator(type, reverse);\n    };\n\n    Record.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return KeyedIterable(this._defaultValues).map(function(_, k)  {return this$0.get(k)}).__iterate(fn, reverse);\n    };\n\n    Record.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      var newMap = this._map && this._map.__ensureOwner(ownerID);\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this._map = newMap;\n        return this;\n      }\n      return makeRecord(this, newMap, ownerID);\n    };\n\n\n  var RecordPrototype = Record.prototype;\n  RecordPrototype[DELETE] = RecordPrototype.remove;\n  RecordPrototype.deleteIn =\n  RecordPrototype.removeIn = MapPrototype.removeIn;\n  RecordPrototype.merge = MapPrototype.merge;\n  RecordPrototype.mergeWith = MapPrototype.mergeWith;\n  RecordPrototype.mergeIn = MapPrototype.mergeIn;\n  RecordPrototype.mergeDeep = MapPrototype.mergeDeep;\n  RecordPrototype.mergeDeepWith = MapPrototype.mergeDeepWith;\n  RecordPrototype.mergeDeepIn = MapPrototype.mergeDeepIn;\n  RecordPrototype.setIn = MapPrototype.setIn;\n  RecordPrototype.update = MapPrototype.update;\n  RecordPrototype.updateIn = MapPrototype.updateIn;\n  RecordPrototype.withMutations = MapPrototype.withMutations;\n  RecordPrototype.asMutable = MapPrototype.asMutable;\n  RecordPrototype.asImmutable = MapPrototype.asImmutable;\n\n\n  function makeRecord(likeRecord, map, ownerID) {\n    var record = Object.create(Object.getPrototypeOf(likeRecord));\n    record._map = map;\n    record.__ownerID = ownerID;\n    return record;\n  }\n\n  function recordName(record) {\n    return record._name || record.constructor.name || 'Record';\n  }\n\n  function setProps(prototype, names) {\n    try {\n      names.forEach(setProp.bind(undefined, prototype));\n    } catch (error) {\n      // Object.defineProperty failed. Probably IE8.\n    }\n  }\n\n  function setProp(prototype, name) {\n    Object.defineProperty(prototype, name, {\n      get: function() {\n        return this.get(name);\n      },\n      set: function(value) {\n        invariant(this.__ownerID, 'Cannot set on an immutable record.');\n        this.set(name, value);\n      }\n    });\n  }\n\n  createClass(Set, SetCollection);\n\n    // @pragma Construction\n\n    function Set(value) {\n      return value === null || value === undefined ? emptySet() :\n        isSet(value) && !isOrdered(value) ? value :\n        emptySet().withMutations(function(set ) {\n          var iter = SetIterable(value);\n          assertNotInfinite(iter.size);\n          iter.forEach(function(v ) {return set.add(v)});\n        });\n    }\n\n    Set.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    Set.fromKeys = function(value) {\n      return this(KeyedIterable(value).keySeq());\n    };\n\n    Set.prototype.toString = function() {\n      return this.__toString('Set {', '}');\n    };\n\n    // @pragma Access\n\n    Set.prototype.has = function(value) {\n      return this._map.has(value);\n    };\n\n    // @pragma Modification\n\n    Set.prototype.add = function(value) {\n      return updateSet(this, this._map.set(value, true));\n    };\n\n    Set.prototype.remove = function(value) {\n      return updateSet(this, this._map.remove(value));\n    };\n\n    Set.prototype.clear = function() {\n      return updateSet(this, this._map.clear());\n    };\n\n    // @pragma Composition\n\n    Set.prototype.union = function() {var iters = SLICE$0.call(arguments, 0);\n      iters = iters.filter(function(x ) {return x.size !== 0});\n      if (iters.length === 0) {\n        return this;\n      }\n      if (this.size === 0 && !this.__ownerID && iters.length === 1) {\n        return this.constructor(iters[0]);\n      }\n      return this.withMutations(function(set ) {\n        for (var ii = 0; ii < iters.length; ii++) {\n          SetIterable(iters[ii]).forEach(function(value ) {return set.add(value)});\n        }\n      });\n    };\n\n    Set.prototype.intersect = function() {var iters = SLICE$0.call(arguments, 0);\n      if (iters.length === 0) {\n        return this;\n      }\n      iters = iters.map(function(iter ) {return SetIterable(iter)});\n      var originalSet = this;\n      return this.withMutations(function(set ) {\n        originalSet.forEach(function(value ) {\n          if (!iters.every(function(iter ) {return iter.includes(value)})) {\n            set.remove(value);\n          }\n        });\n      });\n    };\n\n    Set.prototype.subtract = function() {var iters = SLICE$0.call(arguments, 0);\n      if (iters.length === 0) {\n        return this;\n      }\n      iters = iters.map(function(iter ) {return SetIterable(iter)});\n      var originalSet = this;\n      return this.withMutations(function(set ) {\n        originalSet.forEach(function(value ) {\n          if (iters.some(function(iter ) {return iter.includes(value)})) {\n            set.remove(value);\n          }\n        });\n      });\n    };\n\n    Set.prototype.merge = function() {\n      return this.union.apply(this, arguments);\n    };\n\n    Set.prototype.mergeWith = function(merger) {var iters = SLICE$0.call(arguments, 1);\n      return this.union.apply(this, iters);\n    };\n\n    Set.prototype.sort = function(comparator) {\n      // Late binding\n      return OrderedSet(sortFactory(this, comparator));\n    };\n\n    Set.prototype.sortBy = function(mapper, comparator) {\n      // Late binding\n      return OrderedSet(sortFactory(this, comparator, mapper));\n    };\n\n    Set.prototype.wasAltered = function() {\n      return this._map.wasAltered();\n    };\n\n    Set.prototype.__iterate = function(fn, reverse) {var this$0 = this;\n      return this._map.__iterate(function(_, k)  {return fn(k, k, this$0)}, reverse);\n    };\n\n    Set.prototype.__iterator = function(type, reverse) {\n      return this._map.map(function(_, k)  {return k}).__iterator(type, reverse);\n    };\n\n    Set.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      var newMap = this._map.__ensureOwner(ownerID);\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this._map = newMap;\n        return this;\n      }\n      return this.__make(newMap, ownerID);\n    };\n\n\n  function isSet(maybeSet) {\n    return !!(maybeSet && maybeSet[IS_SET_SENTINEL]);\n  }\n\n  Set.isSet = isSet;\n\n  var IS_SET_SENTINEL = '@@__IMMUTABLE_SET__@@';\n\n  var SetPrototype = Set.prototype;\n  SetPrototype[IS_SET_SENTINEL] = true;\n  SetPrototype[DELETE] = SetPrototype.remove;\n  SetPrototype.mergeDeep = SetPrototype.merge;\n  SetPrototype.mergeDeepWith = SetPrototype.mergeWith;\n  SetPrototype.withMutations = MapPrototype.withMutations;\n  SetPrototype.asMutable = MapPrototype.asMutable;\n  SetPrototype.asImmutable = MapPrototype.asImmutable;\n\n  SetPrototype.__empty = emptySet;\n  SetPrototype.__make = makeSet;\n\n  function updateSet(set, newMap) {\n    if (set.__ownerID) {\n      set.size = newMap.size;\n      set._map = newMap;\n      return set;\n    }\n    return newMap === set._map ? set :\n      newMap.size === 0 ? set.__empty() :\n      set.__make(newMap);\n  }\n\n  function makeSet(map, ownerID) {\n    var set = Object.create(SetPrototype);\n    set.size = map ? map.size : 0;\n    set._map = map;\n    set.__ownerID = ownerID;\n    return set;\n  }\n\n  var EMPTY_SET;\n  function emptySet() {\n    return EMPTY_SET || (EMPTY_SET = makeSet(emptyMap()));\n  }\n\n  createClass(OrderedSet, Set);\n\n    // @pragma Construction\n\n    function OrderedSet(value) {\n      return value === null || value === undefined ? emptyOrderedSet() :\n        isOrderedSet(value) ? value :\n        emptyOrderedSet().withMutations(function(set ) {\n          var iter = SetIterable(value);\n          assertNotInfinite(iter.size);\n          iter.forEach(function(v ) {return set.add(v)});\n        });\n    }\n\n    OrderedSet.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    OrderedSet.fromKeys = function(value) {\n      return this(KeyedIterable(value).keySeq());\n    };\n\n    OrderedSet.prototype.toString = function() {\n      return this.__toString('OrderedSet {', '}');\n    };\n\n\n  function isOrderedSet(maybeOrderedSet) {\n    return isSet(maybeOrderedSet) && isOrdered(maybeOrderedSet);\n  }\n\n  OrderedSet.isOrderedSet = isOrderedSet;\n\n  var OrderedSetPrototype = OrderedSet.prototype;\n  OrderedSetPrototype[IS_ORDERED_SENTINEL] = true;\n\n  OrderedSetPrototype.__empty = emptyOrderedSet;\n  OrderedSetPrototype.__make = makeOrderedSet;\n\n  function makeOrderedSet(map, ownerID) {\n    var set = Object.create(OrderedSetPrototype);\n    set.size = map ? map.size : 0;\n    set._map = map;\n    set.__ownerID = ownerID;\n    return set;\n  }\n\n  var EMPTY_ORDERED_SET;\n  function emptyOrderedSet() {\n    return EMPTY_ORDERED_SET || (EMPTY_ORDERED_SET = makeOrderedSet(emptyOrderedMap()));\n  }\n\n  createClass(Stack, IndexedCollection);\n\n    // @pragma Construction\n\n    function Stack(value) {\n      return value === null || value === undefined ? emptyStack() :\n        isStack(value) ? value :\n        emptyStack().unshiftAll(value);\n    }\n\n    Stack.of = function(/*...values*/) {\n      return this(arguments);\n    };\n\n    Stack.prototype.toString = function() {\n      return this.__toString('Stack [', ']');\n    };\n\n    // @pragma Access\n\n    Stack.prototype.get = function(index, notSetValue) {\n      var head = this._head;\n      index = wrapIndex(this, index);\n      while (head && index--) {\n        head = head.next;\n      }\n      return head ? head.value : notSetValue;\n    };\n\n    Stack.prototype.peek = function() {\n      return this._head && this._head.value;\n    };\n\n    // @pragma Modification\n\n    Stack.prototype.push = function(/*...values*/) {\n      if (arguments.length === 0) {\n        return this;\n      }\n      var newSize = this.size + arguments.length;\n      var head = this._head;\n      for (var ii = arguments.length - 1; ii >= 0; ii--) {\n        head = {\n          value: arguments[ii],\n          next: head\n        };\n      }\n      if (this.__ownerID) {\n        this.size = newSize;\n        this._head = head;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return makeStack(newSize, head);\n    };\n\n    Stack.prototype.pushAll = function(iter) {\n      iter = IndexedIterable(iter);\n      if (iter.size === 0) {\n        return this;\n      }\n      assertNotInfinite(iter.size);\n      var newSize = this.size;\n      var head = this._head;\n      iter.reverse().forEach(function(value ) {\n        newSize++;\n        head = {\n          value: value,\n          next: head\n        };\n      });\n      if (this.__ownerID) {\n        this.size = newSize;\n        this._head = head;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return makeStack(newSize, head);\n    };\n\n    Stack.prototype.pop = function() {\n      return this.slice(1);\n    };\n\n    Stack.prototype.unshift = function(/*...values*/) {\n      return this.push.apply(this, arguments);\n    };\n\n    Stack.prototype.unshiftAll = function(iter) {\n      return this.pushAll(iter);\n    };\n\n    Stack.prototype.shift = function() {\n      return this.pop.apply(this, arguments);\n    };\n\n    Stack.prototype.clear = function() {\n      if (this.size === 0) {\n        return this;\n      }\n      if (this.__ownerID) {\n        this.size = 0;\n        this._head = undefined;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return emptyStack();\n    };\n\n    Stack.prototype.slice = function(begin, end) {\n      if (wholeSlice(begin, end, this.size)) {\n        return this;\n      }\n      var resolvedBegin = resolveBegin(begin, this.size);\n      var resolvedEnd = resolveEnd(end, this.size);\n      if (resolvedEnd !== this.size) {\n        // super.slice(begin, end);\n        return IndexedCollection.prototype.slice.call(this, begin, end);\n      }\n      var newSize = this.size - resolvedBegin;\n      var head = this._head;\n      while (resolvedBegin--) {\n        head = head.next;\n      }\n      if (this.__ownerID) {\n        this.size = newSize;\n        this._head = head;\n        this.__hash = undefined;\n        this.__altered = true;\n        return this;\n      }\n      return makeStack(newSize, head);\n    };\n\n    // @pragma Mutability\n\n    Stack.prototype.__ensureOwner = function(ownerID) {\n      if (ownerID === this.__ownerID) {\n        return this;\n      }\n      if (!ownerID) {\n        this.__ownerID = ownerID;\n        this.__altered = false;\n        return this;\n      }\n      return makeStack(this.size, this._head, ownerID, this.__hash);\n    };\n\n    // @pragma Iteration\n\n    Stack.prototype.__iterate = function(fn, reverse) {\n      if (reverse) {\n        return this.reverse().__iterate(fn);\n      }\n      var iterations = 0;\n      var node = this._head;\n      while (node) {\n        if (fn(node.value, iterations++, this) === false) {\n          break;\n        }\n        node = node.next;\n      }\n      return iterations;\n    };\n\n    Stack.prototype.__iterator = function(type, reverse) {\n      if (reverse) {\n        return this.reverse().__iterator(type);\n      }\n      var iterations = 0;\n      var node = this._head;\n      return new Iterator(function()  {\n        if (node) {\n          var value = node.value;\n          node = node.next;\n          return iteratorValue(type, iterations++, value);\n        }\n        return iteratorDone();\n      });\n    };\n\n\n  function isStack(maybeStack) {\n    return !!(maybeStack && maybeStack[IS_STACK_SENTINEL]);\n  }\n\n  Stack.isStack = isStack;\n\n  var IS_STACK_SENTINEL = '@@__IMMUTABLE_STACK__@@';\n\n  var StackPrototype = Stack.prototype;\n  StackPrototype[IS_STACK_SENTINEL] = true;\n  StackPrototype.withMutations = MapPrototype.withMutations;\n  StackPrototype.asMutable = MapPrototype.asMutable;\n  StackPrototype.asImmutable = MapPrototype.asImmutable;\n  StackPrototype.wasAltered = MapPrototype.wasAltered;\n\n\n  function makeStack(size, head, ownerID, hash) {\n    var map = Object.create(StackPrototype);\n    map.size = size;\n    map._head = head;\n    map.__ownerID = ownerID;\n    map.__hash = hash;\n    map.__altered = false;\n    return map;\n  }\n\n  var EMPTY_STACK;\n  function emptyStack() {\n    return EMPTY_STACK || (EMPTY_STACK = makeStack(0));\n  }\n\n  /**\n   * Contributes additional methods to a constructor\n   */\n  function mixin(ctor, methods) {\n    var keyCopier = function(key ) { ctor.prototype[key] = methods[key]; };\n    Object.keys(methods).forEach(keyCopier);\n    Object.getOwnPropertySymbols &&\n      Object.getOwnPropertySymbols(methods).forEach(keyCopier);\n    return ctor;\n  }\n\n  Iterable.Iterator = Iterator;\n\n  mixin(Iterable, {\n\n    // ### Conversion to other types\n\n    toArray: function() {\n      assertNotInfinite(this.size);\n      var array = new Array(this.size || 0);\n      this.valueSeq().__iterate(function(v, i)  { array[i] = v; });\n      return array;\n    },\n\n    toIndexedSeq: function() {\n      return new ToIndexedSequence(this);\n    },\n\n    toJS: function() {\n      return this.toSeq().map(\n        function(value ) {return value && typeof value.toJS === 'function' ? value.toJS() : value}\n      ).__toJS();\n    },\n\n    toJSON: function() {\n      return this.toSeq().map(\n        function(value ) {return value && typeof value.toJSON === 'function' ? value.toJSON() : value}\n      ).__toJS();\n    },\n\n    toKeyedSeq: function() {\n      return new ToKeyedSequence(this, true);\n    },\n\n    toMap: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return Map(this.toKeyedSeq());\n    },\n\n    toObject: function() {\n      assertNotInfinite(this.size);\n      var object = {};\n      this.__iterate(function(v, k)  { object[k] = v; });\n      return object;\n    },\n\n    toOrderedMap: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return OrderedMap(this.toKeyedSeq());\n    },\n\n    toOrderedSet: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return OrderedSet(isKeyed(this) ? this.valueSeq() : this);\n    },\n\n    toSet: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return Set(isKeyed(this) ? this.valueSeq() : this);\n    },\n\n    toSetSeq: function() {\n      return new ToSetSequence(this);\n    },\n\n    toSeq: function() {\n      return isIndexed(this) ? this.toIndexedSeq() :\n        isKeyed(this) ? this.toKeyedSeq() :\n        this.toSetSeq();\n    },\n\n    toStack: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return Stack(isKeyed(this) ? this.valueSeq() : this);\n    },\n\n    toList: function() {\n      // Use Late Binding here to solve the circular dependency.\n      return List(isKeyed(this) ? this.valueSeq() : this);\n    },\n\n\n    // ### Common JavaScript methods and properties\n\n    toString: function() {\n      return '[Iterable]';\n    },\n\n    __toString: function(head, tail) {\n      if (this.size === 0) {\n        return head + tail;\n      }\n      return head + ' ' + this.toSeq().map(this.__toStringMapper).join(', ') + ' ' + tail;\n    },\n\n\n    // ### ES6 Collection methods (ES6 Array and Map)\n\n    concat: function() {var values = SLICE$0.call(arguments, 0);\n      return reify(this, concatFactory(this, values));\n    },\n\n    includes: function(searchValue) {\n      return this.some(function(value ) {return is(value, searchValue)});\n    },\n\n    entries: function() {\n      return this.__iterator(ITERATE_ENTRIES);\n    },\n\n    every: function(predicate, context) {\n      assertNotInfinite(this.size);\n      var returnValue = true;\n      this.__iterate(function(v, k, c)  {\n        if (!predicate.call(context, v, k, c)) {\n          returnValue = false;\n          return false;\n        }\n      });\n      return returnValue;\n    },\n\n    filter: function(predicate, context) {\n      return reify(this, filterFactory(this, predicate, context, true));\n    },\n\n    find: function(predicate, context, notSetValue) {\n      var entry = this.findEntry(predicate, context);\n      return entry ? entry[1] : notSetValue;\n    },\n\n    findEntry: function(predicate, context) {\n      var found;\n      this.__iterate(function(v, k, c)  {\n        if (predicate.call(context, v, k, c)) {\n          found = [k, v];\n          return false;\n        }\n      });\n      return found;\n    },\n\n    findLastEntry: function(predicate, context) {\n      return this.toSeq().reverse().findEntry(predicate, context);\n    },\n\n    forEach: function(sideEffect, context) {\n      assertNotInfinite(this.size);\n      return this.__iterate(context ? sideEffect.bind(context) : sideEffect);\n    },\n\n    join: function(separator) {\n      assertNotInfinite(this.size);\n      separator = separator !== undefined ? '' + separator : ',';\n      var joined = '';\n      var isFirst = true;\n      this.__iterate(function(v ) {\n        isFirst ? (isFirst = false) : (joined += separator);\n        joined += v !== null && v !== undefined ? v.toString() : '';\n      });\n      return joined;\n    },\n\n    keys: function() {\n      return this.__iterator(ITERATE_KEYS);\n    },\n\n    map: function(mapper, context) {\n      return reify(this, mapFactory(this, mapper, context));\n    },\n\n    reduce: function(reducer, initialReduction, context) {\n      assertNotInfinite(this.size);\n      var reduction;\n      var useFirst;\n      if (arguments.length < 2) {\n        useFirst = true;\n      } else {\n        reduction = initialReduction;\n      }\n      this.__iterate(function(v, k, c)  {\n        if (useFirst) {\n          useFirst = false;\n          reduction = v;\n        } else {\n          reduction = reducer.call(context, reduction, v, k, c);\n        }\n      });\n      return reduction;\n    },\n\n    reduceRight: function(reducer, initialReduction, context) {\n      var reversed = this.toKeyedSeq().reverse();\n      return reversed.reduce.apply(reversed, arguments);\n    },\n\n    reverse: function() {\n      return reify(this, reverseFactory(this, true));\n    },\n\n    slice: function(begin, end) {\n      return reify(this, sliceFactory(this, begin, end, true));\n    },\n\n    some: function(predicate, context) {\n      return !this.every(not(predicate), context);\n    },\n\n    sort: function(comparator) {\n      return reify(this, sortFactory(this, comparator));\n    },\n\n    values: function() {\n      return this.__iterator(ITERATE_VALUES);\n    },\n\n\n    // ### More sequential methods\n\n    butLast: function() {\n      return this.slice(0, -1);\n    },\n\n    isEmpty: function() {\n      return this.size !== undefined ? this.size === 0 : !this.some(function()  {return true});\n    },\n\n    count: function(predicate, context) {\n      return ensureSize(\n        predicate ? this.toSeq().filter(predicate, context) : this\n      );\n    },\n\n    countBy: function(grouper, context) {\n      return countByFactory(this, grouper, context);\n    },\n\n    equals: function(other) {\n      return deepEqual(this, other);\n    },\n\n    entrySeq: function() {\n      var iterable = this;\n      if (iterable._cache) {\n        // We cache as an entries array, so we can just return the cache!\n        return new ArraySeq(iterable._cache);\n      }\n      var entriesSequence = iterable.toSeq().map(entryMapper).toIndexedSeq();\n      entriesSequence.fromEntrySeq = function()  {return iterable.toSeq()};\n      return entriesSequence;\n    },\n\n    filterNot: function(predicate, context) {\n      return this.filter(not(predicate), context);\n    },\n\n    findLast: function(predicate, context, notSetValue) {\n      return this.toKeyedSeq().reverse().find(predicate, context, notSetValue);\n    },\n\n    first: function() {\n      return this.find(returnTrue);\n    },\n\n    flatMap: function(mapper, context) {\n      return reify(this, flatMapFactory(this, mapper, context));\n    },\n\n    flatten: function(depth) {\n      return reify(this, flattenFactory(this, depth, true));\n    },\n\n    fromEntrySeq: function() {\n      return new FromEntriesSequence(this);\n    },\n\n    get: function(searchKey, notSetValue) {\n      return this.find(function(_, key)  {return is(key, searchKey)}, undefined, notSetValue);\n    },\n\n    getIn: function(searchKeyPath, notSetValue) {\n      var nested = this;\n      // Note: in an ES6 environment, we would prefer:\n      // for (var key of searchKeyPath) {\n      var iter = forceIterator(searchKeyPath);\n      var step;\n      while (!(step = iter.next()).done) {\n        var key = step.value;\n        nested = nested && nested.get ? nested.get(key, NOT_SET) : NOT_SET;\n        if (nested === NOT_SET) {\n          return notSetValue;\n        }\n      }\n      return nested;\n    },\n\n    groupBy: function(grouper, context) {\n      return groupByFactory(this, grouper, context);\n    },\n\n    has: function(searchKey) {\n      return this.get(searchKey, NOT_SET) !== NOT_SET;\n    },\n\n    hasIn: function(searchKeyPath) {\n      return this.getIn(searchKeyPath, NOT_SET) !== NOT_SET;\n    },\n\n    isSubset: function(iter) {\n      iter = typeof iter.includes === 'function' ? iter : Iterable(iter);\n      return this.every(function(value ) {return iter.includes(value)});\n    },\n\n    isSuperset: function(iter) {\n      iter = typeof iter.isSubset === 'function' ? iter : Iterable(iter);\n      return iter.isSubset(this);\n    },\n\n    keySeq: function() {\n      return this.toSeq().map(keyMapper).toIndexedSeq();\n    },\n\n    last: function() {\n      return this.toSeq().reverse().first();\n    },\n\n    max: function(comparator) {\n      return maxFactory(this, comparator);\n    },\n\n    maxBy: function(mapper, comparator) {\n      return maxFactory(this, comparator, mapper);\n    },\n\n    min: function(comparator) {\n      return maxFactory(this, comparator ? neg(comparator) : defaultNegComparator);\n    },\n\n    minBy: function(mapper, comparator) {\n      return maxFactory(this, comparator ? neg(comparator) : defaultNegComparator, mapper);\n    },\n\n    rest: function() {\n      return this.slice(1);\n    },\n\n    skip: function(amount) {\n      return this.slice(Math.max(0, amount));\n    },\n\n    skipLast: function(amount) {\n      return reify(this, this.toSeq().reverse().skip(amount).reverse());\n    },\n\n    skipWhile: function(predicate, context) {\n      return reify(this, skipWhileFactory(this, predicate, context, true));\n    },\n\n    skipUntil: function(predicate, context) {\n      return this.skipWhile(not(predicate), context);\n    },\n\n    sortBy: function(mapper, comparator) {\n      return reify(this, sortFactory(this, comparator, mapper));\n    },\n\n    take: function(amount) {\n      return this.slice(0, Math.max(0, amount));\n    },\n\n    takeLast: function(amount) {\n      return reify(this, this.toSeq().reverse().take(amount).reverse());\n    },\n\n    takeWhile: function(predicate, context) {\n      return reify(this, takeWhileFactory(this, predicate, context));\n    },\n\n    takeUntil: function(predicate, context) {\n      return this.takeWhile(not(predicate), context);\n    },\n\n    valueSeq: function() {\n      return this.toIndexedSeq();\n    },\n\n\n    // ### Hashable Object\n\n    hashCode: function() {\n      return this.__hash || (this.__hash = hashIterable(this));\n    }\n\n\n    // ### Internal\n\n    // abstract __iterate(fn, reverse)\n\n    // abstract __iterator(type, reverse)\n  });\n\n  // var IS_ITERABLE_SENTINEL = '@@__IMMUTABLE_ITERABLE__@@';\n  // var IS_KEYED_SENTINEL = '@@__IMMUTABLE_KEYED__@@';\n  // var IS_INDEXED_SENTINEL = '@@__IMMUTABLE_INDEXED__@@';\n  // var IS_ORDERED_SENTINEL = '@@__IMMUTABLE_ORDERED__@@';\n\n  var IterablePrototype = Iterable.prototype;\n  IterablePrototype[IS_ITERABLE_SENTINEL] = true;\n  IterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.values;\n  IterablePrototype.__toJS = IterablePrototype.toArray;\n  IterablePrototype.__toStringMapper = quoteString;\n  IterablePrototype.inspect =\n  IterablePrototype.toSource = function() { return this.toString(); };\n  IterablePrototype.chain = IterablePrototype.flatMap;\n  IterablePrototype.contains = IterablePrototype.includes;\n\n  // Temporary warning about using length\n  (function () {\n    try {\n      Object.defineProperty(IterablePrototype, 'length', {\n        get: function () {\n          if (!Iterable.noLengthWarning) {\n            var stack;\n            try {\n              throw new Error();\n            } catch (error) {\n              stack = error.stack;\n            }\n            if (stack.indexOf('_wrapObject') === -1) {\n              console && console.warn && console.warn(\n                'iterable.length has been deprecated, '+\n                'use iterable.size or iterable.count(). '+\n                'This warning will become a silent error in a future version. ' +\n                stack\n              );\n              return this.size;\n            }\n          }\n        }\n      });\n    } catch (e) {}\n  })();\n\n\n\n  mixin(KeyedIterable, {\n\n    // ### More sequential methods\n\n    flip: function() {\n      return reify(this, flipFactory(this));\n    },\n\n    findKey: function(predicate, context) {\n      var entry = this.findEntry(predicate, context);\n      return entry && entry[0];\n    },\n\n    findLastKey: function(predicate, context) {\n      return this.toSeq().reverse().findKey(predicate, context);\n    },\n\n    keyOf: function(searchValue) {\n      return this.findKey(function(value ) {return is(value, searchValue)});\n    },\n\n    lastKeyOf: function(searchValue) {\n      return this.findLastKey(function(value ) {return is(value, searchValue)});\n    },\n\n    mapEntries: function(mapper, context) {var this$0 = this;\n      var iterations = 0;\n      return reify(this,\n        this.toSeq().map(\n          function(v, k)  {return mapper.call(context, [k, v], iterations++, this$0)}\n        ).fromEntrySeq()\n      );\n    },\n\n    mapKeys: function(mapper, context) {var this$0 = this;\n      return reify(this,\n        this.toSeq().flip().map(\n          function(k, v)  {return mapper.call(context, k, v, this$0)}\n        ).flip()\n      );\n    }\n\n  });\n\n  var KeyedIterablePrototype = KeyedIterable.prototype;\n  KeyedIterablePrototype[IS_KEYED_SENTINEL] = true;\n  KeyedIterablePrototype[ITERATOR_SYMBOL] = IterablePrototype.entries;\n  KeyedIterablePrototype.__toJS = IterablePrototype.toObject;\n  KeyedIterablePrototype.__toStringMapper = function(v, k)  {return JSON.stringify(k) + ': ' + quoteString(v)};\n\n\n\n  mixin(IndexedIterable, {\n\n    // ### Conversion to other types\n\n    toKeyedSeq: function() {\n      return new ToKeyedSequence(this, false);\n    },\n\n\n    // ### ES6 Collection methods (ES6 Array and Map)\n\n    filter: function(predicate, context) {\n      return reify(this, filterFactory(this, predicate, context, false));\n    },\n\n    findIndex: function(predicate, context) {\n      var entry = this.findEntry(predicate, context);\n      return entry ? entry[0] : -1;\n    },\n\n    indexOf: function(searchValue) {\n      var key = this.toKeyedSeq().keyOf(searchValue);\n      return key === undefined ? -1 : key;\n    },\n\n    lastIndexOf: function(searchValue) {\n      var key = this.toKeyedSeq().reverse().keyOf(searchValue);\n      return key === undefined ? -1 : key;\n\n      // var index =\n      // return this.toSeq().reverse().indexOf(searchValue);\n    },\n\n    reverse: function() {\n      return reify(this, reverseFactory(this, false));\n    },\n\n    slice: function(begin, end) {\n      return reify(this, sliceFactory(this, begin, end, false));\n    },\n\n    splice: function(index, removeNum /*, ...values*/) {\n      var numArgs = arguments.length;\n      removeNum = Math.max(removeNum | 0, 0);\n      if (numArgs === 0 || (numArgs === 2 && !removeNum)) {\n        return this;\n      }\n      // If index is negative, it should resolve relative to the size of the\n      // collection. However size may be expensive to compute if not cached, so\n      // only call count() if the number is in fact negative.\n      index = resolveBegin(index, index < 0 ? this.count() : this.size);\n      var spliced = this.slice(0, index);\n      return reify(\n        this,\n        numArgs === 1 ?\n          spliced :\n          spliced.concat(arrCopy(arguments, 2), this.slice(index + removeNum))\n      );\n    },\n\n\n    // ### More collection methods\n\n    findLastIndex: function(predicate, context) {\n      var key = this.toKeyedSeq().findLastKey(predicate, context);\n      return key === undefined ? -1 : key;\n    },\n\n    first: function() {\n      return this.get(0);\n    },\n\n    flatten: function(depth) {\n      return reify(this, flattenFactory(this, depth, false));\n    },\n\n    get: function(index, notSetValue) {\n      index = wrapIndex(this, index);\n      return (index < 0 || (this.size === Infinity ||\n          (this.size !== undefined && index > this.size))) ?\n        notSetValue :\n        this.find(function(_, key)  {return key === index}, undefined, notSetValue);\n    },\n\n    has: function(index) {\n      index = wrapIndex(this, index);\n      return index >= 0 && (this.size !== undefined ?\n        this.size === Infinity || index < this.size :\n        this.indexOf(index) !== -1\n      );\n    },\n\n    interpose: function(separator) {\n      return reify(this, interposeFactory(this, separator));\n    },\n\n    interleave: function(/*...iterables*/) {\n      var iterables = [this].concat(arrCopy(arguments));\n      var zipped = zipWithFactory(this.toSeq(), IndexedSeq.of, iterables);\n      var interleaved = zipped.flatten(true);\n      if (zipped.size) {\n        interleaved.size = zipped.size * iterables.length;\n      }\n      return reify(this, interleaved);\n    },\n\n    last: function() {\n      return this.get(-1);\n    },\n\n    skipWhile: function(predicate, context) {\n      return reify(this, skipWhileFactory(this, predicate, context, false));\n    },\n\n    zip: function(/*, ...iterables */) {\n      var iterables = [this].concat(arrCopy(arguments));\n      return reify(this, zipWithFactory(this, defaultZipper, iterables));\n    },\n\n    zipWith: function(zipper/*, ...iterables */) {\n      var iterables = arrCopy(arguments);\n      iterables[0] = this;\n      return reify(this, zipWithFactory(this, zipper, iterables));\n    }\n\n  });\n\n  IndexedIterable.prototype[IS_INDEXED_SENTINEL] = true;\n  IndexedIterable.prototype[IS_ORDERED_SENTINEL] = true;\n\n\n\n  mixin(SetIterable, {\n\n    // ### ES6 Collection methods (ES6 Array and Map)\n\n    get: function(value, notSetValue) {\n      return this.has(value) ? value : notSetValue;\n    },\n\n    includes: function(value) {\n      return this.has(value);\n    },\n\n\n    // ### More sequential methods\n\n    keySeq: function() {\n      return this.valueSeq();\n    }\n\n  });\n\n  SetIterable.prototype.has = IterablePrototype.includes;\n\n\n  // Mixin subclasses\n\n  mixin(KeyedSeq, KeyedIterable.prototype);\n  mixin(IndexedSeq, IndexedIterable.prototype);\n  mixin(SetSeq, SetIterable.prototype);\n\n  mixin(KeyedCollection, KeyedIterable.prototype);\n  mixin(IndexedCollection, IndexedIterable.prototype);\n  mixin(SetCollection, SetIterable.prototype);\n\n\n  // #pragma Helper functions\n\n  function keyMapper(v, k) {\n    return k;\n  }\n\n  function entryMapper(v, k) {\n    return [k, v];\n  }\n\n  function not(predicate) {\n    return function() {\n      return !predicate.apply(this, arguments);\n    }\n  }\n\n  function neg(predicate) {\n    return function() {\n      return -predicate.apply(this, arguments);\n    }\n  }\n\n  function quoteString(value) {\n    return typeof value === 'string' ? JSON.stringify(value) : value;\n  }\n\n  function defaultZipper() {\n    return arrCopy(arguments);\n  }\n\n  function defaultNegComparator(a, b) {\n    return a < b ? 1 : a > b ? -1 : 0;\n  }\n\n  function hashIterable(iterable) {\n    if (iterable.size === Infinity) {\n      return 0;\n    }\n    var ordered = isOrdered(iterable);\n    var keyed = isKeyed(iterable);\n    var h = ordered ? 1 : 0;\n    var size = iterable.__iterate(\n      keyed ?\n        ordered ?\n          function(v, k)  { h = 31 * h + hashMerge(hash(v), hash(k)) | 0; } :\n          function(v, k)  { h = h + hashMerge(hash(v), hash(k)) | 0; } :\n        ordered ?\n          function(v ) { h = 31 * h + hash(v) | 0; } :\n          function(v ) { h = h + hash(v) | 0; }\n    );\n    return murmurHashOfSize(size, h);\n  }\n\n  function murmurHashOfSize(size, h) {\n    h = imul(h, 0xCC9E2D51);\n    h = imul(h << 15 | h >>> -15, 0x1B873593);\n    h = imul(h << 13 | h >>> -13, 5);\n    h = (h + 0xE6546B64 | 0) ^ size;\n    h = imul(h ^ h >>> 16, 0x85EBCA6B);\n    h = imul(h ^ h >>> 13, 0xC2B2AE35);\n    h = smi(h ^ h >>> 16);\n    return h;\n  }\n\n  function hashMerge(a, b) {\n    return a ^ b + 0x9E3779B9 + (a << 6) + (a >> 2) | 0; // int\n  }\n\n  var Immutable = {\n\n    Iterable: Iterable,\n\n    Seq: Seq,\n    Collection: Collection,\n    Map: Map,\n    OrderedMap: OrderedMap,\n    List: List,\n    Stack: Stack,\n    Set: Set,\n    OrderedSet: OrderedSet,\n\n    Record: Record,\n    Range: Range,\n    Repeat: Repeat,\n\n    is: is,\n    fromJS: fromJS\n\n  };\n\n  return Immutable;\n\n}));"],"names":["global","factory","module","this","SLICE$0","createClass","ctor","superClass","Iterable","value","isIterable","Seq","KeyedIterable","isKeyed","KeyedSeq","IndexedIterable","isIndexed","IndexedSeq","SetIterable","isAssociative","SetSeq","maybeIterable","IS_ITERABLE_SENTINEL","maybeKeyed","IS_KEYED_SENTINEL","maybeIndexed","IS_INDEXED_SENTINEL","maybeAssociative","isOrdered","maybeOrdered","IS_ORDERED_SENTINEL","DELETE","SHIFT","SIZE","MASK","NOT_SET","CHANGE_LENGTH","DID_ALTER","MakeRef","ref","SetRef","OwnerID","arrCopy","arr","offset","len","newArr","ii","ensureSize","iter","returnTrue","wrapIndex","index","uint32Index","wholeSlice","begin","end","size","resolveBegin","resolveIndex","resolveEnd","defaultIndex","ITERATE_KEYS","ITERATE_VALUES","ITERATE_ENTRIES","REAL_ITERATOR_SYMBOL","FAUX_ITERATOR_SYMBOL","ITERATOR_SYMBOL","Iterator","next","iteratorValue","type","k","v","iteratorResult","iteratorDone","hasIterator","getIteratorFn","isIterator","maybeIterator","getIterator","iterable","iteratorFn","isArrayLike","emptySequence","seqFromValue","fn","reverse","seqIterate","seqIterator","keyedSeqFromValue","indexedSeqFromValue","isSeq","IS_SEQ_SENTINEL","ArraySeq","array","notSetValue","maxIndex","ObjectSeq","object","keys","key","IterableSeq","iterator","iterations","step","IteratorSeq","cache","val","maybeSeq","EMPTY_SEQ","seq","maybeIndexedSeqFromValue","useKeys","entry","fromJS","json","converter","fromJSWith","fromJSDefault","parentJSON","isPlainObj","is","valueA","valueB","deepEqual","a","b","notAssociative","entries","flipped","_","allEqual","bSize","Repeat","times","EMPTY_REPEAT","searchValue","this$0","other","invariant","condition","error","Range","start","EMPTY_RANGE","possibleIndex","offsetValue","Collection","KeyedCollection","IndexedCollection","SetCollection","imul","c","d","smi","i32","hash","o","h","STRING_HASH_CACHE_MIN_STRLEN","cachedHashString","hashString","hashJSObj","string","stringHashCache","STRING_HASH_CACHE_SIZE","STRING_HASH_CACHE_MAX_SIZE","obj","usingWeakMap","weakMap","UID_HASH_KEY","canDefineProperty","getIENodeHash","objHashUID","isExtensible","node","assertNotInfinite","Map","emptyMap","isMap","map","updateMap","keyPath","updater","updatedValue","updateInDeepMap","forceIterator","mergeIntoMapWith","merger","iters","m","deepMerger","deepMergerWith","comparator","OrderedMap","sortFactory","mapper","mutable","MapIterator","ownerID","makeMap","maybeMap","IS_MAP_SENTINEL","MapPrototype","ArrayMapNode","shift","keyHash","didChangeSize","didAlter","removed","idx","exists","MAX_ARRAY_MAP_SIZE","createNodes","isEditable","newEntries","BitmapIndexedNode","bitmap","nodes","bit","popCount","keyHashFrag","newNode","updateNode","MAX_BITMAP_INDEXED_SIZE","expandNodes","isLeafNode","newBitmap","newNodes","setIn","spliceOut","spliceIn","HashArrayMapNode","count","newCount","MIN_HASH_ARRAY_MAP_SIZE","packNodes","HashCollisionNode","mergeIntoNode","ValueNode","keyMatch","mapIteratorFrame","stack","mapIteratorValue","subNode","prev","root","EMPTY_MAP","newRoot","newSize","idx1","idx2","excluding","packedII","packedNodes","including","expandedNodes","iterables","mergeIntoCollectionWith","existing","nextValue","collection","x","mergeIntoMap","keyPathIter","isNotSet","existingValue","newValue","nextExisting","nextUpdated","canEdit","newArray","newLen","after","List","empty","emptyList","isList","makeList","VNode","list","i","listNodeFor","updateList","values","oldSize","setListBounds","mergeIntoListWith","iterateList","DONE","maybeList","IS_LIST_SENTINEL","ListPrototype","level","originIndex","removingFirst","newChild","oldChild","editable","editableVNode","sizeIndex","left","right","tailPos","getTailOffset","tail","iterateNodeOrLeaf","iterateLeaf","iterateNode","from","to","origin","capacity","EMPTY_LIST","newTail","updateVNode","nodeHas","lowerNode","newLowerNode","rawIndex","owner","oldOrigin","oldCapacity","newOrigin","newCapacity","newLevel","offsetShift","oldTailOffset","newTailOffset","oldTail","beginIndex","maxSize","emptyOrderedMap","isOrderedMap","updateOrderedMap","newMap","newList","makeOrderedMap","maybeOrderedMap","omap","EMPTY_ORDERED_MAP","has","ToKeyedSequence","indexed","reversedSequence","reverseFactory","context","mappedSequence","mapFactory","resolveSize","ToIndexedSequence","ToSetSequence","FromEntriesSequence","validateEntry","indexedIterable","cacheResultThrough","flipFactory","flipSequence","makeSequence","filterFactory","predicate","filterSequence","countByFactory","grouper","groups","groupByFactory","isKeyedIter","coerce","iterableClass","reify","sliceFactory","originalSize","resolvedBegin","resolvedEnd","resolvedSize","sliceSize","sliceSeq","skipped","isSkipping","takeWhileFactory","takeSequence","iterating","skipWhileFactory","skipSequence","skipping","concatFactory","isKeyedIterable","singleton","concatSeq","sum","flattenFactory","depth","flatSequence","stopped","flatDeep","currentDepth","flatMapFactory","interposeFactory","separator","interposedSequence","defaultComparator","maxFactory","maxCompare","comp","zipWithFactory","keyIter","zipper","zipSequence","iterators","isDone","steps","s","Record","defaultValues","name","hasInitialized","RecordType","setProps","RecordTypePrototype","RecordPrototype","recordName","defaultVal","makeRecord","likeRecord","record","prototype","names","setProp","Set","emptySet","isSet","set","updateSet","originalSet","OrderedSet","maybeSet","IS_SET_SENTINEL","SetPrototype","makeSet","EMPTY_SET","emptyOrderedSet","isOrderedSet","maybeOrderedSet","OrderedSetPrototype","makeOrderedSet","EMPTY_ORDERED_SET","Stack","emptyStack","isStack","head","makeStack","maybeStack","IS_STACK_SENTINEL","StackPrototype","EMPTY_STACK","mixin","methods","keyCopier","returnValue","found","sideEffect","joined","isFirst","reducer","initialReduction","reduction","useFirst","reversed","not","entriesSequence","entryMapper","searchKey","searchKeyPath","nested","keyMapper","neg","defaultNegComparator","amount","hashIterable","IterablePrototype","quoteString","KeyedIterablePrototype","removeNum","numArgs","spliced","zipped","interleaved","defaultZipper","ordered","keyed","hashMerge","murmurHashOfSize","Immutable"],"mappings":"mcASC,SAAUA,EAAQC,EAAS,CACqCC,GAAiB,QAAAD,GAGlF,GAAEE,GAAM,UAAY,CAAe,IAAIC,EAAU,MAAM,UAAU,MAE/D,SAASC,EAAYC,EAAMC,EAAY,CACjCA,IACFD,EAAK,UAAY,OAAO,OAAOC,EAAW,SAAS,GAErDD,EAAK,UAAU,YAAcA,EAG/B,SAASE,EAASC,EAAO,CACrB,OAAOC,EAAWD,CAAK,EAAIA,EAAQE,EAAIF,CAAK,EAIhDJ,EAAYO,EAAeJ,CAAQ,EACjC,SAASI,EAAcH,EAAO,CAC5B,OAAOI,EAAQJ,CAAK,EAAIA,EAAQK,EAASL,CAAK,EAIlDJ,EAAYU,GAAiBP,CAAQ,EACnC,SAASO,GAAgBN,EAAO,CAC9B,OAAOO,EAAUP,CAAK,EAAIA,EAAQQ,EAAWR,CAAK,EAItDJ,EAAYa,EAAaV,CAAQ,EAC/B,SAASU,EAAYT,EAAO,CAC1B,OAAOC,EAAWD,CAAK,GAAK,CAACU,GAAcV,CAAK,EAAIA,EAAQW,GAAOX,CAAK,EAK5E,SAASC,EAAWW,EAAe,CACjC,MAAO,CAAC,EAAEA,GAAiBA,EAAcC,EAAoB,GAG/D,SAAST,EAAQU,EAAY,CAC3B,MAAO,CAAC,EAAEA,GAAcA,EAAWC,EAAiB,GAGtD,SAASR,EAAUS,EAAc,CAC/B,MAAO,CAAC,EAAEA,GAAgBA,EAAaC,EAAmB,GAG5D,SAASP,GAAcQ,EAAkB,CACvC,OAAOd,EAAQc,CAAgB,GAAKX,EAAUW,CAAgB,EAGhE,SAASC,GAAUC,EAAc,CAC/B,MAAO,CAAC,EAAEA,GAAgBA,EAAaC,EAAmB,GAG5DtB,EAAS,WAAaE,EACtBF,EAAS,QAAUK,EACnBL,EAAS,UAAYQ,EACrBR,EAAS,cAAgBW,GACzBX,EAAS,UAAYoB,GAErBpB,EAAS,MAAQI,EACjBJ,EAAS,QAAUO,GACnBP,EAAS,IAAMU,EAGf,IAAII,GAAuB,6BACvBE,GAAoB,0BACpBE,GAAsB,4BACtBI,GAAsB,4BAGtBC,GAAS,SAGTC,EAAQ,EACRC,EAAO,GAAKD,EACZE,EAAOD,EAAO,EAIdE,EAAU,CAAE,EAGZC,GAAgB,CAAE,MAAO,EAAO,EAChCC,GAAY,CAAE,MAAO,EAAO,EAEhC,SAASC,GAAQC,EAAK,CACpB,OAAAA,EAAI,MAAQ,GACLA,EAGT,SAASC,EAAOD,EAAK,CACnBA,IAAQA,EAAI,MAAQ,IAMtB,SAASE,IAAU,CAAA,CAGnB,SAASC,GAAQC,EAAKC,EAAQ,CAC5BA,EAASA,GAAU,EAGnB,QAFIC,EAAM,KAAK,IAAI,EAAGF,EAAI,OAASC,CAAM,EACrCE,EAAS,IAAI,MAAMD,CAAG,EACjBE,EAAK,EAAGA,EAAKF,EAAKE,IACzBD,EAAOC,CAAE,EAAIJ,EAAII,EAAKH,CAAM,EAE9B,OAAOE,EAGT,SAASE,GAAWC,EAAM,CACxB,OAAIA,EAAK,OAAS,SAChBA,EAAK,KAAOA,EAAK,UAAUC,EAAU,GAEhCD,EAAK,KAGd,SAASE,GAAUF,EAAMG,EAAO,CAQ9B,GAAI,OAAOA,GAAU,SAAU,CAC7B,IAAIC,EAAcD,IAAU,EAC5B,GAAI,GAAKC,IAAgBD,GAASC,IAAgB,WAChD,MAAO,KAETD,EAAQC,EAEV,OAAOD,EAAQ,EAAIJ,GAAWC,CAAI,EAAIG,EAAQA,EAGhD,SAASF,IAAa,CACpB,MAAO,GAGT,SAASI,GAAWC,EAAOC,EAAKC,EAAM,CACpC,OAAQF,IAAU,GAAME,IAAS,QAAaF,GAAS,CAACE,KACrDD,IAAQ,QAAcC,IAAS,QAAaD,GAAOC,GAGxD,SAASC,GAAaH,EAAOE,EAAM,CACjC,OAAOE,GAAaJ,EAAOE,EAAM,CAAC,EAGpC,SAASG,GAAWJ,EAAKC,EAAM,CAC7B,OAAOE,GAAaH,EAAKC,EAAMA,CAAI,EAGrC,SAASE,GAAaP,EAAOK,EAAMI,EAAc,CAC/C,OAAOT,IAAU,OACfS,EACAT,EAAQ,EACN,KAAK,IAAI,EAAGK,EAAOL,CAAK,EACxBK,IAAS,OACPL,EACA,KAAK,IAAIK,EAAML,CAAK,EAK5B,IAAIU,GAAe,EACfC,EAAiB,EACjBC,GAAkB,EAElBC,GAAuB,OAAO,QAAW,YAAc,OAAO,SAC9DC,GAAuB,aAEvBC,GAAkBF,IAAwBC,GAG9C,SAASE,EAASC,EAAM,CACpB,KAAK,KAAOA,EAGdD,EAAS,UAAU,SAAW,UAAW,CACvC,MAAO,YACR,EAGHA,EAAS,KAAON,GAChBM,EAAS,OAASL,EAClBK,EAAS,QAAUJ,GAEnBI,EAAS,UAAU,QACnBA,EAAS,UAAU,SAAW,UAAY,CAAE,OAAO,KAAK,UAAW,EACnEA,EAAS,UAAUD,EAAe,EAAI,UAAY,CAChD,OAAO,IACR,EAGD,SAASG,EAAcC,EAAMC,EAAGC,EAAGC,EAAgB,CACjD,IAAIjE,EAAQ8D,IAAS,EAAIC,EAAID,IAAS,EAAIE,EAAI,CAACD,EAAGC,CAAC,EACnD,OAAAC,EAAkBA,EAAe,MAAQjE,EAAUiE,EAAiB,CAClE,MAAOjE,EAAO,KAAM,EAC1B,EACWiE,EAGT,SAASC,GAAe,CACtB,MAAO,CAAE,MAAO,OAAW,KAAM,EAAM,EAGzC,SAASC,GAAYvD,EAAe,CAClC,MAAO,CAAC,CAACwD,GAAcxD,CAAa,EAGtC,SAASyD,GAAWC,EAAe,CACjC,OAAOA,GAAiB,OAAOA,EAAc,MAAS,WAGxD,SAASC,GAAYC,EAAU,CAC7B,IAAIC,EAAaL,GAAcI,CAAQ,EACvC,OAAOC,GAAcA,EAAW,KAAKD,CAAQ,EAG/C,SAASJ,GAAcI,EAAU,CAC/B,IAAIC,EAAaD,IACdhB,IAAwBgB,EAAShB,EAAoB,GACtDgB,EAASf,EAAoB,GAE/B,GAAI,OAAOgB,GAAe,WACxB,OAAOA,EAIX,SAASC,GAAY1E,EAAO,CAC1B,OAAOA,GAAS,OAAOA,EAAM,QAAW,SAG1CJ,EAAYM,EAAKH,CAAQ,EACvB,SAASG,EAAIF,EAAO,CAClB,OAAOA,GAAU,KAA8B2E,GAAe,EAC5D1E,EAAWD,CAAK,EAAIA,EAAM,MAAO,EAAG4E,GAAa5E,CAAK,EAG1DE,EAAI,GAAK,UAAwB,CAC/B,OAAOA,EAAI,SAAS,CACrB,EAEDA,EAAI,UAAU,MAAQ,UAAW,CAC/B,OAAO,IACR,EAEDA,EAAI,UAAU,SAAW,UAAW,CAClC,OAAO,KAAK,WAAW,QAAS,GAAG,CACpC,EAEDA,EAAI,UAAU,YAAc,UAAW,CACrC,MAAI,CAAC,KAAK,QAAU,KAAK,oBACvB,KAAK,OAAS,KAAK,SAAQ,EAAG,QAAS,EACvC,KAAK,KAAO,KAAK,OAAO,QAEnB,IACR,EAIDA,EAAI,UAAU,UAAY,SAAS2E,EAAIC,EAAS,CAC9C,OAAOC,GAAW,KAAMF,EAAIC,EAAS,EAAI,CAC1C,EAID5E,EAAI,UAAU,WAAa,SAAS4D,EAAMgB,EAAS,CACjD,OAAOE,GAAY,KAAMlB,EAAMgB,EAAS,EAAI,CAC7C,EAIHlF,EAAYS,EAAUH,CAAG,EACvB,SAASG,EAASL,EAAO,CACvB,OAAOA,GAAU,KACf2E,GAAa,EAAG,WAAY,EAC5B1E,EAAWD,CAAK,EACbI,EAAQJ,CAAK,EAAIA,EAAM,MAAO,EAAGA,EAAM,aAAc,EACtDiF,GAAkBjF,CAAK,EAG7BK,EAAS,UAAU,WAAa,UAAW,CACzC,OAAO,IACR,EAIHT,EAAYY,EAAYN,CAAG,EACzB,SAASM,EAAWR,EAAO,CACzB,OAAOA,GAAU,KAA8B2E,GAAe,EAC3D1E,EAAWD,CAAK,EACjBI,EAAQJ,CAAK,EAAIA,EAAM,SAAU,EAAGA,EAAM,aAAc,EADnCkF,GAAoBlF,CAAK,EAIlDQ,EAAW,GAAK,UAAwB,CACtC,OAAOA,EAAW,SAAS,CAC5B,EAEDA,EAAW,UAAU,aAAe,UAAW,CAC7C,OAAO,IACR,EAEDA,EAAW,UAAU,SAAW,UAAW,CACzC,OAAO,KAAK,WAAW,QAAS,GAAG,CACpC,EAEDA,EAAW,UAAU,UAAY,SAASqE,EAAIC,EAAS,CACrD,OAAOC,GAAW,KAAMF,EAAIC,EAAS,EAAK,CAC3C,EAEDtE,EAAW,UAAU,WAAa,SAASsD,EAAMgB,EAAS,CACxD,OAAOE,GAAY,KAAMlB,EAAMgB,EAAS,EAAK,CAC9C,EAIHlF,EAAYe,GAAQT,CAAG,EACrB,SAASS,GAAOX,EAAO,CACrB,OACEA,GAAU,KAA8B2E,GAAe,EACtD1E,EAAWD,CAAK,EACjBI,EAAQJ,CAAK,EAAIA,EAAM,SAAQ,EAAKA,EADfkF,GAAoBlF,CAAK,GAE9C,SAAU,EAGdW,GAAO,GAAK,UAAwB,CAClC,OAAOA,GAAO,SAAS,CACxB,EAEDA,GAAO,UAAU,SAAW,UAAW,CACrC,OAAO,IACR,EAIHT,EAAI,MAAQiF,GACZjF,EAAI,MAAQG,EACZH,EAAI,IAAMS,GACVT,EAAI,QAAUM,EAEd,IAAI4E,GAAkB,wBAEtBlF,EAAI,UAAUkF,EAAe,EAAI,GAIjCxF,EAAYyF,GAAU7E,CAAU,EAC9B,SAAS6E,GAASC,EAAO,CACvB,KAAK,OAASA,EACd,KAAK,KAAOA,EAAM,OAGpBD,GAAS,UAAU,IAAM,SAAS1C,EAAO4C,EAAa,CACpD,OAAO,KAAK,IAAI5C,CAAK,EAAI,KAAK,OAAOD,GAAU,KAAMC,CAAK,CAAC,EAAI4C,CAChE,EAEDF,GAAS,UAAU,UAAY,SAASR,EAAIC,EAAS,CAGnD,QAFIQ,EAAQ,KAAK,OACbE,EAAWF,EAAM,OAAS,EACrBhD,EAAK,EAAGA,GAAMkD,EAAUlD,IAC/B,GAAIuC,EAAGS,EAAMR,EAAUU,EAAWlD,EAAKA,CAAE,EAAGA,EAAI,IAAI,IAAM,GACxD,OAAOA,EAAK,EAGhB,OAAOA,CACR,EAED+C,GAAS,UAAU,WAAa,SAASvB,EAAMgB,EAAS,CACtD,IAAIQ,EAAQ,KAAK,OACbE,EAAWF,EAAM,OAAS,EAC1BhD,EAAK,EACT,OAAO,IAAIqB,EAAS,UAClB,CAAC,OAAOrB,EAAKkD,EACXtB,EAAc,EACdL,EAAcC,EAAMxB,EAAIgD,EAAMR,EAAUU,EAAWlD,IAAOA,GAAI,CAAC,CAAC,CACnE,CACF,EAIH1C,EAAY6F,GAAWpF,CAAQ,EAC7B,SAASoF,GAAUC,EAAQ,CACzB,IAAIC,EAAO,OAAO,KAAKD,CAAM,EAC7B,KAAK,QAAUA,EACf,KAAK,MAAQC,EACb,KAAK,KAAOA,EAAK,OAGnBF,GAAU,UAAU,IAAM,SAASG,EAAKL,EAAa,CACnD,OAAIA,IAAgB,QAAa,CAAC,KAAK,IAAIK,CAAG,EACrCL,EAEF,KAAK,QAAQK,CAAG,CACxB,EAEDH,GAAU,UAAU,IAAM,SAASG,EAAK,CACtC,OAAO,KAAK,QAAQ,eAAeA,CAAG,CACvC,EAEDH,GAAU,UAAU,UAAY,SAASZ,EAAIC,EAAS,CAIpD,QAHIY,EAAS,KAAK,QACdC,EAAO,KAAK,MACZH,EAAWG,EAAK,OAAS,EACpBrD,EAAK,EAAGA,GAAMkD,EAAUlD,IAAM,CACrC,IAAIsD,EAAMD,EAAKb,EAAUU,EAAWlD,EAAKA,CAAE,EAC3C,GAAIuC,EAAGa,EAAOE,CAAG,EAAGA,EAAK,IAAI,IAAM,GACjC,OAAOtD,EAAK,EAGhB,OAAOA,CACR,EAEDmD,GAAU,UAAU,WAAa,SAAS3B,EAAMgB,EAAS,CACvD,IAAIY,EAAS,KAAK,QACdC,EAAO,KAAK,MACZH,EAAWG,EAAK,OAAS,EACzBrD,EAAK,EACT,OAAO,IAAIqB,EAAS,UAAY,CAC9B,IAAIiC,EAAMD,EAAKb,EAAUU,EAAWlD,EAAKA,CAAE,EAC3C,OAAOA,IAAOkD,EACZtB,EAAc,EACdL,EAAcC,EAAM8B,EAAKF,EAAOE,CAAG,CAAC,CAC9C,CAAO,CACF,EAEHH,GAAU,UAAUpE,EAAmB,EAAI,GAG3CzB,EAAYiG,GAAarF,CAAU,EACjC,SAASqF,GAAYrB,EAAU,CAC7B,KAAK,UAAYA,EACjB,KAAK,KAAOA,EAAS,QAAUA,EAAS,KAG1CqB,GAAY,UAAU,kBAAoB,SAAShB,EAAIC,EAAS,CAC9D,GAAIA,EACF,OAAO,KAAK,YAAW,EAAG,UAAUD,EAAIC,CAAO,EAEjD,IAAIN,EAAW,KAAK,UAChBsB,EAAWvB,GAAYC,CAAQ,EAC/BuB,EAAa,EACjB,GAAI1B,GAAWyB,CAAQ,EAErB,QADIE,EACG,EAAEA,EAAOF,EAAS,KAAI,GAAI,MAC3BjB,EAAGmB,EAAK,MAAOD,IAAc,IAAI,IAAM,IAA3C,CAKJ,OAAOA,CACR,EAEDF,GAAY,UAAU,mBAAqB,SAAS/B,EAAMgB,EAAS,CACjE,GAAIA,EACF,OAAO,KAAK,YAAW,EAAG,WAAWhB,EAAMgB,CAAO,EAEpD,IAAIN,EAAW,KAAK,UAChBsB,EAAWvB,GAAYC,CAAQ,EACnC,GAAI,CAACH,GAAWyB,CAAQ,EACtB,OAAO,IAAInC,EAASO,CAAY,EAElC,IAAI6B,EAAa,EACjB,OAAO,IAAIpC,EAAS,UAAY,CAC9B,IAAIqC,EAAOF,EAAS,KAAM,EAC1B,OAAOE,EAAK,KAAOA,EAAOnC,EAAcC,EAAMiC,IAAcC,EAAK,KAAK,CAC9E,CAAO,CACF,EAIHpG,EAAYqG,GAAazF,CAAU,EACjC,SAASyF,GAAYH,EAAU,CAC7B,KAAK,UAAYA,EACjB,KAAK,eAAiB,CAAE,EAG1BG,GAAY,UAAU,kBAAoB,SAASpB,EAAIC,EAAS,CAC9D,GAAIA,EACF,OAAO,KAAK,YAAW,EAAG,UAAUD,EAAIC,CAAO,EAKjD,QAHIgB,EAAW,KAAK,UAChBI,EAAQ,KAAK,eACbH,EAAa,EACVA,EAAaG,EAAM,QACxB,GAAIrB,EAAGqB,EAAMH,CAAU,EAAGA,IAAc,IAAI,IAAM,GAChD,OAAOA,EAIX,QADIC,EACG,EAAEA,EAAOF,EAAS,KAAI,GAAI,MAAM,CACrC,IAAIK,EAAMH,EAAK,MAEf,GADAE,EAAMH,CAAU,EAAII,EAChBtB,EAAGsB,EAAKJ,IAAc,IAAI,IAAM,GAClC,MAGJ,OAAOA,CACR,EAEDE,GAAY,UAAU,mBAAqB,SAASnC,EAAMgB,EAAS,CACjE,GAAIA,EACF,OAAO,KAAK,YAAW,EAAG,WAAWhB,EAAMgB,CAAO,EAEpD,IAAIgB,EAAW,KAAK,UAChBI,EAAQ,KAAK,eACbH,EAAa,EACjB,OAAO,IAAIpC,EAAS,UAAY,CAC9B,GAAIoC,GAAcG,EAAM,OAAQ,CAC9B,IAAIF,EAAOF,EAAS,KAAM,EAC1B,GAAIE,EAAK,KACP,OAAOA,EAETE,EAAMH,CAAU,EAAIC,EAAK,MAE3B,OAAOnC,EAAcC,EAAMiC,EAAYG,EAAMH,GAAY,CAAC,CAClE,CAAO,CACF,EAOH,SAASZ,GAAMiB,EAAU,CACvB,MAAO,CAAC,EAAEA,GAAYA,EAAShB,EAAe,GAGhD,IAAIiB,GAEJ,SAAS1B,IAAgB,CACvB,OAAO0B,KAAcA,GAAY,IAAIhB,GAAS,CAAE,CAAA,GAGlD,SAASJ,GAAkBjF,EAAO,CAChC,IAAIsG,EACF,MAAM,QAAQtG,CAAK,EAAI,IAAIqF,GAASrF,CAAK,EAAE,aAAc,EACzDqE,GAAWrE,CAAK,EAAI,IAAIiG,GAAYjG,CAAK,EAAE,aAAc,EACzDmE,GAAYnE,CAAK,EAAI,IAAI6F,GAAY7F,CAAK,EAAE,aAAc,EAC1D,OAAOA,GAAU,SAAW,IAAIyF,GAAUzF,CAAK,EAC/C,OACF,GAAI,CAACsG,EACH,MAAM,IAAI,UACR,yEACsBtG,CACvB,EAEH,OAAOsG,EAGT,SAASpB,GAAoBlF,EAAO,CAClC,IAAIsG,EAAMC,GAAyBvG,CAAK,EACxC,GAAI,CAACsG,EACH,MAAM,IAAI,UACR,gDAAkDtG,CACnD,EAEH,OAAOsG,EAGT,SAAS1B,GAAa5E,EAAO,CAC3B,IAAIsG,EAAMC,GAAyBvG,CAAK,GACrC,OAAOA,GAAU,UAAY,IAAIyF,GAAUzF,CAAK,EACnD,GAAI,CAACsG,EACH,MAAM,IAAI,UACR,iEAAmEtG,CACpE,EAEH,OAAOsG,EAGT,SAASC,GAAyBvG,EAAO,CACvC,OACE0E,GAAY1E,CAAK,EAAI,IAAIqF,GAASrF,CAAK,EACvCqE,GAAWrE,CAAK,EAAI,IAAIiG,GAAYjG,CAAK,EACzCmE,GAAYnE,CAAK,EAAI,IAAI6F,GAAY7F,CAAK,EAC1C,OAIJ,SAAS+E,GAAWuB,EAAKzB,EAAIC,EAAS0B,EAAS,CAC7C,IAAIN,EAAQI,EAAI,OAChB,GAAIJ,EAAO,CAET,QADIV,EAAWU,EAAM,OAAS,EACrB5D,EAAK,EAAGA,GAAMkD,EAAUlD,IAAM,CACrC,IAAImE,EAAQP,EAAMpB,EAAUU,EAAWlD,EAAKA,CAAE,EAC9C,GAAIuC,EAAG4B,EAAM,CAAC,EAAGD,EAAUC,EAAM,CAAC,EAAInE,EAAIgE,CAAG,IAAM,GACjD,OAAOhE,EAAK,EAGhB,OAAOA,EAET,OAAOgE,EAAI,kBAAkBzB,EAAIC,CAAO,EAG1C,SAASE,GAAYsB,EAAKxC,EAAMgB,EAAS0B,EAAS,CAChD,IAAIN,EAAQI,EAAI,OAChB,GAAIJ,EAAO,CACT,IAAIV,EAAWU,EAAM,OAAS,EAC1B5D,EAAK,EACT,OAAO,IAAIqB,EAAS,UAAY,CAC9B,IAAI8C,EAAQP,EAAMpB,EAAUU,EAAWlD,EAAKA,CAAE,EAC9C,OAAOA,IAAOkD,EACZtB,EAAc,EACdL,EAAcC,EAAM0C,EAAUC,EAAM,CAAC,EAAInE,EAAK,EAAGmE,EAAM,CAAC,CAAC,CACnE,CAAO,EAEH,OAAOH,EAAI,mBAAmBxC,EAAMgB,CAAO,EAG7C,SAAS4B,GAAOC,EAAMC,EAAW,CAC/B,OAAOA,EACLC,GAAWD,EAAWD,EAAM,GAAI,CAAC,GAAIA,CAAI,CAAC,EAC1CG,GAAcH,CAAI,EAGtB,SAASE,GAAWD,EAAWD,EAAMf,EAAKmB,EAAY,CACpD,OAAI,MAAM,QAAQJ,CAAI,EACbC,EAAU,KAAKG,EAAYnB,EAAKpF,EAAWmG,CAAI,EAAE,IAAI,SAAS3C,EAAGD,EAAI,CAAC,OAAO8C,GAAWD,EAAW5C,EAAGD,EAAG4C,CAAI,CAAC,CAAC,CAAC,EAErHK,GAAWL,CAAI,EACVC,EAAU,KAAKG,EAAYnB,EAAKvF,EAASsG,CAAI,EAAE,IAAI,SAAS3C,EAAGD,EAAI,CAAC,OAAO8C,GAAWD,EAAW5C,EAAGD,EAAG4C,CAAI,CAAC,CAAC,CAAC,EAEhHA,EAGT,SAASG,GAAcH,EAAM,CAC3B,OAAI,MAAM,QAAQA,CAAI,EACbnG,EAAWmG,CAAI,EAAE,IAAIG,EAAa,EAAE,OAAQ,EAEjDE,GAAWL,CAAI,EACVtG,EAASsG,CAAI,EAAE,IAAIG,EAAa,EAAE,MAAO,EAE3CH,EAGT,SAASK,GAAWhH,EAAO,CACzB,OAAOA,IAAUA,EAAM,cAAgB,QAAUA,EAAM,cAAgB,QAyDzE,SAASiH,EAAGC,EAAQC,EAAQ,CAC1B,GAAID,IAAWC,GAAWD,IAAWA,GAAUC,IAAWA,EACxD,MAAO,GAET,GAAI,CAACD,GAAU,CAACC,EACd,MAAO,GAET,GAAI,OAAOD,EAAO,SAAY,YAC1B,OAAOC,EAAO,SAAY,WAAY,CAGxC,GAFAD,EAASA,EAAO,QAAS,EACzBC,EAASA,EAAO,QAAS,EACrBD,IAAWC,GAAWD,IAAWA,GAAUC,IAAWA,EACxD,MAAO,GAET,GAAI,CAACD,GAAU,CAACC,EACd,MAAO,GAGX,MAAI,UAAOD,EAAO,QAAW,YACzB,OAAOC,EAAO,QAAW,YACzBD,EAAO,OAAOC,CAAM,GAM1B,SAASC,GAAUC,EAAGC,EAAG,CACvB,GAAID,IAAMC,EACR,MAAO,GAGT,GACE,CAACrH,EAAWqH,CAAC,GACbD,EAAE,OAAS,QAAaC,EAAE,OAAS,QAAaD,EAAE,OAASC,EAAE,MAC7DD,EAAE,SAAW,QAAaC,EAAE,SAAW,QAAaD,EAAE,SAAWC,EAAE,QACnElH,EAAQiH,CAAC,IAAMjH,EAAQkH,CAAC,GACxB/G,EAAU8G,CAAC,IAAM9G,EAAU+G,CAAC,GAC5BnG,GAAUkG,CAAC,IAAMlG,GAAUmG,CAAC,EAE5B,MAAO,GAGT,GAAID,EAAE,OAAS,GAAKC,EAAE,OAAS,EAC7B,MAAO,GAGT,IAAIC,EAAiB,CAAC7G,GAAc2G,CAAC,EAErC,GAAIlG,GAAUkG,CAAC,EAAG,CAChB,IAAIG,EAAUH,EAAE,QAAS,EACzB,OAAOC,EAAE,MAAM,SAAStD,EAAGD,EAAI,CAC7B,IAAI0C,EAAQe,EAAQ,KAAI,EAAG,MAC3B,OAAOf,GAASQ,EAAGR,EAAM,CAAC,EAAGzC,CAAC,IAAMuD,GAAkBN,EAAGR,EAAM,CAAC,EAAG1C,CAAC,GACrE,GAAKyD,EAAQ,KAAI,EAAG,KAGvB,IAAIC,EAAU,GAEd,GAAIJ,EAAE,OAAS,OACb,GAAIC,EAAE,OAAS,OACT,OAAOD,EAAE,aAAgB,YAC3BA,EAAE,YAAa,MAEZ,CACLI,EAAU,GACV,IAAIC,EAAIL,EACRA,EAAIC,EACJA,EAAII,EAIR,IAAIC,EAAW,GACXC,EAAQN,EAAE,UAAU,SAAStD,EAAGD,EAAI,CACtC,GAAIwD,EAAiB,CAACF,EAAE,IAAIrD,CAAC,EACzByD,EAAU,CAACR,EAAGjD,EAAGqD,EAAE,IAAItD,EAAGrC,CAAO,CAAC,EAAI,CAACuF,EAAGI,EAAE,IAAItD,EAAGrC,CAAO,EAAGsC,CAAC,EAChE,OAAA2D,EAAW,GACJ,EAEf,CAAK,EAED,OAAOA,GAAYN,EAAE,OAASO,EAGhChI,EAAYiI,EAAQrH,CAAU,EAE5B,SAASqH,EAAO7H,EAAO8H,EAAO,CAC5B,GAAI,EAAE,gBAAgBD,GACpB,OAAO,IAAIA,EAAO7H,EAAO8H,CAAK,EAIhC,GAFA,KAAK,OAAS9H,EACd,KAAK,KAAO8H,IAAU,OAAY,IAAW,KAAK,IAAI,EAAGA,CAAK,EAC1D,KAAK,OAAS,EAAG,CACnB,GAAIC,GACF,OAAOA,GAETA,GAAe,MAInBF,EAAO,UAAU,SAAW,UAAW,CACrC,OAAI,KAAK,OAAS,EACT,YAEF,YAAc,KAAK,OAAS,IAAM,KAAK,KAAO,UACtD,EAEDA,EAAO,UAAU,IAAM,SAASlF,EAAO4C,EAAa,CAClD,OAAO,KAAK,IAAI5C,CAAK,EAAI,KAAK,OAAS4C,CACxC,EAEDsC,EAAO,UAAU,SAAW,SAASG,EAAa,CAChD,OAAOf,EAAG,KAAK,OAAQe,CAAW,CACnC,EAEDH,EAAO,UAAU,MAAQ,SAAS/E,EAAOC,EAAK,CAC5C,IAAIC,EAAO,KAAK,KAChB,OAAOH,GAAWC,EAAOC,EAAKC,CAAI,EAAI,KACpC,IAAI6E,EAAO,KAAK,OAAQ1E,GAAWJ,EAAKC,CAAI,EAAIC,GAAaH,EAAOE,CAAI,CAAC,CAC5E,EAED6E,EAAO,UAAU,QAAU,UAAW,CACpC,OAAO,IACR,EAEDA,EAAO,UAAU,QAAU,SAASG,EAAa,CAC/C,OAAIf,EAAG,KAAK,OAAQe,CAAW,EACtB,EAEF,EACR,EAEDH,EAAO,UAAU,YAAc,SAASG,EAAa,CACnD,OAAIf,EAAG,KAAK,OAAQe,CAAW,EACtB,KAAK,KAEP,EACR,EAEDH,EAAO,UAAU,UAAY,SAAShD,EAAIC,EAAS,CACjD,QAASxC,EAAK,EAAGA,EAAK,KAAK,KAAMA,IAC/B,GAAIuC,EAAG,KAAK,OAAQvC,EAAI,IAAI,IAAM,GAChC,OAAOA,EAAK,EAGhB,OAAOA,CACR,EAEDuF,EAAO,UAAU,WAAa,SAAS/D,EAAMgB,EAAS,CAAC,IAAImD,EAAS,KAC9D3F,EAAK,EACT,OAAO,IAAIqB,EAAS,UAClB,CAAC,OAAOrB,EAAK2F,EAAO,KAAOpE,EAAcC,EAAMxB,IAAM2F,EAAO,MAAM,EAAI/D,EAAc,CAAA,CACrF,CACF,EAED2D,EAAO,UAAU,OAAS,SAASK,EAAO,CACxC,OAAOA,aAAiBL,EACtBZ,EAAG,KAAK,OAAQiB,EAAM,MAAM,EAC5Bd,GAAUc,CAAK,CAClB,EAGH,IAAIH,GAEJ,SAASI,GAAUC,EAAWC,EAAO,CACnC,GAAI,CAACD,EAAW,MAAM,IAAI,MAAMC,CAAK,EAGvCzI,EAAY0I,EAAO9H,CAAU,EAE3B,SAAS8H,EAAMC,EAAOxF,EAAKiD,EAAM,CAC/B,GAAI,EAAE,gBAAgBsC,GACpB,OAAO,IAAIA,EAAMC,EAAOxF,EAAKiD,CAAI,EAenC,GAbAmC,GAAUnC,IAAS,EAAG,0BAA0B,EAChDuC,EAAQA,GAAS,EACbxF,IAAQ,SACVA,EAAM,KAERiD,EAAOA,IAAS,OAAY,EAAI,KAAK,IAAIA,CAAI,EACzCjD,EAAMwF,IACRvC,EAAO,CAACA,GAEV,KAAK,OAASuC,EACd,KAAK,KAAOxF,EACZ,KAAK,MAAQiD,EACb,KAAK,KAAO,KAAK,IAAI,EAAG,KAAK,MAAMjD,EAAMwF,GAASvC,EAAO,CAAC,EAAI,CAAC,EAC3D,KAAK,OAAS,EAAG,CACnB,GAAIwC,GACF,OAAOA,GAETA,GAAc,MAIlBF,EAAM,UAAU,SAAW,UAAW,CACpC,OAAI,KAAK,OAAS,EACT,WAEF,WACL,KAAK,OAAS,MAAQ,KAAK,MAC1B,KAAK,MAAQ,EAAI,OAAS,KAAK,MAAQ,IAC1C,IACD,EAEDA,EAAM,UAAU,IAAM,SAAS3F,EAAO4C,EAAa,CACjD,OAAO,KAAK,IAAI5C,CAAK,EACnB,KAAK,OAASD,GAAU,KAAMC,CAAK,EAAI,KAAK,MAC5C4C,CACH,EAED+C,EAAM,UAAU,SAAW,SAASN,EAAa,CAC/C,IAAIS,GAAiBT,EAAc,KAAK,QAAU,KAAK,MACvD,OAAOS,GAAiB,GACtBA,EAAgB,KAAK,MACrBA,IAAkB,KAAK,MAAMA,CAAa,CAC7C,EAEDH,EAAM,UAAU,MAAQ,SAASxF,EAAOC,EAAK,CAC3C,OAAIF,GAAWC,EAAOC,EAAK,KAAK,IAAI,EAC3B,MAETD,EAAQG,GAAaH,EAAO,KAAK,IAAI,EACrCC,EAAMI,GAAWJ,EAAK,KAAK,IAAI,EAC3BA,GAAOD,EACF,IAAIwF,EAAM,EAAG,CAAC,EAEhB,IAAIA,EAAM,KAAK,IAAIxF,EAAO,KAAK,IAAI,EAAG,KAAK,IAAIC,EAAK,KAAK,IAAI,EAAG,KAAK,KAAK,EAClF,EAEDuF,EAAM,UAAU,QAAU,SAASN,EAAa,CAC9C,IAAIU,EAAcV,EAAc,KAAK,OACrC,GAAIU,EAAc,KAAK,QAAU,EAAG,CAClC,IAAI/F,EAAQ+F,EAAc,KAAK,MAC/B,GAAI/F,GAAS,GAAKA,EAAQ,KAAK,KAC7B,OAAOA,EAGX,MAAO,EACR,EAED2F,EAAM,UAAU,YAAc,SAASN,EAAa,CAClD,OAAO,KAAK,QAAQA,CAAW,CAChC,EAEDM,EAAM,UAAU,UAAY,SAASzD,EAAIC,EAAS,CAIhD,QAHIU,EAAW,KAAK,KAAO,EACvBQ,EAAO,KAAK,MACZhG,EAAQ8E,EAAU,KAAK,OAASU,EAAWQ,EAAO,KAAK,OAClD1D,EAAK,EAAGA,GAAMkD,EAAUlD,IAAM,CACrC,GAAIuC,EAAG7E,EAAOsC,EAAI,IAAI,IAAM,GAC1B,OAAOA,EAAK,EAEdtC,GAAS8E,EAAU,CAACkB,EAAOA,EAE7B,OAAO1D,CACR,EAEDgG,EAAM,UAAU,WAAa,SAASxE,EAAMgB,EAAS,CACnD,IAAIU,EAAW,KAAK,KAAO,EACvBQ,EAAO,KAAK,MACZhG,EAAQ8E,EAAU,KAAK,OAASU,EAAWQ,EAAO,KAAK,OACvD1D,EAAK,EACT,OAAO,IAAIqB,EAAS,UAAY,CAC9B,IAAIK,EAAIhE,EACR,OAAAA,GAAS8E,EAAU,CAACkB,EAAOA,EACpB1D,EAAKkD,EAAWtB,EAAc,EAAGL,EAAcC,EAAMxB,IAAM0B,CAAC,CAC3E,CAAO,CACF,EAEDsE,EAAM,UAAU,OAAS,SAASJ,EAAO,CACvC,OAAOA,aAAiBI,EACtB,KAAK,SAAWJ,EAAM,QACtB,KAAK,OAASA,EAAM,MACpB,KAAK,QAAUA,EAAM,MACrBd,GAAU,KAAMc,CAAK,CACxB,EAGH,IAAIM,GAEJ5I,EAAY+I,GAAY5I,CAAQ,EAC9B,SAAS4I,IAAa,CACpB,MAAM,UAAU,UAAU,EAI9B/I,EAAYgJ,GAAiBD,EAAU,EAAE,SAASC,IAAkB,CAAA,CAEpEhJ,EAAYiJ,GAAmBF,EAAU,EAAE,SAASE,IAAoB,CAAA,CAExEjJ,EAAYkJ,GAAeH,EAAU,EAAE,SAASG,IAAgB,CAAA,CAGhEH,GAAW,MAAQC,GACnBD,GAAW,QAAUE,GACrBF,GAAW,IAAMG,GAEjB,IAAIC,GACF,OAAO,KAAK,MAAS,YAAc,KAAK,KAAK,WAAY,CAAC,IAAM,GAChE,KAAK,KACL,SAAc1B,EAAGC,EAAG,CAClBD,EAAIA,EAAI,EACRC,EAAIA,EAAI,EACR,IAAI0B,EAAI3B,EAAI,MACR4B,EAAI3B,EAAI,MAEZ,OAAQ0B,EAAIC,IAAS5B,IAAM,IAAM4B,EAAID,GAAK1B,IAAM,KAAQ,KAAQ,GAAK,CACtE,EAMH,SAAS4B,GAAIC,EAAK,CAChB,OAASA,IAAQ,EAAK,WAAeA,EAAM,WAG7C,SAASC,EAAKC,EAAG,CAIf,GAHIA,IAAM,IAASA,IAAM,MAAQA,IAAM,QAGnC,OAAOA,EAAE,SAAY,aACvBA,EAAIA,EAAE,QAAS,EACXA,IAAM,IAASA,IAAM,MAAQA,IAAM,QACrC,MAAO,GAGX,GAAIA,IAAM,GACR,MAAO,GAET,IAAIvF,EAAO,OAAOuF,EAClB,GAAIvF,IAAS,SAAU,CACrB,IAAIwF,EAAID,EAAI,EAIZ,IAHIC,IAAMD,IACRC,GAAKD,EAAI,YAEJA,EAAI,YACTA,GAAK,WACLC,GAAKD,EAEP,OAAOH,GAAII,CAAC,EAEd,GAAIxF,IAAS,SACX,OAAOuF,EAAE,OAASE,GAA+BC,GAAiBH,CAAC,EAAII,GAAWJ,CAAC,EAErF,GAAI,OAAOA,EAAE,UAAa,WACxB,OAAOA,EAAE,SAAU,EAErB,GAAIvF,IAAS,SACX,OAAO4F,GAAUL,CAAC,EAEpB,GAAI,OAAOA,EAAE,UAAa,WACxB,OAAOI,GAAWJ,EAAE,UAAU,EAEhC,MAAM,IAAI,MAAM,cAAgBvF,EAAO,oBAAoB,EAG7D,SAAS0F,GAAiBG,EAAQ,CAChC,IAAIP,EAAOQ,GAAgBD,CAAM,EACjC,OAAIP,IAAS,SACXA,EAAOK,GAAWE,CAAM,EACpBE,KAA2BC,KAC7BD,GAAyB,EACzBD,GAAkB,CAAE,GAEtBC,KACAD,GAAgBD,CAAM,EAAIP,GAErBA,EAIT,SAASK,GAAWE,EAAQ,CAQ1B,QADIP,EAAO,EACF9G,EAAK,EAAGA,EAAKqH,EAAO,OAAQrH,IACnC8G,EAAO,GAAKA,EAAOO,EAAO,WAAWrH,CAAE,EAAI,EAE7C,OAAO4G,GAAIE,CAAI,EAGjB,SAASM,GAAUK,EAAK,CACtB,IAAIX,EAaJ,GAZIY,KACFZ,EAAOa,GAAQ,IAAIF,CAAG,EAClBX,IAAS,UAKfA,EAAOW,EAAIG,EAAY,EACnBd,IAAS,SAIT,CAACe,KACHf,EAAOW,EAAI,sBAAwBA,EAAI,qBAAqBG,EAAY,EACpEd,IAAS,SAIbA,EAAOgB,GAAcL,CAAG,EACpBX,IAAS,SACX,OAAOA,EASX,GALAA,EAAO,EAAEiB,GACLA,GAAa,aACfA,GAAa,GAGXL,GACFC,GAAQ,IAAIF,EAAKX,CAAI,MAChB,IAAIkB,KAAiB,QAAaA,GAAaP,CAAG,IAAM,GAC7D,MAAM,IAAI,MAAM,iDAAiD,EAC5D,GAAII,GACT,OAAO,eAAeJ,EAAKG,GAAc,CACvC,WAAc,GACd,aAAgB,GAChB,SAAY,GACZ,MAASd,CACjB,CAAO,UACQW,EAAI,uBAAyB,QAC7BA,EAAI,uBAAyBA,EAAI,YAAY,UAAU,qBAKhEA,EAAI,qBAAuB,UAAW,CACpC,OAAO,KAAK,YAAY,UAAU,qBAAqB,MAAM,KAAM,SAAS,CAC7E,EACDA,EAAI,qBAAqBG,EAAY,EAAId,UAChCW,EAAI,WAAa,OAK1BA,EAAIG,EAAY,EAAId,MAEpB,OAAM,IAAI,MAAM,oDAAoD,EAGtE,OAAOA,EAIT,IAAIkB,GAAe,OAAO,aAGtBH,GAAqB,UAAW,CAClC,GAAI,CACF,cAAO,eAAe,GAAI,IAAK,CAAA,CAAE,EAC1B,EACR,MAAW,CACV,MAAO,OAMX,SAASC,GAAcG,EAAM,CAC3B,GAAIA,GAAQA,EAAK,SAAW,EAC1B,OAAQA,EAAK,SAAQ,CACnB,IAAK,GACH,OAAOA,EAAK,SACd,IAAK,GACH,OAAOA,EAAK,iBAAmBA,EAAK,gBAAgB,UAM5D,IAAIP,GAAe,OAAO,SAAY,WAClCC,GACAD,KACFC,GAAU,IAAI,SAGhB,IAAII,GAAa,EAEbH,GAAe,oBACf,OAAO,QAAW,aACpBA,GAAe,OAAOA,EAAY,GAGpC,IAAIX,GAA+B,GAC/BO,GAA6B,IAC7BD,GAAyB,EACzBD,GAAkB,CAAE,EAExB,SAASY,EAAkBxH,EAAM,CAC/BmF,GACEnF,IAAS,IACT,mDACD,EAGHpD,EAAY6K,EAAK7B,EAAe,EAI9B,SAAS6B,EAAIzK,EAAO,CAClB,OAAOA,GAAU,KAA8B0K,GAAU,EACvDC,GAAM3K,CAAK,GAAK,CAACmB,GAAUnB,CAAK,EAAIA,EACpC0K,GAAU,EAAC,cAAc,SAASE,EAAM,CACtC,IAAIpI,EAAOrC,EAAcH,CAAK,EAC9BwK,EAAkBhI,EAAK,IAAI,EAC3BA,EAAK,QAAQ,SAASwB,EAAGD,EAAI,CAAC,OAAO6G,EAAI,IAAI7G,EAAGC,CAAC,CAAC,CAAC,CAC7D,CAAS,EAGLyG,EAAI,UAAU,SAAW,UAAW,CAClC,OAAO,KAAK,WAAW,QAAS,GAAG,CACpC,EAIDA,EAAI,UAAU,IAAM,SAAS1G,EAAGwB,EAAa,CAC3C,OAAO,KAAK,MACV,KAAK,MAAM,IAAI,EAAG,OAAWxB,EAAGwB,CAAW,EAC3CA,CACH,EAIDkF,EAAI,UAAU,IAAM,SAAS1G,EAAGC,EAAG,CACjC,OAAO6G,GAAU,KAAM9G,EAAGC,CAAC,CAC5B,EAEDyG,EAAI,UAAU,MAAQ,SAASK,EAAS9G,EAAG,CACzC,OAAO,KAAK,SAAS8G,EAASpJ,EAAS,UAAY,CAAC,OAAOsC,CAAC,CAAC,CAC9D,EAEDyG,EAAI,UAAU,OAAS,SAAS1G,EAAG,CACjC,OAAO8G,GAAU,KAAM9G,EAAGrC,CAAO,CAClC,EAED+I,EAAI,UAAU,SAAW,SAASK,EAAS,CACzC,OAAO,KAAK,SAASA,EAAS,UAAY,CAAC,OAAOpJ,CAAO,CAAC,CAC3D,EAED+I,EAAI,UAAU,OAAS,SAAS1G,EAAGwB,EAAawF,EAAS,CACvD,OAAO,UAAU,SAAW,EAC1BhH,EAAE,IAAI,EACN,KAAK,SAAS,CAACA,CAAC,EAAGwB,EAAawF,CAAO,CAC1C,EAEDN,EAAI,UAAU,SAAW,SAASK,EAASvF,EAAawF,EAAS,CAC1DA,IACHA,EAAUxF,EACVA,EAAc,QAEhB,IAAIyF,EAAeC,GACjB,KACAC,GAAcJ,CAAO,EACrBvF,EACAwF,CACD,EACD,OAAOC,IAAiBtJ,EAAU,OAAYsJ,CAC/C,EAEDP,EAAI,UAAU,MAAQ,UAAW,CAC/B,OAAI,KAAK,OAAS,EACT,KAEL,KAAK,WACP,KAAK,KAAO,EACZ,KAAK,MAAQ,KACb,KAAK,OAAS,OACd,KAAK,UAAY,GACV,MAEFC,GAAU,CAClB,EAIDD,EAAI,UAAU,MAAQ,UAAuB,CAC3C,OAAOU,GAAiB,KAAM,OAAW,SAAS,CACnD,EAEDV,EAAI,UAAU,UAAY,SAASW,EAAQ,CAAC,IAAIC,EAAQ1L,EAAQ,KAAK,UAAW,CAAC,EAC/E,OAAOwL,GAAiB,KAAMC,EAAQC,CAAK,CAC5C,EAEDZ,EAAI,UAAU,QAAU,SAASK,EAAS,CAAC,IAAIO,EAAQ1L,EAAQ,KAAK,UAAW,CAAC,EAC9E,OAAO,KAAK,SACVmL,EACAJ,GAAU,EACV,SAASY,EAAI,CAAC,OAAO,OAAOA,EAAE,OAAU,WACtCA,EAAE,MAAM,MAAMA,EAAGD,CAAK,EACtBA,EAAMA,EAAM,OAAS,CAAC,CAAC,CAC1B,CACF,EAEDZ,EAAI,UAAU,UAAY,UAAuB,CAC/C,OAAOU,GAAiB,KAAMI,GAAY,SAAS,CACpD,EAEDd,EAAI,UAAU,cAAgB,SAASW,EAAQ,CAAC,IAAIC,EAAQ1L,EAAQ,KAAK,UAAW,CAAC,EACnF,OAAOwL,GAAiB,KAAMK,GAAeJ,CAAM,EAAGC,CAAK,CAC5D,EAEDZ,EAAI,UAAU,YAAc,SAASK,EAAS,CAAC,IAAIO,EAAQ1L,EAAQ,KAAK,UAAW,CAAC,EAClF,OAAO,KAAK,SACVmL,EACAJ,GAAU,EACV,SAASY,EAAI,CAAC,OAAO,OAAOA,EAAE,WAAc,WAC1CA,EAAE,UAAU,MAAMA,EAAGD,CAAK,EAC1BA,EAAMA,EAAM,OAAS,CAAC,CAAC,CAC1B,CACF,EAEDZ,EAAI,UAAU,KAAO,SAASgB,EAAY,CAExC,OAAOC,EAAWC,GAAY,KAAMF,CAAU,CAAC,CAChD,EAEDhB,EAAI,UAAU,OAAS,SAASmB,EAAQH,EAAY,CAElD,OAAOC,EAAWC,GAAY,KAAMF,EAAYG,CAAM,CAAC,CACxD,EAIDnB,EAAI,UAAU,cAAgB,SAAS5F,EAAI,CACzC,IAAIgH,EAAU,KAAK,UAAW,EAC9B,OAAAhH,EAAGgH,CAAO,EACHA,EAAQ,aAAeA,EAAQ,cAAc,KAAK,SAAS,EAAI,IACvE,EAEDpB,EAAI,UAAU,UAAY,UAAW,CACnC,OAAO,KAAK,UAAY,KAAO,KAAK,cAAc,IAAIzI,EAAS,CAChE,EAEDyI,EAAI,UAAU,YAAc,UAAW,CACrC,OAAO,KAAK,cAAe,CAC5B,EAEDA,EAAI,UAAU,WAAa,UAAW,CACpC,OAAO,KAAK,SACb,EAEDA,EAAI,UAAU,WAAa,SAAS3G,EAAMgB,EAAS,CACjD,OAAO,IAAIgH,GAAY,KAAMhI,EAAMgB,CAAO,CAC3C,EAED2F,EAAI,UAAU,UAAY,SAAS5F,EAAIC,EAAS,CAAC,IAAImD,EAAS,KACxDlC,EAAa,EACjB,YAAK,OAAS,KAAK,MAAM,QAAQ,SAASU,EAAQ,CAChD,OAAAV,IACOlB,EAAG4B,EAAM,CAAC,EAAGA,EAAM,CAAC,EAAGwB,CAAM,CACrC,EAAEnD,CAAO,EACHiB,CACR,EAED0E,EAAI,UAAU,cAAgB,SAASsB,EAAS,CAC9C,OAAIA,IAAY,KAAK,UACZ,KAEJA,EAKEC,GAAQ,KAAK,KAAM,KAAK,MAAOD,EAAS,KAAK,MAAM,GAJxD,KAAK,UAAYA,EACjB,KAAK,UAAY,GACV,KAGV,EAGH,SAASpB,GAAMsB,EAAU,CACvB,MAAO,CAAC,EAAEA,GAAYA,EAASC,EAAe,GAGhDzB,EAAI,MAAQE,GAEZ,IAAIuB,GAAkB,wBAElBC,EAAe1B,EAAI,UACvB0B,EAAaD,EAAe,EAAI,GAChCC,EAAa7K,EAAM,EAAI6K,EAAa,OACpCA,EAAa,SAAWA,EAAa,SAOnC,SAASC,GAAaL,EAASvE,EAAS,CACtC,KAAK,QAAUuE,EACf,KAAK,QAAUvE,EAGjB4E,GAAa,UAAU,IAAM,SAASC,EAAOC,EAAS1G,EAAKL,EAAa,CAEtE,QADIiC,EAAU,KAAK,QACVlF,EAAK,EAAGF,EAAMoF,EAAQ,OAAQlF,EAAKF,EAAKE,IAC/C,GAAI2E,EAAGrB,EAAK4B,EAAQlF,CAAE,EAAE,CAAC,CAAC,EACxB,OAAOkF,EAAQlF,CAAE,EAAE,CAAC,EAGxB,OAAOiD,CACR,EAED6G,GAAa,UAAU,OAAS,SAASL,EAASM,EAAOC,EAAS1G,EAAK5F,EAAOuM,EAAeC,EAAU,CAKrG,QAJIC,EAAUzM,IAAU0B,EAEpB8F,EAAU,KAAK,QACfkF,EAAM,EACDtK,EAAMoF,EAAQ,OAAQkF,EAAMtK,GAC/B,CAAA6E,EAAGrB,EAAK4B,EAAQkF,CAAG,EAAE,CAAC,CAAC,EADaA,IACxC,CAIF,IAAIC,EAASD,EAAMtK,EAEnB,GAAIuK,EAASnF,EAAQkF,CAAG,EAAE,CAAC,IAAM1M,EAAQyM,EACvC,OAAO,KAMT,GAHA1K,EAAOyK,CAAQ,GACdC,GAAW,CAACE,IAAW5K,EAAOwK,CAAa,EAExC,EAAAE,GAAWjF,EAAQ,SAAW,GAIlC,IAAI,CAACmF,GAAU,CAACF,GAAWjF,EAAQ,QAAUoF,GAC3C,OAAOC,GAAYd,EAASvE,EAAS5B,EAAK5F,CAAK,EAGjD,IAAI8M,EAAaf,GAAWA,IAAY,KAAK,QACzCgB,EAAaD,EAAatF,EAAUvF,GAAQuF,CAAO,EAYvD,OAVImF,EACEF,EACFC,IAAQtK,EAAM,EAAI2K,EAAW,IAAG,EAAMA,EAAWL,CAAG,EAAIK,EAAW,MAEnEA,EAAWL,CAAG,EAAI,CAAC9G,EAAK5F,CAAK,EAG/B+M,EAAW,KAAK,CAACnH,EAAK5F,CAAK,CAAC,EAG1B8M,GACF,KAAK,QAAUC,EACR,MAGF,IAAIX,GAAaL,EAASgB,CAAU,EAC5C,EAKD,SAASC,GAAkBjB,EAASkB,EAAQC,EAAO,CACjD,KAAK,QAAUnB,EACf,KAAK,OAASkB,EACd,KAAK,MAAQC,EAGfF,GAAkB,UAAU,IAAM,SAASX,EAAOC,EAAS1G,EAAKL,EAAa,CACvE+G,IAAY,SACdA,EAAUlD,EAAKxD,CAAG,GAEpB,IAAIuH,EAAO,KAAOd,IAAU,EAAIC,EAAUA,IAAYD,GAAS5K,GAC3DwL,EAAS,KAAK,OAClB,OAAQA,EAASE,EACf,KAAK,MAAMC,GAASH,EAAUE,EAAM,CAAE,CAAC,EAAE,IAAId,EAAQ9K,EAAO+K,EAAS1G,EAAKL,CAAW,EADzDA,CAE/B,EAEDyH,GAAkB,UAAU,OAAS,SAASjB,EAASM,EAAOC,EAAS1G,EAAK5F,EAAOuM,EAAeC,EAAU,CACtGF,IAAY,SACdA,EAAUlD,EAAKxD,CAAG,GAEpB,IAAIyH,GAAehB,IAAU,EAAIC,EAAUA,IAAYD,GAAS5K,EAC5D0L,EAAM,GAAKE,EACXJ,EAAS,KAAK,OACdN,GAAUM,EAASE,KAAS,EAEhC,GAAI,CAACR,GAAU3M,IAAU0B,EACvB,OAAO,KAGT,IAAIgL,EAAMU,GAASH,EAAUE,EAAM,CAAE,EACjCD,EAAQ,KAAK,MACb3C,EAAOoC,EAASO,EAAMR,CAAG,EAAI,OAC7BY,EAAUC,GAAWhD,EAAMwB,EAASM,EAAQ9K,EAAO+K,EAAS1G,EAAK5F,EAAOuM,EAAeC,CAAQ,EAEnG,GAAIc,IAAY/C,EACd,OAAO,KAGT,GAAI,CAACoC,GAAUW,GAAWJ,EAAM,QAAUM,GACxC,OAAOC,GAAY1B,EAASmB,EAAOD,EAAQI,EAAaC,CAAO,EAGjE,GAAIX,GAAU,CAACW,GAAWJ,EAAM,SAAW,GAAKQ,GAAWR,EAAMR,EAAM,CAAC,CAAC,EACvE,OAAOQ,EAAMR,EAAM,CAAC,EAGtB,GAAIC,GAAUW,GAAWJ,EAAM,SAAW,GAAKQ,GAAWJ,CAAO,EAC/D,OAAOA,EAGT,IAAIR,EAAaf,GAAWA,IAAY,KAAK,QACzC4B,GAAYhB,EAASW,EAAUL,EAASA,EAASE,EAAMF,EAASE,EAChES,GAAWjB,EAASW,EACtBO,GAAMX,EAAOR,EAAKY,EAASR,CAAU,EACrCgB,GAAUZ,EAAOR,EAAKI,CAAU,EAChCiB,GAASb,EAAOR,EAAKY,EAASR,CAAU,EAE1C,OAAIA,GACF,KAAK,OAASa,GACd,KAAK,MAAQC,GACN,MAGF,IAAIZ,GAAkBjB,EAAS4B,GAAWC,EAAQ,CAC1D,EAKD,SAASI,GAAiBjC,EAASkC,EAAOf,EAAO,CAC/C,KAAK,QAAUnB,EACf,KAAK,MAAQkC,EACb,KAAK,MAAQf,EAGfc,GAAiB,UAAU,IAAM,SAAS3B,EAAOC,EAAS1G,EAAKL,EAAa,CACtE+G,IAAY,SACdA,EAAUlD,EAAKxD,CAAG,GAEpB,IAAI8G,GAAOL,IAAU,EAAIC,EAAUA,IAAYD,GAAS5K,EACpD8I,EAAO,KAAK,MAAMmC,CAAG,EACzB,OAAOnC,EAAOA,EAAK,IAAI8B,EAAQ9K,EAAO+K,EAAS1G,EAAKL,CAAW,EAAIA,CACpE,EAEDyI,GAAiB,UAAU,OAAS,SAASjC,EAASM,EAAOC,EAAS1G,EAAK5F,EAAOuM,EAAeC,EAAU,CACrGF,IAAY,SACdA,EAAUlD,EAAKxD,CAAG,GAEpB,IAAI8G,GAAOL,IAAU,EAAIC,EAAUA,IAAYD,GAAS5K,EACpDgL,EAAUzM,IAAU0B,EACpBwL,EAAQ,KAAK,MACb3C,EAAO2C,EAAMR,CAAG,EAEpB,GAAID,GAAW,CAAClC,EACd,OAAO,KAGT,IAAI+C,EAAUC,GAAWhD,EAAMwB,EAASM,EAAQ9K,EAAO+K,EAAS1G,EAAK5F,EAAOuM,EAAeC,CAAQ,EACnG,GAAIc,IAAY/C,EACd,OAAO,KAGT,IAAI2D,EAAW,KAAK,MACpB,GAAI,CAAC3D,EACH2D,YACS,CAACZ,IACVY,IACIA,EAAWC,IACb,OAAOC,GAAUrC,EAASmB,EAAOgB,EAAUxB,CAAG,EAIlD,IAAII,EAAaf,GAAWA,IAAY,KAAK,QACzC6B,EAAWC,GAAMX,EAAOR,EAAKY,EAASR,CAAU,EAEpD,OAAIA,GACF,KAAK,MAAQoB,EACb,KAAK,MAAQN,EACN,MAGF,IAAII,GAAiBjC,EAASmC,EAAUN,CAAQ,CACxD,EAKD,SAASS,GAAkBtC,EAASO,EAAS9E,EAAS,CACpD,KAAK,QAAUuE,EACf,KAAK,QAAUO,EACf,KAAK,QAAU9E,EAGjB6G,GAAkB,UAAU,IAAM,SAAShC,EAAOC,EAAS1G,EAAKL,EAAa,CAE3E,QADIiC,EAAU,KAAK,QACVlF,EAAK,EAAGF,EAAMoF,EAAQ,OAAQlF,EAAKF,EAAKE,IAC/C,GAAI2E,EAAGrB,EAAK4B,EAAQlF,CAAE,EAAE,CAAC,CAAC,EACxB,OAAOkF,EAAQlF,CAAE,EAAE,CAAC,EAGxB,OAAOiD,CACR,EAED8I,GAAkB,UAAU,OAAS,SAAStC,EAASM,EAAOC,EAAS1G,EAAK5F,EAAOuM,EAAeC,EAAU,CACtGF,IAAY,SACdA,EAAUlD,EAAKxD,CAAG,GAGpB,IAAI6G,EAAUzM,IAAU0B,EAExB,GAAI4K,IAAY,KAAK,QACnB,OAAIG,EACK,MAET1K,EAAOyK,CAAQ,EACfzK,EAAOwK,CAAa,EACb+B,GAAc,KAAMvC,EAASM,EAAOC,EAAS,CAAC1G,EAAK5F,CAAK,CAAC,GAKlE,QAFIwH,EAAU,KAAK,QACfkF,EAAM,EACDtK,EAAMoF,EAAQ,OAAQkF,EAAMtK,GAC/B,CAAA6E,EAAGrB,EAAK4B,EAAQkF,CAAG,EAAE,CAAC,CAAC,EADaA,IACxC,CAIF,IAAIC,EAASD,EAAMtK,EAEnB,GAAIuK,EAASnF,EAAQkF,CAAG,EAAE,CAAC,IAAM1M,EAAQyM,EACvC,OAAO,KAMT,GAHA1K,EAAOyK,CAAQ,GACdC,GAAW,CAACE,IAAW5K,EAAOwK,CAAa,EAExCE,GAAWrK,IAAQ,EACrB,OAAO,IAAImM,GAAUxC,EAAS,KAAK,QAASvE,EAAQkF,EAAM,CAAC,CAAC,EAG9D,IAAII,EAAaf,GAAWA,IAAY,KAAK,QACzCgB,EAAaD,EAAatF,EAAUvF,GAAQuF,CAAO,EAYvD,OAVImF,EACEF,EACFC,IAAQtK,EAAM,EAAI2K,EAAW,IAAG,EAAMA,EAAWL,CAAG,EAAIK,EAAW,MAEnEA,EAAWL,CAAG,EAAI,CAAC9G,EAAK5F,CAAK,EAG/B+M,EAAW,KAAK,CAACnH,EAAK5F,CAAK,CAAC,EAG1B8M,GACF,KAAK,QAAUC,EACR,MAGF,IAAIsB,GAAkBtC,EAAS,KAAK,QAASgB,CAAU,CAC/D,EAKD,SAASwB,GAAUxC,EAASO,EAAS7F,EAAO,CAC1C,KAAK,QAAUsF,EACf,KAAK,QAAUO,EACf,KAAK,MAAQ7F,EAGf8H,GAAU,UAAU,IAAM,SAASlC,EAAOC,EAAS1G,EAAKL,EAAa,CACnE,OAAO0B,EAAGrB,EAAK,KAAK,MAAM,CAAC,CAAC,EAAI,KAAK,MAAM,CAAC,EAAIL,CACjD,EAEDgJ,GAAU,UAAU,OAAS,SAASxC,EAASM,EAAOC,EAAS1G,EAAK5F,EAAOuM,EAAeC,EAAU,CAClG,IAAIC,EAAUzM,IAAU0B,EACpB8M,EAAWvH,EAAGrB,EAAK,KAAK,MAAM,CAAC,CAAC,EACpC,GAAI4I,EAAWxO,IAAU,KAAK,MAAM,CAAC,EAAIyM,EACvC,OAAO,KAKT,GAFA1K,EAAOyK,CAAQ,EAEXC,EAAS,CACX1K,EAAOwK,CAAa,EACpB,OAGF,OAAIiC,EACEzC,GAAWA,IAAY,KAAK,SAC9B,KAAK,MAAM,CAAC,EAAI/L,EACT,MAEF,IAAIuO,GAAUxC,EAAS,KAAK,QAAS,CAACnG,EAAK5F,CAAK,CAAC,GAG1D+B,EAAOwK,CAAa,EACb+B,GAAc,KAAMvC,EAASM,EAAOjD,EAAKxD,CAAG,EAAG,CAACA,EAAK5F,CAAK,CAAC,EACnE,EAMHoM,GAAa,UAAU,QACvBiC,GAAkB,UAAU,QAAU,SAAUxJ,EAAIC,EAAS,CAE3D,QADI0C,EAAU,KAAK,QACVlF,EAAK,EAAGkD,EAAWgC,EAAQ,OAAS,EAAGlF,GAAMkD,EAAUlD,IAC9D,GAAIuC,EAAG2C,EAAQ1C,EAAUU,EAAWlD,EAAKA,CAAE,CAAC,IAAM,GAChD,MAAO,IAKb0K,GAAkB,UAAU,QAC5BgB,GAAiB,UAAU,QAAU,SAAUnJ,EAAIC,EAAS,CAE1D,QADIoI,EAAQ,KAAK,MACR5K,EAAK,EAAGkD,EAAW0H,EAAM,OAAS,EAAG5K,GAAMkD,EAAUlD,IAAM,CAClE,IAAIiI,EAAO2C,EAAMpI,EAAUU,EAAWlD,EAAKA,CAAE,EAC7C,GAAIiI,GAAQA,EAAK,QAAQ1F,EAAIC,CAAO,IAAM,GACxC,MAAO,KAKbyJ,GAAU,UAAU,QAAU,SAAU1J,EAAIC,EAAS,CACnD,OAAOD,EAAG,KAAK,KAAK,GAGtBjF,EAAYkM,GAAanI,CAAQ,EAE/B,SAASmI,GAAYlB,EAAK9G,EAAMgB,EAAS,CACvC,KAAK,MAAQhB,EACb,KAAK,SAAWgB,EAChB,KAAK,OAAS8F,EAAI,OAAS6D,GAAiB7D,EAAI,KAAK,EAGvDkB,GAAY,UAAU,KAAO,UAAW,CAGtC,QAFIhI,EAAO,KAAK,MACZ4K,EAAQ,KAAK,OACVA,GAAO,CACZ,IAAInE,EAAOmE,EAAM,KACb/L,EAAQ+L,EAAM,QACdlJ,EACJ,GAAI+E,EAAK,OACP,GAAI5H,IAAU,EACZ,OAAOgM,GAAiB7K,EAAMyG,EAAK,KAAK,UAEjCA,EAAK,SAEd,GADA/E,EAAW+E,EAAK,QAAQ,OAAS,EAC7B5H,GAAS6C,EACX,OAAOmJ,GAAiB7K,EAAMyG,EAAK,QAAQ,KAAK,SAAW/E,EAAW7C,EAAQA,CAAK,CAAC,UAGtF6C,EAAW+E,EAAK,MAAM,OAAS,EAC3B5H,GAAS6C,EAAU,CACrB,IAAIoJ,EAAUrE,EAAK,MAAM,KAAK,SAAW/E,EAAW7C,EAAQA,CAAK,EACjE,GAAIiM,EAAS,CACX,GAAIA,EAAQ,MACV,OAAOD,GAAiB7K,EAAM8K,EAAQ,KAAK,EAE7CF,EAAQ,KAAK,OAASD,GAAiBG,EAASF,CAAK,EAEvD,SAGJA,EAAQ,KAAK,OAAS,KAAK,OAAO,OAEpC,OAAOxK,EAAc,CACtB,EAGH,SAASyK,GAAiB7K,EAAM2C,EAAO,CACrC,OAAO5C,EAAcC,EAAM2C,EAAM,CAAC,EAAGA,EAAM,CAAC,CAAC,EAG/C,SAASgI,GAAiBlE,EAAMsE,EAAM,CACpC,MAAO,CACL,KAAMtE,EACN,MAAO,EACP,OAAQsE,CACT,EAGH,SAAS7C,GAAQhJ,EAAM8L,EAAM/C,EAAS3C,EAAM,CAC1C,IAAIwB,EAAM,OAAO,OAAOuB,CAAY,EACpC,OAAAvB,EAAI,KAAO5H,EACX4H,EAAI,MAAQkE,EACZlE,EAAI,UAAYmB,EAChBnB,EAAI,OAASxB,EACbwB,EAAI,UAAY,GACTA,EAGT,IAAImE,GACJ,SAASrE,IAAW,CAClB,OAAOqE,KAAcA,GAAY/C,GAAQ,CAAC,GAG5C,SAASnB,GAAUD,EAAK7G,EAAGC,EAAG,CAC5B,IAAIgL,EACAC,EACJ,GAAKrE,EAAI,MAMF,CACL,IAAI2B,EAAgB1K,GAAQF,EAAa,EACrC6K,EAAW3K,GAAQD,EAAS,EAEhC,GADAoN,EAAUzB,GAAW3C,EAAI,MAAOA,EAAI,UAAW,EAAG,OAAW7G,EAAGC,EAAGuI,EAAeC,CAAQ,EACtF,CAACA,EAAS,MACZ,OAAO5B,EAETqE,EAAUrE,EAAI,MAAQ2B,EAAc,MAAQvI,IAAMtC,EAAU,GAAK,EAAI,OAbvD,CACd,GAAIsC,IAAMtC,EACR,OAAOkJ,EAETqE,EAAU,EACVD,EAAU,IAAI5C,GAAaxB,EAAI,UAAW,CAAC,CAAC7G,EAAGC,CAAC,CAAC,CAAC,CACxD,CASI,OAAI4G,EAAI,WACNA,EAAI,KAAOqE,EACXrE,EAAI,MAAQoE,EACZpE,EAAI,OAAS,OACbA,EAAI,UAAY,GACTA,GAEFoE,EAAUhD,GAAQiD,EAASD,CAAO,EAAItE,GAAU,EAGzD,SAAS6C,GAAWhD,EAAMwB,EAASM,EAAOC,EAAS1G,EAAK5F,EAAOuM,EAAeC,EAAU,CACtF,OAAKjC,EAQEA,EAAK,OAAOwB,EAASM,EAAOC,EAAS1G,EAAK5F,EAAOuM,EAAeC,CAAQ,EAPzExM,IAAU0B,EACL6I,GAETxI,EAAOyK,CAAQ,EACfzK,EAAOwK,CAAa,EACb,IAAIgC,GAAUxC,EAASO,EAAS,CAAC1G,EAAK5F,CAAK,CAAC,GAKvD,SAAS0N,GAAWnD,EAAM,CACxB,OAAOA,EAAK,cAAgBgE,IAAahE,EAAK,cAAgB8D,GAGhE,SAASC,GAAc/D,EAAMwB,EAASM,EAAOC,EAAS7F,EAAO,CAC3D,GAAI8D,EAAK,UAAY+B,EACnB,OAAO,IAAI+B,GAAkBtC,EAASO,EAAS,CAAC/B,EAAK,MAAO9D,CAAK,CAAC,EAGpE,IAAIyI,GAAQ7C,IAAU,EAAI9B,EAAK,QAAUA,EAAK,UAAY8B,GAAS5K,EAC/D0N,GAAQ9C,IAAU,EAAIC,EAAUA,IAAYD,GAAS5K,EAErD6L,EACAJ,EAAQgC,IAASC,EACnB,CAACb,GAAc/D,EAAMwB,EAASM,EAAQ9K,EAAO+K,EAAS7F,CAAK,CAAC,GAC1D6G,EAAU,IAAIiB,GAAUxC,EAASO,EAAS7F,CAAK,EAAIyI,EAAOC,EAAO,CAAC5E,EAAM+C,CAAO,EAAI,CAACA,EAAS/C,CAAI,GAErG,OAAO,IAAIyC,GAAkBjB,EAAU,GAAKmD,EAAS,GAAKC,EAAOjC,CAAK,EAGxE,SAASL,GAAYd,EAASvE,EAAS5B,EAAK5F,EAAO,CAC5C+L,IACHA,EAAU,IAAI/J,IAGhB,QADIuI,EAAO,IAAIgE,GAAUxC,EAAS3C,EAAKxD,CAAG,EAAG,CAACA,EAAK5F,CAAK,CAAC,EAChDsC,EAAK,EAAGA,EAAKkF,EAAQ,OAAQlF,IAAM,CAC1C,IAAImE,EAAQe,EAAQlF,CAAE,EACtBiI,EAAOA,EAAK,OAAOwB,EAAS,EAAG,OAAWtF,EAAM,CAAC,EAAGA,EAAM,CAAC,CAAC,EAE9D,OAAO8D,EAGT,SAAS6D,GAAUrC,EAASmB,EAAOe,EAAOmB,EAAW,CAInD,QAHInC,EAAS,EACToC,EAAW,EACXC,EAAc,IAAI,MAAMrB,CAAK,EACxB3L,EAAK,EAAG6K,EAAM,EAAG/K,EAAM8K,EAAM,OAAQ5K,EAAKF,EAAKE,IAAM6K,IAAQ,EAAG,CACvE,IAAI5C,EAAO2C,EAAM5K,CAAE,EACfiI,IAAS,QAAajI,IAAO8M,IAC/BnC,GAAUE,EACVmC,EAAYD,GAAU,EAAI9E,GAG9B,OAAO,IAAIyC,GAAkBjB,EAASkB,EAAQqC,CAAW,EAG3D,SAAS7B,GAAY1B,EAASmB,EAAOD,EAAQsC,EAAWhF,EAAM,CAG5D,QAFI0D,EAAQ,EACRuB,EAAgB,IAAI,MAAMhO,CAAI,EACzBc,EAAK,EAAG2K,IAAW,EAAG3K,IAAM2K,KAAY,EAC/CuC,EAAclN,CAAE,EAAI2K,EAAS,EAAIC,EAAMe,GAAO,EAAI,OAEpD,OAAAuB,EAAcD,CAAS,EAAIhF,EACpB,IAAIyD,GAAiBjC,EAASkC,EAAQ,EAAGuB,CAAa,EAG/D,SAASrE,GAAiBP,EAAKQ,EAAQqE,EAAW,CAEhD,QADIpE,EAAQ,CAAE,EACL/I,EAAK,EAAGA,EAAKmN,EAAU,OAAQnN,IAAM,CAC5C,IAAItC,EAAQyP,EAAUnN,CAAE,EACpBE,EAAOrC,EAAcH,CAAK,EACzBC,EAAWD,CAAK,IACnBwC,EAAOA,EAAK,IAAI,SAASwB,EAAI,CAAC,OAAO0C,GAAO1C,CAAC,CAAC,CAAC,GAEjDqH,EAAM,KAAK7I,CAAI,EAEjB,OAAOkN,GAAwB9E,EAAKQ,EAAQC,CAAK,EAGnD,SAASE,GAAWoE,EAAU3P,EAAO4F,EAAK,CACxC,OAAO+J,GAAYA,EAAS,WAAa1P,EAAWD,CAAK,EACvD2P,EAAS,UAAU3P,CAAK,EACxBiH,EAAG0I,EAAU3P,CAAK,EAAI2P,EAAW3P,EAGrC,SAASwL,GAAeJ,EAAQ,CAC9B,OAAO,SAASuE,EAAU3P,EAAO4F,EAAM,CACrC,GAAI+J,GAAYA,EAAS,eAAiB1P,EAAWD,CAAK,EACxD,OAAO2P,EAAS,cAAcvE,EAAQpL,CAAK,EAE7C,IAAI4P,EAAYxE,EAAOuE,EAAU3P,EAAO4F,CAAG,EAC3C,OAAOqB,EAAG0I,EAAUC,CAAS,EAAID,EAAWC,CAC7C,EAGH,SAASF,GAAwBG,EAAYzE,EAAQC,EAAO,CAE1D,OADAA,EAAQA,EAAM,OAAO,SAASyE,EAAI,CAAC,OAAOA,EAAE,OAAS,CAAC,CAAC,EACnDzE,EAAM,SAAW,EACZwE,EAELA,EAAW,OAAS,GAAK,CAACA,EAAW,WAAaxE,EAAM,SAAW,EAC9DwE,EAAW,YAAYxE,EAAM,CAAC,CAAC,EAEjCwE,EAAW,cAAc,SAASA,EAAa,CAUpD,QATIE,EAAe3E,EACjB,SAASpL,EAAO4F,EAAM,CACpBiK,EAAW,OAAOjK,EAAKlE,EAAS,SAASiO,EACvC,CAAC,OAAOA,IAAajO,EAAU1B,EAAQoL,EAAOuE,EAAU3P,EAAO4F,CAAG,CAAC,CACpE,CACF,EACD,SAAS5F,EAAO4F,EAAM,CACpBiK,EAAW,IAAIjK,EAAK5F,CAAK,GAEpBsC,EAAK,EAAGA,EAAK+I,EAAM,OAAQ/I,IAClC+I,EAAM/I,CAAE,EAAE,QAAQyN,CAAY,CAEtC,CAAK,EAGH,SAAS9E,GAAgB0E,EAAUK,EAAazK,EAAawF,EAAS,CACpE,IAAIkF,EAAWN,IAAajO,EACxBsE,EAAOgK,EAAY,KAAM,EAC7B,GAAIhK,EAAK,KAAM,CACb,IAAIkK,EAAgBD,EAAW1K,EAAcoK,EACzCQ,EAAWpF,EAAQmF,CAAa,EACpC,OAAOC,IAAaD,EAAgBP,EAAWQ,EAEjDhI,GACE8H,GAAaN,GAAYA,EAAS,IAClC,iBACD,EACD,IAAI/J,EAAMI,EAAK,MACXoK,EAAeH,EAAWvO,EAAUiO,EAAS,IAAI/J,EAAKlE,CAAO,EAC7D2O,EAAcpF,GAChBmF,EACAJ,EACAzK,EACAwF,CACD,EACD,OAAOsF,IAAgBD,EAAeT,EACpCU,IAAgB3O,EAAUiO,EAAS,OAAO/J,CAAG,GAC5CqK,EAAWvF,GAAU,EAAGiF,GAAU,IAAI/J,EAAKyK,CAAW,EAG3D,SAASjD,GAAS0C,EAAG,CACnB,OAAAA,EAAIA,GAAMA,GAAK,EAAK,YACpBA,GAAKA,EAAI,YAAgBA,GAAK,EAAK,WACnCA,EAAKA,GAAKA,GAAK,GAAM,UACrBA,EAAIA,GAAKA,GAAK,GACdA,EAAIA,GAAKA,GAAK,IACPA,EAAI,IAGb,SAASjC,GAAMvI,EAAOoH,EAAKvG,EAAKmK,EAAS,CACvC,IAAIC,EAAWD,EAAUhL,EAAQrD,GAAQqD,CAAK,EAC9C,OAAAiL,EAAS7D,CAAG,EAAIvG,EACToK,EAGT,SAASxC,GAASzI,EAAOoH,EAAKvG,EAAKmK,EAAS,CAC1C,IAAIE,EAASlL,EAAM,OAAS,EAC5B,GAAIgL,GAAW5D,EAAM,IAAM8D,EACzB,OAAAlL,EAAMoH,CAAG,EAAIvG,EACNb,EAIT,QAFIiL,EAAW,IAAI,MAAMC,CAAM,EAC3BC,EAAQ,EACHnO,EAAK,EAAGA,EAAKkO,EAAQlO,IACxBA,IAAOoK,GACT6D,EAASjO,CAAE,EAAI6D,EACfsK,EAAQ,IAERF,EAASjO,CAAE,EAAIgD,EAAMhD,EAAKmO,CAAK,EAGnC,OAAOF,EAGT,SAASzC,GAAUxI,EAAOoH,EAAK4D,EAAS,CACtC,IAAIE,EAASlL,EAAM,OAAS,EAC5B,GAAIgL,GAAW5D,IAAQ8D,EACrB,OAAAlL,EAAM,IAAK,EACJA,EAIT,QAFIiL,EAAW,IAAI,MAAMC,CAAM,EAC3BC,EAAQ,EACHnO,EAAK,EAAGA,EAAKkO,EAAQlO,IACxBA,IAAOoK,IACT+D,EAAQ,GAEVF,EAASjO,CAAE,EAAIgD,EAAMhD,EAAKmO,CAAK,EAEjC,OAAOF,EAGT,IAAI3D,GAAqBpL,EAAO,EAC5BgM,GAA0BhM,EAAO,EACjC2M,GAA0B3M,EAAO,EAErC5B,EAAY8Q,EAAM7H,EAAiB,EAIjC,SAAS6H,EAAK1Q,EAAO,CACnB,IAAI2Q,EAAQC,GAAW,EACvB,GAAI5Q,GAAU,KACZ,OAAO2Q,EAET,GAAIE,GAAO7Q,CAAK,EACd,OAAOA,EAET,IAAIwC,EAAOlC,GAAgBN,CAAK,EAC5BgD,EAAOR,EAAK,KAChB,OAAIQ,IAAS,EACJ2N,GAETnG,EAAkBxH,CAAI,EAClBA,EAAO,GAAKA,EAAOxB,EACdsP,GAAS,EAAG9N,EAAMzB,EAAO,KAAM,IAAIwP,GAAMvO,EAAK,QAAO,CAAE,CAAC,EAE1DmO,EAAM,cAAc,SAASK,EAAO,CACzCA,EAAK,QAAQhO,CAAI,EACjBR,EAAK,QAAQ,SAASwB,EAAGiN,EAAI,CAAC,OAAOD,EAAK,IAAIC,EAAGjN,CAAC,CAAC,CAAC,CAC5D,CAAO,GAGH0M,EAAK,GAAK,UAAwB,CAChC,OAAO,KAAK,SAAS,CACtB,EAEDA,EAAK,UAAU,SAAW,UAAW,CACnC,OAAO,KAAK,WAAW,SAAU,GAAG,CACrC,EAIDA,EAAK,UAAU,IAAM,SAAS/N,EAAO4C,EAAa,CAEhD,GADA5C,EAAQD,GAAU,KAAMC,CAAK,EACzBA,GAAS,GAAKA,EAAQ,KAAK,KAAM,CACnCA,GAAS,KAAK,QACd,IAAI4H,EAAO2G,GAAY,KAAMvO,CAAK,EAClC,OAAO4H,GAAQA,EAAK,MAAM5H,EAAQlB,CAAI,EAExC,OAAO8D,CACR,EAIDmL,EAAK,UAAU,IAAM,SAAS/N,EAAO3C,EAAO,CAC1C,OAAOmR,GAAW,KAAMxO,EAAO3C,CAAK,CACrC,EAED0Q,EAAK,UAAU,OAAS,SAAS/N,EAAO,CACtC,OAAQ,KAAK,IAAIA,CAAK,EACpBA,IAAU,EAAI,KAAK,MAAO,EAC1BA,IAAU,KAAK,KAAO,EAAI,KAAK,IAAK,EACpC,KAAK,OAAOA,EAAO,CAAC,EAHI,IAI3B,EAED+N,EAAK,UAAU,OAAS,SAAS/N,EAAO3C,EAAO,CAC7C,OAAO,KAAK,OAAO2C,EAAO,EAAG3C,CAAK,CACnC,EAED0Q,EAAK,UAAU,MAAQ,UAAW,CAChC,OAAI,KAAK,OAAS,EACT,KAEL,KAAK,WACP,KAAK,KAAO,KAAK,QAAU,KAAK,UAAY,EAC5C,KAAK,OAASnP,EACd,KAAK,MAAQ,KAAK,MAAQ,KAC1B,KAAK,OAAS,OACd,KAAK,UAAY,GACV,MAEFqP,GAAW,CACnB,EAEDF,EAAK,UAAU,KAAO,UAAwB,CAC5C,IAAIU,EAAS,UACTC,EAAU,KAAK,KACnB,OAAO,KAAK,cAAc,SAASL,EAAO,CACxCM,GAAcN,EAAM,EAAGK,EAAUD,EAAO,MAAM,EAC9C,QAAS9O,EAAK,EAAGA,EAAK8O,EAAO,OAAQ9O,IACnC0O,EAAK,IAAIK,EAAU/O,EAAI8O,EAAO9O,CAAE,CAAC,CAE3C,CAAO,CACF,EAEDoO,EAAK,UAAU,IAAM,UAAW,CAC9B,OAAOY,GAAc,KAAM,EAAG,EAAE,CACjC,EAEDZ,EAAK,UAAU,QAAU,UAAwB,CAC/C,IAAIU,EAAS,UACb,OAAO,KAAK,cAAc,SAASJ,EAAO,CACxCM,GAAcN,EAAM,CAACI,EAAO,MAAM,EAClC,QAAS9O,EAAK,EAAGA,EAAK8O,EAAO,OAAQ9O,IACnC0O,EAAK,IAAI1O,EAAI8O,EAAO9O,CAAE,CAAC,CAEjC,CAAO,CACF,EAEDoO,EAAK,UAAU,MAAQ,UAAW,CAChC,OAAOY,GAAc,KAAM,CAAC,CAC7B,EAIDZ,EAAK,UAAU,MAAQ,UAAuB,CAC5C,OAAOa,GAAkB,KAAM,OAAW,SAAS,CACpD,EAEDb,EAAK,UAAU,UAAY,SAAStF,EAAQ,CAAC,IAAIC,EAAQ1L,EAAQ,KAAK,UAAW,CAAC,EAChF,OAAO4R,GAAkB,KAAMnG,EAAQC,CAAK,CAC7C,EAEDqF,EAAK,UAAU,UAAY,UAAuB,CAChD,OAAOa,GAAkB,KAAMhG,GAAY,SAAS,CACrD,EAEDmF,EAAK,UAAU,cAAgB,SAAStF,EAAQ,CAAC,IAAIC,EAAQ1L,EAAQ,KAAK,UAAW,CAAC,EACpF,OAAO4R,GAAkB,KAAM/F,GAAeJ,CAAM,EAAGC,CAAK,CAC7D,EAEDqF,EAAK,UAAU,QAAU,SAAS1N,EAAM,CACtC,OAAOsO,GAAc,KAAM,EAAGtO,CAAI,CACnC,EAID0N,EAAK,UAAU,MAAQ,SAAS5N,EAAOC,EAAK,CAC1C,IAAIC,EAAO,KAAK,KAChB,OAAIH,GAAWC,EAAOC,EAAKC,CAAI,EACtB,KAEFsO,GACL,KACArO,GAAaH,EAAOE,CAAI,EACxBG,GAAWJ,EAAKC,CAAI,CACrB,CACF,EAED0N,EAAK,UAAU,WAAa,SAAS5M,EAAMgB,EAAS,CAClD,IAAInC,EAAQ,EACRyO,EAASI,GAAY,KAAM1M,CAAO,EACtC,OAAO,IAAInB,EAAS,UAAY,CAC9B,IAAI3D,EAAQoR,EAAQ,EACpB,OAAOpR,IAAUyR,GACfvN,EAAc,EACdL,EAAcC,EAAMnB,IAAS3C,CAAK,CAC5C,CAAO,CACF,EAED0Q,EAAK,UAAU,UAAY,SAAS7L,EAAIC,EAAS,CAI/C,QAHInC,EAAQ,EACRyO,EAASI,GAAY,KAAM1M,CAAO,EAClC9E,GACIA,EAAQoR,EAAQ,KAAMK,IACxB5M,EAAG7E,EAAO2C,IAAS,IAAI,IAAM,IAAjC,CAIF,OAAOA,CACR,EAED+N,EAAK,UAAU,cAAgB,SAAS3E,EAAS,CAC/C,OAAIA,IAAY,KAAK,UACZ,KAEJA,EAIE+E,GAAS,KAAK,QAAS,KAAK,UAAW,KAAK,OAAQ,KAAK,MAAO,KAAK,MAAO/E,EAAS,KAAK,MAAM,GAHrG,KAAK,UAAYA,EACV,KAGV,EAGH,SAAS8E,GAAOa,EAAW,CACzB,MAAO,CAAC,EAAEA,GAAaA,EAAUC,EAAgB,GAGnDjB,EAAK,OAASG,GAEd,IAAIc,GAAmB,yBAEnBC,EAAgBlB,EAAK,UACzBkB,EAAcD,EAAgB,EAAI,GAClCC,EAActQ,EAAM,EAAIsQ,EAAc,OACtCA,EAAc,MAAQzF,EAAa,MACnCyF,EAAc,SACdA,EAAc,SAAWzF,EAAa,SACtCyF,EAAc,OAASzF,EAAa,OACpCyF,EAAc,SAAWzF,EAAa,SACtCyF,EAAc,QAAUzF,EAAa,QACrCyF,EAAc,YAAczF,EAAa,YACzCyF,EAAc,cAAgBzF,EAAa,cAC3CyF,EAAc,UAAYzF,EAAa,UACvCyF,EAAc,YAAczF,EAAa,YACzCyF,EAAc,WAAazF,EAAa,WAItC,SAAS4E,GAAMzL,EAAOyG,EAAS,CAC7B,KAAK,MAAQzG,EACb,KAAK,QAAUyG,EAKjBgF,GAAM,UAAU,aAAe,SAAShF,EAAS8F,EAAOlP,EAAO,CAC7D,GAAIA,IAAUkP,EAAQ,GAAKA,EAAa,KAAK,MAAM,SAAW,EAC5D,OAAO,KAET,IAAIC,EAAenP,IAAUkP,EAASpQ,EACtC,GAAIqQ,GAAe,KAAK,MAAM,OAC5B,OAAO,IAAIf,GAAM,CAAE,EAAEhF,CAAO,EAE9B,IAAIgG,EAAgBD,IAAgB,EAChCE,EACJ,GAAIH,EAAQ,EAAG,CACb,IAAII,EAAW,KAAK,MAAMH,CAAW,EAErC,GADAE,EAAWC,GAAYA,EAAS,aAAalG,EAAS8F,EAAQtQ,EAAOoB,CAAK,EACtEqP,IAAaC,GAAYF,EAC3B,OAAO,KAGX,GAAIA,GAAiB,CAACC,EACpB,OAAO,KAET,IAAIE,EAAWC,GAAc,KAAMpG,CAAO,EAC1C,GAAI,CAACgG,EACH,QAASzP,EAAK,EAAGA,EAAKwP,EAAaxP,IACjC4P,EAAS,MAAM5P,CAAE,EAAI,OAGzB,OAAI0P,IACFE,EAAS,MAAMJ,CAAW,EAAIE,GAEzBE,CACR,EAEDnB,GAAM,UAAU,YAAc,SAAShF,EAAS8F,EAAOlP,EAAO,CAC5D,GAAIA,KAAWkP,EAAQ,GAAKA,EAAQ,IAAM,KAAK,MAAM,SAAW,EAC9D,OAAO,KAET,IAAIO,EAAczP,EAAQ,IAAOkP,EAASpQ,EAC1C,GAAI2Q,GAAa,KAAK,MAAM,OAC1B,OAAO,KAGT,IAAIJ,EACJ,GAAIH,EAAQ,EAAG,CACb,IAAII,EAAW,KAAK,MAAMG,CAAS,EAEnC,GADAJ,EAAWC,GAAYA,EAAS,YAAYlG,EAAS8F,EAAQtQ,EAAOoB,CAAK,EACrEqP,IAAaC,GAAYG,IAAc,KAAK,MAAM,OAAS,EAC7D,OAAO,KAIX,IAAIF,EAAWC,GAAc,KAAMpG,CAAO,EAC1C,OAAAmG,EAAS,MAAM,OAAOE,EAAY,CAAC,EAC/BJ,IACFE,EAAS,MAAME,CAAS,EAAIJ,GAEvBE,CACR,EAIH,IAAIT,GAAO,CAAE,EAEb,SAASD,GAAYR,EAAMlM,EAAS,CAClC,IAAIuN,EAAOrB,EAAK,QACZsB,EAAQtB,EAAK,UACbuB,EAAUC,GAAcF,CAAK,EAC7BG,EAAOzB,EAAK,MAEhB,OAAO0B,EAAkB1B,EAAK,MAAOA,EAAK,OAAQ,CAAC,EAEnD,SAAS0B,EAAkBnI,EAAMsH,EAAO1P,EAAQ,CAC9C,OAAO0P,IAAU,EACfc,EAAYpI,EAAMpI,CAAM,EACxByQ,EAAYrI,EAAMsH,EAAO1P,CAAM,EAGnC,SAASwQ,EAAYpI,EAAMpI,EAAQ,CACjC,IAAImD,EAAQnD,IAAWoQ,EAAUE,GAAQA,EAAK,MAAQlI,GAAQA,EAAK,MAC/DsI,EAAO1Q,EAASkQ,EAAO,EAAIA,EAAOlQ,EAClC2Q,EAAKR,EAAQnQ,EACjB,OAAI2Q,EAAKtR,IACPsR,EAAKtR,GAEA,UAAY,CACjB,GAAIqR,IAASC,EACX,OAAOrB,GAET,IAAI/E,EAAM5H,EAAU,EAAEgO,EAAKD,IAC3B,OAAOvN,GAASA,EAAMoH,CAAG,CAC1B,EAGH,SAASkG,EAAYrI,EAAMsH,EAAO1P,EAAQ,CACxC,IAAIiP,EACA9L,EAAQiF,GAAQA,EAAK,MACrBsI,EAAO1Q,EAASkQ,EAAO,EAAKA,EAAOlQ,GAAW0P,EAC9CiB,GAAOR,EAAQnQ,GAAW0P,GAAS,EACvC,OAAIiB,EAAKtR,IACPsR,EAAKtR,GAEA,UAAY,CACjB,EAAG,CACD,GAAI4P,EAAQ,CACV,IAAIpR,GAAQoR,EAAQ,EACpB,GAAIpR,KAAUyR,GACZ,OAAOzR,GAEToR,EAAS,KAEX,GAAIyB,IAASC,EACX,OAAOrB,GAET,IAAI/E,GAAM5H,EAAU,EAAEgO,EAAKD,IAC3BzB,EAASsB,EACPpN,GAASA,EAAMoH,EAAG,EAAGmF,EAAQtQ,EAAOY,GAAUuK,IAAOmF,EACtD,QACM,GACV,GAIL,SAASf,GAASiC,EAAQC,EAAUnB,EAAO/C,EAAM2D,EAAM1G,EAAS3C,EAAM,CACpE,IAAI4H,EAAO,OAAO,OAAOY,CAAa,EACtC,OAAAZ,EAAK,KAAOgC,EAAWD,EACvB/B,EAAK,QAAU+B,EACf/B,EAAK,UAAYgC,EACjBhC,EAAK,OAASa,EACdb,EAAK,MAAQlC,EACbkC,EAAK,MAAQyB,EACbzB,EAAK,UAAYjF,EACjBiF,EAAK,OAAS5H,EACd4H,EAAK,UAAY,GACVA,EAGT,IAAIiC,GACJ,SAASrC,IAAY,CACnB,OAAOqC,KAAeA,GAAanC,GAAS,EAAG,EAAGvP,CAAK,GAGzD,SAAS4P,GAAWH,EAAMrO,EAAO3C,EAAO,CAGtC,GAFA2C,EAAQD,GAAUsO,EAAMrO,CAAK,EAEzBA,IAAUA,EACZ,OAAOqO,EAGT,GAAIrO,GAASqO,EAAK,MAAQrO,EAAQ,EAChC,OAAOqO,EAAK,cAAc,SAASA,EAAO,CACxCrO,EAAQ,EACN2O,GAAcN,EAAMrO,CAAK,EAAE,IAAI,EAAG3C,CAAK,EACvCsR,GAAcN,EAAM,EAAGrO,EAAQ,CAAC,EAAE,IAAIA,EAAO3C,CAAK,CAC5D,CAAO,EAGH2C,GAASqO,EAAK,QAEd,IAAIkC,EAAUlC,EAAK,MACfhC,EAAUgC,EAAK,MACfxE,EAAW3K,GAAQD,EAAS,EAOhC,OANIe,GAAS6P,GAAcxB,EAAK,SAAS,EACvCkC,EAAUC,GAAYD,EAASlC,EAAK,UAAW,EAAGrO,EAAO3C,EAAOwM,CAAQ,EAExEwC,EAAUmE,GAAYnE,EAASgC,EAAK,UAAWA,EAAK,OAAQrO,EAAO3C,EAAOwM,CAAQ,EAG/EA,EAAS,MAIVwE,EAAK,WACPA,EAAK,MAAQhC,EACbgC,EAAK,MAAQkC,EACblC,EAAK,OAAS,OACdA,EAAK,UAAY,GACVA,GAEFF,GAASE,EAAK,QAASA,EAAK,UAAWA,EAAK,OAAQhC,EAASkE,CAAO,EAVlElC,EAaX,SAASmC,GAAY5I,EAAMwB,EAAS8F,EAAOlP,EAAO3C,EAAOwM,EAAU,CACjE,IAAIE,EAAO/J,IAAUkP,EAASpQ,EAC1B2R,EAAU7I,GAAQmC,EAAMnC,EAAK,MAAM,OACvC,GAAI,CAAC6I,GAAWpT,IAAU,OACxB,OAAOuK,EAGT,IAAI+C,EAEJ,GAAIuE,EAAQ,EAAG,CACb,IAAIwB,EAAY9I,GAAQA,EAAK,MAAMmC,CAAG,EAClC4G,EAAeH,GAAYE,EAAWtH,EAAS8F,EAAQtQ,EAAOoB,EAAO3C,EAAOwM,CAAQ,EACxF,OAAI8G,IAAiBD,EACZ9I,GAET+C,EAAU6E,GAAc5H,EAAMwB,CAAO,EACrCuB,EAAQ,MAAMZ,CAAG,EAAI4G,EACdhG,GAGT,OAAI8F,GAAW7I,EAAK,MAAMmC,CAAG,IAAM1M,EAC1BuK,GAGTxI,EAAOyK,CAAQ,EAEfc,EAAU6E,GAAc5H,EAAMwB,CAAO,EACjC/L,IAAU,QAAa0M,IAAQY,EAAQ,MAAM,OAAS,EACxDA,EAAQ,MAAM,IAAK,EAEnBA,EAAQ,MAAMZ,CAAG,EAAI1M,EAEhBsN,GAGT,SAAS6E,GAAc5H,EAAMwB,EAAS,CACpC,OAAIA,GAAWxB,GAAQwB,IAAYxB,EAAK,QAC/BA,EAEF,IAAIwG,GAAMxG,EAAOA,EAAK,MAAM,MAAO,EAAG,CAAE,EAAEwB,CAAO,EAG1D,SAASmF,GAAYF,EAAMuC,EAAU,CACnC,GAAIA,GAAYf,GAAcxB,EAAK,SAAS,EAC1C,OAAOA,EAAK,MAEd,GAAIuC,EAAW,GAAMvC,EAAK,OAASzP,EAAQ,CAGzC,QAFIgJ,EAAOyG,EAAK,MACZa,EAAQb,EAAK,OACVzG,GAAQsH,EAAQ,GACrBtH,EAAOA,EAAK,MAAOgJ,IAAa1B,EAASpQ,CAAI,EAC7CoQ,GAAStQ,EAEX,OAAOgJ,GAIX,SAAS+G,GAAcN,EAAMlO,EAAOC,EAAK,CAGnCD,IAAU,SACZA,EAAQA,EAAQ,GAEdC,IAAQ,SACVA,EAAMA,EAAM,GAEd,IAAIyQ,EAAQxC,EAAK,WAAa,IAAIhP,GAC9ByR,EAAYzC,EAAK,QACjB0C,EAAc1C,EAAK,UACnB2C,EAAYF,EAAY3Q,EACxB8Q,EAAc7Q,IAAQ,OAAY2Q,EAAc3Q,EAAM,EAAI2Q,EAAc3Q,EAAM0Q,EAAY1Q,EAC9F,GAAI4Q,IAAcF,GAAaG,IAAgBF,EAC7C,OAAO1C,EAIT,GAAI2C,GAAaC,EACf,OAAO5C,EAAK,MAAO,EAQrB,QALI6C,EAAW7C,EAAK,OAChBhC,EAAUgC,EAAK,MAGf8C,EAAc,EACXH,EAAYG,EAAc,GAC/B9E,EAAU,IAAI+B,GAAM/B,GAAWA,EAAQ,MAAM,OAAS,CAAC,OAAWA,CAAO,EAAI,CAAA,EAAIwE,CAAK,EACtFK,GAAYtS,EACZuS,GAAe,GAAKD,EAElBC,IACFH,GAAaG,EACbL,GAAaK,EACbF,GAAeE,EACfJ,GAAeI,GAOjB,QAJIC,EAAgBvB,GAAckB,CAAW,EACzCM,EAAgBxB,GAAcoB,CAAW,EAGtCI,GAAiB,GAAMH,EAAWtS,GACvCyN,EAAU,IAAI+B,GAAM/B,GAAWA,EAAQ,MAAM,OAAS,CAACA,CAAO,EAAI,CAAE,EAAEwE,CAAK,EAC3EK,GAAYtS,EAId,IAAI0S,EAAUjD,EAAK,MACfkC,EAAUc,EAAgBD,EAC5B7C,GAAYF,EAAM4C,EAAc,CAAC,EACjCI,EAAgBD,EAAgB,IAAIhD,GAAM,CAAA,EAAIyC,CAAK,EAAIS,EAGzD,GAAIA,GAAWD,EAAgBD,GAAiBJ,EAAYD,GAAeO,EAAQ,MAAM,OAAQ,CAC/FjF,EAAUmD,GAAcnD,EAASwE,CAAK,EAEtC,QADIjJ,EAAOyE,EACF6C,GAAQgC,EAAUhC,GAAQtQ,EAAOsQ,IAAStQ,EAAO,CACxD,IAAImL,GAAOqH,IAAkBlC,GAASpQ,EACtC8I,EAAOA,EAAK,MAAMmC,EAAG,EAAIyF,GAAc5H,EAAK,MAAMmC,EAAG,EAAG8G,CAAK,EAE/DjJ,EAAK,MAAOwJ,IAAkBxS,EAASE,CAAI,EAAIwS,EASjD,GALIL,EAAcF,IAChBR,EAAUA,GAAWA,EAAQ,YAAYM,EAAO,EAAGI,CAAW,GAI5DD,GAAaK,EACfL,GAAaK,EACbJ,GAAeI,EACfH,EAAWtS,EACXyN,EAAU,KACVkE,EAAUA,GAAWA,EAAQ,aAAaM,EAAO,EAAGG,CAAS,UAGpDA,EAAYF,GAAaO,EAAgBD,EAAe,CAIjE,IAHAD,EAAc,EAGP9E,GAAS,CACd,IAAIkF,GAAcP,IAAcE,EAAYpS,EAC5C,GAAIyS,KAAgBF,IAAkBH,EAAYpS,EAChD,MAEEyS,KACFJ,IAAgB,GAAKD,GAAYK,IAEnCL,GAAYtS,EACZyN,EAAUA,EAAQ,MAAMkF,EAAU,EAIhClF,GAAW2E,EAAYF,IACzBzE,EAAUA,EAAQ,aAAawE,EAAOK,EAAUF,EAAYG,CAAW,GAErE9E,GAAWgF,EAAgBD,IAC7B/E,EAAUA,EAAQ,YAAYwE,EAAOK,EAAUG,EAAgBF,CAAW,GAExEA,IACFH,GAAaG,EACbF,GAAeE,GAInB,OAAI9C,EAAK,WACPA,EAAK,KAAO4C,EAAcD,EAC1B3C,EAAK,QAAU2C,EACf3C,EAAK,UAAY4C,EACjB5C,EAAK,OAAS6C,EACd7C,EAAK,MAAQhC,EACbgC,EAAK,MAAQkC,EACblC,EAAK,OAAS,OACdA,EAAK,UAAY,GACVA,GAEFF,GAAS6C,EAAWC,EAAaC,EAAU7E,EAASkE,CAAO,EAGpE,SAAS3B,GAAkBP,EAAM5F,EAAQqE,EAAW,CAGlD,QAFIpE,EAAQ,CAAE,EACV8I,EAAU,EACL7R,EAAK,EAAGA,EAAKmN,EAAU,OAAQnN,IAAM,CAC5C,IAAItC,EAAQyP,EAAUnN,CAAE,EACpBE,EAAOlC,GAAgBN,CAAK,EAC5BwC,EAAK,KAAO2R,IACdA,EAAU3R,EAAK,MAEZvC,EAAWD,CAAK,IACnBwC,EAAOA,EAAK,IAAI,SAASwB,EAAI,CAAC,OAAO0C,GAAO1C,CAAC,CAAC,CAAC,GAEjDqH,EAAM,KAAK7I,CAAI,EAEjB,OAAI2R,EAAUnD,EAAK,OACjBA,EAAOA,EAAK,QAAQmD,CAAO,GAEtBzE,GAAwBsB,EAAM5F,EAAQC,CAAK,EAGpD,SAASmH,GAAcxP,EAAM,CAC3B,OAAOA,EAAOxB,EAAO,EAAOwB,EAAO,IAAOzB,GAAUA,EAGtD3B,EAAY8L,EAAYjB,CAAG,EAIzB,SAASiB,EAAW1L,EAAO,CACzB,OAAOA,GAAU,KAA8BoU,GAAiB,EAC9DC,GAAarU,CAAK,EAAIA,EACtBoU,GAAiB,EAAC,cAAc,SAASxJ,EAAM,CAC7C,IAAIpI,EAAOrC,EAAcH,CAAK,EAC9BwK,EAAkBhI,EAAK,IAAI,EAC3BA,EAAK,QAAQ,SAASwB,EAAGD,EAAI,CAAC,OAAO6G,EAAI,IAAI7G,EAAGC,CAAC,CAAC,CAAC,CAC7D,CAAS,EAGL0H,EAAW,GAAK,UAAwB,CACtC,OAAO,KAAK,SAAS,CACtB,EAEDA,EAAW,UAAU,SAAW,UAAW,CACzC,OAAO,KAAK,WAAW,eAAgB,GAAG,CAC3C,EAIDA,EAAW,UAAU,IAAM,SAAS3H,EAAGwB,EAAa,CAClD,IAAI5C,EAAQ,KAAK,KAAK,IAAIoB,CAAC,EAC3B,OAAOpB,IAAU,OAAY,KAAK,MAAM,IAAIA,CAAK,EAAE,CAAC,EAAI4C,CACzD,EAIDmG,EAAW,UAAU,MAAQ,UAAW,CACtC,OAAI,KAAK,OAAS,EACT,KAEL,KAAK,WACP,KAAK,KAAO,EACZ,KAAK,KAAK,MAAO,EACjB,KAAK,MAAM,MAAO,EACX,MAEF0I,GAAiB,CACzB,EAED1I,EAAW,UAAU,IAAM,SAAS3H,EAAGC,EAAG,CACxC,OAAOsQ,GAAiB,KAAMvQ,EAAGC,CAAC,CACnC,EAED0H,EAAW,UAAU,OAAS,SAAS3H,EAAG,CACxC,OAAOuQ,GAAiB,KAAMvQ,EAAGrC,CAAO,CACzC,EAEDgK,EAAW,UAAU,WAAa,UAAW,CAC3C,OAAO,KAAK,KAAK,WAAY,GAAI,KAAK,MAAM,WAAY,CACzD,EAEDA,EAAW,UAAU,UAAY,SAAS7G,EAAIC,EAAS,CAAC,IAAImD,EAAS,KACnE,OAAO,KAAK,MAAM,UAChB,SAASxB,EAAQ,CAAC,OAAOA,GAAS5B,EAAG4B,EAAM,CAAC,EAAGA,EAAM,CAAC,EAAGwB,CAAM,CAAC,EAChEnD,CACD,CACF,EAED4G,EAAW,UAAU,WAAa,SAAS5H,EAAMgB,EAAS,CACxD,OAAO,KAAK,MAAM,aAAc,EAAC,WAAWhB,EAAMgB,CAAO,CAC1D,EAED4G,EAAW,UAAU,cAAgB,SAASK,EAAS,CACrD,GAAIA,IAAY,KAAK,UACnB,OAAO,KAET,IAAIwI,EAAS,KAAK,KAAK,cAAcxI,CAAO,EACxCyI,EAAU,KAAK,MAAM,cAAczI,CAAO,EAC9C,OAAKA,EAME0I,GAAeF,EAAQC,EAASzI,EAAS,KAAK,MAAM,GALzD,KAAK,UAAYA,EACjB,KAAK,KAAOwI,EACZ,KAAK,MAAQC,EACN,KAGV,EAGH,SAASH,GAAaK,EAAiB,CACrC,OAAO/J,GAAM+J,CAAe,GAAKvT,GAAUuT,CAAe,EAG5DhJ,EAAW,aAAe2I,GAE1B3I,EAAW,UAAUrK,EAAmB,EAAI,GAC5CqK,EAAW,UAAUpK,EAAM,EAAIoK,EAAW,UAAU,OAIpD,SAAS+I,GAAe7J,EAAKoG,EAAMjF,EAAS3C,EAAM,CAChD,IAAIuL,EAAO,OAAO,OAAOjJ,EAAW,SAAS,EAC7C,OAAAiJ,EAAK,KAAO/J,EAAMA,EAAI,KAAO,EAC7B+J,EAAK,KAAO/J,EACZ+J,EAAK,MAAQ3D,EACb2D,EAAK,UAAY5I,EACjB4I,EAAK,OAASvL,EACPuL,EAGT,IAAIC,GACJ,SAASR,IAAkB,CACzB,OAAOQ,KAAsBA,GAAoBH,GAAe/J,GAAU,EAAEkG,GAAS,CAAE,GAGzF,SAAS0D,GAAiBK,EAAM5Q,EAAGC,EAAG,CACpC,IAAI4G,EAAM+J,EAAK,KACX3D,EAAO2D,EAAK,MACZ1D,EAAIrG,EAAI,IAAI7G,CAAC,EACb8Q,EAAM5D,IAAM,OACZsD,EACAC,EACJ,GAAIxQ,IAAMtC,EAAS,CACjB,GAAI,CAACmT,EACH,OAAOF,EAEL3D,EAAK,MAAQxP,GAAQwP,EAAK,MAAQpG,EAAI,KAAO,GAC/C4J,EAAUxD,EAAK,OAAO,SAASvK,EAAOiG,EAAM,CAAC,OAAOjG,IAAU,QAAawK,IAAMvE,CAAG,CAAC,EACrF6H,EAASC,EAAQ,aAAa,IAAI,SAAS/N,EAAQ,CAAC,OAAOA,EAAM,CAAC,CAAC,CAAC,EAAE,KAAI,EAAG,MAAO,EAChFkO,EAAK,YACPJ,EAAO,UAAYC,EAAQ,UAAYG,EAAK,aAG9CJ,EAAS3J,EAAI,OAAO7G,CAAC,EACrByQ,EAAUvD,IAAMD,EAAK,KAAO,EAAIA,EAAK,IAAG,EAAKA,EAAK,IAAIC,EAAG,MAAS,EAE1E,SACU4D,EAAK,CACP,GAAI7Q,IAAMgN,EAAK,IAAIC,CAAC,EAAE,CAAC,EACrB,OAAO0D,EAETJ,EAAS3J,EACT4J,EAAUxD,EAAK,IAAIC,EAAG,CAAClN,EAAGC,CAAC,CAAC,CACpC,MACQuQ,EAAS3J,EAAI,IAAI7G,EAAGiN,EAAK,IAAI,EAC7BwD,EAAUxD,EAAK,IAAIA,EAAK,KAAM,CAACjN,EAAGC,CAAC,CAAC,EAGxC,OAAI2Q,EAAK,WACPA,EAAK,KAAOJ,EAAO,KACnBI,EAAK,KAAOJ,EACZI,EAAK,MAAQH,EACbG,EAAK,OAAS,OACPA,GAEFF,GAAeF,EAAQC,CAAO,EAGvC5U,EAAYkV,EAAiBzU,CAAQ,EACnC,SAASyU,EAAgBC,EAASvO,EAAS,CACzC,KAAK,MAAQuO,EACb,KAAK,SAAWvO,EAChB,KAAK,KAAOuO,EAAQ,KAGtBD,EAAgB,UAAU,IAAM,SAASlP,EAAKL,EAAa,CACzD,OAAO,KAAK,MAAM,IAAIK,EAAKL,CAAW,CACvC,EAEDuP,EAAgB,UAAU,IAAM,SAASlP,EAAK,CAC5C,OAAO,KAAK,MAAM,IAAIA,CAAG,CAC1B,EAEDkP,EAAgB,UAAU,SAAW,UAAW,CAC9C,OAAO,KAAK,MAAM,SAAU,CAC7B,EAEDA,EAAgB,UAAU,QAAU,UAAW,CAAC,IAAI7M,EAAS,KACvD+M,EAAmBC,GAAe,KAAM,EAAI,EAChD,OAAK,KAAK,WACRD,EAAiB,SAAW,UAAY,CAAC,OAAO/M,EAAO,MAAM,MAAK,EAAG,SAAS,GAEzE+M,CACR,EAEDF,EAAgB,UAAU,IAAM,SAASlJ,EAAQsJ,EAAS,CAAC,IAAIjN,EAAS,KAClEkN,EAAiBC,GAAW,KAAMxJ,EAAQsJ,CAAO,EACrD,OAAK,KAAK,WACRC,EAAe,SAAW,UAAY,CAAC,OAAOlN,EAAO,MAAM,MAAK,EAAG,IAAI2D,EAAQsJ,CAAO,CAAC,GAElFC,CACR,EAEDL,EAAgB,UAAU,UAAY,SAASjQ,EAAIC,EAAS,CAAC,IAAImD,EAAS,KACpE3F,EACJ,OAAO,KAAK,MAAM,UAChB,KAAK,SACH,SAAS0B,EAAGD,EAAI,CAAC,OAAOc,EAAGb,EAAGD,EAAGkE,CAAM,CAAC,GACtC3F,EAAKwC,EAAUuQ,GAAY,IAAI,EAAI,EACnC,SAASrR,EAAI,CAAC,OAAOa,EAAGb,EAAGc,EAAU,EAAExC,EAAKA,IAAM2F,CAAM,CAAC,GAC7DnD,CACD,CACF,EAEDgQ,EAAgB,UAAU,WAAa,SAAShR,EAAMgB,EAAS,CAC7D,GAAI,KAAK,SACP,OAAO,KAAK,MAAM,WAAWhB,EAAMgB,CAAO,EAE5C,IAAIgB,EAAW,KAAK,MAAM,WAAWxC,EAAgBwB,CAAO,EACxDxC,EAAKwC,EAAUuQ,GAAY,IAAI,EAAI,EACvC,OAAO,IAAI1R,EAAS,UAAY,CAC9B,IAAIqC,EAAOF,EAAS,KAAM,EAC1B,OAAOE,EAAK,KAAOA,EACjBnC,EAAcC,EAAMgB,EAAU,EAAExC,EAAKA,IAAM0D,EAAK,MAAOA,CAAI,CACrE,CAAO,CACF,EAEH8O,EAAgB,UAAUzT,EAAmB,EAAI,GAGjDzB,EAAY0V,GAAmB9U,CAAU,EACvC,SAAS8U,GAAkB9S,EAAM,CAC/B,KAAK,MAAQA,EACb,KAAK,KAAOA,EAAK,KAGnB8S,GAAkB,UAAU,SAAW,SAAStV,EAAO,CACrD,OAAO,KAAK,MAAM,SAASA,CAAK,CACjC,EAEDsV,GAAkB,UAAU,UAAY,SAASzQ,EAAIC,EAAS,CAAC,IAAImD,EAAS,KACtElC,EAAa,EACjB,OAAO,KAAK,MAAM,UAAU,SAAS/B,EAAI,CAAC,OAAOa,EAAGb,EAAG+B,IAAckC,CAAM,CAAC,EAAGnD,CAAO,CACvF,EAEDwQ,GAAkB,UAAU,WAAa,SAASxR,EAAMgB,EAAS,CAC/D,IAAIgB,EAAW,KAAK,MAAM,WAAWxC,EAAgBwB,CAAO,EACxDiB,EAAa,EACjB,OAAO,IAAIpC,EAAS,UAAY,CAC9B,IAAIqC,EAAOF,EAAS,KAAM,EAC1B,OAAOE,EAAK,KAAOA,EACjBnC,EAAcC,EAAMiC,IAAcC,EAAK,MAAOA,CAAI,CAC5D,CAAO,CACF,EAIHpG,EAAY2V,GAAe5U,EAAM,EAC/B,SAAS4U,GAAc/S,EAAM,CAC3B,KAAK,MAAQA,EACb,KAAK,KAAOA,EAAK,KAGnB+S,GAAc,UAAU,IAAM,SAAS3P,EAAK,CAC1C,OAAO,KAAK,MAAM,SAASA,CAAG,CAC/B,EAED2P,GAAc,UAAU,UAAY,SAAS1Q,EAAIC,EAAS,CAAC,IAAImD,EAAS,KACtE,OAAO,KAAK,MAAM,UAAU,SAASjE,EAAI,CAAC,OAAOa,EAAGb,EAAGA,EAAGiE,CAAM,CAAC,EAAGnD,CAAO,CAC5E,EAEDyQ,GAAc,UAAU,WAAa,SAASzR,EAAMgB,EAAS,CAC3D,IAAIgB,EAAW,KAAK,MAAM,WAAWxC,EAAgBwB,CAAO,EAC5D,OAAO,IAAInB,EAAS,UAAY,CAC9B,IAAIqC,EAAOF,EAAS,KAAM,EAC1B,OAAOE,EAAK,KAAOA,EACjBnC,EAAcC,EAAMkC,EAAK,MAAOA,EAAK,MAAOA,CAAI,CAC1D,CAAO,CACF,EAIHpG,EAAY4V,GAAqBnV,CAAQ,EACvC,SAASmV,GAAoBhO,EAAS,CACpC,KAAK,MAAQA,EACb,KAAK,KAAOA,EAAQ,KAGtBgO,GAAoB,UAAU,SAAW,UAAW,CAClD,OAAO,KAAK,MAAM,MAAO,CAC1B,EAEDA,GAAoB,UAAU,UAAY,SAAS3Q,EAAIC,EAAS,CAAC,IAAImD,EAAS,KAC5E,OAAO,KAAK,MAAM,UAAU,SAASxB,EAAQ,CAG3C,GAAIA,EAAO,CACTgP,GAAchP,CAAK,EACnB,IAAIiP,EAAkBzV,EAAWwG,CAAK,EACtC,OAAO5B,EACL6Q,EAAkBjP,EAAM,IAAI,CAAC,EAAIA,EAAM,CAAC,EACxCiP,EAAkBjP,EAAM,IAAI,CAAC,EAAIA,EAAM,CAAC,EACxCwB,CACD,EAEJ,EAAEnD,CAAO,CACX,EAED0Q,GAAoB,UAAU,WAAa,SAAS1R,EAAMgB,EAAS,CACjE,IAAIgB,EAAW,KAAK,MAAM,WAAWxC,EAAgBwB,CAAO,EAC5D,OAAO,IAAInB,EAAS,UAAY,CAC9B,OAAa,CACX,IAAIqC,EAAOF,EAAS,KAAM,EAC1B,GAAIE,EAAK,KACP,OAAOA,EAET,IAAIS,EAAQT,EAAK,MAGjB,GAAIS,EAAO,CACTgP,GAAchP,CAAK,EACnB,IAAIiP,EAAkBzV,EAAWwG,CAAK,EACtC,OAAO5C,EACLC,EACA4R,EAAkBjP,EAAM,IAAI,CAAC,EAAIA,EAAM,CAAC,EACxCiP,EAAkBjP,EAAM,IAAI,CAAC,EAAIA,EAAM,CAAC,EACxCT,CACD,GAGb,CAAO,CACF,EAGHsP,GAAkB,UAAU,YAC5BR,EAAgB,UAAU,YAC1BS,GAAc,UAAU,YACxBC,GAAoB,UAAU,YAC5BG,GAGF,SAASC,GAAYpR,EAAU,CAC7B,IAAIqR,EAAeC,GAAatR,CAAQ,EACxC,OAAAqR,EAAa,MAAQrR,EACrBqR,EAAa,KAAOrR,EAAS,KAC7BqR,EAAa,KAAO,UAAY,CAAC,OAAOrR,CAAQ,EAChDqR,EAAa,QAAU,UAAY,CACjC,IAAIb,EAAmBxQ,EAAS,QAAQ,MAAM,IAAI,EAClD,OAAAwQ,EAAiB,KAAO,UAAY,CAAC,OAAOxQ,EAAS,QAAO,CAAE,EACvDwQ,CACR,EACDa,EAAa,IAAM,SAASjQ,EAAM,CAAC,OAAOpB,EAAS,SAASoB,CAAG,CAAC,EAChEiQ,EAAa,SAAW,SAASjQ,EAAM,CAAC,OAAOpB,EAAS,IAAIoB,CAAG,CAAC,EAChEiQ,EAAa,YAAcF,GAC3BE,EAAa,kBAAoB,SAAUhR,EAAIC,EAAS,CAAC,IAAImD,EAAS,KACpE,OAAOzD,EAAS,UAAU,SAASR,EAAGD,EAAI,CAAC,OAAOc,EAAGd,EAAGC,EAAGiE,CAAM,IAAM,EAAK,EAAGnD,CAAO,GAExF+Q,EAAa,mBAAqB,SAAS/R,EAAMgB,EAAS,CACxD,GAAIhB,IAASP,GAAiB,CAC5B,IAAIuC,EAAWtB,EAAS,WAAWV,EAAMgB,CAAO,EAChD,OAAO,IAAInB,EAAS,UAAY,CAC9B,IAAIqC,EAAOF,EAAS,KAAM,EAC1B,GAAI,CAACE,EAAK,KAAM,CACd,IAAIjC,EAAIiC,EAAK,MAAM,CAAC,EACpBA,EAAK,MAAM,CAAC,EAAIA,EAAK,MAAM,CAAC,EAC5BA,EAAK,MAAM,CAAC,EAAIjC,EAElB,OAAOiC,CACjB,CAAS,EAEH,OAAOxB,EAAS,WACdV,IAASR,EAAiBD,GAAeC,EACzCwB,CACD,GAEI+Q,EAIT,SAAST,GAAW5Q,EAAUoH,EAAQsJ,EAAS,CAC7C,IAAIC,EAAiBW,GAAatR,CAAQ,EAC1C,OAAA2Q,EAAe,KAAO3Q,EAAS,KAC/B2Q,EAAe,IAAM,SAASvP,EAAM,CAAC,OAAOpB,EAAS,IAAIoB,CAAG,CAAC,EAC7DuP,EAAe,IAAM,SAASvP,EAAKL,EAAc,CAC/C,IAAIvB,EAAIQ,EAAS,IAAIoB,EAAKlE,CAAO,EACjC,OAAOsC,IAAMtC,EACX6D,EACAqG,EAAO,KAAKsJ,EAASlR,EAAG4B,EAAKpB,CAAQ,CACxC,EACD2Q,EAAe,kBAAoB,SAAUtQ,EAAIC,EAAS,CAAC,IAAImD,EAAS,KACtE,OAAOzD,EAAS,UACd,SAASR,EAAGD,EAAGiF,EAAI,CAAC,OAAOnE,EAAG+G,EAAO,KAAKsJ,EAASlR,EAAGD,EAAGiF,CAAC,EAAGjF,EAAGkE,CAAM,IAAM,EAAK,EACjFnD,CACD,GAEHqQ,EAAe,mBAAqB,SAAUrR,EAAMgB,EAAS,CAC3D,IAAIgB,EAAWtB,EAAS,WAAWjB,GAAiBuB,CAAO,EAC3D,OAAO,IAAInB,EAAS,UAAY,CAC9B,IAAIqC,EAAOF,EAAS,KAAM,EAC1B,GAAIE,EAAK,KACP,OAAOA,EAET,IAAIS,EAAQT,EAAK,MACbJ,EAAMa,EAAM,CAAC,EACjB,OAAO5C,EACLC,EACA8B,EACAgG,EAAO,KAAKsJ,EAASzO,EAAM,CAAC,EAAGb,EAAKpB,CAAQ,EAC5CwB,CACD,CACT,CAAO,GAEImP,EAIT,SAASF,GAAezQ,EAAUgC,EAAS,CACzC,IAAIwO,EAAmBc,GAAatR,CAAQ,EAC5C,OAAAwQ,EAAiB,MAAQxQ,EACzBwQ,EAAiB,KAAOxQ,EAAS,KACjCwQ,EAAiB,QAAU,UAAY,CAAC,OAAOxQ,CAAQ,EACnDA,EAAS,OACXwQ,EAAiB,KAAO,UAAY,CAClC,IAAIa,EAAeD,GAAYpR,CAAQ,EACvC,OAAAqR,EAAa,QAAU,UAAY,CAAC,OAAOrR,EAAS,KAAI,CAAE,EACnDqR,CACR,GAEHb,EAAiB,IAAM,SAASpP,EAAKL,EACnC,CAAC,OAAOf,EAAS,IAAIgC,EAAUZ,EAAM,GAAKA,EAAKL,CAAW,CAAC,EAC7DyP,EAAiB,IAAM,SAASpP,EAC9B,CAAC,OAAOpB,EAAS,IAAIgC,EAAUZ,EAAM,GAAKA,CAAG,CAAC,EAChDoP,EAAiB,SAAW,SAAShV,EAAQ,CAAC,OAAOwE,EAAS,SAASxE,CAAK,CAAC,EAC7EgV,EAAiB,YAAcW,GAC/BX,EAAiB,UAAY,SAAUnQ,EAAIC,EAAS,CAAC,IAAImD,EAAS,KAChE,OAAOzD,EAAS,UAAU,SAASR,EAAGD,EAAI,CAAC,OAAOc,EAAGb,EAAGD,EAAGkE,CAAM,CAAC,EAAG,CAACnD,CAAO,CAC9E,EACDkQ,EAAiB,WACf,SAASlR,EAAMgB,EAAU,CAAC,OAAON,EAAS,WAAWV,EAAM,CAACgB,CAAO,CAAC,EAC/DkQ,EAIT,SAASe,GAAcvR,EAAUwR,EAAWd,EAAS1O,EAAS,CAC5D,IAAIyP,EAAiBH,GAAatR,CAAQ,EAC1C,OAAIgC,IACFyP,EAAe,IAAM,SAASrQ,EAAM,CAClC,IAAI5B,EAAIQ,EAAS,IAAIoB,EAAKlE,CAAO,EACjC,OAAOsC,IAAMtC,GAAW,CAAC,CAACsU,EAAU,KAAKd,EAASlR,EAAG4B,EAAKpB,CAAQ,CACnE,EACDyR,EAAe,IAAM,SAASrQ,EAAKL,EAAc,CAC/C,IAAIvB,EAAIQ,EAAS,IAAIoB,EAAKlE,CAAO,EACjC,OAAOsC,IAAMtC,GAAWsU,EAAU,KAAKd,EAASlR,EAAG4B,EAAKpB,CAAQ,EAC9DR,EAAIuB,CACP,GAEH0Q,EAAe,kBAAoB,SAAUpR,EAAIC,EAAS,CAAC,IAAImD,EAAS,KAClElC,EAAa,EACjB,OAAAvB,EAAS,UAAU,SAASR,EAAGD,EAAG,EAAI,CACpC,GAAIiS,EAAU,KAAKd,EAASlR,EAAGD,EAAG,CAAC,EACjC,OAAAgC,IACOlB,EAAGb,EAAGwC,EAAUzC,EAAIgC,EAAa,EAAGkC,CAAM,CAEpD,EAAEnD,CAAO,EACHiB,CACR,EACDkQ,EAAe,mBAAqB,SAAUnS,EAAMgB,EAAS,CAC3D,IAAIgB,EAAWtB,EAAS,WAAWjB,GAAiBuB,CAAO,EACvDiB,EAAa,EACjB,OAAO,IAAIpC,EAAS,UAAY,CAC9B,OAAa,CACX,IAAIqC,EAAOF,EAAS,KAAM,EAC1B,GAAIE,EAAK,KACP,OAAOA,EAET,IAAIS,EAAQT,EAAK,MACbJ,EAAMa,EAAM,CAAC,EACbzG,EAAQyG,EAAM,CAAC,EACnB,GAAIuP,EAAU,KAAKd,EAASlV,EAAO4F,EAAKpB,CAAQ,EAC9C,OAAOX,EAAcC,EAAM0C,EAAUZ,EAAMG,IAAc/F,EAAOgG,CAAI,EAGhF,CAAO,GAEIiQ,EAIT,SAASC,GAAe1R,EAAU2R,EAASjB,EAAS,CAClD,IAAIkB,EAAS3L,EAAK,EAAC,UAAW,EAC9B,OAAAjG,EAAS,UAAU,SAASR,EAAGD,EAAI,CACjCqS,EAAO,OACLD,EAAQ,KAAKjB,EAASlR,EAAGD,EAAGS,CAAQ,EACpC,EACA,SAAS6C,EAAI,CAAC,OAAOA,EAAI,CAAC,CAC3B,CACP,CAAK,EACM+O,EAAO,YAAa,EAI7B,SAASC,GAAe7R,EAAU2R,EAASjB,EAAS,CAClD,IAAIoB,EAAclW,EAAQoE,CAAQ,EAC9B4R,GAAUjV,GAAUqD,CAAQ,EAAIkH,IAAejB,EAAK,GAAE,UAAW,EACrEjG,EAAS,UAAU,SAASR,EAAGD,EAAI,CACjCqS,EAAO,OACLD,EAAQ,KAAKjB,EAASlR,EAAGD,EAAGS,CAAQ,EACpC,SAAS,EAAI,CAAC,OAAQ,EAAI,GAAK,CAAE,EAAE,EAAE,KAAK8R,EAAc,CAACvS,EAAGC,CAAC,EAAIA,CAAC,EAAG,CAAE,CACxE,CACP,CAAK,EACD,IAAIuS,EAASC,GAAchS,CAAQ,EACnC,OAAO4R,EAAO,IAAI,SAASlU,EAAM,CAAC,OAAOuU,EAAMjS,EAAU+R,EAAOrU,CAAG,CAAC,CAAC,CAAC,EAIxE,SAASwU,GAAalS,EAAU1B,EAAOC,EAAKyD,EAAS,CACnD,IAAImQ,EAAenS,EAAS,KAW5B,GAPI1B,IAAU,SACZA,EAAQA,EAAQ,GAEdC,IAAQ,SACVA,EAAMA,EAAM,GAGVF,GAAWC,EAAOC,EAAK4T,CAAY,EACrC,OAAOnS,EAGT,IAAIoS,EAAgB3T,GAAaH,EAAO6T,CAAY,EAChDE,EAAc1T,GAAWJ,EAAK4T,CAAY,EAK9C,GAAIC,IAAkBA,GAAiBC,IAAgBA,EACrD,OAAOH,GAAalS,EAAS,MAAO,EAAC,YAAW,EAAI1B,EAAOC,EAAKyD,CAAO,EAOzE,IAAIsQ,EAAeD,EAAcD,EAC7BG,EACAD,IAAiBA,IACnBC,EAAYD,EAAe,EAAI,EAAIA,GAGrC,IAAIE,EAAWlB,GAAatR,CAAQ,EAIpC,OAAAwS,EAAS,KAAOD,IAAc,EAAIA,EAAYvS,EAAS,MAAQuS,GAAa,OAExE,CAACvQ,GAAWrB,GAAMX,CAAQ,GAAKuS,GAAa,IAC9CC,EAAS,IAAM,SAAUrU,EAAO4C,EAAa,CAC3C,OAAA5C,EAAQD,GAAU,KAAMC,CAAK,EACtBA,GAAS,GAAKA,EAAQoU,EAC3BvS,EAAS,IAAI7B,EAAQiU,EAAerR,CAAW,EAC/CA,IAINyR,EAAS,kBAAoB,SAASnS,EAAIC,EAAS,CAAC,IAAImD,EAAS,KAC/D,GAAI8O,IAAc,EAChB,MAAO,GAET,GAAIjS,EACF,OAAO,KAAK,YAAW,EAAG,UAAUD,EAAIC,CAAO,EAEjD,IAAImS,EAAU,EACVC,EAAa,GACbnR,EAAa,EACjB,OAAAvB,EAAS,UAAU,SAASR,GAAGD,GAAI,CACjC,GAAI,EAAEmT,IAAeA,EAAaD,IAAYL,IAC5C,OAAA7Q,IACOlB,EAAGb,GAAGwC,EAAUzC,GAAIgC,EAAa,EAAGkC,CAAM,IAAM,IAChDlC,IAAegR,CAEhC,CAAO,EACMhR,CACR,EAEDiR,EAAS,mBAAqB,SAASlT,EAAMgB,EAAS,CACpD,GAAIiS,IAAc,GAAKjS,EACrB,OAAO,KAAK,YAAW,EAAG,WAAWhB,EAAMgB,CAAO,EAGpD,IAAIgB,EAAWiR,IAAc,GAAKvS,EAAS,WAAWV,EAAMgB,CAAO,EAC/DmS,EAAU,EACVlR,EAAa,EACjB,OAAO,IAAIpC,EAAS,UAAY,CAC9B,KAAOsT,IAAYL,GACjB9Q,EAAS,KAAM,EAEjB,GAAI,EAAEC,EAAagR,EACjB,OAAO7S,EAAc,EAEvB,IAAI8B,EAAOF,EAAS,KAAM,EAC1B,OAAIU,GAAW1C,IAASR,EACf0C,EACElC,IAAST,GACXQ,EAAcC,EAAMiC,EAAa,EAAG,OAAWC,CAAI,EAEnDnC,EAAcC,EAAMiC,EAAa,EAAGC,EAAK,MAAM,CAAC,EAAGA,CAAI,CAExE,CAAO,GAGIgR,EAIT,SAASG,GAAiB3S,EAAUwR,EAAWd,EAAS,CACtD,IAAIkC,EAAetB,GAAatR,CAAQ,EACxC,OAAA4S,EAAa,kBAAoB,SAASvS,EAAIC,EAAS,CAAC,IAAImD,EAAS,KACnE,GAAInD,EACF,OAAO,KAAK,YAAW,EAAG,UAAUD,EAAIC,CAAO,EAEjD,IAAIiB,EAAa,EACjB,OAAAvB,EAAS,UAAU,SAASR,EAAGD,EAAGiF,EAChC,CAAC,OAAOgN,EAAU,KAAKd,EAASlR,EAAGD,EAAGiF,CAAC,GAAK,EAAEjD,GAAclB,EAAGb,EAAGD,EAAGkE,CAAM,CAAC,CAC7E,EACMlC,CACR,EACDqR,EAAa,mBAAqB,SAAStT,EAAMgB,EAAS,CAAC,IAAImD,EAAS,KACtE,GAAInD,EACF,OAAO,KAAK,YAAW,EAAG,WAAWhB,EAAMgB,CAAO,EAEpD,IAAIgB,EAAWtB,EAAS,WAAWjB,GAAiBuB,CAAO,EACvDuS,EAAY,GAChB,OAAO,IAAI1T,EAAS,UAAY,CAC9B,GAAI,CAAC0T,EACH,OAAOnT,EAAc,EAEvB,IAAI8B,EAAOF,EAAS,KAAM,EAC1B,GAAIE,EAAK,KACP,OAAOA,EAET,IAAIS,EAAQT,EAAK,MACbjC,EAAI0C,EAAM,CAAC,EACXzC,EAAIyC,EAAM,CAAC,EACf,OAAKuP,EAAU,KAAKd,EAASlR,EAAGD,EAAGkE,CAAM,EAIlCnE,IAASP,GAAkByC,EAChCnC,EAAcC,EAAMC,EAAGC,EAAGgC,CAAI,GAJ9BqR,EAAY,GACLnT,EAAc,EAI/B,CAAO,CACF,EACMkT,EAIT,SAASE,GAAiB9S,EAAUwR,EAAWd,EAAS1O,EAAS,CAC/D,IAAI+Q,EAAezB,GAAatR,CAAQ,EACxC,OAAA+S,EAAa,kBAAoB,SAAU1S,EAAIC,EAAS,CAAC,IAAImD,EAAS,KACpE,GAAInD,EACF,OAAO,KAAK,YAAW,EAAG,UAAUD,EAAIC,CAAO,EAEjD,IAAIoS,EAAa,GACbnR,EAAa,EACjB,OAAAvB,EAAS,UAAU,SAASR,EAAGD,EAAGiF,EAAI,CACpC,GAAI,EAAEkO,IAAeA,EAAalB,EAAU,KAAKd,EAASlR,EAAGD,EAAGiF,CAAC,IAC/D,OAAAjD,IACOlB,EAAGb,EAAGwC,EAAUzC,EAAIgC,EAAa,EAAGkC,CAAM,CAE3D,CAAO,EACMlC,CACR,EACDwR,EAAa,mBAAqB,SAASzT,EAAMgB,EAAS,CAAC,IAAImD,EAAS,KACtE,GAAInD,EACF,OAAO,KAAK,YAAW,EAAG,WAAWhB,EAAMgB,CAAO,EAEpD,IAAIgB,EAAWtB,EAAS,WAAWjB,GAAiBuB,CAAO,EACvD0S,EAAW,GACXzR,EAAa,EACjB,OAAO,IAAIpC,EAAS,UAAY,CAC9B,IAAIqC,EAAMjC,EAAGC,EACb,EAAG,CAED,GADAgC,EAAOF,EAAS,KAAM,EAClBE,EAAK,KACP,OAAIQ,GAAW1C,IAASR,EACf0C,EACElC,IAAST,GACXQ,EAAcC,EAAMiC,IAAc,OAAWC,CAAI,EAEjDnC,EAAcC,EAAMiC,IAAcC,EAAK,MAAM,CAAC,EAAGA,CAAI,EAGhE,IAAIS,EAAQT,EAAK,MACjBjC,EAAI0C,EAAM,CAAC,EACXzC,EAAIyC,EAAM,CAAC,EACX+Q,IAAaA,EAAWxB,EAAU,KAAKd,EAASlR,EAAGD,EAAGkE,CAAM,SACrDuP,GACT,OAAO1T,IAASP,GAAkByC,EAChCnC,EAAcC,EAAMC,EAAGC,EAAGgC,CAAI,CACxC,CAAO,CACF,EACMuR,EAIT,SAASE,GAAcjT,EAAU4M,EAAQ,CACvC,IAAIsG,EAAkBtX,EAAQoE,CAAQ,EAClC6G,EAAQ,CAAC7G,CAAQ,EAAE,OAAO4M,CAAM,EAAE,IAAI,SAASpN,EAAI,CACrD,OAAK/D,EAAW+D,CAAC,EAIN0T,IACT1T,EAAI7D,EAAc6D,CAAC,GAJnBA,EAAI0T,EACFzS,GAAkBjB,CAAC,EACnBkB,GAAoB,MAAM,QAAQlB,CAAC,EAAIA,EAAI,CAACA,CAAC,CAAC,EAI3CA,CACb,CAAK,EAAE,OAAO,SAASA,EAAI,CAAC,OAAOA,EAAE,OAAS,CAAC,CAAC,EAE5C,GAAIqH,EAAM,SAAW,EACnB,OAAO7G,EAGT,GAAI6G,EAAM,SAAW,EAAG,CACtB,IAAIsM,EAAYtM,EAAM,CAAC,EACvB,GAAIsM,IAAcnT,GACdkT,GAAmBtX,EAAQuX,CAAS,GACpCpX,EAAUiE,CAAQ,GAAKjE,EAAUoX,CAAS,EAC5C,OAAOA,EAIX,IAAIC,EAAY,IAAIvS,GAASgG,CAAK,EAClC,OAAIqM,EACFE,EAAYA,EAAU,WAAY,EACxBrX,EAAUiE,CAAQ,IAC5BoT,EAAYA,EAAU,SAAU,GAElCA,EAAYA,EAAU,QAAQ,EAAI,EAClCA,EAAU,KAAOvM,EAAM,OACrB,SAASwM,EAAKvR,EAAM,CAClB,GAAIuR,IAAQ,OAAW,CACrB,IAAI7U,EAAOsD,EAAI,KACf,GAAItD,IAAS,OACX,OAAO6U,EAAM7U,EAGlB,EACD,CACD,EACM4U,EAIT,SAASE,GAAetT,EAAUuT,EAAOvR,EAAS,CAChD,IAAIwR,EAAelC,GAAatR,CAAQ,EACxC,OAAAwT,EAAa,kBAAoB,SAASnT,EAAIC,EAAS,CACrD,IAAIiB,EAAa,EACbkS,EAAU,GACd,SAASC,EAAS1V,EAAM2V,EAAc,CAAC,IAAIlQ,EAAS,KAClDzF,EAAK,UAAU,SAASwB,EAAGD,EAAI,CAC7B,OAAK,CAACgU,GAASI,EAAeJ,IAAU9X,EAAW+D,CAAC,EAClDkU,EAASlU,EAAGmU,EAAe,CAAC,EACnBtT,EAAGb,EAAGwC,EAAUzC,EAAIgC,IAAckC,CAAM,IAAM,KACvDgQ,EAAU,IAEL,CAACA,CACT,EAAEnT,CAAO,EAEZ,OAAAoT,EAAS1T,EAAU,CAAC,EACbuB,GAETiS,EAAa,mBAAqB,SAASlU,EAAMgB,EAAS,CACxD,IAAIgB,EAAWtB,EAAS,WAAWV,EAAMgB,CAAO,EAC5C4J,EAAQ,CAAE,EACV3I,EAAa,EACjB,OAAO,IAAIpC,EAAS,UAAY,CAC9B,KAAOmC,GAAU,CACf,IAAIE,EAAOF,EAAS,KAAM,EAC1B,GAAIE,EAAK,OAAS,GAAO,CACvBF,EAAW4I,EAAM,IAAK,EACtB,SAEF,IAAI1K,EAAIgC,EAAK,MAIb,GAHIlC,IAASP,KACXS,EAAIA,EAAE,CAAC,IAEJ,CAAC+T,GAASrJ,EAAM,OAASqJ,IAAU9X,EAAW+D,CAAC,EAClD0K,EAAM,KAAK5I,CAAQ,EACnBA,EAAW9B,EAAE,WAAWF,EAAMgB,CAAO,MAErC,QAAO0B,EAAUR,EAAOnC,EAAcC,EAAMiC,IAAc/B,EAAGgC,CAAI,EAGrE,OAAO9B,EAAc,CAC7B,CAAO,GAEI8T,EAIT,SAASI,GAAe5T,EAAUoH,EAAQsJ,EAAS,CACjD,IAAIqB,EAASC,GAAchS,CAAQ,EACnC,OAAOA,EAAS,MAAK,EAAG,IACtB,SAASR,EAAGD,EAAI,CAAC,OAAOwS,EAAO3K,EAAO,KAAKsJ,EAASlR,EAAGD,EAAGS,CAAQ,CAAC,CAAC,CAC1E,EAAM,QAAQ,EAAI,EAIhB,SAAS6T,GAAiB7T,EAAU8T,EAAW,CAC7C,IAAIC,EAAqBzC,GAAatR,CAAQ,EAC9C,OAAA+T,EAAmB,KAAO/T,EAAS,MAAQA,EAAS,KAAO,EAAG,EAC9D+T,EAAmB,kBAAoB,SAAS1T,EAAIC,EAAS,CAAC,IAAImD,EAAS,KACrElC,EAAa,EACjB,OAAAvB,EAAS,UAAU,SAASR,EAAGD,EAC7B,CAAC,OAAQ,CAACgC,GAAclB,EAAGyT,EAAWvS,IAAckC,CAAM,IAAM,KAChEpD,EAAGb,EAAG+B,IAAckC,CAAM,IAAM,EAAK,EACrCnD,CACD,EACMiB,CACR,EACDwS,EAAmB,mBAAqB,SAASzU,EAAMgB,EAAS,CAC9D,IAAIgB,EAAWtB,EAAS,WAAWlB,EAAgBwB,CAAO,EACtDiB,EAAa,EACbC,EACJ,OAAO,IAAIrC,EAAS,UAAY,CAC9B,OAAI,CAACqC,GAAQD,EAAa,KACxBC,EAAOF,EAAS,KAAM,EAClBE,EAAK,MACAA,EAGJD,EAAa,EAClBlC,EAAcC,EAAMiC,IAAcuS,CAAS,EAC3CzU,EAAcC,EAAMiC,IAAcC,EAAK,MAAOA,CAAI,CAC5D,CAAO,CACF,EACMuS,EAIT,SAAS5M,GAAYnH,EAAUiH,EAAYG,EAAQ,CAC5CH,IACHA,EAAa+M,IAEf,IAAId,EAAkBtX,EAAQoE,CAAQ,EAClC7B,EAAQ,EACR6E,EAAUhD,EAAS,MAAK,EAAG,IAC7B,SAASR,EAAGD,EAAI,CAAC,MAAO,CAACA,EAAGC,EAAGrB,IAASiJ,EAASA,EAAO5H,EAAGD,EAAGS,CAAQ,EAAIR,CAAC,CAAC,CAC7E,EAAC,QAAS,EACX,OAAAwD,EAAQ,KAAK,SAASH,EAAGC,EAAI,CAAC,OAAOmE,EAAWpE,EAAE,CAAC,EAAGC,EAAE,CAAC,CAAC,GAAKD,EAAE,CAAC,EAAIC,EAAE,CAAC,CAAC,CAAC,EAAE,QAC3EoQ,EACA,SAAS1T,EAAGiN,EAAI,CAAEzJ,EAAQyJ,CAAC,EAAE,OAAS,CAAI,EAC1C,SAASjN,EAAGiN,EAAI,CAAEzJ,EAAQyJ,CAAC,EAAIjN,EAAE,CAAC,CAAE,CACrC,EACM0T,EAAkBrX,EAASmH,CAAO,EACvCjH,EAAUiE,CAAQ,EAAIhE,EAAWgH,CAAO,EACxC7G,GAAO6G,CAAO,EAIlB,SAASiR,GAAWjU,EAAUiH,EAAYG,EAAQ,CAIhD,GAHKH,IACHA,EAAa+M,IAEX5M,EAAQ,CACV,IAAInF,EAAQjC,EAAS,MAAK,EACvB,IAAI,SAASR,EAAGD,EAAI,CAAC,MAAO,CAACC,EAAG4H,EAAO5H,EAAGD,EAAGS,CAAQ,CAAC,CAAC,CAAC,EACxD,OAAO,SAAS6C,EAAGC,EAAI,CAAC,OAAOoR,GAAWjN,EAAYpE,EAAE,CAAC,EAAGC,EAAE,CAAC,CAAC,EAAIA,EAAID,CAAC,CAAC,EAC7E,OAAOZ,GAASA,EAAM,CAAC,CAC7B,KACM,QAAOjC,EAAS,OAAO,SAAS6C,EAAGC,EAAI,CAAC,OAAOoR,GAAWjN,EAAYpE,EAAGC,CAAC,EAAIA,EAAID,CAAC,CAAC,EAIxF,SAASqR,GAAWjN,EAAYpE,EAAGC,EAAG,CACpC,IAAIqR,EAAOlN,EAAWnE,EAAGD,CAAC,EAG1B,OAAQsR,IAAS,GAAKrR,IAAMD,IAAyBC,GAAM,MAAQA,IAAMA,IAAOqR,EAAO,EAIzF,SAASC,GAAeC,EAASC,EAAQzN,EAAO,CAC9C,IAAI0N,EAAcjD,GAAa+C,CAAO,EACtC,OAAAE,EAAY,KAAO,IAAI1T,GAASgG,CAAK,EAAE,IAAI,SAAS,EAAI,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,IAAK,EAG9E0N,EAAY,UAAY,SAASlU,EAAIC,EAAS,CAiB5C,QAHIgB,EAAW,KAAK,WAAWxC,EAAgBwB,CAAO,EAClDkB,EACAD,EAAa,EACV,EAAEC,EAAOF,EAAS,KAAI,GAAI,MAC3BjB,EAAGmB,EAAK,MAAOD,IAAc,IAAI,IAAM,IAA3C,CAIF,OAAOA,CACR,EACDgT,EAAY,mBAAqB,SAASjV,EAAMgB,EAAS,CACvD,IAAIkU,EAAY3N,EAAM,IAAI,SAAS4F,EACjC,CAAC,OAAQA,EAAIlR,EAASkR,CAAC,EAAG1M,GAAYO,EAAUmM,EAAE,UAAYA,CAAC,CAAE,CAClE,EACGlL,EAAa,EACbkT,EAAS,GACb,OAAO,IAAItV,EAAS,UAAY,CAC9B,IAAIuV,EAKJ,OAJKD,IACHC,EAAQF,EAAU,IAAI,SAAS/H,EAAI,CAAC,OAAOA,EAAE,KAAI,CAAE,CAAC,EACpDgI,EAASC,EAAM,KAAK,SAASC,EAAI,CAAC,OAAOA,EAAE,IAAI,CAAC,GAE9CF,EACK/U,EAAc,EAEhBL,EACLC,EACAiC,IACA+S,EAAO,MAAM,KAAMI,EAAM,IAAI,SAASC,EAAI,CAAC,OAAOA,EAAE,KAAK,CAAC,CAAC,CAC5D,CACT,CAAO,CACF,EACMJ,EAMT,SAAStC,EAAMjU,EAAM8D,EAAK,CACxB,OAAOnB,GAAM3C,CAAI,EAAI8D,EAAM9D,EAAK,YAAY8D,CAAG,EAGjD,SAASmP,GAAchP,EAAO,CAC5B,GAAIA,IAAU,OAAOA,CAAK,EACxB,MAAM,IAAI,UAAU,0BAA4BA,CAAK,EAIzD,SAAS4O,GAAY7S,EAAM,CACzB,OAAAgI,EAAkBhI,EAAK,IAAI,EACpBD,GAAWC,CAAI,EAGxB,SAASgU,GAAchS,EAAU,CAC/B,OAAOpE,EAAQoE,CAAQ,EAAIrE,EACzBI,EAAUiE,CAAQ,EAAIlE,GACtBG,EAGJ,SAASqV,GAAatR,EAAU,CAC9B,OAAO,OAAO,QAEVpE,EAAQoE,CAAQ,EAAInE,EACpBE,EAAUiE,CAAQ,EAAIhE,EACtBG,IACA,SACH,EAGH,SAASgV,IAAqB,CAC5B,OAAI,KAAK,MAAM,aACb,KAAK,MAAM,YAAa,EACxB,KAAK,KAAO,KAAK,MAAM,KAChB,MAEAzV,EAAI,UAAU,YAAY,KAAK,IAAI,EAI9C,SAASsY,GAAkBnR,EAAGC,EAAG,CAC/B,OAAOD,EAAIC,EAAI,EAAID,EAAIC,EAAI,GAAK,EAGlC,SAAS4D,GAAcJ,EAAS,CAC9B,IAAItI,EAAO+B,GAAYuG,CAAO,EAC9B,GAAI,CAACtI,EAAM,CAGT,GAAI,CAACkC,GAAYoG,CAAO,EACtB,MAAM,IAAI,UAAU,oCAAsCA,CAAO,EAEnEtI,EAAO+B,GAAYxE,EAAS+K,CAAO,CAAC,EAEtC,OAAOtI,EAGT5C,EAAYwZ,EAAQxQ,EAAe,EAEjC,SAASwQ,EAAOC,EAAeC,EAAM,CACnC,IAAIC,EAEAC,EAAa,SAAgBpI,EAAQ,CACvC,GAAIA,aAAkBoI,EACpB,OAAOpI,EAET,GAAI,EAAE,gBAAgBoI,GACpB,OAAO,IAAIA,EAAWpI,CAAM,EAE9B,GAAI,CAACmI,EAAgB,CACnBA,EAAiB,GACjB,IAAI5T,EAAO,OAAO,KAAK0T,CAAa,EACpCI,GAASC,EAAqB/T,CAAI,EAClC+T,EAAoB,KAAO/T,EAAK,OAChC+T,EAAoB,MAAQJ,EAC5BI,EAAoB,MAAQ/T,EAC5B+T,EAAoB,eAAiBL,EAEvC,KAAK,KAAO5O,EAAI2G,CAAM,CACvB,EAEGsI,EAAsBF,EAAW,UAAY,OAAO,OAAOG,CAAe,EAC9E,OAAAD,EAAoB,YAAcF,EAE3BA,EAGTJ,EAAO,UAAU,SAAW,UAAW,CACrC,OAAO,KAAK,WAAWQ,GAAW,IAAI,EAAI,KAAM,GAAG,CACpD,EAIDR,EAAO,UAAU,IAAM,SAASrV,EAAG,CACjC,OAAO,KAAK,eAAe,eAAeA,CAAC,CAC5C,EAEDqV,EAAO,UAAU,IAAM,SAASrV,EAAGwB,EAAa,CAC9C,GAAI,CAAC,KAAK,IAAIxB,CAAC,EACb,OAAOwB,EAET,IAAIsU,EAAa,KAAK,eAAe9V,CAAC,EACtC,OAAO,KAAK,KAAO,KAAK,KAAK,IAAIA,EAAG8V,CAAU,EAAIA,CACnD,EAIDT,EAAO,UAAU,MAAQ,UAAW,CAClC,GAAI,KAAK,UACP,YAAK,MAAQ,KAAK,KAAK,MAAO,EACvB,KAET,IAAII,EAAa,KAAK,YACtB,OAAOA,EAAW,SAAWA,EAAW,OAASM,GAAW,KAAMpP,GAAQ,CAAE,EAC7E,EAED0O,EAAO,UAAU,IAAM,SAASrV,EAAGC,EAAG,CACpC,GAAI,CAAC,KAAK,IAAID,CAAC,EACb,MAAM,IAAI,MAAM,2BAA6BA,EAAI,QAAU6V,GAAW,IAAI,CAAC,EAE7E,IAAIrF,EAAS,KAAK,MAAQ,KAAK,KAAK,IAAIxQ,EAAGC,CAAC,EAC5C,OAAI,KAAK,WAAauQ,IAAW,KAAK,KAC7B,KAEFuF,GAAW,KAAMvF,CAAM,CAC/B,EAED6E,EAAO,UAAU,OAAS,SAASrV,EAAG,CACpC,GAAI,CAAC,KAAK,IAAIA,CAAC,EACb,OAAO,KAET,IAAIwQ,EAAS,KAAK,MAAQ,KAAK,KAAK,OAAOxQ,CAAC,EAC5C,OAAI,KAAK,WAAawQ,IAAW,KAAK,KAC7B,KAEFuF,GAAW,KAAMvF,CAAM,CAC/B,EAED6E,EAAO,UAAU,WAAa,UAAW,CACvC,OAAO,KAAK,KAAK,WAAY,CAC9B,EAEDA,EAAO,UAAU,WAAa,SAAStV,EAAMgB,EAAS,CAAC,IAAImD,EAAS,KAClE,OAAO9H,EAAc,KAAK,cAAc,EAAE,IAAI,SAASuH,EAAG3D,EAAI,CAAC,OAAOkE,EAAO,IAAIlE,CAAC,CAAC,CAAC,EAAE,WAAWD,EAAMgB,CAAO,CAC/G,EAEDsU,EAAO,UAAU,UAAY,SAASvU,EAAIC,EAAS,CAAC,IAAImD,EAAS,KAC/D,OAAO9H,EAAc,KAAK,cAAc,EAAE,IAAI,SAASuH,EAAG3D,EAAI,CAAC,OAAOkE,EAAO,IAAIlE,CAAC,CAAC,CAAC,EAAE,UAAUc,EAAIC,CAAO,CAC5G,EAEDsU,EAAO,UAAU,cAAgB,SAASrN,EAAS,CACjD,GAAIA,IAAY,KAAK,UACnB,OAAO,KAET,IAAIwI,EAAS,KAAK,MAAQ,KAAK,KAAK,cAAcxI,CAAO,EACzD,OAAKA,EAKE+N,GAAW,KAAMvF,EAAQxI,CAAO,GAJrC,KAAK,UAAYA,EACjB,KAAK,KAAOwI,EACL,KAGV,EAGH,IAAIoF,EAAkBP,EAAO,UAC7BO,EAAgBrY,EAAM,EAAIqY,EAAgB,OAC1CA,EAAgB,SAChBA,EAAgB,SAAWxN,EAAa,SACxCwN,EAAgB,MAAQxN,EAAa,MACrCwN,EAAgB,UAAYxN,EAAa,UACzCwN,EAAgB,QAAUxN,EAAa,QACvCwN,EAAgB,UAAYxN,EAAa,UACzCwN,EAAgB,cAAgBxN,EAAa,cAC7CwN,EAAgB,YAAcxN,EAAa,YAC3CwN,EAAgB,MAAQxN,EAAa,MACrCwN,EAAgB,OAASxN,EAAa,OACtCwN,EAAgB,SAAWxN,EAAa,SACxCwN,EAAgB,cAAgBxN,EAAa,cAC7CwN,EAAgB,UAAYxN,EAAa,UACzCwN,EAAgB,YAAcxN,EAAa,YAG3C,SAAS2N,GAAWC,EAAYnP,EAAKmB,EAAS,CAC5C,IAAIiO,EAAS,OAAO,OAAO,OAAO,eAAeD,CAAU,CAAC,EAC5D,OAAAC,EAAO,KAAOpP,EACdoP,EAAO,UAAYjO,EACZiO,EAGT,SAASJ,GAAWI,EAAQ,CAC1B,OAAOA,EAAO,OAASA,EAAO,YAAY,MAAQ,SAGpD,SAASP,GAASQ,EAAWC,EAAO,CAClC,GAAI,CACFA,EAAM,QAAQC,GAAQ,KAAK,OAAWF,CAAS,CAAC,CACjD,MAAe,GAKlB,SAASE,GAAQF,EAAWX,EAAM,CAChC,OAAO,eAAeW,EAAWX,EAAM,CACrC,IAAK,UAAW,CACd,OAAO,KAAK,IAAIA,CAAI,CACrB,EACD,IAAK,SAAStZ,EAAO,CACnBmI,GAAU,KAAK,UAAW,oCAAoC,EAC9D,KAAK,IAAImR,EAAMtZ,CAAK,EAE5B,CAAK,EAGHJ,EAAYwa,EAAKtR,EAAa,EAI5B,SAASsR,EAAIpa,EAAO,CAClB,OAAOA,GAAU,KAA8Bqa,GAAU,EACvDC,GAAMta,CAAK,GAAK,CAACmB,GAAUnB,CAAK,EAAIA,EACpCqa,GAAU,EAAC,cAAc,SAASE,EAAM,CACtC,IAAI/X,EAAO/B,EAAYT,CAAK,EAC5BwK,EAAkBhI,EAAK,IAAI,EAC3BA,EAAK,QAAQ,SAASwB,EAAI,CAAC,OAAOuW,EAAI,IAAIvW,CAAC,CAAC,CAAC,CACvD,CAAS,EAGLoW,EAAI,GAAK,UAAwB,CAC/B,OAAO,KAAK,SAAS,CACtB,EAEDA,EAAI,SAAW,SAASpa,EAAO,CAC7B,OAAO,KAAKG,EAAcH,CAAK,EAAE,OAAM,CAAE,CAC1C,EAEDoa,EAAI,UAAU,SAAW,UAAW,CAClC,OAAO,KAAK,WAAW,QAAS,GAAG,CACpC,EAIDA,EAAI,UAAU,IAAM,SAASpa,EAAO,CAClC,OAAO,KAAK,KAAK,IAAIA,CAAK,CAC3B,EAIDoa,EAAI,UAAU,IAAM,SAASpa,EAAO,CAClC,OAAOwa,GAAU,KAAM,KAAK,KAAK,IAAIxa,EAAO,EAAI,CAAC,CAClD,EAEDoa,EAAI,UAAU,OAAS,SAASpa,EAAO,CACrC,OAAOwa,GAAU,KAAM,KAAK,KAAK,OAAOxa,CAAK,CAAC,CAC/C,EAEDoa,EAAI,UAAU,MAAQ,UAAW,CAC/B,OAAOI,GAAU,KAAM,KAAK,KAAK,MAAK,CAAE,CACzC,EAIDJ,EAAI,UAAU,MAAQ,UAAW,CAAC,IAAI/O,EAAQ1L,EAAQ,KAAK,UAAW,CAAC,EAErE,OADA0L,EAAQA,EAAM,OAAO,SAASyE,EAAI,CAAC,OAAOA,EAAE,OAAS,CAAC,CAAC,EACnDzE,EAAM,SAAW,EACZ,KAEL,KAAK,OAAS,GAAK,CAAC,KAAK,WAAaA,EAAM,SAAW,EAClD,KAAK,YAAYA,EAAM,CAAC,CAAC,EAE3B,KAAK,cAAc,SAASkP,EAAM,CACvC,QAASjY,EAAK,EAAGA,EAAK+I,EAAM,OAAQ/I,IAClC7B,EAAY4K,EAAM/I,CAAE,CAAC,EAAE,QAAQ,SAAStC,EAAQ,CAAC,OAAOua,EAAI,IAAIva,CAAK,CAAC,CAAC,CAEjF,CAAO,CACF,EAEDoa,EAAI,UAAU,UAAY,UAAW,CAAC,IAAI/O,EAAQ1L,EAAQ,KAAK,UAAW,CAAC,EACzE,GAAI0L,EAAM,SAAW,EACnB,OAAO,KAETA,EAAQA,EAAM,IAAI,SAAS7I,EAAO,CAAC,OAAO/B,EAAY+B,CAAI,CAAC,CAAC,EAC5D,IAAIiY,EAAc,KAClB,OAAO,KAAK,cAAc,SAASF,EAAM,CACvCE,EAAY,QAAQ,SAASza,EAAQ,CAC9BqL,EAAM,MAAM,SAAS7I,EAAO,CAAC,OAAOA,EAAK,SAASxC,CAAK,CAAC,CAAC,GAC5Dua,EAAI,OAAOva,CAAK,CAE5B,CAAS,CACT,CAAO,CACF,EAEDoa,EAAI,UAAU,SAAW,UAAW,CAAC,IAAI/O,EAAQ1L,EAAQ,KAAK,UAAW,CAAC,EACxE,GAAI0L,EAAM,SAAW,EACnB,OAAO,KAETA,EAAQA,EAAM,IAAI,SAAS7I,EAAO,CAAC,OAAO/B,EAAY+B,CAAI,CAAC,CAAC,EAC5D,IAAIiY,EAAc,KAClB,OAAO,KAAK,cAAc,SAASF,EAAM,CACvCE,EAAY,QAAQ,SAASza,EAAQ,CAC/BqL,EAAM,KAAK,SAAS7I,EAAO,CAAC,OAAOA,EAAK,SAASxC,CAAK,CAAC,CAAC,GAC1Dua,EAAI,OAAOva,CAAK,CAE5B,CAAS,CACT,CAAO,CACF,EAEDoa,EAAI,UAAU,MAAQ,UAAW,CAC/B,OAAO,KAAK,MAAM,MAAM,KAAM,SAAS,CACxC,EAEDA,EAAI,UAAU,UAAY,SAAShP,EAAQ,CAAC,IAAIC,EAAQ1L,EAAQ,KAAK,UAAW,CAAC,EAC/E,OAAO,KAAK,MAAM,MAAM,KAAM0L,CAAK,CACpC,EAED+O,EAAI,UAAU,KAAO,SAAS3O,EAAY,CAExC,OAAOiP,GAAW/O,GAAY,KAAMF,CAAU,CAAC,CAChD,EAED2O,EAAI,UAAU,OAAS,SAASxO,EAAQH,EAAY,CAElD,OAAOiP,GAAW/O,GAAY,KAAMF,EAAYG,CAAM,CAAC,CACxD,EAEDwO,EAAI,UAAU,WAAa,UAAW,CACpC,OAAO,KAAK,KAAK,WAAY,CAC9B,EAEDA,EAAI,UAAU,UAAY,SAASvV,EAAIC,EAAS,CAAC,IAAImD,EAAS,KAC5D,OAAO,KAAK,KAAK,UAAU,SAASP,EAAG3D,EAAI,CAAC,OAAOc,EAAGd,EAAGA,EAAGkE,CAAM,CAAC,EAAGnD,CAAO,CAC9E,EAEDsV,EAAI,UAAU,WAAa,SAAStW,EAAMgB,EAAS,CACjD,OAAO,KAAK,KAAK,IAAI,SAAS4C,EAAG3D,EAAI,CAAC,OAAOA,CAAC,CAAC,EAAE,WAAWD,EAAMgB,CAAO,CAC1E,EAEDsV,EAAI,UAAU,cAAgB,SAASrO,EAAS,CAC9C,GAAIA,IAAY,KAAK,UACnB,OAAO,KAET,IAAIwI,EAAS,KAAK,KAAK,cAAcxI,CAAO,EAC5C,OAAKA,EAKE,KAAK,OAAOwI,EAAQxI,CAAO,GAJhC,KAAK,UAAYA,EACjB,KAAK,KAAOwI,EACL,KAGV,EAGH,SAAS+F,GAAMK,EAAU,CACvB,MAAO,CAAC,EAAEA,GAAYA,EAASC,EAAe,GAGhDR,EAAI,MAAQE,GAEZ,IAAIM,GAAkB,wBAElBC,EAAeT,EAAI,UACvBS,EAAaD,EAAe,EAAI,GAChCC,EAAavZ,EAAM,EAAIuZ,EAAa,OACpCA,EAAa,UAAYA,EAAa,MACtCA,EAAa,cAAgBA,EAAa,UAC1CA,EAAa,cAAgB1O,EAAa,cAC1C0O,EAAa,UAAY1O,EAAa,UACtC0O,EAAa,YAAc1O,EAAa,YAExC0O,EAAa,QAAUR,GACvBQ,EAAa,OAASC,GAEtB,SAASN,GAAUD,EAAKhG,EAAQ,CAC9B,OAAIgG,EAAI,WACNA,EAAI,KAAOhG,EAAO,KAClBgG,EAAI,KAAOhG,EACJgG,GAEFhG,IAAWgG,EAAI,KAAOA,EAC3BhG,EAAO,OAAS,EAAIgG,EAAI,QAAS,EACjCA,EAAI,OAAOhG,CAAM,EAGrB,SAASuG,GAAQlQ,EAAKmB,EAAS,CAC7B,IAAIwO,EAAM,OAAO,OAAOM,CAAY,EACpC,OAAAN,EAAI,KAAO3P,EAAMA,EAAI,KAAO,EAC5B2P,EAAI,KAAO3P,EACX2P,EAAI,UAAYxO,EACTwO,EAGT,IAAIQ,GACJ,SAASV,IAAW,CAClB,OAAOU,KAAcA,GAAYD,GAAQpQ,GAAU,CAAA,GAGrD9K,EAAY8a,GAAYN,CAAG,EAIzB,SAASM,GAAW1a,EAAO,CACzB,OAAOA,GAAU,KAA8Bgb,GAAiB,EAC9DC,GAAajb,CAAK,EAAIA,EACtBgb,GAAiB,EAAC,cAAc,SAAST,EAAM,CAC7C,IAAI/X,EAAO/B,EAAYT,CAAK,EAC5BwK,EAAkBhI,EAAK,IAAI,EAC3BA,EAAK,QAAQ,SAASwB,EAAI,CAAC,OAAOuW,EAAI,IAAIvW,CAAC,CAAC,CAAC,CACvD,CAAS,EAGL0W,GAAW,GAAK,UAAwB,CACtC,OAAO,KAAK,SAAS,CACtB,EAEDA,GAAW,SAAW,SAAS1a,EAAO,CACpC,OAAO,KAAKG,EAAcH,CAAK,EAAE,OAAM,CAAE,CAC1C,EAED0a,GAAW,UAAU,SAAW,UAAW,CACzC,OAAO,KAAK,WAAW,eAAgB,GAAG,CAC3C,EAGH,SAASO,GAAaC,EAAiB,CACrC,OAAOZ,GAAMY,CAAe,GAAK/Z,GAAU+Z,CAAe,EAG5DR,GAAW,aAAeO,GAE1B,IAAIE,GAAsBT,GAAW,UACrCS,GAAoB9Z,EAAmB,EAAI,GAE3C8Z,GAAoB,QAAUH,GAC9BG,GAAoB,OAASC,GAE7B,SAASA,GAAexQ,EAAKmB,EAAS,CACpC,IAAIwO,EAAM,OAAO,OAAOY,EAAmB,EAC3C,OAAAZ,EAAI,KAAO3P,EAAMA,EAAI,KAAO,EAC5B2P,EAAI,KAAO3P,EACX2P,EAAI,UAAYxO,EACTwO,EAGT,IAAIc,GACJ,SAASL,IAAkB,CACzB,OAAOK,KAAsBA,GAAoBD,GAAehH,GAAiB,CAAA,GAGnFxU,EAAY0b,EAAOzS,EAAiB,EAIlC,SAASyS,EAAMtb,EAAO,CACpB,OAAOA,GAAU,KAA8Bub,GAAY,EACzDC,GAAQxb,CAAK,EAAIA,EACjBub,GAAY,EAAC,WAAWvb,CAAK,EAGjCsb,EAAM,GAAK,UAAwB,CACjC,OAAO,KAAK,SAAS,CACtB,EAEDA,EAAM,UAAU,SAAW,UAAW,CACpC,OAAO,KAAK,WAAW,UAAW,GAAG,CACtC,EAIDA,EAAM,UAAU,IAAM,SAAS3Y,EAAO4C,EAAa,CACjD,IAAIkW,EAAO,KAAK,MAEhB,IADA9Y,EAAQD,GAAU,KAAMC,CAAK,EACtB8Y,GAAQ9Y,KACb8Y,EAAOA,EAAK,KAEd,OAAOA,EAAOA,EAAK,MAAQlW,CAC5B,EAED+V,EAAM,UAAU,KAAO,UAAW,CAChC,OAAO,KAAK,OAAS,KAAK,MAAM,KACjC,EAIDA,EAAM,UAAU,KAAO,UAAwB,CAC7C,GAAI,UAAU,SAAW,EACvB,OAAO,KAIT,QAFIrM,EAAU,KAAK,KAAO,UAAU,OAChCwM,EAAO,KAAK,MACPnZ,EAAK,UAAU,OAAS,EAAGA,GAAM,EAAGA,IAC3CmZ,EAAO,CACL,MAAO,UAAUnZ,CAAE,EACnB,KAAMmZ,CACP,EAEH,OAAI,KAAK,WACP,KAAK,KAAOxM,EACZ,KAAK,MAAQwM,EACb,KAAK,OAAS,OACd,KAAK,UAAY,GACV,MAEFC,GAAUzM,EAASwM,CAAI,CAC/B,EAEDH,EAAM,UAAU,QAAU,SAAS9Y,EAAM,CAEvC,GADAA,EAAOlC,GAAgBkC,CAAI,EACvBA,EAAK,OAAS,EAChB,OAAO,KAETgI,EAAkBhI,EAAK,IAAI,EAC3B,IAAIyM,EAAU,KAAK,KACfwM,EAAO,KAAK,MAQhB,OAPAjZ,EAAK,QAAO,EAAG,QAAQ,SAASxC,EAAQ,CACtCiP,IACAwM,EAAO,CACL,MAAOzb,EACP,KAAMyb,CACP,CACT,CAAO,EACG,KAAK,WACP,KAAK,KAAOxM,EACZ,KAAK,MAAQwM,EACb,KAAK,OAAS,OACd,KAAK,UAAY,GACV,MAEFC,GAAUzM,EAASwM,CAAI,CAC/B,EAEDH,EAAM,UAAU,IAAM,UAAW,CAC/B,OAAO,KAAK,MAAM,CAAC,CACpB,EAEDA,EAAM,UAAU,QAAU,UAAwB,CAChD,OAAO,KAAK,KAAK,MAAM,KAAM,SAAS,CACvC,EAEDA,EAAM,UAAU,WAAa,SAAS9Y,EAAM,CAC1C,OAAO,KAAK,QAAQA,CAAI,CACzB,EAED8Y,EAAM,UAAU,MAAQ,UAAW,CACjC,OAAO,KAAK,IAAI,MAAM,KAAM,SAAS,CACtC,EAEDA,EAAM,UAAU,MAAQ,UAAW,CACjC,OAAI,KAAK,OAAS,EACT,KAEL,KAAK,WACP,KAAK,KAAO,EACZ,KAAK,MAAQ,OACb,KAAK,OAAS,OACd,KAAK,UAAY,GACV,MAEFC,GAAY,CACpB,EAEDD,EAAM,UAAU,MAAQ,SAASxY,EAAOC,EAAK,CAC3C,GAAIF,GAAWC,EAAOC,EAAK,KAAK,IAAI,EAClC,OAAO,KAET,IAAI6T,EAAgB3T,GAAaH,EAAO,KAAK,IAAI,EAC7C+T,EAAc1T,GAAWJ,EAAK,KAAK,IAAI,EAC3C,GAAI8T,IAAgB,KAAK,KAEvB,OAAOhO,GAAkB,UAAU,MAAM,KAAK,KAAM/F,EAAOC,CAAG,EAIhE,QAFIkM,EAAU,KAAK,KAAO2H,EACtB6E,EAAO,KAAK,MACT7E,KACL6E,EAAOA,EAAK,KAEd,OAAI,KAAK,WACP,KAAK,KAAOxM,EACZ,KAAK,MAAQwM,EACb,KAAK,OAAS,OACd,KAAK,UAAY,GACV,MAEFC,GAAUzM,EAASwM,CAAI,CAC/B,EAIDH,EAAM,UAAU,cAAgB,SAASvP,EAAS,CAChD,OAAIA,IAAY,KAAK,UACZ,KAEJA,EAKE2P,GAAU,KAAK,KAAM,KAAK,MAAO3P,EAAS,KAAK,MAAM,GAJ1D,KAAK,UAAYA,EACjB,KAAK,UAAY,GACV,KAGV,EAIDuP,EAAM,UAAU,UAAY,SAASzW,EAAIC,EAAS,CAChD,GAAIA,EACF,OAAO,KAAK,UAAU,UAAUD,CAAE,EAIpC,QAFIkB,EAAa,EACbwE,EAAO,KAAK,MACTA,GACD1F,EAAG0F,EAAK,MAAOxE,IAAc,IAAI,IAAM,IAG3CwE,EAAOA,EAAK,KAEd,OAAOxE,CACR,EAEDuV,EAAM,UAAU,WAAa,SAASxX,EAAMgB,EAAS,CACnD,GAAIA,EACF,OAAO,KAAK,UAAU,WAAWhB,CAAI,EAEvC,IAAIiC,EAAa,EACbwE,EAAO,KAAK,MAChB,OAAO,IAAI5G,EAAS,UAAY,CAC9B,GAAI4G,EAAM,CACR,IAAIvK,EAAQuK,EAAK,MACjB,OAAAA,EAAOA,EAAK,KACL1G,EAAcC,EAAMiC,IAAc/F,CAAK,EAEhD,OAAOkE,EAAc,CAC7B,CAAO,CACF,EAGH,SAASsX,GAAQG,EAAY,CAC3B,MAAO,CAAC,EAAEA,GAAcA,EAAWC,EAAiB,GAGtDN,EAAM,QAAUE,GAEhB,IAAII,GAAoB,0BAEpBC,GAAiBP,EAAM,UAC3BO,GAAeD,EAAiB,EAAI,GACpCC,GAAe,cAAgB1P,EAAa,cAC5C0P,GAAe,UAAY1P,EAAa,UACxC0P,GAAe,YAAc1P,EAAa,YAC1C0P,GAAe,WAAa1P,EAAa,WAGzC,SAASuP,GAAU1Y,EAAMyY,EAAM1P,EAAS3C,EAAM,CAC5C,IAAIwB,EAAM,OAAO,OAAOiR,EAAc,EACtC,OAAAjR,EAAI,KAAO5H,EACX4H,EAAI,MAAQ6Q,EACZ7Q,EAAI,UAAYmB,EAChBnB,EAAI,OAASxB,EACbwB,EAAI,UAAY,GACTA,EAGT,IAAIkR,GACJ,SAASP,IAAa,CACpB,OAAOO,KAAgBA,GAAcJ,GAAU,CAAC,GAMlD,SAASK,GAAMlc,EAAMmc,EAAS,CAC5B,IAAIC,EAAY,SAASrW,EAAM,CAAE/F,EAAK,UAAU+F,CAAG,EAAIoW,EAAQpW,CAAG,CAAI,EACtE,cAAO,KAAKoW,CAAO,EAAE,QAAQC,CAAS,EACtC,OAAO,uBACL,OAAO,sBAAsBD,CAAO,EAAE,QAAQC,CAAS,EAClDpc,EAGTE,EAAS,SAAW4D,EAEpBoY,GAAMhc,EAAU,CAId,QAAS,UAAW,CAClByK,EAAkB,KAAK,IAAI,EAC3B,IAAIlF,EAAQ,IAAI,MAAM,KAAK,MAAQ,CAAC,EACpC,YAAK,SAAQ,EAAG,UAAU,SAAStB,EAAGiN,EAAI,CAAE3L,EAAM2L,CAAC,EAAIjN,CAAE,CAAE,EACpDsB,CACR,EAED,aAAc,UAAW,CACvB,OAAO,IAAIgQ,GAAkB,IAAI,CAClC,EAED,KAAM,UAAW,CACf,OAAO,KAAK,MAAK,EAAG,IAClB,SAAStV,EAAQ,CAAC,OAAOA,GAAS,OAAOA,EAAM,MAAS,WAAaA,EAAM,KAAI,EAAKA,CAAK,CAC1F,EAAC,OAAQ,CACX,EAED,OAAQ,UAAW,CACjB,OAAO,KAAK,MAAK,EAAG,IAClB,SAASA,EAAQ,CAAC,OAAOA,GAAS,OAAOA,EAAM,QAAW,WAAaA,EAAM,OAAM,EAAKA,CAAK,CAC9F,EAAC,OAAQ,CACX,EAED,WAAY,UAAW,CACrB,OAAO,IAAI8U,EAAgB,KAAM,EAAI,CACtC,EAED,MAAO,UAAW,CAEhB,OAAOrK,EAAI,KAAK,YAAY,CAC7B,EAED,SAAU,UAAW,CACnBD,EAAkB,KAAK,IAAI,EAC3B,IAAI9E,EAAS,CAAE,EACf,YAAK,UAAU,SAAS1B,EAAGD,EAAI,CAAE2B,EAAO3B,CAAC,EAAIC,EAAI,EAC1C0B,CACR,EAED,aAAc,UAAW,CAEvB,OAAOgG,EAAW,KAAK,YAAY,CACpC,EAED,aAAc,UAAW,CAEvB,OAAOgP,GAAWta,EAAQ,IAAI,EAAI,KAAK,SAAU,EAAG,IAAI,CACzD,EAED,MAAO,UAAW,CAEhB,OAAOga,EAAIha,EAAQ,IAAI,EAAI,KAAK,SAAU,EAAG,IAAI,CAClD,EAED,SAAU,UAAW,CACnB,OAAO,IAAImV,GAAc,IAAI,CAC9B,EAED,MAAO,UAAW,CAChB,OAAOhV,EAAU,IAAI,EAAI,KAAK,aAAc,EAC1CH,EAAQ,IAAI,EAAI,KAAK,WAAY,EACjC,KAAK,SAAU,CAClB,EAED,QAAS,UAAW,CAElB,OAAOkb,EAAMlb,EAAQ,IAAI,EAAI,KAAK,SAAU,EAAG,IAAI,CACpD,EAED,OAAQ,UAAW,CAEjB,OAAOsQ,EAAKtQ,EAAQ,IAAI,EAAI,KAAK,SAAU,EAAG,IAAI,CACnD,EAKD,SAAU,UAAW,CACnB,MAAO,YACR,EAED,WAAY,SAASqb,EAAMhJ,EAAM,CAC/B,OAAI,KAAK,OAAS,EACTgJ,EAAOhJ,EAETgJ,EAAO,IAAM,KAAK,MAAO,EAAC,IAAI,KAAK,gBAAgB,EAAE,KAAK,IAAI,EAAI,IAAMhJ,CAChF,EAKD,OAAQ,UAAW,CAAC,IAAIrB,EAASzR,EAAQ,KAAK,UAAW,CAAC,EACxD,OAAO8W,EAAM,KAAMgB,GAAc,KAAMrG,CAAM,CAAC,CAC/C,EAED,SAAU,SAASpJ,EAAa,CAC9B,OAAO,KAAK,KAAK,SAAShI,EAAQ,CAAC,OAAOiH,EAAGjH,EAAOgI,CAAW,CAAC,CAAC,CAClE,EAED,QAAS,UAAW,CAClB,OAAO,KAAK,WAAWzE,EAAe,CACvC,EAED,MAAO,SAASyS,EAAWd,EAAS,CAClC1K,EAAkB,KAAK,IAAI,EAC3B,IAAI0R,EAAc,GAClB,YAAK,UAAU,SAASlY,EAAGD,EAAGiF,EAAI,CAChC,GAAI,CAACgN,EAAU,KAAKd,EAASlR,EAAGD,EAAGiF,CAAC,EAClC,OAAAkT,EAAc,GACP,EAEjB,CAAO,EACMA,CACR,EAED,OAAQ,SAASlG,EAAWd,EAAS,CACnC,OAAOuB,EAAM,KAAMV,GAAc,KAAMC,EAAWd,EAAS,EAAI,CAAC,CACjE,EAED,KAAM,SAASc,EAAWd,EAAS3P,EAAa,CAC9C,IAAIkB,EAAQ,KAAK,UAAUuP,EAAWd,CAAO,EAC7C,OAAOzO,EAAQA,EAAM,CAAC,EAAIlB,CAC3B,EAED,UAAW,SAASyQ,EAAWd,EAAS,CACtC,IAAIiH,EACJ,YAAK,UAAU,SAASnY,EAAGD,EAAGiF,EAAI,CAChC,GAAIgN,EAAU,KAAKd,EAASlR,EAAGD,EAAGiF,CAAC,EACjC,OAAAmT,EAAQ,CAACpY,EAAGC,CAAC,EACN,EAEjB,CAAO,EACMmY,CACR,EAED,cAAe,SAASnG,EAAWd,EAAS,CAC1C,OAAO,KAAK,QAAQ,QAAS,EAAC,UAAUc,EAAWd,CAAO,CAC3D,EAED,QAAS,SAASkH,EAAYlH,EAAS,CACrC,OAAA1K,EAAkB,KAAK,IAAI,EACpB,KAAK,UAAU0K,EAAUkH,EAAW,KAAKlH,CAAO,EAAIkH,CAAU,CACtE,EAED,KAAM,SAAS9D,EAAW,CACxB9N,EAAkB,KAAK,IAAI,EAC3B8N,EAAYA,IAAc,OAAY,GAAKA,EAAY,IACvD,IAAI+D,EAAS,GACTC,EAAU,GACd,YAAK,UAAU,SAAStY,EAAI,CAC1BsY,EAAWA,EAAU,GAAUD,GAAU/D,EACzC+D,GAAUrY,GAAM,KAA0BA,EAAE,SAAQ,EAAK,EACjE,CAAO,EACMqY,CACR,EAED,KAAM,UAAW,CACf,OAAO,KAAK,WAAWhZ,EAAY,CACpC,EAED,IAAK,SAASuI,EAAQsJ,EAAS,CAC7B,OAAOuB,EAAM,KAAMrB,GAAW,KAAMxJ,EAAQsJ,CAAO,CAAC,CACrD,EAED,OAAQ,SAASqH,EAASC,EAAkBtH,EAAS,CACnD1K,EAAkB,KAAK,IAAI,EAC3B,IAAIiS,EACAC,EACJ,OAAI,UAAU,OAAS,EACrBA,EAAW,GAEXD,EAAYD,EAEd,KAAK,UAAU,SAASxY,EAAGD,EAAGiF,EAAI,CAC5B0T,GACFA,EAAW,GACXD,EAAYzY,GAEZyY,EAAYF,EAAQ,KAAKrH,EAASuH,EAAWzY,EAAGD,EAAGiF,CAAC,CAE9D,CAAO,EACMyT,CACR,EAED,YAAa,SAASF,EAASC,EAAkBtH,EAAS,CACxD,IAAIyH,EAAW,KAAK,WAAU,EAAG,QAAS,EAC1C,OAAOA,EAAS,OAAO,MAAMA,EAAU,SAAS,CACjD,EAED,QAAS,UAAW,CAClB,OAAOlG,EAAM,KAAMxB,GAAe,KAAM,EAAI,CAAC,CAC9C,EAED,MAAO,SAASnS,EAAOC,EAAK,CAC1B,OAAO0T,EAAM,KAAMC,GAAa,KAAM5T,EAAOC,EAAK,EAAI,CAAC,CACxD,EAED,KAAM,SAASiT,EAAWd,EAAS,CACjC,MAAO,CAAC,KAAK,MAAM0H,GAAI5G,CAAS,EAAGd,CAAO,CAC3C,EAED,KAAM,SAASzJ,EAAY,CACzB,OAAOgL,EAAM,KAAM9K,GAAY,KAAMF,CAAU,CAAC,CACjD,EAED,OAAQ,UAAW,CACjB,OAAO,KAAK,WAAWnI,CAAc,CACtC,EAKD,QAAS,UAAW,CAClB,OAAO,KAAK,MAAM,EAAG,EAAE,CACxB,EAED,QAAS,UAAW,CAClB,OAAO,KAAK,OAAS,OAAY,KAAK,OAAS,EAAI,CAAC,KAAK,KAAK,UAAY,CAAC,MAAO,EAAI,CAAC,CACxF,EAED,MAAO,SAAS0S,EAAWd,EAAS,CAClC,OAAO3S,GACLyT,EAAY,KAAK,MAAK,EAAG,OAAOA,EAAWd,CAAO,EAAI,IACvD,CACF,EAED,QAAS,SAASiB,EAASjB,EAAS,CAClC,OAAOgB,GAAe,KAAMC,EAASjB,CAAO,CAC7C,EAED,OAAQ,SAAShN,EAAO,CACtB,OAAOd,GAAU,KAAMc,CAAK,CAC7B,EAED,SAAU,UAAW,CACnB,IAAI1D,EAAW,KACf,GAAIA,EAAS,OAEX,OAAO,IAAIa,GAASb,EAAS,MAAM,EAErC,IAAIqY,EAAkBrY,EAAS,MAAK,EAAG,IAAIsY,EAAW,EAAE,aAAc,EACtE,OAAAD,EAAgB,aAAe,UAAY,CAAC,OAAOrY,EAAS,MAAK,CAAE,EAC5DqY,CACR,EAED,UAAW,SAAS7G,EAAWd,EAAS,CACtC,OAAO,KAAK,OAAO0H,GAAI5G,CAAS,EAAGd,CAAO,CAC3C,EAED,SAAU,SAASc,EAAWd,EAAS3P,EAAa,CAClD,OAAO,KAAK,WAAU,EAAG,QAAO,EAAG,KAAKyQ,EAAWd,EAAS3P,CAAW,CACxE,EAED,MAAO,UAAW,CAChB,OAAO,KAAK,KAAK9C,EAAU,CAC5B,EAED,QAAS,SAASmJ,EAAQsJ,EAAS,CACjC,OAAOuB,EAAM,KAAM2B,GAAe,KAAMxM,EAAQsJ,CAAO,CAAC,CACzD,EAED,QAAS,SAAS6C,EAAO,CACvB,OAAOtB,EAAM,KAAMqB,GAAe,KAAMC,EAAO,EAAI,CAAC,CACrD,EAED,aAAc,UAAW,CACvB,OAAO,IAAIvC,GAAoB,IAAI,CACpC,EAED,IAAK,SAASuH,EAAWxX,EAAa,CACpC,OAAO,KAAK,KAAK,SAASmC,EAAG9B,EAAM,CAAC,OAAOqB,EAAGrB,EAAKmX,CAAS,CAAC,EAAG,OAAWxX,CAAW,CACvF,EAED,MAAO,SAASyX,EAAezX,EAAa,CAM1C,QALI0X,EAAS,KAGTza,EAAO0I,GAAc8R,CAAa,EAClChX,EACG,EAAEA,EAAOxD,EAAK,KAAI,GAAI,MAAM,CACjC,IAAIoD,EAAMI,EAAK,MAEf,GADAiX,EAASA,GAAUA,EAAO,IAAMA,EAAO,IAAIrX,EAAKlE,CAAO,EAAIA,EACvDub,IAAWvb,EACb,OAAO6D,EAGX,OAAO0X,CACR,EAED,QAAS,SAAS9G,EAASjB,EAAS,CAClC,OAAOmB,GAAe,KAAMF,EAASjB,CAAO,CAC7C,EAED,IAAK,SAAS6H,EAAW,CACvB,OAAO,KAAK,IAAIA,EAAWrb,CAAO,IAAMA,CACzC,EAED,MAAO,SAASsb,EAAe,CAC7B,OAAO,KAAK,MAAMA,EAAetb,CAAO,IAAMA,CAC/C,EAED,SAAU,SAASc,EAAM,CACvB,OAAAA,EAAO,OAAOA,EAAK,UAAa,WAAaA,EAAOzC,EAASyC,CAAI,EAC1D,KAAK,MAAM,SAASxC,EAAQ,CAAC,OAAOwC,EAAK,SAASxC,CAAK,CAAC,CAAC,CACjE,EAED,WAAY,SAASwC,EAAM,CACzB,OAAAA,EAAO,OAAOA,EAAK,UAAa,WAAaA,EAAOzC,EAASyC,CAAI,EAC1DA,EAAK,SAAS,IAAI,CAC1B,EAED,OAAQ,UAAW,CACjB,OAAO,KAAK,MAAO,EAAC,IAAI0a,EAAS,EAAE,aAAc,CAClD,EAED,KAAM,UAAW,CACf,OAAO,KAAK,MAAK,EAAG,QAAO,EAAG,MAAO,CACtC,EAED,IAAK,SAASzR,EAAY,CACxB,OAAOgN,GAAW,KAAMhN,CAAU,CACnC,EAED,MAAO,SAASG,EAAQH,EAAY,CAClC,OAAOgN,GAAW,KAAMhN,EAAYG,CAAM,CAC3C,EAED,IAAK,SAASH,EAAY,CACxB,OAAOgN,GAAW,KAAMhN,EAAa0R,GAAI1R,CAAU,EAAI2R,EAAoB,CAC5E,EAED,MAAO,SAASxR,EAAQH,EAAY,CAClC,OAAOgN,GAAW,KAAMhN,EAAa0R,GAAI1R,CAAU,EAAI2R,GAAsBxR,CAAM,CACpF,EAED,KAAM,UAAW,CACf,OAAO,KAAK,MAAM,CAAC,CACpB,EAED,KAAM,SAASyR,EAAQ,CACrB,OAAO,KAAK,MAAM,KAAK,IAAI,EAAGA,CAAM,CAAC,CACtC,EAED,SAAU,SAASA,EAAQ,CACzB,OAAO5G,EAAM,KAAM,KAAK,MAAO,EAAC,QAAS,EAAC,KAAK4G,CAAM,EAAE,SAAS,CACjE,EAED,UAAW,SAASrH,EAAWd,EAAS,CACtC,OAAOuB,EAAM,KAAMa,GAAiB,KAAMtB,EAAWd,EAAS,EAAI,CAAC,CACpE,EAED,UAAW,SAASc,EAAWd,EAAS,CACtC,OAAO,KAAK,UAAU0H,GAAI5G,CAAS,EAAGd,CAAO,CAC9C,EAED,OAAQ,SAAStJ,EAAQH,EAAY,CACnC,OAAOgL,EAAM,KAAM9K,GAAY,KAAMF,EAAYG,CAAM,CAAC,CACzD,EAED,KAAM,SAASyR,EAAQ,CACrB,OAAO,KAAK,MAAM,EAAG,KAAK,IAAI,EAAGA,CAAM,CAAC,CACzC,EAED,SAAU,SAASA,EAAQ,CACzB,OAAO5G,EAAM,KAAM,KAAK,MAAO,EAAC,QAAS,EAAC,KAAK4G,CAAM,EAAE,SAAS,CACjE,EAED,UAAW,SAASrH,EAAWd,EAAS,CACtC,OAAOuB,EAAM,KAAMU,GAAiB,KAAMnB,EAAWd,CAAO,CAAC,CAC9D,EAED,UAAW,SAASc,EAAWd,EAAS,CACtC,OAAO,KAAK,UAAU0H,GAAI5G,CAAS,EAAGd,CAAO,CAC9C,EAED,SAAU,UAAW,CACnB,OAAO,KAAK,aAAc,CAC3B,EAKD,SAAU,UAAW,CACnB,OAAO,KAAK,SAAW,KAAK,OAASoI,GAAa,IAAI,GAS5D,CAAG,EAOD,IAAIC,EAAoBxd,EAAS,UACjCwd,EAAkB1c,EAAoB,EAAI,GAC1C0c,EAAkB7Z,EAAe,EAAI6Z,EAAkB,OACvDA,EAAkB,OAASA,EAAkB,QAC7CA,EAAkB,iBAAmBC,GACrCD,EAAkB,QAClBA,EAAkB,SAAW,UAAW,CAAE,OAAO,KAAK,SAAU,CAAG,EACnEA,EAAkB,MAAQA,EAAkB,QAC5CA,EAAkB,SAAWA,EAAkB,SAG9C,UAAY,CACX,GAAI,CACF,OAAO,eAAeA,EAAmB,SAAU,CACjD,IAAK,UAAY,CACf,GAAI,CAACxd,EAAS,gBAAiB,CAC7B,IAAI2O,EACJ,GAAI,CACF,MAAM,IAAI,KACX,OAAQrG,EAAO,CACdqG,EAAQrG,EAAM,MAEhB,GAAIqG,EAAM,QAAQ,aAAa,IAAM,GACnC,gBAAW,QAAQ,MAAQ,QAAQ,KACjC,4IAGAA,CACD,EACM,KAAK,MAI1B,CAAO,CACF,MAAW,CAAA,CAChB,EAAM,EAIJqN,GAAM5b,EAAe,CAInB,KAAM,UAAW,CACf,OAAOsW,EAAM,KAAMb,GAAY,IAAI,CAAC,CACrC,EAED,QAAS,SAASI,EAAWd,EAAS,CACpC,IAAIzO,EAAQ,KAAK,UAAUuP,EAAWd,CAAO,EAC7C,OAAOzO,GAASA,EAAM,CAAC,CACxB,EAED,YAAa,SAASuP,EAAWd,EAAS,CACxC,OAAO,KAAK,QAAQ,QAAS,EAAC,QAAQc,EAAWd,CAAO,CACzD,EAED,MAAO,SAASlN,EAAa,CAC3B,OAAO,KAAK,QAAQ,SAAShI,EAAQ,CAAC,OAAOiH,EAAGjH,EAAOgI,CAAW,CAAC,CAAC,CACrE,EAED,UAAW,SAASA,EAAa,CAC/B,OAAO,KAAK,YAAY,SAAShI,EAAQ,CAAC,OAAOiH,EAAGjH,EAAOgI,CAAW,CAAC,CAAC,CACzE,EAED,WAAY,SAAS4D,EAAQsJ,EAAS,CAAC,IAAIjN,EAAS,KAC9ClC,EAAa,EACjB,OAAO0Q,EAAM,KACX,KAAK,MAAK,EAAG,IACX,SAASzS,EAAGD,EAAI,CAAC,OAAO6H,EAAO,KAAKsJ,EAAS,CAACnR,EAAGC,CAAC,EAAG+B,IAAckC,CAAM,CAAC,GAC1E,aAAY,CACf,CACF,EAED,QAAS,SAAS2D,EAAQsJ,EAAS,CAAC,IAAIjN,EAAS,KAC/C,OAAOwO,EAAM,KACX,KAAK,MAAK,EAAG,KAAI,EAAG,IAClB,SAAS1S,EAAGC,EAAI,CAAC,OAAO4H,EAAO,KAAKsJ,EAASnR,EAAGC,EAAGiE,CAAM,CAAC,GAC1D,KAAI,CACP,EAGP,CAAG,EAED,IAAIwV,GAAyBtd,EAAc,UAC3Csd,GAAuB1c,EAAiB,EAAI,GAC5C0c,GAAuB/Z,EAAe,EAAI6Z,EAAkB,QAC5DE,GAAuB,OAASF,EAAkB,SAClDE,GAAuB,iBAAmB,SAASzZ,EAAGD,EAAI,CAAC,OAAO,KAAK,UAAUA,CAAC,EAAI,KAAOyZ,GAAYxZ,CAAC,CAAC,EAI3G+X,GAAMzb,GAAiB,CAIrB,WAAY,UAAW,CACrB,OAAO,IAAIwU,EAAgB,KAAM,EAAK,CACvC,EAKD,OAAQ,SAASkB,EAAWd,EAAS,CACnC,OAAOuB,EAAM,KAAMV,GAAc,KAAMC,EAAWd,EAAS,EAAK,CAAC,CAClE,EAED,UAAW,SAASc,EAAWd,EAAS,CACtC,IAAIzO,EAAQ,KAAK,UAAUuP,EAAWd,CAAO,EAC7C,OAAOzO,EAAQA,EAAM,CAAC,EAAI,EAC3B,EAED,QAAS,SAASuB,EAAa,CAC7B,IAAIpC,EAAM,KAAK,WAAU,EAAG,MAAMoC,CAAW,EAC7C,OAAOpC,IAAQ,OAAY,GAAKA,CACjC,EAED,YAAa,SAASoC,EAAa,CACjC,IAAIpC,EAAM,KAAK,WAAU,EAAG,QAAS,EAAC,MAAMoC,CAAW,EACvD,OAAOpC,IAAQ,OAAY,GAAKA,CAIjC,EAED,QAAS,UAAW,CAClB,OAAO6Q,EAAM,KAAMxB,GAAe,KAAM,EAAK,CAAC,CAC/C,EAED,MAAO,SAASnS,EAAOC,EAAK,CAC1B,OAAO0T,EAAM,KAAMC,GAAa,KAAM5T,EAAOC,EAAK,EAAK,CAAC,CACzD,EAED,OAAQ,SAASJ,EAAO+a,EAA2B,CACjD,IAAIC,EAAU,UAAU,OAExB,GADAD,EAAY,KAAK,IAAIA,EAAY,EAAG,CAAC,EACjCC,IAAY,GAAMA,IAAY,GAAK,CAACD,EACtC,OAAO,KAKT/a,EAAQM,GAAaN,EAAOA,EAAQ,EAAI,KAAK,MAAK,EAAK,KAAK,IAAI,EAChE,IAAIib,EAAU,KAAK,MAAM,EAAGjb,CAAK,EACjC,OAAO8T,EACL,KACAkH,IAAY,EACVC,EACAA,EAAQ,OAAO3b,GAAQ,UAAW,CAAC,EAAG,KAAK,MAAMU,EAAQ+a,CAAS,CAAC,CACtE,CACF,EAKD,cAAe,SAAS1H,EAAWd,EAAS,CAC1C,IAAItP,EAAM,KAAK,WAAY,EAAC,YAAYoQ,EAAWd,CAAO,EAC1D,OAAOtP,IAAQ,OAAY,GAAKA,CACjC,EAED,MAAO,UAAW,CAChB,OAAO,KAAK,IAAI,CAAC,CAClB,EAED,QAAS,SAASmS,EAAO,CACvB,OAAOtB,EAAM,KAAMqB,GAAe,KAAMC,EAAO,EAAK,CAAC,CACtD,EAED,IAAK,SAASpV,EAAO4C,EAAa,CAChC,OAAA5C,EAAQD,GAAU,KAAMC,CAAK,EACrBA,EAAQ,GAAM,KAAK,OAAS,KAC/B,KAAK,OAAS,QAAaA,EAAQ,KAAK,KAC3C4C,EACA,KAAK,KAAK,SAASmC,EAAG9B,EAAM,CAAC,OAAOA,IAAQjD,CAAK,EAAG,OAAW4C,CAAW,CAC7E,EAED,IAAK,SAAS5C,EAAO,CACnB,OAAAA,EAAQD,GAAU,KAAMC,CAAK,EACtBA,GAAS,IAAM,KAAK,OAAS,OAClC,KAAK,OAAS,KAAYA,EAAQ,KAAK,KACvC,KAAK,QAAQA,CAAK,IAAM,GAE3B,EAED,UAAW,SAAS2V,EAAW,CAC7B,OAAO7B,EAAM,KAAM4B,GAAiB,KAAMC,CAAS,CAAC,CACrD,EAED,WAAY,UAA2B,CACrC,IAAI7I,EAAY,CAAC,IAAI,EAAE,OAAOxN,GAAQ,SAAS,CAAC,EAC5C4b,EAASjF,GAAe,KAAK,MAAK,EAAIpY,EAAW,GAAIiP,CAAS,EAC9DqO,EAAcD,EAAO,QAAQ,EAAI,EACrC,OAAIA,EAAO,OACTC,EAAY,KAAOD,EAAO,KAAOpO,EAAU,QAEtCgH,EAAM,KAAMqH,CAAW,CAC/B,EAED,KAAM,UAAW,CACf,OAAO,KAAK,IAAI,EAAE,CACnB,EAED,UAAW,SAAS9H,EAAWd,EAAS,CACtC,OAAOuB,EAAM,KAAMa,GAAiB,KAAMtB,EAAWd,EAAS,EAAK,CAAC,CACrE,EAED,IAAK,UAA8B,CACjC,IAAIzF,EAAY,CAAC,IAAI,EAAE,OAAOxN,GAAQ,SAAS,CAAC,EAChD,OAAOwU,EAAM,KAAMmC,GAAe,KAAMmF,GAAetO,CAAS,CAAC,CAClE,EAED,QAAS,SAASqJ,EAA2B,CAC3C,IAAIrJ,EAAYxN,GAAQ,SAAS,EACjC,OAAAwN,EAAU,CAAC,EAAI,KACRgH,EAAM,KAAMmC,GAAe,KAAME,EAAQrJ,CAAS,CAAC,EAGhE,CAAG,EAEDnP,GAAgB,UAAUW,EAAmB,EAAI,GACjDX,GAAgB,UAAUe,EAAmB,EAAI,GAIjD0a,GAAMtb,EAAa,CAIjB,IAAK,SAAST,EAAOuF,EAAa,CAChC,OAAO,KAAK,IAAIvF,CAAK,EAAIA,EAAQuF,CAClC,EAED,SAAU,SAASvF,EAAO,CACxB,OAAO,KAAK,IAAIA,CAAK,CACtB,EAKD,OAAQ,UAAW,CACjB,OAAO,KAAK,SAAU,EAG5B,CAAG,EAEDS,EAAY,UAAU,IAAM8c,EAAkB,SAK9CxB,GAAM1b,EAAUF,EAAc,SAAS,EACvC4b,GAAMvb,EAAYF,GAAgB,SAAS,EAC3Cyb,GAAMpb,GAAQF,EAAY,SAAS,EAEnCsb,GAAMnT,GAAiBzI,EAAc,SAAS,EAC9C4b,GAAMlT,GAAmBvI,GAAgB,SAAS,EAClDyb,GAAMjT,GAAerI,EAAY,SAAS,EAK1C,SAASyc,GAAUlZ,EAAGD,EAAG,CACvB,OAAOA,EAGT,SAAS+Y,GAAY9Y,EAAGD,EAAG,CACzB,MAAO,CAACA,EAAGC,CAAC,EAGd,SAAS4Y,GAAI5G,EAAW,CACtB,OAAO,UAAW,CAChB,MAAO,CAACA,EAAU,MAAM,KAAM,SAAS,GAI3C,SAASmH,GAAInH,EAAW,CACtB,OAAO,UAAW,CAChB,MAAO,CAACA,EAAU,MAAM,KAAM,SAAS,GAI3C,SAASwH,GAAYxd,EAAO,CAC1B,OAAO,OAAOA,GAAU,SAAW,KAAK,UAAUA,CAAK,EAAIA,EAG7D,SAAS+d,IAAgB,CACvB,OAAO9b,GAAQ,SAAS,EAG1B,SAASmb,GAAqB/V,EAAGC,EAAG,CAClC,OAAOD,EAAIC,EAAI,EAAID,EAAIC,EAAI,GAAK,EAGlC,SAASgW,GAAa9Y,EAAU,CAC9B,GAAIA,EAAS,OAAS,IACpB,MAAO,GAET,IAAIwZ,EAAU7c,GAAUqD,CAAQ,EAC5ByZ,EAAQ7d,EAAQoE,CAAQ,EACxB8E,EAAI0U,EAAU,EAAI,EAClBhb,EAAOwB,EAAS,UAClByZ,EACED,EACE,SAASha,EAAGD,EAAI,CAAEuF,EAAI,GAAKA,EAAI4U,GAAU9U,EAAKpF,CAAC,EAAGoF,EAAKrF,CAAC,CAAC,EAAI,CAAI,EACjE,SAASC,EAAGD,EAAI,CAAEuF,EAAIA,EAAI4U,GAAU9U,EAAKpF,CAAC,EAAGoF,EAAKrF,CAAC,CAAC,EAAI,CAAI,EAC9Dia,EACE,SAASha,EAAI,CAAEsF,EAAI,GAAKA,EAAIF,EAAKpF,CAAC,EAAI,CAAI,EAC1C,SAASA,EAAI,CAAEsF,EAAIA,EAAIF,EAAKpF,CAAC,EAAI,CAAE,CACxC,EACD,OAAOma,GAAiBnb,EAAMsG,CAAC,EAGjC,SAAS6U,GAAiBnb,EAAMsG,EAAG,CACjC,OAAAA,EAAIP,GAAKO,EAAG,UAAU,EACtBA,EAAIP,GAAKO,GAAK,GAAKA,IAAM,IAAK,SAAU,EACxCA,EAAIP,GAAKO,GAAK,GAAKA,IAAM,IAAK,CAAC,EAC/BA,GAAKA,EAAI,WAAa,GAAKtG,EAC3BsG,EAAIP,GAAKO,EAAIA,IAAM,GAAI,UAAU,EACjCA,EAAIP,GAAKO,EAAIA,IAAM,GAAI,UAAU,EACjCA,EAAIJ,GAAII,EAAIA,IAAM,EAAE,EACbA,EAGT,SAAS4U,GAAU7W,EAAGC,EAAG,CACvB,OAAOD,EAAIC,EAAI,YAAcD,GAAK,IAAMA,GAAK,GAAK,EAGpD,IAAI+W,GAAY,CAEd,SAAUre,EAEV,IAAKG,EACL,WAAYyI,GACZ,IAAK8B,EACL,WAAYiB,EACZ,KAAMgF,EACN,MAAO4K,EACP,IAAKlB,EACL,WAAYM,GAEZ,OAAQtB,EACR,MAAO9Q,EACP,OAAQT,EAER,GAAIZ,EACJ,OAAQP,EAET,EAED,OAAO0X,EAET,CAAC","x_google_ignoreList":[0]}