@maptiler/geocoding-control 2.1.7 → 3.0.0-rc.2

package/openlayers-controller.umd.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"openlayers-controller.umd.js","sources":["../node_modules/@turf/helpers/dist/esm/index.js","../node_modules/@turf/meta/dist/esm/index.js","../node_modules/@turf/bbox/dist/esm/index.js","../node_modules/bignumber.js/bignumber.mjs","../node_modules/splaytree-ts/dist/esm/index.js","../node_modules/polyclip-ts/dist/esm/index.js","../node_modules/@turf/difference/dist/esm/index.js","../node_modules/@turf/flatten/dist/esm/index.js","../node_modules/@turf/union/dist/esm/index.js","../src/geoUtils.ts","../src/mask.ts","../src/openlayers-controller.ts"],"sourcesContent":["// index.ts\nvar earthRadius = 63710088e-1;\nvar factors = {\n  centimeters: earthRadius * 100,\n  centimetres: earthRadius * 100,\n  degrees: 360 / (2 * Math.PI),\n  feet: earthRadius * 3.28084,\n  inches: earthRadius * 39.37,\n  kilometers: earthRadius / 1e3,\n  kilometres: earthRadius / 1e3,\n  meters: earthRadius,\n  metres: earthRadius,\n  miles: earthRadius / 1609.344,\n  millimeters: earthRadius * 1e3,\n  millimetres: earthRadius * 1e3,\n  nauticalmiles: earthRadius / 1852,\n  radians: 1,\n  yards: earthRadius * 1.0936\n};\nvar areaFactors = {\n  acres: 247105e-9,\n  centimeters: 1e4,\n  centimetres: 1e4,\n  feet: 10.763910417,\n  hectares: 1e-4,\n  inches: 1550.003100006,\n  kilometers: 1e-6,\n  kilometres: 1e-6,\n  meters: 1,\n  metres: 1,\n  miles: 386e-9,\n  nauticalmiles: 29155334959812285e-23,\n  millimeters: 1e6,\n  millimetres: 1e6,\n  yards: 1.195990046\n};\nfunction feature(geom, properties, options = {}) {\n  const feat = { type: \"Feature\" };\n  if (options.id === 0 || options.id) {\n    feat.id = options.id;\n  }\n  if (options.bbox) {\n    feat.bbox = options.bbox;\n  }\n  feat.properties = properties || {};\n  feat.geometry = geom;\n  return feat;\n}\nfunction geometry(type, coordinates, _options = {}) {\n  switch (type) {\n    case \"Point\":\n      return point(coordinates).geometry;\n    case \"LineString\":\n      return lineString(coordinates).geometry;\n    case \"Polygon\":\n      return polygon(coordinates).geometry;\n    case \"MultiPoint\":\n      return multiPoint(coordinates).geometry;\n    case \"MultiLineString\":\n      return multiLineString(coordinates).geometry;\n    case \"MultiPolygon\":\n      return multiPolygon(coordinates).geometry;\n    default:\n      throw new Error(type + \" is invalid\");\n  }\n}\nfunction point(coordinates, properties, options = {}) {\n  if (!coordinates) {\n    throw new Error(\"coordinates is required\");\n  }\n  if (!Array.isArray(coordinates)) {\n    throw new Error(\"coordinates must be an Array\");\n  }\n  if (coordinates.length < 2) {\n    throw new Error(\"coordinates must be at least 2 numbers long\");\n  }\n  if (!isNumber(coordinates[0]) || !isNumber(coordinates[1])) {\n    throw new Error(\"coordinates must contain numbers\");\n  }\n  const geom = {\n    type: \"Point\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction points(coordinates, properties, options = {}) {\n  return featureCollection(\n    coordinates.map((coords) => {\n      return point(coords, properties);\n    }),\n    options\n  );\n}\nfunction polygon(coordinates, properties, options = {}) {\n  for (const ring of coordinates) {\n    if (ring.length < 4) {\n      throw new Error(\n        \"Each LinearRing of a Polygon must have 4 or more Positions.\"\n      );\n    }\n    if (ring[ring.length - 1].length !== ring[0].length) {\n      throw new Error(\"First and last Position are not equivalent.\");\n    }\n    for (let j = 0; j < ring[ring.length - 1].length; j++) {\n      if (ring[ring.length - 1][j] !== ring[0][j]) {\n        throw new Error(\"First and last Position are not equivalent.\");\n      }\n    }\n  }\n  const geom = {\n    type: \"Polygon\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction polygons(coordinates, properties, options = {}) {\n  return featureCollection(\n    coordinates.map((coords) => {\n      return polygon(coords, properties);\n    }),\n    options\n  );\n}\nfunction lineString(coordinates, properties, options = {}) {\n  if (coordinates.length < 2) {\n    throw new Error(\"coordinates must be an array of two or more positions\");\n  }\n  const geom = {\n    type: \"LineString\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction lineStrings(coordinates, properties, options = {}) {\n  return featureCollection(\n    coordinates.map((coords) => {\n      return lineString(coords, properties);\n    }),\n    options\n  );\n}\nfunction featureCollection(features, options = {}) {\n  const fc = { type: \"FeatureCollection\" };\n  if (options.id) {\n    fc.id = options.id;\n  }\n  if (options.bbox) {\n    fc.bbox = options.bbox;\n  }\n  fc.features = features;\n  return fc;\n}\nfunction multiLineString(coordinates, properties, options = {}) {\n  const geom = {\n    type: \"MultiLineString\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction multiPoint(coordinates, properties, options = {}) {\n  const geom = {\n    type: \"MultiPoint\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction multiPolygon(coordinates, properties, options = {}) {\n  const geom = {\n    type: \"MultiPolygon\",\n    coordinates\n  };\n  return feature(geom, properties, options);\n}\nfunction geometryCollection(geometries, properties, options = {}) {\n  const geom = {\n    type: \"GeometryCollection\",\n    geometries\n  };\n  return feature(geom, properties, options);\n}\nfunction round(num, precision = 0) {\n  if (precision && !(precision >= 0)) {\n    throw new Error(\"precision must be a positive number\");\n  }\n  const multiplier = Math.pow(10, precision || 0);\n  return Math.round(num * multiplier) / multiplier;\n}\nfunction radiansToLength(radians, units = \"kilometers\") {\n  const factor = factors[units];\n  if (!factor) {\n    throw new Error(units + \" units is invalid\");\n  }\n  return radians * factor;\n}\nfunction lengthToRadians(distance, units = \"kilometers\") {\n  const factor = factors[units];\n  if (!factor) {\n    throw new Error(units + \" units is invalid\");\n  }\n  return distance / factor;\n}\nfunction lengthToDegrees(distance, units) {\n  return radiansToDegrees(lengthToRadians(distance, units));\n}\nfunction bearingToAzimuth(bearing) {\n  let angle = bearing % 360;\n  if (angle < 0) {\n    angle += 360;\n  }\n  return angle;\n}\nfunction azimuthToBearing(angle) {\n  angle = angle % 360;\n  if (angle > 180) {\n    return angle - 360;\n  } else if (angle < -180) {\n    return angle + 360;\n  }\n  return angle;\n}\nfunction radiansToDegrees(radians) {\n  const normalisedRadians = radians % (2 * Math.PI);\n  return normalisedRadians * 180 / Math.PI;\n}\nfunction degreesToRadians(degrees) {\n  const normalisedDegrees = degrees % 360;\n  return normalisedDegrees * Math.PI / 180;\n}\nfunction convertLength(length, originalUnit = \"kilometers\", finalUnit = \"kilometers\") {\n  if (!(length >= 0)) {\n    throw new Error(\"length must be a positive number\");\n  }\n  return radiansToLength(lengthToRadians(length, originalUnit), finalUnit);\n}\nfunction convertArea(area, originalUnit = \"meters\", finalUnit = \"kilometers\") {\n  if (!(area >= 0)) {\n    throw new Error(\"area must be a positive number\");\n  }\n  const startFactor = areaFactors[originalUnit];\n  if (!startFactor) {\n    throw new Error(\"invalid original units\");\n  }\n  const finalFactor = areaFactors[finalUnit];\n  if (!finalFactor) {\n    throw new Error(\"invalid final units\");\n  }\n  return area / startFactor * finalFactor;\n}\nfunction isNumber(num) {\n  return !isNaN(num) && num !== null && !Array.isArray(num);\n}\nfunction isObject(input) {\n  return input !== null && typeof input === \"object\" && !Array.isArray(input);\n}\nfunction validateBBox(bbox) {\n  if (!bbox) {\n    throw new Error(\"bbox is required\");\n  }\n  if (!Array.isArray(bbox)) {\n    throw new Error(\"bbox must be an Array\");\n  }\n  if (bbox.length !== 4 && bbox.length !== 6) {\n    throw new Error(\"bbox must be an Array of 4 or 6 numbers\");\n  }\n  bbox.forEach((num) => {\n    if (!isNumber(num)) {\n      throw new Error(\"bbox must only contain numbers\");\n    }\n  });\n}\nfunction validateId(id) {\n  if (!id) {\n    throw new Error(\"id is required\");\n  }\n  if ([\"string\", \"number\"].indexOf(typeof id) === -1) {\n    throw new Error(\"id must be a number or a string\");\n  }\n}\nexport {\n  areaFactors,\n  azimuthToBearing,\n  bearingToAzimuth,\n  convertArea,\n  convertLength,\n  degreesToRadians,\n  earthRadius,\n  factors,\n  feature,\n  featureCollection,\n  geometry,\n  geometryCollection,\n  isNumber,\n  isObject,\n  lengthToDegrees,\n  lengthToRadians,\n  lineString,\n  lineStrings,\n  multiLineString,\n  multiPoint,\n  multiPolygon,\n  point,\n  points,\n  polygon,\n  polygons,\n  radiansToDegrees,\n  radiansToLength,\n  round,\n  validateBBox,\n  validateId\n};\n//# sourceMappingURL=index.js.map","// index.js\nimport { feature, point, lineString, isObject } from \"@turf/helpers\";\nfunction coordEach(geojson, callback, excludeWrapCoord) {\n  if (geojson === null) return;\n  var j, k, l, geometry, stopG, coords, geometryMaybeCollection, wrapShrink = 0, coordIndex = 0, isGeometryCollection, type = geojson.type, isFeatureCollection = type === \"FeatureCollection\", isFeature = type === \"Feature\", stop = isFeatureCollection ? geojson.features.length : 1;\n  for (var featureIndex = 0; featureIndex < stop; featureIndex++) {\n    geometryMaybeCollection = isFeatureCollection ? geojson.features[featureIndex].geometry : isFeature ? geojson.geometry : geojson;\n    isGeometryCollection = geometryMaybeCollection ? geometryMaybeCollection.type === \"GeometryCollection\" : false;\n    stopG = isGeometryCollection ? geometryMaybeCollection.geometries.length : 1;\n    for (var geomIndex = 0; geomIndex < stopG; geomIndex++) {\n      var multiFeatureIndex = 0;\n      var geometryIndex = 0;\n      geometry = isGeometryCollection ? geometryMaybeCollection.geometries[geomIndex] : geometryMaybeCollection;\n      if (geometry === null) continue;\n      coords = geometry.coordinates;\n      var geomType = geometry.type;\n      wrapShrink = excludeWrapCoord && (geomType === \"Polygon\" || geomType === \"MultiPolygon\") ? 1 : 0;\n      switch (geomType) {\n        case null:\n          break;\n        case \"Point\":\n          if (callback(\n            coords,\n            coordIndex,\n            featureIndex,\n            multiFeatureIndex,\n            geometryIndex\n          ) === false)\n            return false;\n          coordIndex++;\n          multiFeatureIndex++;\n          break;\n        case \"LineString\":\n        case \"MultiPoint\":\n          for (j = 0; j < coords.length; j++) {\n            if (callback(\n              coords[j],\n              coordIndex,\n              featureIndex,\n              multiFeatureIndex,\n              geometryIndex\n            ) === false)\n              return false;\n            coordIndex++;\n            if (geomType === \"MultiPoint\") multiFeatureIndex++;\n          }\n          if (geomType === \"LineString\") multiFeatureIndex++;\n          break;\n        case \"Polygon\":\n        case \"MultiLineString\":\n          for (j = 0; j < coords.length; j++) {\n            for (k = 0; k < coords[j].length - wrapShrink; k++) {\n              if (callback(\n                coords[j][k],\n                coordIndex,\n                featureIndex,\n                multiFeatureIndex,\n                geometryIndex\n              ) === false)\n                return false;\n              coordIndex++;\n            }\n            if (geomType === \"MultiLineString\") multiFeatureIndex++;\n            if (geomType === \"Polygon\") geometryIndex++;\n          }\n          if (geomType === \"Polygon\") multiFeatureIndex++;\n          break;\n        case \"MultiPolygon\":\n          for (j = 0; j < coords.length; j++) {\n            geometryIndex = 0;\n            for (k = 0; k < coords[j].length; k++) {\n              for (l = 0; l < coords[j][k].length - wrapShrink; l++) {\n                if (callback(\n                  coords[j][k][l],\n                  coordIndex,\n                  featureIndex,\n                  multiFeatureIndex,\n                  geometryIndex\n                ) === false)\n                  return false;\n                coordIndex++;\n              }\n              geometryIndex++;\n            }\n            multiFeatureIndex++;\n          }\n          break;\n        case \"GeometryCollection\":\n          for (j = 0; j < geometry.geometries.length; j++)\n            if (coordEach(geometry.geometries[j], callback, excludeWrapCoord) === false)\n              return false;\n          break;\n        default:\n          throw new Error(\"Unknown Geometry Type\");\n      }\n    }\n  }\n}\nfunction coordReduce(geojson, callback, initialValue, excludeWrapCoord) {\n  var previousValue = initialValue;\n  coordEach(\n    geojson,\n    function(currentCoord, coordIndex, featureIndex, multiFeatureIndex, geometryIndex) {\n      if (coordIndex === 0 && initialValue === void 0)\n        previousValue = currentCoord;\n      else\n        previousValue = callback(\n          previousValue,\n          currentCoord,\n          coordIndex,\n          featureIndex,\n          multiFeatureIndex,\n          geometryIndex\n        );\n    },\n    excludeWrapCoord\n  );\n  return previousValue;\n}\nfunction propEach(geojson, callback) {\n  var i;\n  switch (geojson.type) {\n    case \"FeatureCollection\":\n      for (i = 0; i < geojson.features.length; i++) {\n        if (callback(geojson.features[i].properties, i) === false) break;\n      }\n      break;\n    case \"Feature\":\n      callback(geojson.properties, 0);\n      break;\n  }\n}\nfunction propReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  propEach(geojson, function(currentProperties, featureIndex) {\n    if (featureIndex === 0 && initialValue === void 0)\n      previousValue = currentProperties;\n    else\n      previousValue = callback(previousValue, currentProperties, featureIndex);\n  });\n  return previousValue;\n}\nfunction featureEach(geojson, callback) {\n  if (geojson.type === \"Feature\") {\n    callback(geojson, 0);\n  } else if (geojson.type === \"FeatureCollection\") {\n    for (var i = 0; i < geojson.features.length; i++) {\n      if (callback(geojson.features[i], i) === false) break;\n    }\n  }\n}\nfunction featureReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  featureEach(geojson, function(currentFeature, featureIndex) {\n    if (featureIndex === 0 && initialValue === void 0)\n      previousValue = currentFeature;\n    else previousValue = callback(previousValue, currentFeature, featureIndex);\n  });\n  return previousValue;\n}\nfunction coordAll(geojson) {\n  var coords = [];\n  coordEach(geojson, function(coord) {\n    coords.push(coord);\n  });\n  return coords;\n}\nfunction geomEach(geojson, callback) {\n  var i, j, g, geometry, stopG, geometryMaybeCollection, isGeometryCollection, featureProperties, featureBBox, featureId, featureIndex = 0, isFeatureCollection = geojson.type === \"FeatureCollection\", isFeature = geojson.type === \"Feature\", stop = isFeatureCollection ? geojson.features.length : 1;\n  for (i = 0; i < stop; i++) {\n    geometryMaybeCollection = isFeatureCollection ? geojson.features[i].geometry : isFeature ? geojson.geometry : geojson;\n    featureProperties = isFeatureCollection ? geojson.features[i].properties : isFeature ? geojson.properties : {};\n    featureBBox = isFeatureCollection ? geojson.features[i].bbox : isFeature ? geojson.bbox : void 0;\n    featureId = isFeatureCollection ? geojson.features[i].id : isFeature ? geojson.id : void 0;\n    isGeometryCollection = geometryMaybeCollection ? geometryMaybeCollection.type === \"GeometryCollection\" : false;\n    stopG = isGeometryCollection ? geometryMaybeCollection.geometries.length : 1;\n    for (g = 0; g < stopG; g++) {\n      geometry = isGeometryCollection ? geometryMaybeCollection.geometries[g] : geometryMaybeCollection;\n      if (geometry === null) {\n        if (callback(\n          null,\n          featureIndex,\n          featureProperties,\n          featureBBox,\n          featureId\n        ) === false)\n          return false;\n        continue;\n      }\n      switch (geometry.type) {\n        case \"Point\":\n        case \"LineString\":\n        case \"MultiPoint\":\n        case \"Polygon\":\n        case \"MultiLineString\":\n        case \"MultiPolygon\": {\n          if (callback(\n            geometry,\n            featureIndex,\n            featureProperties,\n            featureBBox,\n            featureId\n          ) === false)\n            return false;\n          break;\n        }\n        case \"GeometryCollection\": {\n          for (j = 0; j < geometry.geometries.length; j++) {\n            if (callback(\n              geometry.geometries[j],\n              featureIndex,\n              featureProperties,\n              featureBBox,\n              featureId\n            ) === false)\n              return false;\n          }\n          break;\n        }\n        default:\n          throw new Error(\"Unknown Geometry Type\");\n      }\n    }\n    featureIndex++;\n  }\n}\nfunction geomReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  geomEach(\n    geojson,\n    function(currentGeometry, featureIndex, featureProperties, featureBBox, featureId) {\n      if (featureIndex === 0 && initialValue === void 0)\n        previousValue = currentGeometry;\n      else\n        previousValue = callback(\n          previousValue,\n          currentGeometry,\n          featureIndex,\n          featureProperties,\n          featureBBox,\n          featureId\n        );\n    }\n  );\n  return previousValue;\n}\nfunction flattenEach(geojson, callback) {\n  geomEach(geojson, function(geometry, featureIndex, properties, bbox, id) {\n    var type = geometry === null ? null : geometry.type;\n    switch (type) {\n      case null:\n      case \"Point\":\n      case \"LineString\":\n      case \"Polygon\":\n        if (callback(\n          feature(geometry, properties, { bbox, id }),\n          featureIndex,\n          0\n        ) === false)\n          return false;\n        return;\n    }\n    var geomType;\n    switch (type) {\n      case \"MultiPoint\":\n        geomType = \"Point\";\n        break;\n      case \"MultiLineString\":\n        geomType = \"LineString\";\n        break;\n      case \"MultiPolygon\":\n        geomType = \"Polygon\";\n        break;\n    }\n    for (var multiFeatureIndex = 0; multiFeatureIndex < geometry.coordinates.length; multiFeatureIndex++) {\n      var coordinate = geometry.coordinates[multiFeatureIndex];\n      var geom = {\n        type: geomType,\n        coordinates: coordinate\n      };\n      if (callback(feature(geom, properties), featureIndex, multiFeatureIndex) === false)\n        return false;\n    }\n  });\n}\nfunction flattenReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  flattenEach(\n    geojson,\n    function(currentFeature, featureIndex, multiFeatureIndex) {\n      if (featureIndex === 0 && multiFeatureIndex === 0 && initialValue === void 0)\n        previousValue = currentFeature;\n      else\n        previousValue = callback(\n          previousValue,\n          currentFeature,\n          featureIndex,\n          multiFeatureIndex\n        );\n    }\n  );\n  return previousValue;\n}\nfunction segmentEach(geojson, callback) {\n  flattenEach(geojson, function(feature2, featureIndex, multiFeatureIndex) {\n    var segmentIndex = 0;\n    if (!feature2.geometry) return;\n    var type = feature2.geometry.type;\n    if (type === \"Point\" || type === \"MultiPoint\") return;\n    var previousCoords;\n    var previousFeatureIndex = 0;\n    var previousMultiIndex = 0;\n    var prevGeomIndex = 0;\n    if (coordEach(\n      feature2,\n      function(currentCoord, coordIndex, featureIndexCoord, multiPartIndexCoord, geometryIndex) {\n        if (previousCoords === void 0 || featureIndex > previousFeatureIndex || multiPartIndexCoord > previousMultiIndex || geometryIndex > prevGeomIndex) {\n          previousCoords = currentCoord;\n          previousFeatureIndex = featureIndex;\n          previousMultiIndex = multiPartIndexCoord;\n          prevGeomIndex = geometryIndex;\n          segmentIndex = 0;\n          return;\n        }\n        var currentSegment = lineString(\n          [previousCoords, currentCoord],\n          feature2.properties\n        );\n        if (callback(\n          currentSegment,\n          featureIndex,\n          multiFeatureIndex,\n          geometryIndex,\n          segmentIndex\n        ) === false)\n          return false;\n        segmentIndex++;\n        previousCoords = currentCoord;\n      }\n    ) === false)\n      return false;\n  });\n}\nfunction segmentReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  var started = false;\n  segmentEach(\n    geojson,\n    function(currentSegment, featureIndex, multiFeatureIndex, geometryIndex, segmentIndex) {\n      if (started === false && initialValue === void 0)\n        previousValue = currentSegment;\n      else\n        previousValue = callback(\n          previousValue,\n          currentSegment,\n          featureIndex,\n          multiFeatureIndex,\n          geometryIndex,\n          segmentIndex\n        );\n      started = true;\n    }\n  );\n  return previousValue;\n}\nfunction lineEach(geojson, callback) {\n  if (!geojson) throw new Error(\"geojson is required\");\n  flattenEach(geojson, function(feature2, featureIndex, multiFeatureIndex) {\n    if (feature2.geometry === null) return;\n    var type = feature2.geometry.type;\n    var coords = feature2.geometry.coordinates;\n    switch (type) {\n      case \"LineString\":\n        if (callback(feature2, featureIndex, multiFeatureIndex, 0, 0) === false)\n          return false;\n        break;\n      case \"Polygon\":\n        for (var geometryIndex = 0; geometryIndex < coords.length; geometryIndex++) {\n          if (callback(\n            lineString(coords[geometryIndex], feature2.properties),\n            featureIndex,\n            multiFeatureIndex,\n            geometryIndex\n          ) === false)\n            return false;\n        }\n        break;\n    }\n  });\n}\nfunction lineReduce(geojson, callback, initialValue) {\n  var previousValue = initialValue;\n  lineEach(\n    geojson,\n    function(currentLine, featureIndex, multiFeatureIndex, geometryIndex) {\n      if (featureIndex === 0 && initialValue === void 0)\n        previousValue = currentLine;\n      else\n        previousValue = callback(\n          previousValue,\n          currentLine,\n          featureIndex,\n          multiFeatureIndex,\n          geometryIndex\n        );\n    }\n  );\n  return previousValue;\n}\nfunction findSegment(geojson, options) {\n  options = options || {};\n  if (!isObject(options)) throw new Error(\"options is invalid\");\n  var featureIndex = options.featureIndex || 0;\n  var multiFeatureIndex = options.multiFeatureIndex || 0;\n  var geometryIndex = options.geometryIndex || 0;\n  var segmentIndex = options.segmentIndex || 0;\n  var properties = options.properties;\n  var geometry;\n  switch (geojson.type) {\n    case \"FeatureCollection\":\n      if (featureIndex < 0)\n        featureIndex = geojson.features.length + featureIndex;\n      properties = properties || geojson.features[featureIndex].properties;\n      geometry = geojson.features[featureIndex].geometry;\n      break;\n    case \"Feature\":\n      properties = properties || geojson.properties;\n      geometry = geojson.geometry;\n      break;\n    case \"Point\":\n    case \"MultiPoint\":\n      return null;\n    case \"LineString\":\n    case \"Polygon\":\n    case \"MultiLineString\":\n    case \"MultiPolygon\":\n      geometry = geojson;\n      break;\n    default:\n      throw new Error(\"geojson is invalid\");\n  }\n  if (geometry === null) return null;\n  var coords = geometry.coordinates;\n  switch (geometry.type) {\n    case \"Point\":\n    case \"MultiPoint\":\n      return null;\n    case \"LineString\":\n      if (segmentIndex < 0) segmentIndex = coords.length + segmentIndex - 1;\n      return lineString(\n        [coords[segmentIndex], coords[segmentIndex + 1]],\n        properties,\n        options\n      );\n    case \"Polygon\":\n      if (geometryIndex < 0) geometryIndex = coords.length + geometryIndex;\n      if (segmentIndex < 0)\n        segmentIndex = coords[geometryIndex].length + segmentIndex - 1;\n      return lineString(\n        [\n          coords[geometryIndex][segmentIndex],\n          coords[geometryIndex][segmentIndex + 1]\n        ],\n        properties,\n        options\n      );\n    case \"MultiLineString\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      if (segmentIndex < 0)\n        segmentIndex = coords[multiFeatureIndex].length + segmentIndex - 1;\n      return lineString(\n        [\n          coords[multiFeatureIndex][segmentIndex],\n          coords[multiFeatureIndex][segmentIndex + 1]\n        ],\n        properties,\n        options\n      );\n    case \"MultiPolygon\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      if (geometryIndex < 0)\n        geometryIndex = coords[multiFeatureIndex].length + geometryIndex;\n      if (segmentIndex < 0)\n        segmentIndex = coords[multiFeatureIndex][geometryIndex].length - segmentIndex - 1;\n      return lineString(\n        [\n          coords[multiFeatureIndex][geometryIndex][segmentIndex],\n          coords[multiFeatureIndex][geometryIndex][segmentIndex + 1]\n        ],\n        properties,\n        options\n      );\n  }\n  throw new Error(\"geojson is invalid\");\n}\nfunction findPoint(geojson, options) {\n  options = options || {};\n  if (!isObject(options)) throw new Error(\"options is invalid\");\n  var featureIndex = options.featureIndex || 0;\n  var multiFeatureIndex = options.multiFeatureIndex || 0;\n  var geometryIndex = options.geometryIndex || 0;\n  var coordIndex = options.coordIndex || 0;\n  var properties = options.properties;\n  var geometry;\n  switch (geojson.type) {\n    case \"FeatureCollection\":\n      if (featureIndex < 0)\n        featureIndex = geojson.features.length + featureIndex;\n      properties = properties || geojson.features[featureIndex].properties;\n      geometry = geojson.features[featureIndex].geometry;\n      break;\n    case \"Feature\":\n      properties = properties || geojson.properties;\n      geometry = geojson.geometry;\n      break;\n    case \"Point\":\n    case \"MultiPoint\":\n      return null;\n    case \"LineString\":\n    case \"Polygon\":\n    case \"MultiLineString\":\n    case \"MultiPolygon\":\n      geometry = geojson;\n      break;\n    default:\n      throw new Error(\"geojson is invalid\");\n  }\n  if (geometry === null) return null;\n  var coords = geometry.coordinates;\n  switch (geometry.type) {\n    case \"Point\":\n      return point(coords, properties, options);\n    case \"MultiPoint\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      return point(coords[multiFeatureIndex], properties, options);\n    case \"LineString\":\n      if (coordIndex < 0) coordIndex = coords.length + coordIndex;\n      return point(coords[coordIndex], properties, options);\n    case \"Polygon\":\n      if (geometryIndex < 0) geometryIndex = coords.length + geometryIndex;\n      if (coordIndex < 0)\n        coordIndex = coords[geometryIndex].length + coordIndex;\n      return point(coords[geometryIndex][coordIndex], properties, options);\n    case \"MultiLineString\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      if (coordIndex < 0)\n        coordIndex = coords[multiFeatureIndex].length + coordIndex;\n      return point(coords[multiFeatureIndex][coordIndex], properties, options);\n    case \"MultiPolygon\":\n      if (multiFeatureIndex < 0)\n        multiFeatureIndex = coords.length + multiFeatureIndex;\n      if (geometryIndex < 0)\n        geometryIndex = coords[multiFeatureIndex].length + geometryIndex;\n      if (coordIndex < 0)\n        coordIndex = coords[multiFeatureIndex][geometryIndex].length - coordIndex;\n      return point(\n        coords[multiFeatureIndex][geometryIndex][coordIndex],\n        properties,\n        options\n      );\n  }\n  throw new Error(\"geojson is invalid\");\n}\nexport {\n  coordAll,\n  coordEach,\n  coordReduce,\n  featureEach,\n  featureReduce,\n  findPoint,\n  findSegment,\n  flattenEach,\n  flattenReduce,\n  geomEach,\n  geomReduce,\n  lineEach,\n  lineReduce,\n  propEach,\n  propReduce,\n  segmentEach,\n  segmentReduce\n};\n//# sourceMappingURL=index.js.map","// index.ts\nimport { coordEach } from \"@turf/meta\";\nfunction bbox(geojson, options = {}) {\n  if (geojson.bbox != null && true !== options.recompute) {\n    return geojson.bbox;\n  }\n  const result = [Infinity, Infinity, -Infinity, -Infinity];\n  coordEach(geojson, (coord) => {\n    if (result[0] > coord[0]) {\n      result[0] = coord[0];\n    }\n    if (result[1] > coord[1]) {\n      result[1] = coord[1];\n    }\n    if (result[2] < coord[0]) {\n      result[2] = coord[0];\n    }\n    if (result[3] < coord[1]) {\n      result[3] = coord[1];\n    }\n  });\n  return result;\n}\nvar turf_bbox_default = bbox;\nexport {\n  bbox,\n  turf_bbox_default as default\n};\n//# sourceMappingURL=index.js.map","/*\r\n *      bignumber.js v9.1.2\r\n *      A JavaScript library for arbitrary-precision arithmetic.\r\n *      https://github.com/MikeMcl/bignumber.js\r\n *      Copyright (c) 2022 Michael Mclaughlin <M8ch88l@gmail.com>\r\n *      MIT Licensed.\r\n *\r\n *      BigNumber.prototype methods     |  BigNumber methods\r\n *                                      |\r\n *      absoluteValue            abs    |  clone\r\n *      comparedTo                      |  config               set\r\n *      decimalPlaces            dp     |      DECIMAL_PLACES\r\n *      dividedBy                div    |      ROUNDING_MODE\r\n *      dividedToIntegerBy       idiv   |      EXPONENTIAL_AT\r\n *      exponentiatedBy          pow    |      RANGE\r\n *      integerValue                    |      CRYPTO\r\n *      isEqualTo                eq     |      MODULO_MODE\r\n *      isFinite                        |      POW_PRECISION\r\n *      isGreaterThan            gt     |      FORMAT\r\n *      isGreaterThanOrEqualTo   gte    |      ALPHABET\r\n *      isInteger                       |  isBigNumber\r\n *      isLessThan               lt     |  maximum              max\r\n *      isLessThanOrEqualTo      lte    |  minimum              min\r\n *      isNaN                           |  random\r\n *      isNegative                      |  sum\r\n *      isPositive                      |\r\n *      isZero                          |\r\n *      minus                           |\r\n *      modulo                   mod    |\r\n *      multipliedBy             times  |\r\n *      negated                         |\r\n *      plus                            |\r\n *      precision                sd     |\r\n *      shiftedBy                       |\r\n *      squareRoot               sqrt   |\r\n *      toExponential                   |\r\n *      toFixed                         |\r\n *      toFormat                        |\r\n *      toFraction                      |\r\n *      toJSON                          |\r\n *      toNumber                        |\r\n *      toPrecision                     |\r\n *      toString                        |\r\n *      valueOf                         |\r\n *\r\n */\r\n\r\n\r\nvar\r\n  isNumeric = /^-?(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:e[+-]?\\d+)?$/i,\r\n  mathceil = Math.ceil,\r\n  mathfloor = Math.floor,\r\n\r\n  bignumberError = '[BigNumber Error] ',\r\n  tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ',\r\n\r\n  BASE = 1e14,\r\n  LOG_BASE = 14,\r\n  MAX_SAFE_INTEGER = 0x1fffffffffffff,         // 2^53 - 1\r\n  // MAX_INT32 = 0x7fffffff,                   // 2^31 - 1\r\n  POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],\r\n  SQRT_BASE = 1e7,\r\n\r\n  // EDITABLE\r\n  // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and\r\n  // the arguments to toExponential, toFixed, toFormat, and toPrecision.\r\n  MAX = 1E9;                                   // 0 to MAX_INT32\r\n\r\n\r\n/*\r\n * Create and return a BigNumber constructor.\r\n */\r\nfunction clone(configObject) {\r\n  var div, convertBase, parseNumeric,\r\n    P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },\r\n    ONE = new BigNumber(1),\r\n\r\n\r\n    //----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------\r\n\r\n\r\n    // The default values below must be integers within the inclusive ranges stated.\r\n    // The values can also be changed at run-time using BigNumber.set.\r\n\r\n    // The maximum number of decimal places for operations involving division.\r\n    DECIMAL_PLACES = 20,                     // 0 to MAX\r\n\r\n    // The rounding mode used when rounding to the above decimal places, and when using\r\n    // toExponential, toFixed, toFormat and toPrecision, and round (default value).\r\n    // UP         0 Away from zero.\r\n    // DOWN       1 Towards zero.\r\n    // CEIL       2 Towards +Infinity.\r\n    // FLOOR      3 Towards -Infinity.\r\n    // HALF_UP    4 Towards nearest neighbour. If equidistant, up.\r\n    // HALF_DOWN  5 Towards nearest neighbour. If equidistant, down.\r\n    // HALF_EVEN  6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n    // HALF_CEIL  7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n    // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n    ROUNDING_MODE = 4,                       // 0 to 8\r\n\r\n    // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]\r\n\r\n    // The exponent value at and beneath which toString returns exponential notation.\r\n    // Number type: -7\r\n    TO_EXP_NEG = -7,                         // 0 to -MAX\r\n\r\n    // The exponent value at and above which toString returns exponential notation.\r\n    // Number type: 21\r\n    TO_EXP_POS = 21,                         // 0 to MAX\r\n\r\n    // RANGE : [MIN_EXP, MAX_EXP]\r\n\r\n    // The minimum exponent value, beneath which underflow to zero occurs.\r\n    // Number type: -324  (5e-324)\r\n    MIN_EXP = -1e7,                          // -1 to -MAX\r\n\r\n    // The maximum exponent value, above which overflow to Infinity occurs.\r\n    // Number type:  308  (1.7976931348623157e+308)\r\n    // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.\r\n    MAX_EXP = 1e7,                           // 1 to MAX\r\n\r\n    // Whether to use cryptographically-secure random number generation, if available.\r\n    CRYPTO = false,                          // true or false\r\n\r\n    // The modulo mode used when calculating the modulus: a mod n.\r\n    // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n    // The remainder (r) is calculated as: r = a - n * q.\r\n    //\r\n    // UP        0 The remainder is positive if the dividend is negative, else is negative.\r\n    // DOWN      1 The remainder has the same sign as the dividend.\r\n    //             This modulo mode is commonly known as 'truncated division' and is\r\n    //             equivalent to (a % n) in JavaScript.\r\n    // FLOOR     3 The remainder has the same sign as the divisor (Python %).\r\n    // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.\r\n    // EUCLID    9 Euclidian division. q = sign(n) * floor(a / abs(n)).\r\n    //             The remainder is always positive.\r\n    //\r\n    // The truncated division, floored division, Euclidian division and IEEE 754 remainder\r\n    // modes are commonly used for the modulus operation.\r\n    // Although the other rounding modes can also be used, they may not give useful results.\r\n    MODULO_MODE = 1,                         // 0 to 9\r\n\r\n    // The maximum number of significant digits of the result of the exponentiatedBy operation.\r\n    // If POW_PRECISION is 0, there will be unlimited significant digits.\r\n    POW_PRECISION = 0,                       // 0 to MAX\r\n\r\n    // The format specification used by the BigNumber.prototype.toFormat method.\r\n    FORMAT = {\r\n      prefix: '',\r\n      groupSize: 3,\r\n      secondaryGroupSize: 0,\r\n      groupSeparator: ',',\r\n      decimalSeparator: '.',\r\n      fractionGroupSize: 0,\r\n      fractionGroupSeparator: '\\xA0',        // non-breaking space\r\n      suffix: ''\r\n    },\r\n\r\n    // The alphabet used for base conversion. It must be at least 2 characters long, with no '+',\r\n    // '-', '.', whitespace, or repeated character.\r\n    // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'\r\n    ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz',\r\n    alphabetHasNormalDecimalDigits = true;\r\n\r\n\r\n  //------------------------------------------------------------------------------------------\r\n\r\n\r\n  // CONSTRUCTOR\r\n\r\n\r\n  /*\r\n   * The BigNumber constructor and exported function.\r\n   * Create and return a new instance of a BigNumber object.\r\n   *\r\n   * v {number|string|BigNumber} A numeric value.\r\n   * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.\r\n   */\r\n  function BigNumber(v, b) {\r\n    var alphabet, c, caseChanged, e, i, isNum, len, str,\r\n      x = this;\r\n\r\n    // Enable constructor call without `new`.\r\n    if (!(x instanceof BigNumber)) return new BigNumber(v, b);\r\n\r\n    if (b == null) {\r\n\r\n      if (v && v._isBigNumber === true) {\r\n        x.s = v.s;\r\n\r\n        if (!v.c || v.e > MAX_EXP) {\r\n          x.c = x.e = null;\r\n        } else if (v.e < MIN_EXP) {\r\n          x.c = [x.e = 0];\r\n        } else {\r\n          x.e = v.e;\r\n          x.c = v.c.slice();\r\n        }\r\n\r\n        return;\r\n      }\r\n\r\n      if ((isNum = typeof v == 'number') && v * 0 == 0) {\r\n\r\n        // Use `1 / n` to handle minus zero also.\r\n        x.s = 1 / v < 0 ? (v = -v, -1) : 1;\r\n\r\n        // Fast path for integers, where n < 2147483648 (2**31).\r\n        if (v === ~~v) {\r\n          for (e = 0, i = v; i >= 10; i /= 10, e++);\r\n\r\n          if (e > MAX_EXP) {\r\n            x.c = x.e = null;\r\n          } else {\r\n            x.e = e;\r\n            x.c = [v];\r\n          }\r\n\r\n          return;\r\n        }\r\n\r\n        str = String(v);\r\n      } else {\r\n\r\n        if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum);\r\n\r\n        x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;\r\n      }\r\n\r\n      // Decimal point?\r\n      if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n      // Exponential form?\r\n      if ((i = str.search(/e/i)) > 0) {\r\n\r\n        // Determine exponent.\r\n        if (e < 0) e = i;\r\n        e += +str.slice(i + 1);\r\n        str = str.substring(0, i);\r\n      } else if (e < 0) {\r\n\r\n        // Integer.\r\n        e = str.length;\r\n      }\r\n\r\n    } else {\r\n\r\n      // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n      intCheck(b, 2, ALPHABET.length, 'Base');\r\n\r\n      // Allow exponential notation to be used with base 10 argument, while\r\n      // also rounding to DECIMAL_PLACES as with other bases.\r\n      if (b == 10 && alphabetHasNormalDecimalDigits) {\r\n        x = new BigNumber(v);\r\n        return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);\r\n      }\r\n\r\n      str = String(v);\r\n\r\n      if (isNum = typeof v == 'number') {\r\n\r\n        // Avoid potential interpretation of Infinity and NaN as base 44+ values.\r\n        if (v * 0 != 0) return parseNumeric(x, str, isNum, b);\r\n\r\n        x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1;\r\n\r\n        // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n        if (BigNumber.DEBUG && str.replace(/^0\\.0*|\\./, '').length > 15) {\r\n          throw Error\r\n           (tooManyDigits + v);\r\n        }\r\n      } else {\r\n        x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;\r\n      }\r\n\r\n      alphabet = ALPHABET.slice(0, b);\r\n      e = i = 0;\r\n\r\n      // Check that str is a valid base b number.\r\n      // Don't use RegExp, so alphabet can contain special characters.\r\n      for (len = str.length; i < len; i++) {\r\n        if (alphabet.indexOf(c = str.charAt(i)) < 0) {\r\n          if (c == '.') {\r\n\r\n            // If '.' is not the first character and it has not be found before.\r\n            if (i > e) {\r\n              e = len;\r\n              continue;\r\n            }\r\n          } else if (!caseChanged) {\r\n\r\n            // Allow e.g. hexadecimal 'FF' as well as 'ff'.\r\n            if (str == str.toUpperCase() && (str = str.toLowerCase()) ||\r\n                str == str.toLowerCase() && (str = str.toUpperCase())) {\r\n              caseChanged = true;\r\n              i = -1;\r\n              e = 0;\r\n              continue;\r\n            }\r\n          }\r\n\r\n          return parseNumeric(x, String(v), isNum, b);\r\n        }\r\n      }\r\n\r\n      // Prevent later check for length on converted number.\r\n      isNum = false;\r\n      str = convertBase(str, b, 10, x.s);\r\n\r\n      // Decimal point?\r\n      if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n      else e = str.length;\r\n    }\r\n\r\n    // Determine leading zeros.\r\n    for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n    // Determine trailing zeros.\r\n    for (len = str.length; str.charCodeAt(--len) === 48;);\r\n\r\n    if (str = str.slice(i, ++len)) {\r\n      len -= i;\r\n\r\n      // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n      if (isNum && BigNumber.DEBUG &&\r\n        len > 15 && (v > MAX_SAFE_INTEGER || v !== mathfloor(v))) {\r\n          throw Error\r\n           (tooManyDigits + (x.s * v));\r\n      }\r\n\r\n       // Overflow?\r\n      if ((e = e - i - 1) > MAX_EXP) {\r\n\r\n        // Infinity.\r\n        x.c = x.e = null;\r\n\r\n      // Underflow?\r\n      } else if (e < MIN_EXP) {\r\n\r\n        // Zero.\r\n        x.c = [x.e = 0];\r\n      } else {\r\n        x.e = e;\r\n        x.c = [];\r\n\r\n        // Transform base\r\n\r\n        // e is the base 10 exponent.\r\n        // i is where to slice str to get the first element of the coefficient array.\r\n        i = (e + 1) % LOG_BASE;\r\n        if (e < 0) i += LOG_BASE;  // i < 1\r\n\r\n        if (i < len) {\r\n          if (i) x.c.push(+str.slice(0, i));\r\n\r\n          for (len -= LOG_BASE; i < len;) {\r\n            x.c.push(+str.slice(i, i += LOG_BASE));\r\n          }\r\n\r\n          i = LOG_BASE - (str = str.slice(i)).length;\r\n        } else {\r\n          i -= len;\r\n        }\r\n\r\n        for (; i--; str += '0');\r\n        x.c.push(+str);\r\n      }\r\n    } else {\r\n\r\n      // Zero.\r\n      x.c = [x.e = 0];\r\n    }\r\n  }\r\n\r\n\r\n  // CONSTRUCTOR PROPERTIES\r\n\r\n\r\n  BigNumber.clone = clone;\r\n\r\n  BigNumber.ROUND_UP = 0;\r\n  BigNumber.ROUND_DOWN = 1;\r\n  BigNumber.ROUND_CEIL = 2;\r\n  BigNumber.ROUND_FLOOR = 3;\r\n  BigNumber.ROUND_HALF_UP = 4;\r\n  BigNumber.ROUND_HALF_DOWN = 5;\r\n  BigNumber.ROUND_HALF_EVEN = 6;\r\n  BigNumber.ROUND_HALF_CEIL = 7;\r\n  BigNumber.ROUND_HALF_FLOOR = 8;\r\n  BigNumber.EUCLID = 9;\r\n\r\n\r\n  /*\r\n   * Configure infrequently-changing library-wide settings.\r\n   *\r\n   * Accept an object with the following optional properties (if the value of a property is\r\n   * a number, it must be an integer within the inclusive range stated):\r\n   *\r\n   *   DECIMAL_PLACES   {number}           0 to MAX\r\n   *   ROUNDING_MODE    {number}           0 to 8\r\n   *   EXPONENTIAL_AT   {number|number[]}  -MAX to MAX  or  [-MAX to 0, 0 to MAX]\r\n   *   RANGE            {number|number[]}  -MAX to MAX (not zero)  or  [-MAX to -1, 1 to MAX]\r\n   *   CRYPTO           {boolean}          true or false\r\n   *   MODULO_MODE      {number}           0 to 9\r\n   *   POW_PRECISION       {number}           0 to MAX\r\n   *   ALPHABET         {string}           A string of two or more unique characters which does\r\n   *                                       not contain '.'.\r\n   *   FORMAT           {object}           An object with some of the following properties:\r\n   *     prefix                 {string}\r\n   *     groupSize              {number}\r\n   *     secondaryGroupSize     {number}\r\n   *     groupSeparator         {string}\r\n   *     decimalSeparator       {string}\r\n   *     fractionGroupSize      {number}\r\n   *     fractionGroupSeparator {string}\r\n   *     suffix                 {string}\r\n   *\r\n   * (The values assigned to the above FORMAT object properties are not checked for validity.)\r\n   *\r\n   * E.g.\r\n   * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })\r\n   *\r\n   * Ignore properties/parameters set to null or undefined, except for ALPHABET.\r\n   *\r\n   * Return an object with the properties current values.\r\n   */\r\n  BigNumber.config = BigNumber.set = function (obj) {\r\n    var p, v;\r\n\r\n    if (obj != null) {\r\n\r\n      if (typeof obj == 'object') {\r\n\r\n        // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.\r\n        // '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}'\r\n        if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {\r\n          v = obj[p];\r\n          intCheck(v, 0, MAX, p);\r\n          DECIMAL_PLACES = v;\r\n        }\r\n\r\n        // ROUNDING_MODE {number} Integer, 0 to 8 inclusive.\r\n        // '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n        if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {\r\n          v = obj[p];\r\n          intCheck(v, 0, 8, p);\r\n          ROUNDING_MODE = v;\r\n        }\r\n\r\n        // EXPONENTIAL_AT {number|number[]}\r\n        // Integer, -MAX to MAX inclusive or\r\n        // [integer -MAX to 0 inclusive, 0 to MAX inclusive].\r\n        // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}'\r\n        if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {\r\n          v = obj[p];\r\n          if (v && v.pop) {\r\n            intCheck(v[0], -MAX, 0, p);\r\n            intCheck(v[1], 0, MAX, p);\r\n            TO_EXP_NEG = v[0];\r\n            TO_EXP_POS = v[1];\r\n          } else {\r\n            intCheck(v, -MAX, MAX, p);\r\n            TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);\r\n          }\r\n        }\r\n\r\n        // RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or\r\n        // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].\r\n        // '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}'\r\n        if (obj.hasOwnProperty(p = 'RANGE')) {\r\n          v = obj[p];\r\n          if (v && v.pop) {\r\n            intCheck(v[0], -MAX, -1, p);\r\n            intCheck(v[1], 1, MAX, p);\r\n            MIN_EXP = v[0];\r\n            MAX_EXP = v[1];\r\n          } else {\r\n            intCheck(v, -MAX, MAX, p);\r\n            if (v) {\r\n              MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);\r\n            } else {\r\n              throw Error\r\n               (bignumberError + p + ' cannot be zero: ' + v);\r\n            }\r\n          }\r\n        }\r\n\r\n        // CRYPTO {boolean} true or false.\r\n        // '[BigNumber Error] CRYPTO not true or false: {v}'\r\n        // '[BigNumber Error] crypto unavailable'\r\n        if (obj.hasOwnProperty(p = 'CRYPTO')) {\r\n          v = obj[p];\r\n          if (v === !!v) {\r\n            if (v) {\r\n              if (typeof crypto != 'undefined' && crypto &&\r\n               (crypto.getRandomValues || crypto.randomBytes)) {\r\n                CRYPTO = v;\r\n              } else {\r\n                CRYPTO = !v;\r\n                throw Error\r\n                 (bignumberError + 'crypto unavailable');\r\n              }\r\n            } else {\r\n              CRYPTO = v;\r\n            }\r\n          } else {\r\n            throw Error\r\n             (bignumberError + p + ' not true or false: ' + v);\r\n          }\r\n        }\r\n\r\n        // MODULO_MODE {number} Integer, 0 to 9 inclusive.\r\n        // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n        if (obj.hasOwnProperty(p = 'MODULO_MODE')) {\r\n          v = obj[p];\r\n          intCheck(v, 0, 9, p);\r\n          MODULO_MODE = v;\r\n        }\r\n\r\n        // POW_PRECISION {number} Integer, 0 to MAX inclusive.\r\n        // '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}'\r\n        if (obj.hasOwnProperty(p = 'POW_PRECISION')) {\r\n          v = obj[p];\r\n          intCheck(v, 0, MAX, p);\r\n          POW_PRECISION = v;\r\n        }\r\n\r\n        // FORMAT {object}\r\n        // '[BigNumber Error] FORMAT not an object: {v}'\r\n        if (obj.hasOwnProperty(p = 'FORMAT')) {\r\n          v = obj[p];\r\n          if (typeof v == 'object') FORMAT = v;\r\n          else throw Error\r\n           (bignumberError + p + ' not an object: ' + v);\r\n        }\r\n\r\n        // ALPHABET {string}\r\n        // '[BigNumber Error] ALPHABET invalid: {v}'\r\n        if (obj.hasOwnProperty(p = 'ALPHABET')) {\r\n          v = obj[p];\r\n\r\n          // Disallow if less than two characters,\r\n          // or if it contains '+', '-', '.', whitespace, or a repeated character.\r\n          if (typeof v == 'string' && !/^.?$|[+\\-.\\s]|(.).*\\1/.test(v)) {\r\n            alphabetHasNormalDecimalDigits = v.slice(0, 10) == '0123456789';\r\n            ALPHABET = v;\r\n          } else {\r\n            throw Error\r\n             (bignumberError + p + ' invalid: ' + v);\r\n          }\r\n        }\r\n\r\n      } else {\r\n\r\n        // '[BigNumber Error] Object expected: {v}'\r\n        throw Error\r\n         (bignumberError + 'Object expected: ' + obj);\r\n      }\r\n    }\r\n\r\n    return {\r\n      DECIMAL_PLACES: DECIMAL_PLACES,\r\n      ROUNDING_MODE: ROUNDING_MODE,\r\n      EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],\r\n      RANGE: [MIN_EXP, MAX_EXP],\r\n      CRYPTO: CRYPTO,\r\n      MODULO_MODE: MODULO_MODE,\r\n      POW_PRECISION: POW_PRECISION,\r\n      FORMAT: FORMAT,\r\n      ALPHABET: ALPHABET\r\n    };\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if v is a BigNumber instance, otherwise return false.\r\n   *\r\n   * If BigNumber.DEBUG is true, throw if a BigNumber instance is not well-formed.\r\n   *\r\n   * v {any}\r\n   *\r\n   * '[BigNumber Error] Invalid BigNumber: {v}'\r\n   */\r\n  BigNumber.isBigNumber = function (v) {\r\n    if (!v || v._isBigNumber !== true) return false;\r\n    if (!BigNumber.DEBUG) return true;\r\n\r\n    var i, n,\r\n      c = v.c,\r\n      e = v.e,\r\n      s = v.s;\r\n\r\n    out: if ({}.toString.call(c) == '[object Array]') {\r\n\r\n      if ((s === 1 || s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) {\r\n\r\n        // If the first element is zero, the BigNumber value must be zero.\r\n        if (c[0] === 0) {\r\n          if (e === 0 && c.length === 1) return true;\r\n          break out;\r\n        }\r\n\r\n        // Calculate number of digits that c[0] should have, based on the exponent.\r\n        i = (e + 1) % LOG_BASE;\r\n        if (i < 1) i += LOG_BASE;\r\n\r\n        // Calculate number of digits of c[0].\r\n        //if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) == i) {\r\n        if (String(c[0]).length == i) {\r\n\r\n          for (i = 0; i < c.length; i++) {\r\n            n = c[i];\r\n            if (n < 0 || n >= BASE || n !== mathfloor(n)) break out;\r\n          }\r\n\r\n          // Last element cannot be zero, unless it is the only element.\r\n          if (n !== 0) return true;\r\n        }\r\n      }\r\n\r\n    // Infinity/NaN\r\n    } else if (c === null && e === null && (s === null || s === 1 || s === -1)) {\r\n      return true;\r\n    }\r\n\r\n    throw Error\r\n      (bignumberError + 'Invalid BigNumber: ' + v);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new BigNumber whose value is the maximum of the arguments.\r\n   *\r\n   * arguments {number|string|BigNumber}\r\n   */\r\n  BigNumber.maximum = BigNumber.max = function () {\r\n    return maxOrMin(arguments, -1);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new BigNumber whose value is the minimum of the arguments.\r\n   *\r\n   * arguments {number|string|BigNumber}\r\n   */\r\n  BigNumber.minimum = BigNumber.min = function () {\r\n    return maxOrMin(arguments, 1);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new BigNumber with a random value equal to or greater than 0 and less than 1,\r\n   * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing\r\n   * zeros are produced).\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}'\r\n   * '[BigNumber Error] crypto unavailable'\r\n   */\r\n  BigNumber.random = (function () {\r\n    var pow2_53 = 0x20000000000000;\r\n\r\n    // Return a 53 bit integer n, where 0 <= n < 9007199254740992.\r\n    // Check if Math.random() produces more than 32 bits of randomness.\r\n    // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.\r\n    // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.\r\n    var random53bitInt = (Math.random() * pow2_53) & 0x1fffff\r\n     ? function () { return mathfloor(Math.random() * pow2_53); }\r\n     : function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) +\r\n       (Math.random() * 0x800000 | 0); };\r\n\r\n    return function (dp) {\r\n      var a, b, e, k, v,\r\n        i = 0,\r\n        c = [],\r\n        rand = new BigNumber(ONE);\r\n\r\n      if (dp == null) dp = DECIMAL_PLACES;\r\n      else intCheck(dp, 0, MAX);\r\n\r\n      k = mathceil(dp / LOG_BASE);\r\n\r\n      if (CRYPTO) {\r\n\r\n        // Browsers supporting crypto.getRandomValues.\r\n        if (crypto.getRandomValues) {\r\n\r\n          a = crypto.getRandomValues(new Uint32Array(k *= 2));\r\n\r\n          for (; i < k;) {\r\n\r\n            // 53 bits:\r\n            // ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2)\r\n            // 11111 11111111 11111111 11111111 11100000 00000000 00000000\r\n            // ((Math.pow(2, 32) - 1) >>> 11).toString(2)\r\n            //                                     11111 11111111 11111111\r\n            // 0x20000 is 2^21.\r\n            v = a[i] * 0x20000 + (a[i + 1] >>> 11);\r\n\r\n            // Rejection sampling:\r\n            // 0 <= v < 9007199254740992\r\n            // Probability that v >= 9e15, is\r\n            // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251\r\n            if (v >= 9e15) {\r\n              b = crypto.getRandomValues(new Uint32Array(2));\r\n              a[i] = b[0];\r\n              a[i + 1] = b[1];\r\n            } else {\r\n\r\n              // 0 <= v <= 8999999999999999\r\n              // 0 <= (v % 1e14) <= 99999999999999\r\n              c.push(v % 1e14);\r\n              i += 2;\r\n            }\r\n          }\r\n          i = k / 2;\r\n\r\n        // Node.js supporting crypto.randomBytes.\r\n        } else if (crypto.randomBytes) {\r\n\r\n          // buffer\r\n          a = crypto.randomBytes(k *= 7);\r\n\r\n          for (; i < k;) {\r\n\r\n            // 0x1000000000000 is 2^48, 0x10000000000 is 2^40\r\n            // 0x100000000 is 2^32, 0x1000000 is 2^24\r\n            // 11111 11111111 11111111 11111111 11111111 11111111 11111111\r\n            // 0 <= v < 9007199254740992\r\n            v = ((a[i] & 31) * 0x1000000000000) + (a[i + 1] * 0x10000000000) +\r\n               (a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +\r\n               (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];\r\n\r\n            if (v >= 9e15) {\r\n              crypto.randomBytes(7).copy(a, i);\r\n            } else {\r\n\r\n              // 0 <= (v % 1e14) <= 99999999999999\r\n              c.push(v % 1e14);\r\n              i += 7;\r\n            }\r\n          }\r\n          i = k / 7;\r\n        } else {\r\n          CRYPTO = false;\r\n          throw Error\r\n           (bignumberError + 'crypto unavailable');\r\n        }\r\n      }\r\n\r\n      // Use Math.random.\r\n      if (!CRYPTO) {\r\n\r\n        for (; i < k;) {\r\n          v = random53bitInt();\r\n          if (v < 9e15) c[i++] = v % 1e14;\r\n        }\r\n      }\r\n\r\n      k = c[--i];\r\n      dp %= LOG_BASE;\r\n\r\n      // Convert trailing digits to zeros according to dp.\r\n      if (k && dp) {\r\n        v = POWS_TEN[LOG_BASE - dp];\r\n        c[i] = mathfloor(k / v) * v;\r\n      }\r\n\r\n      // Remove trailing elements which are zero.\r\n      for (; c[i] === 0; c.pop(), i--);\r\n\r\n      // Zero?\r\n      if (i < 0) {\r\n        c = [e = 0];\r\n      } else {\r\n\r\n        // Remove leading elements which are zero and adjust exponent accordingly.\r\n        for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);\r\n\r\n        // Count the digits of the first element of c to determine leading zeros, and...\r\n        for (i = 1, v = c[0]; v >= 10; v /= 10, i++);\r\n\r\n        // adjust the exponent accordingly.\r\n        if (i < LOG_BASE) e -= LOG_BASE - i;\r\n      }\r\n\r\n      rand.e = e;\r\n      rand.c = c;\r\n      return rand;\r\n    };\r\n  })();\r\n\r\n\r\n   /*\r\n   * Return a BigNumber whose value is the sum of the arguments.\r\n   *\r\n   * arguments {number|string|BigNumber}\r\n   */\r\n  BigNumber.sum = function () {\r\n    var i = 1,\r\n      args = arguments,\r\n      sum = new BigNumber(args[0]);\r\n    for (; i < args.length;) sum = sum.plus(args[i++]);\r\n    return sum;\r\n  };\r\n\r\n\r\n  // PRIVATE FUNCTIONS\r\n\r\n\r\n  // Called by BigNumber and BigNumber.prototype.toString.\r\n  convertBase = (function () {\r\n    var decimal = '0123456789';\r\n\r\n    /*\r\n     * Convert string of baseIn to an array of numbers of baseOut.\r\n     * Eg. toBaseOut('255', 10, 16) returns [15, 15].\r\n     * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].\r\n     */\r\n    function toBaseOut(str, baseIn, baseOut, alphabet) {\r\n      var j,\r\n        arr = [0],\r\n        arrL,\r\n        i = 0,\r\n        len = str.length;\r\n\r\n      for (; i < len;) {\r\n        for (arrL = arr.length; arrL--; arr[arrL] *= baseIn);\r\n\r\n        arr[0] += alphabet.indexOf(str.charAt(i++));\r\n\r\n        for (j = 0; j < arr.length; j++) {\r\n\r\n          if (arr[j] > baseOut - 1) {\r\n            if (arr[j + 1] == null) arr[j + 1] = 0;\r\n            arr[j + 1] += arr[j] / baseOut | 0;\r\n            arr[j] %= baseOut;\r\n          }\r\n        }\r\n      }\r\n\r\n      return arr.reverse();\r\n    }\r\n\r\n    // Convert a numeric string of baseIn to a numeric string of baseOut.\r\n    // If the caller is toString, we are converting from base 10 to baseOut.\r\n    // If the caller is BigNumber, we are converting from baseIn to base 10.\r\n    return function (str, baseIn, baseOut, sign, callerIsToString) {\r\n      var alphabet, d, e, k, r, x, xc, y,\r\n        i = str.indexOf('.'),\r\n        dp = DECIMAL_PLACES,\r\n        rm = ROUNDING_MODE;\r\n\r\n      // Non-integer.\r\n      if (i >= 0) {\r\n        k = POW_PRECISION;\r\n\r\n        // Unlimited precision.\r\n        POW_PRECISION = 0;\r\n        str = str.replace('.', '');\r\n        y = new BigNumber(baseIn);\r\n        x = y.pow(str.length - i);\r\n        POW_PRECISION = k;\r\n\r\n        // Convert str as if an integer, then restore the fraction part by dividing the\r\n        // result by its base raised to a power.\r\n\r\n        y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'),\r\n         10, baseOut, decimal);\r\n        y.e = y.c.length;\r\n      }\r\n\r\n      // Convert the number as integer.\r\n\r\n      xc = toBaseOut(str, baseIn, baseOut, callerIsToString\r\n       ? (alphabet = ALPHABET, decimal)\r\n       : (alphabet = decimal, ALPHABET));\r\n\r\n      // xc now represents str as an integer and converted to baseOut. e is the exponent.\r\n      e = k = xc.length;\r\n\r\n      // Remove trailing zeros.\r\n      for (; xc[--k] == 0; xc.pop());\r\n\r\n      // Zero?\r\n      if (!xc[0]) return alphabet.charAt(0);\r\n\r\n      // Does str represent an integer? If so, no need for the division.\r\n      if (i < 0) {\r\n        --e;\r\n      } else {\r\n        x.c = xc;\r\n        x.e = e;\r\n\r\n        // The sign is needed for correct rounding.\r\n        x.s = sign;\r\n        x = div(x, y, dp, rm, baseOut);\r\n        xc = x.c;\r\n        r = x.r;\r\n        e = x.e;\r\n      }\r\n\r\n      // xc now represents str converted to baseOut.\r\n\r\n      // THe index of the rounding digit.\r\n      d = e + dp + 1;\r\n\r\n      // The rounding digit: the digit to the right of the digit that may be rounded up.\r\n      i = xc[d];\r\n\r\n      // Look at the rounding digits and mode to determine whether to round up.\r\n\r\n      k = baseOut / 2;\r\n      r = r || d < 0 || xc[d + 1] != null;\r\n\r\n      r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n            : i > k || i == k &&(rm == 4 || r || rm == 6 && xc[d - 1] & 1 ||\r\n             rm == (x.s < 0 ? 8 : 7));\r\n\r\n      // If the index of the rounding digit is not greater than zero, or xc represents\r\n      // zero, then the result of the base conversion is zero or, if rounding up, a value\r\n      // such as 0.00001.\r\n      if (d < 1 || !xc[0]) {\r\n\r\n        // 1^-dp or 0\r\n        str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0);\r\n      } else {\r\n\r\n        // Truncate xc to the required number of decimal places.\r\n        xc.length = d;\r\n\r\n        // Round up?\r\n        if (r) {\r\n\r\n          // Rounding up may mean the previous digit has to be rounded up and so on.\r\n          for (--baseOut; ++xc[--d] > baseOut;) {\r\n            xc[d] = 0;\r\n\r\n            if (!d) {\r\n              ++e;\r\n              xc = [1].concat(xc);\r\n            }\r\n          }\r\n        }\r\n\r\n        // Determine trailing zeros.\r\n        for (k = xc.length; !xc[--k];);\r\n\r\n        // E.g. [4, 11, 15] becomes 4bf.\r\n        for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++]));\r\n\r\n        // Add leading zeros, decimal point and trailing zeros as required.\r\n        str = toFixedPoint(str, e, alphabet.charAt(0));\r\n      }\r\n\r\n      // The caller will add the sign.\r\n      return str;\r\n    };\r\n  })();\r\n\r\n\r\n  // Perform division in the specified base. Called by div and convertBase.\r\n  div = (function () {\r\n\r\n    // Assume non-zero x and k.\r\n    function multiply(x, k, base) {\r\n      var m, temp, xlo, xhi,\r\n        carry = 0,\r\n        i = x.length,\r\n        klo = k % SQRT_BASE,\r\n        khi = k / SQRT_BASE | 0;\r\n\r\n      for (x = x.slice(); i--;) {\r\n        xlo = x[i] % SQRT_BASE;\r\n        xhi = x[i] / SQRT_BASE | 0;\r\n        m = khi * xlo + xhi * klo;\r\n        temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry;\r\n        carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi;\r\n        x[i] = temp % base;\r\n      }\r\n\r\n      if (carry) x = [carry].concat(x);\r\n\r\n      return x;\r\n    }\r\n\r\n    function compare(a, b, aL, bL) {\r\n      var i, cmp;\r\n\r\n      if (aL != bL) {\r\n        cmp = aL > bL ? 1 : -1;\r\n      } else {\r\n\r\n        for (i = cmp = 0; i < aL; i++) {\r\n\r\n          if (a[i] != b[i]) {\r\n            cmp = a[i] > b[i] ? 1 : -1;\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      return cmp;\r\n    }\r\n\r\n    function subtract(a, b, aL, base) {\r\n      var i = 0;\r\n\r\n      // Subtract b from a.\r\n      for (; aL--;) {\r\n        a[aL] -= i;\r\n        i = a[aL] < b[aL] ? 1 : 0;\r\n        a[aL] = i * base + a[aL] - b[aL];\r\n      }\r\n\r\n      // Remove leading zeros.\r\n      for (; !a[0] && a.length > 1; a.splice(0, 1));\r\n    }\r\n\r\n    // x: dividend, y: divisor.\r\n    return function (x, y, dp, rm, base) {\r\n      var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,\r\n        yL, yz,\r\n        s = x.s == y.s ? 1 : -1,\r\n        xc = x.c,\r\n        yc = y.c;\r\n\r\n      // Either NaN, Infinity or 0?\r\n      if (!xc || !xc[0] || !yc || !yc[0]) {\r\n\r\n        return new BigNumber(\r\n\r\n         // Return NaN if either NaN, or both Infinity or 0.\r\n         !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN :\r\n\r\n          // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.\r\n          xc && xc[0] == 0 || !yc ? s * 0 : s / 0\r\n       );\r\n      }\r\n\r\n      q = new BigNumber(s);\r\n      qc = q.c = [];\r\n      e = x.e - y.e;\r\n      s = dp + e + 1;\r\n\r\n      if (!base) {\r\n        base = BASE;\r\n        e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);\r\n        s = s / LOG_BASE | 0;\r\n      }\r\n\r\n      // Result exponent may be one less then the current value of e.\r\n      // The coefficients of the BigNumbers from convertBase may have trailing zeros.\r\n      for (i = 0; yc[i] == (xc[i] || 0); i++);\r\n\r\n      if (yc[i] > (xc[i] || 0)) e--;\r\n\r\n      if (s < 0) {\r\n        qc.push(1);\r\n        more = true;\r\n      } else {\r\n        xL = xc.length;\r\n        yL = yc.length;\r\n        i = 0;\r\n        s += 2;\r\n\r\n        // Normalise xc and yc so highest order digit of yc is >= base / 2.\r\n\r\n        n = mathfloor(base / (yc[0] + 1));\r\n\r\n        // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1.\r\n        // if (n > 1 || n++ == 1 && yc[0] < base / 2) {\r\n        if (n > 1) {\r\n          yc = multiply(yc, n, base);\r\n          xc = multiply(xc, n, base);\r\n          yL = yc.length;\r\n          xL = xc.length;\r\n        }\r\n\r\n        xi = yL;\r\n        rem = xc.slice(0, yL);\r\n        remL = rem.length;\r\n\r\n        // Add zeros to make remainder as long as divisor.\r\n        for (; remL < yL; rem[remL++] = 0);\r\n        yz = yc.slice();\r\n        yz = [0].concat(yz);\r\n        yc0 = yc[0];\r\n        if (yc[1] >= base / 2) yc0++;\r\n        // Not necessary, but to prevent trial digit n > base, when using base 3.\r\n        // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15;\r\n\r\n        do {\r\n          n = 0;\r\n\r\n          // Compare divisor and remainder.\r\n          cmp = compare(yc, rem, yL, remL);\r\n\r\n          // If divisor < remainder.\r\n          if (cmp < 0) {\r\n\r\n            // Calculate trial digit, n.\r\n\r\n            rem0 = rem[0];\r\n            if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n            // n is how many times the divisor goes into the current remainder.\r\n            n = mathfloor(rem0 / yc0);\r\n\r\n            //  Algorithm:\r\n            //  product = divisor multiplied by trial digit (n).\r\n            //  Compare product and remainder.\r\n            //  If product is greater than remainder:\r\n            //    Subtract divisor from product, decrement trial digit.\r\n            //  Subtract product from remainder.\r\n            //  If product was less than remainder at the last compare:\r\n            //    Compare new remainder and divisor.\r\n            //    If remainder is greater than divisor:\r\n            //      Subtract divisor from remainder, increment trial digit.\r\n\r\n            if (n > 1) {\r\n\r\n              // n may be > base only when base is 3.\r\n              if (n >= base) n = base - 1;\r\n\r\n              // product = divisor * trial digit.\r\n              prod = multiply(yc, n, base);\r\n              prodL = prod.length;\r\n              remL = rem.length;\r\n\r\n              // Compare product and remainder.\r\n              // If product > remainder then trial digit n too high.\r\n              // n is 1 too high about 5% of the time, and is not known to have\r\n              // ever been more than 1 too high.\r\n              while (compare(prod, rem, prodL, remL) == 1) {\r\n                n--;\r\n\r\n                // Subtract divisor from product.\r\n                subtract(prod, yL < prodL ? yz : yc, prodL, base);\r\n                prodL = prod.length;\r\n                cmp = 1;\r\n              }\r\n            } else {\r\n\r\n              // n is 0 or 1, cmp is -1.\r\n              // If n is 0, there is no need to compare yc and rem again below,\r\n              // so change cmp to 1 to avoid it.\r\n              // If n is 1, leave cmp as -1, so yc and rem are compared again.\r\n              if (n == 0) {\r\n\r\n                // divisor < remainder, so n must be at least 1.\r\n                cmp = n = 1;\r\n              }\r\n\r\n              // product = divisor\r\n              prod = yc.slice();\r\n              prodL = prod.length;\r\n            }\r\n\r\n            if (prodL < remL) prod = [0].concat(prod);\r\n\r\n            // Subtract product from remainder.\r\n            subtract(rem, prod, remL, base);\r\n            remL = rem.length;\r\n\r\n             // If product was < remainder.\r\n            if (cmp == -1) {\r\n\r\n              // Compare divisor and new remainder.\r\n              // If divisor < new remainder, subtract divisor from remainder.\r\n              // Trial digit n too low.\r\n              // n is 1 too low about 5% of the time, and very rarely 2 too low.\r\n              while (compare(yc, rem, yL, remL) < 1) {\r\n                n++;\r\n\r\n                // Subtract divisor from remainder.\r\n                subtract(rem, yL < remL ? yz : yc, remL, base);\r\n                remL = rem.length;\r\n              }\r\n            }\r\n          } else if (cmp === 0) {\r\n            n++;\r\n            rem = [0];\r\n          } // else cmp === 1 and n will be 0\r\n\r\n          // Add the next digit, n, to the result array.\r\n          qc[i++] = n;\r\n\r\n          // Update the remainder.\r\n          if (rem[0]) {\r\n            rem[remL++] = xc[xi] || 0;\r\n          } else {\r\n            rem = [xc[xi]];\r\n            remL = 1;\r\n          }\r\n        } while ((xi++ < xL || rem[0] != null) && s--);\r\n\r\n        more = rem[0] != null;\r\n\r\n        // Leading zero?\r\n        if (!qc[0]) qc.splice(0, 1);\r\n      }\r\n\r\n      if (base == BASE) {\r\n\r\n        // To calculate q.e, first get the number of digits of qc[0].\r\n        for (i = 1, s = qc[0]; s >= 10; s /= 10, i++);\r\n\r\n        round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);\r\n\r\n      // Caller is convertBase.\r\n      } else {\r\n        q.e = e;\r\n        q.r = +more;\r\n      }\r\n\r\n      return q;\r\n    };\r\n  })();\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of BigNumber n in fixed-point or exponential\r\n   * notation rounded to the specified decimal places or significant digits.\r\n   *\r\n   * n: a BigNumber.\r\n   * i: the index of the last digit required (i.e. the digit that may be rounded up).\r\n   * rm: the rounding mode.\r\n   * id: 1 (toExponential) or 2 (toPrecision).\r\n   */\r\n  function format(n, i, rm, id) {\r\n    var c0, e, ne, len, str;\r\n\r\n    if (rm == null) rm = ROUNDING_MODE;\r\n    else intCheck(rm, 0, 8);\r\n\r\n    if (!n.c) return n.toString();\r\n\r\n    c0 = n.c[0];\r\n    ne = n.e;\r\n\r\n    if (i == null) {\r\n      str = coeffToString(n.c);\r\n      str = id == 1 || id == 2 && (ne <= TO_EXP_NEG || ne >= TO_EXP_POS)\r\n       ? toExponential(str, ne)\r\n       : toFixedPoint(str, ne, '0');\r\n    } else {\r\n      n = round(new BigNumber(n), i, rm);\r\n\r\n      // n.e may have changed if the value was rounded up.\r\n      e = n.e;\r\n\r\n      str = coeffToString(n.c);\r\n      len = str.length;\r\n\r\n      // toPrecision returns exponential notation if the number of significant digits\r\n      // specified is less than the number of digits necessary to represent the integer\r\n      // part of the value in fixed-point notation.\r\n\r\n      // Exponential notation.\r\n      if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) {\r\n\r\n        // Append zeros?\r\n        for (; len < i; str += '0', len++);\r\n        str = toExponential(str, e);\r\n\r\n      // Fixed-point notation.\r\n      } else {\r\n        i -= ne;\r\n        str = toFixedPoint(str, e, '0');\r\n\r\n        // Append zeros?\r\n        if (e + 1 > len) {\r\n          if (--i > 0) for (str += '.'; i--; str += '0');\r\n        } else {\r\n          i += e - len;\r\n          if (i > 0) {\r\n            if (e + 1 == len) str += '.';\r\n            for (; i--; str += '0');\r\n          }\r\n        }\r\n      }\r\n    }\r\n\r\n    return n.s < 0 && c0 ? '-' + str : str;\r\n  }\r\n\r\n\r\n  // Handle BigNumber.max and BigNumber.min.\r\n  // If any number is NaN, return NaN.\r\n  function maxOrMin(args, n) {\r\n    var k, y,\r\n      i = 1,\r\n      x = new BigNumber(args[0]);\r\n\r\n    for (; i < args.length; i++) {\r\n      y = new BigNumber(args[i]);\r\n      if (!y.s || (k = compare(x, y)) === n || k === 0 && x.s === n) {\r\n        x = y;\r\n      }\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  /*\r\n   * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.\r\n   * Called by minus, plus and times.\r\n   */\r\n  function normalise(n, c, e) {\r\n    var i = 1,\r\n      j = c.length;\r\n\r\n     // Remove trailing zeros.\r\n    for (; !c[--j]; c.pop());\r\n\r\n    // Calculate the base 10 exponent. First get the number of digits of c[0].\r\n    for (j = c[0]; j >= 10; j /= 10, i++);\r\n\r\n    // Overflow?\r\n    if ((e = i + e * LOG_BASE - 1) > MAX_EXP) {\r\n\r\n      // Infinity.\r\n      n.c = n.e = null;\r\n\r\n    // Underflow?\r\n    } else if (e < MIN_EXP) {\r\n\r\n      // Zero.\r\n      n.c = [n.e = 0];\r\n    } else {\r\n      n.e = e;\r\n      n.c = c;\r\n    }\r\n\r\n    return n;\r\n  }\r\n\r\n\r\n  // Handle values that fail the validity test in BigNumber.\r\n  parseNumeric = (function () {\r\n    var basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i,\r\n      dotAfter = /^([^.]+)\\.$/,\r\n      dotBefore = /^\\.([^.]+)$/,\r\n      isInfinityOrNaN = /^-?(Infinity|NaN)$/,\r\n      whitespaceOrPlus = /^\\s*\\+(?=[\\w.])|^\\s+|\\s+$/g;\r\n\r\n    return function (x, str, isNum, b) {\r\n      var base,\r\n        s = isNum ? str : str.replace(whitespaceOrPlus, '');\r\n\r\n      // No exception on ±Infinity or NaN.\r\n      if (isInfinityOrNaN.test(s)) {\r\n        x.s = isNaN(s) ? null : s < 0 ? -1 : 1;\r\n      } else {\r\n        if (!isNum) {\r\n\r\n          // basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i\r\n          s = s.replace(basePrefix, function (m, p1, p2) {\r\n            base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;\r\n            return !b || b == base ? p1 : m;\r\n          });\r\n\r\n          if (b) {\r\n            base = b;\r\n\r\n            // E.g. '1.' to '1', '.1' to '0.1'\r\n            s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');\r\n          }\r\n\r\n          if (str != s) return new BigNumber(s, base);\r\n        }\r\n\r\n        // '[BigNumber Error] Not a number: {n}'\r\n        // '[BigNumber Error] Not a base {b} number: {n}'\r\n        if (BigNumber.DEBUG) {\r\n          throw Error\r\n            (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);\r\n        }\r\n\r\n        // NaN\r\n        x.s = null;\r\n      }\r\n\r\n      x.c = x.e = null;\r\n    }\r\n  })();\r\n\r\n\r\n  /*\r\n   * Round x to sd significant digits using rounding mode rm. Check for over/under-flow.\r\n   * If r is truthy, it is known that there are more digits after the rounding digit.\r\n   */\r\n  function round(x, sd, rm, r) {\r\n    var d, i, j, k, n, ni, rd,\r\n      xc = x.c,\r\n      pows10 = POWS_TEN;\r\n\r\n    // if x is not Infinity or NaN...\r\n    if (xc) {\r\n\r\n      // rd is the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n      // n is a base 1e14 number, the value of the element of array x.c containing rd.\r\n      // ni is the index of n within x.c.\r\n      // d is the number of digits of n.\r\n      // i is the index of rd within n including leading zeros.\r\n      // j is the actual index of rd within n (if < 0, rd is a leading zero).\r\n      out: {\r\n\r\n        // Get the number of digits of the first element of xc.\r\n        for (d = 1, k = xc[0]; k >= 10; k /= 10, d++);\r\n        i = sd - d;\r\n\r\n        // If the rounding digit is in the first element of xc...\r\n        if (i < 0) {\r\n          i += LOG_BASE;\r\n          j = sd;\r\n          n = xc[ni = 0];\r\n\r\n          // Get the rounding digit at index j of n.\r\n          rd = mathfloor(n / pows10[d - j - 1] % 10);\r\n        } else {\r\n          ni = mathceil((i + 1) / LOG_BASE);\r\n\r\n          if (ni >= xc.length) {\r\n\r\n            if (r) {\r\n\r\n              // Needed by sqrt.\r\n              for (; xc.length <= ni; xc.push(0));\r\n              n = rd = 0;\r\n              d = 1;\r\n              i %= LOG_BASE;\r\n              j = i - LOG_BASE + 1;\r\n            } else {\r\n              break out;\r\n            }\r\n          } else {\r\n            n = k = xc[ni];\r\n\r\n            // Get the number of digits of n.\r\n            for (d = 1; k >= 10; k /= 10, d++);\r\n\r\n            // Get the index of rd within n.\r\n            i %= LOG_BASE;\r\n\r\n            // Get the index of rd within n, adjusted for leading zeros.\r\n            // The number of leading zeros of n is given by LOG_BASE - d.\r\n            j = i - LOG_BASE + d;\r\n\r\n            // Get the rounding digit at index j of n.\r\n            rd = j < 0 ? 0 : mathfloor(n / pows10[d - j - 1] % 10);\r\n          }\r\n        }\r\n\r\n        r = r || sd < 0 ||\r\n\r\n        // Are there any non-zero digits after the rounding digit?\r\n        // The expression  n % pows10[d - j - 1]  returns all digits of n to the right\r\n        // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.\r\n         xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]);\r\n\r\n        r = rm < 4\r\n         ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n         : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 &&\r\n\r\n          // Check whether the digit to the left of the rounding digit is odd.\r\n          ((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 ||\r\n           rm == (x.s < 0 ? 8 : 7));\r\n\r\n        if (sd < 1 || !xc[0]) {\r\n          xc.length = 0;\r\n\r\n          if (r) {\r\n\r\n            // Convert sd to decimal places.\r\n            sd -= x.e + 1;\r\n\r\n            // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n            xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];\r\n            x.e = -sd || 0;\r\n          } else {\r\n\r\n            // Zero.\r\n            xc[0] = x.e = 0;\r\n          }\r\n\r\n          return x;\r\n        }\r\n\r\n        // Remove excess digits.\r\n        if (i == 0) {\r\n          xc.length = ni;\r\n          k = 1;\r\n          ni--;\r\n        } else {\r\n          xc.length = ni + 1;\r\n          k = pows10[LOG_BASE - i];\r\n\r\n          // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n          // j > 0 means i > number of leading zeros of n.\r\n          xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0;\r\n        }\r\n\r\n        // Round up?\r\n        if (r) {\r\n\r\n          for (; ;) {\r\n\r\n            // If the digit to be rounded up is in the first element of xc...\r\n            if (ni == 0) {\r\n\r\n              // i will be the length of xc[0] before k is added.\r\n              for (i = 1, j = xc[0]; j >= 10; j /= 10, i++);\r\n              j = xc[0] += k;\r\n              for (k = 1; j >= 10; j /= 10, k++);\r\n\r\n              // if i != k the length has increased.\r\n              if (i != k) {\r\n                x.e++;\r\n                if (xc[0] == BASE) xc[0] = 1;\r\n              }\r\n\r\n              break;\r\n            } else {\r\n              xc[ni] += k;\r\n              if (xc[ni] != BASE) break;\r\n              xc[ni--] = 0;\r\n              k = 1;\r\n            }\r\n          }\r\n        }\r\n\r\n        // Remove trailing zeros.\r\n        for (i = xc.length; xc[--i] === 0; xc.pop());\r\n      }\r\n\r\n      // Overflow? Infinity.\r\n      if (x.e > MAX_EXP) {\r\n        x.c = x.e = null;\r\n\r\n      // Underflow? Zero.\r\n      } else if (x.e < MIN_EXP) {\r\n        x.c = [x.e = 0];\r\n      }\r\n    }\r\n\r\n    return x;\r\n  }\r\n\r\n\r\n  function valueOf(n) {\r\n    var str,\r\n      e = n.e;\r\n\r\n    if (e === null) return n.toString();\r\n\r\n    str = coeffToString(n.c);\r\n\r\n    str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n      ? toExponential(str, e)\r\n      : toFixedPoint(str, e, '0');\r\n\r\n    return n.s < 0 ? '-' + str : str;\r\n  }\r\n\r\n\r\n  // PROTOTYPE/INSTANCE METHODS\r\n\r\n\r\n  /*\r\n   * Return a new BigNumber whose value is the absolute value of this BigNumber.\r\n   */\r\n  P.absoluteValue = P.abs = function () {\r\n    var x = new BigNumber(this);\r\n    if (x.s < 0) x.s = 1;\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return\r\n   *   1 if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n   *   -1 if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n   *   0 if they have the same value,\r\n   *   or null if the value of either is NaN.\r\n   */\r\n  P.comparedTo = function (y, b) {\r\n    return compare(this, new BigNumber(y, b));\r\n  };\r\n\r\n\r\n  /*\r\n   * If dp is undefined or null or true or false, return the number of decimal places of the\r\n   * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n   *\r\n   * Otherwise, if dp is a number, return a new BigNumber whose value is the value of this\r\n   * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or\r\n   * ROUNDING_MODE if rm is omitted.\r\n   *\r\n   * [dp] {number} Decimal places: integer, 0 to MAX inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n   */\r\n  P.decimalPlaces = P.dp = function (dp, rm) {\r\n    var c, n, v,\r\n      x = this;\r\n\r\n    if (dp != null) {\r\n      intCheck(dp, 0, MAX);\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n\r\n      return round(new BigNumber(x), dp + x.e + 1, rm);\r\n    }\r\n\r\n    if (!(c = x.c)) return null;\r\n    n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n    // Subtract the number of trailing zeros of the last number.\r\n    if (v = c[v]) for (; v % 10 == 0; v /= 10, n--);\r\n    if (n < 0) n = 0;\r\n\r\n    return n;\r\n  };\r\n\r\n\r\n  /*\r\n   *  n / 0 = I\r\n   *  n / N = N\r\n   *  n / I = 0\r\n   *  0 / n = 0\r\n   *  0 / 0 = N\r\n   *  0 / N = N\r\n   *  0 / I = 0\r\n   *  N / n = N\r\n   *  N / 0 = N\r\n   *  N / N = N\r\n   *  N / I = N\r\n   *  I / n = I\r\n   *  I / 0 = I\r\n   *  I / N = N\r\n   *  I / I = N\r\n   *\r\n   * Return a new BigNumber whose value is the value of this BigNumber divided by the value of\r\n   * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n   */\r\n  P.dividedBy = P.div = function (y, b) {\r\n    return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new BigNumber whose value is the integer part of dividing the value of this\r\n   * BigNumber by the value of BigNumber(y, b).\r\n   */\r\n  P.dividedToIntegerBy = P.idiv = function (y, b) {\r\n    return div(this, new BigNumber(y, b), 0, 1);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a BigNumber whose value is the value of this BigNumber exponentiated by n.\r\n   *\r\n   * If m is present, return the result modulo m.\r\n   * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.\r\n   * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE.\r\n   *\r\n   * The modular power operation works efficiently when x, n, and m are integers, otherwise it\r\n   * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0.\r\n   *\r\n   * n {number|string|BigNumber} The exponent. An integer.\r\n   * [m] {number|string|BigNumber} The modulus.\r\n   *\r\n   * '[BigNumber Error] Exponent not an integer: {n}'\r\n   */\r\n  P.exponentiatedBy = P.pow = function (n, m) {\r\n    var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y,\r\n      x = this;\r\n\r\n    n = new BigNumber(n);\r\n\r\n    // Allow NaN and ±Infinity, but not other non-integers.\r\n    if (n.c && !n.isInteger()) {\r\n      throw Error\r\n        (bignumberError + 'Exponent not an integer: ' + valueOf(n));\r\n    }\r\n\r\n    if (m != null) m = new BigNumber(m);\r\n\r\n    // Exponent of MAX_SAFE_INTEGER is 15.\r\n    nIsBig = n.e > 14;\r\n\r\n    // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0.\r\n    if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) {\r\n\r\n      // The sign of the result of pow when x is negative depends on the evenness of n.\r\n      // If +n overflows to ±Infinity, the evenness of n would be not be known.\r\n      y = new BigNumber(Math.pow(+valueOf(x), nIsBig ? n.s * (2 - isOdd(n)) : +valueOf(n)));\r\n      return m ? y.mod(m) : y;\r\n    }\r\n\r\n    nIsNeg = n.s < 0;\r\n\r\n    if (m) {\r\n\r\n      // x % m returns NaN if abs(m) is zero, or m is NaN.\r\n      if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN);\r\n\r\n      isModExp = !nIsNeg && x.isInteger() && m.isInteger();\r\n\r\n      if (isModExp) x = x.mod(m);\r\n\r\n    // Overflow to ±Infinity: >=2**1e10 or >=1.0000024**1e15.\r\n    // Underflow to ±0: <=0.79**1e10 or <=0.9999975**1e15.\r\n    } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0\r\n      // [1, 240000000]\r\n      ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7\r\n      // [80000000000000]  [99999750000000]\r\n      : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) {\r\n\r\n      // If x is negative and n is odd, k = -0, else k = 0.\r\n      k = x.s < 0 && isOdd(n) ? -0 : 0;\r\n\r\n      // If x >= 1, k = ±Infinity.\r\n      if (x.e > -1) k = 1 / k;\r\n\r\n      // If n is negative return ±0, else return ±Infinity.\r\n      return new BigNumber(nIsNeg ? 1 / k : k);\r\n\r\n    } else if (POW_PRECISION) {\r\n\r\n      // Truncating each coefficient array to a length of k after each multiplication\r\n      // equates to truncating significant digits to POW_PRECISION + [28, 41],\r\n      // i.e. there will be a minimum of 28 guard digits retained.\r\n      k = mathceil(POW_PRECISION / LOG_BASE + 2);\r\n    }\r\n\r\n    if (nIsBig) {\r\n      half = new BigNumber(0.5);\r\n      if (nIsNeg) n.s = 1;\r\n      nIsOdd = isOdd(n);\r\n    } else {\r\n      i = Math.abs(+valueOf(n));\r\n      nIsOdd = i % 2;\r\n    }\r\n\r\n    y = new BigNumber(ONE);\r\n\r\n    // Performs 54 loop iterations for n of 9007199254740991.\r\n    for (; ;) {\r\n\r\n      if (nIsOdd) {\r\n        y = y.times(x);\r\n        if (!y.c) break;\r\n\r\n        if (k) {\r\n          if (y.c.length > k) y.c.length = k;\r\n        } else if (isModExp) {\r\n          y = y.mod(m);    //y = y.minus(div(y, m, 0, MODULO_MODE).times(m));\r\n        }\r\n      }\r\n\r\n      if (i) {\r\n        i = mathfloor(i / 2);\r\n        if (i === 0) break;\r\n        nIsOdd = i % 2;\r\n      } else {\r\n        n = n.times(half);\r\n        round(n, n.e + 1, 1);\r\n\r\n        if (n.e > 14) {\r\n          nIsOdd = isOdd(n);\r\n        } else {\r\n          i = +valueOf(n);\r\n          if (i === 0) break;\r\n          nIsOdd = i % 2;\r\n        }\r\n      }\r\n\r\n      x = x.times(x);\r\n\r\n      if (k) {\r\n        if (x.c && x.c.length > k) x.c.length = k;\r\n      } else if (isModExp) {\r\n        x = x.mod(m);    //x = x.minus(div(x, m, 0, MODULO_MODE).times(m));\r\n      }\r\n    }\r\n\r\n    if (isModExp) return y;\r\n    if (nIsNeg) y = ONE.div(y);\r\n\r\n    return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new BigNumber whose value is the value of this BigNumber rounded to an integer\r\n   * using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n   *\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {rm}'\r\n   */\r\n  P.integerValue = function (rm) {\r\n    var n = new BigNumber(this);\r\n    if (rm == null) rm = ROUNDING_MODE;\r\n    else intCheck(rm, 0, 8);\r\n    return round(n, n.e + 1, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),\r\n   * otherwise return false.\r\n   */\r\n  P.isEqualTo = P.eq = function (y, b) {\r\n    return compare(this, new BigNumber(y, b)) === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is a finite number, otherwise return false.\r\n   */\r\n  P.isFinite = function () {\r\n    return !!this.c;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n   * otherwise return false.\r\n   */\r\n  P.isGreaterThan = P.gt = function (y, b) {\r\n    return compare(this, new BigNumber(y, b)) > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is greater than or equal to the value of\r\n   * BigNumber(y, b), otherwise return false.\r\n   */\r\n  P.isGreaterThanOrEqualTo = P.gte = function (y, b) {\r\n    return (b = compare(this, new BigNumber(y, b))) === 1 || b === 0;\r\n\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is an integer, otherwise return false.\r\n   */\r\n  P.isInteger = function () {\r\n    return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n   * otherwise return false.\r\n   */\r\n  P.isLessThan = P.lt = function (y, b) {\r\n    return compare(this, new BigNumber(y, b)) < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is less than or equal to the value of\r\n   * BigNumber(y, b), otherwise return false.\r\n   */\r\n  P.isLessThanOrEqualTo = P.lte = function (y, b) {\r\n    return (b = compare(this, new BigNumber(y, b))) === -1 || b === 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is NaN, otherwise return false.\r\n   */\r\n  P.isNaN = function () {\r\n    return !this.s;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is negative, otherwise return false.\r\n   */\r\n  P.isNegative = function () {\r\n    return this.s < 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is positive, otherwise return false.\r\n   */\r\n  P.isPositive = function () {\r\n    return this.s > 0;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return true if the value of this BigNumber is 0 or -0, otherwise return false.\r\n   */\r\n  P.isZero = function () {\r\n    return !!this.c && this.c[0] == 0;\r\n  };\r\n\r\n\r\n  /*\r\n   *  n - 0 = n\r\n   *  n - N = N\r\n   *  n - I = -I\r\n   *  0 - n = -n\r\n   *  0 - 0 = 0\r\n   *  0 - N = N\r\n   *  0 - I = -I\r\n   *  N - n = N\r\n   *  N - 0 = N\r\n   *  N - N = N\r\n   *  N - I = N\r\n   *  I - n = I\r\n   *  I - 0 = I\r\n   *  I - N = N\r\n   *  I - I = N\r\n   *\r\n   * Return a new BigNumber whose value is the value of this BigNumber minus the value of\r\n   * BigNumber(y, b).\r\n   */\r\n  P.minus = function (y, b) {\r\n    var i, j, t, xLTy,\r\n      x = this,\r\n      a = x.s;\r\n\r\n    y = new BigNumber(y, b);\r\n    b = y.s;\r\n\r\n    // Either NaN?\r\n    if (!a || !b) return new BigNumber(NaN);\r\n\r\n    // Signs differ?\r\n    if (a != b) {\r\n      y.s = -b;\r\n      return x.plus(y);\r\n    }\r\n\r\n    var xe = x.e / LOG_BASE,\r\n      ye = y.e / LOG_BASE,\r\n      xc = x.c,\r\n      yc = y.c;\r\n\r\n    if (!xe || !ye) {\r\n\r\n      // Either Infinity?\r\n      if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN);\r\n\r\n      // Either zero?\r\n      if (!xc[0] || !yc[0]) {\r\n\r\n        // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n        return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x :\r\n\r\n         // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity\r\n         ROUNDING_MODE == 3 ? -0 : 0);\r\n      }\r\n    }\r\n\r\n    xe = bitFloor(xe);\r\n    ye = bitFloor(ye);\r\n    xc = xc.slice();\r\n\r\n    // Determine which is the bigger number.\r\n    if (a = xe - ye) {\r\n\r\n      if (xLTy = a < 0) {\r\n        a = -a;\r\n        t = xc;\r\n      } else {\r\n        ye = xe;\r\n        t = yc;\r\n      }\r\n\r\n      t.reverse();\r\n\r\n      // Prepend zeros to equalise exponents.\r\n      for (b = a; b--; t.push(0));\r\n      t.reverse();\r\n    } else {\r\n\r\n      // Exponents equal. Check digit by digit.\r\n      j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;\r\n\r\n      for (a = b = 0; b < j; b++) {\r\n\r\n        if (xc[b] != yc[b]) {\r\n          xLTy = xc[b] < yc[b];\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    // x < y? Point xc to the array of the bigger number.\r\n    if (xLTy) {\r\n      t = xc;\r\n      xc = yc;\r\n      yc = t;\r\n      y.s = -y.s;\r\n    }\r\n\r\n    b = (j = yc.length) - (i = xc.length);\r\n\r\n    // Append zeros to xc if shorter.\r\n    // No need to add zeros to yc if shorter as subtract only needs to start at yc.length.\r\n    if (b > 0) for (; b--; xc[i++] = 0);\r\n    b = BASE - 1;\r\n\r\n    // Subtract yc from xc.\r\n    for (; j > a;) {\r\n\r\n      if (xc[--j] < yc[j]) {\r\n        for (i = j; i && !xc[--i]; xc[i] = b);\r\n        --xc[i];\r\n        xc[j] += BASE;\r\n      }\r\n\r\n      xc[j] -= yc[j];\r\n    }\r\n\r\n    // Remove leading zeros and adjust exponent accordingly.\r\n    for (; xc[0] == 0; xc.splice(0, 1), --ye);\r\n\r\n    // Zero?\r\n    if (!xc[0]) {\r\n\r\n      // Following IEEE 754 (2008) 6.3,\r\n      // n - n = +0  but  n - n = -0  when rounding towards -Infinity.\r\n      y.s = ROUNDING_MODE == 3 ? -1 : 1;\r\n      y.c = [y.e = 0];\r\n      return y;\r\n    }\r\n\r\n    // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity\r\n    // for finite x and y.\r\n    return normalise(y, xc, ye);\r\n  };\r\n\r\n\r\n  /*\r\n   *   n % 0 =  N\r\n   *   n % N =  N\r\n   *   n % I =  n\r\n   *   0 % n =  0\r\n   *  -0 % n = -0\r\n   *   0 % 0 =  N\r\n   *   0 % N =  N\r\n   *   0 % I =  0\r\n   *   N % n =  N\r\n   *   N % 0 =  N\r\n   *   N % N =  N\r\n   *   N % I =  N\r\n   *   I % n =  N\r\n   *   I % 0 =  N\r\n   *   I % N =  N\r\n   *   I % I =  N\r\n   *\r\n   * Return a new BigNumber whose value is the value of this BigNumber modulo the value of\r\n   * BigNumber(y, b). The result depends on the value of MODULO_MODE.\r\n   */\r\n  P.modulo = P.mod = function (y, b) {\r\n    var q, s,\r\n      x = this;\r\n\r\n    y = new BigNumber(y, b);\r\n\r\n    // Return NaN if x is Infinity or NaN, or y is NaN or zero.\r\n    if (!x.c || !y.s || y.c && !y.c[0]) {\r\n      return new BigNumber(NaN);\r\n\r\n    // Return x if y is Infinity or x is zero.\r\n    } else if (!y.c || x.c && !x.c[0]) {\r\n      return new BigNumber(x);\r\n    }\r\n\r\n    if (MODULO_MODE == 9) {\r\n\r\n      // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n      // r = x - qy    where  0 <= r < abs(y)\r\n      s = y.s;\r\n      y.s = 1;\r\n      q = div(x, y, 0, 3);\r\n      y.s = s;\r\n      q.s *= s;\r\n    } else {\r\n      q = div(x, y, 0, MODULO_MODE);\r\n    }\r\n\r\n    y = x.minus(q.times(y));\r\n\r\n    // To match JavaScript %, ensure sign of zero is sign of dividend.\r\n    if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;\r\n\r\n    return y;\r\n  };\r\n\r\n\r\n  /*\r\n   *  n * 0 = 0\r\n   *  n * N = N\r\n   *  n * I = I\r\n   *  0 * n = 0\r\n   *  0 * 0 = 0\r\n   *  0 * N = N\r\n   *  0 * I = N\r\n   *  N * n = N\r\n   *  N * 0 = N\r\n   *  N * N = N\r\n   *  N * I = N\r\n   *  I * n = I\r\n   *  I * 0 = N\r\n   *  I * N = N\r\n   *  I * I = I\r\n   *\r\n   * Return a new BigNumber whose value is the value of this BigNumber multiplied by the value\r\n   * of BigNumber(y, b).\r\n   */\r\n  P.multipliedBy = P.times = function (y, b) {\r\n    var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,\r\n      base, sqrtBase,\r\n      x = this,\r\n      xc = x.c,\r\n      yc = (y = new BigNumber(y, b)).c;\r\n\r\n    // Either NaN, ±Infinity or ±0?\r\n    if (!xc || !yc || !xc[0] || !yc[0]) {\r\n\r\n      // Return NaN if either is NaN, or one is 0 and the other is Infinity.\r\n      if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) {\r\n        y.c = y.e = y.s = null;\r\n      } else {\r\n        y.s *= x.s;\r\n\r\n        // Return ±Infinity if either is ±Infinity.\r\n        if (!xc || !yc) {\r\n          y.c = y.e = null;\r\n\r\n        // Return ±0 if either is ±0.\r\n        } else {\r\n          y.c = [0];\r\n          y.e = 0;\r\n        }\r\n      }\r\n\r\n      return y;\r\n    }\r\n\r\n    e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);\r\n    y.s *= x.s;\r\n    xcL = xc.length;\r\n    ycL = yc.length;\r\n\r\n    // Ensure xc points to longer array and xcL to its length.\r\n    if (xcL < ycL) {\r\n      zc = xc;\r\n      xc = yc;\r\n      yc = zc;\r\n      i = xcL;\r\n      xcL = ycL;\r\n      ycL = i;\r\n    }\r\n\r\n    // Initialise the result array with zeros.\r\n    for (i = xcL + ycL, zc = []; i--; zc.push(0));\r\n\r\n    base = BASE;\r\n    sqrtBase = SQRT_BASE;\r\n\r\n    for (i = ycL; --i >= 0;) {\r\n      c = 0;\r\n      ylo = yc[i] % sqrtBase;\r\n      yhi = yc[i] / sqrtBase | 0;\r\n\r\n      for (k = xcL, j = i + k; j > i;) {\r\n        xlo = xc[--k] % sqrtBase;\r\n        xhi = xc[k] / sqrtBase | 0;\r\n        m = yhi * xlo + xhi * ylo;\r\n        xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c;\r\n        c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi;\r\n        zc[j--] = xlo % base;\r\n      }\r\n\r\n      zc[j] = c;\r\n    }\r\n\r\n    if (c) {\r\n      ++e;\r\n    } else {\r\n      zc.splice(0, 1);\r\n    }\r\n\r\n    return normalise(y, zc, e);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new BigNumber whose value is the value of this BigNumber negated,\r\n   * i.e. multiplied by -1.\r\n   */\r\n  P.negated = function () {\r\n    var x = new BigNumber(this);\r\n    x.s = -x.s || null;\r\n    return x;\r\n  };\r\n\r\n\r\n  /*\r\n   *  n + 0 = n\r\n   *  n + N = N\r\n   *  n + I = I\r\n   *  0 + n = n\r\n   *  0 + 0 = 0\r\n   *  0 + N = N\r\n   *  0 + I = I\r\n   *  N + n = N\r\n   *  N + 0 = N\r\n   *  N + N = N\r\n   *  N + I = N\r\n   *  I + n = I\r\n   *  I + 0 = I\r\n   *  I + N = N\r\n   *  I + I = I\r\n   *\r\n   * Return a new BigNumber whose value is the value of this BigNumber plus the value of\r\n   * BigNumber(y, b).\r\n   */\r\n  P.plus = function (y, b) {\r\n    var t,\r\n      x = this,\r\n      a = x.s;\r\n\r\n    y = new BigNumber(y, b);\r\n    b = y.s;\r\n\r\n    // Either NaN?\r\n    if (!a || !b) return new BigNumber(NaN);\r\n\r\n    // Signs differ?\r\n     if (a != b) {\r\n      y.s = -b;\r\n      return x.minus(y);\r\n    }\r\n\r\n    var xe = x.e / LOG_BASE,\r\n      ye = y.e / LOG_BASE,\r\n      xc = x.c,\r\n      yc = y.c;\r\n\r\n    if (!xe || !ye) {\r\n\r\n      // Return ±Infinity if either ±Infinity.\r\n      if (!xc || !yc) return new BigNumber(a / 0);\r\n\r\n      // Either zero?\r\n      // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n      if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a * 0);\r\n    }\r\n\r\n    xe = bitFloor(xe);\r\n    ye = bitFloor(ye);\r\n    xc = xc.slice();\r\n\r\n    // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.\r\n    if (a = xe - ye) {\r\n      if (a > 0) {\r\n        ye = xe;\r\n        t = yc;\r\n      } else {\r\n        a = -a;\r\n        t = xc;\r\n      }\r\n\r\n      t.reverse();\r\n      for (; a--; t.push(0));\r\n      t.reverse();\r\n    }\r\n\r\n    a = xc.length;\r\n    b = yc.length;\r\n\r\n    // Point xc to the longer array, and b to the shorter length.\r\n    if (a - b < 0) {\r\n      t = yc;\r\n      yc = xc;\r\n      xc = t;\r\n      b = a;\r\n    }\r\n\r\n    // Only start adding at yc.length - 1 as the further digits of xc can be ignored.\r\n    for (a = 0; b;) {\r\n      a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0;\r\n      xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;\r\n    }\r\n\r\n    if (a) {\r\n      xc = [a].concat(xc);\r\n      ++ye;\r\n    }\r\n\r\n    // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n    // ye = MAX_EXP + 1 possible\r\n    return normalise(y, xc, ye);\r\n  };\r\n\r\n\r\n  /*\r\n   * If sd is undefined or null or true or false, return the number of significant digits of\r\n   * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n   * If sd is true include integer-part trailing zeros in the count.\r\n   *\r\n   * Otherwise, if sd is a number, return a new BigNumber whose value is the value of this\r\n   * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or\r\n   * ROUNDING_MODE if rm is omitted.\r\n   *\r\n   * sd {number|boolean} number: significant digits: integer, 1 to MAX inclusive.\r\n   *                     boolean: whether to count integer-part trailing zeros: true or false.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n   */\r\n  P.precision = P.sd = function (sd, rm) {\r\n    var c, n, v,\r\n      x = this;\r\n\r\n    if (sd != null && sd !== !!sd) {\r\n      intCheck(sd, 1, MAX);\r\n      if (rm == null) rm = ROUNDING_MODE;\r\n      else intCheck(rm, 0, 8);\r\n\r\n      return round(new BigNumber(x), sd, rm);\r\n    }\r\n\r\n    if (!(c = x.c)) return null;\r\n    v = c.length - 1;\r\n    n = v * LOG_BASE + 1;\r\n\r\n    if (v = c[v]) {\r\n\r\n      // Subtract the number of trailing zeros of the last element.\r\n      for (; v % 10 == 0; v /= 10, n--);\r\n\r\n      // Add the number of digits of the first element.\r\n      for (v = c[0]; v >= 10; v /= 10, n++);\r\n    }\r\n\r\n    if (sd && x.e + 1 > n) n = x.e + 1;\r\n\r\n    return n;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a new BigNumber whose value is the value of this BigNumber shifted by k places\r\n   * (powers of 10). Shift to the right if n > 0, and to the left if n < 0.\r\n   *\r\n   * k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {k}'\r\n   */\r\n  P.shiftedBy = function (k) {\r\n    intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);\r\n    return this.times('1e' + k);\r\n  };\r\n\r\n\r\n  /*\r\n   *  sqrt(-n) =  N\r\n   *  sqrt(N) =  N\r\n   *  sqrt(-I) =  N\r\n   *  sqrt(I) =  I\r\n   *  sqrt(0) =  0\r\n   *  sqrt(-0) = -0\r\n   *\r\n   * Return a new BigNumber whose value is the square root of the value of this BigNumber,\r\n   * rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n   */\r\n  P.squareRoot = P.sqrt = function () {\r\n    var m, n, r, rep, t,\r\n      x = this,\r\n      c = x.c,\r\n      s = x.s,\r\n      e = x.e,\r\n      dp = DECIMAL_PLACES + 4,\r\n      half = new BigNumber('0.5');\r\n\r\n    // Negative/NaN/Infinity/zero?\r\n    if (s !== 1 || !c || !c[0]) {\r\n      return new BigNumber(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0);\r\n    }\r\n\r\n    // Initial estimate.\r\n    s = Math.sqrt(+valueOf(x));\r\n\r\n    // Math.sqrt underflow/overflow?\r\n    // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n    if (s == 0 || s == 1 / 0) {\r\n      n = coeffToString(c);\r\n      if ((n.length + e) % 2 == 0) n += '0';\r\n      s = Math.sqrt(+n);\r\n      e = bitFloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n      if (s == 1 / 0) {\r\n        n = '5e' + e;\r\n      } else {\r\n        n = s.toExponential();\r\n        n = n.slice(0, n.indexOf('e') + 1) + e;\r\n      }\r\n\r\n      r = new BigNumber(n);\r\n    } else {\r\n      r = new BigNumber(s + '');\r\n    }\r\n\r\n    // Check for zero.\r\n    // r could be zero if MIN_EXP is changed after the this value was created.\r\n    // This would cause a division by zero (x/t) and hence Infinity below, which would cause\r\n    // coeffToString to throw.\r\n    if (r.c[0]) {\r\n      e = r.e;\r\n      s = e + dp;\r\n      if (s < 3) s = 0;\r\n\r\n      // Newton-Raphson iteration.\r\n      for (; ;) {\r\n        t = r;\r\n        r = half.times(t.plus(div(x, t, dp, 1)));\r\n\r\n        if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) {\r\n\r\n          // The exponent of r may here be one less than the final result exponent,\r\n          // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits\r\n          // are indexed correctly.\r\n          if (r.e < e) --s;\r\n          n = n.slice(s - 3, s + 1);\r\n\r\n          // The 4th rounding digit may be in error by -1 so if the 4 rounding digits\r\n          // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the\r\n          // iteration.\r\n          if (n == '9999' || !rep && n == '4999') {\r\n\r\n            // On the first iteration only, check to see if rounding up gives the\r\n            // exact result as the nines may infinitely repeat.\r\n            if (!rep) {\r\n              round(t, t.e + DECIMAL_PLACES + 2, 0);\r\n\r\n              if (t.times(t).eq(x)) {\r\n                r = t;\r\n                break;\r\n              }\r\n            }\r\n\r\n            dp += 4;\r\n            s += 4;\r\n            rep = 1;\r\n          } else {\r\n\r\n            // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact\r\n            // result. If not, then there are further digits and m will be truthy.\r\n            if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n              // Truncate to the first rounding digit.\r\n              round(r, r.e + DECIMAL_PLACES + 2, 1);\r\n              m = !r.times(r).eq(x);\r\n            }\r\n\r\n            break;\r\n          }\r\n        }\r\n      }\r\n    }\r\n\r\n    return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this BigNumber in exponential notation and\r\n   * rounded using ROUNDING_MODE to dp fixed decimal places.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n   */\r\n  P.toExponential = function (dp, rm) {\r\n    if (dp != null) {\r\n      intCheck(dp, 0, MAX);\r\n      dp++;\r\n    }\r\n    return format(this, dp, rm, 1);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this BigNumber in fixed-point notation rounding\r\n   * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n   *\r\n   * Note: as with JavaScript's number type, (-0).toFixed(0) is '0',\r\n   * but e.g. (-0.00001).toFixed(0) is '-0'.\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n   */\r\n  P.toFixed = function (dp, rm) {\r\n    if (dp != null) {\r\n      intCheck(dp, 0, MAX);\r\n      dp = dp + this.e + 1;\r\n    }\r\n    return format(this, dp, rm);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this BigNumber in fixed-point notation rounded\r\n   * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties\r\n   * of the format or FORMAT object (see BigNumber.set).\r\n   *\r\n   * The formatting object may contain some or all of the properties shown below.\r\n   *\r\n   * FORMAT = {\r\n   *   prefix: '',\r\n   *   groupSize: 3,\r\n   *   secondaryGroupSize: 0,\r\n   *   groupSeparator: ',',\r\n   *   decimalSeparator: '.',\r\n   *   fractionGroupSize: 0,\r\n   *   fractionGroupSeparator: '\\xA0',      // non-breaking space\r\n   *   suffix: ''\r\n   * };\r\n   *\r\n   * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   * [format] {object} Formatting options. See FORMAT pbject above.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n   * '[BigNumber Error] Argument not an object: {format}'\r\n   */\r\n  P.toFormat = function (dp, rm, format) {\r\n    var str,\r\n      x = this;\r\n\r\n    if (format == null) {\r\n      if (dp != null && rm && typeof rm == 'object') {\r\n        format = rm;\r\n        rm = null;\r\n      } else if (dp && typeof dp == 'object') {\r\n        format = dp;\r\n        dp = rm = null;\r\n      } else {\r\n        format = FORMAT;\r\n      }\r\n    } else if (typeof format != 'object') {\r\n      throw Error\r\n        (bignumberError + 'Argument not an object: ' + format);\r\n    }\r\n\r\n    str = x.toFixed(dp, rm);\r\n\r\n    if (x.c) {\r\n      var i,\r\n        arr = str.split('.'),\r\n        g1 = +format.groupSize,\r\n        g2 = +format.secondaryGroupSize,\r\n        groupSeparator = format.groupSeparator || '',\r\n        intPart = arr[0],\r\n        fractionPart = arr[1],\r\n        isNeg = x.s < 0,\r\n        intDigits = isNeg ? intPart.slice(1) : intPart,\r\n        len = intDigits.length;\r\n\r\n      if (g2) {\r\n        i = g1;\r\n        g1 = g2;\r\n        g2 = i;\r\n        len -= i;\r\n      }\r\n\r\n      if (g1 > 0 && len > 0) {\r\n        i = len % g1 || g1;\r\n        intPart = intDigits.substr(0, i);\r\n        for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1);\r\n        if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);\r\n        if (isNeg) intPart = '-' + intPart;\r\n      }\r\n\r\n      str = fractionPart\r\n       ? intPart + (format.decimalSeparator || '') + ((g2 = +format.fractionGroupSize)\r\n        ? fractionPart.replace(new RegExp('\\\\d{' + g2 + '}\\\\B', 'g'),\r\n         '$&' + (format.fractionGroupSeparator || ''))\r\n        : fractionPart)\r\n       : intPart;\r\n    }\r\n\r\n    return (format.prefix || '') + str + (format.suffix || '');\r\n  };\r\n\r\n\r\n  /*\r\n   * Return an array of two BigNumbers representing the value of this BigNumber as a simple\r\n   * fraction with an integer numerator and an integer denominator.\r\n   * The denominator will be a positive non-zero value less than or equal to the specified\r\n   * maximum denominator. If a maximum denominator is not specified, the denominator will be\r\n   * the lowest value necessary to represent the number exactly.\r\n   *\r\n   * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator.\r\n   *\r\n   * '[BigNumber Error] Argument {not an integer|out of range} : {md}'\r\n   */\r\n  P.toFraction = function (md) {\r\n    var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s,\r\n      x = this,\r\n      xc = x.c;\r\n\r\n    if (md != null) {\r\n      n = new BigNumber(md);\r\n\r\n      // Throw if md is less than one or is not an integer, unless it is Infinity.\r\n      if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) {\r\n        throw Error\r\n          (bignumberError + 'Argument ' +\r\n            (n.isInteger() ? 'out of range: ' : 'not an integer: ') + valueOf(n));\r\n      }\r\n    }\r\n\r\n    if (!xc) return new BigNumber(x);\r\n\r\n    d = new BigNumber(ONE);\r\n    n1 = d0 = new BigNumber(ONE);\r\n    d1 = n0 = new BigNumber(ONE);\r\n    s = coeffToString(xc);\r\n\r\n    // Determine initial denominator.\r\n    // d is a power of 10 and the minimum max denominator that specifies the value exactly.\r\n    e = d.e = s.length - x.e - 1;\r\n    d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];\r\n    md = !md || n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n;\r\n\r\n    exp = MAX_EXP;\r\n    MAX_EXP = 1 / 0;\r\n    n = new BigNumber(s);\r\n\r\n    // n0 = d1 = 0\r\n    n0.c[0] = 0;\r\n\r\n    for (; ;)  {\r\n      q = div(n, d, 0, 1);\r\n      d2 = d0.plus(q.times(d1));\r\n      if (d2.comparedTo(md) == 1) break;\r\n      d0 = d1;\r\n      d1 = d2;\r\n      n1 = n0.plus(q.times(d2 = n1));\r\n      n0 = d2;\r\n      d = n.minus(q.times(d2 = d));\r\n      n = d2;\r\n    }\r\n\r\n    d2 = div(md.minus(d0), d1, 0, 1);\r\n    n0 = n0.plus(d2.times(n1));\r\n    d0 = d0.plus(d2.times(d1));\r\n    n0.s = n1.s = x.s;\r\n    e = e * 2;\r\n\r\n    // Determine which fraction is closer to x, n0/d0 or n1/d1\r\n    r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(\r\n        div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0];\r\n\r\n    MAX_EXP = exp;\r\n\r\n    return r;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return the value of this BigNumber converted to a number primitive.\r\n   */\r\n  P.toNumber = function () {\r\n    return +valueOf(this);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this BigNumber rounded to sd significant digits\r\n   * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits\r\n   * necessary to represent the integer part of the value in fixed-point notation, then use\r\n   * exponential notation.\r\n   *\r\n   * [sd] {number} Significant digits. Integer, 1 to MAX inclusive.\r\n   * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n   *\r\n   * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n   */\r\n  P.toPrecision = function (sd, rm) {\r\n    if (sd != null) intCheck(sd, 1, MAX);\r\n    return format(this, sd, rm, 2);\r\n  };\r\n\r\n\r\n  /*\r\n   * Return a string representing the value of this BigNumber in base b, or base 10 if b is\r\n   * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and\r\n   * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent\r\n   * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than\r\n   * TO_EXP_NEG, return exponential notation.\r\n   *\r\n   * [b] {number} Integer, 2 to ALPHABET.length inclusive.\r\n   *\r\n   * '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n   */\r\n  P.toString = function (b) {\r\n    var str,\r\n      n = this,\r\n      s = n.s,\r\n      e = n.e;\r\n\r\n    // Infinity or NaN?\r\n    if (e === null) {\r\n      if (s) {\r\n        str = 'Infinity';\r\n        if (s < 0) str = '-' + str;\r\n      } else {\r\n        str = 'NaN';\r\n      }\r\n    } else {\r\n      if (b == null) {\r\n        str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n         ? toExponential(coeffToString(n.c), e)\r\n         : toFixedPoint(coeffToString(n.c), e, '0');\r\n      } else if (b === 10 && alphabetHasNormalDecimalDigits) {\r\n        n = round(new BigNumber(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE);\r\n        str = toFixedPoint(coeffToString(n.c), n.e, '0');\r\n      } else {\r\n        intCheck(b, 2, ALPHABET.length, 'Base');\r\n        str = convertBase(toFixedPoint(coeffToString(n.c), e, '0'), 10, b, s, true);\r\n      }\r\n\r\n      if (s < 0 && n.c[0]) str = '-' + str;\r\n    }\r\n\r\n    return str;\r\n  };\r\n\r\n\r\n  /*\r\n   * Return as toString, but do not accept a base argument, and include the minus sign for\r\n   * negative zero.\r\n   */\r\n  P.valueOf = P.toJSON = function () {\r\n    return valueOf(this);\r\n  };\r\n\r\n\r\n  P._isBigNumber = true;\r\n\r\n  P[Symbol.toStringTag] = 'BigNumber';\r\n\r\n  // Node.js v10.12.0+\r\n  P[Symbol.for('nodejs.util.inspect.custom')] = P.valueOf;\r\n\r\n  if (configObject != null) BigNumber.set(configObject);\r\n\r\n  return BigNumber;\r\n}\r\n\r\n\r\n// PRIVATE HELPER FUNCTIONS\r\n\r\n// These functions don't need access to variables,\r\n// e.g. DECIMAL_PLACES, in the scope of the `clone` function above.\r\n\r\n\r\nfunction bitFloor(n) {\r\n  var i = n | 0;\r\n  return n > 0 || n === i ? i : i - 1;\r\n}\r\n\r\n\r\n// Return a coefficient array as a string of base 10 digits.\r\nfunction coeffToString(a) {\r\n  var s, z,\r\n    i = 1,\r\n    j = a.length,\r\n    r = a[0] + '';\r\n\r\n  for (; i < j;) {\r\n    s = a[i++] + '';\r\n    z = LOG_BASE - s.length;\r\n    for (; z--; s = '0' + s);\r\n    r += s;\r\n  }\r\n\r\n  // Determine trailing zeros.\r\n  for (j = r.length; r.charCodeAt(--j) === 48;);\r\n\r\n  return r.slice(0, j + 1 || 1);\r\n}\r\n\r\n\r\n// Compare the value of BigNumbers x and y.\r\nfunction compare(x, y) {\r\n  var a, b,\r\n    xc = x.c,\r\n    yc = y.c,\r\n    i = x.s,\r\n    j = y.s,\r\n    k = x.e,\r\n    l = y.e;\r\n\r\n  // Either NaN?\r\n  if (!i || !j) return null;\r\n\r\n  a = xc && !xc[0];\r\n  b = yc && !yc[0];\r\n\r\n  // Either zero?\r\n  if (a || b) return a ? b ? 0 : -j : i;\r\n\r\n  // Signs differ?\r\n  if (i != j) return i;\r\n\r\n  a = i < 0;\r\n  b = k == l;\r\n\r\n  // Either Infinity?\r\n  if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1;\r\n\r\n  // Compare exponents.\r\n  if (!b) return k > l ^ a ? 1 : -1;\r\n\r\n  j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n  // Compare digit by digit.\r\n  for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;\r\n\r\n  // Compare lengths.\r\n  return k == l ? 0 : k > l ^ a ? 1 : -1;\r\n}\r\n\r\n\r\n/*\r\n * Check that n is a primitive number, an integer, and in range, otherwise throw.\r\n */\r\nfunction intCheck(n, min, max, name) {\r\n  if (n < min || n > max || n !== mathfloor(n)) {\r\n    throw Error\r\n     (bignumberError + (name || 'Argument') + (typeof n == 'number'\r\n       ? n < min || n > max ? ' out of range: ' : ' not an integer: '\r\n       : ' not a primitive number: ') + String(n));\r\n  }\r\n}\r\n\r\n\r\n// Assumes finite n.\r\nfunction isOdd(n) {\r\n  var k = n.c.length - 1;\r\n  return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;\r\n}\r\n\r\n\r\nfunction toExponential(str, e) {\r\n  return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) +\r\n   (e < 0 ? 'e' : 'e+') + e;\r\n}\r\n\r\n\r\nfunction toFixedPoint(str, e, z) {\r\n  var len, zs;\r\n\r\n  // Negative exponent?\r\n  if (e < 0) {\r\n\r\n    // Prepend zeros.\r\n    for (zs = z + '.'; ++e; zs += z);\r\n    str = zs + str;\r\n\r\n  // Positive exponent\r\n  } else {\r\n    len = str.length;\r\n\r\n    // Append zeros.\r\n    if (++e > len) {\r\n      for (zs = z, e -= len; --e; zs += z);\r\n      str += zs;\r\n    } else if (e < len) {\r\n      str = str.slice(0, e) + '.' + str.slice(e);\r\n    }\r\n  }\r\n\r\n  return str;\r\n}\r\n\r\n\r\n// EXPORT\r\n\r\n\r\nexport var BigNumber = clone();\r\n\r\nexport default BigNumber;\r\n","// src/index.ts\nvar SplayTreeNode = class {\n  key;\n  left = null;\n  right = null;\n  constructor(key) {\n    this.key = key;\n  }\n};\nvar SplayTreeSetNode = class extends SplayTreeNode {\n  constructor(key) {\n    super(key);\n  }\n};\nvar SplayTreeMapNode = class _SplayTreeMapNode extends SplayTreeNode {\n  value;\n  constructor(key, value) {\n    super(key);\n    this.value = value;\n  }\n  replaceValue(value) {\n    const node = new _SplayTreeMapNode(this.key, value);\n    node.left = this.left;\n    node.right = this.right;\n    return node;\n  }\n};\nvar SplayTree = class {\n  size = 0;\n  modificationCount = 0;\n  splayCount = 0;\n  splay(key) {\n    const root = this.root;\n    if (root == null) {\n      this.compare(key, key);\n      return -1;\n    }\n    let right = null;\n    let newTreeRight = null;\n    let left = null;\n    let newTreeLeft = null;\n    let current = root;\n    const compare = this.compare;\n    let comp;\n    while (true) {\n      comp = compare(current.key, key);\n      if (comp > 0) {\n        let currentLeft = current.left;\n        if (currentLeft == null) break;\n        comp = compare(currentLeft.key, key);\n        if (comp > 0) {\n          current.left = currentLeft.right;\n          currentLeft.right = current;\n          current = currentLeft;\n          currentLeft = current.left;\n          if (currentLeft == null) break;\n        }\n        if (right == null) {\n          newTreeRight = current;\n        } else {\n          right.left = current;\n        }\n        right = current;\n        current = currentLeft;\n      } else if (comp < 0) {\n        let currentRight = current.right;\n        if (currentRight == null) break;\n        comp = compare(currentRight.key, key);\n        if (comp < 0) {\n          current.right = currentRight.left;\n          currentRight.left = current;\n          current = currentRight;\n          currentRight = current.right;\n          if (currentRight == null) break;\n        }\n        if (left == null) {\n          newTreeLeft = current;\n        } else {\n          left.right = current;\n        }\n        left = current;\n        current = currentRight;\n      } else {\n        break;\n      }\n    }\n    if (left != null) {\n      left.right = current.left;\n      current.left = newTreeLeft;\n    }\n    if (right != null) {\n      right.left = current.right;\n      current.right = newTreeRight;\n    }\n    if (this.root !== current) {\n      this.root = current;\n      this.splayCount++;\n    }\n    return comp;\n  }\n  splayMin(node) {\n    let current = node;\n    let nextLeft = current.left;\n    while (nextLeft != null) {\n      const left = nextLeft;\n      current.left = left.right;\n      left.right = current;\n      current = left;\n      nextLeft = current.left;\n    }\n    return current;\n  }\n  splayMax(node) {\n    let current = node;\n    let nextRight = current.right;\n    while (nextRight != null) {\n      const right = nextRight;\n      current.right = right.left;\n      right.left = current;\n      current = right;\n      nextRight = current.right;\n    }\n    return current;\n  }\n  _delete(key) {\n    if (this.root == null) return null;\n    const comp = this.splay(key);\n    if (comp != 0) return null;\n    let root = this.root;\n    const result = root;\n    const left = root.left;\n    this.size--;\n    if (left == null) {\n      this.root = root.right;\n    } else {\n      const right = root.right;\n      root = this.splayMax(left);\n      root.right = right;\n      this.root = root;\n    }\n    this.modificationCount++;\n    return result;\n  }\n  addNewRoot(node, comp) {\n    this.size++;\n    this.modificationCount++;\n    const root = this.root;\n    if (root == null) {\n      this.root = node;\n      return;\n    }\n    if (comp < 0) {\n      node.left = root;\n      node.right = root.right;\n      root.right = null;\n    } else {\n      node.right = root;\n      node.left = root.left;\n      root.left = null;\n    }\n    this.root = node;\n  }\n  _first() {\n    const root = this.root;\n    if (root == null) return null;\n    this.root = this.splayMin(root);\n    return this.root;\n  }\n  _last() {\n    const root = this.root;\n    if (root == null) return null;\n    this.root = this.splayMax(root);\n    return this.root;\n  }\n  clear() {\n    this.root = null;\n    this.size = 0;\n    this.modificationCount++;\n  }\n  has(key) {\n    return this.validKey(key) && this.splay(key) == 0;\n  }\n  defaultCompare() {\n    return (a, b) => a < b ? -1 : a > b ? 1 : 0;\n  }\n  wrap() {\n    return {\n      getRoot: () => {\n        return this.root;\n      },\n      setRoot: (root) => {\n        this.root = root;\n      },\n      getSize: () => {\n        return this.size;\n      },\n      getModificationCount: () => {\n        return this.modificationCount;\n      },\n      getSplayCount: () => {\n        return this.splayCount;\n      },\n      setSplayCount: (count) => {\n        this.splayCount = count;\n      },\n      splay: (key) => {\n        return this.splay(key);\n      },\n      has: (key) => {\n        return this.has(key);\n      }\n    };\n  }\n};\nvar SplayTreeMap = class extends SplayTree {\n  root = null;\n  compare;\n  validKey;\n  constructor(compare, isValidKey) {\n    super();\n    this.compare = compare ?? this.defaultCompare();\n    this.validKey = isValidKey ?? ((a) => a != null && a != void 0);\n  }\n  delete(key) {\n    if (!this.validKey(key)) return false;\n    return this._delete(key) != null;\n  }\n  forEach(f) {\n    const nodes = new SplayTreeMapEntryIterableIterator(this.wrap());\n    let result;\n    while (result = nodes.next(), !result.done) {\n      f(result.value[1], result.value[0], this);\n    }\n  }\n  get(key) {\n    if (!this.validKey(key)) return void 0;\n    if (this.root != null) {\n      const comp = this.splay(key);\n      if (comp == 0) {\n        return this.root.value;\n      }\n    }\n    return void 0;\n  }\n  hasValue(value) {\n    const initialSplayCount = this.splayCount;\n    const visit = (node) => {\n      while (node != null) {\n        if (node.value == value) return true;\n        if (initialSplayCount != this.splayCount) {\n          throw \"Concurrent modification during iteration.\";\n        }\n        if (node.right != null && visit(node.right)) {\n          return true;\n        }\n        node = node.left;\n      }\n      return false;\n    };\n    return visit(this.root);\n  }\n  set(key, value) {\n    const comp = this.splay(key);\n    if (comp == 0) {\n      this.root = this.root.replaceValue(value);\n      this.splayCount += 1;\n      return this;\n    }\n    this.addNewRoot(new SplayTreeMapNode(key, value), comp);\n    return this;\n  }\n  setAll(other) {\n    other.forEach((value, key) => {\n      this.set(key, value);\n    });\n  }\n  setIfAbsent(key, ifAbsent) {\n    let comp = this.splay(key);\n    if (comp == 0) {\n      return this.root.value;\n    }\n    const modificationCount = this.modificationCount;\n    const splayCount = this.splayCount;\n    const value = ifAbsent();\n    if (modificationCount != this.modificationCount) {\n      throw \"Concurrent modification during iteration.\";\n    }\n    if (splayCount != this.splayCount) {\n      comp = this.splay(key);\n    }\n    this.addNewRoot(new SplayTreeMapNode(key, value), comp);\n    return value;\n  }\n  isEmpty() {\n    return this.root == null;\n  }\n  isNotEmpty() {\n    return !this.isEmpty();\n  }\n  firstKey() {\n    if (this.root == null) return null;\n    return this._first().key;\n  }\n  lastKey() {\n    if (this.root == null) return null;\n    return this._last().key;\n  }\n  lastKeyBefore(key) {\n    if (key == null) throw \"Invalid arguments(s)\";\n    if (this.root == null) return null;\n    const comp = this.splay(key);\n    if (comp < 0) return this.root.key;\n    let node = this.root.left;\n    if (node == null) return null;\n    let nodeRight = node.right;\n    while (nodeRight != null) {\n      node = nodeRight;\n      nodeRight = node.right;\n    }\n    return node.key;\n  }\n  firstKeyAfter(key) {\n    if (key == null) throw \"Invalid arguments(s)\";\n    if (this.root == null) return null;\n    const comp = this.splay(key);\n    if (comp > 0) return this.root.key;\n    let node = this.root.right;\n    if (node == null) return null;\n    let nodeLeft = node.left;\n    while (nodeLeft != null) {\n      node = nodeLeft;\n      nodeLeft = node.left;\n    }\n    return node.key;\n  }\n  update(key, update, ifAbsent) {\n    let comp = this.splay(key);\n    if (comp == 0) {\n      const modificationCount = this.modificationCount;\n      const splayCount = this.splayCount;\n      const newValue = update(this.root.value);\n      if (modificationCount != this.modificationCount) {\n        throw \"Concurrent modification during iteration.\";\n      }\n      if (splayCount != this.splayCount) {\n        this.splay(key);\n      }\n      this.root = this.root.replaceValue(newValue);\n      this.splayCount += 1;\n      return newValue;\n    }\n    if (ifAbsent != null) {\n      const modificationCount = this.modificationCount;\n      const splayCount = this.splayCount;\n      const newValue = ifAbsent();\n      if (modificationCount != this.modificationCount) {\n        throw \"Concurrent modification during iteration.\";\n      }\n      if (splayCount != this.splayCount) {\n        comp = this.splay(key);\n      }\n      this.addNewRoot(new SplayTreeMapNode(key, newValue), comp);\n      return newValue;\n    }\n    throw \"Invalid argument (key): Key not in map.\";\n  }\n  updateAll(update) {\n    const root = this.root;\n    if (root == null) return;\n    const iterator = new SplayTreeMapEntryIterableIterator(this.wrap());\n    let node;\n    while (node = iterator.next(), !node.done) {\n      const newValue = update(...node.value);\n      iterator.replaceValue(newValue);\n    }\n  }\n  keys() {\n    return new SplayTreeKeyIterableIterator(this.wrap());\n  }\n  values() {\n    return new SplayTreeValueIterableIterator(this.wrap());\n  }\n  entries() {\n    return this[Symbol.iterator]();\n  }\n  [Symbol.iterator]() {\n    return new SplayTreeMapEntryIterableIterator(this.wrap());\n  }\n  [Symbol.toStringTag] = \"[object Map]\";\n};\nvar SplayTreeSet = class _SplayTreeSet extends SplayTree {\n  root = null;\n  compare;\n  validKey;\n  constructor(compare, isValidKey) {\n    super();\n    this.compare = compare ?? this.defaultCompare();\n    this.validKey = isValidKey ?? ((v) => v != null && v != void 0);\n  }\n  delete(element) {\n    if (!this.validKey(element)) return false;\n    return this._delete(element) != null;\n  }\n  deleteAll(elements) {\n    for (const element of elements) {\n      this.delete(element);\n    }\n  }\n  forEach(f) {\n    const nodes = this[Symbol.iterator]();\n    let result;\n    while (result = nodes.next(), !result.done) {\n      f(result.value, result.value, this);\n    }\n  }\n  add(element) {\n    const compare = this.splay(element);\n    if (compare != 0) this.addNewRoot(new SplayTreeSetNode(element), compare);\n    return this;\n  }\n  addAndReturn(element) {\n    const compare = this.splay(element);\n    if (compare != 0) this.addNewRoot(new SplayTreeSetNode(element), compare);\n    return this.root.key;\n  }\n  addAll(elements) {\n    for (const element of elements) {\n      this.add(element);\n    }\n  }\n  isEmpty() {\n    return this.root == null;\n  }\n  isNotEmpty() {\n    return this.root != null;\n  }\n  single() {\n    if (this.size == 0) throw \"Bad state: No element\";\n    if (this.size > 1) throw \"Bad state: Too many element\";\n    return this.root.key;\n  }\n  first() {\n    if (this.size == 0) throw \"Bad state: No element\";\n    return this._first().key;\n  }\n  last() {\n    if (this.size == 0) throw \"Bad state: No element\";\n    return this._last().key;\n  }\n  lastBefore(element) {\n    if (element == null) throw \"Invalid arguments(s)\";\n    if (this.root == null) return null;\n    const comp = this.splay(element);\n    if (comp < 0) return this.root.key;\n    let node = this.root.left;\n    if (node == null) return null;\n    let nodeRight = node.right;\n    while (nodeRight != null) {\n      node = nodeRight;\n      nodeRight = node.right;\n    }\n    return node.key;\n  }\n  firstAfter(element) {\n    if (element == null) throw \"Invalid arguments(s)\";\n    if (this.root == null) return null;\n    const comp = this.splay(element);\n    if (comp > 0) return this.root.key;\n    let node = this.root.right;\n    if (node == null) return null;\n    let nodeLeft = node.left;\n    while (nodeLeft != null) {\n      node = nodeLeft;\n      nodeLeft = node.left;\n    }\n    return node.key;\n  }\n  retainAll(elements) {\n    const retainSet = new _SplayTreeSet(this.compare, this.validKey);\n    const modificationCount = this.modificationCount;\n    for (const object of elements) {\n      if (modificationCount != this.modificationCount) {\n        throw \"Concurrent modification during iteration.\";\n      }\n      if (this.validKey(object) && this.splay(object) == 0) {\n        retainSet.add(this.root.key);\n      }\n    }\n    if (retainSet.size != this.size) {\n      this.root = retainSet.root;\n      this.size = retainSet.size;\n      this.modificationCount++;\n    }\n  }\n  lookup(object) {\n    if (!this.validKey(object)) return null;\n    const comp = this.splay(object);\n    if (comp != 0) return null;\n    return this.root.key;\n  }\n  intersection(other) {\n    const result = new _SplayTreeSet(this.compare, this.validKey);\n    for (const element of this) {\n      if (other.has(element)) result.add(element);\n    }\n    return result;\n  }\n  difference(other) {\n    const result = new _SplayTreeSet(this.compare, this.validKey);\n    for (const element of this) {\n      if (!other.has(element)) result.add(element);\n    }\n    return result;\n  }\n  union(other) {\n    const u = this.clone();\n    u.addAll(other);\n    return u;\n  }\n  clone() {\n    const set = new _SplayTreeSet(this.compare, this.validKey);\n    set.size = this.size;\n    set.root = this.copyNode(this.root);\n    return set;\n  }\n  copyNode(node) {\n    if (node == null) return null;\n    function copyChildren(node2, dest) {\n      let left;\n      let right;\n      do {\n        left = node2.left;\n        right = node2.right;\n        if (left != null) {\n          const newLeft = new SplayTreeSetNode(left.key);\n          dest.left = newLeft;\n          copyChildren(left, newLeft);\n        }\n        if (right != null) {\n          const newRight = new SplayTreeSetNode(right.key);\n          dest.right = newRight;\n          node2 = right;\n          dest = newRight;\n        }\n      } while (right != null);\n    }\n    const result = new SplayTreeSetNode(node.key);\n    copyChildren(node, result);\n    return result;\n  }\n  toSet() {\n    return this.clone();\n  }\n  entries() {\n    return new SplayTreeSetEntryIterableIterator(this.wrap());\n  }\n  keys() {\n    return this[Symbol.iterator]();\n  }\n  values() {\n    return this[Symbol.iterator]();\n  }\n  [Symbol.iterator]() {\n    return new SplayTreeKeyIterableIterator(this.wrap());\n  }\n  [Symbol.toStringTag] = \"[object Set]\";\n};\nvar SplayTreeIterableIterator = class {\n  tree;\n  path = new Array();\n  modificationCount = null;\n  splayCount;\n  constructor(tree) {\n    this.tree = tree;\n    this.splayCount = tree.getSplayCount();\n  }\n  [Symbol.iterator]() {\n    return this;\n  }\n  next() {\n    if (this.moveNext()) return { done: false, value: this.current() };\n    return { done: true, value: null };\n  }\n  current() {\n    if (!this.path.length) return null;\n    const node = this.path[this.path.length - 1];\n    return this.getValue(node);\n  }\n  rebuildPath(key) {\n    this.path.splice(0, this.path.length);\n    this.tree.splay(key);\n    this.path.push(this.tree.getRoot());\n    this.splayCount = this.tree.getSplayCount();\n  }\n  findLeftMostDescendent(node) {\n    while (node != null) {\n      this.path.push(node);\n      node = node.left;\n    }\n  }\n  moveNext() {\n    if (this.modificationCount != this.tree.getModificationCount()) {\n      if (this.modificationCount == null) {\n        this.modificationCount = this.tree.getModificationCount();\n        let node2 = this.tree.getRoot();\n        while (node2 != null) {\n          this.path.push(node2);\n          node2 = node2.left;\n        }\n        return this.path.length > 0;\n      }\n      throw \"Concurrent modification during iteration.\";\n    }\n    if (!this.path.length) return false;\n    if (this.splayCount != this.tree.getSplayCount()) {\n      this.rebuildPath(this.path[this.path.length - 1].key);\n    }\n    let node = this.path[this.path.length - 1];\n    let next = node.right;\n    if (next != null) {\n      while (next != null) {\n        this.path.push(next);\n        next = next.left;\n      }\n      return true;\n    }\n    this.path.pop();\n    while (this.path.length && this.path[this.path.length - 1].right === node) {\n      node = this.path.pop();\n    }\n    return this.path.length > 0;\n  }\n};\nvar SplayTreeKeyIterableIterator = class extends SplayTreeIterableIterator {\n  getValue(node) {\n    return node.key;\n  }\n};\nvar SplayTreeSetEntryIterableIterator = class extends SplayTreeIterableIterator {\n  getValue(node) {\n    return [node.key, node.key];\n  }\n};\nvar SplayTreeValueIterableIterator = class extends SplayTreeIterableIterator {\n  constructor(map) {\n    super(map);\n  }\n  getValue(node) {\n    return node.value;\n  }\n};\nvar SplayTreeMapEntryIterableIterator = class extends SplayTreeIterableIterator {\n  constructor(map) {\n    super(map);\n  }\n  getValue(node) {\n    return [node.key, node.value];\n  }\n  replaceValue(value) {\n    if (this.modificationCount != this.tree.getModificationCount()) {\n      throw \"Concurrent modification during iteration.\";\n    }\n    if (this.splayCount != this.tree.getSplayCount()) {\n      this.rebuildPath(this.path[this.path.length - 1].key);\n    }\n    const last = this.path.pop();\n    const newLast = last.replaceValue(value);\n    if (!this.path.length) {\n      this.tree.setRoot(newLast);\n    } else {\n      const parent = this.path[this.path.length - 1];\n      if (last === parent.left) {\n        parent.left = newLast;\n      } else {\n        parent.right = newLast;\n      }\n    }\n    this.path.push(newLast);\n    const count = this.tree.getSplayCount() + 1;\n    this.tree.setSplayCount(count);\n    this.splayCount = count;\n  }\n};\nexport {\n  SplayTreeMap,\n  SplayTreeSet\n};\n//# sourceMappingURL=index.js.map","// src/geom-in.ts\nimport BigNumber2 from \"bignumber.js\";\n\n// src/constant.ts\nvar constant_default = (x) => {\n  return () => {\n    return x;\n  };\n};\n\n// src/compare.ts\nvar compare_default = (eps) => {\n  const almostEqual = eps ? (a, b) => b.minus(a).abs().isLessThanOrEqualTo(eps) : constant_default(false);\n  return (a, b) => {\n    if (almostEqual(a, b)) return 0;\n    return a.comparedTo(b);\n  };\n};\n\n// src/orient.ts\nfunction orient_default(eps) {\n  const almostCollinear = eps ? (area2, ax, ay, cx, cy) => area2.exponentiatedBy(2).isLessThanOrEqualTo(\n    cx.minus(ax).exponentiatedBy(2).plus(cy.minus(ay).exponentiatedBy(2)).times(eps)\n  ) : constant_default(false);\n  return (a, b, c) => {\n    const ax = a.x, ay = a.y, cx = c.x, cy = c.y;\n    const area2 = ay.minus(cy).times(b.x.minus(cx)).minus(ax.minus(cx).times(b.y.minus(cy)));\n    if (almostCollinear(area2, ax, ay, cx, cy)) return 0;\n    return area2.comparedTo(0);\n  };\n}\n\n// src/snap.ts\nimport BigNumber from \"bignumber.js\";\nimport { SplayTreeSet } from \"splaytree-ts\";\n\n// src/identity.ts\nvar identity_default = (x) => {\n  return x;\n};\n\n// src/snap.ts\nvar snap_default = (eps) => {\n  if (eps) {\n    const xTree = new SplayTreeSet(compare_default(eps));\n    const yTree = new SplayTreeSet(compare_default(eps));\n    const snapCoord = (coord, tree) => {\n      return tree.addAndReturn(coord);\n    };\n    const snap = (v) => {\n      return {\n        x: snapCoord(v.x, xTree),\n        y: snapCoord(v.y, yTree)\n      };\n    };\n    snap({ x: new BigNumber(0), y: new BigNumber(0) });\n    return snap;\n  }\n  return identity_default;\n};\n\n// src/precision.ts\nvar set = (eps) => {\n  return {\n    set: (eps2) => {\n      precision = set(eps2);\n    },\n    reset: () => set(eps),\n    compare: compare_default(eps),\n    snap: snap_default(eps),\n    orient: orient_default(eps)\n  };\n};\nvar precision = set();\n\n// src/bbox.ts\nvar isInBbox = (bbox, point) => {\n  return bbox.ll.x.isLessThanOrEqualTo(point.x) && point.x.isLessThanOrEqualTo(bbox.ur.x) && bbox.ll.y.isLessThanOrEqualTo(point.y) && point.y.isLessThanOrEqualTo(bbox.ur.y);\n};\nvar getBboxOverlap = (b1, b2) => {\n  if (b2.ur.x.isLessThan(b1.ll.x) || b1.ur.x.isLessThan(b2.ll.x) || b2.ur.y.isLessThan(b1.ll.y) || b1.ur.y.isLessThan(b2.ll.y))\n    return null;\n  const lowerX = b1.ll.x.isLessThan(b2.ll.x) ? b2.ll.x : b1.ll.x;\n  const upperX = b1.ur.x.isLessThan(b2.ur.x) ? b1.ur.x : b2.ur.x;\n  const lowerY = b1.ll.y.isLessThan(b2.ll.y) ? b2.ll.y : b1.ll.y;\n  const upperY = b1.ur.y.isLessThan(b2.ur.y) ? b1.ur.y : b2.ur.y;\n  return { ll: { x: lowerX, y: lowerY }, ur: { x: upperX, y: upperY } };\n};\n\n// src/operation.ts\nimport { SplayTreeSet as SplayTreeSet3 } from \"splaytree-ts\";\n\n// src/vector.ts\nvar crossProduct = (a, b) => a.x.times(b.y).minus(a.y.times(b.x));\nvar dotProduct = (a, b) => a.x.times(b.x).plus(a.y.times(b.y));\nvar length = (v) => dotProduct(v, v).sqrt();\nvar sineOfAngle = (pShared, pBase, pAngle) => {\n  const vBase = { x: pBase.x.minus(pShared.x), y: pBase.y.minus(pShared.y) };\n  const vAngle = { x: pAngle.x.minus(pShared.x), y: pAngle.y.minus(pShared.y) };\n  return crossProduct(vAngle, vBase).div(length(vAngle)).div(length(vBase));\n};\nvar cosineOfAngle = (pShared, pBase, pAngle) => {\n  const vBase = { x: pBase.x.minus(pShared.x), y: pBase.y.minus(pShared.y) };\n  const vAngle = { x: pAngle.x.minus(pShared.x), y: pAngle.y.minus(pShared.y) };\n  return dotProduct(vAngle, vBase).div(length(vAngle)).div(length(vBase));\n};\nvar horizontalIntersection = (pt, v, y) => {\n  if (v.y.isZero()) return null;\n  return { x: pt.x.plus(v.x.div(v.y).times(y.minus(pt.y))), y };\n};\nvar verticalIntersection = (pt, v, x) => {\n  if (v.x.isZero()) return null;\n  return { x, y: pt.y.plus(v.y.div(v.x).times(x.minus(pt.x))) };\n};\nvar intersection = (pt1, v1, pt2, v2) => {\n  if (v1.x.isZero()) return verticalIntersection(pt2, v2, pt1.x);\n  if (v2.x.isZero()) return verticalIntersection(pt1, v1, pt2.x);\n  if (v1.y.isZero()) return horizontalIntersection(pt2, v2, pt1.y);\n  if (v2.y.isZero()) return horizontalIntersection(pt1, v1, pt2.y);\n  const kross = crossProduct(v1, v2);\n  if (kross.isZero()) return null;\n  const ve = { x: pt2.x.minus(pt1.x), y: pt2.y.minus(pt1.y) };\n  const d1 = crossProduct(ve, v1).div(kross);\n  const d2 = crossProduct(ve, v2).div(kross);\n  const x1 = pt1.x.plus(d2.times(v1.x)), x2 = pt2.x.plus(d1.times(v2.x));\n  const y1 = pt1.y.plus(d2.times(v1.y)), y2 = pt2.y.plus(d1.times(v2.y));\n  const x = x1.plus(x2).div(2);\n  const y = y1.plus(y2).div(2);\n  return { x, y };\n};\n\n// src/sweep-event.ts\nvar SweepEvent = class _SweepEvent {\n  point;\n  isLeft;\n  segment;\n  otherSE;\n  consumedBy;\n  // for ordering sweep events in the sweep event queue\n  static compare(a, b) {\n    const ptCmp = _SweepEvent.comparePoints(a.point, b.point);\n    if (ptCmp !== 0) return ptCmp;\n    if (a.point !== b.point) a.link(b);\n    if (a.isLeft !== b.isLeft) return a.isLeft ? 1 : -1;\n    return Segment.compare(a.segment, b.segment);\n  }\n  // for ordering points in sweep line order\n  static comparePoints(aPt, bPt) {\n    if (aPt.x.isLessThan(bPt.x)) return -1;\n    if (aPt.x.isGreaterThan(bPt.x)) return 1;\n    if (aPt.y.isLessThan(bPt.y)) return -1;\n    if (aPt.y.isGreaterThan(bPt.y)) return 1;\n    return 0;\n  }\n  // Warning: 'point' input will be modified and re-used (for performance)\n  constructor(point, isLeft) {\n    if (point.events === void 0) point.events = [this];\n    else point.events.push(this);\n    this.point = point;\n    this.isLeft = isLeft;\n  }\n  link(other) {\n    if (other.point === this.point) {\n      throw new Error(\"Tried to link already linked events\");\n    }\n    const otherEvents = other.point.events;\n    for (let i = 0, iMax = otherEvents.length; i < iMax; i++) {\n      const evt = otherEvents[i];\n      this.point.events.push(evt);\n      evt.point = this.point;\n    }\n    this.checkForConsuming();\n  }\n  /* Do a pass over our linked events and check to see if any pair\n   * of segments match, and should be consumed. */\n  checkForConsuming() {\n    const numEvents = this.point.events.length;\n    for (let i = 0; i < numEvents; i++) {\n      const evt1 = this.point.events[i];\n      if (evt1.segment.consumedBy !== void 0) continue;\n      for (let j = i + 1; j < numEvents; j++) {\n        const evt2 = this.point.events[j];\n        if (evt2.consumedBy !== void 0) continue;\n        if (evt1.otherSE.point.events !== evt2.otherSE.point.events) continue;\n        evt1.segment.consume(evt2.segment);\n      }\n    }\n  }\n  getAvailableLinkedEvents() {\n    const events = [];\n    for (let i = 0, iMax = this.point.events.length; i < iMax; i++) {\n      const evt = this.point.events[i];\n      if (evt !== this && !evt.segment.ringOut && evt.segment.isInResult()) {\n        events.push(evt);\n      }\n    }\n    return events;\n  }\n  /**\n   * Returns a comparator function for sorting linked events that will\n   * favor the event that will give us the smallest left-side angle.\n   * All ring construction starts as low as possible heading to the right,\n   * so by always turning left as sharp as possible we'll get polygons\n   * without uncessary loops & holes.\n   *\n   * The comparator function has a compute cache such that it avoids\n   * re-computing already-computed values.\n   */\n  getLeftmostComparator(baseEvent) {\n    const cache = /* @__PURE__ */ new Map();\n    const fillCache = (linkedEvent) => {\n      const nextEvent = linkedEvent.otherSE;\n      cache.set(linkedEvent, {\n        sine: sineOfAngle(this.point, baseEvent.point, nextEvent.point),\n        cosine: cosineOfAngle(this.point, baseEvent.point, nextEvent.point)\n      });\n    };\n    return (a, b) => {\n      if (!cache.has(a)) fillCache(a);\n      if (!cache.has(b)) fillCache(b);\n      const { sine: asine, cosine: acosine } = cache.get(a);\n      const { sine: bsine, cosine: bcosine } = cache.get(b);\n      if (asine.isGreaterThanOrEqualTo(0) && bsine.isGreaterThanOrEqualTo(0)) {\n        if (acosine.isLessThan(bcosine)) return 1;\n        if (acosine.isGreaterThan(bcosine)) return -1;\n        return 0;\n      }\n      if (asine.isLessThan(0) && bsine.isLessThan(0)) {\n        if (acosine.isLessThan(bcosine)) return -1;\n        if (acosine.isGreaterThan(bcosine)) return 1;\n        return 0;\n      }\n      if (bsine.isLessThan(asine)) return -1;\n      if (bsine.isGreaterThan(asine)) return 1;\n      return 0;\n    };\n  }\n};\n\n// src/geom-out.ts\nvar RingOut = class _RingOut {\n  events;\n  poly;\n  _isExteriorRing;\n  _enclosingRing;\n  /* Given the segments from the sweep line pass, compute & return a series\n   * of closed rings from all the segments marked to be part of the result */\n  static factory(allSegments) {\n    const ringsOut = [];\n    for (let i = 0, iMax = allSegments.length; i < iMax; i++) {\n      const segment = allSegments[i];\n      if (!segment.isInResult() || segment.ringOut) continue;\n      let prevEvent = null;\n      let event = segment.leftSE;\n      let nextEvent = segment.rightSE;\n      const events = [event];\n      const startingPoint = event.point;\n      const intersectionLEs = [];\n      while (true) {\n        prevEvent = event;\n        event = nextEvent;\n        events.push(event);\n        if (event.point === startingPoint) break;\n        while (true) {\n          const availableLEs = event.getAvailableLinkedEvents();\n          if (availableLEs.length === 0) {\n            const firstPt = events[0].point;\n            const lastPt = events[events.length - 1].point;\n            throw new Error(\n              `Unable to complete output ring starting at [${firstPt.x}, ${firstPt.y}]. Last matching segment found ends at [${lastPt.x}, ${lastPt.y}].`\n            );\n          }\n          if (availableLEs.length === 1) {\n            nextEvent = availableLEs[0].otherSE;\n            break;\n          }\n          let indexLE = null;\n          for (let j = 0, jMax = intersectionLEs.length; j < jMax; j++) {\n            if (intersectionLEs[j].point === event.point) {\n              indexLE = j;\n              break;\n            }\n          }\n          if (indexLE !== null) {\n            const intersectionLE = intersectionLEs.splice(indexLE)[0];\n            const ringEvents = events.splice(intersectionLE.index);\n            ringEvents.unshift(ringEvents[0].otherSE);\n            ringsOut.push(new _RingOut(ringEvents.reverse()));\n            continue;\n          }\n          intersectionLEs.push({\n            index: events.length,\n            point: event.point\n          });\n          const comparator = event.getLeftmostComparator(prevEvent);\n          nextEvent = availableLEs.sort(comparator)[0].otherSE;\n          break;\n        }\n      }\n      ringsOut.push(new _RingOut(events));\n    }\n    return ringsOut;\n  }\n  constructor(events) {\n    this.events = events;\n    for (let i = 0, iMax = events.length; i < iMax; i++) {\n      events[i].segment.ringOut = this;\n    }\n    this.poly = null;\n  }\n  getGeom() {\n    let prevPt = this.events[0].point;\n    const points = [prevPt];\n    for (let i = 1, iMax = this.events.length - 1; i < iMax; i++) {\n      const pt2 = this.events[i].point;\n      const nextPt2 = this.events[i + 1].point;\n      if (precision.orient(pt2, prevPt, nextPt2) === 0) continue;\n      points.push(pt2);\n      prevPt = pt2;\n    }\n    if (points.length === 1) return null;\n    const pt = points[0];\n    const nextPt = points[1];\n    if (precision.orient(pt, prevPt, nextPt) === 0) points.shift();\n    points.push(points[0]);\n    const step = this.isExteriorRing() ? 1 : -1;\n    const iStart = this.isExteriorRing() ? 0 : points.length - 1;\n    const iEnd = this.isExteriorRing() ? points.length : -1;\n    const orderedPoints = [];\n    for (let i = iStart; i != iEnd; i += step)\n      orderedPoints.push([points[i].x.toNumber(), points[i].y.toNumber()]);\n    return orderedPoints;\n  }\n  isExteriorRing() {\n    if (this._isExteriorRing === void 0) {\n      const enclosing = this.enclosingRing();\n      this._isExteriorRing = enclosing ? !enclosing.isExteriorRing() : true;\n    }\n    return this._isExteriorRing;\n  }\n  enclosingRing() {\n    if (this._enclosingRing === void 0) {\n      this._enclosingRing = this._calcEnclosingRing();\n    }\n    return this._enclosingRing;\n  }\n  /* Returns the ring that encloses this one, if any */\n  _calcEnclosingRing() {\n    let leftMostEvt = this.events[0];\n    for (let i = 1, iMax = this.events.length; i < iMax; i++) {\n      const evt = this.events[i];\n      if (SweepEvent.compare(leftMostEvt, evt) > 0) leftMostEvt = evt;\n    }\n    let prevSeg = leftMostEvt.segment.prevInResult();\n    let prevPrevSeg = prevSeg ? prevSeg.prevInResult() : null;\n    while (true) {\n      if (!prevSeg) return null;\n      if (!prevPrevSeg) return prevSeg.ringOut;\n      if (prevPrevSeg.ringOut !== prevSeg.ringOut) {\n        if (prevPrevSeg.ringOut?.enclosingRing() !== prevSeg.ringOut) {\n          return prevSeg.ringOut;\n        } else return prevSeg.ringOut?.enclosingRing();\n      }\n      prevSeg = prevPrevSeg.prevInResult();\n      prevPrevSeg = prevSeg ? prevSeg.prevInResult() : null;\n    }\n  }\n};\nvar PolyOut = class {\n  exteriorRing;\n  interiorRings;\n  constructor(exteriorRing) {\n    this.exteriorRing = exteriorRing;\n    exteriorRing.poly = this;\n    this.interiorRings = [];\n  }\n  addInterior(ring) {\n    this.interiorRings.push(ring);\n    ring.poly = this;\n  }\n  getGeom() {\n    const geom0 = this.exteriorRing.getGeom();\n    if (geom0 === null) return null;\n    const geom = [geom0];\n    for (let i = 0, iMax = this.interiorRings.length; i < iMax; i++) {\n      const ringGeom = this.interiorRings[i].getGeom();\n      if (ringGeom === null) continue;\n      geom.push(ringGeom);\n    }\n    return geom;\n  }\n};\nvar MultiPolyOut = class {\n  rings;\n  polys;\n  constructor(rings) {\n    this.rings = rings;\n    this.polys = this._composePolys(rings);\n  }\n  getGeom() {\n    const geom = [];\n    for (let i = 0, iMax = this.polys.length; i < iMax; i++) {\n      const polyGeom = this.polys[i].getGeom();\n      if (polyGeom === null) continue;\n      geom.push(polyGeom);\n    }\n    return geom;\n  }\n  _composePolys(rings) {\n    const polys = [];\n    for (let i = 0, iMax = rings.length; i < iMax; i++) {\n      const ring = rings[i];\n      if (ring.poly) continue;\n      if (ring.isExteriorRing()) polys.push(new PolyOut(ring));\n      else {\n        const enclosingRing = ring.enclosingRing();\n        if (!enclosingRing?.poly) polys.push(new PolyOut(enclosingRing));\n        enclosingRing?.poly?.addInterior(ring);\n      }\n    }\n    return polys;\n  }\n};\n\n// src/sweep-line.ts\nimport { SplayTreeSet as SplayTreeSet2 } from \"splaytree-ts\";\nvar SweepLine = class {\n  queue;\n  tree;\n  segments;\n  constructor(queue, comparator = Segment.compare) {\n    this.queue = queue;\n    this.tree = new SplayTreeSet2(comparator);\n    this.segments = [];\n  }\n  process(event) {\n    const segment = event.segment;\n    const newEvents = [];\n    if (event.consumedBy) {\n      if (event.isLeft) this.queue.delete(event.otherSE);\n      else this.tree.delete(segment);\n      return newEvents;\n    }\n    if (event.isLeft) this.tree.add(segment);\n    let prevSeg = segment;\n    let nextSeg = segment;\n    do {\n      prevSeg = this.tree.lastBefore(prevSeg);\n    } while (prevSeg != null && prevSeg.consumedBy != void 0);\n    do {\n      nextSeg = this.tree.firstAfter(nextSeg);\n    } while (nextSeg != null && nextSeg.consumedBy != void 0);\n    if (event.isLeft) {\n      let prevMySplitter = null;\n      if (prevSeg) {\n        const prevInter = prevSeg.getIntersection(segment);\n        if (prevInter !== null) {\n          if (!segment.isAnEndpoint(prevInter)) prevMySplitter = prevInter;\n          if (!prevSeg.isAnEndpoint(prevInter)) {\n            const newEventsFromSplit = this._splitSafely(prevSeg, prevInter);\n            for (let i = 0, iMax = newEventsFromSplit.length; i < iMax; i++) {\n              newEvents.push(newEventsFromSplit[i]);\n            }\n          }\n        }\n      }\n      let nextMySplitter = null;\n      if (nextSeg) {\n        const nextInter = nextSeg.getIntersection(segment);\n        if (nextInter !== null) {\n          if (!segment.isAnEndpoint(nextInter)) nextMySplitter = nextInter;\n          if (!nextSeg.isAnEndpoint(nextInter)) {\n            const newEventsFromSplit = this._splitSafely(nextSeg, nextInter);\n            for (let i = 0, iMax = newEventsFromSplit.length; i < iMax; i++) {\n              newEvents.push(newEventsFromSplit[i]);\n            }\n          }\n        }\n      }\n      if (prevMySplitter !== null || nextMySplitter !== null) {\n        let mySplitter = null;\n        if (prevMySplitter === null) mySplitter = nextMySplitter;\n        else if (nextMySplitter === null) mySplitter = prevMySplitter;\n        else {\n          const cmpSplitters = SweepEvent.comparePoints(\n            prevMySplitter,\n            nextMySplitter\n          );\n          mySplitter = cmpSplitters <= 0 ? prevMySplitter : nextMySplitter;\n        }\n        this.queue.delete(segment.rightSE);\n        newEvents.push(segment.rightSE);\n        const newEventsFromSplit = segment.split(mySplitter);\n        for (let i = 0, iMax = newEventsFromSplit.length; i < iMax; i++) {\n          newEvents.push(newEventsFromSplit[i]);\n        }\n      }\n      if (newEvents.length > 0) {\n        this.tree.delete(segment);\n        newEvents.push(event);\n      } else {\n        this.segments.push(segment);\n        segment.prev = prevSeg;\n      }\n    } else {\n      if (prevSeg && nextSeg) {\n        const inter = prevSeg.getIntersection(nextSeg);\n        if (inter !== null) {\n          if (!prevSeg.isAnEndpoint(inter)) {\n            const newEventsFromSplit = this._splitSafely(prevSeg, inter);\n            for (let i = 0, iMax = newEventsFromSplit.length; i < iMax; i++) {\n              newEvents.push(newEventsFromSplit[i]);\n            }\n          }\n          if (!nextSeg.isAnEndpoint(inter)) {\n            const newEventsFromSplit = this._splitSafely(nextSeg, inter);\n            for (let i = 0, iMax = newEventsFromSplit.length; i < iMax; i++) {\n              newEvents.push(newEventsFromSplit[i]);\n            }\n          }\n        }\n      }\n      this.tree.delete(segment);\n    }\n    return newEvents;\n  }\n  /* Safely split a segment that is currently in the datastructures\n   * IE - a segment other than the one that is currently being processed. */\n  _splitSafely(seg, pt) {\n    this.tree.delete(seg);\n    const rightSE = seg.rightSE;\n    this.queue.delete(rightSE);\n    const newEvents = seg.split(pt);\n    newEvents.push(rightSE);\n    if (seg.consumedBy === void 0) this.tree.add(seg);\n    return newEvents;\n  }\n};\n\n// src/operation.ts\nvar Operation = class {\n  type;\n  numMultiPolys;\n  run(type, geom, moreGeoms) {\n    operation.type = type;\n    const multipolys = [new MultiPolyIn(geom, true)];\n    for (let i = 0, iMax = moreGeoms.length; i < iMax; i++) {\n      multipolys.push(new MultiPolyIn(moreGeoms[i], false));\n    }\n    operation.numMultiPolys = multipolys.length;\n    if (operation.type === \"difference\") {\n      const subject = multipolys[0];\n      let i = 1;\n      while (i < multipolys.length) {\n        if (getBboxOverlap(multipolys[i].bbox, subject.bbox) !== null) i++;\n        else multipolys.splice(i, 1);\n      }\n    }\n    if (operation.type === \"intersection\") {\n      for (let i = 0, iMax = multipolys.length; i < iMax; i++) {\n        const mpA = multipolys[i];\n        for (let j = i + 1, jMax = multipolys.length; j < jMax; j++) {\n          if (getBboxOverlap(mpA.bbox, multipolys[j].bbox) === null) return [];\n        }\n      }\n    }\n    const queue = new SplayTreeSet3(SweepEvent.compare);\n    for (let i = 0, iMax = multipolys.length; i < iMax; i++) {\n      const sweepEvents = multipolys[i].getSweepEvents();\n      for (let j = 0, jMax = sweepEvents.length; j < jMax; j++) {\n        queue.add(sweepEvents[j]);\n      }\n    }\n    const sweepLine = new SweepLine(queue);\n    let evt = null;\n    if (queue.size != 0) {\n      evt = queue.first();\n      queue.delete(evt);\n    }\n    while (evt) {\n      const newEvents = sweepLine.process(evt);\n      for (let i = 0, iMax = newEvents.length; i < iMax; i++) {\n        const evt2 = newEvents[i];\n        if (evt2.consumedBy === void 0) queue.add(evt2);\n      }\n      if (queue.size != 0) {\n        evt = queue.first();\n        queue.delete(evt);\n      } else {\n        evt = null;\n      }\n    }\n    precision.reset();\n    const ringsOut = RingOut.factory(sweepLine.segments);\n    const result = new MultiPolyOut(ringsOut);\n    return result.getGeom();\n  }\n};\nvar operation = new Operation();\nvar operation_default = operation;\n\n// src/segment.ts\nvar segmentId = 0;\nvar Segment = class _Segment {\n  id;\n  leftSE;\n  rightSE;\n  rings;\n  windings;\n  ringOut;\n  consumedBy;\n  prev;\n  _prevInResult;\n  _beforeState;\n  _afterState;\n  _isInResult;\n  /* This compare() function is for ordering segments in the sweep\n   * line tree, and does so according to the following criteria:\n   *\n   * Consider the vertical line that lies an infinestimal step to the\n   * right of the right-more of the two left endpoints of the input\n   * segments. Imagine slowly moving a point up from negative infinity\n   * in the increasing y direction. Which of the two segments will that\n   * point intersect first? That segment comes 'before' the other one.\n   *\n   * If neither segment would be intersected by such a line, (if one\n   * or more of the segments are vertical) then the line to be considered\n   * is directly on the right-more of the two left inputs.\n   */\n  static compare(a, b) {\n    const alx = a.leftSE.point.x;\n    const blx = b.leftSE.point.x;\n    const arx = a.rightSE.point.x;\n    const brx = b.rightSE.point.x;\n    if (brx.isLessThan(alx)) return 1;\n    if (arx.isLessThan(blx)) return -1;\n    const aly = a.leftSE.point.y;\n    const bly = b.leftSE.point.y;\n    const ary = a.rightSE.point.y;\n    const bry = b.rightSE.point.y;\n    if (alx.isLessThan(blx)) {\n      if (bly.isLessThan(aly) && bly.isLessThan(ary)) return 1;\n      if (bly.isGreaterThan(aly) && bly.isGreaterThan(ary)) return -1;\n      const aCmpBLeft = a.comparePoint(b.leftSE.point);\n      if (aCmpBLeft < 0) return 1;\n      if (aCmpBLeft > 0) return -1;\n      const bCmpARight = b.comparePoint(a.rightSE.point);\n      if (bCmpARight !== 0) return bCmpARight;\n      return -1;\n    }\n    if (alx.isGreaterThan(blx)) {\n      if (aly.isLessThan(bly) && aly.isLessThan(bry)) return -1;\n      if (aly.isGreaterThan(bly) && aly.isGreaterThan(bry)) return 1;\n      const bCmpALeft = b.comparePoint(a.leftSE.point);\n      if (bCmpALeft !== 0) return bCmpALeft;\n      const aCmpBRight = a.comparePoint(b.rightSE.point);\n      if (aCmpBRight < 0) return 1;\n      if (aCmpBRight > 0) return -1;\n      return 1;\n    }\n    if (aly.isLessThan(bly)) return -1;\n    if (aly.isGreaterThan(bly)) return 1;\n    if (arx.isLessThan(brx)) {\n      const bCmpARight = b.comparePoint(a.rightSE.point);\n      if (bCmpARight !== 0) return bCmpARight;\n    }\n    if (arx.isGreaterThan(brx)) {\n      const aCmpBRight = a.comparePoint(b.rightSE.point);\n      if (aCmpBRight < 0) return 1;\n      if (aCmpBRight > 0) return -1;\n    }\n    if (!arx.eq(brx)) {\n      const ay = ary.minus(aly);\n      const ax = arx.minus(alx);\n      const by = bry.minus(bly);\n      const bx = brx.minus(blx);\n      if (ay.isGreaterThan(ax) && by.isLessThan(bx)) return 1;\n      if (ay.isLessThan(ax) && by.isGreaterThan(bx)) return -1;\n    }\n    if (arx.isGreaterThan(brx)) return 1;\n    if (arx.isLessThan(brx)) return -1;\n    if (ary.isLessThan(bry)) return -1;\n    if (ary.isGreaterThan(bry)) return 1;\n    if (a.id < b.id) return -1;\n    if (a.id > b.id) return 1;\n    return 0;\n  }\n  /* Warning: a reference to ringWindings input will be stored,\n   *  and possibly will be later modified */\n  constructor(leftSE, rightSE, rings, windings) {\n    this.id = ++segmentId;\n    this.leftSE = leftSE;\n    leftSE.segment = this;\n    leftSE.otherSE = rightSE;\n    this.rightSE = rightSE;\n    rightSE.segment = this;\n    rightSE.otherSE = leftSE;\n    this.rings = rings;\n    this.windings = windings;\n  }\n  static fromRing(pt1, pt2, ring) {\n    let leftPt, rightPt, winding;\n    const cmpPts = SweepEvent.comparePoints(pt1, pt2);\n    if (cmpPts < 0) {\n      leftPt = pt1;\n      rightPt = pt2;\n      winding = 1;\n    } else if (cmpPts > 0) {\n      leftPt = pt2;\n      rightPt = pt1;\n      winding = -1;\n    } else\n      throw new Error(\n        `Tried to create degenerate segment at [${pt1.x}, ${pt1.y}]`\n      );\n    const leftSE = new SweepEvent(leftPt, true);\n    const rightSE = new SweepEvent(rightPt, false);\n    return new _Segment(leftSE, rightSE, [ring], [winding]);\n  }\n  /* When a segment is split, the rightSE is replaced with a new sweep event */\n  replaceRightSE(newRightSE) {\n    this.rightSE = newRightSE;\n    this.rightSE.segment = this;\n    this.rightSE.otherSE = this.leftSE;\n    this.leftSE.otherSE = this.rightSE;\n  }\n  bbox() {\n    const y1 = this.leftSE.point.y;\n    const y2 = this.rightSE.point.y;\n    return {\n      ll: { x: this.leftSE.point.x, y: y1.isLessThan(y2) ? y1 : y2 },\n      ur: { x: this.rightSE.point.x, y: y1.isGreaterThan(y2) ? y1 : y2 }\n    };\n  }\n  /* A vector from the left point to the right */\n  vector() {\n    return {\n      x: this.rightSE.point.x.minus(this.leftSE.point.x),\n      y: this.rightSE.point.y.minus(this.leftSE.point.y)\n    };\n  }\n  isAnEndpoint(pt) {\n    return pt.x.eq(this.leftSE.point.x) && pt.y.eq(this.leftSE.point.y) || pt.x.eq(this.rightSE.point.x) && pt.y.eq(this.rightSE.point.y);\n  }\n  /* Compare this segment with a point.\n   *\n   * A point P is considered to be colinear to a segment if there\n   * exists a distance D such that if we travel along the segment\n   * from one * endpoint towards the other a distance D, we find\n   * ourselves at point P.\n   *\n   * Return value indicates:\n   *\n   *   1: point lies above the segment (to the left of vertical)\n   *   0: point is colinear to segment\n   *  -1: point lies below the segment (to the right of vertical)\n   */\n  comparePoint(point) {\n    return precision.orient(this.leftSE.point, point, this.rightSE.point);\n  }\n  /**\n   * Given another segment, returns the first non-trivial intersection\n   * between the two segments (in terms of sweep line ordering), if it exists.\n   *\n   * A 'non-trivial' intersection is one that will cause one or both of the\n   * segments to be split(). As such, 'trivial' vs. 'non-trivial' intersection:\n   *\n   *   * endpoint of segA with endpoint of segB --> trivial\n   *   * endpoint of segA with point along segB --> non-trivial\n   *   * endpoint of segB with point along segA --> non-trivial\n   *   * point along segA with point along segB --> non-trivial\n   *\n   * If no non-trivial intersection exists, return null\n   * Else, return null.\n   */\n  getIntersection(other) {\n    const tBbox = this.bbox();\n    const oBbox = other.bbox();\n    const bboxOverlap = getBboxOverlap(tBbox, oBbox);\n    if (bboxOverlap === null) return null;\n    const tlp = this.leftSE.point;\n    const trp = this.rightSE.point;\n    const olp = other.leftSE.point;\n    const orp = other.rightSE.point;\n    const touchesOtherLSE = isInBbox(tBbox, olp) && this.comparePoint(olp) === 0;\n    const touchesThisLSE = isInBbox(oBbox, tlp) && other.comparePoint(tlp) === 0;\n    const touchesOtherRSE = isInBbox(tBbox, orp) && this.comparePoint(orp) === 0;\n    const touchesThisRSE = isInBbox(oBbox, trp) && other.comparePoint(trp) === 0;\n    if (touchesThisLSE && touchesOtherLSE) {\n      if (touchesThisRSE && !touchesOtherRSE) return trp;\n      if (!touchesThisRSE && touchesOtherRSE) return orp;\n      return null;\n    }\n    if (touchesThisLSE) {\n      if (touchesOtherRSE) {\n        if (tlp.x.eq(orp.x) && tlp.y.eq(orp.y)) return null;\n      }\n      return tlp;\n    }\n    if (touchesOtherLSE) {\n      if (touchesThisRSE) {\n        if (trp.x.eq(olp.x) && trp.y.eq(olp.y)) return null;\n      }\n      return olp;\n    }\n    if (touchesThisRSE && touchesOtherRSE) return null;\n    if (touchesThisRSE) return trp;\n    if (touchesOtherRSE) return orp;\n    const pt = intersection(tlp, this.vector(), olp, other.vector());\n    if (pt === null) return null;\n    if (!isInBbox(bboxOverlap, pt)) return null;\n    return precision.snap(pt);\n  }\n  /**\n   * Split the given segment into multiple segments on the given points.\n   *  * Each existing segment will retain its leftSE and a new rightSE will be\n   *    generated for it.\n   *  * A new segment will be generated which will adopt the original segment's\n   *    rightSE, and a new leftSE will be generated for it.\n   *  * If there are more than two points given to split on, new segments\n   *    in the middle will be generated with new leftSE and rightSE's.\n   *  * An array of the newly generated SweepEvents will be returned.\n   *\n   * Warning: input array of points is modified\n   */\n  split(point) {\n    const newEvents = [];\n    const alreadyLinked = point.events !== void 0;\n    const newLeftSE = new SweepEvent(point, true);\n    const newRightSE = new SweepEvent(point, false);\n    const oldRightSE = this.rightSE;\n    this.replaceRightSE(newRightSE);\n    newEvents.push(newRightSE);\n    newEvents.push(newLeftSE);\n    const newSeg = new _Segment(\n      newLeftSE,\n      oldRightSE,\n      this.rings.slice(),\n      this.windings.slice()\n    );\n    if (SweepEvent.comparePoints(newSeg.leftSE.point, newSeg.rightSE.point) > 0) {\n      newSeg.swapEvents();\n    }\n    if (SweepEvent.comparePoints(this.leftSE.point, this.rightSE.point) > 0) {\n      this.swapEvents();\n    }\n    if (alreadyLinked) {\n      newLeftSE.checkForConsuming();\n      newRightSE.checkForConsuming();\n    }\n    return newEvents;\n  }\n  /* Swap which event is left and right */\n  swapEvents() {\n    const tmpEvt = this.rightSE;\n    this.rightSE = this.leftSE;\n    this.leftSE = tmpEvt;\n    this.leftSE.isLeft = true;\n    this.rightSE.isLeft = false;\n    for (let i = 0, iMax = this.windings.length; i < iMax; i++) {\n      this.windings[i] *= -1;\n    }\n  }\n  /* Consume another segment. We take their rings under our wing\n   * and mark them as consumed. Use for perfectly overlapping segments */\n  consume(other) {\n    let consumer = this;\n    let consumee = other;\n    while (consumer.consumedBy) consumer = consumer.consumedBy;\n    while (consumee.consumedBy) consumee = consumee.consumedBy;\n    const cmp = _Segment.compare(consumer, consumee);\n    if (cmp === 0) return;\n    if (cmp > 0) {\n      const tmp = consumer;\n      consumer = consumee;\n      consumee = tmp;\n    }\n    if (consumer.prev === consumee) {\n      const tmp = consumer;\n      consumer = consumee;\n      consumee = tmp;\n    }\n    for (let i = 0, iMax = consumee.rings.length; i < iMax; i++) {\n      const ring = consumee.rings[i];\n      const winding = consumee.windings[i];\n      const index = consumer.rings.indexOf(ring);\n      if (index === -1) {\n        consumer.rings.push(ring);\n        consumer.windings.push(winding);\n      } else consumer.windings[index] += winding;\n    }\n    consumee.rings = null;\n    consumee.windings = null;\n    consumee.consumedBy = consumer;\n    consumee.leftSE.consumedBy = consumer.leftSE;\n    consumee.rightSE.consumedBy = consumer.rightSE;\n  }\n  /* The first segment previous segment chain that is in the result */\n  prevInResult() {\n    if (this._prevInResult !== void 0) return this._prevInResult;\n    if (!this.prev) this._prevInResult = null;\n    else if (this.prev.isInResult()) this._prevInResult = this.prev;\n    else this._prevInResult = this.prev.prevInResult();\n    return this._prevInResult;\n  }\n  beforeState() {\n    if (this._beforeState !== void 0) return this._beforeState;\n    if (!this.prev)\n      this._beforeState = {\n        rings: [],\n        windings: [],\n        multiPolys: []\n      };\n    else {\n      const seg = this.prev.consumedBy || this.prev;\n      this._beforeState = seg.afterState();\n    }\n    return this._beforeState;\n  }\n  afterState() {\n    if (this._afterState !== void 0) return this._afterState;\n    const beforeState = this.beforeState();\n    this._afterState = {\n      rings: beforeState.rings.slice(0),\n      windings: beforeState.windings.slice(0),\n      multiPolys: []\n    };\n    const ringsAfter = this._afterState.rings;\n    const windingsAfter = this._afterState.windings;\n    const mpsAfter = this._afterState.multiPolys;\n    for (let i = 0, iMax = this.rings.length; i < iMax; i++) {\n      const ring = this.rings[i];\n      const winding = this.windings[i];\n      const index = ringsAfter.indexOf(ring);\n      if (index === -1) {\n        ringsAfter.push(ring);\n        windingsAfter.push(winding);\n      } else windingsAfter[index] += winding;\n    }\n    const polysAfter = [];\n    const polysExclude = [];\n    for (let i = 0, iMax = ringsAfter.length; i < iMax; i++) {\n      if (windingsAfter[i] === 0) continue;\n      const ring = ringsAfter[i];\n      const poly = ring.poly;\n      if (polysExclude.indexOf(poly) !== -1) continue;\n      if (ring.isExterior) polysAfter.push(poly);\n      else {\n        if (polysExclude.indexOf(poly) === -1) polysExclude.push(poly);\n        const index = polysAfter.indexOf(ring.poly);\n        if (index !== -1) polysAfter.splice(index, 1);\n      }\n    }\n    for (let i = 0, iMax = polysAfter.length; i < iMax; i++) {\n      const mp = polysAfter[i].multiPoly;\n      if (mpsAfter.indexOf(mp) === -1) mpsAfter.push(mp);\n    }\n    return this._afterState;\n  }\n  /* Is this segment part of the final result? */\n  isInResult() {\n    if (this.consumedBy) return false;\n    if (this._isInResult !== void 0) return this._isInResult;\n    const mpsBefore = this.beforeState().multiPolys;\n    const mpsAfter = this.afterState().multiPolys;\n    switch (operation_default.type) {\n      case \"union\": {\n        const noBefores = mpsBefore.length === 0;\n        const noAfters = mpsAfter.length === 0;\n        this._isInResult = noBefores !== noAfters;\n        break;\n      }\n      case \"intersection\": {\n        let least;\n        let most;\n        if (mpsBefore.length < mpsAfter.length) {\n          least = mpsBefore.length;\n          most = mpsAfter.length;\n        } else {\n          least = mpsAfter.length;\n          most = mpsBefore.length;\n        }\n        this._isInResult = most === operation_default.numMultiPolys && least < most;\n        break;\n      }\n      case \"xor\": {\n        const diff = Math.abs(mpsBefore.length - mpsAfter.length);\n        this._isInResult = diff % 2 === 1;\n        break;\n      }\n      case \"difference\": {\n        const isJustSubject = (mps) => mps.length === 1 && mps[0].isSubject;\n        this._isInResult = isJustSubject(mpsBefore) !== isJustSubject(mpsAfter);\n        break;\n      }\n    }\n    return this._isInResult;\n  }\n};\n\n// src/geom-in.ts\nvar RingIn = class {\n  poly;\n  isExterior;\n  segments;\n  bbox;\n  constructor(geomRing, poly, isExterior) {\n    if (!Array.isArray(geomRing) || geomRing.length === 0) {\n      throw new Error(\"Input geometry is not a valid Polygon or MultiPolygon\");\n    }\n    this.poly = poly;\n    this.isExterior = isExterior;\n    this.segments = [];\n    if (typeof geomRing[0][0] !== \"number\" || typeof geomRing[0][1] !== \"number\") {\n      throw new Error(\"Input geometry is not a valid Polygon or MultiPolygon\");\n    }\n    const firstPoint = precision.snap({ x: new BigNumber2(geomRing[0][0]), y: new BigNumber2(geomRing[0][1]) });\n    this.bbox = {\n      ll: { x: firstPoint.x, y: firstPoint.y },\n      ur: { x: firstPoint.x, y: firstPoint.y }\n    };\n    let prevPoint = firstPoint;\n    for (let i = 1, iMax = geomRing.length; i < iMax; i++) {\n      if (typeof geomRing[i][0] !== \"number\" || typeof geomRing[i][1] !== \"number\") {\n        throw new Error(\"Input geometry is not a valid Polygon or MultiPolygon\");\n      }\n      const point = precision.snap({ x: new BigNumber2(geomRing[i][0]), y: new BigNumber2(geomRing[i][1]) });\n      if (point.x.eq(prevPoint.x) && point.y.eq(prevPoint.y)) continue;\n      this.segments.push(Segment.fromRing(prevPoint, point, this));\n      if (point.x.isLessThan(this.bbox.ll.x)) this.bbox.ll.x = point.x;\n      if (point.y.isLessThan(this.bbox.ll.y)) this.bbox.ll.y = point.y;\n      if (point.x.isGreaterThan(this.bbox.ur.x)) this.bbox.ur.x = point.x;\n      if (point.y.isGreaterThan(this.bbox.ur.y)) this.bbox.ur.y = point.y;\n      prevPoint = point;\n    }\n    if (!firstPoint.x.eq(prevPoint.x) || !firstPoint.y.eq(prevPoint.y)) {\n      this.segments.push(Segment.fromRing(prevPoint, firstPoint, this));\n    }\n  }\n  getSweepEvents() {\n    const sweepEvents = [];\n    for (let i = 0, iMax = this.segments.length; i < iMax; i++) {\n      const segment = this.segments[i];\n      sweepEvents.push(segment.leftSE);\n      sweepEvents.push(segment.rightSE);\n    }\n    return sweepEvents;\n  }\n};\nvar PolyIn = class {\n  multiPoly;\n  exteriorRing;\n  interiorRings;\n  bbox;\n  constructor(geomPoly, multiPoly) {\n    if (!Array.isArray(geomPoly)) {\n      throw new Error(\"Input geometry is not a valid Polygon or MultiPolygon\");\n    }\n    this.exteriorRing = new RingIn(geomPoly[0], this, true);\n    this.bbox = {\n      ll: { x: this.exteriorRing.bbox.ll.x, y: this.exteriorRing.bbox.ll.y },\n      ur: { x: this.exteriorRing.bbox.ur.x, y: this.exteriorRing.bbox.ur.y }\n    };\n    this.interiorRings = [];\n    for (let i = 1, iMax = geomPoly.length; i < iMax; i++) {\n      const ring = new RingIn(geomPoly[i], this, false);\n      if (ring.bbox.ll.x.isLessThan(this.bbox.ll.x)) this.bbox.ll.x = ring.bbox.ll.x;\n      if (ring.bbox.ll.y.isLessThan(this.bbox.ll.y)) this.bbox.ll.y = ring.bbox.ll.y;\n      if (ring.bbox.ur.x.isGreaterThan(this.bbox.ur.x)) this.bbox.ur.x = ring.bbox.ur.x;\n      if (ring.bbox.ur.y.isGreaterThan(this.bbox.ur.y)) this.bbox.ur.y = ring.bbox.ur.y;\n      this.interiorRings.push(ring);\n    }\n    this.multiPoly = multiPoly;\n  }\n  getSweepEvents() {\n    const sweepEvents = this.exteriorRing.getSweepEvents();\n    for (let i = 0, iMax = this.interiorRings.length; i < iMax; i++) {\n      const ringSweepEvents = this.interiorRings[i].getSweepEvents();\n      for (let j = 0, jMax = ringSweepEvents.length; j < jMax; j++) {\n        sweepEvents.push(ringSweepEvents[j]);\n      }\n    }\n    return sweepEvents;\n  }\n};\nvar MultiPolyIn = class {\n  isSubject;\n  polys;\n  bbox;\n  constructor(geom, isSubject) {\n    if (!Array.isArray(geom)) {\n      throw new Error(\"Input geometry is not a valid Polygon or MultiPolygon\");\n    }\n    try {\n      if (typeof geom[0][0][0] === \"number\") geom = [geom];\n    } catch (ex) {\n    }\n    this.polys = [];\n    this.bbox = {\n      ll: { x: new BigNumber2(Number.POSITIVE_INFINITY), y: new BigNumber2(Number.POSITIVE_INFINITY) },\n      ur: { x: new BigNumber2(Number.NEGATIVE_INFINITY), y: new BigNumber2(Number.NEGATIVE_INFINITY) }\n    };\n    for (let i = 0, iMax = geom.length; i < iMax; i++) {\n      const poly = new PolyIn(geom[i], this);\n      if (poly.bbox.ll.x.isLessThan(this.bbox.ll.x)) this.bbox.ll.x = poly.bbox.ll.x;\n      if (poly.bbox.ll.y.isLessThan(this.bbox.ll.y)) this.bbox.ll.y = poly.bbox.ll.y;\n      if (poly.bbox.ur.x.isGreaterThan(this.bbox.ur.x)) this.bbox.ur.x = poly.bbox.ur.x;\n      if (poly.bbox.ur.y.isGreaterThan(this.bbox.ur.y)) this.bbox.ur.y = poly.bbox.ur.y;\n      this.polys.push(poly);\n    }\n    this.isSubject = isSubject;\n  }\n  getSweepEvents() {\n    const sweepEvents = [];\n    for (let i = 0, iMax = this.polys.length; i < iMax; i++) {\n      const polySweepEvents = this.polys[i].getSweepEvents();\n      for (let j = 0, jMax = polySweepEvents.length; j < jMax; j++) {\n        sweepEvents.push(polySweepEvents[j]);\n      }\n    }\n    return sweepEvents;\n  }\n};\n\n// src/index.ts\nvar union = (geom, ...moreGeoms) => operation_default.run(\"union\", geom, moreGeoms);\nvar intersection2 = (geom, ...moreGeoms) => operation_default.run(\"intersection\", geom, moreGeoms);\nvar xor = (geom, ...moreGeoms) => operation_default.run(\"xor\", geom, moreGeoms);\nvar difference = (geom, ...moreGeoms) => operation_default.run(\"difference\", geom, moreGeoms);\nvar setPrecision = precision.set;\nexport {\n  difference,\n  intersection2 as intersection,\n  setPrecision,\n  union,\n  xor\n};\n//# sourceMappingURL=index.js.map","// index.ts\nimport * as polyclip from \"polyclip-ts\";\nimport { polygon, multiPolygon } from \"@turf/helpers\";\nimport { geomEach } from \"@turf/meta\";\nfunction difference2(features) {\n  const geoms = [];\n  geomEach(features, (geom) => {\n    geoms.push(geom.coordinates);\n  });\n  if (geoms.length < 2) {\n    throw new Error(\"Must have at least two features\");\n  }\n  const properties = features.features[0].properties || {};\n  const differenced = polyclip.difference(geoms[0], ...geoms.slice(1));\n  if (differenced.length === 0) return null;\n  if (differenced.length === 1) return polygon(differenced[0], properties);\n  return multiPolygon(differenced, properties);\n}\nvar turf_difference_default = difference2;\nexport {\n  turf_difference_default as default,\n  difference2 as difference\n};\n//# sourceMappingURL=index.js.map","// index.ts\nimport { flattenEach } from \"@turf/meta\";\nimport { featureCollection } from \"@turf/helpers\";\nfunction flatten(geojson) {\n  if (!geojson) throw new Error(\"geojson is required\");\n  var results = [];\n  flattenEach(geojson, function(feature) {\n    results.push(feature);\n  });\n  return featureCollection(results);\n}\nvar turf_flatten_default = flatten;\nexport {\n  turf_flatten_default as default,\n  flatten\n};\n//# sourceMappingURL=index.js.map","// index.ts\nimport * as polyclip from \"polyclip-ts\";\nimport { multiPolygon, polygon } from \"@turf/helpers\";\nimport { geomEach } from \"@turf/meta\";\nfunction union2(features, options = {}) {\n  const geoms = [];\n  geomEach(features, (geom) => {\n    geoms.push(geom.coordinates);\n  });\n  if (geoms.length < 2) {\n    throw new Error(\"Must have at least 2 geometries\");\n  }\n  const unioned = polyclip.union(geoms[0], ...geoms.slice(1));\n  if (unioned.length === 0) return null;\n  if (unioned.length === 1) return polygon(unioned[0], options.properties);\n  else return multiPolygon(unioned, options.properties);\n}\nvar turf_union_default = union2;\nexport {\n  turf_union_default as default,\n  union2 as union\n};\n//# sourceMappingURL=index.js.map","import type { BBox } from \"./types\";\n\n// taken from Leaflet\nexport function wrapNum(\n  x: number,\n  range: [number, number],\n  includeMax: boolean,\n) {\n  const max = range[1],\n    min = range[0],\n    d = max - min;\n\n  return x === max && includeMax ? x : ((((x - min) % d) + d) % d) + min;\n}\n\nexport function unwrapBbox(bbox0: BBox): BBox {\n  const bbox = [...bbox0] satisfies BBox;\n\n  if (bbox[2] < bbox[0]) {\n    if (\n      Math.abs((bbox[0] + bbox[2] + 360) / 2) >\n      Math.abs((bbox[0] - 360 + bbox[2]) / 2)\n    ) {\n      bbox[0] -= 360;\n    } else {\n      bbox[2] += 360;\n    }\n  }\n\n  return bbox;\n}\n","import bbox from \"@turf/bbox\";\nimport difference from \"@turf/difference\";\nimport flatten from \"@turf/flatten\";\nimport { featureCollection, polygon } from \"@turf/helpers\";\nimport union from \"@turf/union\";\nimport type {\n  Feature,\n  FeatureCollection,\n  MultiPolygon,\n  Polygon,\n} from \"geojson\";\nimport { unwrapBbox } from \"./geoUtils\";\nimport type { BBox } from \"./types\";\n\nexport function setMask(\n  picked: Feature<Polygon | MultiPolygon>,\n  setData: (data?: FeatureCollection<Polygon | MultiPolygon>) => void,\n): void {\n  const diff = difference(\n    featureCollection([\n      polygon([\n        [\n          [180, 90],\n          [-180, 90],\n          [-180, -90],\n          [180, -90],\n          [180, 90],\n        ],\n      ]),\n      picked,\n    ]),\n  );\n\n  if (!diff) {\n    return;\n  }\n\n  diff.properties = { isMask: true };\n\n  const bb = unwrapBbox(bbox(picked) as BBox);\n\n  // bigger features (continents, oceans) have bigger tolerance\n  // because of the used source data simplification\n  const tolerance = (bb[2] - bb[0]) / 360 / 1_000;\n\n  const leaksLeft = bb[0] < -180;\n  const leaksRight = bb[2] > 180;\n\n  const flattened = flatten(picked);\n\n  if (flattened.features.length > 1 && (leaksLeft || leaksRight)) {\n    for (const poly of flattened.features) {\n      const bb = unwrapBbox(bbox(poly) as BBox);\n\n      if (leaksRight && bb[0] < -180 + tolerance) {\n        for (const ring of poly.geometry.coordinates) {\n          for (const position of ring) {\n            position[0] += 360 - tolerance;\n          }\n        }\n      }\n\n      if (leaksLeft && bb[2] > 180 - tolerance) {\n        for (const ring of poly.geometry.coordinates) {\n          for (const position of ring) {\n            position[0] -= 360 - tolerance;\n          }\n        }\n      }\n    }\n  }\n\n  setData(\n    featureCollection([\n      flattened.features.length < 2 ? picked : (union(flattened) ?? picked),\n      diff,\n    ]),\n  );\n}\n","import type { FeatureCollection, MultiPolygon, Polygon } from \"geojson\";\nimport { Feature as OlFeature, type MapBrowserEvent } from \"ol\";\nimport type { FeatureLike } from \"ol/Feature\";\nimport type Map from \"ol/Map\";\nimport type { AnimationOptions, FitOptions } from \"ol/View\";\nimport {\n  GeometryCollection as OlGeometryCollection,\n  LineString as OlLineString,\n  MultiLineString as OlMultiLineString,\n  MultiPolygon as OlMultiPolygon,\n  Point as OlPoint,\n  Polygon as OlPolygon,\n  type Geometry as OlGeometry,\n} from \"ol/geom\";\nimport VectorLayer from \"ol/layer/Vector\";\nimport {\n  fromLonLat,\n  getUserProjection,\n  toLonLat,\n  transformExtent,\n} from \"ol/proj\";\nimport VectorSource from \"ol/source/Vector\";\nimport Fill from \"ol/style/Fill\";\nimport Icon from \"ol/style/Icon\";\nimport Stroke from \"ol/style/Stroke\";\nimport Style, { type StyleLike } from \"ol/style/Style\";\nimport Text from \"ol/style/Text\";\nimport type { FlatStyleLike } from \"ol/style/flat\";\nimport { setMask } from \"./mask\";\nimport type {\n  BBox,\n  Feature as FeatureType,\n  MapController,\n  MapEvent,\n  Position,\n} from \"./types\";\n\nconst EPSG_4326 = \"EPSG:4326\";\n\nfunction defaultStyle(feature: FeatureLike) {\n  const properties = feature.getProperties();\n\n  const { isMask } = properties;\n\n  const type = feature.getGeometry()?.getType();\n\n  const weight = isMask\n    ? 0\n    : type === \"LineString\" || type === \"MultiLineString\"\n      ? 3\n      : 2;\n\n  return new Style({\n    stroke: isMask\n      ? undefined\n      : new Stroke({\n          color: \"#3170fe\",\n          lineDash: [weight, weight],\n          width: weight,\n          lineCap: \"butt\",\n        }),\n    fill: isMask\n      ? new Fill({\n          color: \"#00000020\",\n        })\n      : undefined,\n    image: new Icon({\n      src: `/icons/marker_${\n        properties.isReverse\n          ? \"reverse\"\n          : properties.isSelected\n            ? \"selected\"\n            : \"unselected\"\n      }.svg`,\n      anchor: [0.5, 1],\n    }),\n    zIndex: properties.isSelected ? 2 : properties.isReverse ? 0 : 1,\n    text:\n      properties.isSelected && properties.tooltip\n        ? new Text({\n            backgroundFill: new Fill({ color: \"white\" }),\n            text: properties.tooltip,\n            offsetY: -40,\n            backgroundStroke: new Stroke({\n              color: \"white\",\n              lineJoin: \"round\",\n              width: 3,\n            }),\n            padding: [2, 0, 0, 2],\n          })\n        : undefined,\n  });\n}\n\nexport function createOpenLayersMapController(\n  map: Map,\n  flyToOptions: AnimationOptions = {},\n  flyToBounds: FitOptions = {},\n  fullGeometryStyle: StyleLike | FlatStyleLike = defaultStyle,\n) {\n  let prevSelected = -1;\n\n  let prevHovered: string | undefined;\n\n  let eventHandler: ((e: MapEvent) => void) | undefined;\n\n  let reverseMarker: OlFeature | undefined;\n\n  let indicatingReverse = false;\n\n  const vectorLayer = new VectorLayer({\n    updateWhileAnimating: true,\n  });\n\n  map.addLayer(vectorLayer);\n\n  const source = new VectorSource({});\n\n  vectorLayer.setSource(source);\n\n  vectorLayer.setStyle(fullGeometryStyle);\n\n  map.on(\"click\", (e) => {\n    map.forEachFeatureAtPixel(e.pixel, (feature) => {\n      const id = feature.getId() as string;\n\n      if (!id) {\n        return;\n      }\n\n      e.stopPropagation();\n\n      eventHandler?.({ type: \"markerClick\", id });\n\n      return feature;\n    });\n  });\n\n  map.on(\"pointermove\", (e) => {\n    const featureId = map.forEachFeatureAtPixel(e.pixel, (feature) => {\n      return feature.getId() as string | undefined;\n    });\n\n    if (prevHovered === featureId) {\n      return;\n    }\n\n    if (prevHovered) {\n      eventHandler?.({\n        type: \"markerMouseLeave\",\n        id: prevHovered,\n      });\n    }\n\n    if (featureId) {\n      eventHandler?.({\n        type: \"markerMouseEnter\",\n        id: featureId,\n      });\n    }\n\n    map.getTargetElement().style.cursor = featureId\n      ? \"pointer\"\n      : indicatingReverse\n        ? \"crosshair\"\n        : \"\";\n\n    prevHovered = featureId;\n  });\n\n  function getProjection() {\n    return getUserProjection() ?? map.getView().getProjection();\n  }\n\n  function fromWgs84(geometry: OlGeometry) {\n    return geometry.transform(EPSG_4326, getProjection());\n  }\n\n  const handleMapClick = (e: MapBrowserEvent<PointerEvent>) => {\n    eventHandler?.({\n      type: \"mapClick\",\n      coordinates: toLonLat(e.coordinate, getProjection()) as [number, number],\n    });\n  };\n\n  return {\n    setEventHandler(handler: undefined | ((e: MapEvent) => void)): void {\n      if (handler) {\n        eventHandler = handler;\n        map.on(\"click\", handleMapClick);\n      } else {\n        eventHandler = undefined;\n        map.un(\"click\", handleMapClick);\n      }\n    },\n\n    flyTo(center: Position, zoom: number) {\n      map.getView().animate({\n        center: fromLonLat(center, getProjection()),\n        ...(zoom ? { zoom } : {}),\n        duration: 2000,\n        ...flyToOptions,\n      });\n    },\n\n    fitBounds(bbox: BBox, padding: number, maxZoom: number): void {\n      map.getView().fit(transformExtent(bbox, EPSG_4326, getProjection()), {\n        padding: [padding, padding, padding, padding],\n        ...(maxZoom ? { maxZoom } : {}),\n        duration: 2000,\n        ...flyToBounds,\n      });\n    },\n\n    indicateReverse(reverse: boolean): void {\n      indicatingReverse = reverse;\n\n      map.getTargetElement().style.cursor = reverse ? \"crosshair\" : \"\";\n    },\n\n    setReverseMarker(coordinates?: Position) {\n      if (reverseMarker) {\n        if (!coordinates) {\n          source.removeFeature(reverseMarker);\n\n          reverseMarker.dispose();\n\n          reverseMarker = undefined;\n        } else {\n          (reverseMarker.getGeometry() as OlPoint).setCoordinates(\n            fromLonLat(coordinates, getProjection()),\n          );\n        }\n      } else if (coordinates) {\n        reverseMarker = new OlFeature(\n          new OlPoint(fromLonLat(coordinates, getProjection())),\n        );\n\n        reverseMarker.setProperties({ isReverse: true });\n\n        source.addFeature(reverseMarker);\n      }\n    },\n\n    setFeatures(\n      markedFeatures: FeatureType[] | undefined,\n      picked: FeatureType | undefined,\n      showPolygonMarker: boolean,\n    ): void {\n      function setData(data?: FeatureCollection<Polygon | MultiPolygon>) {\n        if (!data) {\n          return;\n        }\n\n        for (const f of data.features) {\n          const geom =\n            f.geometry.type === \"Polygon\"\n              ? new OlPolygon(f.geometry.coordinates)\n              : f.geometry.type === \"MultiPolygon\"\n                ? new OlMultiPolygon(f.geometry.coordinates)\n                : null;\n\n          if (!geom) {\n            continue;\n          }\n\n          source.addFeature(\n            new OlFeature({\n              isMask: !!f.properties?.isMask,\n              geometry: fromWgs84(geom),\n            }),\n          );\n        }\n      }\n\n      source.clear();\n\n      if (reverseMarker) {\n        source.addFeature(reverseMarker);\n      }\n\n      block: if (picked) {\n        let handled = false;\n\n        if (picked.geometry.type === \"GeometryCollection\") {\n          const geoms = picked.geometry.geometries\n            .map((geometry) =>\n              geometry.type === \"Polygon\"\n                ? new OlPolygon(geometry.coordinates)\n                : geometry.type === \"MultiPolygon\"\n                  ? new OlMultiPolygon(geometry.coordinates)\n                  : null,\n            )\n            .filter(<T>(a: T | null): a is T => !!a);\n\n          if (geoms.length > 0) {\n            source.addFeature(\n              new OlFeature(fromWgs84(new OlGeometryCollection(geoms))),\n            );\n\n            handled = true;\n          } else {\n            for (const geometry of picked.geometry.geometries) {\n              if (geometry.type === \"LineString\") {\n                source.addFeature(\n                  new OlFeature(\n                    fromWgs84(new OlLineString(geometry.coordinates)),\n                  ),\n                );\n\n                handled = true;\n              } else if (geometry.type === \"MultiLineString\") {\n                source.addFeature(\n                  new OlFeature(\n                    fromWgs84(new OlMultiLineString(geometry.coordinates)),\n                  ),\n                );\n              }\n\n              handled = true;\n            }\n          }\n        }\n\n        if (handled) {\n          // nothing\n        } else if (picked.geometry.type === \"Polygon\") {\n          setMask(picked as FeatureType<Polygon>, setData);\n        } else if (picked.geometry.type === \"MultiPolygon\") {\n          setMask(picked as FeatureType<MultiPolygon>, setData);\n        } else if (picked.geometry.type === \"LineString\") {\n          source.addFeature(\n            new OlFeature(\n              fromWgs84(new OlLineString(picked.geometry.coordinates)),\n            ),\n          );\n\n          break block; // no pin for (multi)linestrings\n        } else if (picked.geometry.type === \"MultiLineString\") {\n          source.addFeature(\n            new OlFeature(\n              fromWgs84(new OlMultiLineString(picked.geometry.coordinates)),\n            ),\n          );\n\n          break block; // no pin for (multi)linestrings\n        }\n\n        if (!showPolygonMarker && !picked.geometry.type.endsWith(\"Point\")) {\n          break block;\n        }\n\n        source.addFeature(new OlFeature(fromWgs84(new OlPoint(picked.center))));\n      }\n\n      for (const feature of markedFeatures ?? []) {\n        if (feature === picked) {\n          continue;\n        }\n\n        const marker = new OlFeature(\n          new OlPoint(fromLonLat(feature.center, getProjection())),\n        );\n\n        marker.setId(feature.id);\n\n        marker.setProperties({\n          fuzzy: !!feature.matching_text,\n          tooltip:\n            feature.place_type[0] === \"reverse\"\n              ? feature.place_name\n              : feature.place_name.replace(/,.*/, \"\"),\n        });\n\n        source.addFeature(marker);\n      }\n    },\n\n    setSelectedMarker(index: number): void {\n      const features = source.getFeatures();\n\n      const offset = features[0]?.getProperties().isReverse ? 1 : 0;\n\n      if (prevSelected > -1) {\n        features[prevSelected + offset]?.setProperties({\n          isSelected: false,\n        });\n      }\n\n      if (index > -1) {\n        features[index + offset]?.setProperties({\n          isSelected: true,\n        });\n      }\n\n      prevSelected = index;\n    },\n\n    getCenterAndZoom() {\n      const view = map.getView();\n\n      const center = view.getCenter();\n\n      const zoom = view.getZoom();\n\n      if (!center || zoom === undefined) {\n        return undefined;\n      }\n\n      return [zoom, ...(toLonLat(center, getProjection()) as Position)];\n    },\n  } satisfies MapController;\n}\n"],"names":["feature","geom","properties","options","feat","polygon","coordinates","ring","j","featureCollection","features","fc","multiPolygon","coordEach","geojson","callback","excludeWrapCoord","k","l","geometry","stopG","coords","geometryMaybeCollection","wrapShrink","coordIndex","isGeometryCollection","type","isFeatureCollection","isFeature","stop","featureIndex","geomIndex","multiFeatureIndex","geometryIndex","geomType","geomEach","i","g","featureProperties","featureBBox","featureId","flattenEach","bbox","id","coordinate","result","coord","turf_bbox_default","isNumeric","mathceil","mathfloor","bignumberError","tooManyDigits","BASE","LOG_BASE","MAX_SAFE_INTEGER","POWS_TEN","SQRT_BASE","MAX","clone","configObject","div","convertBase","parseNumeric","P","BigNumber","ONE","DECIMAL_PLACES","ROUNDING_MODE","TO_EXP_NEG","TO_EXP_POS","MIN_EXP","MAX_EXP","CRYPTO","MODULO_MODE","POW_PRECISION","FORMAT","ALPHABET","alphabetHasNormalDecimalDigits","v","b","alphabet","c","caseChanged","e","isNum","len","str","x","intCheck","round","obj","p","n","s","out","maxOrMin","pow2_53","random53bitInt","dp","a","rand","args","sum","decimal","toBaseOut","baseIn","baseOut","arr","arrL","sign","callerIsToString","d","r","xc","y","rm","toFixedPoint","coeffToString","multiply","base","m","temp","xlo","xhi","carry","klo","khi","compare","aL","bL","cmp","subtract","more","prod","prodL","q","qc","rem","remL","rem0","xi","xL","yc0","yL","yz","yc","bitFloor","format","c0","ne","toExponential","normalise","basePrefix","dotAfter","dotBefore","isInfinityOrNaN","whitespaceOrPlus","p1","p2","sd","ni","rd","pows10","valueOf","half","isModExp","nIsBig","nIsNeg","nIsOdd","isOdd","t","xLTy","xe","ye","xcL","ycL","ylo","yhi","zc","sqrtBase","rep","g1","g2","groupSeparator","intPart","fractionPart","isNeg","intDigits","md","d0","d1","d2","exp","n0","n1","z","min","max","name","zs","SplayTreeNode","key","__publicField","SplayTreeSetNode","SplayTree","root","right","newTreeRight","left","newTreeLeft","current","comp","currentLeft","currentRight","node","nextLeft","nextRight","count","SplayTreeSet","_SplayTreeSet","isValidKey","_a","element","elements","f","nodes","nodeRight","nodeLeft","retainSet","modificationCount","object","other","u","set","copyChildren","node2","dest","newLeft","newRight","SplayTreeSetEntryIterableIterator","_b","SplayTreeKeyIterableIterator","SplayTreeIterableIterator","tree","next","constant_default","compare_default","eps","almostEqual","orient_default","almostCollinear","area2","ax","ay","cx","cy","identity_default","snap_default","xTree","yTree","snapCoord","snap","eps2","precision","isInBbox","point","getBboxOverlap","b1","b2","lowerX","upperX","lowerY","upperY","crossProduct","dotProduct","length","sineOfAngle","pShared","pBase","pAngle","vBase","vAngle","cosineOfAngle","horizontalIntersection","pt","verticalIntersection","intersection","pt1","v1","pt2","v2","kross","ve","x1","x2","y1","y2","SweepEvent","_SweepEvent","isLeft","ptCmp","Segment","aPt","bPt","otherEvents","iMax","evt","numEvents","evt1","evt2","events","baseEvent","cache","fillCache","linkedEvent","nextEvent","asine","acosine","bsine","bcosine","RingOut","_RingOut","allSegments","ringsOut","segment","prevEvent","event","startingPoint","intersectionLEs","availableLEs","firstPt","lastPt","indexLE","jMax","intersectionLE","ringEvents","comparator","prevPt","points","nextPt2","nextPt","step","iStart","iEnd","orderedPoints","enclosing","leftMostEvt","prevSeg","prevPrevSeg","PolyOut","exteriorRing","geom0","ringGeom","MultiPolyOut","rings","polyGeom","polys","enclosingRing","SweepLine","queue","SplayTreeSet2","newEvents","nextSeg","prevMySplitter","prevInter","newEventsFromSplit","nextMySplitter","nextInter","mySplitter","inter","seg","rightSE","Operation","moreGeoms","operation","multipolys","MultiPolyIn","subject","mpA","SplayTreeSet3","sweepEvents","sweepLine","operation_default","segmentId","_Segment","leftSE","windings","alx","blx","arx","brx","aly","bly","ary","bry","aCmpBLeft","bCmpARight","bCmpALeft","aCmpBRight","by","bx","leftPt","rightPt","winding","cmpPts","newRightSE","tBbox","oBbox","bboxOverlap","tlp","trp","olp","orp","touchesOtherLSE","touchesThisLSE","touchesOtherRSE","touchesThisRSE","alreadyLinked","newLeftSE","oldRightSE","newSeg","tmpEvt","consumer","consumee","tmp","index","beforeState","ringsAfter","windingsAfter","mpsAfter","polysAfter","polysExclude","poly","mp","mpsBefore","noBefores","noAfters","least","most","diff","isJustSubject","mps","RingIn","geomRing","isExterior","firstPoint","BigNumber2","prevPoint","PolyIn","geomPoly","multiPoly","ringSweepEvents","isSubject","polySweepEvents","union","difference","difference2","geoms","differenced","polyclip.difference","turf_difference_default","flatten","results","turf_flatten_default","union2","unioned","polyclip.union","turf_union_default","unwrapBbox","bbox0","setMask","picked","setData","bb","tolerance","leaksLeft","leaksRight","flattened","position","EPSG_4326","defaultStyle","isMask","weight","Style","Stroke","Fill","Icon","Text","createOpenLayersMapController","map","flyToOptions","flyToBounds","fullGeometryStyle","prevSelected","prevHovered","eventHandler","reverseMarker","indicatingReverse","vectorLayer","VectorLayer","source","VectorSource","getProjection","getUserProjection","fromWgs84","handleMapClick","toLonLat","handler","center","zoom","fromLonLat","padding","maxZoom","transformExtent","reverse","OlFeature","OlPoint","markedFeatures","showPolygonMarker","data","OlPolygon","OlMultiPolygon","block","handled","OlGeometryCollection","OlLineString","OlMultiLineString","marker","offset","_c","view"],"mappings":"w9BAoCA,SAASA,GAAQC,EAAMC,EAAYC,EAAU,CAAA,EAAI,CAC/C,MAAMC,EAAO,CAAE,KAAM,SAAW,EAChC,OAAID,EAAQ,KAAO,GAAKA,EAAQ,MAC9BC,EAAK,GAAKD,EAAQ,IAEhBA,EAAQ,OACVC,EAAK,KAAOD,EAAQ,MAEtBC,EAAK,WAAaF,GAAc,CAAE,EAClCE,EAAK,SAAWH,EACTG,CACT,CA8CA,SAASC,GAAQC,EAAaJ,EAAYC,EAAU,CAAA,EAAI,CACtD,UAAWI,KAAQD,EAAa,CAC9B,GAAIC,EAAK,OAAS,EAChB,MAAM,IAAI,MACR,6DACD,EAEH,GAAIA,EAAKA,EAAK,OAAS,CAAC,EAAE,SAAWA,EAAK,CAAC,EAAE,OAC3C,MAAM,IAAI,MAAM,6CAA6C,EAE/D,QAASC,EAAI,EAAGA,EAAID,EAAKA,EAAK,OAAS,CAAC,EAAE,OAAQC,IAChD,GAAID,EAAKA,EAAK,OAAS,CAAC,EAAEC,CAAC,IAAMD,EAAK,CAAC,EAAEC,CAAC,EACxC,MAAM,IAAI,MAAM,6CAA6C,CAGrE,CAKE,OAAOR,GAJM,CACX,KAAM,UACN,YAAAM,CACD,EACoBJ,EAAYC,CAAO,CAC1C,CA2BA,SAASM,GAAkBC,EAAUP,EAAU,GAAI,CACjD,MAAMQ,EAAK,CAAE,KAAM,mBAAqB,EACxC,OAAIR,EAAQ,KACVQ,EAAG,GAAKR,EAAQ,IAEdA,EAAQ,OACVQ,EAAG,KAAOR,EAAQ,MAEpBQ,EAAG,SAAWD,EACPC,CACT,CAeA,SAASC,GAAaN,EAAaJ,EAAYC,EAAU,CAAA,EAAI,CAK3D,OAAOH,GAJM,CACX,KAAM,eACN,YAAAM,CACD,EACoBJ,EAAYC,CAAO,CAC1C,CC1KA,SAASU,GAAUC,EAASC,EAAUC,EAAkB,CACtD,GAAIF,IAAY,KAEhB,QADIN,EAAGS,EAAGC,EAAGC,EAAUC,EAAOC,EAAQC,EAAyBC,EAAa,EAAGC,EAAa,EAAGC,EAAsBC,EAAOZ,EAAQ,KAAMa,EAAsBD,IAAS,oBAAqBE,EAAYF,IAAS,UAAWG,EAAOF,EAAsBb,EAAQ,SAAS,OAAS,EAC5QgB,EAAe,EAAGA,EAAeD,EAAMC,IAAgB,CAC9DR,EAA0BK,EAAsBb,EAAQ,SAASgB,CAAY,EAAE,SAAWF,EAAYd,EAAQ,SAAWA,EACzHW,EAAuBH,EAA0BA,EAAwB,OAAS,qBAAuB,GACzGF,EAAQK,EAAuBH,EAAwB,WAAW,OAAS,EAC3E,QAASS,EAAY,EAAGA,EAAYX,EAAOW,IAAa,CACtD,IAAIC,EAAoB,EACpBC,EAAgB,EAEpB,GADAd,EAAWM,EAAuBH,EAAwB,WAAWS,CAAS,EAAIT,EAC9EH,IAAa,KACjB,CAAAE,EAASF,EAAS,YAClB,IAAIe,EAAWf,EAAS,KAExB,OADAI,EAA+F,EACvFW,EAAQ,CACd,KAAK,KACH,MACF,IAAK,QACH,GAAInB,EACFM,EACAG,EACAM,EACAE,EACAC,CACZ,IAAgB,GACJ,MAAO,GACTT,IACAQ,IACA,MACF,IAAK,aACL,IAAK,aACH,IAAKxB,EAAI,EAAGA,EAAIa,EAAO,OAAQb,IAAK,CAClC,GAAIO,EACFM,EAAOb,CAAC,EACRgB,EACAM,EACAE,EACAC,CACd,IAAkB,GACJ,MAAO,GACTT,IACIU,IAAa,cAAcF,GAC3C,CACcE,IAAa,cAAcF,IAC/B,MACF,IAAK,UACL,IAAK,kBACH,IAAKxB,EAAI,EAAGA,EAAIa,EAAO,OAAQb,IAAK,CAClC,IAAKS,EAAI,EAAGA,EAAII,EAAOb,CAAC,EAAE,OAASe,EAAYN,IAAK,CAClD,GAAIF,EACFM,EAAOb,CAAC,EAAES,CAAC,EACXO,EACAM,EACAE,EACAC,CAChB,IAAoB,GACJ,MAAO,GACTT,GACd,CACgBU,IAAa,mBAAmBF,IAChCE,IAAa,WAAWD,GACxC,CACcC,IAAa,WAAWF,IAC5B,MACF,IAAK,eACH,IAAKxB,EAAI,EAAGA,EAAIa,EAAO,OAAQb,IAAK,CAElC,IADAyB,EAAgB,EACXhB,EAAI,EAAGA,EAAII,EAAOb,CAAC,EAAE,OAAQS,IAAK,CACrC,IAAKC,EAAI,EAAGA,EAAIG,EAAOb,CAAC,EAAES,CAAC,EAAE,OAASM,EAAYL,IAAK,CACrD,GAAIH,EACFM,EAAOb,CAAC,EAAES,CAAC,EAAEC,CAAC,EACdM,EACAM,EACAE,EACAC,CAClB,IAAsB,GACJ,MAAO,GACTT,GAChB,CACcS,GACd,CACYD,GACZ,CACU,MACF,IAAK,qBACH,IAAKxB,EAAI,EAAGA,EAAIW,EAAS,WAAW,OAAQX,IAC1C,GAAIK,GAAUM,EAAS,WAAWX,CAAC,EAAGO,CAA0B,IAAM,GACpE,MAAO,GACX,MACF,QACE,MAAM,IAAI,MAAM,uBAAuB,CACjD,EACA,CACA,CACA,CAsEA,SAASoB,GAASrB,EAASC,EAAU,CACnC,IAAIqB,EAAG5B,EAAG6B,EAAGlB,EAAUC,EAAOE,EAAyBG,EAAsBa,EAAmBC,EAAaC,EAAWV,EAAe,EAAGH,EAAsBb,EAAQ,OAAS,oBAAqBc,EAAYd,EAAQ,OAAS,UAAWe,EAAOF,EAAsBb,EAAQ,SAAS,OAAS,EACrS,IAAKsB,EAAI,EAAGA,EAAIP,EAAMO,IAAK,CAOzB,IANAd,EAA0BK,EAAsBb,EAAQ,SAASsB,CAAC,EAAE,SAAWR,EAAYd,EAAQ,SAAWA,EAC9GwB,EAAoBX,EAAsBb,EAAQ,SAASsB,CAAC,EAAE,WAAaR,EAAYd,EAAQ,WAAa,CAAE,EAC9GyB,EAAcZ,EAAsBb,EAAQ,SAASsB,CAAC,EAAE,KAAOR,EAAYd,EAAQ,KAAO,OAC1F0B,EAAYb,EAAsBb,EAAQ,SAASsB,CAAC,EAAE,GAAKR,EAAYd,EAAQ,GAAK,OACpFW,EAAuBH,EAA0BA,EAAwB,OAAS,qBAAuB,GACzGF,EAAQK,EAAuBH,EAAwB,WAAW,OAAS,EACtEe,EAAI,EAAGA,EAAIjB,EAAOiB,IAAK,CAE1B,GADAlB,EAAWM,EAAuBH,EAAwB,WAAWe,CAAC,EAAIf,EACtEH,IAAa,KAAM,CACrB,GAAIJ,EACF,KACAe,EACAQ,EACAC,EACAC,CACV,IAAc,GACJ,MAAO,GACT,QACR,CACM,OAAQrB,EAAS,KAAI,CACnB,IAAK,QACL,IAAK,aACL,IAAK,aACL,IAAK,UACL,IAAK,kBACL,IAAK,eAAgB,CACnB,GAAIJ,EACFI,EACAW,EACAQ,EACAC,EACAC,CACZ,IAAgB,GACJ,MAAO,GACT,KACV,CACQ,IAAK,qBAAsB,CACzB,IAAKhC,EAAI,EAAGA,EAAIW,EAAS,WAAW,OAAQX,IAC1C,GAAIO,EACFI,EAAS,WAAWX,CAAC,EACrBsB,EACAQ,EACAC,EACAC,CACd,IAAkB,GACJ,MAAO,GAEX,KACV,CACQ,QACE,MAAM,IAAI,MAAM,uBAAuB,CACjD,CACA,CACIV,GACJ,CACA,CAqBA,SAASW,GAAY3B,EAASC,EAAU,CACtCoB,GAASrB,EAAS,SAASK,EAAUW,EAAc5B,EAAYwC,EAAMC,EAAI,CACvE,IAAIjB,EAAOP,IAAa,KAAO,KAAOA,EAAS,KAC/C,OAAQO,EAAI,CACV,KAAK,KACL,IAAK,QACL,IAAK,aACL,IAAK,UACH,OAAIX,EACFf,GAAQmB,EAAUjB,EAAY,CAAE,KAAAwC,EAAM,GAAAC,CAAE,CAAE,EAC1Cb,EACA,CACV,IAAc,GACG,GACT,MACR,CACI,IAAII,EACJ,OAAQR,EAAI,CACV,IAAK,aACHQ,EAAW,QACX,MACF,IAAK,kBACHA,EAAW,aACX,MACF,IAAK,eACHA,EAAW,UACX,KACR,CACI,QAASF,EAAoB,EAAGA,EAAoBb,EAAS,YAAY,OAAQa,IAAqB,CACpG,IAAIY,EAAazB,EAAS,YAAYa,CAAiB,EACnD/B,EAAO,CACT,KAAMiC,EACN,YAAaU,CACd,EACD,GAAI7B,EAASf,GAAQC,EAAMC,CAAU,EAAG4B,EAAcE,CAAiB,IAAM,GAC3E,MAAO,EACf,CACA,CAAG,CACH,CC1RA,SAASU,GAAK5B,EAASX,EAAU,GAAI,CACnC,GAAIW,EAAQ,MAAQ,MAAiBX,EAAQ,YAAjB,GAC1B,OAAOW,EAAQ,KAEjB,MAAM+B,EAAS,CAAC,IAAU,IAAU,KAAW,IAAS,EACxD,OAAAhC,GAAUC,EAAUgC,GAAU,CACxBD,EAAO,CAAC,EAAIC,EAAM,CAAC,IACrBD,EAAO,CAAC,EAAIC,EAAM,CAAC,GAEjBD,EAAO,CAAC,EAAIC,EAAM,CAAC,IACrBD,EAAO,CAAC,EAAIC,EAAM,CAAC,GAEjBD,EAAO,CAAC,EAAIC,EAAM,CAAC,IACrBD,EAAO,CAAC,EAAIC,EAAM,CAAC,GAEjBD,EAAO,CAAC,EAAIC,EAAM,CAAC,IACrBD,EAAO,CAAC,EAAIC,EAAM,CAAC,EAEzB,CAAG,EACMD,CACT,CACA,IAAIE,GAAoBL,GC0BtBM,GAAY,6CACZC,GAAW,KAAK,KAChBC,EAAY,KAAK,MAEjBC,EAAiB,qBACjBC,GAAgBD,EAAiB,yDAEjCE,GAAO,KACPC,EAAW,GACXC,GAAmB,iBAEnBC,GAAW,CAAC,EAAG,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,IAAI,EACjFC,GAAY,IAKZC,EAAM,IAMR,SAASC,GAAMC,EAAc,CAC3B,IAAIC,EAAKC,EAAaC,EACpBC,EAAIC,EAAU,UAAY,CAAE,YAAaA,EAAW,SAAU,KAAM,QAAS,IAAM,EACnFC,EAAM,IAAID,EAAU,CAAC,EAUrBE,EAAiB,GAajBC,EAAgB,EAMhBC,EAAa,GAIbC,EAAa,GAMbC,EAAU,KAKVC,EAAU,IAGVC,EAAS,GAkBTC,EAAc,EAIdC,EAAgB,EAGhBC,EAAS,CACP,OAAQ,GACR,UAAW,EACX,mBAAoB,EACpB,eAAgB,IAChB,iBAAkB,IAClB,kBAAmB,EACnB,uBAAwB,IACxB,OAAQ,EACT,EAKDC,EAAW,uCACXC,EAAiC,GAgBnC,SAASb,EAAUc,EAAGC,EAAG,CACvB,IAAIC,EAAUC,EAAGC,EAAaC,EAAGhD,EAAGiD,EAAOC,EAAKC,EAC9CC,EAAI,KAGN,GAAI,EAAEA,aAAavB,GAAY,OAAO,IAAIA,EAAUc,EAAGC,CAAC,EAExD,GAAIA,GAAK,KAAM,CAEb,GAAID,GAAKA,EAAE,eAAiB,GAAM,CAChCS,EAAE,EAAIT,EAAE,EAEJ,CAACA,EAAE,GAAKA,EAAE,EAAIP,EAChBgB,EAAE,EAAIA,EAAE,EAAI,KACHT,EAAE,EAAIR,EACfiB,EAAE,EAAI,CAACA,EAAE,EAAI,CAAC,GAEdA,EAAE,EAAIT,EAAE,EACRS,EAAE,EAAIT,EAAE,EAAE,MAAK,GAGjB,MACD,CAED,IAAKM,EAAQ,OAAON,GAAK,WAAaA,EAAI,GAAK,EAAG,CAMhD,GAHAS,EAAE,EAAI,EAAIT,EAAI,GAAKA,EAAI,CAACA,EAAG,IAAM,EAG7BA,IAAM,CAAC,CAACA,EAAG,CACb,IAAKK,EAAI,EAAGhD,EAAI2C,EAAG3C,GAAK,GAAIA,GAAK,GAAIgD,IAAI,CAErCA,EAAIZ,EACNgB,EAAE,EAAIA,EAAE,EAAI,MAEZA,EAAE,EAAIJ,EACNI,EAAE,EAAI,CAACT,CAAC,GAGV,MACD,CAEDQ,EAAM,OAAOR,CAAC,CACtB,KAAa,CAEL,GAAI,CAAC/B,GAAU,KAAKuC,EAAM,OAAOR,CAAC,CAAC,EAAG,OAAOhB,EAAayB,EAAGD,EAAKF,CAAK,EAEvEG,EAAE,EAAID,EAAI,WAAW,CAAC,GAAK,IAAMA,EAAMA,EAAI,MAAM,CAAC,EAAG,IAAM,CAC5D,EAGIH,EAAIG,EAAI,QAAQ,GAAG,GAAK,KAAIA,EAAMA,EAAI,QAAQ,IAAK,EAAE,IAGrDnD,EAAImD,EAAI,OAAO,IAAI,GAAK,GAGvBH,EAAI,IAAGA,EAAIhD,GACfgD,GAAK,CAACG,EAAI,MAAMnD,EAAI,CAAC,EACrBmD,EAAMA,EAAI,UAAU,EAAGnD,CAAC,GACfgD,EAAI,IAGbA,EAAIG,EAAI,OAGhB,KAAW,CAOL,GAJAE,EAAST,EAAG,EAAGH,EAAS,OAAQ,MAAM,EAIlCG,GAAK,IAAMF,EACb,OAAAU,EAAI,IAAIvB,EAAUc,CAAC,EACZW,GAAMF,EAAGrB,EAAiBqB,EAAE,EAAI,EAAGpB,CAAa,EAKzD,GAFAmB,EAAM,OAAOR,CAAC,EAEVM,EAAQ,OAAON,GAAK,SAAU,CAGhC,GAAIA,EAAI,GAAK,EAAG,OAAOhB,EAAayB,EAAGD,EAAKF,EAAOL,CAAC,EAKpD,GAHAQ,EAAE,EAAI,EAAIT,EAAI,GAAKQ,EAAMA,EAAI,MAAM,CAAC,EAAG,IAAM,EAGzCtB,EAAU,OAASsB,EAAI,QAAQ,YAAa,EAAE,EAAE,OAAS,GAC3D,MAAM,MACJnC,GAAgB2B,CAAC,CAE7B,MACQS,EAAE,EAAID,EAAI,WAAW,CAAC,IAAM,IAAMA,EAAMA,EAAI,MAAM,CAAC,EAAG,IAAM,EAQ9D,IALAN,EAAWJ,EAAS,MAAM,EAAGG,CAAC,EAC9BI,EAAIhD,EAAI,EAIHkD,EAAMC,EAAI,OAAQnD,EAAIkD,EAAKlD,IAC9B,GAAI6C,EAAS,QAAQC,EAAIK,EAAI,OAAOnD,CAAC,CAAC,EAAI,EAAG,CAC3C,GAAI8C,GAAK,KAGP,GAAI9C,EAAIgD,EAAG,CACTA,EAAIE,EACJ,QACD,UACQ,CAACH,IAGNI,GAAOA,EAAI,YAAW,IAAOA,EAAMA,EAAI,gBACvCA,GAAOA,EAAI,YAAa,IAAKA,EAAMA,EAAI,YAAW,IAAK,CACzDJ,EAAc,GACd/C,EAAI,GACJgD,EAAI,EACJ,QACD,CAGH,OAAOrB,EAAayB,EAAG,OAAOT,CAAC,EAAGM,EAAOL,CAAC,CAC3C,CAIHK,EAAQ,GACRE,EAAMzB,EAAYyB,EAAKP,EAAG,GAAIQ,EAAE,CAAC,GAG5BJ,EAAIG,EAAI,QAAQ,GAAG,GAAK,GAAIA,EAAMA,EAAI,QAAQ,IAAK,EAAE,EACrDH,EAAIG,EAAI,MACd,CAGD,IAAKnD,EAAI,EAAGmD,EAAI,WAAWnD,CAAC,IAAM,GAAIA,IAAI,CAG1C,IAAKkD,EAAMC,EAAI,OAAQA,EAAI,WAAW,EAAED,CAAG,IAAM,IAAI,CAErD,GAAIC,EAAMA,EAAI,MAAMnD,EAAG,EAAEkD,CAAG,EAAG,CAI7B,GAHAA,GAAOlD,EAGHiD,GAASpB,EAAU,OACrBqB,EAAM,KAAOP,EAAIxB,IAAoBwB,IAAM7B,EAAU6B,CAAC,GACpD,MAAM,MACJ3B,GAAiBoC,EAAE,EAAIT,CAAE,EAI/B,IAAKK,EAAIA,EAAIhD,EAAI,GAAKoC,EAGpBgB,EAAE,EAAIA,EAAE,EAAI,aAGHJ,EAAIb,EAGbiB,EAAE,EAAI,CAACA,EAAE,EAAI,CAAC,MACT,CAWL,GAVAA,EAAE,EAAIJ,EACNI,EAAE,EAAI,GAMNpD,GAAKgD,EAAI,GAAK9B,EACV8B,EAAI,IAAGhD,GAAKkB,GAEZlB,EAAIkD,EAAK,CAGX,IAFIlD,GAAGoD,EAAE,EAAE,KAAK,CAACD,EAAI,MAAM,EAAGnD,CAAC,CAAC,EAE3BkD,GAAOhC,EAAUlB,EAAIkD,GACxBE,EAAE,EAAE,KAAK,CAACD,EAAI,MAAMnD,EAAGA,GAAKkB,CAAQ,CAAC,EAGvClB,EAAIkB,GAAYiC,EAAMA,EAAI,MAAMnD,CAAC,GAAG,MAC9C,MACUA,GAAKkD,EAGP,KAAOlD,IAAKmD,GAAO,IAAI,CACvBC,EAAE,EAAE,KAAK,CAACD,CAAG,CACd,CACP,MAGMC,EAAE,EAAI,CAACA,EAAE,EAAI,CAAC,CAEjB,CAMDvB,EAAU,MAAQN,GAElBM,EAAU,SAAW,EACrBA,EAAU,WAAa,EACvBA,EAAU,WAAa,EACvBA,EAAU,YAAc,EACxBA,EAAU,cAAgB,EAC1BA,EAAU,gBAAkB,EAC5BA,EAAU,gBAAkB,EAC5BA,EAAU,gBAAkB,EAC5BA,EAAU,iBAAmB,EAC7BA,EAAU,OAAS,EAqCnBA,EAAU,OAASA,EAAU,IAAM,SAAU0B,EAAK,CAChD,IAAIC,EAAGb,EAEP,GAAIY,GAAO,KAET,GAAI,OAAOA,GAAO,SAAU,CAsC1B,GAlCIA,EAAI,eAAeC,EAAI,gBAAgB,IACzCb,EAAIY,EAAIC,CAAC,EACTH,EAASV,EAAG,EAAGrB,EAAKkC,CAAC,EACrBzB,EAAiBY,GAKfY,EAAI,eAAeC,EAAI,eAAe,IACxCb,EAAIY,EAAIC,CAAC,EACTH,EAASV,EAAG,EAAG,EAAGa,CAAC,EACnBxB,EAAgBW,GAOdY,EAAI,eAAeC,EAAI,gBAAgB,IACzCb,EAAIY,EAAIC,CAAC,EACLb,GAAKA,EAAE,KACTU,EAASV,EAAE,CAAC,EAAG,KAAM,EAAGa,CAAC,EACzBH,EAASV,EAAE,CAAC,EAAG,EAAGrB,EAAKkC,CAAC,EACxBvB,EAAaU,EAAE,CAAC,EAChBT,EAAaS,EAAE,CAAC,IAEhBU,EAASV,EAAG,KAAMrB,EAAKkC,CAAC,EACxBvB,EAAa,EAAEC,EAAaS,EAAI,EAAI,CAACA,EAAIA,KAOzCY,EAAI,eAAeC,EAAI,OAAO,EAEhC,GADAb,EAAIY,EAAIC,CAAC,EACLb,GAAKA,EAAE,IACTU,EAASV,EAAE,CAAC,EAAG,KAAM,GAAIa,CAAC,EAC1BH,EAASV,EAAE,CAAC,EAAG,EAAGrB,EAAKkC,CAAC,EACxBrB,EAAUQ,EAAE,CAAC,EACbP,EAAUO,EAAE,CAAC,UAEbU,EAASV,EAAG,KAAMrB,EAAKkC,CAAC,EACpBb,EACFR,EAAU,EAAEC,EAAUO,EAAI,EAAI,CAACA,EAAIA,OAEnC,OAAM,MACJ5B,EAAiByC,EAAI,oBAAsBb,CAAC,EAQpD,GAAIY,EAAI,eAAeC,EAAI,QAAQ,EAEjC,GADAb,EAAIY,EAAIC,CAAC,EACLb,IAAM,CAAC,CAACA,EACV,GAAIA,EACF,GAAI,OAAO,OAAU,KAAe,SAClC,OAAO,iBAAmB,OAAO,aACjCN,EAASM,MAET,OAAAN,EAAS,CAACM,EACJ,MACJ5B,EAAiB,oBAAoB,OAGzCsB,EAASM,MAGX,OAAM,MACJ5B,EAAiByC,EAAI,uBAAyBb,CAAC,EAsBrD,GAhBIY,EAAI,eAAeC,EAAI,aAAa,IACtCb,EAAIY,EAAIC,CAAC,EACTH,EAASV,EAAG,EAAG,EAAGa,CAAC,EACnBlB,EAAcK,GAKZY,EAAI,eAAeC,EAAI,eAAe,IACxCb,EAAIY,EAAIC,CAAC,EACTH,EAASV,EAAG,EAAGrB,EAAKkC,CAAC,EACrBjB,EAAgBI,GAKdY,EAAI,eAAeC,EAAI,QAAQ,EAEjC,GADAb,EAAIY,EAAIC,CAAC,EACL,OAAOb,GAAK,SAAUH,EAASG,MAC9B,OAAM,MACT5B,EAAiByC,EAAI,mBAAqBb,CAAC,EAK/C,GAAIY,EAAI,eAAeC,EAAI,UAAU,EAKnC,GAJAb,EAAIY,EAAIC,CAAC,EAIL,OAAOb,GAAK,UAAY,CAAC,wBAAwB,KAAKA,CAAC,EACzDD,EAAiCC,EAAE,MAAM,EAAG,EAAE,GAAK,aACnDF,EAAWE,MAEX,OAAM,MACJ5B,EAAiByC,EAAI,aAAeb,CAAC,CAInD,KAGQ,OAAM,MACJ5B,EAAiB,oBAAsBwC,CAAG,EAIhD,MAAO,CACL,eAAgBxB,EAChB,cAAeC,EACf,eAAgB,CAACC,EAAYC,CAAU,EACvC,MAAO,CAACC,EAASC,CAAO,EACxB,OAAQC,EACR,YAAaC,EACb,cAAeC,EACf,OAAQC,EACR,SAAUC,CAChB,CACA,EAYEZ,EAAU,YAAc,SAAUc,EAAG,CACnC,GAAI,CAACA,GAAKA,EAAE,eAAiB,GAAM,MAAO,GAC1C,GAAI,CAACd,EAAU,MAAO,MAAO,GAE7B,IAAI7B,EAAGyD,EACLX,EAAIH,EAAE,EACNK,EAAIL,EAAE,EACNe,EAAIf,EAAE,EAERgB,EAAK,GAAI,CAAA,EAAG,SAAS,KAAKb,CAAC,GAAK,kBAE9B,IAAKY,IAAM,GAAKA,IAAM,KAAOV,GAAK,MAAQA,GAAK1B,GAAO0B,IAAMlC,EAAUkC,CAAC,EAAG,CAGxE,GAAIF,EAAE,CAAC,IAAM,EAAG,CACd,GAAIE,IAAM,GAAKF,EAAE,SAAW,EAAG,MAAO,GACtC,MAAMa,CACP,CAQD,GALA3D,GAAKgD,EAAI,GAAK9B,EACVlB,EAAI,IAAGA,GAAKkB,GAIZ,OAAO4B,EAAE,CAAC,CAAC,EAAE,QAAU9C,EAAG,CAE5B,IAAKA,EAAI,EAAGA,EAAI8C,EAAE,OAAQ9C,IAExB,GADAyD,EAAIX,EAAE9C,CAAC,EACHyD,EAAI,GAAKA,GAAKxC,IAAQwC,IAAM3C,EAAU2C,CAAC,EAAG,MAAME,EAItD,GAAIF,IAAM,EAAG,MAAO,EACrB,CACF,UAGQX,IAAM,MAAQE,IAAM,OAASU,IAAM,MAAQA,IAAM,GAAKA,IAAM,IACrE,MAAO,GAGT,MAAM,MACH3C,EAAiB,sBAAwB4B,CAAC,CACjD,EAQEd,EAAU,QAAUA,EAAU,IAAM,UAAY,CAC9C,OAAO+B,EAAS,UAAW,EAAE,CACjC,EAQE/B,EAAU,QAAUA,EAAU,IAAM,UAAY,CAC9C,OAAO+B,EAAS,UAAW,CAAC,CAChC,EAaE/B,EAAU,OAAU,UAAY,CAC9B,IAAIgC,EAAU,iBAMVC,EAAkB,KAAK,OAAQ,EAAGD,EAAW,QAC9C,UAAY,CAAE,OAAO/C,EAAU,KAAK,OAAQ,EAAG+C,CAAO,CAAI,EAC1D,UAAY,CAAE,OAAS,KAAK,OAAM,EAAK,WAAa,GAAK,SACxD,KAAK,OAAQ,EAAG,QAAW,EAAG,EAElC,OAAO,SAAUE,EAAI,CACnB,IAAIC,EAAGpB,EAAGI,EAAGnE,EAAG8D,EACd3C,EAAI,EACJ8C,EAAI,CAAE,EACNmB,EAAO,IAAIpC,EAAUC,CAAG,EAO1B,GALIiC,GAAM,KAAMA,EAAKhC,EAChBsB,EAASU,EAAI,EAAGzC,CAAG,EAExBzC,EAAIgC,GAASkD,EAAK7C,CAAQ,EAEtBmB,EAGF,GAAI,OAAO,gBAAiB,CAI1B,IAFA2B,EAAI,OAAO,gBAAgB,IAAI,YAAYnF,GAAK,CAAC,CAAC,EAE3CmB,EAAInB,GAQT8D,EAAIqB,EAAEhE,CAAC,EAAI,QAAWgE,EAAEhE,EAAI,CAAC,IAAM,IAM/B2C,GAAK,MACPC,EAAI,OAAO,gBAAgB,IAAI,YAAY,CAAC,CAAC,EAC7CoB,EAAEhE,CAAC,EAAI4C,EAAE,CAAC,EACVoB,EAAEhE,EAAI,CAAC,EAAI4C,EAAE,CAAC,IAKdE,EAAE,KAAKH,EAAI,IAAI,EACf3C,GAAK,GAGTA,EAAInB,EAAI,CAGlB,SAAmB,OAAO,YAAa,CAK7B,IAFAmF,EAAI,OAAO,YAAYnF,GAAK,CAAC,EAEtBmB,EAAInB,GAMT8D,GAAMqB,EAAEhE,CAAC,EAAI,IAAM,gBAAoBgE,EAAEhE,EAAI,CAAC,EAAI,cAC9CgE,EAAEhE,EAAI,CAAC,EAAI,WAAgBgE,EAAEhE,EAAI,CAAC,EAAI,UACtCgE,EAAEhE,EAAI,CAAC,GAAK,KAAOgE,EAAEhE,EAAI,CAAC,GAAK,GAAKgE,EAAEhE,EAAI,CAAC,EAE3C2C,GAAK,KACP,OAAO,YAAY,CAAC,EAAE,KAAKqB,EAAGhE,CAAC,GAI/B8C,EAAE,KAAKH,EAAI,IAAI,EACf3C,GAAK,GAGTA,EAAInB,EAAI,CAClB,KACU,OAAAwD,EAAS,GACH,MACJtB,EAAiB,oBAAoB,EAK3C,GAAI,CAACsB,EAEH,KAAOrC,EAAInB,GACT8D,EAAImB,EAAc,EACdnB,EAAI,OAAMG,EAAE9C,GAAG,EAAI2C,EAAI,MAc/B,IAVA9D,EAAIiE,EAAE,EAAE9C,CAAC,EACT+D,GAAM7C,EAGFrC,GAAKkF,IACPpB,EAAIvB,GAASF,EAAW6C,CAAE,EAC1BjB,EAAE9C,CAAC,EAAIc,EAAUjC,EAAI8D,CAAC,EAAIA,GAIrBG,EAAE9C,CAAC,IAAM,EAAG8C,EAAE,IAAK,EAAE9C,IAAI,CAGhC,GAAIA,EAAI,EACN8C,EAAI,CAACE,EAAI,CAAC,MACL,CAGL,IAAKA,EAAI,GAAKF,EAAE,CAAC,IAAM,EAAGA,EAAE,OAAO,EAAG,CAAC,EAAGE,GAAK9B,EAAS,CAGxD,IAAKlB,EAAI,EAAG2C,EAAIG,EAAE,CAAC,EAAGH,GAAK,GAAIA,GAAK,GAAI3C,IAAI,CAGxCA,EAAIkB,IAAU8B,GAAK9B,EAAWlB,EACnC,CAED,OAAAiE,EAAK,EAAIjB,EACTiB,EAAK,EAAInB,EACFmB,CACb,CACA,IAQEpC,EAAU,IAAM,UAAY,CAI1B,QAHI7B,EAAI,EACNkE,EAAO,UACPC,EAAM,IAAItC,EAAUqC,EAAK,CAAC,CAAC,EACtBlE,EAAIkE,EAAK,QAASC,EAAMA,EAAI,KAAKD,EAAKlE,GAAG,CAAC,EACjD,OAAOmE,CACX,EAOEzC,EAAe,UAAY,CACzB,IAAI0C,EAAU,aAOd,SAASC,EAAUlB,EAAKmB,EAAQC,EAAS1B,EAAU,CAOjD,QANIzE,EACFoG,EAAM,CAAC,CAAC,EACRC,EACAzE,EAAI,EACJkD,EAAMC,EAAI,OAELnD,EAAIkD,GAAM,CACf,IAAKuB,EAAOD,EAAI,OAAQC,IAAQD,EAAIC,CAAI,GAAKH,EAAO,CAIpD,IAFAE,EAAI,CAAC,GAAK3B,EAAS,QAAQM,EAAI,OAAOnD,GAAG,CAAC,EAErC5B,EAAI,EAAGA,EAAIoG,EAAI,OAAQpG,IAEtBoG,EAAIpG,CAAC,EAAImG,EAAU,IACjBC,EAAIpG,EAAI,CAAC,GAAK,OAAMoG,EAAIpG,EAAI,CAAC,EAAI,GACrCoG,EAAIpG,EAAI,CAAC,GAAKoG,EAAIpG,CAAC,EAAImG,EAAU,EACjCC,EAAIpG,CAAC,GAAKmG,EAGf,CAED,OAAOC,EAAI,SACZ,CAKD,OAAO,SAAUrB,EAAKmB,EAAQC,EAASG,EAAMC,EAAkB,CAC7D,IAAI9B,EAAU+B,EAAG5B,EAAGnE,EAAGgG,EAAGzB,EAAG0B,EAAIC,EAC/B/E,EAAImD,EAAI,QAAQ,GAAG,EACnBY,EAAKhC,EACLiD,EAAKhD,EA+BP,IA5BIhC,GAAK,IACPnB,EAAI0D,EAGJA,EAAgB,EAChBY,EAAMA,EAAI,QAAQ,IAAK,EAAE,EACzB4B,EAAI,IAAIlD,EAAUyC,CAAM,EACxBlB,EAAI2B,EAAE,IAAI5B,EAAI,OAASnD,CAAC,EACxBuC,EAAgB1D,EAKhBkG,EAAE,EAAIV,EAAUY,GAAaC,GAAc9B,EAAE,CAAC,EAAGA,EAAE,EAAG,GAAG,EACxD,GAAImB,EAASH,CAAO,EACrBW,EAAE,EAAIA,EAAE,EAAE,QAKZD,EAAKT,EAAUlB,EAAKmB,EAAQC,EAASI,GACjC9B,EAAWJ,EAAU2B,IACrBvB,EAAWuB,EAAS3B,EAAS,EAGjCO,EAAInE,EAAIiG,EAAG,OAGJA,EAAG,EAAEjG,CAAC,GAAK,EAAGiG,EAAG,IAAG,EAAG,CAG9B,GAAI,CAACA,EAAG,CAAC,EAAG,OAAOjC,EAAS,OAAO,CAAC,EAqCpC,GAlCI7C,EAAI,EACN,EAAEgD,GAEFI,EAAE,EAAI0B,EACN1B,EAAE,EAAIJ,EAGNI,EAAE,EAAIsB,EACNtB,EAAI3B,EAAI2B,EAAG2B,EAAGhB,EAAIiB,EAAIT,CAAO,EAC7BO,EAAK1B,EAAE,EACPyB,EAAIzB,EAAE,EACNJ,EAAII,EAAE,GAMRwB,EAAI5B,EAAIe,EAAK,EAGb/D,EAAI8E,EAAGF,CAAC,EAIR/F,EAAI0F,EAAU,EACdM,EAAIA,GAAKD,EAAI,GAAKE,EAAGF,EAAI,CAAC,GAAK,KAE/BC,EAAIG,EAAK,GAAKhF,GAAK,MAAQ6E,KAAOG,GAAM,GAAKA,IAAO5B,EAAE,EAAI,EAAI,EAAI,IAC1DpD,EAAInB,GAAKmB,GAAKnB,IAAKmG,GAAM,GAAKH,GAAKG,GAAM,GAAKF,EAAGF,EAAI,CAAC,EAAI,GAC3DI,IAAO5B,EAAE,EAAI,EAAI,EAAI,IAKxBwB,EAAI,GAAK,CAACE,EAAG,CAAC,EAGhB3B,EAAM0B,EAAII,GAAapC,EAAS,OAAO,CAAC,EAAG,CAACkB,EAAIlB,EAAS,OAAO,CAAC,CAAC,EAAIA,EAAS,OAAO,CAAC,MAClF,CAML,GAHAiC,EAAG,OAASF,EAGRC,EAGF,IAAK,EAAEN,EAAS,EAAEO,EAAG,EAAEF,CAAC,EAAIL,GAC1BO,EAAGF,CAAC,EAAI,EAEHA,IACH,EAAE5B,EACF8B,EAAK,CAAC,CAAC,EAAE,OAAOA,CAAE,GAMxB,IAAKjG,EAAIiG,EAAG,OAAQ,CAACA,EAAG,EAAEjG,CAAC,GAAG,CAG9B,IAAKmB,EAAI,EAAGmD,EAAM,GAAInD,GAAKnB,EAAGsE,GAAON,EAAS,OAAOiC,EAAG9E,GAAG,CAAC,EAAE,CAG9DmD,EAAM8B,GAAa9B,EAAKH,EAAGH,EAAS,OAAO,CAAC,CAAC,CAC9C,CAGD,OAAOM,CACb,CACA,IAIE1B,EAAO,UAAY,CAGjB,SAAS0D,EAAS/B,EAAGvE,EAAGuG,EAAM,CAC5B,IAAIC,EAAGC,EAAMC,EAAKC,EAChBC,EAAQ,EACRzF,EAAIoD,EAAE,OACNsC,EAAM7G,EAAIwC,GACVsE,EAAM9G,EAAIwC,GAAY,EAExB,IAAK+B,EAAIA,EAAE,MAAO,EAAEpD,KAClBuF,EAAMnC,EAAEpD,CAAC,EAAIqB,GACbmE,EAAMpC,EAAEpD,CAAC,EAAIqB,GAAY,EACzBgE,EAAIM,EAAMJ,EAAMC,EAAME,EACtBJ,EAAOI,EAAMH,EAAQF,EAAIhE,GAAaA,GAAaoE,EACnDA,GAASH,EAAOF,EAAO,IAAMC,EAAIhE,GAAY,GAAKsE,EAAMH,EACxDpC,EAAEpD,CAAC,EAAIsF,EAAOF,EAGhB,OAAIK,IAAOrC,EAAI,CAACqC,CAAK,EAAE,OAAOrC,CAAC,GAExBA,CACR,CAED,SAASwC,EAAQ5B,EAAGpB,EAAGiD,EAAIC,EAAI,CAC7B,IAAI9F,EAAG+F,EAEP,GAAIF,GAAMC,EACRC,EAAMF,EAAKC,EAAK,EAAI,OAGpB,KAAK9F,EAAI+F,EAAM,EAAG/F,EAAI6F,EAAI7F,IAExB,GAAIgE,EAAEhE,CAAC,GAAK4C,EAAE5C,CAAC,EAAG,CAChB+F,EAAM/B,EAAEhE,CAAC,EAAI4C,EAAE5C,CAAC,EAAI,EAAI,GACxB,KACD,CAIL,OAAO+F,CACR,CAED,SAASC,EAAShC,EAAGpB,EAAGiD,EAAIT,EAAM,CAIhC,QAHIpF,EAAI,EAGD6F,KACL7B,EAAE6B,CAAE,GAAK7F,EACTA,EAAIgE,EAAE6B,CAAE,EAAIjD,EAAEiD,CAAE,EAAI,EAAI,EACxB7B,EAAE6B,CAAE,EAAI7F,EAAIoF,EAAOpB,EAAE6B,CAAE,EAAIjD,EAAEiD,CAAE,EAIjC,KAAO,CAAC7B,EAAE,CAAC,GAAKA,EAAE,OAAS,EAAGA,EAAE,OAAO,EAAG,CAAC,EAAE,CAC9C,CAGD,OAAO,SAAUZ,EAAG2B,EAAGhB,EAAIiB,EAAII,EAAM,CACnC,IAAIW,EAAK/C,EAAGhD,EAAGiG,EAAMxC,EAAGyC,EAAMC,EAAOC,EAAGC,EAAIC,EAAKC,EAAMC,EAAMC,GAAIC,GAAIC,GACnEC,GAAIC,GACJnD,GAAIN,EAAE,GAAK2B,EAAE,EAAI,EAAI,GACrBD,EAAK1B,EAAE,EACP0D,EAAK/B,EAAE,EAGT,GAAI,CAACD,GAAM,CAACA,EAAG,CAAC,GAAK,CAACgC,GAAM,CAACA,EAAG,CAAC,EAE/B,OAAO,IAAIjF,EAGV,CAACuB,EAAE,GAAK,CAAC2B,EAAE,IAAMD,EAAKgC,GAAMhC,EAAG,CAAC,GAAKgC,EAAG,CAAC,EAAI,CAACA,GAAM,IAGnDhC,GAAMA,EAAG,CAAC,GAAK,GAAK,CAACgC,EAAKpD,GAAI,EAAIA,GAAI,CAChD,EAgBM,IAbA0C,EAAI,IAAIvE,EAAU6B,EAAC,EACnB2C,EAAKD,EAAE,EAAI,GACXpD,EAAII,EAAE,EAAI2B,EAAE,EACZrB,GAAIK,EAAKf,EAAI,EAERoC,IACHA,EAAOnE,GACP+B,EAAI+D,EAAS3D,EAAE,EAAIlC,CAAQ,EAAI6F,EAAShC,EAAE,EAAI7D,CAAQ,EACtDwC,GAAIA,GAAIxC,EAAW,GAKhBlB,EAAI,EAAG8G,EAAG9G,CAAC,IAAM8E,EAAG9E,CAAC,GAAK,GAAIA,IAAI,CAIvC,GAFI8G,EAAG9G,CAAC,GAAK8E,EAAG9E,CAAC,GAAK,IAAIgD,IAEtBU,GAAI,EACN2C,EAAG,KAAK,CAAC,EACTJ,EAAO,OACF,CAwBL,IAvBAS,GAAK5B,EAAG,OACR8B,GAAKE,EAAG,OACR9G,EAAI,EACJ0D,IAAK,EAILD,EAAI3C,EAAUsE,GAAQ0B,EAAG,CAAC,EAAI,EAAE,EAI5BrD,EAAI,IACNqD,EAAK3B,EAAS2B,EAAIrD,EAAG2B,CAAI,EACzBN,EAAKK,EAASL,EAAIrB,EAAG2B,CAAI,EACzBwB,GAAKE,EAAG,OACRJ,GAAK5B,EAAG,QAGV2B,GAAKG,GACLN,EAAMxB,EAAG,MAAM,EAAG8B,EAAE,EACpBL,EAAOD,EAAI,OAGJC,EAAOK,GAAIN,EAAIC,GAAM,EAAI,EAAE,CAClCM,GAAKC,EAAG,QACRD,GAAK,CAAC,CAAC,EAAE,OAAOA,EAAE,EAClBF,GAAMG,EAAG,CAAC,EACNA,EAAG,CAAC,GAAK1B,EAAO,GAAGuB,KAIvB,EAAG,CAOD,GANAlD,EAAI,EAGJsC,EAAMH,EAAQkB,EAAIR,EAAKM,GAAIL,CAAI,EAG3BR,EAAM,EAAG,CAqBX,GAjBAS,EAAOF,EAAI,CAAC,EACRM,IAAML,IAAMC,EAAOA,EAAOpB,GAAQkB,EAAI,CAAC,GAAK,IAGhD7C,EAAI3C,EAAU0F,EAAOG,EAAG,EAapBlD,EAAI,EAcN,IAXIA,GAAK2B,IAAM3B,EAAI2B,EAAO,GAG1Bc,EAAOf,EAAS2B,EAAIrD,EAAG2B,CAAI,EAC3Be,EAAQD,EAAK,OACbK,EAAOD,EAAI,OAMJV,EAAQM,EAAMI,EAAKH,EAAOI,CAAI,GAAK,GACxC9C,IAGAuC,EAASE,EAAMU,GAAKT,EAAQU,GAAKC,EAAIX,EAAOf,CAAI,EAChDe,EAAQD,EAAK,OACbH,EAAM,OAQJtC,GAAK,IAGPsC,EAAMtC,EAAI,GAIZyC,EAAOY,EAAG,QACVX,EAAQD,EAAK,OAUf,GAPIC,EAAQI,IAAML,EAAO,CAAC,CAAC,EAAE,OAAOA,CAAI,GAGxCF,EAASM,EAAKJ,EAAMK,EAAMnB,CAAI,EAC9BmB,EAAOD,EAAI,OAGPP,GAAO,GAMT,KAAOH,EAAQkB,EAAIR,EAAKM,GAAIL,CAAI,EAAI,GAClC9C,IAGAuC,EAASM,EAAKM,GAAKL,EAAOM,GAAKC,EAAIP,EAAMnB,CAAI,EAC7CmB,EAAOD,EAAI,MAG3B,MAAqBP,IAAQ,IACjBtC,IACA6C,EAAM,CAAC,CAAC,GAIVD,EAAGrG,GAAG,EAAIyD,EAGN6C,EAAI,CAAC,EACPA,EAAIC,GAAM,EAAIzB,EAAG2B,EAAE,GAAK,GAExBH,EAAM,CAACxB,EAAG2B,EAAE,CAAC,EACbF,EAAO,EAEnB,QAAkBE,KAAOC,IAAMJ,EAAI,CAAC,GAAK,OAAS5C,MAE1CuC,EAAOK,EAAI,CAAC,GAAK,KAGZD,EAAG,CAAC,GAAGA,EAAG,OAAO,EAAG,CAAC,CAC3B,CAED,GAAIjB,GAAQnE,GAAM,CAGhB,IAAKjB,EAAI,EAAG0D,GAAI2C,EAAG,CAAC,EAAG3C,IAAK,GAAIA,IAAK,GAAI1D,IAAI,CAE7CsD,GAAM8C,EAAGrC,GAAMqC,EAAE,EAAIpG,EAAIgD,EAAI9B,EAAW,GAAK,EAAG8D,EAAIiB,CAAI,CAGhE,MACQG,EAAE,EAAIpD,EACNoD,EAAE,EAAI,CAACH,EAGT,OAAOG,CACb,CACA,IAYE,SAASY,EAAOvD,EAAGzD,EAAGgF,EAAIzE,EAAI,CAC5B,IAAI0G,EAAIjE,EAAGkE,EAAIhE,EAAKC,EAKpB,GAHI6B,GAAM,KAAMA,EAAKhD,EAChBqB,EAAS2B,EAAI,EAAG,CAAC,EAElB,CAACvB,EAAE,EAAG,OAAOA,EAAE,SAAQ,EAK3B,GAHAwD,EAAKxD,EAAE,EAAE,CAAC,EACVyD,EAAKzD,EAAE,EAEHzD,GAAK,KACPmD,EAAM+B,GAAczB,EAAE,CAAC,EACvBN,EAAM5C,GAAM,GAAKA,GAAM,IAAM2G,GAAMjF,GAAciF,GAAMhF,GACpDiF,GAAchE,EAAK+D,CAAE,EACrBjC,GAAa9B,EAAK+D,EAAI,GAAG,UAE5BzD,EAAIH,GAAM,IAAIzB,EAAU4B,CAAC,EAAGzD,EAAGgF,CAAE,EAGjChC,EAAIS,EAAE,EAENN,EAAM+B,GAAczB,EAAE,CAAC,EACvBP,EAAMC,EAAI,OAON5C,GAAM,GAAKA,GAAM,IAAMP,GAAKgD,GAAKA,GAAKf,GAAa,CAGrD,KAAOiB,EAAMlD,EAAGmD,GAAO,IAAKD,IAAM,CAClCC,EAAMgE,GAAchE,EAAKH,CAAC,CAGlC,SACQhD,GAAKkH,EACL/D,EAAM8B,GAAa9B,EAAKH,EAAG,GAAG,EAG1BA,EAAI,EAAIE,GACV,GAAI,EAAElD,EAAI,EAAG,IAAKmD,GAAO,IAAKnD,IAAKmD,GAAO,IAAI,UAE9CnD,GAAKgD,EAAIE,EACLlD,EAAI,EAEN,IADIgD,EAAI,GAAKE,IAAKC,GAAO,KAClBnD,IAAKmD,GAAO,IAAI,CAM/B,OAAOM,EAAE,EAAI,GAAKwD,EAAK,IAAM9D,EAAMA,CACpC,CAKD,SAASS,EAASM,EAAMT,EAAG,CAKzB,QAJI5E,EAAGkG,EACL/E,EAAI,EACJoD,EAAI,IAAIvB,EAAUqC,EAAK,CAAC,CAAC,EAEpBlE,EAAIkE,EAAK,OAAQlE,IACtB+E,EAAI,IAAIlD,EAAUqC,EAAKlE,CAAC,CAAC,GACrB,CAAC+E,EAAE,IAAMlG,EAAI+G,GAAQxC,EAAG2B,CAAC,KAAOtB,GAAK5E,IAAM,GAAKuE,EAAE,IAAMK,KAC1DL,EAAI2B,GAIR,OAAO3B,CACR,CAOD,SAASgE,EAAU3D,EAAGX,EAAGE,EAAG,CAK1B,QAJIhD,EAAI,EACN5B,EAAI0E,EAAE,OAGD,CAACA,EAAE,EAAE1E,CAAC,EAAG0E,EAAE,IAAG,EAAG,CAGxB,IAAK1E,EAAI0E,EAAE,CAAC,EAAG1E,GAAK,GAAIA,GAAK,GAAI4B,IAAI,CAGrC,OAAKgD,EAAIhD,EAAIgD,EAAI9B,EAAW,GAAKkB,EAG/BqB,EAAE,EAAIA,EAAE,EAAI,KAGHT,EAAIb,EAGbsB,EAAE,EAAI,CAACA,EAAE,EAAI,CAAC,GAEdA,EAAE,EAAIT,EACNS,EAAE,EAAIX,GAGDW,CACR,CAID9B,EAAgB,UAAY,CAC1B,IAAI0F,EAAa,8BACfC,EAAW,cACXC,EAAY,cACZC,EAAkB,qBAClBC,EAAmB,6BAErB,OAAO,SAAUrE,EAAGD,EAAKF,EAAOL,EAAG,CACjC,IAAIwC,EACF1B,EAAIT,EAAQE,EAAMA,EAAI,QAAQsE,EAAkB,EAAE,EAGpD,GAAID,EAAgB,KAAK9D,CAAC,EACxBN,EAAE,EAAI,MAAMM,CAAC,EAAI,KAAOA,EAAI,EAAI,GAAK,MAChC,CACL,GAAI,CAACT,IAGHS,EAAIA,EAAE,QAAQ2D,EAAY,SAAUhC,EAAGqC,EAAIC,EAAI,CAC7C,OAAAvC,GAAQuC,EAAKA,EAAG,YAAa,IAAK,IAAM,GAAKA,GAAM,IAAM,EAAI,EACtD,CAAC/E,GAAKA,GAAKwC,EAAOsC,EAAKrC,CAC1C,CAAW,EAEGzC,IACFwC,EAAOxC,EAGPc,EAAIA,EAAE,QAAQ4D,EAAU,IAAI,EAAE,QAAQC,EAAW,MAAM,GAGrDpE,GAAOO,GAAG,OAAO,IAAI7B,EAAU6B,EAAG0B,CAAI,EAK5C,GAAIvD,EAAU,MACZ,MAAM,MACHd,EAAiB,SAAW6B,EAAI,SAAWA,EAAI,IAAM,YAAcO,CAAG,EAI3EC,EAAE,EAAI,IACP,CAEDA,EAAE,EAAIA,EAAE,EAAI,IACb,CACL,IAOE,SAASE,GAAMF,EAAGwE,EAAI5C,EAAIH,EAAG,CAC3B,IAAID,EAAG5E,EAAG5B,EAAGS,EAAG4E,EAAGoE,EAAIC,EACrBhD,EAAK1B,EAAE,EACP2E,EAAS3G,GAGX,GAAI0D,EAAI,CAQNnB,EAAK,CAGH,IAAKiB,EAAI,EAAG/F,EAAIiG,EAAG,CAAC,EAAGjG,GAAK,GAAIA,GAAK,GAAI+F,IAAI,CAI7C,GAHA5E,EAAI4H,EAAKhD,EAGL5E,EAAI,EACNA,GAAKkB,EACL9C,EAAIwJ,EACJnE,EAAIqB,EAAG+C,EAAK,CAAC,EAGbC,EAAKhH,EAAU2C,EAAIsE,EAAOnD,EAAIxG,EAAI,CAAC,EAAI,EAAE,UAEzCyJ,EAAKhH,IAAUb,EAAI,GAAKkB,CAAQ,EAE5B2G,GAAM/C,EAAG,OAEX,GAAID,EAAG,CAGL,KAAOC,EAAG,QAAU+C,EAAI/C,EAAG,KAAK,CAAC,EAAE,CACnCrB,EAAIqE,EAAK,EACTlD,EAAI,EACJ5E,GAAKkB,EACL9C,EAAI4B,EAAIkB,EAAW,CACjC,KACc,OAAMyC,MAEH,CAIL,IAHAF,EAAI5E,EAAIiG,EAAG+C,CAAE,EAGRjD,EAAI,EAAG/F,GAAK,GAAIA,GAAK,GAAI+F,IAAI,CAGlC5E,GAAKkB,EAIL9C,EAAI4B,EAAIkB,EAAW0D,EAGnBkD,EAAK1J,EAAI,EAAI,EAAI0C,EAAU2C,EAAIsE,EAAOnD,EAAIxG,EAAI,CAAC,EAAI,EAAE,CACtD,CAkBH,GAfAyG,EAAIA,GAAK+C,EAAK,GAKb9C,EAAG+C,EAAK,CAAC,GAAK,OAASzJ,EAAI,EAAIqF,EAAIA,EAAIsE,EAAOnD,EAAIxG,EAAI,CAAC,GAExDyG,EAAIG,EAAK,GACL8C,GAAMjD,KAAOG,GAAM,GAAKA,IAAO5B,EAAE,EAAI,EAAI,EAAI,IAC9C0E,EAAK,GAAKA,GAAM,IAAM9C,GAAM,GAAKH,GAAKG,GAAM,IAG3ChF,EAAI,EAAI5B,EAAI,EAAIqF,EAAIsE,EAAOnD,EAAIxG,CAAC,EAAI,EAAI0G,EAAG+C,EAAK,CAAC,GAAK,GAAM,GAC7D7C,IAAO5B,EAAE,EAAI,EAAI,EAAI,IAEpBwE,EAAK,GAAK,CAAC9C,EAAG,CAAC,EACjB,OAAAA,EAAG,OAAS,EAERD,GAGF+C,GAAMxE,EAAE,EAAI,EAGZ0B,EAAG,CAAC,EAAIiD,GAAQ7G,EAAW0G,EAAK1G,GAAYA,CAAQ,EACpDkC,EAAE,EAAI,CAACwE,GAAM,GAIb9C,EAAG,CAAC,EAAI1B,EAAE,EAAI,EAGTA,EAkBT,GAdIpD,GAAK,GACP8E,EAAG,OAAS+C,EACZhJ,EAAI,EACJgJ,MAEA/C,EAAG,OAAS+C,EAAK,EACjBhJ,EAAIkJ,EAAO7G,EAAWlB,CAAC,EAIvB8E,EAAG+C,CAAE,EAAIzJ,EAAI,EAAI0C,EAAU2C,EAAIsE,EAAOnD,EAAIxG,CAAC,EAAI2J,EAAO3J,CAAC,CAAC,EAAIS,EAAI,GAI9DgG,EAEF,OAGE,GAAIgD,GAAM,EAAG,CAGX,IAAK7H,EAAI,EAAG5B,EAAI0G,EAAG,CAAC,EAAG1G,GAAK,GAAIA,GAAK,GAAI4B,IAAI,CAE7C,IADA5B,EAAI0G,EAAG,CAAC,GAAKjG,EACRA,EAAI,EAAGT,GAAK,GAAIA,GAAK,GAAIS,IAAI,CAG9BmB,GAAKnB,IACPuE,EAAE,IACE0B,EAAG,CAAC,GAAK7D,KAAM6D,EAAG,CAAC,EAAI,IAG7B,KACd,KAAmB,CAEL,GADAA,EAAG+C,CAAE,GAAKhJ,EACNiG,EAAG+C,CAAE,GAAK5G,GAAM,MACpB6D,EAAG+C,GAAI,EAAI,EACXhJ,EAAI,CACL,CAKL,IAAKmB,EAAI8E,EAAG,OAAQA,EAAG,EAAE9E,CAAC,IAAM,EAAG8E,EAAG,IAAG,EAAG,CAC7C,CAGG1B,EAAE,EAAIhB,EACRgB,EAAE,EAAIA,EAAE,EAAI,KAGHA,EAAE,EAAIjB,IACfiB,EAAE,EAAI,CAACA,EAAE,EAAI,CAAC,EAEjB,CAED,OAAOA,CACR,CAGD,SAAS4E,GAAQvE,EAAG,CAClB,IAAIN,EACFH,EAAIS,EAAE,EAER,OAAIT,IAAM,KAAaS,EAAE,SAAQ,GAEjCN,EAAM+B,GAAczB,EAAE,CAAC,EAEvBN,EAAMH,GAAKf,GAAce,GAAKd,EAC1BiF,GAAchE,EAAKH,CAAC,EACpBiC,GAAa9B,EAAKH,EAAG,GAAG,EAErBS,EAAE,EAAI,EAAI,IAAMN,EAAMA,EAC9B,CASD,OAAAvB,EAAE,cAAgBA,EAAE,IAAM,UAAY,CACpC,IAAIwB,EAAI,IAAIvB,EAAU,IAAI,EAC1B,OAAIuB,EAAE,EAAI,IAAGA,EAAE,EAAI,GACZA,CACX,EAUExB,EAAE,WAAa,SAAUmD,EAAGnC,EAAG,CAC7B,OAAOgD,GAAQ,KAAM,IAAI/D,EAAUkD,EAAGnC,CAAC,CAAC,CAC5C,EAgBEhB,EAAE,cAAgBA,EAAE,GAAK,SAAUmC,EAAIiB,EAAI,CACzC,IAAIlC,EAAGW,EAAGd,EACRS,EAAI,KAEN,GAAIW,GAAM,KACR,OAAAV,EAASU,EAAI,EAAGzC,CAAG,EACf0D,GAAM,KAAMA,EAAKhD,EAChBqB,EAAS2B,EAAI,EAAG,CAAC,EAEf1B,GAAM,IAAIzB,EAAUuB,CAAC,EAAGW,EAAKX,EAAE,EAAI,EAAG4B,CAAE,EAGjD,GAAI,EAAElC,EAAIM,EAAE,GAAI,OAAO,KAIvB,GAHAK,IAAMd,EAAIG,EAAE,OAAS,GAAKiE,EAAS,KAAK,EAAI7F,CAAQ,GAAKA,EAGrDyB,EAAIG,EAAEH,CAAC,EAAG,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIc,IAAI,CAC/C,OAAIA,EAAI,IAAGA,EAAI,GAERA,CACX,EAuBE7B,EAAE,UAAYA,EAAE,IAAM,SAAUmD,EAAGnC,EAAG,CACpC,OAAOnB,EAAI,KAAM,IAAII,EAAUkD,EAAGnC,CAAC,EAAGb,EAAgBC,CAAa,CACvE,EAOEJ,EAAE,mBAAqBA,EAAE,KAAO,SAAUmD,EAAGnC,EAAG,CAC9C,OAAOnB,EAAI,KAAM,IAAII,EAAUkD,EAAGnC,CAAC,EAAG,EAAG,CAAC,CAC9C,EAkBEhB,EAAE,gBAAkBA,EAAE,IAAM,SAAU6B,EAAG4B,EAAG,CAC1C,IAAI4C,EAAMC,EAAUlI,EAAGnB,EAAGoH,EAAMkC,EAAQC,EAAQC,EAAQ,EACtDjF,EAAI,KAKN,GAHAK,EAAI,IAAI5B,EAAU4B,CAAC,EAGfA,EAAE,GAAK,CAACA,EAAE,UAAS,EACrB,MAAM,MACH1C,EAAiB,4BAA8BiH,GAAQvE,CAAC,CAAC,EAS9D,GANI4B,GAAK,OAAMA,EAAI,IAAIxD,EAAUwD,CAAC,GAGlC8C,EAAS1E,EAAE,EAAI,GAGX,CAACL,EAAE,GAAK,CAACA,EAAE,EAAE,CAAC,GAAKA,EAAE,EAAE,CAAC,GAAK,GAAK,CAACA,EAAE,GAAKA,EAAE,EAAE,QAAU,GAAK,CAACK,EAAE,GAAK,CAACA,EAAE,EAAE,CAAC,EAI7E,SAAI,IAAI5B,EAAU,KAAK,IAAI,CAACmG,GAAQ5E,CAAC,EAAG+E,EAAS1E,EAAE,GAAK,EAAI6E,GAAM7E,CAAC,GAAK,CAACuE,GAAQvE,CAAC,CAAC,CAAC,EAC7E4B,EAAI,EAAE,IAAIA,CAAC,EAAI,EAKxB,GAFA+C,EAAS3E,EAAE,EAAI,EAEX4B,EAAG,CAGL,GAAIA,EAAE,EAAI,CAACA,EAAE,EAAE,CAAC,EAAI,CAACA,EAAE,EAAG,OAAO,IAAIxD,EAAU,GAAG,EAElDqG,EAAW,CAACE,GAAUhF,EAAE,UAAS,GAAMiC,EAAE,YAErC6C,IAAU9E,EAAIA,EAAE,IAAIiC,CAAC,EAI1B,KAAM,IAAI5B,EAAE,EAAI,IAAML,EAAE,EAAI,GAAKA,EAAE,EAAI,KAAOA,EAAE,GAAK,EAElDA,EAAE,EAAE,CAAC,EAAI,GAAK+E,GAAU/E,EAAE,EAAE,CAAC,GAAK,KAElCA,EAAE,EAAE,CAAC,EAAI,MAAQ+E,GAAU/E,EAAE,EAAE,CAAC,GAAK,YAGvC,OAAAvE,EAAIuE,EAAE,EAAI,GAAKkF,GAAM7E,CAAC,EAAI,GAAK,EAG3BL,EAAE,EAAI,KAAIvE,EAAI,EAAIA,GAGf,IAAIgD,EAAUuG,EAAS,EAAIvJ,EAAIA,CAAC,EAE9B0D,IAKT1D,EAAIgC,GAAS0B,EAAgBrB,EAAW,CAAC,GAe3C,IAZIiH,GACFF,EAAO,IAAIpG,EAAU,EAAG,EACpBuG,IAAQ3E,EAAE,EAAI,GAClB4E,EAASC,GAAM7E,CAAC,IAEhBzD,EAAI,KAAK,IAAI,CAACgI,GAAQvE,CAAC,CAAC,EACxB4E,EAASrI,EAAI,GAGf,EAAI,IAAI6B,EAAUC,CAAG,IAGX,CAER,GAAIuG,EAAQ,CAEV,GADA,EAAI,EAAE,MAAMjF,CAAC,EACT,CAAC,EAAE,EAAG,MAENvE,EACE,EAAE,EAAE,OAASA,IAAG,EAAE,EAAE,OAASA,GACxBqJ,IACT,EAAI,EAAE,IAAI7C,CAAC,EAEd,CAED,GAAIrF,EAAG,CAEL,GADAA,EAAIc,EAAUd,EAAI,CAAC,EACfA,IAAM,EAAG,MACbqI,EAASrI,EAAI,CACrB,SACQyD,EAAIA,EAAE,MAAMwE,CAAI,EAChB3E,GAAMG,EAAGA,EAAE,EAAI,EAAG,CAAC,EAEfA,EAAE,EAAI,GACR4E,EAASC,GAAM7E,CAAC,MACX,CAEL,GADAzD,EAAI,CAACgI,GAAQvE,CAAC,EACVzD,IAAM,EAAG,MACbqI,EAASrI,EAAI,CACd,CAGHoD,EAAIA,EAAE,MAAMA,CAAC,EAETvE,EACEuE,EAAE,GAAKA,EAAE,EAAE,OAASvE,IAAGuE,EAAE,EAAE,OAASvE,GAC/BqJ,IACT9E,EAAIA,EAAE,IAAIiC,CAAC,EAEd,CAED,OAAI6C,EAAiB,GACjBE,IAAQ,EAAItG,EAAI,IAAI,CAAC,GAElBuD,EAAI,EAAE,IAAIA,CAAC,EAAIxG,EAAIyE,GAAM,EAAGf,EAAeP,EAAeiE,CAAI,EAAI,EAC7E,EAWErE,EAAE,aAAe,SAAUoD,EAAI,CAC7B,IAAIvB,EAAI,IAAI5B,EAAU,IAAI,EAC1B,OAAImD,GAAM,KAAMA,EAAKhD,EAChBqB,EAAS2B,EAAI,EAAG,CAAC,EACf1B,GAAMG,EAAGA,EAAE,EAAI,EAAGuB,CAAE,CAC/B,EAOEpD,EAAE,UAAYA,EAAE,GAAK,SAAUmD,EAAGnC,EAAG,CACnC,OAAOgD,GAAQ,KAAM,IAAI/D,EAAUkD,EAAGnC,CAAC,CAAC,IAAM,CAClD,EAMEhB,EAAE,SAAW,UAAY,CACvB,MAAO,CAAC,CAAC,KAAK,CAClB,EAOEA,EAAE,cAAgBA,EAAE,GAAK,SAAUmD,EAAGnC,EAAG,CACvC,OAAOgD,GAAQ,KAAM,IAAI/D,EAAUkD,EAAGnC,CAAC,CAAC,EAAI,CAChD,EAOEhB,EAAE,uBAAyBA,EAAE,IAAM,SAAUmD,EAAGnC,EAAG,CACjD,OAAQA,EAAIgD,GAAQ,KAAM,IAAI/D,EAAUkD,EAAGnC,CAAC,CAAC,KAAO,GAAKA,IAAM,CAEnE,EAMEhB,EAAE,UAAY,UAAY,CACxB,MAAO,CAAC,CAAC,KAAK,GAAKmF,EAAS,KAAK,EAAI7F,CAAQ,EAAI,KAAK,EAAE,OAAS,CACrE,EAOEU,EAAE,WAAaA,EAAE,GAAK,SAAUmD,EAAGnC,EAAG,CACpC,OAAOgD,GAAQ,KAAM,IAAI/D,EAAUkD,EAAGnC,CAAC,CAAC,EAAI,CAChD,EAOEhB,EAAE,oBAAsBA,EAAE,IAAM,SAAUmD,EAAGnC,EAAG,CAC9C,OAAQA,EAAIgD,GAAQ,KAAM,IAAI/D,EAAUkD,EAAGnC,CAAC,CAAC,KAAO,IAAMA,IAAM,CACpE,EAMEhB,EAAE,MAAQ,UAAY,CACpB,MAAO,CAAC,KAAK,CACjB,EAMEA,EAAE,WAAa,UAAY,CACzB,OAAO,KAAK,EAAI,CACpB,EAMEA,EAAE,WAAa,UAAY,CACzB,OAAO,KAAK,EAAI,CACpB,EAMEA,EAAE,OAAS,UAAY,CACrB,MAAO,CAAC,CAAC,KAAK,GAAK,KAAK,EAAE,CAAC,GAAK,CACpC,EAuBEA,EAAE,MAAQ,SAAUmD,EAAGnC,EAAG,CACxB,IAAI5C,EAAG5B,EAAGmK,EAAGC,EACXpF,EAAI,KACJY,EAAIZ,EAAE,EAMR,GAJA2B,EAAI,IAAIlD,EAAUkD,EAAGnC,CAAC,EACtBA,EAAImC,EAAE,EAGF,CAACf,GAAK,CAACpB,EAAG,OAAO,IAAIf,EAAU,GAAG,EAGtC,GAAImC,GAAKpB,EACP,OAAAmC,EAAE,EAAI,CAACnC,EACAQ,EAAE,KAAK2B,CAAC,EAGjB,IAAI0D,EAAKrF,EAAE,EAAIlC,EACbwH,EAAK3D,EAAE,EAAI7D,EACX4D,EAAK1B,EAAE,EACP0D,EAAK/B,EAAE,EAET,GAAI,CAAC0D,GAAM,CAACC,EAAI,CAGd,GAAI,CAAC5D,GAAM,CAACgC,EAAI,OAAOhC,GAAMC,EAAE,EAAI,CAACnC,EAAGmC,GAAK,IAAIlD,EAAUiF,EAAK1D,EAAI,GAAG,EAGtE,GAAI,CAAC0B,EAAG,CAAC,GAAK,CAACgC,EAAG,CAAC,EAGjB,OAAOA,EAAG,CAAC,GAAK/B,EAAE,EAAI,CAACnC,EAAGmC,GAAK,IAAIlD,EAAUiD,EAAG,CAAC,EAAI1B,EAGpDpB,GAAiB,EAAI,GAAK,CAAC,CAE/B,CAOD,GALAyG,EAAK1B,EAAS0B,CAAE,EAChBC,EAAK3B,EAAS2B,CAAE,EAChB5D,EAAKA,EAAG,QAGJd,EAAIyE,EAAKC,EAAI,CAaf,KAXIF,EAAOxE,EAAI,IACbA,EAAI,CAACA,EACLuE,EAAIzD,IAEJ4D,EAAKD,EACLF,EAAIzB,GAGNyB,EAAE,QAAO,EAGJ3F,EAAIoB,EAAGpB,IAAK2F,EAAE,KAAK,CAAC,EAAE,CAC3BA,EAAE,QAAO,CACf,KAKM,KAFAnK,GAAKoK,GAAQxE,EAAIc,EAAG,SAAWlC,EAAIkE,EAAG,SAAW9C,EAAIpB,EAEhDoB,EAAIpB,EAAI,EAAGA,EAAIxE,EAAGwE,IAErB,GAAIkC,EAAGlC,CAAC,GAAKkE,EAAGlE,CAAC,EAAG,CAClB4F,EAAO1D,EAAGlC,CAAC,EAAIkE,EAAGlE,CAAC,EACnB,KACD,CAgBL,GAXI4F,IACFD,EAAIzD,EACJA,EAAKgC,EACLA,EAAKyB,EACLxD,EAAE,EAAI,CAACA,EAAE,GAGXnC,GAAKxE,EAAI0I,EAAG,SAAW9G,EAAI8E,EAAG,QAI1BlC,EAAI,EAAG,KAAOA,IAAKkC,EAAG9E,GAAG,EAAI,EAAE,CAInC,IAHA4C,EAAI3B,GAAO,EAGJ7C,EAAI4F,GAAI,CAEb,GAAIc,EAAG,EAAE1G,CAAC,EAAI0I,EAAG1I,CAAC,EAAG,CACnB,IAAK4B,EAAI5B,EAAG4B,GAAK,CAAC8E,EAAG,EAAE9E,CAAC,EAAG8E,EAAG9E,CAAC,EAAI4C,EAAE,CACrC,EAAEkC,EAAG9E,CAAC,EACN8E,EAAG1G,CAAC,GAAK6C,EACV,CAED6D,EAAG1G,CAAC,GAAK0I,EAAG1I,CAAC,CACd,CAGD,KAAO0G,EAAG,CAAC,GAAK,EAAGA,EAAG,OAAO,EAAG,CAAC,EAAG,EAAE4D,EAAG,CAGzC,OAAK5D,EAAG,CAAC,EAWFsC,EAAUrC,EAAGD,EAAI4D,CAAE,GAPxB3D,EAAE,EAAI/C,GAAiB,EAAI,GAAK,EAChC+C,EAAE,EAAI,CAACA,EAAE,EAAI,CAAC,EACPA,EAMb,EAwBEnD,EAAE,OAASA,EAAE,IAAM,SAAUmD,EAAGnC,EAAG,CACjC,IAAIwD,EAAG1C,EACLN,EAAI,KAKN,OAHA2B,EAAI,IAAIlD,EAAUkD,EAAGnC,CAAC,EAGlB,CAACQ,EAAE,GAAK,CAAC2B,EAAE,GAAKA,EAAE,GAAK,CAACA,EAAE,EAAE,CAAC,EACxB,IAAIlD,EAAU,GAAG,EAGf,CAACkD,EAAE,GAAK3B,EAAE,GAAK,CAACA,EAAE,EAAE,CAAC,EACvB,IAAIvB,EAAUuB,CAAC,GAGpBd,GAAe,GAIjBoB,EAAIqB,EAAE,EACNA,EAAE,EAAI,EACNqB,EAAI3E,EAAI2B,EAAG2B,EAAG,EAAG,CAAC,EAClBA,EAAE,EAAIrB,EACN0C,EAAE,GAAK1C,GAEP0C,EAAI3E,EAAI2B,EAAG2B,EAAG,EAAGzC,CAAW,EAG9ByC,EAAI3B,EAAE,MAAMgD,EAAE,MAAMrB,CAAC,CAAC,EAGlB,CAACA,EAAE,EAAE,CAAC,GAAKzC,GAAe,IAAGyC,EAAE,EAAI3B,EAAE,GAElC2B,EACX,EAuBEnD,EAAE,aAAeA,EAAE,MAAQ,SAAUmD,EAAGnC,EAAG,CACzC,IAAIE,EAAGE,EAAGhD,EAAG5B,EAAGS,EAAGwG,EAAGsD,EAAKpD,EAAKC,EAAKoD,EAAKC,EAAKC,EAAKC,EAClD3D,EAAM4D,EACN5F,EAAI,KACJ0B,EAAK1B,EAAE,EACP0D,GAAM/B,EAAI,IAAIlD,EAAUkD,EAAGnC,CAAC,GAAG,EAGjC,GAAI,CAACkC,GAAM,CAACgC,GAAM,CAAChC,EAAG,CAAC,GAAK,CAACgC,EAAG,CAAC,EAG/B,MAAI,CAAC1D,EAAE,GAAK,CAAC2B,EAAE,GAAKD,GAAM,CAACA,EAAG,CAAC,GAAK,CAACgC,GAAMA,GAAM,CAACA,EAAG,CAAC,GAAK,CAAChC,EAC1DC,EAAE,EAAIA,EAAE,EAAIA,EAAE,EAAI,MAElBA,EAAE,GAAK3B,EAAE,EAGL,CAAC0B,GAAM,CAACgC,EACV/B,EAAE,EAAIA,EAAE,EAAI,MAIZA,EAAE,EAAI,CAAC,CAAC,EACRA,EAAE,EAAI,IAIHA,EAmBT,IAhBA/B,EAAI+D,EAAS3D,EAAE,EAAIlC,CAAQ,EAAI6F,EAAShC,EAAE,EAAI7D,CAAQ,EACtD6D,EAAE,GAAK3B,EAAE,EACTuF,EAAM7D,EAAG,OACT8D,EAAM9B,EAAG,OAGL6B,EAAMC,IACRG,EAAKjE,EACLA,EAAKgC,EACLA,EAAKiC,EACL/I,EAAI2I,EACJA,EAAMC,EACNA,EAAM5I,GAIHA,EAAI2I,EAAMC,EAAKG,EAAK,CAAA,EAAI/I,IAAK+I,EAAG,KAAK,CAAC,EAAE,CAK7C,IAHA3D,EAAOnE,GACP+H,EAAW3H,GAENrB,EAAI4I,EAAK,EAAE5I,GAAK,GAAI,CAKvB,IAJA8C,EAAI,EACJ+F,EAAM/B,EAAG9G,CAAC,EAAIgJ,EACdF,EAAMhC,EAAG9G,CAAC,EAAIgJ,EAAW,EAEpBnK,EAAI8J,EAAKvK,EAAI4B,EAAInB,EAAGT,EAAI4B,GAC3BuF,EAAMT,EAAG,EAAEjG,CAAC,EAAImK,EAChBxD,EAAMV,EAAGjG,CAAC,EAAImK,EAAW,EACzB3D,EAAIyD,EAAMvD,EAAMC,EAAMqD,EACtBtD,EAAMsD,EAAMtD,EAAQF,EAAI2D,EAAYA,EAAYD,EAAG3K,CAAC,EAAI0E,EACxDA,GAAKyC,EAAMH,EAAO,IAAMC,EAAI2D,EAAW,GAAKF,EAAMtD,EAClDuD,EAAG3K,GAAG,EAAImH,EAAMH,EAGlB2D,EAAG3K,CAAC,EAAI0E,CACT,CAED,OAAIA,EACF,EAAEE,EAEF+F,EAAG,OAAO,EAAG,CAAC,EAGT3B,EAAUrC,EAAGgE,EAAI/F,CAAC,CAC7B,EAOEpB,EAAE,QAAU,UAAY,CACtB,IAAIwB,EAAI,IAAIvB,EAAU,IAAI,EAC1B,OAAAuB,EAAE,EAAI,CAACA,EAAE,GAAK,KACPA,CACX,EAuBExB,EAAE,KAAO,SAAUmD,EAAGnC,EAAG,CACvB,IAAI2F,EACFnF,EAAI,KACJY,EAAIZ,EAAE,EAMR,GAJA2B,EAAI,IAAIlD,EAAUkD,EAAGnC,CAAC,EACtBA,EAAImC,EAAE,EAGF,CAACf,GAAK,CAACpB,EAAG,OAAO,IAAIf,EAAU,GAAG,EAGrC,GAAImC,GAAKpB,EACR,OAAAmC,EAAE,EAAI,CAACnC,EACAQ,EAAE,MAAM2B,CAAC,EAGlB,IAAI0D,EAAKrF,EAAE,EAAIlC,EACbwH,EAAK3D,EAAE,EAAI7D,EACX4D,EAAK1B,EAAE,EACP0D,EAAK/B,EAAE,EAET,GAAI,CAAC0D,GAAM,CAACC,EAAI,CAGd,GAAI,CAAC5D,GAAM,CAACgC,EAAI,OAAO,IAAIjF,EAAUmC,EAAI,CAAC,EAI1C,GAAI,CAACc,EAAG,CAAC,GAAK,CAACgC,EAAG,CAAC,EAAG,OAAOA,EAAG,CAAC,EAAI/B,EAAI,IAAIlD,EAAUiD,EAAG,CAAC,EAAI1B,EAAIY,EAAI,CAAC,CACzE,CAOD,GALAyE,EAAK1B,EAAS0B,CAAE,EAChBC,EAAK3B,EAAS2B,CAAE,EAChB5D,EAAKA,EAAG,QAGJd,EAAIyE,EAAKC,EAAI,CAUf,IATI1E,EAAI,GACN0E,EAAKD,EACLF,EAAIzB,IAEJ9C,EAAI,CAACA,EACLuE,EAAIzD,GAGNyD,EAAE,QAAO,EACFvE,IAAKuE,EAAE,KAAK,CAAC,EAAE,CACtBA,EAAE,QAAO,CACV,CAcD,IAZAvE,EAAIc,EAAG,OACPlC,EAAIkE,EAAG,OAGH9C,EAAIpB,EAAI,IACV2F,EAAIzB,EACJA,EAAKhC,EACLA,EAAKyD,EACL3F,EAAIoB,GAIDA,EAAI,EAAGpB,GACVoB,GAAKc,EAAG,EAAElC,CAAC,EAAIkC,EAAGlC,CAAC,EAAIkE,EAAGlE,CAAC,EAAIoB,GAAK/C,GAAO,EAC3C6D,EAAGlC,CAAC,EAAI3B,KAAS6D,EAAGlC,CAAC,EAAI,EAAIkC,EAAGlC,CAAC,EAAI3B,GAGvC,OAAI+C,IACFc,EAAK,CAACd,CAAC,EAAE,OAAOc,CAAE,EAClB,EAAE4D,GAKGtB,EAAUrC,EAAGD,EAAI4D,CAAE,CAC9B,EAkBE9G,EAAE,UAAYA,EAAE,GAAK,SAAUgG,EAAI5C,EAAI,CACrC,IAAIlC,EAAGW,EAAGd,EACRS,EAAI,KAEN,GAAIwE,GAAM,MAAQA,IAAO,CAAC,CAACA,EACzB,OAAAvE,EAASuE,EAAI,EAAGtG,CAAG,EACf0D,GAAM,KAAMA,EAAKhD,EAChBqB,EAAS2B,EAAI,EAAG,CAAC,EAEf1B,GAAM,IAAIzB,EAAUuB,CAAC,EAAGwE,EAAI5C,CAAE,EAGvC,GAAI,EAAElC,EAAIM,EAAE,GAAI,OAAO,KAIvB,GAHAT,EAAIG,EAAE,OAAS,EACfW,EAAId,EAAIzB,EAAW,EAEfyB,EAAIG,EAAEH,CAAC,EAAG,CAGZ,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIc,IAAI,CAGjC,IAAKd,EAAIG,EAAE,CAAC,EAAGH,GAAK,GAAIA,GAAK,GAAIc,IAAI,CACtC,CAED,OAAImE,GAAMxE,EAAE,EAAI,EAAIK,IAAGA,EAAIL,EAAE,EAAI,GAE1BK,CACX,EAWE7B,EAAE,UAAY,SAAU/C,EAAG,CACzB,OAAAwE,EAASxE,EAAG,kBAAmBsC,EAAgB,EACxC,KAAK,MAAM,KAAOtC,CAAC,CAC9B,EAcE+C,EAAE,WAAaA,EAAE,KAAO,UAAY,CAClC,IAAIyD,EAAG5B,EAAGoB,EAAGoE,EAAKV,EAChBnF,EAAI,KACJN,EAAIM,EAAE,EACNM,EAAIN,EAAE,EACNJ,EAAII,EAAE,EACNW,EAAKhC,EAAiB,EACtBkG,EAAO,IAAIpG,EAAU,KAAK,EAG5B,GAAI6B,IAAM,GAAK,CAACZ,GAAK,CAACA,EAAE,CAAC,EACvB,OAAO,IAAIjB,EAAU,CAAC6B,GAAKA,EAAI,IAAM,CAACZ,GAAKA,EAAE,CAAC,GAAK,IAAMA,EAAIM,EAAI,GAAK,EA8BxE,GA1BAM,EAAI,KAAK,KAAK,CAACsE,GAAQ5E,CAAC,CAAC,EAIrBM,GAAK,GAAKA,GAAK,KACjBD,EAAIyB,GAAcpC,CAAC,GACdW,EAAE,OAAST,GAAK,GAAK,IAAGS,GAAK,KAClCC,EAAI,KAAK,KAAK,CAACD,CAAC,EAChBT,EAAI+D,GAAU/D,EAAI,GAAK,CAAC,GAAKA,EAAI,GAAKA,EAAI,GAEtCU,GAAK,IACPD,EAAI,KAAOT,GAEXS,EAAIC,EAAE,gBACND,EAAIA,EAAE,MAAM,EAAGA,EAAE,QAAQ,GAAG,EAAI,CAAC,EAAIT,GAGvC6B,EAAI,IAAIhD,EAAU4B,CAAC,GAEnBoB,EAAI,IAAIhD,EAAU6B,EAAI,EAAE,EAOtBmB,EAAE,EAAE,CAAC,GAMP,IALA7B,EAAI6B,EAAE,EACNnB,EAAIV,EAAIe,EACJL,EAAI,IAAGA,EAAI,KAOb,GAHA6E,EAAI1D,EACJA,EAAIoD,EAAK,MAAMM,EAAE,KAAK9G,EAAI2B,EAAGmF,EAAGxE,EAAI,CAAC,CAAC,CAAC,EAEnCmB,GAAcqD,EAAE,CAAC,EAAE,MAAM,EAAG7E,CAAC,KAAOD,EAAIyB,GAAcL,EAAE,CAAC,GAAG,MAAM,EAAGnB,CAAC,EAWxE,GANImB,EAAE,EAAI7B,GAAG,EAAEU,EACfD,EAAIA,EAAE,MAAMC,EAAI,EAAGA,EAAI,CAAC,EAKpBD,GAAK,QAAU,CAACwF,GAAOxF,GAAK,OAAQ,CAItC,GAAI,CAACwF,IACH3F,GAAMiF,EAAGA,EAAE,EAAIxG,EAAiB,EAAG,CAAC,EAEhCwG,EAAE,MAAMA,CAAC,EAAE,GAAGnF,CAAC,GAAG,CACpByB,EAAI0D,EACJ,KACD,CAGHxE,GAAM,EACNL,GAAK,EACLuF,EAAM,CAClB,KAAiB,EAID,CAAC,CAACxF,GAAK,CAAC,CAACA,EAAE,MAAM,CAAC,GAAKA,EAAE,OAAO,CAAC,GAAK,OAGxCH,GAAMuB,EAAGA,EAAE,EAAI9C,EAAiB,EAAG,CAAC,EACpCsD,EAAI,CAACR,EAAE,MAAMA,CAAC,EAAE,GAAGzB,CAAC,GAGtB,KACD,EAKP,OAAOE,GAAMuB,EAAGA,EAAE,EAAI9C,EAAiB,EAAGC,EAAeqD,CAAC,CAC9D,EAYEzD,EAAE,cAAgB,SAAUmC,EAAIiB,EAAI,CAClC,OAAIjB,GAAM,OACRV,EAASU,EAAI,EAAGzC,CAAG,EACnByC,KAEKiD,EAAO,KAAMjD,EAAIiB,EAAI,CAAC,CACjC,EAeEpD,EAAE,QAAU,SAAUmC,EAAIiB,EAAI,CAC5B,OAAIjB,GAAM,OACRV,EAASU,EAAI,EAAGzC,CAAG,EACnByC,EAAKA,EAAK,KAAK,EAAI,GAEdiD,EAAO,KAAMjD,EAAIiB,CAAE,CAC9B,EA4BEpD,EAAE,SAAW,SAAUmC,EAAIiB,EAAIgC,EAAQ,CACrC,IAAI7D,EACFC,EAAI,KAEN,GAAI4D,GAAU,KACRjD,GAAM,MAAQiB,GAAM,OAAOA,GAAM,UACnCgC,EAAShC,EACTA,EAAK,MACIjB,GAAM,OAAOA,GAAM,UAC5BiD,EAASjD,EACTA,EAAKiB,EAAK,MAEVgC,EAASxE,UAEF,OAAOwE,GAAU,SAC1B,MAAM,MACHjG,EAAiB,2BAA6BiG,CAAM,EAKzD,GAFA7D,EAAMC,EAAE,QAAQW,EAAIiB,CAAE,EAElB5B,EAAE,EAAG,CACP,IAAIpD,EACFwE,EAAMrB,EAAI,MAAM,GAAG,EACnB+F,EAAK,CAAClC,EAAO,UACbmC,EAAK,CAACnC,EAAO,mBACboC,EAAiBpC,EAAO,gBAAkB,GAC1CqC,EAAU7E,EAAI,CAAC,EACf8E,EAAe9E,EAAI,CAAC,EACpB+E,EAAQnG,EAAE,EAAI,EACdoG,EAAYD,EAAQF,EAAQ,MAAM,CAAC,EAAIA,EACvCnG,EAAMsG,EAAU,OASlB,GAPIL,IACFnJ,EAAIkJ,EACJA,EAAKC,EACLA,EAAKnJ,EACLkD,GAAOlD,GAGLkJ,EAAK,GAAKhG,EAAM,EAAG,CAGrB,IAFAlD,EAAIkD,EAAMgG,GAAMA,EAChBG,EAAUG,EAAU,OAAO,EAAGxJ,CAAC,EACxBA,EAAIkD,EAAKlD,GAAKkJ,EAAIG,GAAWD,EAAiBI,EAAU,OAAOxJ,EAAGkJ,CAAE,EACvEC,EAAK,IAAGE,GAAWD,EAAiBI,EAAU,MAAMxJ,CAAC,GACrDuJ,IAAOF,EAAU,IAAMA,EAC5B,CAEDlG,EAAMmG,EACHD,GAAWrC,EAAO,kBAAoB,MAAQmC,EAAK,CAACnC,EAAO,mBAC1DsC,EAAa,QAAQ,IAAI,OAAO,OAASH,EAAK,OAAQ,GAAG,EAC1D,MAAQnC,EAAO,wBAA0B,GAAG,EAC3CsC,GACDD,CACJ,CAED,OAAQrC,EAAO,QAAU,IAAM7D,GAAO6D,EAAO,QAAU,GAC3D,EAcEpF,EAAE,WAAa,SAAU6H,EAAI,CAC3B,IAAI7E,EAAG8E,EAAIC,EAAIC,EAAI5G,EAAG6G,EAAKpG,EAAGqG,EAAIC,EAAI3D,EAAGvB,EAAGnB,EAC1CN,EAAI,KACJ0B,EAAK1B,EAAE,EAET,GAAIqG,GAAM,OACRhG,EAAI,IAAI5B,EAAU4H,CAAE,EAGhB,CAAChG,EAAE,cAAgBA,EAAE,GAAKA,EAAE,IAAM,IAAMA,EAAE,GAAG3B,CAAG,GAClD,MAAM,MACHf,EAAiB,aACf0C,EAAE,UAAS,EAAK,iBAAmB,oBAAsBuE,GAAQvE,CAAC,CAAC,EAI5E,GAAI,CAACqB,EAAI,OAAO,IAAIjD,EAAUuB,CAAC,EAoB/B,IAlBAwB,EAAI,IAAI/C,EAAUC,CAAG,EACrBiI,EAAKL,EAAK,IAAI7H,EAAUC,CAAG,EAC3B6H,EAAKG,EAAK,IAAIjI,EAAUC,CAAG,EAC3B4B,EAAIwB,GAAcJ,CAAE,EAIpB9B,EAAI4B,EAAE,EAAIlB,EAAE,OAASN,EAAE,EAAI,EAC3BwB,EAAE,EAAE,CAAC,EAAIxD,IAAUyI,EAAM7G,EAAI9B,GAAY,EAAIA,EAAW2I,EAAMA,CAAG,EACjEJ,EAAK,CAACA,GAAMhG,EAAE,WAAWmB,CAAC,EAAI,EAAK5B,EAAI,EAAI4B,EAAImF,EAAMtG,EAErDoG,EAAMzH,EACNA,EAAU,IACVqB,EAAI,IAAI5B,EAAU6B,CAAC,EAGnBoG,EAAG,EAAE,CAAC,EAAI,EAGR1D,EAAI3E,EAAIgC,EAAGmB,EAAG,EAAG,CAAC,EAClBgF,EAAKF,EAAG,KAAKtD,EAAE,MAAMuD,CAAE,CAAC,EACpBC,EAAG,WAAWH,CAAE,GAAK,GACzBC,EAAKC,EACLA,EAAKC,EACLG,EAAKD,EAAG,KAAK1D,EAAE,MAAMwD,EAAKG,CAAE,CAAC,EAC7BD,EAAKF,EACLhF,EAAInB,EAAE,MAAM2C,EAAE,MAAMwD,EAAKhF,CAAC,CAAC,EAC3BnB,EAAImG,EAGN,OAAAA,EAAKnI,EAAIgI,EAAG,MAAMC,CAAE,EAAGC,EAAI,EAAG,CAAC,EAC/BG,EAAKA,EAAG,KAAKF,EAAG,MAAMG,CAAE,CAAC,EACzBL,EAAKA,EAAG,KAAKE,EAAG,MAAMD,CAAE,CAAC,EACzBG,EAAG,EAAIC,EAAG,EAAI3G,EAAE,EAChBJ,EAAIA,EAAI,EAGR6B,EAAIpD,EAAIsI,EAAIJ,EAAI3G,EAAGhB,CAAa,EAAE,MAAMoB,CAAC,EAAE,IAAK,EAAC,WAC7C3B,EAAIqI,EAAIJ,EAAI1G,EAAGhB,CAAa,EAAE,MAAMoB,CAAC,EAAE,IAAG,CAAE,EAAI,EAAI,CAAC2G,EAAIJ,CAAE,EAAI,CAACG,EAAIJ,CAAE,EAE1EtH,EAAUyH,EAEHhF,CACX,EAMEjD,EAAE,SAAW,UAAY,CACvB,MAAO,CAACoG,GAAQ,IAAI,CACxB,EAcEpG,EAAE,YAAc,SAAUgG,EAAI5C,EAAI,CAChC,OAAI4C,GAAM,MAAMvE,EAASuE,EAAI,EAAGtG,CAAG,EAC5B0F,EAAO,KAAMY,EAAI5C,EAAI,CAAC,CACjC,EAcEpD,EAAE,SAAW,SAAUgB,EAAG,CACxB,IAAIO,EACFM,EAAI,KACJC,EAAID,EAAE,EACNT,EAAIS,EAAE,EAGR,OAAIT,IAAM,KACJU,GACFP,EAAM,WACFO,EAAI,IAAGP,EAAM,IAAMA,IAEvBA,EAAM,OAGJP,GAAK,KACPO,EAAMH,GAAKf,GAAce,GAAKd,EAC3BiF,GAAcjC,GAAczB,EAAE,CAAC,EAAGT,CAAC,EACnCiC,GAAaC,GAAczB,EAAE,CAAC,EAAGT,EAAG,GAAG,EACjCJ,IAAM,IAAMF,GACrBe,EAAIH,GAAM,IAAIzB,EAAU4B,CAAC,EAAG1B,EAAiBiB,EAAI,EAAGhB,CAAa,EACjEmB,EAAM8B,GAAaC,GAAczB,EAAE,CAAC,EAAGA,EAAE,EAAG,GAAG,IAE/CJ,EAAST,EAAG,EAAGH,EAAS,OAAQ,MAAM,EACtCU,EAAMzB,EAAYuD,GAAaC,GAAczB,EAAE,CAAC,EAAGT,EAAG,GAAG,EAAG,GAAIJ,EAAGc,EAAG,EAAI,GAGxEA,EAAI,GAAKD,EAAE,EAAE,CAAC,IAAGN,EAAM,IAAMA,IAG5BA,CACX,EAOEvB,EAAE,QAAUA,EAAE,OAAS,UAAY,CACjC,OAAOoG,GAAQ,IAAI,CACvB,EAGEpG,EAAE,aAAe,GAEjBA,EAAE,OAAO,WAAW,EAAI,YAGxBA,EAAE,OAAO,IAAI,4BAA4B,CAAC,EAAIA,EAAE,QAE5CJ,GAAgB,MAAMK,EAAU,IAAIL,CAAY,EAE7CK,CACT,CASA,SAASkF,EAAStD,EAAG,CACnB,IAAIzD,EAAIyD,EAAI,EACZ,OAAOA,EAAI,GAAKA,IAAMzD,EAAIA,EAAIA,EAAI,CACpC,CAIA,SAASkF,GAAclB,EAAG,CAMxB,QALIN,EAAGsG,EACLhK,EAAI,EACJ5B,EAAI4F,EAAE,OACNa,EAAIb,EAAE,CAAC,EAAI,GAENhE,EAAI5B,GAAI,CAGb,IAFAsF,EAAIM,EAAEhE,GAAG,EAAI,GACbgK,EAAI9I,EAAWwC,EAAE,OACVsG,IAAKtG,EAAI,IAAMA,EAAE,CACxBmB,GAAKnB,CACN,CAGD,IAAKtF,EAAIyG,EAAE,OAAQA,EAAE,WAAW,EAAEzG,CAAC,IAAM,IAAI,CAE7C,OAAOyG,EAAE,MAAM,EAAGzG,EAAI,GAAK,CAAC,CAC9B,CAIA,SAASwH,GAAQxC,EAAG2B,EAAG,CACrB,IAAIf,EAAGpB,EACLkC,EAAK1B,EAAE,EACP0D,EAAK/B,EAAE,EACP/E,EAAIoD,EAAE,EACNhF,EAAI2G,EAAE,EACNlG,EAAIuE,EAAE,EACNtE,EAAIiG,EAAE,EAGR,GAAI,CAAC/E,GAAK,CAAC5B,EAAG,OAAO,KAMrB,GAJA4F,EAAIc,GAAM,CAACA,EAAG,CAAC,EACflC,EAAIkE,GAAM,CAACA,EAAG,CAAC,EAGX9C,GAAKpB,EAAG,OAAOoB,EAAIpB,EAAI,EAAI,CAACxE,EAAI4B,EAGpC,GAAIA,GAAK5B,EAAG,OAAO4B,EAMnB,GAJAgE,EAAIhE,EAAI,EACR4C,EAAI/D,GAAKC,EAGL,CAACgG,GAAM,CAACgC,EAAI,OAAOlE,EAAI,EAAI,CAACkC,EAAKd,EAAI,EAAI,GAG7C,GAAI,CAACpB,EAAG,OAAO/D,EAAIC,EAAIkF,EAAI,EAAI,GAK/B,IAHA5F,GAAKS,EAAIiG,EAAG,SAAWhG,EAAIgI,EAAG,QAAUjI,EAAIC,EAGvCkB,EAAI,EAAGA,EAAI5B,EAAG4B,IAAK,GAAI8E,EAAG9E,CAAC,GAAK8G,EAAG9G,CAAC,EAAG,OAAO8E,EAAG9E,CAAC,EAAI8G,EAAG9G,CAAC,EAAIgE,EAAI,EAAI,GAG3E,OAAOnF,GAAKC,EAAI,EAAID,EAAIC,EAAIkF,EAAI,EAAI,EACtC,CAMA,SAASX,EAASI,EAAGwG,EAAKC,EAAKC,EAAM,CACnC,GAAI1G,EAAIwG,GAAOxG,EAAIyG,GAAOzG,IAAM3C,EAAU2C,CAAC,EACzC,MAAM,MACJ1C,GAAkBoJ,GAAQ,aAAe,OAAO1G,GAAK,SAClDA,EAAIwG,GAAOxG,EAAIyG,EAAM,kBAAoB,oBACzC,6BAA+B,OAAOzG,CAAC,CAAC,CAEjD,CAIA,SAAS6E,GAAM7E,EAAG,CAChB,IAAI5E,EAAI4E,EAAE,EAAE,OAAS,EACrB,OAAOsD,EAAStD,EAAE,EAAIvC,CAAQ,GAAKrC,GAAK4E,EAAE,EAAE5E,CAAC,EAAI,GAAK,CACxD,CAGA,SAASsI,GAAchE,EAAKH,EAAG,CAC7B,OAAQG,EAAI,OAAS,EAAIA,EAAI,OAAO,CAAC,EAAI,IAAMA,EAAI,MAAM,CAAC,EAAIA,IAC5DH,EAAI,EAAI,IAAM,MAAQA,CAC1B,CAGA,SAASiC,GAAa9B,EAAKH,EAAGgH,EAAG,CAC/B,IAAI9G,EAAKkH,EAGT,GAAIpH,EAAI,EAAG,CAGT,IAAKoH,EAAKJ,EAAI,IAAK,EAAEhH,EAAGoH,GAAMJ,EAAE,CAChC7G,EAAMiH,EAAKjH,CAGf,SACID,EAAMC,EAAI,OAGN,EAAEH,EAAIE,EAAK,CACb,IAAKkH,EAAKJ,EAAGhH,GAAKE,EAAK,EAAEF,EAAGoH,GAAMJ,EAAE,CACpC7G,GAAOiH,CACb,MAAepH,EAAIE,IACbC,EAAMA,EAAI,MAAM,EAAGH,CAAC,EAAI,IAAMG,EAAI,MAAMH,CAAC,GAI7C,OAAOG,CACT,CAMO,IAAItB,GAAYN,GAAO,ECv1F1B8I,GAAgB,KAAM,CAIxB,YAAYC,EAAK,CAHjBC,EAAA,YACAA,EAAA,YAAO,MACPA,EAAA,aAAQ,MAEN,KAAK,IAAMD,CACf,CACA,EACIE,GAAmB,cAAcH,EAAc,CACjD,YAAYC,EAAK,CACf,MAAMA,CAAG,CACb,CACA,EAcIG,GAAY,KAAM,CAAN,cACdF,EAAA,YAAO,GACPA,EAAA,yBAAoB,GACpBA,EAAA,kBAAa,GACb,MAAMD,EAAK,CACT,MAAMI,EAAO,KAAK,KAClB,GAAIA,GAAQ,KACV,YAAK,QAAQJ,EAAKA,CAAG,EACd,GAET,IAAIK,EAAQ,KACRC,EAAe,KACfC,EAAO,KACPC,EAAc,KACdC,EAAUL,EACd,MAAM9E,EAAU,KAAK,QACrB,IAAIoF,EACJ,OAEE,GADAA,EAAOpF,EAAQmF,EAAQ,IAAKT,CAAG,EAC3BU,EAAO,EAAG,CACZ,IAAIC,EAAcF,EAAQ,KAG1B,GAFIE,GAAe,OACnBD,EAAOpF,EAAQqF,EAAY,IAAKX,CAAG,EAC/BU,EAAO,IACTD,EAAQ,KAAOE,EAAY,MAC3BA,EAAY,MAAQF,EACpBA,EAAUE,EACVA,EAAcF,EAAQ,KAClBE,GAAe,OAAM,MAEvBN,GAAS,KACXC,EAAeG,EAEfJ,EAAM,KAAOI,EAEfJ,EAAQI,EACRA,EAAUE,CAClB,SAAiBD,EAAO,EAAG,CACnB,IAAIE,EAAeH,EAAQ,MAG3B,GAFIG,GAAgB,OACpBF,EAAOpF,EAAQsF,EAAa,IAAKZ,CAAG,EAChCU,EAAO,IACTD,EAAQ,MAAQG,EAAa,KAC7BA,EAAa,KAAOH,EACpBA,EAAUG,EACVA,EAAeH,EAAQ,MACnBG,GAAgB,OAAM,MAExBL,GAAQ,KACVC,EAAcC,EAEdF,EAAK,MAAQE,EAEfF,EAAOE,EACPA,EAAUG,CAClB,KACQ,OAGJ,OAAIL,GAAQ,OACVA,EAAK,MAAQE,EAAQ,KACrBA,EAAQ,KAAOD,GAEbH,GAAS,OACXA,EAAM,KAAOI,EAAQ,MACrBA,EAAQ,MAAQH,GAEd,KAAK,OAASG,IAChB,KAAK,KAAOA,EACZ,KAAK,cAEAC,CACX,CACE,SAASG,EAAM,CACb,IAAIJ,EAAUI,EACVC,EAAWL,EAAQ,KACvB,KAAOK,GAAY,MAAM,CACvB,MAAMP,EAAOO,EACbL,EAAQ,KAAOF,EAAK,MACpBA,EAAK,MAAQE,EACbA,EAAUF,EACVO,EAAWL,EAAQ,IACzB,CACI,OAAOA,CACX,CACE,SAASI,EAAM,CACb,IAAIJ,EAAUI,EACVE,EAAYN,EAAQ,MACxB,KAAOM,GAAa,MAAM,CACxB,MAAMV,EAAQU,EACdN,EAAQ,MAAQJ,EAAM,KACtBA,EAAM,KAAOI,EACbA,EAAUJ,EACVU,EAAYN,EAAQ,KAC1B,CACI,OAAOA,CACX,CACE,QAAQT,EAAK,CAGX,GAFI,KAAK,MAAQ,MACJ,KAAK,MAAMA,CAAG,GACf,EAAG,OAAO,KACtB,IAAII,EAAO,KAAK,KAChB,MAAMjK,EAASiK,EACTG,EAAOH,EAAK,KAElB,GADA,KAAK,OACDG,GAAQ,KACV,KAAK,KAAOH,EAAK,UACZ,CACL,MAAMC,EAAQD,EAAK,MACnBA,EAAO,KAAK,SAASG,CAAI,EACzBH,EAAK,MAAQC,EACb,KAAK,KAAOD,CAClB,CACI,YAAK,oBACEjK,CACX,CACE,WAAW0K,EAAMH,EAAM,CACrB,KAAK,OACL,KAAK,oBACL,MAAMN,EAAO,KAAK,KAClB,GAAIA,GAAQ,KAAM,CAChB,KAAK,KAAOS,EACZ,MACN,CACQH,EAAO,GACTG,EAAK,KAAOT,EACZS,EAAK,MAAQT,EAAK,MAClBA,EAAK,MAAQ,OAEbS,EAAK,MAAQT,EACbS,EAAK,KAAOT,EAAK,KACjBA,EAAK,KAAO,MAEd,KAAK,KAAOS,CAChB,CACE,QAAS,CACP,MAAMT,EAAO,KAAK,KAClB,OAAIA,GAAQ,KAAa,MACzB,KAAK,KAAO,KAAK,SAASA,CAAI,EACvB,KAAK,KAChB,CACE,OAAQ,CACN,MAAMA,EAAO,KAAK,KAClB,OAAIA,GAAQ,KAAa,MACzB,KAAK,KAAO,KAAK,SAASA,CAAI,EACvB,KAAK,KAChB,CACE,OAAQ,CACN,KAAK,KAAO,KACZ,KAAK,KAAO,EACZ,KAAK,mBACT,CACE,IAAIJ,EAAK,CACP,OAAO,KAAK,SAASA,CAAG,GAAK,KAAK,MAAMA,CAAG,GAAK,CACpD,CACE,gBAAiB,CACf,MAAO,CAACtG,EAAGpB,IAAMoB,EAAIpB,EAAI,GAAKoB,EAAIpB,EAAI,EAAI,CAC9C,CACE,MAAO,CACL,MAAO,CACL,QAAS,IACA,KAAK,KAEd,QAAU8H,GAAS,CACjB,KAAK,KAAOA,CACb,EACD,QAAS,IACA,KAAK,KAEd,qBAAsB,IACb,KAAK,kBAEd,cAAe,IACN,KAAK,WAEd,cAAgBY,GAAU,CACxB,KAAK,WAAaA,CACnB,EACD,MAAQhB,GACC,KAAK,MAAMA,CAAG,EAEvB,IAAMA,GACG,KAAK,IAAIA,CAAG,CAEtB,CACL,CACA,EAiLIiB,GAAe,MAAMC,WAAsBf,EAAU,CAIvD,YAAY7E,EAAS6F,EAAY,CAC/B,MAAO,EAJTlB,EAAA,YAAO,MACPA,EAAA,gBACAA,EAAA,iBA4KAA,EAAA,KAACmB,GAAsB,gBAzKrB,KAAK,QAAU9F,GAAW,KAAK,eAAgB,EAC/C,KAAK,SAAW6F,IAAgB9I,GAAMA,GAAK,MAAQA,GAAK,KAC5D,CACE,OAAOgJ,EAAS,CACd,OAAK,KAAK,SAASA,CAAO,EACnB,KAAK,QAAQA,CAAO,GAAK,KADI,EAExC,CACE,UAAUC,EAAU,CAClB,UAAWD,KAAWC,EACpB,KAAK,OAAOD,CAAO,CAEzB,CACE,QAAQE,EAAG,CACT,MAAMC,EAAQ,KAAK,OAAO,QAAQ,EAAG,EACrC,IAAIrL,EACJ,KAAOA,EAASqL,EAAM,KAAM,EAAE,CAACrL,EAAO,MACpCoL,EAAEpL,EAAO,MAAOA,EAAO,MAAO,IAAI,CAExC,CACE,IAAIkL,EAAS,CACX,MAAM/F,EAAU,KAAK,MAAM+F,CAAO,EAClC,OAAI/F,GAAW,GAAG,KAAK,WAAW,IAAI4E,GAAiBmB,CAAO,EAAG/F,CAAO,EACjE,IACX,CACE,aAAa+F,EAAS,CACpB,MAAM/F,EAAU,KAAK,MAAM+F,CAAO,EAClC,OAAI/F,GAAW,GAAG,KAAK,WAAW,IAAI4E,GAAiBmB,CAAO,EAAG/F,CAAO,EACjE,KAAK,KAAK,GACrB,CACE,OAAOgG,EAAU,CACf,UAAWD,KAAWC,EACpB,KAAK,IAAID,CAAO,CAEtB,CACE,SAAU,CACR,OAAO,KAAK,MAAQ,IACxB,CACE,YAAa,CACX,OAAO,KAAK,MAAQ,IACxB,CACE,QAAS,CACP,GAAI,KAAK,MAAQ,EAAG,KAAM,wBAC1B,GAAI,KAAK,KAAO,EAAG,KAAM,8BACzB,OAAO,KAAK,KAAK,GACrB,CACE,OAAQ,CACN,GAAI,KAAK,MAAQ,EAAG,KAAM,wBAC1B,OAAO,KAAK,OAAM,EAAG,GACzB,CACE,MAAO,CACL,GAAI,KAAK,MAAQ,EAAG,KAAM,wBAC1B,OAAO,KAAK,MAAK,EAAG,GACxB,CACE,WAAWA,EAAS,CAClB,GAAIA,GAAW,KAAM,KAAM,uBAC3B,GAAI,KAAK,MAAQ,KAAM,OAAO,KAE9B,GADa,KAAK,MAAMA,CAAO,EACpB,EAAG,OAAO,KAAK,KAAK,IAC/B,IAAIR,EAAO,KAAK,KAAK,KACrB,GAAIA,GAAQ,KAAM,OAAO,KACzB,IAAIY,EAAYZ,EAAK,MACrB,KAAOY,GAAa,MAClBZ,EAAOY,EACPA,EAAYZ,EAAK,MAEnB,OAAOA,EAAK,GAChB,CACE,WAAWQ,EAAS,CAClB,GAAIA,GAAW,KAAM,KAAM,uBAC3B,GAAI,KAAK,MAAQ,KAAM,OAAO,KAE9B,GADa,KAAK,MAAMA,CAAO,EACpB,EAAG,OAAO,KAAK,KAAK,IAC/B,IAAIR,EAAO,KAAK,KAAK,MACrB,GAAIA,GAAQ,KAAM,OAAO,KACzB,IAAIa,EAAWb,EAAK,KACpB,KAAOa,GAAY,MACjBb,EAAOa,EACPA,EAAWb,EAAK,KAElB,OAAOA,EAAK,GAChB,CACE,UAAUS,EAAU,CAClB,MAAMK,EAAY,IAAIT,GAAc,KAAK,QAAS,KAAK,QAAQ,EACzDU,EAAoB,KAAK,kBAC/B,UAAWC,KAAUP,EAAU,CAC7B,GAAIM,GAAqB,KAAK,kBAC5B,KAAM,4CAEJ,KAAK,SAASC,CAAM,GAAK,KAAK,MAAMA,CAAM,GAAK,GACjDF,EAAU,IAAI,KAAK,KAAK,GAAG,CAEnC,CACQA,EAAU,MAAQ,KAAK,OACzB,KAAK,KAAOA,EAAU,KACtB,KAAK,KAAOA,EAAU,KACtB,KAAK,oBAEX,CACE,OAAOE,EAAQ,CAGb,MAFI,CAAC,KAAK,SAASA,CAAM,GACZ,KAAK,MAAMA,CAAM,GAClB,EAAU,KACf,KAAK,KAAK,GACrB,CACE,aAAaC,EAAO,CAClB,MAAM3L,EAAS,IAAI+K,GAAc,KAAK,QAAS,KAAK,QAAQ,EAC5D,UAAWG,KAAW,KAChBS,EAAM,IAAIT,CAAO,GAAGlL,EAAO,IAAIkL,CAAO,EAE5C,OAAOlL,CACX,CACE,WAAW2L,EAAO,CAChB,MAAM3L,EAAS,IAAI+K,GAAc,KAAK,QAAS,KAAK,QAAQ,EAC5D,UAAWG,KAAW,KACfS,EAAM,IAAIT,CAAO,GAAGlL,EAAO,IAAIkL,CAAO,EAE7C,OAAOlL,CACX,CACE,MAAM2L,EAAO,CACX,MAAMC,EAAI,KAAK,MAAO,EACtB,OAAAA,EAAE,OAAOD,CAAK,EACPC,CACX,CACE,OAAQ,CACN,MAAMC,EAAM,IAAId,GAAc,KAAK,QAAS,KAAK,QAAQ,EACzD,OAAAc,EAAI,KAAO,KAAK,KAChBA,EAAI,KAAO,KAAK,SAAS,KAAK,IAAI,EAC3BA,CACX,CACE,SAASnB,EAAM,CACb,GAAIA,GAAQ,KAAM,OAAO,KACzB,SAASoB,EAAaC,EAAOC,EAAM,CACjC,IAAI5B,EACAF,EACJ,EAAG,CAGD,GAFAE,EAAO2B,EAAM,KACb7B,EAAQ6B,EAAM,MACV3B,GAAQ,KAAM,CAChB,MAAM6B,EAAU,IAAIlC,GAAiBK,EAAK,GAAG,EAC7C4B,EAAK,KAAOC,EACZH,EAAa1B,EAAM6B,CAAO,CACpC,CACQ,GAAI/B,GAAS,KAAM,CACjB,MAAMgC,EAAW,IAAInC,GAAiBG,EAAM,GAAG,EAC/C8B,EAAK,MAAQE,EACbH,EAAQ7B,EACR8B,EAAOE,CACjB,CACO,OAAQhC,GAAS,KACxB,CACI,MAAMlK,EAAS,IAAI+J,GAAiBW,EAAK,GAAG,EAC5C,OAAAoB,EAAapB,EAAM1K,CAAM,EAClBA,CACX,CACE,OAAQ,CACN,OAAO,KAAK,MAAO,CACvB,CACE,SAAU,CACR,OAAO,IAAImM,GAAkC,KAAK,MAAM,CAC5D,CACE,MAAO,CACL,OAAO,KAAK,OAAO,QAAQ,EAAG,CAClC,CACE,QAAS,CACP,OAAO,KAAK,OAAO,QAAQ,EAAG,CAClC,CACE,EAACC,GAAA,OAAO,SAGPnB,GAAA,OAAO,YAHPmB,GAAe,GAAI,CAClB,OAAO,IAAIC,GAA6B,KAAK,MAAM,CACvD,CAEA,EACIC,GAA4B,KAAM,CAKpC,YAAYC,EAAM,CAJlBzC,EAAA,aACAA,EAAA,YAAO,IAAI,OACXA,EAAA,yBAAoB,MACpBA,EAAA,mBAEE,KAAK,KAAOyC,EACZ,KAAK,WAAaA,EAAK,cAAe,CAC1C,CACE,CAAC,OAAO,QAAQ,GAAI,CAClB,OAAO,IACX,CACE,MAAO,CACL,OAAI,KAAK,SAAU,EAAS,CAAE,KAAM,GAAO,MAAO,KAAK,SAAW,EAC3D,CAAE,KAAM,GAAM,MAAO,IAAM,CACtC,CACE,SAAU,CACR,GAAI,CAAC,KAAK,KAAK,OAAQ,OAAO,KAC9B,MAAM7B,EAAO,KAAK,KAAK,KAAK,KAAK,OAAS,CAAC,EAC3C,OAAO,KAAK,SAASA,CAAI,CAC7B,CACE,YAAYb,EAAK,CACf,KAAK,KAAK,OAAO,EAAG,KAAK,KAAK,MAAM,EACpC,KAAK,KAAK,MAAMA,CAAG,EACnB,KAAK,KAAK,KAAK,KAAK,KAAK,QAAO,CAAE,EAClC,KAAK,WAAa,KAAK,KAAK,cAAe,CAC/C,CACE,uBAAuBa,EAAM,CAC3B,KAAOA,GAAQ,MACb,KAAK,KAAK,KAAKA,CAAI,EACnBA,EAAOA,EAAK,IAElB,CACE,UAAW,CACT,GAAI,KAAK,mBAAqB,KAAK,KAAK,qBAAoB,EAAI,CAC9D,GAAI,KAAK,mBAAqB,KAAM,CAClC,KAAK,kBAAoB,KAAK,KAAK,qBAAsB,EACzD,IAAIqB,EAAQ,KAAK,KAAK,QAAS,EAC/B,KAAOA,GAAS,MACd,KAAK,KAAK,KAAKA,CAAK,EACpBA,EAAQA,EAAM,KAEhB,OAAO,KAAK,KAAK,OAAS,CAClC,CACM,KAAM,2CACZ,CACI,GAAI,CAAC,KAAK,KAAK,OAAQ,MAAO,GAC1B,KAAK,YAAc,KAAK,KAAK,cAAa,GAC5C,KAAK,YAAY,KAAK,KAAK,KAAK,KAAK,OAAS,CAAC,EAAE,GAAG,EAEtD,IAAIrB,EAAO,KAAK,KAAK,KAAK,KAAK,OAAS,CAAC,EACrC8B,EAAO9B,EAAK,MAChB,GAAI8B,GAAQ,KAAM,CAChB,KAAOA,GAAQ,MACb,KAAK,KAAK,KAAKA,CAAI,EACnBA,EAAOA,EAAK,KAEd,MAAO,EACb,CAEI,IADA,KAAK,KAAK,IAAK,EACR,KAAK,KAAK,QAAU,KAAK,KAAK,KAAK,KAAK,OAAS,CAAC,EAAE,QAAU9B,GACnEA,EAAO,KAAK,KAAK,IAAK,EAExB,OAAO,KAAK,KAAK,OAAS,CAC9B,CACA,EACI2B,GAA+B,cAAcC,EAA0B,CACzE,SAAS5B,EAAM,CACb,OAAOA,EAAK,GAChB,CACA,EACIyB,GAAoC,cAAcG,EAA0B,CAC9E,SAAS5B,EAAM,CACb,MAAO,CAACA,EAAK,IAAKA,EAAK,GAAG,CAC9B,CACA,EC9nBI+B,GAAoB9J,GACf,IACEA,EAKP+J,GAAmBC,GAAQ,CAC7B,MAAMC,EAAcD,EAAM,CAACpJ,EAAGpB,IAAMA,EAAE,MAAMoB,CAAC,EAAE,IAAK,EAAC,oBAAoBoJ,CAAG,EAAIF,GAAiB,EAAK,EACtG,MAAO,CAAClJ,EAAGpB,IACLyK,EAAYrJ,EAAGpB,CAAC,EAAU,EACvBoB,EAAE,WAAWpB,CAAC,CAEzB,EAGA,SAAS0K,GAAeF,EAAK,CAC3B,MAAMG,EAAkBH,EAAM,CAACI,EAAOC,EAAIC,EAAIC,EAAIC,IAAOJ,EAAM,gBAAgB,CAAC,EAAE,oBAChFG,EAAG,MAAMF,CAAE,EAAE,gBAAgB,CAAC,EAAE,KAAKG,EAAG,MAAMF,CAAE,EAAE,gBAAgB,CAAC,CAAC,EAAE,MAAMN,CAAG,CACnF,EAAMF,GAAiB,EAAK,EAC1B,MAAO,CAAClJ,EAAGpB,EAAGE,IAAM,CAClB,MAAM2K,EAAKzJ,EAAE,EAAG0J,EAAK1J,EAAE,EAAG2J,EAAK7K,EAAE,EAAG8K,EAAK9K,EAAE,EACrC0K,EAAQE,EAAG,MAAME,CAAE,EAAE,MAAMhL,EAAE,EAAE,MAAM+K,CAAE,CAAC,EAAE,MAAMF,EAAG,MAAME,CAAE,EAAE,MAAM/K,EAAE,EAAE,MAAMgL,CAAE,CAAC,CAAC,EACvF,OAAIL,EAAgBC,EAAOC,EAAIC,EAAIC,EAAIC,CAAE,EAAU,EAC5CJ,EAAM,WAAW,CAAC,CAC1B,CACH,CAOA,IAAIK,GAAoBzK,GACfA,EAIL0K,GAAgBV,GAAQ,CAC1B,GAAIA,EAAK,CACP,MAAMW,EAAQ,IAAIxC,GAAa4B,GAAgBC,CAAG,CAAC,EAC7CY,EAAQ,IAAIzC,GAAa4B,GAAgBC,CAAG,CAAC,EAC7Ca,EAAY,CAACvN,EAAOsM,IACjBA,EAAK,aAAatM,CAAK,EAE1BwN,EAAQvL,IACL,CACL,EAAGsL,EAAUtL,EAAE,EAAGoL,CAAK,EACvB,EAAGE,EAAUtL,EAAE,EAAGqL,CAAK,CACxB,GAEH,OAAAE,EAAK,CAAE,EAAG,IAAIrM,GAAU,CAAC,EAAG,EAAG,IAAIA,GAAU,CAAC,EAAG,EAC1CqM,CACX,CACE,OAAOL,EACT,EAGIvB,GAAOc,IACF,CACL,IAAMe,GAAS,CACbC,GAAY9B,GAAI6B,CAAI,CACrB,EACD,MAAO,IAAM7B,GAAIc,CAAG,EACpB,QAASD,GAAgBC,CAAG,EAC5B,KAAMU,GAAaV,CAAG,EACtB,OAAQE,GAAeF,CAAG,CAC3B,GAECgB,GAAY9B,GAAK,EAGjB+B,GAAW,CAAC/N,EAAMgO,IACbhO,EAAK,GAAG,EAAE,oBAAoBgO,EAAM,CAAC,GAAKA,EAAM,EAAE,oBAAoBhO,EAAK,GAAG,CAAC,GAAKA,EAAK,GAAG,EAAE,oBAAoBgO,EAAM,CAAC,GAAKA,EAAM,EAAE,oBAAoBhO,EAAK,GAAG,CAAC,EAExKiO,GAAiB,CAACC,EAAIC,IAAO,CAC/B,GAAIA,EAAG,GAAG,EAAE,WAAWD,EAAG,GAAG,CAAC,GAAKA,EAAG,GAAG,EAAE,WAAWC,EAAG,GAAG,CAAC,GAAKA,EAAG,GAAG,EAAE,WAAWD,EAAG,GAAG,CAAC,GAAKA,EAAG,GAAG,EAAE,WAAWC,EAAG,GAAG,CAAC,EACzH,OAAO,KACT,MAAMC,EAASF,EAAG,GAAG,EAAE,WAAWC,EAAG,GAAG,CAAC,EAAIA,EAAG,GAAG,EAAID,EAAG,GAAG,EACvDG,EAASH,EAAG,GAAG,EAAE,WAAWC,EAAG,GAAG,CAAC,EAAID,EAAG,GAAG,EAAIC,EAAG,GAAG,EACvDG,EAASJ,EAAG,GAAG,EAAE,WAAWC,EAAG,GAAG,CAAC,EAAIA,EAAG,GAAG,EAAID,EAAG,GAAG,EACvDK,EAASL,EAAG,GAAG,EAAE,WAAWC,EAAG,GAAG,CAAC,EAAID,EAAG,GAAG,EAAIC,EAAG,GAAG,EAC7D,MAAO,CAAE,GAAI,CAAE,EAAGC,EAAQ,EAAGE,GAAU,GAAI,CAAE,EAAGD,EAAQ,EAAGE,CAAM,CAAI,CACvE,EAMIC,GAAe,CAAC9K,EAAGpB,IAAMoB,EAAE,EAAE,MAAMpB,EAAE,CAAC,EAAE,MAAMoB,EAAE,EAAE,MAAMpB,EAAE,CAAC,CAAC,EAC5DmM,GAAa,CAAC/K,EAAGpB,IAAMoB,EAAE,EAAE,MAAMpB,EAAE,CAAC,EAAE,KAAKoB,EAAE,EAAE,MAAMpB,EAAE,CAAC,CAAC,EACzDoM,GAAUrM,GAAMoM,GAAWpM,EAAGA,CAAC,EAAE,KAAM,EACvCsM,GAAc,CAACC,EAASC,EAAOC,IAAW,CAC5C,MAAMC,EAAQ,CAAE,EAAGF,EAAM,EAAE,MAAMD,EAAQ,CAAC,EAAG,EAAGC,EAAM,EAAE,MAAMD,EAAQ,CAAC,CAAG,EACpEI,EAAS,CAAE,EAAGF,EAAO,EAAE,MAAMF,EAAQ,CAAC,EAAG,EAAGE,EAAO,EAAE,MAAMF,EAAQ,CAAC,CAAG,EAC7E,OAAOJ,GAAaQ,EAAQD,CAAK,EAAE,IAAIL,GAAOM,CAAM,CAAC,EAAE,IAAIN,GAAOK,CAAK,CAAC,CAC1E,EACIE,GAAgB,CAACL,EAASC,EAAOC,IAAW,CAC9C,MAAMC,EAAQ,CAAE,EAAGF,EAAM,EAAE,MAAMD,EAAQ,CAAC,EAAG,EAAGC,EAAM,EAAE,MAAMD,EAAQ,CAAC,CAAG,EACpEI,EAAS,CAAE,EAAGF,EAAO,EAAE,MAAMF,EAAQ,CAAC,EAAG,EAAGE,EAAO,EAAE,MAAMF,EAAQ,CAAC,CAAG,EAC7E,OAAOH,GAAWO,EAAQD,CAAK,EAAE,IAAIL,GAAOM,CAAM,CAAC,EAAE,IAAIN,GAAOK,CAAK,CAAC,CACxE,EACIG,GAAyB,CAACC,EAAI9M,EAAGoC,IAC/BpC,EAAE,EAAE,OAAM,EAAW,KAClB,CAAE,EAAG8M,EAAG,EAAE,KAAK9M,EAAE,EAAE,IAAIA,EAAE,CAAC,EAAE,MAAMoC,EAAE,MAAM0K,EAAG,CAAC,CAAC,CAAC,EAAG,EAAA1K,CAAG,EAE3D2K,GAAuB,CAACD,EAAI9M,EAAGS,IAC7BT,EAAE,EAAE,OAAM,EAAW,KAClB,CAAE,EAAAS,EAAG,EAAGqM,EAAG,EAAE,KAAK9M,EAAE,EAAE,IAAIA,EAAE,CAAC,EAAE,MAAMS,EAAE,MAAMqM,EAAG,CAAC,CAAC,CAAC,CAAG,EAE3DE,GAAe,CAACC,EAAKC,EAAIC,EAAKC,IAAO,CACvC,GAAIF,EAAG,EAAE,SAAU,OAAOH,GAAqBI,EAAKC,EAAIH,EAAI,CAAC,EAC7D,GAAIG,EAAG,EAAE,SAAU,OAAOL,GAAqBE,EAAKC,EAAIC,EAAI,CAAC,EAC7D,GAAID,EAAG,EAAE,SAAU,OAAOL,GAAuBM,EAAKC,EAAIH,EAAI,CAAC,EAC/D,GAAIG,EAAG,EAAE,SAAU,OAAOP,GAAuBI,EAAKC,EAAIC,EAAI,CAAC,EAC/D,MAAME,EAAQlB,GAAae,EAAIE,CAAE,EACjC,GAAIC,EAAM,OAAQ,EAAE,OAAO,KAC3B,MAAMC,EAAK,CAAE,EAAGH,EAAI,EAAE,MAAMF,EAAI,CAAC,EAAG,EAAGE,EAAI,EAAE,MAAMF,EAAI,CAAC,CAAG,EACrDjG,EAAKmF,GAAamB,EAAIJ,CAAE,EAAE,IAAIG,CAAK,EACnCpG,EAAKkF,GAAamB,EAAIF,CAAE,EAAE,IAAIC,CAAK,EACnCE,EAAKN,EAAI,EAAE,KAAKhG,EAAG,MAAMiG,EAAG,CAAC,CAAC,EAAGM,EAAKL,EAAI,EAAE,KAAKnG,EAAG,MAAMoG,EAAG,CAAC,CAAC,EAC/DK,EAAKR,EAAI,EAAE,KAAKhG,EAAG,MAAMiG,EAAG,CAAC,CAAC,EAAGQ,EAAKP,EAAI,EAAE,KAAKnG,EAAG,MAAMoG,EAAG,CAAC,CAAC,EAC/D3M,EAAI8M,EAAG,KAAKC,CAAE,EAAE,IAAI,CAAC,EACrBpL,EAAIqL,EAAG,KAAKC,CAAE,EAAE,IAAI,CAAC,EAC3B,MAAO,CAAE,EAAAjN,EAAG,EAAA2B,CAAG,CACjB,EAGIuL,GAAa,MAAMC,EAAY,CAuBjC,YAAYjC,EAAOkC,EAAQ,CAtB3BjG,EAAA,cACAA,EAAA,eACAA,EAAA,gBACAA,EAAA,gBACAA,EAAA,mBAmBM+D,EAAM,SAAW,OAAQA,EAAM,OAAS,CAAC,IAAI,EAC5CA,EAAM,OAAO,KAAK,IAAI,EAC3B,KAAK,MAAQA,EACb,KAAK,OAASkC,CAClB,CArBE,OAAO,QAAQxM,EAAGpB,EAAG,CACnB,MAAM6N,EAAQF,GAAY,cAAcvM,EAAE,MAAOpB,EAAE,KAAK,EACxD,OAAI6N,IAAU,EAAUA,GACpBzM,EAAE,QAAUpB,EAAE,OAAOoB,EAAE,KAAKpB,CAAC,EAC7BoB,EAAE,SAAWpB,EAAE,OAAeoB,EAAE,OAAS,EAAI,GAC1C0M,GAAQ,QAAQ1M,EAAE,QAASpB,EAAE,OAAO,EAC/C,CAEE,OAAO,cAAc+N,EAAKC,EAAK,CAC7B,OAAID,EAAI,EAAE,WAAWC,EAAI,CAAC,EAAU,GAChCD,EAAI,EAAE,cAAcC,EAAI,CAAC,EAAU,EACnCD,EAAI,EAAE,WAAWC,EAAI,CAAC,EAAU,GAChCD,EAAI,EAAE,cAAcC,EAAI,CAAC,EAAU,EAChC,CACX,CAQE,KAAKxE,EAAO,CACV,GAAIA,EAAM,QAAU,KAAK,MACvB,MAAM,IAAI,MAAM,qCAAqC,EAEvD,MAAMyE,EAAczE,EAAM,MAAM,OAChC,QAASpM,EAAI,EAAG8Q,EAAOD,EAAY,OAAQ7Q,EAAI8Q,EAAM9Q,IAAK,CACxD,MAAM+Q,EAAMF,EAAY7Q,CAAC,EACzB,KAAK,MAAM,OAAO,KAAK+Q,CAAG,EAC1BA,EAAI,MAAQ,KAAK,KACvB,CACI,KAAK,kBAAmB,CAC5B,CAGE,mBAAoB,CAClB,MAAMC,EAAY,KAAK,MAAM,OAAO,OACpC,QAAShR,EAAI,EAAGA,EAAIgR,EAAWhR,IAAK,CAClC,MAAMiR,EAAO,KAAK,MAAM,OAAOjR,CAAC,EAChC,GAAIiR,EAAK,QAAQ,aAAe,OAChC,QAAS7S,EAAI4B,EAAI,EAAG5B,EAAI4S,EAAW5S,IAAK,CACtC,MAAM8S,EAAO,KAAK,MAAM,OAAO9S,CAAC,EAC5B8S,EAAK,aAAe,QACpBD,EAAK,QAAQ,MAAM,SAAWC,EAAK,QAAQ,MAAM,QACrDD,EAAK,QAAQ,QAAQC,EAAK,OAAO,CACzC,CACA,CACA,CACE,0BAA2B,CACzB,MAAMC,EAAS,CAAE,EACjB,QAASnR,EAAI,EAAG8Q,EAAO,KAAK,MAAM,OAAO,OAAQ9Q,EAAI8Q,EAAM9Q,IAAK,CAC9D,MAAM+Q,EAAM,KAAK,MAAM,OAAO/Q,CAAC,EAC3B+Q,IAAQ,MAAQ,CAACA,EAAI,QAAQ,SAAWA,EAAI,QAAQ,cACtDI,EAAO,KAAKJ,CAAG,CAEvB,CACI,OAAOI,CACX,CAWE,sBAAsBC,EAAW,CAC/B,MAAMC,EAAwB,IAAI,IAC5BC,EAAaC,GAAgB,CACjC,MAAMC,EAAYD,EAAY,QAC9BF,EAAM,IAAIE,EAAa,CACrB,KAAMtC,GAAY,KAAK,MAAOmC,EAAU,MAAOI,EAAU,KAAK,EAC9D,OAAQjC,GAAc,KAAK,MAAO6B,EAAU,MAAOI,EAAU,KAAK,CAC1E,CAAO,CACF,EACD,MAAO,CAACxN,EAAGpB,IAAM,CACVyO,EAAM,IAAIrN,CAAC,GAAGsN,EAAUtN,CAAC,EACzBqN,EAAM,IAAIzO,CAAC,GAAG0O,EAAU1O,CAAC,EAC9B,KAAM,CAAE,KAAM6O,EAAO,OAAQC,CAAO,EAAKL,EAAM,IAAIrN,CAAC,EAC9C,CAAE,KAAM2N,EAAO,OAAQC,CAAO,EAAKP,EAAM,IAAIzO,CAAC,EACpD,OAAI6O,EAAM,uBAAuB,CAAC,GAAKE,EAAM,uBAAuB,CAAC,EAC/DD,EAAQ,WAAWE,CAAO,EAAU,EACpCF,EAAQ,cAAcE,CAAO,EAAU,GACpC,EAELH,EAAM,WAAW,CAAC,GAAKE,EAAM,WAAW,CAAC,EACvCD,EAAQ,WAAWE,CAAO,EAAU,GACpCF,EAAQ,cAAcE,CAAO,EAAU,EACpC,EAELD,EAAM,WAAWF,CAAK,EAAU,GAChCE,EAAM,cAAcF,CAAK,EAAU,EAChC,CACR,CACL,CACA,EAGII,GAAU,MAAMC,EAAS,CA+D3B,YAAYX,EAAQ,CA9DpB5G,EAAA,eACAA,EAAA,aACAA,EAAA,wBACAA,EAAA,uBA4DE,KAAK,OAAS4G,EACd,QAASnR,EAAI,EAAG8Q,EAAOK,EAAO,OAAQnR,EAAI8Q,EAAM9Q,IAC9CmR,EAAOnR,CAAC,EAAE,QAAQ,QAAU,KAE9B,KAAK,KAAO,IAChB,CA9DE,OAAO,QAAQ+R,EAAa,CAC1B,MAAMC,EAAW,CAAE,EACnB,QAAShS,EAAI,EAAG8Q,EAAOiB,EAAY,OAAQ/R,EAAI8Q,EAAM9Q,IAAK,CACxD,MAAMiS,EAAUF,EAAY/R,CAAC,EAC7B,GAAI,CAACiS,EAAQ,cAAgBA,EAAQ,QAAS,SAC9C,IAAIC,EAAY,KACZC,EAAQF,EAAQ,OAChBT,EAAYS,EAAQ,QACxB,MAAMd,EAAS,CAACgB,CAAK,EACfC,EAAgBD,EAAM,MACtBE,EAAkB,CAAE,EAC1B,KACEH,EAAYC,EACZA,EAAQX,EACRL,EAAO,KAAKgB,CAAK,EACbA,EAAM,QAAUC,GACpB,OAAa,CACX,MAAME,EAAeH,EAAM,yBAA0B,EACrD,GAAIG,EAAa,SAAW,EAAG,CAC7B,MAAMC,EAAUpB,EAAO,CAAC,EAAE,MACpBqB,EAASrB,EAAOA,EAAO,OAAS,CAAC,EAAE,MACzC,MAAM,IAAI,MACR,+CAA+CoB,EAAQ,CAAC,KAAKA,EAAQ,CAAC,2CAA2CC,EAAO,CAAC,KAAKA,EAAO,CAAC,IACvI,CACb,CACU,GAAIF,EAAa,SAAW,EAAG,CAC7Bd,EAAYc,EAAa,CAAC,EAAE,QAC5B,KACZ,CACU,IAAIG,EAAU,KACd,QAASrU,EAAI,EAAGsU,EAAOL,EAAgB,OAAQjU,EAAIsU,EAAMtU,IACvD,GAAIiU,EAAgBjU,CAAC,EAAE,QAAU+T,EAAM,MAAO,CAC5CM,EAAUrU,EACV,KACd,CAEU,GAAIqU,IAAY,KAAM,CACpB,MAAME,EAAiBN,EAAgB,OAAOI,CAAO,EAAE,CAAC,EAClDG,EAAazB,EAAO,OAAOwB,EAAe,KAAK,EACrDC,EAAW,QAAQA,EAAW,CAAC,EAAE,OAAO,EACxCZ,EAAS,KAAK,IAAIF,GAASc,EAAW,QAAS,CAAA,CAAC,EAChD,QACZ,CACUP,EAAgB,KAAK,CACnB,MAAOlB,EAAO,OACd,MAAOgB,EAAM,KACzB,CAAW,EACD,MAAMU,EAAaV,EAAM,sBAAsBD,CAAS,EACxDV,EAAYc,EAAa,KAAKO,CAAU,EAAE,CAAC,EAAE,QAC7C,KACV,CAEMb,EAAS,KAAK,IAAIF,GAASX,CAAM,CAAC,CACxC,CACI,OAAOa,CACX,CAQE,SAAU,CACR,IAAIc,EAAS,KAAK,OAAO,CAAC,EAAE,MAC5B,MAAMC,EAAS,CAACD,CAAM,EACtB,QAAS9S,EAAI,EAAG8Q,EAAO,KAAK,OAAO,OAAS,EAAG9Q,EAAI8Q,EAAM9Q,IAAK,CAC5D,MAAM8P,EAAM,KAAK,OAAO9P,CAAC,EAAE,MACrBgT,EAAU,KAAK,OAAOhT,EAAI,CAAC,EAAE,MAC/BoO,GAAU,OAAO0B,EAAKgD,EAAQE,CAAO,IAAM,IAC/CD,EAAO,KAAKjD,CAAG,EACfgD,EAAShD,EACf,CACI,GAAIiD,EAAO,SAAW,EAAG,OAAO,KAChC,MAAMtD,EAAKsD,EAAO,CAAC,EACbE,EAASF,EAAO,CAAC,EACnB3E,GAAU,OAAOqB,EAAIqD,EAAQG,CAAM,IAAM,GAAGF,EAAO,MAAO,EAC9DA,EAAO,KAAKA,EAAO,CAAC,CAAC,EACrB,MAAMG,EAAO,KAAK,eAAgB,EAAG,EAAI,GACnCC,EAAS,KAAK,eAAc,EAAK,EAAIJ,EAAO,OAAS,EACrDK,EAAO,KAAK,eAAgB,EAAGL,EAAO,OAAS,GAC/CM,EAAgB,CAAE,EACxB,QAASrT,EAAImT,EAAQnT,GAAKoT,EAAMpT,GAAKkT,EACnCG,EAAc,KAAK,CAACN,EAAO/S,CAAC,EAAE,EAAE,SAAU,EAAE+S,EAAO/S,CAAC,EAAE,EAAE,SAAU,CAAA,CAAC,EACrE,OAAOqT,CACX,CACE,gBAAiB,CACf,GAAI,KAAK,kBAAoB,OAAQ,CACnC,MAAMC,EAAY,KAAK,cAAe,EACtC,KAAK,gBAAkBA,EAAY,CAACA,EAAU,eAAgB,EAAG,EACvE,CACI,OAAO,KAAK,eAChB,CACE,eAAgB,CACd,OAAI,KAAK,iBAAmB,SAC1B,KAAK,eAAiB,KAAK,mBAAoB,GAE1C,KAAK,cAChB,CAEE,oBAAqB,SACnB,IAAIC,EAAc,KAAK,OAAO,CAAC,EAC/B,QAASvT,EAAI,EAAG8Q,EAAO,KAAK,OAAO,OAAQ9Q,EAAI8Q,EAAM9Q,IAAK,CACxD,MAAM+Q,EAAM,KAAK,OAAO/Q,CAAC,EACrBsQ,GAAW,QAAQiD,EAAaxC,CAAG,EAAI,IAAGwC,EAAcxC,EAClE,CACI,IAAIyC,EAAUD,EAAY,QAAQ,aAAc,EAC5CE,EAAcD,EAAUA,EAAQ,aAAc,EAAG,KACrD,OAAa,CACX,GAAI,CAACA,EAAS,OAAO,KACrB,GAAI,CAACC,EAAa,OAAOD,EAAQ,QACjC,GAAIC,EAAY,UAAYD,EAAQ,QAClC,QAAI9H,EAAA+H,EAAY,UAAZ,YAAA/H,EAAqB,mBAAoB8H,EAAQ,QAC5CA,EAAQ,SACH3G,EAAA2G,EAAQ,UAAR,YAAA3G,EAAiB,gBAEjC2G,EAAUC,EAAY,aAAc,EACpCA,EAAcD,EAAUA,EAAQ,aAAc,EAAG,IACvD,CACA,CACA,EACIE,GAAU,KAAM,CAGlB,YAAYC,EAAc,CAF1BpJ,EAAA,qBACAA,EAAA,sBAEE,KAAK,aAAeoJ,EACpBA,EAAa,KAAO,KACpB,KAAK,cAAgB,CAAE,CAC3B,CACE,YAAYxV,EAAM,CAChB,KAAK,cAAc,KAAKA,CAAI,EAC5BA,EAAK,KAAO,IAChB,CACE,SAAU,CACR,MAAMyV,EAAQ,KAAK,aAAa,QAAS,EACzC,GAAIA,IAAU,KAAM,OAAO,KAC3B,MAAM/V,EAAO,CAAC+V,CAAK,EACnB,QAAS5T,EAAI,EAAG8Q,EAAO,KAAK,cAAc,OAAQ9Q,EAAI8Q,EAAM9Q,IAAK,CAC/D,MAAM6T,EAAW,KAAK,cAAc7T,CAAC,EAAE,QAAS,EAC5C6T,IAAa,MACjBhW,EAAK,KAAKgW,CAAQ,CACxB,CACI,OAAOhW,CACX,CACA,EACIiW,GAAe,KAAM,CAGvB,YAAYC,EAAO,CAFnBxJ,EAAA,cACAA,EAAA,cAEE,KAAK,MAAQwJ,EACb,KAAK,MAAQ,KAAK,cAAcA,CAAK,CACzC,CACE,SAAU,CACR,MAAMlW,EAAO,CAAE,EACf,QAASmC,EAAI,EAAG8Q,EAAO,KAAK,MAAM,OAAQ9Q,EAAI8Q,EAAM9Q,IAAK,CACvD,MAAMgU,EAAW,KAAK,MAAMhU,CAAC,EAAE,QAAS,EACpCgU,IAAa,MACjBnW,EAAK,KAAKmW,CAAQ,CACxB,CACI,OAAOnW,CACX,CACE,cAAckW,EAAO,OACnB,MAAME,EAAQ,CAAE,EAChB,QAASjU,EAAI,EAAG8Q,EAAOiD,EAAM,OAAQ/T,EAAI8Q,EAAM9Q,IAAK,CAClD,MAAM7B,EAAO4V,EAAM/T,CAAC,EACpB,GAAI,CAAA7B,EAAK,KACT,GAAIA,EAAK,iBAAkB8V,EAAM,KAAK,IAAIP,GAAQvV,CAAI,CAAC,MAClD,CACH,MAAM+V,EAAgB/V,EAAK,cAAe,EACrC+V,GAAA,MAAAA,EAAe,MAAMD,EAAM,KAAK,IAAIP,GAAQQ,CAAa,CAAC,GAC/DxI,EAAAwI,GAAA,YAAAA,EAAe,OAAf,MAAAxI,EAAqB,YAAYvN,EACzC,CACA,CACI,OAAO8V,CACX,CACA,EAIIE,GAAY,KAAM,CAIpB,YAAYC,EAAOvB,EAAanC,GAAQ,QAAS,CAHjDnG,EAAA,cACAA,EAAA,aACAA,EAAA,iBAEE,KAAK,MAAQ6J,EACb,KAAK,KAAO,IAAIC,GAAcxB,CAAU,EACxC,KAAK,SAAW,CAAE,CACtB,CACE,QAAQV,EAAO,CACb,MAAMF,EAAUE,EAAM,QAChBmC,EAAY,CAAE,EACpB,GAAInC,EAAM,WACR,OAAIA,EAAM,OAAQ,KAAK,MAAM,OAAOA,EAAM,OAAO,EAC5C,KAAK,KAAK,OAAOF,CAAO,EACtBqC,EAELnC,EAAM,QAAQ,KAAK,KAAK,IAAIF,CAAO,EACvC,IAAIuB,EAAUvB,EACVsC,EAAUtC,EACd,GACEuB,EAAU,KAAK,KAAK,WAAWA,CAAO,QAC/BA,GAAW,MAAQA,EAAQ,YAAc,MAClD,GACEe,EAAU,KAAK,KAAK,WAAWA,CAAO,QAC/BA,GAAW,MAAQA,EAAQ,YAAc,MAClD,GAAIpC,EAAM,OAAQ,CAChB,IAAIqC,EAAiB,KACrB,GAAIhB,EAAS,CACX,MAAMiB,EAAYjB,EAAQ,gBAAgBvB,CAAO,EACjD,GAAIwC,IAAc,OACXxC,EAAQ,aAAawC,CAAS,IAAGD,EAAiBC,GACnD,CAACjB,EAAQ,aAAaiB,CAAS,GAAG,CACpC,MAAMC,EAAqB,KAAK,aAAalB,EAASiB,CAAS,EAC/D,QAASzU,EAAI,EAAG8Q,EAAO4D,EAAmB,OAAQ1U,EAAI8Q,EAAM9Q,IAC1DsU,EAAU,KAAKI,EAAmB1U,CAAC,CAAC,CAElD,CAEA,CACM,IAAI2U,EAAiB,KACrB,GAAIJ,EAAS,CACX,MAAMK,EAAYL,EAAQ,gBAAgBtC,CAAO,EACjD,GAAI2C,IAAc,OACX3C,EAAQ,aAAa2C,CAAS,IAAGD,EAAiBC,GACnD,CAACL,EAAQ,aAAaK,CAAS,GAAG,CACpC,MAAMF,EAAqB,KAAK,aAAaH,EAASK,CAAS,EAC/D,QAAS5U,EAAI,EAAG8Q,EAAO4D,EAAmB,OAAQ1U,EAAI8Q,EAAM9Q,IAC1DsU,EAAU,KAAKI,EAAmB1U,CAAC,CAAC,CAElD,CAEA,CACM,GAAIwU,IAAmB,MAAQG,IAAmB,KAAM,CACtD,IAAIE,EAAa,KACbL,IAAmB,KAAMK,EAAaF,EACjCA,IAAmB,KAAME,EAAaL,EAM7CK,EAJqBvE,GAAW,cAC9BkE,EACAG,CACD,GAC4B,EAAIH,EAAiBG,EAEpD,KAAK,MAAM,OAAO1C,EAAQ,OAAO,EACjCqC,EAAU,KAAKrC,EAAQ,OAAO,EAC9B,MAAMyC,EAAqBzC,EAAQ,MAAM4C,CAAU,EACnD,QAAS7U,EAAI,EAAG8Q,EAAO4D,EAAmB,OAAQ1U,EAAI8Q,EAAM9Q,IAC1DsU,EAAU,KAAKI,EAAmB1U,CAAC,CAAC,CAE9C,CACUsU,EAAU,OAAS,GACrB,KAAK,KAAK,OAAOrC,CAAO,EACxBqC,EAAU,KAAKnC,CAAK,IAEpB,KAAK,SAAS,KAAKF,CAAO,EAC1BA,EAAQ,KAAOuB,EAEvB,KAAW,CACL,GAAIA,GAAWe,EAAS,CACtB,MAAMO,EAAQtB,EAAQ,gBAAgBe,CAAO,EAC7C,GAAIO,IAAU,KAAM,CAClB,GAAI,CAACtB,EAAQ,aAAasB,CAAK,EAAG,CAChC,MAAMJ,EAAqB,KAAK,aAAalB,EAASsB,CAAK,EAC3D,QAAS9U,EAAI,EAAG8Q,EAAO4D,EAAmB,OAAQ1U,EAAI8Q,EAAM9Q,IAC1DsU,EAAU,KAAKI,EAAmB1U,CAAC,CAAC,CAElD,CACU,GAAI,CAACuU,EAAQ,aAAaO,CAAK,EAAG,CAChC,MAAMJ,EAAqB,KAAK,aAAaH,EAASO,CAAK,EAC3D,QAAS9U,EAAI,EAAG8Q,EAAO4D,EAAmB,OAAQ1U,EAAI8Q,EAAM9Q,IAC1DsU,EAAU,KAAKI,EAAmB1U,CAAC,CAAC,CAElD,CACA,CACA,CACM,KAAK,KAAK,OAAOiS,CAAO,CAC9B,CACI,OAAOqC,CACX,CAGE,aAAaS,EAAKtF,EAAI,CACpB,KAAK,KAAK,OAAOsF,CAAG,EACpB,MAAMC,EAAUD,EAAI,QACpB,KAAK,MAAM,OAAOC,CAAO,EACzB,MAAMV,EAAYS,EAAI,MAAMtF,CAAE,EAC9B,OAAA6E,EAAU,KAAKU,CAAO,EAClBD,EAAI,aAAe,QAAQ,KAAK,KAAK,IAAIA,CAAG,EACzCT,CACX,CACA,EAGIW,GAAY,KAAM,CAAN,cACd1K,EAAA,aACAA,EAAA,sBACA,IAAIjL,EAAMzB,EAAMqX,EAAW,CACzBC,GAAU,KAAO7V,EACjB,MAAM8V,EAAa,CAAC,IAAIC,GAAYxX,EAAM,EAAI,CAAC,EAC/C,QAASmC,EAAI,EAAG8Q,EAAOoE,EAAU,OAAQlV,EAAI8Q,EAAM9Q,IACjDoV,EAAW,KAAK,IAAIC,GAAYH,EAAUlV,CAAC,EAAG,EAAK,CAAC,EAGtD,GADAmV,GAAU,cAAgBC,EAAW,OACjCD,GAAU,OAAS,aAAc,CACnC,MAAMG,EAAUF,EAAW,CAAC,EAC5B,IAAIpV,EAAI,EACR,KAAOA,EAAIoV,EAAW,QAChB7G,GAAe6G,EAAWpV,CAAC,EAAE,KAAMsV,EAAQ,IAAI,IAAM,KAAMtV,IAC1DoV,EAAW,OAAOpV,EAAG,CAAC,CAEnC,CACI,GAAImV,GAAU,OAAS,eACrB,QAASnV,EAAI,EAAG8Q,EAAOsE,EAAW,OAAQpV,EAAI8Q,EAAM9Q,IAAK,CACvD,MAAMuV,EAAMH,EAAWpV,CAAC,EACxB,QAAS5B,EAAI4B,EAAI,EAAG0S,EAAO0C,EAAW,OAAQhX,EAAIsU,EAAMtU,IACtD,GAAImQ,GAAegH,EAAI,KAAMH,EAAWhX,CAAC,EAAE,IAAI,IAAM,KAAM,MAAO,CAAE,CAE9E,CAEI,MAAMgW,EAAQ,IAAIoB,GAAclF,GAAW,OAAO,EAClD,QAAStQ,EAAI,EAAG8Q,EAAOsE,EAAW,OAAQpV,EAAI8Q,EAAM9Q,IAAK,CACvD,MAAMyV,EAAcL,EAAWpV,CAAC,EAAE,eAAgB,EAClD,QAAS5B,EAAI,EAAGsU,EAAO+C,EAAY,OAAQrX,EAAIsU,EAAMtU,IACnDgW,EAAM,IAAIqB,EAAYrX,CAAC,CAAC,CAEhC,CACI,MAAMsX,EAAY,IAAIvB,GAAUC,CAAK,EACrC,IAAIrD,EAAM,KAKV,IAJIqD,EAAM,MAAQ,IAChBrD,EAAMqD,EAAM,MAAO,EACnBA,EAAM,OAAOrD,CAAG,GAEXA,GAAK,CACV,MAAMuD,EAAYoB,EAAU,QAAQ3E,CAAG,EACvC,QAAS/Q,EAAI,EAAG8Q,EAAOwD,EAAU,OAAQtU,EAAI8Q,EAAM9Q,IAAK,CACtD,MAAMkR,EAAOoD,EAAUtU,CAAC,EACpBkR,EAAK,aAAe,QAAQkD,EAAM,IAAIlD,CAAI,CACtD,CACUkD,EAAM,MAAQ,GAChBrD,EAAMqD,EAAM,MAAO,EACnBA,EAAM,OAAOrD,CAAG,GAEhBA,EAAM,IAEd,CACI3C,GAAU,MAAO,EACjB,MAAM4D,EAAWH,GAAQ,QAAQ6D,EAAU,QAAQ,EAEnD,OADe,IAAI5B,GAAa9B,CAAQ,EAC1B,QAAS,CAC3B,CACA,EACImD,GAAY,IAAIF,GAChBU,GAAoBR,GAGpBS,GAAY,EACZlF,GAAU,MAAMmF,EAAS,CAsF3B,YAAYC,EAAQd,EAASjB,EAAOgC,EAAU,CArF9CxL,EAAA,WACAA,EAAA,eACAA,EAAA,gBACAA,EAAA,cACAA,EAAA,iBACAA,EAAA,gBACAA,EAAA,mBACAA,EAAA,aACAA,EAAA,sBACAA,EAAA,qBACAA,EAAA,oBACAA,EAAA,oBA2EE,KAAK,GAAK,EAAEqL,GACZ,KAAK,OAASE,EACdA,EAAO,QAAU,KACjBA,EAAO,QAAUd,EACjB,KAAK,QAAUA,EACfA,EAAQ,QAAU,KAClBA,EAAQ,QAAUc,EAClB,KAAK,MAAQ/B,EACb,KAAK,SAAWgC,CACpB,CAtEE,OAAO,QAAQ/R,EAAGpB,EAAG,CACnB,MAAMoT,EAAMhS,EAAE,OAAO,MAAM,EACrBiS,EAAMrT,EAAE,OAAO,MAAM,EACrBsT,EAAMlS,EAAE,QAAQ,MAAM,EACtBmS,EAAMvT,EAAE,QAAQ,MAAM,EAC5B,GAAIuT,EAAI,WAAWH,CAAG,EAAG,MAAO,GAChC,GAAIE,EAAI,WAAWD,CAAG,EAAG,MAAO,GAChC,MAAMG,EAAMpS,EAAE,OAAO,MAAM,EACrBqS,EAAMzT,EAAE,OAAO,MAAM,EACrB0T,EAAMtS,EAAE,QAAQ,MAAM,EACtBuS,EAAM3T,EAAE,QAAQ,MAAM,EAC5B,GAAIoT,EAAI,WAAWC,CAAG,EAAG,CACvB,GAAII,EAAI,WAAWD,CAAG,GAAKC,EAAI,WAAWC,CAAG,EAAG,MAAO,GACvD,GAAID,EAAI,cAAcD,CAAG,GAAKC,EAAI,cAAcC,CAAG,EAAG,MAAO,GAC7D,MAAME,EAAYxS,EAAE,aAAapB,EAAE,OAAO,KAAK,EAC/C,GAAI4T,EAAY,EAAG,MAAO,GAC1B,GAAIA,EAAY,EAAG,MAAO,GAC1B,MAAMC,EAAa7T,EAAE,aAAaoB,EAAE,QAAQ,KAAK,EACjD,OAAIyS,IAAe,EAAUA,EACtB,EACb,CACI,GAAIT,EAAI,cAAcC,CAAG,EAAG,CAC1B,GAAIG,EAAI,WAAWC,CAAG,GAAKD,EAAI,WAAWG,CAAG,EAAG,MAAO,GACvD,GAAIH,EAAI,cAAcC,CAAG,GAAKD,EAAI,cAAcG,CAAG,EAAG,MAAO,GAC7D,MAAMG,EAAY9T,EAAE,aAAaoB,EAAE,OAAO,KAAK,EAC/C,GAAI0S,IAAc,EAAG,OAAOA,EAC5B,MAAMC,EAAa3S,EAAE,aAAapB,EAAE,QAAQ,KAAK,EACjD,OAAI+T,EAAa,EAAU,EACvBA,EAAa,EAAU,GACpB,CACb,CACI,GAAIP,EAAI,WAAWC,CAAG,EAAG,MAAO,GAChC,GAAID,EAAI,cAAcC,CAAG,EAAG,MAAO,GACnC,GAAIH,EAAI,WAAWC,CAAG,EAAG,CACvB,MAAMM,EAAa7T,EAAE,aAAaoB,EAAE,QAAQ,KAAK,EACjD,GAAIyS,IAAe,EAAG,OAAOA,CACnC,CACI,GAAIP,EAAI,cAAcC,CAAG,EAAG,CAC1B,MAAMQ,EAAa3S,EAAE,aAAapB,EAAE,QAAQ,KAAK,EACjD,GAAI+T,EAAa,EAAG,MAAO,GAC3B,GAAIA,EAAa,EAAG,MAAO,EACjC,CACI,GAAI,CAACT,EAAI,GAAGC,CAAG,EAAG,CAChB,MAAMzI,EAAK4I,EAAI,MAAMF,CAAG,EAClB3I,EAAKyI,EAAI,MAAMF,CAAG,EAClBY,EAAKL,EAAI,MAAMF,CAAG,EAClBQ,EAAKV,EAAI,MAAMF,CAAG,EACxB,GAAIvI,EAAG,cAAcD,CAAE,GAAKmJ,EAAG,WAAWC,CAAE,EAAG,MAAO,GACtD,GAAInJ,EAAG,WAAWD,CAAE,GAAKmJ,EAAG,cAAcC,CAAE,EAAG,MAAO,EAC5D,CACI,OAAIX,EAAI,cAAcC,CAAG,EAAU,EAC/BD,EAAI,WAAWC,CAAG,GAClBG,EAAI,WAAWC,CAAG,EAAU,GAC5BD,EAAI,cAAcC,CAAG,EAAU,EAC/BvS,EAAE,GAAKpB,EAAE,GAAW,GACpBoB,EAAE,GAAKpB,EAAE,GAAW,EACjB,CACX,CAcE,OAAO,SAASgN,EAAKE,EAAK3R,EAAM,CAC9B,IAAI2Y,EAAQC,EAASC,EACrB,MAAMC,EAAS3G,GAAW,cAAcV,EAAKE,CAAG,EAChD,GAAImH,EAAS,EACXH,EAASlH,EACTmH,EAAUjH,EACVkH,EAAU,UACDC,EAAS,EAClBH,EAAShH,EACTiH,EAAUnH,EACVoH,EAAU,OAEV,OAAM,IAAI,MACR,0CAA0CpH,EAAI,CAAC,KAAKA,EAAI,CAAC,GAC1D,EACH,MAAMkG,EAAS,IAAIxF,GAAWwG,EAAQ,EAAI,EACpC9B,EAAU,IAAI1E,GAAWyG,EAAS,EAAK,EAC7C,OAAO,IAAIlB,GAASC,EAAQd,EAAS,CAAC7W,CAAI,EAAG,CAAC6Y,CAAO,CAAC,CAC1D,CAEE,eAAeE,EAAY,CACzB,KAAK,QAAUA,EACf,KAAK,QAAQ,QAAU,KACvB,KAAK,QAAQ,QAAU,KAAK,OAC5B,KAAK,OAAO,QAAU,KAAK,OAC/B,CACE,MAAO,CACL,MAAM9G,EAAK,KAAK,OAAO,MAAM,EACvBC,EAAK,KAAK,QAAQ,MAAM,EAC9B,MAAO,CACL,GAAI,CAAE,EAAG,KAAK,OAAO,MAAM,EAAG,EAAGD,EAAG,WAAWC,CAAE,EAAID,EAAKC,CAAI,EAC9D,GAAI,CAAE,EAAG,KAAK,QAAQ,MAAM,EAAG,EAAGD,EAAG,cAAcC,CAAE,EAAID,EAAKC,CAAE,CACjE,CACL,CAEE,QAAS,CACP,MAAO,CACL,EAAG,KAAK,QAAQ,MAAM,EAAE,MAAM,KAAK,OAAO,MAAM,CAAC,EACjD,EAAG,KAAK,QAAQ,MAAM,EAAE,MAAM,KAAK,OAAO,MAAM,CAAC,CAClD,CACL,CACE,aAAaZ,EAAI,CACf,OAAOA,EAAG,EAAE,GAAG,KAAK,OAAO,MAAM,CAAC,GAAKA,EAAG,EAAE,GAAG,KAAK,OAAO,MAAM,CAAC,GAAKA,EAAG,EAAE,GAAG,KAAK,QAAQ,MAAM,CAAC,GAAKA,EAAG,EAAE,GAAG,KAAK,QAAQ,MAAM,CAAC,CACxI,CAcE,aAAanB,EAAO,CAClB,OAAOF,GAAU,OAAO,KAAK,OAAO,MAAOE,EAAO,KAAK,QAAQ,KAAK,CACxE,CAgBE,gBAAgBlC,EAAO,CACrB,MAAM+K,EAAQ,KAAK,KAAM,EACnBC,EAAQhL,EAAM,KAAM,EACpBiL,EAAc9I,GAAe4I,EAAOC,CAAK,EAC/C,GAAIC,IAAgB,KAAM,OAAO,KACjC,MAAMC,EAAM,KAAK,OAAO,MAClBC,EAAM,KAAK,QAAQ,MACnBC,EAAMpL,EAAM,OAAO,MACnBqL,EAAMrL,EAAM,QAAQ,MACpBsL,EAAkBrJ,GAAS8I,EAAOK,CAAG,GAAK,KAAK,aAAaA,CAAG,IAAM,EACrEG,EAAiBtJ,GAAS+I,EAAOE,CAAG,GAAKlL,EAAM,aAAakL,CAAG,IAAM,EACrEM,EAAkBvJ,GAAS8I,EAAOM,CAAG,GAAK,KAAK,aAAaA,CAAG,IAAM,EACrEI,EAAiBxJ,GAAS+I,EAAOG,CAAG,GAAKnL,EAAM,aAAamL,CAAG,IAAM,EAC3E,GAAII,GAAkBD,EACpB,OAAIG,GAAkB,CAACD,EAAwBL,EAC3C,CAACM,GAAkBD,EAAwBH,EACxC,KAET,GAAIE,EACF,OAAIC,GACEN,EAAI,EAAE,GAAGG,EAAI,CAAC,GAAKH,EAAI,EAAE,GAAGG,EAAI,CAAC,EAAU,KAE1CH,EAET,GAAII,EACF,OAAIG,GACEN,EAAI,EAAE,GAAGC,EAAI,CAAC,GAAKD,EAAI,EAAE,GAAGC,EAAI,CAAC,EAAU,KAE1CA,EAET,GAAIK,GAAkBD,EAAiB,OAAO,KAC9C,GAAIC,EAAgB,OAAON,EAC3B,GAAIK,EAAiB,OAAOH,EAC5B,MAAMhI,EAAKE,GAAa2H,EAAK,KAAK,OAAM,EAAIE,EAAKpL,EAAM,QAAQ,EAE/D,OADIqD,IAAO,MACP,CAACpB,GAASgJ,EAAa5H,CAAE,EAAU,KAChCrB,GAAU,KAAKqB,CAAE,CAC5B,CAaE,MAAMnB,EAAO,CACX,MAAMgG,EAAY,CAAE,EACdwD,EAAgBxJ,EAAM,SAAW,OACjCyJ,EAAY,IAAIzH,GAAWhC,EAAO,EAAI,EACtC4I,EAAa,IAAI5G,GAAWhC,EAAO,EAAK,EACxC0J,EAAa,KAAK,QACxB,KAAK,eAAed,CAAU,EAC9B5C,EAAU,KAAK4C,CAAU,EACzB5C,EAAU,KAAKyD,CAAS,EACxB,MAAME,EAAS,IAAIpC,GACjBkC,EACAC,EACA,KAAK,MAAM,MAAO,EAClB,KAAK,SAAS,MAAK,CACpB,EACD,OAAI1H,GAAW,cAAc2H,EAAO,OAAO,MAAOA,EAAO,QAAQ,KAAK,EAAI,GACxEA,EAAO,WAAY,EAEjB3H,GAAW,cAAc,KAAK,OAAO,MAAO,KAAK,QAAQ,KAAK,EAAI,GACpE,KAAK,WAAY,EAEfwH,IACFC,EAAU,kBAAmB,EAC7Bb,EAAW,kBAAmB,GAEzB5C,CACX,CAEE,YAAa,CACX,MAAM4D,EAAS,KAAK,QACpB,KAAK,QAAU,KAAK,OACpB,KAAK,OAASA,EACd,KAAK,OAAO,OAAS,GACrB,KAAK,QAAQ,OAAS,GACtB,QAASlY,EAAI,EAAG8Q,EAAO,KAAK,SAAS,OAAQ9Q,EAAI8Q,EAAM9Q,IACrD,KAAK,SAASA,CAAC,GAAK,EAE1B,CAGE,QAAQoM,EAAO,CACb,IAAI+L,EAAW,KACXC,EAAWhM,EACf,KAAO+L,EAAS,YAAYA,EAAWA,EAAS,WAChD,KAAOC,EAAS,YAAYA,EAAWA,EAAS,WAChD,MAAMrS,EAAM8P,GAAS,QAAQsC,EAAUC,CAAQ,EAC/C,GAAIrS,IAAQ,EACZ,IAAIA,EAAM,EAAG,CACX,MAAMsS,EAAMF,EACZA,EAAWC,EACXA,EAAWC,CACjB,CACI,GAAIF,EAAS,OAASC,EAAU,CAC9B,MAAMC,EAAMF,EACZA,EAAWC,EACXA,EAAWC,CACjB,CACI,QAASrY,EAAI,EAAG8Q,EAAOsH,EAAS,MAAM,OAAQpY,EAAI8Q,EAAM9Q,IAAK,CAC3D,MAAM7B,EAAOia,EAAS,MAAMpY,CAAC,EACvBgX,EAAUoB,EAAS,SAASpY,CAAC,EAC7BsY,EAAQH,EAAS,MAAM,QAAQha,CAAI,EACrCma,IAAU,IACZH,EAAS,MAAM,KAAKha,CAAI,EACxBga,EAAS,SAAS,KAAKnB,CAAO,GACzBmB,EAAS,SAASG,CAAK,GAAKtB,CACzC,CACIoB,EAAS,MAAQ,KACjBA,EAAS,SAAW,KACpBA,EAAS,WAAaD,EACtBC,EAAS,OAAO,WAAaD,EAAS,OACtCC,EAAS,QAAQ,WAAaD,EAAS,QAC3C,CAEE,cAAe,CACb,OAAI,KAAK,gBAAkB,OAAe,KAAK,eAC1C,KAAK,KACD,KAAK,KAAK,WAAU,EAAI,KAAK,cAAgB,KAAK,KACtD,KAAK,cAAgB,KAAK,KAAK,aAAc,EAFlC,KAAK,cAAgB,KAG9B,KAAK,cAChB,CACE,aAAc,CACZ,GAAI,KAAK,eAAiB,OAAQ,OAAO,KAAK,aAC9C,GAAI,CAAC,KAAK,KACR,KAAK,aAAe,CAClB,MAAO,CAAE,EACT,SAAU,CAAE,EACZ,WAAY,CAAA,CACb,MACE,CACH,MAAMpD,EAAM,KAAK,KAAK,YAAc,KAAK,KACzC,KAAK,aAAeA,EAAI,WAAY,CAC1C,CACI,OAAO,KAAK,YAChB,CACE,YAAa,CACX,GAAI,KAAK,cAAgB,OAAQ,OAAO,KAAK,YAC7C,MAAMwD,EAAc,KAAK,YAAa,EACtC,KAAK,YAAc,CACjB,MAAOA,EAAY,MAAM,MAAM,CAAC,EAChC,SAAUA,EAAY,SAAS,MAAM,CAAC,EACtC,WAAY,CAAA,CACb,EACD,MAAMC,EAAa,KAAK,YAAY,MAC9BC,EAAgB,KAAK,YAAY,SACjCC,EAAW,KAAK,YAAY,WAClC,QAAS1Y,EAAI,EAAG8Q,EAAO,KAAK,MAAM,OAAQ9Q,EAAI8Q,EAAM9Q,IAAK,CACvD,MAAM7B,EAAO,KAAK,MAAM6B,CAAC,EACnBgX,EAAU,KAAK,SAAShX,CAAC,EACzBsY,EAAQE,EAAW,QAAQra,CAAI,EACjCma,IAAU,IACZE,EAAW,KAAKra,CAAI,EACpBsa,EAAc,KAAKzB,CAAO,GACrByB,EAAcH,CAAK,GAAKtB,CACrC,CACI,MAAM2B,EAAa,CAAE,EACfC,EAAe,CAAE,EACvB,QAAS5Y,EAAI,EAAG8Q,EAAO0H,EAAW,OAAQxY,EAAI8Q,EAAM9Q,IAAK,CACvD,GAAIyY,EAAczY,CAAC,IAAM,EAAG,SAC5B,MAAM7B,EAAOqa,EAAWxY,CAAC,EACnB6Y,EAAO1a,EAAK,KAClB,GAAIya,EAAa,QAAQC,CAAI,IAAM,GACnC,GAAI1a,EAAK,WAAYwa,EAAW,KAAKE,CAAI,MACpC,CACCD,EAAa,QAAQC,CAAI,IAAM,IAAID,EAAa,KAAKC,CAAI,EAC7D,MAAMP,EAAQK,EAAW,QAAQxa,EAAK,IAAI,EACtCma,IAAU,IAAIK,EAAW,OAAOL,EAAO,CAAC,CACpD,CACA,CACI,QAAStY,EAAI,EAAG8Q,EAAO6H,EAAW,OAAQ3Y,EAAI8Q,EAAM9Q,IAAK,CACvD,MAAM8Y,EAAKH,EAAW3Y,CAAC,EAAE,UACrB0Y,EAAS,QAAQI,CAAE,IAAM,IAAIJ,EAAS,KAAKI,CAAE,CACvD,CACI,OAAO,KAAK,WAChB,CAEE,YAAa,CACX,GAAI,KAAK,WAAY,MAAO,GAC5B,GAAI,KAAK,cAAgB,OAAQ,OAAO,KAAK,YAC7C,MAAMC,EAAY,KAAK,YAAW,EAAG,WAC/BL,EAAW,KAAK,WAAU,EAAG,WACnC,OAAQ/C,GAAkB,KAAI,CAC5B,IAAK,QAAS,CACZ,MAAMqD,EAAYD,EAAU,SAAW,EACjCE,EAAWP,EAAS,SAAW,EACrC,KAAK,YAAcM,IAAcC,EACjC,KACR,CACM,IAAK,eAAgB,CACnB,IAAIC,EACAC,EACAJ,EAAU,OAASL,EAAS,QAC9BQ,EAAQH,EAAU,OAClBI,EAAOT,EAAS,SAEhBQ,EAAQR,EAAS,OACjBS,EAAOJ,EAAU,QAEnB,KAAK,YAAcI,IAASxD,GAAkB,eAAiBuD,EAAQC,EACvE,KACR,CACM,IAAK,MAAO,CACV,MAAMC,EAAO,KAAK,IAAIL,EAAU,OAASL,EAAS,MAAM,EACxD,KAAK,YAAcU,EAAO,IAAM,EAChC,KACR,CACM,IAAK,aAAc,CACjB,MAAMC,EAAiBC,GAAQA,EAAI,SAAW,GAAKA,EAAI,CAAC,EAAE,UAC1D,KAAK,YAAcD,EAAcN,CAAS,IAAMM,EAAcX,CAAQ,EACtE,KACR,CACA,CACI,OAAO,KAAK,WAChB,CACA,EAGIa,GAAS,KAAM,CAKjB,YAAYC,EAAUX,EAAMY,EAAY,CAJxClP,EAAA,aACAA,EAAA,mBACAA,EAAA,iBACAA,EAAA,aAEE,GAAI,CAAC,MAAM,QAAQiP,CAAQ,GAAKA,EAAS,SAAW,EAClD,MAAM,IAAI,MAAM,uDAAuD,EAKzE,GAHA,KAAK,KAAOX,EACZ,KAAK,WAAaY,EAClB,KAAK,SAAW,CAAE,EACd,OAAOD,EAAS,CAAC,EAAE,CAAC,GAAM,UAAY,OAAOA,EAAS,CAAC,EAAE,CAAC,GAAM,SAClE,MAAM,IAAI,MAAM,uDAAuD,EAEzE,MAAME,EAAatL,GAAU,KAAK,CAAE,EAAG,IAAIuL,GAAWH,EAAS,CAAC,EAAE,CAAC,CAAC,EAAG,EAAG,IAAIG,GAAWH,EAAS,CAAC,EAAE,CAAC,CAAC,EAAG,EAC1G,KAAK,KAAO,CACV,GAAI,CAAE,EAAGE,EAAW,EAAG,EAAGA,EAAW,CAAG,EACxC,GAAI,CAAE,EAAGA,EAAW,EAAG,EAAGA,EAAW,CAAC,CACvC,EACD,IAAIE,EAAYF,EAChB,QAAS1Z,EAAI,EAAG8Q,EAAO0I,EAAS,OAAQxZ,EAAI8Q,EAAM9Q,IAAK,CACrD,GAAI,OAAOwZ,EAASxZ,CAAC,EAAE,CAAC,GAAM,UAAY,OAAOwZ,EAASxZ,CAAC,EAAE,CAAC,GAAM,SAClE,MAAM,IAAI,MAAM,uDAAuD,EAEzE,MAAMsO,EAAQF,GAAU,KAAK,CAAE,EAAG,IAAIuL,GAAWH,EAASxZ,CAAC,EAAE,CAAC,CAAC,EAAG,EAAG,IAAI2Z,GAAWH,EAASxZ,CAAC,EAAE,CAAC,CAAC,EAAG,EACjGsO,EAAM,EAAE,GAAGsL,EAAU,CAAC,GAAKtL,EAAM,EAAE,GAAGsL,EAAU,CAAC,IACrD,KAAK,SAAS,KAAKlJ,GAAQ,SAASkJ,EAAWtL,EAAO,IAAI,CAAC,EACvDA,EAAM,EAAE,WAAW,KAAK,KAAK,GAAG,CAAC,IAAG,KAAK,KAAK,GAAG,EAAIA,EAAM,GAC3DA,EAAM,EAAE,WAAW,KAAK,KAAK,GAAG,CAAC,IAAG,KAAK,KAAK,GAAG,EAAIA,EAAM,GAC3DA,EAAM,EAAE,cAAc,KAAK,KAAK,GAAG,CAAC,IAAG,KAAK,KAAK,GAAG,EAAIA,EAAM,GAC9DA,EAAM,EAAE,cAAc,KAAK,KAAK,GAAG,CAAC,IAAG,KAAK,KAAK,GAAG,EAAIA,EAAM,GAClEsL,EAAYtL,EAClB,EACQ,CAACoL,EAAW,EAAE,GAAGE,EAAU,CAAC,GAAK,CAACF,EAAW,EAAE,GAAGE,EAAU,CAAC,IAC/D,KAAK,SAAS,KAAKlJ,GAAQ,SAASkJ,EAAWF,EAAY,IAAI,CAAC,CAEtE,CACE,gBAAiB,CACf,MAAMjE,EAAc,CAAE,EACtB,QAASzV,EAAI,EAAG8Q,EAAO,KAAK,SAAS,OAAQ9Q,EAAI8Q,EAAM9Q,IAAK,CAC1D,MAAMiS,EAAU,KAAK,SAASjS,CAAC,EAC/ByV,EAAY,KAAKxD,EAAQ,MAAM,EAC/BwD,EAAY,KAAKxD,EAAQ,OAAO,CACtC,CACI,OAAOwD,CACX,CACA,EACIoE,GAAS,KAAM,CAKjB,YAAYC,EAAUC,EAAW,CAJjCxP,EAAA,kBACAA,EAAA,qBACAA,EAAA,sBACAA,EAAA,aAEE,GAAI,CAAC,MAAM,QAAQuP,CAAQ,EACzB,MAAM,IAAI,MAAM,uDAAuD,EAEzE,KAAK,aAAe,IAAIP,GAAOO,EAAS,CAAC,EAAG,KAAM,EAAI,EACtD,KAAK,KAAO,CACV,GAAI,CAAE,EAAG,KAAK,aAAa,KAAK,GAAG,EAAG,EAAG,KAAK,aAAa,KAAK,GAAG,CAAG,EACtE,GAAI,CAAE,EAAG,KAAK,aAAa,KAAK,GAAG,EAAG,EAAG,KAAK,aAAa,KAAK,GAAG,CAAC,CACrE,EACD,KAAK,cAAgB,CAAE,EACvB,QAAS9Z,EAAI,EAAG8Q,EAAOgJ,EAAS,OAAQ9Z,EAAI8Q,EAAM9Q,IAAK,CACrD,MAAM7B,EAAO,IAAIob,GAAOO,EAAS9Z,CAAC,EAAG,KAAM,EAAK,EAC5C7B,EAAK,KAAK,GAAG,EAAE,WAAW,KAAK,KAAK,GAAG,CAAC,IAAG,KAAK,KAAK,GAAG,EAAIA,EAAK,KAAK,GAAG,GACzEA,EAAK,KAAK,GAAG,EAAE,WAAW,KAAK,KAAK,GAAG,CAAC,IAAG,KAAK,KAAK,GAAG,EAAIA,EAAK,KAAK,GAAG,GACzEA,EAAK,KAAK,GAAG,EAAE,cAAc,KAAK,KAAK,GAAG,CAAC,IAAG,KAAK,KAAK,GAAG,EAAIA,EAAK,KAAK,GAAG,GAC5EA,EAAK,KAAK,GAAG,EAAE,cAAc,KAAK,KAAK,GAAG,CAAC,IAAG,KAAK,KAAK,GAAG,EAAIA,EAAK,KAAK,GAAG,GAChF,KAAK,cAAc,KAAKA,CAAI,CAClC,CACI,KAAK,UAAY4b,CACrB,CACE,gBAAiB,CACf,MAAMtE,EAAc,KAAK,aAAa,eAAgB,EACtD,QAASzV,EAAI,EAAG8Q,EAAO,KAAK,cAAc,OAAQ9Q,EAAI8Q,EAAM9Q,IAAK,CAC/D,MAAMga,EAAkB,KAAK,cAAcha,CAAC,EAAE,eAAgB,EAC9D,QAAS5B,EAAI,EAAGsU,EAAOsH,EAAgB,OAAQ5b,EAAIsU,EAAMtU,IACvDqX,EAAY,KAAKuE,EAAgB5b,CAAC,CAAC,CAE3C,CACI,OAAOqX,CACX,CACA,EACIJ,GAAc,KAAM,CAItB,YAAYxX,EAAMoc,EAAW,CAH7B1P,EAAA,kBACAA,EAAA,cACAA,EAAA,aAEE,GAAI,CAAC,MAAM,QAAQ1M,CAAI,EACrB,MAAM,IAAI,MAAM,uDAAuD,EAEzE,GAAI,CACE,OAAOA,EAAK,CAAC,EAAE,CAAC,EAAE,CAAC,GAAM,WAAUA,EAAO,CAACA,CAAI,EACpD,MAAY,CACjB,CACI,KAAK,MAAQ,CAAE,EACf,KAAK,KAAO,CACV,GAAI,CAAE,EAAG,IAAI8b,GAAW,OAAO,iBAAiB,EAAG,EAAG,IAAIA,GAAW,OAAO,iBAAiB,CAAG,EAChG,GAAI,CAAE,EAAG,IAAIA,GAAW,OAAO,iBAAiB,EAAG,EAAG,IAAIA,GAAW,OAAO,iBAAiB,CAAC,CAC/F,EACD,QAAS3Z,EAAI,EAAG8Q,EAAOjT,EAAK,OAAQmC,EAAI8Q,EAAM9Q,IAAK,CACjD,MAAM6Y,EAAO,IAAIgB,GAAOhc,EAAKmC,CAAC,EAAG,IAAI,EACjC6Y,EAAK,KAAK,GAAG,EAAE,WAAW,KAAK,KAAK,GAAG,CAAC,IAAG,KAAK,KAAK,GAAG,EAAIA,EAAK,KAAK,GAAG,GACzEA,EAAK,KAAK,GAAG,EAAE,WAAW,KAAK,KAAK,GAAG,CAAC,IAAG,KAAK,KAAK,GAAG,EAAIA,EAAK,KAAK,GAAG,GACzEA,EAAK,KAAK,GAAG,EAAE,cAAc,KAAK,KAAK,GAAG,CAAC,IAAG,KAAK,KAAK,GAAG,EAAIA,EAAK,KAAK,GAAG,GAC5EA,EAAK,KAAK,GAAG,EAAE,cAAc,KAAK,KAAK,GAAG,CAAC,IAAG,KAAK,KAAK,GAAG,EAAIA,EAAK,KAAK,GAAG,GAChF,KAAK,MAAM,KAAKA,CAAI,CAC1B,CACI,KAAK,UAAYoB,CACrB,CACE,gBAAiB,CACf,MAAMxE,EAAc,CAAE,EACtB,QAASzV,EAAI,EAAG8Q,EAAO,KAAK,MAAM,OAAQ9Q,EAAI8Q,EAAM9Q,IAAK,CACvD,MAAMka,EAAkB,KAAK,MAAMla,CAAC,EAAE,eAAgB,EACtD,QAAS5B,EAAI,EAAGsU,EAAOwH,EAAgB,OAAQ9b,EAAIsU,EAAMtU,IACvDqX,EAAY,KAAKyE,EAAgB9b,CAAC,CAAC,CAE3C,CACI,OAAOqX,CACX,CACA,EAGI0E,GAAQ,CAACtc,KAASqX,IAAcS,GAAkB,IAAI,QAAS9X,EAAMqX,CAAS,EAG9EkF,GAAa,CAACvc,KAASqX,IAAcS,GAAkB,IAAI,aAAc9X,EAAMqX,CAAS,EACzE9G,GAAU,ICrmC7B,SAASiM,GAAY/b,EAAU,CAC7B,MAAMgc,EAAQ,CAAE,EAIhB,GAHAva,GAASzB,EAAWT,GAAS,CAC3Byc,EAAM,KAAKzc,EAAK,WAAW,CAC/B,CAAG,EACGyc,EAAM,OAAS,EACjB,MAAM,IAAI,MAAM,iCAAiC,EAEnD,MAAMxc,EAAaQ,EAAS,SAAS,CAAC,EAAE,YAAc,CAAE,EAClDic,EAAcC,GAAoBF,EAAM,CAAC,EAAG,GAAGA,EAAM,MAAM,CAAC,CAAC,EACnE,OAAIC,EAAY,SAAW,EAAU,KACjCA,EAAY,SAAW,EAAUtc,GAAQsc,EAAY,CAAC,EAAGzc,CAAU,EAChEU,GAAa+b,EAAazc,CAAU,CAC7C,CACA,IAAI2c,GAA0BJ,GCf9B,SAASK,GAAQhc,EAAS,CACxB,GAAI,CAACA,EAAS,MAAM,IAAI,MAAM,qBAAqB,EACnD,IAAIic,EAAU,CAAE,EAChB,OAAAta,GAAY3B,EAAS,SAASd,EAAS,CACrC+c,EAAQ,KAAK/c,CAAO,CACxB,CAAG,EACMS,GAAkBsc,CAAO,CAClC,CACA,IAAIC,GAAuBF,GCP3B,SAASG,GAAOvc,EAAUP,EAAU,GAAI,CACtC,MAAMuc,EAAQ,CAAE,EAIhB,GAHAva,GAASzB,EAAWT,GAAS,CAC3Byc,EAAM,KAAKzc,EAAK,WAAW,CAC/B,CAAG,EACGyc,EAAM,OAAS,EACjB,MAAM,IAAI,MAAM,iCAAiC,EAEnD,MAAMQ,EAAUC,GAAeT,EAAM,CAAC,EAAG,GAAGA,EAAM,MAAM,CAAC,CAAC,EAC1D,OAAIQ,EAAQ,SAAW,EAAU,KAC7BA,EAAQ,SAAW,EAAU7c,GAAQ6c,EAAQ,CAAC,EAAG/c,EAAQ,UAAU,EAC3DS,GAAasc,EAAS/c,EAAQ,UAAU,CACtD,CACA,IAAIid,GAAqBH,GCFlB,SAASI,GAAWC,EAAmB,CACtC,MAAA5a,EAAO,CAAC,GAAG4a,CAAK,EAEtB,OAAI5a,EAAK,CAAC,EAAIA,EAAK,CAAC,IAEhB,KAAK,KAAKA,EAAK,CAAC,EAAIA,EAAK,CAAC,EAAI,KAAO,CAAC,EACtC,KAAK,KAAKA,EAAK,CAAC,EAAI,IAAMA,EAAK,CAAC,GAAK,CAAC,EAEtCA,EAAK,CAAC,GAAK,IAEXA,EAAK,CAAC,GAAK,KAIRA,CACT,CChBgB,SAAA6a,GACdC,EACAC,EACM,CACN,MAAMjC,EAAOgB,GACX/b,GAAkB,CAChBJ,GAAQ,CACN,CACE,CAAC,IAAK,EAAE,EACR,CAAC,KAAM,EAAE,EACT,CAAC,KAAM,GAAG,EACV,CAAC,IAAK,GAAG,EACT,CAAC,IAAK,EAAE,CAAA,CACV,CACD,EACDmd,CACD,CAAA,CACH,EAEA,GAAI,CAAChC,EACH,OAGGA,EAAA,WAAa,CAAE,OAAQ,EAAK,EAEjC,MAAMkC,EAAKL,GAAW3a,GAAK8a,CAAM,CAAS,EAIpCG,GAAaD,EAAG,CAAC,EAAIA,EAAG,CAAC,GAAK,IAAM,IAEpCE,EAAYF,EAAG,CAAC,EAAI,KACpBG,EAAaH,EAAG,CAAC,EAAI,IAErBI,EAAYhB,GAAQU,CAAM,EAEhC,GAAIM,EAAU,SAAS,OAAS,IAAMF,GAAaC,GACtC,UAAA5C,KAAQ6C,EAAU,SAAU,CACrC,MAAMJ,EAAKL,GAAW3a,GAAKuY,CAAI,CAAS,EAExC,GAAI4C,GAAcH,EAAG,CAAC,EAAI,KAAOC,EACpB,UAAApd,KAAQ0a,EAAK,SAAS,YAC/B,UAAW8C,KAAYxd,EACZwd,EAAA,CAAC,GAAK,IAAMJ,EAK3B,GAAIC,GAAaF,EAAG,CAAC,EAAI,IAAMC,EAClB,UAAApd,KAAQ0a,EAAK,SAAS,YAC/B,UAAW8C,KAAYxd,EACZwd,EAAA,CAAC,GAAK,IAAMJ,CAG3B,CAIJF,EACEhd,GAAkB,CAChBqd,EAAU,SAAS,OAAS,EAAIN,EAAUjB,GAAMuB,CAAS,GAAKN,EAC9DhC,CACD,CAAA,CACH,CACF,CCzCA,MAAMwC,GAAY,YAElB,SAASC,GAAaje,EAAsB,OACpC,MAAAE,EAAaF,EAAQ,cAAc,EAEnC,CAAE,OAAAke,GAAWhe,EAEbwB,GAAOoM,EAAA9N,EAAQ,YAAY,IAApB,YAAA8N,EAAuB,UAE9BqQ,EAASD,EACX,EACAxc,IAAS,cAAgBA,IAAS,kBAChC,EACA,EAEN,OAAO,IAAI0c,GAAM,CACf,OAAQF,EACJ,OACA,IAAIG,GAAO,CACT,MAAO,UACP,SAAU,CAACF,EAAQA,CAAM,EACzB,MAAOA,EACP,QAAS,MAAA,CACV,EACL,KAAMD,EACF,IAAII,GAAK,CACP,MAAO,WACR,CAAA,EACD,OACJ,MAAO,IAAIC,GAAK,CACd,IAAK,iBACHre,EAAW,UACP,UACAA,EAAW,WACT,WACA,YACR,OACA,OAAQ,CAAC,GAAK,CAAC,CAAA,CAChB,EACD,OAAQA,EAAW,WAAa,EAAIA,EAAW,UAAY,EAAI,EAC/D,KACEA,EAAW,YAAcA,EAAW,QAChC,IAAIse,GAAK,CACP,eAAgB,IAAIF,GAAK,CAAE,MAAO,QAAS,EAC3C,KAAMpe,EAAW,QACjB,QAAS,IACT,iBAAkB,IAAIme,GAAO,CAC3B,MAAO,QACP,SAAU,QACV,MAAO,CAAA,CACR,EACD,QAAS,CAAC,EAAG,EAAG,EAAG,CAAC,CAAA,CACrB,EACD,MAAA,CACP,CACH,CAEgB,SAAAI,GACdC,EACAC,EAAiC,CAAA,EACjCC,EAA0B,CAC1B,EAAAC,EAA+CZ,GAC/C,CACA,IAAIa,EAAe,GAEfC,EAEAC,EAEAC,EAEAC,EAAoB,GAElB,MAAAC,EAAc,IAAIC,GAAY,CAClC,qBAAsB,EAAA,CACvB,EAEDV,EAAI,SAASS,CAAW,EAExB,MAAME,EAAS,IAAIC,GAAa,EAAE,EAElCH,EAAY,UAAUE,CAAM,EAE5BF,EAAY,SAASN,CAAiB,EAElCH,EAAA,GAAG,QAAUtZ,GAAM,CACrBsZ,EAAI,sBAAsBtZ,EAAE,MAAQpF,GAAY,CACxC,MAAA2C,EAAK3C,EAAQ,MAAM,EAEzB,GAAK2C,EAIL,OAAAyC,EAAE,gBAAgB,EAElB4Z,GAAA,MAAAA,EAAe,CAAE,KAAM,cAAe,GAAArc,CAAA,GAE/B3C,CAAA,CACR,CAAA,CACF,EAEG0e,EAAA,GAAG,cAAgBtZ,GAAM,CAC3B,MAAM5C,EAAYkc,EAAI,sBAAsBtZ,EAAE,MAAQpF,GAC7CA,EAAQ,MAAM,CACtB,EAEG+e,IAAgBvc,IAIhBuc,IACaC,GAAA,MAAAA,EAAA,CACb,KAAM,mBACN,GAAID,CAAA,IAIJvc,IACawc,GAAA,MAAAA,EAAA,CACb,KAAM,mBACN,GAAIxc,CAAA,IAIRkc,EAAI,iBAAmB,EAAA,MAAM,OAASlc,EAClC,UACA0c,EACE,YACA,GAEQH,EAAAvc,EAAA,CACf,EAED,SAAS+c,GAAgB,CACvB,OAAOC,GAAkB,kBAAA,GAAKd,EAAI,QAAA,EAAU,cAAc,CAAA,CAG5D,SAASe,EAAUte,EAAsB,CACvC,OAAOA,EAAS,UAAU6c,GAAWuB,EAAA,CAAe,CAAA,CAGhD,MAAAG,EAAkBta,GAAqC,CAC5C4Z,GAAA,MAAAA,EAAA,CACb,KAAM,WACN,YAAaW,GAAA,SAASva,EAAE,WAAYma,EAAe,CAAA,CAAA,EAEvD,EAEO,MAAA,CACL,gBAAgBK,EAAoD,CAC9DA,GACaZ,EAAAY,EACXlB,EAAA,GAAG,QAASgB,CAAc,IAEfV,EAAA,OACXN,EAAA,GAAG,QAASgB,CAAc,EAElC,EAEA,MAAMG,EAAkBC,EAAc,CAChCpB,EAAA,UAAU,QAAQ,CACpB,OAAQqB,GAAA,WAAWF,EAAQN,GAAe,EAC1C,GAAIO,EAAO,CAAE,KAAAA,CAAA,EAAS,CAAC,EACvB,SAAU,IACV,GAAGnB,CAAA,CACJ,CACH,EAEA,UAAUjc,EAAYsd,EAAiBC,EAAuB,CACxDvB,EAAA,UAAU,IAAIwB,GAAAA,gBAAgBxd,EAAMsb,GAAWuB,EAAA,CAAe,EAAG,CACnE,QAAS,CAACS,EAASA,EAASA,EAASA,CAAO,EAC5C,GAAIC,EAAU,CAAE,QAAAA,CAAA,EAAY,CAAC,EAC7B,SAAU,IACV,GAAGrB,CAAA,CACJ,CACH,EAEA,gBAAgBuB,EAAwB,CAClBjB,EAAAiB,EAEpBzB,EAAI,iBAAiB,EAAE,MAAM,OAASyB,EAAU,YAAc,EAChE,EAEA,iBAAiB7f,EAAwB,CACnC2e,EACG3e,EAOF2e,EAAc,cAA0B,eACvCc,GAAA,WAAWzf,EAAaif,EAAe,CAAA,CACzC,GARAF,EAAO,cAAcJ,CAAa,EAElCA,EAAc,QAAQ,EAENA,EAAA,QAMT3e,IACT2e,EAAgB,IAAImB,EAAA,QAClB,IAAIC,QAAQN,GAAAA,WAAWzf,EAAaif,EAAA,CAAe,CAAC,CACtD,EAEAN,EAAc,cAAc,CAAE,UAAW,EAAA,CAAM,EAE/CI,EAAO,WAAWJ,CAAa,EAEnC,EAEA,YACEqB,EACA9C,EACA+C,EACM,CACN,SAAS9C,EAAQ+C,EAAkD,OACjE,GAAKA,EAIM,UAAAvS,KAAKuS,EAAK,SAAU,CACvB,MAAAvgB,EACJgO,EAAE,SAAS,OAAS,UAChB,IAAIwS,EAAAA,QAAUxS,EAAE,SAAS,WAAW,EACpCA,EAAE,SAAS,OAAS,eAClB,IAAIyS,eAAezS,EAAE,SAAS,WAAW,EACzC,KAEHhO,GAIEof,EAAA,WACL,IAAIe,UAAU,CACZ,OAAQ,CAAC,GAACtS,EAAAG,EAAE,aAAF,MAAAH,EAAc,QACxB,SAAU2R,EAAUxf,CAAI,CACzB,CAAA,CACH,CAAA,CACF,CAGFof,EAAO,MAAM,EAETJ,GACFI,EAAO,WAAWJ,CAAa,EAGjC0B,KAAWnD,EAAQ,CACjB,IAAIoD,EAAU,GAEV,GAAApD,EAAO,SAAS,OAAS,qBAAsB,CAC3C,MAAAd,EAAQc,EAAO,SAAS,WAC3B,IAAKrc,GACJA,EAAS,OAAS,UACd,IAAIsf,EAAU,QAAAtf,EAAS,WAAW,EAClCA,EAAS,OAAS,eAChB,IAAIuf,EAAAA,aAAevf,EAAS,WAAW,EACvC,MAEP,OAAWiF,GAAwB,CAAC,CAACA,CAAC,EAErC,GAAAsW,EAAM,OAAS,EACV2C,EAAA,WACL,IAAIe,EAAU,QAAAX,EAAU,IAAIoB,EAAqB,mBAAAnE,CAAK,CAAC,CAAC,CAC1D,EAEUkE,EAAA,OAEC,WAAAzf,KAAYqc,EAAO,SAAS,WACjCrc,EAAS,OAAS,cACbke,EAAA,WACL,IAAIe,EAAA,QACFX,EAAU,IAAIqB,EAAAA,WAAa3f,EAAS,WAAW,CAAC,CAAA,CAEpD,EAEUyf,EAAA,IACDzf,EAAS,OAAS,mBACpBke,EAAA,WACL,IAAIe,EAAA,QACFX,EAAU,IAAIsB,EAAAA,gBAAkB5f,EAAS,WAAW,CAAC,CAAA,CAEzD,EAGQyf,EAAA,EAEd,CAGF,GAAI,CAAAA,GAEO,GAAApD,EAAO,SAAS,OAAS,UAClCD,GAAQC,EAAgCC,CAAO,UACtCD,EAAO,SAAS,OAAS,eAClCD,GAAQC,EAAqCC,CAAO,UAC3CD,EAAO,SAAS,OAAS,aAAc,CACzC6B,EAAA,WACL,IAAIe,EAAA,QACFX,EAAU,IAAIqB,EAAA,WAAatD,EAAO,SAAS,WAAW,CAAC,CAAA,CAE3D,EAEM,MAAAmD,CACG,SAAAnD,EAAO,SAAS,OAAS,kBAAmB,CAC9C6B,EAAA,WACL,IAAIe,EAAA,QACFX,EAAU,IAAIsB,EAAA,gBAAkBvD,EAAO,SAAS,WAAW,CAAC,CAAA,CAEhE,EAEM,MAAAmD,CAAA,EAGJ,GAAA,CAACJ,GAAqB,CAAC/C,EAAO,SAAS,KAAK,SAAS,OAAO,EACxD,MAAAmD,EAGDtB,EAAA,WAAW,IAAIe,EAAAA,QAAUX,EAAU,IAAIY,EAAAA,MAAQ7C,EAAO,MAAM,CAAC,CAAC,CAAC,CAAA,CAG7D,UAAAxd,KAAWsgB,GAAkB,GAAI,CAC1C,GAAItgB,IAAYwd,EACd,SAGF,MAAMwD,EAAS,IAAIZ,EAAA,QACjB,IAAIC,EAAQ,MAAAN,GAAA,WAAW/f,EAAQ,OAAQuf,EAAA,CAAe,CAAC,CACzD,EAEOyB,EAAA,MAAMhhB,EAAQ,EAAE,EAEvBghB,EAAO,cAAc,CACnB,MAAO,CAAC,CAAChhB,EAAQ,cACjB,QACEA,EAAQ,WAAW,CAAC,IAAM,UACtBA,EAAQ,WACRA,EAAQ,WAAW,QAAQ,MAAO,EAAE,CAAA,CAC3C,EAEDqf,EAAO,WAAW2B,CAAM,CAAA,CAE5B,EAEA,kBAAkBtG,EAAqB,WAC/B,MAAAha,EAAW2e,EAAO,YAAY,EAE9B4B,GAASnT,EAAApN,EAAS,CAAC,IAAV,MAAAoN,EAAa,gBAAgB,UAAY,EAAI,EAExDgR,EAAe,MACR7P,EAAAvO,EAAAoe,EAAemC,CAAM,IAArB,MAAAhS,EAAwB,cAAc,CAC7C,WAAY,EAAA,IAIZyL,EAAQ,MACDwG,EAAAxgB,EAAAga,EAAQuG,CAAM,IAAd,MAAAC,EAAiB,cAAc,CACtC,WAAY,EAAA,IAIDpC,EAAApE,CACjB,EAEA,kBAAmB,CACX,MAAAyG,EAAOzC,EAAI,QAAQ,EAEnBmB,EAASsB,EAAK,UAAU,EAExBrB,EAAOqB,EAAK,QAAQ,EAEtB,GAAA,GAACtB,GAAUC,IAAS,QAIxB,MAAO,CAACA,EAAM,GAAIH,GAAAA,SAASE,EAAQN,EAAe,CAAA,CAAc,CAAA,CAEpE,CACF","x_google_ignoreList":[0,1,2,3,4,5,6,7,8]}