@loaders.gl/parquet 4.0.0-beta.2 → 4.0.0-beta.3

package/dist/parquet-worker.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../../node_modules/base64-js/index.js", "../../../node_modules/ieee754/index.js", "../../../node_modules/int53/index.js", "../../../node_modules/varint/encode.js", "../../../node_modules/varint/decode.js", "../../../node_modules/varint/length.js", "../../../node_modules/varint/index.js", "../../../node_modules/pako/lib/utils/common.js", "../../../node_modules/pako/lib/zlib/trees.js", "../../../node_modules/pako/lib/zlib/adler32.js", "../../../node_modules/pako/lib/zlib/crc32.js", "../../../node_modules/pako/lib/zlib/messages.js", "../../../node_modules/pako/lib/zlib/deflate.js", "../../../node_modules/pako/lib/utils/strings.js", "../../../node_modules/pako/lib/zlib/zstream.js", "../../../node_modules/pako/lib/deflate.js", "../../../node_modules/pako/lib/zlib/inffast.js", "../../../node_modules/pako/lib/zlib/inftrees.js", "../../../node_modules/pako/lib/zlib/inflate.js", "../../../node_modules/pako/lib/zlib/constants.js", "../../../node_modules/pako/lib/zlib/gzheader.js", "../../../node_modules/pako/lib/inflate.js", "../../../node_modules/pako/index.js", "(disabled):zlib", "../../../node_modules/snappyjs/snappy_decompressor.js", "../../../node_modules/snappyjs/snappy_compressor.js", "../../../node_modules/snappyjs/index.js", "../../../node_modules/lz4js/util.js", "../../../node_modules/lz4js/xxh32.js", "../../../node_modules/lz4js/lz4.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/thrift.js", "../../../node_modules/isomorphic-ws/browser.js", "../../../node_modules/events/events.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/binary.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/input_buffer_underrun_error.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/log.js", "../../../node_modules/node-int64/Int64.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/compact_protocol.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/binary_protocol.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/header_transport.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/buffered_transport.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/int64_util.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/json_parse.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/json_protocol.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/create_client.js", "../../../node_modules/browser-or-node/lib/index.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/ws_connection.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/xhr_connection.js", "../../../node_modules/q/q.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/multiplexed_protocol.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/framed_transport.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/ws_transport.js", "../../../node_modules/thrift/lib/nodejs/lib/thrift/browser.js", "../../loader-utils/src/lib/env-utils/globals.ts", "../../worker-utils/src/lib/worker-utils/get-transfer-list.ts", "../../worker-utils/src/lib/worker-farm/worker-body.ts", "../../loader-utils/src/lib/worker-loader-utils/create-loader-worker.ts", "../../loader-utils/src/lib/binary-utils/array-buffer-utils.ts", "../../loader-utils/src/lib/iterators/async-iteration.ts", "../../loader-utils/src/lib/node/buffer.browser.ts", "../../loader-utils/src/lib/binary-utils/memory-conversion-utils.ts", "../../loader-utils/src/lib/node/promisify.ts", "../../loader-utils/src/lib/filesystems/readable-file.ts", "../src/buffer-polyfill/buffer.ts", "../src/buffer-polyfill/buffer-polyfill.browser.ts", "../src/parquet-loader.ts", "../src/parquetjs/codecs/plain.ts", "../src/parquetjs/codecs/rle.ts", "../src/parquetjs/codecs/dictionary.ts", "../src/parquetjs/codecs/index.ts", "../../compression/src/lib/compression.ts", "../../compression/src/lib/no-compression.ts", "../../compression/src/lib/deflate-compression.ts", "../../compression/src/lib/gzip-compression.ts", "../../compression/src/brotli/decode.ts", "../../compression/src/lib/brotli-compression.ts", "../../compression/src/lib/snappy-compression.ts", "../../compression/src/lib/lz4-compression.ts", "../../compression/src/lib/zstd-compression.ts", "../src/parquetjs/compression.ts", "../../../node_modules/bson/node_modules/base64-js/index.js", "../../../node_modules/bson/node_modules/ieee754/index.js", "../../../node_modules/bson/node_modules/buffer/index.js", "../../../node_modules/bson/src/ensure_buffer.ts", "../../../node_modules/bson/src/uuid.ts", "../../../node_modules/bson/src/binary.ts", "../../../node_modules/bson/src/code.ts", "../../../node_modules/bson/node_modules/rollup-plugin-node-builtins/src/es6/empty.js", "../../../node_modules/bson/node_modules/rollup-plugin-node-builtins/src/es6/inherits.js", "../../../node_modules/bson/node_modules/rollup-plugin-node-builtins/src/es6/util.js", "../../../node_modules/bson/src/parser/utils.ts", "../../../node_modules/bson/src/db_ref.ts", "../../../node_modules/bson/src/long.ts", "../../../node_modules/bson/src/decimal128.ts", "../../../node_modules/bson/src/double.ts", "../../../node_modules/bson/src/int_32.ts", "../../../node_modules/bson/src/map.ts", "../../../node_modules/bson/src/max_key.ts", "../../../node_modules/bson/src/min_key.ts", "../../../node_modules/bson/src/objectid.ts", "../../../node_modules/bson/src/constants.ts", "../../../node_modules/bson/src/parser/calculate_size.ts", "../../../node_modules/bson/src/regexp.ts", "../../../node_modules/bson/src/symbol.ts", "../../../node_modules/bson/src/timestamp.ts", "../../../node_modules/bson/src/validate_utf8.ts", "../../../node_modules/bson/src/parser/deserializer.ts", "../../../node_modules/bson/src/extended_json.ts", "../../../node_modules/bson/src/float_parser.ts", "../../../node_modules/bson/src/parser/serializer.ts", "../../../node_modules/bson/src/bson.ts", "../../bson/src/lib/parsers/parse-bson.ts", "../../bson/src/bson-loader.ts", "../../bson/src/lib/encoders/encode-bson.ts", "../../bson/src/bson-writer.ts", "../src/parquetjs/schema/types.ts", "../src/parquetjs/schema/shred.ts", "../src/parquetjs/schema/schema.ts", "../src/parquetjs/parquet-thrift/index.ts", "../src/parquetjs/parquet-thrift/Type.ts", "../src/parquetjs/parquet-thrift/ConvertedType.ts", "../src/parquetjs/parquet-thrift/FieldRepetitionType.ts", "../src/parquetjs/parquet-thrift/Encoding.ts", "../src/parquetjs/parquet-thrift/CompressionCodec.ts", "../src/parquetjs/parquet-thrift/PageType.ts", "../src/parquetjs/parquet-thrift/Statistics.ts", "../src/parquetjs/parquet-thrift/StringType.ts", "../src/parquetjs/parquet-thrift/UUIDType.ts", "../src/parquetjs/parquet-thrift/MapType.ts", "../src/parquetjs/parquet-thrift/ListType.ts", "../src/parquetjs/parquet-thrift/EnumType.ts", "../src/parquetjs/parquet-thrift/DateType.ts", "../src/parquetjs/parquet-thrift/NullType.ts", "../src/parquetjs/parquet-thrift/DecimalType.ts", "../src/parquetjs/parquet-thrift/MilliSeconds.ts", "../src/parquetjs/parquet-thrift/MicroSeconds.ts", "../src/parquetjs/parquet-thrift/TimestampType.ts", "../src/parquetjs/parquet-thrift/TimeUnit.ts", "../src/parquetjs/parquet-thrift/TimeType.ts", "../src/parquetjs/parquet-thrift/IntType.ts", "../src/parquetjs/parquet-thrift/JsonType.ts", "../src/parquetjs/parquet-thrift/BsonType.ts", "../src/parquetjs/parquet-thrift/SchemaElement.ts", "../src/parquetjs/parquet-thrift/LogicalType.ts", "../src/parquetjs/parquet-thrift/DataPageHeader.ts", "../src/parquetjs/parquet-thrift/IndexPageHeader.ts", "../src/parquetjs/parquet-thrift/DictionaryPageHeader.ts", "../src/parquetjs/parquet-thrift/DataPageHeaderV2.ts", "../src/parquetjs/parquet-thrift/PageHeader.ts", "../src/parquetjs/parquet-thrift/KeyValue.ts", "../src/parquetjs/parquet-thrift/SortingColumn.ts", "../src/parquetjs/parquet-thrift/PageEncodingStats.ts", "../src/parquetjs/parquet-thrift/ColumnMetaData.ts", "../src/parquetjs/parquet-thrift/ColumnChunk.ts", "../src/parquetjs/parquet-thrift/RowGroup.ts", "../src/parquetjs/parquet-thrift/TypeDefinedOrder.ts", "../src/parquetjs/parquet-thrift/FileMetaData.ts", "../src/parquetjs/parquet-thrift/ColumnOrder.ts", "../src/constants.ts", "../src/parquetjs/utils/read-utils.ts", "../src/parquetjs/parser/decoders.ts", "../src/parquetjs/parser/parquet-reader.ts", "../src/lib/arrow/convert-schema-from-parquet.ts", "../src/lib/geo/decode-geo-metadata.ts", "../src/lib/parsers/get-parquet-schema.ts", "../../schema/src/lib/table/simple-table/table-accessors.ts", "../../wkt/src/lib/utils/version.ts", "../../wkt/src/lib/parse-wkt.ts", "../../wkt/src/wkt-loader.ts", "../../gis/src/lib/binary-to-geojson.ts", "../../wkt/src/lib/parse-wkb-header.ts", "../../wkt/src/lib/parse-wkb.ts", "../../wkt/src/wkb-loader.ts", "../src/lib/geo/decode-geo-column.ts", "../src/lib/parsers/parse-parquet-to-rows.ts", "../src/lib/parsers/parse-parquet-to-columns.ts", "../src/index.ts", "../src/workers/parquet-worker.ts"],
-  "sourcesContent": ["'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n  lookup[i] = code[i]\n  revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n  var len = b64.length\n\n  if (len % 4 > 0) {\n    throw new Error('Invalid string. Length must be a multiple of 4')\n  }\n\n  // Trim off extra bytes after placeholder bytes are found\n  // See: https://github.com/beatgammit/base64-js/issues/42\n  var validLen = b64.indexOf('=')\n  if (validLen === -1) validLen = len\n\n  var placeHoldersLen = validLen === len\n    ? 0\n    : 4 - (validLen % 4)\n\n  return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n  var tmp\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n\n  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n  var curByte = 0\n\n  // if there are placeholders, only get up to the last complete 4 chars\n  var len = placeHoldersLen > 0\n    ? validLen - 4\n    : validLen\n\n  var i\n  for (i = 0; i < len; i += 4) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 18) |\n      (revLookup[b64.charCodeAt(i + 1)] << 12) |\n      (revLookup[b64.charCodeAt(i + 2)] << 6) |\n      revLookup[b64.charCodeAt(i + 3)]\n    arr[curByte++] = (tmp >> 16) & 0xFF\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 2) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 2) |\n      (revLookup[b64.charCodeAt(i + 1)] >> 4)\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 1) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 10) |\n      (revLookup[b64.charCodeAt(i + 1)] << 4) |\n      (revLookup[b64.charCodeAt(i + 2)] >> 2)\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  return arr\n}\n\nfunction tripletToBase64 (num) {\n  return lookup[num >> 18 & 0x3F] +\n    lookup[num >> 12 & 0x3F] +\n    lookup[num >> 6 & 0x3F] +\n    lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n  var tmp\n  var output = []\n  for (var i = start; i < end; i += 3) {\n    tmp =\n      ((uint8[i] << 16) & 0xFF0000) +\n      ((uint8[i + 1] << 8) & 0xFF00) +\n      (uint8[i + 2] & 0xFF)\n    output.push(tripletToBase64(tmp))\n  }\n  return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n  var tmp\n  var len = uint8.length\n  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n  var parts = []\n  var maxChunkLength = 16383 // must be multiple of 3\n\n  // go through the array every three bytes, we'll deal with trailing stuff later\n  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n    parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n  }\n\n  // pad the end with zeros, but make sure to not forget the extra bytes\n  if (extraBytes === 1) {\n    tmp = uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 2] +\n      lookup[(tmp << 4) & 0x3F] +\n      '=='\n    )\n  } else if (extraBytes === 2) {\n    tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 10] +\n      lookup[(tmp >> 4) & 0x3F] +\n      lookup[(tmp << 2) & 0x3F] +\n      '='\n    )\n  }\n\n  return parts.join('')\n}\n", "/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\nexports.read = function (buffer, offset, isLE, mLen, nBytes) {\n  var e, m\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var nBits = -7\n  var i = isLE ? (nBytes - 1) : 0\n  var d = isLE ? -1 : 1\n  var s = buffer[offset + i]\n\n  i += d\n\n  e = s & ((1 << (-nBits)) - 1)\n  s >>= (-nBits)\n  nBits += eLen\n  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  m = e & ((1 << (-nBits)) - 1)\n  e >>= (-nBits)\n  nBits += mLen\n  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  if (e === 0) {\n    e = 1 - eBias\n  } else if (e === eMax) {\n    return m ? NaN : ((s ? -1 : 1) * Infinity)\n  } else {\n    m = m + Math.pow(2, mLen)\n    e = e - eBias\n  }\n  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n  var e, m, c\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n  var i = isLE ? 0 : (nBytes - 1)\n  var d = isLE ? 1 : -1\n  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n  value = Math.abs(value)\n\n  if (isNaN(value) || value === Infinity) {\n    m = isNaN(value) ? 1 : 0\n    e = eMax\n  } else {\n    e = Math.floor(Math.log(value) / Math.LN2)\n    if (value * (c = Math.pow(2, -e)) < 1) {\n      e--\n      c *= 2\n    }\n    if (e + eBias >= 1) {\n      value += rt / c\n    } else {\n      value += rt * Math.pow(2, 1 - eBias)\n    }\n    if (value * c >= 2) {\n      e++\n      c /= 2\n    }\n\n    if (e + eBias >= eMax) {\n      m = 0\n      e = eMax\n    } else if (e + eBias >= 1) {\n      m = ((value * c) - 1) * Math.pow(2, mLen)\n      e = e + eBias\n    } else {\n      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n      e = 0\n    }\n  }\n\n  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n  e = (e << mLen) | m\n  eLen += mLen\n  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n  buffer[offset + i - d] |= s * 128\n}\n", "var int53 = {}\n\nvar MAX_UINT32 = 0x00000000FFFFFFFF\nvar MAX_INT53 =  0x001FFFFFFFFFFFFF\n\nfunction onesComplement(number) {\n\tnumber = ~number\n\tif (number < 0) {\n\t\tnumber = (number & 0x7FFFFFFF) + 0x80000000\n\t}\n\treturn number\n}\n\nfunction uintHighLow(number) {\n\tconsole.assert(number > -1 && number <= MAX_INT53, \"number out of range\")\n\tconsole.assert(Math.floor(number) === number, \"number must be an integer\")\n\tvar high = 0\n\tvar signbit = number & 0xFFFFFFFF\n\tvar low = signbit < 0 ? (number & 0x7FFFFFFF) + 0x80000000 : signbit\n\tif (number > MAX_UINT32) {\n\t\thigh = (number - low) / (MAX_UINT32 + 1)\n\t}\n\treturn [high, low]\n}\n\nfunction intHighLow(number) {\n\tif (number > -1) {\n\t\treturn uintHighLow(number)\n\t}\n\tvar hl = uintHighLow(-number)\n\tvar high = onesComplement(hl[0])\n\tvar low = onesComplement(hl[1])\n\tif (low === MAX_UINT32) {\n\t\thigh += 1\n\t\tlow = 0\n\t}\n\telse {\n\t\tlow += 1\n\t}\n\treturn [high, low]\n}\n\nfunction toDouble(high, low, signed) {\n\tif (signed && (high & 0x80000000) !== 0) {\n\t\thigh = onesComplement(high)\n\t\tlow = onesComplement(low)\n\t\tconsole.assert(high < 0x00200000, \"number too small\")\n\t\treturn -((high * (MAX_UINT32 + 1)) + low + 1)\n\t}\n\telse { //positive\n\t\tconsole.assert(high < 0x00200000, \"number too large\")\n\t\treturn (high * (MAX_UINT32 + 1)) + low\n\t}\n}\n\nint53.readInt64BE = function (buffer, offset) {\n\toffset = offset || 0\n\tvar high = buffer.readUInt32BE(offset)\n\tvar low = buffer.readUInt32BE(offset + 4)\n\treturn toDouble(high, low, true)\n}\n\nint53.readInt64LE = function (buffer, offset) {\n\toffset = offset || 0\n\tvar low = buffer.readUInt32LE(offset)\n\tvar high = buffer.readUInt32LE(offset + 4)\n\treturn toDouble(high, low, true)\n}\n\nint53.readUInt64BE = function (buffer, offset) {\n\toffset = offset || 0\n\tvar high = buffer.readUInt32BE(offset)\n\tvar low = buffer.readUInt32BE(offset + 4)\n\treturn toDouble(high, low, false)\n}\n\nint53.readUInt64LE = function (buffer, offset) {\n\toffset = offset || 0\n\tvar low = buffer.readUInt32LE(offset)\n\tvar high = buffer.readUInt32LE(offset + 4)\n\treturn toDouble(high, low, false)\n}\n\nint53.writeInt64BE = function (number, buffer, offset) {\n\toffset = offset || 0\n\tvar hl = intHighLow(number)\n\tbuffer.writeUInt32BE(hl[0], offset)\n\tbuffer.writeUInt32BE(hl[1], offset + 4)\n}\n\nint53.writeInt64LE = function (number, buffer, offset) {\n\toffset = offset || 0\n\tvar hl = intHighLow(number)\n\tbuffer.writeUInt32LE(hl[1], offset)\n\tbuffer.writeUInt32LE(hl[0], offset + 4)\n}\n\nint53.writeUInt64BE = function (number, buffer, offset) {\n\toffset = offset || 0\n\tvar hl = uintHighLow(number)\n\tbuffer.writeUInt32BE(hl[0], offset)\n\tbuffer.writeUInt32BE(hl[1], offset + 4)\n}\n\nint53.writeUInt64LE = function (number, buffer, offset) {\n\toffset = offset || 0\n\tvar hl = uintHighLow(number)\n\tbuffer.writeUInt32LE(hl[1], offset)\n\tbuffer.writeUInt32LE(hl[0], offset + 4)\n}\n\nmodule.exports = int53\n", "module.exports = encode\n\nvar MSB = 0x80\n  , REST = 0x7F\n  , MSBALL = ~REST\n  , INT = Math.pow(2, 31)\n\nfunction encode(num, out, offset) {\n  out = out || []\n  offset = offset || 0\n  var oldOffset = offset\n\n  while(num >= INT) {\n    out[offset++] = (num & 0xFF) | MSB\n    num /= 128\n  }\n  while(num & MSBALL) {\n    out[offset++] = (num & 0xFF) | MSB\n    num >>>= 7\n  }\n  out[offset] = num | 0\n  \n  encode.bytes = offset - oldOffset + 1\n  \n  return out\n}\n", "module.exports = read\n\nvar MSB = 0x80\n  , REST = 0x7F\n\nfunction read(buf, offset) {\n  var res    = 0\n    , offset = offset || 0\n    , shift  = 0\n    , counter = offset\n    , b\n    , l = buf.length\n\n  do {\n    if (counter >= l) {\n      read.bytes = 0\n      throw new RangeError('Could not decode varint')\n    }\n    b = buf[counter++]\n    res += shift < 28\n      ? (b & REST) << shift\n      : (b & REST) * Math.pow(2, shift)\n    shift += 7\n  } while (b >= MSB)\n\n  read.bytes = counter - offset\n\n  return res\n}\n", "\nvar N1 = Math.pow(2,  7)\nvar N2 = Math.pow(2, 14)\nvar N3 = Math.pow(2, 21)\nvar N4 = Math.pow(2, 28)\nvar N5 = Math.pow(2, 35)\nvar N6 = Math.pow(2, 42)\nvar N7 = Math.pow(2, 49)\nvar N8 = Math.pow(2, 56)\nvar N9 = Math.pow(2, 63)\n\nmodule.exports = function (value) {\n  return (\n    value < N1 ? 1\n  : value < N2 ? 2\n  : value < N3 ? 3\n  : value < N4 ? 4\n  : value < N5 ? 5\n  : value < N6 ? 6\n  : value < N7 ? 7\n  : value < N8 ? 8\n  : value < N9 ? 9\n  :              10\n  )\n}\n", "module.exports = {\n    encode: require('./encode.js')\n  , decode: require('./decode.js')\n  , encodingLength: require('./length.js')\n}\n", "'use strict';\n\n\nvar TYPED_OK =  (typeof Uint8Array !== 'undefined') &&\n                (typeof Uint16Array !== 'undefined') &&\n                (typeof Int32Array !== 'undefined');\n\nfunction _has(obj, key) {\n  return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nexports.assign = function (obj /*from1, from2, from3, ...*/) {\n  var sources = Array.prototype.slice.call(arguments, 1);\n  while (sources.length) {\n    var source = sources.shift();\n    if (!source) { continue; }\n\n    if (typeof source !== 'object') {\n      throw new TypeError(source + 'must be non-object');\n    }\n\n    for (var p in source) {\n      if (_has(source, p)) {\n        obj[p] = source[p];\n      }\n    }\n  }\n\n  return obj;\n};\n\n\n// reduce buffer size, avoiding mem copy\nexports.shrinkBuf = function (buf, size) {\n  if (buf.length === size) { return buf; }\n  if (buf.subarray) { return buf.subarray(0, size); }\n  buf.length = size;\n  return buf;\n};\n\n\nvar fnTyped = {\n  arraySet: function (dest, src, src_offs, len, dest_offs) {\n    if (src.subarray && dest.subarray) {\n      dest.set(src.subarray(src_offs, src_offs + len), dest_offs);\n      return;\n    }\n    // Fallback to ordinary array\n    for (var i = 0; i < len; i++) {\n      dest[dest_offs + i] = src[src_offs + i];\n    }\n  },\n  // Join array of chunks to single array.\n  flattenChunks: function (chunks) {\n    var i, l, len, pos, chunk, result;\n\n    // calculate data length\n    len = 0;\n    for (i = 0, l = chunks.length; i < l; i++) {\n      len += chunks[i].length;\n    }\n\n    // join chunks\n    result = new Uint8Array(len);\n    pos = 0;\n    for (i = 0, l = chunks.length; i < l; i++) {\n      chunk = chunks[i];\n      result.set(chunk, pos);\n      pos += chunk.length;\n    }\n\n    return result;\n  }\n};\n\nvar fnUntyped = {\n  arraySet: function (dest, src, src_offs, len, dest_offs) {\n    for (var i = 0; i < len; i++) {\n      dest[dest_offs + i] = src[src_offs + i];\n    }\n  },\n  // Join array of chunks to single array.\n  flattenChunks: function (chunks) {\n    return [].concat.apply([], chunks);\n  }\n};\n\n\n// Enable/Disable typed arrays use, for testing\n//\nexports.setTyped = function (on) {\n  if (on) {\n    exports.Buf8  = Uint8Array;\n    exports.Buf16 = Uint16Array;\n    exports.Buf32 = Int32Array;\n    exports.assign(exports, fnTyped);\n  } else {\n    exports.Buf8  = Array;\n    exports.Buf16 = Array;\n    exports.Buf32 = Array;\n    exports.assign(exports, fnUntyped);\n  }\n};\n\nexports.setTyped(TYPED_OK);\n", "'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\nvar utils = require('../utils/common');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//var Z_FILTERED          = 1;\n//var Z_HUFFMAN_ONLY      = 2;\n//var Z_RLE               = 3;\nvar Z_FIXED               = 4;\n//var Z_DEFAULT_STRATEGY  = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nvar Z_BINARY              = 0;\nvar Z_TEXT                = 1;\n//var Z_ASCII             = 1; // = Z_TEXT\nvar Z_UNKNOWN             = 2;\n\n/*============================================================================*/\n\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nvar STORED_BLOCK = 0;\nvar STATIC_TREES = 1;\nvar DYN_TREES    = 2;\n/* The three kinds of block type */\n\nvar MIN_MATCH    = 3;\nvar MAX_MATCH    = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nvar LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nvar LITERALS      = 256;\n/* number of literal bytes 0..255 */\n\nvar L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nvar D_CODES       = 30;\n/* number of distance codes */\n\nvar BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\n\nvar HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\n\nvar MAX_BITS      = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar Buf_size      = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nvar MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nvar END_BLOCK   = 256;\n/* end of block literal code */\n\nvar REP_3_6     = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nvar REPZ_3_10   = 17;\n/* repeat a zero length 3-10 times  (3 bits of repeat count) */\n\nvar REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times  (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nvar extra_lbits =   /* extra bits for each length code */\n  [0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0];\n\nvar extra_dbits =   /* extra bits for each distance code */\n  [0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13];\n\nvar extra_blbits =  /* extra bits for each bit length code */\n  [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7];\n\nvar bl_order =\n  [16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nvar DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nvar static_ltree  = new Array((L_CODES + 2) * 2);\nzero(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nvar static_dtree  = new Array(D_CODES * 2);\nzero(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nvar _dist_code    = new Array(DIST_CODE_LEN);\nzero(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nvar _length_code  = new Array(MAX_MATCH - MIN_MATCH + 1);\nzero(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nvar base_length   = new Array(LENGTH_CODES);\nzero(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nvar base_dist     = new Array(D_CODES);\nzero(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n  this.static_tree  = static_tree;  /* static tree or NULL */\n  this.extra_bits   = extra_bits;   /* extra bits for each code or NULL */\n  this.extra_base   = extra_base;   /* base index for extra_bits */\n  this.elems        = elems;        /* max number of elements in the tree */\n  this.max_length   = max_length;   /* max bit length for the codes */\n\n  // show if `static_tree` has data or dummy - needed for monomorphic objects\n  this.has_stree    = static_tree && static_tree.length;\n}\n\n\nvar static_l_desc;\nvar static_d_desc;\nvar static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n  this.dyn_tree = dyn_tree;     /* the dynamic tree */\n  this.max_code = 0;            /* largest code with non zero frequency */\n  this.stat_desc = stat_desc;   /* the corresponding static tree */\n}\n\n\n\nfunction d_code(dist) {\n  return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n}\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nfunction put_short(s, w) {\n//    put_byte(s, (uch)((w) & 0xff));\n//    put_byte(s, (uch)((ush)(w) >> 8));\n  s.pending_buf[s.pending++] = (w) & 0xff;\n  s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n}\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nfunction send_bits(s, value, length) {\n  if (s.bi_valid > (Buf_size - length)) {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    put_short(s, s.bi_buf);\n    s.bi_buf = value >> (Buf_size - s.bi_valid);\n    s.bi_valid += length - Buf_size;\n  } else {\n    s.bi_buf |= (value << s.bi_valid) & 0xffff;\n    s.bi_valid += length;\n  }\n}\n\n\nfunction send_code(s, c, tree) {\n  send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n}\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nfunction bi_reverse(code, len) {\n  var res = 0;\n  do {\n    res |= code & 1;\n    code >>>= 1;\n    res <<= 1;\n  } while (--len > 0);\n  return res >>> 1;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nfunction bi_flush(s) {\n  if (s.bi_valid === 16) {\n    put_short(s, s.bi_buf);\n    s.bi_buf = 0;\n    s.bi_valid = 0;\n\n  } else if (s.bi_valid >= 8) {\n    s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n    s.bi_buf >>= 8;\n    s.bi_valid -= 8;\n  }\n}\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n *    above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n *     array bl_count contains the frequencies for each bit length.\n *     The length opt_len is updated; static_len is also updated if stree is\n *     not null.\n */\nfunction gen_bitlen(s, desc)\n//    deflate_state *s;\n//    tree_desc *desc;    /* the tree descriptor */\n{\n  var tree            = desc.dyn_tree;\n  var max_code        = desc.max_code;\n  var stree           = desc.stat_desc.static_tree;\n  var has_stree       = desc.stat_desc.has_stree;\n  var extra           = desc.stat_desc.extra_bits;\n  var base            = desc.stat_desc.extra_base;\n  var max_length      = desc.stat_desc.max_length;\n  var h;              /* heap index */\n  var n, m;           /* iterate over the tree elements */\n  var bits;           /* bit length */\n  var xbits;          /* extra bits */\n  var f;              /* frequency */\n  var overflow = 0;   /* number of elements with bit length too large */\n\n  for (bits = 0; bits <= MAX_BITS; bits++) {\n    s.bl_count[bits] = 0;\n  }\n\n  /* In a first pass, compute the optimal bit lengths (which may\n   * overflow in the case of the bit length tree).\n   */\n  tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n  for (h = s.heap_max + 1; h < HEAP_SIZE; h++) {\n    n = s.heap[h];\n    bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n    if (bits > max_length) {\n      bits = max_length;\n      overflow++;\n    }\n    tree[n * 2 + 1]/*.Len*/ = bits;\n    /* We overwrite tree[n].Dad which is no longer needed */\n\n    if (n > max_code) { continue; } /* not a leaf node */\n\n    s.bl_count[bits]++;\n    xbits = 0;\n    if (n >= base) {\n      xbits = extra[n - base];\n    }\n    f = tree[n * 2]/*.Freq*/;\n    s.opt_len += f * (bits + xbits);\n    if (has_stree) {\n      s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n    }\n  }\n  if (overflow === 0) { return; }\n\n  // Trace((stderr,\"\\nbit length overflow\\n\"));\n  /* This happens for example on obj2 and pic of the Calgary corpus */\n\n  /* Find the first bit length which could increase: */\n  do {\n    bits = max_length - 1;\n    while (s.bl_count[bits] === 0) { bits--; }\n    s.bl_count[bits]--;      /* move one leaf down the tree */\n    s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n    s.bl_count[max_length]--;\n    /* The brother of the overflow item also moves one step up,\n     * but this does not affect bl_count[max_length]\n     */\n    overflow -= 2;\n  } while (overflow > 0);\n\n  /* Now recompute all bit lengths, scanning in increasing frequency.\n   * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n   * lengths instead of fixing only the wrong ones. This idea is taken\n   * from 'ar' written by Haruhiko Okumura.)\n   */\n  for (bits = max_length; bits !== 0; bits--) {\n    n = s.bl_count[bits];\n    while (n !== 0) {\n      m = s.heap[--h];\n      if (m > max_code) { continue; }\n      if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n        // Trace((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n        s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n        tree[m * 2 + 1]/*.Len*/ = bits;\n      }\n      n--;\n    }\n  }\n}\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n *     zero code length.\n */\nfunction gen_codes(tree, max_code, bl_count)\n//    ct_data *tree;             /* the tree to decorate */\n//    int max_code;              /* largest code with non zero frequency */\n//    ushf *bl_count;            /* number of codes at each bit length */\n{\n  var next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */\n  var code = 0;              /* running code value */\n  var bits;                  /* bit index */\n  var n;                     /* code index */\n\n  /* The distribution counts are first used to generate the code values\n   * without bit reversal.\n   */\n  for (bits = 1; bits <= MAX_BITS; bits++) {\n    next_code[bits] = code = (code + bl_count[bits - 1]) << 1;\n  }\n  /* Check that the bit counts in bl_count are consistent. The last code\n   * must be all ones.\n   */\n  //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n  //        \"inconsistent bit counts\");\n  //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n  for (n = 0;  n <= max_code; n++) {\n    var len = tree[n * 2 + 1]/*.Len*/;\n    if (len === 0) { continue; }\n    /* Now reverse the bits */\n    tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n    //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n    //     n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n  }\n}\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nfunction tr_static_init() {\n  var n;        /* iterates over tree elements */\n  var bits;     /* bit counter */\n  var length;   /* length value */\n  var code;     /* code value */\n  var dist;     /* distance index */\n  var bl_count = new Array(MAX_BITS + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  // do check in _tr_init()\n  //if (static_init_done) return;\n\n  /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n  static_l_desc.static_tree = static_ltree;\n  static_l_desc.extra_bits = extra_lbits;\n  static_d_desc.static_tree = static_dtree;\n  static_d_desc.extra_bits = extra_dbits;\n  static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n  /* Initialize the mapping length (0..255) -> length code (0..28) */\n  length = 0;\n  for (code = 0; code < LENGTH_CODES - 1; code++) {\n    base_length[code] = length;\n    for (n = 0; n < (1 << extra_lbits[code]); n++) {\n      _length_code[length++] = code;\n    }\n  }\n  //Assert (length == 256, \"tr_static_init: length != 256\");\n  /* Note that the length 255 (match length 258) can be represented\n   * in two different ways: code 284 + 5 bits or code 285, so we\n   * overwrite length_code[255] to use the best encoding:\n   */\n  _length_code[length - 1] = code;\n\n  /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n  dist = 0;\n  for (code = 0; code < 16; code++) {\n    base_dist[code] = dist;\n    for (n = 0; n < (1 << extra_dbits[code]); n++) {\n      _dist_code[dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: dist != 256\");\n  dist >>= 7; /* from now on, all distances are divided by 128 */\n  for (; code < D_CODES; code++) {\n    base_dist[code] = dist << 7;\n    for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n      _dist_code[256 + dist++] = code;\n    }\n  }\n  //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n  /* Construct the codes of the static literal tree */\n  for (bits = 0; bits <= MAX_BITS; bits++) {\n    bl_count[bits] = 0;\n  }\n\n  n = 0;\n  while (n <= 143) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  while (n <= 255) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 9;\n    n++;\n    bl_count[9]++;\n  }\n  while (n <= 279) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 7;\n    n++;\n    bl_count[7]++;\n  }\n  while (n <= 287) {\n    static_ltree[n * 2 + 1]/*.Len*/ = 8;\n    n++;\n    bl_count[8]++;\n  }\n  /* Codes 286 and 287 do not exist, but we must include them in the\n   * tree construction to get a canonical Huffman tree (longest code\n   * all ones)\n   */\n  gen_codes(static_ltree, L_CODES + 1, bl_count);\n\n  /* The static distance tree is trivial: */\n  for (n = 0; n < D_CODES; n++) {\n    static_dtree[n * 2 + 1]/*.Len*/ = 5;\n    static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n  }\n\n  // Now data ready and we can init static trees\n  static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS);\n  static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0,          D_CODES, MAX_BITS);\n  static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0,         BL_CODES, MAX_BL_BITS);\n\n  //static_init_done = true;\n}\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nfunction init_block(s) {\n  var n; /* iterates over tree elements */\n\n  /* Initialize the trees. */\n  for (n = 0; n < L_CODES;  n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < D_CODES;  n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n  for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n  s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n  s.opt_len = s.static_len = 0;\n  s.last_lit = s.matches = 0;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nfunction bi_windup(s)\n{\n  if (s.bi_valid > 8) {\n    put_short(s, s.bi_buf);\n  } else if (s.bi_valid > 0) {\n    //put_byte(s, (Byte)s->bi_buf);\n    s.pending_buf[s.pending++] = s.bi_buf;\n  }\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n}\n\n/* ===========================================================================\n * Copy a stored block, storing first the length and its\n * one's complement if requested.\n */\nfunction copy_block(s, buf, len, header)\n//DeflateState *s;\n//charf    *buf;    /* the input data */\n//unsigned len;     /* its length */\n//int      header;  /* true if block header must be written */\n{\n  bi_windup(s);        /* align on byte boundary */\n\n  if (header) {\n    put_short(s, len);\n    put_short(s, ~len);\n  }\n//  while (len--) {\n//    put_byte(s, *buf++);\n//  }\n  utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);\n  s.pending += len;\n}\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nfunction smaller(tree, n, m, depth) {\n  var _n2 = n * 2;\n  var _m2 = m * 2;\n  return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n         (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n}\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nfunction pqdownheap(s, tree, k)\n//    deflate_state *s;\n//    ct_data *tree;  /* the tree to restore */\n//    int k;               /* node to move down */\n{\n  var v = s.heap[k];\n  var j = k << 1;  /* left son of k */\n  while (j <= s.heap_len) {\n    /* Set j to the smallest of the two sons: */\n    if (j < s.heap_len &&\n      smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n      j++;\n    }\n    /* Exit if v is smaller than both sons */\n    if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n    /* Exchange v with the smallest son */\n    s.heap[k] = s.heap[j];\n    k = j;\n\n    /* And continue down the tree, setting j to the left son of k */\n    j <<= 1;\n  }\n  s.heap[k] = v;\n}\n\n\n// inlined manually\n// var SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nfunction compress_block(s, ltree, dtree)\n//    deflate_state *s;\n//    const ct_data *ltree; /* literal tree */\n//    const ct_data *dtree; /* distance tree */\n{\n  var dist;           /* distance of matched string */\n  var lc;             /* match length or unmatched char (if dist == 0) */\n  var lx = 0;         /* running index in l_buf */\n  var code;           /* the code to send */\n  var extra;          /* number of extra bits to send */\n\n  if (s.last_lit !== 0) {\n    do {\n      dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]);\n      lc = s.pending_buf[s.l_buf + lx];\n      lx++;\n\n      if (dist === 0) {\n        send_code(s, lc, ltree); /* send a literal byte */\n        //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n      } else {\n        /* Here, lc is the match length - MIN_MATCH */\n        code = _length_code[lc];\n        send_code(s, code + LITERALS + 1, ltree); /* send the length code */\n        extra = extra_lbits[code];\n        if (extra !== 0) {\n          lc -= base_length[code];\n          send_bits(s, lc, extra);       /* send the extra length bits */\n        }\n        dist--; /* dist is now the match distance - 1 */\n        code = d_code(dist);\n        //Assert (code < D_CODES, \"bad d_code\");\n\n        send_code(s, code, dtree);       /* send the distance code */\n        extra = extra_dbits[code];\n        if (extra !== 0) {\n          dist -= base_dist[code];\n          send_bits(s, dist, extra);   /* send the extra distance bits */\n        }\n      } /* literal or match pair ? */\n\n      /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */\n      //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,\n      //       \"pendingBuf overflow\");\n\n    } while (lx < s.last_lit);\n  }\n\n  send_code(s, END_BLOCK, ltree);\n}\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n *     and corresponding code. The length opt_len is updated; static_len is\n *     also updated if stree is not null. The field max_code is set.\n */\nfunction build_tree(s, desc)\n//    deflate_state *s;\n//    tree_desc *desc; /* the tree descriptor */\n{\n  var tree     = desc.dyn_tree;\n  var stree    = desc.stat_desc.static_tree;\n  var has_stree = desc.stat_desc.has_stree;\n  var elems    = desc.stat_desc.elems;\n  var n, m;          /* iterate over heap elements */\n  var max_code = -1; /* largest code with non zero frequency */\n  var node;          /* new node being created */\n\n  /* Construct the initial heap, with least frequent element in\n   * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n   * heap[0] is not used.\n   */\n  s.heap_len = 0;\n  s.heap_max = HEAP_SIZE;\n\n  for (n = 0; n < elems; n++) {\n    if (tree[n * 2]/*.Freq*/ !== 0) {\n      s.heap[++s.heap_len] = max_code = n;\n      s.depth[n] = 0;\n\n    } else {\n      tree[n * 2 + 1]/*.Len*/ = 0;\n    }\n  }\n\n  /* The pkzip format requires that at least one distance code exists,\n   * and that at least one bit should be sent even if there is only one\n   * possible code. So to avoid special checks later on we force at least\n   * two codes of non zero frequency.\n   */\n  while (s.heap_len < 2) {\n    node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n    tree[node * 2]/*.Freq*/ = 1;\n    s.depth[node] = 0;\n    s.opt_len--;\n\n    if (has_stree) {\n      s.static_len -= stree[node * 2 + 1]/*.Len*/;\n    }\n    /* node is 0 or 1 so it does not have extra bits */\n  }\n  desc.max_code = max_code;\n\n  /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n   * establish sub-heaps of increasing lengths:\n   */\n  for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n  /* Construct the Huffman tree by repeatedly combining the least two\n   * frequent nodes.\n   */\n  node = elems;              /* next internal node of the tree */\n  do {\n    //pqremove(s, tree, n);  /* n = node of least frequency */\n    /*** pqremove ***/\n    n = s.heap[1/*SMALLEST*/];\n    s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n    /***/\n\n    m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n    s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n    s.heap[--s.heap_max] = m;\n\n    /* Create a new node father of n and m */\n    tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n    s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n    tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n    /* and insert the new node in the heap */\n    s.heap[1/*SMALLEST*/] = node++;\n    pqdownheap(s, tree, 1/*SMALLEST*/);\n\n  } while (s.heap_len >= 2);\n\n  s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n  /* At this point, the fields freq and dad are set. We can now\n   * generate the bit lengths.\n   */\n  gen_bitlen(s, desc);\n\n  /* The field len is now set, we can generate the bit codes */\n  gen_codes(tree, max_code, s.bl_count);\n}\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nfunction scan_tree(s, tree, max_code)\n//    deflate_state *s;\n//    ct_data *tree;   /* the tree to be scanned */\n//    int max_code;    /* and its largest code of non zero frequency */\n{\n  var n;                     /* iterates over all tree elements */\n  var prevlen = -1;          /* last emitted length */\n  var curlen;                /* length of current code */\n\n  var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  var count = 0;             /* repeat count of the current code */\n  var max_count = 7;         /* max repeat count */\n  var min_count = 4;         /* min repeat count */\n\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n  tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n    } else if (curlen !== 0) {\n\n      if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n      s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n    } else if (count <= 10) {\n      s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n    } else {\n      s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n    }\n\n    count = 0;\n    prevlen = curlen;\n\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n}\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nfunction send_tree(s, tree, max_code)\n//    deflate_state *s;\n//    ct_data *tree; /* the tree to be scanned */\n//    int max_code;       /* and its largest code of non zero frequency */\n{\n  var n;                     /* iterates over all tree elements */\n  var prevlen = -1;          /* last emitted length */\n  var curlen;                /* length of current code */\n\n  var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n  var count = 0;             /* repeat count of the current code */\n  var max_count = 7;         /* max repeat count */\n  var min_count = 4;         /* min repeat count */\n\n  /* tree[max_code+1].Len = -1; */  /* guard already set */\n  if (nextlen === 0) {\n    max_count = 138;\n    min_count = 3;\n  }\n\n  for (n = 0; n <= max_code; n++) {\n    curlen = nextlen;\n    nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n    if (++count < max_count && curlen === nextlen) {\n      continue;\n\n    } else if (count < min_count) {\n      do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n    } else if (curlen !== 0) {\n      if (curlen !== prevlen) {\n        send_code(s, curlen, s.bl_tree);\n        count--;\n      }\n      //Assert(count >= 3 && count <= 6, \" 3_6?\");\n      send_code(s, REP_3_6, s.bl_tree);\n      send_bits(s, count - 3, 2);\n\n    } else if (count <= 10) {\n      send_code(s, REPZ_3_10, s.bl_tree);\n      send_bits(s, count - 3, 3);\n\n    } else {\n      send_code(s, REPZ_11_138, s.bl_tree);\n      send_bits(s, count - 11, 7);\n    }\n\n    count = 0;\n    prevlen = curlen;\n    if (nextlen === 0) {\n      max_count = 138;\n      min_count = 3;\n\n    } else if (curlen === nextlen) {\n      max_count = 6;\n      min_count = 3;\n\n    } else {\n      max_count = 7;\n      min_count = 4;\n    }\n  }\n}\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nfunction build_bl_tree(s) {\n  var max_blindex;  /* index of last bit length code of non zero freq */\n\n  /* Determine the bit length frequencies for literal and distance trees */\n  scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n  scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n  /* Build the bit length tree: */\n  build_tree(s, s.bl_desc);\n  /* opt_len now includes the length of the tree representations, except\n   * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n   */\n\n  /* Determine the number of bit length codes to send. The pkzip format\n   * requires that at least 4 bit length codes be sent. (appnote.txt says\n   * 3 but the actual value used is 4.)\n   */\n  for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n    if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n      break;\n    }\n  }\n  /* Update opt_len to include the bit length tree and counts */\n  s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n  //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n  //        s->opt_len, s->static_len));\n\n  return max_blindex;\n}\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nfunction send_all_trees(s, lcodes, dcodes, blcodes)\n//    deflate_state *s;\n//    int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n  var rank;                    /* index in bl_order */\n\n  //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n  //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n  //        \"too many codes\");\n  //Tracev((stderr, \"\\nbl counts: \"));\n  send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n  send_bits(s, dcodes - 1,   5);\n  send_bits(s, blcodes - 4,  4); /* not -3 as stated in appnote.txt */\n  for (rank = 0; rank < blcodes; rank++) {\n    //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n    send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n  }\n  //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n  //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n  send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n  //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n *    a) There are no non-portable control characters belonging to the\n *       \"black list\" (0..6, 14..25, 28..31).\n *    b) There is at least one printable character belonging to the\n *       \"white list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n *   \"gray list\" that is ignored in this detection algorithm:\n *   (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nfunction detect_data_type(s) {\n  /* black_mask is the bit mask of black-listed bytes\n   * set bits 0..6, 14..25, and 28..31\n   * 0xf3ffc07f = binary 11110011111111111100000001111111\n   */\n  var black_mask = 0xf3ffc07f;\n  var n;\n\n  /* Check for non-textual (\"black-listed\") bytes. */\n  for (n = 0; n <= 31; n++, black_mask >>>= 1) {\n    if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n      return Z_BINARY;\n    }\n  }\n\n  /* Check for textual (\"white-listed\") bytes. */\n  if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n      s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n    return Z_TEXT;\n  }\n  for (n = 32; n < LITERALS; n++) {\n    if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n      return Z_TEXT;\n    }\n  }\n\n  /* There are no \"black-listed\" or \"white-listed\" bytes:\n   * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n   */\n  return Z_BINARY;\n}\n\n\nvar static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nfunction _tr_init(s)\n{\n\n  if (!static_init_done) {\n    tr_static_init();\n    static_init_done = true;\n  }\n\n  s.l_desc  = new TreeDesc(s.dyn_ltree, static_l_desc);\n  s.d_desc  = new TreeDesc(s.dyn_dtree, static_d_desc);\n  s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n  s.bi_buf = 0;\n  s.bi_valid = 0;\n\n  /* Initialize the first block of the first file: */\n  init_block(s);\n}\n\n\n/* ===========================================================================\n * Send a stored block\n */\nfunction _tr_stored_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf;       /* input block */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n{\n  send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3);    /* send block type */\n  copy_block(s, buf, stored_len, true); /* with header */\n}\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nfunction _tr_align(s) {\n  send_bits(s, STATIC_TREES << 1, 3);\n  send_code(s, END_BLOCK, static_ltree);\n  bi_flush(s);\n}\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and output the encoded block to the zip file.\n */\nfunction _tr_flush_block(s, buf, stored_len, last)\n//DeflateState *s;\n//charf *buf;       /* input block, or NULL if too old */\n//ulg stored_len;   /* length of input block */\n//int last;         /* one if this is the last block for a file */\n{\n  var opt_lenb, static_lenb;  /* opt_len and static_len in bytes */\n  var max_blindex = 0;        /* index of last bit length code of non zero freq */\n\n  /* Build the Huffman trees unless a stored block is forced */\n  if (s.level > 0) {\n\n    /* Check if the file is binary or text */\n    if (s.strm.data_type === Z_UNKNOWN) {\n      s.strm.data_type = detect_data_type(s);\n    }\n\n    /* Construct the literal and distance trees */\n    build_tree(s, s.l_desc);\n    // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n\n    build_tree(s, s.d_desc);\n    // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n    //        s->static_len));\n    /* At this point, opt_len and static_len are the total bit lengths of\n     * the compressed block data, excluding the tree representations.\n     */\n\n    /* Build the bit length tree for the above two trees, and get the index\n     * in bl_order of the last bit length code to send.\n     */\n    max_blindex = build_bl_tree(s);\n\n    /* Determine the best encoding. Compute the block lengths in bytes. */\n    opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n    static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n    // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n    //        opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n    //        s->last_lit));\n\n    if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n  } else {\n    // Assert(buf != (char*)0, \"lost buf\");\n    opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n  }\n\n  if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n    /* 4: two words for the lengths */\n\n    /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n     * Otherwise we can't have processed more than WSIZE input bytes since\n     * the last block flush, because compression would have been\n     * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n     * transform a block into a stored block.\n     */\n    _tr_stored_block(s, buf, stored_len, last);\n\n  } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n    send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n    compress_block(s, static_ltree, static_dtree);\n\n  } else {\n    send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n    send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n    compress_block(s, s.dyn_ltree, s.dyn_dtree);\n  }\n  // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n  /* The above check is made mod 2^32, for files larger than 512 MB\n   * and uLong implemented on 32 bits.\n   */\n  init_block(s);\n\n  if (last) {\n    bi_windup(s);\n  }\n  // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n  //       s->compressed_len-7*last));\n}\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nfunction _tr_tally(s, dist, lc)\n//    deflate_state *s;\n//    unsigned dist;  /* distance of matched string */\n//    unsigned lc;    /* match length-MIN_MATCH or unmatched char (if dist==0) */\n{\n  //var out_length, in_length, dcode;\n\n  s.pending_buf[s.d_buf + s.last_lit * 2]     = (dist >>> 8) & 0xff;\n  s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff;\n\n  s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff;\n  s.last_lit++;\n\n  if (dist === 0) {\n    /* lc is the unmatched char */\n    s.dyn_ltree[lc * 2]/*.Freq*/++;\n  } else {\n    s.matches++;\n    /* Here, lc is the match length - MIN_MATCH */\n    dist--;             /* dist = match distance - 1 */\n    //Assert((ush)dist < (ush)MAX_DIST(s) &&\n    //       (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n    //       (ush)d_code(dist) < (ush)D_CODES,  \"_tr_tally: bad match\");\n\n    s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++;\n    s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n  }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n\n//#ifdef TRUNCATE_BLOCK\n//  /* Try to guess if it is profitable to stop the current block here */\n//  if ((s.last_lit & 0x1fff) === 0 && s.level > 2) {\n//    /* Compute an upper bound for the compressed length */\n//    out_length = s.last_lit*8;\n//    in_length = s.strstart - s.block_start;\n//\n//    for (dcode = 0; dcode < D_CODES; dcode++) {\n//      out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]);\n//    }\n//    out_length >>>= 3;\n//    //Tracev((stderr,\"\\nlast_lit %u, in %ld, out ~%ld(%ld%%) \",\n//    //       s->last_lit, in_length, out_length,\n//    //       100L - out_length*100L/in_length));\n//    if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) {\n//      return true;\n//    }\n//  }\n//#endif\n\n  return (s.last_lit === s.lit_bufsize - 1);\n  /* We avoid equality with lit_bufsize because of wraparound at 64K\n   * on 16 bit machines and because stored blocks are restricted to\n   * 64K-1 bytes.\n   */\n}\n\nexports._tr_init  = _tr_init;\nexports._tr_stored_block = _tr_stored_block;\nexports._tr_flush_block  = _tr_flush_block;\nexports._tr_tally = _tr_tally;\nexports._tr_align = _tr_align;\n", "'use strict';\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction adler32(adler, buf, len, pos) {\n  var s1 = (adler & 0xffff) |0,\n      s2 = ((adler >>> 16) & 0xffff) |0,\n      n = 0;\n\n  while (len !== 0) {\n    // Set limit ~ twice less than 5552, to keep\n    // s2 in 31-bits, because we force signed ints.\n    // in other case %= will fail.\n    n = len > 2000 ? 2000 : len;\n    len -= n;\n\n    do {\n      s1 = (s1 + buf[pos++]) |0;\n      s2 = (s2 + s1) |0;\n    } while (--n);\n\n    s1 %= 65521;\n    s2 %= 65521;\n  }\n\n  return (s1 | (s2 << 16)) |0;\n}\n\n\nmodule.exports = adler32;\n", "'use strict';\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nfunction makeTable() {\n  var c, table = [];\n\n  for (var n = 0; n < 256; n++) {\n    c = n;\n    for (var k = 0; k < 8; k++) {\n      c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n    }\n    table[n] = c;\n  }\n\n  return table;\n}\n\n// Create table on load. Just 255 signed longs. Not a problem.\nvar crcTable = makeTable();\n\n\nfunction crc32(crc, buf, len, pos) {\n  var t = crcTable,\n      end = pos + len;\n\n  crc ^= -1;\n\n  for (var i = pos; i < end; i++) {\n    crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n  }\n\n  return (crc ^ (-1)); // >>> 0;\n}\n\n\nmodule.exports = crc32;\n", "'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n  2:      'need dictionary',     /* Z_NEED_DICT       2  */\n  1:      'stream end',          /* Z_STREAM_END      1  */\n  0:      '',                    /* Z_OK              0  */\n  '-1':   'file error',          /* Z_ERRNO         (-1) */\n  '-2':   'stream error',        /* Z_STREAM_ERROR  (-2) */\n  '-3':   'data error',          /* Z_DATA_ERROR    (-3) */\n  '-4':   'insufficient memory', /* Z_MEM_ERROR     (-4) */\n  '-5':   'buffer error',        /* Z_BUF_ERROR     (-5) */\n  '-6':   'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n", "'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils   = require('../utils/common');\nvar trees   = require('./trees');\nvar adler32 = require('./adler32');\nvar crc32   = require('./crc32');\nvar msg     = require('./messages');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\nvar Z_NO_FLUSH      = 0;\nvar Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH    = 2;\nvar Z_FULL_FLUSH    = 3;\nvar Z_FINISH        = 4;\nvar Z_BLOCK         = 5;\n//var Z_TREES         = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK            = 0;\nvar Z_STREAM_END    = 1;\n//var Z_NEED_DICT     = 2;\n//var Z_ERRNO         = -1;\nvar Z_STREAM_ERROR  = -2;\nvar Z_DATA_ERROR    = -3;\n//var Z_MEM_ERROR     = -4;\nvar Z_BUF_ERROR     = -5;\n//var Z_VERSION_ERROR = -6;\n\n\n/* compression levels */\n//var Z_NO_COMPRESSION      = 0;\n//var Z_BEST_SPEED          = 1;\n//var Z_BEST_COMPRESSION    = 9;\nvar Z_DEFAULT_COMPRESSION = -1;\n\n\nvar Z_FILTERED            = 1;\nvar Z_HUFFMAN_ONLY        = 2;\nvar Z_RLE                 = 3;\nvar Z_FIXED               = 4;\nvar Z_DEFAULT_STRATEGY    = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\n//var Z_BINARY              = 0;\n//var Z_TEXT                = 1;\n//var Z_ASCII               = 1; // = Z_TEXT\nvar Z_UNKNOWN             = 2;\n\n\n/* The deflate compression method */\nvar Z_DEFLATED  = 8;\n\n/*============================================================================*/\n\n\nvar MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_MEM_LEVEL = 8;\n\n\nvar LENGTH_CODES  = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nvar LITERALS      = 256;\n/* number of literal bytes 0..255 */\nvar L_CODES       = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nvar D_CODES       = 30;\n/* number of distance codes */\nvar BL_CODES      = 19;\n/* number of codes used to transfer the bit lengths */\nvar HEAP_SIZE     = 2 * L_CODES + 1;\n/* maximum heap size */\nvar MAX_BITS  = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\nvar MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nvar PRESET_DICT = 0x20;\n\nvar INIT_STATE = 42;\nvar EXTRA_STATE = 69;\nvar NAME_STATE = 73;\nvar COMMENT_STATE = 91;\nvar HCRC_STATE = 103;\nvar BUSY_STATE = 113;\nvar FINISH_STATE = 666;\n\nvar BS_NEED_MORE      = 1; /* block not completed, need more input or more output */\nvar BS_BLOCK_DONE     = 2; /* block flush performed */\nvar BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nvar BS_FINISH_DONE    = 4; /* finish done, accept no more input or output */\n\nvar OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nfunction err(strm, errorCode) {\n  strm.msg = msg[errorCode];\n  return errorCode;\n}\n\nfunction rank(f) {\n  return ((f) << 1) - ((f) > 4 ? 9 : 0);\n}\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output goes\n * through this function so some applications may wish to modify it\n * to avoid allocating a large strm->output buffer and copying into it.\n * (See also read_buf()).\n */\nfunction flush_pending(strm) {\n  var s = strm.state;\n\n  //_tr_flush_bits(s);\n  var len = s.pending;\n  if (len > strm.avail_out) {\n    len = strm.avail_out;\n  }\n  if (len === 0) { return; }\n\n  utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out);\n  strm.next_out += len;\n  s.pending_out += len;\n  strm.total_out += len;\n  strm.avail_out -= len;\n  s.pending -= len;\n  if (s.pending === 0) {\n    s.pending_out = 0;\n  }\n}\n\n\nfunction flush_block_only(s, last) {\n  trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n  s.block_start = s.strstart;\n  flush_pending(s.strm);\n}\n\n\nfunction put_byte(s, b) {\n  s.pending_buf[s.pending++] = b;\n}\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nfunction putShortMSB(s, b) {\n//  put_byte(s, (Byte)(b >> 8));\n//  put_byte(s, (Byte)(b & 0xff));\n  s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n  s.pending_buf[s.pending++] = b & 0xff;\n}\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read.  All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nfunction read_buf(strm, buf, start, size) {\n  var len = strm.avail_in;\n\n  if (len > size) { len = size; }\n  if (len === 0) { return 0; }\n\n  strm.avail_in -= len;\n\n  // zmemcpy(buf, strm->next_in, len);\n  utils.arraySet(buf, strm.input, strm.next_in, len, start);\n  if (strm.state.wrap === 1) {\n    strm.adler = adler32(strm.adler, buf, len, start);\n  }\n\n  else if (strm.state.wrap === 2) {\n    strm.adler = crc32(strm.adler, buf, len, start);\n  }\n\n  strm.next_in += len;\n  strm.total_in += len;\n\n  return len;\n}\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nfunction longest_match(s, cur_match) {\n  var chain_length = s.max_chain_length;      /* max hash chain length */\n  var scan = s.strstart; /* current string */\n  var match;                       /* matched string */\n  var len;                           /* length of current match */\n  var best_len = s.prev_length;              /* best match length so far */\n  var nice_match = s.nice_match;             /* stop if match long enough */\n  var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n      s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n  var _win = s.window; // shortcut\n\n  var wmask = s.w_mask;\n  var prev  = s.prev;\n\n  /* Stop when cur_match becomes <= limit. To simplify the code,\n   * we prevent matches with the string of window index 0.\n   */\n\n  var strend = s.strstart + MAX_MATCH;\n  var scan_end1  = _win[scan + best_len - 1];\n  var scan_end   = _win[scan + best_len];\n\n  /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n   * It is easy to get rid of this optimization if necessary.\n   */\n  // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n  /* Do not waste too much time if we already have a good match: */\n  if (s.prev_length >= s.good_match) {\n    chain_length >>= 2;\n  }\n  /* Do not look for matches beyond the end of the input. This is necessary\n   * to make deflate deterministic.\n   */\n  if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n  // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n  do {\n    // Assert(cur_match < s->strstart, \"no future\");\n    match = cur_match;\n\n    /* Skip to next match if the match length cannot increase\n     * or if the match length is less than 2.  Note that the checks below\n     * for insufficient lookahead only occur occasionally for performance\n     * reasons.  Therefore uninitialized memory will be accessed, and\n     * conditional jumps will be made that depend on those values.\n     * However the length of the match is limited to the lookahead, so\n     * the output of deflate is not affected by the uninitialized values.\n     */\n\n    if (_win[match + best_len]     !== scan_end  ||\n        _win[match + best_len - 1] !== scan_end1 ||\n        _win[match]                !== _win[scan] ||\n        _win[++match]              !== _win[scan + 1]) {\n      continue;\n    }\n\n    /* The check at best_len-1 can be removed because it will be made\n     * again later. (This heuristic is not always a win.)\n     * It is not necessary to compare scan[2] and match[2] since they\n     * are always equal when the other bytes match, given that\n     * the hash keys are equal and that HASH_BITS >= 8.\n     */\n    scan += 2;\n    match++;\n    // Assert(*scan == *match, \"match[2]?\");\n\n    /* We check for insufficient lookahead only every 8th comparison;\n     * the 256th check will be made at strstart+258.\n     */\n    do {\n      /*jshint noempty:false*/\n    } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n             scan < strend);\n\n    // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n    len = MAX_MATCH - (strend - scan);\n    scan = strend - MAX_MATCH;\n\n    if (len > best_len) {\n      s.match_start = cur_match;\n      best_len = len;\n      if (len >= nice_match) {\n        break;\n      }\n      scan_end1  = _win[scan + best_len - 1];\n      scan_end   = _win[scan + best_len];\n    }\n  } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n  if (best_len <= s.lookahead) {\n    return best_len;\n  }\n  return s.lookahead;\n}\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n *    At least one byte has been read, or avail_in == 0; reads are\n *    performed for at least two bytes (required for the zip translate_eol\n *    option -- not supported here).\n */\nfunction fill_window(s) {\n  var _w_size = s.w_size;\n  var p, n, m, more, str;\n\n  //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n  do {\n    more = s.window_size - s.lookahead - s.strstart;\n\n    // JS ints have 32 bit, block below not needed\n    /* Deal with !@#$% 64K limit: */\n    //if (sizeof(int) <= 2) {\n    //    if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n    //        more = wsize;\n    //\n    //  } else if (more == (unsigned)(-1)) {\n    //        /* Very unlikely, but possible on 16 bit machine if\n    //         * strstart == 0 && lookahead == 1 (input done a byte at time)\n    //         */\n    //        more--;\n    //    }\n    //}\n\n\n    /* If the window is almost full and there is insufficient lookahead,\n     * move the upper half to the lower one to make room in the upper half.\n     */\n    if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n      utils.arraySet(s.window, s.window, _w_size, _w_size, 0);\n      s.match_start -= _w_size;\n      s.strstart -= _w_size;\n      /* we now have strstart >= MAX_DIST */\n      s.block_start -= _w_size;\n\n      /* Slide the hash table (could be avoided with 32 bit values\n       at the expense of memory usage). We slide even when level == 0\n       to keep the hash table consistent if we switch back to level > 0\n       later. (Using level 0 permanently is not an optimal usage of\n       zlib, so we don't care about this pathological case.)\n       */\n\n      n = s.hash_size;\n      p = n;\n      do {\n        m = s.head[--p];\n        s.head[p] = (m >= _w_size ? m - _w_size : 0);\n      } while (--n);\n\n      n = _w_size;\n      p = n;\n      do {\n        m = s.prev[--p];\n        s.prev[p] = (m >= _w_size ? m - _w_size : 0);\n        /* If n is not on any hash chain, prev[n] is garbage but\n         * its value will never be used.\n         */\n      } while (--n);\n\n      more += _w_size;\n    }\n    if (s.strm.avail_in === 0) {\n      break;\n    }\n\n    /* If there was no sliding:\n     *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n     *    more == window_size - lookahead - strstart\n     * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n     * => more >= window_size - 2*WSIZE + 2\n     * In the BIG_MEM or MMAP case (not yet supported),\n     *   window_size == input_size + MIN_LOOKAHEAD  &&\n     *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n     * Otherwise, window_size == 2*WSIZE so more >= 2.\n     * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n     */\n    //Assert(more >= 2, \"more < 2\");\n    n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n    s.lookahead += n;\n\n    /* Initialize the hash value now that we have some input: */\n    if (s.lookahead + s.insert >= MIN_MATCH) {\n      str = s.strstart - s.insert;\n      s.ins_h = s.window[str];\n\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;\n//#if MIN_MATCH != 3\n//        Call update_hash() MIN_MATCH-3 more times\n//#endif\n      while (s.insert) {\n        /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n        s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\n\n        s.prev[str & s.w_mask] = s.head[s.ins_h];\n        s.head[s.ins_h] = str;\n        str++;\n        s.insert--;\n        if (s.lookahead + s.insert < MIN_MATCH) {\n          break;\n        }\n      }\n    }\n    /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n     * but this is not important since only literal bytes will be emitted.\n     */\n\n  } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n  /* If the WIN_INIT bytes after the end of the current data have never been\n   * written, then zero those bytes in order to avoid memory check reports of\n   * the use of uninitialized (or uninitialised as Julian writes) bytes by\n   * the longest match routines.  Update the high water mark for the next\n   * time through here.  WIN_INIT is set to MAX_MATCH since the longest match\n   * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n   */\n//  if (s.high_water < s.window_size) {\n//    var curr = s.strstart + s.lookahead;\n//    var init = 0;\n//\n//    if (s.high_water < curr) {\n//      /* Previous high water mark below current data -- zero WIN_INIT\n//       * bytes or up to end of window, whichever is less.\n//       */\n//      init = s.window_size - curr;\n//      if (init > WIN_INIT)\n//        init = WIN_INIT;\n//      zmemzero(s->window + curr, (unsigned)init);\n//      s->high_water = curr + init;\n//    }\n//    else if (s->high_water < (ulg)curr + WIN_INIT) {\n//      /* High water mark at or above current data, but below current data\n//       * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n//       * to end of window, whichever is less.\n//       */\n//      init = (ulg)curr + WIN_INIT - s->high_water;\n//      if (init > s->window_size - s->high_water)\n//        init = s->window_size - s->high_water;\n//      zmemzero(s->window + s->high_water, (unsigned)init);\n//      s->high_water += init;\n//    }\n//  }\n//\n//  Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n//    \"not enough room for search\");\n}\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n * This function does not insert new strings in the dictionary since\n * uncompressible data is probably not useful. This function is used\n * only for the level=0 compression option.\n * NOTE: this function should be optimized to avoid extra copying from\n * window to pending_buf.\n */\nfunction deflate_stored(s, flush) {\n  /* Stored blocks are limited to 0xffff bytes, pending_buf is limited\n   * to pending_buf_size, and each stored block has a 5 byte header:\n   */\n  var max_block_size = 0xffff;\n\n  if (max_block_size > s.pending_buf_size - 5) {\n    max_block_size = s.pending_buf_size - 5;\n  }\n\n  /* Copy as much as possible from input to output: */\n  for (;;) {\n    /* Fill the window as much as possible: */\n    if (s.lookahead <= 1) {\n\n      //Assert(s->strstart < s->w_size+MAX_DIST(s) ||\n      //  s->block_start >= (long)s->w_size, \"slide too late\");\n//      if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) ||\n//        s.block_start >= s.w_size)) {\n//        throw  new Error(\"slide too late\");\n//      }\n\n      fill_window(s);\n      if (s.lookahead === 0 && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n\n      if (s.lookahead === 0) {\n        break;\n      }\n      /* flush the current block */\n    }\n    //Assert(s->block_start >= 0L, \"block gone\");\n//    if (s.block_start < 0) throw new Error(\"block gone\");\n\n    s.strstart += s.lookahead;\n    s.lookahead = 0;\n\n    /* Emit a stored block if pending_buf will be full: */\n    var max_start = s.block_start + max_block_size;\n\n    if (s.strstart === 0 || s.strstart >= max_start) {\n      /* strstart == 0 is possible when wraparound on 16-bit machine */\n      s.lookahead = s.strstart - max_start;\n      s.strstart = max_start;\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n\n\n    }\n    /* Flush if we may have to slide, otherwise block_start may become\n     * negative and the data will be gone:\n     */\n    if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n\n  s.insert = 0;\n\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n\n  if (s.strstart > s.block_start) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_NEED_MORE;\n}\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nfunction deflate_fast(s, flush) {\n  var hash_head;        /* head of the hash chain */\n  var bflush;           /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) {\n        break; /* flush the current block */\n      }\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     * At this point we have always match_length < MIN_MATCH\n     */\n    if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n    }\n    if (s.match_length >= MIN_MATCH) {\n      // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n      /*** _tr_tally_dist(s, s.strstart - s.match_start,\n                     s.match_length - MIN_MATCH, bflush); ***/\n      bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n\n      /* Insert new strings in the hash table only if the match length\n       * is not too large. This saves time but degrades compression.\n       */\n      if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n        s.match_length--; /* string at strstart already in table */\n        do {\n          s.strstart++;\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n          /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n           * always MIN_MATCH bytes ahead.\n           */\n        } while (--s.match_length !== 0);\n        s.strstart++;\n      } else\n      {\n        s.strstart += s.match_length;\n        s.match_length = 0;\n        s.ins_h = s.window[s.strstart];\n        /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n        s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;\n\n//#if MIN_MATCH != 3\n//                Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n        /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n         * matter since it will be recomputed at next deflate call.\n         */\n      }\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n}\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nfunction deflate_slow(s, flush) {\n  var hash_head;          /* head of hash chain */\n  var bflush;              /* set if current block must be flushed */\n\n  var max_insert;\n\n  /* Process the input block. */\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the next match, plus MIN_MATCH bytes to insert the\n     * string following the next match.\n     */\n    if (s.lookahead < MIN_LOOKAHEAD) {\n      fill_window(s);\n      if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* Insert the string window[strstart .. strstart+2] in the\n     * dictionary, and set hash_head to the head of the hash chain:\n     */\n    hash_head = 0/*NIL*/;\n    if (s.lookahead >= MIN_MATCH) {\n      /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n      hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n      s.head[s.ins_h] = s.strstart;\n      /***/\n    }\n\n    /* Find the longest match, discarding those <= prev_length.\n     */\n    s.prev_length = s.match_length;\n    s.prev_match = s.match_start;\n    s.match_length = MIN_MATCH - 1;\n\n    if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n        s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n      /* To simplify the code, we prevent matches with the string\n       * of window index 0 (in particular we have to avoid a match\n       * of the string with itself at the start of the input file).\n       */\n      s.match_length = longest_match(s, hash_head);\n      /* longest_match() sets match_start */\n\n      if (s.match_length <= 5 &&\n         (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n        /* If prev_match is also MIN_MATCH, match_start is garbage\n         * but we will ignore the current match anyway.\n         */\n        s.match_length = MIN_MATCH - 1;\n      }\n    }\n    /* If there was a match at the previous step and the current\n     * match is not better, output the previous match:\n     */\n    if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n      max_insert = s.strstart + s.lookahead - MIN_MATCH;\n      /* Do not insert strings in hash table beyond this. */\n\n      //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n      /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n                     s.prev_length - MIN_MATCH, bflush);***/\n      bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n      /* Insert in hash table all strings up to the end of the match.\n       * strstart-1 and strstart are already inserted. If there is not\n       * enough lookahead, the last two strings are not inserted in\n       * the hash table.\n       */\n      s.lookahead -= s.prev_length - 1;\n      s.prev_length -= 2;\n      do {\n        if (++s.strstart <= max_insert) {\n          /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n          s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask;\n          hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n          s.head[s.ins_h] = s.strstart;\n          /***/\n        }\n      } while (--s.prev_length !== 0);\n      s.match_available = 0;\n      s.match_length = MIN_MATCH - 1;\n      s.strstart++;\n\n      if (bflush) {\n        /*** FLUSH_BLOCK(s, 0); ***/\n        flush_block_only(s, false);\n        if (s.strm.avail_out === 0) {\n          return BS_NEED_MORE;\n        }\n        /***/\n      }\n\n    } else if (s.match_available) {\n      /* If there was no match at the previous position, output a\n       * single literal. If there was a match but the current match\n       * is longer, truncate the previous match to a single literal.\n       */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n      /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n      bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n      if (bflush) {\n        /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n        flush_block_only(s, false);\n        /***/\n      }\n      s.strstart++;\n      s.lookahead--;\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n    } else {\n      /* There is no previous match to compare with, wait for\n       * the next step to decide.\n       */\n      s.match_available = 1;\n      s.strstart++;\n      s.lookahead--;\n    }\n  }\n  //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n  if (s.match_available) {\n    //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n    /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n    bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]);\n\n    s.match_available = 0;\n  }\n  s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n\n  return BS_BLOCK_DONE;\n}\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one.  Do not maintain a hash table.  (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nfunction deflate_rle(s, flush) {\n  var bflush;            /* set if current block must be flushed */\n  var prev;              /* byte at distance one to match */\n  var scan, strend;      /* scan goes up to strend for length of run */\n\n  var _win = s.window;\n\n  for (;;) {\n    /* Make sure that we always have enough lookahead, except\n     * at the end of the input file. We need MAX_MATCH bytes\n     * for the longest run, plus one for the unrolled loop.\n     */\n    if (s.lookahead <= MAX_MATCH) {\n      fill_window(s);\n      if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {\n        return BS_NEED_MORE;\n      }\n      if (s.lookahead === 0) { break; } /* flush the current block */\n    }\n\n    /* See how many times the previous byte repeats */\n    s.match_length = 0;\n    if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n      scan = s.strstart - 1;\n      prev = _win[scan];\n      if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n        strend = s.strstart + MAX_MATCH;\n        do {\n          /*jshint noempty:false*/\n        } while (prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 prev === _win[++scan] && prev === _win[++scan] &&\n                 scan < strend);\n        s.match_length = MAX_MATCH - (strend - scan);\n        if (s.match_length > s.lookahead) {\n          s.match_length = s.lookahead;\n        }\n      }\n      //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n    }\n\n    /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n    if (s.match_length >= MIN_MATCH) {\n      //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n      /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n      bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n      s.lookahead -= s.match_length;\n      s.strstart += s.match_length;\n      s.match_length = 0;\n    } else {\n      /* No match, output a literal byte */\n      //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n      /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n      bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n      s.lookahead--;\n      s.strstart++;\n    }\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n}\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches.  Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nfunction deflate_huff(s, flush) {\n  var bflush;             /* set if current block must be flushed */\n\n  for (;;) {\n    /* Make sure that we have a literal to write. */\n    if (s.lookahead === 0) {\n      fill_window(s);\n      if (s.lookahead === 0) {\n        if (flush === Z_NO_FLUSH) {\n          return BS_NEED_MORE;\n        }\n        break;      /* flush the current block */\n      }\n    }\n\n    /* Output a literal byte */\n    s.match_length = 0;\n    //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n    /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n    bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n    s.lookahead--;\n    s.strstart++;\n    if (bflush) {\n      /*** FLUSH_BLOCK(s, 0); ***/\n      flush_block_only(s, false);\n      if (s.strm.avail_out === 0) {\n        return BS_NEED_MORE;\n      }\n      /***/\n    }\n  }\n  s.insert = 0;\n  if (flush === Z_FINISH) {\n    /*** FLUSH_BLOCK(s, 1); ***/\n    flush_block_only(s, true);\n    if (s.strm.avail_out === 0) {\n      return BS_FINISH_STARTED;\n    }\n    /***/\n    return BS_FINISH_DONE;\n  }\n  if (s.last_lit) {\n    /*** FLUSH_BLOCK(s, 0); ***/\n    flush_block_only(s, false);\n    if (s.strm.avail_out === 0) {\n      return BS_NEED_MORE;\n    }\n    /***/\n  }\n  return BS_BLOCK_DONE;\n}\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n  this.good_length = good_length;\n  this.max_lazy = max_lazy;\n  this.nice_length = nice_length;\n  this.max_chain = max_chain;\n  this.func = func;\n}\n\nvar configuration_table;\n\nconfiguration_table = [\n  /*      good lazy nice chain */\n  new Config(0, 0, 0, 0, deflate_stored),          /* 0 store only */\n  new Config(4, 4, 8, 4, deflate_fast),            /* 1 max speed, no lazy matches */\n  new Config(4, 5, 16, 8, deflate_fast),           /* 2 */\n  new Config(4, 6, 32, 32, deflate_fast),          /* 3 */\n\n  new Config(4, 4, 16, 16, deflate_slow),          /* 4 lazy matches */\n  new Config(8, 16, 32, 32, deflate_slow),         /* 5 */\n  new Config(8, 16, 128, 128, deflate_slow),       /* 6 */\n  new Config(8, 32, 128, 256, deflate_slow),       /* 7 */\n  new Config(32, 128, 258, 1024, deflate_slow),    /* 8 */\n  new Config(32, 258, 258, 4096, deflate_slow)     /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nfunction lm_init(s) {\n  s.window_size = 2 * s.w_size;\n\n  /*** CLEAR_HASH(s); ***/\n  zero(s.head); // Fill with NIL (= 0);\n\n  /* Set the default configuration parameters:\n   */\n  s.max_lazy_match = configuration_table[s.level].max_lazy;\n  s.good_match = configuration_table[s.level].good_length;\n  s.nice_match = configuration_table[s.level].nice_length;\n  s.max_chain_length = configuration_table[s.level].max_chain;\n\n  s.strstart = 0;\n  s.block_start = 0;\n  s.lookahead = 0;\n  s.insert = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  s.ins_h = 0;\n}\n\n\nfunction DeflateState() {\n  this.strm = null;            /* pointer back to this zlib stream */\n  this.status = 0;            /* as the name implies */\n  this.pending_buf = null;      /* output still pending */\n  this.pending_buf_size = 0;  /* size of pending_buf */\n  this.pending_out = 0;       /* next pending byte to output to the stream */\n  this.pending = 0;           /* nb of bytes in the pending buffer */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.gzhead = null;         /* gzip header information to write */\n  this.gzindex = 0;           /* where in extra, name, or comment */\n  this.method = Z_DEFLATED; /* can only be DEFLATED */\n  this.last_flush = -1;   /* value of flush param for previous deflate call */\n\n  this.w_size = 0;  /* LZ77 window size (32K by default) */\n  this.w_bits = 0;  /* log2(w_size)  (8..16) */\n  this.w_mask = 0;  /* w_size - 1 */\n\n  this.window = null;\n  /* Sliding window. Input bytes are read into the second half of the window,\n   * and move to the first half later to keep a dictionary of at least wSize\n   * bytes. With this organization, matches are limited to a distance of\n   * wSize-MAX_MATCH bytes, but this ensures that IO is always\n   * performed with a length multiple of the block size.\n   */\n\n  this.window_size = 0;\n  /* Actual size of window: 2*wSize, except when the user input buffer\n   * is directly used as sliding window.\n   */\n\n  this.prev = null;\n  /* Link to older string with same hash index. To limit the size of this\n   * array to 64K, this link is maintained only for the last 32K strings.\n   * An index in this array is thus a window index modulo 32K.\n   */\n\n  this.head = null;   /* Heads of the hash chains or NIL. */\n\n  this.ins_h = 0;       /* hash index of string to be inserted */\n  this.hash_size = 0;   /* number of elements in hash table */\n  this.hash_bits = 0;   /* log2(hash_size) */\n  this.hash_mask = 0;   /* hash_size-1 */\n\n  this.hash_shift = 0;\n  /* Number of bits by which ins_h must be shifted at each input\n   * step. It must be such that after MIN_MATCH steps, the oldest\n   * byte no longer takes part in the hash key, that is:\n   *   hash_shift * MIN_MATCH >= hash_bits\n   */\n\n  this.block_start = 0;\n  /* Window position at the beginning of the current output block. Gets\n   * negative when the window is moved backwards.\n   */\n\n  this.match_length = 0;      /* length of best match */\n  this.prev_match = 0;        /* previous match */\n  this.match_available = 0;   /* set if previous match exists */\n  this.strstart = 0;          /* start of string to insert */\n  this.match_start = 0;       /* start of matching string */\n  this.lookahead = 0;         /* number of valid bytes ahead in window */\n\n  this.prev_length = 0;\n  /* Length of the best match at previous step. Matches not greater than this\n   * are discarded. This is used in the lazy match evaluation.\n   */\n\n  this.max_chain_length = 0;\n  /* To speed up deflation, hash chains are never searched beyond this\n   * length.  A higher limit improves compression ratio but degrades the\n   * speed.\n   */\n\n  this.max_lazy_match = 0;\n  /* Attempt to find a better match only when the current match is strictly\n   * smaller than this value. This mechanism is used only for compression\n   * levels >= 4.\n   */\n  // That's alias to max_lazy_match, don't use directly\n  //this.max_insert_length = 0;\n  /* Insert new strings in the hash table only if the match length is not\n   * greater than this length. This saves time but degrades compression.\n   * max_insert_length is used only for compression levels <= 3.\n   */\n\n  this.level = 0;     /* compression level (1..9) */\n  this.strategy = 0;  /* favor or force Huffman coding*/\n\n  this.good_match = 0;\n  /* Use a faster search when the previous match is longer than this */\n\n  this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n              /* used by trees.c: */\n\n  /* Didn't use ct_data typedef below to suppress compiler warning */\n\n  // struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */\n  // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n  // struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */\n\n  // Use flat array of DOUBLE size, with interleaved fata,\n  // because JS does not support effective\n  this.dyn_ltree  = new utils.Buf16(HEAP_SIZE * 2);\n  this.dyn_dtree  = new utils.Buf16((2 * D_CODES + 1) * 2);\n  this.bl_tree    = new utils.Buf16((2 * BL_CODES + 1) * 2);\n  zero(this.dyn_ltree);\n  zero(this.dyn_dtree);\n  zero(this.bl_tree);\n\n  this.l_desc   = null;         /* desc. for literal tree */\n  this.d_desc   = null;         /* desc. for distance tree */\n  this.bl_desc  = null;         /* desc. for bit length tree */\n\n  //ush bl_count[MAX_BITS+1];\n  this.bl_count = new utils.Buf16(MAX_BITS + 1);\n  /* number of codes at each bit length for an optimal tree */\n\n  //int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */\n  this.heap = new utils.Buf16(2 * L_CODES + 1);  /* heap used to build the Huffman trees */\n  zero(this.heap);\n\n  this.heap_len = 0;               /* number of elements in the heap */\n  this.heap_max = 0;               /* element of largest frequency */\n  /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n   * The same heap array is used to build all trees.\n   */\n\n  this.depth = new utils.Buf16(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n  zero(this.depth);\n  /* Depth of each subtree used as tie breaker for trees of equal frequency\n   */\n\n  this.l_buf = 0;          /* buffer index for literals or lengths */\n\n  this.lit_bufsize = 0;\n  /* Size of match buffer for literals/lengths.  There are 4 reasons for\n   * limiting lit_bufsize to 64K:\n   *   - frequencies can be kept in 16 bit counters\n   *   - if compression is not successful for the first block, all input\n   *     data is still in the window so we can still emit a stored block even\n   *     when input comes from standard input.  (This can also be done for\n   *     all blocks if lit_bufsize is not greater than 32K.)\n   *   - if compression is not successful for a file smaller than 64K, we can\n   *     even emit a stored file instead of a stored block (saving 5 bytes).\n   *     This is applicable only for zip (not gzip or zlib).\n   *   - creating new Huffman trees less frequently may not provide fast\n   *     adaptation to changes in the input data statistics. (Take for\n   *     example a binary file with poorly compressible code followed by\n   *     a highly compressible string table.) Smaller buffer sizes give\n   *     fast adaptation but have of course the overhead of transmitting\n   *     trees more frequently.\n   *   - I can't count above 4\n   */\n\n  this.last_lit = 0;      /* running index in l_buf */\n\n  this.d_buf = 0;\n  /* Buffer index for distances. To simplify the code, d_buf and l_buf have\n   * the same number of elements. To use different lengths, an extra flag\n   * array would be necessary.\n   */\n\n  this.opt_len = 0;       /* bit length of current block with optimal trees */\n  this.static_len = 0;    /* bit length of current block with static trees */\n  this.matches = 0;       /* number of string matches in current block */\n  this.insert = 0;        /* bytes at end of window left to insert */\n\n\n  this.bi_buf = 0;\n  /* Output buffer. bits are inserted starting at the bottom (least\n   * significant bits).\n   */\n  this.bi_valid = 0;\n  /* Number of valid bits in bi_buf.  All bits above the last valid bit\n   * are always zero.\n   */\n\n  // Used for window memory init. We safely ignore it for JS. That makes\n  // sense only for pointers and memory check tools.\n  //this.high_water = 0;\n  /* High water mark offset in window for initialized bytes -- bytes above\n   * this are set to zero in order to avoid memory check warnings when\n   * longest match routines access bytes past the input.  This is then\n   * updated to the new high water mark.\n   */\n}\n\n\nfunction deflateResetKeep(strm) {\n  var s;\n\n  if (!strm || !strm.state) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n  strm.total_in = strm.total_out = 0;\n  strm.data_type = Z_UNKNOWN;\n\n  s = strm.state;\n  s.pending = 0;\n  s.pending_out = 0;\n\n  if (s.wrap < 0) {\n    s.wrap = -s.wrap;\n    /* was made negative by deflate(..., Z_FINISH); */\n  }\n  s.status = (s.wrap ? INIT_STATE : BUSY_STATE);\n  strm.adler = (s.wrap === 2) ?\n    0  // crc32(0, Z_NULL, 0)\n  :\n    1; // adler32(0, Z_NULL, 0)\n  s.last_flush = Z_NO_FLUSH;\n  trees._tr_init(s);\n  return Z_OK;\n}\n\n\nfunction deflateReset(strm) {\n  var ret = deflateResetKeep(strm);\n  if (ret === Z_OK) {\n    lm_init(strm.state);\n  }\n  return ret;\n}\n\n\nfunction deflateSetHeader(strm, head) {\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }\n  strm.state.gzhead = head;\n  return Z_OK;\n}\n\n\nfunction deflateInit2(strm, level, method, windowBits, memLevel, strategy) {\n  if (!strm) { // === Z_NULL\n    return Z_STREAM_ERROR;\n  }\n  var wrap = 1;\n\n  if (level === Z_DEFAULT_COMPRESSION) {\n    level = 6;\n  }\n\n  if (windowBits < 0) { /* suppress zlib wrapper */\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n\n  else if (windowBits > 15) {\n    wrap = 2;           /* write gzip wrapper instead */\n    windowBits -= 16;\n  }\n\n\n  if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||\n    windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n    strategy < 0 || strategy > Z_FIXED) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n\n  if (windowBits === 8) {\n    windowBits = 9;\n  }\n  /* until 256-byte window bug fixed */\n\n  var s = new DeflateState();\n\n  strm.state = s;\n  s.strm = strm;\n\n  s.wrap = wrap;\n  s.gzhead = null;\n  s.w_bits = windowBits;\n  s.w_size = 1 << s.w_bits;\n  s.w_mask = s.w_size - 1;\n\n  s.hash_bits = memLevel + 7;\n  s.hash_size = 1 << s.hash_bits;\n  s.hash_mask = s.hash_size - 1;\n  s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n  s.window = new utils.Buf8(s.w_size * 2);\n  s.head = new utils.Buf16(s.hash_size);\n  s.prev = new utils.Buf16(s.w_size);\n\n  // Don't need mem init magic for JS.\n  //s.high_water = 0;  /* nothing written to s->window yet */\n\n  s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n  s.pending_buf_size = s.lit_bufsize * 4;\n\n  //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);\n  //s->pending_buf = (uchf *) overlay;\n  s.pending_buf = new utils.Buf8(s.pending_buf_size);\n\n  // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n  //s->d_buf = overlay + s->lit_bufsize/sizeof(ush);\n  s.d_buf = 1 * s.lit_bufsize;\n\n  //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;\n  s.l_buf = (1 + 2) * s.lit_bufsize;\n\n  s.level = level;\n  s.strategy = strategy;\n  s.method = method;\n\n  return deflateReset(strm);\n}\n\nfunction deflateInit(strm, level) {\n  return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);\n}\n\n\nfunction deflate(strm, flush) {\n  var old_flush, s;\n  var beg, val; // for gzip header write only\n\n  if (!strm || !strm.state ||\n    flush > Z_BLOCK || flush < 0) {\n    return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR;\n  }\n\n  s = strm.state;\n\n  if (!strm.output ||\n      (!strm.input && strm.avail_in !== 0) ||\n      (s.status === FINISH_STATE && flush !== Z_FINISH)) {\n    return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR);\n  }\n\n  s.strm = strm; /* just in case */\n  old_flush = s.last_flush;\n  s.last_flush = flush;\n\n  /* Write the header */\n  if (s.status === INIT_STATE) {\n\n    if (s.wrap === 2) { // GZIP header\n      strm.adler = 0;  //crc32(0L, Z_NULL, 0);\n      put_byte(s, 31);\n      put_byte(s, 139);\n      put_byte(s, 8);\n      if (!s.gzhead) { // s->gzhead == Z_NULL\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, 0);\n        put_byte(s, s.level === 9 ? 2 :\n                    (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                     4 : 0));\n        put_byte(s, OS_CODE);\n        s.status = BUSY_STATE;\n      }\n      else {\n        put_byte(s, (s.gzhead.text ? 1 : 0) +\n                    (s.gzhead.hcrc ? 2 : 0) +\n                    (!s.gzhead.extra ? 0 : 4) +\n                    (!s.gzhead.name ? 0 : 8) +\n                    (!s.gzhead.comment ? 0 : 16)\n        );\n        put_byte(s, s.gzhead.time & 0xff);\n        put_byte(s, (s.gzhead.time >> 8) & 0xff);\n        put_byte(s, (s.gzhead.time >> 16) & 0xff);\n        put_byte(s, (s.gzhead.time >> 24) & 0xff);\n        put_byte(s, s.level === 9 ? 2 :\n                    (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n                     4 : 0));\n        put_byte(s, s.gzhead.os & 0xff);\n        if (s.gzhead.extra && s.gzhead.extra.length) {\n          put_byte(s, s.gzhead.extra.length & 0xff);\n          put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n        }\n        if (s.gzhead.hcrc) {\n          strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);\n        }\n        s.gzindex = 0;\n        s.status = EXTRA_STATE;\n      }\n    }\n    else // DEFLATE header\n    {\n      var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8;\n      var level_flags = -1;\n\n      if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n        level_flags = 0;\n      } else if (s.level < 6) {\n        level_flags = 1;\n      } else if (s.level === 6) {\n        level_flags = 2;\n      } else {\n        level_flags = 3;\n      }\n      header |= (level_flags << 6);\n      if (s.strstart !== 0) { header |= PRESET_DICT; }\n      header += 31 - (header % 31);\n\n      s.status = BUSY_STATE;\n      putShortMSB(s, header);\n\n      /* Save the adler32 of the preset dictionary: */\n      if (s.strstart !== 0) {\n        putShortMSB(s, strm.adler >>> 16);\n        putShortMSB(s, strm.adler & 0xffff);\n      }\n      strm.adler = 1; // adler32(0L, Z_NULL, 0);\n    }\n  }\n\n//#ifdef GZIP\n  if (s.status === EXTRA_STATE) {\n    if (s.gzhead.extra/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n\n      while (s.gzindex < (s.gzhead.extra.length & 0xffff)) {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            break;\n          }\n        }\n        put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);\n        s.gzindex++;\n      }\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (s.gzindex === s.gzhead.extra.length) {\n        s.gzindex = 0;\n        s.status = NAME_STATE;\n      }\n    }\n    else {\n      s.status = NAME_STATE;\n    }\n  }\n  if (s.status === NAME_STATE) {\n    if (s.gzhead.name/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n      //int val;\n\n      do {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            val = 1;\n            break;\n          }\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.name.length) {\n          val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (val === 0) {\n        s.gzindex = 0;\n        s.status = COMMENT_STATE;\n      }\n    }\n    else {\n      s.status = COMMENT_STATE;\n    }\n  }\n  if (s.status === COMMENT_STATE) {\n    if (s.gzhead.comment/* != Z_NULL*/) {\n      beg = s.pending;  /* start of bytes to update crc */\n      //int val;\n\n      do {\n        if (s.pending === s.pending_buf_size) {\n          if (s.gzhead.hcrc && s.pending > beg) {\n            strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n          }\n          flush_pending(strm);\n          beg = s.pending;\n          if (s.pending === s.pending_buf_size) {\n            val = 1;\n            break;\n          }\n        }\n        // JS specific: little magic to add zero terminator to end of string\n        if (s.gzindex < s.gzhead.comment.length) {\n          val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n        } else {\n          val = 0;\n        }\n        put_byte(s, val);\n      } while (val !== 0);\n\n      if (s.gzhead.hcrc && s.pending > beg) {\n        strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n      }\n      if (val === 0) {\n        s.status = HCRC_STATE;\n      }\n    }\n    else {\n      s.status = HCRC_STATE;\n    }\n  }\n  if (s.status === HCRC_STATE) {\n    if (s.gzhead.hcrc) {\n      if (s.pending + 2 > s.pending_buf_size) {\n        flush_pending(strm);\n      }\n      if (s.pending + 2 <= s.pending_buf_size) {\n        put_byte(s, strm.adler & 0xff);\n        put_byte(s, (strm.adler >> 8) & 0xff);\n        strm.adler = 0; //crc32(0L, Z_NULL, 0);\n        s.status = BUSY_STATE;\n      }\n    }\n    else {\n      s.status = BUSY_STATE;\n    }\n  }\n//#endif\n\n  /* Flush as much pending output as possible */\n  if (s.pending !== 0) {\n    flush_pending(strm);\n    if (strm.avail_out === 0) {\n      /* Since avail_out is 0, deflate will be called again with\n       * more output space, but possibly with both pending and\n       * avail_in equal to zero. There won't be anything to do,\n       * but this is not an error situation so make sure we\n       * return OK instead of BUF_ERROR at next call of deflate:\n       */\n      s.last_flush = -1;\n      return Z_OK;\n    }\n\n    /* Make sure there is something to do and avoid duplicate consecutive\n     * flushes. For repeated and useless calls with Z_FINISH, we keep\n     * returning Z_STREAM_END instead of Z_BUF_ERROR.\n     */\n  } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n    flush !== Z_FINISH) {\n    return err(strm, Z_BUF_ERROR);\n  }\n\n  /* User must not provide more input after the first FINISH: */\n  if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n    return err(strm, Z_BUF_ERROR);\n  }\n\n  /* Start a new block or continue the current one.\n   */\n  if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n    (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {\n    var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :\n      (s.strategy === Z_RLE ? deflate_rle(s, flush) :\n        configuration_table[s.level].func(s, flush));\n\n    if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n      s.status = FINISH_STATE;\n    }\n    if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n      if (strm.avail_out === 0) {\n        s.last_flush = -1;\n        /* avoid BUF_ERROR next call, see above */\n      }\n      return Z_OK;\n      /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n       * of deflate should use the same flush parameter to make sure\n       * that the flush is complete. So we don't have to output an\n       * empty block here, this will be done at next call. This also\n       * ensures that for a very small output buffer, we emit at most\n       * one empty block.\n       */\n    }\n    if (bstate === BS_BLOCK_DONE) {\n      if (flush === Z_PARTIAL_FLUSH) {\n        trees._tr_align(s);\n      }\n      else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */\n\n        trees._tr_stored_block(s, 0, 0, false);\n        /* For a full flush, this empty block will be recognized\n         * as a special marker by inflate_sync().\n         */\n        if (flush === Z_FULL_FLUSH) {\n          /*** CLEAR_HASH(s); ***/             /* forget history */\n          zero(s.head); // Fill with NIL (= 0);\n\n          if (s.lookahead === 0) {\n            s.strstart = 0;\n            s.block_start = 0;\n            s.insert = 0;\n          }\n        }\n      }\n      flush_pending(strm);\n      if (strm.avail_out === 0) {\n        s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n        return Z_OK;\n      }\n    }\n  }\n  //Assert(strm->avail_out > 0, \"bug2\");\n  //if (strm.avail_out <= 0) { throw new Error(\"bug2\");}\n\n  if (flush !== Z_FINISH) { return Z_OK; }\n  if (s.wrap <= 0) { return Z_STREAM_END; }\n\n  /* Write the trailer */\n  if (s.wrap === 2) {\n    put_byte(s, strm.adler & 0xff);\n    put_byte(s, (strm.adler >> 8) & 0xff);\n    put_byte(s, (strm.adler >> 16) & 0xff);\n    put_byte(s, (strm.adler >> 24) & 0xff);\n    put_byte(s, strm.total_in & 0xff);\n    put_byte(s, (strm.total_in >> 8) & 0xff);\n    put_byte(s, (strm.total_in >> 16) & 0xff);\n    put_byte(s, (strm.total_in >> 24) & 0xff);\n  }\n  else\n  {\n    putShortMSB(s, strm.adler >>> 16);\n    putShortMSB(s, strm.adler & 0xffff);\n  }\n\n  flush_pending(strm);\n  /* If avail_out is zero, the application will call deflate again\n   * to flush the rest.\n   */\n  if (s.wrap > 0) { s.wrap = -s.wrap; }\n  /* write the trailer only once! */\n  return s.pending !== 0 ? Z_OK : Z_STREAM_END;\n}\n\nfunction deflateEnd(strm) {\n  var status;\n\n  if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n    return Z_STREAM_ERROR;\n  }\n\n  status = strm.state.status;\n  if (status !== INIT_STATE &&\n    status !== EXTRA_STATE &&\n    status !== NAME_STATE &&\n    status !== COMMENT_STATE &&\n    status !== HCRC_STATE &&\n    status !== BUSY_STATE &&\n    status !== FINISH_STATE\n  ) {\n    return err(strm, Z_STREAM_ERROR);\n  }\n\n  strm.state = null;\n\n  return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;\n}\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nfunction deflateSetDictionary(strm, dictionary) {\n  var dictLength = dictionary.length;\n\n  var s;\n  var str, n;\n  var wrap;\n  var avail;\n  var next;\n  var input;\n  var tmpDict;\n\n  if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n    return Z_STREAM_ERROR;\n  }\n\n  s = strm.state;\n  wrap = s.wrap;\n\n  if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n    return Z_STREAM_ERROR;\n  }\n\n  /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n  if (wrap === 1) {\n    /* adler32(strm->adler, dictionary, dictLength); */\n    strm.adler = adler32(strm.adler, dictionary, dictLength, 0);\n  }\n\n  s.wrap = 0;   /* avoid computing Adler-32 in read_buf */\n\n  /* if dictionary would fill window, just replace the history */\n  if (dictLength >= s.w_size) {\n    if (wrap === 0) {            /* already empty otherwise */\n      /*** CLEAR_HASH(s); ***/\n      zero(s.head); // Fill with NIL (= 0);\n      s.strstart = 0;\n      s.block_start = 0;\n      s.insert = 0;\n    }\n    /* use the tail */\n    // dictionary = dictionary.slice(dictLength - s.w_size);\n    tmpDict = new utils.Buf8(s.w_size);\n    utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0);\n    dictionary = tmpDict;\n    dictLength = s.w_size;\n  }\n  /* insert dictionary into window and hash */\n  avail = strm.avail_in;\n  next = strm.next_in;\n  input = strm.input;\n  strm.avail_in = dictLength;\n  strm.next_in = 0;\n  strm.input = dictionary;\n  fill_window(s);\n  while (s.lookahead >= MIN_MATCH) {\n    str = s.strstart;\n    n = s.lookahead - (MIN_MATCH - 1);\n    do {\n      /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n      s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask;\n\n      s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n      s.head[s.ins_h] = str;\n      str++;\n    } while (--n);\n    s.strstart = str;\n    s.lookahead = MIN_MATCH - 1;\n    fill_window(s);\n  }\n  s.strstart += s.lookahead;\n  s.block_start = s.strstart;\n  s.insert = s.lookahead;\n  s.lookahead = 0;\n  s.match_length = s.prev_length = MIN_MATCH - 1;\n  s.match_available = 0;\n  strm.next_in = next;\n  strm.input = input;\n  strm.avail_in = avail;\n  s.wrap = wrap;\n  return Z_OK;\n}\n\n\nexports.deflateInit = deflateInit;\nexports.deflateInit2 = deflateInit2;\nexports.deflateReset = deflateReset;\nexports.deflateResetKeep = deflateResetKeep;\nexports.deflateSetHeader = deflateSetHeader;\nexports.deflate = deflate;\nexports.deflateEnd = deflateEnd;\nexports.deflateSetDictionary = deflateSetDictionary;\nexports.deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nexports.deflateBound = deflateBound;\nexports.deflateCopy = deflateCopy;\nexports.deflateParams = deflateParams;\nexports.deflatePending = deflatePending;\nexports.deflatePrime = deflatePrime;\nexports.deflateTune = deflateTune;\n*/\n", "// String encode/decode helpers\n'use strict';\n\n\nvar utils = require('./common');\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nvar STR_APPLY_OK = true;\nvar STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, [ 0 ]); } catch (__) { STR_APPLY_OK = false; }\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nvar _utf8len = new utils.Buf8(256);\nfor (var q = 0; q < 256; q++) {\n  _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nexports.string2buf = function (str) {\n  var buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n  // count binary size\n  for (m_pos = 0; m_pos < str_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n  }\n\n  // allocate buffer\n  buf = new utils.Buf8(buf_len);\n\n  // convert\n  for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n    c = str.charCodeAt(m_pos);\n    if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n      c2 = str.charCodeAt(m_pos + 1);\n      if ((c2 & 0xfc00) === 0xdc00) {\n        c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n        m_pos++;\n      }\n    }\n    if (c < 0x80) {\n      /* one byte */\n      buf[i++] = c;\n    } else if (c < 0x800) {\n      /* two bytes */\n      buf[i++] = 0xC0 | (c >>> 6);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else if (c < 0x10000) {\n      /* three bytes */\n      buf[i++] = 0xE0 | (c >>> 12);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    } else {\n      /* four bytes */\n      buf[i++] = 0xf0 | (c >>> 18);\n      buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n      buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n      buf[i++] = 0x80 | (c & 0x3f);\n    }\n  }\n\n  return buf;\n};\n\n// Helper (used in 2 places)\nfunction buf2binstring(buf, len) {\n  // On Chrome, the arguments in a function call that are allowed is `65534`.\n  // If the length of the buffer is smaller than that, we can use this optimization,\n  // otherwise we will take a slower path.\n  if (len < 65534) {\n    if ((buf.subarray && STR_APPLY_UIA_OK) || (!buf.subarray && STR_APPLY_OK)) {\n      return String.fromCharCode.apply(null, utils.shrinkBuf(buf, len));\n    }\n  }\n\n  var result = '';\n  for (var i = 0; i < len; i++) {\n    result += String.fromCharCode(buf[i]);\n  }\n  return result;\n}\n\n\n// Convert byte array to binary string\nexports.buf2binstring = function (buf) {\n  return buf2binstring(buf, buf.length);\n};\n\n\n// Convert binary string (typed, when possible)\nexports.binstring2buf = function (str) {\n  var buf = new utils.Buf8(str.length);\n  for (var i = 0, len = buf.length; i < len; i++) {\n    buf[i] = str.charCodeAt(i);\n  }\n  return buf;\n};\n\n\n// convert array to string\nexports.buf2string = function (buf, max) {\n  var i, out, c, c_len;\n  var len = max || buf.length;\n\n  // Reserve max possible length (2 words per char)\n  // NB: by unknown reasons, Array is significantly faster for\n  //     String.fromCharCode.apply than Uint16Array.\n  var utf16buf = new Array(len * 2);\n\n  for (out = 0, i = 0; i < len;) {\n    c = buf[i++];\n    // quick process ascii\n    if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n    c_len = _utf8len[c];\n    // skip 5 & 6 byte codes\n    if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n    // apply mask on first byte\n    c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n    // join the rest\n    while (c_len > 1 && i < len) {\n      c = (c << 6) | (buf[i++] & 0x3f);\n      c_len--;\n    }\n\n    // terminated by end of string?\n    if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n    if (c < 0x10000) {\n      utf16buf[out++] = c;\n    } else {\n      c -= 0x10000;\n      utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n      utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n    }\n  }\n\n  return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max   - length limit (mandatory);\nexports.utf8border = function (buf, max) {\n  var pos;\n\n  max = max || buf.length;\n  if (max > buf.length) { max = buf.length; }\n\n  // go back from last position, until start of sequence found\n  pos = max - 1;\n  while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n  // Very small and broken sequence,\n  // return max, because we should return something anyway.\n  if (pos < 0) { return max; }\n\n  // If we came to start of buffer - that means buffer is too small,\n  // return max too.\n  if (pos === 0) { return max; }\n\n  return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n", "'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n  /* next input byte */\n  this.input = null; // JS specific, because we have no pointers\n  this.next_in = 0;\n  /* number of bytes available at input */\n  this.avail_in = 0;\n  /* total number of input bytes read so far */\n  this.total_in = 0;\n  /* next output byte should be put there */\n  this.output = null; // JS specific, because we have no pointers\n  this.next_out = 0;\n  /* remaining free space at output */\n  this.avail_out = 0;\n  /* total number of bytes output so far */\n  this.total_out = 0;\n  /* last error message, NULL if no error */\n  this.msg = ''/*Z_NULL*/;\n  /* not visible by applications */\n  this.state = null;\n  /* best guess about the data type: binary or text */\n  this.data_type = 2/*Z_UNKNOWN*/;\n  /* adler32 value of the uncompressed data */\n  this.adler = 0;\n}\n\nmodule.exports = ZStream;\n", "'use strict';\n\n\nvar zlib_deflate = require('./zlib/deflate');\nvar utils        = require('./utils/common');\nvar strings      = require('./utils/strings');\nvar msg          = require('./zlib/messages');\nvar ZStream      = require('./zlib/zstream');\n\nvar toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nvar Z_NO_FLUSH      = 0;\nvar Z_FINISH        = 4;\n\nvar Z_OK            = 0;\nvar Z_STREAM_END    = 1;\nvar Z_SYNC_FLUSH    = 2;\n\nvar Z_DEFAULT_COMPRESSION = -1;\n\nvar Z_DEFAULT_STRATEGY    = 0;\n\nvar Z_DEFLATED  = 8;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array|Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param)  or if you\n * push a chunk with explicit flush (call [[Deflate#push]] with\n * `Z_SYNC_FLUSH` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `to` (String) - if equal to 'string', then result will be \"binary string\"\n *    (each char code [0..255])\n * - `header` (Object) - custom header for gzip\n *   - `text` (Boolean) - true if compressed data believed to be text\n *   - `time` (Number) - modification time, unix timestamp\n *   - `os` (Number) - operation system code\n *   - `extra` (Array) - array of bytes with extra data (max 65536)\n *   - `name` (String) - file name (binary string)\n *   - `comment` (String) - comment (binary string)\n *   - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n *   , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\n *   , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * var deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true);  // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate(options) {\n  if (!(this instanceof Deflate)) return new Deflate(options);\n\n  this.options = utils.assign({\n    level: Z_DEFAULT_COMPRESSION,\n    method: Z_DEFLATED,\n    chunkSize: 16384,\n    windowBits: 15,\n    memLevel: 8,\n    strategy: Z_DEFAULT_STRATEGY,\n    to: ''\n  }, options || {});\n\n  var opt = this.options;\n\n  if (opt.raw && (opt.windowBits > 0)) {\n    opt.windowBits = -opt.windowBits;\n  }\n\n  else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n    opt.windowBits += 16;\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm = new ZStream();\n  this.strm.avail_out = 0;\n\n  var status = zlib_deflate.deflateInit2(\n    this.strm,\n    opt.level,\n    opt.method,\n    opt.windowBits,\n    opt.memLevel,\n    opt.strategy\n  );\n\n  if (status !== Z_OK) {\n    throw new Error(msg[status]);\n  }\n\n  if (opt.header) {\n    zlib_deflate.deflateSetHeader(this.strm, opt.header);\n  }\n\n  if (opt.dictionary) {\n    var dict;\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      // If we need to compress text, change encoding to utf8.\n      dict = strings.string2buf(opt.dictionary);\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n      dict = new Uint8Array(opt.dictionary);\n    } else {\n      dict = opt.dictionary;\n    }\n\n    status = zlib_deflate.deflateSetDictionary(this.strm, dict);\n\n    if (status !== Z_OK) {\n      throw new Error(msg[status]);\n    }\n\n    this._dict_set = true;\n  }\n}\n\n/**\n * Deflate#push(data[, mode]) -> Boolean\n * - data (Uint8Array|Array|ArrayBuffer|String): input data. Strings will be\n *   converted to utf8 byte sequence.\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must have\n * mode Z_FINISH (or `true`). That will flush internal pending buffers and call\n * [[Deflate#onEnd]]. For interim explicit flushes (without ending the stream) you\n * can use mode Z_SYNC_FLUSH, keeping the compression context.\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * We strongly recommend to use `Uint8Array` on input for best speed (output\n * array format is detected automatically). Also, don't skip last param and always\n * use the same type in your code (boolean or number). That will improve JS speed.\n *\n * For regular `Array`-s make sure all elements are [0..255].\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nDeflate.prototype.push = function (data, mode) {\n  var strm = this.strm;\n  var chunkSize = this.options.chunkSize;\n  var status, _mode;\n\n  if (this.ended) { return false; }\n\n  _mode = (mode === ~~mode) ? mode : ((mode === true) ? Z_FINISH : Z_NO_FLUSH);\n\n  // Convert data if needed\n  if (typeof data === 'string') {\n    // If we need to compress text, change encoding to utf8.\n    strm.input = strings.string2buf(data);\n  } else if (toString.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  do {\n    if (strm.avail_out === 0) {\n      strm.output = new utils.Buf8(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n    status = zlib_deflate.deflate(strm, _mode);    /* no bad return value */\n\n    if (status !== Z_STREAM_END && status !== Z_OK) {\n      this.onEnd(status);\n      this.ended = true;\n      return false;\n    }\n    if (strm.avail_out === 0 || (strm.avail_in === 0 && (_mode === Z_FINISH || _mode === Z_SYNC_FLUSH))) {\n      if (this.options.to === 'string') {\n        this.onData(strings.buf2binstring(utils.shrinkBuf(strm.output, strm.next_out)));\n      } else {\n        this.onData(utils.shrinkBuf(strm.output, strm.next_out));\n      }\n    }\n  } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== Z_STREAM_END);\n\n  // Finalize on the last chunk.\n  if (_mode === Z_FINISH) {\n    status = zlib_deflate.deflateEnd(this.strm);\n    this.onEnd(status);\n    this.ended = true;\n    return status === Z_OK;\n  }\n\n  // callback interim results if Z_SYNC_FLUSH.\n  if (_mode === Z_SYNC_FLUSH) {\n    this.onEnd(Z_OK);\n    strm.avail_out = 0;\n    return true;\n  }\n\n  return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array|Array|String): output data. Type of array depends\n *   on js engine support. When string output requested, each chunk\n *   will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)\n * or if an error happened. By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === Z_OK) {\n    if (this.options.to === 'string') {\n      this.result = this.chunks.join('');\n    } else {\n      this.result = utils.flattenChunks(this.chunks);\n    }\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be \"binary string\"\n *    (each char code [0..255])\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n *   , data = Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate(input, options) {\n  var deflator = new Deflate(options);\n\n  deflator.push(input, true);\n\n  // That will never happens, if you don't cheat with options :)\n  if (deflator.err) { throw deflator.msg || msg[deflator.err]; }\n\n  return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw(input, options) {\n  options = options || {};\n  options.raw = true;\n  return deflate(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip(input, options) {\n  options = options || {};\n  options.gzip = true;\n  return deflate(input, options);\n}\n\n\nexports.Deflate = Deflate;\nexports.deflate = deflate;\nexports.deflateRaw = deflateRaw;\nexports.gzip = gzip;\n", "'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nvar BAD = 30;       /* got a data error -- remain here until reset */\nvar TYPE = 12;      /* i: waiting for type bits, including last-flag bit */\n\n/*\n   Decode literal, length, and distance codes and write out the resulting\n   literal and match bytes until either not enough input or output is\n   available, an end-of-block is encountered, or a data error is encountered.\n   When large enough input and output buffers are supplied to inflate(), for\n   example, a 16K input buffer and a 64K output buffer, more than 95% of the\n   inflate execution time is spent in this routine.\n\n   Entry assumptions:\n\n        state.mode === LEN\n        strm.avail_in >= 6\n        strm.avail_out >= 258\n        start >= strm.avail_out\n        state.bits < 8\n\n   On return, state.mode is one of:\n\n        LEN -- ran out of enough output space or enough available input\n        TYPE -- reached end of block code, inflate() to interpret next block\n        BAD -- error in block data\n\n   Notes:\n\n    - The maximum input bits used by a length/distance pair is 15 bits for the\n      length code, 5 bits for the length extra, 15 bits for the distance code,\n      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.\n      Therefore if strm.avail_in >= 6, then there is enough input to avoid\n      checking for available input while decoding.\n\n    - The maximum bytes that a single length/distance pair can output is 258\n      bytes, which is the maximum length that can be coded.  inflate_fast()\n      requires strm.avail_out >= 258 for each loop to avoid checking for\n      output space.\n */\nmodule.exports = function inflate_fast(strm, start) {\n  var state;\n  var _in;                    /* local strm.input */\n  var last;                   /* have enough input while in < last */\n  var _out;                   /* local strm.output */\n  var beg;                    /* inflate()'s initial strm.output */\n  var end;                    /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n  var dmax;                   /* maximum distance from zlib header */\n//#endif\n  var wsize;                  /* window size or zero if not using window */\n  var whave;                  /* valid bytes in the window */\n  var wnext;                  /* window write index */\n  // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n  var s_window;               /* allocated sliding window, if wsize != 0 */\n  var hold;                   /* local strm.hold */\n  var bits;                   /* local strm.bits */\n  var lcode;                  /* local strm.lencode */\n  var dcode;                  /* local strm.distcode */\n  var lmask;                  /* mask for first level of length codes */\n  var dmask;                  /* mask for first level of distance codes */\n  var here;                   /* retrieved table entry */\n  var op;                     /* code bits, operation, extra bits, or */\n                              /*  window position, window bytes to copy */\n  var len;                    /* match length, unused bytes */\n  var dist;                   /* match distance */\n  var from;                   /* where to copy match from */\n  var from_source;\n\n\n  var input, output; // JS specific, because we have no pointers\n\n  /* copy state to local variables */\n  state = strm.state;\n  //here = state.here;\n  _in = strm.next_in;\n  input = strm.input;\n  last = _in + (strm.avail_in - 5);\n  _out = strm.next_out;\n  output = strm.output;\n  beg = _out - (start - strm.avail_out);\n  end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n  dmax = state.dmax;\n//#endif\n  wsize = state.wsize;\n  whave = state.whave;\n  wnext = state.wnext;\n  s_window = state.window;\n  hold = state.hold;\n  bits = state.bits;\n  lcode = state.lencode;\n  dcode = state.distcode;\n  lmask = (1 << state.lenbits) - 1;\n  dmask = (1 << state.distbits) - 1;\n\n\n  /* decode literals and length/distances until end-of-block or not enough\n     input data or output space */\n\n  top:\n  do {\n    if (bits < 15) {\n      hold += input[_in++] << bits;\n      bits += 8;\n      hold += input[_in++] << bits;\n      bits += 8;\n    }\n\n    here = lcode[hold & lmask];\n\n    dolen:\n    for (;;) { // Goto emulation\n      op = here >>> 24/*here.bits*/;\n      hold >>>= op;\n      bits -= op;\n      op = (here >>> 16) & 0xff/*here.op*/;\n      if (op === 0) {                          /* literal */\n        //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n        //        \"inflate:         literal '%c'\\n\" :\n        //        \"inflate:         literal 0x%02x\\n\", here.val));\n        output[_out++] = here & 0xffff/*here.val*/;\n      }\n      else if (op & 16) {                     /* length base */\n        len = here & 0xffff/*here.val*/;\n        op &= 15;                           /* number of extra bits */\n        if (op) {\n          if (bits < op) {\n            hold += input[_in++] << bits;\n            bits += 8;\n          }\n          len += hold & ((1 << op) - 1);\n          hold >>>= op;\n          bits -= op;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", len));\n        if (bits < 15) {\n          hold += input[_in++] << bits;\n          bits += 8;\n          hold += input[_in++] << bits;\n          bits += 8;\n        }\n        here = dcode[hold & dmask];\n\n        dodist:\n        for (;;) { // goto emulation\n          op = here >>> 24/*here.bits*/;\n          hold >>>= op;\n          bits -= op;\n          op = (here >>> 16) & 0xff/*here.op*/;\n\n          if (op & 16) {                      /* distance base */\n            dist = here & 0xffff/*here.val*/;\n            op &= 15;                       /* number of extra bits */\n            if (bits < op) {\n              hold += input[_in++] << bits;\n              bits += 8;\n              if (bits < op) {\n                hold += input[_in++] << bits;\n                bits += 8;\n              }\n            }\n            dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n            if (dist > dmax) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD;\n              break top;\n            }\n//#endif\n            hold >>>= op;\n            bits -= op;\n            //Tracevv((stderr, \"inflate:         distance %u\\n\", dist));\n            op = _out - beg;                /* max distance in output */\n            if (dist > op) {                /* see if copy from window */\n              op = dist - op;               /* distance back in window */\n              if (op > whave) {\n                if (state.sane) {\n                  strm.msg = 'invalid distance too far back';\n                  state.mode = BAD;\n                  break top;\n                }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//                if (len <= op - whave) {\n//                  do {\n//                    output[_out++] = 0;\n//                  } while (--len);\n//                  continue top;\n//                }\n//                len -= op - whave;\n//                do {\n//                  output[_out++] = 0;\n//                } while (--op > whave);\n//                if (op === 0) {\n//                  from = _out - dist;\n//                  do {\n//                    output[_out++] = output[from++];\n//                  } while (--len);\n//                  continue top;\n//                }\n//#endif\n              }\n              from = 0; // window index\n              from_source = s_window;\n              if (wnext === 0) {           /* very common case */\n                from += wsize - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              else if (wnext < op) {      /* wrap around window */\n                from += wsize + wnext - op;\n                op -= wnext;\n                if (op < len) {         /* some from end of window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = 0;\n                  if (wnext < len) {  /* some from start of window */\n                    op = wnext;\n                    len -= op;\n                    do {\n                      output[_out++] = s_window[from++];\n                    } while (--op);\n                    from = _out - dist;      /* rest from output */\n                    from_source = output;\n                  }\n                }\n              }\n              else {                      /* contiguous in window */\n                from += wnext - op;\n                if (op < len) {         /* some from window */\n                  len -= op;\n                  do {\n                    output[_out++] = s_window[from++];\n                  } while (--op);\n                  from = _out - dist;  /* rest from output */\n                  from_source = output;\n                }\n              }\n              while (len > 2) {\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                output[_out++] = from_source[from++];\n                len -= 3;\n              }\n              if (len) {\n                output[_out++] = from_source[from++];\n                if (len > 1) {\n                  output[_out++] = from_source[from++];\n                }\n              }\n            }\n            else {\n              from = _out - dist;          /* copy direct from output */\n              do {                        /* minimum length is three */\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                output[_out++] = output[from++];\n                len -= 3;\n              } while (len > 2);\n              if (len) {\n                output[_out++] = output[from++];\n                if (len > 1) {\n                  output[_out++] = output[from++];\n                }\n              }\n            }\n          }\n          else if ((op & 64) === 0) {          /* 2nd level distance code */\n            here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n            continue dodist;\n          }\n          else {\n            strm.msg = 'invalid distance code';\n            state.mode = BAD;\n            break top;\n          }\n\n          break; // need to emulate goto via \"continue\"\n        }\n      }\n      else if ((op & 64) === 0) {              /* 2nd level length code */\n        here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n        continue dolen;\n      }\n      else if (op & 32) {                     /* end-of-block */\n        //Tracevv((stderr, \"inflate:         end of block\\n\"));\n        state.mode = TYPE;\n        break top;\n      }\n      else {\n        strm.msg = 'invalid literal/length code';\n        state.mode = BAD;\n        break top;\n      }\n\n      break; // need to emulate goto via \"continue\"\n    }\n  } while (_in < last && _out < end);\n\n  /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n  len = bits >> 3;\n  _in -= len;\n  bits -= len << 3;\n  hold &= (1 << bits) - 1;\n\n  /* update state and return */\n  strm.next_in = _in;\n  strm.next_out = _out;\n  strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n  strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n  state.hold = hold;\n  state.bits = bits;\n  return;\n};\n", "'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\n\nvar MAXBITS = 15;\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\nvar lbase = [ /* Length codes 257..285 base */\n  3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n  35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n];\n\nvar lext = [ /* Length codes 257..285 extra */\n  16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n  19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n];\n\nvar dbase = [ /* Distance codes 0..29 base */\n  1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n  257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n  8193, 12289, 16385, 24577, 0, 0\n];\n\nvar dext = [ /* Distance codes 0..29 extra */\n  16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n  23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n  28, 28, 29, 29, 64, 64\n];\n\nmodule.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)\n{\n  var bits = opts.bits;\n      //here = opts.here; /* table entry for duplication */\n\n  var len = 0;               /* a code's length in bits */\n  var sym = 0;               /* index of code symbols */\n  var min = 0, max = 0;          /* minimum and maximum code lengths */\n  var root = 0;              /* number of index bits for root table */\n  var curr = 0;              /* number of index bits for current table */\n  var drop = 0;              /* code bits to drop for sub-table */\n  var left = 0;                   /* number of prefix codes available */\n  var used = 0;              /* code entries in table used */\n  var huff = 0;              /* Huffman code */\n  var incr;              /* for incrementing code, index */\n  var fill;              /* index for replicating entries */\n  var low;               /* low bits for current root entry */\n  var mask;              /* mask for low root bits */\n  var next;             /* next available space in table */\n  var base = null;     /* base value table to use */\n  var base_index = 0;\n//  var shoextra;    /* extra bits table to use */\n  var end;                    /* use base and extra for symbol > end */\n  var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1];    /* number of codes of each length */\n  var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1];     /* offsets in table for each length */\n  var extra = null;\n  var extra_index = 0;\n\n  var here_bits, here_op, here_val;\n\n  /*\n   Process a set of code lengths to create a canonical Huffman code.  The\n   code lengths are lens[0..codes-1].  Each length corresponds to the\n   symbols 0..codes-1.  The Huffman code is generated by first sorting the\n   symbols by length from short to long, and retaining the symbol order\n   for codes with equal lengths.  Then the code starts with all zero bits\n   for the first code of the shortest length, and the codes are integer\n   increments for the same length, and zeros are appended as the length\n   increases.  For the deflate format, these bits are stored backwards\n   from their more natural integer increment ordering, and so when the\n   decoding tables are built in the large loop below, the integer codes\n   are incremented backwards.\n\n   This routine assumes, but does not check, that all of the entries in\n   lens[] are in the range 0..MAXBITS.  The caller must assure this.\n   1..MAXBITS is interpreted as that code length.  zero means that that\n   symbol does not occur in this code.\n\n   The codes are sorted by computing a count of codes for each length,\n   creating from that a table of starting indices for each length in the\n   sorted table, and then entering the symbols in order in the sorted\n   table.  The sorted table is work[], with that space being provided by\n   the caller.\n\n   The length counts are used for other purposes as well, i.e. finding\n   the minimum and maximum length codes, determining if there are any\n   codes at all, checking for a valid set of lengths, and looking ahead\n   at length counts to determine sub-table sizes when building the\n   decoding tables.\n   */\n\n  /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n  for (len = 0; len <= MAXBITS; len++) {\n    count[len] = 0;\n  }\n  for (sym = 0; sym < codes; sym++) {\n    count[lens[lens_index + sym]]++;\n  }\n\n  /* bound code lengths, force root to be within code lengths */\n  root = bits;\n  for (max = MAXBITS; max >= 1; max--) {\n    if (count[max] !== 0) { break; }\n  }\n  if (root > max) {\n    root = max;\n  }\n  if (max === 0) {                     /* no symbols to code at all */\n    //table.op[opts.table_index] = 64;  //here.op = (var char)64;    /* invalid code marker */\n    //table.bits[opts.table_index] = 1;   //here.bits = (var char)1;\n    //table.val[opts.table_index++] = 0;   //here.val = (var short)0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n    //table.op[opts.table_index] = 64;\n    //table.bits[opts.table_index] = 1;\n    //table.val[opts.table_index++] = 0;\n    table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n    opts.bits = 1;\n    return 0;     /* no symbols, but wait for decoding to report error */\n  }\n  for (min = 1; min < max; min++) {\n    if (count[min] !== 0) { break; }\n  }\n  if (root < min) {\n    root = min;\n  }\n\n  /* check for an over-subscribed or incomplete set of lengths */\n  left = 1;\n  for (len = 1; len <= MAXBITS; len++) {\n    left <<= 1;\n    left -= count[len];\n    if (left < 0) {\n      return -1;\n    }        /* over-subscribed */\n  }\n  if (left > 0 && (type === CODES || max !== 1)) {\n    return -1;                      /* incomplete set */\n  }\n\n  /* generate offsets into symbol table for each length for sorting */\n  offs[1] = 0;\n  for (len = 1; len < MAXBITS; len++) {\n    offs[len + 1] = offs[len] + count[len];\n  }\n\n  /* sort symbols by length, by symbol order within each length */\n  for (sym = 0; sym < codes; sym++) {\n    if (lens[lens_index + sym] !== 0) {\n      work[offs[lens[lens_index + sym]]++] = sym;\n    }\n  }\n\n  /*\n   Create and fill in decoding tables.  In this loop, the table being\n   filled is at next and has curr index bits.  The code being used is huff\n   with length len.  That code is converted to an index by dropping drop\n   bits off of the bottom.  For codes where len is less than drop + curr,\n   those top drop + curr - len bits are incremented through all values to\n   fill the table with replicated entries.\n\n   root is the number of index bits for the root table.  When len exceeds\n   root, sub-tables are created pointed to by the root entry with an index\n   of the low root bits of huff.  This is saved in low to check for when a\n   new sub-table should be started.  drop is zero when the root table is\n   being filled, and drop is root when sub-tables are being filled.\n\n   When a new sub-table is needed, it is necessary to look ahead in the\n   code lengths to determine what size sub-table is needed.  The length\n   counts are used for this, and so count[] is decremented as codes are\n   entered in the tables.\n\n   used keeps track of how many table entries have been allocated from the\n   provided *table space.  It is checked for LENS and DIST tables against\n   the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n   the initial root table size constants.  See the comments in inftrees.h\n   for more information.\n\n   sym increments through all symbols, and the loop terminates when\n   all codes of length max, i.e. all codes, have been processed.  This\n   routine permits incomplete codes, so another loop after this one fills\n   in the rest of the decoding tables with invalid code markers.\n   */\n\n  /* set up for code type */\n  // poor man optimization - use if-else instead of switch,\n  // to avoid deopts in old v8\n  if (type === CODES) {\n    base = extra = work;    /* dummy value--not used */\n    end = 19;\n\n  } else if (type === LENS) {\n    base = lbase;\n    base_index -= 257;\n    extra = lext;\n    extra_index -= 257;\n    end = 256;\n\n  } else {                    /* DISTS */\n    base = dbase;\n    extra = dext;\n    end = -1;\n  }\n\n  /* initialize opts for loop */\n  huff = 0;                   /* starting code */\n  sym = 0;                    /* starting code symbol */\n  len = min;                  /* starting code length */\n  next = table_index;              /* current table to fill in */\n  curr = root;                /* current table index bits */\n  drop = 0;                   /* current bits to drop from code for index */\n  low = -1;                   /* trigger new sub-table when len > root */\n  used = 1 << root;          /* use root table entries */\n  mask = used - 1;            /* mask for comparing low */\n\n  /* check available table space */\n  if ((type === LENS && used > ENOUGH_LENS) ||\n    (type === DISTS && used > ENOUGH_DISTS)) {\n    return 1;\n  }\n\n  /* process all codes and make table entries */\n  for (;;) {\n    /* create table entry */\n    here_bits = len - drop;\n    if (work[sym] < end) {\n      here_op = 0;\n      here_val = work[sym];\n    }\n    else if (work[sym] > end) {\n      here_op = extra[extra_index + work[sym]];\n      here_val = base[base_index + work[sym]];\n    }\n    else {\n      here_op = 32 + 64;         /* end of block */\n      here_val = 0;\n    }\n\n    /* replicate for those indices with low len bits equal to huff */\n    incr = 1 << (len - drop);\n    fill = 1 << curr;\n    min = fill;                 /* save offset to next table */\n    do {\n      fill -= incr;\n      table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n    } while (fill !== 0);\n\n    /* backwards increment the len-bit code huff */\n    incr = 1 << (len - 1);\n    while (huff & incr) {\n      incr >>= 1;\n    }\n    if (incr !== 0) {\n      huff &= incr - 1;\n      huff += incr;\n    } else {\n      huff = 0;\n    }\n\n    /* go to next symbol, update count, len */\n    sym++;\n    if (--count[len] === 0) {\n      if (len === max) { break; }\n      len = lens[lens_index + work[sym]];\n    }\n\n    /* create new sub-table if needed */\n    if (len > root && (huff & mask) !== low) {\n      /* if first time, transition to sub-tables */\n      if (drop === 0) {\n        drop = root;\n      }\n\n      /* increment past last table */\n      next += min;            /* here min is 1 << curr */\n\n      /* determine length of next table */\n      curr = len - drop;\n      left = 1 << curr;\n      while (curr + drop < max) {\n        left -= count[curr + drop];\n        if (left <= 0) { break; }\n        curr++;\n        left <<= 1;\n      }\n\n      /* check for enough space */\n      used += 1 << curr;\n      if ((type === LENS && used > ENOUGH_LENS) ||\n        (type === DISTS && used > ENOUGH_DISTS)) {\n        return 1;\n      }\n\n      /* point entry in root table to sub-table */\n      low = huff & mask;\n      /*table.op[low] = curr;\n      table.bits[low] = root;\n      table.val[low] = next - opts.table_index;*/\n      table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n    }\n  }\n\n  /* fill in remaining table entry if code is incomplete (guaranteed to have\n   at most one remaining entry, since if the code is incomplete, the\n   maximum code length that was allowed to get this far is one bit) */\n  if (huff !== 0) {\n    //table.op[next + huff] = 64;            /* invalid code marker */\n    //table.bits[next + huff] = len - drop;\n    //table.val[next + huff] = 0;\n    table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n  }\n\n  /* set return parameters */\n  //opts.table_index += used;\n  opts.bits = root;\n  return 0;\n};\n", "'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils         = require('../utils/common');\nvar adler32       = require('./adler32');\nvar crc32         = require('./crc32');\nvar inflate_fast  = require('./inffast');\nvar inflate_table = require('./inftrees');\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\n//var Z_NO_FLUSH      = 0;\n//var Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH    = 2;\n//var Z_FULL_FLUSH    = 3;\nvar Z_FINISH        = 4;\nvar Z_BLOCK         = 5;\nvar Z_TREES         = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK            = 0;\nvar Z_STREAM_END    = 1;\nvar Z_NEED_DICT     = 2;\n//var Z_ERRNO         = -1;\nvar Z_STREAM_ERROR  = -2;\nvar Z_DATA_ERROR    = -3;\nvar Z_MEM_ERROR     = -4;\nvar Z_BUF_ERROR     = -5;\n//var Z_VERSION_ERROR = -6;\n\n/* The deflate compression method */\nvar Z_DEFLATED  = 8;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nvar    HEAD = 1;       /* i: waiting for magic header */\nvar    FLAGS = 2;      /* i: waiting for method and flags (gzip) */\nvar    TIME = 3;       /* i: waiting for modification time (gzip) */\nvar    OS = 4;         /* i: waiting for extra flags and operating system (gzip) */\nvar    EXLEN = 5;      /* i: waiting for extra length (gzip) */\nvar    EXTRA = 6;      /* i: waiting for extra bytes (gzip) */\nvar    NAME = 7;       /* i: waiting for end of file name (gzip) */\nvar    COMMENT = 8;    /* i: waiting for end of comment (gzip) */\nvar    HCRC = 9;       /* i: waiting for header crc (gzip) */\nvar    DICTID = 10;    /* i: waiting for dictionary check value */\nvar    DICT = 11;      /* waiting for inflateSetDictionary() call */\nvar        TYPE = 12;      /* i: waiting for type bits, including last-flag bit */\nvar        TYPEDO = 13;    /* i: same, but skip check to exit inflate on new block */\nvar        STORED = 14;    /* i: waiting for stored size (length and complement) */\nvar        COPY_ = 15;     /* i/o: same as COPY below, but only first time in */\nvar        COPY = 16;      /* i/o: waiting for input or output to copy stored block */\nvar        TABLE = 17;     /* i: waiting for dynamic block table lengths */\nvar        LENLENS = 18;   /* i: waiting for code length code lengths */\nvar        CODELENS = 19;  /* i: waiting for length/lit and distance code lengths */\nvar            LEN_ = 20;      /* i: same as LEN below, but only first time in */\nvar            LEN = 21;       /* i: waiting for length/lit/eob code */\nvar            LENEXT = 22;    /* i: waiting for length extra bits */\nvar            DIST = 23;      /* i: waiting for distance code */\nvar            DISTEXT = 24;   /* i: waiting for distance extra bits */\nvar            MATCH = 25;     /* o: waiting for output space to copy string */\nvar            LIT = 26;       /* o: waiting for output space to write literal */\nvar    CHECK = 27;     /* i: waiting for 32-bit check value */\nvar    LENGTH = 28;    /* i: waiting for 32-bit length (gzip) */\nvar    DONE = 29;      /* finished check, done -- remain here until reset */\nvar    BAD = 30;       /* got a data error -- remain here until reset */\nvar    MEM = 31;       /* got an inflate() memory error -- remain here until reset */\nvar    SYNC = 32;      /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH =  (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_WBITS = MAX_WBITS;\n\n\nfunction zswap32(q) {\n  return  (((q >>> 24) & 0xff) +\n          ((q >>> 8) & 0xff00) +\n          ((q & 0xff00) << 8) +\n          ((q & 0xff) << 24));\n}\n\n\nfunction InflateState() {\n  this.mode = 0;             /* current inflate mode */\n  this.last = false;          /* true if processing last block */\n  this.wrap = 0;              /* bit 0 true for zlib, bit 1 true for gzip */\n  this.havedict = false;      /* true if dictionary provided */\n  this.flags = 0;             /* gzip header method and flags (0 if zlib) */\n  this.dmax = 0;              /* zlib header max distance (INFLATE_STRICT) */\n  this.check = 0;             /* protected copy of check value */\n  this.total = 0;             /* protected copy of output count */\n  // TODO: may be {}\n  this.head = null;           /* where to save gzip header information */\n\n  /* sliding window */\n  this.wbits = 0;             /* log base 2 of requested window size */\n  this.wsize = 0;             /* window size or zero if not using window */\n  this.whave = 0;             /* valid bytes in the window */\n  this.wnext = 0;             /* window write index */\n  this.window = null;         /* allocated sliding window, if needed */\n\n  /* bit accumulator */\n  this.hold = 0;              /* input bit accumulator */\n  this.bits = 0;              /* number of bits in \"in\" */\n\n  /* for string and stored block copying */\n  this.length = 0;            /* literal or length of data to copy */\n  this.offset = 0;            /* distance back to copy string from */\n\n  /* for table and code decoding */\n  this.extra = 0;             /* extra bits needed */\n\n  /* fixed and dynamic code tables */\n  this.lencode = null;          /* starting table for length/literal codes */\n  this.distcode = null;         /* starting table for distance codes */\n  this.lenbits = 0;           /* index bits for lencode */\n  this.distbits = 0;          /* index bits for distcode */\n\n  /* dynamic table building */\n  this.ncode = 0;             /* number of code length code lengths */\n  this.nlen = 0;              /* number of length code lengths */\n  this.ndist = 0;             /* number of distance code lengths */\n  this.have = 0;              /* number of code lengths in lens[] */\n  this.next = null;              /* next available space in codes[] */\n\n  this.lens = new utils.Buf16(320); /* temporary storage for code lengths */\n  this.work = new utils.Buf16(288); /* work area for code table building */\n\n  /*\n   because we don't have pointers in js, we use lencode and distcode directly\n   as buffers so we don't need codes\n  */\n  //this.codes = new utils.Buf32(ENOUGH);       /* space for code tables */\n  this.lendyn = null;              /* dynamic table for length/literal codes (JS specific) */\n  this.distdyn = null;             /* dynamic table for distance codes (JS specific) */\n  this.sane = 0;                   /* if false, allow invalid distance too far */\n  this.back = 0;                   /* bits back of last unprocessed length/lit */\n  this.was = 0;                    /* initial length of match */\n}\n\nfunction inflateResetKeep(strm) {\n  var state;\n\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  state = strm.state;\n  strm.total_in = strm.total_out = state.total = 0;\n  strm.msg = ''; /*Z_NULL*/\n  if (state.wrap) {       /* to support ill-conceived Java test suite */\n    strm.adler = state.wrap & 1;\n  }\n  state.mode = HEAD;\n  state.last = 0;\n  state.havedict = 0;\n  state.dmax = 32768;\n  state.head = null/*Z_NULL*/;\n  state.hold = 0;\n  state.bits = 0;\n  //state.lencode = state.distcode = state.next = state.codes;\n  state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);\n  state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);\n\n  state.sane = 1;\n  state.back = -1;\n  //Tracev((stderr, \"inflate: reset\\n\"));\n  return Z_OK;\n}\n\nfunction inflateReset(strm) {\n  var state;\n\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  state = strm.state;\n  state.wsize = 0;\n  state.whave = 0;\n  state.wnext = 0;\n  return inflateResetKeep(strm);\n\n}\n\nfunction inflateReset2(strm, windowBits) {\n  var wrap;\n  var state;\n\n  /* get the state */\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  state = strm.state;\n\n  /* extract wrap request from windowBits parameter */\n  if (windowBits < 0) {\n    wrap = 0;\n    windowBits = -windowBits;\n  }\n  else {\n    wrap = (windowBits >> 4) + 1;\n    if (windowBits < 48) {\n      windowBits &= 15;\n    }\n  }\n\n  /* set number of window bits, free window if different */\n  if (windowBits && (windowBits < 8 || windowBits > 15)) {\n    return Z_STREAM_ERROR;\n  }\n  if (state.window !== null && state.wbits !== windowBits) {\n    state.window = null;\n  }\n\n  /* update state and reset the rest of it */\n  state.wrap = wrap;\n  state.wbits = windowBits;\n  return inflateReset(strm);\n}\n\nfunction inflateInit2(strm, windowBits) {\n  var ret;\n  var state;\n\n  if (!strm) { return Z_STREAM_ERROR; }\n  //strm.msg = Z_NULL;                 /* in case we return an error */\n\n  state = new InflateState();\n\n  //if (state === Z_NULL) return Z_MEM_ERROR;\n  //Tracev((stderr, \"inflate: allocated\\n\"));\n  strm.state = state;\n  state.window = null/*Z_NULL*/;\n  ret = inflateReset2(strm, windowBits);\n  if (ret !== Z_OK) {\n    strm.state = null/*Z_NULL*/;\n  }\n  return ret;\n}\n\nfunction inflateInit(strm) {\n  return inflateInit2(strm, DEF_WBITS);\n}\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding.  Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter.  This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time.  However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nvar virgin = true;\n\nvar lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\nfunction fixedtables(state) {\n  /* build fixed huffman tables if first call (may not be thread safe) */\n  if (virgin) {\n    var sym;\n\n    lenfix = new utils.Buf32(512);\n    distfix = new utils.Buf32(32);\n\n    /* literal/length table */\n    sym = 0;\n    while (sym < 144) { state.lens[sym++] = 8; }\n    while (sym < 256) { state.lens[sym++] = 9; }\n    while (sym < 280) { state.lens[sym++] = 7; }\n    while (sym < 288) { state.lens[sym++] = 8; }\n\n    inflate_table(LENS,  state.lens, 0, 288, lenfix,   0, state.work, { bits: 9 });\n\n    /* distance table */\n    sym = 0;\n    while (sym < 32) { state.lens[sym++] = 5; }\n\n    inflate_table(DISTS, state.lens, 0, 32,   distfix, 0, state.work, { bits: 5 });\n\n    /* do this just once */\n    virgin = false;\n  }\n\n  state.lencode = lenfix;\n  state.lenbits = 9;\n  state.distcode = distfix;\n  state.distbits = 5;\n}\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning.  If window does not exist yet, create it.  This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nfunction updatewindow(strm, src, end, copy) {\n  var dist;\n  var state = strm.state;\n\n  /* if it hasn't been done already, allocate space for the window */\n  if (state.window === null) {\n    state.wsize = 1 << state.wbits;\n    state.wnext = 0;\n    state.whave = 0;\n\n    state.window = new utils.Buf8(state.wsize);\n  }\n\n  /* copy state->wsize or less output bytes into the circular window */\n  if (copy >= state.wsize) {\n    utils.arraySet(state.window, src, end - state.wsize, state.wsize, 0);\n    state.wnext = 0;\n    state.whave = state.wsize;\n  }\n  else {\n    dist = state.wsize - state.wnext;\n    if (dist > copy) {\n      dist = copy;\n    }\n    //zmemcpy(state->window + state->wnext, end - copy, dist);\n    utils.arraySet(state.window, src, end - copy, dist, state.wnext);\n    copy -= dist;\n    if (copy) {\n      //zmemcpy(state->window, end - copy, copy);\n      utils.arraySet(state.window, src, end - copy, copy, 0);\n      state.wnext = copy;\n      state.whave = state.wsize;\n    }\n    else {\n      state.wnext += dist;\n      if (state.wnext === state.wsize) { state.wnext = 0; }\n      if (state.whave < state.wsize) { state.whave += dist; }\n    }\n  }\n  return 0;\n}\n\nfunction inflate(strm, flush) {\n  var state;\n  var input, output;          // input/output buffers\n  var next;                   /* next input INDEX */\n  var put;                    /* next output INDEX */\n  var have, left;             /* available input and output */\n  var hold;                   /* bit buffer */\n  var bits;                   /* bits in bit buffer */\n  var _in, _out;              /* save starting available input and output */\n  var copy;                   /* number of stored or match bytes to copy */\n  var from;                   /* where to copy match bytes from */\n  var from_source;\n  var here = 0;               /* current decoding table entry */\n  var here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n  //var last;                   /* parent table entry */\n  var last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n  var len;                    /* length to copy for repeats, bits to drop */\n  var ret;                    /* return code */\n  var hbuf = new utils.Buf8(4);    /* buffer for gzip header crc calculation */\n  var opts;\n\n  var n; // temporary var for NEED_BITS\n\n  var order = /* permutation of code lengths */\n    [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ];\n\n\n  if (!strm || !strm.state || !strm.output ||\n      (!strm.input && strm.avail_in !== 0)) {\n    return Z_STREAM_ERROR;\n  }\n\n  state = strm.state;\n  if (state.mode === TYPE) { state.mode = TYPEDO; }    /* skip check */\n\n\n  //--- LOAD() ---\n  put = strm.next_out;\n  output = strm.output;\n  left = strm.avail_out;\n  next = strm.next_in;\n  input = strm.input;\n  have = strm.avail_in;\n  hold = state.hold;\n  bits = state.bits;\n  //---\n\n  _in = have;\n  _out = left;\n  ret = Z_OK;\n\n  inf_leave: // goto emulation\n  for (;;) {\n    switch (state.mode) {\n      case HEAD:\n        if (state.wrap === 0) {\n          state.mode = TYPEDO;\n          break;\n        }\n        //=== NEEDBITS(16);\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((state.wrap & 2) && hold === 0x8b1f) {  /* gzip header */\n          state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32(state.check, hbuf, 2, 0);\n          //===//\n\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          state.mode = FLAGS;\n          break;\n        }\n        state.flags = 0;           /* expect zlib header */\n        if (state.head) {\n          state.head.done = false;\n        }\n        if (!(state.wrap & 1) ||   /* check if zlib header allowed */\n          (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n          strm.msg = 'incorrect header check';\n          state.mode = BAD;\n          break;\n        }\n        if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n        len = (hold & 0x0f)/*BITS(4)*/ + 8;\n        if (state.wbits === 0) {\n          state.wbits = len;\n        }\n        else if (len > state.wbits) {\n          strm.msg = 'invalid window size';\n          state.mode = BAD;\n          break;\n        }\n        state.dmax = 1 << len;\n        //Tracev((stderr, \"inflate:   zlib header ok\\n\"));\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = hold & 0x200 ? DICTID : TYPE;\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        break;\n      case FLAGS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.flags = hold;\n        if ((state.flags & 0xff) !== Z_DEFLATED) {\n          strm.msg = 'unknown compression method';\n          state.mode = BAD;\n          break;\n        }\n        if (state.flags & 0xe000) {\n          strm.msg = 'unknown header flags set';\n          state.mode = BAD;\n          break;\n        }\n        if (state.head) {\n          state.head.text = ((hold >> 8) & 1);\n        }\n        if (state.flags & 0x0200) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = TIME;\n        /* falls through */\n      case TIME:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.time = hold;\n        }\n        if (state.flags & 0x0200) {\n          //=== CRC4(state.check, hold)\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          hbuf[2] = (hold >>> 16) & 0xff;\n          hbuf[3] = (hold >>> 24) & 0xff;\n          state.check = crc32(state.check, hbuf, 4, 0);\n          //===\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = OS;\n        /* falls through */\n      case OS:\n        //=== NEEDBITS(16); */\n        while (bits < 16) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if (state.head) {\n          state.head.xflags = (hold & 0xff);\n          state.head.os = (hold >> 8);\n        }\n        if (state.flags & 0x0200) {\n          //=== CRC2(state.check, hold);\n          hbuf[0] = hold & 0xff;\n          hbuf[1] = (hold >>> 8) & 0xff;\n          state.check = crc32(state.check, hbuf, 2, 0);\n          //===//\n        }\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = EXLEN;\n        /* falls through */\n      case EXLEN:\n        if (state.flags & 0x0400) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length = hold;\n          if (state.head) {\n            state.head.extra_len = hold;\n          }\n          if (state.flags & 0x0200) {\n            //=== CRC2(state.check, hold);\n            hbuf[0] = hold & 0xff;\n            hbuf[1] = (hold >>> 8) & 0xff;\n            state.check = crc32(state.check, hbuf, 2, 0);\n            //===//\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        else if (state.head) {\n          state.head.extra = null/*Z_NULL*/;\n        }\n        state.mode = EXTRA;\n        /* falls through */\n      case EXTRA:\n        if (state.flags & 0x0400) {\n          copy = state.length;\n          if (copy > have) { copy = have; }\n          if (copy) {\n            if (state.head) {\n              len = state.head.extra_len - state.length;\n              if (!state.head.extra) {\n                // Use untyped array for more convenient processing later\n                state.head.extra = new Array(state.head.extra_len);\n              }\n              utils.arraySet(\n                state.head.extra,\n                input,\n                next,\n                // extra field is limited to 65536 bytes\n                // - no need for additional size check\n                copy,\n                /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n                len\n              );\n              //zmemcpy(state.head.extra + len, next,\n              //        len + copy > state.head.extra_max ?\n              //        state.head.extra_max - len : copy);\n            }\n            if (state.flags & 0x0200) {\n              state.check = crc32(state.check, input, copy, next);\n            }\n            have -= copy;\n            next += copy;\n            state.length -= copy;\n          }\n          if (state.length) { break inf_leave; }\n        }\n        state.length = 0;\n        state.mode = NAME;\n        /* falls through */\n      case NAME:\n        if (state.flags & 0x0800) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            // TODO: 2 or 1 bytes?\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.name_max*/)) {\n              state.head.name += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n\n          if (state.flags & 0x0200) {\n            state.check = crc32(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.name = null;\n        }\n        state.length = 0;\n        state.mode = COMMENT;\n        /* falls through */\n      case COMMENT:\n        if (state.flags & 0x1000) {\n          if (have === 0) { break inf_leave; }\n          copy = 0;\n          do {\n            len = input[next + copy++];\n            /* use constant limit because in js we should not preallocate memory */\n            if (state.head && len &&\n                (state.length < 65536 /*state.head.comm_max*/)) {\n              state.head.comment += String.fromCharCode(len);\n            }\n          } while (len && copy < have);\n          if (state.flags & 0x0200) {\n            state.check = crc32(state.check, input, copy, next);\n          }\n          have -= copy;\n          next += copy;\n          if (len) { break inf_leave; }\n        }\n        else if (state.head) {\n          state.head.comment = null;\n        }\n        state.mode = HCRC;\n        /* falls through */\n      case HCRC:\n        if (state.flags & 0x0200) {\n          //=== NEEDBITS(16); */\n          while (bits < 16) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if (hold !== (state.check & 0xffff)) {\n            strm.msg = 'header crc mismatch';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n        }\n        if (state.head) {\n          state.head.hcrc = ((state.flags >> 9) & 1);\n          state.head.done = true;\n        }\n        strm.adler = state.check = 0;\n        state.mode = TYPE;\n        break;\n      case DICTID:\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        strm.adler = state.check = zswap32(hold);\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = DICT;\n        /* falls through */\n      case DICT:\n        if (state.havedict === 0) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          return Z_NEED_DICT;\n        }\n        strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n        state.mode = TYPE;\n        /* falls through */\n      case TYPE:\n        if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case TYPEDO:\n        if (state.last) {\n          //--- BYTEBITS() ---//\n          hold >>>= bits & 7;\n          bits -= bits & 7;\n          //---//\n          state.mode = CHECK;\n          break;\n        }\n        //=== NEEDBITS(3); */\n        while (bits < 3) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.last = (hold & 0x01)/*BITS(1)*/;\n        //--- DROPBITS(1) ---//\n        hold >>>= 1;\n        bits -= 1;\n        //---//\n\n        switch ((hold & 0x03)/*BITS(2)*/) {\n          case 0:                             /* stored block */\n            //Tracev((stderr, \"inflate:     stored block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = STORED;\n            break;\n          case 1:                             /* fixed block */\n            fixedtables(state);\n            //Tracev((stderr, \"inflate:     fixed codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = LEN_;             /* decode codes */\n            if (flush === Z_TREES) {\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n              break inf_leave;\n            }\n            break;\n          case 2:                             /* dynamic block */\n            //Tracev((stderr, \"inflate:     dynamic codes block%s\\n\",\n            //        state.last ? \" (last)\" : \"\"));\n            state.mode = TABLE;\n            break;\n          case 3:\n            strm.msg = 'invalid block type';\n            state.mode = BAD;\n        }\n        //--- DROPBITS(2) ---//\n        hold >>>= 2;\n        bits -= 2;\n        //---//\n        break;\n      case STORED:\n        //--- BYTEBITS() ---// /* go to byte boundary */\n        hold >>>= bits & 7;\n        bits -= bits & 7;\n        //---//\n        //=== NEEDBITS(32); */\n        while (bits < 32) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n          strm.msg = 'invalid stored block lengths';\n          state.mode = BAD;\n          break;\n        }\n        state.length = hold & 0xffff;\n        //Tracev((stderr, \"inflate:       stored length %u\\n\",\n        //        state.length));\n        //=== INITBITS();\n        hold = 0;\n        bits = 0;\n        //===//\n        state.mode = COPY_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case COPY_:\n        state.mode = COPY;\n        /* falls through */\n      case COPY:\n        copy = state.length;\n        if (copy) {\n          if (copy > have) { copy = have; }\n          if (copy > left) { copy = left; }\n          if (copy === 0) { break inf_leave; }\n          //--- zmemcpy(put, next, copy); ---\n          utils.arraySet(output, input, next, copy, put);\n          //---//\n          have -= copy;\n          next += copy;\n          left -= copy;\n          put += copy;\n          state.length -= copy;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       stored end\\n\"));\n        state.mode = TYPE;\n        break;\n      case TABLE:\n        //=== NEEDBITS(14); */\n        while (bits < 14) {\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n        }\n        //===//\n        state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n        //--- DROPBITS(5) ---//\n        hold >>>= 5;\n        bits -= 5;\n        //---//\n        state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n        //--- DROPBITS(4) ---//\n        hold >>>= 4;\n        bits -= 4;\n        //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n        if (state.nlen > 286 || state.ndist > 30) {\n          strm.msg = 'too many length or distance symbols';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracev((stderr, \"inflate:       table sizes ok\\n\"));\n        state.have = 0;\n        state.mode = LENLENS;\n        /* falls through */\n      case LENLENS:\n        while (state.have < state.ncode) {\n          //=== NEEDBITS(3);\n          while (bits < 3) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n          //--- DROPBITS(3) ---//\n          hold >>>= 3;\n          bits -= 3;\n          //---//\n        }\n        while (state.have < 19) {\n          state.lens[order[state.have++]] = 0;\n        }\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        //state.next = state.codes;\n        //state.lencode = state.next;\n        // Switch to use dynamic table\n        state.lencode = state.lendyn;\n        state.lenbits = 7;\n\n        opts = { bits: state.lenbits };\n        ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n        state.lenbits = opts.bits;\n\n        if (ret) {\n          strm.msg = 'invalid code lengths set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, \"inflate:       code lengths ok\\n\"));\n        state.have = 0;\n        state.mode = CODELENS;\n        /* falls through */\n      case CODELENS:\n        while (state.have < state.nlen + state.ndist) {\n          for (;;) {\n            here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          if (here_val < 16) {\n            //--- DROPBITS(here.bits) ---//\n            hold >>>= here_bits;\n            bits -= here_bits;\n            //---//\n            state.lens[state.have++] = here_val;\n          }\n          else {\n            if (here_val === 16) {\n              //=== NEEDBITS(here.bits + 2);\n              n = here_bits + 2;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              if (state.have === 0) {\n                strm.msg = 'invalid bit length repeat';\n                state.mode = BAD;\n                break;\n              }\n              len = state.lens[state.have - 1];\n              copy = 3 + (hold & 0x03);//BITS(2);\n              //--- DROPBITS(2) ---//\n              hold >>>= 2;\n              bits -= 2;\n              //---//\n            }\n            else if (here_val === 17) {\n              //=== NEEDBITS(here.bits + 3);\n              n = here_bits + 3;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 3 + (hold & 0x07);//BITS(3);\n              //--- DROPBITS(3) ---//\n              hold >>>= 3;\n              bits -= 3;\n              //---//\n            }\n            else {\n              //=== NEEDBITS(here.bits + 7);\n              n = here_bits + 7;\n              while (bits < n) {\n                if (have === 0) { break inf_leave; }\n                have--;\n                hold += input[next++] << bits;\n                bits += 8;\n              }\n              //===//\n              //--- DROPBITS(here.bits) ---//\n              hold >>>= here_bits;\n              bits -= here_bits;\n              //---//\n              len = 0;\n              copy = 11 + (hold & 0x7f);//BITS(7);\n              //--- DROPBITS(7) ---//\n              hold >>>= 7;\n              bits -= 7;\n              //---//\n            }\n            if (state.have + copy > state.nlen + state.ndist) {\n              strm.msg = 'invalid bit length repeat';\n              state.mode = BAD;\n              break;\n            }\n            while (copy--) {\n              state.lens[state.have++] = len;\n            }\n          }\n        }\n\n        /* handle error breaks in while */\n        if (state.mode === BAD) { break; }\n\n        /* check for end-of-block code (better have one) */\n        if (state.lens[256] === 0) {\n          strm.msg = 'invalid code -- missing end-of-block';\n          state.mode = BAD;\n          break;\n        }\n\n        /* build code tables -- note: do not change the lenbits or distbits\n           values here (9 and 6) without reading the comments in inftrees.h\n           concerning the ENOUGH constants, which depend on those values */\n        state.lenbits = 9;\n\n        opts = { bits: state.lenbits };\n        ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.lenbits = opts.bits;\n        // state.lencode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid literal/lengths set';\n          state.mode = BAD;\n          break;\n        }\n\n        state.distbits = 6;\n        //state.distcode.copy(state.codes);\n        // Switch to use dynamic table\n        state.distcode = state.distdyn;\n        opts = { bits: state.distbits };\n        ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n        // We have separate tables & no pointers. 2 commented lines below not needed.\n        // state.next_index = opts.table_index;\n        state.distbits = opts.bits;\n        // state.distcode = state.next;\n\n        if (ret) {\n          strm.msg = 'invalid distances set';\n          state.mode = BAD;\n          break;\n        }\n        //Tracev((stderr, 'inflate:       codes ok\\n'));\n        state.mode = LEN_;\n        if (flush === Z_TREES) { break inf_leave; }\n        /* falls through */\n      case LEN_:\n        state.mode = LEN;\n        /* falls through */\n      case LEN:\n        if (have >= 6 && left >= 258) {\n          //--- RESTORE() ---\n          strm.next_out = put;\n          strm.avail_out = left;\n          strm.next_in = next;\n          strm.avail_in = have;\n          state.hold = hold;\n          state.bits = bits;\n          //---\n          inflate_fast(strm, _out);\n          //--- LOAD() ---\n          put = strm.next_out;\n          output = strm.output;\n          left = strm.avail_out;\n          next = strm.next_in;\n          input = strm.input;\n          have = strm.avail_in;\n          hold = state.hold;\n          bits = state.bits;\n          //---\n\n          if (state.mode === TYPE) {\n            state.back = -1;\n          }\n          break;\n        }\n        state.back = 0;\n        for (;;) {\n          here = state.lencode[hold & ((1 << state.lenbits) - 1)];  /*BITS(state.lenbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if (here_bits <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if (here_op && (here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.lencode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        state.length = here_val;\n        if (here_op === 0) {\n          //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n          //        \"inflate:         literal '%c'\\n\" :\n          //        \"inflate:         literal 0x%02x\\n\", here.val));\n          state.mode = LIT;\n          break;\n        }\n        if (here_op & 32) {\n          //Tracevv((stderr, \"inflate:         end of block\\n\"));\n          state.back = -1;\n          state.mode = TYPE;\n          break;\n        }\n        if (here_op & 64) {\n          strm.msg = 'invalid literal/length code';\n          state.mode = BAD;\n          break;\n        }\n        state.extra = here_op & 15;\n        state.mode = LENEXT;\n        /* falls through */\n      case LENEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n        //Tracevv((stderr, \"inflate:         length %u\\n\", state.length));\n        state.was = state.length;\n        state.mode = DIST;\n        /* falls through */\n      case DIST:\n        for (;;) {\n          here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n          here_bits = here >>> 24;\n          here_op = (here >>> 16) & 0xff;\n          here_val = here & 0xffff;\n\n          if ((here_bits) <= bits) { break; }\n          //--- PULLBYTE() ---//\n          if (have === 0) { break inf_leave; }\n          have--;\n          hold += input[next++] << bits;\n          bits += 8;\n          //---//\n        }\n        if ((here_op & 0xf0) === 0) {\n          last_bits = here_bits;\n          last_op = here_op;\n          last_val = here_val;\n          for (;;) {\n            here = state.distcode[last_val +\n                    ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n            here_bits = here >>> 24;\n            here_op = (here >>> 16) & 0xff;\n            here_val = here & 0xffff;\n\n            if ((last_bits + here_bits) <= bits) { break; }\n            //--- PULLBYTE() ---//\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n            //---//\n          }\n          //--- DROPBITS(last.bits) ---//\n          hold >>>= last_bits;\n          bits -= last_bits;\n          //---//\n          state.back += last_bits;\n        }\n        //--- DROPBITS(here.bits) ---//\n        hold >>>= here_bits;\n        bits -= here_bits;\n        //---//\n        state.back += here_bits;\n        if (here_op & 64) {\n          strm.msg = 'invalid distance code';\n          state.mode = BAD;\n          break;\n        }\n        state.offset = here_val;\n        state.extra = (here_op) & 15;\n        state.mode = DISTEXT;\n        /* falls through */\n      case DISTEXT:\n        if (state.extra) {\n          //=== NEEDBITS(state.extra);\n          n = state.extra;\n          while (bits < n) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n          //--- DROPBITS(state.extra) ---//\n          hold >>>= state.extra;\n          bits -= state.extra;\n          //---//\n          state.back += state.extra;\n        }\n//#ifdef INFLATE_STRICT\n        if (state.offset > state.dmax) {\n          strm.msg = 'invalid distance too far back';\n          state.mode = BAD;\n          break;\n        }\n//#endif\n        //Tracevv((stderr, \"inflate:         distance %u\\n\", state.offset));\n        state.mode = MATCH;\n        /* falls through */\n      case MATCH:\n        if (left === 0) { break inf_leave; }\n        copy = _out - left;\n        if (state.offset > copy) {         /* copy from window */\n          copy = state.offset - copy;\n          if (copy > state.whave) {\n            if (state.sane) {\n              strm.msg = 'invalid distance too far back';\n              state.mode = BAD;\n              break;\n            }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n//          Trace((stderr, \"inflate.c too far\\n\"));\n//          copy -= state.whave;\n//          if (copy > state.length) { copy = state.length; }\n//          if (copy > left) { copy = left; }\n//          left -= copy;\n//          state.length -= copy;\n//          do {\n//            output[put++] = 0;\n//          } while (--copy);\n//          if (state.length === 0) { state.mode = LEN; }\n//          break;\n//#endif\n          }\n          if (copy > state.wnext) {\n            copy -= state.wnext;\n            from = state.wsize - copy;\n          }\n          else {\n            from = state.wnext - copy;\n          }\n          if (copy > state.length) { copy = state.length; }\n          from_source = state.window;\n        }\n        else {                              /* copy from output */\n          from_source = output;\n          from = put - state.offset;\n          copy = state.length;\n        }\n        if (copy > left) { copy = left; }\n        left -= copy;\n        state.length -= copy;\n        do {\n          output[put++] = from_source[from++];\n        } while (--copy);\n        if (state.length === 0) { state.mode = LEN; }\n        break;\n      case LIT:\n        if (left === 0) { break inf_leave; }\n        output[put++] = state.length;\n        left--;\n        state.mode = LEN;\n        break;\n      case CHECK:\n        if (state.wrap) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            // Use '|' instead of '+' to make sure that result is signed\n            hold |= input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          _out -= left;\n          strm.total_out += _out;\n          state.total += _out;\n          if (_out) {\n            strm.adler = state.check =\n                /*UPDATE(state.check, put - _out, _out);*/\n                (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out));\n\n          }\n          _out = left;\n          // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n          if ((state.flags ? hold : zswap32(hold)) !== state.check) {\n            strm.msg = 'incorrect data check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   check matches trailer\\n\"));\n        }\n        state.mode = LENGTH;\n        /* falls through */\n      case LENGTH:\n        if (state.wrap && state.flags) {\n          //=== NEEDBITS(32);\n          while (bits < 32) {\n            if (have === 0) { break inf_leave; }\n            have--;\n            hold += input[next++] << bits;\n            bits += 8;\n          }\n          //===//\n          if (hold !== (state.total & 0xffffffff)) {\n            strm.msg = 'incorrect length check';\n            state.mode = BAD;\n            break;\n          }\n          //=== INITBITS();\n          hold = 0;\n          bits = 0;\n          //===//\n          //Tracev((stderr, \"inflate:   length matches trailer\\n\"));\n        }\n        state.mode = DONE;\n        /* falls through */\n      case DONE:\n        ret = Z_STREAM_END;\n        break inf_leave;\n      case BAD:\n        ret = Z_DATA_ERROR;\n        break inf_leave;\n      case MEM:\n        return Z_MEM_ERROR;\n      case SYNC:\n        /* falls through */\n      default:\n        return Z_STREAM_ERROR;\n    }\n  }\n\n  // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n  /*\n     Return from inflate(), updating the total counts and the check value.\n     If there was no progress during the inflate() call, return a buffer\n     error.  Call updatewindow() to create and/or update the window state.\n     Note: a memory error from inflate() is non-recoverable.\n   */\n\n  //--- RESTORE() ---\n  strm.next_out = put;\n  strm.avail_out = left;\n  strm.next_in = next;\n  strm.avail_in = have;\n  state.hold = hold;\n  state.bits = bits;\n  //---\n\n  if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n                      (state.mode < CHECK || flush !== Z_FINISH))) {\n    if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) {\n      state.mode = MEM;\n      return Z_MEM_ERROR;\n    }\n  }\n  _in -= strm.avail_in;\n  _out -= strm.avail_out;\n  strm.total_in += _in;\n  strm.total_out += _out;\n  state.total += _out;\n  if (state.wrap && _out) {\n    strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/\n      (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out));\n  }\n  strm.data_type = state.bits + (state.last ? 64 : 0) +\n                    (state.mode === TYPE ? 128 : 0) +\n                    (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n  if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) {\n    ret = Z_BUF_ERROR;\n  }\n  return ret;\n}\n\nfunction inflateEnd(strm) {\n\n  if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {\n    return Z_STREAM_ERROR;\n  }\n\n  var state = strm.state;\n  if (state.window) {\n    state.window = null;\n  }\n  strm.state = null;\n  return Z_OK;\n}\n\nfunction inflateGetHeader(strm, head) {\n  var state;\n\n  /* check state */\n  if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n  state = strm.state;\n  if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }\n\n  /* save header structure */\n  state.head = head;\n  head.done = false;\n  return Z_OK;\n}\n\nfunction inflateSetDictionary(strm, dictionary) {\n  var dictLength = dictionary.length;\n\n  var state;\n  var dictid;\n  var ret;\n\n  /* check state */\n  if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR; }\n  state = strm.state;\n\n  if (state.wrap !== 0 && state.mode !== DICT) {\n    return Z_STREAM_ERROR;\n  }\n\n  /* check for correct dictionary identifier */\n  if (state.mode === DICT) {\n    dictid = 1; /* adler32(0, null, 0)*/\n    /* dictid = adler32(dictid, dictionary, dictLength); */\n    dictid = adler32(dictid, dictionary, dictLength, 0);\n    if (dictid !== state.check) {\n      return Z_DATA_ERROR;\n    }\n  }\n  /* copy dictionary to window using updatewindow(), which will amend the\n   existing dictionary if appropriate */\n  ret = updatewindow(strm, dictionary, dictLength, dictLength);\n  if (ret) {\n    state.mode = MEM;\n    return Z_MEM_ERROR;\n  }\n  state.havedict = 1;\n  // Tracev((stderr, \"inflate:   dictionary set\\n\"));\n  return Z_OK;\n}\n\nexports.inflateReset = inflateReset;\nexports.inflateReset2 = inflateReset2;\nexports.inflateResetKeep = inflateResetKeep;\nexports.inflateInit = inflateInit;\nexports.inflateInit2 = inflateInit2;\nexports.inflate = inflate;\nexports.inflateEnd = inflateEnd;\nexports.inflateGetHeader = inflateGetHeader;\nexports.inflateSetDictionary = inflateSetDictionary;\nexports.inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nexports.inflateCopy = inflateCopy;\nexports.inflateGetDictionary = inflateGetDictionary;\nexports.inflateMark = inflateMark;\nexports.inflatePrime = inflatePrime;\nexports.inflateSync = inflateSync;\nexports.inflateSyncPoint = inflateSyncPoint;\nexports.inflateUndermine = inflateUndermine;\n*/\n", "'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n\n  /* Allowed flush values; see deflate() and inflate() below for details */\n  Z_NO_FLUSH:         0,\n  Z_PARTIAL_FLUSH:    1,\n  Z_SYNC_FLUSH:       2,\n  Z_FULL_FLUSH:       3,\n  Z_FINISH:           4,\n  Z_BLOCK:            5,\n  Z_TREES:            6,\n\n  /* Return codes for the compression/decompression functions. Negative values\n  * are errors, positive values are used for special but normal events.\n  */\n  Z_OK:               0,\n  Z_STREAM_END:       1,\n  Z_NEED_DICT:        2,\n  Z_ERRNO:           -1,\n  Z_STREAM_ERROR:    -2,\n  Z_DATA_ERROR:      -3,\n  //Z_MEM_ERROR:     -4,\n  Z_BUF_ERROR:       -5,\n  //Z_VERSION_ERROR: -6,\n\n  /* compression levels */\n  Z_NO_COMPRESSION:         0,\n  Z_BEST_SPEED:             1,\n  Z_BEST_COMPRESSION:       9,\n  Z_DEFAULT_COMPRESSION:   -1,\n\n\n  Z_FILTERED:               1,\n  Z_HUFFMAN_ONLY:           2,\n  Z_RLE:                    3,\n  Z_FIXED:                  4,\n  Z_DEFAULT_STRATEGY:       0,\n\n  /* Possible values of the data_type field (though see inflate()) */\n  Z_BINARY:                 0,\n  Z_TEXT:                   1,\n  //Z_ASCII:                1, // = Z_TEXT (deprecated)\n  Z_UNKNOWN:                2,\n\n  /* The deflate compression method */\n  Z_DEFLATED:               8\n  //Z_NULL:                 null // Use -1 or null inline, depending on var type\n};\n", "'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n//   claim that you wrote the original software. If you use this software\n//   in a product, an acknowledgment in the product documentation would be\n//   appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n//   misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n  /* true if compressed data believed to be text */\n  this.text       = 0;\n  /* modification time */\n  this.time       = 0;\n  /* extra flags (not used when writing a gzip file) */\n  this.xflags     = 0;\n  /* operating system */\n  this.os         = 0;\n  /* pointer to extra field or Z_NULL if none */\n  this.extra      = null;\n  /* extra field length (valid if extra != Z_NULL) */\n  this.extra_len  = 0; // Actually, we don't need it in JS,\n                       // but leave for few code modifications\n\n  //\n  // Setup limits is not necessary because in js we should not preallocate memory\n  // for inflate use constant limit in 65536 bytes\n  //\n\n  /* space at extra (only when reading header) */\n  // this.extra_max  = 0;\n  /* pointer to zero-terminated file name or Z_NULL */\n  this.name       = '';\n  /* space at name (only when reading header) */\n  // this.name_max   = 0;\n  /* pointer to zero-terminated comment or Z_NULL */\n  this.comment    = '';\n  /* space at comment (only when reading header) */\n  // this.comm_max   = 0;\n  /* true if there was or will be a header crc */\n  this.hcrc       = 0;\n  /* true when done reading gzip header (not used when writing a gzip file) */\n  this.done       = false;\n}\n\nmodule.exports = GZheader;\n", "'use strict';\n\n\nvar zlib_inflate = require('./zlib/inflate');\nvar utils        = require('./utils/common');\nvar strings      = require('./utils/strings');\nvar c            = require('./zlib/constants');\nvar msg          = require('./zlib/messages');\nvar ZStream      = require('./zlib/zstream');\nvar GZheader     = require('./zlib/gzheader');\n\nvar toString = Object.prototype.toString;\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param) or if you\n * push a chunk with explicit flush (call [[Inflate#push]] with\n * `Z_SYNC_FLUSH` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n *   , chunk1 = Uint8Array([1,2,3,4,5,6,7,8,9])\n *   , chunk2 = Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * var inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true);  // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate(options) {\n  if (!(this instanceof Inflate)) return new Inflate(options);\n\n  this.options = utils.assign({\n    chunkSize: 16384,\n    windowBits: 0,\n    to: ''\n  }, options || {});\n\n  var opt = this.options;\n\n  // Force window size for `raw` data, if not set directly,\n  // because we have no header for autodetect.\n  if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n    opt.windowBits = -opt.windowBits;\n    if (opt.windowBits === 0) { opt.windowBits = -15; }\n  }\n\n  // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n  if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n      !(options && options.windowBits)) {\n    opt.windowBits += 32;\n  }\n\n  // Gzip header has no info about windows size, we can do autodetect only\n  // for deflate. So, if window size not set, force it to max when gzip possible\n  if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n    // bit 3 (16) -> gzipped data\n    // bit 4 (32) -> autodetect gzip/deflate\n    if ((opt.windowBits & 15) === 0) {\n      opt.windowBits |= 15;\n    }\n  }\n\n  this.err    = 0;      // error code, if happens (0 = Z_OK)\n  this.msg    = '';     // error message\n  this.ended  = false;  // used to avoid multiple onEnd() calls\n  this.chunks = [];     // chunks of compressed data\n\n  this.strm   = new ZStream();\n  this.strm.avail_out = 0;\n\n  var status  = zlib_inflate.inflateInit2(\n    this.strm,\n    opt.windowBits\n  );\n\n  if (status !== c.Z_OK) {\n    throw new Error(msg[status]);\n  }\n\n  this.header = new GZheader();\n\n  zlib_inflate.inflateGetHeader(this.strm, this.header);\n\n  // Setup dictionary\n  if (opt.dictionary) {\n    // Convert data if needed\n    if (typeof opt.dictionary === 'string') {\n      opt.dictionary = strings.string2buf(opt.dictionary);\n    } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n      opt.dictionary = new Uint8Array(opt.dictionary);\n    }\n    if (opt.raw) { //In raw mode we need to set the dictionary early\n      status = zlib_inflate.inflateSetDictionary(this.strm, opt.dictionary);\n      if (status !== c.Z_OK) {\n        throw new Error(msg[status]);\n      }\n    }\n  }\n}\n\n/**\n * Inflate#push(data[, mode]) -> Boolean\n * - data (Uint8Array|Array|ArrayBuffer|String): input data\n * - mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n *   See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. The last data block must have\n * mode Z_FINISH (or `true`). That will flush internal pending buffers and call\n * [[Inflate#onEnd]]. For interim explicit flushes (without ending the stream) you\n * can use mode Z_SYNC_FLUSH, keeping the decompression context.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * We strongly recommend to use `Uint8Array` on input for best speed (output\n * format is detected automatically). Also, don't skip last param and always\n * use the same type in your code (boolean or number). That will improve JS speed.\n *\n * For regular `Array`-s make sure all elements are [0..255].\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true);  // push last chunk\n * ```\n **/\nInflate.prototype.push = function (data, mode) {\n  var strm = this.strm;\n  var chunkSize = this.options.chunkSize;\n  var dictionary = this.options.dictionary;\n  var status, _mode;\n  var next_out_utf8, tail, utf8str;\n\n  // Flag to properly process Z_BUF_ERROR on testing inflate call\n  // when we check that all output data was flushed.\n  var allowBufError = false;\n\n  if (this.ended) { return false; }\n  _mode = (mode === ~~mode) ? mode : ((mode === true) ? c.Z_FINISH : c.Z_NO_FLUSH);\n\n  // Convert data if needed\n  if (typeof data === 'string') {\n    // Only binary strings can be decompressed on practice\n    strm.input = strings.binstring2buf(data);\n  } else if (toString.call(data) === '[object ArrayBuffer]') {\n    strm.input = new Uint8Array(data);\n  } else {\n    strm.input = data;\n  }\n\n  strm.next_in = 0;\n  strm.avail_in = strm.input.length;\n\n  do {\n    if (strm.avail_out === 0) {\n      strm.output = new utils.Buf8(chunkSize);\n      strm.next_out = 0;\n      strm.avail_out = chunkSize;\n    }\n\n    status = zlib_inflate.inflate(strm, c.Z_NO_FLUSH);    /* no bad return value */\n\n    if (status === c.Z_NEED_DICT && dictionary) {\n      status = zlib_inflate.inflateSetDictionary(this.strm, dictionary);\n    }\n\n    if (status === c.Z_BUF_ERROR && allowBufError === true) {\n      status = c.Z_OK;\n      allowBufError = false;\n    }\n\n    if (status !== c.Z_STREAM_END && status !== c.Z_OK) {\n      this.onEnd(status);\n      this.ended = true;\n      return false;\n    }\n\n    if (strm.next_out) {\n      if (strm.avail_out === 0 || status === c.Z_STREAM_END || (strm.avail_in === 0 && (_mode === c.Z_FINISH || _mode === c.Z_SYNC_FLUSH))) {\n\n        if (this.options.to === 'string') {\n\n          next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n          tail = strm.next_out - next_out_utf8;\n          utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n          // move tail\n          strm.next_out = tail;\n          strm.avail_out = chunkSize - tail;\n          if (tail) { utils.arraySet(strm.output, strm.output, next_out_utf8, tail, 0); }\n\n          this.onData(utf8str);\n\n        } else {\n          this.onData(utils.shrinkBuf(strm.output, strm.next_out));\n        }\n      }\n    }\n\n    // When no more input data, we should check that internal inflate buffers\n    // are flushed. The only way to do it when avail_out = 0 - run one more\n    // inflate pass. But if output data not exists, inflate return Z_BUF_ERROR.\n    // Here we set flag to process this error properly.\n    //\n    // NOTE. Deflate does not return error in this case and does not needs such\n    // logic.\n    if (strm.avail_in === 0 && strm.avail_out === 0) {\n      allowBufError = true;\n    }\n\n  } while ((strm.avail_in > 0 || strm.avail_out === 0) && status !== c.Z_STREAM_END);\n\n  if (status === c.Z_STREAM_END) {\n    _mode = c.Z_FINISH;\n  }\n\n  // Finalize on the last chunk.\n  if (_mode === c.Z_FINISH) {\n    status = zlib_inflate.inflateEnd(this.strm);\n    this.onEnd(status);\n    this.ended = true;\n    return status === c.Z_OK;\n  }\n\n  // callback interim results if Z_SYNC_FLUSH.\n  if (_mode === c.Z_SYNC_FLUSH) {\n    this.onEnd(c.Z_OK);\n    strm.avail_out = 0;\n    return true;\n  }\n\n  return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|Array|String): output data. Type of array depends\n *   on js engine support. When string output requested, each chunk\n *   will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate.prototype.onData = function (chunk) {\n  this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n *   other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH) or should be flushed (Z_SYNC_FLUSH)\n * or if an error happened. By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate.prototype.onEnd = function (status) {\n  // On success - join\n  if (status === c.Z_OK) {\n    if (this.options.to === 'string') {\n      // Glue & convert here, until we teach pako to send\n      // utf8 aligned strings to onData\n      this.result = this.chunks.join('');\n    } else {\n      this.result = utils.flattenChunks(this.chunks);\n    }\n  }\n  this.chunks = [];\n  this.err = status;\n  this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n *   negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n *   from utf8 to utf16 (javascript) string. When string output requested,\n *   chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * var pako = require('pako')\n *   , input = pako.deflate([1,2,3,4,5,6,7,8,9])\n *   , output;\n *\n * try {\n *   output = pako.inflate(input);\n * } catch (err)\n *   console.log(err);\n * }\n * ```\n **/\nfunction inflate(input, options) {\n  var inflator = new Inflate(options);\n\n  inflator.push(input, true);\n\n  // That will never happens, if you don't cheat with options :)\n  if (inflator.err) { throw inflator.msg || msg[inflator.err]; }\n\n  return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw(input, options) {\n  options = options || {};\n  options.raw = true;\n  return inflate(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|Array|String\n * - data (Uint8Array|Array|String): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nexports.Inflate = Inflate;\nexports.inflate = inflate;\nexports.inflateRaw = inflateRaw;\nexports.ungzip  = inflate;\n", "// Top level file is just a mixin of submodules & constants\n'use strict';\n\nvar assign    = require('./lib/utils/common').assign;\n\nvar deflate   = require('./lib/deflate');\nvar inflate   = require('./lib/inflate');\nvar constants = require('./lib/zlib/constants');\n\nvar pako = {};\n\nassign(pako, deflate, inflate, constants);\n\nmodule.exports = pako;\n", "", "// The MIT License (MIT)\n//\n// Copyright (c) 2016 Zhipeng Jia\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in all\n// copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n// SOFTWARE.\n\n'use strict'\n\nvar WORD_MASK = [0, 0xff, 0xffff, 0xffffff, 0xffffffff]\n\nfunction copyBytes (fromArray, fromPos, toArray, toPos, length) {\n  var i\n  for (i = 0; i < length; i++) {\n    toArray[toPos + i] = fromArray[fromPos + i]\n  }\n}\n\nfunction selfCopyBytes (array, pos, offset, length) {\n  var i\n  for (i = 0; i < length; i++) {\n    array[pos + i] = array[pos - offset + i]\n  }\n}\n\nfunction SnappyDecompressor (compressed) {\n  this.array = compressed\n  this.pos = 0\n}\n\nSnappyDecompressor.prototype.readUncompressedLength = function () {\n  var result = 0\n  var shift = 0\n  var c, val\n  while (shift < 32 && this.pos < this.array.length) {\n    c = this.array[this.pos]\n    this.pos += 1\n    val = c & 0x7f\n    if (((val << shift) >>> shift) !== val) {\n      return -1\n    }\n    result |= val << shift\n    if (c < 128) {\n      return result\n    }\n    shift += 7\n  }\n  return -1\n}\n\nSnappyDecompressor.prototype.uncompressToBuffer = function (outBuffer) {\n  var array = this.array\n  var arrayLength = array.length\n  var pos = this.pos\n  var outPos = 0\n\n  var c, len, smallLen\n  var offset\n\n  while (pos < array.length) {\n    c = array[pos]\n    pos += 1\n    if ((c & 0x3) === 0) {\n      // Literal\n      len = (c >>> 2) + 1\n      if (len > 60) {\n        if (pos + 3 >= arrayLength) {\n          return false\n        }\n        smallLen = len - 60\n        len = array[pos] + (array[pos + 1] << 8) + (array[pos + 2] << 16) + (array[pos + 3] << 24)\n        len = (len & WORD_MASK[smallLen]) + 1\n        pos += smallLen\n      }\n      if (pos + len > arrayLength) {\n        return false\n      }\n      copyBytes(array, pos, outBuffer, outPos, len)\n      pos += len\n      outPos += len\n    } else {\n      switch (c & 0x3) {\n        case 1:\n          len = ((c >>> 2) & 0x7) + 4\n          offset = array[pos] + ((c >>> 5) << 8)\n          pos += 1\n          break\n        case 2:\n          if (pos + 1 >= arrayLength) {\n            return false\n          }\n          len = (c >>> 2) + 1\n          offset = array[pos] + (array[pos + 1] << 8)\n          pos += 2\n          break\n        case 3:\n          if (pos + 3 >= arrayLength) {\n            return false\n          }\n          len = (c >>> 2) + 1\n          offset = array[pos] + (array[pos + 1] << 8) + (array[pos + 2] << 16) + (array[pos + 3] << 24)\n          pos += 4\n          break\n        default:\n          break\n      }\n      if (offset === 0 || offset > outPos) {\n        return false\n      }\n      selfCopyBytes(outBuffer, outPos, offset, len)\n      outPos += len\n    }\n  }\n  return true\n}\n\nexports.SnappyDecompressor = SnappyDecompressor\n", "// The MIT License (MIT)\n//\n// Copyright (c) 2016 Zhipeng Jia\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in all\n// copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n// SOFTWARE.\n\n'use strict'\n\nvar BLOCK_LOG = 16\nvar BLOCK_SIZE = 1 << BLOCK_LOG\n\nvar MAX_HASH_TABLE_BITS = 14\nvar globalHashTables = new Array(MAX_HASH_TABLE_BITS + 1)\n\nfunction hashFunc (key, hashFuncShift) {\n  return (key * 0x1e35a7bd) >>> hashFuncShift\n}\n\nfunction load32 (array, pos) {\n  return array[pos] + (array[pos + 1] << 8) + (array[pos + 2] << 16) + (array[pos + 3] << 24)\n}\n\nfunction equals32 (array, pos1, pos2) {\n  return array[pos1] === array[pos2] &&\n         array[pos1 + 1] === array[pos2 + 1] &&\n         array[pos1 + 2] === array[pos2 + 2] &&\n         array[pos1 + 3] === array[pos2 + 3]\n}\n\nfunction copyBytes (fromArray, fromPos, toArray, toPos, length) {\n  var i\n  for (i = 0; i < length; i++) {\n    toArray[toPos + i] = fromArray[fromPos + i]\n  }\n}\n\nfunction emitLiteral (input, ip, len, output, op) {\n  if (len <= 60) {\n    output[op] = (len - 1) << 2\n    op += 1\n  } else if (len < 256) {\n    output[op] = 60 << 2\n    output[op + 1] = len - 1\n    op += 2\n  } else {\n    output[op] = 61 << 2\n    output[op + 1] = (len - 1) & 0xff\n    output[op + 2] = (len - 1) >>> 8\n    op += 3\n  }\n  copyBytes(input, ip, output, op, len)\n  return op + len\n}\n\nfunction emitCopyLessThan64 (output, op, offset, len) {\n  if (len < 12 && offset < 2048) {\n    output[op] = 1 + ((len - 4) << 2) + ((offset >>> 8) << 5)\n    output[op + 1] = offset & 0xff\n    return op + 2\n  } else {\n    output[op] = 2 + ((len - 1) << 2)\n    output[op + 1] = offset & 0xff\n    output[op + 2] = offset >>> 8\n    return op + 3\n  }\n}\n\nfunction emitCopy (output, op, offset, len) {\n  while (len >= 68) {\n    op = emitCopyLessThan64(output, op, offset, 64)\n    len -= 64\n  }\n  if (len > 64) {\n    op = emitCopyLessThan64(output, op, offset, 60)\n    len -= 60\n  }\n  return emitCopyLessThan64(output, op, offset, len)\n}\n\nfunction compressFragment (input, ip, inputSize, output, op) {\n  var hashTableBits = 1\n  while ((1 << hashTableBits) <= inputSize &&\n         hashTableBits <= MAX_HASH_TABLE_BITS) {\n    hashTableBits += 1\n  }\n  hashTableBits -= 1\n  var hashFuncShift = 32 - hashTableBits\n\n  if (typeof globalHashTables[hashTableBits] === 'undefined') {\n    globalHashTables[hashTableBits] = new Uint16Array(1 << hashTableBits)\n  }\n  var hashTable = globalHashTables[hashTableBits]\n  var i\n  for (i = 0; i < hashTable.length; i++) {\n    hashTable[i] = 0\n  }\n\n  var ipEnd = ip + inputSize\n  var ipLimit\n  var baseIp = ip\n  var nextEmit = ip\n\n  var hash, nextHash\n  var nextIp, candidate, skip\n  var bytesBetweenHashLookups\n  var base, matched, offset\n  var prevHash, curHash\n  var flag = true\n\n  var INPUT_MARGIN = 15\n  if (inputSize >= INPUT_MARGIN) {\n    ipLimit = ipEnd - INPUT_MARGIN\n\n    ip += 1\n    nextHash = hashFunc(load32(input, ip), hashFuncShift)\n\n    while (flag) {\n      skip = 32\n      nextIp = ip\n      do {\n        ip = nextIp\n        hash = nextHash\n        bytesBetweenHashLookups = skip >>> 5\n        skip += 1\n        nextIp = ip + bytesBetweenHashLookups\n        if (ip > ipLimit) {\n          flag = false\n          break\n        }\n        nextHash = hashFunc(load32(input, nextIp), hashFuncShift)\n        candidate = baseIp + hashTable[hash]\n        hashTable[hash] = ip - baseIp\n      } while (!equals32(input, ip, candidate))\n\n      if (!flag) {\n        break\n      }\n\n      op = emitLiteral(input, nextEmit, ip - nextEmit, output, op)\n\n      do {\n        base = ip\n        matched = 4\n        while (ip + matched < ipEnd && input[ip + matched] === input[candidate + matched]) {\n          matched += 1\n        }\n        ip += matched\n        offset = base - candidate\n        op = emitCopy(output, op, offset, matched)\n\n        nextEmit = ip\n        if (ip >= ipLimit) {\n          flag = false\n          break\n        }\n        prevHash = hashFunc(load32(input, ip - 1), hashFuncShift)\n        hashTable[prevHash] = ip - 1 - baseIp\n        curHash = hashFunc(load32(input, ip), hashFuncShift)\n        candidate = baseIp + hashTable[curHash]\n        hashTable[curHash] = ip - baseIp\n      } while (equals32(input, ip, candidate))\n\n      if (!flag) {\n        break\n      }\n\n      ip += 1\n      nextHash = hashFunc(load32(input, ip), hashFuncShift)\n    }\n  }\n\n  if (nextEmit < ipEnd) {\n    op = emitLiteral(input, nextEmit, ipEnd - nextEmit, output, op)\n  }\n\n  return op\n}\n\nfunction putVarint (value, output, op) {\n  do {\n    output[op] = value & 0x7f\n    value = value >>> 7\n    if (value > 0) {\n      output[op] += 0x80\n    }\n    op += 1\n  } while (value > 0)\n  return op\n}\n\nfunction SnappyCompressor (uncompressed) {\n  this.array = uncompressed\n}\n\nSnappyCompressor.prototype.maxCompressedLength = function () {\n  var sourceLen = this.array.length\n  return 32 + sourceLen + Math.floor(sourceLen / 6)\n}\n\nSnappyCompressor.prototype.compressToBuffer = function (outBuffer) {\n  var array = this.array\n  var length = array.length\n  var pos = 0\n  var outPos = 0\n\n  var fragmentSize\n\n  outPos = putVarint(length, outBuffer, outPos)\n  while (pos < length) {\n    fragmentSize = Math.min(length - pos, BLOCK_SIZE)\n    outPos = compressFragment(array, pos, fragmentSize, outBuffer, outPos)\n    pos += fragmentSize\n  }\n\n  return outPos\n}\n\nexports.SnappyCompressor = SnappyCompressor\n", "// The MIT License (MIT)\n//\n// Copyright (c) 2016 Zhipeng Jia\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in all\n// copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n// SOFTWARE.\n\n'use strict'\n\nfunction isNode () {\n  if (typeof process === 'object') {\n    if (typeof process.versions === 'object') {\n      if (typeof process.versions.node !== 'undefined') {\n        return true\n      }\n    }\n  }\n  return false\n}\n\nfunction isUint8Array (object) {\n  return object instanceof Uint8Array && (!isNode() || !Buffer.isBuffer(object))\n}\n\nfunction isArrayBuffer (object) {\n  return object instanceof ArrayBuffer\n}\n\nfunction isBuffer (object) {\n  if (!isNode()) {\n    return false\n  }\n  return Buffer.isBuffer(object)\n}\n\nvar SnappyDecompressor = require('./snappy_decompressor').SnappyDecompressor\nvar SnappyCompressor = require('./snappy_compressor').SnappyCompressor\n\nvar TYPE_ERROR_MSG = 'Argument compressed must be type of ArrayBuffer, Buffer, or Uint8Array'\n\nfunction uncompress (compressed) {\n  if (!isUint8Array(compressed) && !isArrayBuffer(compressed) && !isBuffer(compressed)) {\n    throw new TypeError(TYPE_ERROR_MSG)\n  }\n  var uint8Mode = false\n  var arrayBufferMode = false\n  if (isUint8Array(compressed)) {\n    uint8Mode = true\n  } else if (isArrayBuffer(compressed)) {\n    arrayBufferMode = true\n    compressed = new Uint8Array(compressed)\n  }\n  var decompressor = new SnappyDecompressor(compressed)\n  var length = decompressor.readUncompressedLength()\n  if (length === -1) {\n    throw new Error('Invalid Snappy bitstream')\n  }\n  var uncompressed, uncompressedView\n  if (uint8Mode) {\n    uncompressed = new Uint8Array(length)\n    if (!decompressor.uncompressToBuffer(uncompressed)) {\n      throw new Error('Invalid Snappy bitstream')\n    }\n  } else if (arrayBufferMode) {\n    uncompressed = new ArrayBuffer(length)\n    uncompressedView = new Uint8Array(uncompressed)\n    if (!decompressor.uncompressToBuffer(uncompressedView)) {\n      throw new Error('Invalid Snappy bitstream')\n    }\n  } else {\n    uncompressed = Buffer.alloc(length)\n    if (!decompressor.uncompressToBuffer(uncompressed)) {\n      throw new Error('Invalid Snappy bitstream')\n    }\n  }\n  return uncompressed\n}\n\nfunction compress (uncompressed) {\n  if (!isUint8Array(uncompressed) && !isArrayBuffer(uncompressed) && !isBuffer(uncompressed)) {\n    throw new TypeError(TYPE_ERROR_MSG)\n  }\n  var uint8Mode = false\n  var arrayBufferMode = false\n  if (isUint8Array(uncompressed)) {\n    uint8Mode = true\n  } else if (isArrayBuffer(uncompressed)) {\n    arrayBufferMode = true\n    uncompressed = new Uint8Array(uncompressed)\n  }\n  var compressor = new SnappyCompressor(uncompressed)\n  var maxLength = compressor.maxCompressedLength()\n  var compressed, compressedView\n  var length\n  if (uint8Mode) {\n    compressed = new Uint8Array(maxLength)\n    length = compressor.compressToBuffer(compressed)\n  } else if (arrayBufferMode) {\n    compressed = new ArrayBuffer(maxLength)\n    compressedView = new Uint8Array(compressed)\n    length = compressor.compressToBuffer(compressedView)\n  } else {\n    compressed = Buffer.alloc(maxLength)\n    length = compressor.compressToBuffer(compressed)\n  }\n  if (!compressed.slice) { // ie11\n    var compressedArray = new Uint8Array(Array.prototype.slice.call(compressed, 0, length))\n    if (uint8Mode) {\n      return compressedArray\n    } else if (arrayBufferMode) {\n      return compressedArray.buffer\n    } else {\n      throw new Error('Not implemented')\n    }\n  }\n\n  return compressed.slice(0, length)\n}\n\nexports.uncompress = uncompress\nexports.compress = compress\n", "// Simple hash function, from: http://burtleburtle.net/bob/hash/integer.html.\n// Chosen because it doesn't use multiply and achieves full avalanche.\nexports.hashU32 = function hashU32 (a) {\n  a = a | 0;\n  a = a + 2127912214 + (a << 12) | 0;\n  a = a ^ -949894596 ^ a >>> 19;\n  a = a + 374761393 + (a << 5) | 0;\n  a = a + -744332180 ^ a << 9;\n  a = a + -42973499 + (a << 3) | 0;\n  return a ^ -1252372727 ^ a >>> 16 | 0;\n};\n\n// Reads a 64-bit little-endian integer from an array.\nexports.readU64 = function readU64 (b, n) {\n  var x = 0;\n  x |= b[n++] << 0;\n  x |= b[n++] << 8;\n  x |= b[n++] << 16;\n  x |= b[n++] << 24;\n  x |= b[n++] << 32;\n  x |= b[n++] << 40;\n  x |= b[n++] << 48;\n  x |= b[n++] << 56;\n  return x;\n};\n\n// Reads a 32-bit little-endian integer from an array.\nexports.readU32 = function readU32 (b, n) {\n  var x = 0;\n  x |= b[n++] << 0;\n  x |= b[n++] << 8;\n  x |= b[n++] << 16;\n  x |= b[n++] << 24;\n  return x;\n};\n\n// Writes a 32-bit little-endian integer from an array.\nexports.writeU32 = function writeU32 (b, n, x) {\n  b[n++] = (x >> 0) & 0xff;\n  b[n++] = (x >> 8) & 0xff;\n  b[n++] = (x >> 16) & 0xff;\n  b[n++] = (x >> 24) & 0xff;\n};\n\n// Multiplies two numbers using 32-bit integer multiplication.\n// Algorithm from Emscripten.\nexports.imul = function imul (a, b) {\n  var ah = a >>> 16;\n  var al = a & 65535;\n  var bh = b >>> 16;\n  var bl = b & 65535;\n\n  return al * bl + (ah * bl + al * bh << 16) | 0;\n};\n", "// xxh32.js - implementation of xxhash32 in plain JavaScript\nvar util = require('./util.js');\n\n// xxhash32 primes\nvar prime1 = 0x9e3779b1;\nvar prime2 = 0x85ebca77;\nvar prime3 = 0xc2b2ae3d;\nvar prime4 = 0x27d4eb2f;\nvar prime5 = 0x165667b1;\n\n// Utility functions/primitives\n// --\n\nfunction rotl32 (x, r) {\n  x = x | 0;\n  r = r | 0;\n\n  return x >>> (32 - r | 0) | x << r | 0;\n}\n\nfunction rotmul32 (h, r, m) {\n  h = h | 0;\n  r = r | 0;\n  m = m | 0;\n\n  return util.imul(h >>> (32 - r | 0) | h << r, m) | 0;\n}\n\nfunction shiftxor32 (h, s) {\n  h = h | 0;\n  s = s | 0;\n\n  return h >>> s ^ h | 0;\n}\n\n// Implementation\n// --\n\nfunction xxhapply (h, src, m0, s, m1) {\n  return rotmul32(util.imul(src, m0) + h, s, m1);\n}\n\nfunction xxh1 (h, src, index) {\n  return rotmul32((h + util.imul(src[index], prime5)), 11, prime1);\n}\n\nfunction xxh4 (h, src, index) {\n  return xxhapply(h, util.readU32(src, index), prime3, 17, prime4);\n}\n\nfunction xxh16 (h, src, index) {\n  return [\n    xxhapply(h[0], util.readU32(src, index + 0), prime2, 13, prime1),\n    xxhapply(h[1], util.readU32(src, index + 4), prime2, 13, prime1),\n    xxhapply(h[2], util.readU32(src, index + 8), prime2, 13, prime1),\n    xxhapply(h[3], util.readU32(src, index + 12), prime2, 13, prime1)\n  ];\n}\n\nfunction xxh32 (seed, src, index, len) {\n  var h, l;\n  l = len;\n  if (len >= 16) {\n    h = [\n      seed + prime1 + prime2,\n      seed + prime2,\n      seed,\n      seed - prime1\n    ];\n\n    while (len >= 16) {\n      h = xxh16(h, src, index);\n\n      index += 16;\n      len -= 16;\n    }\n\n    h = rotl32(h[0], 1) + rotl32(h[1], 7) + rotl32(h[2], 12) + rotl32(h[3], 18) + l;\n  } else {\n    h = (seed + prime5 + len) >>> 0;\n  }\n\n  while (len >= 4) {\n    h = xxh4(h, src, index);\n\n    index += 4;\n    len -= 4;\n  }\n\n  while (len > 0) {\n    h = xxh1(h, src, index);\n\n    index++;\n    len--;\n  }\n\n  h = shiftxor32(util.imul(shiftxor32(util.imul(shiftxor32(h, 15), prime2), 13), prime3), 16);\n\n  return h >>> 0;\n}\n\nexports.hash = xxh32;\n", "// lz4.js - An implementation of Lz4 in plain JavaScript.\n//\n// TODO:\n// - Unify header parsing/writing.\n// - Support options (block size, checksums)\n// - Support streams\n// - Better error handling (handle bad offset, etc.)\n// - HC support (better search algorithm)\n// - Tests/benchmarking\n\nvar xxhash = require('./xxh32.js');\nvar util = require('./util.js');\n\n// Constants\n// --\n\n// Compression format parameters/constants.\nvar minMatch = 4;\nvar minLength = 13;\nvar searchLimit = 5;\nvar skipTrigger = 6;\nvar hashSize = 1 << 16;\n\n// Token constants.\nvar mlBits = 4;\nvar mlMask = (1 << mlBits) - 1;\nvar runBits = 4;\nvar runMask = (1 << runBits) - 1;\n\n// Shared buffers\nvar blockBuf = makeBuffer(5 << 20);\nvar hashTable = makeHashTable();\n\n// Frame constants.\nvar magicNum = 0x184D2204;\n\n// Frame descriptor flags.\nvar fdContentChksum = 0x4;\nvar fdContentSize = 0x8;\nvar fdBlockChksum = 0x10;\n// var fdBlockIndep = 0x20;\nvar fdVersion = 0x40;\nvar fdVersionMask = 0xC0;\n\n// Block sizes.\nvar bsUncompressed = 0x80000000;\nvar bsDefault = 7;\nvar bsShift = 4;\nvar bsMask = 7;\nvar bsMap = {\n  4: 0x10000,\n  5: 0x40000,\n  6: 0x100000,\n  7: 0x400000\n};\n\n// Utility functions/primitives\n// --\n\n// Makes our hashtable. On older browsers, may return a plain array.\nfunction makeHashTable () {\n  try {\n    return new Uint32Array(hashSize);\n  } catch (error) {\n    var hashTable = new Array(hashSize);\n\n    for (var i = 0; i < hashSize; i++) {\n      hashTable[i] = 0;\n    }\n\n    return hashTable;\n  }\n}\n\n// Clear hashtable.\nfunction clearHashTable (table) {\n  for (var i = 0; i < hashSize; i++) {\n    hashTable[i] = 0;\n  }\n}\n\n// Makes a byte buffer. On older browsers, may return a plain array.\nfunction makeBuffer (size) {\n  try {\n    return new Uint8Array(size);\n  } catch (error) {\n    var buf = new Array(size);\n\n    for (var i = 0; i < size; i++) {\n      buf[i] = 0;\n    }\n\n    return buf;\n  }\n}\n\nfunction sliceArray (array, start, end) {\n  if (typeof array.buffer !== undefined) {\n    if (Uint8Array.prototype.slice) {\n      return array.slice(start, end);\n    } else {\n      // Uint8Array#slice polyfill.\n      var len = array.length;\n\n      // Calculate start.\n      start = start | 0;\n      start = (start < 0) ? Math.max(len + start, 0) : Math.min(start, len);\n\n      // Calculate end.\n      end = (end === undefined) ? len : end | 0;\n      end = (end < 0) ? Math.max(len + end, 0) : Math.min(end, len);\n\n      // Copy into new array.\n      var arraySlice = new Uint8Array(end - start);\n      for (var i = start, n = 0; i < end;) {\n        arraySlice[n++] = array[i++];\n      }\n\n      return arraySlice;\n    }\n  } else {\n    // Assume normal array.\n    return array.slice(start, end);\n  }\n}\n\n// Implementation\n// --\n\n// Calculates an upper bound for lz4 compression.\nexports.compressBound = function compressBound (n) {\n  return (n + (n / 255) + 16) | 0;\n};\n\n// Calculates an upper bound for lz4 decompression, by reading the data.\nexports.decompressBound = function decompressBound (src) {\n  var sIndex = 0;\n\n  // Read magic number\n  if (util.readU32(src, sIndex) !== magicNum) {\n    throw new Error('invalid magic number');\n  }\n\n  sIndex += 4;\n\n  // Read descriptor\n  var descriptor = src[sIndex++];\n\n  // Check version\n  if ((descriptor & fdVersionMask) !== fdVersion) {\n    throw new Error('incompatible descriptor version ' + (descriptor & fdVersionMask));\n  }\n\n  // Read flags\n  var useBlockSum = (descriptor & fdBlockChksum) !== 0;\n  var useContentSize = (descriptor & fdContentSize) !== 0;\n\n  // Read block size\n  var bsIdx = (src[sIndex++] >> bsShift) & bsMask;\n\n  if (bsMap[bsIdx] === undefined) {\n    throw new Error('invalid block size ' + bsIdx);\n  }\n\n  var maxBlockSize = bsMap[bsIdx];\n\n  // Get content size\n  if (useContentSize) {\n    return util.readU64(src, sIndex);\n  }\n\n  // Checksum\n  sIndex++;\n\n  // Read blocks.\n  var maxSize = 0;\n  while (true) {\n    var blockSize = util.readU32(src, sIndex);\n    sIndex += 4;\n\n    if (blockSize & bsUncompressed) {\n      blockSize &= ~bsUncompressed;\n      maxSize += blockSize;\n    } else {\n      maxSize += maxBlockSize;\n    }\n\n    if (blockSize === 0) {\n      return maxSize;\n    }\n\n    if (useBlockSum) {\n      sIndex += 4;\n    }\n\n    sIndex += blockSize;\n  }\n};\n\n// Creates a buffer of a given byte-size, falling back to plain arrays.\nexports.makeBuffer = makeBuffer;\n\n// Decompresses a block of Lz4.\nexports.decompressBlock = function decompressBlock (src, dst, sIndex, sLength, dIndex) {\n  var mLength, mOffset, sEnd, n, i;\n\n  // Setup initial state.\n  sEnd = sIndex + sLength;\n\n  // Consume entire input block.\n  while (sIndex < sEnd) {\n    var token = src[sIndex++];\n\n    // Copy literals.\n    var literalCount = (token >> 4);\n    if (literalCount > 0) {\n      // Parse length.\n      if (literalCount === 0xf) {\n        while (true) {\n          literalCount += src[sIndex];\n          if (src[sIndex++] !== 0xff) {\n            break;\n          }\n        }\n      }\n\n      // Copy literals\n      for (n = sIndex + literalCount; sIndex < n;) {\n        dst[dIndex++] = src[sIndex++];\n      }\n    }\n\n    if (sIndex >= sEnd) {\n      break;\n    }\n\n    // Copy match.\n    mLength = (token & 0xf);\n\n    // Parse offset.\n    mOffset = src[sIndex++] | (src[sIndex++] << 8);\n\n    // Parse length.\n    if (mLength === 0xf) {\n      while (true) {\n        mLength += src[sIndex];\n        if (src[sIndex++] !== 0xff) {\n          break;\n        }\n      }\n    }\n\n    mLength += minMatch;\n\n    // Copy match.\n    for (i = dIndex - mOffset, n = i + mLength; i < n;) {\n      dst[dIndex++] = dst[i++] | 0;\n    }\n  }\n\n  return dIndex;\n};\n\n// Compresses a block with Lz4.\nexports.compressBlock = function compressBlock (src, dst, sIndex, sLength, hashTable) {\n  var mIndex, mAnchor, mLength, mOffset, mStep;\n  var literalCount, dIndex, sEnd, n;\n\n  // Setup initial state.\n  dIndex = 0;\n  sEnd = sLength + sIndex;\n  mAnchor = sIndex;\n\n  // Process only if block is large enough.\n  if (sLength >= minLength) {\n    var searchMatchCount = (1 << skipTrigger) + 3;\n\n    // Consume until last n literals (Lz4 spec limitation.)\n    while (sIndex + minMatch < sEnd - searchLimit) {\n      var seq = util.readU32(src, sIndex);\n      var hash = util.hashU32(seq) >>> 0;\n\n      // Crush hash to 16 bits.\n      hash = ((hash >> 16) ^ hash) >>> 0 & 0xffff;\n\n      // Look for a match in the hashtable. NOTE: remove one; see below.\n      mIndex = hashTable[hash] - 1;\n\n      // Put pos in hash table. NOTE: add one so that zero = invalid.\n      hashTable[hash] = sIndex + 1;\n\n      // Determine if there is a match (within range.)\n      if (mIndex < 0 || ((sIndex - mIndex) >>> 16) > 0 || util.readU32(src, mIndex) !== seq) {\n        mStep = searchMatchCount++ >> skipTrigger;\n        sIndex += mStep;\n        continue;\n      }\n\n      searchMatchCount = (1 << skipTrigger) + 3;\n\n      // Calculate literal count and offset.\n      literalCount = sIndex - mAnchor;\n      mOffset = sIndex - mIndex;\n\n      // We've already matched one word, so get that out of the way.\n      sIndex += minMatch;\n      mIndex += minMatch;\n\n      // Determine match length.\n      // N.B.: mLength does not include minMatch, Lz4 adds it back\n      // in decoding.\n      mLength = sIndex;\n      while (sIndex < sEnd - searchLimit && src[sIndex] === src[mIndex]) {\n        sIndex++;\n        mIndex++;\n      }\n      mLength = sIndex - mLength;\n\n      // Write token + literal count.\n      var token = mLength < mlMask ? mLength : mlMask;\n      if (literalCount >= runMask) {\n        dst[dIndex++] = (runMask << mlBits) + token;\n        for (n = literalCount - runMask; n >= 0xff; n -= 0xff) {\n          dst[dIndex++] = 0xff;\n        }\n        dst[dIndex++] = n;\n      } else {\n        dst[dIndex++] = (literalCount << mlBits) + token;\n      }\n\n      // Write literals.\n      for (var i = 0; i < literalCount; i++) {\n        dst[dIndex++] = src[mAnchor + i];\n      }\n\n      // Write offset.\n      dst[dIndex++] = mOffset;\n      dst[dIndex++] = (mOffset >> 8);\n\n      // Write match length.\n      if (mLength >= mlMask) {\n        for (n = mLength - mlMask; n >= 0xff; n -= 0xff) {\n          dst[dIndex++] = 0xff;\n        }\n        dst[dIndex++] = n;\n      }\n\n      // Move the anchor.\n      mAnchor = sIndex;\n    }\n  }\n\n  // Nothing was encoded.\n  if (mAnchor === 0) {\n    return 0;\n  }\n\n  // Write remaining literals.\n  // Write literal token+count.\n  literalCount = sEnd - mAnchor;\n  if (literalCount >= runMask) {\n    dst[dIndex++] = (runMask << mlBits);\n    for (n = literalCount - runMask; n >= 0xff; n -= 0xff) {\n      dst[dIndex++] = 0xff;\n    }\n    dst[dIndex++] = n;\n  } else {\n    dst[dIndex++] = (literalCount << mlBits);\n  }\n\n  // Write literals.\n  sIndex = mAnchor;\n  while (sIndex < sEnd) {\n    dst[dIndex++] = src[sIndex++];\n  }\n\n  return dIndex;\n};\n\n// Decompresses a frame of Lz4 data.\nexports.decompressFrame = function decompressFrame (src, dst) {\n  var useBlockSum, useContentSum, useContentSize, descriptor;\n  var sIndex = 0;\n  var dIndex = 0;\n\n  // Read magic number\n  if (util.readU32(src, sIndex) !== magicNum) {\n    throw new Error('invalid magic number');\n  }\n\n  sIndex += 4;\n\n  // Read descriptor\n  descriptor = src[sIndex++];\n\n  // Check version\n  if ((descriptor & fdVersionMask) !== fdVersion) {\n    throw new Error('incompatible descriptor version');\n  }\n\n  // Read flags\n  useBlockSum = (descriptor & fdBlockChksum) !== 0;\n  useContentSum = (descriptor & fdContentChksum) !== 0;\n  useContentSize = (descriptor & fdContentSize) !== 0;\n\n  // Read block size\n  var bsIdx = (src[sIndex++] >> bsShift) & bsMask;\n\n  if (bsMap[bsIdx] === undefined) {\n    throw new Error('invalid block size');\n  }\n\n  if (useContentSize) {\n    // TODO: read content size\n    sIndex += 8;\n  }\n\n  sIndex++;\n\n  // Read blocks.\n  while (true) {\n    var compSize;\n\n    compSize = util.readU32(src, sIndex);\n    sIndex += 4;\n\n    if (compSize === 0) {\n      break;\n    }\n\n    if (useBlockSum) {\n      // TODO: read block checksum\n      sIndex += 4;\n    }\n\n    // Check if block is compressed\n    if ((compSize & bsUncompressed) !== 0) {\n      // Mask off the 'uncompressed' bit\n      compSize &= ~bsUncompressed;\n\n      // Copy uncompressed data into destination buffer.\n      for (var j = 0; j < compSize; j++) {\n        dst[dIndex++] = src[sIndex++];\n      }\n    } else {\n      // Decompress into blockBuf\n      dIndex = exports.decompressBlock(src, dst, sIndex, compSize, dIndex);\n      sIndex += compSize;\n    }\n  }\n\n  if (useContentSum) {\n    // TODO: read content checksum\n    sIndex += 4;\n  }\n\n  return dIndex;\n};\n\n// Compresses data to an Lz4 frame.\nexports.compressFrame = function compressFrame (src, dst) {\n  var dIndex = 0;\n\n  // Write magic number.\n  util.writeU32(dst, dIndex, magicNum);\n  dIndex += 4;\n\n  // Descriptor flags.\n  dst[dIndex++] = fdVersion;\n  dst[dIndex++] = bsDefault << bsShift;\n\n  // Descriptor checksum.\n  dst[dIndex] = xxhash.hash(0, dst, 4, dIndex - 4) >> 8;\n  dIndex++;\n\n  // Write blocks.\n  var maxBlockSize = bsMap[bsDefault];\n  var remaining = src.length;\n  var sIndex = 0;\n\n  // Clear the hashtable.\n  clearHashTable(hashTable);\n\n  // Split input into blocks and write.\n  while (remaining > 0) {\n    var compSize = 0;\n    var blockSize = remaining > maxBlockSize ? maxBlockSize : remaining;\n\n    compSize = exports.compressBlock(src, blockBuf, sIndex, blockSize, hashTable);\n\n    if (compSize > blockSize || compSize === 0) {\n      // Output uncompressed.\n      util.writeU32(dst, dIndex, 0x80000000 | blockSize);\n      dIndex += 4;\n\n      for (var z = sIndex + blockSize; sIndex < z;) {\n        dst[dIndex++] = src[sIndex++];\n      }\n\n      remaining -= blockSize;\n    } else {\n      // Output compressed.\n      util.writeU32(dst, dIndex, compSize);\n      dIndex += 4;\n\n      for (var j = 0; j < compSize;) {\n        dst[dIndex++] = blockBuf[j++];\n      }\n\n      sIndex += blockSize;\n      remaining -= blockSize;\n    }\n  }\n\n  // Write blank end block.\n  util.writeU32(dst, dIndex, 0);\n  dIndex += 4;\n\n  return dIndex;\n};\n\n// Decompresses a buffer containing an Lz4 frame. maxSize is optional; if not\n// provided, a maximum size will be determined by examining the data. The\n// buffer returned will always be perfectly-sized.\nexports.decompress = function decompress (src, maxSize) {\n  var dst, size;\n\n  if (maxSize === undefined) {\n    maxSize = exports.decompressBound(src);\n  }\n\n  dst = exports.makeBuffer(maxSize);\n  size = exports.decompressFrame(src, dst);\n\n  if (size !== maxSize) {\n    dst = sliceArray(dst, 0, size);\n  }\n\n  return dst;\n};\n\n// Compresses a buffer to an Lz4 frame. maxSize is optional; if not provided,\n// a buffer will be created based on the theoretical worst output size for a\n// given input size. The buffer returned will always be perfectly-sized.\nexports.compress = function compress (src, maxSize) {\n  var dst, size;\n\n  if (maxSize === undefined) {\n    maxSize = exports.compressBound(src.length);\n  }\n\n  dst = exports.makeBuffer(maxSize);\n  size = exports.compressFrame(src, dst);\n\n  if (size !== maxSize) {\n    dst = sliceArray(dst, 0, size);\n  }\n\n  return dst;\n};\n", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\nvar util = require('util');\n\nvar Type = exports.Type = {\n  STOP: 0,\n  VOID: 1,\n  BOOL: 2,\n  BYTE: 3,\n  I08: 3,\n  DOUBLE: 4,\n  I16: 6,\n  I32: 8,\n  I64: 10,\n  STRING: 11,\n  UTF7: 11,\n  STRUCT: 12,\n  MAP: 13,\n  SET: 14,\n  LIST: 15,\n  UTF8: 16,\n  UTF16: 17\n};\n\nexports.MessageType = {\n  CALL: 1,\n  REPLY: 2,\n  EXCEPTION: 3,\n  ONEWAY: 4\n};\n\nexports.TException = TException;\n\nfunction TException(message) {\n  Error.call(this);\n  if (Error.captureStackTrace !== undefined) {\n    Error.captureStackTrace(this, this.constructor);\n  }\n\n  this.name = this.constructor.name;\n  this.message = message;\n};\nutil.inherits(TException, Error);\n\nvar TApplicationExceptionType = exports.TApplicationExceptionType = {\n  UNKNOWN: 0,\n  UNKNOWN_METHOD: 1,\n  INVALID_MESSAGE_TYPE: 2,\n  WRONG_METHOD_NAME: 3,\n  BAD_SEQUENCE_ID: 4,\n  MISSING_RESULT: 5,\n  INTERNAL_ERROR: 6,\n  PROTOCOL_ERROR: 7,\n  INVALID_TRANSFORM: 8,\n  INVALID_PROTOCOL: 9,\n  UNSUPPORTED_CLIENT_TYPE: 10\n};\n\nexports.TApplicationException = TApplicationException;\n\nfunction TApplicationException(type, message) {\n  TException.call(this);\n  if (Error.captureStackTrace !== undefined) {\n    Error.captureStackTrace(this, this.constructor);\n  }\n\n  this.type = type || TApplicationExceptionType.UNKNOWN;\n  this.name = this.constructor.name;\n  this.message = message;\n};\nutil.inherits(TApplicationException, TException);\n\nTApplicationException.prototype.read = function(input) {\n  var ftype;\n  var ret = input.readStructBegin('TApplicationException');\n\n  while(1){\n      ret = input.readFieldBegin();\n      if(ret.ftype == Type.STOP)\n          break;\n\n      switch(ret.fid){\n          case 1:\n              if( ret.ftype == Type.STRING ){\n                  ret = input.readString();\n                  this.message = ret;\n              } else {\n                  ret = input.skip(ret.ftype);\n              }\n              break;\n          case 2:\n              if( ret.ftype == Type.I32 ){\n                  ret = input.readI32();\n                  this.type = ret;\n              } else {\n                  ret   = input.skip(ret.ftype);\n              }\n              break;\n          default:\n              ret = input.skip(ret.ftype);\n              break;\n      }\n      input.readFieldEnd();\n  }\n  input.readStructEnd();\n};\n\nTApplicationException.prototype.write = function(output){\n  output.writeStructBegin('TApplicationException');\n\n  if (this.message) {\n      output.writeFieldBegin('message', Type.STRING, 1);\n      output.writeString(this.message);\n      output.writeFieldEnd();\n  }\n\n  if (this.code) {\n      output.writeFieldBegin('type', Type.I32, 2);\n      output.writeI32(this.code);\n      output.writeFieldEnd();\n  }\n\n  output.writeFieldStop();\n  output.writeStructEnd();\n};\n\nvar TProtocolExceptionType = exports.TProtocolExceptionType = {\n  UNKNOWN: 0,\n  INVALID_DATA: 1,\n  NEGATIVE_SIZE: 2,\n  SIZE_LIMIT: 3,\n  BAD_VERSION: 4,\n  NOT_IMPLEMENTED: 5,\n  DEPTH_LIMIT: 6\n};\n\n\nexports.TProtocolException = TProtocolException;\n\nfunction TProtocolException(type, message) {\n  Error.call(this);\n  if (Error.captureStackTrace !== undefined) {\n    Error.captureStackTrace(this, this.constructor);\n  }\n\n  this.name = this.constructor.name;\n  this.type = type;\n  this.message = message;\n};\nutil.inherits(TProtocolException, Error);\n\nexports.objectLength = function(obj) {\n  return Object.keys(obj).length;\n};\n\nexports.inherits = function(constructor, superConstructor) {\n  util.inherits(constructor, superConstructor);\n};\n\nvar copyList, copyMap;\n\ncopyList = function(lst, types) {\n\n  if (!lst) {return lst; }\n\n  var type;\n\n  if (types.shift === undefined) {\n    type = types;\n  }\n  else {\n    type = types[0];\n  }\n  var Type = type;\n\n  var len = lst.length, result = [], i, val;\n  for (i = 0; i < len; i++) {\n    val = lst[i];\n    if (type === null) {\n      result.push(val);\n    }\n    else if (type === copyMap || type === copyList) {\n      result.push(type(val, types.slice(1)));\n    }\n    else {\n      result.push(new Type(val));\n    }\n  }\n  return result;\n};\n\ncopyMap = function(obj, types){\n\n  if (!obj) {return obj; }\n\n  var type;\n\n  if (types.shift === undefined) {\n    type = types;\n  }\n  else {\n    type = types[0];\n  }\n  var Type = type;\n\n  var result = {}, val;\n  for(var prop in obj) {\n    if(obj.hasOwnProperty(prop)) {\n      val = obj[prop];\n      if (type === null) {\n        result[prop] = val;\n      }\n      else if (type === copyMap || type === copyList) {\n        result[prop] = type(val, types.slice(1));\n      }\n      else {\n        result[prop] = new Type(val);\n      }\n    }\n  }\n  return result;\n};\n\nmodule.exports.copyMap = copyMap;\nmodule.exports.copyList = copyList;\n", "// https://github.com/maxogden/websocket-stream/blob/48dc3ddf943e5ada668c31ccd94e9186f02fafbd/ws-fallback.js\n\nvar ws = null\n\nif (typeof WebSocket !== 'undefined') {\n  ws = WebSocket\n} else if (typeof MozWebSocket !== 'undefined') {\n  ws = MozWebSocket\n} else if (typeof global !== 'undefined') {\n  ws = global.WebSocket || global.MozWebSocket\n} else if (typeof window !== 'undefined') {\n  ws = window.WebSocket || window.MozWebSocket\n} else if (typeof self !== 'undefined') {\n  ws = self.WebSocket || self.MozWebSocket\n}\n\nmodule.exports = ws\n", "// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nvar R = typeof Reflect === 'object' ? Reflect : null\nvar ReflectApply = R && typeof R.apply === 'function'\n  ? R.apply\n  : function ReflectApply(target, receiver, args) {\n    return Function.prototype.apply.call(target, receiver, args);\n  }\n\nvar ReflectOwnKeys\nif (R && typeof R.ownKeys === 'function') {\n  ReflectOwnKeys = R.ownKeys\n} else if (Object.getOwnPropertySymbols) {\n  ReflectOwnKeys = function ReflectOwnKeys(target) {\n    return Object.getOwnPropertyNames(target)\n      .concat(Object.getOwnPropertySymbols(target));\n  };\n} else {\n  ReflectOwnKeys = function ReflectOwnKeys(target) {\n    return Object.getOwnPropertyNames(target);\n  };\n}\n\nfunction ProcessEmitWarning(warning) {\n  if (console && console.warn) console.warn(warning);\n}\n\nvar NumberIsNaN = Number.isNaN || function NumberIsNaN(value) {\n  return value !== value;\n}\n\nfunction EventEmitter() {\n  EventEmitter.init.call(this);\n}\nmodule.exports = EventEmitter;\nmodule.exports.once = once;\n\n// Backwards-compat with node 0.10.x\nEventEmitter.EventEmitter = EventEmitter;\n\nEventEmitter.prototype._events = undefined;\nEventEmitter.prototype._eventsCount = 0;\nEventEmitter.prototype._maxListeners = undefined;\n\n// By default EventEmitters will print a warning if more than 10 listeners are\n// added to it. This is a useful default which helps finding memory leaks.\nvar defaultMaxListeners = 10;\n\nfunction checkListener(listener) {\n  if (typeof listener !== 'function') {\n    throw new TypeError('The \"listener\" argument must be of type Function. Received type ' + typeof listener);\n  }\n}\n\nObject.defineProperty(EventEmitter, 'defaultMaxListeners', {\n  enumerable: true,\n  get: function() {\n    return defaultMaxListeners;\n  },\n  set: function(arg) {\n    if (typeof arg !== 'number' || arg < 0 || NumberIsNaN(arg)) {\n      throw new RangeError('The value of \"defaultMaxListeners\" is out of range. It must be a non-negative number. Received ' + arg + '.');\n    }\n    defaultMaxListeners = arg;\n  }\n});\n\nEventEmitter.init = function() {\n\n  if (this._events === undefined ||\n      this._events === Object.getPrototypeOf(this)._events) {\n    this._events = Object.create(null);\n    this._eventsCount = 0;\n  }\n\n  this._maxListeners = this._maxListeners || undefined;\n};\n\n// Obviously not all Emitters should be limited to 10. This function allows\n// that to be increased. Set to zero for unlimited.\nEventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {\n  if (typeof n !== 'number' || n < 0 || NumberIsNaN(n)) {\n    throw new RangeError('The value of \"n\" is out of range. It must be a non-negative number. Received ' + n + '.');\n  }\n  this._maxListeners = n;\n  return this;\n};\n\nfunction _getMaxListeners(that) {\n  if (that._maxListeners === undefined)\n    return EventEmitter.defaultMaxListeners;\n  return that._maxListeners;\n}\n\nEventEmitter.prototype.getMaxListeners = function getMaxListeners() {\n  return _getMaxListeners(this);\n};\n\nEventEmitter.prototype.emit = function emit(type) {\n  var args = [];\n  for (var i = 1; i < arguments.length; i++) args.push(arguments[i]);\n  var doError = (type === 'error');\n\n  var events = this._events;\n  if (events !== undefined)\n    doError = (doError && events.error === undefined);\n  else if (!doError)\n    return false;\n\n  // If there is no 'error' event listener then throw.\n  if (doError) {\n    var er;\n    if (args.length > 0)\n      er = args[0];\n    if (er instanceof Error) {\n      // Note: The comments on the `throw` lines are intentional, they show\n      // up in Node's output if this results in an unhandled exception.\n      throw er; // Unhandled 'error' event\n    }\n    // At least give some kind of context to the user\n    var err = new Error('Unhandled error.' + (er ? ' (' + er.message + ')' : ''));\n    err.context = er;\n    throw err; // Unhandled 'error' event\n  }\n\n  var handler = events[type];\n\n  if (handler === undefined)\n    return false;\n\n  if (typeof handler === 'function') {\n    ReflectApply(handler, this, args);\n  } else {\n    var len = handler.length;\n    var listeners = arrayClone(handler, len);\n    for (var i = 0; i < len; ++i)\n      ReflectApply(listeners[i], this, args);\n  }\n\n  return true;\n};\n\nfunction _addListener(target, type, listener, prepend) {\n  var m;\n  var events;\n  var existing;\n\n  checkListener(listener);\n\n  events = target._events;\n  if (events === undefined) {\n    events = target._events = Object.create(null);\n    target._eventsCount = 0;\n  } else {\n    // To avoid recursion in the case that type === \"newListener\"! Before\n    // adding it to the listeners, first emit \"newListener\".\n    if (events.newListener !== undefined) {\n      target.emit('newListener', type,\n                  listener.listener ? listener.listener : listener);\n\n      // Re-assign `events` because a newListener handler could have caused the\n      // this._events to be assigned to a new object\n      events = target._events;\n    }\n    existing = events[type];\n  }\n\n  if (existing === undefined) {\n    // Optimize the case of one listener. Don't need the extra array object.\n    existing = events[type] = listener;\n    ++target._eventsCount;\n  } else {\n    if (typeof existing === 'function') {\n      // Adding the second element, need to change to array.\n      existing = events[type] =\n        prepend ? [listener, existing] : [existing, listener];\n      // If we've already got an array, just append.\n    } else if (prepend) {\n      existing.unshift(listener);\n    } else {\n      existing.push(listener);\n    }\n\n    // Check for listener leak\n    m = _getMaxListeners(target);\n    if (m > 0 && existing.length > m && !existing.warned) {\n      existing.warned = true;\n      // No error code for this since it is a Warning\n      // eslint-disable-next-line no-restricted-syntax\n      var w = new Error('Possible EventEmitter memory leak detected. ' +\n                          existing.length + ' ' + String(type) + ' listeners ' +\n                          'added. Use emitter.setMaxListeners() to ' +\n                          'increase limit');\n      w.name = 'MaxListenersExceededWarning';\n      w.emitter = target;\n      w.type = type;\n      w.count = existing.length;\n      ProcessEmitWarning(w);\n    }\n  }\n\n  return target;\n}\n\nEventEmitter.prototype.addListener = function addListener(type, listener) {\n  return _addListener(this, type, listener, false);\n};\n\nEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\nEventEmitter.prototype.prependListener =\n    function prependListener(type, listener) {\n      return _addListener(this, type, listener, true);\n    };\n\nfunction onceWrapper() {\n  if (!this.fired) {\n    this.target.removeListener(this.type, this.wrapFn);\n    this.fired = true;\n    if (arguments.length === 0)\n      return this.listener.call(this.target);\n    return this.listener.apply(this.target, arguments);\n  }\n}\n\nfunction _onceWrap(target, type, listener) {\n  var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener };\n  var wrapped = onceWrapper.bind(state);\n  wrapped.listener = listener;\n  state.wrapFn = wrapped;\n  return wrapped;\n}\n\nEventEmitter.prototype.once = function once(type, listener) {\n  checkListener(listener);\n  this.on(type, _onceWrap(this, type, listener));\n  return this;\n};\n\nEventEmitter.prototype.prependOnceListener =\n    function prependOnceListener(type, listener) {\n      checkListener(listener);\n      this.prependListener(type, _onceWrap(this, type, listener));\n      return this;\n    };\n\n// Emits a 'removeListener' event if and only if the listener was removed.\nEventEmitter.prototype.removeListener =\n    function removeListener(type, listener) {\n      var list, events, position, i, originalListener;\n\n      checkListener(listener);\n\n      events = this._events;\n      if (events === undefined)\n        return this;\n\n      list = events[type];\n      if (list === undefined)\n        return this;\n\n      if (list === listener || list.listener === listener) {\n        if (--this._eventsCount === 0)\n          this._events = Object.create(null);\n        else {\n          delete events[type];\n          if (events.removeListener)\n            this.emit('removeListener', type, list.listener || listener);\n        }\n      } else if (typeof list !== 'function') {\n        position = -1;\n\n        for (i = list.length - 1; i >= 0; i--) {\n          if (list[i] === listener || list[i].listener === listener) {\n            originalListener = list[i].listener;\n            position = i;\n            break;\n          }\n        }\n\n        if (position < 0)\n          return this;\n\n        if (position === 0)\n          list.shift();\n        else {\n          spliceOne(list, position);\n        }\n\n        if (list.length === 1)\n          events[type] = list[0];\n\n        if (events.removeListener !== undefined)\n          this.emit('removeListener', type, originalListener || listener);\n      }\n\n      return this;\n    };\n\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\n\nEventEmitter.prototype.removeAllListeners =\n    function removeAllListeners(type) {\n      var listeners, events, i;\n\n      events = this._events;\n      if (events === undefined)\n        return this;\n\n      // not listening for removeListener, no need to emit\n      if (events.removeListener === undefined) {\n        if (arguments.length === 0) {\n          this._events = Object.create(null);\n          this._eventsCount = 0;\n        } else if (events[type] !== undefined) {\n          if (--this._eventsCount === 0)\n            this._events = Object.create(null);\n          else\n            delete events[type];\n        }\n        return this;\n      }\n\n      // emit removeListener for all listeners on all events\n      if (arguments.length === 0) {\n        var keys = Object.keys(events);\n        var key;\n        for (i = 0; i < keys.length; ++i) {\n          key = keys[i];\n          if (key === 'removeListener') continue;\n          this.removeAllListeners(key);\n        }\n        this.removeAllListeners('removeListener');\n        this._events = Object.create(null);\n        this._eventsCount = 0;\n        return this;\n      }\n\n      listeners = events[type];\n\n      if (typeof listeners === 'function') {\n        this.removeListener(type, listeners);\n      } else if (listeners !== undefined) {\n        // LIFO order\n        for (i = listeners.length - 1; i >= 0; i--) {\n          this.removeListener(type, listeners[i]);\n        }\n      }\n\n      return this;\n    };\n\nfunction _listeners(target, type, unwrap) {\n  var events = target._events;\n\n  if (events === undefined)\n    return [];\n\n  var evlistener = events[type];\n  if (evlistener === undefined)\n    return [];\n\n  if (typeof evlistener === 'function')\n    return unwrap ? [evlistener.listener || evlistener] : [evlistener];\n\n  return unwrap ?\n    unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length);\n}\n\nEventEmitter.prototype.listeners = function listeners(type) {\n  return _listeners(this, type, true);\n};\n\nEventEmitter.prototype.rawListeners = function rawListeners(type) {\n  return _listeners(this, type, false);\n};\n\nEventEmitter.listenerCount = function(emitter, type) {\n  if (typeof emitter.listenerCount === 'function') {\n    return emitter.listenerCount(type);\n  } else {\n    return listenerCount.call(emitter, type);\n  }\n};\n\nEventEmitter.prototype.listenerCount = listenerCount;\nfunction listenerCount(type) {\n  var events = this._events;\n\n  if (events !== undefined) {\n    var evlistener = events[type];\n\n    if (typeof evlistener === 'function') {\n      return 1;\n    } else if (evlistener !== undefined) {\n      return evlistener.length;\n    }\n  }\n\n  return 0;\n}\n\nEventEmitter.prototype.eventNames = function eventNames() {\n  return this._eventsCount > 0 ? ReflectOwnKeys(this._events) : [];\n};\n\nfunction arrayClone(arr, n) {\n  var copy = new Array(n);\n  for (var i = 0; i < n; ++i)\n    copy[i] = arr[i];\n  return copy;\n}\n\nfunction spliceOne(list, index) {\n  for (; index + 1 < list.length; index++)\n    list[index] = list[index + 1];\n  list.pop();\n}\n\nfunction unwrapListeners(arr) {\n  var ret = new Array(arr.length);\n  for (var i = 0; i < ret.length; ++i) {\n    ret[i] = arr[i].listener || arr[i];\n  }\n  return ret;\n}\n\nfunction once(emitter, name) {\n  return new Promise(function (resolve, reject) {\n    function errorListener(err) {\n      emitter.removeListener(name, resolver);\n      reject(err);\n    }\n\n    function resolver() {\n      if (typeof emitter.removeListener === 'function') {\n        emitter.removeListener('error', errorListener);\n      }\n      resolve([].slice.call(arguments));\n    };\n\n    eventTargetAgnosticAddListener(emitter, name, resolver, { once: true });\n    if (name !== 'error') {\n      addErrorHandlerIfEventEmitter(emitter, errorListener, { once: true });\n    }\n  });\n}\n\nfunction addErrorHandlerIfEventEmitter(emitter, handler, flags) {\n  if (typeof emitter.on === 'function') {\n    eventTargetAgnosticAddListener(emitter, 'error', handler, flags);\n  }\n}\n\nfunction eventTargetAgnosticAddListener(emitter, name, listener, flags) {\n  if (typeof emitter.on === 'function') {\n    if (flags.once) {\n      emitter.once(name, listener);\n    } else {\n      emitter.on(name, listener);\n    }\n  } else if (typeof emitter.addEventListener === 'function') {\n    // EventTarget does not have `error` event semantics like Node\n    // EventEmitters, we do not listen for `error` events here.\n    emitter.addEventListener(name, function wrapListener(arg) {\n      // IE does not have builtin `{ once: true }` support so we\n      // have to do it manually.\n      if (flags.once) {\n        emitter.removeEventListener(name, wrapListener);\n      }\n      listener(arg);\n    });\n  } else {\n    throw new TypeError('The \"emitter\" argument must be of type EventEmitter. Received type ' + typeof emitter);\n  }\n}\n", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\n\nvar POW_8 = Math.pow(2, 8);\nvar POW_16 = Math.pow(2, 16);\nvar POW_24 = Math.pow(2, 24);\nvar POW_32 = Math.pow(2, 32);\nvar POW_40 = Math.pow(2, 40);\nvar POW_48 = Math.pow(2, 48);\nvar POW_52 = Math.pow(2, 52);\nvar POW_1022 = Math.pow(2, 1022);\n\nexports.readByte = function(b){\n\treturn b > 127 ? b-256 : b;\n};\n\nexports.readI16 = function(buff, off) {\n  off = off || 0;\n  var v = buff[off + 1];\n  v += buff[off] << 8;\n  if (buff[off] & 128) {\n    v -= POW_16;\n  }\n  return v;\n};\n\nexports.readI32 = function(buff, off) {\n  off = off || 0;\n  var v = buff[off + 3];\n  v += buff[off + 2] << 8;\n  v += buff[off + 1] << 16;\n  v += buff[off] * POW_24;\n  if (buff[off] & 0x80) {\n    v -= POW_32;\n  }\n  return v;\n};\n\nexports.writeI16 = function(buff, v) {\n  buff[1] = v & 0xff;\n  v >>= 8;\n  buff[0] = v & 0xff;\n  return buff;\n};\n\nexports.writeI32 = function(buff, v) {\n  buff[3] = v & 0xff;\n  v >>= 8;\n  buff[2] = v & 0xff;\n  v >>= 8;\n  buff[1] = v & 0xff;\n  v >>= 8;\n  buff[0] = v & 0xff;\n  return buff;\n};\n\nexports.readDouble = function(buff, off) {\n  off = off || 0;\n  var signed = buff[off] & 0x80;\n  var e = (buff[off+1] & 0xF0) >> 4;\n  e += (buff[off] & 0x7F) << 4;\n\n  var m = buff[off+7];\n  m += buff[off+6] << 8;\n  m += buff[off+5] << 16;\n  m += buff[off+4] * POW_24;\n  m += buff[off+3] * POW_32;\n  m += buff[off+2] * POW_40;\n  m += (buff[off+1] & 0x0F) * POW_48;\n\n  switch (e) {\n    case 0:\n      e = -1022;\n      break;\n    case 2047:\n      return m ? NaN : (signed ? -Infinity : Infinity);\n    default:\n      m += POW_52;\n      e -= 1023;\n  }\n\n  if (signed) {\n    m *= -1;\n  }\n\n  return m * Math.pow(2, e - 52);\n};\n\n/*\n * Based on code from the jspack module:\n * http://code.google.com/p/jspack/\n */\nexports.writeDouble = function(buff, v) {\n  var m, e, c;\n\n  buff[0] = (v < 0 ? 0x80 : 0x00);\n\n  v = Math.abs(v);\n  if (v !== v) {\n    // NaN, use QNaN IEEE format\n    m = 2251799813685248;\n    e = 2047;\n  } else if (v === Infinity) {\n    m = 0;\n    e = 2047;\n  } else {\n    e = Math.floor(Math.log(v) / Math.LN2);\n    c = Math.pow(2, -e);\n    if (v * c < 1) {\n      e--;\n      c *= 2;\n    }\n\n    if (e + 1023 >= 2047)\n    {\n      // Overflow\n      m = 0;\n      e = 2047;\n    }\n    else if (e + 1023 >= 1)\n    {\n      // Normalized - term order matters, as Math.pow(2, 52-e) and v*Math.pow(2, 52) can overflow\n      m = (v*c-1) * POW_52;\n      e += 1023;\n    }\n    else\n    {\n      // Denormalized - also catches the '0' case, somewhat by chance\n      m = (v * POW_1022) * POW_52;\n      e = 0;\n    }\n  }\n\n  buff[1] = (e << 4) & 0xf0;\n  buff[0] |= (e >> 4) & 0x7f;\n\n  buff[7] = m & 0xff;\n  m = Math.floor(m / POW_8);\n  buff[6] = m & 0xff;\n  m = Math.floor(m / POW_8);\n  buff[5] = m & 0xff;\n  m = Math.floor(m / POW_8);\n  buff[4] = m & 0xff;\n  m >>= 8;\n  buff[3] = m & 0xff;\n  m >>= 8;\n  buff[2] = m & 0xff;\n  m >>= 8;\n  buff[1] |= m & 0x0f;\n\n  return buff;\n};\n", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\nvar util = require(\"util\");\n\nmodule.exports = InputBufferUnderrunError;\n\nfunction InputBufferUnderrunError(message) {\n  Error.call(this);\n  if (Error.captureStackTrace !== undefined) {\n    Error.captureStackTrace(this, this.constructor);\n  }\n  this.name = this.constructor.name;\n  this.message = message;\n};\n\nutil.inherits(InputBufferUnderrunError, Error);\n", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\n\nvar util = require('util');\n\nvar disabled = function () {};\nvar logFunc = console.log;\nvar logLevel = 'error'; // default level\n\nfunction factory(level) {\n  return function () {\n    // better use spread syntax, but due to compatibility,\n    // use legacy method here.\n    var args = ['thrift: [' + level + '] '].concat(Array.from(arguments));\n    return logFunc(util.format.apply(null, args));\n  };\n}\n\nvar trace = disabled;\nvar debug = disabled;\nvar error = disabled;\nvar warning = disabled;\nvar info = disabled;\n\nexports.setLogFunc = function (func) {\n  logFunc = func;\n};\n\nvar setLogLevel = exports.setLogLevel = function (level) {\n  trace = debug = error = warning = info = disabled;\n  logLevel = level;\n  switch (logLevel) {\n  case 'trace':\n    trace = factory('TRACE');\n  case 'debug':\n    debug = factory('DEBUG');\n  case 'error':\n    error = factory('ERROR');\n  case 'warning':\n    warning = factory('WARN');\n  case 'info':\n    info = factory('INFO');\n  }\n};\n\n// set default\nsetLogLevel(logLevel);\n\nexports.getLogLevel = function () {\n  return logLevel;\n};\n\nexports.trace = function () {\n  return trace.apply(null, arguments);\n};\n\nexports.debug = function () {\n  return debug.apply(null, arguments);\n};\n\nexports.error = function () {\n  return error.apply(null, arguments);\n};\n\nexports.warning = function () {\n  return warning.apply(null, arguments);\n};\n\nexports.info = function () {\n  return info.apply(null, arguments);\n};\n", "//     Int64.js\n//\n//     Copyright (c) 2012 Robert Kieffer\n//     MIT License - http://opensource.org/licenses/mit-license.php\n\n/**\n * Support for handling 64-bit int numbers in Javascript (node.js)\n *\n * JS Numbers are IEEE-754 binary double-precision floats, which limits the\n * range of values that can be represented with integer precision to:\n *\n * 2^^53 <= N <= 2^53\n *\n * Int64 objects wrap a node Buffer that holds the 8-bytes of int64 data.  These\n * objects operate directly on the buffer which means that if they are created\n * using an existing buffer then setting the value will modify the Buffer, and\n * vice-versa.\n *\n * Internal Representation\n *\n * The internal buffer format is Big Endian.  I.e. the most-significant byte is\n * at buffer[0], the least-significant at buffer[7].  For the purposes of\n * converting to/from JS native numbers, the value is assumed to be a signed\n * integer stored in 2's complement form.\n *\n * For details about IEEE-754 see:\n * http://en.wikipedia.org/wiki/Double_precision_floating-point_format\n */\n\n// Useful masks and values for bit twiddling\nvar MASK31 =  0x7fffffff, VAL31 = 0x80000000;\nvar MASK32 =  0xffffffff, VAL32 = 0x100000000;\n\n// Map for converting hex octets to strings\nvar _HEX = [];\nfor (var i = 0; i < 256; i++) {\n  _HEX[i] = (i > 0xF ? '' : '0') + i.toString(16);\n}\n\n//\n// Int64\n//\n\n/**\n * Constructor accepts any of the following argument types:\n *\n * new Int64(buffer[, offset=0]) - Existing Buffer with byte offset\n * new Int64(Uint8Array[, offset=0]) - Existing Uint8Array with a byte offset\n * new Int64(string)             - Hex string (throws if n is outside int64 range)\n * new Int64(number)             - Number (throws if n is outside int64 range)\n * new Int64(hi, lo)             - Raw bits as two 32-bit values\n */\nvar Int64 = module.exports = function(a1, a2) {\n  if (a1 instanceof Buffer) {\n    this.buffer = a1;\n    this.offset = a2 || 0;\n  } else if (Object.prototype.toString.call(a1) == '[object Uint8Array]') {\n    // Under Browserify, Buffers can extend Uint8Arrays rather than an\n    // instance of Buffer. We could assume the passed in Uint8Array is actually\n    // a buffer but that won't handle the case where a raw Uint8Array is passed\n    // in. We construct a new Buffer just in case.\n    this.buffer = new Buffer(a1);\n    this.offset = a2 || 0;\n  } else {\n    this.buffer = this.buffer || new Buffer(8);\n    this.offset = 0;\n    this.setValue.apply(this, arguments);\n  }\n};\n\n\n// Max integer value that JS can accurately represent\nInt64.MAX_INT = Math.pow(2, 53);\n\n// Min integer value that JS can accurately represent\nInt64.MIN_INT = -Math.pow(2, 53);\n\nInt64.prototype = {\n\n  constructor: Int64,\n\n  /**\n   * Do in-place 2's compliment.  See\n   * http://en.wikipedia.org/wiki/Two's_complement\n   */\n  _2scomp: function() {\n    var b = this.buffer, o = this.offset, carry = 1;\n    for (var i = o + 7; i >= o; i--) {\n      var v = (b[i] ^ 0xff) + carry;\n      b[i] = v & 0xff;\n      carry = v >> 8;\n    }\n  },\n\n  /**\n   * Set the value. Takes any of the following arguments:\n   *\n   * setValue(string) - A hexidecimal string\n   * setValue(number) - Number (throws if n is outside int64 range)\n   * setValue(hi, lo) - Raw bits as two 32-bit values\n   */\n  setValue: function(hi, lo) {\n    var negate = false;\n    if (arguments.length == 1) {\n      if (typeof(hi) == 'number') {\n        // Simplify bitfield retrieval by using abs() value.  We restore sign\n        // later\n        negate = hi < 0;\n        hi = Math.abs(hi);\n        lo = hi % VAL32;\n        hi = hi / VAL32;\n        if (hi > VAL32) throw new RangeError(hi  + ' is outside Int64 range');\n        hi = hi | 0;\n      } else if (typeof(hi) == 'string') {\n        hi = (hi + '').replace(/^0x/, '');\n        lo = hi.substr(-8);\n        hi = hi.length > 8 ? hi.substr(0, hi.length - 8) : '';\n        hi = parseInt(hi, 16);\n        lo = parseInt(lo, 16);\n      } else {\n        throw new Error(hi + ' must be a Number or String');\n      }\n    }\n\n    // Technically we should throw if hi or lo is outside int32 range here, but\n    // it's not worth the effort. Anything past the 32'nd bit is ignored.\n\n    // Copy bytes to buffer\n    var b = this.buffer, o = this.offset;\n    for (var i = 7; i >= 0; i--) {\n      b[o+i] = lo & 0xff;\n      lo = i == 4 ? hi : lo >>> 8;\n    }\n\n    // Restore sign of passed argument\n    if (negate) this._2scomp();\n  },\n\n  /**\n   * Convert to a native JS number.\n   *\n   * WARNING: Do not expect this value to be accurate to integer precision for\n   * large (positive or negative) numbers!\n   *\n   * @param allowImprecise If true, no check is performed to verify the\n   * returned value is accurate to integer precision.  If false, imprecise\n   * numbers (very large positive or negative numbers) will be forced to +/-\n   * Infinity.\n   */\n  toNumber: function(allowImprecise) {\n    var b = this.buffer, o = this.offset;\n\n    // Running sum of octets, doing a 2's complement\n    var negate = b[o] & 0x80, x = 0, carry = 1;\n    for (var i = 7, m = 1; i >= 0; i--, m *= 256) {\n      var v = b[o+i];\n\n      // 2's complement for negative numbers\n      if (negate) {\n        v = (v ^ 0xff) + carry;\n        carry = v >> 8;\n        v = v & 0xff;\n      }\n\n      x += v * m;\n    }\n\n    // Return Infinity if we've lost integer precision\n    if (!allowImprecise && x >= Int64.MAX_INT) {\n      return negate ? -Infinity : Infinity;\n    }\n\n    return negate ? -x : x;\n  },\n\n  /**\n   * Convert to a JS Number. Returns +/-Infinity for values that can't be\n   * represented to integer precision.\n   */\n  valueOf: function() {\n    return this.toNumber(false);\n  },\n\n  /**\n   * Return string value\n   *\n   * @param radix Just like Number#toString()'s radix\n   */\n  toString: function(radix) {\n    return this.valueOf().toString(radix || 10);\n  },\n\n  /**\n   * Return a string showing the buffer octets, with MSB on the left.\n   *\n   * @param sep separator string. default is '' (empty string)\n   */\n  toOctetString: function(sep) {\n    var out = new Array(8);\n    var b = this.buffer, o = this.offset;\n    for (var i = 0; i < 8; i++) {\n      out[i] = _HEX[b[o+i]];\n    }\n    return out.join(sep || '');\n  },\n\n  /**\n   * Returns the int64's 8 bytes in a buffer.\n   *\n   * @param {bool} [rawBuffer=false]  If no offset and this is true, return the internal buffer.  Should only be used if\n   *                                  you're discarding the Int64 afterwards, as it breaks encapsulation.\n   */\n  toBuffer: function(rawBuffer) {\n    if (rawBuffer && this.offset === 0) return this.buffer;\n\n    var out = new Buffer(8);\n    this.buffer.copy(out, 0, this.offset, this.offset + 8);\n    return out;\n  },\n\n  /**\n   * Copy 8 bytes of int64 into target buffer at target offset.\n   *\n   * @param {Buffer} targetBuffer       Buffer to copy into.\n   * @param {number} [targetOffset=0]   Offset into target buffer.\n   */\n  copy: function(targetBuffer, targetOffset) {\n    this.buffer.copy(targetBuffer, targetOffset || 0, this.offset, this.offset + 8);\n  },\n\n  /**\n   * Returns a number indicating whether this comes before or after or is the\n   * same as the other in sort order.\n   *\n   * @param {Int64} other  Other Int64 to compare.\n   */\n  compare: function(other) {\n\n    // If sign bits differ ...\n    if ((this.buffer[this.offset] & 0x80) != (other.buffer[other.offset] & 0x80)) {\n      return other.buffer[other.offset] - this.buffer[this.offset];\n    }\n\n    // otherwise, compare bytes lexicographically\n    for (var i = 0; i < 8; i++) {\n      if (this.buffer[this.offset+i] !== other.buffer[other.offset+i]) {\n        return this.buffer[this.offset+i] - other.buffer[other.offset+i];\n      }\n    }\n    return 0;\n  },\n\n  /**\n   * Returns a boolean indicating if this integer is equal to other.\n   *\n   * @param {Int64} other  Other Int64 to compare.\n   */\n  equals: function(other) {\n    return this.compare(other) === 0;\n  },\n\n  /**\n   * Pretty output in console.log\n   */\n  inspect: function() {\n    return '[Int64 value:' + this + ' octets:' + this.toOctetString(' ') + ']';\n  }\n};\n", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\n\nvar log = require('./log');\nvar Int64 = require('node-int64');\nvar Thrift = require('./thrift');\nvar Type = Thrift.Type;\n\nmodule.exports = TCompactProtocol;\n\nvar POW_8 = Math.pow(2, 8);\nvar POW_24 = Math.pow(2, 24);\nvar POW_32 = Math.pow(2, 32);\nvar POW_40 = Math.pow(2, 40);\nvar POW_48 = Math.pow(2, 48);\nvar POW_52 = Math.pow(2, 52);\nvar POW_1022 = Math.pow(2, 1022);\n\n/**\n * Constructor Function for the Compact Protocol.\n * @constructor\n * @param {object} [trans] - The underlying transport to read/write.\n * @classdesc The Apache Thrift Protocol layer performs serialization\n *     of base types, the compact protocol serializes data in binary\n *     form with minimal space used for scalar values.\n */\nfunction TCompactProtocol(trans) {\n  this.trans = trans;\n  this.lastField_ = [];\n  this.lastFieldId_ = 0;\n  this.string_limit_ = 0;\n  this.string_buf_ = null;\n  this.string_buf_size_ = 0;\n  this.container_limit_ = 0;\n  this.booleanField_ = {\n    name: null,\n    hasBoolValue: false\n  };\n  this.boolValue_ = {\n    hasBoolValue: false,\n    boolValue: false\n  };\n};\n\n\n//\n// Compact Protocol Constants\n//\n\n/**\n  * Compact Protocol ID number.\n  * @readonly\n  * @const {number} PROTOCOL_ID\n  */\nTCompactProtocol.PROTOCOL_ID = -126;  //1000 0010\n\n/**\n  * Compact Protocol version number.\n  * @readonly\n  * @const {number} VERSION_N\n  */\nTCompactProtocol.VERSION_N = 1;\n\n/**\n  * Compact Protocol version mask for combining protocol version and message type in one byte.\n  * @readonly\n  * @const {number} VERSION_MASK\n  */\nTCompactProtocol.VERSION_MASK = 0x1f; //0001 1111\n\n/**\n  * Compact Protocol message type mask for combining protocol version and message type in one byte.\n  * @readonly\n  * @const {number} TYPE_MASK\n  */\nTCompactProtocol.TYPE_MASK = -32;     //1110 0000\n\n/**\n  * Compact Protocol message type bits for ensuring message type bit size.\n  * @readonly\n  * @const {number} TYPE_BITS\n  */\nTCompactProtocol.TYPE_BITS = 7; //0000 0111\n\n/**\n  * Compact Protocol message type shift amount for combining protocol version and message type in one byte.\n  * @readonly\n  * @const {number} TYPE_SHIFT_AMOUNT\n  */\nTCompactProtocol.TYPE_SHIFT_AMOUNT = 5;\n\n/**\n * Compact Protocol type IDs used to keep type data within one nibble.\n * @readonly\n * @property {number}  CT_STOP          - End of a set of fields.\n * @property {number}  CT_BOOLEAN_TRUE  - Flag for Boolean field with true value (packed field and value).\n * @property {number}  CT_BOOLEAN_FALSE - Flag for Boolean field with false value (packed field and value).\n * @property {number}  CT_BYTE          - Signed 8 bit integer.\n * @property {number}  CT_I16           - Signed 16 bit integer.\n * @property {number}  CT_I32           - Signed 32 bit integer.\n * @property {number}  CT_I64           - Signed 64 bit integer (2^53 max in JavaScript).\n * @property {number}  CT_DOUBLE        - 64 bit IEEE 854 floating point.\n * @property {number}  CT_BINARY        - Array of bytes (used for strings also).\n * @property {number}  CT_LIST          - A collection type (unordered).\n * @property {number}  CT_SET           - A collection type (unordered and without repeated values).\n * @property {number}  CT_MAP           - A collection type (map/associative-array/dictionary).\n * @property {number}  CT_STRUCT        - A multifield type.\n */\nTCompactProtocol.Types = {\n  CT_STOP:           0x00,\n  CT_BOOLEAN_TRUE:   0x01,\n  CT_BOOLEAN_FALSE:  0x02,\n  CT_BYTE:           0x03,\n  CT_I16:            0x04,\n  CT_I32:            0x05,\n  CT_I64:            0x06,\n  CT_DOUBLE:         0x07,\n  CT_BINARY:         0x08,\n  CT_LIST:           0x09,\n  CT_SET:            0x0A,\n  CT_MAP:            0x0B,\n  CT_STRUCT:         0x0C\n};\n\n/**\n * Array mapping Compact type IDs to standard Thrift type IDs.\n * @readonly\n */\nTCompactProtocol.TTypeToCType = [\n  TCompactProtocol.Types.CT_STOP,         // T_STOP\n  0,                                      // unused\n  TCompactProtocol.Types.CT_BOOLEAN_TRUE, // T_BOOL\n  TCompactProtocol.Types.CT_BYTE,         // T_BYTE\n  TCompactProtocol.Types.CT_DOUBLE,       // T_DOUBLE\n  0,                                      // unused\n  TCompactProtocol.Types.CT_I16,          // T_I16\n  0,                                      // unused\n  TCompactProtocol.Types.CT_I32,          // T_I32\n  0,                                      // unused\n  TCompactProtocol.Types.CT_I64,          // T_I64\n  TCompactProtocol.Types.CT_BINARY,       // T_STRING\n  TCompactProtocol.Types.CT_STRUCT,       // T_STRUCT\n  TCompactProtocol.Types.CT_MAP,          // T_MAP\n  TCompactProtocol.Types.CT_SET,          // T_SET\n  TCompactProtocol.Types.CT_LIST,         // T_LIST\n];\n\n\n//\n// Compact Protocol Utilities\n//\n\n/**\n * Returns the underlying transport layer.\n * @return {object} The underlying transport layer.\n */TCompactProtocol.prototype.getTransport = function() {\n  return this.trans;\n};\n\n/**\n * Lookup a Compact Protocol Type value for a given Thrift Type value.\n * N.B. Used only internally.\n * @param {number} ttype - Thrift type value\n * @returns {number} Compact protocol type value\n */\nTCompactProtocol.prototype.getCompactType = function(ttype) {\n  return TCompactProtocol.TTypeToCType[ttype];\n};\n\n/**\n * Lookup a Thrift Type value for a given Compact Protocol Type value.\n * N.B. Used only internally.\n * @param {number} type - Compact Protocol type value\n * @returns {number} Thrift Type value\n */\nTCompactProtocol.prototype.getTType = function(type) {\n  switch (type) {\n    case Type.STOP:\n      return Type.STOP;\n    case TCompactProtocol.Types.CT_BOOLEAN_FALSE:\n    case TCompactProtocol.Types.CT_BOOLEAN_TRUE:\n      return Type.BOOL;\n    case TCompactProtocol.Types.CT_BYTE:\n      return Type.BYTE;\n    case TCompactProtocol.Types.CT_I16:\n      return Type.I16;\n    case TCompactProtocol.Types.CT_I32:\n      return Type.I32;\n    case TCompactProtocol.Types.CT_I64:\n      return Type.I64;\n    case TCompactProtocol.Types.CT_DOUBLE:\n      return Type.DOUBLE;\n    case TCompactProtocol.Types.CT_BINARY:\n      return Type.STRING;\n    case TCompactProtocol.Types.CT_LIST:\n      return Type.LIST;\n    case TCompactProtocol.Types.CT_SET:\n      return Type.SET;\n    case TCompactProtocol.Types.CT_MAP:\n      return Type.MAP;\n    case TCompactProtocol.Types.CT_STRUCT:\n      return Type.STRUCT;\n    default:\n      throw new Thrift.TProtocolException(Thrift.TProtocolExceptionType.INVALID_DATA, \"Unknown type: \" + type);\n  }\n  return Type.STOP;\n};\n\n\n//\n// Compact Protocol write operations\n//\n\n/**\n * Send any buffered bytes to the end point.\n */\nTCompactProtocol.prototype.flush = function() {\n  return this.trans.flush();\n};\n\n/**\n * Writes an RPC message header\n * @param {string} name - The method name for the message.\n * @param {number} type - The type of message (CALL, REPLY, EXCEPTION, ONEWAY).\n * @param {number} seqid - The call sequence number (if any).\n */\nTCompactProtocol.prototype.writeMessageBegin = function(name, type, seqid) {\n  this.writeByte(TCompactProtocol.PROTOCOL_ID);\n  this.writeByte((TCompactProtocol.VERSION_N & TCompactProtocol.VERSION_MASK) |\n                     ((type << TCompactProtocol.TYPE_SHIFT_AMOUNT) & TCompactProtocol.TYPE_MASK));\n  this.writeVarint32(seqid);\n  this.writeString(name);\n\n  // Record client seqid to find callback again\n  if (this._seqid) {\n    log.warning('SeqId already set', { 'name': name });\n  } else {\n    this._seqid = seqid;\n    this.trans.setCurrSeqId(seqid);\n  }\n};\n\nTCompactProtocol.prototype.writeMessageEnd = function() {\n};\n\nTCompactProtocol.prototype.writeStructBegin = function(name) {\n  this.lastField_.push(this.lastFieldId_);\n  this.lastFieldId_ = 0;\n};\n\nTCompactProtocol.prototype.writeStructEnd = function() {\n  this.lastFieldId_ = this.lastField_.pop();\n};\n\n/**\n * Writes a struct field header\n * @param {string} name - The field name (not written with the compact protocol).\n * @param {number} type - The field data type (a normal Thrift field Type).\n * @param {number} id - The IDL field Id.\n */\nTCompactProtocol.prototype.writeFieldBegin = function(name, type, id) {\n  if (type != Type.BOOL) {\n    return this.writeFieldBeginInternal(name, type, id, -1);\n  }\n\n  this.booleanField_.name = name;\n  this.booleanField_.fieldType = type;\n  this.booleanField_.fieldId = id;\n};\n\nTCompactProtocol.prototype.writeFieldEnd = function() {\n};\n\nTCompactProtocol.prototype.writeFieldStop = function() {\n  this.writeByte(TCompactProtocol.Types.CT_STOP);\n};\n\n/**\n * Writes a map collection header\n * @param {number} keyType - The Thrift type of the map keys.\n * @param {number} valType - The Thrift type of the map values.\n * @param {number} size - The number of k/v pairs in the map.\n */\nTCompactProtocol.prototype.writeMapBegin = function(keyType, valType, size) {\n  if (size === 0) {\n    this.writeByte(0);\n  } else {\n    this.writeVarint32(size);\n    this.writeByte(this.getCompactType(keyType) << 4 | this.getCompactType(valType));\n  }\n};\n\nTCompactProtocol.prototype.writeMapEnd = function() {\n};\n\n/**\n * Writes a list collection header\n * @param {number} elemType - The Thrift type of the list elements.\n * @param {number} size - The number of elements in the list.\n */\nTCompactProtocol.prototype.writeListBegin = function(elemType, size) {\n  this.writeCollectionBegin(elemType, size);\n};\n\nTCompactProtocol.prototype.writeListEnd = function() {\n};\n\n/**\n * Writes a set collection header\n * @param {number} elemType - The Thrift type of the set elements.\n * @param {number} size - The number of elements in the set.\n */\nTCompactProtocol.prototype.writeSetBegin = function(elemType, size) {\n  this.writeCollectionBegin(elemType, size);\n};\n\nTCompactProtocol.prototype.writeSetEnd = function() {\n};\n\nTCompactProtocol.prototype.writeBool = function(value) {\n  if (this.booleanField_.name !== null) {\n    // we haven't written the field header yet\n    this.writeFieldBeginInternal(this.booleanField_.name,\n                                 this.booleanField_.fieldType,\n                                 this.booleanField_.fieldId,\n                                 (value ? TCompactProtocol.Types.CT_BOOLEAN_TRUE\n                                          : TCompactProtocol.Types.CT_BOOLEAN_FALSE));\n    this.booleanField_.name = null;\n  } else {\n    // we're not part of a field, so just write the value\n    this.writeByte((value ? TCompactProtocol.Types.CT_BOOLEAN_TRUE\n                            : TCompactProtocol.Types.CT_BOOLEAN_FALSE));\n  }\n};\n\nTCompactProtocol.prototype.writeByte = function(b) {\n  this.trans.write(new Buffer([b]));\n};\n\nTCompactProtocol.prototype.writeI16 = function(i16) {\n  this.writeVarint32(this.i32ToZigzag(i16));\n};\n\nTCompactProtocol.prototype.writeI32 = function(i32) {\n  this.writeVarint32(this.i32ToZigzag(i32));\n};\n\nTCompactProtocol.prototype.writeI64 = function(i64) {\n  this.writeVarint64(this.i64ToZigzag(i64));\n};\n\n// Little-endian, unlike TBinaryProtocol\nTCompactProtocol.prototype.writeDouble = function(v) {\n  var buff = new Buffer(8);\n  var m, e, c;\n\n  buff[7] = (v < 0 ? 0x80 : 0x00);\n\n  v = Math.abs(v);\n  if (v !== v) {\n    // NaN, use QNaN IEEE format\n    m = 2251799813685248;\n    e = 2047;\n  } else if (v === Infinity) {\n    m = 0;\n    e = 2047;\n  } else {\n    e = Math.floor(Math.log(v) / Math.LN2);\n    c = Math.pow(2, -e);\n    if (v * c < 1) {\n      e--;\n      c *= 2;\n    }\n\n    if (e + 1023 >= 2047)\n    {\n      // Overflow\n      m = 0;\n      e = 2047;\n    }\n    else if (e + 1023 >= 1)\n    {\n      // Normalized - term order matters, as Math.pow(2, 52-e) and v*Math.pow(2, 52) can overflow\n      m = (v*c-1) * POW_52;\n      e += 1023;\n    }\n    else\n    {\n      // Denormalized - also catches the '0' case, somewhat by chance\n      m = (v * POW_1022) * POW_52;\n      e = 0;\n    }\n  }\n\n  buff[6] = (e << 4) & 0xf0;\n  buff[7] |= (e >> 4) & 0x7f;\n\n  buff[0] = m & 0xff;\n  m = Math.floor(m / POW_8);\n  buff[1] = m & 0xff;\n  m = Math.floor(m / POW_8);\n  buff[2] = m & 0xff;\n  m = Math.floor(m / POW_8);\n  buff[3] = m & 0xff;\n  m >>= 8;\n  buff[4] = m & 0xff;\n  m >>= 8;\n  buff[5] = m & 0xff;\n  m >>= 8;\n  buff[6] |= m & 0x0f;\n\n  this.trans.write(buff);\n};\n\nTCompactProtocol.prototype.writeStringOrBinary = function(name, encoding, arg) {\n  if (typeof arg === 'string') {\n    this.writeVarint32(Buffer.byteLength(arg, encoding)) ;\n    this.trans.write(new Buffer(arg, encoding));\n  } else if (arg instanceof Buffer ||\n             Object.prototype.toString.call(arg) == '[object Uint8Array]') {\n    // Buffers in Node.js under Browserify may extend UInt8Array instead of\n    // defining a new object. We detect them here so we can write them\n    // correctly\n    this.writeVarint32(arg.length);\n    this.trans.write(arg);\n  } else {\n    throw new Error(name + ' called without a string/Buffer argument: ' + arg);\n  }\n};\n\nTCompactProtocol.prototype.writeString = function(arg) {\n  this.writeStringOrBinary('writeString', 'utf8', arg);\n};\n\nTCompactProtocol.prototype.writeBinary = function(arg) {\n  this.writeStringOrBinary('writeBinary', 'binary', arg);\n};\n\n\n//\n// Compact Protocol internal write methods\n//\n\nTCompactProtocol.prototype.writeFieldBeginInternal = function(name,\n                                                              fieldType,\n                                                              fieldId,\n                                                              typeOverride) {\n  //If there's a type override, use that.\n  var typeToWrite = (typeOverride == -1 ? this.getCompactType(fieldType) : typeOverride);\n  //Check if we can delta encode the field id\n  if (fieldId > this.lastFieldId_ && fieldId - this.lastFieldId_ <= 15) {\n    //Include the type delta with the field ID\n    this.writeByte((fieldId - this.lastFieldId_) << 4 | typeToWrite);\n  } else {\n    //Write separate type and ID values\n    this.writeByte(typeToWrite);\n    this.writeI16(fieldId);\n  }\n  this.lastFieldId_ = fieldId;\n};\n\nTCompactProtocol.prototype.writeCollectionBegin = function(elemType, size) {\n  if (size <= 14) {\n    //Combine size and type in one byte if possible\n    this.writeByte(size << 4 | this.getCompactType(elemType));\n  } else {\n    this.writeByte(0xf0 | this.getCompactType(elemType));\n    this.writeVarint32(size);\n  }\n};\n\n/**\n * Write an i32 as a varint. Results in 1-5 bytes on the wire.\n */\nTCompactProtocol.prototype.writeVarint32 = function(n) {\n  var buf = new Buffer(5);\n  var wsize = 0;\n  while (true) {\n    if ((n & ~0x7F) === 0) {\n      buf[wsize++] = n;\n      break;\n    } else {\n      buf[wsize++] = ((n & 0x7F) | 0x80);\n      n = n >>> 7;\n    }\n  }\n  var wbuf = new Buffer(wsize);\n  buf.copy(wbuf,0,0,wsize);\n  this.trans.write(wbuf);\n};\n\n/**\n * Write an i64 as a varint. Results in 1-10 bytes on the wire.\n * N.B. node-int64 is always big endian\n */\nTCompactProtocol.prototype.writeVarint64 = function(n) {\n  if (typeof n === \"number\"){\n    n = new Int64(n);\n  }\n  if (! (n instanceof Int64)) {\n    throw new Thrift.TProtocolException(Thrift.TProtocolExceptionType.INVALID_DATA, \"Expected Int64 or Number, found: \" + n);\n  }\n\n  var buf = new Buffer(10);\n  var wsize = 0;\n  var hi = n.buffer.readUInt32BE(0, true);\n  var lo = n.buffer.readUInt32BE(4, true);\n  var mask = 0;\n  while (true) {\n    if (((lo & ~0x7F) === 0) && (hi === 0)) {\n      buf[wsize++] = lo;\n      break;\n    } else {\n      buf[wsize++] = ((lo & 0x7F) | 0x80);\n      mask = hi << 25;\n      lo = lo >>> 7;\n      hi = hi >>> 7;\n      lo = lo | mask;\n    }\n  }\n  var wbuf = new Buffer(wsize);\n  buf.copy(wbuf,0,0,wsize);\n  this.trans.write(wbuf);\n};\n\n/**\n * Convert l into a zigzag long. This allows negative numbers to be\n * represented compactly as a varint.\n */\nTCompactProtocol.prototype.i64ToZigzag = function(l) {\n  if (typeof l === 'string') {\n    l = new Int64(parseInt(l, 10));\n  } else if (typeof l === 'number') {\n    l = new Int64(l);\n  }\n  if (! (l instanceof Int64)) {\n    throw new Thrift.TProtocolException(Thrift.TProtocolExceptionType.INVALID_DATA, \"Expected Int64 or Number, found: \" + l);\n  }\n  var hi = l.buffer.readUInt32BE(0, true);\n  var lo = l.buffer.readUInt32BE(4, true);\n  var sign = hi >>> 31;\n  hi = ((hi << 1) | (lo >>> 31)) ^ ((!!sign) ? 0xFFFFFFFF : 0);\n  lo = (lo << 1) ^ ((!!sign) ? 0xFFFFFFFF : 0);\n  return new Int64(hi, lo);\n};\n\n/**\n * Convert n into a zigzag int. This allows negative numbers to be\n * represented compactly as a varint.\n */\nTCompactProtocol.prototype.i32ToZigzag = function(n) {\n  return (n << 1) ^ ((n & 0x80000000) ? 0xFFFFFFFF : 0);\n};\n\n\n//\n// Compact Protocol read operations\n//\n\nTCompactProtocol.prototype.readMessageBegin = function() {\n  //Read protocol ID\n  var protocolId = this.trans.readByte();\n  if (protocolId != TCompactProtocol.PROTOCOL_ID) {\n    throw new Thrift.TProtocolException(Thrift.TProtocolExceptionType.BAD_VERSION, \"Bad protocol identifier \" + protocolId);\n  }\n\n  //Read Version and Type\n  var versionAndType = this.trans.readByte();\n  var version = (versionAndType & TCompactProtocol.VERSION_MASK);\n  if (version != TCompactProtocol.VERSION_N) {\n    throw new Thrift.TProtocolException(Thrift.TProtocolExceptionType.BAD_VERSION, \"Bad protocol version \" + version);\n  }\n  var type = ((versionAndType >> TCompactProtocol.TYPE_SHIFT_AMOUNT) & TCompactProtocol.TYPE_BITS);\n\n  //Read SeqId\n  var seqid = this.readVarint32();\n\n  //Read name\n  var name = this.readString();\n\n  return {fname: name, mtype: type, rseqid: seqid};\n};\n\nTCompactProtocol.prototype.readMessageEnd = function() {\n};\n\nTCompactProtocol.prototype.readStructBegin = function() {\n  this.lastField_.push(this.lastFieldId_);\n  this.lastFieldId_ = 0;\n  return {fname: ''};\n};\n\nTCompactProtocol.prototype.readStructEnd = function() {\n  this.lastFieldId_ = this.lastField_.pop();\n};\n\nTCompactProtocol.prototype.readFieldBegin = function() {\n  var fieldId = 0;\n  var b = this.trans.readByte(b);\n  var type = (b & 0x0f);\n\n  if (type == TCompactProtocol.Types.CT_STOP) {\n    return {fname: null, ftype: Thrift.Type.STOP, fid: 0};\n  }\n\n  //Mask off the 4 MSB of the type header to check for field id delta.\n  var modifier = ((b & 0x000000f0) >>> 4);\n  if (modifier === 0) {\n    //If not a delta read the field id.\n    fieldId = this.readI16();\n  } else {\n    //Recover the field id from the delta\n    fieldId = (this.lastFieldId_ + modifier);\n  }\n  var fieldType = this.getTType(type);\n\n  //Boolean are encoded with the type\n  if (type == TCompactProtocol.Types.CT_BOOLEAN_TRUE ||\n      type == TCompactProtocol.Types.CT_BOOLEAN_FALSE) {\n    this.boolValue_.hasBoolValue = true;\n    this.boolValue_.boolValue =\n      (type == TCompactProtocol.Types.CT_BOOLEAN_TRUE ? true : false);\n  }\n\n  //Save the new field for the next delta computation.\n  this.lastFieldId_ = fieldId;\n  return {fname: null, ftype: fieldType, fid: fieldId};\n};\n\nTCompactProtocol.prototype.readFieldEnd = function() {\n};\n\nTCompactProtocol.prototype.readMapBegin = function() {\n  var msize = this.readVarint32();\n  if (msize < 0) {\n    throw new Thrift.TProtocolException(Thrift.TProtocolExceptionType.NEGATIVE_SIZE, \"Negative map size\");\n  }\n\n  var kvType = 0;\n  if (msize !== 0) {\n    kvType = this.trans.readByte();\n  }\n\n  var keyType = this.getTType((kvType & 0xf0) >>> 4);\n  var valType = this.getTType(kvType & 0xf);\n  return {ktype: keyType, vtype: valType, size: msize};\n};\n\nTCompactProtocol.prototype.readMapEnd = function() {\n};\n\nTCompactProtocol.prototype.readListBegin = function() {\n  var size_and_type = this.trans.readByte();\n\n  var lsize = (size_and_type >>> 4) & 0x0000000f;\n  if (lsize == 15) {\n    lsize = this.readVarint32();\n  }\n\n  if (lsize < 0) {\n    throw new Thrift.TProtocolException(Thrift.TProtocolExceptionType.NEGATIVE_SIZE, \"Negative list size\");\n  }\n\n  var elemType = this.getTType(size_and_type & 0x0000000f);\n\n  return {etype: elemType, size: lsize};\n};\n\nTCompactProtocol.prototype.readListEnd = function() {\n};\n\nTCompactProtocol.prototype.readSetBegin = function() {\n  return this.readListBegin();\n};\n\nTCompactProtocol.prototype.readSetEnd = function() {\n};\n\nTCompactProtocol.prototype.readBool = function() {\n  var value = false;\n  var rsize = 0;\n  if (this.boolValue_.hasBoolValue === true) {\n    value = this.boolValue_.boolValue;\n    this.boolValue_.hasBoolValue = false;\n  } else {\n    var res = this.trans.readByte();\n    rsize = res.rsize;\n    value = (res.value == TCompactProtocol.Types.CT_BOOLEAN_TRUE);\n  }\n  return value;\n};\n\nTCompactProtocol.prototype.readByte = function() {\n  return this.trans.readByte();\n};\n\nTCompactProtocol.prototype.readI16 = function() {\n  return this.readI32();\n};\n\nTCompactProtocol.prototype.readI32 = function() {\n  return this.zigzagToI32(this.readVarint32());\n};\n\nTCompactProtocol.prototype.readI64 = function() {\n  return this.zigzagToI64(this.readVarint64());\n};\n\n// Little-endian, unlike TBinaryProtocol\nTCompactProtocol.prototype.readDouble = function() {\n  var buff = this.trans.read(8);\n  var off = 0;\n\n  var signed = buff[off + 7] & 0x80;\n  var e = (buff[off+6] & 0xF0) >> 4;\n  e += (buff[off+7] & 0x7F) << 4;\n\n  var m = buff[off];\n  m += buff[off+1] << 8;\n  m += buff[off+2] << 16;\n  m += buff[off+3] * POW_24;\n  m += buff[off+4] * POW_32;\n  m += buff[off+5] * POW_40;\n  m += (buff[off+6] & 0x0F) * POW_48;\n\n  switch (e) {\n    case 0:\n      e = -1022;\n      break;\n    case 2047:\n      return m ? NaN : (signed ? -Infinity : Infinity);\n    default:\n      m += POW_52;\n      e -= 1023;\n  }\n\n  if (signed) {\n    m *= -1;\n  }\n\n  return m * Math.pow(2, e - 52);\n};\n\nTCompactProtocol.prototype.readBinary = function() {\n  var size = this.readVarint32();\n  if (size === 0) {\n    return new Buffer(0);\n  }\n\n  if (size < 0) {\n    throw new Thrift.TProtocolException(Thrift.TProtocolExceptionType.NEGATIVE_SIZE, \"Negative binary size\");\n  }\n  return this.trans.read(size);\n};\n\nTCompactProtocol.prototype.readString = function() {\n  var size = this.readVarint32();\n  // Catch empty string case\n  if (size === 0) {\n    return \"\";\n  }\n\n  // Catch error cases\n  if (size < 0) {\n    throw new Thrift.TProtocolException(Thrift.TProtocolExceptionType.NEGATIVE_SIZE, \"Negative string size\");\n  }\n  return this.trans.readString(size);\n};\n\n\n//\n// Compact Protocol internal read operations\n//\n\n/**\n * Read an i32 from the wire as a varint. The MSB of each byte is set\n * if there is another byte to follow. This can read up to 5 bytes.\n */\nTCompactProtocol.prototype.readVarint32 = function() {\n  return this.readVarint64().toNumber();\n};\n\n/**\n * Read an i64 from the wire as a proper varint. The MSB of each byte is set\n * if there is another byte to follow. This can read up to 10 bytes.\n */\nTCompactProtocol.prototype.readVarint64 = function() {\n  var rsize = 0;\n  var lo = 0;\n  var hi = 0;\n  var shift = 0;\n  while (true) {\n    var b = this.trans.readByte();\n    rsize ++;\n    if (shift <= 25) {\n      lo = lo | ((b & 0x7f) << shift);\n    } else if (25 < shift && shift < 32) {\n      lo = lo | ((b & 0x7f) << shift);\n      hi = hi | ((b & 0x7f) >>> (32-shift));\n    } else {\n      hi = hi | ((b & 0x7f) << (shift-32));\n    }\n    shift += 7;\n    if (!(b & 0x80)) {\n      break;\n    }\n    if (rsize >= 10) {\n      throw new Thrift.TProtocolException(Thrift.TProtocolExceptionType.INVALID_DATA, \"Variable-length int over 10 bytes.\");\n    }\n  }\n  return new Int64(hi, lo);\n};\n\n/**\n * Convert from zigzag int to int.\n */\nTCompactProtocol.prototype.zigzagToI32 = function(n) {\n  return (n >>> 1) ^ (-1 * (n & 1));\n};\n\n/**\n * Convert from zigzag long to long.\n */\nTCompactProtocol.prototype.zigzagToI64 = function(n) {\n  var hi = n.buffer.readUInt32BE(0, true);\n  var lo = n.buffer.readUInt32BE(4, true);\n\n  var neg = new Int64(hi & 0, lo & 1);\n  neg._2scomp();\n  var hi_neg = neg.buffer.readUInt32BE(0, true);\n  var lo_neg = neg.buffer.readUInt32BE(4, true);\n\n  var hi_lo = (hi << 31);\n  hi = (hi >>> 1) ^ (hi_neg);\n  lo = ((lo >>> 1) | hi_lo) ^ (lo_neg);\n  return new Int64(hi, lo);\n};\n\nTCompactProtocol.prototype.skip = function(type) {\n  switch (type) {\n    case Type.BOOL:\n      this.readBool();\n      break;\n    case Type.BYTE:\n      this.readByte();\n      break;\n    case Type.I16:\n      this.readI16();\n      break;\n    case Type.I32:\n      this.readI32();\n      break;\n    case Type.I64:\n      this.readI64();\n      break;\n    case Type.DOUBLE:\n      this.readDouble();\n      break;\n    case Type.STRING:\n      this.readString();\n      break;\n    case Type.STRUCT:\n      this.readStructBegin();\n      while (true) {\n        var r = this.readFieldBegin();\n        if (r.ftype === Type.STOP) {\n          break;\n        }\n        this.skip(r.ftype);\n        this.readFieldEnd();\n      }\n      this.readStructEnd();\n      break;\n    case Type.MAP:\n      var mapBegin = this.readMapBegin();\n      for (var i = 0; i < mapBegin.size; ++i) {\n        this.skip(mapBegin.ktype);\n        this.skip(mapBegin.vtype);\n      }\n      this.readMapEnd();\n      break;\n    case Type.SET:\n      var setBegin = this.readSetBegin();\n      for (var i2 = 0; i2 < setBegin.size; ++i2) {\n        this.skip(setBegin.etype);\n      }\n      this.readSetEnd();\n      break;\n    case Type.LIST:\n      var listBegin = this.readListBegin();\n      for (var i3 = 0; i3 < listBegin.size; ++i3) {\n        this.skip(listBegin.etype);\n      }\n      this.readListEnd();\n      break;\n    default:\n      throw new  Error(\"Invalid type: \" + type);\n  }\n};\n", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\n\nvar log = require('./log');\nvar binary = require('./binary');\nvar Int64 = require('node-int64');\nvar Thrift = require('./thrift');\nvar Type = Thrift.Type;\n\nmodule.exports = TBinaryProtocol;\n\n// JavaScript supports only numeric doubles, therefore even hex values are always signed.\n// The largest integer value which can be represented in JavaScript is +/-2^53.\n// Bitwise operations convert numbers to 32 bit integers but perform sign extension\n// upon assigning values back to variables.\nvar VERSION_MASK = -65536,   // 0xffff0000\n    VERSION_1 = -2147418112, // 0x80010000\n    TYPE_MASK = 0x000000ff;\n\nTBinaryProtocol.VERSION_MASK = VERSION_MASK;\nTBinaryProtocol.VERSION_1 = VERSION_1;\nTBinaryProtocol.TYPE_MASK = TYPE_MASK\n\nfunction TBinaryProtocol(trans, strictRead, strictWrite) {\n  this.trans = trans;\n  this.strictRead = (strictRead !== undefined ? strictRead : false);\n  this.strictWrite = (strictWrite !== undefined ? strictWrite : true);\n  this._seqid = null;\n};\n\nTBinaryProtocol.prototype.flush = function() {\n  return this.trans.flush();\n};\n\nTBinaryProtocol.prototype.writeMessageBegin = function(name, type, seqid) {\n    if (this.strictWrite) {\n      this.writeI32(VERSION_1 | type);\n      this.writeString(name);\n      this.writeI32(seqid);\n    } else {\n      this.writeString(name);\n      this.writeByte(type);\n      this.writeI32(seqid);\n    }\n    // Record client seqid to find callback again\n    if (this._seqid !== null) {\n      log.warning('SeqId already set', { 'name': name });\n    } else {\n      this._seqid = seqid;\n      this.trans.setCurrSeqId(seqid);\n    }\n};\n\nTBinaryProtocol.prototype.writeMessageEnd = function() {\n    if (this._seqid !== null) {\n        this._seqid = null;\n    } else {\n        log.warning('No seqid to unset');\n    }\n};\n\nTBinaryProtocol.prototype.writeStructBegin = function(name) {\n};\n\nTBinaryProtocol.prototype.writeStructEnd = function() {\n};\n\nTBinaryProtocol.prototype.writeFieldBegin = function(name, type, id) {\n  this.writeByte(type);\n  this.writeI16(id);\n};\n\nTBinaryProtocol.prototype.writeFieldEnd = function() {\n};\n\nTBinaryProtocol.prototype.writeFieldStop = function() {\n  this.writeByte(Type.STOP);\n};\n\nTBinaryProtocol.prototype.writeMapBegin = function(ktype, vtype, size) {\n  this.writeByte(ktype);\n  this.writeByte(vtype);\n  this.writeI32(size);\n};\n\nTBinaryProtocol.prototype.writeMapEnd = function() {\n};\n\nTBinaryProtocol.prototype.writeListBegin = function(etype, size) {\n  this.writeByte(etype);\n  this.writeI32(size);\n};\n\nTBinaryProtocol.prototype.writeListEnd = function() {\n};\n\nTBinaryProtocol.prototype.writeSetBegin = function(etype, size) {\n  this.writeByte(etype);\n  this.writeI32(size);\n};\n\nTBinaryProtocol.prototype.writeSetEnd = function() {\n};\n\nTBinaryProtocol.prototype.writeBool = function(bool) {\n  if (bool) {\n    this.writeByte(1);\n  } else {\n    this.writeByte(0);\n  }\n};\n\nTBinaryProtocol.prototype.writeByte = function(b) {\n  this.trans.write(new Buffer([b]));\n};\n\nTBinaryProtocol.prototype.writeI16 = function(i16) {\n  this.trans.write(binary.writeI16(new Buffer(2), i16));\n};\n\nTBinaryProtocol.prototype.writeI32 = function(i32) {\n  this.trans.write(binary.writeI32(new Buffer(4), i32));\n};\n\nTBinaryProtocol.prototype.writeI64 = function(i64) {\n  if (i64.buffer) {\n    this.trans.write(i64.buffer);\n  } else {\n    this.trans.write(new Int64(i64).buffer);\n  }\n};\n\nTBinaryProtocol.prototype.writeDouble = function(dub) {\n  this.trans.write(binary.writeDouble(new Buffer(8), dub));\n};\n\nTBinaryProtocol.prototype.writeStringOrBinary = function(name, encoding, arg) {\n  if (typeof(arg) === 'string') {\n    this.writeI32(Buffer.byteLength(arg, encoding));\n    this.trans.write(new Buffer(arg, encoding));\n  } else if ((arg instanceof Buffer) ||\n             (Object.prototype.toString.call(arg) == '[object Uint8Array]')) {\n    // Buffers in Node.js under Browserify may extend UInt8Array instead of\n    // defining a new object. We detect them here so we can write them\n    // correctly\n    this.writeI32(arg.length);\n    this.trans.write(arg);\n  } else {\n    throw new Error(name + ' called without a string/Buffer argument: ' + arg);\n  }\n};\n\nTBinaryProtocol.prototype.writeString = function(arg) {\n  this.writeStringOrBinary('writeString', 'utf8', arg);\n};\n\nTBinaryProtocol.prototype.writeBinary = function(arg) {\n  this.writeStringOrBinary('writeBinary', 'binary', arg);\n};\n\nTBinaryProtocol.prototype.readMessageBegin = function() {\n  var sz = this.readI32();\n  var type, name, seqid;\n\n  if (sz < 0) {\n    var version = sz & VERSION_MASK;\n    if (version != VERSION_1) {\n      throw new Thrift.TProtocolException(Thrift.TProtocolExceptionType.BAD_VERSION, \"Bad version in readMessageBegin: \" + sz);\n    }\n    type = sz & TYPE_MASK;\n    name = this.readString();\n    seqid = this.readI32();\n  } else {\n    if (this.strictRead) {\n      throw new Thrift.TProtocolException(Thrift.TProtocolExceptionType.BAD_VERSION, \"No protocol version header\");\n    }\n    name = this.trans.read(sz);\n    type = this.readByte();\n    seqid = this.readI32();\n  }\n  return {fname: name, mtype: type, rseqid: seqid};\n};\n\nTBinaryProtocol.prototype.readMessageEnd = function() {\n};\n\nTBinaryProtocol.prototype.readStructBegin = function() {\n  return {fname: ''};\n};\n\nTBinaryProtocol.prototype.readStructEnd = function() {\n};\n\nTBinaryProtocol.prototype.readFieldBegin = function() {\n  var type = this.readByte();\n  if (type == Type.STOP) {\n    return {fname: null, ftype: type, fid: 0};\n  }\n  var id = this.readI16();\n  return {fname: null, ftype: type, fid: id};\n};\n\nTBinaryProtocol.prototype.readFieldEnd = function() {\n};\n\nTBinaryProtocol.prototype.readMapBegin = function() {\n  var ktype = this.readByte();\n  var vtype = this.readByte();\n  var size = this.readI32();\n  return {ktype: ktype, vtype: vtype, size: size};\n};\n\nTBinaryProtocol.prototype.readMapEnd = function() {\n};\n\nTBinaryProtocol.prototype.readListBegin = function() {\n  var etype = this.readByte();\n  var size = this.readI32();\n  return {etype: etype, size: size};\n};\n\nTBinaryProtocol.prototype.readListEnd = function() {\n};\n\nTBinaryProtocol.prototype.readSetBegin = function() {\n  var etype = this.readByte();\n  var size = this.readI32();\n  return {etype: etype, size: size};\n};\n\nTBinaryProtocol.prototype.readSetEnd = function() {\n};\n\nTBinaryProtocol.prototype.readBool = function() {\n  var b = this.readByte();\n  if (b === 0) {\n    return false;\n  }\n  return true;\n};\n\nTBinaryProtocol.prototype.readByte = function() {\n  return this.trans.readByte();\n};\n\nTBinaryProtocol.prototype.readI16 = function() {\n  return this.trans.readI16();\n};\n\nTBinaryProtocol.prototype.readI32 = function() {\n  return this.trans.readI32();\n};\n\nTBinaryProtocol.prototype.readI64 = function() {\n  var buff = this.trans.read(8);\n  return new Int64(buff);\n};\n\nTBinaryProtocol.prototype.readDouble = function() {\n  return this.trans.readDouble();\n};\n\nTBinaryProtocol.prototype.readBinary = function() {\n  var len = this.readI32();\n  if (len === 0) {\n    return new Buffer(0);\n  }\n\n  if (len < 0) {\n    throw new Thrift.TProtocolException(Thrift.TProtocolExceptionType.NEGATIVE_SIZE, \"Negative binary size\");\n  }\n  return this.trans.read(len);\n};\n\nTBinaryProtocol.prototype.readString = function() {\n  var len = this.readI32();\n  if (len === 0) {\n    return \"\";\n  }\n\n  if (len < 0) {\n    throw new Thrift.TProtocolException(Thrift.TProtocolExceptionType.NEGATIVE_SIZE, \"Negative string size\");\n  }\n  return this.trans.readString(len);\n};\n\nTBinaryProtocol.prototype.getTransport = function() {\n  return this.trans;\n};\n\nTBinaryProtocol.prototype.skip = function(type) {\n  switch (type) {\n    case Type.BOOL:\n      this.readBool();\n      break;\n    case Type.BYTE:\n      this.readByte();\n      break;\n    case Type.I16:\n      this.readI16();\n      break;\n    case Type.I32:\n      this.readI32();\n      break;\n    case Type.I64:\n      this.readI64();\n      break;\n    case Type.DOUBLE:\n      this.readDouble();\n      break;\n    case Type.STRING:\n      this.readString();\n      break;\n    case Type.STRUCT:\n      this.readStructBegin();\n      while (true) {\n        var r = this.readFieldBegin();\n        if (r.ftype === Type.STOP) {\n          break;\n        }\n        this.skip(r.ftype);\n        this.readFieldEnd();\n      }\n      this.readStructEnd();\n      break;\n    case Type.MAP:\n      var mapBegin = this.readMapBegin();\n      for (var i = 0; i < mapBegin.size; ++i) {\n        this.skip(mapBegin.ktype);\n        this.skip(mapBegin.vtype);\n      }\n      this.readMapEnd();\n      break;\n    case Type.SET:\n      var setBegin = this.readSetBegin();\n      for (var i2 = 0; i2 < setBegin.size; ++i2) {\n        this.skip(setBegin.etype);\n      }\n      this.readSetEnd();\n      break;\n    case Type.LIST:\n      var listBegin = this.readListBegin();\n      for (var i3 = 0; i3 < listBegin.size; ++i3) {\n        this.skip(listBegin.etype);\n      }\n      this.readListEnd();\n      break;\n    default:\n      throw new  Error(\"Invalid type: \" + type);\n  }\n};\n", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\n\nvar util = require('util');\nvar TCompactProtocol = require('./compact_protocol');\nvar TBinaryProtocol = require('./binary_protocol');\nvar InputBufferUnderrunError = require('./input_buffer_underrun_error');\n\nfunction THeaderTransportError(message) {\n  Error.call(this);\n  if (Error.captureStackTrace !== undefined) {\n    Error.captureStackTrace(this, this.constructor);\n  }\n  this.name = this.constructor.name;\n  this.message = message;\n}\n\nutil.inherits(THeaderTransportError, Error);\n\nmodule.exports = THeaderTransport;\n\n// from HeaderFormat.md\nvar COMPACT_PROTOCOL_OFFSET = 0;\nvar COMPACT_PROTOCOL_VERSION_OFFSET = 1;\nvar FRAME_SIZE_OFFSET = 0;\nvar HEADER_MAGIC_OFFSET = 32 / 8;\nvar FLAGS_OFFSET = 48 / 8;\nvar SEQID_OFFSET = 64 / 8;\nvar HEADER_SIZE_OFFSET = 96 / 8;\nvar HEADER_START_OFFSET = 112 / 8;\n\nvar HEADER_MAGIC = 0x0FFF;\n\nvar TINFO_HEADER_KEY_VALUE_TYPE = 0x01;\nvar MAX_FRAME_SIZE = 0x3FFFFFFF;\n\n // A helper class for reading/writing varints. Uses\n // TCompactProtocol under the hood\nfunction VarintHelper(readBuffer) {\n  var TBufferedTransport = require('./buffered_transport');\n  this.outputBuffer = null;\n  var _this = this;\n  this.transport = new TBufferedTransport(null, function(output) {\n    _this.outputBuffer = output;\n  });\n\n  this.transport.inBuf = readBuffer || Buffer.alloc(0);\n  this.transport.writeCursor = this.transport.inBuf.length;\n  this.protocol = new TCompactProtocol(this.transport);\n};\n\nVarintHelper.prototype.readVarint32 = function() {\n  return this.protocol.readVarint32();\n};\n\nVarintHelper.prototype.writeVarint32 = function(i) {\n  this.protocol.writeVarint32(i);\n};\n\nVarintHelper.prototype.readString = function() {\n  return this.protocol.readString();\n};\n\nVarintHelper.prototype.writeString = function(str) {\n  this.protocol.writeString(str);\n}\n\nVarintHelper.prototype.getOutCount = function() {\n  return this.transport.outCount;\n};\n\nVarintHelper.prototype.write = function(str) {\n  this.transport.write(str);\n};\n\nVarintHelper.prototype.toBuffer = function() {\n  this.transport.flush();\n  return this.outputBuffer;\n};\n\n// from lib/cpp/src/thrift/protocol/TProtocolTypes.h\nTHeaderTransport.SubprotocolId = {\n  BINARY: 0,\n  JSON: 1,\n  COMPACT: 2,\n};\n\n/**\n  An abstract transport used as a prototype for other transports\n  to enable reading/writing theaders. This should NOT be used as a standalone transport\n  The methods in this transport are called by THeaderProtocol, which will call readHeaders/writeHeaders\n  in the read/writeMessageBegin methods and parse/write headers to/from a request\n  prior to reading/writing.\n\n  The reason this is not a standalone transport type is because different transport types\n  have their own individual static receiver methods that are called prior to instantiation.\n  There doesn't seem to be a way for THeaderTransport to know which receiver method to use\n  without reworking the server API.\n\n  For reading headers from a request, the parsed headers can be retrieved via\n  getReadHeader. Similarly, you can set headers to be written on the client via\n  setWriteHeader.\n */\nfunction THeaderTransport() {\n  this.maxFrameSize = MAX_FRAME_SIZE;\n  this.protocolId = THeaderTransport.SubprotocolId.BINARY;\n  this.rheaders = {};\n  this.wheaders = {};\n  this.inBuf = Buffer.alloc(0);\n  this.outCount = 0;\n  this.flags = null;\n  this.seqid = 0;\n  this.shouldWriteHeaders = true;\n};\n\nvar validateHeaders = function(key, value) {\n  if (typeof key !== 'string' || typeof value !== 'string') {\n    throw new THeaderTransportError('Header key and values must be strings');\n  }\n};\n\nvar validateProtocolId = function(protocolId) {\n  var protocols = Object.keys(THeaderTransport.SubprotocolId);\n  for (var i = 0; i < protocols.length; i++) {\n    if (protocolId === THeaderTransport.SubprotocolId[protocols[i]]) return true;\n  }\n\n  throw new Error(protocolId + ' is not a valid protocol id');\n};\n\nTHeaderTransport.prototype.setSeqId = function(seqid) {\n  this.seqid = seqid;\n};\n\nTHeaderTransport.prototype.getSeqId = function(seqid) {\n  return this.seqid;\n};\n\nTHeaderTransport.prototype.setFlags = function(flags) {\n  this.flags = flags;\n};\n\nTHeaderTransport.prototype.getReadHeaders = function() {\n  return this.rheaders;\n};\n\nTHeaderTransport.prototype.setReadHeader = function(key, value) {\n  validateHeaders(key, value);\n  this.rheaders[key] = value;\n};\n\nTHeaderTransport.prototype.clearReadHeaders = function() {\n  this.rheaders = {};\n};\n\nTHeaderTransport.prototype.getWriteHeaders = function() {\n  return this.wheaders;\n};\n\nTHeaderTransport.prototype.setWriteHeader = function(key, value) {\n  validateHeaders(key, value);\n  this.wheaders[key] = value;\n};\n\nTHeaderTransport.prototype.clearWriteHeaders = function() {\n  this.wheaders = {};\n};\n\nTHeaderTransport.prototype.setMaxFrameSize = function(frameSize) {\n  this.maxFrameSize = frameSize;\n};\n\nTHeaderTransport.prototype.setProtocolId = function(protocolId) {\n  validateProtocolId(protocolId);\n  this.protocolId = protocolId;\n};\n\nTHeaderTransport.prototype.getProtocolId = function() {\n  return this.protocolId;\n};\n\nvar isUnframedBinary = function(readBuffer) {\n  var version = readBuffer.readInt32BE();\n  return (version & TBinaryProtocol.VERSION_MASK) === TBinaryProtocol.VERSION_1;\n}\n\nvar isUnframedCompact = function(readBuffer) {\n  var protocolId = readBuffer.readInt8(COMPACT_PROTOCOL_OFFSET);\n  var version = readBuffer.readInt8(COMPACT_PROTOCOL_VERSION_OFFSET);\n  return protocolId === TCompactProtocol.PROTOCOL_ID &&\n    (version & TCompactProtocol.VERSION_MASK) === TCompactProtocol.VERSION_N;\n}\n\nTHeaderTransport.prototype.readHeaders = function() {\n  var readBuffer = this.inBuf;\n\n  var isUnframed = false;\n  if (isUnframedBinary(readBuffer)) {\n    this.setProtocolId(THeaderTransport.SubprotocolId.BINARY);\n    isUnframed = true;\n  }\n\n  if (isUnframedCompact(readBuffer)) {\n    this.setProtocolId(THeaderTransport.SubprotocolId.COMPACT);\n    isUnframed = true;\n  }\n\n  if (isUnframed) {\n    this.shouldWriteHeaders = false;\n    return;\n  }\n\n  var frameSize = readBuffer.readInt32BE(FRAME_SIZE_OFFSET);\n  if (frameSize > this.maxFrameSize) {\n    throw new THeaderTransportError('Frame exceeds maximum frame size');\n  }\n\n  var headerMagic = readBuffer.readInt16BE(HEADER_MAGIC_OFFSET);\n  this.shouldWriteHeaders = headerMagic === HEADER_MAGIC;\n  if (!this.shouldWriteHeaders) {\n    return;\n  }\n\n  this.setFlags(readBuffer.readInt16BE(FLAGS_OFFSET));\n  this.setSeqId(readBuffer.readInt32BE(SEQID_OFFSET));\n  var headerSize = readBuffer.readInt16BE(HEADER_SIZE_OFFSET) * 4;\n  var endOfHeaders = HEADER_START_OFFSET + headerSize;\n  if (endOfHeaders > readBuffer.length) {\n    throw new THeaderTransportError('Header size is greater than frame size');\n  }\n\n  var headerBuffer = Buffer.alloc(headerSize);\n  readBuffer.copy(headerBuffer, 0, HEADER_START_OFFSET, endOfHeaders);\n\n  var varintHelper = new VarintHelper(headerBuffer);\n  this.setProtocolId(varintHelper.readVarint32());\n  var transformCount = varintHelper.readVarint32();\n  if (transformCount > 0) {\n    throw new THeaderTransportError('Transforms are not yet supported');\n  }\n\n  while (true) {\n    try {\n      var headerType = varintHelper.readVarint32();\n      if (headerType !== TINFO_HEADER_KEY_VALUE_TYPE) {\n        break;\n      }\n\n      var numberOfHeaders = varintHelper.readVarint32();\n      for (var i = 0; i < numberOfHeaders; i++) {\n        var key = varintHelper.readString();\n        var value = varintHelper.readString();\n        this.setReadHeader(key, value);\n      }\n    } catch (e) {\n      if (e instanceof InputBufferUnderrunError) {\n        break;\n      }\n      throw e;\n    }\n  }\n\n  // moves the read cursor past the headers\n  this.read(endOfHeaders);\n  return this.getReadHeaders();\n};\n\nTHeaderTransport.prototype.writeHeaders = function() {\n  // only write headers on the server if the client contained headers\n  if (!this.shouldWriteHeaders) {\n    return;\n  }\n  var headers = this.getWriteHeaders();\n\n  var varintWriter = new VarintHelper();\n  varintWriter.writeVarint32(this.protocolId);\n  varintWriter.writeVarint32(0); // transforms not supported\n\n  // writing info header key values\n  var headerKeys = Object.keys(headers);\n  if (headerKeys.length > 0) {\n    varintWriter.writeVarint32(TINFO_HEADER_KEY_VALUE_TYPE);\n    varintWriter.writeVarint32(headerKeys.length);\n    for (var i = 0; i < headerKeys.length; i++) {\n      var key = headerKeys[i];\n      var value = headers[key];\n\n      varintWriter.writeString(key);\n      varintWriter.writeString(value);\n    }\n  }\n var headerSizeWithoutPadding = varintWriter.getOutCount();\n  var paddingNeeded = (4 - (headerSizeWithoutPadding % 4)) % 4;\n\n  var headerSize = Buffer.alloc(2);\n  headerSize.writeInt16BE(Math.floor((headerSizeWithoutPadding + paddingNeeded) / 4));\n\n  var paddingBuffer = Buffer.alloc(paddingNeeded);\n  paddingBuffer.fill(0x00);\n  varintWriter.write(paddingBuffer);\n  var headerContentBuffer = varintWriter.toBuffer();\n  var frameSize = Buffer.alloc(4);\n  frameSize.writeInt32BE(10 + this.outCount + headerContentBuffer.length);\n  var headerMagic = Buffer.alloc(2);\n  headerMagic.writeInt16BE(HEADER_MAGIC);\n\n  // flags are not yet supported, so write a zero\n  var flags = Buffer.alloc(2);\n  flags.writeInt16BE(0);\n\n  var seqid = Buffer.alloc(4);\n  seqid.writeInt32BE(this.getSeqId());\n\n  var headerBuffer = Buffer.concat([\n    frameSize,\n    headerMagic,\n    flags,\n    seqid,\n    headerSize,\n    headerContentBuffer,\n  ]);\n\n  this.outBuffers.unshift(headerBuffer);\n  this.outCount += headerBuffer.length;\n};\n", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\n\nvar binary = require('./binary');\nvar InputBufferUnderrunError = require('./input_buffer_underrun_error');\nvar THeaderTransport = require('./header_transport');\n\nmodule.exports = TBufferedTransport;\n\nfunction TBufferedTransport(buffer, callback) {\n  this.defaultReadBufferSize = 1024;\n  this.writeBufferSize = 512; // Soft Limit\n  this.inBuf = new Buffer(this.defaultReadBufferSize);\n  this.readCursor = 0;\n  this.writeCursor = 0; // for input buffer\n  this.outBuffers = [];\n  this.outCount = 0;\n  this.onFlush = callback;\n};\n\nTBufferedTransport.prototype = new THeaderTransport();\n\nTBufferedTransport.prototype.reset = function() {\n  this.inBuf = new Buffer(this.defaultReadBufferSize);\n  this.readCursor = 0;\n  this.writeCursor = 0;\n  this.outBuffers = [];\n  this.outCount = 0;\n}\n\nTBufferedTransport.receiver = function(callback, seqid) {\n  var reader = new TBufferedTransport();\n\n  return function(data) {\n    if (reader.writeCursor + data.length > reader.inBuf.length) {\n      var buf = new Buffer(reader.writeCursor + data.length);\n      reader.inBuf.copy(buf, 0, 0, reader.writeCursor);\n      reader.inBuf = buf;\n    }\n    data.copy(reader.inBuf, reader.writeCursor, 0);\n    reader.writeCursor += data.length;\n\n    callback(reader, seqid);\n  };\n};\n\n\nTBufferedTransport.prototype.commitPosition = function(){\n  var unreadSize = this.writeCursor - this.readCursor;\n  var bufSize = (unreadSize * 2 > this.defaultReadBufferSize) ?\n    unreadSize * 2 : this.defaultReadBufferSize;\n  var buf = new Buffer(bufSize);\n  if (unreadSize > 0) {\n    this.inBuf.copy(buf, 0, this.readCursor, this.writeCursor);\n  }\n  this.readCursor = 0;\n  this.writeCursor = unreadSize;\n  this.inBuf = buf;\n};\n\nTBufferedTransport.prototype.rollbackPosition = function(){\n  this.readCursor = 0;\n}\n\n  // TODO: Implement open/close support\nTBufferedTransport.prototype.isOpen = function() {\n  return true;\n};\n\nTBufferedTransport.prototype.open = function() {\n};\n\nTBufferedTransport.prototype.close = function() {\n};\n\n  // Set the seqid of the message in the client\n  // So that callbacks can be found\nTBufferedTransport.prototype.setCurrSeqId = function(seqid) {\n  this._seqid = seqid;\n};\n\nTBufferedTransport.prototype.ensureAvailable = function(len) {\n  if (this.readCursor + len > this.writeCursor) {\n    throw new InputBufferUnderrunError();\n  }\n};\n\nTBufferedTransport.prototype.read = function(len) {\n  this.ensureAvailable(len);\n  var buf = new Buffer(len);\n  this.inBuf.copy(buf, 0, this.readCursor, this.readCursor + len);\n  this.readCursor += len;\n  return buf;\n};\n\nTBufferedTransport.prototype.readByte = function() {\n  this.ensureAvailable(1);\n  return binary.readByte(this.inBuf[this.readCursor++]);\n};\n\nTBufferedTransport.prototype.readI16 = function() {\n  this.ensureAvailable(2);\n  var i16 = binary.readI16(this.inBuf, this.readCursor);\n  this.readCursor += 2;\n  return i16;\n};\n\nTBufferedTransport.prototype.readI32 = function() {\n  this.ensureAvailable(4);\n  var i32 = binary.readI32(this.inBuf, this.readCursor);\n  this.readCursor += 4;\n  return i32;\n};\n\nTBufferedTransport.prototype.readDouble = function() {\n  this.ensureAvailable(8);\n  var d = binary.readDouble(this.inBuf, this.readCursor);\n  this.readCursor += 8;\n  return d;\n};\n\nTBufferedTransport.prototype.readString = function(len) {\n  this.ensureAvailable(len);\n  var str = this.inBuf.toString('utf8', this.readCursor, this.readCursor + len);\n  this.readCursor += len;\n  return str;\n};\n\nTBufferedTransport.prototype.borrow = function() {\n  var obj = {buf: this.inBuf, readIndex: this.readCursor, writeIndex: this.writeCursor};\n  return obj;\n};\n\nTBufferedTransport.prototype.consume = function(bytesConsumed) {\n  this.readCursor += bytesConsumed;\n};\n\nTBufferedTransport.prototype.write = function(buf) {\n  if (typeof(buf) === \"string\") {\n    buf = new Buffer(buf, 'utf8');\n  }\n  this.outBuffers.push(buf);\n  this.outCount += buf.length;\n};\n\nTBufferedTransport.prototype.flush = function() {\n  // If the seqid of the callback is available pass it to the onFlush\n  // Then remove the current seqid\n  var seqid = this._seqid;\n  this._seqid = null;\n\n  if (this.outCount < 1) {\n    return;\n  }\n\n  var msg = new Buffer(this.outCount),\n      pos = 0;\n  this.outBuffers.forEach(function(buf) {\n    buf.copy(msg, pos, 0);\n    pos += buf.length;\n  });\n\n  if (this.onFlush) {\n    // Passing seqid through this call to get it to the connection\n    this.onFlush(msg, seqid);\n  }\n\n  this.outBuffers = [];\n  this.outCount = 0;\n}\n", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\n\nvar Int64 = require('node-int64');\n\nvar Int64Util = module.exports = {};\n\nvar POW2_24 = Math.pow(2, 24);\nvar POW2_31 = Math.pow(2, 31);\nvar POW2_32 = Math.pow(2, 32);\nvar POW10_11 = Math.pow(10, 11);\n\nInt64Util.toDecimalString = function(i64) {\n  var b = i64.buffer;\n  var o = i64.offset;\n  if ((!b[o] && !(b[o + 1] & 0xe0)) ||\n      (!~b[o] && !~(b[o + 1] & 0xe0))) {\n    // The magnitude is small enough.\n    return i64.toString();\n  } else {\n    var negative = b[o] & 0x80;\n    if (negative) {\n      // 2's complement\n      var incremented = false;\n      var buffer = new Buffer(8);\n      for (var i = 7; i >= 0; --i) {\n        buffer[i] = (~b[o + i] + (incremented ? 0 : 1)) & 0xff;\n        incremented |= b[o + i];\n      }\n      b = buffer;\n    }\n    var high2 = b[o + 1] + (b[o] << 8);\n    // Lesser 11 digits with exceeding values but is under 53 bits capacity.\n    var low = b[o + 7] + (b[o + 6] << 8) + (b[o + 5] << 16)\n        + b[o + 4] * POW2_24  // Bit shift renders 32th bit as sign, so use multiplication\n        + (b[o + 3] + (b[o + 2] << 8)) * POW2_32 + high2 * 74976710656;  // The literal is 2^48 % 10^11\n    // 12th digit and greater.\n    var high = Math.floor(low / POW10_11) + high2 * 2814;  // The literal is 2^48 / 10^11\n    // Make it exactly 11 with leading zeros.\n    low = ('00000000000' + String(low % POW10_11)).slice(-11);\n    return (negative ? '-' : '') + String(high) + low;\n  }\n};\n\nInt64Util.fromDecimalString = function(text) {\n  var negative = text.charAt(0) === '-';\n  if (text.length < (negative ? 17 : 16)) {\n    // The magnitude is smaller than 2^53.\n    return new Int64(+text);\n  } else if (text.length > (negative ? 20 : 19)) {\n    throw new RangeError('Too many digits for Int64: ' + text);\n  } else {\n    // Most significant (up to 5) digits\n    var high5 = +text.slice(negative ? 1 : 0, -15);\n    var low = +text.slice(-15) + high5 * 2764472320;  // The literal is 10^15 % 2^32\n    var high = Math.floor(low / POW2_32) + high5 * 232830;  // The literal is 10^15 / 2^&32\n    low = low % POW2_32;\n    if (high >= POW2_31 &&\n        !(negative && high == POW2_31 && low == 0)  // Allow minimum Int64\n       ) {\n      throw new RangeError('The magnitude is too large for Int64.');\n    }\n    if (negative) {\n      // 2's complement\n      high = ~high;\n      if (low === 0) {\n        high = (high + 1) & 0xffffffff;\n      } else {\n        low = ~low + 1;\n      }\n      high = 0x80000000 | high;\n    }\n    return new Int64(high, low);\n  }\n};\n", "/*\n * Imported from Douglas Crockford's reference implementation with minimum modification\n * to handle Int64.\n *\n * https://github.com/douglascrockford/JSON-js/blob/c98948ae1944a28e2e8ebc3717894e580aeaaa05/json_parse.js\n *\n * Original license header:\n *\n * json_parse.js\n * 2015-05-02\n * Public Domain.\n * NO WARRANTY EXPRESSED OR IMPLIED. USE AT YOUR OWN RISK.\n */\n\n\n/*jslint for */\n\n/*property\n    at, b, call, charAt, f, fromCharCode, hasOwnProperty, message, n, name,\n    prototype, push, r, t, text\n*/\n\nvar Int64 = require('node-int64');\nvar Int64Util = require('./int64_util');\n\nvar json_parse = module.exports = (function () {\n    \"use strict\";\n\n// This is a function that can parse a JSON text, producing a JavaScript\n// data structure. It is a simple, recursive descent parser. It does not use\n// eval or regular expressions, so it can be used as a model for implementing\n// a JSON parser in other languages.\n\n// We are defining the function inside of another function to avoid creating\n// global variables.\n\n    var at,     // The index of the current character\n        ch,     // The current character\n        escapee = {\n            '\"': '\"',\n            '\\\\': '\\\\',\n            '/': '/',\n            b: '\\b',\n            f: '\\f',\n            n: '\\n',\n            r: '\\r',\n            t: '\\t'\n        },\n        text,\n\n        error = function (m) {\n\n// Call error when something is wrong.\n\n            throw new SyntaxError(m);\n        },\n\n        next = function (c) {\n\n// If a c parameter is provided, verify that it matches the current character.\n\n            if (c && c !== ch) {\n                error(\"Expected '\" + c + \"' instead of '\" + ch + \"'\");\n            }\n\n// Get the next character. When there are no more characters,\n// return the empty string.\n\n            ch = text.charAt(at);\n            at += 1;\n            return ch;\n        },\n\n        number = function () {\n\n// Parse a number value.\n\n            var number,\n                string = '';\n\n            if (ch === '-') {\n                string = '-';\n                next('-');\n            }\n            while (ch >= '0' && ch <= '9') {\n                string += ch;\n                next();\n            }\n            if (ch === '.') {\n                string += '.';\n                while (next() && ch >= '0' && ch <= '9') {\n                    string += ch;\n                }\n            }\n            if (ch === 'e' || ch === 'E') {\n                string += ch;\n                next();\n                if (ch === '-' || ch === '+') {\n                    string += ch;\n                    next();\n                }\n                while (ch >= '0' && ch <= '9') {\n                    string += ch;\n                    next();\n                }\n            }\n            number = +string;\n            if (!isFinite(number)) {\n                error(\"Bad number\");\n            } else if (number >= Int64.MAX_INT || number <= Int64.MIN_INT) {\n                // Return raw string for further process in TJSONProtocol\n                return string;\n            } else {\n                return number;\n            }\n        },\n\n        string = function () {\n\n// Parse a string value.\n\n            var hex,\n                i,\n                string = '',\n                uffff;\n\n// When parsing for string values, we must look for \" and \\ characters.\n\n            if (ch === '\"') {\n                while (next()) {\n                    if (ch === '\"') {\n                        next();\n                        return string;\n                    }\n                    if (ch === '\\\\') {\n                        next();\n                        if (ch === 'u') {\n                            uffff = 0;\n                            for (i = 0; i < 4; i += 1) {\n                                hex = parseInt(next(), 16);\n                                if (!isFinite(hex)) {\n                                    break;\n                                }\n                                uffff = uffff * 16 + hex;\n                            }\n                            string += String.fromCharCode(uffff);\n                        } else if (typeof escapee[ch] === 'string') {\n                            string += escapee[ch];\n                        } else {\n                            break;\n                        }\n                    } else {\n                        string += ch;\n                    }\n                }\n            }\n            error(\"Bad string\");\n        },\n\n        white = function () {\n\n// Skip whitespace.\n\n            while (ch && ch <= ' ') {\n                next();\n            }\n        },\n\n        word = function () {\n\n// true, false, or null.\n\n            switch (ch) {\n            case 't':\n                next('t');\n                next('r');\n                next('u');\n                next('e');\n                return true;\n            case 'f':\n                next('f');\n                next('a');\n                next('l');\n                next('s');\n                next('e');\n                return false;\n            case 'n':\n                next('n');\n                next('u');\n                next('l');\n                next('l');\n                return null;\n            }\n            error(\"Unexpected '\" + ch + \"'\");\n        },\n\n        value,  // Place holder for the value function.\n\n        array = function () {\n\n// Parse an array value.\n\n            var array = [];\n\n            if (ch === '[') {\n                next('[');\n                white();\n                if (ch === ']') {\n                    next(']');\n                    return array;   // empty array\n                }\n                while (ch) {\n                    array.push(value());\n                    white();\n                    if (ch === ']') {\n                        next(']');\n                        return array;\n                    }\n                    next(',');\n                    white();\n                }\n            }\n            error(\"Bad array\");\n        },\n\n        object = function () {\n\n// Parse an object value.\n\n            var key,\n                object = {};\n\n            if (ch === '{') {\n                next('{');\n                white();\n                if (ch === '}') {\n                    next('}');\n                    return object;   // empty object\n                }\n                while (ch) {\n                    key = string();\n                    white();\n                    next(':');\n                    if (Object.hasOwnProperty.call(object, key)) {\n                        error('Duplicate key \"' + key + '\"');\n                    }\n                    object[key] = value();\n                    white();\n                    if (ch === '}') {\n                        next('}');\n                        return object;\n                    }\n                    next(',');\n                    white();\n                }\n            }\n            error(\"Bad object\");\n        };\n\n    value = function () {\n\n// Parse a JSON value. It could be an object, an array, a string, a number,\n// or a word.\n\n        white();\n        switch (ch) {\n        case '{':\n            return object();\n        case '[':\n            return array();\n        case '\"':\n            return string();\n        case '-':\n            return number();\n        default:\n            return ch >= '0' && ch <= '9'\n                ? number()\n                : word();\n        }\n    };\n\n// Return the json_parse function. It will have access to all of the above\n// functions and variables.\n\n    return function (source) {\n        var result;\n\n        text = source;\n        at = 0;\n        ch = ' ';\n        result = value();\n        white();\n        if (ch) {\n            error(\"Syntax error\");\n        }\n\n        return result;\n    };\n}());\n", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\n\nvar Int64 = require('node-int64');\nvar Thrift = require('./thrift');\nvar Type = Thrift.Type;\nvar util = require(\"util\");\n\nvar Int64Util = require('./int64_util');\nvar json_parse = require('./json_parse');\n\nvar InputBufferUnderrunError = require('./input_buffer_underrun_error');\n\nmodule.exports = TJSONProtocol;\n\n/**\n * Initializes a Thrift JSON protocol instance.\n * @constructor\n * @param {Thrift.Transport} trans - The transport to serialize to/from.\n * @classdesc Apache Thrift Protocols perform serialization which enables cross\n * language RPC. The Protocol type is the JavaScript browser implementation\n * of the Apache Thrift TJSONProtocol.\n * @example\n *     var protocol  = new Thrift.Protocol(transport);\n */\nfunction TJSONProtocol(trans) {\n  this.tstack = [];\n  this.tpos = [];\n  this.trans = trans;\n};\n\n/**\n * Thrift IDL type Id to string mapping.\n * @readonly\n * @see {@link Thrift.Type}\n */\nTJSONProtocol.Type = {};\nTJSONProtocol.Type[Type.BOOL] = '\"tf\"';\nTJSONProtocol.Type[Type.BYTE] = '\"i8\"';\nTJSONProtocol.Type[Type.I16] = '\"i16\"';\nTJSONProtocol.Type[Type.I32] = '\"i32\"';\nTJSONProtocol.Type[Type.I64] = '\"i64\"';\nTJSONProtocol.Type[Type.DOUBLE] = '\"dbl\"';\nTJSONProtocol.Type[Type.STRUCT] = '\"rec\"';\nTJSONProtocol.Type[Type.STRING] = '\"str\"';\nTJSONProtocol.Type[Type.MAP] = '\"map\"';\nTJSONProtocol.Type[Type.LIST] = '\"lst\"';\nTJSONProtocol.Type[Type.SET] = '\"set\"';\n\n/**\n * Thrift IDL type string to Id mapping.\n * @readonly\n * @see {@link Thrift.Type}\n */\nTJSONProtocol.RType = {};\nTJSONProtocol.RType.tf = Type.BOOL;\nTJSONProtocol.RType.i8 = Type.BYTE;\nTJSONProtocol.RType.i16 = Type.I16;\nTJSONProtocol.RType.i32 = Type.I32;\nTJSONProtocol.RType.i64 = Type.I64;\nTJSONProtocol.RType.dbl = Type.DOUBLE;\nTJSONProtocol.RType.rec = Type.STRUCT;\nTJSONProtocol.RType.str = Type.STRING;\nTJSONProtocol.RType.map = Type.MAP;\nTJSONProtocol.RType.lst = Type.LIST;\nTJSONProtocol.RType.set = Type.SET;\n\n/**\n * The TJSONProtocol version number.\n * @readonly\n * @const {number} Version\n * @memberof Thrift.Protocol\n */\nTJSONProtocol.Version = 1;\n\nTJSONProtocol.prototype.flush = function() {\n  this.writeToTransportIfStackIsFlushable();\n  return this.trans.flush();\n};\n\nTJSONProtocol.prototype.writeToTransportIfStackIsFlushable = function() {\n  if (this.tstack.length === 1) {\n    this.trans.write(this.tstack.pop());\n  }\n};\n\n/**\n * Serializes the beginning of a Thrift RPC message.\n * @param {string} name - The service method to call.\n * @param {Thrift.MessageType} messageType - The type of method call.\n * @param {number} seqid - The sequence number of this call (always 0 in Apache Thrift).\n */\nTJSONProtocol.prototype.writeMessageBegin = function(name, messageType, seqid) {\n  this.tstack.push([TJSONProtocol.Version, '\"' + name + '\"', messageType, seqid]);\n};\n\n/**\n * Serializes the end of a Thrift RPC message.\n */\nTJSONProtocol.prototype.writeMessageEnd = function() {\n  var obj = this.tstack.pop();\n\n  this.wobj = this.tstack.pop();\n  this.wobj.push(obj);\n\n  this.wbuf = '[' + this.wobj.join(',') + ']';\n\n  // we assume there is nothing more to come so we write\n  this.trans.write(this.wbuf);\n};\n\n/**\n * Serializes the beginning of a struct.\n * @param {string} name - The name of the struct.\n */\nTJSONProtocol.prototype.writeStructBegin = function(name) {\n  this.tpos.push(this.tstack.length);\n  this.tstack.push({});\n};\n\n/**\n * Serializes the end of a struct.\n */\nTJSONProtocol.prototype.writeStructEnd = function() {\n  var p = this.tpos.pop();\n  var struct = this.tstack[p];\n  var str = '{';\n  var first = true;\n  for (var key in struct) {\n    if (first) {\n      first = false;\n    } else {\n      str += ',';\n    }\n\n    str += key + ':' + struct[key];\n  }\n\n  str += '}';\n  this.tstack[p] = str;\n\n  this.writeToTransportIfStackIsFlushable();\n};\n\n/**\n * Serializes the beginning of a struct field.\n * @param {string} name - The name of the field.\n * @param {Thrift.Protocol.Type} fieldType - The data type of the field.\n * @param {number} fieldId - The field's unique identifier.\n */\nTJSONProtocol.prototype.writeFieldBegin = function(name, fieldType, fieldId) {\n  this.tpos.push(this.tstack.length);\n  this.tstack.push({ 'fieldId': '\"' +\n    fieldId + '\"', 'fieldType': TJSONProtocol.Type[fieldType]\n  });\n};\n\n/**\n * Serializes the end of a field.\n */\nTJSONProtocol.prototype.writeFieldEnd = function() {\n  var value = this.tstack.pop();\n  var fieldInfo = this.tstack.pop();\n\n  if (':' + value === \":[object Object]\") {\n    this.tstack[this.tstack.length - 1][fieldInfo.fieldId] = '{' +\n      fieldInfo.fieldType + ':' + JSON.stringify(value) + '}';\n  } else {\n    this.tstack[this.tstack.length - 1][fieldInfo.fieldId] = '{' +\n      fieldInfo.fieldType + ':' + value + '}';\n  }\n  this.tpos.pop();\n\n  this.writeToTransportIfStackIsFlushable();\n};\n\n/**\n * Serializes the end of the set of fields for a struct.\n */\nTJSONProtocol.prototype.writeFieldStop = function() {\n};\n\n/**\n * Serializes the beginning of a map collection.\n * @param {Thrift.Type} keyType - The data type of the key.\n * @param {Thrift.Type} valType - The data type of the value.\n * @param {number} [size] - The number of elements in the map (ignored).\n */\nTJSONProtocol.prototype.writeMapBegin = function(keyType, valType, size) {\n  //size is invalid, we'll set it on end.\n  this.tpos.push(this.tstack.length);\n  this.tstack.push([TJSONProtocol.Type[keyType], TJSONProtocol.Type[valType], 0]);\n};\n\n/**\n * Serializes the end of a map.\n */\nTJSONProtocol.prototype.writeMapEnd = function() {\n  var p = this.tpos.pop();\n\n  if (p == this.tstack.length) {\n    return;\n  }\n\n  if ((this.tstack.length - p - 1) % 2 !== 0) {\n    this.tstack.push('');\n  }\n\n  var size = (this.tstack.length - p - 1) / 2;\n\n  this.tstack[p][this.tstack[p].length - 1] = size;\n\n  var map = '}';\n  var first = true;\n  while (this.tstack.length > p + 1) {\n    var v = this.tstack.pop();\n    var k = this.tstack.pop();\n    if (first) {\n      first = false;\n    } else {\n      map = ',' + map;\n    }\n\n    if (! isNaN(k)) { k = '\"' + k + '\"'; } //json \"keys\" need to be strings\n    map = k + ':' + v + map;\n  }\n  map = '{' + map;\n\n  this.tstack[p].push(map);\n  this.tstack[p] = '[' + this.tstack[p].join(',') + ']';\n\n  this.writeToTransportIfStackIsFlushable();\n};\n\n/**\n * Serializes the beginning of a list collection.\n * @param {Thrift.Type} elemType - The data type of the elements.\n * @param {number} size - The number of elements in the list.\n */\nTJSONProtocol.prototype.writeListBegin = function(elemType, size) {\n  this.tpos.push(this.tstack.length);\n  this.tstack.push([TJSONProtocol.Type[elemType], size]);\n};\n\n/**\n * Serializes the end of a list.\n */\nTJSONProtocol.prototype.writeListEnd = function() {\n  var p = this.tpos.pop();\n\n  while (this.tstack.length > p + 1) {\n    var tmpVal = this.tstack[p + 1];\n    this.tstack.splice(p + 1, 1);\n    this.tstack[p].push(tmpVal);\n  }\n\n  this.tstack[p] = '[' + this.tstack[p].join(',') + ']';\n\n  this.writeToTransportIfStackIsFlushable();\n};\n\n/**\n * Serializes the beginning of a set collection.\n * @param {Thrift.Type} elemType - The data type of the elements.\n * @param {number} size - The number of elements in the list.\n */\nTJSONProtocol.prototype.writeSetBegin = function(elemType, size) {\n    this.tpos.push(this.tstack.length);\n    this.tstack.push([TJSONProtocol.Type[elemType], size]);\n};\n\n/**\n * Serializes the end of a set.\n */\nTJSONProtocol.prototype.writeSetEnd = function() {\n  var p = this.tpos.pop();\n\n  while (this.tstack.length > p + 1) {\n    var tmpVal = this.tstack[p + 1];\n    this.tstack.splice(p + 1, 1);\n    this.tstack[p].push(tmpVal);\n  }\n\n  this.tstack[p] = '[' + this.tstack[p].join(',') + ']';\n\n  this.writeToTransportIfStackIsFlushable();\n};\n\n/** Serializes a boolean */\nTJSONProtocol.prototype.writeBool = function(bool) {\n  this.tstack.push(bool ? 1 : 0);\n};\n\n/** Serializes a number */\nTJSONProtocol.prototype.writeByte = function(byte) {\n  this.tstack.push(byte);\n};\n\n/** Serializes a number */\nTJSONProtocol.prototype.writeI16 = function(i16) {\n  this.tstack.push(i16);\n};\n\n/** Serializes a number */\nTJSONProtocol.prototype.writeI32 = function(i32) {\n  this.tstack.push(i32);\n};\n\n/** Serializes a number */\nTJSONProtocol.prototype.writeI64 = function(i64) {\n  if (i64 instanceof Int64) {\n    this.tstack.push(Int64Util.toDecimalString(i64));\n  } else {\n    this.tstack.push(i64);\n  }\n};\n\n/** Serializes a number */\nTJSONProtocol.prototype.writeDouble = function(dub) {\n  this.tstack.push(dub);\n};\n\n/** Serializes a string */\nTJSONProtocol.prototype.writeString = function(arg) {\n  // We do not encode uri components for wire transfer:\n  if (arg === null) {\n      this.tstack.push(null);\n  } else {\n      if (typeof arg === 'string') {\n        var str = arg;\n      } else if (arg instanceof Buffer) {\n        var str = arg.toString('utf8');\n      } else {\n        throw new Error('writeString called without a string/Buffer argument: ' + arg);\n      }\n\n      // concat may be slower than building a byte buffer\n      var escapedString = '';\n      for (var i = 0; i < str.length; i++) {\n          var ch = str.charAt(i);      // a single double quote: \"\n          if (ch === '\\\"') {\n              escapedString += '\\\\\\\"'; // write out as: \\\"\n          } else if (ch === '\\\\') {    // a single backslash: \\\n              escapedString += '\\\\\\\\'; // write out as: \\\\\n          /* Currently escaped forward slashes break TJSONProtocol.\n           * As it stands, we can simply pass forward slashes into\n           * our strings across the wire without being escaped.\n           * I think this is the protocol's bug, not thrift.js\n           * } else if(ch === '/') {   // a single forward slash: /\n           *  escapedString += '\\\\/';  // write out as \\/\n           * }\n           */\n          } else if (ch === '\\b') {    // a single backspace: invisible\n              escapedString += '\\\\b';  // write out as: \\b\"\n          } else if (ch === '\\f') {    // a single formfeed: invisible\n              escapedString += '\\\\f';  // write out as: \\f\"\n          } else if (ch === '\\n') {    // a single newline: invisible\n              escapedString += '\\\\n';  // write out as: \\n\"\n          } else if (ch === '\\r') {    // a single return: invisible\n              escapedString += '\\\\r';  // write out as: \\r\"\n          } else if (ch === '\\t') {    // a single tab: invisible\n              escapedString += '\\\\t';  // write out as: \\t\"\n          } else {\n              escapedString += ch;     // Else it need not be escaped\n          }\n      }\n      this.tstack.push('\"' + escapedString + '\"');\n  }\n};\n\n/** Serializes a string */\nTJSONProtocol.prototype.writeBinary = function(arg) {\n  if (typeof arg === 'string') {\n    var buf = new Buffer(arg, 'binary');\n  } else if (arg instanceof Buffer ||\n             Object.prototype.toString.call(arg) == '[object Uint8Array]')  {\n    var buf = arg;\n  } else {\n    throw new Error('writeBinary called without a string/Buffer argument: ' + arg);\n  }\n  this.tstack.push('\"' + buf.toString('base64') + '\"');\n};\n\n/**\n * @class\n * @name AnonReadMessageBeginReturn\n * @property {string} fname - The name of the service method.\n * @property {Thrift.MessageType} mtype - The type of message call.\n * @property {number} rseqid - The sequence number of the message (0 in Thrift RPC).\n */\n/**\n * Deserializes the beginning of a message.\n * @returns {AnonReadMessageBeginReturn}\n */\nTJSONProtocol.prototype.readMessageBegin = function() {\n  this.rstack = [];\n  this.rpos = [];\n\n  //Borrow the inbound transport buffer and ensure data is present/consistent\n  var transBuf = this.trans.borrow();\n  if (transBuf.readIndex >= transBuf.writeIndex) {\n    throw new InputBufferUnderrunError();\n  }\n  var cursor = transBuf.readIndex;\n\n  if (transBuf.buf[cursor] !== 0x5B) { //[\n    throw new Error(\"Malformed JSON input, no opening bracket\");\n  }\n\n  //Parse a single message (there may be several in the buffer)\n  //  TODO: Handle characters using multiple code units\n  cursor++;\n  var openBracketCount = 1;\n  var inString = false;\n  for (; cursor < transBuf.writeIndex; cursor++) {\n    var chr = transBuf.buf[cursor];\n    //we use hexa charcode here because data[i] returns an int and not a char\n    if (inString) {\n      if (chr === 0x22) { //\"\n        inString = false;\n      } else if (chr === 0x5C) { //\\\n        //escaped character, skip\n        cursor += 1;\n      }\n    } else {\n      if (chr === 0x5B) { //[\n        openBracketCount += 1;\n      } else if (chr === 0x5D) { //]\n        openBracketCount -= 1;\n        if (openBracketCount === 0) {\n          //end of json message detected\n          break;\n        }\n      } else if (chr === 0x22) { //\"\n        inString = true;\n      }\n    }\n  }\n\n  if (openBracketCount !== 0) {\n    // Missing closing bracket. Can be buffer underrun.\n    throw new InputBufferUnderrunError();\n  }\n\n  //Reconstitute the JSON object and conume the necessary bytes\n  this.robj = json_parse(transBuf.buf.slice(transBuf.readIndex, cursor+1).toString());\n  this.trans.consume(cursor + 1 - transBuf.readIndex);\n\n  //Verify the protocol version\n  var version = this.robj.shift();\n  if (version != TJSONProtocol.Version) {\n    throw new Error('Wrong thrift protocol version: ' + version);\n  }\n\n  //Objectify the thrift message {name/type/sequence-number} for return\n  // and then save the JSON object in rstack\n  var r = {};\n  r.fname = this.robj.shift();\n  r.mtype = this.robj.shift();\n  r.rseqid = this.robj.shift();\n  this.rstack.push(this.robj.shift());\n  return r;\n};\n\n/** Deserializes the end of a message. */\nTJSONProtocol.prototype.readMessageEnd = function() {\n};\n\n/**\n * Deserializes the beginning of a struct.\n * @param {string} [name] - The name of the struct (ignored)\n * @returns {object} - An object with an empty string fname property\n */\nTJSONProtocol.prototype.readStructBegin = function() {\n  var r = {};\n  r.fname = '';\n\n  //incase this is an array of structs\n  if (this.rstack[this.rstack.length - 1] instanceof Array) {\n    this.rstack.push(this.rstack[this.rstack.length - 1].shift());\n  }\n\n  return r;\n};\n\n/** Deserializes the end of a struct. */\nTJSONProtocol.prototype.readStructEnd = function() {\n  this.rstack.pop();\n};\n\n/**\n * @class\n * @name AnonReadFieldBeginReturn\n * @property {string} fname - The name of the field (always '').\n * @property {Thrift.Type} ftype - The data type of the field.\n * @property {number} fid - The unique identifier of the field.\n */\n/**\n * Deserializes the beginning of a field.\n * @returns {AnonReadFieldBeginReturn}\n */\nTJSONProtocol.prototype.readFieldBegin = function() {\n  var r = {};\n\n  var fid = -1;\n  var ftype = Type.STOP;\n\n  //get a fieldId\n  for (var f in (this.rstack[this.rstack.length - 1])) {\n    if (f === null) {\n      continue;\n    }\n\n    fid = parseInt(f, 10);\n    this.rpos.push(this.rstack.length);\n\n    var field = this.rstack[this.rstack.length - 1][fid];\n\n    //remove so we don't see it again\n    delete this.rstack[this.rstack.length - 1][fid];\n\n    this.rstack.push(field);\n\n    break;\n  }\n\n  if (fid != -1) {\n    //should only be 1 of these but this is the only\n    //way to match a key\n    for (var i in (this.rstack[this.rstack.length - 1])) {\n      if (TJSONProtocol.RType[i] === null) {\n        continue;\n      }\n\n      ftype = TJSONProtocol.RType[i];\n      this.rstack[this.rstack.length - 1] = this.rstack[this.rstack.length - 1][i];\n    }\n  }\n\n  r.fname = '';\n  r.ftype = ftype;\n  r.fid = fid;\n\n  return r;\n};\n\n/** Deserializes the end of a field. */\nTJSONProtocol.prototype.readFieldEnd = function() {\n  var pos = this.rpos.pop();\n\n  //get back to the right place in the stack\n  while (this.rstack.length > pos) {\n    this.rstack.pop();\n  }\n};\n\n/**\n * @class\n * @name AnonReadMapBeginReturn\n * @property {Thrift.Type} ktype - The data type of the key.\n * @property {Thrift.Type} vtype - The data type of the value.\n * @property {number} size - The number of elements in the map.\n */\n/**\n * Deserializes the beginning of a map.\n * @returns {AnonReadMapBeginReturn}\n */\nTJSONProtocol.prototype.readMapBegin = function() {\n  var map = this.rstack.pop();\n  var first = map.shift();\n  if (first instanceof Array) {\n    this.rstack.push(map);\n    map = first;\n    first = map.shift();\n  }\n\n  var r = {};\n  r.ktype = TJSONProtocol.RType[first];\n  r.vtype = TJSONProtocol.RType[map.shift()];\n  r.size = map.shift();\n\n\n  this.rpos.push(this.rstack.length);\n  this.rstack.push(map.shift());\n\n  return r;\n};\n\n/** Deserializes the end of a map. */\nTJSONProtocol.prototype.readMapEnd = function() {\n  this.readFieldEnd();\n};\n\n/**\n * @class\n * @name AnonReadColBeginReturn\n * @property {Thrift.Type} etype - The data type of the element.\n * @property {number} size - The number of elements in the collection.\n */\n/**\n * Deserializes the beginning of a list.\n * @returns {AnonReadColBeginReturn}\n */\nTJSONProtocol.prototype.readListBegin = function() {\n  var list = this.rstack[this.rstack.length - 1];\n\n  var r = {};\n  r.etype = TJSONProtocol.RType[list.shift()];\n  r.size = list.shift();\n\n  this.rpos.push(this.rstack.length);\n  this.rstack.push(list.shift());\n\n  return r;\n};\n\n/** Deserializes the end of a list. */\nTJSONProtocol.prototype.readListEnd = function() {\n  var pos = this.rpos.pop() - 2;\n  var st = this.rstack;\n  st.pop();\n  if (st instanceof Array && st.length > pos && st[pos].length > 0) {\n    st.push(st[pos].shift());\n  }\n};\n\n/**\n * Deserializes the beginning of a set.\n * @returns {AnonReadColBeginReturn}\n */\nTJSONProtocol.prototype.readSetBegin = function() {\n  return this.readListBegin();\n};\n\n/** Deserializes the end of a set. */\nTJSONProtocol.prototype.readSetEnd = function() {\n  return this.readListEnd();\n};\n\nTJSONProtocol.prototype.readBool = function() {\n  return this.readValue() == '1';\n};\n\nTJSONProtocol.prototype.readByte = function() {\n  return this.readI32();\n};\n\nTJSONProtocol.prototype.readI16 = function() {\n  return this.readI32();\n};\n\nTJSONProtocol.prototype.readI32 = function(f) {\n  return +this.readValue();\n}\n\n/** Returns the next value found in the protocol buffer */\nTJSONProtocol.prototype.readValue = function(f) {\n  if (f === undefined) {\n    f = this.rstack[this.rstack.length - 1];\n  }\n\n  var r = {};\n\n  if (f instanceof Array) {\n    if (f.length === 0) {\n      r.value = undefined;\n    } else {\n      r.value = f.shift();\n    }\n  } else if (!(f instanceof Int64) && f instanceof Object) {\n    for (var i in f) {\n      if (i === null) {\n        continue;\n      }\n      this.rstack.push(f[i]);\n      delete f[i];\n\n      r.value = i;\n      break;\n    }\n  } else {\n    r.value = f;\n    this.rstack.pop();\n  }\n\n  return r.value;\n};\n\nTJSONProtocol.prototype.readI64 = function() {\n  var n = this.readValue()\n  if (typeof n === 'string') {\n    // Assuming no one is sending in 1.11111e+33 format\n    return Int64Util.fromDecimalString(n);\n  } else {\n    return new Int64(n);\n  }\n};\n\nTJSONProtocol.prototype.readDouble = function() {\n  return this.readI32();\n};\n\nTJSONProtocol.prototype.readBinary = function() {\n  return new Buffer(this.readValue(), 'base64');\n};\n\nTJSONProtocol.prototype.readString = function() {\n  return this.readValue();\n};\n\n/**\n * Returns the underlying transport.\n * @readonly\n * @returns {Thrift.Transport} The underlying transport.\n */\nTJSONProtocol.prototype.getTransport = function() {\n  return this.trans;\n};\n\n/**\n * Method to arbitrarily skip over data\n */\nTJSONProtocol.prototype.skip = function(type) {\n    switch (type) {\n    case Type.BOOL:\n      this.readBool();\n      break;\n    case Type.BYTE:\n      this.readByte();\n      break;\n    case Type.I16:\n      this.readI16();\n      break;\n    case Type.I32:\n      this.readI32();\n      break;\n    case Type.I64:\n      this.readI64();\n      break;\n    case Type.DOUBLE:\n      this.readDouble();\n      break;\n    case Type.STRING:\n      this.readString();\n      break;\n    case Type.STRUCT:\n      this.readStructBegin();\n      while (true) {\n        var r = this.readFieldBegin();\n        if (r.ftype === Type.STOP) {\n          break;\n        }\n        this.skip(r.ftype);\n        this.readFieldEnd();\n      }\n      this.readStructEnd();\n      break;\n    case Type.MAP:\n      var mapBegin = this.readMapBegin();\n      for (var i = 0; i < mapBegin.size; ++i) {\n        this.skip(mapBegin.ktype);\n        this.skip(mapBegin.vtype);\n      }\n      this.readMapEnd();\n      break;\n    case Type.SET:\n      var setBegin = this.readSetBegin();\n      for (var i2 = 0; i2 < setBegin.size; ++i2) {\n        this.skip(setBegin.etype);\n      }\n      this.readSetEnd();\n      break;\n    case Type.LIST:\n      var listBegin = this.readListBegin();\n      for (var i3 = 0; i3 < listBegin.size; ++i3) {\n        this.skip(listBegin.etype);\n      }\n      this.readListEnd();\n      break;\n    default:\n      throw new  Error(\"Invalid type: \" + type);\n  }\n};\n", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\n\nmodule.exports = createClient;\n\n/**\n * Creates a new client object for the specified Thrift service.\n * @param {object} ServiceClient - The module containing the generated service client\n * @param {Connection} Connection - The connection to use.\n * @returns {object} The client object.\n */\nfunction createClient(ServiceClient, connection) {\n  // TODO validate required options and throw otherwise\n  if (ServiceClient.Client) {\n    ServiceClient = ServiceClient.Client;\n  }\n  // TODO detangle these initialization calls\n  // creating \"client\" requires\n  //   - new service client instance\n  //\n  // New service client instance requires\n  //   - new transport instance\n  //   - protocol class reference\n  //\n  // New transport instance requires\n  //   - Buffer to use (or none)\n  //   - Callback to call on flush\n\n  // Wrap the write method\n  var writeCb = function(buf, seqid) {\n    connection.write(buf, seqid);\n  };\n  var transport = new connection.transport(undefined, writeCb);\n  var client = new ServiceClient(transport, connection.protocol);\n  transport.client = client;\n  connection.client = client;\n  return client;\n};\n", "'use strict';\n\nObject.defineProperty(exports, \"__esModule\", {\n  value: true\n});\n\nvar _typeof = typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; };\n\n/* global window self */\n\nvar isBrowser = typeof window !== 'undefined' && typeof window.document !== 'undefined';\n\n/* eslint-disable no-restricted-globals */\nvar isWebWorker = (typeof self === 'undefined' ? 'undefined' : _typeof(self)) === 'object' && self.constructor && self.constructor.name === 'DedicatedWorkerGlobalScope';\n/* eslint-enable no-restricted-globals */\n\nvar isNode = typeof process !== 'undefined' && process.versions != null && process.versions.node != null;\n\n/**\n * @see https://github.com/jsdom/jsdom/releases/tag/12.0.0\n * @see https://github.com/jsdom/jsdom/issues/1537\n */\n/* eslint-disable no-undef */\nvar isJsDom = function isJsDom() {\n  return typeof window !== 'undefined' && window.name === 'nodejs' || navigator.userAgent.includes('Node.js') || navigator.userAgent.includes('jsdom');\n};\n\nexports.isBrowser = isBrowser;\nexports.isWebWorker = isWebWorker;\nexports.isNode = isNode;\nexports.isJsDom = isJsDom;", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\nvar util = require('util');\nvar WebSocket = require('isomorphic-ws');\nvar EventEmitter = require(\"events\").EventEmitter;\nvar thrift = require('./thrift');\n\nvar TBufferedTransport = require('./buffered_transport');\nvar TJSONProtocol = require('./json_protocol');\nvar InputBufferUnderrunError = require('./input_buffer_underrun_error');\n\nvar createClient = require('./create_client');\nvar jsEnv = require('browser-or-node');\nexports.WSConnection = WSConnection;\n\n/**\n * @class\n * @name WSConnectOptions\n * @property {string} transport - The Thrift layered transport to use (TBufferedTransport, etc).\n * @property {string} protocol - The Thrift serialization protocol to use (TJSONProtocol, etc.).\n * @property {string} path - The URL path to connect to (e.g. \"/\", \"/mySvc\", \"/thrift/quoteSvc\", etc.).\n * @property {object} headers - A standard Node.js header hash, an object hash containing key/value\n *        pairs where the key is the header name string and the value is the header value string.\n * @property {boolean} secure - True causes the connection to use wss, otherwise ws is used.\n * @property {object} wsOptions - Options passed on to WebSocket.\n * @example\n *     //Use a secured websocket connection\n *     //  uses the buffered transport layer, uses the JSON protocol and directs RPC traffic\n *     //  to wss://thrift.example.com:9090/hello\n *     var thrift = require('thrift');\n *     var options = {\n *        transport: thrift.TBufferedTransport,\n *        protocol: thrift.TJSONProtocol,\n *        path: \"/hello\",\n *        secure: true\n *     };\n *     var con = thrift.createWSConnection(\"thrift.example.com\", 9090, options);\n *     con.open()\n *     var client = thrift.createWSClient(myService, connection);\n *     client.myServiceFunction();\n *     con.close()\n */\n\n/**\n * Initializes a Thrift WSConnection instance (use createWSConnection() rather than\n *    instantiating directly).\n * @constructor\n * @param {string} host - The host name or IP to connect to.\n * @param {number} port - The TCP port to connect to.\n * @param {WSConnectOptions} options - The configuration options to use.\n * @throws {error} Exceptions other than ttransport.InputBufferUnderrunError are rethrown\n * @event {error} The \"error\" event is fired when a Node.js error event occurs during\n *     request or response processing, in which case the node error is passed on. An \"error\"\n *     event may also be fired when the connection can not map a response back to the\n *     appropriate client (an internal error), generating a TApplicationException.\n * @classdesc WSConnection objects provide Thrift end point transport\n *     semantics implemented using Websockets.\n * @see {@link createWSConnection}\n */\nfunction WSConnection(host, port, options) {\n  //Initialize the emitter base object\n  EventEmitter.call(this);\n\n  //Set configuration\n  this.options = options || {};\n  this.host = host;\n  this.port = port;\n  this.secure = this.options.secure || false;\n  this.transport = this.options.transport || TBufferedTransport;\n  this.protocol = this.options.protocol || TJSONProtocol;\n  this.path = this.options.path;\n  this.send_pending = [];\n\n  //The sequence map is used to map seqIDs back to the\n  //  calling client in multiplexed scenarios\n  this.seqId2Service = {};\n\n  //Prepare WebSocket options\n  this.wsOptions = {\n    host: this.host,\n    port: this.port || 80,\n    path: this.options.path || '/',\n    headers: this.options.headers || {}\n  };\n  for (var attrname in this.options.wsOptions) {\n    this.wsOptions[attrname] = this.options.wsOptions[attrname];\n  }\n};\nutil.inherits(WSConnection, EventEmitter);\n\nWSConnection.prototype.__reset = function() {\n  this.socket = null; //The web socket\n  this.send_pending = []; //Buffers/Callback pairs waiting to be sent\n};\n\nWSConnection.prototype.__onOpen = function() {\n  this.emit(\"open\");\n  if (this.send_pending.length > 0) {\n    //If the user made calls before the connection was fully\n    //open, send them now\n    this.send_pending.forEach(function(data) {\n      this.socket.send(data);\n    }, this);\n    this.send_pending = [];\n  }\n};\n\nWSConnection.prototype.__onClose = function(evt) {\n  this.emit(\"close\");\n  this.__reset();\n};\n\nWSConnection.prototype.__decodeCallback = function(transport_with_data) {\n  var proto = new this.protocol(transport_with_data);\n  try {\n    while (true) {\n      var header = proto.readMessageBegin();\n      var dummy_seqid = header.rseqid * -1;\n      var client = this.client;\n      //The Multiplexed Protocol stores a hash of seqid to service names\n      //  in seqId2Service. If the SeqId is found in the hash we need to\n      //  lookup the appropriate client for this call.\n      //  The client var is a single client object when not multiplexing,\n      //  when using multiplexing it is a service name keyed hash of client\n      //  objects.\n      //NOTE: The 2 way interdependencies between protocols, transports,\n      //  connections and clients in the Node.js implementation are irregular\n      //  and make the implementation difficult to extend and maintain. We\n      //  should bring this stuff inline with typical thrift I/O stack\n      //  operation soon.\n      //  --ra\n      var service_name = this.seqId2Service[header.rseqid];\n      if (service_name) {\n        client = this.client[service_name];\n        delete this.seqId2Service[header.rseqid];\n      }\n      /*jshint -W083 */\n      client._reqs[dummy_seqid] = function(err, success) {\n        transport_with_data.commitPosition();\n        var clientCallback = client._reqs[header.rseqid];\n        delete client._reqs[header.rseqid];\n        if (clientCallback) {\n          clientCallback(err, success);\n        }\n      };\n      /*jshint +W083 */\n      if (client['recv_' + header.fname]) {\n        client['recv_' + header.fname](proto, header.mtype, dummy_seqid);\n      } else {\n        delete client._reqs[dummy_seqid];\n        this.emit(\"error\",\n          new thrift.TApplicationException(\n            thrift.TApplicationExceptionType.WRONG_METHOD_NAME,\n            \"Received a response to an unknown RPC function\"));\n      }\n    }\n  } catch (e) {\n    if (e instanceof InputBufferUnderrunError) {\n      transport_with_data.rollbackPosition();\n    } else {\n      throw e;\n    }\n  }\n};\n\nWSConnection.prototype.__onData = function(data) {\n  if (Object.prototype.toString.call(data) === \"[object ArrayBuffer]\") {\n    data = new Uint8Array(data);\n  }\n  var buf = new Buffer(data);\n  this.transport.receiver(this.__decodeCallback.bind(this))(buf);\n\n};\n\nWSConnection.prototype.__onMessage = function(evt) {\n  this.__onData(evt.data);\n};\n\nWSConnection.prototype.__onError = function(evt) {\n  this.emit(\"error\", evt);\n  this.socket.close();\n};\n\n/**\n * Returns true if the transport is open\n * @readonly\n * @returns {boolean}\n */\nWSConnection.prototype.isOpen = function() {\n  return this.socket && this.socket.readyState === this.socket.OPEN;\n};\n\n/**\n * Opens the transport connection\n */\nWSConnection.prototype.open = function() {\n  //If OPEN/CONNECTING/CLOSING ignore additional opens\n  if (this.socket && this.socket.readyState !== this.socket.CLOSED) {\n    return;\n  }\n  //If there is no socket or the socket is closed:\n  if (jsEnv.isBrowser) {\n    this.socket = new WebSocket(this.uri());\n  } else {\n    this.socket = new WebSocket(this.uri(), \"\", this.wsOptions);\n  }\n  this.socket.binaryType = 'arraybuffer';\n  this.socket.onopen = this.__onOpen.bind(this);\n  this.socket.onmessage = this.__onMessage.bind(this);\n  this.socket.onerror = this.__onError.bind(this);\n  this.socket.onclose = this.__onClose.bind(this);\n};\n\n/**\n * Closes the transport connection\n */\nWSConnection.prototype.close = function() {\n  this.socket.close();\n};\n\n/**\n * Return URI for the connection\n * @returns {string} URI\n */\nWSConnection.prototype.uri = function() {\n  var schema = this.secure ? 'wss' : 'ws';\n  var port = '';\n  var path = this.path || '/';\n  var host = this.host;\n\n  // avoid port if default for schema\n  if (this.port && (('wss' === schema && this.port !== 443) ||\n    ('ws' === schema && this.port !== 80))) {\n    port = ':' + this.port;\n  }\n\n  return schema + '://' + host + port + path;\n};\n\n/**\n * Writes Thrift message data to the connection\n * @param {Buffer} data - A Node.js Buffer containing the data to write\n * @returns {void} No return value.\n * @event {error} the \"error\" event is raised upon request failure passing the\n *     Node.js error object to the listener.\n */\nWSConnection.prototype.write = function(data) {\n  if (this.isOpen()) {\n    //Send data and register a callback to invoke the client callback\n    this.socket.send(data);\n  } else {\n    //Queue the send to go out __onOpen\n    this.send_pending.push(data);\n  }\n};\n\n/**\n * Creates a new WSConnection object, used by Thrift clients to connect\n *    to Thrift HTTP based servers.\n * @param {string} host - The host name or IP to connect to.\n * @param {number} port - The TCP port to connect to.\n * @param {WSConnectOptions} options - The configuration options to use.\n * @returns {WSConnection} The connection object.\n * @see {@link WSConnectOptions}\n */\nexports.createWSConnection = function(host, port, options) {\n  return new WSConnection(host, port, options);\n};\n\nexports.createWSClient = createClient;\n", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\nvar util = require('util');\nvar EventEmitter = require(\"events\").EventEmitter;\nvar thrift = require('./thrift');\n\nvar TBufferedTransport = require('./buffered_transport');\nvar TJSONProtocol = require('./json_protocol');\nvar InputBufferUnderrunError = require('./input_buffer_underrun_error');\n\nvar createClient = require('./create_client');\n\nexports.XHRConnection = XHRConnection;\n\n/**\n * Constructor Function for the XHR Connection.\n * If you do not specify a host and port then XHRConnection will default to the\n * host and port of the page from which this javascript is served.\n * @constructor\n * @param {string} [url] - The URL to connect to.\n * @classdesc TXHRConnection objects provide Thrift end point transport\n *     semantics implemented using XHR.\n * @example\n *     var transport = new Thrift.TXHRConnection('localhost', 9099, {});\n */\nfunction XHRConnection(host, port, options) {\n  this.options = options || {};\n  this.wpos = 0;\n  this.rpos = 0;\n  this.useCORS = (options && options.useCORS);\n  this.send_buf = '';\n  this.recv_buf = '';\n  this.transport = options.transport || TBufferedTransport;\n  this.protocol = options.protocol || TJSONProtocol;\n  this.headers = options.headers || {};\n\n  host = host || window.location.host;\n  port = port || window.location.port;\n  var prefix = options.https ? 'https://' : 'http://';\n  var path = options.path || '/';\n\n  if (port === '') {\n    port = undefined;\n  }\n\n  if (!port || port === 80 || port === '80') {\n    this.url = prefix + host + path;\n  } else {\n    this.url = prefix + host + ':' + port + path;\n  }\n\n  //The sequence map is used to map seqIDs back to the\n  //  calling client in multiplexed scenarios\n  this.seqId2Service = {};\n};\n\nutil.inherits(XHRConnection, EventEmitter);\n\n/**\n* Gets the browser specific XmlHttpRequest Object.\n* @returns {object} the browser XHR interface object\n*/\nXHRConnection.prototype.getXmlHttpRequestObject = function() {\n  try { return new XMLHttpRequest(); } catch (e1) { }\n  try { return new ActiveXObject('Msxml2.XMLHTTP'); } catch (e2) { }\n  try { return new ActiveXObject('Microsoft.XMLHTTP'); } catch (e3) { }\n\n  throw \"Your browser doesn't support XHR.\";\n};\n\n/**\n * Sends the current XRH request if the transport was created with a URL\n * and the async parameter is false. If the transport was not created with\n * a URL, or the async parameter is True and no callback is provided, or\n * the URL is an empty string, the current send buffer is returned.\n * @param {object} async - If true the current send buffer is returned.\n * @param {object} callback - Optional async completion callback\n * @returns {undefined|string} Nothing or the current send buffer.\n * @throws {string} If XHR fails.\n */\nXHRConnection.prototype.flush = function() {\n  var self = this;\n  if (this.url === undefined || this.url === '') {\n    return this.send_buf;\n  }\n\n  var xreq = this.getXmlHttpRequestObject();\n\n  if (xreq.overrideMimeType) {\n    xreq.overrideMimeType('application/json');\n  }\n\n  xreq.onreadystatechange = function() {\n    if (this.readyState == 4 && this.status == 200) {\n      self.setRecvBuffer(this.responseText);\n    }\n  };\n\n  xreq.open('POST', this.url, true);\n\n  Object.keys(this.headers).forEach(function(headerKey) {\n    xreq.setRequestHeader(headerKey, self.headers[headerKey]);\n  });\n\n  xreq.send(this.send_buf);\n};\n\n/**\n * Sets the buffer to provide the protocol when deserializing.\n * @param {string} buf - The buffer to supply the protocol.\n */\nXHRConnection.prototype.setRecvBuffer = function(buf) {\n  this.recv_buf = buf;\n  this.recv_buf_sz = this.recv_buf.length;\n  this.wpos = this.recv_buf.length;\n  this.rpos = 0;\n\n  if (Object.prototype.toString.call(buf) == \"[object ArrayBuffer]\") {\n    var data = new Uint8Array(buf);\n  }\n  var thing = new Buffer(data || buf);\n\n  this.transport.receiver(this.__decodeCallback.bind(this))(thing);\n\n};\n\nXHRConnection.prototype.__decodeCallback = function(transport_with_data) {\n  var proto = new this.protocol(transport_with_data);\n  try {\n    while (true) {\n      var header = proto.readMessageBegin();\n      var dummy_seqid = header.rseqid * -1;\n      var client = this.client;\n      //The Multiplexed Protocol stores a hash of seqid to service names\n      //  in seqId2Service. If the SeqId is found in the hash we need to\n      //  lookup the appropriate client for this call.\n      //  The client var is a single client object when not multiplexing,\n      //  when using multiplexing it is a service name keyed hash of client\n      //  objects.\n      //NOTE: The 2 way interdependencies between protocols, transports,\n      //  connections and clients in the Node.js implementation are irregular\n      //  and make the implementation difficult to extend and maintain. We\n      //  should bring this stuff inline with typical thrift I/O stack\n      //  operation soon.\n      //  --ra\n      var service_name = this.seqId2Service[header.rseqid];\n      if (service_name) {\n        client = this.client[service_name];\n        delete this.seqId2Service[header.rseqid];\n      }\n      /*jshint -W083 */\n      client._reqs[dummy_seqid] = function(err, success) {\n        transport_with_data.commitPosition();\n        var clientCallback = client._reqs[header.rseqid];\n        delete client._reqs[header.rseqid];\n        if (clientCallback) {\n          clientCallback(err, success);\n        }\n      };\n      /*jshint +W083 */\n      if (client['recv_' + header.fname]) {\n        client['recv_' + header.fname](proto, header.mtype, dummy_seqid);\n      } else {\n        delete client._reqs[dummy_seqid];\n        this.emit(\"error\",\n          new thrift.TApplicationException(\n            thrift.TApplicationExceptionType.WRONG_METHOD_NAME,\n            \"Received a response to an unknown RPC function\"));\n      }\n    }\n  } catch (e) {\n    if (e instanceof InputBufferUnderrunError) {\n      transport_with_data.rollbackPosition();\n    } else {\n      throw e;\n    }\n  }\n};\n\n/**\n * Returns true if the transport is open, XHR always returns true.\n * @readonly\n * @returns {boolean} Always True.\n */\nXHRConnection.prototype.isOpen = function() {\n  return true;\n};\n\n/**\n * Opens the transport connection, with XHR this is a nop.\n */\nXHRConnection.prototype.open = function() {};\n\n/**\n * Closes the transport connection, with XHR this is a nop.\n */\nXHRConnection.prototype.close = function() {};\n\n/**\n * Returns the specified number of characters from the response\n * buffer.\n * @param {number} len - The number of characters to return.\n * @returns {string} Characters sent by the server.\n */\nXHRConnection.prototype.read = function(len) {\n  var avail = this.wpos - this.rpos;\n\n  if (avail === 0) {\n    return '';\n  }\n\n  var give = len;\n\n  if (avail < len) {\n    give = avail;\n  }\n\n  var ret = this.read_buf.substr(this.rpos, give);\n  this.rpos += give;\n\n  //clear buf when complete?\n  return ret;\n};\n\n/**\n * Returns the entire response buffer.\n * @returns {string} Characters sent by the server.\n */\nXHRConnection.prototype.readAll = function() {\n  return this.recv_buf;\n};\n\n/**\n * Sets the send buffer to buf.\n * @param {string} buf - The buffer to send.\n */\nXHRConnection.prototype.write = function(buf) {\n  this.send_buf = buf;\n  this.flush();\n};\n\n/**\n * Returns the send buffer.\n * @readonly\n * @returns {string} The send buffer.\n */\nXHRConnection.prototype.getSendBuffer = function() {\n  return this.send_buf;\n};\n\n/**\n * Creates a new TXHRTransport object, used by Thrift clients to connect\n *    to Thrift HTTP based servers.\n * @param {string} host - The host name or IP to connect to.\n * @param {number} port - The TCP port to connect to.\n * @param {XHRConnectOptions} options - The configuration options to use.\n * @returns {XHRConnection} The connection object.\n * @see {@link XHRConnectOptions}\n */\nexports.createXHRConnection = function(host, port, options) {\n  return new XHRConnection(host, port, options);\n};\n\nexports.createXHRClient = createClient;\n", "// vim:ts=4:sts=4:sw=4:\n/*!\n *\n * Copyright 2009-2017 Kris Kowal under the terms of the MIT\n * license found at https://github.com/kriskowal/q/blob/v1/LICENSE\n *\n * With parts by Tyler Close\n * Copyright 2007-2009 Tyler Close under the terms of the MIT X license found\n * at http://www.opensource.org/licenses/mit-license.html\n * Forked at ref_send.js version: 2009-05-11\n *\n * With parts by Mark Miller\n * Copyright (C) 2011 Google Inc.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n * http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n *\n */\n\n(function (definition) {\n    \"use strict\";\n\n    // This file will function properly as a <script> tag, or a module\n    // using CommonJS and NodeJS or RequireJS module formats.  In\n    // Common/Node/RequireJS, the module exports the Q API and when\n    // executed as a simple <script>, it creates a Q global instead.\n\n    // Montage Require\n    if (typeof bootstrap === \"function\") {\n        bootstrap(\"promise\", definition);\n\n    // CommonJS\n    } else if (typeof exports === \"object\" && typeof module === \"object\") {\n        module.exports = definition();\n\n    // RequireJS\n    } else if (typeof define === \"function\" && define.amd) {\n        define(definition);\n\n    // SES (Secure EcmaScript)\n    } else if (typeof ses !== \"undefined\") {\n        if (!ses.ok()) {\n            return;\n        } else {\n            ses.makeQ = definition;\n        }\n\n    // <script>\n    } else if (typeof window !== \"undefined\" || typeof self !== \"undefined\") {\n        // Prefer window over self for add-on scripts. Use self for\n        // non-windowed contexts.\n        var global = typeof window !== \"undefined\" ? window : self;\n\n        // Get the `window` object, save the previous Q global\n        // and initialize Q as a global.\n        var previousQ = global.Q;\n        global.Q = definition();\n\n        // Add a noConflict function so Q can be removed from the\n        // global namespace.\n        global.Q.noConflict = function () {\n            global.Q = previousQ;\n            return this;\n        };\n\n    } else {\n        throw new Error(\"This environment was not anticipated by Q. Please file a bug.\");\n    }\n\n})(function () {\n\"use strict\";\n\nvar hasStacks = false;\ntry {\n    throw new Error();\n} catch (e) {\n    hasStacks = !!e.stack;\n}\n\n// All code after this point will be filtered from stack traces reported\n// by Q.\nvar qStartingLine = captureLine();\nvar qFileName;\n\n// shims\n\n// used for fallback in \"allResolved\"\nvar noop = function () {};\n\n// Use the fastest possible means to execute a task in a future turn\n// of the event loop.\nvar nextTick =(function () {\n    // linked list of tasks (single, with head node)\n    var head = {task: void 0, next: null};\n    var tail = head;\n    var flushing = false;\n    var requestTick = void 0;\n    var isNodeJS = false;\n    // queue for late tasks, used by unhandled rejection tracking\n    var laterQueue = [];\n\n    function flush() {\n        /* jshint loopfunc: true */\n        var task, domain;\n\n        while (head.next) {\n            head = head.next;\n            task = head.task;\n            head.task = void 0;\n            domain = head.domain;\n\n            if (domain) {\n                head.domain = void 0;\n                domain.enter();\n            }\n            runSingle(task, domain);\n\n        }\n        while (laterQueue.length) {\n            task = laterQueue.pop();\n            runSingle(task);\n        }\n        flushing = false;\n    }\n    // runs a single function in the async queue\n    function runSingle(task, domain) {\n        try {\n            task();\n\n        } catch (e) {\n            if (isNodeJS) {\n                // In node, uncaught exceptions are considered fatal errors.\n                // Re-throw them synchronously to interrupt flushing!\n\n                // Ensure continuation if the uncaught exception is suppressed\n                // listening \"uncaughtException\" events (as domains does).\n                // Continue in next event to avoid tick recursion.\n                if (domain) {\n                    domain.exit();\n                }\n                setTimeout(flush, 0);\n                if (domain) {\n                    domain.enter();\n                }\n\n                throw e;\n\n            } else {\n                // In browsers, uncaught exceptions are not fatal.\n                // Re-throw them asynchronously to avoid slow-downs.\n                setTimeout(function () {\n                    throw e;\n                }, 0);\n            }\n        }\n\n        if (domain) {\n            domain.exit();\n        }\n    }\n\n    nextTick = function (task) {\n        tail = tail.next = {\n            task: task,\n            domain: isNodeJS && process.domain,\n            next: null\n        };\n\n        if (!flushing) {\n            flushing = true;\n            requestTick();\n        }\n    };\n\n    if (typeof process === \"object\" &&\n        process.toString() === \"[object process]\" && process.nextTick) {\n        // Ensure Q is in a real Node environment, with a `process.nextTick`.\n        // To see through fake Node environments:\n        // * Mocha test runner - exposes a `process` global without a `nextTick`\n        // * Browserify - exposes a `process.nexTick` function that uses\n        //   `setTimeout`. In this case `setImmediate` is preferred because\n        //    it is faster. Browserify's `process.toString()` yields\n        //   \"[object Object]\", while in a real Node environment\n        //   `process.toString()` yields \"[object process]\".\n        isNodeJS = true;\n\n        requestTick = function () {\n            process.nextTick(flush);\n        };\n\n    } else if (typeof setImmediate === \"function\") {\n        // In IE10, Node.js 0.9+, or https://github.com/NobleJS/setImmediate\n        if (typeof window !== \"undefined\") {\n            requestTick = setImmediate.bind(window, flush);\n        } else {\n            requestTick = function () {\n                setImmediate(flush);\n            };\n        }\n\n    } else if (typeof MessageChannel !== \"undefined\") {\n        // modern browsers\n        // http://www.nonblocking.io/2011/06/windownexttick.html\n        var channel = new MessageChannel();\n        // At least Safari Version 6.0.5 (8536.30.1) intermittently cannot create\n        // working message ports the first time a page loads.\n        channel.port1.onmessage = function () {\n            requestTick = requestPortTick;\n            channel.port1.onmessage = flush;\n            flush();\n        };\n        var requestPortTick = function () {\n            // Opera requires us to provide a message payload, regardless of\n            // whether we use it.\n            channel.port2.postMessage(0);\n        };\n        requestTick = function () {\n            setTimeout(flush, 0);\n            requestPortTick();\n        };\n\n    } else {\n        // old browsers\n        requestTick = function () {\n            setTimeout(flush, 0);\n        };\n    }\n    // runs a task after all other tasks have been run\n    // this is useful for unhandled rejection tracking that needs to happen\n    // after all `then`d tasks have been run.\n    nextTick.runAfter = function (task) {\n        laterQueue.push(task);\n        if (!flushing) {\n            flushing = true;\n            requestTick();\n        }\n    };\n    return nextTick;\n})();\n\n// Attempt to make generics safe in the face of downstream\n// modifications.\n// There is no situation where this is necessary.\n// If you need a security guarantee, these primordials need to be\n// deeply frozen anyway, and if you don\u2019t need a security guarantee,\n// this is just plain paranoid.\n// However, this **might** have the nice side-effect of reducing the size of\n// the minified code by reducing x.call() to merely x()\n// See Mark Miller\u2019s explanation of what this does.\n// http://wiki.ecmascript.org/doku.php?id=conventions:safe_meta_programming\nvar call = Function.call;\nfunction uncurryThis(f) {\n    return function () {\n        return call.apply(f, arguments);\n    };\n}\n// This is equivalent, but slower:\n// uncurryThis = Function_bind.bind(Function_bind.call);\n// http://jsperf.com/uncurrythis\n\nvar array_slice = uncurryThis(Array.prototype.slice);\n\nvar array_reduce = uncurryThis(\n    Array.prototype.reduce || function (callback, basis) {\n        var index = 0,\n            length = this.length;\n        // concerning the initial value, if one is not provided\n        if (arguments.length === 1) {\n            // seek to the first value in the array, accounting\n            // for the possibility that is is a sparse array\n            do {\n                if (index in this) {\n                    basis = this[index++];\n                    break;\n                }\n                if (++index >= length) {\n                    throw new TypeError();\n                }\n            } while (1);\n        }\n        // reduce\n        for (; index < length; index++) {\n            // account for the possibility that the array is sparse\n            if (index in this) {\n                basis = callback(basis, this[index], index);\n            }\n        }\n        return basis;\n    }\n);\n\nvar array_indexOf = uncurryThis(\n    Array.prototype.indexOf || function (value) {\n        // not a very good shim, but good enough for our one use of it\n        for (var i = 0; i < this.length; i++) {\n            if (this[i] === value) {\n                return i;\n            }\n        }\n        return -1;\n    }\n);\n\nvar array_map = uncurryThis(\n    Array.prototype.map || function (callback, thisp) {\n        var self = this;\n        var collect = [];\n        array_reduce(self, function (undefined, value, index) {\n            collect.push(callback.call(thisp, value, index, self));\n        }, void 0);\n        return collect;\n    }\n);\n\nvar object_create = Object.create || function (prototype) {\n    function Type() { }\n    Type.prototype = prototype;\n    return new Type();\n};\n\nvar object_defineProperty = Object.defineProperty || function (obj, prop, descriptor) {\n    obj[prop] = descriptor.value;\n    return obj;\n};\n\nvar object_hasOwnProperty = uncurryThis(Object.prototype.hasOwnProperty);\n\nvar object_keys = Object.keys || function (object) {\n    var keys = [];\n    for (var key in object) {\n        if (object_hasOwnProperty(object, key)) {\n            keys.push(key);\n        }\n    }\n    return keys;\n};\n\nvar object_toString = uncurryThis(Object.prototype.toString);\n\nfunction isObject(value) {\n    return value === Object(value);\n}\n\n// generator related shims\n\n// FIXME: Remove this function once ES6 generators are in SpiderMonkey.\nfunction isStopIteration(exception) {\n    return (\n        object_toString(exception) === \"[object StopIteration]\" ||\n        exception instanceof QReturnValue\n    );\n}\n\n// FIXME: Remove this helper and Q.return once ES6 generators are in\n// SpiderMonkey.\nvar QReturnValue;\nif (typeof ReturnValue !== \"undefined\") {\n    QReturnValue = ReturnValue;\n} else {\n    QReturnValue = function (value) {\n        this.value = value;\n    };\n}\n\n// long stack traces\n\nvar STACK_JUMP_SEPARATOR = \"From previous event:\";\n\nfunction makeStackTraceLong(error, promise) {\n    // If possible, transform the error stack trace by removing Node and Q\n    // cruft, then concatenating with the stack trace of `promise`. See #57.\n    if (hasStacks &&\n        promise.stack &&\n        typeof error === \"object\" &&\n        error !== null &&\n        error.stack\n    ) {\n        var stacks = [];\n        for (var p = promise; !!p; p = p.source) {\n            if (p.stack && (!error.__minimumStackCounter__ || error.__minimumStackCounter__ > p.stackCounter)) {\n                object_defineProperty(error, \"__minimumStackCounter__\", {value: p.stackCounter, configurable: true});\n                stacks.unshift(p.stack);\n            }\n        }\n        stacks.unshift(error.stack);\n\n        var concatedStacks = stacks.join(\"\\n\" + STACK_JUMP_SEPARATOR + \"\\n\");\n        var stack = filterStackString(concatedStacks);\n        object_defineProperty(error, \"stack\", {value: stack, configurable: true});\n    }\n}\n\nfunction filterStackString(stackString) {\n    var lines = stackString.split(\"\\n\");\n    var desiredLines = [];\n    for (var i = 0; i < lines.length; ++i) {\n        var line = lines[i];\n\n        if (!isInternalFrame(line) && !isNodeFrame(line) && line) {\n            desiredLines.push(line);\n        }\n    }\n    return desiredLines.join(\"\\n\");\n}\n\nfunction isNodeFrame(stackLine) {\n    return stackLine.indexOf(\"(module.js:\") !== -1 ||\n           stackLine.indexOf(\"(node.js:\") !== -1;\n}\n\nfunction getFileNameAndLineNumber(stackLine) {\n    // Named functions: \"at functionName (filename:lineNumber:columnNumber)\"\n    // In IE10 function name can have spaces (\"Anonymous function\") O_o\n    var attempt1 = /at .+ \\((.+):(\\d+):(?:\\d+)\\)$/.exec(stackLine);\n    if (attempt1) {\n        return [attempt1[1], Number(attempt1[2])];\n    }\n\n    // Anonymous functions: \"at filename:lineNumber:columnNumber\"\n    var attempt2 = /at ([^ ]+):(\\d+):(?:\\d+)$/.exec(stackLine);\n    if (attempt2) {\n        return [attempt2[1], Number(attempt2[2])];\n    }\n\n    // Firefox style: \"function@filename:lineNumber or @filename:lineNumber\"\n    var attempt3 = /.*@(.+):(\\d+)$/.exec(stackLine);\n    if (attempt3) {\n        return [attempt3[1], Number(attempt3[2])];\n    }\n}\n\nfunction isInternalFrame(stackLine) {\n    var fileNameAndLineNumber = getFileNameAndLineNumber(stackLine);\n\n    if (!fileNameAndLineNumber) {\n        return false;\n    }\n\n    var fileName = fileNameAndLineNumber[0];\n    var lineNumber = fileNameAndLineNumber[1];\n\n    return fileName === qFileName &&\n        lineNumber >= qStartingLine &&\n        lineNumber <= qEndingLine;\n}\n\n// discover own file name and line number range for filtering stack\n// traces\nfunction captureLine() {\n    if (!hasStacks) {\n        return;\n    }\n\n    try {\n        throw new Error();\n    } catch (e) {\n        var lines = e.stack.split(\"\\n\");\n        var firstLine = lines[0].indexOf(\"@\") > 0 ? lines[1] : lines[2];\n        var fileNameAndLineNumber = getFileNameAndLineNumber(firstLine);\n        if (!fileNameAndLineNumber) {\n            return;\n        }\n\n        qFileName = fileNameAndLineNumber[0];\n        return fileNameAndLineNumber[1];\n    }\n}\n\nfunction deprecate(callback, name, alternative) {\n    return function () {\n        if (typeof console !== \"undefined\" &&\n            typeof console.warn === \"function\") {\n            console.warn(name + \" is deprecated, use \" + alternative +\n                         \" instead.\", new Error(\"\").stack);\n        }\n        return callback.apply(callback, arguments);\n    };\n}\n\n// end of shims\n// beginning of real work\n\n/**\n * Constructs a promise for an immediate reference, passes promises through, or\n * coerces promises from different systems.\n * @param value immediate reference or promise\n */\nfunction Q(value) {\n    // If the object is already a Promise, return it directly.  This enables\n    // the resolve function to both be used to created references from objects,\n    // but to tolerably coerce non-promises to promises.\n    if (value instanceof Promise) {\n        return value;\n    }\n\n    // assimilate thenables\n    if (isPromiseAlike(value)) {\n        return coerce(value);\n    } else {\n        return fulfill(value);\n    }\n}\nQ.resolve = Q;\n\n/**\n * Performs a task in a future turn of the event loop.\n * @param {Function} task\n */\nQ.nextTick = nextTick;\n\n/**\n * Controls whether or not long stack traces will be on\n */\nQ.longStackSupport = false;\n\n/**\n * The counter is used to determine the stopping point for building\n * long stack traces. In makeStackTraceLong we walk backwards through\n * the linked list of promises, only stacks which were created before\n * the rejection are concatenated.\n */\nvar longStackCounter = 1;\n\n// enable long stacks if Q_DEBUG is set\nif (typeof process === \"object\" && process && process.env && process.env.Q_DEBUG) {\n    Q.longStackSupport = true;\n}\n\n/**\n * Constructs a {promise, resolve, reject} object.\n *\n * `resolve` is a callback to invoke with a more resolved value for the\n * promise. To fulfill the promise, invoke `resolve` with any value that is\n * not a thenable. To reject the promise, invoke `resolve` with a rejected\n * thenable, or invoke `reject` with the reason directly. To resolve the\n * promise to another thenable, thus putting it in the same state, invoke\n * `resolve` with that other thenable.\n */\nQ.defer = defer;\nfunction defer() {\n    // if \"messages\" is an \"Array\", that indicates that the promise has not yet\n    // been resolved.  If it is \"undefined\", it has been resolved.  Each\n    // element of the messages array is itself an array of complete arguments to\n    // forward to the resolved promise.  We coerce the resolution value to a\n    // promise using the `resolve` function because it handles both fully\n    // non-thenable values and other thenables gracefully.\n    var messages = [], progressListeners = [], resolvedPromise;\n\n    var deferred = object_create(defer.prototype);\n    var promise = object_create(Promise.prototype);\n\n    promise.promiseDispatch = function (resolve, op, operands) {\n        var args = array_slice(arguments);\n        if (messages) {\n            messages.push(args);\n            if (op === \"when\" && operands[1]) { // progress operand\n                progressListeners.push(operands[1]);\n            }\n        } else {\n            Q.nextTick(function () {\n                resolvedPromise.promiseDispatch.apply(resolvedPromise, args);\n            });\n        }\n    };\n\n    // XXX deprecated\n    promise.valueOf = function () {\n        if (messages) {\n            return promise;\n        }\n        var nearerValue = nearer(resolvedPromise);\n        if (isPromise(nearerValue)) {\n            resolvedPromise = nearerValue; // shorten chain\n        }\n        return nearerValue;\n    };\n\n    promise.inspect = function () {\n        if (!resolvedPromise) {\n            return { state: \"pending\" };\n        }\n        return resolvedPromise.inspect();\n    };\n\n    if (Q.longStackSupport && hasStacks) {\n        try {\n            throw new Error();\n        } catch (e) {\n            // NOTE: don't try to use `Error.captureStackTrace` or transfer the\n            // accessor around; that causes memory leaks as per GH-111. Just\n            // reify the stack trace as a string ASAP.\n            //\n            // At the same time, cut off the first line; it's always just\n            // \"[object Promise]\\n\", as per the `toString`.\n            promise.stack = e.stack.substring(e.stack.indexOf(\"\\n\") + 1);\n            promise.stackCounter = longStackCounter++;\n        }\n    }\n\n    // NOTE: we do the checks for `resolvedPromise` in each method, instead of\n    // consolidating them into `become`, since otherwise we'd create new\n    // promises with the lines `become(whatever(value))`. See e.g. GH-252.\n\n    function become(newPromise) {\n        resolvedPromise = newPromise;\n\n        if (Q.longStackSupport && hasStacks) {\n            // Only hold a reference to the new promise if long stacks\n            // are enabled to reduce memory usage\n            promise.source = newPromise;\n        }\n\n        array_reduce(messages, function (undefined, message) {\n            Q.nextTick(function () {\n                newPromise.promiseDispatch.apply(newPromise, message);\n            });\n        }, void 0);\n\n        messages = void 0;\n        progressListeners = void 0;\n    }\n\n    deferred.promise = promise;\n    deferred.resolve = function (value) {\n        if (resolvedPromise) {\n            return;\n        }\n\n        become(Q(value));\n    };\n\n    deferred.fulfill = function (value) {\n        if (resolvedPromise) {\n            return;\n        }\n\n        become(fulfill(value));\n    };\n    deferred.reject = function (reason) {\n        if (resolvedPromise) {\n            return;\n        }\n\n        become(reject(reason));\n    };\n    deferred.notify = function (progress) {\n        if (resolvedPromise) {\n            return;\n        }\n\n        array_reduce(progressListeners, function (undefined, progressListener) {\n            Q.nextTick(function () {\n                progressListener(progress);\n            });\n        }, void 0);\n    };\n\n    return deferred;\n}\n\n/**\n * Creates a Node-style callback that will resolve or reject the deferred\n * promise.\n * @returns a nodeback\n */\ndefer.prototype.makeNodeResolver = function () {\n    var self = this;\n    return function (error, value) {\n        if (error) {\n            self.reject(error);\n        } else if (arguments.length > 2) {\n            self.resolve(array_slice(arguments, 1));\n        } else {\n            self.resolve(value);\n        }\n    };\n};\n\n/**\n * @param resolver {Function} a function that returns nothing and accepts\n * the resolve, reject, and notify functions for a deferred.\n * @returns a promise that may be resolved with the given resolve and reject\n * functions, or rejected by a thrown exception in resolver\n */\nQ.Promise = promise; // ES6\nQ.promise = promise;\nfunction promise(resolver) {\n    if (typeof resolver !== \"function\") {\n        throw new TypeError(\"resolver must be a function.\");\n    }\n    var deferred = defer();\n    try {\n        resolver(deferred.resolve, deferred.reject, deferred.notify);\n    } catch (reason) {\n        deferred.reject(reason);\n    }\n    return deferred.promise;\n}\n\npromise.race = race; // ES6\npromise.all = all; // ES6\npromise.reject = reject; // ES6\npromise.resolve = Q; // ES6\n\n// XXX experimental.  This method is a way to denote that a local value is\n// serializable and should be immediately dispatched to a remote upon request,\n// instead of passing a reference.\nQ.passByCopy = function (object) {\n    //freeze(object);\n    //passByCopies.set(object, true);\n    return object;\n};\n\nPromise.prototype.passByCopy = function () {\n    //freeze(object);\n    //passByCopies.set(object, true);\n    return this;\n};\n\n/**\n * If two promises eventually fulfill to the same value, promises that value,\n * but otherwise rejects.\n * @param x {Any*}\n * @param y {Any*}\n * @returns {Any*} a promise for x and y if they are the same, but a rejection\n * otherwise.\n *\n */\nQ.join = function (x, y) {\n    return Q(x).join(y);\n};\n\nPromise.prototype.join = function (that) {\n    return Q([this, that]).spread(function (x, y) {\n        if (x === y) {\n            // TODO: \"===\" should be Object.is or equiv\n            return x;\n        } else {\n            throw new Error(\"Q can't join: not the same: \" + x + \" \" + y);\n        }\n    });\n};\n\n/**\n * Returns a promise for the first of an array of promises to become settled.\n * @param answers {Array[Any*]} promises to race\n * @returns {Any*} the first promise to be settled\n */\nQ.race = race;\nfunction race(answerPs) {\n    return promise(function (resolve, reject) {\n        // Switch to this once we can assume at least ES5\n        // answerPs.forEach(function (answerP) {\n        //     Q(answerP).then(resolve, reject);\n        // });\n        // Use this in the meantime\n        for (var i = 0, len = answerPs.length; i < len; i++) {\n            Q(answerPs[i]).then(resolve, reject);\n        }\n    });\n}\n\nPromise.prototype.race = function () {\n    return this.then(Q.race);\n};\n\n/**\n * Constructs a Promise with a promise descriptor object and optional fallback\n * function.  The descriptor contains methods like when(rejected), get(name),\n * set(name, value), post(name, args), and delete(name), which all\n * return either a value, a promise for a value, or a rejection.  The fallback\n * accepts the operation name, a resolver, and any further arguments that would\n * have been forwarded to the appropriate method above had a method been\n * provided with the proper name.  The API makes no guarantees about the nature\n * of the returned object, apart from that it is usable whereever promises are\n * bought and sold.\n */\nQ.makePromise = Promise;\nfunction Promise(descriptor, fallback, inspect) {\n    if (fallback === void 0) {\n        fallback = function (op) {\n            return reject(new Error(\n                \"Promise does not support operation: \" + op\n            ));\n        };\n    }\n    if (inspect === void 0) {\n        inspect = function () {\n            return {state: \"unknown\"};\n        };\n    }\n\n    var promise = object_create(Promise.prototype);\n\n    promise.promiseDispatch = function (resolve, op, args) {\n        var result;\n        try {\n            if (descriptor[op]) {\n                result = descriptor[op].apply(promise, args);\n            } else {\n                result = fallback.call(promise, op, args);\n            }\n        } catch (exception) {\n            result = reject(exception);\n        }\n        if (resolve) {\n            resolve(result);\n        }\n    };\n\n    promise.inspect = inspect;\n\n    // XXX deprecated `valueOf` and `exception` support\n    if (inspect) {\n        var inspected = inspect();\n        if (inspected.state === \"rejected\") {\n            promise.exception = inspected.reason;\n        }\n\n        promise.valueOf = function () {\n            var inspected = inspect();\n            if (inspected.state === \"pending\" ||\n                inspected.state === \"rejected\") {\n                return promise;\n            }\n            return inspected.value;\n        };\n    }\n\n    return promise;\n}\n\nPromise.prototype.toString = function () {\n    return \"[object Promise]\";\n};\n\nPromise.prototype.then = function (fulfilled, rejected, progressed) {\n    var self = this;\n    var deferred = defer();\n    var done = false;   // ensure the untrusted promise makes at most a\n                        // single call to one of the callbacks\n\n    function _fulfilled(value) {\n        try {\n            return typeof fulfilled === \"function\" ? fulfilled(value) : value;\n        } catch (exception) {\n            return reject(exception);\n        }\n    }\n\n    function _rejected(exception) {\n        if (typeof rejected === \"function\") {\n            makeStackTraceLong(exception, self);\n            try {\n                return rejected(exception);\n            } catch (newException) {\n                return reject(newException);\n            }\n        }\n        return reject(exception);\n    }\n\n    function _progressed(value) {\n        return typeof progressed === \"function\" ? progressed(value) : value;\n    }\n\n    Q.nextTick(function () {\n        self.promiseDispatch(function (value) {\n            if (done) {\n                return;\n            }\n            done = true;\n\n            deferred.resolve(_fulfilled(value));\n        }, \"when\", [function (exception) {\n            if (done) {\n                return;\n            }\n            done = true;\n\n            deferred.resolve(_rejected(exception));\n        }]);\n    });\n\n    // Progress propagator need to be attached in the current tick.\n    self.promiseDispatch(void 0, \"when\", [void 0, function (value) {\n        var newValue;\n        var threw = false;\n        try {\n            newValue = _progressed(value);\n        } catch (e) {\n            threw = true;\n            if (Q.onerror) {\n                Q.onerror(e);\n            } else {\n                throw e;\n            }\n        }\n\n        if (!threw) {\n            deferred.notify(newValue);\n        }\n    }]);\n\n    return deferred.promise;\n};\n\nQ.tap = function (promise, callback) {\n    return Q(promise).tap(callback);\n};\n\n/**\n * Works almost like \"finally\", but not called for rejections.\n * Original resolution value is passed through callback unaffected.\n * Callback may return a promise that will be awaited for.\n * @param {Function} callback\n * @returns {Q.Promise}\n * @example\n * doSomething()\n *   .then(...)\n *   .tap(console.log)\n *   .then(...);\n */\nPromise.prototype.tap = function (callback) {\n    callback = Q(callback);\n\n    return this.then(function (value) {\n        return callback.fcall(value).thenResolve(value);\n    });\n};\n\n/**\n * Registers an observer on a promise.\n *\n * Guarantees:\n *\n * 1. that fulfilled and rejected will be called only once.\n * 2. that either the fulfilled callback or the rejected callback will be\n *    called, but not both.\n * 3. that fulfilled and rejected will not be called in this turn.\n *\n * @param value      promise or immediate reference to observe\n * @param fulfilled  function to be called with the fulfilled value\n * @param rejected   function to be called with the rejection exception\n * @param progressed function to be called on any progress notifications\n * @return promise for the return value from the invoked callback\n */\nQ.when = when;\nfunction when(value, fulfilled, rejected, progressed) {\n    return Q(value).then(fulfilled, rejected, progressed);\n}\n\nPromise.prototype.thenResolve = function (value) {\n    return this.then(function () { return value; });\n};\n\nQ.thenResolve = function (promise, value) {\n    return Q(promise).thenResolve(value);\n};\n\nPromise.prototype.thenReject = function (reason) {\n    return this.then(function () { throw reason; });\n};\n\nQ.thenReject = function (promise, reason) {\n    return Q(promise).thenReject(reason);\n};\n\n/**\n * If an object is not a promise, it is as \"near\" as possible.\n * If a promise is rejected, it is as \"near\" as possible too.\n * If it\u2019s a fulfilled promise, the fulfillment value is nearer.\n * If it\u2019s a deferred promise and the deferred has been resolved, the\n * resolution is \"nearer\".\n * @param object\n * @returns most resolved (nearest) form of the object\n */\n\n// XXX should we re-do this?\nQ.nearer = nearer;\nfunction nearer(value) {\n    if (isPromise(value)) {\n        var inspected = value.inspect();\n        if (inspected.state === \"fulfilled\") {\n            return inspected.value;\n        }\n    }\n    return value;\n}\n\n/**\n * @returns whether the given object is a promise.\n * Otherwise it is a fulfilled value.\n */\nQ.isPromise = isPromise;\nfunction isPromise(object) {\n    return object instanceof Promise;\n}\n\nQ.isPromiseAlike = isPromiseAlike;\nfunction isPromiseAlike(object) {\n    return isObject(object) && typeof object.then === \"function\";\n}\n\n/**\n * @returns whether the given object is a pending promise, meaning not\n * fulfilled or rejected.\n */\nQ.isPending = isPending;\nfunction isPending(object) {\n    return isPromise(object) && object.inspect().state === \"pending\";\n}\n\nPromise.prototype.isPending = function () {\n    return this.inspect().state === \"pending\";\n};\n\n/**\n * @returns whether the given object is a value or fulfilled\n * promise.\n */\nQ.isFulfilled = isFulfilled;\nfunction isFulfilled(object) {\n    return !isPromise(object) || object.inspect().state === \"fulfilled\";\n}\n\nPromise.prototype.isFulfilled = function () {\n    return this.inspect().state === \"fulfilled\";\n};\n\n/**\n * @returns whether the given object is a rejected promise.\n */\nQ.isRejected = isRejected;\nfunction isRejected(object) {\n    return isPromise(object) && object.inspect().state === \"rejected\";\n}\n\nPromise.prototype.isRejected = function () {\n    return this.inspect().state === \"rejected\";\n};\n\n//// BEGIN UNHANDLED REJECTION TRACKING\n\n// This promise library consumes exceptions thrown in handlers so they can be\n// handled by a subsequent promise.  The exceptions get added to this array when\n// they are created, and removed when they are handled.  Note that in ES6 or\n// shimmed environments, this would naturally be a `Set`.\nvar unhandledReasons = [];\nvar unhandledRejections = [];\nvar reportedUnhandledRejections = [];\nvar trackUnhandledRejections = true;\n\nfunction resetUnhandledRejections() {\n    unhandledReasons.length = 0;\n    unhandledRejections.length = 0;\n\n    if (!trackUnhandledRejections) {\n        trackUnhandledRejections = true;\n    }\n}\n\nfunction trackRejection(promise, reason) {\n    if (!trackUnhandledRejections) {\n        return;\n    }\n    if (typeof process === \"object\" && typeof process.emit === \"function\") {\n        Q.nextTick.runAfter(function () {\n            if (array_indexOf(unhandledRejections, promise) !== -1) {\n                process.emit(\"unhandledRejection\", reason, promise);\n                reportedUnhandledRejections.push(promise);\n            }\n        });\n    }\n\n    unhandledRejections.push(promise);\n    if (reason && typeof reason.stack !== \"undefined\") {\n        unhandledReasons.push(reason.stack);\n    } else {\n        unhandledReasons.push(\"(no stack) \" + reason);\n    }\n}\n\nfunction untrackRejection(promise) {\n    if (!trackUnhandledRejections) {\n        return;\n    }\n\n    var at = array_indexOf(unhandledRejections, promise);\n    if (at !== -1) {\n        if (typeof process === \"object\" && typeof process.emit === \"function\") {\n            Q.nextTick.runAfter(function () {\n                var atReport = array_indexOf(reportedUnhandledRejections, promise);\n                if (atReport !== -1) {\n                    process.emit(\"rejectionHandled\", unhandledReasons[at], promise);\n                    reportedUnhandledRejections.splice(atReport, 1);\n                }\n            });\n        }\n        unhandledRejections.splice(at, 1);\n        unhandledReasons.splice(at, 1);\n    }\n}\n\nQ.resetUnhandledRejections = resetUnhandledRejections;\n\nQ.getUnhandledReasons = function () {\n    // Make a copy so that consumers can't interfere with our internal state.\n    return unhandledReasons.slice();\n};\n\nQ.stopUnhandledRejectionTracking = function () {\n    resetUnhandledRejections();\n    trackUnhandledRejections = false;\n};\n\nresetUnhandledRejections();\n\n//// END UNHANDLED REJECTION TRACKING\n\n/**\n * Constructs a rejected promise.\n * @param reason value describing the failure\n */\nQ.reject = reject;\nfunction reject(reason) {\n    var rejection = Promise({\n        \"when\": function (rejected) {\n            // note that the error has been handled\n            if (rejected) {\n                untrackRejection(this);\n            }\n            return rejected ? rejected(reason) : this;\n        }\n    }, function fallback() {\n        return this;\n    }, function inspect() {\n        return { state: \"rejected\", reason: reason };\n    });\n\n    // Note that the reason has not been handled.\n    trackRejection(rejection, reason);\n\n    return rejection;\n}\n\n/**\n * Constructs a fulfilled promise for an immediate reference.\n * @param value immediate reference\n */\nQ.fulfill = fulfill;\nfunction fulfill(value) {\n    return Promise({\n        \"when\": function () {\n            return value;\n        },\n        \"get\": function (name) {\n            return value[name];\n        },\n        \"set\": function (name, rhs) {\n            value[name] = rhs;\n        },\n        \"delete\": function (name) {\n            delete value[name];\n        },\n        \"post\": function (name, args) {\n            // Mark Miller proposes that post with no name should apply a\n            // promised function.\n            if (name === null || name === void 0) {\n                return value.apply(void 0, args);\n            } else {\n                return value[name].apply(value, args);\n            }\n        },\n        \"apply\": function (thisp, args) {\n            return value.apply(thisp, args);\n        },\n        \"keys\": function () {\n            return object_keys(value);\n        }\n    }, void 0, function inspect() {\n        return { state: \"fulfilled\", value: value };\n    });\n}\n\n/**\n * Converts thenables to Q promises.\n * @param promise thenable promise\n * @returns a Q promise\n */\nfunction coerce(promise) {\n    var deferred = defer();\n    Q.nextTick(function () {\n        try {\n            promise.then(deferred.resolve, deferred.reject, deferred.notify);\n        } catch (exception) {\n            deferred.reject(exception);\n        }\n    });\n    return deferred.promise;\n}\n\n/**\n * Annotates an object such that it will never be\n * transferred away from this process over any promise\n * communication channel.\n * @param object\n * @returns promise a wrapping of that object that\n * additionally responds to the \"isDef\" message\n * without a rejection.\n */\nQ.master = master;\nfunction master(object) {\n    return Promise({\n        \"isDef\": function () {}\n    }, function fallback(op, args) {\n        return dispatch(object, op, args);\n    }, function () {\n        return Q(object).inspect();\n    });\n}\n\n/**\n * Spreads the values of a promised array of arguments into the\n * fulfillment callback.\n * @param fulfilled callback that receives variadic arguments from the\n * promised array\n * @param rejected callback that receives the exception if the promise\n * is rejected.\n * @returns a promise for the return value or thrown exception of\n * either callback.\n */\nQ.spread = spread;\nfunction spread(value, fulfilled, rejected) {\n    return Q(value).spread(fulfilled, rejected);\n}\n\nPromise.prototype.spread = function (fulfilled, rejected) {\n    return this.all().then(function (array) {\n        return fulfilled.apply(void 0, array);\n    }, rejected);\n};\n\n/**\n * The async function is a decorator for generator functions, turning\n * them into asynchronous generators.  Although generators are only part\n * of the newest ECMAScript 6 drafts, this code does not cause syntax\n * errors in older engines.  This code should continue to work and will\n * in fact improve over time as the language improves.\n *\n * ES6 generators are currently part of V8 version 3.19 with the\n * --harmony-generators runtime flag enabled.  SpiderMonkey has had them\n * for longer, but under an older Python-inspired form.  This function\n * works on both kinds of generators.\n *\n * Decorates a generator function such that:\n *  - it may yield promises\n *  - execution will continue when that promise is fulfilled\n *  - the value of the yield expression will be the fulfilled value\n *  - it returns a promise for the return value (when the generator\n *    stops iterating)\n *  - the decorated function returns a promise for the return value\n *    of the generator or the first rejected promise among those\n *    yielded.\n *  - if an error is thrown in the generator, it propagates through\n *    every following yield until it is caught, or until it escapes\n *    the generator function altogether, and is translated into a\n *    rejection for the promise returned by the decorated generator.\n */\nQ.async = async;\nfunction async(makeGenerator) {\n    return function () {\n        // when verb is \"send\", arg is a value\n        // when verb is \"throw\", arg is an exception\n        function continuer(verb, arg) {\n            var result;\n\n            // Until V8 3.19 / Chromium 29 is released, SpiderMonkey is the only\n            // engine that has a deployed base of browsers that support generators.\n            // However, SM's generators use the Python-inspired semantics of\n            // outdated ES6 drafts.  We would like to support ES6, but we'd also\n            // like to make it possible to use generators in deployed browsers, so\n            // we also support Python-style generators.  At some point we can remove\n            // this block.\n\n            if (typeof StopIteration === \"undefined\") {\n                // ES6 Generators\n                try {\n                    result = generator[verb](arg);\n                } catch (exception) {\n                    return reject(exception);\n                }\n                if (result.done) {\n                    return Q(result.value);\n                } else {\n                    return when(result.value, callback, errback);\n                }\n            } else {\n                // SpiderMonkey Generators\n                // FIXME: Remove this case when SM does ES6 generators.\n                try {\n                    result = generator[verb](arg);\n                } catch (exception) {\n                    if (isStopIteration(exception)) {\n                        return Q(exception.value);\n                    } else {\n                        return reject(exception);\n                    }\n                }\n                return when(result, callback, errback);\n            }\n        }\n        var generator = makeGenerator.apply(this, arguments);\n        var callback = continuer.bind(continuer, \"next\");\n        var errback = continuer.bind(continuer, \"throw\");\n        return callback();\n    };\n}\n\n/**\n * The spawn function is a small wrapper around async that immediately\n * calls the generator and also ends the promise chain, so that any\n * unhandled errors are thrown instead of forwarded to the error\n * handler. This is useful because it's extremely common to run\n * generators at the top-level to work with libraries.\n */\nQ.spawn = spawn;\nfunction spawn(makeGenerator) {\n    Q.done(Q.async(makeGenerator)());\n}\n\n// FIXME: Remove this interface once ES6 generators are in SpiderMonkey.\n/**\n * Throws a ReturnValue exception to stop an asynchronous generator.\n *\n * This interface is a stop-gap measure to support generator return\n * values in older Firefox/SpiderMonkey.  In browsers that support ES6\n * generators like Chromium 29, just use \"return\" in your generator\n * functions.\n *\n * @param value the return value for the surrounding generator\n * @throws ReturnValue exception with the value.\n * @example\n * // ES6 style\n * Q.async(function* () {\n *      var foo = yield getFooPromise();\n *      var bar = yield getBarPromise();\n *      return foo + bar;\n * })\n * // Older SpiderMonkey style\n * Q.async(function () {\n *      var foo = yield getFooPromise();\n *      var bar = yield getBarPromise();\n *      Q.return(foo + bar);\n * })\n */\nQ[\"return\"] = _return;\nfunction _return(value) {\n    throw new QReturnValue(value);\n}\n\n/**\n * The promised function decorator ensures that any promise arguments\n * are settled and passed as values (`this` is also settled and passed\n * as a value).  It will also ensure that the result of a function is\n * always a promise.\n *\n * @example\n * var add = Q.promised(function (a, b) {\n *     return a + b;\n * });\n * add(Q(a), Q(B));\n *\n * @param {function} callback The function to decorate\n * @returns {function} a function that has been decorated.\n */\nQ.promised = promised;\nfunction promised(callback) {\n    return function () {\n        return spread([this, all(arguments)], function (self, args) {\n            return callback.apply(self, args);\n        });\n    };\n}\n\n/**\n * sends a message to a value in a future turn\n * @param object* the recipient\n * @param op the name of the message operation, e.g., \"when\",\n * @param args further arguments to be forwarded to the operation\n * @returns result {Promise} a promise for the result of the operation\n */\nQ.dispatch = dispatch;\nfunction dispatch(object, op, args) {\n    return Q(object).dispatch(op, args);\n}\n\nPromise.prototype.dispatch = function (op, args) {\n    var self = this;\n    var deferred = defer();\n    Q.nextTick(function () {\n        self.promiseDispatch(deferred.resolve, op, args);\n    });\n    return deferred.promise;\n};\n\n/**\n * Gets the value of a property in a future turn.\n * @param object    promise or immediate reference for target object\n * @param name      name of property to get\n * @return promise for the property value\n */\nQ.get = function (object, key) {\n    return Q(object).dispatch(\"get\", [key]);\n};\n\nPromise.prototype.get = function (key) {\n    return this.dispatch(\"get\", [key]);\n};\n\n/**\n * Sets the value of a property in a future turn.\n * @param object    promise or immediate reference for object object\n * @param name      name of property to set\n * @param value     new value of property\n * @return promise for the return value\n */\nQ.set = function (object, key, value) {\n    return Q(object).dispatch(\"set\", [key, value]);\n};\n\nPromise.prototype.set = function (key, value) {\n    return this.dispatch(\"set\", [key, value]);\n};\n\n/**\n * Deletes a property in a future turn.\n * @param object    promise or immediate reference for target object\n * @param name      name of property to delete\n * @return promise for the return value\n */\nQ.del = // XXX legacy\nQ[\"delete\"] = function (object, key) {\n    return Q(object).dispatch(\"delete\", [key]);\n};\n\nPromise.prototype.del = // XXX legacy\nPromise.prototype[\"delete\"] = function (key) {\n    return this.dispatch(\"delete\", [key]);\n};\n\n/**\n * Invokes a method in a future turn.\n * @param object    promise or immediate reference for target object\n * @param name      name of method to invoke\n * @param value     a value to post, typically an array of\n *                  invocation arguments for promises that\n *                  are ultimately backed with `resolve` values,\n *                  as opposed to those backed with URLs\n *                  wherein the posted value can be any\n *                  JSON serializable object.\n * @return promise for the return value\n */\n// bound locally because it is used by other methods\nQ.mapply = // XXX As proposed by \"Redsandro\"\nQ.post = function (object, name, args) {\n    return Q(object).dispatch(\"post\", [name, args]);\n};\n\nPromise.prototype.mapply = // XXX As proposed by \"Redsandro\"\nPromise.prototype.post = function (name, args) {\n    return this.dispatch(\"post\", [name, args]);\n};\n\n/**\n * Invokes a method in a future turn.\n * @param object    promise or immediate reference for target object\n * @param name      name of method to invoke\n * @param ...args   array of invocation arguments\n * @return promise for the return value\n */\nQ.send = // XXX Mark Miller's proposed parlance\nQ.mcall = // XXX As proposed by \"Redsandro\"\nQ.invoke = function (object, name /*...args*/) {\n    return Q(object).dispatch(\"post\", [name, array_slice(arguments, 2)]);\n};\n\nPromise.prototype.send = // XXX Mark Miller's proposed parlance\nPromise.prototype.mcall = // XXX As proposed by \"Redsandro\"\nPromise.prototype.invoke = function (name /*...args*/) {\n    return this.dispatch(\"post\", [name, array_slice(arguments, 1)]);\n};\n\n/**\n * Applies the promised function in a future turn.\n * @param object    promise or immediate reference for target function\n * @param args      array of application arguments\n */\nQ.fapply = function (object, args) {\n    return Q(object).dispatch(\"apply\", [void 0, args]);\n};\n\nPromise.prototype.fapply = function (args) {\n    return this.dispatch(\"apply\", [void 0, args]);\n};\n\n/**\n * Calls the promised function in a future turn.\n * @param object    promise or immediate reference for target function\n * @param ...args   array of application arguments\n */\nQ[\"try\"] =\nQ.fcall = function (object /* ...args*/) {\n    return Q(object).dispatch(\"apply\", [void 0, array_slice(arguments, 1)]);\n};\n\nPromise.prototype.fcall = function (/*...args*/) {\n    return this.dispatch(\"apply\", [void 0, array_slice(arguments)]);\n};\n\n/**\n * Binds the promised function, transforming return values into a fulfilled\n * promise and thrown errors into a rejected one.\n * @param object    promise or immediate reference for target function\n * @param ...args   array of application arguments\n */\nQ.fbind = function (object /*...args*/) {\n    var promise = Q(object);\n    var args = array_slice(arguments, 1);\n    return function fbound() {\n        return promise.dispatch(\"apply\", [\n            this,\n            args.concat(array_slice(arguments))\n        ]);\n    };\n};\nPromise.prototype.fbind = function (/*...args*/) {\n    var promise = this;\n    var args = array_slice(arguments);\n    return function fbound() {\n        return promise.dispatch(\"apply\", [\n            this,\n            args.concat(array_slice(arguments))\n        ]);\n    };\n};\n\n/**\n * Requests the names of the owned properties of a promised\n * object in a future turn.\n * @param object    promise or immediate reference for target object\n * @return promise for the keys of the eventually settled object\n */\nQ.keys = function (object) {\n    return Q(object).dispatch(\"keys\", []);\n};\n\nPromise.prototype.keys = function () {\n    return this.dispatch(\"keys\", []);\n};\n\n/**\n * Turns an array of promises into a promise for an array.  If any of\n * the promises gets rejected, the whole array is rejected immediately.\n * @param {Array*} an array (or promise for an array) of values (or\n * promises for values)\n * @returns a promise for an array of the corresponding values\n */\n// By Mark Miller\n// http://wiki.ecmascript.org/doku.php?id=strawman:concurrency&rev=1308776521#allfulfilled\nQ.all = all;\nfunction all(promises) {\n    return when(promises, function (promises) {\n        var pendingCount = 0;\n        var deferred = defer();\n        array_reduce(promises, function (undefined, promise, index) {\n            var snapshot;\n            if (\n                isPromise(promise) &&\n                (snapshot = promise.inspect()).state === \"fulfilled\"\n            ) {\n                promises[index] = snapshot.value;\n            } else {\n                ++pendingCount;\n                when(\n                    promise,\n                    function (value) {\n                        promises[index] = value;\n                        if (--pendingCount === 0) {\n                            deferred.resolve(promises);\n                        }\n                    },\n                    deferred.reject,\n                    function (progress) {\n                        deferred.notify({ index: index, value: progress });\n                    }\n                );\n            }\n        }, void 0);\n        if (pendingCount === 0) {\n            deferred.resolve(promises);\n        }\n        return deferred.promise;\n    });\n}\n\nPromise.prototype.all = function () {\n    return all(this);\n};\n\n/**\n * Returns the first resolved promise of an array. Prior rejected promises are\n * ignored.  Rejects only if all promises are rejected.\n * @param {Array*} an array containing values or promises for values\n * @returns a promise fulfilled with the value of the first resolved promise,\n * or a rejected promise if all promises are rejected.\n */\nQ.any = any;\n\nfunction any(promises) {\n    if (promises.length === 0) {\n        return Q.resolve();\n    }\n\n    var deferred = Q.defer();\n    var pendingCount = 0;\n    array_reduce(promises, function (prev, current, index) {\n        var promise = promises[index];\n\n        pendingCount++;\n\n        when(promise, onFulfilled, onRejected, onProgress);\n        function onFulfilled(result) {\n            deferred.resolve(result);\n        }\n        function onRejected(err) {\n            pendingCount--;\n            if (pendingCount === 0) {\n                var rejection = err || new Error(\"\" + err);\n\n                rejection.message = (\"Q can't get fulfillment value from any promise, all \" +\n                    \"promises were rejected. Last error message: \" + rejection.message);\n\n                deferred.reject(rejection);\n            }\n        }\n        function onProgress(progress) {\n            deferred.notify({\n                index: index,\n                value: progress\n            });\n        }\n    }, undefined);\n\n    return deferred.promise;\n}\n\nPromise.prototype.any = function () {\n    return any(this);\n};\n\n/**\n * Waits for all promises to be settled, either fulfilled or\n * rejected.  This is distinct from `all` since that would stop\n * waiting at the first rejection.  The promise returned by\n * `allResolved` will never be rejected.\n * @param promises a promise for an array (or an array) of promises\n * (or values)\n * @return a promise for an array of promises\n */\nQ.allResolved = deprecate(allResolved, \"allResolved\", \"allSettled\");\nfunction allResolved(promises) {\n    return when(promises, function (promises) {\n        promises = array_map(promises, Q);\n        return when(all(array_map(promises, function (promise) {\n            return when(promise, noop, noop);\n        })), function () {\n            return promises;\n        });\n    });\n}\n\nPromise.prototype.allResolved = function () {\n    return allResolved(this);\n};\n\n/**\n * @see Promise#allSettled\n */\nQ.allSettled = allSettled;\nfunction allSettled(promises) {\n    return Q(promises).allSettled();\n}\n\n/**\n * Turns an array of promises into a promise for an array of their states (as\n * returned by `inspect`) when they have all settled.\n * @param {Array[Any*]} values an array (or promise for an array) of values (or\n * promises for values)\n * @returns {Array[State]} an array of states for the respective values.\n */\nPromise.prototype.allSettled = function () {\n    return this.then(function (promises) {\n        return all(array_map(promises, function (promise) {\n            promise = Q(promise);\n            function regardless() {\n                return promise.inspect();\n            }\n            return promise.then(regardless, regardless);\n        }));\n    });\n};\n\n/**\n * Captures the failure of a promise, giving an oportunity to recover\n * with a callback.  If the given promise is fulfilled, the returned\n * promise is fulfilled.\n * @param {Any*} promise for something\n * @param {Function} callback to fulfill the returned promise if the\n * given promise is rejected\n * @returns a promise for the return value of the callback\n */\nQ.fail = // XXX legacy\nQ[\"catch\"] = function (object, rejected) {\n    return Q(object).then(void 0, rejected);\n};\n\nPromise.prototype.fail = // XXX legacy\nPromise.prototype[\"catch\"] = function (rejected) {\n    return this.then(void 0, rejected);\n};\n\n/**\n * Attaches a listener that can respond to progress notifications from a\n * promise's originating deferred. This listener receives the exact arguments\n * passed to ``deferred.notify``.\n * @param {Any*} promise for something\n * @param {Function} callback to receive any progress notifications\n * @returns the given promise, unchanged\n */\nQ.progress = progress;\nfunction progress(object, progressed) {\n    return Q(object).then(void 0, void 0, progressed);\n}\n\nPromise.prototype.progress = function (progressed) {\n    return this.then(void 0, void 0, progressed);\n};\n\n/**\n * Provides an opportunity to observe the settling of a promise,\n * regardless of whether the promise is fulfilled or rejected.  Forwards\n * the resolution to the returned promise when the callback is done.\n * The callback can return a promise to defer completion.\n * @param {Any*} promise\n * @param {Function} callback to observe the resolution of the given\n * promise, takes no arguments.\n * @returns a promise for the resolution of the given promise when\n * ``fin`` is done.\n */\nQ.fin = // XXX legacy\nQ[\"finally\"] = function (object, callback) {\n    return Q(object)[\"finally\"](callback);\n};\n\nPromise.prototype.fin = // XXX legacy\nPromise.prototype[\"finally\"] = function (callback) {\n    if (!callback || typeof callback.apply !== \"function\") {\n        throw new Error(\"Q can't apply finally callback\");\n    }\n    callback = Q(callback);\n    return this.then(function (value) {\n        return callback.fcall().then(function () {\n            return value;\n        });\n    }, function (reason) {\n        // TODO attempt to recycle the rejection with \"this\".\n        return callback.fcall().then(function () {\n            throw reason;\n        });\n    });\n};\n\n/**\n * Terminates a chain of promises, forcing rejections to be\n * thrown as exceptions.\n * @param {Any*} promise at the end of a chain of promises\n * @returns nothing\n */\nQ.done = function (object, fulfilled, rejected, progress) {\n    return Q(object).done(fulfilled, rejected, progress);\n};\n\nPromise.prototype.done = function (fulfilled, rejected, progress) {\n    var onUnhandledError = function (error) {\n        // forward to a future turn so that ``when``\n        // does not catch it and turn it into a rejection.\n        Q.nextTick(function () {\n            makeStackTraceLong(error, promise);\n            if (Q.onerror) {\n                Q.onerror(error);\n            } else {\n                throw error;\n            }\n        });\n    };\n\n    // Avoid unnecessary `nextTick`ing via an unnecessary `when`.\n    var promise = fulfilled || rejected || progress ?\n        this.then(fulfilled, rejected, progress) :\n        this;\n\n    if (typeof process === \"object\" && process && process.domain) {\n        onUnhandledError = process.domain.bind(onUnhandledError);\n    }\n\n    promise.then(void 0, onUnhandledError);\n};\n\n/**\n * Causes a promise to be rejected if it does not get fulfilled before\n * some milliseconds time out.\n * @param {Any*} promise\n * @param {Number} milliseconds timeout\n * @param {Any*} custom error message or Error object (optional)\n * @returns a promise for the resolution of the given promise if it is\n * fulfilled before the timeout, otherwise rejected.\n */\nQ.timeout = function (object, ms, error) {\n    return Q(object).timeout(ms, error);\n};\n\nPromise.prototype.timeout = function (ms, error) {\n    var deferred = defer();\n    var timeoutId = setTimeout(function () {\n        if (!error || \"string\" === typeof error) {\n            error = new Error(error || \"Timed out after \" + ms + \" ms\");\n            error.code = \"ETIMEDOUT\";\n        }\n        deferred.reject(error);\n    }, ms);\n\n    this.then(function (value) {\n        clearTimeout(timeoutId);\n        deferred.resolve(value);\n    }, function (exception) {\n        clearTimeout(timeoutId);\n        deferred.reject(exception);\n    }, deferred.notify);\n\n    return deferred.promise;\n};\n\n/**\n * Returns a promise for the given value (or promised value), some\n * milliseconds after it resolved. Passes rejections immediately.\n * @param {Any*} promise\n * @param {Number} milliseconds\n * @returns a promise for the resolution of the given promise after milliseconds\n * time has elapsed since the resolution of the given promise.\n * If the given promise rejects, that is passed immediately.\n */\nQ.delay = function (object, timeout) {\n    if (timeout === void 0) {\n        timeout = object;\n        object = void 0;\n    }\n    return Q(object).delay(timeout);\n};\n\nPromise.prototype.delay = function (timeout) {\n    return this.then(function (value) {\n        var deferred = defer();\n        setTimeout(function () {\n            deferred.resolve(value);\n        }, timeout);\n        return deferred.promise;\n    });\n};\n\n/**\n * Passes a continuation to a Node function, which is called with the given\n * arguments provided as an array, and returns a promise.\n *\n *      Q.nfapply(FS.readFile, [__filename])\n *      .then(function (content) {\n *      })\n *\n */\nQ.nfapply = function (callback, args) {\n    return Q(callback).nfapply(args);\n};\n\nPromise.prototype.nfapply = function (args) {\n    var deferred = defer();\n    var nodeArgs = array_slice(args);\n    nodeArgs.push(deferred.makeNodeResolver());\n    this.fapply(nodeArgs).fail(deferred.reject);\n    return deferred.promise;\n};\n\n/**\n * Passes a continuation to a Node function, which is called with the given\n * arguments provided individually, and returns a promise.\n * @example\n * Q.nfcall(FS.readFile, __filename)\n * .then(function (content) {\n * })\n *\n */\nQ.nfcall = function (callback /*...args*/) {\n    var args = array_slice(arguments, 1);\n    return Q(callback).nfapply(args);\n};\n\nPromise.prototype.nfcall = function (/*...args*/) {\n    var nodeArgs = array_slice(arguments);\n    var deferred = defer();\n    nodeArgs.push(deferred.makeNodeResolver());\n    this.fapply(nodeArgs).fail(deferred.reject);\n    return deferred.promise;\n};\n\n/**\n * Wraps a NodeJS continuation passing function and returns an equivalent\n * version that returns a promise.\n * @example\n * Q.nfbind(FS.readFile, __filename)(\"utf-8\")\n * .then(console.log)\n * .done()\n */\nQ.nfbind =\nQ.denodeify = function (callback /*...args*/) {\n    if (callback === undefined) {\n        throw new Error(\"Q can't wrap an undefined function\");\n    }\n    var baseArgs = array_slice(arguments, 1);\n    return function () {\n        var nodeArgs = baseArgs.concat(array_slice(arguments));\n        var deferred = defer();\n        nodeArgs.push(deferred.makeNodeResolver());\n        Q(callback).fapply(nodeArgs).fail(deferred.reject);\n        return deferred.promise;\n    };\n};\n\nPromise.prototype.nfbind =\nPromise.prototype.denodeify = function (/*...args*/) {\n    var args = array_slice(arguments);\n    args.unshift(this);\n    return Q.denodeify.apply(void 0, args);\n};\n\nQ.nbind = function (callback, thisp /*...args*/) {\n    var baseArgs = array_slice(arguments, 2);\n    return function () {\n        var nodeArgs = baseArgs.concat(array_slice(arguments));\n        var deferred = defer();\n        nodeArgs.push(deferred.makeNodeResolver());\n        function bound() {\n            return callback.apply(thisp, arguments);\n        }\n        Q(bound).fapply(nodeArgs).fail(deferred.reject);\n        return deferred.promise;\n    };\n};\n\nPromise.prototype.nbind = function (/*thisp, ...args*/) {\n    var args = array_slice(arguments, 0);\n    args.unshift(this);\n    return Q.nbind.apply(void 0, args);\n};\n\n/**\n * Calls a method of a Node-style object that accepts a Node-style\n * callback with a given array of arguments, plus a provided callback.\n * @param object an object that has the named method\n * @param {String} name name of the method of object\n * @param {Array} args arguments to pass to the method; the callback\n * will be provided by Q and appended to these arguments.\n * @returns a promise for the value or error\n */\nQ.nmapply = // XXX As proposed by \"Redsandro\"\nQ.npost = function (object, name, args) {\n    return Q(object).npost(name, args);\n};\n\nPromise.prototype.nmapply = // XXX As proposed by \"Redsandro\"\nPromise.prototype.npost = function (name, args) {\n    var nodeArgs = array_slice(args || []);\n    var deferred = defer();\n    nodeArgs.push(deferred.makeNodeResolver());\n    this.dispatch(\"post\", [name, nodeArgs]).fail(deferred.reject);\n    return deferred.promise;\n};\n\n/**\n * Calls a method of a Node-style object that accepts a Node-style\n * callback, forwarding the given variadic arguments, plus a provided\n * callback argument.\n * @param object an object that has the named method\n * @param {String} name name of the method of object\n * @param ...args arguments to pass to the method; the callback will\n * be provided by Q and appended to these arguments.\n * @returns a promise for the value or error\n */\nQ.nsend = // XXX Based on Mark Miller's proposed \"send\"\nQ.nmcall = // XXX Based on \"Redsandro's\" proposal\nQ.ninvoke = function (object, name /*...args*/) {\n    var nodeArgs = array_slice(arguments, 2);\n    var deferred = defer();\n    nodeArgs.push(deferred.makeNodeResolver());\n    Q(object).dispatch(\"post\", [name, nodeArgs]).fail(deferred.reject);\n    return deferred.promise;\n};\n\nPromise.prototype.nsend = // XXX Based on Mark Miller's proposed \"send\"\nPromise.prototype.nmcall = // XXX Based on \"Redsandro's\" proposal\nPromise.prototype.ninvoke = function (name /*...args*/) {\n    var nodeArgs = array_slice(arguments, 1);\n    var deferred = defer();\n    nodeArgs.push(deferred.makeNodeResolver());\n    this.dispatch(\"post\", [name, nodeArgs]).fail(deferred.reject);\n    return deferred.promise;\n};\n\n/**\n * If a function would like to support both Node continuation-passing-style and\n * promise-returning-style, it can end its internal promise chain with\n * `nodeify(nodeback)`, forwarding the optional nodeback argument.  If the user\n * elects to use a nodeback, the result will be sent there.  If they do not\n * pass a nodeback, they will receive the result promise.\n * @param object a result (or a promise for a result)\n * @param {Function} nodeback a Node.js-style callback\n * @returns either the promise or nothing\n */\nQ.nodeify = nodeify;\nfunction nodeify(object, nodeback) {\n    return Q(object).nodeify(nodeback);\n}\n\nPromise.prototype.nodeify = function (nodeback) {\n    if (nodeback) {\n        this.then(function (value) {\n            Q.nextTick(function () {\n                nodeback(null, value);\n            });\n        }, function (error) {\n            Q.nextTick(function () {\n                nodeback(error);\n            });\n        });\n    } else {\n        return this;\n    }\n};\n\nQ.noConflict = function() {\n    throw new Error(\"Q.noConflict only works when Q is used as a global\");\n};\n\n// All code before this point will be filtered from stack traces.\nvar qEndingLine = captureLine();\n\nreturn Q;\n\n});\n", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\nvar util = require('util');\nvar Thrift = require('./thrift');\n\nexports.Multiplexer = Multiplexer;\n\nfunction Wrapper(serviceName, protocol, connection) {\n\n  function MultiplexProtocol(trans, strictRead, strictWrite) {\n    protocol.call(this, trans, strictRead, strictWrite);\n  };\n\n  util.inherits(MultiplexProtocol, protocol);\n\n  MultiplexProtocol.prototype.writeMessageBegin = function(name, type, seqid) {\n    if (type == Thrift.MessageType.CALL || type == Thrift.MessageType.ONEWAY) {\n      connection.seqId2Service[seqid] = serviceName;\n      MultiplexProtocol.super_.prototype.writeMessageBegin.call(this,\n                                                                serviceName + \":\" + name,\n                                                                type,\n                                                                seqid);\n    } else {\n      MultiplexProtocol.super_.prototype.writeMessageBegin.call(this, name, type, seqid);\n    }\n  };\n\n  return MultiplexProtocol;\n};\n\nfunction Multiplexer() {\n  this.seqid = 0;\n};\n\nMultiplexer.prototype.createClient = function(serviceName, ServiceClient, connection) {\n  if (ServiceClient.Client) {\n    ServiceClient = ServiceClient.Client;\n  }\n  var writeCb = function(buf, seqid) {\n    connection.write(buf,seqid);\n  };\n  var transport = new connection.transport(undefined, writeCb);\n  var protocolWrapper = new Wrapper(serviceName, connection.protocol, connection);\n  var client = new ServiceClient(transport, protocolWrapper);\n  var self = this;\n  client.new_seqid = function() {\n    self.seqid += 1;\n    return self.seqid;\n  };\n\n  if (typeof connection.client !== 'object') {\n    connection.client = {};\n  }\n  connection.client[serviceName] = client;\n\n  return client;\n};\n", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\n\nvar binary = require('./binary');\nvar InputBufferUnderrunError = require('./input_buffer_underrun_error');\nvar THeaderTransport = require('./header_transport');\n\nmodule.exports = TFramedTransport;\n\nfunction TFramedTransport(buffer, callback) {\n  this.inBuf = buffer || new Buffer(0);\n  this.outBuffers = [];\n  this.outCount = 0;\n  this.readPos = 0;\n  this.onFlush = callback;\n};\n\nTFramedTransport.prototype = new THeaderTransport();\n\nTFramedTransport.receiver = function(callback, seqid) {\n  var residual = null;\n\n  return function(data) {\n    // Prepend any residual data from our previous read\n    if (residual) {\n      data = Buffer.concat([residual, data]);\n      residual = null;\n    }\n\n    // framed transport\n    while (data.length) {\n      if (data.length < 4) {\n        // Not enough bytes to continue, save and resume on next packet\n        residual = data;\n        return;\n      }\n      var frameSize = binary.readI32(data, 0);\n      if (data.length < 4 + frameSize) {\n        // Not enough bytes to continue, save and resume on next packet\n        residual = data;\n        return;\n      }\n\n      var frame = data.slice(4, 4 + frameSize);\n      residual = data.slice(4 + frameSize);\n\n      callback(new TFramedTransport(frame), seqid);\n\n      data = residual;\n      residual = null;\n    }\n  };\n};\n\nTFramedTransport.prototype.commitPosition = function(){},\nTFramedTransport.prototype.rollbackPosition = function(){},\n\n  // TODO: Implement open/close support\nTFramedTransport.prototype.isOpen = function() {\n  return true;\n};\nTFramedTransport.prototype.open = function() {};\nTFramedTransport.prototype.close =  function() {};\n\n  // Set the seqid of the message in the client\n  // So that callbacks can be found\nTFramedTransport.prototype.setCurrSeqId = function(seqid) {\n  this._seqid = seqid;\n};\n\nTFramedTransport.prototype.ensureAvailable = function(len) {\n  if (this.readPos + len > this.inBuf.length) {\n    throw new InputBufferUnderrunError();\n  }\n};\n\nTFramedTransport.prototype.read = function(len) { // this function will be used for each frames.\n  this.ensureAvailable(len);\n  var end = this.readPos + len;\n\n  if (this.inBuf.length < end) {\n    throw new Error('read(' + len + ') failed - not enough data');\n  }\n\n  var buf = this.inBuf.slice(this.readPos, end);\n  this.readPos = end;\n  return buf;\n};\n\nTFramedTransport.prototype.readByte = function() {\n  this.ensureAvailable(1);\n  return binary.readByte(this.inBuf[this.readPos++]);\n};\n\nTFramedTransport.prototype.readI16 = function() {\n  this.ensureAvailable(2);\n  var i16 = binary.readI16(this.inBuf, this.readPos);\n  this.readPos += 2;\n  return i16;\n};\n\nTFramedTransport.prototype.readI32 = function() {\n  this.ensureAvailable(4);\n  var i32 = binary.readI32(this.inBuf, this.readPos);\n  this.readPos += 4;\n  return i32;\n};\n\nTFramedTransport.prototype.readDouble = function() {\n  this.ensureAvailable(8);\n  var d = binary.readDouble(this.inBuf, this.readPos);\n  this.readPos += 8;\n  return d;\n};\n\nTFramedTransport.prototype.readString = function(len) {\n  this.ensureAvailable(len);\n  var str = this.inBuf.toString('utf8', this.readPos, this.readPos + len);\n  this.readPos += len;\n  return str;\n};\n\nTFramedTransport.prototype.borrow = function() {\n  return {\n    buf: this.inBuf,\n    readIndex: this.readPos,\n    writeIndex: this.inBuf.length\n  };\n};\n\nTFramedTransport.prototype.consume = function(bytesConsumed) {\n  this.readPos += bytesConsumed;\n};\n\nTFramedTransport.prototype.write = function(buf, encoding) {\n  if (typeof(buf) === \"string\") {\n    buf = new Buffer(buf, encoding || 'utf8');\n  }\n  this.outBuffers.push(buf);\n  this.outCount += buf.length;\n};\n\nTFramedTransport.prototype.flush = function() {\n  // If the seqid of the callback is available pass it to the onFlush\n  // Then remove the current seqid\n  var seqid = this._seqid;\n  this._seqid = null;\n\n  var out = new Buffer(this.outCount),\n      pos = 0;\n  this.outBuffers.forEach(function(buf) {\n    buf.copy(out, pos, 0);\n    pos += buf.length;\n  });\n\n  if (this.onFlush) {\n    // TODO: optimize this better, allocate one buffer instead of both:\n    var msg = new Buffer(out.length + 4);\n    binary.writeI32(msg, out.length);\n    out.copy(msg, 4, 0, out.length);\n    if (this.onFlush) {\n      // Passing seqid through this call to get it to the connection\n      this.onFlush(msg, seqid);\n    }\n  }\n\n  this.outBuffers = [];\n  this.outCount = 0;\n};\n", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\n\nvar log = require('./log');\n\nmodule.exports = TWebSocketTransport;\n\n/**\n * Constructor Function for the WebSocket transport.\n * @constructor\n * @param {string} [url] - The URL to connect to.\n * @classdesc The Apache Thrift Transport layer performs byte level I/O\n * between RPC clients and servers. The JavaScript TWebSocketTransport object\n * uses the WebSocket protocol. Target servers must implement WebSocket.\n * (see: node.js example server_http.js).\n * @example\n *   var transport = new Thrift.TWebSocketTransport(\"http://localhost:8585\");\n */\nfunction TWebSocketTransport(url) {\n    this.__reset(url);\n};\n\n\nTWebSocketTransport.prototype.__reset = function(url) {\n  this.url = url;             //Where to connect\n  this.socket = null;         //The web socket\n  this.callbacks = [];        //Pending callbacks\n  this.send_pending = [];     //Buffers/Callback pairs waiting to be sent\n  this.send_buf = '';         //Outbound data, immutable until sent\n  this.recv_buf = '';         //Inbound data\n  this.rb_wpos = 0;           //Network write position in receive buffer\n  this.rb_rpos = 0;           //Client read position in receive buffer\n};\n\n/**\n * Sends the current WS request and registers callback. The async\n * parameter is ignored (WS flush is always async) and the callback\n * function parameter is required.\n * @param {object} async - Ignored.\n * @param {object} callback - The client completion callback.\n * @returns {undefined|string} Nothing (undefined)\n */\nTWebSocketTransport.prototype.flush = function(async, callback) {\n  var self = this;\n  if (this.isOpen()) {\n    //Send data and register a callback to invoke the client callback\n    this.socket.send(this.send_buf);\n    this.callbacks.push((function() {\n      var clientCallback = callback;\n      return function(msg) {\n        self.setRecvBuffer(msg);\n        clientCallback();\n      };\n    }()));\n  } else {\n    //Queue the send to go out __onOpen\n    this.send_pending.push({\n      buf: this.send_buf,\n      cb:  callback\n    });\n  }\n};\n\nTWebSocketTransport.prototype.__onOpen = function() {\n   var self = this;\n   if (this.send_pending.length > 0) {\n      //If the user made calls before the connection was fully\n      //open, send them now\n      this.send_pending.forEach(function(elem) {\n         self.socket.send(elem.buf);\n         self.callbacks.push((function() {\n           var clientCallback = elem.cb;\n           return function(msg) {\n              self.setRecvBuffer(msg);\n              clientCallback();\n           };\n         }()));\n      });\n      this.send_pending = [];\n   }\n};\n\nTWebSocketTransport.prototype.__onClose = function(evt) {\n  this.__reset(this.url);\n};\n\nTWebSocketTransport.prototype.__onMessage = function(evt) {\n  if (this.callbacks.length) {\n    this.callbacks.shift()(evt.data);\n  }\n};\n\nTWebSocketTransport.prototype.__onError = function(evt) {\n  log.error('websocket: ' + evt.toString());\n  this.socket.close();\n};\n\n/**\n * Sets the buffer to use when receiving server responses.\n * @param {string} buf - The buffer to receive server responses.\n */\nTWebSocketTransport.prototype.setRecvBuffer = function(buf) {\n  this.recv_buf = buf;\n  this.recv_buf_sz = this.recv_buf.length;\n  this.wpos = this.recv_buf.length;\n  this.rpos = 0;\n};\n\n/**\n * Returns true if the transport is open\n * @readonly\n * @returns {boolean}\n */\nTWebSocketTransport.prototype.isOpen = function() {\n  return this.socket && this.socket.readyState == this.socket.OPEN;\n};\n\n/**\n * Opens the transport connection\n */\nTWebSocketTransport.prototype.open = function() {\n  //If OPEN/CONNECTING/CLOSING ignore additional opens\n  if (this.socket && this.socket.readyState != this.socket.CLOSED) {\n    return;\n  }\n  //If there is no socket or the socket is closed:\n  this.socket = new WebSocket(this.url);\n  this.socket.onopen = this.__onOpen.bind(this);\n  this.socket.onmessage = this.__onMessage.bind(this);\n  this.socket.onerror = this.__onError.bind(this);\n  this.socket.onclose = this.__onClose.bind(this);\n};\n\n/**\n * Closes the transport connection\n */\nTWebSocketTransport.prototype.close = function() {\n  this.socket.close();\n};\n\n/**\n * Returns the specified number of characters from the response\n * buffer.\n * @param {number} len - The number of characters to return.\n * @returns {string} Characters sent by the server.\n */\nTWebSocketTransport.prototype.read = function(len) {\n  var avail = this.wpos - this.rpos;\n\n  if (avail === 0) {\n    return '';\n  }\n\n  var give = len;\n\n  if (avail < len) {\n    give = avail;\n  }\n\n  var ret = this.read_buf.substr(this.rpos, give);\n  this.rpos += give;\n\n  //clear buf when complete?\n  return ret;\n};\n\n/**\n * Returns the entire response buffer.\n * @returns {string} Characters sent by the server.\n */\nTWebSocketTransport.prototype.readAll = function() {\n  return this.recv_buf;\n};\n\n/**\n * Sets the send buffer to buf.\n * @param {string} buf - The buffer to send.\n */\nTWebSocketTransport.prototype.write = function(buf) {\n  this.send_buf = buf;\n};\n\n/**\n * Returns the send buffer.\n * @readonly\n * @returns {string} The send buffer.\n */\nTWebSocketTransport.prototype.getSendBuffer = function() {\n  return this.send_buf;\n};\n", "/*\n * Licensed to the Apache Software Foundation (ASF) under one\n * or more contributor license agreements. See the NOTICE file\n * distributed with this work for additional information\n * regarding copyright ownership. The ASF licenses this file\n * to you under the Apache License, Version 2.0 (the\n * \"License\"); you may not use this file except in compliance\n * with the License. You may obtain a copy of the License at\n *\n *   http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing,\n * software distributed under the License is distributed on an\n * \"AS IS\" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\n * KIND, either express or implied. See the License for the\n * specific language governing permissions and limitations\n * under the License.\n */\nexports.Thrift = require('./thrift');\n\nvar wsConnection = require('./ws_connection');\nexports.WSConnection = wsConnection.WSConnection;\nexports.createWSConnection = wsConnection.createWSConnection;\nexports.createWSClient = wsConnection.createWSClient;\n\nvar xhrConnection = require('./xhr_connection');\nexports.XHRConnection = xhrConnection.XHRConnection;\nexports.createXHRConnection = xhrConnection.createXHRConnection;\nexports.createXHRClient = xhrConnection.createXHRClient;\n\n\nexports.Int64 = require('node-int64');\nexports.Q = require('q');\n\nvar mpxProtocol = require('./multiplexed_protocol');\nexports.Multiplexer = mpxProtocol.Multiplexer;\n\n/*\n * Export transport and protocol so they can be used outside of a\n * cassandra/server context\n */\nexports.TBufferedTransport = require('./buffered_transport');\nexports.TFramedTransport = require('./framed_transport');\nexports.TWebSocketTransport = require('./ws_transport');\n\nexports.Protocol = require('./json_protocol');\nexports.TJSONProtocol = require('./json_protocol');\nexports.TBinaryProtocol = require('./binary_protocol');\nexports.TCompactProtocol = require('./compact_protocol');\n", "// Purpose: include this in your module to avoid\n// dependencies on micro modules like 'global' and 'is-browser';\n\n/* eslint-disable no-restricted-globals */\nconst globals = {\n  self: typeof self !== 'undefined' && self,\n  window: typeof window !== 'undefined' && window,\n  global: typeof global !== 'undefined' && global,\n  document: typeof document !== 'undefined' && document\n};\n\ntype obj = {[key: string]: any};\nconst self_: obj = globals.self || globals.window || globals.global || {};\nconst window_: obj = globals.window || globals.self || globals.global || {};\nconst global_: obj = globals.global || globals.self || globals.window || {};\nconst document_: obj = globals.document || {};\n\nexport {self_ as self, window_ as window, global_ as global, document_ as document};\n\n/** true if running in a browser */\nexport const isBrowser: boolean =\n  // @ts-ignore process does not exist on browser\n  Boolean(typeof process !== 'object' || String(process) !== '[object process]' || process.browser);\n\n/** true if running in a worker thread */\nexport const isWorker: boolean = typeof importScripts === 'function';\n\n// Extract node major version\nconst matches =\n  typeof process !== 'undefined' && process.version && /v([0-9]*)/.exec(process.version);\n/** Major Node version (as a number) */\nexport const nodeVersion: number = (matches && parseFloat(matches[1])) || 0;\n", "// NOTE - there is a copy of this function is both in core and loader-utils\n// core does not need all the utils in loader-utils, just this one.\n\n/**\n * Returns an array of Transferrable objects that can be used with postMessage\n * https://developer.mozilla.org/en-US/docs/Web/API/Worker/postMessage\n * @param object data to be sent via postMessage\n * @param recursive - not for application use\n * @param transfers - not for application use\n * @returns a transfer list that can be passed to postMessage\n */\nexport function getTransferList(\n  object: any,\n  recursive: boolean = true,\n  transfers?: Set<any>\n): Transferable[] {\n  // Make sure that items in the transfer list is unique\n  const transfersSet = transfers || new Set();\n\n  if (!object) {\n    // ignore\n  } else if (isTransferable(object)) {\n    transfersSet.add(object);\n  } else if (isTransferable(object.buffer)) {\n    // Typed array\n    transfersSet.add(object.buffer);\n  } else if (ArrayBuffer.isView(object)) {\n    // object is a TypeArray viewing into a SharedArrayBuffer (not transferable)\n    // Do not iterate through the content in this case\n  } else if (recursive && typeof object === 'object') {\n    for (const key in object) {\n      // Avoid perf hit - only go one level deep\n      getTransferList(object[key], recursive, transfersSet);\n    }\n  }\n\n  // If transfers is defined, is internal recursive call\n  // Otherwise it's called by the user\n  return transfers === undefined ? Array.from(transfersSet) : [];\n}\n\n// https://developer.mozilla.org/en-US/docs/Web/API/Transferable\nfunction isTransferable(object: unknown) {\n  if (!object) {\n    return false;\n  }\n  if (object instanceof ArrayBuffer) {\n    return true;\n  }\n  if (typeof MessagePort !== 'undefined' && object instanceof MessagePort) {\n    return true;\n  }\n  if (typeof ImageBitmap !== 'undefined' && object instanceof ImageBitmap) {\n    return true;\n  }\n  // @ts-ignore\n  if (typeof OffscreenCanvas !== 'undefined' && object instanceof OffscreenCanvas) {\n    return true;\n  }\n  return false;\n}\n\n/**\n * Recursively drop non serializable values like functions and regexps.\n * @param object\n */\nexport function getTransferListForWriter(object: object | null): object {\n  if (object === null) {\n    return {};\n  }\n  const clone = Object.assign({}, object);\n\n  Object.keys(clone).forEach((key) => {\n    // Typed Arrays and Arrays are passed with no change\n    if (\n      typeof object[key] === 'object' &&\n      !ArrayBuffer.isView(object[key]) &&\n      !(object[key] instanceof Array)\n    ) {\n      clone[key] = getTransferListForWriter(object[key]);\n    } else if (typeof clone[key] === 'function' || clone[key] instanceof RegExp) {\n      clone[key] = {};\n    } else {\n      clone[key] = object[key];\n    }\n  });\n\n  return clone;\n}\n", "import type {WorkerMessageData, WorkerMessageType, WorkerMessagePayload} from '../../types';\nimport {getTransferList} from '../worker-utils/get-transfer-list';\n\n/** Vile hack to defeat over-zealous bundlers from stripping out the require */\nfunction getParentPort() {\n  // const isNode = globalThis.process;\n  let parentPort;\n  try {\n    // prettier-ignore\n    eval('globalThis.parentPort = require(\\'worker_threads\\').parentPort'); // eslint-disable-line no-eval\n    parentPort = globalThis.parentPort;\n    // eslint-disable-next-line no-empty\n  } catch {}\n  return parentPort;\n}\n\nconst onMessageWrapperMap = new Map();\n\n/**\n * Type safe wrapper for worker code\n */\nexport default class WorkerBody {\n  /** Check that we are actually in a worker thread */\n  static inWorkerThread(): boolean {\n    return typeof self !== 'undefined' || Boolean(getParentPort());\n  }\n\n  /*\n   * (type: WorkerMessageType, payload: WorkerMessagePayload) => any\n   */\n  static set onmessage(onMessage: (type: WorkerMessageType, payload: WorkerMessagePayload) => any) {\n    function handleMessage(message) {\n      // Confusingly the message itself also has a 'type' field which is always set to 'message'\n      const parentPort = getParentPort();\n      const {type, payload} = parentPort ? message : message.data;\n      // if (!isKnownMessage(message)) {\n      //   return;\n      // }\n      onMessage(type, payload);\n    }\n\n    const parentPort = getParentPort();\n    if (parentPort) {\n      parentPort.on('message', handleMessage);\n      // if (message == 'exit') { parentPort.unref(); }\n      // eslint-disable-next-line\n      parentPort.on('exit', () => console.debug('Node worker closing'));\n    } else {\n      // eslint-disable-next-line no-restricted-globals\n      globalThis.onmessage = handleMessage;\n    }\n  }\n\n  static addEventListener(\n    onMessage: (type: WorkerMessageType, payload: WorkerMessagePayload) => any\n  ) {\n    let onMessageWrapper = onMessageWrapperMap.get(onMessage);\n\n    if (!onMessageWrapper) {\n      onMessageWrapper = (message: MessageEvent<any>) => {\n        if (!isKnownMessage(message)) {\n          return;\n        }\n\n        // Confusingly in the browser, the message itself also has a 'type' field which is always set to 'message'\n        const parentPort = getParentPort();\n        const {type, payload} = parentPort ? message : message.data;\n        onMessage(type, payload);\n      };\n    }\n\n    const parentPort = getParentPort();\n    if (parentPort) {\n      console.error('not implemented'); // eslint-disable-line\n    } else {\n      globalThis.addEventListener('message', onMessageWrapper);\n    }\n  }\n\n  static removeEventListener(\n    onMessage: (type: WorkerMessageType, payload: WorkerMessagePayload) => any\n  ) {\n    const onMessageWrapper = onMessageWrapperMap.get(onMessage);\n    onMessageWrapperMap.delete(onMessage);\n    const parentPort = getParentPort();\n    if (parentPort) {\n      console.error('not implemented'); // eslint-disable-line\n    } else {\n      globalThis.removeEventListener('message', onMessageWrapper);\n    }\n  }\n\n  /**\n   * Send a message from a worker to creating thread (main thread)\n   * @param type\n   * @param payload\n   */\n  static postMessage(type: WorkerMessageType, payload: WorkerMessagePayload): void {\n    const data: WorkerMessageData = {source: 'loaders.gl', type, payload};\n    // console.log('posting message', data);\n    const transferList = getTransferList(payload);\n\n    const parentPort = getParentPort();\n    if (parentPort) {\n      parentPort.postMessage(data, transferList);\n      // console.log('posted message', data);\n    } else {\n      // @ts-ignore\n      globalThis.postMessage(data, transferList);\n    }\n  }\n}\n\n// Filter out noise messages sent to workers\nfunction isKnownMessage(message: MessageEvent<any>) {\n  const {type, data} = message;\n  return (\n    type === 'message' &&\n    data &&\n    typeof data.source === 'string' &&\n    data.source.startsWith('loaders.gl')\n  );\n}\n", "/* eslint-disable no-restricted-globals */\nimport type {LoaderWithParser, LoaderOptions, LoaderContext} from '../../loader-types';\nimport {WorkerBody} from '@loaders.gl/worker-utils';\n// import {validateLoaderVersion} from './validate-loader-version';\n\nlet requestId = 0;\n\n/**\n * Set up a WebWorkerGlobalScope to talk with the main thread\n * @param loader\n */\nexport function createLoaderWorker(loader: LoaderWithParser) {\n  // Check that we are actually in a worker thread\n  if (!WorkerBody.inWorkerThread()) {\n    return;\n  }\n\n  WorkerBody.onmessage = async (type, payload) => {\n    switch (type) {\n      case 'process':\n        try {\n          // validateLoaderVersion(loader, data.source.split('@')[1]);\n\n          const {input, options = {}, context = {}} = payload;\n\n          const result = await parseData({\n            loader,\n            arrayBuffer: input,\n            options,\n            // @ts-expect-error fetch missing\n            context: {\n              ...context,\n              _parse: parseOnMainThread\n            }\n          });\n          WorkerBody.postMessage('done', {result});\n        } catch (error) {\n          const message = error instanceof Error ? error.message : '';\n          WorkerBody.postMessage('error', {error: message});\n        }\n        break;\n      default:\n    }\n  };\n}\n\nfunction parseOnMainThread(\n  arrayBuffer: ArrayBuffer,\n  loader: any,\n  options?: LoaderOptions,\n  context?: LoaderContext\n): Promise<void> {\n  return new Promise((resolve, reject) => {\n    const id = requestId++;\n\n    /**\n     */\n    const onMessage = (type, payload) => {\n      if (payload.id !== id) {\n        // not ours\n        return;\n      }\n\n      switch (type) {\n        case 'done':\n          WorkerBody.removeEventListener(onMessage);\n          resolve(payload.result);\n          break;\n\n        case 'error':\n          WorkerBody.removeEventListener(onMessage);\n          reject(payload.error);\n          break;\n\n        default:\n        // ignore\n      }\n    };\n\n    WorkerBody.addEventListener(onMessage);\n\n    // Ask the main thread to decode data\n    const payload = {id, input: arrayBuffer, options};\n    WorkerBody.postMessage('process', payload);\n  });\n}\n\n// TODO - Support byteOffset and byteLength (enabling parsing of embedded binaries without copies)\n// TODO - Why not support async loader.parse* funcs here?\n// TODO - Why not reuse a common function instead of reimplementing loader.parse* selection logic? Keeping loader small?\n// TODO - Lack of appropriate parser functions can be detected when we create worker, no need to wait until parse\nasync function parseData({\n  loader,\n  arrayBuffer,\n  options,\n  context\n}: {\n  loader: LoaderWithParser;\n  arrayBuffer: ArrayBuffer;\n  options: LoaderOptions;\n  context: LoaderContext;\n}) {\n  let data;\n  let parser;\n  if (loader.parseSync || loader.parse) {\n    data = arrayBuffer;\n    parser = loader.parseSync || loader.parse;\n  } else if (loader.parseTextSync) {\n    const textDecoder = new TextDecoder();\n    data = textDecoder.decode(arrayBuffer);\n    parser = loader.parseTextSync;\n  } else {\n    throw new Error(`Could not load data with ${loader.name} loader`);\n  }\n\n  // TODO - proper merge in of loader options...\n  options = {\n    ...options,\n    modules: (loader && loader.options && loader.options.modules) || {},\n    worker: false\n  };\n\n  return await parser(data, {...options}, context, loader);\n}\n", "import {TypedArray} from '../../types';\n\n/**\n * compare two binary arrays for equality\n * @param a\n * @param b\n * @param byteLength\n */\nexport function compareArrayBuffers(\n  arrayBuffer1: ArrayBuffer,\n  arrayBuffer2: ArrayBuffer,\n  byteLength?: number\n): boolean {\n  byteLength = byteLength || arrayBuffer1.byteLength;\n  if (arrayBuffer1.byteLength < byteLength || arrayBuffer2.byteLength < byteLength) {\n    return false;\n  }\n  const array1 = new Uint8Array(arrayBuffer1);\n  const array2 = new Uint8Array(arrayBuffer2);\n  for (let i = 0; i < array1.length; ++i) {\n    if (array1[i] !== array2[i]) {\n      return false;\n    }\n  }\n  return true;\n}\n\n/**\n * Concatenate a sequence of ArrayBuffers\n * @return A concatenated ArrayBuffer\n */\nexport function concatenateArrayBuffers(...sources: (ArrayBuffer | Uint8Array)[]): ArrayBuffer {\n  // Make sure all inputs are wrapped in typed arrays\n  const sourceArrays = sources.map((source2) =>\n    source2 instanceof ArrayBuffer ? new Uint8Array(source2) : source2\n  );\n\n  // Get length of all inputs\n  const byteLength = sourceArrays.reduce((length, typedArray) => length + typedArray.byteLength, 0);\n\n  // Allocate array with space for all inputs\n  const result = new Uint8Array(byteLength);\n\n  // Copy the subarrays\n  let offset = 0;\n  for (const sourceArray of sourceArrays) {\n    result.set(sourceArray, offset);\n    offset += sourceArray.byteLength;\n  }\n\n  // We work with ArrayBuffers, discard the typed array wrapper\n  return result.buffer;\n}\n\n/**\n * Concatenate arbitrary count of typed arrays\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Typed_arrays\n * @param - list of arrays. All arrays should be the same type\n * @return A concatenated TypedArray\n */\nexport function concatenateTypedArrays<T>(...typedArrays: T[]): T {\n  // @ts-ignore\n  const arrays = typedArrays as TypedArray[];\n  // @ts-ignore\n  const TypedArrayConstructor = (arrays && arrays.length > 1 && arrays[0].constructor) || null;\n  if (!TypedArrayConstructor) {\n    throw new Error(\n      '\"concatenateTypedArrays\" - incorrect quantity of arguments or arguments have incompatible data types'\n    );\n  }\n\n  const sumLength = arrays.reduce((acc, value) => acc + value.length, 0);\n  // @ts-ignore typescript does not like dynamic constructors\n  const result = new TypedArrayConstructor(sumLength);\n  let offset = 0;\n  for (const array of arrays) {\n    result.set(array, offset);\n    offset += array.length;\n  }\n  return result;\n}\n\n/**\n * Copy a view of an ArrayBuffer into new ArrayBuffer with byteOffset = 0\n * @param arrayBuffer\n * @param byteOffset\n * @param byteLength\n */\nexport function sliceArrayBuffer(\n  arrayBuffer: ArrayBuffer,\n  byteOffset: number,\n  byteLength?: number\n): ArrayBuffer {\n  const subArray =\n    byteLength !== undefined\n      ? new Uint8Array(arrayBuffer).subarray(byteOffset, byteOffset + byteLength)\n      : new Uint8Array(arrayBuffer).subarray(byteOffset);\n  const arrayCopy = new Uint8Array(subArray);\n  return arrayCopy.buffer;\n}\n", "import {concatenateArrayBuffers} from '../binary-utils/array-buffer-utils';\n\n// GENERAL UTILITIES\n\n/**\n * Iterate over async iterator, without resetting iterator if end is not reached\n * - forEach intentionally does not reset iterator if exiting loop prematurely\n *   so that iteration can continue in a second loop\n * - It is recommended to use a standard for-await as last loop to ensure\n *   iterator gets properly reset\n *\n * TODO - optimize using sync iteration if argument is an Iterable?\n *\n * @param iterator\n * @param visitor\n */\nexport async function forEach(iterator, visitor) {\n  // eslint-disable-next-line\n  while (true) {\n    const {done, value} = await iterator.next();\n    if (done) {\n      iterator.return();\n      return;\n    }\n    const cancel = visitor(value);\n    if (cancel) {\n      return;\n    }\n  }\n}\n\n// Breaking big data into iterable chunks, concatenating iterable chunks into big data objects\n\n/**\n * Concatenates all data chunks yielded by an (async) iterator\n * This function can e.g. be used to enable atomic parsers to work on (async) iterator inputs\n */\n\nexport async function concatenateArrayBuffersAsync(\n  asyncIterator: AsyncIterable<ArrayBuffer> | Iterable<ArrayBuffer>\n): Promise<ArrayBuffer> {\n  const arrayBuffers: ArrayBuffer[] = [];\n  for await (const chunk of asyncIterator) {\n    arrayBuffers.push(chunk);\n  }\n  return concatenateArrayBuffers(...arrayBuffers);\n}\n\nexport async function concatenateStringsAsync(\n  asyncIterator: AsyncIterable<string> | Iterable<string>\n): Promise<string> {\n  const strings: string[] = [];\n  for await (const chunk of asyncIterator) {\n    strings.push(chunk);\n  }\n  return strings.join('');\n}\n", "// loaders.gl, MIT license\n\n// Isolates Buffer references to ensure they are only bundled under Node.js (avoids big webpack polyfill)\n// this file is selected by the package.json \"browser\" field).\n\n/**\n * Convert Buffer to ArrayBuffer\n * Converts Node.js `Buffer` to `ArrayBuffer` (without triggering bundler to include Buffer polyfill on browser)\n * @todo better data type\n */\nexport function toArrayBuffer(buffer) {\n  return buffer;\n}\n\n/**\n * Convert (copy) ArrayBuffer to Buffer\n */\nexport function toBuffer(binaryData: ArrayBuffer | ArrayBuffer | Buffer): Buffer {\n  throw new Error('Buffer not supported in browser');\n}\n", "// loaders.gl, MIT license\n\nimport * as node from '../node/buffer';\n\n/**\n * Check for Node.js `Buffer` (without triggering bundler to include Buffer polyfill on browser)\n */\nexport function isBuffer(value: any): boolean {\n  return value && typeof value === 'object' && value.isBuffer;\n}\n\n/**\n * Converts to Node.js `Buffer` (without triggering bundler to include Buffer polyfill on browser)\n * @todo better data type\n */\nexport function toBuffer(data: any): Buffer {\n  return node.toBuffer ? node.toBuffer(data) : data;\n}\n\n/**\n * Convert an object to an array buffer\n */\nexport function toArrayBuffer(data: unknown): ArrayBuffer {\n  // Note: Should be called first, Buffers can trigger other detections below\n  if (isBuffer(data)) {\n    return node.toArrayBuffer(data);\n  }\n\n  if (data instanceof ArrayBuffer) {\n    return data;\n  }\n\n  // Careful - Node Buffers look like Uint8Arrays (keep after isBuffer)\n  if (ArrayBuffer.isView(data)) {\n    if (data.byteOffset === 0 && data.byteLength === data.buffer.byteLength) {\n      return data.buffer;\n    }\n    return data.buffer.slice(data.byteOffset, data.byteOffset + data.byteLength);\n  }\n\n  if (typeof data === 'string') {\n    const text = data;\n    const uint8Array = new TextEncoder().encode(text);\n    return uint8Array.buffer;\n  }\n\n  // HACK to support Blob polyfill\n  if (data && typeof data === 'object' && (data as any)._toArrayBuffer) {\n    return (data as any)._toArrayBuffer();\n  }\n\n  throw new Error('toArrayBuffer');\n}\n", "// @loaders.gl, MIT license\n\n// type Parameter1<T extends (arg1: any, ...args: unknown[]) => unknown> = T extends (\n//   arg1: infer P,\n//   ...args: unknown[]\n// ) => unknown\n//   ? P\n//   : never;\n\n//   type Parameter2<T extends (arg1: unknown, arg2: any, ...args: unknown[]) => unknown> = T extends (\n//   arg1: unknown,\n//   arg2: infer P,\n//   ...args: unknown[]\n// ) => unknown\n//   ? P\n//   : never;\n\n// type CallbackParameter2<\n//   T extends (arg: unknown, cb: (error: any, value: any) => void) => unknown\n// > = T extends (arg: unknown, cb: (error: any, value: infer P) => void) => unknown ? P : never;\n\n// type CallbackParameter3<\n//   T extends (arg: unknown, arg2: unknown, cb: (error: any, value: any) => void) => unknown\n// > = T extends (arg: unknown, arg2: unknown, cb: (error: any, value: infer P) => void) => unknown\n//   ? P\n//   : never;\n\n// /** Extract the parameters of a function type in a tuple */\n// export type Promisified<F extends (arg1, cb: (error: unknown, value: any) => void) => any> = (\n//   arg1: Parameter1<F>\n// ) => Promise<CallbackParameter2<F>>;\n// /** Extract the parameters of a function type in a tuple */\n// export type Promisified2<F extends (arg1, arg2, cb: (error: unknown, value: any) => void) => any> = (\n//   arg1: Parameter1<F>,\n//   arg2: Parameter2<F>\n// ) => Promise<CallbackParameter3<F>>;\n\n/** Wrapper for Node.js promisify */\ntype Callback<A> = (error: unknown, args: A) => void;\n\n/**\n * Typesafe promisify implementation\n * @link https://dev.to/_gdelgado/implement-a-type-safe-version-of-node-s-promisify-in-7-lines-of-code-in-typescript-2j34\n * @param fn\n * @returns\n */\nexport function promisify1<T, A>(fn: (args: T, cb: Callback<A>) => void): (args: T) => Promise<A> {\n  return (args: T) =>\n    new Promise((resolve, reject) =>\n      fn(args, (error, callbackArgs) => (error ? reject(error) : resolve(callbackArgs)))\n    );\n}\n\nexport function promisify2<T1, T2, A>(\n  fn: (arg1: T1, arg2: T2, cb: Callback<A>) => void\n): (arg1: T1, arg2: T2) => Promise<A> {\n  return (arg1: T1, arg2: T2) =>\n    new Promise((resolve, reject) =>\n      fn(arg1, arg2, (error, callbackArgs) => (error ? reject(error) : resolve(callbackArgs)))\n    );\n}\n\nexport function promisify3<T1, T2, T3, A>(\n  fn: (arg1: T1, arg2: T2, arg3: T3, cb: Callback<A>) => void\n): (arg1: T1, arg2: T2, arg3: T3) => Promise<A> {\n  return (arg1: T1, arg2: T2, arg3: T3) =>\n    new Promise((resolve, reject) =>\n      fn(arg1, arg2, arg3, (error, callbackArgs) => (error ? reject(error) : resolve(callbackArgs)))\n    );\n}\n", "// loaders.gl, MIT license\n\nexport type ReadableFile = {\n  read: (position: number, length: number) => Promise<Buffer>;\n  close: () => Promise<void>;\n  /** Length of file in bytes */\n  size: number;\n};\n\n/** Helper function to create an envelope reader for a binary memory input */\nexport function makeReadableFile(data: Blob | ArrayBuffer): ReadableFile {\n  if (data instanceof ArrayBuffer) {\n    const arrayBuffer: ArrayBuffer = data;\n    return {\n      read: async (start: number, length: number) => Buffer.from(data, start, length),\n      close: async () => {},\n      size: arrayBuffer.byteLength\n    };\n  }\n\n  const blob: Blob = data;\n  return {\n    read: async (start: number, length: number) => {\n      const arrayBuffer = await blob.slice(start, start + length).arrayBuffer();\n      return Buffer.from(arrayBuffer);\n    },\n    close: async () => {},\n    size: blob.size\n  };\n}\n", "// loaders.gl, MIT license\n// This file is forked from https://github.com/feross/buffer under MIT license\n// The code has primarily been converted to TypeScript.\n\n/* !\n * The buffer module from node.js, for the browser.\n * @author   Feross Aboukhadijeh <https://feross.org>\n * @license  MIT\n * https://github.com/feross/buffer/blob/master/AUTHORS.md\n */\n\n/**\n * The decision to include this polyfill in loaders.gl may seem controversial.\n * \n * It is based on the following reasoning:\n * - The Buffer API is used in the parquetjs library and likely other Node.js \n *   libraries we will use in the future.\n * - While the goal is to convert code from Buffer to ArrayBuffer, the Thrift \n *   code in Parquet may be autogenerated.\n * - Bundlers often require a polyfill to be included, this extra step is not \n *   a great experience for loaders.gl users.\n * - The forked buffer polyfill module had old and generated some type errors.\n */\n\n/* eslint-disable */ // no-proto, max-statements, max-depth, complexity, no-continue, prefer-spread, no-constant-condition, consistent-return */\n\n// @ts-nocheck - this references don't work well in prototype assignment\n\nimport base64 from 'base64-js';\nimport ieee754 from 'ieee754';\n\nexport const kMaxLength = 0x7fffffff;\nexport const INSPECT_MAX_BYTES = 50;\n\ntype BufferEncoding = string;\n\n// const customInspectSymbol =\n//   typeof Symbol === 'function' && typeof Symbol['for'] === 'function' // eslint-disable-line dot-notation\n//     ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n//     : null;\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\nexport class Buffer extends Uint8Array {\n  static poolSize = 8192; // not used by this implementation\n\n  // length: number; inherited\n\n  get parent() {\n    if (!Buffer.isBuffer(this)) return undefined;\n    return this.buffer;\n  }\n\n  get offset() {\n    if (!Buffer.isBuffer(this)) return undefined;\n    return this.byteOffset;\n  }\n\n  /** This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n   * to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n   * reliably in a browserify context because there could be multiple different\n   * copies of the 'buffer' package in use. This method works even for Buffer\n   * instances that were created from another copy of the `buffer` package.\n   * @see: https://github.com/feross/buffer/issues/154\n   */\n  _isBuffer = true;\n\n  /**\n   * Allocates a new buffer containing the given {str}.\n   *\n   * @param str String to store in buffer.\n   * @param encoding encoding to use, optional.  Default is 'utf8'\n   */\n  constructor(str: string, encoding?: string);\n  /**\n   * Allocates a new buffer of {size} octets.\n   *\n   * @param size count of octets to allocate.\n   */\n  constructor(size: number);\n  /**\n   * Allocates a new buffer containing the given {array} of octets.\n   *\n   * @param array The octets to store.\n   */\n  constructor(array: Uint8Array);\n  /**\n   * Produces a Buffer backed by the same allocated memory as\n   * the given {ArrayBuffer}.\n   *\n   *\n   * @param arrayBuffer The ArrayBuffer with which to share memory.\n   */\n  constructor(arrayBuffer: ArrayBuffer);\n  /**\n   * Allocates a new buffer containing the given {array} of octets.\n   *\n   * @param array The octets to store.\n   */\n  constructor(array: any[]);\n  /**\n   * Copies the passed {buffer} data onto a new {Buffer} instance.\n   *\n   * @param buffer The buffer to copy.\n   */\n  constructor(buffer: Buffer);\n\n  constructor(arg, encodingOrOffset?, length?: number) {\n    if (typeof arg !== 'number') {\n      return Buffer.from(arg, encodingOrOffset, length);\n    }\n\n    // Basic case, just a length\n    const size = arg;\n    if (size > kMaxLength) {\n      throw new RangeError(`The value \"${size}\" is invalid for option \"size\"`);\n    }\n    if (typeof encodingOrOffset === 'string') {\n      throw new TypeError('The \"string\" argument must be of type string. Received type number');\n    }\n    super(size < 0 ? 0 : checked(size) | 0);\n    return;\n  }\n\n  /**\n   * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n   * if value is a number.\n   * Buffer.from(str[, encoding])\n   * Buffer.from(array)\n   * Buffer.from(buffer)\n   * Buffer.from(arrayBuffer[, byteOffset[, length]])\n   **/\n\n  /**\n   * Allocates a new Buffer using an {array} of octets.\n   *\n   * @param array\n   */\n  static from(array: any[]): Buffer;\n  /**\n   * When passed a reference to the .buffer property of a TypedArray instance,\n   * the newly created Buffer will share the same allocated memory as the TypedArray.\n   * The optional {byteOffset} and {length} arguments specify a memory range\n   * within the {arrayBuffer} that will be shared by the Buffer.\n   *\n   * @param arrayBuffer The .buffer property of a TypedArray or a new ArrayBuffer()\n   * @param byteOffset\n   * @param length\n   */\n  static from(arrayBuffer: ArrayBuffer, byteOffset?: number, length?: number): Buffer;\n  /**\n   * Copies the passed {buffer} data onto a new Buffer instance.\n   *\n   * @param buffer\n   */\n  static from(buffer: Buffer | Uint8Array): Buffer;\n  /**\n   * Creates a new Buffer containing the given JavaScript string {str}.\n   * If provided, the {encoding} parameter identifies the character encoding.\n   * If not provided, {encoding} defaults to 'utf8'.\n   *\n   * @param str\n   */\n  static from(str: string, encoding?: string): Buffer;\n\n  static from(value, encodingOrOffset, length) {\n    if (typeof value === 'string') {\n      return fromString(value, encodingOrOffset);\n    }\n\n    if (ArrayBuffer.isView(value)) {\n      return fromArrayView(value);\n    }\n\n    if (value == null) {\n      throw new TypeError(\n        `${\n          'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n          'or Array-like Object. Received type '\n        }${typeof value}`\n      );\n    }\n\n    if (isInstance(value, ArrayBuffer) || (value && isInstance(value.buffer, ArrayBuffer))) {\n      return fromArrayBuffer(value, encodingOrOffset, length);\n    }\n\n    if (\n      typeof SharedArrayBuffer !== 'undefined' &&\n      (isInstance(value, SharedArrayBuffer) ||\n        (value && isInstance(value.buffer, SharedArrayBuffer)))\n    ) {\n      return fromArrayBuffer(value, encodingOrOffset, length);\n    }\n\n    if (typeof value === 'number') {\n      throw new TypeError('The \"value\" argument must not be of type number. Received type number');\n    }\n\n    const valueOf = value.valueOf && value.valueOf();\n    if (valueOf != null && valueOf !== value) {\n      return Buffer.from(valueOf, encodingOrOffset, length);\n    }\n\n    const b = fromObject(value);\n    if (b) return b;\n\n    if (\n      typeof Symbol !== 'undefined' &&\n      Symbol.toPrimitive != null &&\n      typeof value[Symbol.toPrimitive] === 'function'\n    ) {\n      return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length);\n    }\n\n    throw new TypeError(\n      `${\n        'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n        'or Array-like Object. Received type '\n      }${typeof value}`\n    );\n  }\n\n  /**\n   * Returns true if {obj} is a Buffer\n   *\n   * @param obj object to test.\n   */\n  static isBuffer(b: any): obj is Buffer {\n    return b != null && b._isBuffer === true && b !== Buffer.prototype; // so Buffer.isBuffer(Buffer.prototype) will be false\n  }\n\n  /**\n   * The same as buf1.compare(buf2).\n   */\n  static compare(a: Uint8Array | Buffer, b: Uint8Array | Buffer): number {\n    if (!Buffer.isBuffer(a) && isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength);\n    if (!Buffer.isBuffer(b) && isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength);\n    if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n      throw new TypeError('The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array');\n    }\n\n    if (a === b) return 0;\n\n    let x = a.length;\n    let y = b.length;\n\n    for (let i = 0, len = Math.min(x, y); i < len; ++i) {\n      if (a[i] !== b[i]) {\n        x = a[i];\n        y = b[i];\n        break;\n      }\n    }\n\n    if (x < y) return -1;\n    if (y < x) return 1;\n    return 0;\n  }\n\n  /**\n   * Returns true if {encoding} is a valid encoding argument.\n   * Valid string encodings in Node 0.12: 'ascii'|'utf8'|'utf16le'|'ucs2'(alias of 'utf16le')|'base64'|'binary'(deprecated)|'hex'\n   *\n   * @param encoding string to test.\n   */\n  static isEncoding(encoding: string): boolean {\n    switch (String(encoding).toLowerCase()) {\n      case 'hex':\n      case 'utf8':\n      case 'utf-8':\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n      case 'base64':\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return true;\n      default:\n        return false;\n    }\n  }\n\n  /**\n   * Returns a buffer which is the result of concatenating all the buffers in the list together.\n   *\n   * If the list has no items, or if the totalLength is 0, then it returns a zero-length buffer.\n   * If the list has exactly one item, then the first item of the list is returned.\n   * If the list has more than one item, then a new Buffer is created.\n   *\n   * @param list An array of Buffer objects to concatenate\n   * @param totalLength Total length of the buffers when concatenated.\n   *   If totalLength is not provided, it is read from the buffers in the list. However, this adds an additional loop to the function, so it is faster to provide the length explicitly.\n   */\n  static concat(list: (Uint8Array | Buffer)[], length?: number): Buffer {\n    if (!Array.isArray(list)) {\n      throw new TypeError('\"list\" argument must be an Array of Buffers');\n    }\n\n    if (list.length === 0) {\n      return Buffer.alloc(0);\n    }\n\n    let i;\n    if (length === undefined) {\n      length = 0;\n      for (i = 0; i < list.length; ++i) {\n        length += list[i].length;\n      }\n    }\n\n    const buffer = Buffer.allocUnsafe(length);\n    let pos = 0;\n    for (i = 0; i < list.length; ++i) {\n      let buf = list[i];\n      if (isInstance(buf, Uint8Array)) {\n        if (pos + buf.length > buffer.length) {\n          if (!Buffer.isBuffer(buf)) {\n            buf = Buffer.from(buf.buffer, buf.byteOffset, buf.byteLength);\n          }\n          buf.copy(buffer, pos);\n        } else {\n          Uint8Array.prototype.set.call(buffer, buf, pos);\n        }\n      } else if (!Buffer.isBuffer(buf)) {\n        throw new TypeError('\"list\" argument must be an Array of Buffers');\n      } else {\n        buf.copy(buffer, pos);\n      }\n      pos += buf.length;\n    }\n    return buffer;\n  }\n\n  /**\n   * Allocates a new buffer of {size} octets.\n   *\n   * @param size count of octets to allocate.\n   * @param fill if specified, buffer will be initialized by calling buf.fill(fill).\n   *    If parameter is omitted, buffer will be filled with zeros.\n   * @param encoding encoding used for call to buf.fill while initializing\n   */\n  static alloc(size: number, fill?: string | Buffer | number, encoding?: string): Buffer {\n    return alloc(size, fill, encoding);\n  }\n\n  /**\n   * Allocates a new buffer of {size} octets, leaving memory not initialized, so the contents\n   * of the newly created Buffer are unknown and may contain sensitive data.\n   *\n   * @param size count of octets to allocate\n   */\n  static allocUnsafe(size: number): Buffer {\n    assertSize(size);\n    return new Buffer(size);\n  }\n\n  /**\n   * Allocates a new non-pooled buffer of {size} octets, leaving memory not initialized, so the contents\n   * of the newly created Buffer are unknown and may contain sensitive data.\n   *\n   * @param size count of octets to allocate\n   */\n  static allocUnsafeSlow(size: number): Buffer {\n    return allocUnsafe(size);\n  }\n\n  includes(val: string | number | Buffer, byteOffset?: number, encoding?: string): boolean {\n    return this.indexOf(val, byteOffset, encoding) !== -1;\n  }\n\n  indexOf(val: string | number | Buffer, byteOffset?: number, encoding?: string): number {\n    return bidirectionalIndexOf(this, val, byteOffset, encoding, true);\n  }\n\n  lastIndexOf(val: string | number | Buffer, byteOffset?: number, encoding?: string): number {\n    return bidirectionalIndexOf(this, val, byteOffset, encoding, false);\n  }\n\n  readInt8(offset: number, noAssert?: boolean): number {\n    offset = offset >>> 0;\n    if (!noAssert) checkOffset(offset, 1, this.length);\n    if (!(this[offset] & 0x80)) return this[offset];\n    return (0xff - this[offset] + 1) * -1;\n  }\n\n  readInt16LE(offset: number, noAssert?: boolean): number {\n    offset = offset >>> 0;\n    if (!noAssert) checkOffset(offset, 2, this.length);\n    const val = this[offset] | (this[offset + 1] << 8);\n    return val & 0x8000 ? val | 0xffff0000 : val;\n  }\n\n  readInt16BE(offset: number, noAssert?: boolean): number {\n    offset = offset >>> 0;\n    if (!noAssert) checkOffset(offset, 2, this.length);\n    const val = this[offset + 1] | (this[offset] << 8);\n    return val & 0x8000 ? val | 0xffff0000 : val;\n  }\n\n  readInt32LE(offset: number, noAssert?: boolean): number {\n    offset = offset >>> 0;\n    if (!noAssert) checkOffset(offset, 4, this.length);\n\n    return (\n      this[offset] | (this[offset + 1] << 8) | (this[offset + 2] << 16) | (this[offset + 3] << 24)\n    );\n  }\n\n  readInt32BE(offset: number, noAssert?: boolean): number {\n    offset = offset >>> 0;\n    if (!noAssert) checkOffset(offset, 4, this.length);\n\n    return (\n      (this[offset] << 24) | (this[offset + 1] << 16) | (this[offset + 2] << 8) | this[offset + 3]\n    );\n  }\n\n  readIntBE(offset: number, byteLength: number, noAssert?: boolean): number {\n    offset = offset >>> 0;\n    byteLength = byteLength >>> 0;\n    if (!noAssert) checkOffset(offset, byteLength, this.length);\n\n    let i = byteLength;\n    let mul = 1;\n    let val = this[offset + --i];\n    while (i > 0 && (mul *= 0x100)) {\n      val += this[offset + --i] * mul;\n    }\n    mul *= 0x80;\n\n    if (val >= mul) val -= Math.pow(2, 8 * byteLength);\n\n    return val;\n  }\n\n  readIntLE(offset: number, byteLength: number, noAssert?: boolean): number {\n    offset = offset >>> 0;\n    byteLength = byteLength >>> 0;\n    if (!noAssert) checkOffset(offset, byteLength, this.length);\n\n    let val = this[offset];\n    let mul = 1;\n    let i = 0;\n    while (++i < byteLength && (mul *= 0x100)) {\n      val += this[offset + i] * mul;\n    }\n    mul *= 0x80;\n\n    if (val >= mul) val -= Math.pow(2, 8 * byteLength);\n\n    return val;\n  }\n\n  readBigInt64LE(offset: number): BigInt {\n    offset = offset >>> 0;\n    validateNumber(offset, 'offset');\n    const first = this[offset];\n    const last = this[offset + 7];\n    if (first === undefined || last === undefined) {\n      boundsError(offset, this.length - 8);\n    }\n\n    const val =\n      this[offset + 4] + this[offset + 5] * 2 ** 8 + this[offset + 6] * 2 ** 16 + (last << 24); // Overflow\n\n    return (\n      (BigInt(val) << BigInt(32)) +\n      BigInt(first + this[++offset] * 2 ** 8 + this[++offset] * 2 ** 16 + this[++offset] * 2 ** 24)\n    );\n  }\n\n  readBigInt64BE(offset: number): BigInt {\n    offset = offset >>> 0;\n    validateNumber(offset, 'offset');\n    const first = this[offset];\n    const last = this[offset + 7];\n    if (first === undefined || last === undefined) {\n      boundsError(offset, this.length - 8);\n    }\n\n    const val =\n      (first << 24) + // Overflow\n      this[++offset] * 2 ** 16 +\n      this[++offset] * 2 ** 8 +\n      this[++offset];\n\n    return (\n      (BigInt(val) << BigInt(32)) +\n      BigInt(this[++offset] * 2 ** 24 + this[++offset] * 2 ** 16 + this[++offset] * 2 ** 8 + last)\n    );\n  }\n\n  readUInt8(offset: number, noAssert?: boolean): number {\n    offset = offset >>> 0;\n    if (!noAssert) checkOffset(offset, 1, this.length);\n    return this[offset];\n  }\n\n  readUInt16LE(offset: number, noAssert?: boolean): number {\n    offset = offset >>> 0;\n    if (!noAssert) checkOffset(offset, 2, this.length);\n    return this[offset] | (this[offset + 1] << 8);\n  }\n\n  readUInt16BE(offset: number, noAssert?: boolean): number {\n    offset = offset >>> 0;\n    if (!noAssert) checkOffset(offset, 2, this.length);\n    return (this[offset] << 8) | this[offset + 1];\n  }\n\n  readUInt32LE(offset: number, noAssert?: boolean): number {\n    offset = offset >>> 0;\n    if (!noAssert) checkOffset(offset, 4, this.length);\n\n    return (\n      (this[offset] | (this[offset + 1] << 8) | (this[offset + 2] << 16)) +\n      this[offset + 3] * 0x1000000\n    );\n  }\n\n  readUInt32BE(offset: number, noAssert?: boolean): number {\n    offset = offset >>> 0;\n    if (!noAssert) checkOffset(offset, 4, this.length);\n\n    return (\n      this[offset] * 0x1000000 +\n      ((this[offset + 1] << 16) | (this[offset + 2] << 8) | this[offset + 3])\n    );\n  }\n\n  readUIntLE(offset, byteLength, noAssert) {\n    offset = offset >>> 0;\n    byteLength = byteLength >>> 0;\n    if (!noAssert) checkOffset(offset, byteLength, this.length);\n\n    let val = this[offset];\n    let mul = 1;\n    let i = 0;\n    while (++i < byteLength && (mul *= 0x100)) {\n      val += this[offset + i] * mul;\n    }\n\n    return val;\n  }\n\n  readUIntBE(offset, byteLength, noAssert) {\n    offset = offset >>> 0;\n    byteLength = byteLength >>> 0;\n    if (!noAssert) {\n      checkOffset(offset, byteLength, this.length);\n    }\n\n    let val = this[offset + --byteLength];\n    let mul = 1;\n    while (byteLength > 0 && (mul *= 0x100)) {\n      val += this[offset + --byteLength] * mul;\n    }\n\n    return val;\n  }\n\n  readBigUInt64LE(offset: number): BigInt {\n    offset = offset >>> 0;\n    validateNumber(offset, 'offset');\n    const first = this[offset];\n    const last = this[offset + 7];\n    if (first === undefined || last === undefined) {\n      boundsError(offset, this.length - 8);\n    }\n\n    const lo =\n      first + this[++offset] * 2 ** 8 + this[++offset] * 2 ** 16 + this[++offset] * 2 ** 24;\n\n    const hi = this[++offset] + this[++offset] * 2 ** 8 + this[++offset] * 2 ** 16 + last * 2 ** 24;\n\n    return BigInt(lo) + (BigInt(hi) << BigInt(32));\n  }\n\n  readBigUInt64BE(offset: number): BigInt {\n    offset = offset >>> 0;\n    validateNumber(offset, 'offset');\n    const first = this[offset];\n    const last = this[offset + 7];\n    if (first === undefined || last === undefined) {\n      boundsError(offset, this.length - 8);\n    }\n\n    const hi =\n      first * 2 ** 24 + this[++offset] * 2 ** 16 + this[++offset] * 2 ** 8 + this[++offset];\n\n    const lo = this[++offset] * 2 ** 24 + this[++offset] * 2 ** 16 + this[++offset] * 2 ** 8 + last;\n\n    return (BigInt(hi) << BigInt(32)) + BigInt(lo);\n  }\n\n  readFloatLE(offset: number, noAssert?: boolean): number {\n    offset = offset >>> 0;\n    if (!noAssert) checkOffset(offset, 4, this.length);\n    return ieee754.read(this, offset, true, 23, 4);\n  }\n\n  readFloatBE(offset: number, noAssert?: boolean): number {\n    offset = offset >>> 0;\n    if (!noAssert) checkOffset(offset, 4, this.length);\n    return ieee754.read(this, offset, false, 23, 4);\n  }\n\n  readDoubleLE(offset: number, noAssert?: boolean): number {\n    offset = offset >>> 0;\n    if (!noAssert) checkOffset(offset, 8, this.length);\n    return ieee754.read(this, offset, true, 52, 8);\n  }\n\n  readDoubleBE(offset: number, noAssert?: boolean): number {\n    offset = offset >>> 0;\n    if (!noAssert) checkOffset(offset, 8, this.length);\n    return ieee754.read(this, offset, false, 52, 8);\n  }\n\n  writeUInt8(value: number, offset: number, noAssert?: boolean): number {\n    value = Number(value);\n    offset = offset >>> 0;\n    if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0);\n    this[offset] = value & 0xff;\n    return offset + 1;\n  }\n\n  writeUInt16LE(value: number, offset: number, noAssert?: boolean): number {\n    value = Number(value);\n    offset = offset >>> 0;\n    if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);\n    this[offset] = value & 0xff;\n    this[offset + 1] = value >>> 8;\n    return offset + 2;\n  }\n\n  writeUInt16BE(value: number, offset: number, noAssert?: boolean): number {\n    value = Number(value);\n    offset = offset >>> 0;\n    if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0);\n    this[offset] = value >>> 8;\n    this[offset + 1] = value & 0xff;\n    return offset + 2;\n  }\n\n  writeUInt32LE(value: number, offset: number, noAssert?: boolean): number {\n    value = Number(value);\n    offset = offset >>> 0;\n    if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);\n    this[offset + 3] = value >>> 24;\n    this[offset + 2] = value >>> 16;\n    this[offset + 1] = value >>> 8;\n    this[offset] = value & 0xff;\n    return offset + 4;\n  }\n\n  writeUInt32BE(value: number, offset: number, noAssert?: boolean): number {\n    value = Number(value);\n    offset = offset >>> 0;\n    if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0);\n    this[offset] = value >>> 24;\n    this[offset + 1] = value >>> 16;\n    this[offset + 2] = value >>> 8;\n    this[offset + 3] = value & 0xff;\n    return offset + 4;\n  }\n\n  writeUIntLE(value, offset, byteLength, noAssert) {\n    value = Number(value);\n    offset = offset >>> 0;\n    byteLength = byteLength >>> 0;\n    if (!noAssert) {\n      const maxBytes = Math.pow(2, 8 * byteLength) - 1;\n      checkInt(this, value, offset, byteLength, maxBytes, 0);\n    }\n\n    let mul = 1;\n    let i = 0;\n    this[offset] = value & 0xff;\n    while (++i < byteLength && (mul *= 0x100)) {\n      this[offset + i] = (value / mul) & 0xff;\n    }\n\n    return offset + byteLength;\n  }\n\n  writeUIntBE(value, offset, byteLength, noAssert) {\n    value = Number(value);\n    offset = offset >>> 0;\n    byteLength = byteLength >>> 0;\n    if (!noAssert) {\n      const maxBytes = Math.pow(2, 8 * byteLength) - 1;\n      checkInt(this, value, offset, byteLength, maxBytes, 0);\n    }\n\n    let i = byteLength - 1;\n    let mul = 1;\n    this[offset + i] = value & 0xff;\n    while (--i >= 0 && (mul *= 0x100)) {\n      this[offset + i] = (value / mul) & 0xff;\n    }\n\n    return offset + byteLength;\n  }\n\n  writeBigUInt64LE(value: number, offset: number = 0): BigInt {\n    return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'));\n  }\n\n  writeBigUInt64BE(value: number, offset: number = 0): BigInt {\n    return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'));\n  }\n\n  writeIntLE(value, offset, byteLength, noAssert) {\n    value = Number(value);\n    offset = offset >>> 0;\n    if (!noAssert) {\n      const limit = Math.pow(2, 8 * byteLength - 1);\n\n      checkInt(this, value, offset, byteLength, limit - 1, -limit);\n    }\n\n    let i = 0;\n    let mul = 1;\n    let sub = 0;\n    this[offset] = value & 0xff;\n    while (++i < byteLength && (mul *= 0x100)) {\n      if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n        sub = 1;\n      }\n      this[offset + i] = (((value / mul) >> 0) - sub) & 0xff;\n    }\n\n    return offset + byteLength;\n  }\n\n  writeIntBE(value, offset, byteLength, noAssert) {\n    value = Number(value);\n    offset = offset >>> 0;\n    if (!noAssert) {\n      const limit = Math.pow(2, 8 * byteLength - 1);\n\n      checkInt(this, value, offset, byteLength, limit - 1, -limit);\n    }\n\n    let i = byteLength - 1;\n    let mul = 1;\n    let sub = 0;\n    this[offset + i] = value & 0xff;\n    while (--i >= 0 && (mul *= 0x100)) {\n      if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n        sub = 1;\n      }\n      this[offset + i] = (((value / mul) >> 0) - sub) & 0xff;\n    }\n\n    return offset + byteLength;\n  }\n\n  writeInt8(value: number, offset: number, noAssert?: boolean): number {\n    value = Number(value);\n    offset = offset >>> 0;\n    if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80);\n    if (value < 0) value = 0xff + value + 1;\n    this[offset] = value & 0xff;\n    return offset + 1;\n  }\n\n  writeInt16LE(value: number, offset: number, noAssert?: boolean): number {\n    value = Number(value);\n    offset = offset >>> 0;\n    if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000);\n    this[offset] = value & 0xff;\n    this[offset + 1] = value >>> 8;\n    return offset + 2;\n  }\n\n  writeInt16BE(value: number, offset: number, noAssert?: boolean): number {\n    value = Number(value);\n    offset = offset >>> 0;\n    if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000);\n    this[offset] = value >>> 8;\n    this[offset + 1] = value & 0xff;\n    return offset + 2;\n  }\n\n  writeInt32LE(value: number, offset: number, noAssert?: boolean): number {\n    value = Number(value);\n    offset = offset >>> 0;\n    if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000);\n    this[offset] = value & 0xff;\n    this[offset + 1] = value >>> 8;\n    this[offset + 2] = value >>> 16;\n    this[offset + 3] = value >>> 24;\n    return offset + 4;\n  }\n\n  writeInt32BE(value: number, offset: number, noAssert?: boolean): number {\n    value = Number(value);\n    offset = offset >>> 0;\n    if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000);\n    if (value < 0) value = 0xffffffff + value + 1;\n    this[offset] = value >>> 24;\n    this[offset + 1] = value >>> 16;\n    this[offset + 2] = value >>> 8;\n    this[offset + 3] = value & 0xff;\n    return offset + 4;\n  }\n\n  writeBigInt64LE(value: number, offset: number = 0): BigInt {\n    return wrtBigUInt64LE(\n      this,\n      value,\n      offset,\n      -BigInt('0x8000000000000000'),\n      BigInt('0x7fffffffffffffff')\n    );\n  }\n\n  writeBigInt64BE(value: number, offset: number = 0): BigInt {\n    return wrtBigUInt64BE(\n      this,\n      value,\n      offset,\n      -BigInt('0x8000000000000000'),\n      BigInt('0x7fffffffffffffff')\n    );\n  }\n\n  writeFloatLE(value: number, offset: number, noAssert?: boolean): number {\n    return writeFloat(this, value, offset, true, noAssert);\n  }\n\n  writeFloatBE(value: number, offset: number, noAssert?: boolean): number {\n    return writeFloat(this, value, offset, false, noAssert);\n  }\n\n  writeDoubleLE(value: number, offset: number, noAssert?: boolean): number {\n    return writeDouble(this, value, offset, true, noAssert);\n  }\n\n  writeDoubleBE(value: number, offset: number, noAssert?: boolean): number {\n    return writeDouble(this, value, offset, false, noAssert);\n  }\n\n  write(string: string, encoding?: BufferEncoding): number;\n  write(string: string, offset: number, encoding?: BufferEncoding): number;\n  write(string: string, offset: number, length: number, encoding?: BufferEncoding): number;\n  write(string: string, offset, length, encoding): number {\n    // Buffer#write(string)\n    if (offset === undefined) {\n      encoding = 'utf8';\n      length = this.length;\n      offset = 0;\n      // Buffer#write(string, encoding)\n    } else if (length === undefined && typeof offset === 'string') {\n      encoding = offset;\n      length = this.length;\n      offset = 0;\n      // Buffer#write(string, offset[, length][, encoding])\n    } else if (isFinite(offset)) {\n      offset = offset >>> 0;\n      if (isFinite(length)) {\n        length = length >>> 0;\n        if (encoding === undefined) encoding = 'utf8';\n      } else {\n        encoding = length;\n        length = undefined;\n      }\n    } else {\n      throw new Error('Buffer.write(string, encoding, offset[, length]) is no longer supported');\n    }\n\n    const remaining = this.length - offset;\n    if (length === undefined || length > remaining) length = remaining;\n\n    if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n      throw new RangeError('Attempt to write outside buffer bounds');\n    }\n\n    if (!encoding) encoding = 'utf8';\n\n    let loweredCase = false;\n    for (;;) {\n      switch (encoding) {\n        case 'hex':\n          return hexWrite(this, string, offset, length);\n\n        case 'utf8':\n        case 'utf-8':\n          return utf8Write(this, string, offset, length);\n\n        case 'ascii':\n        case 'latin1':\n        case 'binary':\n          return asciiWrite(this, string, offset, length);\n\n        case 'base64':\n          // Warning: maxLength not taken into account in base64Write\n          return base64Write(this, string, offset, length);\n\n        case 'ucs2':\n        case 'ucs-2':\n        case 'utf16le':\n        case 'utf-16le':\n          return ucs2Write(this, string, offset, length);\n\n        default:\n          if (loweredCase) throw new TypeError(`Unknown encoding: ${encoding}`);\n          encoding = `${encoding}`.toLowerCase();\n          loweredCase = true;\n      }\n    }\n  }\n\n  // copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\n  copy(target: Buffer, targetStart?: number, start?: number, end?: number): number {\n    if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer');\n    if (!start) start = 0;\n    if (!end && end !== 0) end = this.length;\n    if (targetStart >= target.length) targetStart = target.length;\n    if (!targetStart) targetStart = 0;\n    if (end > 0 && end < start) end = start;\n\n    // Copy 0 bytes; we're done\n    if (end === start) return 0;\n    if (target.length === 0 || this.length === 0) return 0;\n\n    // Fatal error conditions\n    if (targetStart < 0) {\n      throw new RangeError('targetStart out of bounds');\n    }\n    if (start < 0 || start >= this.length) throw new RangeError('Index out of range');\n    if (end < 0) throw new RangeError('sourceEnd out of bounds');\n\n    // Are we oob?\n    if (end > this.length) end = this.length;\n    if (target.length - targetStart < end - start) {\n      end = target.length - targetStart + start;\n    }\n\n    const len = end - start;\n\n    if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n      // Use built-in when available, missing from IE11\n      this.copyWithin(targetStart, start, end);\n    } else {\n      Uint8Array.prototype.set.call(target, this.subarray(start, end), targetStart);\n    }\n\n    return len;\n  }\n\n  // Usage:\n  //    buffer.fill(number[, offset[, end]])\n  //    buffer.fill(buffer[, offset[, end]])\n  //    buffer.fill(string[, offset[, end]][, encoding])\n  fill(val: any, start?: number, end?: number, encoding?): this {\n    // Handle string cases:\n    if (typeof val === 'string') {\n      if (typeof start === 'string') {\n        encoding = start;\n        start = 0;\n        end = this.length;\n      } else if (typeof end === 'string') {\n        encoding = end;\n        end = this.length;\n      }\n      if (encoding !== undefined && typeof encoding !== 'string') {\n        throw new TypeError('encoding must be a string');\n      }\n      if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n        throw new TypeError(`Unknown encoding: ${encoding}`);\n      }\n      if (val.length === 1) {\n        const code = val.charCodeAt(0);\n        if ((encoding === 'utf8' && code < 128) || encoding === 'latin1') {\n          // Fast path: If `val` fits into a single byte, use that numeric value.\n          val = code;\n        }\n      }\n    } else if (typeof val === 'number') {\n      val = val & 255;\n    } else if (typeof val === 'boolean') {\n      val = Number(val);\n    }\n\n    // Invalid ranges are not set to a default, so can range check early.\n    if (start < 0 || this.length < start || this.length < end) {\n      throw new RangeError('Out of range index');\n    }\n\n    if (end <= start) {\n      return this;\n    }\n\n    start = start >>> 0;\n    end = end === undefined ? this.length : end >>> 0;\n\n    if (!val) val = 0;\n\n    let i;\n    if (typeof val === 'number') {\n      for (i = start; i < end; ++i) {\n        this[i] = val;\n      }\n    } else {\n      const bytes = Buffer.isBuffer(val) ? val : Buffer.from(val, encoding);\n      const len = bytes.length;\n      if (len === 0) {\n        throw new TypeError(`The value \"${val}\" is invalid for argument \"value\"`);\n      }\n      for (i = 0; i < end - start; ++i) {\n        this[i + start] = bytes[i % len];\n      }\n    }\n\n    return this;\n  }\n\n  swap16() {\n    const len = this.length;\n    if (len % 2 !== 0) {\n      throw new RangeError('Buffer size must be a multiple of 16-bits');\n    }\n    for (let i = 0; i < len; i += 2) {\n      swap(this, i, i + 1);\n    }\n    return this;\n  }\n\n  swap32() {\n    const len = this.length;\n    if (len % 4 !== 0) {\n      throw new RangeError('Buffer size must be a multiple of 32-bits');\n    }\n    for (let i = 0; i < len; i += 4) {\n      swap(this, i, i + 3);\n      swap(this, i + 1, i + 2);\n    }\n    return this;\n  }\n\n  swap64() {\n    const len = this.length;\n    if (len % 8 !== 0) {\n      throw new RangeError('Buffer size must be a multiple of 64-bits');\n    }\n    for (let i = 0; i < len; i += 8) {\n      swap(this, i, i + 7);\n      swap(this, i + 1, i + 6);\n      swap(this, i + 2, i + 5);\n      swap(this, i + 3, i + 4);\n    }\n    return this;\n  }\n\n  toString(encoding?: string, start?: number, end?: number): string {\n    const length = this.length;\n    if (length === 0) return '';\n    if (arguments.length === 0) return utf8Slice(this, 0, length);\n    return this._slowToString(...arguments);\n  }\n\n  // toLocaleString(b) {\n  //   if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer');\n  //   if (this === b) return true;\n  //   return Buffer.compare(this, b) === 0;\n  // }\n\n  inspect() {\n    let str = '';\n    const max = INSPECT_MAX_BYTES;\n    str = this.toString('hex', 0, max)\n      .replace(/(.{2})/g, '$1 ')\n      .trim();\n    if (this.length > max) str += ' ... ';\n    return `<Buffer ${str}>`;\n  }\n  // if (customInspectSymbol) {\n  //   Buffer.prototype[customInspectSymbol] =  Buffer.prototype.inspect;\n  // }\n  // }\n\n  equals(b: Buffer): boolean {\n    if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer');\n    if (this === b) return true;\n    return Buffer.compare(this, b) === 0;\n  }\n\n  compare(\n    target: Buffer | Uint8Array,\n    start?: number,\n    end?: number,\n    thisStart?: number,\n    thisEnd?: number\n  ): number {\n    if (!Buffer.isBuffer(target) && isInstance(target, Uint8Array)) {\n      target = Buffer.from(target, target.offset, target.byteLength);\n    }\n    if (!Buffer.isBuffer(target)) {\n      throw new TypeError(\n        `${\n          'The \"target\" argument must be one of type Buffer or Uint8Array. ' + 'Received type '\n        }${typeof target}`\n      );\n    }\n\n    if (start === undefined) {\n      start = 0;\n    }\n    if (end === undefined) {\n      end = target ? target.length : 0;\n    }\n    if (thisStart === undefined) {\n      thisStart = 0;\n    }\n    if (thisEnd === undefined) {\n      thisEnd = this.length;\n    }\n\n    if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n      throw new RangeError('out of range index');\n    }\n\n    if (thisStart >= thisEnd && start >= end) {\n      return 0;\n    }\n    if (thisStart >= thisEnd) {\n      return -1;\n    }\n    if (start >= end) {\n      return 1;\n    }\n\n    start >>>= 0;\n    end >>>= 0;\n    thisStart >>>= 0;\n    thisEnd >>>= 0;\n\n    if (this === target) return 0;\n\n    let x = thisEnd - thisStart;\n    let y = end - start;\n    const len = Math.min(x, y);\n\n    const thisCopy = this.slice(thisStart, thisEnd);\n    const targetCopy = target.slice(start, end);\n\n    for (let i = 0; i < len; ++i) {\n      if (thisCopy[i] !== targetCopy[i]) {\n        x = thisCopy[i];\n        y = targetCopy[i];\n        break;\n      }\n    }\n\n    if (x < y) return -1;\n    if (y < x) return 1;\n    return 0;\n  }\n\n  toJSON(): {type: 'Buffer'; data: any[]} {\n    return {\n      type: 'Buffer',\n      data: Array.prototype.slice.call(this._arr || this, 0)\n    };\n  }\n\n  slice(start?: number, end?: number): this {\n    const len = this.length;\n    start = ~~start;\n    end = end === undefined ? len : ~~end;\n\n    if (start < 0) {\n      start += len;\n      if (start < 0) start = 0;\n    } else if (start > len) {\n      start = len;\n    }\n\n    if (end < 0) {\n      end += len;\n      if (end < 0) end = 0;\n    } else if (end > len) {\n      end = len;\n    }\n\n    if (end < start) end = start;\n\n    const newBuf = this.subarray(start, end);\n\n    // Return an augmented `Uint8Array` instance\n    Object.setPrototypeOf(newBuf, Buffer.prototype);\n\n    return newBuf as unknown as Buffer;\n  }\n\n  // Typo support?\n\n  // readUint8(offset: number, noAssert?: boolean): number {\n  //   return this.readUInt8(...arguments);\n  // }\n\n  // readUint16LE(offset: number, noAssert?: boolean): number {\n  //   return this.readUInt16LE(...arguments);\n  // }\n\n  // readUint16BE(offset: number, noAssert?: boolean): number {\n  //   return this.readUInt16BE(...arguments);\n  // }\n\n  // readUint32LE(offset: number, noAssert?: boolean): number {\n  //   return this.readUInt32LE(...arguments);\n  // }\n\n  // readUint32BE(offset: number, noAssert?: boolean): number {\n  //   return this.readUInt32BE(...arguments);\n  // }\n\n  // writeUint8() {\n  //   return this.writeUInt8(...arguments);\n  // }\n\n  // writeUint16LE\n  // writeUint16LE\n  // writeUint32LE = Buffer.prototype.\n  // Buffer.prototype.writeUint32BE\n\n  protected _slowToString(encoding, start, end) {\n    let loweredCase = false;\n\n    // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n    // property of a typed array.\n\n    // This behaves neither like String nor Uint8Array in that we set start/end\n    // to their upper/lower bounds if the value passed is out of range.\n    // undefined is handled specially as per ECMA-262 6th Edition,\n    // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n    if (start === undefined || start < 0) {\n      start = 0;\n    }\n    // Return early if start > this.length. Done here to prevent potential uint32\n    // coercion fail below.\n    if (start > this.length) {\n      return '';\n    }\n\n    if (end === undefined || end > this.length) {\n      end = this.length;\n    }\n\n    if (end <= 0) {\n      return '';\n    }\n\n    // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\n    end >>>= 0;\n    start >>>= 0;\n\n    if (end <= start) {\n      return '';\n    }\n\n    if (!encoding) encoding = 'utf8';\n\n    while (true) {\n      switch (encoding) {\n        case 'hex':\n          return hexSlice(this, start, end);\n\n        case 'utf8':\n        case 'utf-8':\n          return utf8Slice(this, start, end);\n\n        case 'ascii':\n          return asciiSlice(this, start, end);\n\n        case 'latin1':\n        case 'binary':\n          return latin1Slice(this, start, end);\n\n        case 'base64':\n          return base64Slice(this, start, end);\n\n        case 'ucs2':\n        case 'ucs-2':\n        case 'utf16le':\n        case 'utf-16le':\n          return utf16leSlice(this, start, end);\n\n        default:\n          if (loweredCase) throw new TypeError(`Unknown encoding: ${encoding}`);\n          encoding = `${encoding}`.toLowerCase();\n          loweredCase = true;\n      }\n    }\n  }\n}\n\nfunction checkInt(buf: Buffer, value, offset, ext, max, min) {\n  if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance');\n  if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds');\n  if (offset + ext > buf.length) throw new RangeError('Index out of range');\n}\n\nfunction wrtBigUInt64LE(buf: Buffer, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7);\n\n  let lo = Number(value & BigInt(0xffffffff));\n  buf[offset++] = lo;\n  lo = lo >> 8;\n  buf[offset++] = lo;\n  lo = lo >> 8;\n  buf[offset++] = lo;\n  lo = lo >> 8;\n  buf[offset++] = lo;\n  let hi = Number((value >> BigInt(32)) & BigInt(0xffffffff));\n  buf[offset++] = hi;\n  hi = hi >> 8;\n  buf[offset++] = hi;\n  hi = hi >> 8;\n  buf[offset++] = hi;\n  hi = hi >> 8;\n  buf[offset++] = hi;\n  return offset;\n}\n\nfunction wrtBigUInt64BE(buf: Buffer, value, offset, min, max) {\n  checkIntBI(value, min, max, buf, offset, 7);\n\n  let lo = Number(value & BigInt(0xffffffff));\n  buf[offset + 7] = lo;\n  lo = lo >> 8;\n  buf[offset + 6] = lo;\n  lo = lo >> 8;\n  buf[offset + 5] = lo;\n  lo = lo >> 8;\n  buf[offset + 4] = lo;\n  let hi = Number((value >> BigInt(32)) & BigInt(0xffffffff));\n  buf[offset + 3] = hi;\n  hi = hi >> 8;\n  buf[offset + 2] = hi;\n  hi = hi >> 8;\n  buf[offset + 1] = hi;\n  hi = hi >> 8;\n  buf[offset] = hi;\n  return offset + 8;\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\n// Object.setPrototypeOf(Buffer.prototype, Uint8Array.prototype);\n// Object.setPrototypeOf(Buffer, Uint8Array);\n\nfunction assertSize(size: number): void {\n  if (typeof size !== 'number') {\n    throw new TypeError('\"size\" argument must be of type number');\n  } else if (size < 0) {\n    throw new RangeError(`The value \"${size}\" is invalid for option \"size\"`);\n  }\n}\n\nfunction alloc(size, fill, encoding): Buffer {\n  assertSize(size);\n  if (size <= 0) {\n    return new Buffer(size);\n  }\n  if (fill !== undefined) {\n    // Only pay attention to encoding if it's a string. This\n    // prevents accidentally sending in a number that would\n    // be interpreted as a start offset.\n    return typeof encoding === 'string'\n      ? new Buffer(size).fill(fill, encoding)\n      : new Buffer(size).fill(fill);\n  }\n  return new Buffer(size);\n}\n\nfunction fromString(string: string, encoding: BufferEncoding): Buffer {\n  if (typeof encoding !== 'string' || encoding === '') {\n    encoding = 'utf8';\n  }\n\n  if (!Buffer.isEncoding(encoding)) {\n    throw new TypeError(`Unknown encoding: ${encoding}`);\n  }\n\n  const length = byteLength(string, encoding) | 0;\n  let buf = new Buffer(length);\n\n  const actual = buf.write(string, encoding);\n\n  if (actual !== length) {\n    // Writing a hex string, for example, that contains invalid characters will\n    // cause everything after the first invalid character to be ignored. (e.g.\n    // 'abxxcd' will be treated as 'ab')\n    buf = buf.slice(0, actual);\n  }\n\n  return buf;\n}\n\nfunction fromArrayLike(array: ArrayLike<any>): Buffer {\n  const length = array.length < 0 ? 0 : checked(array.length) | 0;\n  const buf = new Buffer(length);\n  for (let i = 0; i < length; i += 1) {\n    buf[i] = array[i] & 255;\n  }\n  return buf;\n}\n\nfunction fromArrayView(arrayView): Buffer {\n  if (isInstance(arrayView, Uint8Array)) {\n    const copy = new Uint8Array(arrayView);\n    return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength);\n  }\n  return fromArrayLike(arrayView);\n}\n\nfunction fromArrayBuffer(array: ArrayBuffer, byteOffset: number, length: number): Buffer {\n  if (byteOffset < 0 || array.byteLength < byteOffset) {\n    throw new RangeError('\"offset\" is outside of buffer bounds');\n  }\n\n  if (array.byteLength < byteOffset + (length || 0)) {\n    throw new RangeError('\"length\" is outside of buffer bounds');\n  }\n\n  let buf;\n  if (byteOffset === undefined && length === undefined) {\n    buf = new Uint8Array(array);\n  } else if (length === undefined) {\n    buf = new Uint8Array(array, byteOffset);\n  } else {\n    buf = new Uint8Array(array, byteOffset, length);\n  }\n\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(buf, Buffer.prototype);\n\n  return buf;\n}\n\nfunction fromObject(obj) {\n  if (Buffer.isBuffer(obj)) {\n    const len = checked(obj.length) | 0;\n    const buf = new Buffer(len);\n\n    if (buf.length === 0) {\n      return buf;\n    }\n\n    obj.copy(buf, 0, 0, len);\n    return buf;\n  }\n\n  if (obj.length !== undefined) {\n    if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n      return new Buffer(0);\n    }\n    return fromArrayLike(obj);\n  }\n\n  if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n    return fromArrayLike(obj.data);\n  }\n}\n\nfunction checked(length) {\n  // Note: cannot use `length < kMaxLength` here because that fails when\n  // length is NaN (which is otherwise coerced to zero.)\n  if (length >= kMaxLength) {\n    throw new RangeError(\n      `${'Attempt to allocate Buffer larger than maximum ' + 'size: 0x'}${kMaxLength.toString(\n        16\n      )} bytes`\n    );\n  }\n  return length | 0;\n}\n\nfunction byteLength(string, encoding) {\n  if (Buffer.isBuffer(string)) {\n    return string.length;\n  }\n  if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n    return string.byteLength;\n  }\n  if (typeof string !== 'string') {\n    throw new TypeError(\n      `${\n        'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n        'Received type '\n      }${typeof string}`\n    );\n  }\n\n  const len = string.length;\n  const mustMatch = arguments.length > 2 && arguments[2] === true;\n  if (!mustMatch && len === 0) return 0;\n\n  // Use a for loop to avoid recursion\n  let loweredCase = false;\n  for (;;) {\n    switch (encoding) {\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return len;\n      case 'utf8':\n      case 'utf-8':\n        return utf8ToBytes(string).length;\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return len * 2;\n      case 'hex':\n        return len >>> 1;\n      case 'base64':\n        return base64ToBytes(string).length;\n      default:\n        if (loweredCase) {\n          return mustMatch ? -1 : utf8ToBytes(string).length; // assume utf8\n        }\n        encoding = `${encoding}`.toLowerCase();\n        loweredCase = true;\n    }\n  }\n}\n\n// Buffer.byteLength = byteLength;\n\nfunction swap(b, n, m) {\n  const i = b[n];\n  b[n] = b[m];\n  b[m] = i;\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf(buffer, val, byteOffset, encoding, dir) {\n  // Empty buffer means no match\n  if (buffer.length === 0) return -1;\n\n  // Normalize byteOffset\n  if (typeof byteOffset === 'string') {\n    encoding = byteOffset;\n    byteOffset = 0;\n  } else if (byteOffset > 0x7fffffff) {\n    byteOffset = 0x7fffffff;\n  } else if (byteOffset < -0x80000000) {\n    byteOffset = -0x80000000;\n  }\n  byteOffset = Number(byteOffset); // Coerce to Number.\n  if (numberIsNaN(byteOffset)) {\n    // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n    byteOffset = dir ? 0 : buffer.length - 1;\n  }\n\n  // Normalize byteOffset: negative offsets start from the end of the buffer\n  if (byteOffset < 0) byteOffset = buffer.length + byteOffset;\n  if (byteOffset >= buffer.length) {\n    if (dir) return -1;\n    byteOffset = buffer.length - 1;\n  } else if (byteOffset < 0) {\n    if (dir) byteOffset = 0;\n    else return -1;\n  }\n\n  // Normalize val\n  if (typeof val === 'string') {\n    val = Buffer.from(val, encoding);\n  }\n\n  // Finally, search either indexOf (if dir is true) or lastIndexOf\n  if (Buffer.isBuffer(val)) {\n    // Special case: looking for empty string/buffer always fails\n    if (val.length === 0) {\n      return -1;\n    }\n    return arrayIndexOf(buffer, val, byteOffset, encoding, dir);\n  } else if (typeof val === 'number') {\n    val = val & 0xff; // Search for a byte value [0-255]\n    if (typeof Uint8Array.prototype.indexOf === 'function') {\n      if (dir) {\n        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset);\n      }\n      return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset);\n    }\n    return arrayIndexOf(buffer, [val], byteOffset, encoding, dir);\n  }\n\n  throw new TypeError('val must be string, number or Buffer');\n}\n\nfunction arrayIndexOf(arr, val, byteOffset, encoding, dir) {\n  let indexSize = 1;\n  let arrLength = arr.length;\n  let valLength = val.length;\n\n  if (encoding !== undefined) {\n    encoding = String(encoding).toLowerCase();\n    if (\n      encoding === 'ucs2' ||\n      encoding === 'ucs-2' ||\n      encoding === 'utf16le' ||\n      encoding === 'utf-16le'\n    ) {\n      if (arr.length < 2 || val.length < 2) {\n        return -1;\n      }\n      indexSize = 2;\n      arrLength /= 2;\n      valLength /= 2;\n      byteOffset /= 2;\n    }\n  }\n\n  function read(buf, i) {\n    if (indexSize === 1) {\n      return buf[i];\n    }\n    return buf.readUInt16BE(i * indexSize);\n  }\n\n  let i;\n  if (dir) {\n    let foundIndex = -1;\n    for (i = byteOffset; i < arrLength; i++) {\n      if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n        if (foundIndex === -1) foundIndex = i;\n        if (i - foundIndex + 1 === valLength) return foundIndex * indexSize;\n      } else {\n        if (foundIndex !== -1) i -= i - foundIndex;\n        foundIndex = -1;\n      }\n    }\n  } else {\n    if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength;\n    for (i = byteOffset; i >= 0; i--) {\n      let found = true;\n      for (let j = 0; j < valLength; j++) {\n        if (read(arr, i + j) !== read(val, j)) {\n          found = false;\n          break;\n        }\n      }\n      if (found) return i;\n    }\n  }\n\n  return -1;\n}\n\nfunction hexWrite(buf: Buffer, string, offset, length): number {\n  offset = Number(offset) || 0;\n  const remaining = buf.length - offset;\n  if (!length) {\n    length = remaining;\n  } else {\n    length = Number(length);\n    if (length > remaining) {\n      length = remaining;\n    }\n  }\n\n  const strLen = string.length;\n\n  if (length > strLen / 2) {\n    length = strLen / 2;\n  }\n  let i;\n  for (i = 0; i < length; ++i) {\n    const parsed = parseInt(string.substr(i * 2, 2), 16);\n    if (numberIsNaN(parsed)) return i;\n    buf[offset + i] = parsed;\n  }\n  return i;\n}\n\nfunction utf8Write(buf: Buffer, string, offset, length) {\n  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length);\n}\n\nfunction asciiWrite(buf: Buffer, string, offset, length) {\n  return blitBuffer(asciiToBytes(string), buf, offset, length);\n}\n\nfunction base64Write(buf: Buffer, string, offset, length) {\n  return blitBuffer(base64ToBytes(string), buf, offset, length);\n}\n\nfunction ucs2Write(buf: Buffer, string, offset, length) {\n  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length);\n}\n\nfunction base64Slice(buf: Buffer, start, end) {\n  if (start === 0 && end === buf.length) {\n    return base64.fromByteArray(buf);\n  }\n  return base64.fromByteArray(buf.slice(start, end));\n}\n\nfunction utf8Slice(buf: Buffer, start, end) {\n  end = Math.min(buf.length, end);\n  const res: number[] = [];\n\n  let i = start;\n  while (i < end) {\n    const firstByte = buf[i];\n    let codePoint: number | null = null;\n    let bytesPerSequence = firstByte > 0xef ? 4 : firstByte > 0xdf ? 3 : firstByte > 0xbf ? 2 : 1;\n\n    if (i + bytesPerSequence <= end) {\n      let fourthByte;\n      let secondByte;\n      let tempCodePoint;\n      let thirdByte;\n\n      switch (bytesPerSequence) {\n        case 1:\n          if (firstByte < 0x80) {\n            codePoint = firstByte;\n          }\n          break;\n        case 2:\n          secondByte = buf[i + 1];\n          if ((secondByte & 0xc0) === 0x80) {\n            tempCodePoint = ((firstByte & 0x1f) << 0x6) | (secondByte & 0x3f);\n            if (tempCodePoint > 0x7f) {\n              codePoint = tempCodePoint;\n            }\n          }\n          break;\n        case 3:\n          secondByte = buf[i + 1];\n          thirdByte = buf[i + 2];\n          if ((secondByte & 0xc0) === 0x80 && (thirdByte & 0xc0) === 0x80) {\n            tempCodePoint =\n              ((firstByte & 0xf) << 0xc) | ((secondByte & 0x3f) << 0x6) | (thirdByte & 0x3f);\n            if (tempCodePoint > 0x7ff && (tempCodePoint < 0xd800 || tempCodePoint > 0xdfff)) {\n              codePoint = tempCodePoint;\n            }\n          }\n          break;\n        case 4:\n          secondByte = buf[i + 1];\n          thirdByte = buf[i + 2];\n          fourthByte = buf[i + 3];\n          if (\n            (secondByte & 0xc0) === 0x80 &&\n            (thirdByte & 0xc0) === 0x80 &&\n            (fourthByte & 0xc0) === 0x80\n          ) {\n            tempCodePoint =\n              ((firstByte & 0xf) << 0x12) |\n              ((secondByte & 0x3f) << 0xc) |\n              ((thirdByte & 0x3f) << 0x6) |\n              (fourthByte & 0x3f);\n            if (tempCodePoint > 0xffff && tempCodePoint < 0x110000) {\n              codePoint = tempCodePoint;\n            }\n          }\n      }\n    }\n\n    if (codePoint === null) {\n      // we did not generate a valid codePoint so insert a\n      // replacement char (U+FFFD) and advance only 1 byte\n      codePoint = 0xfffd;\n      bytesPerSequence = 1;\n    } else if (codePoint > 0xffff) {\n      // encode to utf16 (surrogate pair dance)\n      codePoint -= 0x10000;\n      res.push(((codePoint >>> 10) & 0x3ff) | 0xd800);\n      codePoint = 0xdc00 | (codePoint & 0x3ff);\n    }\n\n    res.push(codePoint);\n    i += bytesPerSequence;\n  }\n\n  return decodeCodePointsArray(res);\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nconst MAX_ARGUMENTS_LENGTH = 0x1000;\n\nfunction decodeCodePointsArray(codePoints: number[]): string {\n  const len = codePoints.length;\n  if (len <= MAX_ARGUMENTS_LENGTH) {\n    return String.fromCharCode.apply(String, codePoints); // avoid extra slice()\n  }\n\n  // Decode in chunks to avoid \"call stack size exceeded\".\n  let res = '';\n  let i = 0;\n  while (i < len) {\n    res += String.fromCharCode.apply(String, codePoints.slice(i, (i += MAX_ARGUMENTS_LENGTH)));\n  }\n  return res;\n}\n\nfunction asciiSlice(buf: Buffer, start, end): string {\n  let ret = '';\n  end = Math.min(buf.length, end);\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i] & 0x7f);\n  }\n  return ret;\n}\n\nfunction latin1Slice(buf: Buffer, start, end): string {\n  let ret = '';\n  end = Math.min(buf.length, end);\n\n  for (let i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i]);\n  }\n  return ret;\n}\n\nfunction hexSlice(buf: Buffer, start, end): string {\n  const len = buf.length;\n\n  if (!start || start < 0) start = 0;\n  if (!end || end < 0 || end > len) end = len;\n\n  let out = '';\n  for (let i = start; i < end; ++i) {\n    out += hexSliceLookupTable[buf[i]];\n  }\n  return out;\n}\n\nfunction utf16leSlice(buf: Buffer, start, end): string {\n  const bytes = buf.slice(start, end);\n  let res = '';\n  // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n  for (let i = 0; i < bytes.length - 1; i += 2) {\n    res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256);\n  }\n  return res;\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset(offset, ext, length): void {\n  if (offset % 1 !== 0 || offset < 0) throw new RangeError('offset is not uint');\n  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length');\n}\n\nfunction checkIEEE754(buf: Buffer, value, offset, ext, max, min): void {\n  if (offset + ext > buf.length) throw new RangeError('Index out of range');\n  if (offset < 0) throw new RangeError('Index out of range');\n}\n\nfunction writeFloat(buf: Buffer, value, offset, littleEndian, noAssert): number {\n  value = Number(value);\n  offset = offset >>> 0;\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 4, 3.4028234663852886e38, -3.4028234663852886e38);\n  }\n  ieee754.write(buf, value, offset, littleEndian, 23, 4);\n  return offset + 4;\n}\n\nfunction writeDouble(buf: Buffer, value, offset, littleEndian, noAssert): number {\n  value = Number(value);\n  offset = offset >>> 0;\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 8, 1.7976931348623157e308, -1.7976931348623157e308);\n  }\n  ieee754.write(buf, value, offset, littleEndian, 52, 8);\n  return offset + 8;\n}\n\n// CUSTOM ERRORS\n// =============\n\n// Simplified versions from Node, changed for Buffer-only usage\nconst errors: Record<string, any> = {};\nfunction E(sym, getMessage, Base) {\n  errors[sym] = class NodeError extends Base {\n    constructor() {\n      super();\n\n      Object.defineProperty(this, 'message', {\n        value: getMessage.apply(this, arguments),\n        writable: true,\n        configurable: true\n      });\n\n      // Add the error code to the name to include it in the stack trace.\n      this.name = `${this.name} [${sym}]`;\n      // Access the stack to generate the error message including the error code\n      // from the name.\n      this.stack; // eslint-disable-line no-unused-expressions\n      // Reset the name to the actual name.\n      delete this.name;\n    }\n\n    get code() {\n      return sym;\n    }\n\n    set code(value) {\n      Object.defineProperty(this, 'code', {\n        configurable: true,\n        enumerable: true,\n        value,\n        writable: true\n      });\n    }\n\n    toString() {\n      return `${this.name} [${sym}]: ${this.message}`;\n    }\n  };\n}\n\nE(\n  'ERR_BUFFER_OUT_OF_BOUNDS',\n  function (name) {\n    if (name) {\n      return `${name} is outside of buffer bounds`;\n    }\n\n    return 'Attempt to access memory outside buffer bounds';\n  },\n  RangeError\n);\nE(\n  'ERR_INVALID_ARG_TYPE',\n  function (name, actual) {\n    return `The \"${name}\" argument must be of type number. Received type ${typeof actual}`;\n  },\n  TypeError\n);\nE(\n  'ERR_OUT_OF_RANGE',\n  function (str, range, input) {\n    let msg = `The value of \"${str}\" is out of range.`;\n    let received = input;\n    if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n      received = addNumericalSeparator(String(input));\n    } else if (typeof input === 'bigint') {\n      received = String(input);\n      if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {\n        received = addNumericalSeparator(received);\n      }\n      received += 'n';\n    }\n    msg += ` It must be ${range}. Received ${received}`;\n    return msg;\n  },\n  RangeError\n);\n\nfunction addNumericalSeparator(val) {\n  let res = '';\n  let i = val.length;\n  const start = val[0] === '-' ? 1 : 0;\n  for (; i >= start + 4; i -= 3) {\n    res = `_${val.slice(i - 3, i)}${res}`;\n  }\n  return `${val.slice(0, i)}${res}`;\n}\n\n// CHECK FUNCTIONS\n// ===============\n\nfunction checkBounds(buf, offset, byteLength) {\n  validateNumber(offset, 'offset');\n  if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {\n    boundsError(offset, buf.length - (byteLength + 1));\n  }\n}\n\nfunction checkIntBI(value, min, max, buf, offset, byteLength) {\n  if (value > max || value < min) {\n    const n = typeof min === 'bigint' ? 'n' : '';\n    let range;\n    if (byteLength > 3) {\n      if (min === 0 || min === BigInt(0)) {\n        range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`;\n      } else {\n        range =\n          `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +\n          `${(byteLength + 1) * 8 - 1}${n}`;\n      }\n    } else {\n      range = `>= ${min}${n} and <= ${max}${n}`;\n    }\n    throw new errors.ERR_OUT_OF_RANGE('value', range, value);\n  }\n  checkBounds(buf, offset, byteLength);\n}\n\nfunction validateNumber(value, name) {\n  if (typeof value !== 'number') {\n    throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value);\n  }\n}\n\nfunction boundsError(value, length, type?) {\n  if (Math.floor(value) !== value) {\n    validateNumber(value, type);\n    throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value);\n  }\n\n  if (length < 0) {\n    throw new errors.ERR_BUFFER_OUT_OF_BOUNDS();\n  }\n\n  throw new errors.ERR_OUT_OF_RANGE(type || 'offset', `>= ${type ? 1 : 0} and <= ${length}`, value);\n}\n\n// HELPER FUNCTIONS\n// ================\n\nconst INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g;\n\nfunction base64clean(str: string): string {\n  // Node takes equal signs as end of the Base64 encoding\n  str = str.split('=')[0];\n  // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n  str = str.trim().replace(INVALID_BASE64_RE, '');\n  // Node converts strings with length < 2 to ''\n  if (str.length < 2) return '';\n  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n  while (str.length % 4 !== 0) {\n    str = `${str}=`;\n  }\n  return str;\n}\n\nfunction utf8ToBytes(string: string, units?: number): number[] {\n  units = units || Infinity;\n  let codePoint;\n  const length = string.length;\n  let leadSurrogate = null;\n  const bytes: number[] = [];\n\n  for (let i = 0; i < length; ++i) {\n    codePoint = string.charCodeAt(i);\n\n    // is surrogate component\n    if (codePoint > 0xd7ff && codePoint < 0xe000) {\n      // last char was a lead\n      if (!leadSurrogate) {\n        // no lead yet\n        if (codePoint > 0xdbff) {\n          // unexpected trail\n          if ((units -= 3) > -1) bytes.push(0xef, 0xbf, 0xbd);\n          continue;\n        } else if (i + 1 === length) {\n          // unpaired lead\n          if ((units -= 3) > -1) bytes.push(0xef, 0xbf, 0xbd);\n          continue;\n        }\n\n        // valid lead\n        leadSurrogate = codePoint;\n\n        continue;\n      }\n\n      // 2 leads in a row\n      if (codePoint < 0xdc00) {\n        if ((units -= 3) > -1) bytes.push(0xef, 0xbf, 0xbd);\n        leadSurrogate = codePoint;\n        continue;\n      }\n\n      // valid surrogate pair\n      codePoint = (((leadSurrogate - 0xd800) << 10) | (codePoint - 0xdc00)) + 0x10000;\n    } else if (leadSurrogate) {\n      // valid bmp char, but last char was a lead\n      if ((units -= 3) > -1) bytes.push(0xef, 0xbf, 0xbd);\n    }\n\n    leadSurrogate = null;\n\n    // encode utf8\n    if (codePoint < 0x80) {\n      if ((units -= 1) < 0) break;\n      bytes.push(codePoint);\n    } else if (codePoint < 0x800) {\n      if ((units -= 2) < 0) break;\n      bytes.push((codePoint >> 0x6) | 0xc0, (codePoint & 0x3f) | 0x80);\n    } else if (codePoint < 0x10000) {\n      if ((units -= 3) < 0) break;\n      bytes.push(\n        (codePoint >> 0xc) | 0xe0,\n        ((codePoint >> 0x6) & 0x3f) | 0x80,\n        (codePoint & 0x3f) | 0x80\n      );\n    } else if (codePoint < 0x110000) {\n      if ((units -= 4) < 0) break;\n      bytes.push(\n        (codePoint >> 0x12) | 0xf0,\n        ((codePoint >> 0xc) & 0x3f) | 0x80,\n        ((codePoint >> 0x6) & 0x3f) | 0x80,\n        (codePoint & 0x3f) | 0x80\n      );\n    } else {\n      throw new Error('Invalid code point');\n    }\n  }\n\n  return bytes;\n}\n\nfunction asciiToBytes(str: string): number[] {\n  const byteArray: number[] = [];\n  for (let i = 0; i < str.length; ++i) {\n    // Node's code seems to be doing this and not & 0x7F..\n    byteArray.push(str.charCodeAt(i) & 0xff);\n  }\n  return byteArray;\n}\n\nfunction utf16leToBytes(str: string, units: number): number[] {\n  let c;\n  let hi;\n  let lo;\n  const byteArray: number[] = [];\n  for (let i = 0; i < str.length; ++i) {\n    if ((units -= 2) < 0) break;\n\n    c = str.charCodeAt(i);\n    hi = c >> 8;\n    lo = c % 256;\n    byteArray.push(lo);\n    byteArray.push(hi);\n  }\n\n  return byteArray;\n}\n\nfunction base64ToBytes(str: string): Uint8Array {\n  return base64.toByteArray(base64clean(str));\n}\n\nfunction blitBuffer(src, dst, offset, length): number {\n  let i;\n  for (i = 0; i < length; ++i) {\n    if (i + offset >= dst.length || i >= src.length) break;\n    dst[i + offset] = src[i];\n  }\n  return i;\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance(obj, type): boolean {\n  return (\n    obj instanceof type ||\n    (obj != null &&\n      obj.constructor != null &&\n      obj.constructor.name != null &&\n      obj.constructor.name === type.name)\n  );\n}\nfunction numberIsNaN(obj): boolean {\n  // For IE11 support\n  return obj !== obj; // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nconst hexSliceLookupTable = (function () {\n  const alphabet = '0123456789abcdef';\n  const table = new Array(256);\n  for (let i = 0; i < 16; ++i) {\n    const i16 = i * 16;\n    for (let j = 0; j < 16; ++j) {\n      table[i16 + j] = alphabet[i] + alphabet[j];\n    }\n  }\n  return table;\n})();\n", "// luma.gl, MIT license\n\nimport {Buffer as BufferPolyfill} from './buffer';\n\n/** Install Node.js Buffer polyfill (NO-OP in Node.js) */\nexport function installBufferPolyfill(): typeof Buffer {\n  // @ts-ignore\n  globalThis.Buffer = globalThis.Buffer || BufferPolyfill;\n  // @ts-ignore\n  return globalThis.Buffer;\n}\n", "// loaders.gl, MIT license\nimport type {Loader, LoaderOptions} from '@loaders.gl/loader-utils';\nimport type {\n  ObjectRowTable,\n  ObjectRowTableBatch,\n  ColumnarTable,\n  ColumnarTableBatch,\n  GeoJSONTable,\n  GeoJSONTableBatch\n} from '@loaders.gl/schema';\n\n// __VERSION__ is injected by babel-plugin-version-inline\n// @ts-ignore TS2304: Cannot find name '__VERSION__'.\nconst VERSION = typeof __VERSION__ !== 'undefined' ? __VERSION__ : 'latest';\n\n/** Options for the parquet loader */\nexport type ParquetLoaderOptions = LoaderOptions & {\n  /** Options for the parquet loader */\n  parquet?: {\n    /** Format of returned parsed data */\n    shape?: 'object-row-table' | 'geojson-table';\n    /** Restrict which columns that are parsed from the table. Can save significant memory. */\n    columnList?: string[] | string[][];\n    /** If true, binary values are not converted to strings */\n    preserveBinary?: boolean;\n    /**  @deprecated not used? Set to true to indicate that this is a geoparquet file. */\n    geoparquet?: boolean;\n    /** @deprecated URL to override loaders.gl/core parser system */\n    url?: string;\n  };\n};\n\n/** ParquetJS table loader */\nexport const ParquetLoader: Loader<\n  ObjectRowTable | GeoJSONTable,\n  ObjectRowTableBatch | GeoJSONTableBatch,\n  ParquetLoaderOptions\n> = {\n  name: 'Apache Parquet',\n  id: 'parquet',\n  module: 'parquet',\n  version: VERSION,\n  worker: true,\n  category: 'table',\n  extensions: ['parquet'],\n  mimeTypes: ['application/octet-stream'],\n  binary: true,\n  tests: ['PAR1', 'PARE'],\n  options: {\n    parquet: {\n      shape: 'object-row-table',\n      columnList: [],\n      geoparquet: true,\n      url: undefined,\n      preserveBinary: false\n    }\n  }\n};\n\nexport const ParquetColumnnarLoader: Loader<\n  ColumnarTable,\n  ColumnarTableBatch,\n  ParquetLoaderOptions\n> = {\n  name: 'Apache Parquet',\n  id: 'parquet',\n  module: 'parquet',\n  version: VERSION,\n  worker: true,\n  category: 'table',\n  extensions: ['parquet'],\n  mimeTypes: ['application/octet-stream'],\n  binary: true,\n  tests: ['PAR1', 'PARE'],\n  options: ParquetLoader.options\n};\n", "// Forked from https://github.com/kbajalc/parquets under MIT license (Copyright (c) 2017 ironSource Ltd.)\n/* eslint-disable camelcase */\nimport type {PrimitiveType} from '../schema/declare';\nimport type {CursorBuffer, ParquetCodecOptions} from './declare';\nimport INT53 from 'int53';\n\nexport function encodeValues(\n  type: PrimitiveType,\n  values: any[],\n  opts: ParquetCodecOptions\n): Buffer {\n  switch (type) {\n    case 'BOOLEAN':\n      return encodeValues_BOOLEAN(values);\n    case 'INT32':\n      return encodeValues_INT32(values);\n    case 'INT64':\n      return encodeValues_INT64(values);\n    case 'INT96':\n      return encodeValues_INT96(values);\n    case 'FLOAT':\n      return encodeValues_FLOAT(values);\n    case 'DOUBLE':\n      return encodeValues_DOUBLE(values);\n    case 'BYTE_ARRAY':\n      return encodeValues_BYTE_ARRAY(values);\n    case 'FIXED_LEN_BYTE_ARRAY':\n      return encodeValues_FIXED_LEN_BYTE_ARRAY(values, opts);\n    default:\n      throw new Error(`unsupported type: ${type}`);\n  }\n}\n\nexport function decodeValues(\n  type: PrimitiveType,\n  cursor: CursorBuffer,\n  count: number,\n  opts: ParquetCodecOptions\n): any[] {\n  switch (type) {\n    case 'BOOLEAN':\n      return decodeValues_BOOLEAN(cursor, count);\n    case 'INT32':\n      return decodeValues_INT32(cursor, count);\n    case 'INT64':\n      return decodeValues_INT64(cursor, count);\n    case 'INT96':\n      return decodeValues_INT96(cursor, count);\n    case 'FLOAT':\n      return decodeValues_FLOAT(cursor, count);\n    case 'DOUBLE':\n      return decodeValues_DOUBLE(cursor, count);\n    case 'BYTE_ARRAY':\n      return decodeValues_BYTE_ARRAY(cursor, count);\n    case 'FIXED_LEN_BYTE_ARRAY':\n      return decodeValues_FIXED_LEN_BYTE_ARRAY(cursor, count, opts);\n    default:\n      throw new Error(`unsupported type: ${type}`);\n  }\n}\n\nfunction encodeValues_BOOLEAN(values: boolean[]): Buffer {\n  const buf = Buffer.alloc(Math.ceil(values.length / 8));\n  buf.fill(0);\n  for (let i = 0; i < values.length; i++) {\n    if (values[i]) {\n      buf[Math.floor(i / 8)] |= 1 << i % 8;\n    }\n  }\n  return buf;\n}\n\nfunction decodeValues_BOOLEAN(cursor: CursorBuffer, count: number): boolean[] {\n  const values: boolean[] = [];\n  for (let i = 0; i < count; i++) {\n    const b = cursor.buffer[cursor.offset + Math.floor(i / 8)];\n    values.push((b & (1 << i % 8)) > 0);\n  }\n  cursor.offset += Math.ceil(count / 8);\n  return values;\n}\n\nfunction encodeValues_INT32(values: number[]): Buffer {\n  const buf = Buffer.alloc(4 * values.length);\n  for (let i = 0; i < values.length; i++) {\n    buf.writeInt32LE(values[i], i * 4);\n  }\n  return buf;\n}\n\nfunction decodeValues_INT32(cursor: CursorBuffer, count: number): number[] {\n  const values: number[] = [];\n  for (let i = 0; i < count; i++) {\n    values.push(cursor.buffer.readInt32LE(cursor.offset));\n    cursor.offset += 4;\n  }\n  return values;\n}\n\nfunction encodeValues_INT64(values: number[]): Buffer {\n  const buf = Buffer.alloc(8 * values.length);\n  for (let i = 0; i < values.length; i++) {\n    INT53.writeInt64LE(values[i], buf, i * 8);\n  }\n  return buf;\n}\n\nfunction decodeValues_INT64(cursor: CursorBuffer, count: number): number[] {\n  const values: number[] = [];\n  for (let i = 0; i < count; i++) {\n    values.push(INT53.readInt64LE(cursor.buffer, cursor.offset));\n    cursor.offset += 8;\n  }\n  return values;\n}\n\nfunction encodeValues_INT96(values: number[]): Buffer {\n  const buf = Buffer.alloc(12 * values.length);\n  for (let i = 0; i < values.length; i++) {\n    if (values[i] >= 0) {\n      INT53.writeInt64LE(values[i], buf, i * 12);\n      buf.writeUInt32LE(0, i * 12 + 8); // truncate to 64 actual precision\n    } else {\n      INT53.writeInt64LE(~-values[i] + 1, buf, i * 12);\n      buf.writeUInt32LE(0xffffffff, i * 12 + 8); // truncate to 64 actual precision\n    }\n  }\n  return buf;\n}\n\nfunction decodeValues_INT96(cursor: CursorBuffer, count: number): number[] {\n  const values: number[] = [];\n  for (let i = 0; i < count; i++) {\n    const low = INT53.readInt64LE(cursor.buffer, cursor.offset);\n    const high = cursor.buffer.readUInt32LE(cursor.offset + 8);\n    if (high === 0xffffffff) {\n      values.push(~-low + 1); // truncate to 64 actual precision\n    } else {\n      values.push(low); // truncate to 64 actual precision\n    }\n    cursor.offset += 12;\n  }\n  return values;\n}\n\nfunction encodeValues_FLOAT(values: number[]): Buffer {\n  const buf = Buffer.alloc(4 * values.length);\n  for (let i = 0; i < values.length; i++) {\n    buf.writeFloatLE(values[i], i * 4);\n  }\n  return buf;\n}\n\nfunction decodeValues_FLOAT(cursor: CursorBuffer, count: number): number[] {\n  const values: number[] = [];\n  for (let i = 0; i < count; i++) {\n    values.push(cursor.buffer.readFloatLE(cursor.offset));\n    cursor.offset += 4;\n  }\n  return values;\n}\n\nfunction encodeValues_DOUBLE(values: number[]): Buffer {\n  const buf = Buffer.alloc(8 * values.length);\n  for (let i = 0; i < values.length; i++) {\n    buf.writeDoubleLE(values[i], i * 8);\n  }\n  return buf;\n}\n\nfunction decodeValues_DOUBLE(cursor: CursorBuffer, count: number): number[] {\n  const values: number[] = [];\n  for (let i = 0; i < count; i++) {\n    values.push(cursor.buffer.readDoubleLE(cursor.offset));\n    cursor.offset += 8;\n  }\n  return values;\n}\n\nfunction encodeValues_BYTE_ARRAY(values: Buffer[]): Buffer {\n  // tslint:disable-next-line:variable-name\n  let buf_len = 0;\n  for (let i = 0; i < values.length; i++) {\n    values[i] = Buffer.from(values[i]);\n    buf_len += 4 + values[i].length;\n  }\n  const buf = Buffer.alloc(buf_len);\n  // tslint:disable-next-line:variable-name\n  let buf_pos = 0;\n  for (let i = 0; i < values.length; i++) {\n    buf.writeUInt32LE(values[i].length, buf_pos);\n    values[i].copy(buf, buf_pos + 4);\n    buf_pos += 4 + values[i].length;\n  }\n  return buf;\n}\n\nfunction decodeValues_BYTE_ARRAY(cursor: CursorBuffer, count: number): Buffer[] {\n  const values: Buffer[] = [];\n  for (let i = 0; i < count; i++) {\n    const len = cursor.buffer.readUInt32LE(cursor.offset);\n    cursor.offset += 4;\n    // values.push(cursor.buffer.buffer.slice(cursor.offset, cursor.offset + len));\n    values.push(cursor.buffer.slice(cursor.offset, cursor.offset + len));\n    cursor.offset += len;\n  }\n  return values;\n}\n\nfunction encodeValues_FIXED_LEN_BYTE_ARRAY(values: Buffer[], opts: ParquetCodecOptions): Buffer {\n  if (!opts.typeLength) {\n    throw new Error('missing option: typeLength (required for FIXED_LEN_BYTE_ARRAY)');\n  }\n  for (let i = 0; i < values.length; i++) {\n    values[i] = Buffer.from(values[i]);\n    if (values[i].length !== opts.typeLength) {\n      throw new Error(`invalid value for FIXED_LEN_BYTE_ARRAY: ${values[i]}`);\n    }\n  }\n  return Buffer.concat(values);\n}\n\nfunction decodeValues_FIXED_LEN_BYTE_ARRAY(\n  cursor: CursorBuffer,\n  count: number,\n  opts: ParquetCodecOptions\n): Buffer[] {\n  const values: Buffer[] = [];\n  if (!opts.typeLength) {\n    throw new Error('missing option: typeLength (required for FIXED_LEN_BYTE_ARRAY)');\n  }\n  for (let i = 0; i < count; i++) {\n    values.push(cursor.buffer.slice(cursor.offset, cursor.offset + opts.typeLength));\n    cursor.offset += opts.typeLength;\n  }\n  return values;\n}\n", "// Forked from https://github.com/kbajalc/parquets under MIT license (Copyright (c) 2017 ironSource Ltd.)\n\nimport type {PrimitiveType} from '../schema/declare';\nimport type {CursorBuffer, ParquetCodecOptions} from './declare';\nimport varint from 'varint';\n\n// eslint-disable-next-line max-statements, complexity\nexport function encodeValues(\n  type: PrimitiveType,\n  values: any[],\n  opts: ParquetCodecOptions\n): Buffer {\n  if (!('bitWidth' in opts)) {\n    throw new Error('bitWidth is required');\n  }\n\n  switch (type) {\n    case 'BOOLEAN':\n    case 'INT32':\n    case 'INT64':\n      // tslint:disable-next-line:no-parameter-reassignment\n      values = values.map((x) => parseInt(x, 10));\n      break;\n\n    default:\n      throw new Error(`unsupported type: ${type}`);\n  }\n\n  let buf = Buffer.alloc(0);\n  let run: any[] = [];\n  let repeats = 0;\n\n  for (let i = 0; i < values.length; i++) {\n    // If we are at the beginning of a run and the next value is same we start\n    // collecting repeated values\n    if (repeats === 0 && run.length % 8 === 0 && values[i] === values[i + 1]) {\n      // If we have any data in runs we need to encode them\n      if (run.length) {\n        buf = Buffer.concat([buf, encodeRunBitpacked(run, opts)]);\n        run = [];\n      }\n      repeats = 1;\n    } else if (repeats > 0 && values[i] === values[i - 1]) {\n      repeats += 1;\n    } else {\n      // If values changes we need to post any previous repeated values\n      if (repeats) {\n        buf = Buffer.concat([buf, encodeRunRepeated(values[i - 1], repeats, opts)]);\n        repeats = 0;\n      }\n      run.push(values[i]);\n    }\n  }\n\n  if (repeats) {\n    buf = Buffer.concat([buf, encodeRunRepeated(values[values.length - 1], repeats, opts)]);\n  } else if (run.length) {\n    buf = Buffer.concat([buf, encodeRunBitpacked(run, opts)]);\n  }\n\n  if (opts.disableEnvelope) {\n    return buf;\n  }\n\n  const envelope = Buffer.alloc(buf.length + 4);\n\n  // @ts-ignore buffer polyfill\n  envelope.writeUInt32LE(buf.length, undefined);\n  buf.copy(envelope, 4);\n\n  return envelope;\n}\n\nexport function decodeValues(\n  type: PrimitiveType,\n  cursor: CursorBuffer,\n  count: number,\n  opts: ParquetCodecOptions\n): number[] {\n  if (!('bitWidth' in opts)) {\n    throw new Error('bitWidth is required');\n  }\n\n  if (!opts.disableEnvelope) {\n    cursor.offset += 4;\n  }\n\n  let values: number[] = [];\n  while (values.length < count) {\n    const header = varint.decode(cursor.buffer, cursor.offset);\n    cursor.offset += varint.encodingLength(header);\n    if (header & 1) {\n      const count = (header >> 1) * 8;\n      values.push(...decodeRunBitpacked(cursor, count, opts));\n    } else {\n      const count = header >> 1;\n      values.push(...decodeRunRepeated(cursor, count, opts));\n    }\n  }\n  values = values.slice(0, count);\n\n  if (values.length !== count) {\n    throw new Error('invalid RLE encoding');\n  }\n\n  return values;\n}\n\nfunction decodeRunBitpacked(\n  cursor: CursorBuffer,\n  count: number,\n  opts: ParquetCodecOptions\n): number[] {\n  // @ts-ignore\n  const bitWidth: number = opts.bitWidth;\n\n  if (count % 8 !== 0) {\n    throw new Error('must be a multiple of 8');\n  }\n\n  // tslint:disable-next-line:prefer-array-literal\n  const values = new Array(count).fill(0);\n  for (let b = 0; b < bitWidth * count; b++) {\n    if (cursor.buffer[cursor.offset + Math.floor(b / 8)] & (1 << b % 8)) {\n      values[Math.floor(b / bitWidth)] |= 1 << b % bitWidth;\n    }\n  }\n\n  cursor.offset += bitWidth * (count / 8);\n  return values;\n}\n\nfunction decodeRunRepeated(\n  cursor: CursorBuffer,\n  count: number,\n  opts: ParquetCodecOptions\n): number[] {\n  // @ts-ignore\n  const bitWidth: number = opts.bitWidth;\n\n  let value = 0;\n  for (let i = 0; i < Math.ceil(bitWidth / 8); i++) {\n    // eslint-disable-next-line\n    value << 8; //  TODO - this looks wrong\n    value += cursor.buffer[cursor.offset];\n    cursor.offset += 1;\n  }\n\n  // tslint:disable-next-line:prefer-array-literal\n  return new Array(count).fill(value);\n}\n\nfunction encodeRunBitpacked(values: number[], opts: ParquetCodecOptions): Buffer {\n  // @ts-ignore\n  const bitWidth: number = opts.bitWidth;\n\n  for (let i = 0; i < values.length % 8; i++) {\n    values.push(0);\n  }\n\n  const buf = Buffer.alloc(Math.ceil(bitWidth * (values.length / 8)));\n  for (let b = 0; b < bitWidth * values.length; b++) {\n    if ((values[Math.floor(b / bitWidth)] & (1 << b % bitWidth)) > 0) {\n      buf[Math.floor(b / 8)] |= 1 << b % 8;\n    }\n  }\n\n  return Buffer.concat([Buffer.from(varint.encode(((values.length / 8) << 1) | 1)), buf]);\n}\n\nfunction encodeRunRepeated(value: number, count: number, opts: ParquetCodecOptions): Buffer {\n  // @ts-ignore\n  const bitWidth: number = opts.bitWidth;\n\n  const buf = Buffer.alloc(Math.ceil(bitWidth / 8));\n\n  for (let i = 0; i < buf.length; i++) {\n    buf.writeUInt8(value & 0xff, i);\n    // eslint-disable-next-line\n    value >> 8; //  TODO - this looks wrong\n  }\n\n  return Buffer.concat([Buffer.from(varint.encode(count << 1)), buf]);\n}\n", "import {decodeValues as decodeRleValues} from './rle';\n\nexport function decodeValues(type, cursor, count, opts) {\n  opts.bitWidth = cursor.buffer.slice(cursor.offset, cursor.offset + 1).readInt8(0);\n  cursor.offset += 1;\n  return decodeRleValues(type, cursor, count, {...opts, disableEnvelope: true});\n}\n\nexport function encodeValues(type, cursor, count, opts) {\n  throw new Error('Encode dictionary functionality is not supported');\n}\n", "// Forked from https://github.com/kbajalc/parquets under MIT license (Copyright (c) 2017 ironSource Ltd.)\nimport type {ParquetCodec} from '../schema/declare';\nimport type {ParquetCodecKit} from './declare';\nimport * as PLAIN from './plain';\nimport * as RLE from './rle';\nimport * as DICTIONARY from './dictionary';\n\nexport * from './declare';\n\nexport const PARQUET_CODECS: Record<ParquetCodec, ParquetCodecKit> = {\n  PLAIN: {\n    encodeValues: PLAIN.encodeValues,\n    decodeValues: PLAIN.decodeValues\n  },\n  RLE: {\n    encodeValues: RLE.encodeValues,\n    decodeValues: RLE.decodeValues\n  },\n  // Using the PLAIN_DICTIONARY enum value is deprecated in the Parquet 2.0 specification.\n  PLAIN_DICTIONARY: {\n    // @ts-ignore\n    encodeValues: DICTIONARY.encodeValues,\n    decodeValues: DICTIONARY.decodeValues\n  },\n  // Prefer using RLE_DICTIONARY in a data page and PLAIN in a dictionary page for Parquet 2.0+ files.\n  RLE_DICTIONARY: {\n    // @ts-ignore\n    encodeValues: DICTIONARY.encodeValues,\n    decodeValues: DICTIONARY.decodeValues\n  }\n};\n", "// Compression interface\nimport {concatenateArrayBuffersAsync} from '@loaders.gl/loader-utils';\n\n/** Compression options */\nexport type CompressionOptions = {\n  // operation: 'compress' | 'decompress';\n  modules?: {[moduleName: string]: any};\n};\n\n/** Compression */\nexport abstract class Compression {\n  abstract readonly name: string;\n  abstract readonly extensions: string[];\n  abstract readonly contentEncodings: string[];\n  abstract readonly isSupported: boolean;\n\n  constructor(options?: CompressionOptions) {\n    this.compressBatches = this.compressBatches.bind(this);\n    this.decompressBatches = this.decompressBatches.bind(this);\n  }\n\n  /** Preloads any dynamic libraries. May enable sync functions */\n  async preload(): Promise<void> {\n    return;\n  }\n\n  /** Asynchronously compress data */\n  async compress(input: ArrayBuffer): Promise<ArrayBuffer> {\n    await this.preload();\n    return this.compressSync(input);\n  }\n\n  /** Asynchronously decompress data */\n  async decompress(input: ArrayBuffer, size?: number): Promise<ArrayBuffer> {\n    await this.preload();\n    return this.decompressSync(input, size);\n  }\n\n  /** Synchronously compress data */\n  compressSync(input: ArrayBuffer): ArrayBuffer {\n    throw new Error(`${this.name}: sync compression not supported`);\n  }\n\n  /** Synchronously compress data */\n  decompressSync(input: ArrayBuffer, size?: number): ArrayBuffer {\n    throw new Error(`${this.name}: sync decompression not supported`);\n  }\n\n  /** Compress batches */\n  async *compressBatches(\n    asyncIterator: AsyncIterable<ArrayBuffer> | Iterable<ArrayBuffer>\n  ): AsyncIterable<ArrayBuffer> {\n    // TODO - implement incremental compression\n    const input = await this.concatenate(asyncIterator);\n    yield this.compress(input);\n  }\n\n  /** Decompress batches */\n  async *decompressBatches(\n    asyncIterator: AsyncIterable<ArrayBuffer> | Iterable<ArrayBuffer>\n  ): AsyncIterable<ArrayBuffer> {\n    // TODO - implement incremental compression\n    const input = await this.concatenate(asyncIterator);\n    yield this.decompress(input);\n  }\n\n  // HELPERS\n\n  protected concatenate(asyncIterator): Promise<ArrayBuffer> {\n    return concatenateArrayBuffersAsync(asyncIterator);\n  }\n\n  protected improveError(error) {\n    if (!error.message.includes(this.name)) {\n      error.message = `${this.name} ${error.message}`;\n    }\n    return error;\n  }\n}\n", "// NO COMPRESSION\nimport type {CompressionOptions} from './compression';\nimport {Compression} from './compression';\n\n/**\n * Applies no compression.\n */\nexport class NoCompression extends Compression {\n  readonly name: string = 'uncompressed';\n  readonly extensions: string[] = [];\n  readonly contentEncodings: string[] = [];\n  readonly isSupported = true;\n\n  readonly options: CompressionOptions;\n\n  constructor(options?: CompressionOptions) {\n    super(options);\n    this.options = options || {};\n  }\n\n  compressSync(input: ArrayBuffer): ArrayBuffer {\n    return input;\n  }\n\n  decompressSync(input: ArrayBuffer): ArrayBuffer {\n    return input;\n  }\n\n  async *compressBatches(\n    asyncIterator: AsyncIterable<ArrayBuffer> | Iterable<ArrayBuffer>\n  ): AsyncIterable<ArrayBuffer> {\n    return yield* asyncIterator;\n  }\n\n  async *decompressBatches(\n    asyncIterator: AsyncIterable<ArrayBuffer> | Iterable<ArrayBuffer>\n  ): AsyncIterable<ArrayBuffer> {\n    return yield* asyncIterator;\n  }\n}\n", "// DEFLATE\nimport type {CompressionOptions} from './compression';\nimport {Compression} from './compression';\nimport {isBrowser, toArrayBuffer} from '@loaders.gl/loader-utils';\nimport pako from 'pako'; // https://bundlephobia.com/package/pako\nimport zlib from 'zlib';\nimport {promisify1} from '@loaders.gl/loader-utils';\n\nexport type DeflateCompressionOptions = CompressionOptions & {\n  deflate?: pako.InflateOptions & pako.DeflateOptions & {useZlib?: boolean};\n  /** creates raw data, without wrapper (header and adler32 crc). */\n  raw?: boolean;\n};\n\n/**\n * DEFLATE compression / decompression\n */\nexport class DeflateCompression extends Compression {\n  readonly name: string = 'deflate';\n  readonly extensions: string[] = [];\n  readonly contentEncodings = ['deflate'];\n  readonly isSupported = true;\n\n  readonly options: DeflateCompressionOptions;\n\n  private _chunks: ArrayBuffer[] = [];\n\n  constructor(options: DeflateCompressionOptions = {}) {\n    super(options);\n    this.options = options;\n  }\n\n  async compress(input: ArrayBuffer): Promise<ArrayBuffer> {\n    // On Node.js we can use built-in zlib\n    if (!isBrowser && this.options.deflate?.useZlib) {\n      const buffer = this.options.deflate?.gzip\n        ? await promisify1(zlib.gzip)(input)\n        : await promisify1(zlib.deflate)(input);\n      return toArrayBuffer(buffer);\n    }\n    return this.compressSync(input);\n  }\n\n  async decompress(input: ArrayBuffer): Promise<ArrayBuffer> {\n    // On Node.js we can use built-in zlib\n    if (!isBrowser && this.options.deflate?.useZlib) {\n      const buffer = this.options.deflate?.gzip\n        ? await promisify1(zlib.gunzip)(input)\n        : await promisify1(zlib.inflate)(input);\n      return toArrayBuffer(buffer);\n    }\n    return this.decompressSync(input);\n  }\n\n  compressSync(input: ArrayBuffer): ArrayBuffer {\n    // On Node.js we can use built-in zlib\n    if (!isBrowser && this.options.deflate?.useZlib) {\n      const buffer = this.options.deflate?.gzip ? zlib.gzipSync(input) : zlib.deflateSync(input);\n      return toArrayBuffer(buffer);\n    }\n    const pakoOptions: pako.DeflateOptions = this.options?.deflate || {};\n    const inputArray = new Uint8Array(input);\n    const deflate = this.options?.raw ? pako.deflateRaw : pako.deflate;\n    return deflate(inputArray, pakoOptions).buffer;\n  }\n\n  decompressSync(input: ArrayBuffer): ArrayBuffer {\n    // On Node.js we can use built-in zlib\n    if (!isBrowser && this.options.deflate?.useZlib) {\n      const buffer = this.options.deflate?.gzip ? zlib.gunzipSync(input) : zlib.inflateSync(input);\n      return toArrayBuffer(buffer);\n    }\n    const pakoOptions: pako.InflateOptions = this.options?.deflate || {};\n    const inputArray = new Uint8Array(input);\n    const inflate = this.options?.raw ? pako.inflateRaw : pako.inflate;\n    return inflate(inputArray, pakoOptions).buffer;\n  }\n\n  async *compressBatches(\n    asyncIterator: AsyncIterable<ArrayBuffer> | Iterable<ArrayBuffer>\n  ): AsyncIterable<ArrayBuffer> {\n    const pakoOptions: pako.DeflateOptions = this.options?.deflate || {};\n    const pakoProcessor = new pako.Deflate(pakoOptions);\n    yield* this.transformBatches(pakoProcessor, asyncIterator);\n  }\n\n  async *decompressBatches(\n    asyncIterator: AsyncIterable<ArrayBuffer> | Iterable<ArrayBuffer>\n  ): AsyncIterable<ArrayBuffer> {\n    const pakoOptions: pako.InflateOptions = this.options?.deflate || {};\n    const pakoProcessor = new pako.Inflate(pakoOptions);\n    yield* this.transformBatches(pakoProcessor, asyncIterator);\n  }\n\n  async *transformBatches(\n    pakoProcessor: pako.Inflate | pako.Deflate,\n    asyncIterator: AsyncIterable<ArrayBuffer> | Iterable<ArrayBuffer>\n  ): AsyncIterable<ArrayBuffer> {\n    pakoProcessor.onData = this._onData.bind(this);\n    pakoProcessor.onEnd = this._onEnd.bind(this);\n    for await (const chunk of asyncIterator) {\n      const uint8Array = new Uint8Array(chunk);\n      const ok = pakoProcessor.push(uint8Array, false); // false -> not last chunk\n      if (!ok) {\n        throw new Error(`${this._getError()}write`);\n      }\n      const chunks = this._getChunks();\n      yield* chunks;\n    }\n\n    // End\n    const emptyChunk = new Uint8Array(0);\n    const ok = pakoProcessor.push(emptyChunk, true); // true -> last chunk\n    if (!ok) {\n      // For some reason we get error but it still works???\n      // throw new Error(this._getError() + 'end');\n    }\n    const chunks = this._getChunks();\n    yield* chunks;\n  }\n\n  _onData(chunk) {\n    this._chunks.push(chunk);\n  }\n\n  _onEnd(status) {\n    if (status !== 0) {\n      throw new Error(this._getError(status) + this._chunks.length);\n    }\n  }\n\n  _getChunks(): ArrayBuffer[] {\n    const chunks = this._chunks;\n    this._chunks = [];\n    return chunks;\n  }\n\n  // TODO - For some reason we don't get the error message from pako in _onEnd?\n  _getError(code: number = 0): string {\n    const MESSAGES = {\n      /* Z_NEED_DICT       2  */\n      2: 'need dictionary',\n      /* Z_STREAM_END      1  */\n      1: 'stream end',\n      /* Z_OK              0  */\n      0: '',\n      /* Z_ERRNO         (-1) */\n      '-1': 'file error',\n      /* Z_STREAM_ERROR  (-2) */\n      '-2': 'stream error',\n      /* Z_DATA_ERROR    (-3) */\n      '-3': 'data error',\n      /* Z_MEM_ERROR     (-4) */\n      '-4': 'insufficient memory',\n      /* Z_BUF_ERROR     (-5) */\n      '-5': 'buffer error',\n      /* Z_VERSION_ERROR (-6) */\n      '-6': 'incompatible version'\n    };\n    return `${this.name}: ${MESSAGES[code]}`;\n  }\n}\n", "// GZIP\n// import {isBrowser} from '@loaders.gl/loader-utils';\nimport type {CompressionOptions} from './compression';\nimport {DeflateCompression} from './deflate-compression';\nimport pako from 'pako'; // https://bundlephobia.com/package/pako\n\nexport type GZipCompressionOptions = CompressionOptions & {\n  gzip?: pako.InflateOptions & pako.DeflateOptions;\n};\n\n/**\n * GZIP compression / decompression\n */\nexport class GZipCompression extends DeflateCompression {\n  readonly name: string = 'gzip';\n  readonly extensions = ['gz', 'gzip'];\n  readonly contentEncodings = ['gzip', 'x-gzip'];\n  readonly isSupported = true;\n\n  constructor(options?: GZipCompressionOptions) {\n    super({...options, deflate: {...options?.gzip, gzip: true}});\n  }\n}\n", "// @ts-nocheck\n/* eslint-disable */\n\n// Forked from https://raw.githubusercontent.com/google/brotli/master/js/decode.js\n// A pure javascript decoder is provided\n/* Copyright 2017 Google Inc. All Rights Reserved.\n *  Distributed under MIT license.\n * See file LICENSE for detail or copy at https://opensource.org/licenses/MIT\n */\n\n/**\n * @typedef {Object} Options\n * @property {?Int8Array} customDictionary\n */\nlet Options;\n\n/**\n * Private scope / static initializer for decoder.\n *\n * @return {function(!Int8Array, Options=):!Int8Array}\n */\nlet makeBrotliDecode = () => {\n  /**\n   * @constructor\n   * @param {!Int8Array} bytes\n   * @struct\n   */\n  function InputStream(bytes) {\n    /** @type {!Int8Array} */\n    this.data = bytes;\n    /** @type {!number} */\n    this.offset = 0;\n  }\n\n  /* GENERATED CODE BEGIN */\n  /** @type {!Int32Array} */\n  let MAX_HUFFMAN_TABLE_SIZE = Int32Array.from([\n    256, 402, 436, 468, 500, 534, 566, 598, 630, 662, 694, 726, 758, 790, 822, 854, 886, 920, 952,\n    984, 1016, 1048, 1080\n  ]);\n  /** @type {!Int32Array} */\n  let CODE_LENGTH_CODE_ORDER = Int32Array.from([\n    1, 2, 3, 4, 0, 5, 17, 6, 16, 7, 8, 9, 10, 11, 12, 13, 14, 15\n  ]);\n  /** @type {!Int32Array} */\n  let DISTANCE_SHORT_CODE_INDEX_OFFSET = Int32Array.from([\n    0, 3, 2, 1, 0, 0, 0, 0, 0, 0, 3, 3, 3, 3, 3, 3\n  ]);\n  /** @type {!Int32Array} */\n  let DISTANCE_SHORT_CODE_VALUE_OFFSET = Int32Array.from([\n    0, 0, 0, 0, -1, 1, -2, 2, -3, 3, -1, 1, -2, 2, -3, 3\n  ]);\n  /** @type {!Int32Array} */\n  let FIXED_TABLE = Int32Array.from([\n    0x020000, 0x020004, 0x020003, 0x030002, 0x020000, 0x020004, 0x020003, 0x040001, 0x020000,\n    0x020004, 0x020003, 0x030002, 0x020000, 0x020004, 0x020003, 0x040005\n  ]);\n  /** @type {!Int32Array} */\n  let BLOCK_LENGTH_OFFSET = Int32Array.from([\n    1, 5, 9, 13, 17, 25, 33, 41, 49, 65, 81, 97, 113, 145, 177, 209, 241, 305, 369, 497, 753, 1265,\n    2289, 4337, 8433, 16625\n  ]);\n  /** @type {!Int32Array} */\n  let BLOCK_LENGTH_N_BITS = Int32Array.from([\n    2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 7, 8, 9, 10, 11, 12, 13, 24\n  ]);\n  /** @type {!Int16Array} */\n  let INSERT_LENGTH_N_BITS = Int16Array.from([\n    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x01, 0x02, 0x02, 0x03, 0x03, 0x04, 0x04, 0x05, 0x05,\n    0x06, 0x07, 0x08, 0x09, 0x0a, 0x0c, 0x0e, 0x18\n  ]);\n  /** @type {!Int16Array} */\n  let COPY_LENGTH_N_BITS = Int16Array.from([\n    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x01, 0x02, 0x02, 0x03, 0x03, 0x04, 0x04,\n    0x05, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0a, 0x18\n  ]);\n  /** @type {!Int16Array} */\n  let CMD_LOOKUP = new Int16Array(2816);\n  {\n    unpackCommandLookupTable(CMD_LOOKUP);\n  }\n  /**\n   * @param {number} i\n   * @return {number}\n   */\n  function log2floor(i) {\n    let /** @type{number} */ result = -1;\n    let /** @type{number} */ step = 16;\n    while (step > 0) {\n      if (i >>> step != 0) {\n        result += step;\n        i = i >>> step;\n      }\n      step = step >> 1;\n    }\n    return result + i;\n  }\n  /**\n   * @param {number} npostfix\n   * @param {number} ndirect\n   * @param {number} maxndistbits\n   * @return {number}\n   */\n  function calculateDistanceAlphabetSize(npostfix, ndirect, maxndistbits) {\n    return 16 + ndirect + 2 * (maxndistbits << npostfix);\n  }\n  /**\n   * @param {number} maxDistance\n   * @param {number} npostfix\n   * @param {number} ndirect\n   * @return {number}\n   */\n  function calculateDistanceAlphabetLimit(maxDistance, npostfix, ndirect) {\n    if (maxDistance < ndirect + (2 << npostfix)) {\n      throw 'maxDistance is too small';\n    }\n    let /** @type{number} */ offset = ((maxDistance - ndirect) >> npostfix) + 4;\n    let /** @type{number} */ ndistbits = log2floor(offset) - 1;\n    let /** @type{number} */ group = ((ndistbits - 1) << 1) | ((offset >> ndistbits) & 1);\n    return ((group - 1) << npostfix) + (1 << npostfix) + ndirect + 16;\n  }\n  /**\n   * @param {!Int16Array} cmdLookup\n   * @return {void}\n   */\n  function unpackCommandLookupTable(cmdLookup) {\n    let /** @type{!Int16Array} */ insertLengthOffsets = new Int16Array(24);\n    let /** @type{!Int16Array} */ copyLengthOffsets = new Int16Array(24);\n    copyLengthOffsets[0] = 2;\n    for (let /** @type{number} */ i = 0; i < 23; ++i) {\n      insertLengthOffsets[i + 1] = insertLengthOffsets[i] + (1 << INSERT_LENGTH_N_BITS[i]);\n      copyLengthOffsets[i + 1] = copyLengthOffsets[i] + (1 << COPY_LENGTH_N_BITS[i]);\n    }\n    for (let /** @type{number} */ cmdCode = 0; cmdCode < 704; ++cmdCode) {\n      let /** @type{number} */ rangeIdx = cmdCode >>> 6;\n      let /** @type{number} */ distanceContextOffset = -4;\n      if (rangeIdx >= 2) {\n        rangeIdx -= 2;\n        distanceContextOffset = 0;\n      }\n      let /** @type{number} */ insertCode =\n          (((0x29850 >>> (rangeIdx * 2)) & 0x3) << 3) | ((cmdCode >>> 3) & 7);\n      let /** @type{number} */ copyCode =\n          (((0x26244 >>> (rangeIdx * 2)) & 0x3) << 3) | (cmdCode & 7);\n      let /** @type{number} */ copyLengthOffset = copyLengthOffsets[copyCode];\n      let /** @type{number} */ distanceContext =\n          distanceContextOffset + (copyLengthOffset > 4 ? 3 : copyLengthOffset - 2);\n      let /** @type{number} */ index = cmdCode * 4;\n      cmdLookup[index + 0] = INSERT_LENGTH_N_BITS[insertCode] | (COPY_LENGTH_N_BITS[copyCode] << 8);\n      cmdLookup[index + 1] = insertLengthOffsets[insertCode];\n      cmdLookup[index + 2] = copyLengthOffsets[copyCode];\n      cmdLookup[index + 3] = distanceContext;\n    }\n  }\n  /**\n   * @param {!State} s\n   * @return {number}\n   */\n  function decodeWindowBits(s) {\n    let /** @type{number} */ largeWindowEnabled = s.isLargeWindow;\n    s.isLargeWindow = 0;\n    if (s.bitOffset >= 16) {\n      s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n      s.bitOffset -= 16;\n    }\n    if (readFewBits(s, 1) == 0) {\n      return 16;\n    }\n    let /** @type{number} */ n = readFewBits(s, 3);\n    if (n != 0) {\n      return 17 + n;\n    }\n    n = readFewBits(s, 3);\n    if (n != 0) {\n      if (n == 1) {\n        if (largeWindowEnabled == 0) {\n          return -1;\n        }\n        s.isLargeWindow = 1;\n        if (readFewBits(s, 1) == 1) {\n          return -1;\n        }\n        n = readFewBits(s, 6);\n        if (n < 10 || n > 30) {\n          return -1;\n        }\n        return n;\n      } else {\n        return 8 + n;\n      }\n    }\n    return 17;\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function enableEagerOutput(s) {\n    if (s.runningState != 1) {\n      throw 'State MUST be freshly initialized';\n    }\n    s.isEager = 1;\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function enableLargeWindow(s) {\n    if (s.runningState != 1) {\n      throw 'State MUST be freshly initialized';\n    }\n    s.isLargeWindow = 1;\n  }\n  /**\n   * @param {!State} s\n   * @param {!Int8Array} data\n   * @return {void}\n   */\n  function attachDictionaryChunk(s, data) {\n    if (s.runningState != 1) {\n      throw 'State MUST be freshly initialized';\n    }\n    if (s.cdNumChunks == 0) {\n      s.cdChunks = new Array(16);\n      s.cdChunkOffsets = new Int32Array(16);\n      s.cdBlockBits = -1;\n    }\n    if (s.cdNumChunks == 15) {\n      throw 'Too many dictionary chunks';\n    }\n    s.cdChunks[s.cdNumChunks] = data;\n    s.cdNumChunks++;\n    s.cdTotalSize += data.length;\n    s.cdChunkOffsets[s.cdNumChunks] = s.cdTotalSize;\n  }\n  /**\n   * @param {!State} s\n   * @param {!InputStream} input\n   * @return {void}\n   */\n  function initState(s, input) {\n    if (s.runningState != 0) {\n      throw 'State MUST be uninitialized';\n    }\n    s.blockTrees = new Int32Array(3091);\n    s.blockTrees[0] = 7;\n    s.distRbIdx = 3;\n    let /** @type{number} */ maxDistanceAlphabetLimit = calculateDistanceAlphabetLimit(\n        0x7ffffffc,\n        3,\n        15 << 3\n      );\n    s.distExtraBits = new Int8Array(maxDistanceAlphabetLimit);\n    s.distOffset = new Int32Array(maxDistanceAlphabetLimit);\n    s.input = input;\n    initBitReader(s);\n    s.runningState = 1;\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function close(s) {\n    if (s.runningState == 0) {\n      throw 'State MUST be initialized';\n    }\n    if (s.runningState == 11) {\n      return;\n    }\n    s.runningState = 11;\n    if (s.input != null) {\n      closeInput(s.input);\n      s.input = null;\n    }\n  }\n  /**\n   * @param {!State} s\n   * @return {number}\n   */\n  function decodeVarLenUnsignedByte(s) {\n    if (s.bitOffset >= 16) {\n      s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n      s.bitOffset -= 16;\n    }\n    if (readFewBits(s, 1) != 0) {\n      let /** @type{number} */ n = readFewBits(s, 3);\n      if (n == 0) {\n        return 1;\n      } else {\n        return readFewBits(s, n) + (1 << n);\n      }\n    }\n    return 0;\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function decodeMetaBlockLength(s) {\n    if (s.bitOffset >= 16) {\n      s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n      s.bitOffset -= 16;\n    }\n    s.inputEnd = readFewBits(s, 1);\n    s.metaBlockLength = 0;\n    s.isUncompressed = 0;\n    s.isMetadata = 0;\n    if (s.inputEnd != 0 && readFewBits(s, 1) != 0) {\n      return;\n    }\n    let /** @type{number} */ sizeNibbles = readFewBits(s, 2) + 4;\n    if (sizeNibbles == 7) {\n      s.isMetadata = 1;\n      if (readFewBits(s, 1) != 0) {\n        throw 'Corrupted reserved bit';\n      }\n      let /** @type{number} */ sizeBytes = readFewBits(s, 2);\n      if (sizeBytes == 0) {\n        return;\n      }\n      for (let /** @type{number} */ i = 0; i < sizeBytes; i++) {\n        if (s.bitOffset >= 16) {\n          s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n          s.bitOffset -= 16;\n        }\n        let /** @type{number} */ bits = readFewBits(s, 8);\n        if (bits == 0 && i + 1 == sizeBytes && sizeBytes > 1) {\n          throw 'Exuberant nibble';\n        }\n        s.metaBlockLength |= bits << (i * 8);\n      }\n    } else {\n      for (let /** @type{number} */ i = 0; i < sizeNibbles; i++) {\n        if (s.bitOffset >= 16) {\n          s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n          s.bitOffset -= 16;\n        }\n        let /** @type{number} */ bits = readFewBits(s, 4);\n        if (bits == 0 && i + 1 == sizeNibbles && sizeNibbles > 4) {\n          throw 'Exuberant nibble';\n        }\n        s.metaBlockLength |= bits << (i * 4);\n      }\n    }\n    s.metaBlockLength++;\n    if (s.inputEnd == 0) {\n      s.isUncompressed = readFewBits(s, 1);\n    }\n  }\n  /**\n   * @param {!Int32Array} tableGroup\n   * @param {number} tableIdx\n   * @param {!State} s\n   * @return {number}\n   */\n  function readSymbol(tableGroup, tableIdx, s) {\n    let /** @type{number} */ offset = tableGroup[tableIdx];\n    let /** @type{number} */ val = s.accumulator32 >>> s.bitOffset;\n    offset += val & 0xff;\n    let /** @type{number} */ bits = tableGroup[offset] >> 16;\n    let /** @type{number} */ sym = tableGroup[offset] & 0xffff;\n    if (bits <= 8) {\n      s.bitOffset += bits;\n      return sym;\n    }\n    offset += sym;\n    let /** @type{number} */ mask = (1 << bits) - 1;\n    offset += (val & mask) >>> 8;\n    s.bitOffset += (tableGroup[offset] >> 16) + 8;\n    return tableGroup[offset] & 0xffff;\n  }\n  /**\n   * @param {!Int32Array} tableGroup\n   * @param {number} tableIdx\n   * @param {!State} s\n   * @return {number}\n   */\n  function readBlockLength(tableGroup, tableIdx, s) {\n    if (s.bitOffset >= 16) {\n      s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n      s.bitOffset -= 16;\n    }\n    let /** @type{number} */ code = readSymbol(tableGroup, tableIdx, s);\n    let /** @type{number} */ n = BLOCK_LENGTH_N_BITS[code];\n    if (s.bitOffset >= 16) {\n      s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n      s.bitOffset -= 16;\n    }\n    return BLOCK_LENGTH_OFFSET[code] + (n <= 16 ? readFewBits(s, n) : readManyBits(s, n));\n  }\n  /**\n   * @param {!Int32Array} v\n   * @param {number} index\n   * @return {void}\n   */\n  function moveToFront(v, index) {\n    let /** @type{number} */ value = v[index];\n    for (; index > 0; index--) {\n      v[index] = v[index - 1];\n    }\n    v[0] = value;\n  }\n  /**\n   * @param {!Int8Array} v\n   * @param {number} vLen\n   * @return {void}\n   */\n  function inverseMoveToFrontTransform(v, vLen) {\n    let /** @type{!Int32Array} */ mtf = new Int32Array(256);\n    for (let /** @type{number} */ i = 0; i < 256; i++) {\n      mtf[i] = i;\n    }\n    for (let /** @type{number} */ i = 0; i < vLen; i++) {\n      let /** @type{number} */ index = v[i] & 0xff;\n      v[i] = mtf[index];\n      if (index != 0) {\n        moveToFront(mtf, index);\n      }\n    }\n  }\n  /**\n   * @param {!Int32Array} codeLengthCodeLengths\n   * @param {number} numSymbols\n   * @param {!Int32Array} codeLengths\n   * @param {!State} s\n   * @return {void}\n   */\n  function readHuffmanCodeLengths(codeLengthCodeLengths, numSymbols, codeLengths, s) {\n    let /** @type{number} */ symbol = 0;\n    let /** @type{number} */ prevCodeLen = 8;\n    let /** @type{number} */ repeat = 0;\n    let /** @type{number} */ repeatCodeLen = 0;\n    let /** @type{number} */ space = 32768;\n    let /** @type{!Int32Array} */ table = new Int32Array(32 + 1);\n    let /** @type{number} */ tableIdx = table.length - 1;\n    buildHuffmanTable(table, tableIdx, 5, codeLengthCodeLengths, 18);\n    while (symbol < numSymbols && space > 0) {\n      if (s.halfOffset > 2030) {\n        doReadMoreInput(s);\n      }\n      if (s.bitOffset >= 16) {\n        s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n        s.bitOffset -= 16;\n      }\n      let /** @type{number} */ p = (s.accumulator32 >>> s.bitOffset) & 31;\n      s.bitOffset += table[p] >> 16;\n      let /** @type{number} */ codeLen = table[p] & 0xffff;\n      if (codeLen < 16) {\n        repeat = 0;\n        codeLengths[symbol++] = codeLen;\n        if (codeLen != 0) {\n          prevCodeLen = codeLen;\n          space -= 32768 >> codeLen;\n        }\n      } else {\n        let /** @type{number} */ extraBits = codeLen - 14;\n        let /** @type{number} */ newLen = 0;\n        if (codeLen == 16) {\n          newLen = prevCodeLen;\n        }\n        if (repeatCodeLen != newLen) {\n          repeat = 0;\n          repeatCodeLen = newLen;\n        }\n        let /** @type{number} */ oldRepeat = repeat;\n        if (repeat > 0) {\n          repeat -= 2;\n          repeat <<= extraBits;\n        }\n        if (s.bitOffset >= 16) {\n          s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n          s.bitOffset -= 16;\n        }\n        repeat += readFewBits(s, extraBits) + 3;\n        let /** @type{number} */ repeatDelta = repeat - oldRepeat;\n        if (symbol + repeatDelta > numSymbols) {\n          throw 'symbol + repeatDelta > numSymbols';\n        }\n        for (let /** @type{number} */ i = 0; i < repeatDelta; i++) {\n          codeLengths[symbol++] = repeatCodeLen;\n        }\n        if (repeatCodeLen != 0) {\n          space -= repeatDelta << (15 - repeatCodeLen);\n        }\n      }\n    }\n    if (space != 0) {\n      throw 'Unused space';\n    }\n    codeLengths.fill(0, symbol, numSymbols);\n  }\n  /**\n   * @param {!Int32Array} symbols\n   * @param {number} length\n   * @return {void}\n   */\n  function checkDupes(symbols, length) {\n    for (let /** @type{number} */ i = 0; i < length - 1; ++i) {\n      for (let /** @type{number} */ j = i + 1; j < length; ++j) {\n        if (symbols[i] == symbols[j]) {\n          throw 'Duplicate simple Huffman code symbol';\n        }\n      }\n    }\n  }\n  /**\n   * @param {number} alphabetSizeMax\n   * @param {number} alphabetSizeLimit\n   * @param {!Int32Array} tableGroup\n   * @param {number} tableIdx\n   * @param {!State} s\n   * @return {number}\n   */\n  function readSimpleHuffmanCode(alphabetSizeMax, alphabetSizeLimit, tableGroup, tableIdx, s) {\n    let /** @type{!Int32Array} */ codeLengths = new Int32Array(alphabetSizeLimit);\n    let /** @type{!Int32Array} */ symbols = new Int32Array(4);\n    let /** @type{number} */ maxBits = 1 + log2floor(alphabetSizeMax - 1);\n    let /** @type{number} */ numSymbols = readFewBits(s, 2) + 1;\n    for (let /** @type{number} */ i = 0; i < numSymbols; i++) {\n      if (s.bitOffset >= 16) {\n        s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n        s.bitOffset -= 16;\n      }\n      let /** @type{number} */ symbol = readFewBits(s, maxBits);\n      if (symbol >= alphabetSizeLimit) {\n        throw \"Can't readHuffmanCode\";\n      }\n      symbols[i] = symbol;\n    }\n    checkDupes(symbols, numSymbols);\n    let /** @type{number} */ histogramId = numSymbols;\n    if (numSymbols == 4) {\n      histogramId += readFewBits(s, 1);\n    }\n    switch (histogramId) {\n      case 1:\n        codeLengths[symbols[0]] = 1;\n        break;\n      case 2:\n        codeLengths[symbols[0]] = 1;\n        codeLengths[symbols[1]] = 1;\n        break;\n      case 3:\n        codeLengths[symbols[0]] = 1;\n        codeLengths[symbols[1]] = 2;\n        codeLengths[symbols[2]] = 2;\n        break;\n      case 4:\n        codeLengths[symbols[0]] = 2;\n        codeLengths[symbols[1]] = 2;\n        codeLengths[symbols[2]] = 2;\n        codeLengths[symbols[3]] = 2;\n        break;\n      case 5:\n        codeLengths[symbols[0]] = 1;\n        codeLengths[symbols[1]] = 2;\n        codeLengths[symbols[2]] = 3;\n        codeLengths[symbols[3]] = 3;\n        break;\n      default:\n        break;\n    }\n    return buildHuffmanTable(tableGroup, tableIdx, 8, codeLengths, alphabetSizeLimit);\n  }\n  /**\n   * @param {number} alphabetSizeLimit\n   * @param {number} skip\n   * @param {!Int32Array} tableGroup\n   * @param {number} tableIdx\n   * @param {!State} s\n   * @return {number}\n   */\n  function readComplexHuffmanCode(alphabetSizeLimit, skip, tableGroup, tableIdx, s) {\n    let /** @type{!Int32Array} */ codeLengths = new Int32Array(alphabetSizeLimit);\n    let /** @type{!Int32Array} */ codeLengthCodeLengths = new Int32Array(18);\n    let /** @type{number} */ space = 32;\n    let /** @type{number} */ numCodes = 0;\n    for (let /** @type{number} */ i = skip; i < 18 && space > 0; i++) {\n      let /** @type{number} */ codeLenIdx = CODE_LENGTH_CODE_ORDER[i];\n      if (s.bitOffset >= 16) {\n        s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n        s.bitOffset -= 16;\n      }\n      let /** @type{number} */ p = (s.accumulator32 >>> s.bitOffset) & 15;\n      s.bitOffset += FIXED_TABLE[p] >> 16;\n      let /** @type{number} */ v = FIXED_TABLE[p] & 0xffff;\n      codeLengthCodeLengths[codeLenIdx] = v;\n      if (v != 0) {\n        space -= 32 >> v;\n        numCodes++;\n      }\n    }\n    if (space != 0 && numCodes != 1) {\n      throw 'Corrupted Huffman code histogram';\n    }\n    readHuffmanCodeLengths(codeLengthCodeLengths, alphabetSizeLimit, codeLengths, s);\n    return buildHuffmanTable(tableGroup, tableIdx, 8, codeLengths, alphabetSizeLimit);\n  }\n  /**\n   * @param {number} alphabetSizeMax\n   * @param {number} alphabetSizeLimit\n   * @param {!Int32Array} tableGroup\n   * @param {number} tableIdx\n   * @param {!State} s\n   * @return {number}\n   */\n  function readHuffmanCode(alphabetSizeMax, alphabetSizeLimit, tableGroup, tableIdx, s) {\n    if (s.halfOffset > 2030) {\n      doReadMoreInput(s);\n    }\n    if (s.bitOffset >= 16) {\n      s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n      s.bitOffset -= 16;\n    }\n    let /** @type{number} */ simpleCodeOrSkip = readFewBits(s, 2);\n    if (simpleCodeOrSkip == 1) {\n      return readSimpleHuffmanCode(alphabetSizeMax, alphabetSizeLimit, tableGroup, tableIdx, s);\n    } else {\n      return readComplexHuffmanCode(alphabetSizeLimit, simpleCodeOrSkip, tableGroup, tableIdx, s);\n    }\n  }\n  /**\n   * @param {number} contextMapSize\n   * @param {!Int8Array} contextMap\n   * @param {!State} s\n   * @return {number}\n   */\n  function decodeContextMap(contextMapSize, contextMap, s) {\n    if (s.halfOffset > 2030) {\n      doReadMoreInput(s);\n    }\n    let /** @type{number} */ numTrees = decodeVarLenUnsignedByte(s) + 1;\n    if (numTrees == 1) {\n      contextMap.fill(0, 0, contextMapSize);\n      return numTrees;\n    }\n    if (s.bitOffset >= 16) {\n      s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n      s.bitOffset -= 16;\n    }\n    let /** @type{number} */ useRleForZeros = readFewBits(s, 1);\n    let /** @type{number} */ maxRunLengthPrefix = 0;\n    if (useRleForZeros != 0) {\n      maxRunLengthPrefix = readFewBits(s, 4) + 1;\n    }\n    let /** @type{number} */ alphabetSize = numTrees + maxRunLengthPrefix;\n    let /** @type{number} */ tableSize = MAX_HUFFMAN_TABLE_SIZE[(alphabetSize + 31) >> 5];\n    let /** @type{!Int32Array} */ table = new Int32Array(tableSize + 1);\n    let /** @type{number} */ tableIdx = table.length - 1;\n    readHuffmanCode(alphabetSize, alphabetSize, table, tableIdx, s);\n    for (let /** @type{number} */ i = 0; i < contextMapSize; ) {\n      if (s.halfOffset > 2030) {\n        doReadMoreInput(s);\n      }\n      if (s.bitOffset >= 16) {\n        s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n        s.bitOffset -= 16;\n      }\n      let /** @type{number} */ code = readSymbol(table, tableIdx, s);\n      if (code == 0) {\n        contextMap[i] = 0;\n        i++;\n      } else if (code <= maxRunLengthPrefix) {\n        if (s.bitOffset >= 16) {\n          s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n          s.bitOffset -= 16;\n        }\n        let /** @type{number} */ reps = (1 << code) + readFewBits(s, code);\n        while (reps != 0) {\n          if (i >= contextMapSize) {\n            throw 'Corrupted context map';\n          }\n          contextMap[i] = 0;\n          i++;\n          reps--;\n        }\n      } else {\n        contextMap[i] = code - maxRunLengthPrefix;\n        i++;\n      }\n    }\n    if (s.bitOffset >= 16) {\n      s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n      s.bitOffset -= 16;\n    }\n    if (readFewBits(s, 1) == 1) {\n      inverseMoveToFrontTransform(contextMap, contextMapSize);\n    }\n    return numTrees;\n  }\n  /**\n   * @param {!State} s\n   * @param {number} treeType\n   * @param {number} numBlockTypes\n   * @return {number}\n   */\n  function decodeBlockTypeAndLength(s, treeType, numBlockTypes) {\n    let /** @type{!Int32Array} */ ringBuffers = s.rings;\n    let /** @type{number} */ offset = 4 + treeType * 2;\n    if (s.bitOffset >= 16) {\n      s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n      s.bitOffset -= 16;\n    }\n    let /** @type{number} */ blockType = readSymbol(s.blockTrees, 2 * treeType, s);\n    let /** @type{number} */ result = readBlockLength(s.blockTrees, 2 * treeType + 1, s);\n    if (blockType == 1) {\n      blockType = ringBuffers[offset + 1] + 1;\n    } else if (blockType == 0) {\n      blockType = ringBuffers[offset];\n    } else {\n      blockType -= 2;\n    }\n    if (blockType >= numBlockTypes) {\n      blockType -= numBlockTypes;\n    }\n    ringBuffers[offset] = ringBuffers[offset + 1];\n    ringBuffers[offset + 1] = blockType;\n    return result;\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function decodeLiteralBlockSwitch(s) {\n    s.literalBlockLength = decodeBlockTypeAndLength(s, 0, s.numLiteralBlockTypes);\n    let /** @type{number} */ literalBlockType = s.rings[5];\n    s.contextMapSlice = literalBlockType << 6;\n    s.literalTreeIdx = s.contextMap[s.contextMapSlice] & 0xff;\n    let /** @type{number} */ contextMode = s.contextModes[literalBlockType];\n    s.contextLookupOffset1 = contextMode << 9;\n    s.contextLookupOffset2 = s.contextLookupOffset1 + 256;\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function decodeCommandBlockSwitch(s) {\n    s.commandBlockLength = decodeBlockTypeAndLength(s, 1, s.numCommandBlockTypes);\n    s.commandTreeIdx = s.rings[7];\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function decodeDistanceBlockSwitch(s) {\n    s.distanceBlockLength = decodeBlockTypeAndLength(s, 2, s.numDistanceBlockTypes);\n    s.distContextMapSlice = s.rings[9] << 2;\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function maybeReallocateRingBuffer(s) {\n    let /** @type{number} */ newSize = s.maxRingBufferSize;\n    if (newSize > s.expectedTotalSize) {\n      let /** @type{number} */ minimalNewSize = s.expectedTotalSize;\n      while (newSize >> 1 > minimalNewSize) {\n        newSize >>= 1;\n      }\n      if (s.inputEnd == 0 && newSize < 16384 && s.maxRingBufferSize >= 16384) {\n        newSize = 16384;\n      }\n    }\n    if (newSize <= s.ringBufferSize) {\n      return;\n    }\n    let /** @type{number} */ ringBufferSizeWithSlack = newSize + 37;\n    let /** @type{!Int8Array} */ newBuffer = new Int8Array(ringBufferSizeWithSlack);\n    if (s.ringBuffer.length != 0) {\n      newBuffer.set(s.ringBuffer.subarray(0, 0 + s.ringBufferSize), 0);\n    }\n    s.ringBuffer = newBuffer;\n    s.ringBufferSize = newSize;\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function readNextMetablockHeader(s) {\n    if (s.inputEnd != 0) {\n      s.nextRunningState = 10;\n      s.runningState = 12;\n      return;\n    }\n    s.literalTreeGroup = new Int32Array(0);\n    s.commandTreeGroup = new Int32Array(0);\n    s.distanceTreeGroup = new Int32Array(0);\n    if (s.halfOffset > 2030) {\n      doReadMoreInput(s);\n    }\n    decodeMetaBlockLength(s);\n    if (s.metaBlockLength == 0 && s.isMetadata == 0) {\n      return;\n    }\n    if (s.isUncompressed != 0 || s.isMetadata != 0) {\n      jumpToByteBoundary(s);\n      s.runningState = s.isMetadata != 0 ? 5 : 6;\n    } else {\n      s.runningState = 3;\n    }\n    if (s.isMetadata != 0) {\n      return;\n    }\n    s.expectedTotalSize += s.metaBlockLength;\n    if (s.expectedTotalSize > 1 << 30) {\n      s.expectedTotalSize = 1 << 30;\n    }\n    if (s.ringBufferSize < s.maxRingBufferSize) {\n      maybeReallocateRingBuffer(s);\n    }\n  }\n  /**\n   * @param {!State} s\n   * @param {number} treeType\n   * @param {number} numBlockTypes\n   * @return {number}\n   */\n  function readMetablockPartition(s, treeType, numBlockTypes) {\n    let /** @type{number} */ offset = s.blockTrees[2 * treeType];\n    if (numBlockTypes <= 1) {\n      s.blockTrees[2 * treeType + 1] = offset;\n      s.blockTrees[2 * treeType + 2] = offset;\n      return 1 << 28;\n    }\n    let /** @type{number} */ blockTypeAlphabetSize = numBlockTypes + 2;\n    offset += readHuffmanCode(\n      blockTypeAlphabetSize,\n      blockTypeAlphabetSize,\n      s.blockTrees,\n      2 * treeType,\n      s\n    );\n    s.blockTrees[2 * treeType + 1] = offset;\n    let /** @type{number} */ blockLengthAlphabetSize = 26;\n    offset += readHuffmanCode(\n      blockLengthAlphabetSize,\n      blockLengthAlphabetSize,\n      s.blockTrees,\n      2 * treeType + 1,\n      s\n    );\n    s.blockTrees[2 * treeType + 2] = offset;\n    return readBlockLength(s.blockTrees, 2 * treeType + 1, s);\n  }\n  /**\n   * @param {!State} s\n   * @param {number} alphabetSizeLimit\n   * @return {void}\n   */\n  function calculateDistanceLut(s, alphabetSizeLimit) {\n    let /** @type{!Int8Array} */ distExtraBits = s.distExtraBits;\n    let /** @type{!Int32Array} */ distOffset = s.distOffset;\n    let /** @type{number} */ npostfix = s.distancePostfixBits;\n    let /** @type{number} */ ndirect = s.numDirectDistanceCodes;\n    let /** @type{number} */ postfix = 1 << npostfix;\n    let /** @type{number} */ bits = 1;\n    let /** @type{number} */ half = 0;\n    let /** @type{number} */ i = 16;\n    for (let /** @type{number} */ j = 0; j < ndirect; ++j) {\n      distExtraBits[i] = 0;\n      distOffset[i] = j + 1;\n      ++i;\n    }\n    while (i < alphabetSizeLimit) {\n      let /** @type{number} */ base = ndirect + ((((2 + half) << bits) - 4) << npostfix) + 1;\n      for (let /** @type{number} */ j = 0; j < postfix; ++j) {\n        distExtraBits[i] = bits;\n        distOffset[i] = base + j;\n        ++i;\n      }\n      bits = bits + half;\n      half = half ^ 1;\n    }\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function readMetablockHuffmanCodesAndContextMaps(s) {\n    s.numLiteralBlockTypes = decodeVarLenUnsignedByte(s) + 1;\n    s.literalBlockLength = readMetablockPartition(s, 0, s.numLiteralBlockTypes);\n    s.numCommandBlockTypes = decodeVarLenUnsignedByte(s) + 1;\n    s.commandBlockLength = readMetablockPartition(s, 1, s.numCommandBlockTypes);\n    s.numDistanceBlockTypes = decodeVarLenUnsignedByte(s) + 1;\n    s.distanceBlockLength = readMetablockPartition(s, 2, s.numDistanceBlockTypes);\n    if (s.halfOffset > 2030) {\n      doReadMoreInput(s);\n    }\n    if (s.bitOffset >= 16) {\n      s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n      s.bitOffset -= 16;\n    }\n    s.distancePostfixBits = readFewBits(s, 2);\n    s.numDirectDistanceCodes = readFewBits(s, 4) << s.distancePostfixBits;\n    s.contextModes = new Int8Array(s.numLiteralBlockTypes);\n    for (let /** @type{number} */ i = 0; i < s.numLiteralBlockTypes; ) {\n      let /** @type{number} */ limit = min(i + 96, s.numLiteralBlockTypes);\n      for (; i < limit; ++i) {\n        if (s.bitOffset >= 16) {\n          s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n          s.bitOffset -= 16;\n        }\n        s.contextModes[i] = readFewBits(s, 2);\n      }\n      if (s.halfOffset > 2030) {\n        doReadMoreInput(s);\n      }\n    }\n    s.contextMap = new Int8Array(s.numLiteralBlockTypes << 6);\n    let /** @type{number} */ numLiteralTrees = decodeContextMap(\n        s.numLiteralBlockTypes << 6,\n        s.contextMap,\n        s\n      );\n    s.trivialLiteralContext = 1;\n    for (let /** @type{number} */ j = 0; j < s.numLiteralBlockTypes << 6; j++) {\n      if (s.contextMap[j] != j >> 6) {\n        s.trivialLiteralContext = 0;\n        break;\n      }\n    }\n    s.distContextMap = new Int8Array(s.numDistanceBlockTypes << 2);\n    let /** @type{number} */ numDistTrees = decodeContextMap(\n        s.numDistanceBlockTypes << 2,\n        s.distContextMap,\n        s\n      );\n    s.literalTreeGroup = decodeHuffmanTreeGroup(256, 256, numLiteralTrees, s);\n    s.commandTreeGroup = decodeHuffmanTreeGroup(704, 704, s.numCommandBlockTypes, s);\n    let /** @type{number} */ distanceAlphabetSizeMax = calculateDistanceAlphabetSize(\n        s.distancePostfixBits,\n        s.numDirectDistanceCodes,\n        24\n      );\n    let /** @type{number} */ distanceAlphabetSizeLimit = distanceAlphabetSizeMax;\n    if (s.isLargeWindow == 1) {\n      distanceAlphabetSizeMax = calculateDistanceAlphabetSize(\n        s.distancePostfixBits,\n        s.numDirectDistanceCodes,\n        62\n      );\n      distanceAlphabetSizeLimit = calculateDistanceAlphabetLimit(\n        0x7ffffffc,\n        s.distancePostfixBits,\n        s.numDirectDistanceCodes\n      );\n    }\n    s.distanceTreeGroup = decodeHuffmanTreeGroup(\n      distanceAlphabetSizeMax,\n      distanceAlphabetSizeLimit,\n      numDistTrees,\n      s\n    );\n    calculateDistanceLut(s, distanceAlphabetSizeLimit);\n    s.contextMapSlice = 0;\n    s.distContextMapSlice = 0;\n    s.contextLookupOffset1 = s.contextModes[0] * 512;\n    s.contextLookupOffset2 = s.contextLookupOffset1 + 256;\n    s.literalTreeIdx = 0;\n    s.commandTreeIdx = 0;\n    s.rings[4] = 1;\n    s.rings[5] = 0;\n    s.rings[6] = 1;\n    s.rings[7] = 0;\n    s.rings[8] = 1;\n    s.rings[9] = 0;\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function copyUncompressedData(s) {\n    let /** @type{!Int8Array} */ ringBuffer = s.ringBuffer;\n    if (s.metaBlockLength <= 0) {\n      reload(s);\n      s.runningState = 2;\n      return;\n    }\n    let /** @type{number} */ chunkLength = min(s.ringBufferSize - s.pos, s.metaBlockLength);\n    copyRawBytes(s, ringBuffer, s.pos, chunkLength);\n    s.metaBlockLength -= chunkLength;\n    s.pos += chunkLength;\n    if (s.pos == s.ringBufferSize) {\n      s.nextRunningState = 6;\n      s.runningState = 12;\n      return;\n    }\n    reload(s);\n    s.runningState = 2;\n  }\n  /**\n   * @param {!State} s\n   * @return {number}\n   */\n  function writeRingBuffer(s) {\n    let /** @type{number} */ toWrite = min(\n        s.outputLength - s.outputUsed,\n        s.ringBufferBytesReady - s.ringBufferBytesWritten\n      );\n    if (toWrite != 0) {\n      s.output.set(\n        s.ringBuffer.subarray(s.ringBufferBytesWritten, s.ringBufferBytesWritten + toWrite),\n        s.outputOffset + s.outputUsed\n      );\n      s.outputUsed += toWrite;\n      s.ringBufferBytesWritten += toWrite;\n    }\n    if (s.outputUsed < s.outputLength) {\n      return 1;\n    } else {\n      return 0;\n    }\n  }\n  /**\n   * @param {number} alphabetSizeMax\n   * @param {number} alphabetSizeLimit\n   * @param {number} n\n   * @param {!State} s\n   * @return {!Int32Array}\n   */\n  function decodeHuffmanTreeGroup(alphabetSizeMax, alphabetSizeLimit, n, s) {\n    let /** @type{number} */ maxTableSize = MAX_HUFFMAN_TABLE_SIZE[(alphabetSizeLimit + 31) >> 5];\n    let /** @type{!Int32Array} */ group = new Int32Array(n + n * maxTableSize);\n    let /** @type{number} */ next = n;\n    for (let /** @type{number} */ i = 0; i < n; ++i) {\n      group[i] = next;\n      next += readHuffmanCode(alphabetSizeMax, alphabetSizeLimit, group, i, s);\n    }\n    return group;\n  }\n  /**\n   * @param {!State} s\n   * @return {number}\n   */\n  function calculateFence(s) {\n    let /** @type{number} */ result = s.ringBufferSize;\n    if (s.isEager != 0) {\n      result = min(result, s.ringBufferBytesWritten + s.outputLength - s.outputUsed);\n    }\n    return result;\n  }\n  /**\n   * @param {!State} s\n   * @param {number} fence\n   * @return {void}\n   */\n  function doUseDictionary(s, fence) {\n    if (s.distance > 0x7ffffffc) {\n      throw 'Invalid backward reference';\n    }\n    let /** @type{number} */ address = s.distance - s.maxDistance - 1 - s.cdTotalSize;\n    if (address < 0) {\n      initializeCompoundDictionaryCopy(s, -address - 1, s.copyLength);\n      s.runningState = 14;\n    } else {\n      let /** @type{!Int8Array} */ dictionaryData = /** @type{!Int8Array} */ data;\n      let /** @type{number} */ wordLength = s.copyLength;\n      if (wordLength > 31) {\n        throw 'Invalid backward reference';\n      }\n      let /** @type{number} */ shift = sizeBits[wordLength];\n      if (shift == 0) {\n        throw 'Invalid backward reference';\n      }\n      let /** @type{number} */ offset = offsets[wordLength];\n      let /** @type{number} */ mask = (1 << shift) - 1;\n      let /** @type{number} */ wordIdx = address & mask;\n      let /** @type{number} */ transformIdx = address >>> shift;\n      offset += wordIdx * wordLength;\n      let /** @type{!Transforms} */ transforms = RFC_TRANSFORMS;\n      if (transformIdx >= transforms.numTransforms) {\n        throw 'Invalid backward reference';\n      }\n      let /** @type{number} */ len = transformDictionaryWord(\n          s.ringBuffer,\n          s.pos,\n          dictionaryData,\n          offset,\n          wordLength,\n          transforms,\n          transformIdx\n        );\n      s.pos += len;\n      s.metaBlockLength -= len;\n      if (s.pos >= fence) {\n        s.nextRunningState = 4;\n        s.runningState = 12;\n        return;\n      }\n      s.runningState = 4;\n    }\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function initializeCompoundDictionary(s) {\n    s.cdBlockMap = new Int8Array(256);\n    let /** @type{number} */ blockBits = 8;\n    while ((s.cdTotalSize - 1) >>> blockBits != 0) {\n      blockBits++;\n    }\n    blockBits -= 8;\n    s.cdBlockBits = blockBits;\n    let /** @type{number} */ cursor = 0;\n    let /** @type{number} */ index = 0;\n    while (cursor < s.cdTotalSize) {\n      while (s.cdChunkOffsets[index + 1] < cursor) {\n        index++;\n      }\n      s.cdBlockMap[cursor >>> blockBits] = index;\n      cursor += 1 << blockBits;\n    }\n  }\n  /**\n   * @param {!State} s\n   * @param {number} address\n   * @param {number} length\n   * @return {void}\n   */\n  function initializeCompoundDictionaryCopy(s, address, length) {\n    if (s.cdBlockBits == -1) {\n      initializeCompoundDictionary(s);\n    }\n    let /** @type{number} */ index = s.cdBlockMap[address >>> s.cdBlockBits];\n    while (address >= s.cdChunkOffsets[index + 1]) {\n      index++;\n    }\n    if (s.cdTotalSize > address + length) {\n      throw 'Invalid backward reference';\n    }\n    s.distRbIdx = (s.distRbIdx + 1) & 0x3;\n    s.rings[s.distRbIdx] = s.distance;\n    s.metaBlockLength -= length;\n    s.cdBrIndex = index;\n    s.cdBrOffset = address - s.cdChunkOffsets[index];\n    s.cdBrLength = length;\n    s.cdBrCopied = 0;\n  }\n  /**\n   * @param {!State} s\n   * @param {number} fence\n   * @return {number}\n   */\n  function copyFromCompoundDictionary(s, fence) {\n    let /** @type{number} */ pos = s.pos;\n    let /** @type{number} */ origPos = pos;\n    while (s.cdBrLength != s.cdBrCopied) {\n      let /** @type{number} */ space = fence - pos;\n      let /** @type{number} */ chunkLength =\n          s.cdChunkOffsets[s.cdBrIndex + 1] - s.cdChunkOffsets[s.cdBrIndex];\n      let /** @type{number} */ remChunkLength = chunkLength - s.cdBrOffset;\n      let /** @type{number} */ length = s.cdBrLength - s.cdBrCopied;\n      if (length > remChunkLength) {\n        length = remChunkLength;\n      }\n      if (length > space) {\n        length = space;\n      }\n      copyBytes(s.ringBuffer, pos, s.cdChunks[s.cdBrIndex], s.cdBrOffset, s.cdBrOffset + length);\n      pos += length;\n      s.cdBrOffset += length;\n      s.cdBrCopied += length;\n      if (length == remChunkLength) {\n        s.cdBrIndex++;\n        s.cdBrOffset = 0;\n      }\n      if (pos >= fence) {\n        break;\n      }\n    }\n    return pos - origPos;\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function decompress(s) {\n    if (s.runningState == 0) {\n      throw \"Can't decompress until initialized\";\n    }\n    if (s.runningState == 11) {\n      throw \"Can't decompress after close\";\n    }\n    if (s.runningState == 1) {\n      let /** @type{number} */ windowBits = decodeWindowBits(s);\n      if (windowBits == -1) {\n        throw \"Invalid 'windowBits' code\";\n      }\n      s.maxRingBufferSize = 1 << windowBits;\n      s.maxBackwardDistance = s.maxRingBufferSize - 16;\n      s.runningState = 2;\n    }\n    let /** @type{number} */ fence = calculateFence(s);\n    let /** @type{number} */ ringBufferMask = s.ringBufferSize - 1;\n    let /** @type{!Int8Array} */ ringBuffer = s.ringBuffer;\n    while (s.runningState != 10) {\n      switch (s.runningState) {\n        case 2:\n          if (s.metaBlockLength < 0) {\n            throw 'Invalid metablock length';\n          }\n          readNextMetablockHeader(s);\n          fence = calculateFence(s);\n          ringBufferMask = s.ringBufferSize - 1;\n          ringBuffer = s.ringBuffer;\n          continue;\n        case 3:\n          readMetablockHuffmanCodesAndContextMaps(s);\n          s.runningState = 4;\n        case 4:\n          if (s.metaBlockLength <= 0) {\n            s.runningState = 2;\n            continue;\n          }\n          if (s.halfOffset > 2030) {\n            doReadMoreInput(s);\n          }\n          if (s.commandBlockLength == 0) {\n            decodeCommandBlockSwitch(s);\n          }\n          s.commandBlockLength--;\n          if (s.bitOffset >= 16) {\n            s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n            s.bitOffset -= 16;\n          }\n          let /** @type{number} */ cmdCode =\n              readSymbol(s.commandTreeGroup, s.commandTreeIdx, s) << 2;\n          let /** @type{number} */ insertAndCopyExtraBits = CMD_LOOKUP[cmdCode];\n          let /** @type{number} */ insertLengthOffset = CMD_LOOKUP[cmdCode + 1];\n          let /** @type{number} */ copyLengthOffset = CMD_LOOKUP[cmdCode + 2];\n          s.distanceCode = CMD_LOOKUP[cmdCode + 3];\n          if (s.bitOffset >= 16) {\n            s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n            s.bitOffset -= 16;\n          }\n          let /** @type{number} */ insertLengthExtraBits = insertAndCopyExtraBits & 0xff;\n          s.insertLength =\n            insertLengthOffset +\n            (insertLengthExtraBits <= 16\n              ? readFewBits(s, insertLengthExtraBits)\n              : readManyBits(s, insertLengthExtraBits));\n          if (s.bitOffset >= 16) {\n            s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n            s.bitOffset -= 16;\n          }\n          let /** @type{number} */ copyLengthExtraBits = insertAndCopyExtraBits >> 8;\n          s.copyLength =\n            copyLengthOffset +\n            (copyLengthExtraBits <= 16\n              ? readFewBits(s, copyLengthExtraBits)\n              : readManyBits(s, copyLengthExtraBits));\n          s.j = 0;\n          s.runningState = 7;\n        case 7:\n          if (s.trivialLiteralContext != 0) {\n            while (s.j < s.insertLength) {\n              if (s.halfOffset > 2030) {\n                doReadMoreInput(s);\n              }\n              if (s.literalBlockLength == 0) {\n                decodeLiteralBlockSwitch(s);\n              }\n              s.literalBlockLength--;\n              if (s.bitOffset >= 16) {\n                s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n                s.bitOffset -= 16;\n              }\n              ringBuffer[s.pos] = readSymbol(s.literalTreeGroup, s.literalTreeIdx, s);\n              s.pos++;\n              s.j++;\n              if (s.pos >= fence) {\n                s.nextRunningState = 7;\n                s.runningState = 12;\n                break;\n              }\n            }\n          } else {\n            let /** @type{number} */ prevByte1 = ringBuffer[(s.pos - 1) & ringBufferMask] & 0xff;\n            let /** @type{number} */ prevByte2 = ringBuffer[(s.pos - 2) & ringBufferMask] & 0xff;\n            while (s.j < s.insertLength) {\n              if (s.halfOffset > 2030) {\n                doReadMoreInput(s);\n              }\n              if (s.literalBlockLength == 0) {\n                decodeLiteralBlockSwitch(s);\n              }\n              let /** @type{number} */ literalContext =\n                  LOOKUP[s.contextLookupOffset1 + prevByte1] |\n                  LOOKUP[s.contextLookupOffset2 + prevByte2];\n              let /** @type{number} */ literalTreeIdx =\n                  s.contextMap[s.contextMapSlice + literalContext] & 0xff;\n              s.literalBlockLength--;\n              prevByte2 = prevByte1;\n              if (s.bitOffset >= 16) {\n                s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n                s.bitOffset -= 16;\n              }\n              prevByte1 = readSymbol(s.literalTreeGroup, literalTreeIdx, s);\n              ringBuffer[s.pos] = prevByte1;\n              s.pos++;\n              s.j++;\n              if (s.pos >= fence) {\n                s.nextRunningState = 7;\n                s.runningState = 12;\n                break;\n              }\n            }\n          }\n          if (s.runningState != 7) {\n            continue;\n          }\n          s.metaBlockLength -= s.insertLength;\n          if (s.metaBlockLength <= 0) {\n            s.runningState = 4;\n            continue;\n          }\n          let /** @type{number} */ distanceCode = s.distanceCode;\n          if (distanceCode < 0) {\n            s.distance = s.rings[s.distRbIdx];\n          } else {\n            if (s.halfOffset > 2030) {\n              doReadMoreInput(s);\n            }\n            if (s.distanceBlockLength == 0) {\n              decodeDistanceBlockSwitch(s);\n            }\n            s.distanceBlockLength--;\n            if (s.bitOffset >= 16) {\n              s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n              s.bitOffset -= 16;\n            }\n            let /** @type{number} */ distTreeIdx =\n                s.distContextMap[s.distContextMapSlice + distanceCode] & 0xff;\n            distanceCode = readSymbol(s.distanceTreeGroup, distTreeIdx, s);\n            if (distanceCode < 16) {\n              let /** @type{number} */ index =\n                  (s.distRbIdx + DISTANCE_SHORT_CODE_INDEX_OFFSET[distanceCode]) & 0x3;\n              s.distance = s.rings[index] + DISTANCE_SHORT_CODE_VALUE_OFFSET[distanceCode];\n              if (s.distance < 0) {\n                throw 'Negative distance';\n              }\n            } else {\n              let /** @type{number} */ extraBits = s.distExtraBits[distanceCode];\n              let /** @type{number} */ bits;\n              if (s.bitOffset + extraBits <= 32) {\n                bits = readFewBits(s, extraBits);\n              } else {\n                if (s.bitOffset >= 16) {\n                  s.accumulator32 =\n                    (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n                  s.bitOffset -= 16;\n                }\n                bits = extraBits <= 16 ? readFewBits(s, extraBits) : readManyBits(s, extraBits);\n              }\n              s.distance = s.distOffset[distanceCode] + (bits << s.distancePostfixBits);\n            }\n          }\n          if (s.maxDistance != s.maxBackwardDistance && s.pos < s.maxBackwardDistance) {\n            s.maxDistance = s.pos;\n          } else {\n            s.maxDistance = s.maxBackwardDistance;\n          }\n          if (s.distance > s.maxDistance) {\n            s.runningState = 9;\n            continue;\n          }\n          if (distanceCode > 0) {\n            s.distRbIdx = (s.distRbIdx + 1) & 0x3;\n            s.rings[s.distRbIdx] = s.distance;\n          }\n          if (s.copyLength > s.metaBlockLength) {\n            throw 'Invalid backward reference';\n          }\n          s.j = 0;\n          s.runningState = 8;\n        case 8:\n          let /** @type{number} */ src = (s.pos - s.distance) & ringBufferMask;\n          let /** @type{number} */ dst = s.pos;\n          let /** @type{number} */ copyLength = s.copyLength - s.j;\n          let /** @type{number} */ srcEnd = src + copyLength;\n          let /** @type{number} */ dstEnd = dst + copyLength;\n          if (srcEnd < ringBufferMask && dstEnd < ringBufferMask) {\n            if (copyLength < 12 || (srcEnd > dst && dstEnd > src)) {\n              for (let /** @type{number} */ k = 0; k < copyLength; k += 4) {\n                ringBuffer[dst++] = ringBuffer[src++];\n                ringBuffer[dst++] = ringBuffer[src++];\n                ringBuffer[dst++] = ringBuffer[src++];\n                ringBuffer[dst++] = ringBuffer[src++];\n              }\n            } else {\n              ringBuffer.copyWithin(dst, src, srcEnd);\n            }\n            s.j += copyLength;\n            s.metaBlockLength -= copyLength;\n            s.pos += copyLength;\n          } else {\n            for (; s.j < s.copyLength; ) {\n              ringBuffer[s.pos] = ringBuffer[(s.pos - s.distance) & ringBufferMask];\n              s.metaBlockLength--;\n              s.pos++;\n              s.j++;\n              if (s.pos >= fence) {\n                s.nextRunningState = 8;\n                s.runningState = 12;\n                break;\n              }\n            }\n          }\n          if (s.runningState == 8) {\n            s.runningState = 4;\n          }\n          continue;\n        case 9:\n          doUseDictionary(s, fence);\n          continue;\n        case 14:\n          s.pos += copyFromCompoundDictionary(s, fence);\n          if (s.pos >= fence) {\n            s.nextRunningState = 14;\n            s.runningState = 12;\n            return;\n          }\n          s.runningState = 4;\n          continue;\n        case 5:\n          while (s.metaBlockLength > 0) {\n            if (s.halfOffset > 2030) {\n              doReadMoreInput(s);\n            }\n            if (s.bitOffset >= 16) {\n              s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n              s.bitOffset -= 16;\n            }\n            readFewBits(s, 8);\n            s.metaBlockLength--;\n          }\n          s.runningState = 2;\n          continue;\n        case 6:\n          copyUncompressedData(s);\n          continue;\n        case 12:\n          s.ringBufferBytesReady = min(s.pos, s.ringBufferSize);\n          s.runningState = 13;\n        case 13:\n          if (writeRingBuffer(s) == 0) {\n            return;\n          }\n          if (s.pos >= s.maxBackwardDistance) {\n            s.maxDistance = s.maxBackwardDistance;\n          }\n          if (s.pos >= s.ringBufferSize) {\n            if (s.pos > s.ringBufferSize) {\n              ringBuffer.copyWithin(0, s.ringBufferSize, s.pos);\n            }\n            s.pos &= ringBufferMask;\n            s.ringBufferBytesWritten = 0;\n          }\n          s.runningState = s.nextRunningState;\n          continue;\n        default:\n          throw 'Unexpected state ' + s.runningState;\n      }\n    }\n    if (s.runningState == 10) {\n      if (s.metaBlockLength < 0) {\n        throw 'Invalid metablock length';\n      }\n      jumpToByteBoundary(s);\n      checkHealth(s, 1);\n    }\n  }\n\n  /**\n   * @constructor\n   * @param {number} numTransforms\n   * @param {number} prefixSuffixLen\n   * @param {number} prefixSuffixCount\n   * @struct\n   */\n  function Transforms(numTransforms, prefixSuffixLen, prefixSuffixCount) {\n    /** @type {!number} */\n    this.numTransforms = 0;\n    /** @type {!Int32Array} */\n    this.triplets = new Int32Array(0);\n    /** @type {!Int8Array} */\n    this.prefixSuffixStorage = new Int8Array(0);\n    /** @type {!Int32Array} */\n    this.prefixSuffixHeads = new Int32Array(0);\n    /** @type {!Int16Array} */\n    this.params = new Int16Array(0);\n    this.numTransforms = numTransforms;\n    this.triplets = new Int32Array(numTransforms * 3);\n    this.params = new Int16Array(numTransforms);\n    this.prefixSuffixStorage = new Int8Array(prefixSuffixLen);\n    this.prefixSuffixHeads = new Int32Array(prefixSuffixCount + 1);\n  }\n\n  /** @type {!Transforms} */\n  let RFC_TRANSFORMS = new Transforms(121, 167, 50);\n  /**\n   * @param {!Int8Array} prefixSuffix\n   * @param {!Int32Array} prefixSuffixHeads\n   * @param {!Int32Array} transforms\n   * @param {!string} prefixSuffixSrc\n   * @param {!string} transformsSrc\n   * @return {void}\n   */\n  function unpackTransforms(\n    prefixSuffix,\n    prefixSuffixHeads,\n    transforms,\n    prefixSuffixSrc,\n    transformsSrc\n  ) {\n    let /** @type{number} */ n = prefixSuffixSrc.length;\n    let /** @type{number} */ index = 1;\n    let /** @type{number} */ j = 0;\n    for (let /** @type{number} */ i = 0; i < n; ++i) {\n      let /** @type{number} */ c = prefixSuffixSrc.charCodeAt(i);\n      if (c == 35) {\n        prefixSuffixHeads[index++] = j;\n      } else {\n        prefixSuffix[j++] = c;\n      }\n    }\n    for (let /** @type{number} */ i = 0; i < 363; ++i) {\n      transforms[i] = transformsSrc.charCodeAt(i) - 32;\n    }\n  }\n  {\n    unpackTransforms(\n      RFC_TRANSFORMS.prefixSuffixStorage,\n      RFC_TRANSFORMS.prefixSuffixHeads,\n      RFC_TRANSFORMS.triplets,\n      '# #s #, #e #.# the #.com/#\\xC2\\xA0# of # and # in # to #\"#\">#\\n#]# for # a # that #. # with #\\'# from # by #. The # on # as # is #ing #\\n\\t#:#ed #(# at #ly #=\"# of the #. This #,# not #er #al #=\\'#ful #ive #less #est #ize #ous #',\n      '     !! ! ,  *!  &!  \" !  ) *   * -  ! # !  #!*!  +  ,$ !  -  %  .  / #   0  1 .  \"   2  3!*   4%  ! # /   5  6  7  8 0  1 &   $   9 +   :  ;  < \\'  !=  >  ?! 4  @ 4  2  &   A *# (   B  C& ) %  ) !*# *-% A +! *.  D! %\\'  & E *6  F  G% ! *A *%  H! D  I!+!  J!+   K +- *4! A  L!*4  M  N +6  O!*% +.! K *G  P +%(  ! G *D +D  Q +# *K!*G!+D!+# +G +A +4!+% +K!+4!*D!+K!*K'\n    );\n  }\n  /**\n   * @param {!Int8Array} dst\n   * @param {number} dstOffset\n   * @param {!Int8Array} src\n   * @param {number} srcOffset\n   * @param {number} len\n   * @param {!Transforms} transforms\n   * @param {number} transformIndex\n   * @return {number}\n   */\n  function transformDictionaryWord(\n    dst,\n    dstOffset,\n    src,\n    srcOffset,\n    len,\n    transforms,\n    transformIndex\n  ) {\n    let /** @type{number} */ offset = dstOffset;\n    let /** @type{!Int32Array} */ triplets = transforms.triplets;\n    let /** @type{!Int8Array} */ prefixSuffixStorage = transforms.prefixSuffixStorage;\n    let /** @type{!Int32Array} */ prefixSuffixHeads = transforms.prefixSuffixHeads;\n    let /** @type{number} */ transformOffset = 3 * transformIndex;\n    let /** @type{number} */ prefixIdx = triplets[transformOffset];\n    let /** @type{number} */ transformType = triplets[transformOffset + 1];\n    let /** @type{number} */ suffixIdx = triplets[transformOffset + 2];\n    let /** @type{number} */ prefix = prefixSuffixHeads[prefixIdx];\n    let /** @type{number} */ prefixEnd = prefixSuffixHeads[prefixIdx + 1];\n    let /** @type{number} */ suffix = prefixSuffixHeads[suffixIdx];\n    let /** @type{number} */ suffixEnd = prefixSuffixHeads[suffixIdx + 1];\n    let /** @type{number} */ omitFirst = transformType - 11;\n    let /** @type{number} */ omitLast = transformType - 0;\n    if (omitFirst < 1 || omitFirst > 9) {\n      omitFirst = 0;\n    }\n    if (omitLast < 1 || omitLast > 9) {\n      omitLast = 0;\n    }\n    while (prefix != prefixEnd) {\n      dst[offset++] = prefixSuffixStorage[prefix++];\n    }\n    if (omitFirst > len) {\n      omitFirst = len;\n    }\n    srcOffset += omitFirst;\n    len -= omitFirst;\n    len -= omitLast;\n    let /** @type{number} */ i = len;\n    while (i > 0) {\n      dst[offset++] = src[srcOffset++];\n      i--;\n    }\n    if (transformType == 10 || transformType == 11) {\n      let /** @type{number} */ uppercaseOffset = offset - len;\n      if (transformType == 10) {\n        len = 1;\n      }\n      while (len > 0) {\n        let /** @type{number} */ c0 = dst[uppercaseOffset] & 0xff;\n        if (c0 < 0xc0) {\n          if (c0 >= 97 && c0 <= 122) {\n            dst[uppercaseOffset] ^= 32;\n          }\n          uppercaseOffset += 1;\n          len -= 1;\n        } else if (c0 < 0xe0) {\n          dst[uppercaseOffset + 1] ^= 32;\n          uppercaseOffset += 2;\n          len -= 2;\n        } else {\n          dst[uppercaseOffset + 2] ^= 5;\n          uppercaseOffset += 3;\n          len -= 3;\n        }\n      }\n    } else if (transformType == 21 || transformType == 22) {\n      let /** @type{number} */ shiftOffset = offset - len;\n      let /** @type{number} */ param = transforms.params[transformIndex];\n      let /** @type{number} */ scalar = (param & 0x7fff) + (0x1000000 - (param & 0x8000));\n      while (len > 0) {\n        let /** @type{number} */ step = 1;\n        let /** @type{number} */ c0 = dst[shiftOffset] & 0xff;\n        if (c0 < 0x80) {\n          scalar += c0;\n          dst[shiftOffset] = scalar & 0x7f;\n        } else if (c0 < 0xc0) {\n        } else if (c0 < 0xe0) {\n          if (len >= 2) {\n            let /** @type{number} */ c1 = dst[shiftOffset + 1];\n            scalar += (c1 & 0x3f) | ((c0 & 0x1f) << 6);\n            dst[shiftOffset] = 0xc0 | ((scalar >> 6) & 0x1f);\n            dst[shiftOffset + 1] = (c1 & 0xc0) | (scalar & 0x3f);\n            step = 2;\n          } else {\n            step = len;\n          }\n        } else if (c0 < 0xf0) {\n          if (len >= 3) {\n            let /** @type{number} */ c1 = dst[shiftOffset + 1];\n            let /** @type{number} */ c2 = dst[shiftOffset + 2];\n            scalar += (c2 & 0x3f) | ((c1 & 0x3f) << 6) | ((c0 & 0x0f) << 12);\n            dst[shiftOffset] = 0xe0 | ((scalar >> 12) & 0x0f);\n            dst[shiftOffset + 1] = (c1 & 0xc0) | ((scalar >> 6) & 0x3f);\n            dst[shiftOffset + 2] = (c2 & 0xc0) | (scalar & 0x3f);\n            step = 3;\n          } else {\n            step = len;\n          }\n        } else if (c0 < 0xf8) {\n          if (len >= 4) {\n            let /** @type{number} */ c1 = dst[shiftOffset + 1];\n            let /** @type{number} */ c2 = dst[shiftOffset + 2];\n            let /** @type{number} */ c3 = dst[shiftOffset + 3];\n            scalar += (c3 & 0x3f) | ((c2 & 0x3f) << 6) | ((c1 & 0x3f) << 12) | ((c0 & 0x07) << 18);\n            dst[shiftOffset] = 0xf0 | ((scalar >> 18) & 0x07);\n            dst[shiftOffset + 1] = (c1 & 0xc0) | ((scalar >> 12) & 0x3f);\n            dst[shiftOffset + 2] = (c2 & 0xc0) | ((scalar >> 6) & 0x3f);\n            dst[shiftOffset + 3] = (c3 & 0xc0) | (scalar & 0x3f);\n            step = 4;\n          } else {\n            step = len;\n          }\n        }\n        shiftOffset += step;\n        len -= step;\n        if (transformType == 21) {\n          len = 0;\n        }\n      }\n    }\n    while (suffix != suffixEnd) {\n      dst[offset++] = prefixSuffixStorage[suffix++];\n    }\n    return offset - dstOffset;\n  }\n\n  /**\n   * @param {number} key\n   * @param {number} len\n   * @return {number}\n   */\n  function getNextKey(key, len) {\n    let /** @type{number} */ step = 1 << (len - 1);\n    while ((key & step) != 0) {\n      step >>= 1;\n    }\n    return (key & (step - 1)) + step;\n  }\n  /**\n   * @param {!Int32Array} table\n   * @param {number} offset\n   * @param {number} step\n   * @param {number} end\n   * @param {number} item\n   * @return {void}\n   */\n  function replicateValue(table, offset, step, end, item) {\n    do {\n      end -= step;\n      table[offset + end] = item;\n    } while (end > 0);\n  }\n  /**\n   * @param {!Int32Array} count\n   * @param {number} len\n   * @param {number} rootBits\n   * @return {number}\n   */\n  function nextTableBitSize(count, len, rootBits) {\n    let /** @type{number} */ left = 1 << (len - rootBits);\n    while (len < 15) {\n      left -= count[len];\n      if (left <= 0) {\n        break;\n      }\n      len++;\n      left <<= 1;\n    }\n    return len - rootBits;\n  }\n  /**\n   * @param {!Int32Array} tableGroup\n   * @param {number} tableIdx\n   * @param {number} rootBits\n   * @param {!Int32Array} codeLengths\n   * @param {number} codeLengthsSize\n   * @return {number}\n   */\n  function buildHuffmanTable(tableGroup, tableIdx, rootBits, codeLengths, codeLengthsSize) {\n    let /** @type{number} */ tableOffset = tableGroup[tableIdx];\n    let /** @type{number} */ key;\n    let /** @type{!Int32Array} */ sorted = new Int32Array(codeLengthsSize);\n    let /** @type{!Int32Array} */ count = new Int32Array(16);\n    let /** @type{!Int32Array} */ offset = new Int32Array(16);\n    let /** @type{number} */ symbol;\n    for (symbol = 0; symbol < codeLengthsSize; symbol++) {\n      count[codeLengths[symbol]]++;\n    }\n    offset[1] = 0;\n    for (let /** @type{number} */ len = 1; len < 15; len++) {\n      offset[len + 1] = offset[len] + count[len];\n    }\n    for (symbol = 0; symbol < codeLengthsSize; symbol++) {\n      if (codeLengths[symbol] != 0) {\n        sorted[offset[codeLengths[symbol]]++] = symbol;\n      }\n    }\n    let /** @type{number} */ tableBits = rootBits;\n    let /** @type{number} */ tableSize = 1 << tableBits;\n    let /** @type{number} */ totalSize = tableSize;\n    if (offset[15] == 1) {\n      for (key = 0; key < totalSize; key++) {\n        tableGroup[tableOffset + key] = sorted[0];\n      }\n      return totalSize;\n    }\n    key = 0;\n    symbol = 0;\n    for (let /** @type{number} */ len = 1, step = 2; len <= rootBits; len++, step <<= 1) {\n      for (; count[len] > 0; count[len]--) {\n        replicateValue(\n          tableGroup,\n          tableOffset + key,\n          step,\n          tableSize,\n          (len << 16) | sorted[symbol++]\n        );\n        key = getNextKey(key, len);\n      }\n    }\n    let /** @type{number} */ mask = totalSize - 1;\n    let /** @type{number} */ low = -1;\n    let /** @type{number} */ currentOffset = tableOffset;\n    for (let /** @type{number} */ len = rootBits + 1, step = 2; len <= 15; len++, step <<= 1) {\n      for (; count[len] > 0; count[len]--) {\n        if ((key & mask) != low) {\n          currentOffset += tableSize;\n          tableBits = nextTableBitSize(count, len, rootBits);\n          tableSize = 1 << tableBits;\n          totalSize += tableSize;\n          low = key & mask;\n          tableGroup[tableOffset + low] =\n            ((tableBits + rootBits) << 16) | (currentOffset - tableOffset - low);\n        }\n        replicateValue(\n          tableGroup,\n          currentOffset + (key >> rootBits),\n          step,\n          tableSize,\n          ((len - rootBits) << 16) | sorted[symbol++]\n        );\n        key = getNextKey(key, len);\n      }\n    }\n    return totalSize;\n  }\n\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function doReadMoreInput(s) {\n    if (s.endOfStreamReached != 0) {\n      if (halfAvailable(s) >= -2) {\n        return;\n      }\n      throw 'No more input';\n    }\n    let /** @type{number} */ readOffset = s.halfOffset << 1;\n    let /** @type{number} */ bytesInBuffer = 4096 - readOffset;\n    s.byteBuffer.copyWithin(0, readOffset, 4096);\n    s.halfOffset = 0;\n    while (bytesInBuffer < 4096) {\n      let /** @type{number} */ spaceLeft = 4096 - bytesInBuffer;\n      let /** @type{number} */ len = readInput(s.input, s.byteBuffer, bytesInBuffer, spaceLeft);\n      if (len <= 0) {\n        s.endOfStreamReached = 1;\n        s.tailBytes = bytesInBuffer;\n        bytesInBuffer += 1;\n        break;\n      }\n      bytesInBuffer += len;\n    }\n    bytesToNibbles(s, bytesInBuffer);\n  }\n  /**\n   * @param {!State} s\n   * @param {number} endOfStream\n   * @return {void}\n   */\n  function checkHealth(s, endOfStream) {\n    if (s.endOfStreamReached == 0) {\n      return;\n    }\n    let /** @type{number} */ byteOffset = (s.halfOffset << 1) + ((s.bitOffset + 7) >> 3) - 4;\n    if (byteOffset > s.tailBytes) {\n      throw 'Read after end';\n    }\n    if (endOfStream != 0 && byteOffset != s.tailBytes) {\n      throw 'Unused bytes after end';\n    }\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function assertAccumulatorHealthy(s) {\n    if (s.bitOffset > 32) {\n      throw 'Accumulator underloaded: ' + s.bitOffset;\n    }\n  }\n  /**\n   * @param {!State} s\n   * @param {number} n\n   * @return {number}\n   */\n  function readFewBits(s, n) {\n    let /** @type{number} */ val = (s.accumulator32 >>> s.bitOffset) & ((1 << n) - 1);\n    s.bitOffset += n;\n    return val;\n  }\n  /**\n   * @param {!State} s\n   * @param {number} n\n   * @return {number}\n   */\n  function readManyBits(s, n) {\n    let /** @type{number} */ low = readFewBits(s, 16);\n    s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n    s.bitOffset -= 16;\n    return low | (readFewBits(s, n - 16) << 16);\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function initBitReader(s) {\n    s.byteBuffer = new Int8Array(4160);\n    s.accumulator32 = 0;\n    s.shortBuffer = new Int16Array(2080);\n    s.bitOffset = 32;\n    s.halfOffset = 2048;\n    s.endOfStreamReached = 0;\n    prepare(s);\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function prepare(s) {\n    if (s.halfOffset > 2030) {\n      doReadMoreInput(s);\n    }\n    checkHealth(s, 0);\n    s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n    s.bitOffset -= 16;\n    s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n    s.bitOffset -= 16;\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function reload(s) {\n    if (s.bitOffset == 32) {\n      prepare(s);\n    }\n  }\n  /**\n   * @param {!State} s\n   * @return {void}\n   */\n  function jumpToByteBoundary(s) {\n    let /** @type{number} */ padding = (32 - s.bitOffset) & 7;\n    if (padding != 0) {\n      let /** @type{number} */ paddingBits = readFewBits(s, padding);\n      if (paddingBits != 0) {\n        throw 'Corrupted padding bits';\n      }\n    }\n  }\n  /**\n   * @param {!State} s\n   * @return {number}\n   */\n  function halfAvailable(s) {\n    let /** @type{number} */ limit = 2048;\n    if (s.endOfStreamReached != 0) {\n      limit = (s.tailBytes + 1) >> 1;\n    }\n    return limit - s.halfOffset;\n  }\n  /**\n   * @param {!State} s\n   * @param {!Int8Array} data\n   * @param {number} offset\n   * @param {number} length\n   * @return {void}\n   */\n  function copyRawBytes(s, data, offset, length) {\n    if ((s.bitOffset & 7) != 0) {\n      throw 'Unaligned copyBytes';\n    }\n    while (s.bitOffset != 32 && length != 0) {\n      data[offset++] = s.accumulator32 >>> s.bitOffset;\n      s.bitOffset += 8;\n      length--;\n    }\n    if (length == 0) {\n      return;\n    }\n    let /** @type{number} */ copyNibbles = min(halfAvailable(s), length >> 1);\n    if (copyNibbles > 0) {\n      let /** @type{number} */ readOffset = s.halfOffset << 1;\n      let /** @type{number} */ delta = copyNibbles << 1;\n      data.set(s.byteBuffer.subarray(readOffset, readOffset + delta), offset);\n      offset += delta;\n      length -= delta;\n      s.halfOffset += copyNibbles;\n    }\n    if (length == 0) {\n      return;\n    }\n    if (halfAvailable(s) > 0) {\n      if (s.bitOffset >= 16) {\n        s.accumulator32 = (s.shortBuffer[s.halfOffset++] << 16) | (s.accumulator32 >>> 16);\n        s.bitOffset -= 16;\n      }\n      while (length != 0) {\n        data[offset++] = s.accumulator32 >>> s.bitOffset;\n        s.bitOffset += 8;\n        length--;\n      }\n      checkHealth(s, 0);\n      return;\n    }\n    while (length > 0) {\n      let /** @type{number} */ len = readInput(s.input, data, offset, length);\n      if (len == -1) {\n        throw 'Unexpected end of input';\n      }\n      offset += len;\n      length -= len;\n    }\n  }\n  /**\n   * @param {!State} s\n   * @param {number} byteLen\n   * @return {void}\n   */\n  function bytesToNibbles(s, byteLen) {\n    let /** @type{!Int8Array} */ byteBuffer = s.byteBuffer;\n    let /** @type{number} */ halfLen = byteLen >> 1;\n    let /** @type{!Int16Array} */ shortBuffer = s.shortBuffer;\n    for (let /** @type{number} */ i = 0; i < halfLen; ++i) {\n      shortBuffer[i] = (byteBuffer[i * 2] & 0xff) | ((byteBuffer[i * 2 + 1] & 0xff) << 8);\n    }\n  }\n\n  /** @type {!Int32Array} */\n  let LOOKUP = new Int32Array(2048);\n  /**\n   * @param {!Int32Array} lookup\n   * @param {!string} map\n   * @param {!string} rle\n   * @return {void}\n   */\n  function unpackLookupTable(lookup, map, rle) {\n    for (let /** @type{number} */ i = 0; i < 256; ++i) {\n      lookup[i] = i & 0x3f;\n      lookup[512 + i] = i >> 2;\n      lookup[1792 + i] = 2 + (i >> 6);\n    }\n    for (let /** @type{number} */ i = 0; i < 128; ++i) {\n      lookup[1024 + i] = 4 * (map.charCodeAt(i) - 32);\n    }\n    for (let /** @type{number} */ i = 0; i < 64; ++i) {\n      lookup[1152 + i] = i & 1;\n      lookup[1216 + i] = 2 + (i & 1);\n    }\n    let /** @type{number} */ offset = 1280;\n    for (let /** @type{number} */ k = 0; k < 19; ++k) {\n      let /** @type{number} */ value = k & 3;\n      let /** @type{number} */ rep = rle.charCodeAt(k) - 32;\n      for (let /** @type{number} */ i = 0; i < rep; ++i) {\n        lookup[offset++] = value;\n      }\n    }\n    for (let /** @type{number} */ i = 0; i < 16; ++i) {\n      lookup[1792 + i] = 1;\n      lookup[2032 + i] = 6;\n    }\n    lookup[1792] = 0;\n    lookup[2047] = 7;\n    for (let /** @type{number} */ i = 0; i < 256; ++i) {\n      lookup[1536 + i] = lookup[1792 + i] << 3;\n    }\n  }\n  {\n    unpackLookupTable(\n      LOOKUP,\n      \"         !!  !                  \\\"#$##%#$&'##(#)#++++++++++((&*'##,---,---,-----,-----,-----&#'###.///.///./////./////./////&#'# \",\n      \"A/*  ':  & : $  \\x81 @\"\n    );\n  }\n\n  /**\n   * @constructor\n   * @struct\n   */\n  function State() {\n    /** @type {!Int8Array} */\n    this.ringBuffer = new Int8Array(0);\n    /** @type {!Int8Array} */\n    this.contextModes = new Int8Array(0);\n    /** @type {!Int8Array} */\n    this.contextMap = new Int8Array(0);\n    /** @type {!Int8Array} */\n    this.distContextMap = new Int8Array(0);\n    /** @type {!Int8Array} */\n    this.distExtraBits = new Int8Array(0);\n    /** @type {!Int8Array} */\n    this.output = new Int8Array(0);\n    /** @type {!Int8Array} */\n    this.byteBuffer = new Int8Array(0);\n    /** @type {!Int16Array} */\n    this.shortBuffer = new Int16Array(0);\n    /** @type {!Int32Array} */\n    this.intBuffer = new Int32Array(0);\n    /** @type {!Int32Array} */\n    this.rings = new Int32Array(0);\n    /** @type {!Int32Array} */\n    this.blockTrees = new Int32Array(0);\n    /** @type {!Int32Array} */\n    this.literalTreeGroup = new Int32Array(0);\n    /** @type {!Int32Array} */\n    this.commandTreeGroup = new Int32Array(0);\n    /** @type {!Int32Array} */\n    this.distanceTreeGroup = new Int32Array(0);\n    /** @type {!Int32Array} */\n    this.distOffset = new Int32Array(0);\n    /** @type {!number} */\n    this.runningState = 0;\n    /** @type {!number} */\n    this.nextRunningState = 0;\n    /** @type {!number} */\n    this.accumulator32 = 0;\n    /** @type {!number} */\n    this.bitOffset = 0;\n    /** @type {!number} */\n    this.halfOffset = 0;\n    /** @type {!number} */\n    this.tailBytes = 0;\n    /** @type {!number} */\n    this.endOfStreamReached = 0;\n    /** @type {!number} */\n    this.metaBlockLength = 0;\n    /** @type {!number} */\n    this.inputEnd = 0;\n    /** @type {!number} */\n    this.isUncompressed = 0;\n    /** @type {!number} */\n    this.isMetadata = 0;\n    /** @type {!number} */\n    this.literalBlockLength = 0;\n    /** @type {!number} */\n    this.numLiteralBlockTypes = 0;\n    /** @type {!number} */\n    this.commandBlockLength = 0;\n    /** @type {!number} */\n    this.numCommandBlockTypes = 0;\n    /** @type {!number} */\n    this.distanceBlockLength = 0;\n    /** @type {!number} */\n    this.numDistanceBlockTypes = 0;\n    /** @type {!number} */\n    this.pos = 0;\n    /** @type {!number} */\n    this.maxDistance = 0;\n    /** @type {!number} */\n    this.distRbIdx = 0;\n    /** @type {!number} */\n    this.trivialLiteralContext = 0;\n    /** @type {!number} */\n    this.literalTreeIdx = 0;\n    /** @type {!number} */\n    this.commandTreeIdx = 0;\n    /** @type {!number} */\n    this.j = 0;\n    /** @type {!number} */\n    this.insertLength = 0;\n    /** @type {!number} */\n    this.contextMapSlice = 0;\n    /** @type {!number} */\n    this.distContextMapSlice = 0;\n    /** @type {!number} */\n    this.contextLookupOffset1 = 0;\n    /** @type {!number} */\n    this.contextLookupOffset2 = 0;\n    /** @type {!number} */\n    this.distanceCode = 0;\n    /** @type {!number} */\n    this.numDirectDistanceCodes = 0;\n    /** @type {!number} */\n    this.distancePostfixBits = 0;\n    /** @type {!number} */\n    this.distance = 0;\n    /** @type {!number} */\n    this.copyLength = 0;\n    /** @type {!number} */\n    this.maxBackwardDistance = 0;\n    /** @type {!number} */\n    this.maxRingBufferSize = 0;\n    /** @type {!number} */\n    this.ringBufferSize = 0;\n    /** @type {!number} */\n    this.expectedTotalSize = 0;\n    /** @type {!number} */\n    this.outputOffset = 0;\n    /** @type {!number} */\n    this.outputLength = 0;\n    /** @type {!number} */\n    this.outputUsed = 0;\n    /** @type {!number} */\n    this.ringBufferBytesWritten = 0;\n    /** @type {!number} */\n    this.ringBufferBytesReady = 0;\n    /** @type {!number} */\n    this.isEager = 0;\n    /** @type {!number} */\n    this.isLargeWindow = 0;\n    /** @type {!number} */\n    this.cdNumChunks = 0;\n    /** @type {!number} */\n    this.cdTotalSize = 0;\n    /** @type {!number} */\n    this.cdBrIndex = 0;\n    /** @type {!number} */\n    this.cdBrOffset = 0;\n    /** @type {!number} */\n    this.cdBrLength = 0;\n    /** @type {!number} */\n    this.cdBrCopied = 0;\n    /** @type {!Array} */\n    this.cdChunks = new Array(0);\n    /** @type {!Int32Array} */\n    this.cdChunkOffsets = new Int32Array(0);\n    /** @type {!number} */\n    this.cdBlockBits = 0;\n    /** @type {!Int8Array} */\n    this.cdBlockMap = new Int8Array(0);\n    /** @type {!InputStream|null} */\n    this.input = null;\n    this.ringBuffer = new Int8Array(0);\n    this.rings = new Int32Array(10);\n    this.rings[0] = 16;\n    this.rings[1] = 15;\n    this.rings[2] = 11;\n    this.rings[3] = 4;\n  }\n\n  /** @type {!Int8Array|null} */\n  let data = null;\n  /** @type {!Int32Array} */\n  let offsets = new Int32Array(32);\n  /** @type {!Int32Array} */\n  let sizeBits = new Int32Array(32);\n  /**\n   * @param {!Int8Array} newData\n   * @param {!Int32Array} newSizeBits\n   * @return {void}\n   */\n  function setData(newData, newSizeBits) {\n    if (isDirect(newData) == 0 || isReadOnly(newData) == 0) {\n      throw 'newData must be a direct read-only byte buffer';\n    }\n    if (newSizeBits.length > 31) {\n      throw 'sizeBits length must be at most ' + 31;\n    }\n    for (let /** @type{number} */ i = 0; i < 4; ++i) {\n      if (newSizeBits[i] != 0) {\n        throw 'first ' + 4 + ' must be 0';\n      }\n    }\n    let /** @type{!Int32Array} */ dictionaryOffsets = offsets;\n    let /** @type{!Int32Array} */ dictionarySizeBits = sizeBits;\n    dictionarySizeBits.set(newSizeBits.subarray(0, 0 + newSizeBits.length), 0);\n    let /** @type{number} */ pos = 0;\n    let /** @type{number} */ limit = newData.length;\n    for (let /** @type{number} */ i = 0; i < newSizeBits.length; ++i) {\n      dictionaryOffsets[i] = pos;\n      let /** @type{number} */ bits = dictionarySizeBits[i];\n      if (bits != 0) {\n        if (bits >= 31) {\n          throw 'newSizeBits values must be less than 31';\n        }\n        pos += i << bits;\n        if (pos <= 0 || pos > limit) {\n          throw 'newSizeBits is inconsistent: overflow';\n        }\n      }\n    }\n    for (let /** @type{number} */ i = newSizeBits.length; i < 32; ++i) {\n      dictionaryOffsets[i] = pos;\n    }\n    if (pos != limit) {\n      throw 'newSizeBits is inconsistent: underflow';\n    }\n    data = newData;\n  }\n\n  /**\n   * @param {!Int8Array} dictionary\n   * @param {!string} data0\n   * @param {!string} data1\n   * @param {!string} skipFlip\n   * @param {!Int32Array} sizeBits\n   * @param {!string} sizeBitsData\n   * @return {void}\n   */\n  function unpackDictionaryData(dictionary, data0, data1, skipFlip, sizeBits, sizeBitsData) {\n    let /** @type{!Int8Array} */ dict = toUsAsciiBytes(data0 + data1);\n    if (dict.length != dictionary.length) {\n      throw 'Corrupted brotli dictionary';\n    }\n    let /** @type{number} */ offset = 0;\n    let /** @type{number} */ n = skipFlip.length;\n    for (let /** @type{number} */ i = 0; i < n; i += 2) {\n      let /** @type{number} */ skip = skipFlip.charCodeAt(i) - 36;\n      let /** @type{number} */ flip = skipFlip.charCodeAt(i + 1) - 36;\n      for (let /** @type{number} */ j = 0; j < skip; ++j) {\n        dict[offset] ^= 3;\n        offset++;\n      }\n      for (let /** @type{number} */ j = 0; j < flip; ++j) {\n        dict[offset] ^= 236;\n        offset++;\n      }\n    }\n    for (let /** @type{number} */ i = 0; i < sizeBitsData.length; ++i) {\n      sizeBits[i] = sizeBitsData.charCodeAt(i) - 65;\n    }\n    dictionary.set(dict);\n  }\n  {\n    let /** @type{!Int8Array} */ dictionaryData = new Int8Array(122784);\n    let /** @type{!Int32Array} */ dictionarySizeBits = new Int32Array(25);\n    unpackDictionaryData(\n      dictionaryData,\n      'wjnfgltmojefofewab`h`lgfgbwbpkltlmozpjwf`jwzlsfmivpwojhfeqfftlqhwf{wzfbqlufqalgzolufelqnallhsobzojufojmfkfosklnfpjgfnlqftlqgolmdwkfnujftejmgsbdfgbzpevookfbgwfqnfb`kbqfbeqlnwqvfnbqhbaofvslmkjdkgbwfobmgmftpfufmmf{w`bpfalwkslpwvpfgnbgfkbmgkfqftkbwmbnfOjmhaoldpjyfabpfkfognbhfnbjmvpfq$*#(klogfmgptjwkMftpqfbgtfqfpjdmwbhfkbufdbnfpffm`boosbwktfoosovpnfmvejonsbqwiljmwkjpojpwdllgmffgtbzptfpwilapnjmgboploldlqj`kvpfpobpwwfbnbqnzellghjmdtjoofbpwtbqgafpwejqfSbdfhmltbtbz-smdnlufwkbmolbgdjufpfoemlwfnv`keffgnbmzql`hj`lmlm`follhkjgfgjfgKlnfqvofklpwbib{jmel`ovaobtpofppkboeplnfpv`kylmf233&lmfp`bqfWjnfqb`faovfelvqtffheb`fklsfdbufkbqgolpwtkfmsbqhhfswsbpppkjsqllnKWNOsobmWzsfglmfpbufhffseobdojmhplogejufwllhqbwfwltmivnswkvpgbqh`bqgejofefbqpwbzhjoowkbweboobvwlfufq-`lnwbohpklsulwfgffsnlgfqfpwwvqmalqmabmgefooqlpfvqo+phjmqlof`lnfb`wpbdfpnffwdlog-isdjwfnubqzefowwkfmpfmggqlsUjft`lsz2-3!?,b=pwlsfopfojfpwlvqsb`h-djesbpw`pp<dqbznfbm%dw8qjgfpklwobwfpbjgqlbgubq#effoilkmqj`hslqwebpw$VB.gfbg?,a=sllqajoowzsfV-P-tllgnvpw1s{8JmelqbmhtjgftbmwtbooofbgX3^8sbvotbufpvqf\\'+$ tbjwnbppbqnpdlfpdbjmobmdsbjg\"..#ol`hvmjwqllwtbohejqntjef{no!plmdwfpw13s{hjmgqltpwlloelmwnbjopbefpwbqnbsp`lqfqbjmeoltabazpsbmpbzp7s{85s{8bqwpellwqfbotjhjkfbwpwfswqjslqd,obhftfbhwlogElqn`bpwebmpabmhufqzqvmpivozwbph2s{8dlbodqftpoltfgdfjg>!pfwp6s{8-ip<73s{je#+pllmpfbwmlmfwvafyfqlpfmwqffgeb`wjmwldjewkbqn2;s{`bnfkjooalogyllnuljgfbpzqjmdejoosfbhjmjw`lpw0s{8ib`hwbdpajwpqloofgjwhmftmfbq?\"..dqltIPLMgvwzMbnfpbofzlv#olwpsbjmibyy`logfzfpejpkttt-qjphwbapsqfu23s{qjpf16s{Aovfgjmd033/abooelqgfbqmtjogal{-ebjqob`hufqpsbjqivmfwf`kje+\"sj`hfujo\\'+! tbqnolqgglfpsvoo/333jgfbgqbtkvdfpslwevmgavqmkqfe`foohfzpwj`hklvqolppevfo21s{pvjwgfboQPP!bdfgdqfzDFW!fbpfbjnpdjqobjgp;s{8mbuzdqjgwjsp :::tbqpobgz`bqp*8#~sks<kfoowbootklnyk9\\t),\\x0E\\t#233kboo-\\t\\tB4s{8svpk`kbw3s{8`qft),?,kbpk46s{eobwqbqf#%%#wfoo`bnslmwlobjgnjppphjswfmwejmfnbofdfwpsolw733/\\x0E\\t\\x0E\\t`lloeffw-sks?aq=fqj`nlpwdvjgafoogfp`kbjqnbwkbwln,jnd% ;1ov`h`fmw3338wjmzdlmfkwnopfoogqvdEQFFmlgfmj`h<jg>olpfmvooubpwtjmgQPP#tfbqqfozaffmpbnfgvhfmbpb`bsftjpkdvoeW109kjwppolwdbwfhj`haovqwkfz26s{$$*8*8!=npjftjmpajqgplqwafwbpffhW2;9lqgpwqffnboo53s{ebqn\\x0ElupalzpX3^-$*8!SLPWafbqhjgp*8~~nbqzwfmg+VH*rvbgyk9\\n.pjy....sqls$*8\\x0EojewW2:9uj`fbmgzgfaw=QPPsllomf`haoltW259gllqfuboW249ofwpebjolqbosloomlub`lopdfmf#\\x0Elxplewqlnfwjooqlpp?k0=slvqebgfsjmh?wq=njmj*\\x7F\"+njmfyk9\\x04abqpkfbq33*8njoh#..=jqlmeqfggjphtfmwpljosvwp,ip,klozW119JPAMW139bgbnpffp?k1=iplm$/#$`lmwW129#QPPollsbpjbnllm?,s=plvoOJMFelqw`bqwW279?k2=;3s{\"..?:s{8W379njhf975Ymj`fjm`kZlqhqj`fyk9\\b$**8svqfnbdfsbqbwlmfalmg904Y\\\\le\\\\$^*8333/yk9\\x0Bwbmhzbqgaltoavpk965YIbub03s{\\t\\x7F~\\t&@0&907YifeeF[SJ`bpkujpbdloepmltyk9\\x05rvfq-`pppj`hnfbwnjm-ajmggfookjqfsj`pqfmw905YKWWS.132elwltloeFMG#{al{967YALGZgj`h8\\t~\\tf{jw906Yubqpafbw$~*8gjfw:::8bmmf~~?,Xj^-Obmdhn.^tjqfwlzpbggppfbobof{8\\t\\n~f`klmjmf-lqd336*wlmziftppbmgofdpqlle333*#133tjmfdfbqgldpallwdbqz`vwpwzofwfnswjlm-{no`l`hdbmd\\'+$-63s{Sk-Gnjp`bobmolbmgfphnjofqzbmvmj{gjp`*8~\\tgvpw`ojs*-\\t\\t43s{.133GUGp4^=?wbsfgfnlj((*tbdffvqlskjolswpklofEBRpbpjm.15WobapsfwpVQO#avoh`llh8~\\x0E\\tKFBGX3^*baaqivbm+2:;ofpkwtjm?,j=plmzdvzpev`hsjsf\\x7F.\\t\"331*mgltX2^8X^8\\tOld#pbow\\x0E\\t\\n\\nabmdwqjnabwk*x\\x0E\\t33s{\\t~*8hl9\\0effpbg=\\x0Ep9,,#X^8wloosovd+*x\\tx\\x0E\\t#-ip$133sgvboalbw-ISD*8\\t~rvlw*8\\t\\t$*8\\t\\x0E\\t~\\x0E1327132613251324132;132:13131312131113101317131613151314131;131:130313021301130013071306130513041320132113221323133:133;133413351336133713301331133213332:::2::;2::42::52::62::72::02::12::22::32:;:2:;;2:;42:;52:;62:;72:;02:;12:;22:;32:4:2:4;2:442:452:462:472:402:412:422:432:5:2:5;2:542:552:562:572:502:512:522:532:6:2:6;2:642:652:662:672:602:612:622:632333231720:73333::::`lnln/Mpfpwffpwbsfqlwlglkb`f`bgbb/]lajfmg/Abbp/Aujgb`bpllwqlelqlplollwqb`vbogjilpjgldqbmwjslwfnbgfafbodlrv/Efpwlmbgbwqfpsl`l`bpbabilwlgbpjmlbdvbsvfpvmlpbmwfgj`fovjpfoobnbzlylmbbnlqsjpllaqb`oj`foolgjlpklqb`bpj<[<\\\\<Q<\\\\<R<P=l<\\\\=l=o=n<\\\\<Q<Y<S<R<R=n<T<[<Q<R<X<R=n<R<Z<Y<R<Q<T=i<q<\\\\<Y<Y<]=g<P=g<~=g=m<R<^=g<^<R<q<R<R<]<s<R<W<T<Q<T<L<H<q<Y<p=g=n=g<r<Q<T<P<X<\\\\<{<\\\\<x<\\\\<q=o<r<]=n<Y<t<[<Y<U<Q=o<P<P<N=g=o<Z5m5f4O5j5i4K5i4U5o5h4O5d4]4C5f4K5m5e5k5d5h5i5h5o4K5d5h5k4D4_4K5h4I5j5k5f4O5f5n4C5k5h4G5i4D5k5h5d5h5f4D5h4K5f4D5o4X5f4K5i4O5i5j4F4D5f5h5j4A4D5k5i5i4X5d4Xejqpwujgflojdkwtlqognfgjbtkjwf`olpfaob`hqjdkwpnbooallhpsob`fnvpj`ejfoglqgfqsljmwubovfofufowbaofalbqgklvpfdqlvstlqhpzfbqppwbwfwlgbztbwfqpwbqwpwzofgfbwksltfqsklmfmjdkwfqqlqjmsvwbalvwwfqnpwjwofwllopfufmwol`bowjnfpobqdftlqgpdbnfppklqwpsb`fel`vp`ofbqnlgfoaol`hdvjgfqbgjlpkbqftlnfmbdbjmnlmfzjnbdfmbnfpzlvmdojmfpobwfq`lolqdqffmeqlmw%bns8tbw`kelq`fsqj`fqvofpafdjmbewfqujpjwjppvfbqfbpafoltjmgf{wlwboklvqpobafosqjmwsqfppavjowojmhppsffgpwvgzwqbgfelvmgpfmpfvmgfqpkltmelqnpqbmdfbggfgpwjoonlufgwbhfmbalufeobpkej{fglewfmlwkfqujftp`kf`hofdboqjufqjwfnprvj`hpkbsfkvnbmf{jpwdljmdnlujfwkjqgabpj`sfb`fpwbdftjgwkoldjmjgfbptqlwfsbdfpvpfqpgqjufpwlqfaqfbhplvwkulj`fpjwfpnlmwktkfqfavjogtkj`kfbqwkelqvnwkqffpslqwsbqwz@oj`holtfqojufp`obppobzfqfmwqzpwlqzvpbdfplvmg`lvqwzlvq#ajqwkslsvswzsfpbssozJnbdfafjmdvssfqmlwfpfufqzpkltpnfbmpf{wqbnbw`kwqb`hhmltmfbqozafdbmpvsfqsbsfqmlqwkofbqmdjufmmbnfgfmgfgWfqnpsbqwpDqlvsaqbmgvpjmdtlnbmebopfqfbgzbvgjlwbhfptkjof-`ln,ojufg`bpfpgbjoz`kjogdqfbwivgdfwklpfvmjwpmfufqaqlbg`lbpw`lufqbssofejofp`z`ofp`fmfsobmp`oj`htqjwfrvffmsjf`ffnbjoeqbnflogfqsklwlojnjw`b`kf`jujop`boffmwfqwkfnfwkfqfwlv`kalvmgqlzbobphfgtklofpjm`fpwl`h#mbnfebjwkkfbqwfnswzleefqp`lsfltmfgnjdkwboavnwkjmhaollgbqqbznbilqwqvpw`bmlmvmjlm`lvmwubojgpwlmfPwzofOldjmkbsszl``vqofew9eqfpkrvjwfejonpdqbgfmffgpvqabmejdkwabpjpklufqbvwl8qlvwf-kwnonj{fgejmboZlvq#pojgfwlsj`aqltmbolmfgqbtmpsojwqfb`kQjdkwgbwfpnbq`krvlwfdllgpOjmhpglvawbpzm`wkvnaboolt`kjfezlvwkmlufo23s{8pfqufvmwjokbmgp@kf`hPsb`frvfqzibnfpfrvbowtj`f3/333Pwbqwsbmfoplmdpqlvmgfjdkwpkjewtlqwkslpwpofbgptffhpbuljgwkfpfnjofpsobmfpnbqwboskbsobmwnbqhpqbwfpsobzp`objnpbofpwf{wppwbqptqlmd?,k0=wkjmd-lqd,nvowjkfbqgSltfqpwbmgwlhfmplojg+wkjpaqjmdpkjsppwbeewqjfg`boopevoozeb`wpbdfmwWkjp#,,..=bgnjmfdzswFufmw26s{8Fnbjowqvf!`qlpppsfmwaoldpal{!=mlwfgofbuf`kjmbpjyfpdvfpw?,k7=qlalwkfbuzwqvf/pfufmdqbmg`qjnfpjdmpbtbqfgbm`fskbpf=?\"..fm\\\\VP% 0:8133s{\\\\mbnfobwjmfmilzbib{-bwjlmpnjwkV-P-#klogpsfwfqjmgjbmbu!=`kbjmp`lqf`lnfpgljmdsqjlqPkbqf2::3pqlnbmojpwpibsbmeboopwqjboltmfqbdqff?,k1=bavpfbofqwlsfqb!.,,T`bqgpkjoopwfbnpSklwlwqvwk`ofbm-sks<pbjmwnfwboolvjpnfbmwsqlleaqjfeqlt!=dfmqfwqv`hollhpUbovfEqbnf-mfw,..=\\t?wqz#x\\tubq#nbhfp`lpwpsobjmbgvowrvfpwwqbjmobalqkfosp`bvpfnbdj`nlwlqwkfjq163s{ofbpwpwfsp@lvmw`lvogdobpppjgfpevmgpklwfobtbqgnlvwknlufpsbqjpdjufpgvw`kwf{bpeqvjwmvoo/\\x7F\\x7FX^8wls!=\\t?\"..SLPW!l`fbm?aq,=eollqpsfbhgfswk#pjyfabmhp`bw`k`kbqw13s{8bojdmgfboptlvog63s{8vqo>!sbqhpnlvpfNlpw#---?,bnlmdaqbjmalgz#mlmf8abpfg`bqqzgqbewqfefqsbdf\\\\klnf-nfwfqgfobzgqfbnsqlufiljmw?,wq=gqvdp?\"..#bsqjojgfboboofmf{b`welqwk`lgfpoldj`Ujft#pffnpaobmhslqwp#+133pbufg\\\\ojmhdlbopdqbmwdqffhklnfpqjmdpqbwfg03s{8tklpfsbqpf+*8!#Aol`hojmv{ilmfpsj{fo$*8!=*8je+.ofewgbujgklqpfEl`vpqbjpfal{fpWqb`hfnfmw?,fn=abq!=-pq`>wltfqbow>!`baofkfmqz17s{8pfwvsjwbozpkbqsnjmlqwbpwftbmwpwkjp-qfpfwtkffodjqop,`pp,233&8`ovappwveeajaofulwfp#2333hlqfb~*8\\x0E\\tabmgprvfvf>#x~8;3s{8`hjmdx\\x0E\\t\\n\\nbkfbg`ol`hjqjpkojhf#qbwjlpwbwpElqn!zbkll*X3^8Balvwejmgp?,k2=gfavdwbphpVQO#>`foop~*+*821s{8sqjnfwfoopwvqmp3{533-isd!psbjmafb`kwb{fpnj`qlbmdfo..=?,djewppwfuf.ojmhalgz-~*8\\t\\nnlvmw#+2::EBR?,qldfqeqbmh@obpp1;s{8effgp?k2=?p`lwwwfpwp11s{8gqjmh*#\\x7F\\x7F#oftjppkboo 30:8#elq#olufgtbpwf33s{8ib9\\x0Fnpjnlm?elmwqfsoznffwpvmwfq`kfbswjdkwAqbmg*#\">#gqfpp`ojspqllnplmhfznlajonbjm-Mbnf#sobwfevmmzwqffp`ln,!2-isdtnlgfsbqbnPWBQWofew#jggfm/#132*8\\t~\\telqn-ujqvp`kbjqwqbmptlqpwSbdfpjwjlmsbw`k?\"..\\tl.`b`ejqnpwlvqp/333#bpjbmj((*xbglaf$*X3^jg>23alwk8nfmv#-1-nj-smd!hfujm`lb`k@kjogaqv`f1-isdVQO*(-isd\\x7Fpvjwfpoj`fkbqqz213!#ptffwwq=\\x0E\\tmbnf>gjfdlsbdf#ptjpp..=\\t\\t eee8!=Old-`ln!wqfbwpkffw*#%%#27s{8poffsmwfmwejofgib9\\x0Fojg>!`Mbnf!tlqpfpklwp.al{.gfowb\\t%ow8afbqp97;Y?gbwb.qvqbo?,b=#psfmgabhfqpklsp>#!!8sks!=`wjlm20s{8aqjbmkfoolpjyf>l>&1E#iljmnbzaf?jnd#jnd!=/#eipjnd!#!*X3^NWlsAWzsf!mftozGbmph`yf`kwqbjohmltp?,k6=ebr!=yk.`m23*8\\t.2!*8wzsf>aovfpwqvozgbujp-ip$8=\\x0E\\t?\"pwffo#zlv#k1=\\x0E\\telqn#ifpvp233&#nfmv-\\x0E\\t\\n\\x0E\\ttbofpqjphpvnfmwggjmda.ojhwfb`kdje!#ufdbpgbmphffpwjpkrjspvlnjplaqfgfpgffmwqfwlglpsvfgfb/]lpfpw/Mwjfmfkbpwblwqlpsbqwfglmgfmvfulkb`fqelqnbnjpnlnfilqnvmglbrv/Ag/Abpp/_olbzvgbef`kbwlgbpwbmwlnfmlpgbwlplwqbppjwjlnv`klbklqbovdbqnbzlqfpwlpklqbpwfmfqbmwfpelwlpfpwbpsb/Apmvfubpbovgelqlpnfgjlrvjfmnfpfpslgfq`kjofpfq/Muf`fpgf`jqilp/Efpwbqufmwbdqvslkf`klfoolpwfmdlbnjdl`lpbpmjufodfmwfnjpnbbjqfpivojlwfnbpkb`jbebulqivmjlojaqfsvmwlavfmlbvwlqbaqjoavfmbwf{wlnbqylpbafqojpwbovfdl`/_nlfmfqlivfdlsfq/Vkbafqfpwlzmvm`bnvifqubolqevfqbojaqldvpwbjdvboulwlp`bplpdv/Absvfglplnlpbujplvpwfggfafmml`kfavp`bebowbfvqlppfqjfgj`kl`vqpl`obuf`bpbpof/_msobylobqdllaqbpujpwbbslzlivmwlwqbwbujpwl`qfbq`bnslkfnlp`jm`l`bqdlsjplplqgfmkb`fm/Mqfbgjp`lsfgql`fq`bsvfgbsbsfonfmlq/Vwjo`obqlilqdf`boofslmfqwbqgfmbgjfnbq`bpjdvffoobppjdol`l`kfnlwlpnbgqf`obpfqfpwlmj/]lrvfgbsbpbqabm`lkjilpujbifsbaol/Epwfujfmfqfjmlgfibqelmgl`bmbomlqwfofwqb`bvpbwlnbqnbmlpovmfpbvwlpujoobufmglsfpbqwjslpwfmdbnbq`loofubsbgqfvmjglubnlpylmbpbnalpabmgbnbqjbbavplnv`kbpvajqqjlibujujqdqbgl`kj`bboo/Ailufmgj`kbfpwbmwbofppbojqpvfolsfplpejmfpoobnbavp`l/Epwboofdbmfdqlsobybkvnlqsbdbqivmwbglaofjpobpalopbab/]lkbaobov`kb/mqfbgj`fmivdbqmlwbpuboofboo/M`bqdbglolqbabilfpw/Edvpwlnfmwfnbqjlejqnb`lpwlej`kbsobwbkldbqbqwfpofzfpbrvfonvpflabpfpsl`lpnjwbg`jfol`kj`lnjfgldbmbqpbmwlfwbsbgfafpsobzbqfgfppjfwf`lqwf`lqfbgvgbpgfpflujfilgfpfbbdvbp%rvlw8glnbjm`lnnlmpwbwvpfufmwpnbpwfqpzpwfnb`wjlmabmmfqqfnlufp`qloovsgbwfdolabonfgjvnejowfqmvnafq`kbmdfqfpvowsvaoj`p`qffm`kllpfmlqnbowqbufojppvfpplvq`fwbqdfwpsqjmdnlgvofnlajofptjw`ksklwlpalqgfqqfdjlmjwpfoepl`jbob`wjuf`lovnmqf`lqgelooltwjwof=fjwkfqofmdwkebnjozeqjfmgobzlvwbvwklq`qfbwfqfujftpvnnfqpfqufqsobzfgsobzfqf{sbmgsloj`zelqnbwglvaofsljmwppfqjfpsfqplmojujmdgfpjdmnlmwkpelq`fpvmjrvftfjdkwsflsoffmfqdzmbwvqfpfbq`kejdvqfkbujmd`vpwlnleepfwofwwfqtjmgltpvanjwqfmgfqdqlvspvsolbgkfbowknfwklgujgflpp`klloevwvqfpkbgltgfabwfubovfpLaif`wlwkfqpqjdkwpofbdvf`kqlnfpjnsofmlwj`fpkbqfgfmgjmdpfbplmqfslqwlmojmfprvbqfavwwlmjnbdfpfmbaofnlujmdobwfpwtjmwfqEqbm`fsfqjlgpwqlmdqfsfbwOlmglmgfwbjoelqnfggfnbmgpf`vqfsbppfgwlddofsob`fpgfuj`fpwbwj``jwjfppwqfbnzfooltbwwb`hpwqffweojdkwkjggfmjmel!=lsfmfgvpfevouboofz`bvpfpofbgfqpf`qfwpf`lmggbnbdfpslqwpf{`fswqbwjmdpjdmfgwkjmdpfeef`wejfogppwbwfpleej`fujpvbofgjwlqulovnfQfslqwnvpfvnnlujfpsbqfmwb``fppnlpwoznlwkfq!#jg>!nbqhfwdqlvmg`kbm`fpvqufzafelqfpznalonlnfmwpsff`knlwjlmjmpjgfnbwwfq@fmwfqlaif`wf{jpwpnjggofFvqlsfdqltwkofdb`znbmmfqfmlvdk`bqffqbmptfqlqjdjmslqwbo`ojfmwpfof`wqbmgln`olpfgwlsj`p`lnjmdebwkfqlswjlmpjnsozqbjpfgfp`bsf`klpfm`kvq`kgfejmfqfbplm`lqmfqlvwsvwnfnlqzjeqbnfsloj`fnlgfopMvnafqgvqjmdleefqppwzofphjoofgojpwfg`boofgpjoufqnbqdjmgfofwfafwwfqaqltpfojnjwpDolabopjmdoftjgdfw`fmwfqavgdfwmltqbs`qfgjw`objnpfmdjmfpbefwz`klj`fpsjqjw.pwzofpsqfbgnbhjmdmffgfgqvppjbsofbpff{wfmwP`qjswaqlhfmbooltp`kbqdfgjujgfeb`wlqnfnafq.abpfgwkflqz`lmejdbqlvmgtlqhfgkfosfg@kvq`kjnsb`wpklvogbotbzpoldl!#alwwlnojpw!=*xubq#sqfej{lqbmdfKfbgfq-svpk+`lvsofdbqgfmaqjgdfobvm`kQfujftwbhjmdujpjlmojwwofgbwjmdAvwwlmafbvwzwkfnfpelqdlwPfbq`kbm`klqbonlpwolbgfg@kbmdfqfwvqmpwqjmdqfolbgNlajofjm`lnfpvssozPlvq`flqgfqpujftfg%maps8`lvqpfBalvw#jpobmg?kwno#`llhjfmbnf>!bnbylmnlgfqmbguj`fjm?,b=9#Wkf#gjboldklvpfpAFDJM#Nf{j`lpwbqwp`fmwqfkfjdkwbggjmdJpobmgbppfwpFnsjqfP`kllofeelqwgjqf`wmfbqoznbmvboPfof`w-\\t\\tLmfiljmfgnfmv!=SkjojsbtbqgpkbmgofjnslqwLeej`fqfdbqgphjoopmbwjlmPslqwpgfdqfftffhoz#+f-d-afkjmggl`wlqolddfgvmjwfg?,a=?,afdjmpsobmwpbppjpwbqwjpwjppvfg033s{\\x7F`bmbgbbdfm`zp`kfnfqfnbjmAqbyjopbnsofoldl!=afzlmg.p`bofb``fswpfqufgnbqjmfEllwfq`bnfqb?,k2=\\t\\\\elqn!ofbufppwqfpp!#,=\\x0E\\t-dje!#lmolbgolbgfqL{elqgpjpwfqpvqujuojpwfmefnbofGfpjdmpjyf>!bssfbowf{w!=ofufopwkbmhpkjdkfqelq`fgbmjnbobmzlmfBeqj`bbdqffgqf`fmwSflsof?aq#,=tlmgfqsqj`fpwvqmfg\\x7F\\x7F#x~8nbjm!=jmojmfpvmgbztqbs!=ebjofg`fmpvpnjmvwfafb`lmrvlwfp263s{\\x7Ffpwbwfqfnlwffnbjo!ojmhfgqjdkw8pjdmboelqnbo2-kwnopjdmvssqjm`feolbw9-smd!#elqvn-B``fppsbsfqpplvmgpf{wfmgKfjdkwpojgfqVWE.;!%bns8#Afelqf-#TjwkpwvgjlltmfqpnbmbdfsqlejwiRvfqzbmmvbosbqbnpalvdkwebnlvpdlldofolmdfqj((*#xjpqbfopbzjmdgf`jgfklnf!=kfbgfqfmpvqfaqbm`ksjf`fpaol`h8pwbwfgwls!=?qb`jmdqfpjyf..%dw8sb`jwzpf{vboavqfbv-isd!#23/333lawbjmwjwofpbnlvmw/#Jm`-`lnfgznfmv!#ozqj`pwlgbz-jmgffg`lvmwz\\\\oldl-EbnjozollhfgNbqhfwopf#jeSobzfqwvqhfz*8ubq#elqfpwdjujmdfqqlqpGlnbjm~fopfxjmpfqwAold?,ellwfqoldjm-ebpwfqbdfmwp?algz#23s{#3sqbdnbeqjgbzivmjlqgloobqsob`fg`lufqpsovdjm6/333#sbdf!=alpwlm-wfpw+bubwbqwfpwfg\\\\`lvmwelqvnpp`kfnbjmgf{/ejoofgpkbqfpqfbgfqbofqw+bssfbqPvanjwojmf!=algz!=\\t)#WkfWklvdkpffjmdifqpfzMftp?,ufqjezf{sfqwjmivqztjgwk>@llhjfPWBQW#b`qlpp\\\\jnbdfwkqfbgmbwjufsl`hfwal{!=\\tPzpwfn#Gbujg`bm`fqwbaofpsqlufgBsqjo#qfboozgqjufqjwfn!=nlqf!=albqgp`lolqp`bnsvpejqpw#\\x7F\\x7F#X^8nfgjb-dvjwbqejmjpktjgwk9pkltfgLwkfq#-sks!#bppvnfobzfqptjoplmpwlqfpqfojfeptfgfm@vpwlnfbpjoz#zlvq#Pwqjmd\\t\\tTkjowbzolq`ofbq9qfplqweqfm`kwklvdk!*#(#!?algz=avzjmdaqbmgpNfnafqmbnf!=lssjmdpf`wlq6s{8!=upsb`fslpwfqnbilq#`leeffnbqwjmnbwvqfkbssfm?,mbu=hbmpbpojmh!=Jnbdfp>ebopftkjof#kpsb`f3%bns8#\\t\\tJm##sltfqSlophj.`lolqilqgbmAlwwlnPwbqw#.`lvmw1-kwnomftp!=32-isdLmojmf.qjdkwnjoofqpfmjlqJPAM#33/333#dvjgfpubovf*f`wjlmqfsbjq-{no!##qjdkwp-kwno.aol`hqfdF{s9klufqtjwkjmujqdjmsklmfp?,wq=\\x0Evpjmd#\\t\\nubq#=$*8\\t\\n?,wg=\\t?,wq=\\tabkbpbaqbpjodbofdlnbdzbqslophjpqsphj4]4C5d\\bTA\\nzk\\x0BBl\\bQ\\x7F\\x0BUm\\x05Gx\\bSM\\nmC\\bTA\\twQ\\nd}\\bW@\\bTl\\bTF\\ti@\\tcT\\x0BBM\\x0B|j\\x04BV\\tqw\\tcC\\bWI\\npa\\tfM\\n{Z\\x05{X\\bTF\\bVV\\bVK\\t\\x7Fm\\x04kF\\t[]\\bPm\\bTv\\nsI\\x0Bpg\\t[I\\bQp\\x04mx\\x0B_W\\n^M\\npe\\x0BQ}\\x0BGu\\nel\\npe\\x04Ch\\x04BV\\bTA\\tSo\\nzk\\x0BGL\\x0BxD\\nd[\\x05Jz\\x05MY\\bQp\\x04li\\nfl\\npC\\x05{B\\x05Nt\\x0BwT\\ti_\\bTg\\x04QQ\\n|p\\x0BXN\\bQS\\x0BxD\\x04QC\\bWZ\\tpD\\x0BVS\\bTW\\x05Nt\\x04Yh\\nzu\\x04Kj\\x05N}\\twr\\tHa\\n_D\\tj`\\x0BQ}\\x0BWp\\nxZ\\x04{c\\tji\\tBU\\nbD\\x04a|\\tTn\\tpV\\nZd\\nmC\\x0BEV\\x05{X\\tc}\\tTo\\bWl\\bUd\\tIQ\\tcg\\x0Bxs\\nXW\\twR\\x0Bek\\tc}\\t]y\\tJn\\nrp\\neg\\npV\\nz\\\\\\x05{W\\npl\\nz\\\\\\nzU\\tPc\\t`{\\bV@\\nc|\\bRw\\ti_\\bVb\\nwX\\tHv\\x04Su\\bTF\\x0B_W\\x0BWs\\x0BsI\\x05m\\x7F\\nTT\\ndc\\tUS\\t}f\\tiZ\\bWz\\tc}\\x04MD\\tBe\\tiD\\x0B@@\\bTl\\bPv\\t}t\\x04Sw\\x04M`\\x0BnU\\tkW\\x0Bed\\nqo\\x0BxY\\tA|\\bTz\\x0By`\\x04BR\\x04BM\\tia\\x04XU\\nyu\\x04n^\\tfL\\tiI\\nXW\\tfD\\bWz\\bW@\\tyj\\t\\x7Fm\\tav\\tBN\\x0Bb\\\\\\tpD\\bTf\\nY[\\tJn\\bQy\\t[^\\x0BWc\\x0Byu\\x04Dl\\x04CJ\\x0BWj\\x0BHR\\t`V\\x0BuW\\tQy\\np@\\x0BGu\\x05pl\\x04Jm\\bW[\\nLP\\nxC\\n`m\\twQ\\x05ui\\x05\\x7FR\\nbI\\twQ\\tBZ\\tWV\\x04BR\\npg\\tcg\\x05ti\\x04CW\\n_y\\tRg\\bQa\\x0BQB\\x0BWc\\nYb\\x05le\\ngE\\x04Su\\nL[\\tQ\\x7F\\tea\\tdj\\x0B]W\\nb~\\x04M`\\twL\\bTV\\bVH\\nt\\x7F\\npl\\t|b\\x05s_\\bU|\\bTa\\x04oQ\\x05lv\\x04Sk\\x04M`\\bTv\\x0BK}\\nfl\\tcC\\x04oQ\\x04BR\\tHk\\t|d\\bQp\\tHK\\tBZ\\x0BHR\\bPv\\x0BLx\\x0BEZ\\bT\\x7F\\bTv\\tiD\\x05oD\\x05MU\\x0BwB\\x04Su\\x05k`\\x04St\\ntC\\tPl\\tKg\\noi\\tjY\\x0BxY\\x04h}\\nzk\\bWZ\\t\\x7Fm\\x0Be`\\tTB\\tfE\\nzk\\t`z\\x04Yh\\nV|\\tHK\\tAJ\\tAJ\\bUL\\tp\\\\\\tql\\nYc\\x04Kd\\nfy\\x04Yh\\t[I\\x0BDg\\x04Jm\\n]n\\nlb\\bUd\\n{Z\\tlu\\tfs\\x04oQ\\bTW\\x04Jm\\x0BwB\\tea\\x04Yh\\x04BC\\tsb\\tTn\\nzU\\n_y\\x0BxY\\tQ]\\ngw\\x04mt\\tO\\\\\\ntb\\bWW\\bQy\\tmI\\tV[\\ny\\\\\\naB\\x0BRb\\twQ\\n]Q\\x04QJ\\bWg\\x0BWa\\bQj\\ntC\\bVH\\nYm\\x0Bxs\\bVK\\nel\\bWI\\x0BxY\\x04Cq\\ntR\\x0BHV\\bTl\\bVw\\tay\\bQa\\bVV\\t}t\\tdj\\nr|\\tp\\\\\\twR\\n{i\\nTT\\t[I\\ti[\\tAJ\\x0Bxs\\x0B_W\\td{\\x0BQ}\\tcg\\tTz\\tA|\\tCj\\x0BLm\\x05N}\\x05m\\x7F\\nbK\\tdZ\\tp\\\\\\t`V\\tsV\\np@\\tiD\\twQ\\x0BQ}\\bTf\\x05ka\\x04Jm\\x0B@@\\bV`\\tzp\\n@N\\x04Sw\\tiI\\tcg\\noi\\x04Su\\bVw\\x04lo\\x04Cy\\tc}\\x0Bb\\\\\\tsU\\x04BA\\bWI\\bTf\\nxS\\tVp\\nd|\\bTV\\x0BbC\\tNo\\x05Ju\\nTC\\t|`\\n{Z\\tD]\\bU|\\tc}\\x05lm\\bTl\\tBv\\tPl\\tc}\\bQp\\t\\x7Fm\\nLk\\tkj\\n@N\\x04Sb\\x04KO\\tj_\\tp\\\\\\nzU\\bTl\\bTg\\bWI\\tcf\\x04XO\\bWW\\ndz\\x04li\\tBN\\nd[\\bWO\\x04MD\\x0BKC\\tdj\\tI_\\bVV\\ny\\\\\\x0BLm\\x05xl\\txB\\tkV\\x0Bb\\\\\\x0BJW\\x0BVS\\tVx\\x0BxD\\td{\\x04MD\\bTa\\t|`\\x0BPz\\x04R}\\x0BWs\\x04BM\\nsI\\x04CN\\bTa\\x04Jm\\npe\\ti_\\npV\\nrh\\tRd\\tHv\\n~A\\nxR\\x0BWh\\x0BWk\\nxS\\x0BAz\\x0BwX\\nbI\\x04oQ\\tfw\\nqI\\nV|\\nun\\x05z\\x7F\\x0Bpg\\td\\\\\\x0BoA\\x05{D\\ti_\\x05xB\\bT\\x7F\\t`V\\x05qr\\tTT\\x04g]\\x04CA\\x0BuR\\tVJ\\tT`\\npw\\x0BRb\\tI_\\nCx\\x04Ro\\x0BsI\\x04Cj\\x04Kh\\tBv\\tWV\\x04BB\\x05oD\\x05{D\\nhc\\x04Km\\x0B^R\\tQE\\n{I\\np@\\nc|\\x05Gt\\tc}\\x04Dl\\nzU\\x05qN\\tsV\\x05k}\\tHh\\x0B|j\\nqo\\x05u|\\tQ]\\x0Bek\\x05\\x7FZ\\x04M`\\x04St\\npe\\tdj\\bVG\\x0BeE\\t\\x7Fm\\x0BWc\\x04|I\\n[W\\tfL\\bT\\x7F\\tBZ\\x04Su\\x0BKa\\x04Cq\\x05Nt\\x04Y[\\nqI\\bTv\\tfM\\ti@\\t}f\\x04B\\\\\\tQy\\x0BBl\\bWg\\x04XD\\x05kc\\x0Bx[\\bVV\\tQ]\\t\\x7Fa\\tPy\\x0BxD\\nfI\\t}f\\x05oD\\tdj\\tSG\\x05ls\\t~D\\x04CN\\n{Z\\t\\\\v\\n_D\\nhc\\x0Bx_\\x04C[\\tAJ\\nLM\\tVx\\x04CI\\tbj\\tc^\\tcF\\ntC\\x04Sx\\twr\\x04XA\\bU\\\\\\t|a\\x0BK\\\\\\bTV\\bVj\\nd|\\tfs\\x04CX\\ntb\\bRw\\tVx\\tAE\\tA|\\bT\\x7F\\x05Nt\\x0BDg\\tVc\\bTl\\x04d@\\npo\\t\\x7FM\\tcF\\npe\\tiZ\\tBo\\bSq\\nfH\\x04l`\\bTx\\bWf\\tHE\\x0BF{\\tcO\\tfD\\nlm\\x0BfZ\\nlm\\x0BeU\\tdG\\x04BH\\bTV\\tSi\\x05MW\\nwX\\nz\\\\\\t\\\\c\\x04CX\\nd}\\tl}\\bQp\\bTV\\tF~\\bQ\\x7F\\t`i\\ng@\\x05nO\\bUd\\bTl\\nL[\\twQ\\tji\\ntC\\t|J\\nLU\\naB\\x0BxY\\x04Kj\\tAJ\\x05uN\\ti[\\npe\\x04Sk\\x0BDg\\x0Bx]\\bVb\\bVV\\nea\\tkV\\nqI\\bTa\\x04Sk\\nAO\\tpD\\ntb\\nts\\nyi\\bVg\\ti_\\x0B_W\\nLk\\x05Nt\\tyj\\tfM\\x04R\\x7F\\tiI\\bTl\\x0BwX\\tsV\\x0BMl\\nyu\\tAJ\\bVj\\x04KO\\tWV\\x0BA}\\x0BW\\x7F\\nrp\\tiD\\x0B|o\\x05lv\\x0BsI\\x04BM\\td~\\tCU\\bVb\\x04eV\\npC\\x0BwT\\tj`\\tc}\\x0Bxs\\x0Bps\\x0Bvh\\tWV\\x0BGg\\x0BAe\\x0BVK\\x0B]W\\trg\\x0BWc\\x05F`\\tBr\\x0Bb\\\\\\tdZ\\bQp\\nqI\\x04kF\\nLk\\x0BAR\\bWI\\bTg\\tbs\\tdw\\n{L\\n_y\\tiZ\\bTA\\tlg\\bVV\\bTl\\tdk\\n`k\\ta{\\ti_\\x05{A\\x05wj\\twN\\x0B@@\\bTe\\ti_\\n_D\\twL\\nAH\\x0BiK\\x0Bek\\n[]\\tp_\\tyj\\bTv\\tUS\\t[r\\n{I\\nps\\x05Gt\\x0BVK\\npl\\x04S}\\x0BWP\\t|d\\x04MD\\x0BHV\\bT\\x7F\\x04R}\\x04M`\\bTV\\bVH\\x05lv\\x04Ch\\bW[\\x04Ke\\tR{\\x0B^R\\tab\\tBZ\\tVA\\tB`\\nd|\\nhs\\x04Ke\\tBe\\x04Oi\\tR{\\td\\\\\\x05nB\\bWZ\\tdZ\\tVJ\\x05Os\\t\\x7Fm\\x04uQ\\x0BhZ\\x04Q@\\x04QQ\\nfI\\bW[\\x04B\\\\\\x04li\\nzU\\nMd\\x04M`\\nxS\\bVV\\n\\\\}\\x0BxD\\t\\x7Fm\\bTp\\x04IS\\nc|\\tkV\\x05i~\\tV{\\x0BhZ\\t|b\\bWt\\n@R\\x0BoA\\x0BnU\\bWI\\tea\\tB`\\tiD\\tc}\\tTz\\x04BR\\x0BQB\\x05Nj\\tCP\\t[I\\bTv\\t`W\\x05uN\\x0Bpg\\x0Bpg\\x0BWc\\tiT\\tbs\\twL\\tU_\\tc\\\\\\t|h\\x0BKa\\tNr\\tfL\\nq|\\nzu\\nz\\\\\\tNr\\bUg\\t|b\\x04m`\\bTv\\nyd\\nrp\\bWf\\tUX\\x04BV\\nzk\\nd}\\twQ\\t}f\\x04Ce\\x0Bed\\bTW\\bSB\\nxU\\tcn\\bTb\\ne\\x7F\\ta\\\\\\tSG\\bU|\\npV\\nN\\\\\\x04Kn\\x0BnU\\tAt\\tpD\\x0B^R\\x0BIr\\x04b[\\tR{\\tdE\\x0BxD\\x0BWK\\x0BWA\\bQL\\bW@\\x04Su\\bUd\\nDM\\tPc\\x04CA\\x04Dl\\x04oQ\\tHs\\x05wi\\x04ub\\n\\x7Fa\\bQp\\x05Ob\\nLP\\bTl\\x04Y[\\x0BK}\\tAJ\\bQ\\x7F\\x04n^\\x0BsA\\bSM\\nqM\\bWZ\\n^W\\x0Bz{\\x04S|\\tfD\\bVK\\bTv\\bPv\\x04BB\\tCP\\x04dF\\tid\\x0Bxs\\x04mx\\x0Bws\\tcC\\ntC\\tyc\\x05M`\\x0BW\\x7F\\nrh\\bQp\\x0BxD\\x04\\\\o\\nsI\\x04_k\\nzu\\x04kF\\tfD\\x04Xs\\x04XO\\tjp\\bTv\\x04BS\\x05{B\\tBr\\nzQ\\nbI\\tc{\\x04BD\\x04BV\\x05nO\\bTF\\tca\\x05Jd\\tfL\\tPV\\tI_\\nlK\\x04`o\\twX\\npa\\tgu\\bP}\\x05{^\\bWf\\n{I\\tBN\\npa\\x04Kl\\x0Bpg\\tcn\\tfL\\x0Bvh\\x04Cq\\bTl\\x0BnU\\bSq\\x04Cm\\twR\\bUJ\\npe\\nyd\\nYg\\x04Cy\\x0BKW\\tfD\\nea\\x04oQ\\tj_\\tBv\\x04nM\\x0BID\\bTa\\nzA\\x05pl\\n]n\\bTa\\tR{\\tfr\\n_y\\bUg\\x05{X\\x05kk\\x0BxD\\x04|I\\x05xl\\nfy\\x04Ce\\x0BwB\\nLk\\x0Bd]\\noi\\n}h\\tQ]\\npe\\bVw\\x04Hk\\x04OQ\\nzk\\tAJ\\npV\\bPv\\ny\\\\\\tA{\\x04Oi\\bSB\\x04XA\\x0BeE\\tjp\\nq}\\tiD\\x05qN\\x0B^R\\t\\x7Fm\\tiZ\\tBr\\bVg\\noi\\n\\\\X\\tU_\\nc|\\x0BHV\\bTf\\tTn\\x04\\\\N\\x04\\\\N\\nuB\\x05lv\\nyu\\tTd\\bTf\\bPL\\x0B]W\\tdG\\nA`\\nw^\\ngI\\npe\\tdw\\nz\\\\\\x05ia\\bWZ\\tcF\\x04Jm\\n{Z\\bWO\\x04_k\\x04Df\\x04RR\\td\\\\\\bVV\\x0Bxs\\x04BN\\x05ti\\x04lm\\tTd\\t]y\\x0BHV\\tSo\\x0B|j\\x04XX\\tA|\\x0BZ^\\x0BGu\\bTW\\x05M`\\x04kF\\x0BhZ\\x0BVK\\tdG\\x0BBl\\tay\\nxU\\x05qE\\x05nO\\bVw\\nqI\\x04CX\\ne\\x7F\\tPl\\bWO\\x0BLm\\tdL\\x05uH\\x04Cm\\tdT\\x04fn\\x0BwB\\x05ka\\x0BnU\\n@M\\nyT\\tHv\\t\\\\}\\x04Kh\\td~\\x04Yh\\x05k}\\neR\\td\\\\\\bWI\\t|b\\tHK\\tiD\\bTW\\x05MY\\npl\\bQ_\\twr\\x0BAx\\tHE\\bTg\\bSq\\x05vp\\x0Bb\\\\\\bWO\\nOl\\nsI\\nfy\\x0BID\\t\\\\c\\n{Z\\n^~\\npe\\nAO\\tTT\\x0Bxv\\x04k_\\bWO\\x0B|j\\x0BwB\\tQy\\ti@\\tPl\\tHa\\tdZ\\x05k}\\x04ra\\tUT\\x0BJc\\x0Bed\\np@\\tQN\\nd|\\tkj\\tHk\\x04M`\\noi\\twr\\td\\\\\\nlq\\no_\\nlb\\nL[\\tac\\x04BB\\x04BH\\x04Cm\\npl\\tIQ\\bVK\\x0Bxs\\n`e\\x0BiK\\npa\\x04Oi\\tUS\\bTp\\tfD\\nPG\\x05kk\\x04XA\\nz\\\\\\neg\\x0BWh\\twR\\x05qN\\nqS\\tcn\\x04lo\\nxS\\n^W\\tBU\\nt\\x7F\\tHE\\tp\\\\\\tfF\\tfw\\bVV\\bW@\\tak\\x0BVK\\x05ls\\tVJ\\bVV\\x0BeE\\x04\\\\o\\nyX\\nYm\\x04M`\\x05lL\\nd|\\nzk\\tA{\\x05sE\\twQ\\x04XT\\nt\\x7F\\tPl\\t]y\\x0BwT\\x05{p\\x04MD\\x0Bb\\\\\\tQ]\\x04Kj\\tJn\\nAH\\x0BRb\\tBU\\tHK\\t\\\\c\\nfI\\x05m\\x7F\\nqM\\n@R\\tSo\\noi\\x04BT\\tHv\\n_y\\x04Kh\\tBZ\\t]i\\bUJ\\tV{\\x04Sr\\nbI\\x0BGg\\ta_\\bTR\\nfI\\nfl\\t[K\\tII\\x04S|\\x0BuW\\tiI\\bWI\\nqI\\x0B|j\\x04BV\\bVg\\bWZ\\x04kF\\x0Bx]\\bTA\\tab\\tfr\\ti@\\tJd\\tJd\\x0Bps\\nAO\\bTa\\x05xu\\tiD\\nzk\\t|d\\t|`\\bW[\\tlP\\tdG\\bVV\\x0Bw}\\x0BqO\\ti[\\bQ\\x7F\\bTz\\x0BVF\\twN\\x05ts\\tdw\\bTv\\neS\\ngi\\tNr\\x05yS\\npe\\bVV\\bSq\\n`m\\tyj\\tBZ\\x0BWX\\bSB\\tc\\\\\\nUR\\t[J\\tc_\\x04nM\\bWQ\\x0BAx\\nMd\\tBr\\x05ui\\x0BxY\\bSM\\x0BWc\\x0B|j\\x0Bxs\\t}Q\\tBO\\bPL\\bWW\\tfM\\nAO\\tPc\\x0BeU\\x04e^\\bTg\\nqI\\tac\\bPv\\tcF\\x04oQ\\tQ\\x7F\\x0BhZ\\x05ka\\nz\\\\\\tiK\\tBU\\n`k\\tCP\\x04S|\\x04M`\\n{I\\tS{\\x04_O\\tBZ\\x04Zi\\x04Sk\\tps\\tp\\\\\\nYu\\n]s\\nxC\\bWt\\nbD\\tkV\\x0BGu\\x05yS\\nqA\\t[r\\neK\\x04M`\\tdZ\\x05lL\\bUg\\bTl\\nbD\\tUS\\x0Bb\\\\\\tpV\\ncc\\x04S\\\\\\tct\\t`z\\bPL\\x0BWs\\nA`\\neg\\bSq\\x05uE\\x04CR\\x0BDg\\t`W\\x0Bz{\\x0BWc\\x04Sk\\x04Sk\\tbW\\bUg\\tea\\nxZ\\tiI\\tUX\\tVJ\\nqn\\tS{\\x0BRb\\bTQ\\npl\\x05Gt\\x0BuW\\x05uj\\npF\\nqI\\tfL\\t[I\\tia\\x04XO\\nyu\\x0BDg\\x0Bed\\tq{\\x04VG\\bQ\\x7F\\x05ka\\tVj\\tkV\\txB\\nd|\\np@\\tQN\\tPc\\tps\\x04]j\\tkV\\toU\\bTp\\nzU\\x05nB\\x0BB]\\ta{\\bV@\\n]n\\x04m`\\tcz\\tR{\\x04m`\\bQa\\x0BwT\\bSM\\x05MY\\x05qN\\tdj\\x05~s\\x0BQ}\\x05MY\\x0BMB\\tBv\\twR\\bRg\\x0BQ}\\tql\\x0BKC\\nrm\\x05xu\\x04CC\\x0BwB\\x0Bvh\\tBq\\x04Xq\\npV\\ti_\\x05Ob\\x05uE\\nbd\\nqo\\x0B{i\\nC~\\tBL\\x0BeE\\x05uH\\bVj\\x04Ey\\x04Gz\\x0BzR\\x0B{i\\tcf\\n{Z\\n]n\\x04XA\\x0BGu\\x0BnU\\thS\\x0BGI\\nCc\\tHE\\bTA\\tHB\\x04BH\\x04Cj\\nCc\\bTF\\tHE\\nXI\\tA{\\bQ\\x7F\\tc\\\\\\x0BmO\\x0BWX\\nfH\\np@\\x05MY\\bTF\\nlK\\tBt\\nzU\\tTT\\x04Km\\x0BwT\\npV\\ndt\\x0ByI\\tVx\\tQ\\x7F\\tRg\\tTd\\nzU\\bRS\\nLM\\twA\\x04nM\\tTn\\ndS\\t]g\\nLc\\x0BwB\\t}t\\t[I\\tCP\\x04kX\\x0BFm\\x0BhZ\\x05m\\x7F\\ti[\\np@\\x0BQ}\\x0BW\\x7F\\t|d\\nMO\\nMd\\tf_\\tfD\\tcJ\\tHz\\x0BRb\\tio\\tPy\\x04Y[\\nxU\\tct\\x0B@@\\tww\\bPv\\x04BM\\x04FF\\ntb\\x05v|\\x0BKm\\tBq\\tBq\\x04Kh\\x04`o\\nZd\\x04XU\\ti]\\t|`\\tSt\\x04B\\\\\\bQ\\x7F\\x0B_W\\tTJ\\nqI\\t|a\\tA{\\x0BuP\\x04MD\\tPl\\nxR\\tfL\\x0Bws\\tc{\\td\\\\\\bV`\\neg\\tHK\\x05kc\\nd|\\bVV\\ny\\\\\\x05kc\\ti]\\bVG\\t`V\\tss\\tI_\\tAE\\tbs\\tdu\\nel\\tpD\\x0BW\\x7F\\nqs\\x05lv\\bSM\\x04Zi\\x0BVK\\x05ia\\x0BQB\\tQ\\x7F\\n{Z\\bPt\\x0BKl\\nlK\\nhs\\ndS\\bVK\\x05mf\\nd^\\tkV\\tcO\\nc|\\bVH\\t\\\\]\\bTv\\bSq\\tmI\\x0BDg\\tVJ\\tcn\\ny\\\\\\bVg\\bTv\\nyX\\bTF\\t]]\\bTp\\noi\\nhs\\x0BeU\\nBf\\tdj\\x05Mr\\n|p\\t\\\\g\\t]r\\bVb\\x05{D\\nd[\\x04XN\\tfM\\tO\\\\\\x05s_\\tcf\\tiZ\\x04XN\\x0BWc\\tqv\\n`m\\tU^\\x05oD\\nd|\\x0BGg\\tdE\\x0Bwf\\x04lo\\x04u}\\nd|\\x05oQ\\t`i\\x04Oi\\x0BxD\\ndZ\\nCx\\x04Yw\\nzk\\ntb\\ngw\\tyj\\tB`\\nyX\\x0Bps\\ntC\\x0BpP\\x0Bqw\\bPu\\bPX\\tDm\\npw\\x05Nj\\tss\\taG\\x0Bxs\\bPt\\noL\\x04Gz\\tOk\\ti@\\ti]\\x04eC\\tIQ\\tii\\tdj\\x0B@J\\t|d\\x05uh\\bWZ\\x0BeU\\x0BnU\\bTa\\tcC\\x04g]\\nzk\\x04Yh\\bVK\\nLU\\np@\\ntb\\ntR\\tCj\\x0BNP\\ti@\\bP{\\n\\\\}\\n{c\\nwX\\tfL\\bVG\\tc{\\t|`\\tAJ\\t|C\\tfD\\x05ln\\t|d\\tbs\\nqI\\x05{B\\x0BAx\\np@\\nzk\\x0BRb\\x05Os\\x0BWS\\x04e^\\x0BD_\\tBv\\x0BWd\\bVb\\x0Bxs\\x0BeE\\bRw\\n]n\\n|p\\x0Bg|\\tfw\\x05kc\\bTI\\x05ka\\n\\\\T\\x04Sp\\tju\\x0Bps\\npe\\x05u|\\x0BGr\\bVe\\tCU\\x04]M\\x04XU\\x0BxD\\bTa\\tIQ\\x0BWq\\tCU\\tam\\tdj\\bSo\\x04Sw\\x0BnU\\x04Ch\\tQ]\\x05s_\\bPt\\tfS\\bTa\\t\\\\}\\n@O\\x04Yc\\tUZ\\bTx\\npe\\x0BnU\\nzU\\t|}\\tiD\\nz\\\\\\bSM\\x0BxD\\x04BR\\nzQ\\tQN\\x04]M\\x04Yh\\nLP\\x0BFm\\x0BLX\\x05vc\\x0Bql\\x05ka\\tHK\\bVb\\ntC\\nCy\\bTv\\nuV\\x04oQ\\t`z\\t[I\\tB`\\x0BRb\\tyj\\tsb\\x0BWs\\bTl\\tkV\\x0Bed\\ne\\x7F\\x05lL\\x0BxN\\t\\x7Fm\\nJn\\tjY\\x0BxD\\bVb\\bSq\\x0Byu\\twL\\x0BXL\\bTA\\tpg\\tAt\\tnD\\x04XX\\twR\\npl\\nhw\\x05yS\\nps\\tcO\\bW[\\x0B|j\\x04XN\\tsV\\tp\\\\\\tBe\\nb~\\nAJ\\n]e\\x05k`\\x05qN\\tdw\\tWV\\tHE\\x0BEV\\x05Jz\\tid\\tB`\\tzh\\x05E]\\tfD\\bTg\\x05qN\\bTa\\tja\\x04Cv\\bSM\\nhc\\bUe\\x05t_\\tie\\x04g]\\twQ\\nPn\\bVB\\tjw\\bVg\\x0BbE\\tBZ\\x0BRH\\bP{\\tjp\\n\\\\}\\ta_\\tcC\\t|a\\x0BD]\\tBZ\\ti[\\tfD\\x0BxW\\no_\\td\\\\\\n_D\\ntb\\t\\\\c\\tAJ\\nlK\\x04oQ\\x04lo\\x0BLx\\x0BM@\\bWZ\\x04Kn\\x0Bpg\\nTi\\nIv\\n|r\\x0B@}\\x05Jz\\x05Lm\\x05Wh\\x05k}\\x05ln\\x0BxD\\n]s\\x04gc\\x0Bps\\tBr\\bTW\\x0BBM\\x05tZ\\nBY\\x04DW\\tjf\\x0BSW\\x04C}\\nqo\\tdE\\tmv\\tIQ\\bPP\\bUb\\x05lv\\x04BC\\nzQ\\t[I\\x0Bgl\\nig\\bUs\\x04BT\\x0BbC\\bSq\\tsU\\tiW\\nJn\\tSY\\tHK\\trg\\npV\\x0BID\\x0B|j\\x04KO\\t`S\\t|a`vbmglfmujbqnbgqjgavp`bqjmj`jlwjfnslslqrvf`vfmwbfpwbglsvfgfmivfdlp`lmwqbfpw/Mmmlnaqfwjfmfmsfqejonbmfqbbnjdlp`jvgbg`fmwqlbvmrvfsvfgfpgfmwqlsqjnfqsqf`jlpfd/Vmavfmlpuloufqsvmwlppfnbmbkba/Abbdlpwlmvfulpvmjglp`bqolpfrvjslmj/]lpnv`klpbodvmb`lqqfljnbdfmsbqwjqbqqjabnbq/Abklnaqffnsoflufqgbg`bnajlnv`kbpevfqlmsbpbglo/Amfbsbqf`fmvfubp`vqplpfpwbabrvjfqlojaqlp`vbmwlb``fplnjdvfoubqjlp`vbwqlwjfmfpdqvslppfq/Mmfvqlsbnfgjlpeqfmwfb`fq`bgfn/Mplefqwb`l`kfpnlgfoljwbojbofwqbpbod/Vm`lnsqb`vbofpf{jpwf`vfqslpjfmglsqfmpboofdbqujbifpgjmfqlnvq`jbslgq/Msvfpwlgjbqjlsvfaolrvjfqfnbmvfosqlsjl`qjpjp`jfqwlpfdvqlnvfqwfevfmwf`fqqbqdqbmgffef`wlsbqwfpnfgjgbsqlsjbleqf`fwjfqqbf.nbjoubqjbpelqnbpevwvqllaifwlpfdvjqqjfpdlmlqnbpnjpnlp/Vmj`l`bnjmlpjwjlpqby/_mgfajglsqvfabwlofglwfm/Abifp/Vpfpsfql`l`jmblqjdfmwjfmgb`jfmwl`/Mgjykbaobqpfq/Abobwjmbevfqybfpwjoldvfqqbfmwqbq/E{jwlo/_sfybdfmgbu/Agflfujwbqsbdjmbnfwqlpibujfqsbgqfpe/M`jo`bafyb/Mqfbppbojgbfmu/Alibs/_mbavplpajfmfpwf{wlpoofubqsvfgbmevfqwf`ln/Vm`obpfpkvnbmlwfmjglajoablvmjgbgfpw/Mpfgjwbq`qfbgl<X<W=c=k=n<R<V<\\\\<V<T<W<T=a=n<R<^=m<Y<Y<_<R<S=l<T=n<\\\\<V<Y=e<Y=o<Z<Y<v<\\\\<V<]<Y<[<]=g<W<R<Q<T<~=m<Y<S<R<X<A=n<R=n<R<P=k<Y<P<Q<Y=n<W<Y=n=l<\\\\<[<R<Q<\\\\<_<X<Y<P<Q<Y<x<W=c<s=l<T<Q<\\\\=m<Q<T=i=n<Y<P<V=n<R<_<R<X<^<R=n=n<\\\\<P<M<D<|<P<\\\\=c<K=n<R<^<\\\\=m<^<\\\\<P<Y<P=o<N<\\\\<V<X<^<\\\\<Q<\\\\<P=a=n<T=a=n=o<~<\\\\<P=n<Y=i<S=l<R=n=o=n<Q<\\\\<X<X<Q=c<~<R=n=n=l<T<Q<Y<U<~<\\\\=m<Q<T<P=m<\\\\<P=n<R=n=l=o<]<r<Q<T<P<T=l<Q<Y<Y<r<r<r<W<T=j=a=n<\\\\<r<Q<\\\\<Q<Y<P<X<R<P<P<R<U<X<^<Y<R<Q<R=m=o<X\\fHy\\fIk\\fHU\\fId\\fHy\\fIl\\fHT\\fIk\\fHy\\fHR\\fHy\\fIg\\fHx\\fH\\\\\\fHF\\fH\\\\\\fHD\\fIk\\fHc\\fHy\\fHy\\fHS\\fHA\\fIl\\fHk\\fHT\\fHy\\fH\\\\\\fHH\\fIg\\fHU\\fIg\\fHj\\fHF\\fHU\\fIl\\fHC\\fHU\\fHC\\fHR\\fHH\\fHy\\fHI\\fHRibdqbm\\fHj\\fHp\\fHp\\fIg\\fHi\\fH@\\fHJ\\fIg\\fH{\\fHd\\fHp\\fHR\\fH{\\fHc\\fHU\\fHB\\fHk\\fHD\\fHY\\fHU\\fHC\\fIk\\fHI\\fIk\\fHI\\fIl\\fHt\\fH\\\\\\fHp\\fH@\\fHJ\\fIl\\fHy\\fHd\\fHp\\fIl\\fHY\\fIk\\fHD\\fHd\\fHD\\fHc\\fHU\\fH\\\\\\fHe\\fHT\\fHB\\fIk\\fHy\\fHB\\fHY\\fIg\\fH^\\fIk\\fHT\\fH@\\fHB\\fHd\\fHJ\\fIk\\fH\\x7F\\fH\\\\\\fHj\\fHB\\fH@\\fHT\\fHA\\fH\\\\\\fH@\\fHD\\fHv\\fH^\\fHB\\fHD\\fHj\\fH{\\fHT\\fIl\\fH^\\fIl4U5h5e4I5h5e5k4\\\\4K4N4B4]4U4C4C4K5h5e5k4\\\\5k4Y5d4]4V5f4]5o4K5j5d5h4K4D5f5j4U4]4Z4\\\\5h5o5k5j4K5f5d5i5n4K5h4U5h5f4K5j4K5h5o5j4A4F5e5n4D5h5d4A4E4K4B4]5m5n4[4U4D4C4]5o5j4I4\\\\4K5o5i4K4K4A4C4I5h4K5m5f5k4D4U4Z5o5f5m4D4A4G5d5i5j5d5k5d4O5j4K4@4C4K5h5k4K4_5h5i4U5j4C5h5f4_4U4D4]4Y5h5e5i5j4\\\\4D5k4K4O5j5k5i4G5h5o5j4F4K5h4K4A5f4G5i4Y4]4X4]4A4A5d5h5d5m5f4K4\\\\4K5h5o5h5i4]4E4K5j4F4K5h5m4O4D5d4B4K4Y4O5j4F4K5j5k4K5h5f4U4Z5d5d5n4C4K4D5j4B5f4]4D5j4F5h5o5i4X4K4M5d5k5f4K4D5d5n4Y4Y5d5i4K4]5n5i4O4A4C5j4A5j4U4C5i4]4O5f4K4A4E5o4F4D4C5d5j5f4@4D5i5j5k4F4A4F4@5k4E4_5j4E5f4F5i5o4]4E4V4^4E5j5m4_4D5f4F5h5h5k5h5j4K4F5h5o5n5h4D5h5i4K4U5j5k4O5d5h4X5f4M5j5d4]4O5i4K5m5f5o4D5o5h4\\\\4K4F4]4F4D4D4O5j5k5i4_4K5j5o4D5f4U5m5n4C4A4_5j5h5k5i4X4U4]4O5k5h4X5k4]5n4[4]4[5h4Dsqlejofpfquj`fgfebvowkjnpfoegfwbjop`lmwfmwpvsslqwpwbqwfgnfppbdfpv``fppebpkjlm?wjwof=`lvmwqzb``lvmw`qfbwfgpwlqjfpqfpvowpqvmmjmdsql`fpptqjwjmdlaif`wpujpjaoftfo`lnfbqwj`ofvmhmltmmfwtlqh`lnsbmzgzmbnj`aqltpfqsqjub`zsqlaofnPfquj`fqfpsf`wgjpsobzqfrvfpwqfpfquftfapjwfkjpwlqzeqjfmgplswjlmptlqhjmdufqpjlmnjoojlm`kbmmfotjmglt-bggqfppujpjwfgtfbwkfq`lqqf`wsqlgv`wfgjqf`welqtbqgzlv#`bmqfnlufgpvaif`w`lmwqlobq`kjuf`vqqfmwqfbgjmdojaqbqzojnjwfgnbmbdfqevqwkfqpvnnbqznb`kjmfnjmvwfpsqjubwf`lmwf{wsqldqbnpl`jfwzmvnafqptqjwwfmfmbaofgwqjddfqplvq`fpolbgjmdfofnfmwsbqwmfqejmboozsfqef`wnfbmjmdpzpwfnphffsjmd`vowvqf%rvlw8/ilvqmbosqlif`wpvqeb`fp%rvlw8f{sjqfpqfujftpabobm`fFmdojpk@lmwfmwwkqlvdkSofbpf#lsjmjlm`lmwb`wbufqbdfsqjnbqzujoobdfPsbmjpkdboofqzgf`ojmfnffwjmdnjppjlmslsvobqrvbojwznfbpvqfdfmfqbopsf`jfppfppjlmpf`wjlmtqjwfqp`lvmwfqjmjwjboqfslqwpejdvqfpnfnafqpklogjmdgjpsvwffbqojfqf{sqfppgjdjwbosj`wvqfBmlwkfqnbqqjfgwqbeej`ofbgjmd`kbmdfg`fmwqbouj`wlqzjnbdfp,qfbplmppwvgjfpefbwvqfojpwjmdnvpw#afp`kllopUfqpjlmvpvboozfsjplgfsobzjmddqltjmdlaujlvplufqobzsqfpfmwb`wjlmp?,vo=\\x0E\\ttqbssfqboqfbgz`fqwbjmqfbojwzpwlqbdfbmlwkfqgfphwlsleefqfgsbwwfqmvmvpvboGjdjwbo`bsjwboTfapjwfebjovqf`lmmf`wqfgv`fgBmgqljggf`bgfpqfdvobq#%bns8#bmjnbopqfofbpfBvwlnbwdfwwjmdnfwklgpmlwkjmdSlsvobq`bswjlmofwwfqp`bswvqfp`jfm`foj`fmpf`kbmdfpFmdobmg>2%bns8Kjpwlqz#>#mft#@fmwqbovsgbwfgPsf`jboMfwtlqhqfrvjqf`lnnfmwtbqmjmd@loofdfwlloabqqfnbjmpaf`bvpffof`wfgGfvwp`kejmbm`ftlqhfqprvj`hozafwtffmf{b`wozpfwwjmdgjpfbpfPl`jfwztfbslmpf{kjajw%ow8\"..@lmwqlo`obppfp`lufqfglvwojmfbwwb`hpgfuj`fp+tjmgltsvqslpfwjwof>!Nlajof#hjoojmdpkltjmdJwbojbmgqlssfgkfbujozfeef`wp.2$^*8\\t`lmejqn@vqqfmwbgubm`fpkbqjmdlsfmjmdgqbtjmdajoojlmlqgfqfgDfqnbmzqfobwfg?,elqn=jm`ovgftkfwkfqgfejmfgP`jfm`f`bwboldBqwj`ofavwwlmpobqdfpwvmjelqnilvqmfzpjgfabq@kj`bdlklojgbzDfmfqbosbppbdf/%rvlw8bmjnbwfeffojmdbqqjufgsbppjmdmbwvqboqlvdkoz-\\t\\tWkf#avw#mlwgfmpjwzAqjwbjm@kjmfpfob`h#lewqjavwfJqfobmg!#gbwb.eb`wlqpqf`fjufwkbw#jpOjaqbqzkvpabmgjm#eb`wbeebjqp@kbqofpqbgj`boaqlvdkwejmgjmdobmgjmd9obmd>!qfwvqm#ofbgfqpsobmmfgsqfnjvnsb`hbdfBnfqj`bFgjwjlm^%rvlw8Nfppbdfmffg#wlubovf>!`lnsof{ollhjmdpwbwjlmafojfufpnboofq.nlajofqf`lqgptbmw#wlhjmg#leEjqfel{zlv#bqfpjnjobqpwvgjfgnb{jnvnkfbgjmdqbsjgoz`ojnbwfhjmdglnfnfqdfgbnlvmwpelvmgfgsjlmffqelqnvobgzmbpwzklt#wl#Pvsslqwqfufmvff`lmlnzQfpvowpaqlwkfqplogjfqobqdfoz`boojmd-%rvlw8B``lvmwFgtbqg#pfdnfmwQlafqw#feelqwpSb`jej`ofbqmfgvs#tjwkkfjdkw9tf#kbufBmdfofpmbwjlmp\\\\pfbq`kbssojfgb`rvjqfnbppjufdqbmwfg9#ebopfwqfbwfgajddfpwafmfejwgqjujmdPwvgjfpnjmjnvnsfqkbspnlqmjmdpfoojmdjp#vpfgqfufqpfubqjbmw#qlof>!njppjmdb`kjfufsqlnlwfpwvgfmwplnflmff{wqfnfqfpwlqfalwwln9fuloufgboo#wkfpjwfnbsfmdojpktbz#wl##Bvdvpwpznalop@lnsbmznbwwfqpnvpj`bobdbjmpwpfqujmd~*+*8\\x0E\\tsbznfmwwqlvaof`lm`fsw`lnsbqfsbqfmwpsobzfqpqfdjlmpnlmjwlq#$$Wkf#tjmmjmdf{solqfbgbswfgDboofqzsqlgv`fbajojwzfmkbm`f`bqffqp*-#Wkf#`loof`wPfbq`k#bm`jfmwf{jpwfgellwfq#kbmgofqsqjmwfg`lmplofFbpwfqmf{slqwptjmgltp@kbmmfojoofdbomfvwqbopvddfpw\\\\kfbgfqpjdmjmd-kwno!=pfwwofgtfpwfqm`bvpjmd.tfahjw`objnfgIvpwj`f`kbswfquj`wjnpWklnbp#nlyjoobsqlnjpfsbqwjfpfgjwjlmlvwpjgf9ebopf/kvmgqfgLoznsj`\\\\avwwlmbvwklqpqfb`kfg`kqlmj`gfnbmgppf`lmgpsqlwf`wbglswfgsqfsbqfmfjwkfqdqfbwozdqfbwfqlufqboojnsqluf`lnnbmgpsf`jbopfbq`k-tlqpkjsevmgjmdwklvdkwkjdkfpwjmpwfbgvwjojwzrvbqwfq@vowvqfwfpwjmd`ofbqozf{slpfgAqltpfqojafqbo~#`bw`kSqlif`wf{bnsofkjgf+*8EolqjgbbmptfqpbooltfgFnsfqlqgfefmpfpfqjlvpeqffglnPfufqbo.avwwlmEvqwkfqlvw#le#\">#mvoowqbjmfgGfmnbqhuljg+3*,boo-ipsqfufmwQfrvfpwPwfskfm\\t\\tTkfm#lapfquf?,k1=\\x0E\\tNlgfqm#sqlujgf!#bow>!alqgfqp-\\t\\tElq#\\t\\tNbmz#bqwjpwpsltfqfgsfqelqnej`wjlmwzsf#lenfgj`bowj`hfwplsslpfg@lvm`jotjwmfppivpwj`fDflqdf#Afodjvn---?,b=wtjwwfqmlwbaoztbjwjmdtbqebqf#Lwkfq#qbmhjmdskqbpfpnfmwjlmpvqujufp`klobq?,s=\\x0E\\t#@lvmwqzjdmlqfgolpp#leivpw#bpDflqdjbpwqbmdf?kfbg=?pwlssfg2$^*8\\x0E\\tjpobmgpmlwbaofalqgfq9ojpw#le`bqqjfg233/333?,k0=\\t#pfufqboaf`lnfppfof`w#tfggjmd33-kwnonlmbq`klee#wkfwfb`kfqkjdkoz#ajloldzojef#lelq#fufmqjpf#le%qbrvl8sovplmfkvmwjmd+wklvdkGlvdobpiljmjmd`jq`ofpElq#wkfBm`jfmwUjfwmbnufkj`ofpv`k#bp`qzpwboubovf#>Tjmgltpfmilzfgb#pnboobppvnfg?b#jg>!elqfjdm#Boo#qjklt#wkfGjpsobzqfwjqfgkltfufqkjggfm8abwwofppffhjmd`bajmfwtbp#mlwollh#bw`lmgv`wdfw#wkfIbmvbqzkbssfmpwvqmjmdb9klufqLmojmf#Eqfm`k#ob`hjmdwzsj`bof{wqb`wfmfnjfpfufm#jedfmfqbwgf`jgfgbqf#mlw,pfbq`kafojfep.jnbdf9ol`bwfgpwbwj`-oldjm!=`lmufqwujlofmwfmwfqfgejqpw!=`jq`vjwEjmobmg`kfnjpwpkf#tbp23s{8!=bp#pv`kgjujgfg?,psbm=tjoo#afojmf#leb#dqfbwnzpwfqz,jmgf{-eboojmdgvf#wl#qbjotbz`loofdfnlmpwfqgfp`fmwjw#tjwkmv`ofbqIftjpk#sqlwfpwAqjwjpkeoltfqpsqfgj`wqfelqnpavwwlm#tkl#tbpof`wvqfjmpwbmwpvj`jgfdfmfqj`sfqjlgpnbqhfwpPl`jbo#ejpkjmd`lnajmfdqbskj`tjmmfqp?aq#,=?az#wkf#MbwvqboSqjub`z`llhjfplvw`lnfqfploufPtfgjpkaqjfeozSfqpjbmpl#nv`k@fmwvqzgfsj`wp`lovnmpklvpjmdp`qjswpmf{w#wlafbqjmdnbssjmdqfujpfgiRvfqz+.tjgwk9wjwof!=wllowjsPf`wjlmgfpjdmpWvqhjpkzlvmdfq-nbw`k+~*+*8\\t\\tavqmjmdlsfqbwfgfdqffpplvq`f>Qj`kbqg`olpfozsobpwj`fmwqjfp?,wq=\\x0E\\t`lolq9 vo#jg>!slppfppqloojmdskzpj`pebjojmdf{f`vwf`lmwfpwojmh#wlGfebvow?aq#,=\\t9#wqvf/`kbqwfqwlvqjpn`obppj`sql`ffgf{sobjm?,k2=\\x0E\\tlmojmf-<{no#ufkfosjmdgjbnlmgvpf#wkfbjqojmffmg#..=*-bwwq+qfbgfqpklpwjmd eeeeeeqfbojyfUjm`fmwpjdmbop#pq`>!,Sqlgv`wgfpsjwfgjufqpfwfoojmdSvaoj`#kfog#jmIlpfsk#wkfbwqfbeef`wp?pwzof=b#obqdfglfpm$wobwfq/#Fofnfmwebuj`lm`qfbwlqKvmdbqzBjqslqwpff#wkfpl#wkbwNj`kbfoPzpwfnpSqldqbnp/#bmg##tjgwk>f%rvlw8wqbgjmdofew!=\\tsfqplmpDlogfm#Beebjqpdqbnnbqelqnjmdgfpwqlzjgfb#le`bpf#lelogfpw#wkjp#jp-pq`#>#`bqwllmqfdjpwq@lnnlmpNvpojnpTkbw#jpjm#nbmznbqhjmdqfufbopJmgffg/frvbooz,pklt\\\\blvwgllqfp`bsf+Bvpwqjbdfmfwj`pzpwfn/Jm#wkf#pjwwjmdKf#boplJpobmgpB`bgfnz\\t\\n\\n?\"..Gbmjfo#ajmgjmdaol`h!=jnslpfgvwjojyfBaqbkbn+f{`fswxtjgwk9svwwjmd*-kwno+\\x7F\\x7F#X^8\\tGBWBX#)hjw`kfmnlvmwfgb`wvbo#gjbof`wnbjmoz#\\\\aobmh$jmpwboof{sfqwpje+wzsfJw#bopl%`lsz8#!=Wfqnpalqm#jmLswjlmpfbpwfqmwbohjmd`lm`fqmdbjmfg#lmdljmdivpwjez`qjwj`peb`wlqzjwp#ltmbppbvowjmujwfgobpwjmdkjp#ltmkqfe>!,!#qfo>!gfufols`lm`fqwgjbdqbngloobqp`ovpwfqsks<jg>bo`lklo*8~*+*8vpjmd#b=?psbm=ufppfopqfujuboBggqfppbnbwfvqbmgqljgboofdfgjoomfpptbohjmd`fmwfqprvbojeznbw`kfpvmjejfgf{wjm`wGfefmpfgjfg#jm\\t\\n?\"..#`vpwlnpojmhjmdOjwwof#Allh#lefufmjmdnjm-ip<bqf#wkfhlmwbhwwlgbz$p-kwno!#wbqdfw>tfbqjmdBoo#Qjd8\\t~*+*8qbjpjmd#Bopl/#`qv`jbobalvw!=gf`obqf..=\\t?p`ejqfel{bp#nv`kbssojfpjmgf{/#p/#avw#wzsf#>#\\t\\x0E\\t?\"..wltbqgpQf`lqgpSqjubwfElqfjdmSqfnjfq`klj`fpUjqwvboqfwvqmp@lnnfmwSltfqfgjmojmf8slufqwz`kbnafqOjujmd#ulovnfpBmwklmzoldjm!#QfobwfgF`lmlnzqfb`kfp`vwwjmddqbujwzojef#jm@kbswfq.pkbgltMlwbaof?,wg=\\x0E\\t#qfwvqmpwbgjvntjgdfwpubqzjmdwqbufopkfog#aztkl#bqftlqh#jmeb`vowzbmdvobqtkl#kbgbjqslqwwltm#le\\t\\tPlnf#$`oj`h$`kbqdfphfztlqgjw#tjoo`jwz#le+wkjp*8Bmgqft#vmjrvf#`kf`hfglq#nlqf033s{8#qfwvqm8qpjlm>!sovdjmptjwkjm#kfqpfoePwbwjlmEfgfqboufmwvqfsvaojpkpfmw#wlwfmpjlmb`wqfpp`lnf#wlejmdfqpGvhf#lesflsof/f{soljwtkbw#jpkbqnlmzb#nbilq!9!kwwsjm#kjp#nfmv!=\\tnlmwkozleej`fq`lvm`jodbjmjmdfufm#jmPvnnbqzgbwf#leolzbowzejwmfppbmg#tbpfnsfqlqpvsqfnfPf`lmg#kfbqjmdQvppjbmolmdfpwBoafqwbobwfqbopfw#le#pnboo!=-bssfmggl#tjwkefgfqboabmh#leafmfbwkGfpsjwf@bsjwbodqlvmgp*/#bmg#sfq`fmwjw#eqln`olpjmd`lmwbjmJmpwfbgejewffmbp#tfoo-zbkll-qfpslmgejdkwfqlap`vqfqfeof`wlqdbmj`>#Nbwk-fgjwjmdlmojmf#sbggjmdb#tkloflmfqqlqzfbq#lefmg#le#abqqjfqtkfm#jwkfbgfq#klnf#leqfpvnfgqfmbnfgpwqlmd=kfbwjmdqfwbjmp`olvgeqtbz#le#Nbq`k#2hmltjmdjm#sbqwAfwtffmofpplmp`olpfpwujqwvboojmhp!=`qlppfgFMG#..=ebnlvp#btbqgfgOj`fmpfKfbowk#ebjqoz#tfbowkznjmjnboBeqj`bm`lnsfwfobafo!=pjmdjmdebqnfqpAqbpjo*gjp`vppqfsob`fDqfdlqzelmw#`lsvqpvfgbssfbqpnbhf#vsqlvmgfgalwk#leaol`hfgpbt#wkfleej`fp`lolvqpje+gl`vtkfm#kffmelq`fsvpk+evBvdvpw#VWE.;!=Ebmwbpzjm#nlpwjmivqfgVpvboozebqnjmd`olpvqflaif`w#gfefm`fvpf#le#Nfgj`bo?algz=\\tfujgfmwaf#vpfghfz@lgfpj{wffmJpobnj` 333333fmwjqf#tjgfoz#b`wjuf#+wzsflelmf#`bm`lolq#>psfbhfqf{wfmgpSkzpj`pwfqqbjm?walgz=evmfqboujftjmdnjggof#`qj`hfwsqlskfwpkjewfggl`wlqpQvppfoo#wbqdfw`lnsb`wbodfaqbpl`jbo.avoh#lenbm#bmg?,wg=\\t#kf#ofew*-ubo+*ebopf*8oldj`boabmhjmdklnf#wlmbnjmd#Bqjylmb`qfgjwp*8\\t~*8\\telvmgfqjm#wvqm@loojmpafelqf#Avw#wkf`kbqdfgWjwof!=@bswbjmpsfoofgdlggfppWbd#..=Bggjmd9avw#tbpQf`fmw#sbwjfmwab`h#jm>ebopf%Ojm`lomtf#hmlt@lvmwfqIvgbjpnp`qjsw#bowfqfg$^*8\\t##kbp#wkfvm`ofbqFufmw$/alwk#jmmlw#boo\\t\\t?\"..#sob`jmdkbqg#wl#`fmwfqplqw#le`ojfmwppwqffwpAfqmbqgbppfqwpwfmg#wlebmwbpzgltm#jmkbqalvqEqffglniftfoqz,balvw--pfbq`kofdfmgpjp#nbgfnlgfqm#lmoz#lmlmoz#wljnbdf!#ojmfbq#sbjmwfqbmg#mlwqbqfoz#b`qlmzngfojufqpklqwfq33%bns8bp#nbmztjgwk>!,)#?\"X@wjwof#>le#wkf#oltfpw#sj`hfg#fp`bsfgvpfp#lesflsofp#Svaoj`Nbwwkftwb`wj`pgbnbdfgtbz#elqobtp#lefbpz#wl#tjmgltpwqlmd##pjnsof~`bw`k+pfufmwkjmelal{tfmw#wlsbjmwfg`jwjyfmJ#glm$wqfwqfbw-#Plnf#tt-!*8\\talnajmdnbjowl9nbgf#jm-#Nbmz#`bqqjfp\\x7F\\x7Fx~8tjtlqh#lepzmlmzngfefbwpebulqfglswj`bosbdfWqbvmofpp#pfmgjmdofew!=?`lnP`lqBoo#wkfiRvfqz-wlvqjpw@obppj`ebopf!#Tjokfonpvavqapdfmvjmfajpklsp-psojw+dolabo#elooltpalgz#lemlnjmbo@lmwb`wpf`vobqofew#wl`kjfeoz.kjggfm.abmmfq?,oj=\\t\\t-#Tkfm#jm#alwkgjpnjppF{solqfbotbzp#ujb#wkfpsb/]lotfoebqfqvojmd#bqqbmdf`bswbjmkjp#plmqvof#lekf#wllhjwpfoe/>3%bns8+`boofgpbnsofpwl#nbhf`ln,sbdNbqwjm#Hfmmfgzb``fswpevoo#lekbmgofgAfpjgfp,,..=?,baof#wlwbqdfwpfppfm`fkjn#wl#jwp#az#`lnnlm-njmfqbowl#wbhftbzp#wlp-lqd,obgujpfgsfmbowzpjnsof9je#wkfzOfwwfqpb#pklqwKfqafqwpwqjhfp#dqlvsp-ofmdwkeojdkwplufqobspoltoz#ofppfq#pl`jbo#?,s=\\t\\n\\njw#jmwlqbmhfg#qbwf#levo=\\x0E\\t##bwwfnswsbjq#lenbhf#jwHlmwbhwBmwlmjlkbujmd#qbwjmdp#b`wjufpwqfbnpwqbssfg!*-`pp+klpwjofofbg#wlojwwof#dqlvsp/Sj`wvqf..=\\x0E\\t\\x0E\\t#qltp>!#laif`wjmufqpf?ellwfq@vpwlnU=?_,p`qploujmd@kbnafqpobufqztlvmgfgtkfqfbp\">#$vmgelq#boosbqwoz#.qjdkw9Bqbajbmab`hfg#`fmwvqzvmjw#lenlajof.Fvqlsf/jp#klnfqjph#legfpjqfg@ojmwlm`lpw#lebdf#le#af`lnf#mlmf#les%rvlw8Njggof#fbg$*X3@qjwj`ppwvgjlp=%`lsz8dqlvs!=bppfnaonbhjmd#sqfppfgtjgdfw-sp9!#<#qfavjowaz#plnfElqnfq#fgjwlqpgfobzfg@bmlmj`kbg#wkfsvpkjmd`obpp>!avw#bqfsbqwjboAbazolmalwwln#`bqqjfq@lnnbmgjwp#vpfBp#tjwk`lvqpfpb#wkjqggfmlwfpbopl#jmKlvpwlm13s{8!=b``vpfgglvaof#dlbo#leEbnlvp#*-ajmg+sqjfpwp#Lmojmfjm#Ivozpw#(#!d`lmpvowgf`jnbokfosevoqfujufgjp#ufqzq$($jswolpjmd#efnbofpjp#boplpwqjmdpgbzp#lebqqjuboevwvqf#?laif`welq`jmdPwqjmd+!#,=\\t\\n\\nkfqf#jpfm`lgfg-##Wkf#aboollmglmf#az,`lnnlmad`lolqobt#le#Jmgjbmbbuljgfgavw#wkf1s{#0s{irvfqz-bewfq#bsloj`z-nfm#bmgellwfq.>#wqvf8elq#vpfp`qffm-Jmgjbm#jnbdf#>ebnjoz/kwws9,,#%maps8gqjufqpfwfqmbopbnf#bpmlwj`fgujftfqp~*+*8\\t#jp#nlqfpfbplmpelqnfq#wkf#mftjp#ivpw`lmpfmw#Pfbq`ktbp#wkftkz#wkfpkjssfgaq=?aq=tjgwk9#kfjdkw>nbgf#le`vjpjmfjp#wkbwb#ufqz#Bgnjqbo#ej{fg8mlqnbo#NjppjlmSqfpp/#lmwbqjl`kbqpfwwqz#wl#jmubgfg>!wqvf!psb`jmdjp#nlpwb#nlqf#wlwboozeboo#le~*8\\x0E\\t##jnnfmpfwjnf#jmpfw#lvwpbwjpezwl#ejmggltm#wlolw#le#Sobzfqpjm#Ivmfrvbmwvnmlw#wkfwjnf#wlgjpwbmwEjmmjpkpq`#>#+pjmdof#kfos#leDfqnbm#obt#bmgobafofgelqfpwp`llhjmdpsb`f!=kfbgfq.tfoo#bpPwbmofzaqjgdfp,dolabo@qlbwjb#Balvw#X3^8\\t##jw/#bmgdqlvsfgafjmd#b*xwkqltkf#nbgfojdkwfqfwkj`boEEEEEE!alwwln!ojhf#b#fnsolzpojuf#jmbp#pffmsqjmwfqnlpw#leva.ojmhqfif`wpbmg#vpfjnbdf!=pv``ffgeffgjmdMv`ofbqjmelqnbwl#kfosTlnfm$pMfjwkfqNf{j`bmsqlwfjm?wbaof#az#nbmzkfbowkzobtpvjwgfujpfg-svpk+xpfoofqppjnsoz#Wkqlvdk-`llhjf#Jnbdf+logfq!=vp-ip!=#Pjm`f#vmjufqpobqdfq#lsfm#wl\"..#fmgojfp#jm$^*8\\x0E\\t##nbqhfwtkl#jp#+!GLN@lnbmbdfglmf#elqwzsfle#Hjmdglnsqlejwpsqlslpfwl#pklt`fmwfq8nbgf#jwgqfppfgtfqf#jmnj{wvqfsqf`jpfbqjpjmdpq`#>#$nbhf#b#pf`vqfgAbswjpwulwjmd#\\t\\n\\nubq#Nbq`k#1dqft#vs@ojnbwf-qfnlufphjoofgtbz#wkf?,kfbg=eb`f#leb`wjmd#qjdkw!=wl#tlqhqfgv`fpkbp#kbgfqf`wfgpklt+*8b`wjlm>allh#lebm#bqfb>>#!kww?kfbgfq\\t?kwno=`lmelqneb`jmd#`llhjf-qfoz#lmklpwfg#-`vpwlnkf#tfmwavw#elqpsqfbg#Ebnjoz#b#nfbmplvw#wkfelqvnp-ellwbdf!=Nlajo@ofnfmwp!#jg>!bp#kjdkjmwfmpf..=?\"..efnbof#jp#pffmjnsojfgpfw#wkfb#pwbwfbmg#kjpebpwfpwafpjgfpavwwlm\\\\alvmgfg!=?jnd#Jmelal{fufmwp/b#zlvmdbmg#bqfMbwjuf#`kfbsfqWjnflvwbmg#kbpfmdjmfptlm#wkf+nlpwozqjdkw9#ejmg#b#.alwwlnSqjm`f#bqfb#lenlqf#lepfbq`k\\\\mbwvqf/ofdboozsfqjlg/obmg#lelq#tjwkjmgv`fgsqlujmdnjppjofol`boozBdbjmpwwkf#tbzh%rvlw8s{8!=\\x0E\\tsvpkfg#babmglmmvnfqbo@fqwbjmJm#wkjpnlqf#jmlq#plnfmbnf#jpbmg/#jm`qltmfgJPAM#3.`qfbwfpL`wlafqnbz#mlw`fmwfq#obwf#jmGfefm`ffmb`wfgtjpk#wlaqlbgoz`llojmdlmolbg>jw-#Wkfqf`lufqNfnafqpkfjdkw#bppvnfp?kwno=\\tsflsof-jm#lmf#>tjmgltellwfq\\\\b#dllg#qfhobnblwkfqp/wl#wkjp\\\\`llhjfsbmfo!=Olmglm/gfejmfp`qvpkfgabswjpn`lbpwbopwbwvp#wjwof!#nluf#wlolpw#jmafwwfq#jnsojfpqjuboqzpfqufqp#PzpwfnSfqkbspfp#bmg#`lmwfmgeoltjmdobpwfg#qjpf#jmDfmfpjpujft#leqjpjmd#pffn#wlavw#jm#ab`hjmdkf#tjoodjufm#bdjujmd#`jwjfp-eolt#le#Obwfq#boo#avwKjdktbzlmoz#azpjdm#lekf#glfpgjeefqpabwwfqz%bns8obpjmdofpwkqfbwpjmwfdfqwbhf#lmqfevpfg`boofg#>VP%bnsPff#wkfmbwjufpaz#wkjppzpwfn-kfbg#le9klufq/ofpajbmpvqmbnfbmg#boo`lnnlm,kfbgfq\\\\\\\\sbqbnpKbqubqg,sj{fo-qfnlubopl#olmdqlof#leiljmwozphzp`qbVmj`lgfaq#,=\\x0E\\tBwobmwbmv`ofvp@lvmwz/svqfoz#`lvmw!=fbpjoz#avjog#blm`oj`hb#djufmsljmwfqk%rvlw8fufmwp#fopf#x\\tgjwjlmpmlt#wkf/#tjwk#nbm#tkllqd,Tfalmf#bmg`buboqzKf#gjfgpfbwwof33/333#xtjmgltkbuf#wlje+tjmgbmg#jwpplofoz#n%rvlw8qfmftfgGfwqljwbnlmdpwfjwkfq#wkfn#jmPfmbwlqVp?,b=?Hjmd#leEqbm`jp.sqlgv`kf#vpfgbqw#bmgkjn#bmgvpfg#azp`lqjmdbw#klnfwl#kbufqfobwfpjajojwzeb`wjlmAveebolojmh!=?tkbw#kfeqff#wl@jwz#le`lnf#jmpf`wlqp`lvmwfglmf#gbzmfqulvpprvbqf#~8je+dljm#tkbwjnd!#bojp#lmozpfbq`k,wvfpgbzollpfozPlolnlmpf{vbo#.#?b#kqnfgjvn!GL#MLW#Eqbm`f/tjwk#b#tbq#bmgpf`lmg#wbhf#b#=\\x0E\\t\\x0E\\t\\x0E\\tnbqhfw-kjdktbzglmf#jm`wjujwz!obpw!=laojdfgqjpf#wl!vmgfejnbgf#wl#Fbqoz#sqbjpfgjm#jwp#elq#kjpbwkofwfIvsjwfqZbkll\"#wfqnfg#pl#nbmzqfbooz#p-#Wkf#b#tlnbm<ubovf>gjqf`w#qjdkw!#aj`z`ofb`jmd>!gbz#bmgpwbwjmdQbwkfq/kjdkfq#Leej`f#bqf#mltwjnfp/#tkfm#b#sbz#elqlm#wkjp.ojmh!=8alqgfqbqlvmg#bmmvbo#wkf#Mftsvw#wkf-`ln!#wbhjm#wlb#aqjfe+jm#wkfdqlvsp-8#tjgwkfmyznfppjnsof#jm#obwfxqfwvqmwkfqbszb#sljmwabmmjmdjmhp!=\\t+*8!#qfb#sob`f_v330@bbalvw#bwq=\\x0E\\t\\n\\n``lvmw#djufp#b?P@QJSWQbjotbzwkfnfp,wlloal{AzJg+!{kvnbmp/tbw`kfpjm#plnf#je#+tj`lnjmd#elqnbwp#Vmgfq#avw#kbpkbmgfg#nbgf#azwkbm#jmefbq#legfmlwfg,jeqbnfofew#jmulowbdfjm#fb`kb%rvlw8abpf#leJm#nbmzvmgfqdlqfdjnfpb`wjlm#?,s=\\x0E\\t?vpwlnUb8%dw8?,jnslqwplq#wkbwnlpwoz#%bns8qf#pjyf>!?,b=?,kb#`obppsbppjufKlpw#>#TkfwkfqefqwjofUbqjlvp>X^8+ev`bnfqbp,=?,wg=b`wp#bpJm#plnf=\\x0E\\t\\x0E\\t?\"lqdbmjp#?aq#,=Afjijmd`bwbo/Lgfvwp`kfvqlsfvfvphbqbdbfjodfpufmphbfpsb/]bnfmpbifvpvbqjlwqbabiln/E{j`ls/Mdjmbpjfnsqfpjpwfnbl`wvaqfgvqbmwfb/]bgjqfnsqfpbnlnfmwlmvfpwqlsqjnfqbwqbu/Epdqb`jbpmvfpwqbsql`fplfpwbglp`bojgbgsfqplmbm/Vnfqlb`vfqgln/Vpj`bnjfnaqllefqwbpbodvmlpsb/Apfpfifnsolgfqf`klbgfn/Mpsqjubglbdqfdbqfmob`fpslpjaofklwfofppfujoobsqjnfql/Vowjnlfufmwlpbq`kjul`vowvqbnvifqfpfmwqbgbbmvm`jlfnabqdlnfq`bgldqbmgfpfpwvgjlnfilqfpefaqfqlgjpf/]lwvqjpnl`/_gjdlslqwbgbfpsb`jlebnjojbbmwlmjlsfqnjwfdvbqgbqbodvmbpsqf`jlpbodvjfmpfmwjglujpjwbpw/Awvol`lml`fqpfdvmgl`lmpfileqbm`jbnjmvwlppfdvmgbwfmfnlpfef`wlpn/Mobdbpfpj/_mqfujpwbdqbmbgb`lnsqbqjmdqfpldbq`/Abb``j/_mf`vbglqrvjfmfpjm`ovplgfafq/Mnbwfqjbklnaqfpnvfpwqbslgq/Abnb/]bmb/Vowjnbfpwbnlplej`jbowbnajfmmjmd/Vmpbovglpslgfnlpnfilqbqslpjwjlmavpjmfppklnfsbdfpf`vqjwzobmdvbdfpwbmgbqg`bnsbjdmefbwvqfp`bwfdlqzf{wfqmbo`kjogqfmqfpfqufgqfpfbq`kf{`kbmdfebulqjwfwfnsobwfnjojwbqzjmgvpwqzpfquj`fpnbwfqjbosqlgv`wpy.jmgf{9`lnnfmwpplewtbqf`lnsofwf`bofmgbqsobwelqnbqwj`ofpqfrvjqfgnlufnfmwrvfpwjlmavjogjmdslojwj`pslppjaofqfojdjlmskzpj`boeffgab`hqfdjpwfqsj`wvqfpgjpbaofgsqlwl`lobvgjfm`fpfwwjmdpb`wjujwzfofnfmwpofbqmjmdbmzwkjmdbapwqb`wsqldqfpplufqujftnbdbyjmff`lmlnj`wqbjmjmdsqfppvqfubqjlvp#?pwqlmd=sqlsfqwzpklssjmdwldfwkfqbgubm`fgafkbujlqgltmolbgefbwvqfgellwaboopfof`wfgObmdvbdfgjpwbm`fqfnfnafqwqb`hjmdsbpptlqgnlgjejfgpwvgfmwpgjqf`wozejdkwjmdmlqwkfqmgbwbabpfefpwjuboaqfbhjmdol`bwjlmjmwfqmfwgqlsgltmsqb`wj`ffujgfm`fevm`wjlmnbqqjbdfqfpslmpfsqlaofnpmfdbwjufsqldqbnpbmbozpjpqfofbpfgabmmfq!=svq`kbpfsloj`jfpqfdjlmbo`qfbwjufbqdvnfmwallhnbqhqfefqqfq`kfnj`bogjujpjlm`booab`hpfsbqbwfsqlif`wp`lmeoj`wkbqgtbqfjmwfqfpwgfojufqznlvmwbjmlawbjmfg>#ebopf8elq+ubq#b``fswfg`bsb`jwz`lnsvwfqjgfmwjwzbjq`qbewfnsolzfgsqlslpfgglnfpwj`jm`ovgfpsqlujgfgklpsjwboufqwj`bo`loobspfbssqlb`ksbqwmfqpoldl!=?bgbvdkwfqbvwklq!#`vowvqboebnjojfp,jnbdfp,bppfnaozsltfqevowfb`kjmdejmjpkfggjpwqj`w`qjwj`bo`dj.ajm,svqslpfpqfrvjqfpfof`wjlmaf`lnjmdsqlujgfpb`bgfnj`f{fq`jpfb`wvbooznfgj`jmf`lmpwbmwb``jgfmwNbdbyjmfgl`vnfmwpwbqwjmdalwwln!=lapfqufg9#%rvlw8f{wfmgfgsqfujlvpPlewtbqf`vpwlnfqgf`jpjlmpwqfmdwkgfwbjofgpojdkwozsobmmjmdwf{wbqfb`vqqfm`zfufqzlmfpwqbjdkwwqbmpefqslpjwjufsqlgv`fgkfqjwbdfpkjssjmdbaplovwfqf`fjufgqfofubmwavwwlm!#ujlofm`fbmztkfqfafmfejwpobvm`kfgqf`fmwozboojbm`felooltfgnvowjsofavoofwjmjm`ovgfgl``vqqfgjmwfqmbo\\'+wkjp*-qfsvaoj`=?wq=?wg`lmdqfppqf`lqgfgvowjnbwfplovwjlm?vo#jg>!gjp`lufqKlnf?,b=tfapjwfpmfwtlqhpbowklvdkfmwjqfoznfnlqjbonfppbdfp`lmwjmvfb`wjuf!=plnftkbwuj`wlqjbTfpwfqm##wjwof>!Ol`bwjlm`lmwqb`wujpjwlqpGltmolbgtjwklvw#qjdkw!=\\tnfbpvqfptjgwk#>#ubqjbaofjmuloufgujqdjmjbmlqnboozkbssfmfgb``lvmwppwbmgjmdmbwjlmboQfdjpwfqsqfsbqfg`lmwqlopb``vqbwfajqwkgbzpwqbwfdzleej`jbodqbskj`p`qjnjmboslppjaoz`lmpvnfqSfqplmbopsfbhjmdubojgbwfb`kjfufg-isd!#,=nb`kjmfp?,k1=\\t##hfztlqgpeqjfmgozaqlwkfqp`lnajmfglqjdjmbo`lnslpfgf{sf`wfgbgfrvbwfsbhjpwbmeloolt!#ubovbaof?,obafo=qfobwjufaqjmdjmdjm`qfbpfdlufqmlqsovdjmp,Ojpw#le#Kfbgfq!=!#mbnf>!#+%rvlw8dqbgvbwf?,kfbg=\\t`lnnfq`fnbobzpjbgjqf`wlqnbjmwbjm8kfjdkw9p`kfgvof`kbmdjmdab`h#wl#`bwkloj`sbwwfqmp`lolq9# dqfbwfpwpvssojfpqfojbaof?,vo=\\t\\n\\n?pfof`w#`jwjyfmp`olwkjmdtbw`kjmd?oj#jg>!psf`jej``bqqzjmdpfmwfm`f?`fmwfq=`lmwqbpwwkjmhjmd`bw`k+f*plvwkfqmNj`kbfo#nfq`kbmw`bqlvpfosbggjmd9jmwfqjlq-psojw+!ojybwjlmL`wlafq#*xqfwvqmjnsqlufg..%dw8\\t\\t`lufqbdf`kbjqnbm-smd!#,=pvaif`wpQj`kbqg#tkbwfufqsqlabaozqf`lufqzabpfabooivgdnfmw`lmmf`w--`pp!#,=#tfapjwfqfslqwfggfebvow!,=?,b=\\x0E\\tfof`wqj`p`lwobmg`qfbwjlmrvbmwjwz-#JPAM#3gjg#mlw#jmpwbm`f.pfbq`k.!#obmd>!psfbhfqp@lnsvwfq`lmwbjmpbq`kjufpnjmjpwfqqfb`wjlmgjp`lvmwJwbojbml`qjwfqjbpwqlmdoz9#$kwws9$p`qjsw$`lufqjmdleefqjmdbssfbqfgAqjwjpk#jgfmwjezEb`fallhmvnfqlvpufkj`ofp`lm`fqmpBnfqj`bmkbmgojmdgju#jg>!Tjoojbn#sqlujgfq\\\\`lmwfmwb``vqb`zpf`wjlm#bmgfqplmeof{jaof@bwfdlqzobtqfm`f?p`qjsw=obzlvw>!bssqlufg#nb{jnvnkfbgfq!=?,wbaof=Pfquj`fpkbnjowlm`vqqfmw#`bmbgjbm`kbmmfop,wkfnfp,,bqwj`oflswjlmboslqwvdboubovf>!!jmwfqubotjqfofppfmwjwofgbdfm`jfpPfbq`k!#nfbpvqfgwklvpbmgpsfmgjmd%kfoojs8mft#Gbwf!#pjyf>!sbdfMbnfnjggof!#!#,=?,b=kjggfm!=pfrvfm`fsfqplmbolufqeoltlsjmjlmpjoojmljpojmhp!=\\t\\n?wjwof=ufqpjlmppbwvqgbzwfqnjmbojwfnsqlsfmdjmffqpf`wjlmpgfpjdmfqsqlslpbo>!ebopf!Fpsb/]loqfofbpfppvanjw!#fq%rvlw8bggjwjlmpznswlnplqjfmwfgqfplvq`fqjdkw!=?sofbpvqfpwbwjlmpkjpwlqz-ofbujmd##alqgfq>`lmwfmwp`fmwfq!=-\\t\\tPlnf#gjqf`wfgpvjwbaofavodbqjb-pklt+*8gfpjdmfgDfmfqbo#`lm`fswpF{bnsofptjoojbnpLqjdjmbo!=?psbm=pfbq`k!=lsfqbwlqqfrvfpwpb#%rvlw8booltjmdGl`vnfmwqfujpjlm-#\\t\\tWkf#zlvqpfoe@lmwb`w#nj`kjdbmFmdojpk#`lovnajbsqjlqjwzsqjmwjmdgqjmhjmdeb`jojwzqfwvqmfg@lmwfmw#leej`fqpQvppjbm#dfmfqbwf.;;6:.2!jmgj`bwfebnjojbq#rvbojwznbqdjm93#`lmwfmwujftslqw`lmwb`wp.wjwof!=slqwbaof-ofmdwk#fojdjaofjmuloufpbwobmwj`lmolbg>!gfebvow-pvssojfgsbznfmwpdolppbqz\\t\\tBewfq#dvjgbm`f?,wg=?wgfm`lgjmdnjggof!=`bnf#wl#gjpsobzpp`lwwjpkilmbwkbmnbilqjwztjgdfwp-`ojmj`bowkbjobmgwfb`kfqp?kfbg=\\t\\nbeef`wfgpvsslqwpsljmwfq8wlPwqjmd?,pnboo=lhobklnbtjoo#af#jmufpwlq3!#bow>!klojgbzpQfplvq`foj`fmpfg#+tkj`k#-#Bewfq#`lmpjgfqujpjwjmdf{solqfqsqjnbqz#pfbq`k!#bmgqljg!rvj`hoz#nffwjmdpfpwjnbwf8qfwvqm#8`lolq9 #kfjdkw>bssqlubo/#%rvlw8#`kf`hfg-njm-ip!nbdmfwj`=?,b=?,kelqf`bpw-#Tkjof#wkvqpgbzgufqwjpf%fb`vwf8kbp@obppfubovbwflqgfqjmdf{jpwjmdsbwjfmwp#Lmojmf#`lolqbglLswjlmp!`bnsafoo?\"..#fmg?,psbm=??aq#,=\\x0E\\t\\\\slsvsp\\x7Fp`jfm`fp/%rvlw8#rvbojwz#Tjmgltp#bppjdmfgkfjdkw9#?a#`obppof%rvlw8#ubovf>!#@lnsbmzf{bnsofp?jeqbnf#afojfufpsqfpfmwpnbqpkboosbqw#le#sqlsfqoz*-\\t\\tWkf#wb{lmlnznv`k#le#?,psbm=\\t!#gbwb.pqwvdv/Fpp`qlooWl#sqlif`w?kfbg=\\x0E\\tbwwlqmfzfnskbpjppslmplqpebm`zal{tlqog$p#tjogojef`kf`hfg>pfppjlmpsqldqbnns{8elmw.#Sqlif`wilvqmbopafojfufgub`bwjlmwklnsplmojdkwjmdbmg#wkf#psf`jbo#alqgfq>3`kf`hjmd?,walgz=?avwwlm#@lnsofwf`ofbqej{\\t?kfbg=\\tbqwj`of#?pf`wjlmejmgjmdpqlof#jm#slsvobq##L`wlafqtfapjwf#f{slpvqfvpfg#wl##`kbmdfplsfqbwfg`oj`hjmdfmwfqjmd`lnnbmgpjmelqnfg#mvnafqp##?,gju=`qfbwjmdlmPvanjwnbqzobmg`loofdfpbmbozwj`ojpwjmdp`lmwb`w-olddfgJmbgujplqzpjaojmdp`lmwfmw!p%rvlw8*p-#Wkjp#sb`hbdfp`kf`hal{pvddfpwpsqfdmbmwwlnlqqltpsb`jmd>j`lm-smdibsbmfpf`lgfabpfavwwlm!=dbnaojmdpv`k#bp#/#tkjof#?,psbm=#njpplvqjpslqwjmdwls92s{#-?,psbm=wfmpjlmptjgwk>!1obyzolbgmlufnafqvpfg#jm#kfjdkw>!`qjsw!=\\t%maps8?,?wq=?wg#kfjdkw91,sqlgv`w`lvmwqz#jm`ovgf#ellwfq!#%ow8\"..#wjwof!=?,irvfqz-?,elqn=\\t+\\x0BBl\\bQ\\x7F*+\\x0BUm\\x05Gx*kqubwphjjwbojbmlqln/Nm(ow/Pqh/Kf4K4]4C5dwbnaj/Emmlwj`jbpnfmpbifpsfqplmbpgfqf`klpmb`jlmbopfquj`jl`lmwb`wlvpvbqjlpsqldqbnbdlajfqmlfnsqfpbpbmvm`jlpubofm`jb`lolnajbgfpsv/Epgfslqwfpsqlzf`wlsqlgv`wls/Vaoj`lmlplwqlpkjpwlqjbsqfpfmwfnjoolmfpnfgjbmwfsqfdvmwbbmwfqjlqqf`vqplpsqlaofnbpbmwjbdlmvfpwqlplsjmj/_mjnsqjnjqnjfmwqbpbn/Eqj`bufmgfglqpl`jfgbgqfpsf`wlqfbojybqqfdjpwqlsbobaqbpjmwfq/Epfmwlm`fpfpsf`jbonjfnaqlpqfbojgbg`/_qglabybqbdlybs/Mdjmbppl`jbofpaolrvfbqdfpwj/_mborvjofqpjpwfnbp`jfm`jbp`lnsofwlufqpj/_m`lnsofwbfpwvgjlps/Vaoj`blaifwjulboj`bmwfavp`bglq`bmwjgbgfmwqbgbpb``jlmfpbq`kjulppvsfqjlqnbzlq/Abbofnbmjbevm`j/_m/Vowjnlpkb`jfmglbrvfoolpfgj`j/_mefqmbmglbnajfmwfeb`fallhmvfpwqbp`ojfmwfpsql`fplpabpwbmwfsqfpfmwbqfslqwbq`lmdqfplsvaoj`bq`lnfq`jl`lmwqbwli/_ufmfpgjpwqjwlw/E`mj`b`lmivmwlfmfqd/Abwqbabibqbpwvqjbpqf`jfmwfvwjojybqalofw/Ampboubglq`lqqf`wbwqbabilpsqjnfqlpmfdl`jlpojafqwbggfwboofpsbmwboobsq/_{jnlbonfq/Abbmjnbofprvj/Emfp`lqby/_mpf``j/_mavp`bmglls`jlmfpf{wfqjlq`lm`fswlwlgbu/Abdbofq/Abfp`qjajqnfgj`jmboj`fm`jb`lmpvowbbpsf`wlp`q/Awj`bg/_obqfpivpwj`jbgfafq/Mmsfq/Alglmf`fpjwbnbmwfmfqsfrvf/]lqf`jajgbwqjavmbowfmfqjef`bm`j/_m`bmbqjbpgfp`bqdbgjufqplpnboolq`bqfrvjfqfw/E`mj`lgfafq/Abujujfmgbejmbmybpbgfobmwfevm`jlmb`lmpfilpgje/A`jo`jvgbgfpbmwjdvbpbubmybgbw/Eqnjmlvmjgbgfpp/Mm`kfy`bnsb/]bplewlmj`qfujpwbp`lmwjfmfpf`wlqfpnlnfmwlpeb`vowbg`q/Egjwlgjufqpbppvsvfpwleb`wlqfppfdvmglpsfrvf/]b<_<R<X<\\\\<Y=m<W<T<Y=m=n=`<]=g<W<R<]=g=n=`=a=n<R<P<y=m<W<T=n<R<_<R<P<Y<Q=c<^=m<Y=i=a=n<R<U<X<\\\\<Z<Y<]=g<W<T<_<R<X=o<X<Y<Q=`=a=n<R=n<]=g<W<\\\\=m<Y<]=c<R<X<T<Q=m<Y<]<Y<Q<\\\\<X<R=m<\\\\<U=n=h<R=n<R<Q<Y<_<R=m<^<R<T=m<^<R<U<T<_=l=g=n<R<Z<Y<^=m<Y<P=m<^<R=b<W<T=d=`=a=n<T=i<S<R<V<\\\\<X<Q<Y<U<X<R<P<\\\\<P<T=l<\\\\<W<T<]<R=n<Y<P=o=i<R=n=c<X<^=o=i=m<Y=n<T<W=b<X<T<X<Y<W<R<P<T=l<Y=n<Y<]=c=m<^<R<Y<^<T<X<Y=k<Y<_<R=a=n<T<P=m=k<Y=n=n<Y<P=g=j<Y<Q=g=m=n<\\\\<W<^<Y<X=`=n<Y<P<Y<^<R<X=g=n<Y<]<Y<^=g=d<Y<Q<\\\\<P<T=n<T<S<\\\\=n<R<P=o<S=l<\\\\<^<W<T=j<\\\\<R<X<Q<\\\\<_<R<X=g<[<Q<\\\\=b<P<R<_=o<X=l=o<_<^=m<Y<U<T<X<Y=n<V<T<Q<R<R<X<Q<R<X<Y<W<\\\\<X<Y<W<Y=m=l<R<V<T=b<Q=c<^<Y=m=`<y=m=n=`=l<\\\\<[<\\\\<Q<\\\\=d<T4K5h5h5k4K5h4F5f4@5i5f4U4B4K4Y4E4K5h4\\\\5f4U5h5f5k4@4C5f4C4K5h4N5j4K5h4]4C4F4A5o5i4Y5m4A4E5o4K5j4F4K5h5h5f5f5o5d5j4X4D5o4E5m5f5k4K4D5j4K4F4A5d4K4M4O5o4G4]4B5h4K5h4K5h4A4D4C5h5f5h4C4]5d4_4K4Z4V4[4F5o5d5j5k5j4K5o4_4K4A4E5j4K4C5f4K5h4[4D4U5h5f5o4X5o4]4K5f5i5o5j5i5j5k4K4X4]5o4E4]4J5f4_5j4X5f4[5i4K4\\\\4K4K5h5m5j4X4D4K4D4F4U4D4]4]4A5i4E5o4K5m4E5f5n5d5h5i4]5o4^5o5h5i4E4O4A5i4C5n5h4D5f5f4U5j5f4Y5d4]4E4[4]5f5n4X4K4]5o4@5d4K5h4O4B4]5e5i4U5j4K4K4D4A4G4U4]5d4Z4D4X5o5h5i4_4@5h4D5j4K5j4B4K5h4C5o4F4K4D5o5h5f4E4D4C5d5j4O5f4Z4K5f5d4@4C5m4]5f5n5o4F4D4F4O5m4Z5h5i4[4D4B4K5o4G4]4D4K4]5o4K5m4Z5h4K4A5h5e5j5m4_5k4O5f4K5i4]4C5d4C4O5j5k4K4C5f5j4K4K5h4K5j5i4U4]4Z4F4U5h5i4C4K4B5h5i5i5o5j\\x03\\x03\\x03\\x03\\x03\\x03\\x03\\x03\\x02\\x03\\x02\\x03\\x02\\x03\\x02\\x03\\x01\\x03\\x01\\x03\\x01\\x03\\x01\\x03\\x07\\x03\\x07\\x03\\x07\\x03\\x07\\x03\\x03\\x02\\x01\\0\\x07\\x06\\x05\\x04\\x04\\x05\\x06\\x07\\0\\x01\\x02\\x03\\x0B\\n\\t\\b\\x0F\\x0E\\r\\f\\f\\r\\x0E\\x0F\\b\\t\\n\\x0B\\x13\\x12\\x11\\x10\\x17\\x16\\x15\\x14\\x14\\x15\\x16\\x17\\x10\\x11\\x12\\x13\\x1B\\x1A\\x19\\x18\\x1F\\x1E\\x1D\\x1C\\x1C\\x1D\\x1E\\x1F\\x18\\x19\\x1A\\x1B\\x13\\x13\\x13\\x13\\x03\\x03\\x03\\x03\\x03\\x03\\x03\\x03\\x13\\x13\\x13\\x13\\x02\\x03\\x03\\x03\\x01\\x03\\x03\\x03\\x01\\x03\\x03\\x03\\x02\\x03\\x03\\x03\\x02\\x03\\x03\\x03\\0\\x03\\x03\\x03\\x13\\x13\\x03\\x02\\x03\\x03\\x03\\x02\\x03\\x03\\x13\\x13\\x03\\x02\\x03\\x03\\x03\\x0B\\x03\\x0B\\x03\\x0B\\x03\\x0B\\x03\\x03\\x03\\x02\\x03\\x01\\x03\\0\\x03\\x07\\x03\\x06\\x03\\x05\\x03\\x04qfplvq`fp`lvmwqjfprvfpwjlmpfrvjsnfmw`lnnvmjwzbubjobaofkjdkojdkwGWG,{kwnonbqhfwjmdhmltofgdfplnfwkjmd`lmwbjmfqgjqf`wjlmpvap`qjafbgufqwjpf`kbqb`wfq!#ubovf>!?,pfof`w=Bvpwqbojb!#`obpp>!pjwvbwjlmbvwklqjwzelooltjmdsqjnbqjozlsfqbwjlm`kboofmdfgfufolsfgbmlmznlvpevm`wjlm#evm`wjlmp`lnsbmjfppwqv`wvqfbdqffnfmw!#wjwof>!slwfmwjbofgv`bwjlmbqdvnfmwppf`lmgbqz`lszqjdkwobmdvbdfpf{`ovpjuf`lmgjwjlm?,elqn=\\x0E\\tpwbwfnfmwbwwfmwjlmAjldqbskz~#fopf#x\\tplovwjlmptkfm#wkf#Bmbozwj`pwfnsobwfpgbmdfqlvppbwfoojwfgl`vnfmwpsvaojpkfqjnslqwbmwsqlwlwzsfjmeovfm`f%qbrvl8?,feef`wjufdfmfqboozwqbmpelqnafbvwjevowqbmpslqwlqdbmjyfgsvaojpkfgsqlnjmfmwvmwjo#wkfwkvnambjoMbwjlmbo#-el`vp+*8lufq#wkf#njdqbwjlmbmmlvm`fgellwfq!=\\tf{`fswjlmofpp#wkbmf{sfmpjufelqnbwjlmeqbnftlqhwfqqjwlqzmgj`bwjlm`vqqfmwoz`obppMbnf`qjwj`jpnwqbgjwjlmfopftkfqfBof{bmgfqbssljmwfgnbwfqjbopaqlbg`bpwnfmwjlmfgbeejojbwf?,lswjlm=wqfbwnfmwgjeefqfmw,gfebvow-Sqfpjgfmwlm`oj`h>!ajldqbskzlwkfqtjpfsfqnbmfmwEqbm/KbjpKlooztllgf{sbmpjlmpwbmgbqgp?,pwzof=\\tqfgv`wjlmGf`fnafq#sqfefqqfg@bnaqjgdflsslmfmwpAvpjmfpp#`lmevpjlm=\\t?wjwof=sqfpfmwfgf{sobjmfgglfp#mlw#tlqogtjgfjmwfqeb`fslpjwjlmpmftpsbsfq?,wbaof=\\tnlvmwbjmpojhf#wkf#fppfmwjboejmbm`jbopfof`wjlmb`wjlm>!,babmglmfgFgv`bwjlmsbqpfJmw+pwbajojwzvmbaof#wl?,wjwof=\\tqfobwjlmpMlwf#wkbwfeej`jfmwsfqelqnfgwtl#zfbqpPjm`f#wkfwkfqfelqftqbssfq!=bowfqmbwfjm`qfbpfgAbwwof#lesfq`fjufgwqzjmd#wlmf`fppbqzslqwqbzfgfof`wjlmpFojybafwk?,jeqbnf=gjp`lufqzjmpvqbm`fp-ofmdwk8ofdfmgbqzDfldqbskz`bmgjgbwf`lqslqbwfplnfwjnfppfquj`fp-jmkfqjwfg?,pwqlmd=@lnnvmjwzqfojdjlvpol`bwjlmp@lnnjwwffavjogjmdpwkf#tlqogml#olmdfqafdjmmjmdqfefqfm`f`bmmlw#afeqfrvfm`zwzsj`boozjmwl#wkf#qfobwjuf8qf`lqgjmdsqfpjgfmwjmjwjboozwf`kmjrvfwkf#lwkfqjw#`bm#aff{jpwfm`fvmgfqojmfwkjp#wjnfwfofsklmfjwfnp`lsfsqb`wj`fpbgubmwbdf*8qfwvqm#Elq#lwkfqsqlujgjmdgfnl`qb`zalwk#wkf#f{wfmpjufpveefqjmdpvsslqwfg`lnsvwfqp#evm`wjlmsqb`wj`bopbjg#wkbwjw#nbz#afFmdojpk?,eqln#wkf#p`kfgvofggltmolbgp?,obafo=\\tpvpsf`wfgnbqdjm9#3psjqjwvbo?,kfbg=\\t\\tnj`qlplewdqbgvboozgjp`vppfgkf#af`bnff{f`vwjufirvfqz-ipklvpfklog`lmejqnfgsvq`kbpfgojwfqboozgfpwqlzfgvs#wl#wkfubqjbwjlmqfnbjmjmdjw#jp#mlw`fmwvqjfpIbsbmfpf#bnlmd#wkf`lnsofwfgbodlqjwknjmwfqfpwpqfafoojlmvmgfejmfgfm`lvqbdfqfpjybaofjmuloujmdpfmpjwjufvmjufqpbosqlujpjlm+bowklvdkefbwvqjmd`lmgv`wfg*/#tkj`k#`lmwjmvfg.kfbgfq!=Efaqvbqz#mvnfqlvp#lufqeolt9`lnslmfmweqbdnfmwpf{`foofmw`lopsbm>!wf`kmj`bomfbq#wkf#Bgubm`fg#plvq`f#lef{sqfppfgKlmd#Hlmd#Eb`fallhnvowjsof#nf`kbmjpnfofubwjlmleefmpjuf?,elqn=\\t\\npslmplqfggl`vnfmw-lq#%rvlw8wkfqf#bqfwklpf#tklnlufnfmwpsql`fppfpgjeej`vowpvanjwwfgqf`lnnfmg`lmujm`fgsqlnlwjmd!#tjgwk>!-qfsob`f+`obppj`bo`lbojwjlmkjp#ejqpwgf`jpjlmpbppjpwbmwjmgj`bwfgfulovwjlm.tqbssfq!fmlvdk#wlbolmd#wkfgfojufqfg..=\\x0E\\t?\"..Bnfqj`bm#sqlwf`wfgMlufnafq#?,pwzof=?evqmjwvqfJmwfqmfw##lmaovq>!pvpsfmgfgqf`jsjfmwabpfg#lm#Nlqflufq/balojpkfg`loof`wfgtfqf#nbgffnlwjlmbofnfqdfm`zmbqqbwjufbgul`bwfps{8alqgfq`lnnjwwfggjq>!owq!fnsolzffpqfpfbq`k-#pfof`wfgpv``fpplq`vpwlnfqpgjpsobzfgPfswfnafqbgg@obpp+Eb`fallh#pvddfpwfgbmg#obwfqlsfqbwjmdfobalqbwfPlnfwjnfpJmpwjwvwf`fqwbjmozjmpwboofgelooltfqpIfqvpbofnwkfz#kbuf`lnsvwjmddfmfqbwfgsqlujm`fpdvbqbmwffbqajwqbqzqf`ldmjyftbmwfg#wls{8tjgwk9wkflqz#leafkbujlvqTkjof#wkffpwjnbwfgafdbm#wl#jw#af`bnfnbdmjwvgfnvpw#kbufnlqf#wkbmGjqf`wlqzf{wfmpjlmpf`qfwbqzmbwvqboozl``vqqjmdubqjbaofpdjufm#wkfsobwelqn-?,obafo=?ebjofg#wl`lnslvmgphjmgp#le#pl`jfwjfpbolmdpjgf#..%dw8\\t\\tplvwktfpwwkf#qjdkwqbgjbwjlmnbz#kbuf#vmfp`bsf+pslhfm#jm!#kqfe>!,sqldqbnnflmoz#wkf#`lnf#eqlngjqf`wlqzavqjfg#jmb#pjnjobqwkfz#tfqf?,elmw=?,Mlqtfdjbmpsf`jejfgsqlgv`jmdsbppfmdfq+mft#Gbwfwfnslqbqzej`wjlmboBewfq#wkffrvbwjlmpgltmolbg-qfdvobqozgfufolsfqbaluf#wkfojmhfg#wlskfmlnfmbsfqjlg#lewllowjs!=pvapwbm`fbvwlnbwj`bpsf`w#leBnlmd#wkf`lmmf`wfgfpwjnbwfpBjq#Elq`fpzpwfn#lelaif`wjufjnnfgjbwfnbhjmd#jwsbjmwjmdp`lmrvfqfgbqf#pwjoosql`fgvqfdqltwk#lekfbgfg#azFvqlsfbm#gjujpjlmpnlof`vofpeqbm`kjpfjmwfmwjlmbwwqb`wfg`kjogkllgbopl#vpfggfgj`bwfgpjmdbslqfgfdqff#leebwkfq#le`lmeoj`wp?,b=?,s=\\t`bnf#eqlntfqf#vpfgmlwf#wkbwqf`fjujmdF{f`vwjuffufm#nlqfb``fpp#wl`lnnbmgfqSlojwj`bonvpj`jbmpgfoj`jlvpsqjplmfqpbgufmw#leVWE.;!#,=?\"X@GBWBX!=@lmwb`wPlvwkfqm#ad`lolq>!pfqjfp#le-#Jw#tbp#jm#Fvqlsfsfqnjwwfgubojgbwf-bssfbqjmdleej`jboppfqjlvpoz.obmdvbdfjmjwjbwfgf{wfmgjmdolmd.wfqnjmeobwjlmpv`k#wkbwdfw@llhjfnbqhfg#az?,avwwlm=jnsofnfmwavw#jw#jpjm`qfbpfpgltm#wkf#qfrvjqjmdgfsfmgfmw..=\\t?\"..#jmwfqujftTjwk#wkf#`lsjfp#le`lmpfmpvptbp#avjowUfmfyvfob+elqnfqozwkf#pwbwfsfqplmmfopwqbwfdj`ebulvq#lejmufmwjlmTjhjsfgjb`lmwjmfmwujqwvbooztkj`k#tbpsqjm`jsof@lnsofwf#jgfmwj`bopklt#wkbwsqjnjwjufbtbz#eqlnnlof`vobqsqf`jpfozgjpploufgVmgfq#wkfufqpjlm>!=%maps8?,Jw#jp#wkf#Wkjp#jp#tjoo#kbuflqdbmjpnpplnf#wjnfEqjfgqj`ktbp#ejqpwwkf#lmoz#eb`w#wkbwelqn#jg>!sqf`fgjmdWf`kmj`boskzpj`jpwl``vqp#jmmbujdbwlqpf`wjlm!=psbm#jg>!plvdkw#wlafolt#wkfpvqujujmd~?,pwzof=kjp#gfbwkbp#jm#wkf`bvpfg#azsbqwjboozf{jpwjmd#vpjmd#wkftbp#djufmb#ojpw#leofufop#lemlwjlm#leLeej`jbo#gjpnjppfgp`jfmwjpwqfpfnaofpgvsoj`bwff{solpjufqf`lufqfgboo#lwkfqdboofqjfpxsbggjmd9sflsof#leqfdjlm#lebggqfppfpbppl`jbwfjnd#bow>!jm#nlgfqmpklvog#afnfwklg#leqfslqwjmdwjnfpwbnsmffgfg#wlwkf#Dqfbwqfdbqgjmdpffnfg#wlujftfg#bpjnsb`w#lmjgfb#wkbwwkf#Tlqogkfjdkw#lef{sbmgjmdWkfpf#bqf`vqqfmw!=`bqfevooznbjmwbjmp`kbqdf#le@obppj`bobggqfppfgsqfgj`wfgltmfqpkjs?gju#jg>!qjdkw!=\\x0E\\tqfpjgfm`fofbuf#wkf`lmwfmw!=bqf#lewfm##~*+*8\\x0E\\tsqlabaoz#Sqlefpplq.avwwlm!#qfpslmgfgpbzp#wkbwkbg#wl#afsob`fg#jmKvmdbqjbmpwbwvp#lepfqufp#bpVmjufqpbof{f`vwjlmbddqfdbwfelq#tkj`kjmef`wjlmbdqffg#wlkltfufq/#slsvobq!=sob`fg#lm`lmpwqv`wfof`wlqbopznalo#lejm`ovgjmdqfwvqm#wlbq`kjwf`w@kqjpwjbmsqfujlvp#ojujmd#jmfbpjfq#wlsqlefpplq\\t%ow8\"..#feef`w#lebmbozwj`ptbp#wbhfmtkfqf#wkfwllh#lufqafojfe#jmBeqjhbbmpbp#ebq#bpsqfufmwfgtlqh#tjwkb#psf`jbo?ejfogpfw@kqjpwnbpQfwqjfufg\\t\\tJm#wkf#ab`h#jmwlmlqwkfbpwnbdbyjmfp=?pwqlmd=`lnnjwwffdlufqmjmddqlvsp#lepwlqfg#jmfpwbaojpkb#dfmfqbojwp#ejqpwwkfjq#ltmslsvobwfgbm#laif`w@bqjaafbmboolt#wkfgjpwqj`wptjp`lmpjmol`bwjlm-8#tjgwk9#jmkbajwfgPl`jbojpwIbmvbqz#2?,ellwfq=pjnjobqoz`klj`f#lewkf#pbnf#psf`jej`#avpjmfpp#Wkf#ejqpw-ofmdwk8#gfpjqf#wlgfbo#tjwkpjm`f#wkfvpfqBdfmw`lm`fjufgjmgf{-sksbp#%rvlw8fmdbdf#jmqf`fmwoz/eft#zfbqptfqf#bopl\\t?kfbg=\\t?fgjwfg#azbqf#hmltm`jwjfp#jmb``fpphfz`lmgfnmfgbopl#kbufpfquj`fp/ebnjoz#leP`kllo#le`lmufqwfgmbwvqf#le#obmdvbdfnjmjpwfqp?,laif`w=wkfqf#jp#b#slsvobqpfrvfm`fpbgul`bwfgWkfz#tfqfbmz#lwkfqol`bwjlm>fmwfq#wkfnv`k#nlqfqfeof`wfgtbp#mbnfglqjdjmbo#b#wzsj`botkfm#wkfzfmdjmffqp`lvog#mlwqfpjgfmwptfgmfpgbzwkf#wkjqg#sqlgv`wpIbmvbqz#1tkbw#wkfzb#`fqwbjmqfb`wjlmpsql`fpplqbewfq#kjpwkf#obpw#`lmwbjmfg!=?,gju=\\t?,b=?,wg=gfsfmg#lmpfbq`k!=\\tsjf`fp#le`lnsfwjmdQfefqfm`fwfmmfppfftkj`k#kbp#ufqpjlm>?,psbm=#??,kfbgfq=djufp#wkfkjpwlqjbmubovf>!!=sbggjmd93ujft#wkbwwldfwkfq/wkf#nlpw#tbp#elvmgpvapfw#lebwwb`h#lm`kjogqfm/sljmwp#lesfqplmbo#slpjwjlm9boofdfgoz@ofufobmgtbp#obwfqbmg#bewfqbqf#djufmtbp#pwjoop`qloojmdgfpjdm#lenbhfp#wkfnv`k#ofppBnfqj`bmp-\\t\\tBewfq#/#avw#wkfNvpfvn#leolvjpjbmb+eqln#wkfnjmmfplwbsbqwj`ofpb#sql`fppGlnjmj`bmulovnf#leqfwvqmjmdgfefmpjuf33s{\\x7Fqjdknbgf#eqlnnlvpflufq!#pwzof>!pwbwfp#le+tkj`k#jp`lmwjmvfpEqbm`jp`lavjogjmd#tjwklvw#btjwk#plnftkl#tlvogb#elqn#leb#sbqw#leafelqf#jwhmltm#bp##Pfquj`fpol`bwjlm#bmg#lewfmnfbpvqjmdbmg#jw#jpsbsfqab`hubovfp#le\\x0E\\t?wjwof=>#tjmglt-gfwfqnjmffq%rvlw8#sobzfg#azbmg#fbqoz?,`fmwfq=eqln#wkjpwkf#wkqffsltfq#bmgle#%rvlw8jmmfqKWNO?b#kqfe>!z9jmojmf8@kvq`k#lewkf#fufmwufqz#kjdkleej`jbo#.kfjdkw9#`lmwfmw>!,`dj.ajm,wl#`qfbwfbeqjhbbmpfpsfqbmwleqbm/Kbjpobwujf)Mvojfwvuj)_(`f)Mwjmb(af)Mwjmb\\fUh\\fT{\\fTN\\n{I\\np@\\x04Fr\\x0BBl\\bQ\\x7F\\tA{\\x0BUm\\x05Gx\\tA{\\x01yp\\x06YA\\0zX\\bTV\\bWl\\bUd\\x04BM\\x0BB{\\npV\\x0B@x\\x04B\\\\\\np@\\x04Db\\x04Gz\\tal\\npa\\tfM\\tuD\\bV~\\x04mx\\x0BQ}\\ndS\\tp\\\\\\bVK\\bS]\\bU|\\x05oD\\tkV\\x0Bed\\x0BHR\\nb~\\x04M`\\nJp\\x05oD\\x04|Q\\nLP\\x04Sw\\bTl\\nAI\\nxC\\bWt\\tBq\\x05F`\\x04Cm\\x0BLm\\tKx\\t}t\\bPv\\ny\\\\\\naB\\tV\\x7F\\nZd\\x04XU\\x04li\\tfr\\ti@\\tBH\\x04BD\\x04BV\\t`V\\n[]\\tp_\\tTn\\n~A\\nxR\\tuD\\t`{\\bV@\\tTn\\tHK\\tAJ\\x0Bxs\\x04Zf\\nqI\\x04Zf\\x0BBM\\x0B|j\\t}t\\bSM\\nmC\\x0BQ}pfquj`jlpbqw/A`volbqdfmwjmbabq`folmb`vborvjfqsvaoj`bglsqlgv`wlpslo/Awj`bqfpsvfpwbtjhjsfgjbpjdvjfmwfa/Vprvfgb`lnvmjgbgpfdvqjgbgsqjm`jsbosqfdvmwbp`lmwfmjglqfpslmgfqufmfyvfobsqlaofnbpgj`jfnaqfqfob`j/_mmlujfnaqfpjnjobqfpsqlzf`wlpsqldqbnbpjmpwjwvwlb`wjujgbgfm`vfmwqbf`lmln/Abjn/Mdfmfp`lmwb`wbqgfp`bqdbqmf`fpbqjlbwfm`j/_mwfo/Eelml`lnjpj/_m`bm`jlmfp`bsb`jgbgfm`lmwqbqbm/Mojpjpebulqjwlpw/Eqnjmlpsqlujm`jbfwjrvfwbpfofnfmwlpevm`jlmfpqfpvowbgl`bq/M`wfqsqlsjfgbgsqjm`jsjlmf`fpjgbgnvmj`jsbo`qfb`j/_mgfp`bqdbpsqfpfm`jb`lnfq`jbolsjmjlmfpfifq`j`jlfgjwlqjbopbobnbm`bdlmy/Mofygl`vnfmwlsfo/A`vobqf`jfmwfpdfmfqbofpwbqqbdlmbsq/M`wj`bmlufgbgfpsqlsvfpwbsb`jfmwfpw/E`mj`bplaifwjulp`lmwb`wlp\\fHB\\fIk\\fHn\\fH^\\fHS\\fHc\\fHU\\fId\\fHn\\fH{\\fHC\\fHR\\fHT\\fHR\\fHI\\fHc\\fHY\\fHn\\fH\\\\\\fHU\\fIk\\fHy\\fIg\\fHd\\fHy\\fIm\\fHw\\fH\\\\\\fHU\\fHR\\fH@\\fHR\\fHJ\\fHy\\fHU\\fHR\\fHT\\fHA\\fIl\\fHU\\fIm\\fHc\\fH\\\\\\fHU\\fIl\\fHB\\fId\\fHn\\fHJ\\fHS\\fHD\\fH@\\fHR\\fHHgjsolgl`p\\fHT\\fHB\\fHC\\fH\\\\\\fIn\\fHF\\fHD\\fHR\\fHB\\fHF\\fHH\\fHR\\fHG\\fHS\\fH\\\\\\fHx\\fHT\\fHH\\fHH\\fH\\\\\\fHU\\fH^\\fIg\\fH{\\fHU\\fIm\\fHj\\fH@\\fHR\\fH\\\\\\fHJ\\fIk\\fHZ\\fHU\\fIm\\fHd\\fHz\\fIk\\fH^\\fHC\\fHJ\\fHS\\fHy\\fHR\\fHB\\fHY\\fIk\\fH@\\fHH\\fIl\\fHD\\fH@\\fIl\\fHv\\fHB\\fI`\\fHH\\fHT\\fHR\\fH^\\fH^\\fIk\\fHz\\fHp\\fIe\\fH@\\fHB\\fHJ\\fHJ\\fHH\\fHI\\fHR\\fHD\\fHU\\fIl\\fHZ\\fHU\\fH\\\\\\fHi\\fH^\\fH{\\fHy\\fHA\\fIl\\fHD\\fH{\\fH\\\\\\fHF\\fHR\\fHT\\fH\\\\\\fHR\\fHH\\fHy\\fHS\\fHc\\fHe\\fHT\\fIk\\fH{\\fHC\\fIl\\fHU\\fIn\\fHm\\fHj\\fH{\\fIk\\fHs\\fIl\\fHB\\fHz\\fIg\\fHp\\fHy\\fHR\\fH\\\\\\fHi\\fHA\\fIl\\fH{\\fHC\\fIk\\fHH\\fIm\\fHB\\fHY\\fIg\\fHs\\fHJ\\fIk\\fHn\\fHi\\fH{\\fH\\\\\\fH|\\fHT\\fIk\\fHB\\fIk\\fH^\\fH^\\fH{\\fHR\\fHU\\fHR\\fH^\\fHf\\fHF\\fH\\\\\\fHv\\fHR\\fH\\\\\\fH|\\fHT\\fHR\\fHJ\\fIk\\fH\\\\\\fHp\\fHS\\fHT\\fHJ\\fHS\\fH^\\fH@\\fHn\\fHJ\\fH@\\fHD\\fHR\\fHU\\fIn\\fHn\\fH^\\fHR\\fHz\\fHp\\fIl\\fHH\\fH@\\fHs\\fHD\\fHB\\fHS\\fH^\\fHk\\fHT\\fIk\\fHj\\fHD\\fIk\\fHD\\fHC\\fHR\\fHy\\fIm\\fH^\\fH^\\fIe\\fH{\\fHA\\fHR\\fH{\\fH\\\\\\fIk\\fH^\\fHp\\fH{\\fHU\\fH\\\\\\fHR\\fHB\\fH^\\fH{\\fIk\\fHF\\fIk\\fHp\\fHU\\fHR\\fHI\\fHk\\fHT\\fIl\\fHT\\fHU\\fIl\\fHy\\fH^\\fHR\\fHL\\fIl\\fHy\\fHU\\fHR\\fHm\\fHJ\\fIn\\fH\\\\\\fHH\\fHU\\fHH\\fHT\\fHR\\fHH\\fHC\\fHR\\fHJ\\fHj\\fHC\\fHR\\fHF\\fHR\\fHy\\fHy\\fI`\\fHD\\fHZ\\fHR\\fHB\\fHJ\\fIk\\fHz\\fHC\\fHU\\fIl\\fH\\\\\\fHR\\fHC\\fHz\\fIm\\fHJ\\fH^\\fH{\\fIl`bwfdlqjfpf{sfqjfm`f?,wjwof=\\x0E\\t@lszqjdkw#ibubp`qjsw`lmgjwjlmpfufqzwkjmd?s#`obpp>!wf`kmloldzab`hdqlvmg?b#`obpp>!nbmbdfnfmw%`lsz8#132ibubP`qjsw`kbqb`wfqpaqfbg`qvnawkfnpfoufpklqjylmwbodlufqmnfmw@bojelqmjbb`wjujwjfpgjp`lufqfgMbujdbwjlmwqbmpjwjlm`lmmf`wjlmmbujdbwjlmbssfbqbm`f?,wjwof=?n`kf`hal{!#wf`kmjrvfpsqlwf`wjlmbssbqfmwozbp#tfoo#bpvmw$/#$VB.qfplovwjlmlsfqbwjlmpwfofujpjlmwqbmpobwfgTbpkjmdwlmmbujdbwlq-#>#tjmglt-jnsqfppjlm%ow8aq%dw8ojwfqbwvqfslsvobwjlmad`lolq>! fpsf`jbooz#`lmwfmw>!sqlgv`wjlmmftpofwwfqsqlsfqwjfpgfejmjwjlmofbgfqpkjsWf`kmloldzSbqojbnfmw`lnsbqjplmvo#`obpp>!-jmgf{Le+!`lm`ovpjlmgjp`vppjlm`lnslmfmwpajloldj`boQfulovwjlm\\\\`lmwbjmfqvmgfqpwllgmlp`qjsw=?sfqnjppjlmfb`k#lwkfqbwnlpskfqf#lmel`vp>!?elqn#jg>!sql`fppjmdwkjp-ubovfdfmfqbwjlm@lmefqfm`fpvapfrvfmwtfoo.hmltmubqjbwjlmpqfsvwbwjlmskfmlnfmlmgjp`jsojmfoldl-smd!#+gl`vnfmw/alvmgbqjfpf{sqfppjlmpfwwofnfmwAb`hdqlvmglvw#le#wkffmwfqsqjpf+!kwwsp9!#vmfp`bsf+!sbpptlqg!#gfnl`qbwj`?b#kqfe>!,tqbssfq!=\\tnfnafqpkjsojmdvjpwj`s{8sbggjmdskjolplskzbppjpwbm`fvmjufqpjwzeb`jojwjfpqf`ldmjyfgsqfefqfm`fje#+wzsflenbjmwbjmfgul`bavobqzkzslwkfpjp-pvanjw+*8%bns8maps8bmmlwbwjlmafkjmg#wkfElvmgbwjlmsvaojpkfq!bppvnswjlmjmwqlgv`fg`lqqvswjlmp`jfmwjpwpf{soj`jwozjmpwfbg#legjnfmpjlmp#lm@oj`h>!`lmpjgfqfggfsbqwnfmwl``vsbwjlmpllm#bewfqjmufpwnfmwsqlmlvm`fgjgfmwjejfgf{sfqjnfmwNbmbdfnfmwdfldqbskj`!#kfjdkw>!ojmh#qfo>!-qfsob`f+,gfsqfppjlm`lmefqfm`fsvmjpknfmwfojnjmbwfgqfpjpwbm`fbgbswbwjlmlsslpjwjlmtfoo#hmltmpvssofnfmwgfwfqnjmfgk2#`obpp>!3s{8nbqdjmnf`kbmj`bopwbwjpwj`p`fofaqbwfgDlufqmnfmw\\t\\tGvqjmd#wgfufolsfqpbqwjej`jbofrvjubofmwlqjdjmbwfg@lnnjppjlmbwwb`knfmw?psbm#jg>!wkfqf#tfqfMfgfqobmgpafzlmg#wkfqfdjpwfqfgilvqmbojpweqfrvfmwozboo#le#wkfobmd>!fm!#?,pwzof=\\x0E\\tbaplovwf8#pvsslqwjmdf{wqfnfoz#nbjmpwqfbn?,pwqlmd=#slsvobqjwzfnsolznfmw?,wbaof=\\x0E\\t#`lopsbm>!?,elqn=\\t##`lmufqpjlmbalvw#wkf#?,s=?,gju=jmwfdqbwfg!#obmd>!fmSlqwvdvfpfpvapwjwvwfjmgjujgvbojnslppjaofnvowjnfgjbbonlpw#boos{#plojg# bsbqw#eqlnpvaif`w#wljm#Fmdojpk`qjwj`jyfgf{`fsw#elqdvjgfojmfplqjdjmboozqfnbqhbaofwkf#pf`lmgk1#`obpp>!?b#wjwof>!+jm`ovgjmdsbqbnfwfqpsqlkjajwfg>#!kwws9,,gj`wjlmbqzsfq`fswjlmqfulovwjlmelvmgbwjlms{8kfjdkw9pv``fppevopvsslqwfqpnjoofmmjvnkjp#ebwkfqwkf#%rvlw8ml.qfsfbw8`lnnfq`jbojmgvpwqjbofm`lvqbdfgbnlvmw#le#vmleej`jbofeej`jfm`zQfefqfm`fp`llqgjmbwfgjp`objnfqf{sfgjwjlmgfufolsjmd`bo`vobwfgpjnsojejfgofdjwjnbwfpvapwqjmd+3!#`obpp>!`lnsofwfozjoovpwqbwfejuf#zfbqpjmpwqvnfmwSvaojpkjmd2!#`obpp>!spz`kloldz`lmejgfm`fmvnafq#le#bapfm`f#leel`vpfg#lmiljmfg#wkfpwqv`wvqfpsqfujlvpoz=?,jeqbnf=lm`f#bdbjmavw#qbwkfqjnnjdqbmwple#`lvqpf/b#dqlvs#leOjwfqbwvqfVmojhf#wkf?,b=%maps8\\tevm`wjlm#jw#tbp#wkf@lmufmwjlmbvwlnlajofSqlwfpwbmwbddqfppjufbewfq#wkf#Pjnjobqoz/!#,=?,gju=`loof`wjlm\\x0E\\tevm`wjlmujpjajojwzwkf#vpf#leulovmwffqpbwwqb`wjlmvmgfq#wkf#wkqfbwfmfg)?\"X@GBWBXjnslqwbm`fjm#dfmfqbowkf#obwwfq?,elqn=\\t?,-jmgf{Le+$j#>#38#j#?gjeefqfm`fgfulwfg#wlwqbgjwjlmppfbq`k#elqvowjnbwfozwlvqmbnfmwbwwqjavwfppl.`boofg#~\\t?,pwzof=fubovbwjlmfnskbpjyfgb``fppjaof?,pf`wjlm=pv``fppjlmbolmd#tjwkNfbmtkjof/jmgvpwqjfp?,b=?aq#,=kbp#af`lnfbpsf`wp#leWfofujpjlmpveej`jfmwabphfwabooalwk#pjgfp`lmwjmvjmdbm#bqwj`of?jnd#bow>!bgufmwvqfpkjp#nlwkfqnbm`kfpwfqsqjm`jsofpsbqwj`vobq`lnnfmwbqzfeef`wp#legf`jgfg#wl!=?pwqlmd=svaojpkfqpIlvqmbo#legjeej`vowzeb`jojwbwfb``fswbaofpwzof-`pp!\\nevm`wjlm#jmmlubwjlm=@lszqjdkwpjwvbwjlmptlvog#kbufavpjmfppfpGj`wjlmbqzpwbwfnfmwplewfm#vpfgsfqpjpwfmwjm#Ibmvbqz`lnsqjpjmd?,wjwof=\\t\\ngjsolnbwj``lmwbjmjmdsfqelqnjmdf{wfmpjlmpnbz#mlw#af`lm`fsw#le#lm`oj`h>!Jw#jp#boplejmbm`jbo#nbhjmd#wkfOv{fnalvqdbggjwjlmbobqf#`boofgfmdbdfg#jm!p`qjsw!*8avw#jw#tbpfof`wqlmj`lmpvanjw>!\\t?\"..#Fmg#fof`wqj`boleej`jboozpvddfpwjlmwls#le#wkfvmojhf#wkfBvpwqbojbmLqjdjmboozqfefqfm`fp\\t?,kfbg=\\x0E\\tqf`ldmjpfgjmjwjbojyfojnjwfg#wlBof{bmgqjbqfwjqfnfmwBgufmwvqfpelvq#zfbqp\\t\\t%ow8\"..#jm`qfbpjmdgf`lqbwjlmk0#`obpp>!lqjdjmp#lelaojdbwjlmqfdvobwjlm`obppjejfg+evm`wjlm+bgubmwbdfpafjmd#wkf#kjpwlqjbmp?abpf#kqfeqfsfbwfgoztjoojmd#wl`lnsbqbaofgfpjdmbwfgmlnjmbwjlmevm`wjlmbojmpjgf#wkfqfufobwjlmfmg#le#wkfp#elq#wkf#bvwklqjyfgqfevpfg#wlwbhf#sob`fbvwlmlnlvp`lnsqlnjpfslojwj`bo#qfpwbvqbmwwtl#le#wkfEfaqvbqz#1rvbojwz#leptelaif`w-vmgfqpwbmgmfbqoz#bootqjwwfm#azjmwfqujftp!#tjgwk>!2tjwkgqbtboeolbw9ofewjp#vpvbooz`bmgjgbwfpmftpsbsfqpnzpwfqjlvpGfsbqwnfmwafpw#hmltmsbqojbnfmwpvssqfppfg`lmufmjfmwqfnfnafqfggjeefqfmw#pzpwfnbwj`kbp#ofg#wlsqlsbdbmgb`lmwqloofgjmeovfm`fp`fqfnlmjbosql`objnfgSqlwf`wjlmoj#`obpp>!P`jfmwjej``obpp>!ml.wqbgfnbqhpnlqf#wkbm#tjgfpsqfbgOjafqbwjlmwllh#sob`fgbz#le#wkfbp#olmd#bpjnsqjplmfgBggjwjlmbo\\t?kfbg=\\t?nObalqbwlqzMlufnafq#1f{`fswjlmpJmgvpwqjboubqjfwz#leeolbw9#ofeGvqjmd#wkfbppfppnfmwkbuf#affm#gfbop#tjwkPwbwjpwj`pl``vqqfm`f,vo=?,gju=`ofbqej{!=wkf#svaoj`nbmz#zfbqptkj`k#tfqflufq#wjnf/pzmlmznlvp`lmwfmw!=\\tsqfpvnbaozkjp#ebnjozvpfqBdfmw-vmf{sf`wfgjm`ovgjmd#`kboofmdfgb#njmlqjwzvmgfejmfg!afolmdp#wlwbhfm#eqlnjm#L`wlafqslpjwjlm9#pbjg#wl#afqfojdjlvp#Efgfqbwjlm#qltpsbm>!lmoz#b#eftnfbmw#wkbwofg#wl#wkf..=\\x0E\\t?gju#?ejfogpfw=Bq`kajpkls#`obpp>!mlafjmd#vpfgbssqlb`kfpsqjujofdfpmlp`qjsw=\\tqfpvowp#jmnbz#af#wkfFbpwfq#fddnf`kbmjpnpqfbplmbaofSlsvobwjlm@loof`wjlmpfof`wfg!=mlp`qjsw=\\x0E,jmgf{-sksbqqjubo#le.ippgh$**8nbmbdfg#wljm`lnsofwf`bpvbowjfp`lnsofwjlm@kqjpwjbmpPfswfnafq#bqjwknfwj`sql`fgvqfpnjdkw#kbufSqlgv`wjlmjw#bssfbqpSkjolplskzeqjfmgpkjsofbgjmd#wldjujmd#wkfwltbqg#wkfdvbqbmwffggl`vnfmwfg`lolq9 333ujgfl#dbnf`lnnjppjlmqfeof`wjmd`kbmdf#wkfbppl`jbwfgpbmp.pfqjelmhfzsqfpp8#sbggjmd9Kf#tbp#wkfvmgfqozjmdwzsj`booz#/#bmg#wkf#pq`Fofnfmwpv``fppjufpjm`f#wkf#pklvog#af#mfwtlqhjmdb``lvmwjmdvpf#le#wkfoltfq#wkbmpkltp#wkbw?,psbm=\\t\\n\\n`lnsobjmwp`lmwjmvlvprvbmwjwjfpbpwqlmlnfqkf#gjg#mlwgvf#wl#jwpbssojfg#wlbm#bufqbdffeelqwp#wlwkf#evwvqfbwwfnsw#wlWkfqfelqf/`bsbajojwzQfsvaoj`bmtbp#elqnfgFof`wqlmj`hjolnfwfqp`kboofmdfpsvaojpkjmdwkf#elqnfqjmgjdfmlvpgjqf`wjlmppvapjgjbqz`lmpsjqb`zgfwbjop#lebmg#jm#wkfbeelqgbaofpvapwbm`fpqfbplm#elq`lmufmwjlmjwfnwzsf>!baplovwfozpvsslpfgozqfnbjmfg#bbwwqb`wjufwqbufoojmdpfsbqbwfozel`vpfp#lmfofnfmwbqzbssoj`baofelvmg#wkbwpwzofpkffwnbmvp`qjswpwbmgp#elq#ml.qfsfbw+plnfwjnfp@lnnfq`jbojm#Bnfqj`bvmgfqwbhfmrvbqwfq#lebm#f{bnsofsfqplmboozjmgf{-sks<?,avwwlm=\\tsfq`fmwbdfafpw.hmltm`qfbwjmd#b!#gjq>!owqOjfvwfmbmw\\t?gju#jg>!wkfz#tlvogbajojwz#lenbgf#vs#lemlwfg#wkbw`ofbq#wkbwbqdvf#wkbwwl#bmlwkfq`kjogqfm$psvqslpf#leelqnvobwfgabpfg#vslmwkf#qfdjlmpvaif`w#lesbppfmdfqpslppfppjlm-\\t\\tJm#wkf#Afelqf#wkfbewfqtbqgp`vqqfmwoz#b`qlpp#wkfp`jfmwjej``lnnvmjwz-`bsjwbojpnjm#Dfqnbmzqjdkw.tjmdwkf#pzpwfnPl`jfwz#leslojwj`jbmgjqf`wjlm9tfmw#lm#wlqfnlubo#le#Mft#Zlqh#bsbqwnfmwpjmgj`bwjlmgvqjmd#wkfvmofpp#wkfkjpwlqj`bokbg#affm#bgfejmjwjufjmdqfgjfmwbwwfmgbm`f@fmwfq#elqsqlnjmfm`fqfbgzPwbwfpwqbwfdjfpavw#jm#wkfbp#sbqw#le`lmpwjwvwf`objn#wkbwobalqbwlqz`lnsbwjaofebjovqf#le/#pv`k#bp#afdbm#tjwkvpjmd#wkf#wl#sqlujgfefbwvqf#leeqln#tkj`k,!#`obpp>!dfloldj`bopfufqbo#legfojafqbwfjnslqwbmw#klogp#wkbwjmd%rvlw8#ubojdm>wlswkf#Dfqnbmlvwpjgf#lemfdlwjbwfgkjp#`bqffqpfsbqbwjlmjg>!pfbq`ktbp#`boofgwkf#elvqwkqf`qfbwjlmlwkfq#wkbmsqfufmwjlmtkjof#wkf#fgv`bwjlm/`lmmf`wjmdb``vqbwfoztfqf#avjowtbp#hjoofgbdqffnfmwpnv`k#nlqf#Gvf#wl#wkftjgwk9#233plnf#lwkfqHjmdgln#lewkf#fmwjqfebnlvp#elqwl#`lmmf`wlaif`wjufpwkf#Eqfm`ksflsof#bmgefbwvqfg!=jp#pbjg#wlpwqv`wvqboqfefqfmgvnnlpw#lewfmb#pfsbqbwf.=\\t?gju#jg#Leej`jbo#tlqogtjgf-bqjb.obafowkf#sobmfwbmg#jw#tbpg!#ubovf>!ollhjmd#bwafmfej`jbobqf#jm#wkfnlmjwlqjmdqfslqwfgozwkf#nlgfqmtlqhjmd#lmbooltfg#wltkfqf#wkf#jmmlubwjuf?,b=?,gju=plvmgwqb`hpfbq`kElqnwfmg#wl#afjmsvw#jg>!lsfmjmd#leqfpwqj`wfgbglswfg#azbggqfppjmdwkfloldjbmnfwklgp#leubqjbmw#le@kqjpwjbm#ufqz#obqdfbvwlnlwjufaz#ebq#wkfqbmdf#eqlnsvqpvjw#leeloolt#wkfaqlvdkw#wljm#Fmdobmgbdqff#wkbwb``vpfg#le`lnfp#eqlnsqfufmwjmdgju#pwzof>kjp#lq#kfqwqfnfmglvpeqffgln#le`lm`fqmjmd3#2fn#2fn8Abphfwaboo,pwzof-`ppbm#fbqojfqfufm#bewfq,!#wjwof>!-`ln,jmgf{wbhjmd#wkfsjwwpavqdk`lmwfmw!=\\x0E?p`qjsw=+ewvqmfg#lvwkbujmd#wkf?,psbm=\\x0E\\t#l``bpjlmboaf`bvpf#jwpwbqwfg#wlskzpj`booz=?,gju=\\t##`qfbwfg#az@vqqfmwoz/#ad`lolq>!wbajmgf{>!gjpbpwqlvpBmbozwj`p#bopl#kbp#b=?gju#jg>!?,pwzof=\\t?`boofg#elqpjmdfq#bmg-pq`#>#!,,ujlobwjlmpwkjp#sljmw`lmpwbmwozjp#ol`bwfgqf`lqgjmdpg#eqln#wkfmfgfqobmgpslqwvdv/Fp;N;};D;u;F5m4K4]4_7`gfpbqqlool`lnfmwbqjlfgv`b`j/_mpfswjfnaqfqfdjpwqbglgjqf``j/_mvaj`b`j/_msvaoj`jgbgqfpsvfpwbpqfpvowbglpjnslqwbmwfqfpfqubglpbqw/A`volpgjefqfmwfppjdvjfmwfpqfs/Vaoj`bpjwvb`j/_mnjmjpwfqjlsqjub`jgbggjqf`wlqjlelqnb`j/_mslaob`j/_msqfpjgfmwf`lmw',\n      'fmjglpb``fplqjlpwf`kmlqbwjsfqplmbofp`bwfdlq/Abfpsf`jbofpgjpslmjaofb`wvbojgbgqfefqfm`jbuboobglojgajaojlwf`bqfob`jlmfp`bofmgbqjlslo/Awj`bpbmwfqjlqfpgl`vnfmwlpmbwvqbofybnbwfqjbofpgjefqfm`jbf`lm/_nj`bwqbmpslqwfqlgq/Advfysbqwj`jsbqfm`vfmwqbmgjp`vpj/_mfpwqv`wvqbevmgb`j/_meqf`vfmwfpsfqnbmfmwfwlwbonfmwf<P<R<Z<Q<R<]=o<X<Y=n<P<R<Z<Y=n<^=l<Y<P=c=n<\\\\<V<Z<Y=k=n<R<]=g<]<R<W<Y<Y<R=k<Y<Q=`=a=n<R<_<R<V<R<_<X<\\\\<S<R=m<W<Y<^=m<Y<_<R=m<\\\\<U=n<Y=k<Y=l<Y<[<P<R<_=o=n=m<\\\\<U=n<\\\\<Z<T<[<Q<T<P<Y<Z<X=o<]=o<X=o=n<s<R<T=m<V<[<X<Y=m=`<^<T<X<Y<R=m<^=c<[<T<Q=o<Z<Q<R=m<^<R<Y<U<W=b<X<Y<U<S<R=l<Q<R<P<Q<R<_<R<X<Y=n<Y<U=m<^<R<T=i<S=l<\\\\<^<\\\\=n<\\\\<V<R<U<P<Y=m=n<R<T<P<Y<Y=n<Z<T<[<Q=`<R<X<Q<R<U<W=o=k=d<Y<S<Y=l<Y<X=k<\\\\=m=n<T=k<\\\\=m=n=`=l<\\\\<]<R=n<Q<R<^=g=i<S=l<\\\\<^<R=m<R<]<R<U<S<R=n<R<P<P<Y<Q<Y<Y=k<T=m<W<Y<Q<R<^=g<Y=o=m<W=o<_<R<V<R<W<R<Q<\\\\<[<\\\\<X=n<\\\\<V<R<Y=n<R<_<X<\\\\<S<R=k=n<T<s<R=m<W<Y=n<\\\\<V<T<Y<Q<R<^=g<U=m=n<R<T=n=n<\\\\<V<T=i=m=l<\\\\<[=o<M<\\\\<Q<V=n=h<R=l=o<P<v<R<_<X<\\\\<V<Q<T<_<T=m<W<R<^<\\\\<Q<\\\\=d<Y<U<Q<\\\\<U=n<T=m<^<R<T<P=m<^=c<[=`<W=b<]<R<U=k<\\\\=m=n<R=m=l<Y<X<T<v=l<R<P<Y<H<R=l=o<P=l=g<Q<V<Y=m=n<\\\\<W<T<S<R<T=m<V=n=g=m=c=k<P<Y=m=c=j=j<Y<Q=n=l=n=l=o<X<\\\\=m<\\\\<P=g=i=l=g<Q<V<\\\\<q<R<^=g<U=k<\\\\=m<R<^<P<Y=m=n<\\\\=h<T<W=`<P<P<\\\\=l=n<\\\\=m=n=l<\\\\<Q<P<Y=m=n<Y=n<Y<V=m=n<Q<\\\\=d<T=i<P<T<Q=o=n<T<P<Y<Q<T<T<P<Y=b=n<Q<R<P<Y=l<_<R=l<R<X=m<\\\\<P<R<P=a=n<R<P=o<V<R<Q=j<Y=m<^<R<Y<P<V<\\\\<V<R<U<|=l=i<T<^5i5j4F4C5e4I4]4_4K5h4]4_4K5h4E4K5h4U4K5i5o4F4D5k4K4D4]4K5i4@4K5h5f5d5i4K5h4Y5d4]4@4C5f4C4E4K5h4U4Z5d4I4Z4K5m4E4K5h5n4_5i4K5h4U4K4D4F4A5i5f5h5i5h5m4K4F5i5h4F5n5e4F4U4C5f5h4K5h4X4U4]4O4B4D4K4]4F4[5d5f4]4U5h5f5o5i4I4]5m4K5n4[5h4D4K4F4K5h5h4V4E4F4]4F5f4D4K5h5j4K4_4K5h4X5f4B5i5j4F4C5f4K5h4U4]4D4K5h5n4Y4Y4K5m5h4K5i4U5h5f5k4K4F4A4C5f4G4K5h5h5k5i4K5h4U5i5h5i5o4F4D4E5f5i5o5j5o4K5h4[5m5h5m5f4C5f5d4I4C4K4]4E4F4K4]5f4B4K5h4Y4A4E4F4_4@5f5h4K5h5d5n4F4U5j4C5i4K5i4C5f5j4E4F4Y5i5f5i4O4]4X5f5m4K5h4\\\\5f5j4U4]4D5f4E4D5d4K4D4E4O5h4U4K4D4K5h4_5m4]5i4X4K5o5h4F4U4K5h5e4K5h4O5d5h4K5h4_5j4E4@4K5i4U4E4K5h4Y4A5m4K5h4C5f5j5o5h5i4K4F4K5h4B4K4Y4K5h5i5h5m4O4U4Z4K4M5o4F4K4D4E4K5h4B5f4]4]4_4K4J5h4K5h5n5h4D4K5h4O4C4D5i5n4K4[4U5i4]4K4_5h5i5j4[5n4E4K5h5o4F4D4K5h4]4@5h4K4X4F4]5o4K5h5n4C5i5f4U4[5f5opAzWbdMbnf+-isd!#bow>!2s{#plojg# -dje!#bow>!wqbmpsbqfmwjmelqnbwjlmbssoj`bwjlm!#lm`oj`h>!fpwbaojpkfgbgufqwjpjmd-smd!#bow>!fmujqlmnfmwsfqelqnbm`fbssqlsqjbwf%bns8ngbpk8jnnfgjbwfoz?,pwqlmd=?,qbwkfq#wkbmwfnsfqbwvqfgfufolsnfmw`lnsfwjwjlmsob`fklogfqujpjajojwz9`lszqjdkw!=3!#kfjdkw>!fufm#wklvdkqfsob`fnfmwgfpwjmbwjlm@lqslqbwjlm?vo#`obpp>!Bppl`jbwjlmjmgjujgvbopsfqpsf`wjufpfwWjnflvw+vqo+kwws9,,nbwkfnbwj`pnbqdjm.wls9fufmwvbooz#gfp`qjswjlm*#ml.qfsfbw`loof`wjlmp-ISD\\x7Fwkvna\\x7Fsbqwj`jsbwf,kfbg=?algzeolbw9ofew8?oj#`obpp>!kvmgqfgp#le\\t\\tKltfufq/#`lnslpjwjlm`ofbq9alwk8`llsfqbwjlmtjwkjm#wkf#obafo#elq>!alqgfq.wls9Mft#Yfbobmgqf`lnnfmgfgsklwldqbskzjmwfqfpwjmd%ow8pvs%dw8`lmwqlufqpzMfwkfqobmgpbowfqmbwjufnb{ofmdwk>!ptjwyfqobmgGfufolsnfmwfppfmwjbooz\\t\\tBowklvdk#?,wf{wbqfb=wkvmgfqajqgqfsqfpfmwfg%bns8mgbpk8psf`vobwjlm`lnnvmjwjfpofdjpobwjlmfof`wqlmj`p\\t\\n?gju#jg>!joovpwqbwfgfmdjmffqjmdwfqqjwlqjfpbvwklqjwjfpgjpwqjavwfg5!#kfjdkw>!pbmp.pfqje8`bsbaof#le#gjpbssfbqfgjmwfqb`wjufollhjmd#elqjw#tlvog#afBedkbmjpwbmtbp#`qfbwfgNbwk-eollq+pvqqlvmgjmd`bm#bopl#aflapfqubwjlmnbjmwfmbm`ffm`lvmwfqfg?k1#`obpp>!nlqf#qf`fmwjw#kbp#affmjmubpjlm#le*-dfwWjnf+*evmgbnfmwboGfpsjwf#wkf!=?gju#jg>!jmpsjqbwjlmf{bnjmbwjlmsqfsbqbwjlmf{sobmbwjlm?jmsvw#jg>!?,b=?,psbm=ufqpjlmp#lejmpwqvnfmwpafelqf#wkf##>#$kwws9,,Gfp`qjswjlmqfobwjufoz#-pvapwqjmd+fb`k#le#wkff{sfqjnfmwpjmeovfmwjbojmwfdqbwjlmnbmz#sflsofgvf#wl#wkf#`lnajmbwjlmgl#mlw#kbufNjggof#Fbpw?mlp`qjsw=?`lszqjdkw!#sfqkbsp#wkfjmpwjwvwjlmjm#Gf`fnafqbqqbmdfnfmwnlpw#ebnlvpsfqplmbojwz`qfbwjlm#leojnjwbwjlmpf{`ovpjufozplufqfjdmwz.`lmwfmw!=\\t?wg#`obpp>!vmgfqdqlvmgsbqboofo#wlgl`wqjmf#lel``vsjfg#azwfqnjmloldzQfmbjppbm`fb#mvnafq#lepvsslqw#elqf{solqbwjlmqf`ldmjwjlmsqfgf`fpplq?jnd#pq`>!,?k2#`obpp>!svaoj`bwjlmnbz#bopl#afpsf`jbojyfg?,ejfogpfw=sqldqfppjufnjoojlmp#lepwbwfp#wkbwfmelq`fnfmwbqlvmg#wkf#lmf#bmlwkfq-sbqfmwMlgfbdqj`vowvqfBowfqmbwjufqfpfbq`kfqpwltbqgp#wkfNlpw#le#wkfnbmz#lwkfq#+fpsf`jbooz?wg#tjgwk>!8tjgwk9233&jmgfsfmgfmw?k0#`obpp>!#lm`kbmdf>!*-bgg@obpp+jmwfqb`wjlmLmf#le#wkf#gbvdkwfq#leb``fpplqjfpaqbm`kfp#le\\x0E\\t?gju#jg>!wkf#obqdfpwgf`obqbwjlmqfdvobwjlmpJmelqnbwjlmwqbmpobwjlmgl`vnfmwbqzjm#lqgfq#wl!=\\t?kfbg=\\t?!#kfjdkw>!2b`qlpp#wkf#lqjfmwbwjlm*8?,p`qjsw=jnsofnfmwfg`bm#af#pffmwkfqf#tbp#bgfnlmpwqbwf`lmwbjmfq!=`lmmf`wjlmpwkf#Aqjwjpktbp#tqjwwfm\"jnslqwbmw8s{8#nbqdjm.elooltfg#azbajojwz#wl#`lnsoj`bwfggvqjmd#wkf#jnnjdqbwjlmbopl#`boofg?k7#`obpp>!gjpwjm`wjlmqfsob`fg#azdlufqmnfmwpol`bwjlm#lejm#Mlufnafqtkfwkfq#wkf?,s=\\t?,gju=b`rvjpjwjlm`boofg#wkf#sfqpf`vwjlmgfpjdmbwjlmxelmw.pjyf9bssfbqfg#jmjmufpwjdbwff{sfqjfm`fgnlpw#ojhfoztjgfoz#vpfggjp`vppjlmpsqfpfm`f#le#+gl`vnfmw-f{wfmpjufozJw#kbp#affmjw#glfp#mlw`lmwqbqz#wljmkbajwbmwpjnsqlufnfmwp`klobqpkjs`lmpvnswjlmjmpwqv`wjlmelq#f{bnsoflmf#lq#nlqfs{8#sbggjmdwkf#`vqqfmwb#pfqjfp#lebqf#vpvboozqlof#jm#wkfsqfujlvpoz#gfqjubwjufpfujgfm`f#lef{sfqjfm`fp`lolqp`kfnfpwbwfg#wkbw`fqwjej`bwf?,b=?,gju=\\t#pfof`wfg>!kjdk#p`klloqfpslmpf#wl`lnelqwbaofbglswjlm#lewkqff#zfbqpwkf#`lvmwqzjm#Efaqvbqzpl#wkbw#wkfsflsof#tkl#sqlujgfg#az?sbqbn#mbnfbeef`wfg#azjm#wfqnp#lebssljmwnfmwJPL.;;6:.2!tbp#alqm#jmkjpwlqj`bo#qfdbqgfg#bpnfbpvqfnfmwjp#abpfg#lm#bmg#lwkfq#9#evm`wjlm+pjdmjej`bmw`fofaqbwjlmwqbmpnjwwfg,ip,irvfqz-jp#hmltm#bpwkflqfwj`bo#wbajmgf{>!jw#`lvog#af?mlp`qjsw=\\tkbujmd#affm\\x0E\\t?kfbg=\\x0E\\t?#%rvlw8Wkf#`lnsjobwjlmkf#kbg#affmsqlgv`fg#azskjolplskfq`lmpwqv`wfgjmwfmgfg#wlbnlmd#lwkfq`lnsbqfg#wlwl#pbz#wkbwFmdjmffqjmdb#gjeefqfmwqfefqqfg#wlgjeefqfm`fpafojfe#wkbwsklwldqbskpjgfmwjezjmdKjpwlqz#le#Qfsvaoj`#lemf`fppbqjozsqlabajojwzwf`kmj`boozofbujmd#wkfpsf`wb`vobqeqb`wjlm#lefof`wqj`jwzkfbg#le#wkfqfpwbvqbmwpsbqwmfqpkjsfnskbpjp#lmnlpw#qf`fmwpkbqf#tjwk#pbzjmd#wkbwejoofg#tjwkgfpjdmfg#wljw#jp#lewfm!=?,jeqbnf=bp#elooltp9nfqdfg#tjwkwkqlvdk#wkf`lnnfq`jbo#sljmwfg#lvwlsslqwvmjwzujft#le#wkfqfrvjqfnfmwgjujpjlm#lesqldqbnnjmdkf#qf`fjufgpfwJmwfqubo!=?,psbm=?,jm#Mft#Zlqhbggjwjlmbo#`lnsqfppjlm\\t\\t?gju#jg>!jm`lqslqbwf8?,p`qjsw=?bwwb`kFufmwaf`bnf#wkf#!#wbqdfw>!\\\\`bqqjfg#lvwPlnf#le#wkfp`jfm`f#bmgwkf#wjnf#le@lmwbjmfq!=nbjmwbjmjmd@kqjpwlskfqNv`k#le#wkftqjwjmdp#le!#kfjdkw>!1pjyf#le#wkfufqpjlm#le#nj{wvqf#le#afwtffm#wkfF{bnsofp#lefgv`bwjlmbo`lnsfwjwjuf#lmpvanjw>!gjqf`wlq#legjpwjm`wjuf,GWG#[KWNO#qfobwjmd#wlwfmgfm`z#wlsqlujm`f#letkj`k#tlvoggfpsjwf#wkfp`jfmwjej`#ofdjpobwvqf-jmmfqKWNO#boofdbwjlmpBdqj`vowvqftbp#vpfg#jmbssqlb`k#wljmwfoojdfmwzfbqp#obwfq/pbmp.pfqjegfwfqnjmjmdSfqelqnbm`fbssfbqbm`fp/#tkj`k#jp#elvmgbwjlmpbaaqfujbwfgkjdkfq#wkbmp#eqln#wkf#jmgjujgvbo#`lnslpfg#lepvsslpfg#wl`objnp#wkbwbwwqjavwjlmelmw.pjyf92fofnfmwp#leKjpwlqj`bo#kjp#aqlwkfqbw#wkf#wjnfbmmjufqpbqzdlufqmfg#azqfobwfg#wl#vowjnbwfoz#jmmlubwjlmpjw#jp#pwjoo`bm#lmoz#afgfejmjwjlmpwlDNWPwqjmdB#mvnafq#lejnd#`obpp>!Fufmwvbooz/tbp#`kbmdfgl``vqqfg#jmmfjdkalqjmdgjpwjmdvjpktkfm#kf#tbpjmwqlgv`jmdwfqqfpwqjboNbmz#le#wkfbqdvfp#wkbwbm#Bnfqj`bm`lmrvfpw#letjgfpsqfbg#tfqf#hjoofgp`qffm#bmg#Jm#lqgfq#wlf{sf`wfg#wlgfp`fmgbmwpbqf#ol`bwfgofdjpobwjufdfmfqbwjlmp#ab`hdqlvmgnlpw#sflsofzfbqp#bewfqwkfqf#jp#mlwkf#kjdkfpweqfrvfmwoz#wkfz#gl#mlwbqdvfg#wkbwpkltfg#wkbwsqfglnjmbmwwkfloldj`boaz#wkf#wjnf`lmpjgfqjmdpklqw.ojufg?,psbm=?,b=`bm#af#vpfgufqz#ojwwoflmf#le#wkf#kbg#boqfbgzjmwfqsqfwfg`lnnvmj`bwfefbwvqfp#ledlufqmnfmw/?,mlp`qjsw=fmwfqfg#wkf!#kfjdkw>!0Jmgfsfmgfmwslsvobwjlmpobqdf.p`bof-#Bowklvdk#vpfg#jm#wkfgfpwqv`wjlmslppjajojwzpwbqwjmd#jmwtl#lq#nlqff{sqfppjlmppvalqgjmbwfobqdfq#wkbmkjpwlqz#bmg?,lswjlm=\\x0E\\t@lmwjmfmwbofojnjmbwjmdtjoo#mlw#afsqb`wj`f#lejm#eqlmw#lepjwf#le#wkffmpvqf#wkbwwl#`qfbwf#bnjppjppjssjslwfmwjboozlvwpwbmgjmdafwwfq#wkbmtkbw#jp#mltpjwvbwfg#jmnfwb#mbnf>!WqbgjwjlmbopvddfpwjlmpWqbmpobwjlmwkf#elqn#lebwnlpskfqj`jgfloldj`bofmwfqsqjpfp`bo`vobwjmdfbpw#le#wkfqfnmbmwp#lesovdjmpsbdf,jmgf{-sks<qfnbjmfg#jmwqbmpelqnfgKf#tbp#bopltbp#boqfbgzpwbwjpwj`bojm#ebulq#leNjmjpwqz#lenlufnfmw#leelqnvobwjlmjp#qfrvjqfg?ojmh#qfo>!Wkjp#jp#wkf#?b#kqfe>!,slsvobqjyfgjmuloufg#jmbqf#vpfg#wlbmg#pfufqbonbgf#az#wkfpffnp#wl#afojhfoz#wkbwSbofpwjmjbmmbnfg#bewfqjw#kbg#affmnlpw#`lnnlmwl#qfefq#wlavw#wkjp#jp`lmpf`vwjufwfnslqbqjozJm#dfmfqbo/`lmufmwjlmpwbhfp#sob`fpvagjujpjlmwfqqjwlqjbolsfqbwjlmbosfqnbmfmwoztbp#obqdfozlvwaqfbh#lejm#wkf#sbpwelooltjmd#b#{nomp9ld>!=?b#`obpp>!`obpp>!wf{w@lmufqpjlm#nbz#af#vpfgnbmveb`wvqfbewfq#afjmd`ofbqej{!=\\trvfpwjlm#letbp#fof`wfgwl#af`lnf#baf`bvpf#le#plnf#sflsofjmpsjqfg#azpv``fppevo#b#wjnf#tkfmnlqf#`lnnlmbnlmdpw#wkfbm#leej`jbotjgwk9233&8wf`kmloldz/tbp#bglswfgwl#hffs#wkfpfwwofnfmwpojuf#ajqwkpjmgf{-kwno!@lmmf`wj`vwbppjdmfg#wl%bns8wjnfp8b``lvmw#elqbojdm>qjdkwwkf#`lnsbmzbotbzp#affmqfwvqmfg#wljmuloufnfmwAf`bvpf#wkfwkjp#sfqjlg!#mbnf>!r!#`lmejmfg#wlb#qfpvow#leubovf>!!#,=jp#b`wvboozFmujqlmnfmw\\x0E\\t?,kfbg=\\x0E\\t@lmufqpfoz/=\\t?gju#jg>!3!#tjgwk>!2jp#sqlabaozkbuf#af`lnf`lmwqloojmdwkf#sqlaofn`jwjyfmp#leslojwj`jbmpqfb`kfg#wkfbp#fbqoz#bp9mlmf8#lufq?wbaof#`fooubojgjwz#legjqf`woz#wllmnlvpfgltmtkfqf#jw#jptkfm#jw#tbpnfnafqp#le#qfobwjlm#wlb``lnnlgbwfbolmd#tjwk#Jm#wkf#obwfwkf#Fmdojpkgfoj`jlvp!=wkjp#jp#mlwwkf#sqfpfmwje#wkfz#bqfbmg#ejmboozb#nbwwfq#le\\x0E\\t\\n?,gju=\\x0E\\t\\x0E\\t?,p`qjsw=ebpwfq#wkbmnbilqjwz#lebewfq#tkj`k`lnsbqbwjufwl#nbjmwbjmjnsqluf#wkfbtbqgfg#wkffq!#`obpp>!eqbnfalqgfqqfpwlqbwjlmjm#wkf#pbnfbmbozpjp#lewkfjq#ejqpwGvqjmd#wkf#`lmwjmfmwbopfrvfm`f#leevm`wjlm+*xelmw.pjyf9#tlqh#lm#wkf?,p`qjsw=\\t?afdjmp#tjwkibubp`qjsw9`lmpwjwvfmwtbp#elvmgfgfrvjojaqjvnbppvnf#wkbwjp#djufm#azmffgp#wl#af`llqgjmbwfpwkf#ubqjlvpbqf#sbqw#lelmoz#jm#wkfpf`wjlmp#lejp#b#`lnnlmwkflqjfp#legjp`lufqjfpbppl`jbwjlmfgdf#le#wkfpwqfmdwk#leslpjwjlm#jmsqfpfmw.gbzvmjufqpboozwl#elqn#wkfavw#jmpwfbg`lqslqbwjlmbwwb`kfg#wljp#`lnnlmozqfbplmp#elq#%rvlw8wkf#`bm#af#nbgftbp#baof#wltkj`k#nfbmpavw#gjg#mlwlmNlvpfLufqbp#slppjaoflsfqbwfg#az`lnjmd#eqlnwkf#sqjnbqzbggjwjlm#leelq#pfufqbowqbmpefqqfgb#sfqjlg#lebqf#baof#wlkltfufq/#jwpklvog#kbufnv`k#obqdfq\\t\\n?,p`qjsw=bglswfg#wkfsqlsfqwz#legjqf`wfg#azfeef`wjufoztbp#aqlvdkw`kjogqfm#leSqldqbnnjmdolmdfq#wkbmnbmvp`qjswptbq#bdbjmpwaz#nfbmp#lebmg#nlpw#lepjnjobq#wl#sqlsqjfwbqzlqjdjmbwjmdsqfpwjdjlvpdqbnnbwj`bof{sfqjfm`f-wl#nbhf#wkfJw#tbp#bopljp#elvmg#jm`lnsfwjwlqpjm#wkf#V-P-qfsob`f#wkfaqlvdkw#wkf`bo`vobwjlmeboo#le#wkfwkf#dfmfqbosqb`wj`boozjm#klmlq#leqfofbpfg#jmqfpjgfmwjbobmg#plnf#lehjmd#le#wkfqfb`wjlm#wl2pw#Fbqo#le`vowvqf#bmgsqjm`jsbooz?,wjwof=\\t##wkfz#`bm#afab`h#wl#wkfplnf#le#kjpf{slpvqf#wlbqf#pjnjobqelqn#le#wkfbggEbulqjwf`jwjyfmpkjssbqw#jm#wkfsflsof#tjwkjm#sqb`wj`fwl#`lmwjmvf%bns8njmvp8bssqlufg#az#wkf#ejqpw#booltfg#wkfbmg#elq#wkfevm`wjlmjmdsobzjmd#wkfplovwjlm#wlkfjdkw>!3!#jm#kjp#allhnlqf#wkbm#belooltp#wkf`qfbwfg#wkfsqfpfm`f#jm%maps8?,wg=mbwjlmbojpwwkf#jgfb#leb#`kbqb`wfqtfqf#elq`fg#`obpp>!awmgbzp#le#wkfefbwvqfg#jmpkltjmd#wkfjmwfqfpw#jmjm#sob`f#lewvqm#le#wkfwkf#kfbg#leOlqg#le#wkfslojwj`boozkbp#jwp#ltmFgv`bwjlmbobssqlubo#leplnf#le#wkffb`k#lwkfq/afkbujlq#lebmg#af`bvpfbmg#bmlwkfqbssfbqfg#lmqf`lqgfg#jmaob`h%rvlw8nbz#jm`ovgfwkf#tlqog$p`bm#ofbg#wlqfefqp#wl#balqgfq>!3!#dlufqmnfmw#tjmmjmd#wkfqfpvowfg#jm#tkjof#wkf#Tbpkjmdwlm/wkf#pvaif`w`jwz#jm#wkf=?,gju=\\x0E\\t\\n\\nqfeof`w#wkfwl#`lnsofwfaf`bnf#nlqfqbgjlb`wjufqfif`wfg#aztjwklvw#bmzkjp#ebwkfq/tkj`k#`lvog`lsz#le#wkfwl#jmgj`bwfb#slojwj`bob``lvmwp#le`lmpwjwvwfptlqhfg#tjwkfq?,b=?,oj=le#kjp#ojefb``lnsbmjfg`ojfmwTjgwksqfufmw#wkfOfdjpobwjufgjeefqfmwozwldfwkfq#jmkbp#pfufqboelq#bmlwkfqwf{w#le#wkfelvmgfg#wkff#tjwk#wkf#jp#vpfg#elq`kbmdfg#wkfvpvbooz#wkfsob`f#tkfqftkfqfbp#wkf=#?b#kqfe>!!=?b#kqfe>!wkfnpfoufp/bowklvdk#kfwkbw#`bm#afwqbgjwjlmboqlof#le#wkfbp#b#qfpvowqfnluf@kjoggfpjdmfg#aztfpw#le#wkfPlnf#sflsofsqlgv`wjlm/pjgf#le#wkfmftpofwwfqpvpfg#az#wkfgltm#wl#wkfb``fswfg#azojuf#jm#wkfbwwfnswp#wllvwpjgf#wkfeqfrvfm`jfpKltfufq/#jmsqldqbnnfqpbw#ofbpw#jmbssql{jnbwfbowklvdk#jwtbp#sbqw#lebmg#ubqjlvpDlufqmlq#lewkf#bqwj`ofwvqmfg#jmwl=?b#kqfe>!,wkf#f`lmlnzjp#wkf#nlpwnlpw#tjgfoztlvog#obwfqbmg#sfqkbspqjpf#wl#wkfl``vqp#tkfmvmgfq#tkj`k`lmgjwjlmp-wkf#tfpwfqmwkflqz#wkbwjp#sqlgv`fgwkf#`jwz#lejm#tkj`k#kfpffm#jm#wkfwkf#`fmwqboavjogjmd#lenbmz#le#kjpbqfb#le#wkfjp#wkf#lmoznlpw#le#wkfnbmz#le#wkfwkf#TfpwfqmWkfqf#jp#mlf{wfmgfg#wlPwbwjpwj`bo`lopsbm>1#\\x7Fpklqw#pwlqzslppjaof#wlwlsloldj`bo`qjwj`bo#leqfslqwfg#wlb#@kqjpwjbmgf`jpjlm#wljp#frvbo#wlsqlaofnp#leWkjp#`bm#afnfq`kbmgjpfelq#nlpw#leml#fujgfm`ffgjwjlmp#lefofnfmwp#jm%rvlw8-#Wkf`ln,jnbdfp,tkj`k#nbhfpwkf#sql`fppqfnbjmp#wkfojwfqbwvqf/jp#b#nfnafqwkf#slsvobqwkf#bm`jfmwsqlaofnp#jmwjnf#le#wkfgfefbwfg#azalgz#le#wkfb#eft#zfbqpnv`k#le#wkfwkf#tlqh#le@bojelqmjb/pfqufg#bp#bdlufqmnfmw-`lm`fswp#lenlufnfmw#jm\\n\\n?gju#jg>!jw!#ubovf>!obmdvbdf#lebp#wkfz#bqfsqlgv`fg#jmjp#wkbw#wkff{sobjm#wkfgju=?,gju=\\tKltfufq#wkfofbg#wl#wkf\\n?b#kqfe>!,tbp#dqbmwfgsflsof#kbuf`lmwjmvbooztbp#pffm#bpbmg#qfobwfgwkf#qlof#lesqlslpfg#azle#wkf#afpwfb`k#lwkfq-@lmpwbmwjmfsflsof#eqlngjbof`wp#lewl#qfujpjlmtbp#qfmbnfgb#plvq`f#lewkf#jmjwjboobvm`kfg#jmsqlujgf#wkfwl#wkf#tfpwtkfqf#wkfqfbmg#pjnjobqafwtffm#wtljp#bopl#wkfFmdojpk#bmg`lmgjwjlmp/wkbw#jw#tbpfmwjwofg#wlwkfnpfoufp-rvbmwjwz#leqbmpsbqfm`zwkf#pbnf#bpwl#iljm#wkf`lvmwqz#bmgwkjp#jp#wkfWkjp#ofg#wlb#pwbwfnfmw`lmwqbpw#wlobpwJmgf{Lewkqlvdk#kjpjp#gfpjdmfgwkf#wfqn#jpjp#sqlujgfgsqlwf`w#wkfmd?,b=?,oj=Wkf#`vqqfmwwkf#pjwf#lepvapwbmwjbof{sfqjfm`f/jm#wkf#Tfpwwkfz#pklvogpolufm(ajmb`lnfmwbqjlpvmjufqpjgbg`lmgj`jlmfpb`wjujgbgfpf{sfqjfm`jbwf`mlold/Absqlgv``j/_msvmwvb`j/_mbsoj`b`j/_m`lmwqbpf/]b`bwfdlq/Abpqfdjpwqbqpfsqlefpjlmbowqbwbnjfmwlqfd/Apwqbwfpf`qfwbq/Absqjm`jsbofpsqlwf``j/_mjnslqwbmwfpjnslqwbm`jbslpjajojgbgjmwfqfpbmwf`qf`jnjfmwlmf`fpjgbgfppvp`qjajqpfbpl`jb`j/_mgjpslmjaofpfubovb`j/_mfpwvgjbmwfpqfpslmpbaofqfplov`j/_mdvbgbobibqbqfdjpwqbglplslqwvmjgbg`lnfq`jbofpelwldqbe/Abbvwlqjgbgfpjmdfmjfq/Abwfofujpj/_m`lnsfwfm`jblsfqb`jlmfpfpwbaof`jglpjnsofnfmwfb`wvbonfmwfmbufdb`j/_m`lmelqnjgbgojmf.kfjdkw9elmw.ebnjoz9!#9#!kwws9,,bssoj`bwjlmpojmh!#kqfe>!psf`jej`booz,,?\"X@GBWBX\\tLqdbmjybwjlmgjpwqjavwjlm3s{8#kfjdkw9qfobwjlmpkjsgfuj`f.tjgwk?gju#`obpp>!?obafo#elq>!qfdjpwqbwjlm?,mlp`qjsw=\\t,jmgf{-kwno!tjmglt-lsfm+#\"jnslqwbmw8bssoj`bwjlm,jmgfsfmgfm`f,,ttt-dlldoflqdbmjybwjlmbvwl`lnsofwfqfrvjqfnfmwp`lmpfqubwjuf?elqn#mbnf>!jmwfoof`wvbonbqdjm.ofew92;wk#`fmwvqzbm#jnslqwbmwjmpwjwvwjlmpbaaqfujbwjlm?jnd#`obpp>!lqdbmjpbwjlm`jujojybwjlm2:wk#`fmwvqzbq`kjwf`wvqfjm`lqslqbwfg13wk#`fmwvqz.`lmwbjmfq!=nlpw#mlwbaoz,=?,b=?,gju=mlwjej`bwjlm$vmgfejmfg$*Evqwkfqnlqf/afojfuf#wkbwjmmfqKWNO#>#sqjlq#wl#wkfgqbnbwj`boozqfefqqjmd#wlmfdlwjbwjlmpkfbgrvbqwfqpPlvwk#Beqj`bvmpv``fppevoSfmmpzoubmjbBp#b#qfpvow/?kwno#obmd>!%ow8,pvs%dw8gfbojmd#tjwkskjobgfoskjbkjpwlqj`booz*8?,p`qjsw=\\tsbggjmd.wls9f{sfqjnfmwbodfwBwwqjavwfjmpwqv`wjlmpwf`kmloldjfpsbqw#le#wkf#>evm`wjlm+*xpvap`qjswjlmo-gwg!=\\x0E\\t?kwdfldqbskj`bo@lmpwjwvwjlm$/#evm`wjlm+pvsslqwfg#azbdqj`vowvqbo`lmpwqv`wjlmsvaoj`bwjlmpelmw.pjyf9#2b#ubqjfwz#le?gju#pwzof>!Fm`z`olsfgjbjeqbnf#pq`>!gfnlmpwqbwfgb``lnsojpkfgvmjufqpjwjfpGfnldqbskj`p*8?,p`qjsw=?gfgj`bwfg#wlhmltofgdf#lepbwjpeb`wjlmsbqwj`vobqoz?,gju=?,gju=Fmdojpk#+VP*bssfmg@kjog+wqbmpnjppjlmp-#Kltfufq/#jmwfoojdfm`f!#wbajmgf{>!eolbw9qjdkw8@lnnlmtfbowkqbmdjmd#eqlnjm#tkj`k#wkfbw#ofbpw#lmfqfsqlgv`wjlmfm`z`olsfgjb8elmw.pjyf92ivqjpgj`wjlmbw#wkbw#wjnf!=?b#`obpp>!Jm#bggjwjlm/gfp`qjswjlm(`lmufqpbwjlm`lmwb`w#tjwkjp#dfmfqboozq!#`lmwfmw>!qfsqfpfmwjmd%ow8nbwk%dw8sqfpfmwbwjlml``bpjlmbooz?jnd#tjgwk>!mbujdbwjlm!=`lnsfmpbwjlm`kbnsjlmpkjsnfgjb>!boo!#ujlobwjlm#leqfefqfm`f#wlqfwvqm#wqvf8Pwqj`w,,FM!#wqbmpb`wjlmpjmwfqufmwjlmufqjej`bwjlmJmelqnbwjlm#gjeej`vowjfp@kbnsjlmpkjs`bsbajojwjfp?\"Xfmgje^..=~\\t?,p`qjsw=\\t@kqjpwjbmjwzelq#f{bnsof/Sqlefppjlmboqfpwqj`wjlmppvddfpw#wkbwtbp#qfofbpfg+pv`k#bp#wkfqfnluf@obpp+vmfnsolznfmwwkf#Bnfqj`bmpwqv`wvqf#le,jmgf{-kwno#svaojpkfg#jmpsbm#`obpp>!!=?b#kqfe>!,jmwqlgv`wjlmafolmdjmd#wl`objnfg#wkbw`lmpfrvfm`fp?nfwb#mbnf>!Dvjgf#wl#wkflufqtkfonjmdbdbjmpw#wkf#`lm`fmwqbwfg/\\t-mlmwlv`k#lapfqubwjlmp?,b=\\t?,gju=\\te#+gl`vnfmw-alqgfq9#2s{#xelmw.pjyf92wqfbwnfmw#le3!#kfjdkw>!2nlgjej`bwjlmJmgfsfmgfm`fgjujgfg#jmwldqfbwfq#wkbmb`kjfufnfmwpfpwbaojpkjmdIbubP`qjsw!#mfufqwkfofpppjdmjej`bm`fAqlbg`bpwjmd=%maps8?,wg=`lmwbjmfq!=\\tpv`k#bp#wkf#jmeovfm`f#leb#sbqwj`vobqpq`>$kwws9,,mbujdbwjlm!#kboe#le#wkf#pvapwbmwjbo#%maps8?,gju=bgubmwbdf#legjp`lufqz#leevmgbnfmwbo#nfwqlslojwbmwkf#lsslpjwf!#{no9obmd>!gfojafqbwfozbojdm>`fmwfqfulovwjlm#lesqfpfqubwjlmjnsqlufnfmwpafdjmmjmd#jmIfpvp#@kqjpwSvaoj`bwjlmpgjpbdqffnfmwwf{w.bojdm9q/#evm`wjlm+*pjnjobqjwjfpalgz=?,kwno=jp#`vqqfmwozboskbafwj`bojp#plnfwjnfpwzsf>!jnbdf,nbmz#le#wkf#eolt9kjggfm8bubjobaof#jmgfp`qjaf#wkff{jpwfm`f#leboo#lufq#wkfwkf#Jmwfqmfw\\n?vo#`obpp>!jmpwboobwjlmmfjdkalqkllgbqnfg#elq`fpqfgv`jmd#wkf`lmwjmvfp#wlMlmfwkfofpp/wfnsfqbwvqfp\\t\\n\\n?b#kqfe>!`olpf#wl#wkff{bnsofp#le#jp#balvw#wkf+pff#afolt*-!#jg>!pfbq`ksqlefppjlmbojp#bubjobaofwkf#leej`jbo\\n\\n?,p`qjsw=\\t\\t\\n\\n?gju#jg>!b``fofqbwjlmwkqlvdk#wkf#Kboo#le#Ebnfgfp`qjswjlmpwqbmpobwjlmpjmwfqefqfm`f#wzsf>$wf{w,qf`fmw#zfbqpjm#wkf#tlqogufqz#slsvobqxab`hdqlvmg9wqbgjwjlmbo#plnf#le#wkf#`lmmf`wfg#wlf{soljwbwjlmfnfqdfm`f#le`lmpwjwvwjlmB#Kjpwlqz#lepjdmjej`bmw#nbmveb`wvqfgf{sf`wbwjlmp=?mlp`qjsw=?`bm#af#elvmgaf`bvpf#wkf#kbp#mlw#affmmfjdkalvqjmdtjwklvw#wkf#bggfg#wl#wkf\\n?oj#`obpp>!jmpwqvnfmwboPlujfw#Vmjlmb`hmltofgdfgtkj`k#`bm#afmbnf#elq#wkfbwwfmwjlm#wlbwwfnswp#wl#gfufolsnfmwpJm#eb`w/#wkf?oj#`obpp>!bjnsoj`bwjlmppvjwbaof#elqnv`k#le#wkf#`lolmjybwjlmsqfpjgfmwjbo`bm`foAvaaof#Jmelqnbwjlmnlpw#le#wkf#jp#gfp`qjafgqfpw#le#wkf#nlqf#lq#ofppjm#PfswfnafqJmwfoojdfm`fpq`>!kwws9,,s{8#kfjdkw9#bubjobaof#wlnbmveb`wvqfqkvnbm#qjdkwpojmh#kqfe>!,bubjobajojwzsqlslqwjlmbolvwpjgf#wkf#bpwqlmlnj`bokvnbm#afjmdpmbnf#le#wkf#bqf#elvmg#jmbqf#abpfg#lmpnboofq#wkbmb#sfqplm#tklf{sbmpjlm#lebqdvjmd#wkbwmlt#hmltm#bpJm#wkf#fbqozjmwfqnfgjbwfgfqjufg#eqlnP`bmgjmbujbm?,b=?,gju=\\x0E\\t`lmpjgfq#wkfbm#fpwjnbwfgwkf#Mbwjlmbo?gju#jg>!sbdqfpvowjmd#jm`lnnjppjlmfgbmboldlvp#wlbqf#qfrvjqfg,vo=\\t?,gju=\\ttbp#abpfg#lmbmg#af`bnf#b%maps8%maps8w!#ubovf>!!#tbp#`bswvqfgml#nlqf#wkbmqfpsf`wjufoz`lmwjmvf#wl#=\\x0E\\t?kfbg=\\x0E\\t?tfqf#`qfbwfgnlqf#dfmfqbojmelqnbwjlm#vpfg#elq#wkfjmgfsfmgfmw#wkf#Jnsfqjbo`lnslmfmw#lewl#wkf#mlqwkjm`ovgf#wkf#@lmpwqv`wjlmpjgf#le#wkf#tlvog#mlw#afelq#jmpwbm`fjmufmwjlm#lenlqf#`lnsof{`loof`wjufozab`hdqlvmg9#wf{w.bojdm9#jwp#lqjdjmbojmwl#b``lvmwwkjp#sql`fppbm#f{wfmpjufkltfufq/#wkfwkfz#bqf#mlwqfif`wfg#wkf`qjwj`jpn#legvqjmd#tkj`ksqlabaoz#wkfwkjp#bqwj`of+evm`wjlm+*xJw#pklvog#afbm#bdqffnfmwb``jgfmwboozgjeefqp#eqlnBq`kjwf`wvqfafwwfq#hmltmbqqbmdfnfmwpjmeovfm`f#lmbwwfmgfg#wkfjgfmwj`bo#wlplvwk#le#wkfsbpp#wkqlvdk{no!#wjwof>!tfjdkw9alog8`qfbwjmd#wkfgjpsobz9mlmfqfsob`fg#wkf?jnd#pq`>!,jkwwsp9,,ttt-Tlqog#Tbq#JJwfpwjnlmjbopelvmg#jm#wkfqfrvjqfg#wl#bmg#wkbw#wkfafwtffm#wkf#tbp#gfpjdmfg`lmpjpwp#le#`lmpjgfqbaozsvaojpkfg#azwkf#obmdvbdf@lmpfqubwjlm`lmpjpwfg#leqfefq#wl#wkfab`h#wl#wkf#`pp!#nfgjb>!Sflsof#eqln#bubjobaof#lmsqlufg#wl#afpvddfpwjlmp!tbp#hmltm#bpubqjfwjfp#leojhfoz#wl#af`lnsqjpfg#lepvsslqw#wkf#kbmgp#le#wkf`lvsofg#tjwk`lmmf`w#bmg#alqgfq9mlmf8sfqelqnbm`fpafelqf#afjmdobwfq#af`bnf`bo`vobwjlmplewfm#`boofgqfpjgfmwp#lenfbmjmd#wkbw=?oj#`obpp>!fujgfm`f#elqf{sobmbwjlmpfmujqlmnfmwp!=?,b=?,gju=tkj`k#booltpJmwqlgv`wjlmgfufolsfg#azb#tjgf#qbmdflm#afkboe#leubojdm>!wls!sqjm`jsof#lebw#wkf#wjnf/?,mlp`qjsw=\\x0Epbjg#wl#kbufjm#wkf#ejqpwtkjof#lwkfqpkzslwkfwj`boskjolplskfqpsltfq#le#wkf`lmwbjmfg#jmsfqelqnfg#azjmbajojwz#wltfqf#tqjwwfmpsbm#pwzof>!jmsvw#mbnf>!wkf#rvfpwjlmjmwfmgfg#elqqfif`wjlm#lejnsojfp#wkbwjmufmwfg#wkfwkf#pwbmgbqgtbp#sqlabaozojmh#afwtffmsqlefpplq#lejmwfqb`wjlmp`kbmdjmd#wkfJmgjbm#L`fbm#`obpp>!obpwtlqhjmd#tjwk$kwws9,,ttt-zfbqp#afelqfWkjp#tbp#wkfqf`qfbwjlmbofmwfqjmd#wkfnfbpvqfnfmwpbm#f{wqfnfozubovf#le#wkfpwbqw#le#wkf\\t?,p`qjsw=\\t\\tbm#feelqw#wljm`qfbpf#wkfwl#wkf#plvwkpsb`jmd>!3!=pveej`jfmwozwkf#Fvqlsfbm`lmufqwfg#wl`ofbqWjnflvwgjg#mlw#kbuf`lmpfrvfmwozelq#wkf#mf{wf{wfmpjlm#lef`lmlnj`#bmgbowklvdk#wkfbqf#sqlgv`fgbmg#tjwk#wkfjmpveej`jfmwdjufm#az#wkfpwbwjmd#wkbwf{sfmgjwvqfp?,psbm=?,b=\\twklvdkw#wkbwlm#wkf#abpjp`foosbggjmd>jnbdf#le#wkfqfwvqmjmd#wljmelqnbwjlm/pfsbqbwfg#azbppbppjmbwfgp!#`lmwfmw>!bvwklqjwz#lemlqwktfpwfqm?,gju=\\t?gju#!=?,gju=\\x0E\\t##`lmpvowbwjlm`lnnvmjwz#lewkf#mbwjlmbojw#pklvog#afsbqwj`jsbmwp#bojdm>!ofewwkf#dqfbwfpwpfof`wjlm#lepvsfqmbwvqbogfsfmgfmw#lmjp#nfmwjlmfgbooltjmd#wkftbp#jmufmwfgb``lnsbmzjmdkjp#sfqplmbobubjobaof#bwpwvgz#le#wkflm#wkf#lwkfqf{f`vwjlm#leKvnbm#Qjdkwpwfqnp#le#wkfbppl`jbwjlmpqfpfbq`k#bmgpv``ffgfg#azgfefbwfg#wkfbmg#eqln#wkfavw#wkfz#bqf`lnnbmgfq#lepwbwf#le#wkfzfbqp#le#bdfwkf#pwvgz#le?vo#`obpp>!psob`f#jm#wkftkfqf#kf#tbp?oj#`obpp>!ewkfqf#bqf#mltkj`k#af`bnfkf#svaojpkfgf{sqfppfg#jmwl#tkj`k#wkf`lnnjppjlmfqelmw.tfjdkw9wfqqjwlqz#lef{wfmpjlmp!=Qlnbm#Fnsjqffrvbo#wl#wkfJm#`lmwqbpw/kltfufq/#bmgjp#wzsj`boozbmg#kjp#tjef+bopl#`boofg=?vo#`obpp>!feef`wjufoz#fuloufg#jmwlpffn#wl#kbuftkj`k#jp#wkfwkfqf#tbp#mlbm#f{`foofmwboo#le#wkfpfgfp`qjafg#azJm#sqb`wj`f/aqlbg`bpwjmd`kbqdfg#tjwkqfeof`wfg#jmpvaif`wfg#wlnjojwbqz#bmgwl#wkf#sljmwf`lmlnj`boozpfwWbqdfwjmdbqf#b`wvboozuj`wlqz#lufq+*8?,p`qjsw=`lmwjmvlvpozqfrvjqfg#elqfulovwjlmbqzbm#feef`wjufmlqwk#le#wkf/#tkj`k#tbp#eqlmw#le#wkflq#lwkfqtjpfplnf#elqn#lekbg#mlw#affmdfmfqbwfg#azjmelqnbwjlm-sfqnjwwfg#wljm`ovgfp#wkfgfufolsnfmw/fmwfqfg#jmwlwkf#sqfujlvp`lmpjpwfmwozbqf#hmltm#bpwkf#ejfog#lewkjp#wzsf#ledjufm#wl#wkfwkf#wjwof#le`lmwbjmp#wkfjmpwbm`fp#lejm#wkf#mlqwkgvf#wl#wkfjqbqf#gfpjdmfg`lqslqbwjlmptbp#wkbw#wkflmf#le#wkfpfnlqf#slsvobqpv``ffgfg#jmpvsslqw#eqlnjm#gjeefqfmwglnjmbwfg#azgfpjdmfg#elqltmfqpkjs#lebmg#slppjaozpwbmgbqgjyfgqfpslmpfWf{wtbp#jmwfmgfgqf`fjufg#wkfbppvnfg#wkbwbqfbp#le#wkfsqjnbqjoz#jmwkf#abpjp#lejm#wkf#pfmpfb``lvmwp#elqgfpwqlzfg#azbw#ofbpw#wtltbp#gf`obqfg`lvog#mlw#afPf`qfwbqz#lebssfbq#wl#afnbqdjm.wls92,]_p(\\x7F_p(\\',df*xwkqlt#f~8wkf#pwbqw#lewtl#pfsbqbwfobmdvbdf#bmgtkl#kbg#affmlsfqbwjlm#legfbwk#le#wkfqfbo#mvnafqp\\n?ojmh#qfo>!sqlujgfg#wkfwkf#pwlqz#le`lnsfwjwjlmpfmdojpk#+VH*fmdojpk#+VP*<p<R<Q<_<R<W<M=l<S=m<V<T=m=l<S=m<V<T=m=l<S=m<V<R5h4U4]4D5f4E\\nAO\\x05Gx\\bTA\\nzk\\x0BBl\\bQ\\x7F\\bTA\\nzk\\x0BUm\\bQ\\x7F\\bTA\\nzk\\npe\\x05u|\\ti@\\tcT\\bVV\\n\\\\}\\nxS\\tVp\\x05tS\\x05k`\\t[X\\t[X\\x0BHR\\bPv\\bTW\\bUe\\n\\x7Fa\\bQp\\x0B_W\\x0BWs\\nxS\\x0BAz\\n_y\\x04Khjmelqnb`j/_mkfqqbnjfmwbpfof`wq/_mj`lgfp`qjs`j/_m`obpjej`bglp`lml`jnjfmwlsvaoj`b`j/_mqfob`jlmbgbpjmelqn/Mwj`bqfob`jlmbglpgfsbqwbnfmwlwqbabibglqfpgjqf`wbnfmwfbzvmwbnjfmwlnfq`bglOjaqf`lmw/M`wfmlpkbajwb`jlmfp`vnsojnjfmwlqfpwbvqbmwfpgjpslpj`j/_m`lmpf`vfm`jbfof`wq/_mj`bbsoj`b`jlmfpgfp`lmf`wbgljmpwbob`j/_mqfbojyb`j/_mvwjojyb`j/_mfm`j`olsfgjbfmefqnfgbgfpjmpwqvnfmwlpf{sfqjfm`jbpjmpwjwv`j/_msbqwj`vobqfppva`bwfdlqjb=n<R<W=`<V<R<L<R=m=m<T<T=l<\\\\<]<R=n=g<]<R<W=`=d<Y<S=l<R=m=n<R<P<R<Z<Y=n<Y<X=l=o<_<T=i=m<W=o=k<\\\\<Y=m<Y<U=k<\\\\=m<^=m<Y<_<X<\\\\<L<R=m=m<T=c<p<R=m<V<^<Y<X=l=o<_<T<Y<_<R=l<R<X<\\\\<^<R<S=l<R=m<X<\\\\<Q<Q=g=i<X<R<W<Z<Q=g<T<P<Y<Q<Q<R<p<R=m<V<^=g=l=o<]<W<Y<U<p<R=m<V<^<\\\\=m=n=l<\\\\<Q=g<Q<T=k<Y<_<R=l<\\\\<]<R=n<Y<X<R<W<Z<Y<Q=o=m<W=o<_<T=n<Y<S<Y=l=`<r<X<Q<\\\\<V<R<S<R=n<R<P=o=l<\\\\<]<R=n=o<\\\\<S=l<Y<W=c<^<R<R<]=e<Y<R<X<Q<R<_<R=m<^<R<Y<_<R=m=n<\\\\=n=`<T<X=l=o<_<R<U=h<R=l=o<P<Y=i<R=l<R=d<R<S=l<R=n<T<^=m=m=g<W<V<\\\\<V<\\\\<Z<X=g<U<^<W<\\\\=m=n<T<_=l=o<S<S=g<^<P<Y=m=n<Y=l<\\\\<]<R=n<\\\\=m<V<\\\\<[<\\\\<W<S<Y=l<^=g<U<X<Y<W<\\\\=n=`<X<Y<Q=`<_<T<S<Y=l<T<R<X<]<T<[<Q<Y=m<R=m<Q<R<^<Y<P<R<P<Y<Q=n<V=o<S<T=n=`<X<R<W<Z<Q<\\\\=l<\\\\<P<V<\\\\=i<Q<\\\\=k<\\\\<W<R<L<\\\\<]<R=n<\\\\<N<R<W=`<V<R=m<R<^=m<Y<P<^=n<R=l<R<U<Q<\\\\=k<\\\\<W<\\\\=m<S<T=m<R<V=m<W=o<Z<]=g=m<T=m=n<Y<P<S<Y=k<\\\\=n<T<Q<R<^<R<_<R<S<R<P<R=e<T=m<\\\\<U=n<R<^<S<R=k<Y<P=o<S<R<P<R=e=`<X<R<W<Z<Q<R=m=m=g<W<V<T<]=g=m=n=l<R<X<\\\\<Q<Q=g<Y<P<Q<R<_<T<Y<S=l<R<Y<V=n<M<Y<U=k<\\\\=m<P<R<X<Y<W<T=n<\\\\<V<R<_<R<R<Q<W<\\\\<U<Q<_<R=l<R<X<Y<^<Y=l=m<T=c=m=n=l<\\\\<Q<Y=h<T<W=`<P=g=o=l<R<^<Q=c=l<\\\\<[<Q=g=i<T=m<V<\\\\=n=`<Q<Y<X<Y<W=b=c<Q<^<\\\\=l=c<P<Y<Q=`=d<Y<P<Q<R<_<T=i<X<\\\\<Q<Q<R<U<[<Q<\\\\=k<T=n<Q<Y<W=`<[=c=h<R=l=o<P<\\\\<N<Y<S<Y=l=`<P<Y=m=c=j<\\\\<[<\\\\=e<T=n=g<w=o=k=d<T<Y\\fHD\\fHU\\fIl\\fHn\\fHy\\fH\\\\\\fHD\\fIk\\fHi\\fHF\\fHD\\fIk\\fHy\\fHS\\fHC\\fHR\\fHy\\fH\\\\\\fIk\\fHn\\fHi\\fHD\\fIa\\fHC\\fHy\\fIa\\fHC\\fHR\\fH{\\fHR\\fHk\\fHM\\fH@\\fHR\\fH\\\\\\fIk\\fHy\\fHS\\fHT\\fIl\\fHJ\\fHS\\fHC\\fHR\\fHF\\fHU\\fH^\\fIk\\fHT\\fHS\\fHn\\fHU\\fHA\\fHR\\fH\\\\\\fHH\\fHi\\fHF\\fHD\\fIl\\fHY\\fHR\\fH^\\fIk\\fHT\\fIk\\fHY\\fHR\\fHy\\fH\\\\\\fHH\\fIk\\fHB\\fIk\\fH\\\\\\fIk\\fHU\\fIg\\fHD\\fIk\\fHT\\fHy\\fHH\\fIk\\fH@\\fHU\\fIm\\fHH\\fHT\\fHR\\fHk\\fHs\\fHU\\fIg\\fH{\\fHR\\fHp\\fHR\\fHD\\fIk\\fHB\\fHS\\fHD\\fHs\\fHy\\fH\\\\\\fHH\\fHR\\fHy\\fH\\\\\\fHD\\fHR\\fHe\\fHD\\fHy\\fIk\\fHC\\fHU\\fHR\\fHm\\fHT\\fH@\\fHT\\fIk\\fHA\\fHR\\fH[\\fHR\\fHj\\fHF\\fHy\\fIk\\fH^\\fHS\\fHC\\fIk\\fHZ\\fIm\\fH\\\\\\fIn\\fHk\\fHT\\fHy\\fIk\\fHt\\fHn\\fHs\\fIk\\fHB\\fIk\\fH\\\\\\fIl\\fHT\\fHy\\fHH\\fHR\\fHB\\fIk\\fH\\\\\\fHR\\fH^\\fIk\\fHy\\fH\\\\\\fHi\\fHK\\fHS\\fHy\\fHi\\fHF\\fHD\\fHR\\fHT\\fHB\\fHR\\fHp\\fHB\\fIm\\fHq\\fIk\\fHy\\fHR\\fH\\\\\\fHO\\fHU\\fIg\\fHH\\fHR\\fHy\\fHM\\fHP\\fIl\\fHC\\fHU\\fHR\\fHn\\fHU\\fIg\\fHs\\fH^\\fHZ\\fH@\\fIa\\fHJ\\fH^\\fHS\\fHC\\fHR\\fHp\\fIl\\fHY\\fHD\\fHp\\fHR\\fHH\\fHR\\fHy\\fId\\fHT\\fIk\\fHj\\fHF\\fHy\\fHR\\fHY\\fHR\\fH^\\fIl\\fHJ\\fIk\\fHD\\fIk\\fHF\\fIn\\fH\\\\\\fIl\\fHF\\fHR\\fHD\\fIl\\fHe\\fHT\\fHy\\fIk\\fHU\\fIg\\fH{\\fIl\\fH@\\fId\\fHL\\fHy\\fHj\\fHF\\fHy\\fIl\\fHY\\fH\\\\\\fIa\\fH[\\fH{\\fHR\\fHn\\fHY\\fHj\\fHF\\fHy\\fIg\\fHp\\fHS\\fH^\\fHR\\fHp\\fHR\\fHD\\fHR\\fHT\\fHU\\fHB\\fHH\\fHU\\fHB\\fIk\\fHn\\fHe\\fHD\\fHy\\fIl\\fHC\\fHR\\fHU\\fIn\\fHJ\\fH\\\\\\fIa\\fHp\\fHT\\fIn\\fHv\\fIl\\fHF\\fHT\\fHn\\fHJ\\fHT\\fHY\\fHR\\fH^\\fHU\\fIg\\fHD\\fHR\\fHU\\fIg\\fHH\\fIl\\fHp\\fId\\fHT\\fIk\\fHY\\fHR\\fHF\\fHT\\fHp\\fHD\\fHH\\fHR\\fHD\\fIk\\fHH\\fHR\\fHp\\fHR\\fH\\\\\\fIl\\fHt\\fHR\\fHC\\fH^\\fHp\\fHS\\fH^\\fIk\\fHD\\fIl\\fHv\\fIk\\fHp\\fHR\\fHn\\fHv\\fHF\\fHH\\fIa\\fH\\\\\\fH{\\fIn\\fH{\\fH^\\fHp\\fHR\\fHH\\fIk\\fH@\\fHR\\fHU\\fH\\\\\\fHj\\fHF\\fHD\\fIk\\fHY\\fHR\\fHU\\fHD\\fHk\\fHT\\fHy\\fHR\\fHT\\fIm\\fH@\\fHU\\fH\\\\\\fHU\\fHD\\fIk\\fHk\\fHT\\fHT\\fIk\\fHT\\fHU\\fHS\\fHH\\fH@\\fHM\\fHP\\fIk\\fHt\\fHs\\fHD\\fHR\\fHH\\fH^\\fHR\\fHZ\\fHF\\fHR\\fHn\\fHv\\fHZ\\fIa\\fH\\\\\\fIl\\fH@\\fHM\\fHP\\fIl\\fHU\\fIg\\fHH\\fIk\\fHT\\fHR\\fHd\\fHs\\fHZ\\fHR\\fHC\\fHJ\\fHT\\fHy\\fHH\\fIl\\fHp\\fHR\\fHH\\fIl\\fHY\\fHR\\fH^\\fHR\\fHU\\fHp\\fHR\\fH\\\\\\fHF\\fHs\\fHD\\fHR\\fH\\\\\\fHz\\fHD\\fIk\\fHT\\fHM\\fHP\\fHy\\fHB\\fHS\\fH^\\fHR\\fHe\\fHT\\fHy\\fIl\\fHy\\fIk\\fHY\\fH^\\fH^\\fH{\\fHH\\fHR\\fHz\\fHR\\fHD\\fHR\\fHi\\fH\\\\\\fIa\\fHI\\fHp\\fHU\\fHR\\fHn\\fHJ\\fIk\\fHz\\fHR\\fHF\\fHU\\fH^\\fIl\\fHD\\fHS\\fHC\\fHB\\fH@\\fHS\\fHD\\fHR\\fH@\\fId\\fHn\\fHy\\fHy\\fHU\\fIl\\fHn\\fHy\\fHU\\fHD\\fHR\\fHJ\\fIk\\fHH\\fHR\\fHU\\fHB\\fH^\\fIk\\fHy\\fHR\\fHG\\fIl\\fHp\\fH@\\fHy\\fHS\\fHH\\fIm\\fH\\\\\\fHH\\fHB\\fHR\\fHn\\fH{\\fHY\\fHU\\fIl\\fHn\\fH\\\\\\fIg\\fHp\\fHP\\fHB\\fHS\\fH^\\fIl\\fHj\\fH\\\\\\fIg\\fHF\\fHT\\fIk\\fHD\\fHR\\fHC\\fHR\\fHJ\\fHY\\fH^\\fIk\\fHD\\fIk\\fHz\\fHR\\fHH\\fHR\\fHy\\fH\\\\\\fIl\\fH@\\fHe\\fHD\\fHy\\fHR\\fHp\\fHY\\fHR\\fH@\\fHF\\fIn\\fH\\\\\\fHR\\fH@\\fHM\\fHP\\fHR\\fHT\\fI`\\fHJ\\fHR\\fHZ\\fIk\\fHC\\fH\\\\\\fHy\\fHS\\fHC\\fIk\\fHy\\fHU\\fHR\\fHn\\fHi\\fHy\\fHT\\fH\\\\\\fH@\\fHD\\fHR\\fHc\\fHY\\fHU\\fHR\\fHn\\fHT\\fIa\\fHI\\fH^\\fHB\\fHS\\fH^\\fIk\\fH^\\fIk\\fHz\\fHy\\fHY\\fHS\\fH[\\fHC\\fHy\\fIa\\fH\\\\\\fHn\\fHT\\fHB\\fIn\\fHU\\fHI\\fHR\\fHD\\fHR4F4_4F4[5f4U5i4X4K4]5o4E4D5d4K4_4[4E4K5h4Y5m4A4E5i5d4K4Z5f4U4K5h4B4K4Y4E4K5h5i4^5f4C4K5h4U4K5i4E4K5h5o4K4F4D4K5h4]4C5d4C4D4]5j4K5i4@4K5h4C5d5h4E4K5h4U4K5h5i4K5h5i5d5n4U4K5h4U4]4D5f4K5h4_4]5f4U4K5h4@5d4K5h4K5h4\\\\5k4K4D4K5h4A5f4K4E4K5h4A5n5d5n4K5h5o4]5f5i4K5h4U4]4K5n5i4A5m5d4T4E4K5h4G4K5j5f5i4X4K5k4C4E4K5h5i4]4O4E4K5h5n4]4N5j4K5h4X4D4K4D4K5h4A5d4K4]4K5h4@4C5f4C4K5h4O4_4]4E4K5h4U5h5d5i5i4@5i5d4U4E4K5h4]4A5i5j4K5h5j5n4K4[5m5h4_4[5f5j4K5h5o5d5f4F4K5h4C5j5f4K4D4]5o4K4F5k4K5h4]5f4K4Z4F4A5f4K4F5f4D4F5d5n5f4F4K5h4O5d5h5e4K5h4D4]5f4C4K5h5o5h4K5i4K5h4]4K4D4[4K5h4X4B4Y5f4_5f4K4]4K4F4K5h4G4K5h4G4K5h4Y5h4K4E4K5h4A4C5f4G4K5h4^5d4K4]4K5h4B5h5f4@4K5h4@5i5f4U4K5h4U4K5i5k4K5h4@5i4K5h4K5h4_4K4U4E5i4X4K5k4C5k4K5h4]4J5f4_4K5h4C4B5d5h4K5h5m5j5f4E4K5h5o4F4K4D4K5h4C5d4]5f4K5h4C4]5d4_4K4_4F4V4]5n4F4Y4K5i5f5i4K5h4D5j4K4F4K5h4U4T5f5ifmwfqwbjmnfmwvmgfqpwbmgjmd#>#evm`wjlm+*-isd!#tjgwk>!`lmejdvqbwjlm-smd!#tjgwk>!?algz#`obpp>!Nbwk-qbmgln+*`lmwfnslqbqz#Vmjwfg#Pwbwfp`jq`vnpwbm`fp-bssfmg@kjog+lqdbmjybwjlmp?psbm#`obpp>!!=?jnd#pq`>!,gjpwjmdvjpkfgwklvpbmgp#le#`lnnvmj`bwjlm`ofbq!=?,gju=jmufpwjdbwjlmebuj`lm-j`l!#nbqdjm.qjdkw9abpfg#lm#wkf#Nbppb`kvpfwwpwbaof#alqgfq>jmwfqmbwjlmbobopl#hmltm#bpsqlmvm`jbwjlmab`hdqlvmg9 esbggjmd.ofew9Elq#f{bnsof/#njp`foobmflvp%ow8,nbwk%dw8spz`kloldj`bojm#sbqwj`vobqfbq`k!#wzsf>!elqn#nfwklg>!bp#lsslpfg#wlPvsqfnf#@lvqwl``bpjlmbooz#Bggjwjlmbooz/Mlqwk#Bnfqj`bs{8ab`hdqlvmglsslqwvmjwjfpFmwfqwbjmnfmw-wlOltfq@bpf+nbmveb`wvqjmdsqlefppjlmbo#`lnajmfg#tjwkElq#jmpwbm`f/`lmpjpwjmd#le!#nb{ofmdwk>!qfwvqm#ebopf8`lmp`jlvpmfppNfgjwfqqbmfbmf{wqblqgjmbqzbppbppjmbwjlmpvapfrvfmwoz#avwwlm#wzsf>!wkf#mvnafq#lewkf#lqjdjmbo#`lnsqfkfmpjufqfefqp#wl#wkf?,vo=\\t?,gju=\\tskjolplskj`bool`bwjlm-kqfetbp#svaojpkfgPbm#Eqbm`jp`l+evm`wjlm+*x\\t?gju#jg>!nbjmplskjpwj`bwfgnbwkfnbwj`bo#,kfbg=\\x0E\\t?algzpvddfpwp#wkbwgl`vnfmwbwjlm`lm`fmwqbwjlmqfobwjlmpkjspnbz#kbuf#affm+elq#f{bnsof/Wkjp#bqwj`of#jm#plnf#`bpfpsbqwp#le#wkf#gfejmjwjlm#leDqfbw#Aqjwbjm#`foosbggjmd>frvjubofmw#wlsob`fklogfq>!8#elmw.pjyf9#ivpwjej`bwjlmafojfufg#wkbwpveefqfg#eqlnbwwfnswfg#wl#ofbgfq#le#wkf`qjsw!#pq`>!,+evm`wjlm+*#xbqf#bubjobaof\\t\\n?ojmh#qfo>!#pq`>$kwws9,,jmwfqfpwfg#jm`lmufmwjlmbo#!#bow>!!#,=?,bqf#dfmfqboozkbp#bopl#affmnlpw#slsvobq#`lqqfpslmgjmd`qfgjwfg#tjwkwzof>!alqgfq9?,b=?,psbm=?,-dje!#tjgwk>!?jeqbnf#pq`>!wbaof#`obpp>!jmojmf.aol`h8b``lqgjmd#wl#wldfwkfq#tjwkbssql{jnbwfozsbqojbnfmwbqznlqf#bmg#nlqfgjpsobz9mlmf8wqbgjwjlmboozsqfglnjmbmwoz%maps8\\x7F%maps8%maps8?,psbm=#`foopsb`jmd>?jmsvw#mbnf>!lq!#`lmwfmw>!`lmwqlufqpjbosqlsfqwz>!ld9,{.pkl`htbuf.gfnlmpwqbwjlmpvqqlvmgfg#azMfufqwkfofpp/tbp#wkf#ejqpw`lmpjgfqbaof#Bowklvdk#wkf#`loobalqbwjlmpklvog#mlw#afsqlslqwjlm#le?psbm#pwzof>!hmltm#bp#wkf#pklqwoz#bewfqelq#jmpwbm`f/gfp`qjafg#bp#,kfbg=\\t?algz#pwbqwjmd#tjwkjm`qfbpjmdoz#wkf#eb`w#wkbwgjp`vppjlm#lenjggof#le#wkfbm#jmgjujgvbogjeej`vow#wl#sljmw#le#ujftklnlpf{vbojwzb``fswbm`f#le?,psbm=?,gju=nbmveb`wvqfqplqjdjm#le#wkf`lnnlmoz#vpfgjnslqwbm`f#legfmlnjmbwjlmpab`hdqlvmg9# ofmdwk#le#wkfgfwfqnjmbwjlmb#pjdmjej`bmw!#alqgfq>!3!=qfulovwjlmbqzsqjm`jsofp#lejp#`lmpjgfqfgtbp#gfufolsfgJmgl.Fvqlsfbmuvomfqbaof#wlsqlslmfmwp#lebqf#plnfwjnfp`olpfq#wl#wkfMft#Zlqh#@jwz#mbnf>!pfbq`kbwwqjavwfg#wl`lvqpf#le#wkfnbwkfnbwj`jbmaz#wkf#fmg#lebw#wkf#fmg#le!#alqgfq>!3!#wf`kmloldj`bo-qfnluf@obpp+aqbm`k#le#wkffujgfm`f#wkbw\"Xfmgje^..=\\x0E\\tJmpwjwvwf#le#jmwl#b#pjmdofqfpsf`wjufoz-bmg#wkfqfelqfsqlsfqwjfp#lejp#ol`bwfg#jmplnf#le#tkj`kWkfqf#jp#bopl`lmwjmvfg#wl#bssfbqbm`f#le#%bns8mgbpk8#gfp`qjafp#wkf`lmpjgfqbwjlmbvwklq#le#wkfjmgfsfmgfmwozfrvjssfg#tjwkglfp#mlw#kbuf?,b=?b#kqfe>!`lmevpfg#tjwk?ojmh#kqfe>!,bw#wkf#bdf#lebssfbq#jm#wkfWkfpf#jm`ovgfqfdbqgofpp#le`lvog#af#vpfg#pwzof>%rvlw8pfufqbo#wjnfpqfsqfpfmw#wkfalgz=\\t?,kwno=wklvdkw#wl#afslsvobwjlm#leslppjajojwjfpsfq`fmwbdf#leb``fpp#wl#wkfbm#bwwfnsw#wlsqlgv`wjlm#leirvfqz,irvfqzwtl#gjeefqfmwafolmd#wl#wkffpwbaojpknfmwqfsob`jmd#wkfgfp`qjswjlm!#gfwfqnjmf#wkfbubjobaof#elqB``lqgjmd#wl#tjgf#qbmdf#le\\n?gju#`obpp>!nlqf#`lnnlmozlqdbmjpbwjlmpevm`wjlmbojwztbp#`lnsofwfg#%bns8ngbpk8#sbqwj`jsbwjlmwkf#`kbqb`wfqbm#bggjwjlmbobssfbqp#wl#afeb`w#wkbw#wkfbm#f{bnsof#lepjdmjej`bmwozlmnlvpflufq>!af`bvpf#wkfz#bpzm`#>#wqvf8sqlaofnp#tjwkpffnp#wl#kbufwkf#qfpvow#le#pq`>!kwws9,,ebnjojbq#tjwkslppfppjlm#leevm`wjlm#+*#xwllh#sob`f#jmbmg#plnfwjnfppvapwbmwjbooz?psbm=?,psbm=jp#lewfm#vpfgjm#bm#bwwfnswdqfbw#gfbo#leFmujqlmnfmwbopv``fppevooz#ujqwvbooz#boo13wk#`fmwvqz/sqlefppjlmbopmf`fppbqz#wl#gfwfqnjmfg#az`lnsbwjajojwzaf`bvpf#jw#jpGj`wjlmbqz#lenlgjej`bwjlmpWkf#elooltjmdnbz#qfefq#wl9@lmpfrvfmwoz/Jmwfqmbwjlmbobowklvdk#plnfwkbw#tlvog#aftlqog$p#ejqpw`obppjejfg#bpalwwln#le#wkf+sbqwj`vobqozbojdm>!ofew!#nlpw#`lnnlmozabpjp#elq#wkfelvmgbwjlm#le`lmwqjavwjlmpslsvobqjwz#le`fmwfq#le#wkfwl#qfgv`f#wkfivqjpgj`wjlmpbssql{jnbwjlm#lmnlvpflvw>!Mft#Wfpwbnfmw`loof`wjlm#le?,psbm=?,b=?,jm#wkf#Vmjwfgejon#gjqf`wlq.pwqj`w-gwg!=kbp#affm#vpfgqfwvqm#wl#wkfbowklvdk#wkjp`kbmdf#jm#wkfpfufqbo#lwkfqavw#wkfqf#bqfvmsqf`fgfmwfgjp#pjnjobq#wlfpsf`jbooz#jmtfjdkw9#alog8jp#`boofg#wkf`lnsvwbwjlmbojmgj`bwf#wkbwqfpwqj`wfg#wl\\n?nfwb#mbnf>!bqf#wzsj`booz`lmeoj`w#tjwkKltfufq/#wkf#Bm#f{bnsof#le`lnsbqfg#tjwkrvbmwjwjfp#leqbwkfq#wkbm#b`lmpwfoobwjlmmf`fppbqz#elqqfslqwfg#wkbwpsf`jej`bwjlmslojwj`bo#bmg%maps8%maps8?qfefqfm`fp#wlwkf#pbnf#zfbqDlufqmnfmw#ledfmfqbwjlm#lekbuf#mlw#affmpfufqbo#zfbqp`lnnjwnfmw#wl\\n\\n?vo#`obpp>!ujpvbojybwjlm2:wk#`fmwvqz/sqb`wjwjlmfqpwkbw#kf#tlvogbmg#`lmwjmvfgl``vsbwjlm#lejp#gfejmfg#bp`fmwqf#le#wkfwkf#bnlvmw#le=?gju#pwzof>!frvjubofmw#legjeefqfmwjbwfaqlvdkw#balvwnbqdjm.ofew9#bvwlnbwj`boozwklvdkw#le#bpPlnf#le#wkfpf\\t?gju#`obpp>!jmsvw#`obpp>!qfsob`fg#tjwkjp#lmf#le#wkffgv`bwjlm#bmgjmeovfm`fg#azqfsvwbwjlm#bp\\t?nfwb#mbnf>!b``lnnlgbwjlm?,gju=\\t?,gju=obqdf#sbqw#leJmpwjwvwf#elqwkf#pl.`boofg#bdbjmpw#wkf#Jm#wkjp#`bpf/tbp#bssljmwfg`objnfg#wl#afKltfufq/#wkjpGfsbqwnfmw#lewkf#qfnbjmjmdfeef`w#lm#wkfsbqwj`vobqoz#gfbo#tjwk#wkf\\t?gju#pwzof>!bonlpw#botbzpbqf#`vqqfmwozf{sqfppjlm#leskjolplskz#leelq#nlqf#wkbm`jujojybwjlmplm#wkf#jpobmgpfof`wfgJmgf{`bm#qfpvow#jm!#ubovf>!!#,=wkf#pwqv`wvqf#,=?,b=?,gju=Nbmz#le#wkfpf`bvpfg#az#wkfle#wkf#Vmjwfgpsbm#`obpp>!n`bm#af#wqb`fgjp#qfobwfg#wlaf`bnf#lmf#lejp#eqfrvfmwozojujmd#jm#wkfwkflqfwj`boozElooltjmd#wkfQfulovwjlmbqzdlufqmnfmw#jmjp#gfwfqnjmfgwkf#slojwj`bojmwqlgv`fg#jmpveej`jfmw#wlgfp`qjswjlm!=pklqw#pwlqjfppfsbqbwjlm#lebp#wl#tkfwkfqhmltm#elq#jwptbp#jmjwjboozgjpsobz9aol`hjp#bm#f{bnsofwkf#sqjm`jsbo`lmpjpwp#le#bqf`ldmjyfg#bp,algz=?,kwno=b#pvapwbmwjboqf`lmpwqv`wfgkfbg#le#pwbwfqfpjpwbm`f#wlvmgfqdqbgvbwfWkfqf#bqf#wtldqbujwbwjlmbobqf#gfp`qjafgjmwfmwjlmboozpfqufg#bp#wkf`obpp>!kfbgfqlsslpjwjlm#wlevmgbnfmwboozglnjmbwfg#wkfbmg#wkf#lwkfqboojbm`f#tjwktbp#elq`fg#wlqfpsf`wjufoz/bmg#slojwj`bojm#pvsslqw#lesflsof#jm#wkf13wk#`fmwvqz-bmg#svaojpkfgolbg@kbqwafbwwl#vmgfqpwbmgnfnafq#pwbwfpfmujqlmnfmwboejqpw#kboe#le`lvmwqjfp#bmgbq`kjwf`wvqboaf#`lmpjgfqfg`kbqb`wfqjyfg`ofbqJmwfqubobvwklqjwbwjufEfgfqbwjlm#letbp#pv``ffgfgbmg#wkfqf#bqfb#`lmpfrvfm`fwkf#Sqfpjgfmwbopl#jm`ovgfgeqff#plewtbqfpv``fppjlm#legfufolsfg#wkftbp#gfpwqlzfgbtbz#eqln#wkf8\\t?,p`qjsw=\\t?bowklvdk#wkfzelooltfg#az#bnlqf#sltfqevoqfpvowfg#jm#bVmjufqpjwz#leKltfufq/#nbmzwkf#sqfpjgfmwKltfufq/#plnfjp#wklvdkw#wlvmwjo#wkf#fmgtbp#bmmlvm`fgbqf#jnslqwbmwbopl#jm`ovgfp=?jmsvw#wzsf>wkf#`fmwfq#le#GL#MLW#BOWFQvpfg#wl#qfefqwkfnfp,<plqw>wkbw#kbg#affmwkf#abpjp#elqkbp#gfufolsfgjm#wkf#pvnnfq`lnsbqbwjufozgfp`qjafg#wkfpv`k#bp#wklpfwkf#qfpvowjmdjp#jnslppjaofubqjlvp#lwkfqPlvwk#Beqj`bmkbuf#wkf#pbnffeef`wjufmfppjm#tkj`k#`bpf8#wf{w.bojdm9pwqv`wvqf#bmg8#ab`hdqlvmg9qfdbqgjmd#wkfpvsslqwfg#wkfjp#bopl#hmltmpwzof>!nbqdjmjm`ovgjmd#wkfabkbpb#Nfobzvmlqph#alhn/Iomlqph#mzmlqphpolufm)M(ajmbjmwfqmb`jlmbo`bojej`b`j/_m`lnvmj`b`j/_m`lmpwqv``j/_m!=?gju#`obpp>!gjpbnajdvbwjlmGlnbjmMbnf$/#$bgnjmjpwqbwjlmpjnvowbmflvpozwqbmpslqwbwjlmJmwfqmbwjlmbo#nbqdjm.alwwln9qfpslmpjajojwz?\"Xfmgje^..=\\t?,=?nfwb#mbnf>!jnsofnfmwbwjlmjmeqbpwqv`wvqfqfsqfpfmwbwjlmalqgfq.alwwln9?,kfbg=\\t?algz=>kwws&0B&1E&1E?elqn#nfwklg>!nfwklg>!slpw!#,ebuj`lm-j`l!#~*8\\t?,p`qjsw=\\t-pfwBwwqjavwf+Bgnjmjpwqbwjlm>#mft#Bqqbz+*8?\"Xfmgje^..=\\x0E\\tgjpsobz9aol`h8Vmelqwvmbwfoz/!=%maps8?,gju=,ebuj`lm-j`l!=>$pwzofpkffw$#jgfmwjej`bwjlm/#elq#f{bnsof/?oj=?b#kqfe>!,bm#bowfqmbwjufbp#b#qfpvow#lesw!=?,p`qjsw=\\twzsf>!pvanjw!#\\t+evm`wjlm+*#xqf`lnnfmgbwjlmelqn#b`wjlm>!,wqbmpelqnbwjlmqf`lmpwqv`wjlm-pwzof-gjpsobz#B``lqgjmd#wl#kjggfm!#mbnf>!bolmd#tjwk#wkfgl`vnfmw-algz-bssql{jnbwfoz#@lnnvmj`bwjlmpslpw!#b`wjlm>!nfbmjmd#%rvlw8..?\"Xfmgje^..=Sqjnf#Njmjpwfq`kbqb`wfqjpwj`?,b=#?b#`obpp>wkf#kjpwlqz#le#lmnlvpflufq>!wkf#dlufqmnfmwkqfe>!kwwsp9,,tbp#lqjdjmbooztbp#jmwqlgv`fg`obppjej`bwjlmqfsqfpfmwbwjufbqf#`lmpjgfqfg?\"Xfmgje^..=\\t\\tgfsfmgp#lm#wkfVmjufqpjwz#le#jm#`lmwqbpw#wl#sob`fklogfq>!jm#wkf#`bpf#lejmwfqmbwjlmbo#`lmpwjwvwjlmbopwzof>!alqgfq.9#evm`wjlm+*#xAf`bvpf#le#wkf.pwqj`w-gwg!=\\t?wbaof#`obpp>!b``lnsbmjfg#azb``lvmw#le#wkf?p`qjsw#pq`>!,mbwvqf#le#wkf#wkf#sflsof#jm#jm#bggjwjlm#wlp*8#ip-jg#>#jg!#tjgwk>!233&!qfdbqgjmd#wkf#Qlnbm#@bwkloj`bm#jmgfsfmgfmwelooltjmd#wkf#-dje!#tjgwk>!2wkf#elooltjmd#gjp`qjnjmbwjlmbq`kbfloldj`bosqjnf#njmjpwfq-ip!=?,p`qjsw=`lnajmbwjlm#le#nbqdjmtjgwk>!`qfbwfFofnfmw+t-bwwb`kFufmw+?,b=?,wg=?,wq=pq`>!kwwsp9,,bJm#sbqwj`vobq/#bojdm>!ofew!#@yf`k#Qfsvaoj`Vmjwfg#Hjmdgln`lqqfpslmgfm`f`lm`ovgfg#wkbw-kwno!#wjwof>!+evm`wjlm#+*#x`lnfp#eqln#wkfbssoj`bwjlm#le?psbm#`obpp>!pafojfufg#wl#affnfmw+$p`qjsw$?,b=\\t?,oj=\\t?ojufqz#gjeefqfmw=?psbm#`obpp>!lswjlm#ubovf>!+bopl#hmltm#bp\\n?oj=?b#kqfe>!=?jmsvw#mbnf>!pfsbqbwfg#eqlnqfefqqfg#wl#bp#ubojdm>!wls!=elvmgfq#le#wkfbwwfnswjmd#wl#`bqalm#gjl{jgf\\t\\t?gju#`obpp>!`obpp>!pfbq`k.,algz=\\t?,kwno=lsslqwvmjwz#wl`lnnvmj`bwjlmp?,kfbg=\\x0E\\t?algz#pwzof>!tjgwk9Wj\\rVSmd#Uj\\rWkw`kbmdfp#jm#wkfalqgfq.`lolq9 3!#alqgfq>!3!#?,psbm=?,gju=?tbp#gjp`lufqfg!#wzsf>!wf{w!#*8\\t?,p`qjsw=\\t\\tGfsbqwnfmw#le#f``ofpjbpwj`bowkfqf#kbp#affmqfpvowjmd#eqln?,algz=?,kwno=kbp#mfufq#affmwkf#ejqpw#wjnfjm#qfpslmpf#wlbvwlnbwj`booz#?,gju=\\t\\t?gju#jtbp#`lmpjgfqfgsfq`fmw#le#wkf!#,=?,b=?,gju=`loof`wjlm#le#gfp`fmgfg#eqlnpf`wjlm#le#wkfb``fsw.`kbqpfwwl#af#`lmevpfgnfnafq#le#wkf#sbggjmd.qjdkw9wqbmpobwjlm#lejmwfqsqfwbwjlm#kqfe>$kwws9,,tkfwkfq#lq#mlwWkfqf#bqf#boplwkfqf#bqf#nbmzb#pnboo#mvnafqlwkfq#sbqwp#lejnslppjaof#wl##`obpp>!avwwlmol`bwfg#jm#wkf-#Kltfufq/#wkfbmg#fufmwvboozBw#wkf#fmg#le#af`bvpf#le#jwpqfsqfpfmwp#wkf?elqn#b`wjlm>!#nfwklg>!slpw!jw#jp#slppjaofnlqf#ojhfoz#wlbm#jm`qfbpf#jmkbuf#bopl#affm`lqqfpslmgp#wlbmmlvm`fg#wkbwbojdm>!qjdkw!=nbmz#`lvmwqjfpelq#nbmz#zfbqpfbqojfpw#hmltmaf`bvpf#jw#tbpsw!=?,p`qjsw=\\x0E#ubojdm>!wls!#jmkbajwbmwp#leelooltjmd#zfbq\\x0E\\t?gju#`obpp>!njoojlm#sflsof`lmwqlufqpjbo#`lm`fqmjmd#wkfbqdvf#wkbw#wkfdlufqmnfmw#bmgb#qfefqfm`f#wlwqbmpefqqfg#wlgfp`qjajmd#wkf#pwzof>!`lolq9bowklvdk#wkfqfafpw#hmltm#elqpvanjw!#mbnf>!nvowjsoj`bwjlmnlqf#wkbm#lmf#qf`ldmjwjlm#le@lvm`jo#le#wkffgjwjlm#le#wkf##?nfwb#mbnf>!Fmwfqwbjmnfmw#btbz#eqln#wkf#8nbqdjm.qjdkw9bw#wkf#wjnf#lejmufpwjdbwjlmp`lmmf`wfg#tjwkbmg#nbmz#lwkfqbowklvdk#jw#jpafdjmmjmd#tjwk#?psbm#`obpp>!gfp`fmgbmwp#le?psbm#`obpp>!j#bojdm>!qjdkw!?,kfbg=\\t?algz#bpsf`wp#le#wkfkbp#pjm`f#affmFvqlsfbm#Vmjlmqfnjmjp`fmw#lenlqf#gjeej`vowUj`f#Sqfpjgfmw`lnslpjwjlm#lesbppfg#wkqlvdknlqf#jnslqwbmwelmw.pjyf922s{f{sobmbwjlm#lewkf#`lm`fsw#letqjwwfm#jm#wkf\\n?psbm#`obpp>!jp#lmf#le#wkf#qfpfnaobm`f#wllm#wkf#dqlvmgptkj`k#`lmwbjmpjm`ovgjmd#wkf#gfejmfg#az#wkfsvaoj`bwjlm#lenfbmp#wkbw#wkflvwpjgf#le#wkfpvsslqw#le#wkf?jmsvw#`obpp>!?psbm#`obpp>!w+Nbwk-qbmgln+*nlpw#sqlnjmfmwgfp`qjswjlm#le@lmpwbmwjmlsoftfqf#svaojpkfg?gju#`obpp>!pfbssfbqp#jm#wkf2!#kfjdkw>!2!#nlpw#jnslqwbmwtkj`k#jm`ovgfptkj`k#kbg#affmgfpwqv`wjlm#lewkf#slsvobwjlm\\t\\n?gju#`obpp>!slppjajojwz#leplnfwjnfp#vpfgbssfbq#wl#kbufpv``fpp#le#wkfjmwfmgfg#wl#afsqfpfmw#jm#wkfpwzof>!`ofbq9a\\x0E\\t?,p`qjsw=\\x0E\\t?tbp#elvmgfg#jmjmwfqujft#tjwk\\\\jg!#`lmwfmw>!`bsjwbo#le#wkf\\x0E\\t?ojmh#qfo>!pqfofbpf#le#wkfsljmw#lvw#wkbw{NOKwwsQfrvfpwbmg#pvapfrvfmwpf`lmg#obqdfpwufqz#jnslqwbmwpsf`jej`bwjlmppvqeb`f#le#wkfbssojfg#wl#wkfelqfjdm#sloj`z\\\\pfwGlnbjmMbnffpwbaojpkfg#jmjp#afojfufg#wlJm#bggjwjlm#wlnfbmjmd#le#wkfjp#mbnfg#bewfqwl#sqlwf`w#wkfjp#qfsqfpfmwfgGf`obqbwjlm#lenlqf#feej`jfmw@obppjej`bwjlmlwkfq#elqnp#lekf#qfwvqmfg#wl?psbm#`obpp>!`sfqelqnbm`f#le+evm`wjlm+*#x\\x0Eje#bmg#lmoz#jeqfdjlmp#le#wkfofbgjmd#wl#wkfqfobwjlmp#tjwkVmjwfg#Mbwjlmppwzof>!kfjdkw9lwkfq#wkbm#wkfzsf!#`lmwfmw>!Bppl`jbwjlm#le\\t?,kfbg=\\t?algzol`bwfg#lm#wkfjp#qfefqqfg#wl+jm`ovgjmd#wkf`lm`fmwqbwjlmpwkf#jmgjujgvbobnlmd#wkf#nlpwwkbm#bmz#lwkfq,=\\t?ojmh#qfo>!#qfwvqm#ebopf8wkf#svqslpf#lewkf#bajojwz#wl8`lolq9 eee~\\t-\\t?psbm#`obpp>!wkf#pvaif`w#legfejmjwjlmp#le=\\x0E\\t?ojmh#qfo>!`objn#wkbw#wkfkbuf#gfufolsfg?wbaof#tjgwk>!`fofaqbwjlm#leElooltjmd#wkf#wl#gjpwjmdvjpk?psbm#`obpp>!awbhfp#sob`f#jmvmgfq#wkf#mbnfmlwfg#wkbw#wkf=?\"Xfmgje^..=\\tpwzof>!nbqdjm.jmpwfbg#le#wkfjmwqlgv`fg#wkfwkf#sql`fpp#lejm`qfbpjmd#wkfgjeefqfm`fp#jmfpwjnbwfg#wkbwfpsf`jbooz#wkf,gju=?gju#jg>!tbp#fufmwvboozwkqlvdklvw#kjpwkf#gjeefqfm`fplnfwkjmd#wkbwpsbm=?,psbm=?,pjdmjej`bmwoz#=?,p`qjsw=\\x0E\\t\\x0E\\tfmujqlmnfmwbo#wl#sqfufmw#wkfkbuf#affm#vpfgfpsf`jbooz#elqvmgfqpwbmg#wkfjp#fppfmwjbooztfqf#wkf#ejqpwjp#wkf#obqdfpwkbuf#affm#nbgf!#pq`>!kwws9,,jmwfqsqfwfg#bppf`lmg#kboe#le`qloojmd>!ml!#jp#`lnslpfg#leJJ/#Kloz#Qlnbmjp#f{sf`wfg#wlkbuf#wkfjq#ltmgfejmfg#bp#wkfwqbgjwjlmbooz#kbuf#gjeefqfmwbqf#lewfm#vpfgwl#fmpvqf#wkbwbdqffnfmw#tjwk`lmwbjmjmd#wkfbqf#eqfrvfmwozjmelqnbwjlm#lmf{bnsof#jp#wkfqfpvowjmd#jm#b?,b=?,oj=?,vo=#`obpp>!ellwfqbmg#fpsf`jboozwzsf>!avwwlm!#?,psbm=?,psbm=tkj`k#jm`ovgfg=\\t?nfwb#mbnf>!`lmpjgfqfg#wkf`bqqjfg#lvw#azKltfufq/#jw#jpaf`bnf#sbqw#lejm#qfobwjlm#wlslsvobq#jm#wkfwkf#`bsjwbo#letbp#leej`jbooztkj`k#kbp#affmwkf#Kjpwlqz#lebowfqmbwjuf#wlgjeefqfmw#eqlnwl#pvsslqw#wkfpvddfpwfg#wkbwjm#wkf#sql`fpp##?gju#`obpp>!wkf#elvmgbwjlmaf`bvpf#le#kjp`lm`fqmfg#tjwkwkf#vmjufqpjwzlsslpfg#wl#wkfwkf#`lmwf{w#le?psbm#`obpp>!swf{w!#mbnf>!r!\\n\\n?gju#`obpp>!wkf#p`jfmwjej`qfsqfpfmwfg#aznbwkfnbwj`jbmpfof`wfg#az#wkfwkbw#kbuf#affm=?gju#`obpp>!`gju#jg>!kfbgfqjm#sbqwj`vobq/`lmufqwfg#jmwl*8\\t?,p`qjsw=\\t?skjolplskj`bo#pqsphlkqubwphjwj\\rVSmd#Uj\\rWkw<L=o=m=m<V<T<U=l=o=m=m<V<T<Ujmufpwjdb`j/_msbqwj`jsb`j/_m<V<R=n<R=l=g<Y<R<]<W<\\\\=m=n<T<V<R=n<R=l=g<U=k<Y<W<R<^<Y<V=m<T=m=n<Y<P=g<q<R<^<R=m=n<T<V<R=n<R=l=g=i<R<]<W<\\\\=m=n=`<^=l<Y<P<Y<Q<T<V<R=n<R=l<\\\\=c=m<Y<_<R<X<Q=c=m<V<\\\\=k<\\\\=n=`<Q<R<^<R=m=n<T<O<V=l<\\\\<T<Q=g<^<R<S=l<R=m=g<V<R=n<R=l<R<U=m<X<Y<W<\\\\=n=`<S<R<P<R=e=`=b=m=l<Y<X=m=n<^<R<]=l<\\\\<[<R<P=m=n<R=l<R<Q=g=o=k<\\\\=m=n<T<Y=n<Y=k<Y<Q<T<Y<\\x7F<W<\\\\<^<Q<\\\\=c<T=m=n<R=l<T<T=m<T=m=n<Y<P<\\\\=l<Y=d<Y<Q<T=c<M<V<\\\\=k<\\\\=n=`<S<R=a=n<R<P=o=m<W<Y<X=o<Y=n=m<V<\\\\<[<\\\\=n=`=n<R<^<\\\\=l<R<^<V<R<Q<Y=k<Q<R=l<Y=d<Y<Q<T<Y<V<R=n<R=l<R<Y<R=l<_<\\\\<Q<R<^<V<R=n<R=l<R<P<L<Y<V<W<\\\\<P<\\\\4K5h5i5j4F4C5e5i5j4F4C5f4K4F4K5h5i5d4Z5d4U4K5h4D4]4K5i4@4K5h5i5d4K5n4U4K5h4]4_4K4J5h5i4X4K4]5o4K4F4K5h4O4U4Z4K4M4K5h4]5f4K4Z4E4K5h4F4Y5i5f5i4K5h4K4U4Z4K4M4K5h5j4F4K4J4@4K5h4O5h4U4K4D4K5h4F4_4@5f5h4K5h4O5n4_4K5i4K5h4Z4V4[4K4F4K5h5m5f4C5f5d4K5h4F4]4A5f4D4K5h4@4C5f4C4E4K5h4F4U5h5f5i4K5h4O4B4D4K4]4K5h4K5m5h4K5i4K5h4O5m5h4K5i4K5h4F4K4]5f4B4K5h4F5n5j5f4E4K5h4K5h4U4K4D4K5h4B5d4K4[4]4K5h5i4@4F5i4U4K5h4C5f5o5d4]4K5h4_5f4K4A4E4U4D4C4K5h5h5k4K5h4F4]4D5f4E4K5h4]5d4K4D4[4K5h4O4C4D5f4E4K5h4K4B4D4K4]4K5h5i4F4A4C4E4K5h4K4V4K5j5f`vqplq9sljmwfq8?,wjwof=\\t?nfwb#!#kqfe>!kwws9,,!=?psbm#`obpp>!nfnafqp#le#wkf#tjmglt-ol`bwjlmufqwj`bo.bojdm9,b=#\\x7F#?b#kqfe>!?\"gl`wzsf#kwno=nfgjb>!p`qffm!#?lswjlm#ubovf>!ebuj`lm-j`l!#,=\\t\\n\\n?gju#`obpp>!`kbqb`wfqjpwj`p!#nfwklg>!dfw!#,algz=\\t?,kwno=\\tpklqw`vw#j`lm!#gl`vnfmw-tqjwf+sbggjmd.alwwln9qfsqfpfmwbwjufppvanjw!#ubovf>!bojdm>!`fmwfq!#wkqlvdklvw#wkf#p`jfm`f#ej`wjlm\\t##?gju#`obpp>!pvanjw!#`obpp>!lmf#le#wkf#nlpw#ubojdm>!wls!=?tbp#fpwbaojpkfg*8\\x0E\\t?,p`qjsw=\\x0E\\tqfwvqm#ebopf8!=*-pwzof-gjpsobzaf`bvpf#le#wkf#gl`vnfmw-`llhjf?elqn#b`wjlm>!,~algzxnbqdjm938Fm`z`olsfgjb#leufqpjlm#le#wkf#-`qfbwfFofnfmw+mbnf!#`lmwfmw>!?,gju=\\t?,gju=\\t\\tbgnjmjpwqbwjuf#?,algz=\\t?,kwno=kjpwlqz#le#wkf#!=?jmsvw#wzsf>!slqwjlm#le#wkf#bp#sbqw#le#wkf#%maps8?b#kqfe>!lwkfq#`lvmwqjfp!=\\t?gju#`obpp>!?,psbm=?,psbm=?Jm#lwkfq#tlqgp/gjpsobz9#aol`h8`lmwqlo#le#wkf#jmwqlgv`wjlm#le,=\\t?nfwb#mbnf>!bp#tfoo#bp#wkf#jm#qf`fmw#zfbqp\\x0E\\t\\n?gju#`obpp>!?,gju=\\t\\n?,gju=\\tjmpsjqfg#az#wkfwkf#fmg#le#wkf#`lnsbwjaof#tjwkaf`bnf#hmltm#bp#pwzof>!nbqdjm9-ip!=?,p`qjsw=?#Jmwfqmbwjlmbo#wkfqf#kbuf#affmDfqnbm#obmdvbdf#pwzof>!`lolq9 @lnnvmjpw#Sbqwz`lmpjpwfmw#tjwkalqgfq>!3!#`foo#nbqdjmkfjdkw>!wkf#nbilqjwz#le!#bojdm>!`fmwfqqfobwfg#wl#wkf#nbmz#gjeefqfmw#Lqwklgl{#@kvq`kpjnjobq#wl#wkf#,=\\t?ojmh#qfo>!ptbp#lmf#le#wkf#vmwjo#kjp#gfbwk~*+*8\\t?,p`qjsw=lwkfq#obmdvbdfp`lnsbqfg#wl#wkfslqwjlmp#le#wkfwkf#Mfwkfqobmgpwkf#nlpw#`lnnlmab`hdqlvmg9vqo+bqdvfg#wkbw#wkfp`qloojmd>!ml!#jm`ovgfg#jm#wkfMlqwk#Bnfqj`bm#wkf#mbnf#le#wkfjmwfqsqfwbwjlmpwkf#wqbgjwjlmbogfufolsnfmw#le#eqfrvfmwoz#vpfgb#`loof`wjlm#leufqz#pjnjobq#wlpvqqlvmgjmd#wkff{bnsof#le#wkjpbojdm>!`fmwfq!=tlvog#kbuf#affmjnbdf\\\\`bswjlm#>bwwb`kfg#wl#wkfpvddfpwjmd#wkbwjm#wkf#elqn#le#jmuloufg#jm#wkfjp#gfqjufg#eqlnmbnfg#bewfq#wkfJmwqlgv`wjlm#wlqfpwqj`wjlmp#lm#pwzof>!tjgwk9#`bm#af#vpfg#wl#wkf#`qfbwjlm#lenlpw#jnslqwbmw#jmelqnbwjlm#bmgqfpvowfg#jm#wkf`loobspf#le#wkfWkjp#nfbmp#wkbwfofnfmwp#le#wkftbp#qfsob`fg#azbmbozpjp#le#wkfjmpsjqbwjlm#elqqfdbqgfg#bp#wkfnlpw#pv``fppevohmltm#bp#%rvlw8b#`lnsqfkfmpjufKjpwlqz#le#wkf#tfqf#`lmpjgfqfgqfwvqmfg#wl#wkfbqf#qfefqqfg#wlVmplvq`fg#jnbdf=\\t\\n?gju#`obpp>!`lmpjpwp#le#wkfpwlsSqlsbdbwjlmjmwfqfpw#jm#wkfbubjobajojwz#lebssfbqp#wl#kbuffof`wqlnbdmfwj`fmbaofPfquj`fp+evm`wjlm#le#wkfJw#jp#jnslqwbmw?,p`qjsw=?,gju=evm`wjlm+*xubq#qfobwjuf#wl#wkfbp#b#qfpvow#le#wkf#slpjwjlm#leElq#f{bnsof/#jm#nfwklg>!slpw!#tbp#elooltfg#az%bns8ngbpk8#wkfwkf#bssoj`bwjlmip!=?,p`qjsw=\\x0E\\tvo=?,gju=?,gju=bewfq#wkf#gfbwktjwk#qfpsf`w#wlpwzof>!sbggjmd9jp#sbqwj`vobqozgjpsobz9jmojmf8#wzsf>!pvanjw!#jp#gjujgfg#jmwl\\bTA\\nzk#+\\x0BBl\\bQ\\x7F*qfpslmpbajojgbgbgnjmjpwqb`j/_mjmwfqmb`jlmbofp`lqqfpslmgjfmwf\\fHe\\fHF\\fHC\\fIg\\fH{\\fHF\\fIn\\fH\\\\\\fIa\\fHY\\fHU\\fHB\\fHR\\fH\\\\\\fIk\\fH^\\fIg\\fH{\\fIg\\fHn\\fHv\\fIm\\fHD\\fHR\\fHY\\fH^\\fIk\\fHy\\fHS\\fHD\\fHT\\fH\\\\\\fHy\\fHR\\fH\\\\\\fHF\\fIm\\fH^\\fHS\\fHT\\fHz\\fIg\\fHp\\fIk\\fHn\\fHv\\fHR\\fHU\\fHS\\fHc\\fHA\\fIk\\fHp\\fIk\\fHn\\fHZ\\fHR\\fHB\\fHS\\fH^\\fHU\\fHB\\fHR\\fH\\\\\\fIl\\fHp\\fHR\\fH{\\fH\\\\\\fHO\\fH@\\fHD\\fHR\\fHD\\fIk\\fHy\\fIm\\fHB\\fHR\\fH\\\\\\fH@\\fIa\\fH^\\fIe\\fH{\\fHB\\fHR\\fH^\\fHS\\fHy\\fHB\\fHU\\fHS\\fH^\\fHR\\fHF\\fIo\\fH[\\fIa\\fHL\\fH@\\fHN\\fHP\\fHH\\fIk\\fHA\\fHR\\fHp\\fHF\\fHR\\fHy\\fIa\\fH^\\fHS\\fHy\\fHs\\fIa\\fH\\\\\\fIk\\fHD\\fHz\\fHS\\fH^\\fHR\\fHG\\fHJ\\fI`\\fH\\\\\\fHR\\fHD\\fHB\\fHR\\fHB\\fH^\\fIk\\fHB\\fHH\\fHJ\\fHR\\fHD\\fH@\\fHR\\fHp\\fHR\\fH\\\\\\fHY\\fHS\\fHy\\fHR\\fHT\\fHy\\fIa\\fHC\\fIg\\fHn\\fHv\\fHR\\fHU\\fHH\\fIk\\fHF\\fHU\\fIm\\fHm\\fHv\\fH@\\fHH\\fHR\\fHC\\fHR\\fHT\\fHn\\fHY\\fHR\\fHJ\\fHJ\\fIk\\fHz\\fHD\\fIk\\fHF\\fHS\\fHw\\fH^\\fIk\\fHY\\fHS\\fHZ\\fIk\\fH[\\fH\\\\\\fHR\\fHp\\fIa\\fHC\\fHe\\fHH\\fIa\\fHH\\fH\\\\\\fHB\\fIm\\fHn\\fH@\\fHd\\fHJ\\fIg\\fHD\\fIg\\fHn\\fHe\\fHF\\fHy\\fH\\\\\\fHO\\fHF\\fHN\\fHP\\fIk\\fHn\\fHT\\fIa\\fHI\\fHS\\fHH\\fHG\\fHS\\fH^\\fIa\\fHB\\fHB\\fIm\\fHz\\fIa\\fHC\\fHi\\fHv\\fIa\\fHw\\fHR\\fHw\\fIn\\fHs\\fHH\\fIl\\fHT\\fHn\\fH{\\fIl\\fHH\\fHp\\fHR\\fHc\\fH{\\fHR\\fHY\\fHS\\fHA\\fHR\\fH{\\fHt\\fHO\\fIa\\fHs\\fIk\\fHJ\\fIn\\fHT\\fH\\\\\\fIk\\fHJ\\fHS\\fHD\\fIg\\fHn\\fHU\\fHH\\fIa\\fHC\\fHR\\fHT\\fIk\\fHy\\fIa\\fHT\\fH{\\fHR\\fHn\\fHK\\fIl\\fHY\\fHS\\fHZ\\fIa\\fHY\\fH\\\\\\fHR\\fHH\\fIk\\fHn\\fHJ\\fId\\fHs\\fIa\\fHT\\fHD\\fHy\\fIa\\fHZ\\fHR\\fHT\\fHR\\fHB\\fHD\\fIk\\fHi\\fHJ\\fHR\\fH^\\fHH\\fH@\\fHS\\fHp\\fH^\\fIl\\fHF\\fIm\\fH\\\\\\fIn\\fH[\\fHU\\fHS\\fHn\\fHJ\\fIl\\fHB\\fHS\\fHH\\fIa\\fH\\\\\\fHy\\fHY\\fHS\\fHH\\fHR\\fH\\\\\\fIm\\fHF\\fHC\\fIk\\fHT\\fIa\\fHI\\fHR\\fHD\\fHy\\fH\\\\\\fIg\\fHM\\fHP\\fHB\\fIm\\fHy\\fIa\\fHH\\fHC\\fIg\\fHp\\fHD\\fHR\\fHy\\fIo\\fHF\\fHC\\fHR\\fHF\\fIg\\fHT\\fIa\\fHs\\fHt\\fH\\\\\\fIk\\fH^\\fIn\\fHy\\fHR\\fH\\\\\\fIa\\fHC\\fHY\\fHS\\fHv\\fHR\\fH\\\\\\fHT\\fIn\\fHv\\fHD\\fHR\\fHB\\fIn\\fH^\\fIa\\fHC\\fHJ\\fIk\\fHz\\fIk\\fHn\\fHU\\fHB\\fIk\\fHZ\\fHR\\fHT\\fIa\\fHy\\fIn\\fH^\\fHB\\fId\\fHn\\fHD\\fIk\\fHH\\fId\\fHC\\fHR\\fH\\\\\\fHp\\fHS\\fHT\\fHy\\fIkqpp({no!#wjwof>!.wzsf!#`lmwfmw>!wjwof!#`lmwfmw>!bw#wkf#pbnf#wjnf-ip!=?,p`qjsw=\\t?!#nfwklg>!slpw!#?,psbm=?,b=?,oj=ufqwj`bo.bojdm9w,irvfqz-njm-ip!=-`oj`h+evm`wjlm+#pwzof>!sbggjmd.~*+*8\\t?,p`qjsw=\\t?,psbm=?b#kqfe>!?b#kqfe>!kwws9,,*8#qfwvqm#ebopf8wf{w.gf`lqbwjlm9#p`qloojmd>!ml!#alqgfq.`loobspf9bppl`jbwfg#tjwk#Abkbpb#JmglmfpjbFmdojpk#obmdvbdf?wf{w#{no9psb`f>-dje!#alqgfq>!3!?,algz=\\t?,kwno=\\tlufqeolt9kjggfm8jnd#pq`>!kwws9,,bggFufmwOjpwfmfqqfpslmpjaof#elq#p-ip!=?,p`qjsw=\\t,ebuj`lm-j`l!#,=lsfqbwjmd#pzpwfn!#pwzof>!tjgwk92wbqdfw>!\\\\aobmh!=Pwbwf#Vmjufqpjwzwf{w.bojdm9ofew8\\tgl`vnfmw-tqjwf+/#jm`ovgjmd#wkf#bqlvmg#wkf#tlqog*8\\x0E\\t?,p`qjsw=\\x0E\\t?!#pwzof>!kfjdkw98lufqeolt9kjggfmnlqf#jmelqnbwjlmbm#jmwfqmbwjlmbob#nfnafq#le#wkf#lmf#le#wkf#ejqpw`bm#af#elvmg#jm#?,gju=\\t\\n\\n?,gju=\\tgjpsobz9#mlmf8!=!#,=\\t?ojmh#qfo>!\\t##+evm`wjlm+*#xwkf#26wk#`fmwvqz-sqfufmwGfebvow+obqdf#mvnafq#le#Azybmwjmf#Fnsjqf-isd\\x7Fwkvna\\x7Fofew\\x7Fubpw#nbilqjwz#lenbilqjwz#le#wkf##bojdm>!`fmwfq!=Vmjufqpjwz#Sqfppglnjmbwfg#az#wkfPf`lmg#Tlqog#Tbqgjpwqjavwjlm#le#pwzof>!slpjwjlm9wkf#qfpw#le#wkf#`kbqb`wfqjyfg#az#qfo>!mleloolt!=gfqjufp#eqln#wkfqbwkfq#wkbm#wkf#b#`lnajmbwjlm#lepwzof>!tjgwk9233Fmdojpk.psfbhjmd`lnsvwfq#p`jfm`falqgfq>!3!#bow>!wkf#f{jpwfm`f#leGfnl`qbwj`#Sbqwz!#pwzof>!nbqdjm.Elq#wkjp#qfbplm/-ip!=?,p`qjsw=\\t\\npAzWbdMbnf+p*X3^ip!=?,p`qjsw=\\x0E\\t?-ip!=?,p`qjsw=\\x0E\\tojmh#qfo>!j`lm!#$#bow>$$#`obpp>$elqnbwjlm#le#wkfufqpjlmp#le#wkf#?,b=?,gju=?,gju=,sbdf=\\t##?sbdf=\\t?gju#`obpp>!`lmwaf`bnf#wkf#ejqpwabkbpb#Jmglmfpjbfmdojpk#+pjnsof*\"y\"W\"W\"[\"Q\"U\"V\"@=i=l<^<\\\\=n=m<V<T<V<R<P<S<\\\\<Q<T<T=c<^<W=c<Y=n=m=c<x<R<]<\\\\<^<T=n=`=k<Y<W<R<^<Y<V<\\\\=l<\\\\<[<^<T=n<T=c<t<Q=n<Y=l<Q<Y=n<r=n<^<Y=n<T=n=`<Q<\\\\<S=l<T<P<Y=l<T<Q=n<Y=l<Q<Y=n<V<R=n<R=l<R<_<R=m=n=l<\\\\<Q<T=j=g<V<\\\\=k<Y=m=n<^<Y=o=m<W<R<^<T=c=i<S=l<R<]<W<Y<P=g<S<R<W=o=k<T=n=`=c<^<W=c=b=n=m=c<Q<\\\\<T<]<R<W<Y<Y<V<R<P<S<\\\\<Q<T=c<^<Q<T<P<\\\\<Q<T<Y=m=l<Y<X=m=n<^<\\\\4K5h5i5d4K4Z5f4U4K5h4]4J5f4_5f4E4K5h4K5j4F5n4K5h5i4X4K4]5o4K4F5o4K5h4_5f4K4]4K4F4K5h5i5o4F5d4D4E4K5h4_4U5d4C5f4E4K4A4Y4K4J5f4K4F4K5h4U4K5h5i5f4E4K5h4Y5d4F5f4K4F4K5h4K5j4F4]5j4F4K5h4F4Y4K5i5f5i4K5h4I4_5h4K5i5f4K5h5i4X4K4]5o4E4K5h5i4]4J5f4K4Fqlalwp!#`lmwfmw>!?gju#jg>!ellwfq!=wkf#Vmjwfg#Pwbwfp?jnd#pq`>!kwws9,,-isd\\x7Fqjdkw\\x7Fwkvna\\x7F-ip!=?,p`qjsw=\\x0E\\t?ol`bwjlm-sqlwl`loeqbnfalqgfq>!3!#p!#,=\\t?nfwb#mbnf>!?,b=?,gju=?,gju=?elmw.tfjdkw9alog8%rvlw8#bmg#%rvlw8gfsfmgjmd#lm#wkf#nbqdjm938sbggjmd9!#qfo>!mleloolt!#Sqfpjgfmw#le#wkf#wtfmwjfwk#`fmwvqzfujpjlm=\\t##?,sbdfJmwfqmfw#F{solqfqb-bpzm`#>#wqvf8\\x0E\\tjmelqnbwjlm#balvw?gju#jg>!kfbgfq!=!#b`wjlm>!kwws9,,?b#kqfe>!kwwsp9,,?gju#jg>!`lmwfmw!?,gju=\\x0E\\t?,gju=\\x0E\\t?gfqjufg#eqln#wkf#?jnd#pq`>$kwws9,,b``lqgjmd#wl#wkf#\\t?,algz=\\t?,kwno=\\tpwzof>!elmw.pjyf9p`qjsw#obmdvbdf>!Bqjbo/#Kfoufwj`b/?,b=?psbm#`obpp>!?,p`qjsw=?p`qjsw#slojwj`bo#sbqwjfpwg=?,wq=?,wbaof=?kqfe>!kwws9,,ttt-jmwfqsqfwbwjlm#leqfo>!pwzofpkffw!#gl`vnfmw-tqjwf+$?`kbqpfw>!vwe.;!=\\tafdjmmjmd#le#wkf#qfufbofg#wkbw#wkfwfofujpjlm#pfqjfp!#qfo>!mleloolt!=#wbqdfw>!\\\\aobmh!=`objnjmd#wkbw#wkfkwws&0B&1E&1Ettt-nbmjefpwbwjlmp#leSqjnf#Njmjpwfq#lejmeovfm`fg#az#wkf`obpp>!`ofbqej{!=,gju=\\x0E\\t?,gju=\\x0E\\t\\x0E\\twkqff.gjnfmpjlmbo@kvq`k#le#Fmdobmgle#Mlqwk#@bqlojmbprvbqf#hjolnfwqfp-bggFufmwOjpwfmfqgjpwjm`w#eqln#wkf`lnnlmoz#hmltm#bpSklmfwj`#Boskbafwgf`obqfg#wkbw#wkf`lmwqloofg#az#wkfAfmibnjm#Eqbmhojmqlof.sobzjmd#dbnfwkf#Vmjufqpjwz#lejm#Tfpwfqm#Fvqlsfsfqplmbo#`lnsvwfqSqlif`w#Dvwfmafqdqfdbqgofpp#le#wkfkbp#affm#sqlslpfgwldfwkfq#tjwk#wkf=?,oj=?oj#`obpp>!jm#plnf#`lvmwqjfpnjm-ip!=?,p`qjsw=le#wkf#slsvobwjlmleej`jbo#obmdvbdf?jnd#pq`>!jnbdfp,jgfmwjejfg#az#wkfmbwvqbo#qfplvq`fp`obppjej`bwjlm#le`bm#af#`lmpjgfqfgrvbmwvn#nf`kbmj`pMfufqwkfofpp/#wkfnjoojlm#zfbqp#bdl?,algz=\\x0E\\t?,kwno=\\x0E\"y\"W\"W\"[\"Q\"U\"V\"@\\twbhf#bgubmwbdf#lebmg/#b``lqgjmd#wlbwwqjavwfg#wl#wkfNj`qlplew#Tjmgltpwkf#ejqpw#`fmwvqzvmgfq#wkf#`lmwqlogju#`obpp>!kfbgfqpklqwoz#bewfq#wkfmlwbaof#f{`fswjlmwfmp#le#wklvpbmgppfufqbo#gjeefqfmwbqlvmg#wkf#tlqog-qfb`kjmd#njojwbqzjplobwfg#eqln#wkflsslpjwjlm#wl#wkfwkf#Log#WfpwbnfmwBeqj`bm#Bnfqj`bmpjmpfqwfg#jmwl#wkfpfsbqbwf#eqln#wkfnfwqlslojwbm#bqfbnbhfp#jw#slppjaofb`hmltofgdfg#wkbwbqdvbaoz#wkf#nlpwwzsf>!wf{w,`pp!=\\twkf#JmwfqmbwjlmboB``lqgjmd#wl#wkf#sf>!wf{w,`pp!#,=\\t`ljm`jgf#tjwk#wkfwtl.wkjqgp#le#wkfGvqjmd#wkjp#wjnf/gvqjmd#wkf#sfqjlgbmmlvm`fg#wkbw#kfwkf#jmwfqmbwjlmbobmg#nlqf#qf`fmwozafojfufg#wkbw#wkf`lmp`jlvpmfpp#bmgelqnfqoz#hmltm#bppvqqlvmgfg#az#wkfejqpw#bssfbqfg#jml``bpjlmbooz#vpfgslpjwjlm9baplovwf8!#wbqdfw>!\\\\aobmh!#slpjwjlm9qfobwjuf8wf{w.bojdm9`fmwfq8ib{,ojap,irvfqz,2-ab`hdqlvmg.`lolq9 wzsf>!bssoj`bwjlm,bmdvbdf!#`lmwfmw>!?nfwb#kwws.frvju>!Sqjub`z#Sloj`z?,b=f+!&0@p`qjsw#pq`>$!#wbqdfw>!\\\\aobmh!=Lm#wkf#lwkfq#kbmg/-isd\\x7Fwkvna\\x7Fqjdkw\\x7F1?,gju=?gju#`obpp>!?gju#pwzof>!eolbw9mjmfwffmwk#`fmwvqz?,algz=\\x0E\\t?,kwno=\\x0E\\t?jnd#pq`>!kwws9,,p8wf{w.bojdm9`fmwfqelmw.tfjdkw9#alog8#B``lqgjmd#wl#wkf#gjeefqfm`f#afwtffm!#eqbnfalqgfq>!3!#!#pwzof>!slpjwjlm9ojmh#kqfe>!kwws9,,kwno7,ollpf-gwg!=\\tgvqjmd#wkjp#sfqjlg?,wg=?,wq=?,wbaof=`olpfoz#qfobwfg#wlelq#wkf#ejqpw#wjnf8elmw.tfjdkw9alog8jmsvw#wzsf>!wf{w!#?psbm#pwzof>!elmw.lmqfbgzpwbwf`kbmdf\\n?gju#`obpp>!`ofbqgl`vnfmw-ol`bwjlm-#Elq#f{bnsof/#wkf#b#tjgf#ubqjfwz#le#?\"GL@WZSF#kwno=\\x0E\\t?%maps8%maps8%maps8!=?b#kqfe>!kwws9,,pwzof>!eolbw9ofew8`lm`fqmfg#tjwk#wkf>kwws&0B&1E&1Ettt-jm#slsvobq#`vowvqfwzsf>!wf{w,`pp!#,=jw#jp#slppjaof#wl#Kbqubqg#Vmjufqpjwzwzofpkffw!#kqfe>!,wkf#nbjm#`kbqb`wfqL{elqg#Vmjufqpjwz##mbnf>!hfztlqgp!#`pwzof>!wf{w.bojdm9wkf#Vmjwfg#Hjmdglnefgfqbo#dlufqmnfmw?gju#pwzof>!nbqdjm#gfsfmgjmd#lm#wkf#gfp`qjswjlm#le#wkf?gju#`obpp>!kfbgfq-njm-ip!=?,p`qjsw=gfpwqv`wjlm#le#wkfpojdkwoz#gjeefqfmwjm#b``lqgbm`f#tjwkwfof`lnnvmj`bwjlmpjmgj`bwfp#wkbw#wkfpklqwoz#wkfqfbewfqfpsf`jbooz#jm#wkf#Fvqlsfbm#`lvmwqjfpKltfufq/#wkfqf#bqfpq`>!kwws9,,pwbwj`pvddfpwfg#wkbw#wkf!#pq`>!kwws9,,ttt-b#obqdf#mvnafq#le#Wfof`lnnvmj`bwjlmp!#qfo>!mleloolt!#wKloz#Qlnbm#Fnsfqlqbonlpw#f{`ovpjufoz!#alqgfq>!3!#bow>!Pf`qfwbqz#le#Pwbwf`vonjmbwjmd#jm#wkf@JB#Tlqog#Eb`wallhwkf#nlpw#jnslqwbmwbmmjufqpbqz#le#wkfpwzof>!ab`hdqlvmg.?oj=?fn=?b#kqfe>!,wkf#Bwobmwj`#L`fbmpwqj`woz#psfbhjmd/pklqwoz#afelqf#wkfgjeefqfmw#wzsfp#lewkf#Lwwlnbm#Fnsjqf=?jnd#pq`>!kwws9,,Bm#Jmwqlgv`wjlm#wl`lmpfrvfm`f#le#wkfgfsbqwvqf#eqln#wkf@lmefgfqbwf#Pwbwfpjmgjdfmlvp#sflsofpSql`ffgjmdp#le#wkfjmelqnbwjlm#lm#wkfwkflqjfp#kbuf#affmjmuloufnfmw#jm#wkfgjujgfg#jmwl#wkqffbgib`fmw#`lvmwqjfpjp#qfpslmpjaof#elqgjpplovwjlm#le#wkf`loobalqbwjlm#tjwktjgfoz#qfdbqgfg#bpkjp#`lmwfnslqbqjfpelvmgjmd#nfnafq#leGlnjmj`bm#Qfsvaoj`dfmfqbooz#b``fswfgwkf#slppjajojwz#lebqf#bopl#bubjobaofvmgfq#`lmpwqv`wjlmqfpwlqbwjlm#le#wkfwkf#dfmfqbo#svaoj`jp#bonlpw#fmwjqfozsbppfp#wkqlvdk#wkfkbp#affm#pvddfpwfg`lnsvwfq#bmg#ujgflDfqnbmj`#obmdvbdfp#b``lqgjmd#wl#wkf#gjeefqfmw#eqln#wkfpklqwoz#bewfqtbqgpkqfe>!kwwsp9,,ttt-qf`fmw#gfufolsnfmwAlbqg#le#Gjqf`wlqp?gju#`obpp>!pfbq`k\\x7F#?b#kqfe>!kwws9,,Jm#sbqwj`vobq/#wkfNvowjsof#ellwmlwfplq#lwkfq#pvapwbm`fwklvpbmgp#le#zfbqpwqbmpobwjlm#le#wkf?,gju=\\x0E\\t?,gju=\\x0E\\t\\x0E\\t?b#kqfe>!jmgf{-skstbp#fpwbaojpkfg#jmnjm-ip!=?,p`qjsw=\\tsbqwj`jsbwf#jm#wkfb#pwqlmd#jmeovfm`fpwzof>!nbqdjm.wls9qfsqfpfmwfg#az#wkfdqbgvbwfg#eqln#wkfWqbgjwjlmbooz/#wkfFofnfmw+!p`qjsw!*8Kltfufq/#pjm`f#wkf,gju=\\t?,gju=\\t?gju#ofew8#nbqdjm.ofew9sqlwf`wjlm#bdbjmpw38#ufqwj`bo.bojdm9Vmelqwvmbwfoz/#wkfwzsf>!jnbdf,{.j`lm,gju=\\t?gju#`obpp>!#`obpp>!`ofbqej{!=?gju#`obpp>!ellwfq\\n\\n?,gju=\\t\\n\\n?,gju=\\twkf#nlwjlm#sj`wvqf<}=f<W<_<\\\\=l=m<V<T<]=f<W<_<\\\\=l=m<V<T<H<Y<X<Y=l<\\\\=j<T<T<Q<Y=m<V<R<W=`<V<R=m<R<R<]=e<Y<Q<T<Y=m<R<R<]=e<Y<Q<T=c<S=l<R<_=l<\\\\<P<P=g<r=n<S=l<\\\\<^<T=n=`<]<Y=m<S<W<\\\\=n<Q<R<P<\\\\=n<Y=l<T<\\\\<W=g<S<R<[<^<R<W=c<Y=n<S<R=m<W<Y<X<Q<T<Y=l<\\\\<[<W<T=k<Q=g=i<S=l<R<X=o<V=j<T<T<S=l<R<_=l<\\\\<P<P<\\\\<S<R<W<Q<R=m=n=`=b<Q<\\\\=i<R<X<T=n=m=c<T<[<]=l<\\\\<Q<Q<R<Y<Q<\\\\=m<Y<W<Y<Q<T=c<T<[<P<Y<Q<Y<Q<T=c<V<\\\\=n<Y<_<R=l<T<T<|<W<Y<V=m<\\\\<Q<X=l\\fHJ\\fIa\\fHY\\fHR\\fH\\\\\\fHR\\fHB\\fId\\fHD\\fIm\\fHi\\fH^\\fHF\\fIa\\fH\\\\\\fHJ\\fHR\\fHD\\fHA\\fHR\\fH\\\\\\fHH\\fIl\\fHC\\fHi\\fHD\\fIm\\fHJ\\fIk\\fHZ\\fHU\\fHS\\fHD\\fIa\\fHJ\\fIl\\fHk\\fHn\\fHM\\fHS\\fHC\\fHR\\fHJ\\fHS\\fH^\\fIa\\fH^\\fIl\\fHi\\fHK\\fHS\\fHy\\fHR\\fH\\\\\\fHY\\fIl\\fHM\\fHS\\fHC\\fIg\\fHv\\fHS\\fHs\\fIa\\fHL\\fIk\\fHT\\fHB\\fHR\\fHv\\fHR\\fH\\\\\\fHp\\fHn\\fHy\\fIa\\fHZ\\fHD\\fHJ\\fIm\\fHD\\fHS\\fHC\\fHR\\fHF\\fIa\\fH\\\\\\fHC\\fIg\\fH{\\fHi\\fHD\\fIm\\fHT\\fHR\\fH\\\\\\fH}\\fHD\\fH^\\fHR\\fHk\\fHD\\fHF\\fHR\\fH\\\\\\fIa\\fHs\\fIl\\fHZ\\fH\\\\\\fIa\\fHH\\fIg\\fHn\\fH^\\fIg\\fHy\\fHT\\fHA\\fHR\\fHG\\fHP\\fIa\\fH^\\fId\\fHZ\\fHZ\\fH\\\\\\fIa\\fHH\\fIk\\fHn\\fHF\\fIa\\fH\\\\\\fHJ\\fIk\\fHZ\\fHF\\fIa\\fH^\\fIk\\fHC\\fH\\\\\\fHy\\fIk\\fHn\\fHJ\\fIa\\fH\\\\\\fHT\\fIa\\fHI\\fHS\\fHH\\fHS\\fHe\\fHH\\fIa\\fHF\\fHR\\fHJ\\fHe\\fHD\\fIa\\fHU\\fIk\\fHn\\fHv\\fHS\\fHs\\fIa\\fHL\\fHR\\fHC\\fHR\\fHH\\fIa\\fH\\\\\\fHR\\fHp\\fIa\\fHC\\fHR\\fHJ\\fHR\\fHF\\fIm\\fH\\\\\\fHR\\fHD\\fIk\\fHp\\fIg\\fHM\\fHP\\fIk\\fHn\\fHi\\fHD\\fIm\\fHY\\fHR\\fHJ\\fHZ\\fIa\\fH\\\\\\fIk\\fHO\\fIl\\fHZ\\fHS\\fHy\\fIa\\fH[\\fHR\\fHT\\fH\\\\\\fHy\\fHR\\fH\\\\\\fIl\\fHT\\fHn\\fH{\\fIa\\fH\\\\\\fHU\\fHF\\fH\\\\\\fHS\\fHO\\fHR\\fHB\\fH@\\fIa\\fH\\\\\\fHR\\fHn\\fHM\\fH@\\fHv\\fIa\\fHv\\fIg\\fHn\\fHe\\fHF\\fH^\\fH@\\fIa\\fHK\\fHB\\fHn\\fHH\\fIa\\fH\\\\\\fIl\\fHT\\fHn\\fHF\\fH\\\\\\fIa\\fHy\\fHe\\fHB\\fIa\\fHB\\fIl\\fHJ\\fHB\\fHR\\fHK\\fIa\\fHC\\fHB\\fHT\\fHU\\fHR\\fHC\\fHH\\fHR\\fHZ\\fH@\\fIa\\fHJ\\fIg\\fHn\\fHB\\fIl\\fHM\\fHS\\fHC\\fHR\\fHj\\fHd\\fHF\\fIl\\fHc\\fH^\\fHB\\fIg\\fH@\\fHR\\fHk\\fH^\\fHT\\fHn\\fHz\\fIa\\fHC\\fHR\\fHj\\fHF\\fH\\\\\\fIk\\fHZ\\fHD\\fHi\\fHD\\fIm\\fH@\\fHn\\fHK\\fH@\\fHR\\fHp\\fHP\\fHR\\fH\\\\\\fHD\\fHY\\fIl\\fHD\\fHH\\fHB\\fHF\\fIa\\fH\\\\\\fHB\\fIm\\fHz\\fHF\\fIa\\fH\\\\\\fHZ\\fIa\\fHD\\fHF\\fH\\\\\\fHS\\fHY\\fHR\\fH\\\\\\fHD\\fIm\\fHy\\fHT\\fHR\\fHD\\fHT\\fHB\\fH\\\\\\fIa\\fHI\\fHD\\fHj\\fHC\\fIg\\fHp\\fHS\\fHH\\fHT\\fIg\\fHB\\fHY\\fHR\\fH\\\\4K5h5i4X4K4]5o4K4F4K5h5i5j4F4C5f4K4F4K5h5o5i4D5f5d4F4]4K5h5i4X4K5k4C4K4F4U4C4C4K5h4^5d4K4]4U4C4C4K5h4]4C5d4C4K5h4I4_5h4K5i5f4E4K5h5m5d4F5d4X5d4D4K5h5i4_4K4D5n4K4F4K5h5i4U5h5d5i4K4F4K5h5i4_5h4_5h4K4F4K5h4@4]4K5m5f5o4_4K5h4K4_5h4K5i5f4E4K5h4K4F4Y4K5h4K4Fhfztlqgp!#`lmwfmw>!t0-lqd,2:::,{kwno!=?b#wbqdfw>!\\\\aobmh!#wf{w,kwno8#`kbqpfw>!#wbqdfw>!\\\\aobmh!=?wbaof#`foosbggjmd>!bvwl`lnsofwf>!lee!#wf{w.bojdm9#`fmwfq8wl#obpw#ufqpjlm#az#ab`hdqlvmg.`lolq9# !#kqfe>!kwws9,,ttt-,gju=?,gju=?gju#jg>?b#kqfe>! !#`obpp>!!=?jnd#pq`>!kwws9,,`qjsw!#pq`>!kwws9,,\\t?p`qjsw#obmdvbdf>!,,FM!#!kwws9,,ttt-tfm`lgfVQJ@lnslmfmw+!#kqfe>!ibubp`qjsw9?gju#`obpp>!`lmwfmwgl`vnfmw-tqjwf+$?p`slpjwjlm9#baplovwf8p`qjsw#pq`>!kwws9,,#pwzof>!nbqdjm.wls9-njm-ip!=?,p`qjsw=\\t?,gju=\\t?gju#`obpp>!t0-lqd,2:::,{kwno!#\\t\\x0E\\t?,algz=\\x0E\\t?,kwno=gjpwjm`wjlm#afwtffm,!#wbqdfw>!\\\\aobmh!=?ojmh#kqfe>!kwws9,,fm`lgjmd>!vwe.;!<=\\tt-bggFufmwOjpwfmfq<b`wjlm>!kwws9,,ttt-j`lm!#kqfe>!kwws9,,#pwzof>!ab`hdqlvmg9wzsf>!wf{w,`pp!#,=\\tnfwb#sqlsfqwz>!ld9w?jmsvw#wzsf>!wf{w!##pwzof>!wf{w.bojdm9wkf#gfufolsnfmw#le#wzofpkffw!#wzsf>!wfkwno8#`kbqpfw>vwe.;jp#`lmpjgfqfg#wl#afwbaof#tjgwk>!233&!#Jm#bggjwjlm#wl#wkf#`lmwqjavwfg#wl#wkf#gjeefqfm`fp#afwtffmgfufolsnfmw#le#wkf#Jw#jp#jnslqwbmw#wl#?,p`qjsw=\\t\\t?p`qjsw##pwzof>!elmw.pjyf92=?,psbm=?psbm#jg>daOjaqbqz#le#@lmdqfpp?jnd#pq`>!kwws9,,jnFmdojpk#wqbmpobwjlmB`bgfnz#le#P`jfm`fpgju#pwzof>!gjpsobz9`lmpwqv`wjlm#le#wkf-dfwFofnfmwAzJg+jg*jm#`lmivm`wjlm#tjwkFofnfmw+$p`qjsw$*8#?nfwb#sqlsfqwz>!ld9<}=f<W<_<\\\\=l=m<V<T\\t#wzsf>!wf{w!#mbnf>!=Sqjub`z#Sloj`z?,b=bgnjmjpwfqfg#az#wkffmbaofPjmdofQfrvfpwpwzof>%rvlw8nbqdjm9?,gju=?,gju=?,gju=?=?jnd#pq`>!kwws9,,j#pwzof>%rvlw8eolbw9qfefqqfg#wl#bp#wkf#wlwbo#slsvobwjlm#lejm#Tbpkjmdwlm/#G-@-#pwzof>!ab`hdqlvmg.bnlmd#lwkfq#wkjmdp/lqdbmjybwjlm#le#wkfsbqwj`jsbwfg#jm#wkfwkf#jmwqlgv`wjlm#lejgfmwjejfg#tjwk#wkfej`wjlmbo#`kbqb`wfq#L{elqg#Vmjufqpjwz#njpvmgfqpwbmgjmd#leWkfqf#bqf/#kltfufq/pwzofpkffw!#kqfe>!,@lovnajb#Vmjufqpjwzf{sbmgfg#wl#jm`ovgfvpvbooz#qfefqqfg#wljmgj`bwjmd#wkbw#wkfkbuf#pvddfpwfg#wkbwbeejojbwfg#tjwk#wkf`lqqfobwjlm#afwtffmmvnafq#le#gjeefqfmw=?,wg=?,wq=?,wbaof=Qfsvaoj`#le#Jqfobmg\\t?,p`qjsw=\\t?p`qjsw#vmgfq#wkf#jmeovfm`f`lmwqjavwjlm#wl#wkfLeej`jbo#tfapjwf#lekfbgrvbqwfqp#le#wkf`fmwfqfg#bqlvmg#wkfjnsoj`bwjlmp#le#wkfkbuf#affm#gfufolsfgEfgfqbo#Qfsvaoj`#leaf`bnf#jm`qfbpjmdoz`lmwjmvbwjlm#le#wkfMlwf/#kltfufq/#wkbwpjnjobq#wl#wkbw#le#`bsbajojwjfp#le#wkfb``lqgbm`f#tjwk#wkfsbqwj`jsbmwp#jm#wkfevqwkfq#gfufolsnfmwvmgfq#wkf#gjqf`wjlmjp#lewfm#`lmpjgfqfgkjp#zlvmdfq#aqlwkfq?,wg=?,wq=?,wbaof=?b#kwws.frvju>![.VB.skzpj`bo#sqlsfqwjfple#Aqjwjpk#@lovnajbkbp#affm#`qjwj`jyfg+tjwk#wkf#f{`fswjlmrvfpwjlmp#balvw#wkfsbppjmd#wkqlvdk#wkf3!#`foosbggjmd>!3!#wklvpbmgp#le#sflsofqfgjqf`wp#kfqf-#Elqkbuf#`kjogqfm#vmgfq&0F&0@,p`qjsw&0F!**8?b#kqfe>!kwws9,,ttt-?oj=?b#kqfe>!kwws9,,pjwf\\\\mbnf!#`lmwfmw>!wf{w.gf`lqbwjlm9mlmfpwzof>!gjpsobz9#mlmf?nfwb#kwws.frvju>![.mft#Gbwf+*-dfwWjnf+*#wzsf>!jnbdf,{.j`lm!?,psbm=?psbm#`obpp>!obmdvbdf>!ibubp`qjswtjmglt-ol`bwjlm-kqfe?b#kqfe>!ibubp`qjsw9..=\\x0E\\t?p`qjsw#wzsf>!w?b#kqfe>$kwws9,,ttt-klqw`vw#j`lm!#kqfe>!?,gju=\\x0E\\t?gju#`obpp>!?p`qjsw#pq`>!kwws9,,!#qfo>!pwzofpkffw!#w?,gju=\\t?p`qjsw#wzsf>,b=#?b#kqfe>!kwws9,,#booltWqbmpsbqfm`z>![.VB.@lnsbwjaof!#`lmqfobwjlmpkjs#afwtffm\\t?,p`qjsw=\\x0E\\t?p`qjsw#?,b=?,oj=?,vo=?,gju=bppl`jbwfg#tjwk#wkf#sqldqbnnjmd#obmdvbdf?,b=?b#kqfe>!kwws9,,?,b=?,oj=?oj#`obpp>!elqn#b`wjlm>!kwws9,,?gju#pwzof>!gjpsobz9wzsf>!wf{w!#mbnf>!r!?wbaof#tjgwk>!233&!#ab`hdqlvmg.slpjwjlm9!#alqgfq>!3!#tjgwk>!qfo>!pklqw`vw#j`lm!#k5=?vo=?oj=?b#kqfe>!##?nfwb#kwws.frvju>!`pp!#nfgjb>!p`qffm!#qfpslmpjaof#elq#wkf#!#wzsf>!bssoj`bwjlm,!#pwzof>!ab`hdqlvmg.kwno8#`kbqpfw>vwe.;!#booltwqbmpsbqfm`z>!pwzofpkffw!#wzsf>!wf\\x0E\\t?nfwb#kwws.frvju>!=?,psbm=?psbm#`obpp>!3!#`foopsb`jmd>!3!=8\\t?,p`qjsw=\\t?p`qjsw#plnfwjnfp#`boofg#wkfglfp#mlw#mf`fppbqjozElq#nlqf#jmelqnbwjlmbw#wkf#afdjmmjmd#le#?\"GL@WZSF#kwno=?kwnosbqwj`vobqoz#jm#wkf#wzsf>!kjggfm!#mbnf>!ibubp`qjsw9uljg+3*8!feef`wjufmfpp#le#wkf#bvwl`lnsofwf>!lee!#dfmfqbooz#`lmpjgfqfg=?jmsvw#wzsf>!wf{w!#!=?,p`qjsw=\\x0E\\t?p`qjswwkqlvdklvw#wkf#tlqog`lnnlm#njp`lm`fswjlmbppl`jbwjlm#tjwk#wkf?,gju=\\t?,gju=\\t?gju#`gvqjmd#kjp#ojefwjnf/`lqqfpslmgjmd#wl#wkfwzsf>!jnbdf,{.j`lm!#bm#jm`qfbpjmd#mvnafqgjsolnbwj`#qfobwjlmpbqf#lewfm#`lmpjgfqfgnfwb#`kbqpfw>!vwe.;!#?jmsvw#wzsf>!wf{w!#f{bnsofp#jm`ovgf#wkf!=?jnd#pq`>!kwws9,,jsbqwj`jsbwjlm#jm#wkfwkf#fpwbaojpknfmw#le\\t?,gju=\\t?gju#`obpp>!%bns8maps8%bns8maps8wl#gfwfqnjmf#tkfwkfqrvjwf#gjeefqfmw#eqlnnbqhfg#wkf#afdjmmjmdgjpwbm`f#afwtffm#wkf`lmwqjavwjlmp#wl#wkf`lmeoj`w#afwtffm#wkftjgfoz#`lmpjgfqfg#wltbp#lmf#le#wkf#ejqpwtjwk#ubqzjmd#gfdqffpkbuf#psf`vobwfg#wkbw+gl`vnfmw-dfwFofnfmwsbqwj`jsbwjmd#jm#wkflqjdjmbooz#gfufolsfgfwb#`kbqpfw>!vwe.;!=#wzsf>!wf{w,`pp!#,=\\tjmwfq`kbmdfbaoz#tjwknlqf#`olpfoz#qfobwfgpl`jbo#bmg#slojwj`bowkbw#tlvog#lwkfqtjpfsfqsfmgj`vobq#wl#wkfpwzof#wzsf>!wf{w,`ppwzsf>!pvanjw!#mbnf>!ebnjojfp#qfpjgjmd#jmgfufolsjmd#`lvmwqjfp`lnsvwfq#sqldqbnnjmdf`lmlnj`#gfufolsnfmwgfwfqnjmbwjlm#le#wkfelq#nlqf#jmelqnbwjlmlm#pfufqbo#l``bpjlmpslqwvdv/Fp#+Fvqlsfv*<O<V=l<\\\\={<Q=m=`<V<\\\\=o<V=l<\\\\={<Q=m=`<V<\\\\<L<R=m=m<T<U=m<V<R<U<P<\\\\=n<Y=l<T<\\\\<W<R<^<T<Q=h<R=l<P<\\\\=j<T<T=o<S=l<\\\\<^<W<Y<Q<T=c<Q<Y<R<]=i<R<X<T<P<R<T<Q=h<R=l<P<\\\\=j<T=c<t<Q=h<R=l<P<\\\\=j<T=c<L<Y=m<S=o<]<W<T<V<T<V<R<W<T=k<Y=m=n<^<R<T<Q=h<R=l<P<\\\\=j<T=b=n<Y=l=l<T=n<R=l<T<T<X<R=m=n<\\\\=n<R=k<Q<R4K5h5i4F5d4K4@4C5d5j4K5h4K4X4F4]4K5o4K4F4K5h4K5n4F4]4K4A4K4Fkwno8#`kbqpfw>VWE.;!#pfwWjnflvw+evm`wjlm+*gjpsobz9jmojmf.aol`h8?jmsvw#wzsf>!pvanjw!#wzsf#>#$wf{w,ibubp`qj?jnd#pq`>!kwws9,,ttt-!#!kwws9,,ttt-t0-lqd,pklqw`vw#j`lm!#kqfe>!!#bvwl`lnsofwf>!lee!#?,b=?,gju=?gju#`obpp>?,b=?,oj=\\t?oj#`obpp>!`pp!#wzsf>!wf{w,`pp!#?elqn#b`wjlm>!kwws9,,{w,`pp!#kqfe>!kwws9,,ojmh#qfo>!bowfqmbwf!#\\x0E\\t?p`qjsw#wzsf>!wf{w,#lm`oj`h>!ibubp`qjsw9+mft#Gbwf*-dfwWjnf+*~kfjdkw>!2!#tjgwk>!2!#Sflsof$p#Qfsvaoj`#le##?b#kqfe>!kwws9,,ttt-wf{w.gf`lqbwjlm9vmgfqwkf#afdjmmjmd#le#wkf#?,gju=\\t?,gju=\\t?,gju=\\tfpwbaojpknfmw#le#wkf#?,gju=?,gju=?,gju=?,g ujftslqwxnjm.kfjdkw9\\t?p`qjsw#pq`>!kwws9,,lswjlm=?lswjlm#ubovf>lewfm#qfefqqfg#wl#bp#,lswjlm=\\t?lswjlm#ubov?\"GL@WZSF#kwno=\\t?\"..XJmwfqmbwjlmbo#Bjqslqw=\\t?b#kqfe>!kwws9,,ttt?,b=?b#kqfe>!kwws9,,t\\fTL\\fT^\\fTE\\fT^\\fUh\\fT{\\fTN\\roI\\ro|\\roL\\ro{\\roO\\rov\\rot\\nAO\\x05Gx\\bTA\\nzk#+\\x0BUm\\x05Gx*\\fHD\\fHS\\fH\\\\\\fIa\\fHJ\\fIk\\fHZ\\fHM\\fHR\\fHe\\fHD\\fH^\\fIg\\fHM\\fHy\\fIa\\fH[\\fIk\\fHH\\fIa\\fH\\\\\\fHp\\fHR\\fHD\\fHy\\fHR\\fH\\\\\\fIl\\fHT\\fHn\\fH@\\fHn\\fHK\\fHS\\fHH\\fHT\\fIa\\fHI\\fHR\\fHF\\fHD\\fHR\\fHT\\fIa\\fHY\\fIl\\fHy\\fHR\\fH\\\\\\fHT\\fHn\\fHT\\fIa\\fHy\\fH\\\\\\fHO\\fHT\\fHR\\fHB\\fH{\\fIa\\fH\\\\\\fIl\\fHv\\fHS\\fHs\\fIa\\fHL\\fIg\\fHn\\fHY\\fHS\\fHp\\fIa\\fHr\\fHR\\fHD\\fHi\\fHB\\fIk\\fH\\\\\\fHS\\fHy\\fHR\\fHY\\fHS\\fHA\\fHS\\fHD\\fIa\\fHD\\fH{\\fHR\\fHM\\fHS\\fHC\\fHR\\fHm\\fHy\\fIa\\fHC\\fIg\\fHn\\fHy\\fHS\\fHT\\fIm\\fH\\\\\\fHy\\fIa\\fH[\\fHR\\fHF\\fHU\\fIm\\fHm\\fHv\\fHH\\fIl\\fHF\\fIa\\fH\\\\\\fH@\\fHn\\fHK\\fHD\\fHs\\fHS\\fHF\\fIa\\fHF\\fHO\\fIl\\fHy\\fIa\\fH\\\\\\fHS\\fHy\\fIk\\fHs\\fHF\\fIa\\fH\\\\\\fHR\\fH\\\\\\fHn\\fHA\\fHF\\fIa\\fH\\\\\\fHR\\fHF\\fIa\\fHH\\fHB\\fHR\\fH^\\fHS\\fHy\\fIg\\fHn\\fH\\\\\\fHG\\fHP\\fIa\\fHH\\fHR\\fH\\\\\\fHD\\fHS\\fH\\\\\\fIa\\fHB\\fHR\\fHO\\fH^\\fHS\\fHB\\fHS\\fHs\\fIk\\fHMgfp`qjswjlm!#`lmwfmw>!gl`vnfmw-ol`bwjlm-sqlw-dfwFofnfmwpAzWbdMbnf+?\"GL@WZSF#kwno=\\t?kwno#?nfwb#`kbqpfw>!vwe.;!=9vqo!#`lmwfmw>!kwws9,,-`pp!#qfo>!pwzofpkffw!pwzof#wzsf>!wf{w,`pp!=wzsf>!wf{w,`pp!#kqfe>!t0-lqd,2:::,{kwno!#{nowzsf>!wf{w,ibubp`qjsw!#nfwklg>!dfw!#b`wjlm>!ojmh#qfo>!pwzofpkffw!##>#gl`vnfmw-dfwFofnfmwwzsf>!jnbdf,{.j`lm!#,=`foosbggjmd>!3!#`foops-`pp!#wzsf>!wf{w,`pp!#?,b=?,oj=?oj=?b#kqfe>!!#tjgwk>!2!#kfjdkw>!2!!=?b#kqfe>!kwws9,,ttt-pwzof>!gjpsobz9mlmf8!=bowfqmbwf!#wzsf>!bssoj.,,T0@,,GWG#[KWNO#2-3#foopsb`jmd>!3!#`foosbg#wzsf>!kjggfm!#ubovf>!,b=%maps8?psbm#qlof>!p\\t?jmsvw#wzsf>!kjggfm!#obmdvbdf>!IbubP`qjsw!##gl`vnfmw-dfwFofnfmwpAd>!3!#`foopsb`jmd>!3!#zsf>!wf{w,`pp!#nfgjb>!wzsf>$wf{w,ibubp`qjsw$tjwk#wkf#f{`fswjlm#le#zsf>!wf{w,`pp!#qfo>!pw#kfjdkw>!2!#tjgwk>!2!#>$(fm`lgfVQJ@lnslmfmw+?ojmh#qfo>!bowfqmbwf!#\\talgz/#wq/#jmsvw/#wf{wnfwb#mbnf>!qlalwp!#`lmnfwklg>!slpw!#b`wjlm>!=\\t?b#kqfe>!kwws9,,ttt-`pp!#qfo>!pwzofpkffw!#?,gju=?,gju=?gju#`obppobmdvbdf>!ibubp`qjsw!=bqjb.kjggfm>!wqvf!=.[?qjsw!#wzsf>!wf{w,ibubpo>38~*+*8\\t+evm`wjlm+*xab`hdqlvmg.jnbdf9#vqo+,b=?,oj=?oj=?b#kqfe>!k\\n\\n?oj=?b#kqfe>!kwws9,,bwlq!#bqjb.kjggfm>!wqv=#?b#kqfe>!kwws9,,ttt-obmdvbdf>!ibubp`qjsw!#,lswjlm=\\t?lswjlm#ubovf,gju=?,gju=?gju#`obpp>qbwlq!#bqjb.kjggfm>!wqf>+mft#Gbwf*-dfwWjnf+*slqwvdv/Fp#+gl#Aqbpjo*<R=l<_<\\\\<Q<T<[<\\\\=j<T<T<^<R<[<P<R<Z<Q<R=m=n=`<R<]=l<\\\\<[<R<^<\\\\<Q<T=c=l<Y<_<T=m=n=l<\\\\=j<T<T<^<R<[<P<R<Z<Q<R=m=n<T<R<]=c<[<\\\\=n<Y<W=`<Q<\\\\?\"GL@WZSF#kwno#SVAOJ@#!mw.Wzsf!#`lmwfmw>!wf{w,?nfwb#kwws.frvju>!@lmwfqbmpjwjlmbo,,FM!#!kwws9?kwno#{nomp>!kwws9,,ttt.,,T0@,,GWG#[KWNO#2-3#WGWG,{kwno2.wqbmpjwjlmbo,,ttt-t0-lqd,WQ,{kwno2,sf#>#$wf{w,ibubp`qjsw$8?nfwb#mbnf>!gfp`qjswjlmsbqfmwMlgf-jmpfqwAfelqf?jmsvw#wzsf>!kjggfm!#mbip!#wzsf>!wf{w,ibubp`qj+gl`vnfmw*-qfbgz+evm`wjp`qjsw#wzsf>!wf{w,ibubpjnbdf!#`lmwfmw>!kwws9,,VB.@lnsbwjaof!#`lmwfmw>wno8#`kbqpfw>vwe.;!#,=\\tojmh#qfo>!pklqw`vw#j`lm?ojmh#qfo>!pwzofpkffw!#?,p`qjsw=\\t?p`qjsw#wzsf>>#gl`vnfmw-`qfbwfFofnfm?b#wbqdfw>!\\\\aobmh!#kqfe>#gl`vnfmw-dfwFofnfmwpAjmsvw#wzsf>!wf{w!#mbnf>b-wzsf#>#$wf{w,ibubp`qjmsvw#wzsf>!kjggfm!#mbnfkwno8#`kbqpfw>vwe.;!#,=gwg!=\\t?kwno#{nomp>!kwws.,,T0@,,GWG#KWNO#7-32#WfmwpAzWbdMbnf+$p`qjsw$*jmsvw#wzsf>!kjggfm!#mbn?p`qjsw#wzsf>!wf{w,ibubp!#pwzof>!gjpsobz9mlmf8!=gl`vnfmw-dfwFofnfmwAzJg+>gl`vnfmw-`qfbwfFofnfmw+$#wzsf>$wf{w,ibubp`qjsw$jmsvw#wzsf>!wf{w!#mbnf>!g-dfwFofnfmwpAzWbdMbnf+pmj`bo!#kqfe>!kwws9,,ttt-@,,GWG#KWNO#7-32#Wqbmpjw?pwzof#wzsf>!wf{w,`pp!=\\t\\t?pwzof#wzsf>!wf{w,`pp!=jlmbo-gwg!=\\t?kwno#{nomp>kwws.frvju>!@lmwfmw.Wzsfgjmd>!3!#`foopsb`jmd>!3!kwno8#`kbqpfw>vwe.;!#,=\\t#pwzof>!gjpsobz9mlmf8!=??oj=?b#kqfe>!kwws9,,ttt-#wzsf>$wf{w,ibubp`qjsw$=<X<Y=c=n<Y<W=`<Q<R=m=n<T=m<R<R=n<^<Y=n=m=n<^<T<T<S=l<R<T<[<^<R<X=m=n<^<\\\\<]<Y<[<R<S<\\\\=m<Q<R=m=n<T\\fHF\\fIm\\fHT\\fIa\\fHH\\fHS\\fHy\\fHR\\fHy\\fHR\\fHn\\fH{\\fIa\\fH\\\\\\fIk\\fHT\\fHe\\fHD\\fIa\\fHU\\fIg\\fHn\\fHD\\fIk\\fHY\\fHS\\fHK\\fHR\\fHD\\fHT\\fHA\\fHR\\fHG\\fHS\\fHy\\fIa\\fHT\\fHS\\fHn\\fH{\\fHT\\fIm\\fH\\\\\\fHy\\fIa\\fH[\\fHS\\fHH\\fHy\\fIe\\fHF\\fIl\\fH\\\\\\fHR\\fHk\\fHs\\fHY\\fHS\\fHp\\fIa\\fHr\\fHR\\fHF\\fHD\\fHy\\fHR\\fH\\\\\\fIa\\fH\\\\\\fHY\\fHR\\fHd\\fHT\\fHy\\fIa\\fH\\\\\\fHS\\fHC\\fHH\\fHR',\n      \"\\u06F7%\\u018C'T%\\x85'W%\\xD7%O%g%\\xA6&\\u0193%\\u01E5&>&*&'&^&\\x88\\u0178\\u0C3E&\\u01AD&\\u0192&)&^&%&'&\\x82&P&1&\\xB1&3&]&m&u&E&t&C&\\xCF&V&V&/&>&6&\\u0F76\\u177Co&p&@&E&M&P&x&@&F&e&\\xCC&7&:&(&D&0&C&)&.&F&-&1&(&L&F&1\\u025E*\\u03EA\\u21F3&\\u1372&K&;&)&E&H&P&0&?&9&V&\\x81&-&v&a&,&E&)&?&=&'&'&B&\\u0D2E&\\u0503&\\u0316*&*8&%&%&&&%,)&\\x9A&>&\\x86&7&]&F&2&>&J&6&n&2&%&?&\\x8E&2&6&J&g&-&0&,&*&J&*&O&)&6&(&<&B&N&.&P&@&2&.&W&M&%\\u053C\\x84(,(<&,&\\u03DA&\\u18C7&-&,(%&(&%&(\\u013B0&X&D&\\x81&j&'&J&(&.&B&3&Z&R&h&3&E&E&<\\xC6-\\u0360\\u1EF3&%8?&@&,&Z&@&0&J&,&^&x&_&6&C&6&C\\u072C\\u2A25&f&-&-&-&-&,&J&2&8&z&8&C&Y&8&-&d&\\u1E78\\xCC-&7&1&F&7&t&W&7&I&.&.&^&=\\u0F9C\\u19D3&8(>&/&/&\\u077B')'\\u1065')'%@/&0&%\\u043E\\u09C0*&*@&C\\u053D\\u05D4\\u0274\\u05EB4\\u0DD7\\u071A\\u04D16\\u0D84&/\\u0178\\u0303Z&*%\\u0246\\u03FF&\\u0134&1\\xA8\\u04B4\\u0174\",\n      dictionarySizeBits,\n      'AAAAKKLLKKKKKJJIHHIHHGGFF'\n    );\n    flipBuffer(dictionaryData);\n    setData(asReadOnlyBuffer(dictionaryData), dictionarySizeBits);\n  }\n\n  /* GENERATED CODE END */\n\n  /**\n   * @param {!number} a\n   * @param {!number} b\n   * @return {!number}\n   */\n  function min(a, b) {\n    return a <= b ? a : b;\n  }\n\n  /**\n   * @param {!Int8Array} dst\n   * @param {!number} target\n   * @param {!Int8Array} src\n   * @param {!number} start\n   * @param {!number} end\n   * @return {void}\n   */\n  function copyBytes(dst, target, src, start, end) {\n    dst.set(src.slice(start, end), target);\n  }\n\n  /**\n   * @param {!InputStream|null} src\n   * @param {!Int8Array} dst\n   * @param {!number} offset\n   * @param {!number} length\n   * @return {!number}\n   */\n  function readInput(src, dst, offset, length) {\n    if (src == null) return -1;\n    let /** number */ end = min(src.offset + length, src.data.length);\n    let /** number */ bytesRead = end - src.offset;\n    dst.set(src.data.subarray(src.offset, end), offset);\n    src.offset += bytesRead;\n    return bytesRead;\n  }\n\n  /**\n   * @param {!InputStream} src\n   * @return {!number}\n   */\n  function closeInput(src) {\n    return 0;\n  }\n\n  /**\n   * @param {!Int8Array} src\n   * @return {!Int8Array}\n   */\n  function asReadOnlyBuffer(src) {\n    return src;\n  }\n\n  /**\n   * @param {!Int8Array} src\n   * @return {!number}\n   */\n  function isReadOnly(src) {\n    return 1;\n  }\n\n  /**\n   * @param {!Int8Array} src\n   * @return {!number}\n   */\n  function isDirect(src) {\n    return 1;\n  }\n\n  /**\n   * @param {!Int8Array} buffer\n   * @return {void}\n   */\n  function flipBuffer(buffer) {\n    /* no-op */\n  }\n\n  /**\n   * @param {!string} src\n   * @return {!Int8Array}\n   */\n  function toUsAsciiBytes(src) {\n    let /** !number */ n = src.length;\n    let /** !Int8Array */ result = new Int8Array(n);\n    for (let /** !number */ i = 0; i < n; ++i) {\n      result[i] = src.charCodeAt(i);\n    }\n    return result;\n  }\n\n  /**\n   * @param {!Int8Array} bytes\n   * @param {Options=} options\n   * @return {!Int8Array}\n   */\n  function decode(bytes, options) {\n    let /** !State */ s = new State();\n    initState(s, new InputStream(bytes));\n    if (options) {\n      let customDictionary = /** @type {?Int8Array} */ options['customDictionary'];\n      if (customDictionary) attachDictionaryChunk(s, customDictionary);\n    }\n    let /** !number */ totalOutput = 0;\n    let /** !Array<!Int8Array> */ chunks = [];\n    while (true) {\n      let /** !Int8Array */ chunk = new Int8Array(16384);\n      chunks.push(chunk);\n      s.output = chunk;\n      s.outputOffset = 0;\n      s.outputLength = 16384;\n      s.outputUsed = 0;\n      decompress(s);\n      totalOutput += s.outputUsed;\n      if (s.outputUsed < 16384) break;\n    }\n    close(s);\n    let /** !Int8Array */ result = new Int8Array(totalOutput);\n    let /** !number */ offset = 0;\n    for (let /** !number */ i = 0; i < chunks.length; ++i) {\n      let /** !Int8Array */ chunk = chunks[i];\n      let /** !number */ end = min(totalOutput, offset + 16384);\n      let /** !number */ len = end - offset;\n      if (len < 16384) {\n        result.set(chunk.subarray(0, len), offset);\n      } else {\n        result.set(chunk, offset);\n      }\n      offset += len;\n    }\n    return result;\n  }\n\n  return decode;\n};\n\n/**\n * @type {function(!Int8Array, Options=):!Int8Array}\n */\nexport let BrotliDecode = makeBrotliDecode();\n", "// BROTLI\nimport type {CompressionOptions} from './compression';\nimport {Compression} from './compression';\nimport {isBrowser, toArrayBuffer} from '@loaders.gl/loader-utils';\nimport type brotliNamespace from 'brotli';\n// import brotli from 'brotli';  // https://bundlephobia.com/package/brotli\nimport {BrotliDecode} from '../brotli/decode';\nimport zlib from 'zlib';\nimport {promisify1} from '@loaders.gl/loader-utils';\n\nexport type BrotliCompressionOptions = CompressionOptions & {\n  brotli?: {\n    mode?: number;\n    quality?: number;\n    lgwin?: number;\n    useZlib?: boolean;\n  };\n};\n\nconst DEFAULT_BROTLI_OPTIONS = {\n  brotli: {\n    mode: 0,\n    quality: 8,\n    lgwin: 22\n  }\n};\n\nlet brotli: typeof brotliNamespace;\n\n/**\n * brotli compression / decompression\n */\nexport class BrotliCompression extends Compression {\n  readonly name: string = 'brotli';\n  readonly extensions = ['br'];\n  readonly contentEncodings = ['br'];\n  readonly isSupported = true;\n  readonly options: BrotliCompressionOptions;\n\n  constructor(options: BrotliCompressionOptions) {\n    super(options);\n    this.options = options;\n  }\n\n  /**\n   * brotli is an injectable dependency due to big size\n   * @param options\n   */\n  async preload(): Promise<void> {\n    brotli = brotli || this.options?.modules?.brotli;\n    if (!brotli) {\n      // eslint-disable-next-line no-console\n      console.warn(`${this.name} library not installed`);\n    }\n  }\n\n  async compress(input: ArrayBuffer): Promise<ArrayBuffer> {\n    // On Node.js we can use built-in zlib\n    if (!isBrowser && this.options.brotli?.useZlib) {\n      const buffer = await promisify1(zlib.brotliCompress)(input);\n      return toArrayBuffer(buffer);\n    }\n    return this.compressSync(input);\n  }\n\n  compressSync(input: ArrayBuffer): ArrayBuffer {\n    // On Node.js we can use built-in zlib\n    if (!isBrowser && this.options.brotli?.useZlib) {\n      const buffer = zlib.brotliCompressSync(input);\n      return toArrayBuffer(buffer);\n    }\n    const brotliOptions = {...DEFAULT_BROTLI_OPTIONS.brotli, ...this.options?.brotli};\n    const inputArray = new Uint8Array(input);\n\n    if (!brotli) {\n      throw new Error('brotli compression: brotli module not installed');\n    }\n\n    // @ts-ignore brotli types state that only Buffers are accepted...\n    const outputArray = brotli.compress(inputArray, brotliOptions);\n    return outputArray.buffer;\n  }\n\n  async decompress(input: ArrayBuffer): Promise<ArrayBuffer> {\n    // On Node.js we can use built-in zlib\n    if (!isBrowser && this.options.brotli?.useZlib) {\n      const buffer = await promisify1(zlib.brotliDecompress)(input);\n      return toArrayBuffer(buffer);\n    }\n    return this.decompressSync(input);\n  }\n\n  decompressSync(input: ArrayBuffer): ArrayBuffer {\n    // On Node.js we can use built-in zlib\n    if (!isBrowser && this.options.brotli?.useZlib) {\n      const buffer = zlib.brotliDecompressSync(input);\n      return toArrayBuffer(buffer);\n    }\n\n    const brotliOptions = {...DEFAULT_BROTLI_OPTIONS.brotli, ...this.options?.brotli};\n    const inputArray = new Uint8Array(input);\n\n    if (brotli) {\n      // @ts-ignore brotli types state that only Buffers are accepted...\n      const outputArray = brotli.decompress(inputArray, brotliOptions);\n      return outputArray.buffer;\n    }\n    const outputArray = BrotliDecode(inputArray, undefined);\n    return outputArray.buffer;\n  }\n}\n", "// SNAPPY (aka ZIPPY)\nimport type {CompressionOptions} from './compression';\nimport {Compression} from './compression';\nimport {compress, uncompress} from 'snappyjs'; // https://bundlephobia.com/package/snappy\n\n/**\n * Snappy/zippy compression / decompression\n */\nexport class SnappyCompression extends Compression {\n  readonly name: string = 'snappy';\n  readonly extensions = [];\n  readonly contentEncodings = [];\n  readonly isSupported = true;\n  readonly options: CompressionOptions;\n\n  constructor(options?: CompressionOptions) {\n    super(options);\n    this.options = options || {};\n  }\n\n  compressSync(input: ArrayBuffer): ArrayBuffer {\n    // Accepts arrayBuffer - https://github.com/zhipeng-jia/snappyjs#usage\n    return compress(input);\n  }\n\n  decompressSync(input: ArrayBuffer): ArrayBuffer {\n    // Accepts arrayBuffer - https://github.com/zhipeng-jia/snappyjs#usage\n    return uncompress(input);\n  }\n}\n", "// Copyright (c) 2012 Pierre Curto\n\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n/* eslint-disable complexity */\n/* eslint-disable max-statements */\n\n// LZ4\nimport {toArrayBuffer} from '@loaders.gl/loader-utils';\nimport type {CompressionOptions} from './compression';\nimport {Compression} from './compression';\n// import lz4js from 'lz4js'; // https://bundlephobia.com/package/lz4\nconst LZ4_MAGIC_NUMBER = 0x184d2204;\n\nlet lz4js;\n\n/**\n * LZ4 compression / decompression\n */\nexport class LZ4Compression extends Compression {\n  readonly name: string = 'lz4';\n  readonly extensions = ['lz4'];\n  readonly contentEncodings = ['x-lz4'];\n  readonly isSupported = true;\n  readonly options: CompressionOptions;\n\n  constructor(options: CompressionOptions) {\n    super(options);\n    this.options = options;\n\n    lz4js = lz4js || this.options?.modules?.lz4js;\n    if (!lz4js) {\n      throw new Error(this.name);\n    }\n  }\n\n  compressSync(input: ArrayBuffer): ArrayBuffer {\n    const inputArray = new Uint8Array(input);\n    return lz4js.compress(inputArray).buffer;\n  }\n\n  /**\n   * Decompresses an ArrayBuffer containing an Lz4 frame. maxSize is optional; if not\n   * provided, a maximum size will be determined by examining the data. The\n   * returned ArrayBuffer will always be perfectly sized.\n   * If data provided without magic number we will parse it as block\n   */\n  decompressSync(data: ArrayBuffer, maxSize?: number): ArrayBuffer {\n    try {\n      const isMagicNumberExists = this.checkMagicNumber(data);\n      const inputArray = new Uint8Array(data);\n\n      if (isMagicNumberExists) {\n        return lz4js.decompress(inputArray, maxSize).buffer;\n      }\n\n      if (!maxSize) {\n        const error = new Error('Need to provide maxSize');\n        throw this.improveError(error);\n      }\n\n      let uncompressed = new Uint8Array(maxSize);\n      const uncompressedSize = this.decodeBlock(inputArray, uncompressed);\n      uncompressed = uncompressed.slice(0, uncompressedSize);\n\n      return toArrayBuffer(uncompressed);\n    } catch (error) {\n      throw this.improveError(error);\n    }\n  }\n\n  /**\n   * Decode lz4 file as block\n   * Solution taken from here\n   * https://github.com/pierrec/node-lz4/blob/0dac687262403fd34f905b963da7220692f2a4a1/lib/binding.js#L25\n   * @param input\n   * @param output\n   * @param startIndex\n   * @param endIndex\n   */\n  decodeBlock(\n    data: Uint8Array,\n    output: Uint8Array,\n    startIndex?: number,\n    endIndex?: number\n  ): number {\n    startIndex = startIndex || 0;\n    endIndex = endIndex || data.length - startIndex;\n\n    let uncompressedSize = 0;\n    // Process each sequence in the incoming data\n    for (let index = startIndex; index < endIndex; ) {\n      const token = data[index++];\n\n      // Literals\n      let literalsLength = token >> 4;\n\n      if (literalsLength > 0) {\n        // length of literals\n        let length = literalsLength + 240;\n\n        while (length === 255) {\n          length = data[index++];\n          literalsLength += length;\n        }\n\n        // Copy the literals\n        const end = index + literalsLength;\n\n        while (index < end) {\n          output[uncompressedSize++] = data[index++];\n        }\n\n        // End of buffer?\n        if (index === endIndex) {\n          return uncompressedSize;\n        }\n      }\n\n      // Match copy\n      // 2 bytes offset (little endian)\n      const offset = data[index++] | (data[index++] << 8);\n\n      // 0 is an invalid offset value\n      if (offset === 0 || offset > uncompressedSize) {\n        return -(index - 2);\n      }\n\n      // length of match copy\n      let matchLength = token & 0xf;\n      let length = matchLength + 240;\n\n      while (length === 255) {\n        length = data[index++];\n        matchLength += length;\n      }\n\n      // Copy the match\n      let pos = uncompressedSize - offset; // position of the match copy in the current output\n      const end = uncompressedSize + matchLength + 4; // minmatch = 4\n\n      while (uncompressedSize < end) {\n        output[uncompressedSize++] = output[pos++];\n      }\n    }\n\n    return uncompressedSize;\n  }\n\n  /**\n   * Compare file magic with lz4 magic number\n   * @param input\n   */\n  checkMagicNumber(data: ArrayBuffer): boolean {\n    const magic = new Uint32Array(data.slice(0, 4));\n    return magic[0] === LZ4_MAGIC_NUMBER;\n  }\n}\n", "// ZSTD\nimport type {CompressionOptions} from './compression';\nimport {Compression} from './compression';\n// import {ZstdCodec} from 'zstd-codec'; // https://bundlephobia.com/package/zstd-codec\n\nlet ZstdCodec;\nlet zstd;\n\n/**\n * Zstandard compression / decompression\n */\nexport class ZstdCompression extends Compression {\n  readonly name: string = 'zstd';\n  readonly extensions = [];\n  readonly contentEncodings = [];\n  readonly isSupported = true;\n  readonly options: CompressionOptions;\n\n  /**\n   * zstd-codec is an injectable dependency due to big size\n   * @param options\n   */\n  constructor(options: CompressionOptions) {\n    super(options);\n    this.options = options;\n\n    ZstdCodec = this.options?.modules?.['zstd-codec'];\n    if (!ZstdCodec) {\n      // eslint-disable-next-line no-console\n      console.warn(`${this.name} library not installed`);\n    }\n  }\n\n  async preload(): Promise<void> {\n    if (!zstd && ZstdCodec) {\n      zstd = await new Promise((resolve) => ZstdCodec.run((zstd) => resolve(zstd)));\n    }\n  }\n\n  compressSync(input: ArrayBuffer): ArrayBuffer {\n    const simpleZstd = new zstd.Simple();\n    const inputArray = new Uint8Array(input);\n    return simpleZstd.compress(inputArray).buffer;\n  }\n\n  decompressSync(input: ArrayBuffer): ArrayBuffer {\n    const simpleZstd = new zstd.Simple();\n    // var ddict = new zstd.Dict.Decompression(dictData);\n    // var jsonBytes = simpleZstd.decompressUsingDict(jsonZstData, ddict);\n    const inputArray = new Uint8Array(input);\n    return simpleZstd.decompress(inputArray).buffer;\n  }\n}\n", "// Forked from https://github.com/kbajalc/parquets under MIT license (Copyright (c) 2017 ironSource Ltd.)\n/* eslint-disable camelcase */\n// Forked from https://github.com/ironSource/parquetjs under MIT license\n\nimport {\n  Compression,\n  NoCompression,\n  GZipCompression,\n  SnappyCompression,\n  BrotliCompression,\n  // LZOCompression,\n  LZ4Compression,\n  ZstdCompression\n} from '@loaders.gl/compression';\n\nimport {ParquetCompression} from './schema/declare';\n\n/** We can't use loaders-util buffer handling since we are dependent on buffers even in the browser */\nfunction toBuffer(arrayBuffer: ArrayBuffer): Buffer {\n  return Buffer.from(arrayBuffer);\n}\n\nfunction toArrayBuffer(buffer: Buffer): ArrayBuffer {\n  // TODO - per docs we should just be able to call buffer.buffer, but there are issues\n  if (Buffer.isBuffer(buffer)) {\n    const typedArray = new Uint8Array(buffer.buffer, buffer.byteOffset, buffer.length);\n    return typedArray.slice().buffer;\n  }\n  return buffer;\n}\n\n// TODO switch to worker compression to avoid bundling...\n\n// import brotli from 'brotli'; - brotli has problems with decompress in browsers\n// import brotliDecompress from 'brotli/decompress';\nimport lz4js from 'lz4js';\n// import lzo from 'lzo';\n// import {ZstdCodec} from 'zstd-codec';\n\n// Inject large dependencies through Compression constructor options\nconst modules = {\n  // brotli has problems with decompress in browsers\n  // brotli: {\n  //   decompress: brotliDecompress,\n  //   compress: () => {\n  //     throw new Error('brotli compress');\n  //   }\n  // },\n  lz4js\n  // lzo\n  // 'zstd-codec': ZstdCodec\n};\n\n/**\n * See https://github.com/apache/parquet-format/blob/master/Compression.md\n */\n// @ts-expect-error\nexport const PARQUET_COMPRESSION_METHODS: Record<ParquetCompression, Compression> = {\n  UNCOMPRESSED: new NoCompression(),\n  GZIP: new GZipCompression(),\n  SNAPPY: new SnappyCompression(),\n  BROTLI: new BrotliCompression({modules}),\n  // TODO: Understand difference between LZ4 and LZ4_RAW\n  LZ4: new LZ4Compression({modules}),\n  LZ4_RAW: new LZ4Compression({modules}),\n  //\n  // LZO: new LZOCompression({modules}),\n  ZSTD: new ZstdCompression({modules})\n};\n\n/**\n * Register compressions that have big external libraries\n * @param options.modules External library dependencies\n */\nexport async function preloadCompressions(options?: {modules: {[key: string]: any}}) {\n  const compressions = Object.values(PARQUET_COMPRESSION_METHODS);\n  return await Promise.all(compressions.map((compression) => compression.preload()));\n}\n\n/**\n * Deflate a value using compression method `method`\n */\nexport async function deflate(method: ParquetCompression, value: Buffer): Promise<Buffer> {\n  const compression = PARQUET_COMPRESSION_METHODS[method];\n  if (!compression) {\n    throw new Error(`parquet: invalid compression method: ${method}`);\n  }\n  const inputArrayBuffer = toArrayBuffer(value);\n  const compressedArrayBuffer = await compression.compress(inputArrayBuffer);\n  return toBuffer(compressedArrayBuffer);\n}\n\n/**\n * Inflate a value using compression method `method`\n */\nexport async function decompress(\n  method: ParquetCompression,\n  value: Buffer,\n  size: number\n): Promise<Buffer> {\n  const compression = PARQUET_COMPRESSION_METHODS[method];\n  if (!compression) {\n    throw new Error(`parquet: invalid compression method: ${method}`);\n  }\n  const inputArrayBuffer = toArrayBuffer(value);\n  const compressedArrayBuffer = await compression.decompress(inputArrayBuffer, size);\n  return toBuffer(compressedArrayBuffer);\n}\n\n/*\n * Inflate a value using compression method `method`\n */\nexport function inflate(method: ParquetCompression, value: Buffer, size: number): Buffer {\n  if (!(method in PARQUET_COMPRESSION_METHODS)) {\n    throw new Error(`invalid compression method: ${method}`);\n  }\n  // @ts-ignore\n  return PARQUET_COMPRESSION_METHODS[method].inflate(value, size);\n}\n\n/*\nfunction deflate_identity(value: Buffer): Buffer {\n  return value;\n}\n\nfunction deflate_gzip(value: Buffer): Buffer {\n  return zlib.gzipSync(value);\n}\n\nfunction deflate_snappy(value: Buffer): Buffer {\n  return snappyjs.compress(value);\n}\n\nfunction deflate_lzo(value: Buffer): Buffer {\n  lzo = lzo || Util.load('lzo');\n  return lzo.compress(value);\n}\n\nfunction deflate_brotli(value: Buffer): Buffer {\n  brotli = brotli || Util.load('brotli');\n  const result = brotli.compress(value, {\n    mode: 0,\n    quality: 8,\n    lgwin: 22\n  });\n  return result ? Buffer.from(result) : Buffer.alloc(0);\n}\n\nfunction deflate_lz4(value: Buffer): Buffer {\n  lz4js = lz4js || Util.load('lz4js');\n  try {\n    // let result = Buffer.alloc(lz4js.encodeBound(value.length));\n    // const compressedSize = lz4.encodeBlock(value, result);\n    // // remove unnecessary bytes\n    // result = result.slice(0, compressedSize);\n    // return result;\n    return Buffer.from(lz4js.compress(value));\n  } catch (err) {\n    throw err;\n  }\n}\nfunction inflate_identity(value: Buffer): Buffer {\n  return value;\n}\n\nfunction inflate_gzip(value: Buffer): Buffer {\n  return zlib.gunzipSync(value);\n}\n\nfunction inflate_snappy(value: Buffer): Buffer {\n  return snappyjs.uncompress(value);\n}\n\nfunction inflate_lzo(value: Buffer, size: number): Buffer {\n  lzo = lzo || Util.load('lzo');\n  return lzo.decompress(value, size);\n}\n\nfunction inflate_lz4(value: Buffer, size: number): Buffer {\n  lz4js = lz4js || Util.load('lz4js');\n  try {\n    // let result = Buffer.alloc(size);\n    // const uncompressedSize = lz4js.decodeBlock(value, result);\n    // // remove unnecessary bytes\n    // result = result.slice(0, uncompressedSize);\n    // return result;\n    return Buffer.from(lz4js.decompress(value, size));\n  } catch (err) {\n    throw err;\n  }\n}\n\nfunction inflate_brotli(value: Buffer): Buffer {\n  brotli = brotli || Util.load('brotli');\n  if (!value.length) {\n    return Buffer.alloc(0);\n  }\n  return Buffer.from(brotli.decompress(value));\n}\n*/\n", "'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n  lookup[i] = code[i]\n  revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n  var len = b64.length\n\n  if (len % 4 > 0) {\n    throw new Error('Invalid string. Length must be a multiple of 4')\n  }\n\n  // Trim off extra bytes after placeholder bytes are found\n  // See: https://github.com/beatgammit/base64-js/issues/42\n  var validLen = b64.indexOf('=')\n  if (validLen === -1) validLen = len\n\n  var placeHoldersLen = validLen === len\n    ? 0\n    : 4 - (validLen % 4)\n\n  return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n  return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n  var tmp\n  var lens = getLens(b64)\n  var validLen = lens[0]\n  var placeHoldersLen = lens[1]\n\n  var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n  var curByte = 0\n\n  // if there are placeholders, only get up to the last complete 4 chars\n  var len = placeHoldersLen > 0\n    ? validLen - 4\n    : validLen\n\n  var i\n  for (i = 0; i < len; i += 4) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 18) |\n      (revLookup[b64.charCodeAt(i + 1)] << 12) |\n      (revLookup[b64.charCodeAt(i + 2)] << 6) |\n      revLookup[b64.charCodeAt(i + 3)]\n    arr[curByte++] = (tmp >> 16) & 0xFF\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 2) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 2) |\n      (revLookup[b64.charCodeAt(i + 1)] >> 4)\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  if (placeHoldersLen === 1) {\n    tmp =\n      (revLookup[b64.charCodeAt(i)] << 10) |\n      (revLookup[b64.charCodeAt(i + 1)] << 4) |\n      (revLookup[b64.charCodeAt(i + 2)] >> 2)\n    arr[curByte++] = (tmp >> 8) & 0xFF\n    arr[curByte++] = tmp & 0xFF\n  }\n\n  return arr\n}\n\nfunction tripletToBase64 (num) {\n  return lookup[num >> 18 & 0x3F] +\n    lookup[num >> 12 & 0x3F] +\n    lookup[num >> 6 & 0x3F] +\n    lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n  var tmp\n  var output = []\n  for (var i = start; i < end; i += 3) {\n    tmp =\n      ((uint8[i] << 16) & 0xFF0000) +\n      ((uint8[i + 1] << 8) & 0xFF00) +\n      (uint8[i + 2] & 0xFF)\n    output.push(tripletToBase64(tmp))\n  }\n  return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n  var tmp\n  var len = uint8.length\n  var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n  var parts = []\n  var maxChunkLength = 16383 // must be multiple of 3\n\n  // go through the array every three bytes, we'll deal with trailing stuff later\n  for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n    parts.push(encodeChunk(\n      uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)\n    ))\n  }\n\n  // pad the end with zeros, but make sure to not forget the extra bytes\n  if (extraBytes === 1) {\n    tmp = uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 2] +\n      lookup[(tmp << 4) & 0x3F] +\n      '=='\n    )\n  } else if (extraBytes === 2) {\n    tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n    parts.push(\n      lookup[tmp >> 10] +\n      lookup[(tmp >> 4) & 0x3F] +\n      lookup[(tmp << 2) & 0x3F] +\n      '='\n    )\n  }\n\n  return parts.join('')\n}\n", "exports.read = function (buffer, offset, isLE, mLen, nBytes) {\n  var e, m\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var nBits = -7\n  var i = isLE ? (nBytes - 1) : 0\n  var d = isLE ? -1 : 1\n  var s = buffer[offset + i]\n\n  i += d\n\n  e = s & ((1 << (-nBits)) - 1)\n  s >>= (-nBits)\n  nBits += eLen\n  for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  m = e & ((1 << (-nBits)) - 1)\n  e >>= (-nBits)\n  nBits += mLen\n  for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n  if (e === 0) {\n    e = 1 - eBias\n  } else if (e === eMax) {\n    return m ? NaN : ((s ? -1 : 1) * Infinity)\n  } else {\n    m = m + Math.pow(2, mLen)\n    e = e - eBias\n  }\n  return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n  var e, m, c\n  var eLen = (nBytes * 8) - mLen - 1\n  var eMax = (1 << eLen) - 1\n  var eBias = eMax >> 1\n  var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n  var i = isLE ? 0 : (nBytes - 1)\n  var d = isLE ? 1 : -1\n  var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n  value = Math.abs(value)\n\n  if (isNaN(value) || value === Infinity) {\n    m = isNaN(value) ? 1 : 0\n    e = eMax\n  } else {\n    e = Math.floor(Math.log(value) / Math.LN2)\n    if (value * (c = Math.pow(2, -e)) < 1) {\n      e--\n      c *= 2\n    }\n    if (e + eBias >= 1) {\n      value += rt / c\n    } else {\n      value += rt * Math.pow(2, 1 - eBias)\n    }\n    if (value * c >= 2) {\n      e++\n      c /= 2\n    }\n\n    if (e + eBias >= eMax) {\n      m = 0\n      e = eMax\n    } else if (e + eBias >= 1) {\n      m = ((value * c) - 1) * Math.pow(2, mLen)\n      e = e + eBias\n    } else {\n      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n      e = 0\n    }\n  }\n\n  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n  e = (e << mLen) | m\n  eLen += mLen\n  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n  buffer[offset + i - d] |= s * 128\n}\n", "/*!\n * The buffer module from node.js, for the browser.\n *\n * @author   Feross Aboukhadijeh <https://feross.org>\n * @license  MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nvar base64 = require('base64-js')\nvar ieee754 = require('ieee754')\nvar customInspectSymbol =\n  (typeof Symbol === 'function' && typeof Symbol.for === 'function')\n    ? Symbol.for('nodejs.util.inspect.custom')\n    : null\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nvar K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n *   === true    Use Uint8Array implementation (fastest)\n *   === false   Print warning and recommend using `buffer` v4.x which has an Object\n *               implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n    typeof console.error === 'function') {\n  console.error(\n    'This browser lacks typed array (Uint8Array) support which is required by ' +\n    '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n  )\n}\n\nfunction typedArraySupport () {\n  // Can typed array instances can be augmented?\n  try {\n    var arr = new Uint8Array(1)\n    var proto = { foo: function () { return 42 } }\n    Object.setPrototypeOf(proto, Uint8Array.prototype)\n    Object.setPrototypeOf(arr, proto)\n    return arr.foo() === 42\n  } catch (e) {\n    return false\n  }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.buffer\n  }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n  enumerable: true,\n  get: function () {\n    if (!Buffer.isBuffer(this)) return undefined\n    return this.byteOffset\n  }\n})\n\nfunction createBuffer (length) {\n  if (length > K_MAX_LENGTH) {\n    throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n  }\n  // Return an augmented `Uint8Array` instance\n  var buf = new Uint8Array(length)\n  Object.setPrototypeOf(buf, Buffer.prototype)\n  return buf\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n  // Common case.\n  if (typeof arg === 'number') {\n    if (typeof encodingOrOffset === 'string') {\n      throw new TypeError(\n        'The \"string\" argument must be of type string. Received type number'\n      )\n    }\n    return allocUnsafe(arg)\n  }\n  return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n  if (typeof value === 'string') {\n    return fromString(value, encodingOrOffset)\n  }\n\n  if (ArrayBuffer.isView(value)) {\n    return fromArrayLike(value)\n  }\n\n  if (value == null) {\n    throw new TypeError(\n      'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n      'or Array-like Object. Received type ' + (typeof value)\n    )\n  }\n\n  if (isInstance(value, ArrayBuffer) ||\n      (value && isInstance(value.buffer, ArrayBuffer))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof SharedArrayBuffer !== 'undefined' &&\n      (isInstance(value, SharedArrayBuffer) ||\n      (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n    return fromArrayBuffer(value, encodingOrOffset, length)\n  }\n\n  if (typeof value === 'number') {\n    throw new TypeError(\n      'The \"value\" argument must not be of type number. Received type number'\n    )\n  }\n\n  var valueOf = value.valueOf && value.valueOf()\n  if (valueOf != null && valueOf !== value) {\n    return Buffer.from(valueOf, encodingOrOffset, length)\n  }\n\n  var b = fromObject(value)\n  if (b) return b\n\n  if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n      typeof value[Symbol.toPrimitive] === 'function') {\n    return Buffer.from(\n      value[Symbol.toPrimitive]('string'), encodingOrOffset, length\n    )\n  }\n\n  throw new TypeError(\n    'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n    'or Array-like Object. Received type ' + (typeof value)\n  )\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n  return from(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype)\nObject.setPrototypeOf(Buffer, Uint8Array)\n\nfunction assertSize (size) {\n  if (typeof size !== 'number') {\n    throw new TypeError('\"size\" argument must be of type number')\n  } else if (size < 0) {\n    throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n  }\n}\n\nfunction alloc (size, fill, encoding) {\n  assertSize(size)\n  if (size <= 0) {\n    return createBuffer(size)\n  }\n  if (fill !== undefined) {\n    // Only pay attention to encoding if it's a string. This\n    // prevents accidentally sending in a number that would\n    // be interpretted as a start offset.\n    return typeof encoding === 'string'\n      ? createBuffer(size).fill(fill, encoding)\n      : createBuffer(size).fill(fill)\n  }\n  return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n  return alloc(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n  assertSize(size)\n  return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n  return allocUnsafe(size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n  return allocUnsafe(size)\n}\n\nfunction fromString (string, encoding) {\n  if (typeof encoding !== 'string' || encoding === '') {\n    encoding = 'utf8'\n  }\n\n  if (!Buffer.isEncoding(encoding)) {\n    throw new TypeError('Unknown encoding: ' + encoding)\n  }\n\n  var length = byteLength(string, encoding) | 0\n  var buf = createBuffer(length)\n\n  var actual = buf.write(string, encoding)\n\n  if (actual !== length) {\n    // Writing a hex string, for example, that contains invalid characters will\n    // cause everything after the first invalid character to be ignored. (e.g.\n    // 'abxxcd' will be treated as 'ab')\n    buf = buf.slice(0, actual)\n  }\n\n  return buf\n}\n\nfunction fromArrayLike (array) {\n  var length = array.length < 0 ? 0 : checked(array.length) | 0\n  var buf = createBuffer(length)\n  for (var i = 0; i < length; i += 1) {\n    buf[i] = array[i] & 255\n  }\n  return buf\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n  if (byteOffset < 0 || array.byteLength < byteOffset) {\n    throw new RangeError('\"offset\" is outside of buffer bounds')\n  }\n\n  if (array.byteLength < byteOffset + (length || 0)) {\n    throw new RangeError('\"length\" is outside of buffer bounds')\n  }\n\n  var buf\n  if (byteOffset === undefined && length === undefined) {\n    buf = new Uint8Array(array)\n  } else if (length === undefined) {\n    buf = new Uint8Array(array, byteOffset)\n  } else {\n    buf = new Uint8Array(array, byteOffset, length)\n  }\n\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(buf, Buffer.prototype)\n\n  return buf\n}\n\nfunction fromObject (obj) {\n  if (Buffer.isBuffer(obj)) {\n    var len = checked(obj.length) | 0\n    var buf = createBuffer(len)\n\n    if (buf.length === 0) {\n      return buf\n    }\n\n    obj.copy(buf, 0, 0, len)\n    return buf\n  }\n\n  if (obj.length !== undefined) {\n    if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n      return createBuffer(0)\n    }\n    return fromArrayLike(obj)\n  }\n\n  if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n    return fromArrayLike(obj.data)\n  }\n}\n\nfunction checked (length) {\n  // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n  // length is NaN (which is otherwise coerced to zero.)\n  if (length >= K_MAX_LENGTH) {\n    throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n                         'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n  }\n  return length | 0\n}\n\nfunction SlowBuffer (length) {\n  if (+length != length) { // eslint-disable-line eqeqeq\n    length = 0\n  }\n  return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n  return b != null && b._isBuffer === true &&\n    b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n  if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n  if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n  if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n    throw new TypeError(\n      'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n    )\n  }\n\n  if (a === b) return 0\n\n  var x = a.length\n  var y = b.length\n\n  for (var i = 0, len = Math.min(x, y); i < len; ++i) {\n    if (a[i] !== b[i]) {\n      x = a[i]\n      y = b[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n  switch (String(encoding).toLowerCase()) {\n    case 'hex':\n    case 'utf8':\n    case 'utf-8':\n    case 'ascii':\n    case 'latin1':\n    case 'binary':\n    case 'base64':\n    case 'ucs2':\n    case 'ucs-2':\n    case 'utf16le':\n    case 'utf-16le':\n      return true\n    default:\n      return false\n  }\n}\n\nBuffer.concat = function concat (list, length) {\n  if (!Array.isArray(list)) {\n    throw new TypeError('\"list\" argument must be an Array of Buffers')\n  }\n\n  if (list.length === 0) {\n    return Buffer.alloc(0)\n  }\n\n  var i\n  if (length === undefined) {\n    length = 0\n    for (i = 0; i < list.length; ++i) {\n      length += list[i].length\n    }\n  }\n\n  var buffer = Buffer.allocUnsafe(length)\n  var pos = 0\n  for (i = 0; i < list.length; ++i) {\n    var buf = list[i]\n    if (isInstance(buf, Uint8Array)) {\n      buf = Buffer.from(buf)\n    }\n    if (!Buffer.isBuffer(buf)) {\n      throw new TypeError('\"list\" argument must be an Array of Buffers')\n    }\n    buf.copy(buffer, pos)\n    pos += buf.length\n  }\n  return buffer\n}\n\nfunction byteLength (string, encoding) {\n  if (Buffer.isBuffer(string)) {\n    return string.length\n  }\n  if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n    return string.byteLength\n  }\n  if (typeof string !== 'string') {\n    throw new TypeError(\n      'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n      'Received type ' + typeof string\n    )\n  }\n\n  var len = string.length\n  var mustMatch = (arguments.length > 2 && arguments[2] === true)\n  if (!mustMatch && len === 0) return 0\n\n  // Use a for loop to avoid recursion\n  var loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'ascii':\n      case 'latin1':\n      case 'binary':\n        return len\n      case 'utf8':\n      case 'utf-8':\n        return utf8ToBytes(string).length\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return len * 2\n      case 'hex':\n        return len >>> 1\n      case 'base64':\n        return base64ToBytes(string).length\n      default:\n        if (loweredCase) {\n          return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n        }\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n  var loweredCase = false\n\n  // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n  // property of a typed array.\n\n  // This behaves neither like String nor Uint8Array in that we set start/end\n  // to their upper/lower bounds if the value passed is out of range.\n  // undefined is handled specially as per ECMA-262 6th Edition,\n  // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n  if (start === undefined || start < 0) {\n    start = 0\n  }\n  // Return early if start > this.length. Done here to prevent potential uint32\n  // coercion fail below.\n  if (start > this.length) {\n    return ''\n  }\n\n  if (end === undefined || end > this.length) {\n    end = this.length\n  }\n\n  if (end <= 0) {\n    return ''\n  }\n\n  // Force coersion to uint32. This will also coerce falsey/NaN values to 0.\n  end >>>= 0\n  start >>>= 0\n\n  if (end <= start) {\n    return ''\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  while (true) {\n    switch (encoding) {\n      case 'hex':\n        return hexSlice(this, start, end)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Slice(this, start, end)\n\n      case 'ascii':\n        return asciiSlice(this, start, end)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Slice(this, start, end)\n\n      case 'base64':\n        return base64Slice(this, start, end)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return utf16leSlice(this, start, end)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = (encoding + '').toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n  var i = b[n]\n  b[n] = b[m]\n  b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n  var len = this.length\n  if (len % 2 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 16-bits')\n  }\n  for (var i = 0; i < len; i += 2) {\n    swap(this, i, i + 1)\n  }\n  return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n  var len = this.length\n  if (len % 4 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 32-bits')\n  }\n  for (var i = 0; i < len; i += 4) {\n    swap(this, i, i + 3)\n    swap(this, i + 1, i + 2)\n  }\n  return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n  var len = this.length\n  if (len % 8 !== 0) {\n    throw new RangeError('Buffer size must be a multiple of 64-bits')\n  }\n  for (var i = 0; i < len; i += 8) {\n    swap(this, i, i + 7)\n    swap(this, i + 1, i + 6)\n    swap(this, i + 2, i + 5)\n    swap(this, i + 3, i + 4)\n  }\n  return this\n}\n\nBuffer.prototype.toString = function toString () {\n  var length = this.length\n  if (length === 0) return ''\n  if (arguments.length === 0) return utf8Slice(this, 0, length)\n  return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.toLocaleString = Buffer.prototype.toString\n\nBuffer.prototype.equals = function equals (b) {\n  if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n  if (this === b) return true\n  return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n  var str = ''\n  var max = exports.INSPECT_MAX_BYTES\n  str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n  if (this.length > max) str += ' ... '\n  return '<Buffer ' + str + '>'\n}\nif (customInspectSymbol) {\n  Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n  if (isInstance(target, Uint8Array)) {\n    target = Buffer.from(target, target.offset, target.byteLength)\n  }\n  if (!Buffer.isBuffer(target)) {\n    throw new TypeError(\n      'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n      'Received type ' + (typeof target)\n    )\n  }\n\n  if (start === undefined) {\n    start = 0\n  }\n  if (end === undefined) {\n    end = target ? target.length : 0\n  }\n  if (thisStart === undefined) {\n    thisStart = 0\n  }\n  if (thisEnd === undefined) {\n    thisEnd = this.length\n  }\n\n  if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n    throw new RangeError('out of range index')\n  }\n\n  if (thisStart >= thisEnd && start >= end) {\n    return 0\n  }\n  if (thisStart >= thisEnd) {\n    return -1\n  }\n  if (start >= end) {\n    return 1\n  }\n\n  start >>>= 0\n  end >>>= 0\n  thisStart >>>= 0\n  thisEnd >>>= 0\n\n  if (this === target) return 0\n\n  var x = thisEnd - thisStart\n  var y = end - start\n  var len = Math.min(x, y)\n\n  var thisCopy = this.slice(thisStart, thisEnd)\n  var targetCopy = target.slice(start, end)\n\n  for (var i = 0; i < len; ++i) {\n    if (thisCopy[i] !== targetCopy[i]) {\n      x = thisCopy[i]\n      y = targetCopy[i]\n      break\n    }\n  }\n\n  if (x < y) return -1\n  if (y < x) return 1\n  return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n  // Empty buffer means no match\n  if (buffer.length === 0) return -1\n\n  // Normalize byteOffset\n  if (typeof byteOffset === 'string') {\n    encoding = byteOffset\n    byteOffset = 0\n  } else if (byteOffset > 0x7fffffff) {\n    byteOffset = 0x7fffffff\n  } else if (byteOffset < -0x80000000) {\n    byteOffset = -0x80000000\n  }\n  byteOffset = +byteOffset // Coerce to Number.\n  if (numberIsNaN(byteOffset)) {\n    // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n    byteOffset = dir ? 0 : (buffer.length - 1)\n  }\n\n  // Normalize byteOffset: negative offsets start from the end of the buffer\n  if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n  if (byteOffset >= buffer.length) {\n    if (dir) return -1\n    else byteOffset = buffer.length - 1\n  } else if (byteOffset < 0) {\n    if (dir) byteOffset = 0\n    else return -1\n  }\n\n  // Normalize val\n  if (typeof val === 'string') {\n    val = Buffer.from(val, encoding)\n  }\n\n  // Finally, search either indexOf (if dir is true) or lastIndexOf\n  if (Buffer.isBuffer(val)) {\n    // Special case: looking for empty string/buffer always fails\n    if (val.length === 0) {\n      return -1\n    }\n    return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n  } else if (typeof val === 'number') {\n    val = val & 0xFF // Search for a byte value [0-255]\n    if (typeof Uint8Array.prototype.indexOf === 'function') {\n      if (dir) {\n        return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n      } else {\n        return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n      }\n    }\n    return arrayIndexOf(buffer, [val], byteOffset, encoding, dir)\n  }\n\n  throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n  var indexSize = 1\n  var arrLength = arr.length\n  var valLength = val.length\n\n  if (encoding !== undefined) {\n    encoding = String(encoding).toLowerCase()\n    if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n        encoding === 'utf16le' || encoding === 'utf-16le') {\n      if (arr.length < 2 || val.length < 2) {\n        return -1\n      }\n      indexSize = 2\n      arrLength /= 2\n      valLength /= 2\n      byteOffset /= 2\n    }\n  }\n\n  function read (buf, i) {\n    if (indexSize === 1) {\n      return buf[i]\n    } else {\n      return buf.readUInt16BE(i * indexSize)\n    }\n  }\n\n  var i\n  if (dir) {\n    var foundIndex = -1\n    for (i = byteOffset; i < arrLength; i++) {\n      if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n        if (foundIndex === -1) foundIndex = i\n        if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n      } else {\n        if (foundIndex !== -1) i -= i - foundIndex\n        foundIndex = -1\n      }\n    }\n  } else {\n    if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n    for (i = byteOffset; i >= 0; i--) {\n      var found = true\n      for (var j = 0; j < valLength; j++) {\n        if (read(arr, i + j) !== read(val, j)) {\n          found = false\n          break\n        }\n      }\n      if (found) return i\n    }\n  }\n\n  return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n  return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n  return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n  offset = Number(offset) || 0\n  var remaining = buf.length - offset\n  if (!length) {\n    length = remaining\n  } else {\n    length = Number(length)\n    if (length > remaining) {\n      length = remaining\n    }\n  }\n\n  var strLen = string.length\n\n  if (length > strLen / 2) {\n    length = strLen / 2\n  }\n  for (var i = 0; i < length; ++i) {\n    var parsed = parseInt(string.substr(i * 2, 2), 16)\n    if (numberIsNaN(parsed)) return i\n    buf[offset + i] = parsed\n  }\n  return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n  return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n  return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction latin1Write (buf, string, offset, length) {\n  return asciiWrite(buf, string, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n  return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n  return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n  // Buffer#write(string)\n  if (offset === undefined) {\n    encoding = 'utf8'\n    length = this.length\n    offset = 0\n  // Buffer#write(string, encoding)\n  } else if (length === undefined && typeof offset === 'string') {\n    encoding = offset\n    length = this.length\n    offset = 0\n  // Buffer#write(string, offset[, length][, encoding])\n  } else if (isFinite(offset)) {\n    offset = offset >>> 0\n    if (isFinite(length)) {\n      length = length >>> 0\n      if (encoding === undefined) encoding = 'utf8'\n    } else {\n      encoding = length\n      length = undefined\n    }\n  } else {\n    throw new Error(\n      'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n    )\n  }\n\n  var remaining = this.length - offset\n  if (length === undefined || length > remaining) length = remaining\n\n  if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n    throw new RangeError('Attempt to write outside buffer bounds')\n  }\n\n  if (!encoding) encoding = 'utf8'\n\n  var loweredCase = false\n  for (;;) {\n    switch (encoding) {\n      case 'hex':\n        return hexWrite(this, string, offset, length)\n\n      case 'utf8':\n      case 'utf-8':\n        return utf8Write(this, string, offset, length)\n\n      case 'ascii':\n        return asciiWrite(this, string, offset, length)\n\n      case 'latin1':\n      case 'binary':\n        return latin1Write(this, string, offset, length)\n\n      case 'base64':\n        // Warning: maxLength not taken into account in base64Write\n        return base64Write(this, string, offset, length)\n\n      case 'ucs2':\n      case 'ucs-2':\n      case 'utf16le':\n      case 'utf-16le':\n        return ucs2Write(this, string, offset, length)\n\n      default:\n        if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n        encoding = ('' + encoding).toLowerCase()\n        loweredCase = true\n    }\n  }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n  return {\n    type: 'Buffer',\n    data: Array.prototype.slice.call(this._arr || this, 0)\n  }\n}\n\nfunction base64Slice (buf, start, end) {\n  if (start === 0 && end === buf.length) {\n    return base64.fromByteArray(buf)\n  } else {\n    return base64.fromByteArray(buf.slice(start, end))\n  }\n}\n\nfunction utf8Slice (buf, start, end) {\n  end = Math.min(buf.length, end)\n  var res = []\n\n  var i = start\n  while (i < end) {\n    var firstByte = buf[i]\n    var codePoint = null\n    var bytesPerSequence = (firstByte > 0xEF) ? 4\n      : (firstByte > 0xDF) ? 3\n        : (firstByte > 0xBF) ? 2\n          : 1\n\n    if (i + bytesPerSequence <= end) {\n      var secondByte, thirdByte, fourthByte, tempCodePoint\n\n      switch (bytesPerSequence) {\n        case 1:\n          if (firstByte < 0x80) {\n            codePoint = firstByte\n          }\n          break\n        case 2:\n          secondByte = buf[i + 1]\n          if ((secondByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n            if (tempCodePoint > 0x7F) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 3:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n            if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n              codePoint = tempCodePoint\n            }\n          }\n          break\n        case 4:\n          secondByte = buf[i + 1]\n          thirdByte = buf[i + 2]\n          fourthByte = buf[i + 3]\n          if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n            tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n            if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n              codePoint = tempCodePoint\n            }\n          }\n      }\n    }\n\n    if (codePoint === null) {\n      // we did not generate a valid codePoint so insert a\n      // replacement char (U+FFFD) and advance only 1 byte\n      codePoint = 0xFFFD\n      bytesPerSequence = 1\n    } else if (codePoint > 0xFFFF) {\n      // encode to utf16 (surrogate pair dance)\n      codePoint -= 0x10000\n      res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n      codePoint = 0xDC00 | codePoint & 0x3FF\n    }\n\n    res.push(codePoint)\n    i += bytesPerSequence\n  }\n\n  return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nvar MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n  var len = codePoints.length\n  if (len <= MAX_ARGUMENTS_LENGTH) {\n    return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n  }\n\n  // Decode in chunks to avoid \"call stack size exceeded\".\n  var res = ''\n  var i = 0\n  while (i < len) {\n    res += String.fromCharCode.apply(\n      String,\n      codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n    )\n  }\n  return res\n}\n\nfunction asciiSlice (buf, start, end) {\n  var ret = ''\n  end = Math.min(buf.length, end)\n\n  for (var i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i] & 0x7F)\n  }\n  return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n  var ret = ''\n  end = Math.min(buf.length, end)\n\n  for (var i = start; i < end; ++i) {\n    ret += String.fromCharCode(buf[i])\n  }\n  return ret\n}\n\nfunction hexSlice (buf, start, end) {\n  var len = buf.length\n\n  if (!start || start < 0) start = 0\n  if (!end || end < 0 || end > len) end = len\n\n  var out = ''\n  for (var i = start; i < end; ++i) {\n    out += hexSliceLookupTable[buf[i]]\n  }\n  return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n  var bytes = buf.slice(start, end)\n  var res = ''\n  for (var i = 0; i < bytes.length; i += 2) {\n    res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))\n  }\n  return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n  var len = this.length\n  start = ~~start\n  end = end === undefined ? len : ~~end\n\n  if (start < 0) {\n    start += len\n    if (start < 0) start = 0\n  } else if (start > len) {\n    start = len\n  }\n\n  if (end < 0) {\n    end += len\n    if (end < 0) end = 0\n  } else if (end > len) {\n    end = len\n  }\n\n  if (end < start) end = start\n\n  var newBuf = this.subarray(start, end)\n  // Return an augmented `Uint8Array` instance\n  Object.setPrototypeOf(newBuf, Buffer.prototype)\n\n  return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n  if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n  if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  var val = this[offset]\n  var mul = 1\n  var i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    checkOffset(offset, byteLength, this.length)\n  }\n\n  var val = this[offset + --byteLength]\n  var mul = 1\n  while (byteLength > 0 && (mul *= 0x100)) {\n    val += this[offset + --byteLength] * mul\n  }\n\n  return val\n}\n\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  return this[offset]\n}\n\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return ((this[offset]) |\n      (this[offset + 1] << 8) |\n      (this[offset + 2] << 16)) +\n      (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] * 0x1000000) +\n    ((this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    this[offset + 3])\n}\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  var val = this[offset]\n  var mul = 1\n  var i = 0\n  while (++i < byteLength && (mul *= 0x100)) {\n    val += this[offset + i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n  var i = byteLength\n  var mul = 1\n  var val = this[offset + --i]\n  while (i > 0 && (mul *= 0x100)) {\n    val += this[offset + --i] * mul\n  }\n  mul *= 0x80\n\n  if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n  return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 1, this.length)\n  if (!(this[offset] & 0x80)) return (this[offset])\n  return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  var val = this[offset] | (this[offset + 1] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 2, this.length)\n  var val = this[offset + 1] | (this[offset] << 8)\n  return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset]) |\n    (this[offset + 1] << 8) |\n    (this[offset + 2] << 16) |\n    (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n\n  return (this[offset] << 24) |\n    (this[offset + 1] << 16) |\n    (this[offset + 2] << 8) |\n    (this[offset + 3])\n}\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 4, this.length)\n  return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n  offset = offset >>> 0\n  if (!noAssert) checkOffset(offset, 8, this.length)\n  return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n  if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n  if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    var maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  var mul = 1\n  var i = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  byteLength = byteLength >>> 0\n  if (!noAssert) {\n    var maxBytes = Math.pow(2, 8 * byteLength) - 1\n    checkInt(this, value, offset, byteLength, maxBytes, 0)\n  }\n\n  var i = byteLength - 1\n  var mul = 1\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    this[offset + i] = (value / mul) & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  return offset + 2\n}\n\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n  this[offset] = (value >>> 8)\n  this[offset + 1] = (value & 0xff)\n  return offset + 2\n}\n\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  this[offset + 3] = (value >>> 24)\n  this[offset + 2] = (value >>> 16)\n  this[offset + 1] = (value >>> 8)\n  this[offset] = (value & 0xff)\n  return offset + 4\n}\n\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n  this[offset] = (value >>> 24)\n  this[offset + 1] = (value >>> 16)\n  this[offset + 2] = (value >>> 8)\n  this[offset + 3] = (value & 0xff)\n  return offset + 4\n}\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    var limit = Math.pow(2, (8 * byteLength) - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  var i = 0\n  var mul = 1\n  var sub = 0\n  this[offset] = value & 0xFF\n  while (++i < byteLength && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    var limit = Math.pow(2, (8 * byteLength) - 1)\n\n    checkInt(this, value, offset, byteLength, limit - 1, -limit)\n  }\n\n  var i = byteLength - 1\n  var mul = 1\n  var sub = 0\n  this[offset + i] = value & 0xFF\n  while (--i >= 0 && (mul *= 0x100)) {\n    if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n      sub = 1\n    }\n    this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n  }\n\n  return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n  if (value < 0) value = 0xff + value + 1\n  this[offset] = (value & 0xff)\n  return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n  this[offset] = (value >>> 8)\n  this[offset + 1] = (value & 0xff)\n  return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  this[offset] = (value & 0xff)\n  this[offset + 1] = (value >>> 8)\n  this[offset + 2] = (value >>> 16)\n  this[offset + 3] = (value >>> 24)\n  return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n  if (value < 0) value = 0xffffffff + value + 1\n  this[offset] = (value >>> 24)\n  this[offset + 1] = (value >>> 16)\n  this[offset + 2] = (value >>> 8)\n  this[offset + 3] = (value & 0xff)\n  return offset + 4\n}\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n  if (offset + ext > buf.length) throw new RangeError('Index out of range')\n  if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 23, 4)\n  return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n  return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n  value = +value\n  offset = offset >>> 0\n  if (!noAssert) {\n    checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n  }\n  ieee754.write(buf, value, offset, littleEndian, 52, 8)\n  return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n  return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n  if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\n  if (!start) start = 0\n  if (!end && end !== 0) end = this.length\n  if (targetStart >= target.length) targetStart = target.length\n  if (!targetStart) targetStart = 0\n  if (end > 0 && end < start) end = start\n\n  // Copy 0 bytes; we're done\n  if (end === start) return 0\n  if (target.length === 0 || this.length === 0) return 0\n\n  // Fatal error conditions\n  if (targetStart < 0) {\n    throw new RangeError('targetStart out of bounds')\n  }\n  if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n  if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n  // Are we oob?\n  if (end > this.length) end = this.length\n  if (target.length - targetStart < end - start) {\n    end = target.length - targetStart + start\n  }\n\n  var len = end - start\n\n  if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n    // Use built-in when available, missing from IE11\n    this.copyWithin(targetStart, start, end)\n  } else if (this === target && start < targetStart && targetStart < end) {\n    // descending copy from end\n    for (var i = len - 1; i >= 0; --i) {\n      target[i + targetStart] = this[i + start]\n    }\n  } else {\n    Uint8Array.prototype.set.call(\n      target,\n      this.subarray(start, end),\n      targetStart\n    )\n  }\n\n  return len\n}\n\n// Usage:\n//    buffer.fill(number[, offset[, end]])\n//    buffer.fill(buffer[, offset[, end]])\n//    buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n  // Handle string cases:\n  if (typeof val === 'string') {\n    if (typeof start === 'string') {\n      encoding = start\n      start = 0\n      end = this.length\n    } else if (typeof end === 'string') {\n      encoding = end\n      end = this.length\n    }\n    if (encoding !== undefined && typeof encoding !== 'string') {\n      throw new TypeError('encoding must be a string')\n    }\n    if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n      throw new TypeError('Unknown encoding: ' + encoding)\n    }\n    if (val.length === 1) {\n      var code = val.charCodeAt(0)\n      if ((encoding === 'utf8' && code < 128) ||\n          encoding === 'latin1') {\n        // Fast path: If `val` fits into a single byte, use that numeric value.\n        val = code\n      }\n    }\n  } else if (typeof val === 'number') {\n    val = val & 255\n  } else if (typeof val === 'boolean') {\n    val = Number(val)\n  }\n\n  // Invalid ranges are not set to a default, so can range check early.\n  if (start < 0 || this.length < start || this.length < end) {\n    throw new RangeError('Out of range index')\n  }\n\n  if (end <= start) {\n    return this\n  }\n\n  start = start >>> 0\n  end = end === undefined ? this.length : end >>> 0\n\n  if (!val) val = 0\n\n  var i\n  if (typeof val === 'number') {\n    for (i = start; i < end; ++i) {\n      this[i] = val\n    }\n  } else {\n    var bytes = Buffer.isBuffer(val)\n      ? val\n      : Buffer.from(val, encoding)\n    var len = bytes.length\n    if (len === 0) {\n      throw new TypeError('The value \"' + val +\n        '\" is invalid for argument \"value\"')\n    }\n    for (i = 0; i < end - start; ++i) {\n      this[i + start] = bytes[i % len]\n    }\n  }\n\n  return this\n}\n\n// HELPER FUNCTIONS\n// ================\n\nvar INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n  // Node takes equal signs as end of the Base64 encoding\n  str = str.split('=')[0]\n  // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n  str = str.trim().replace(INVALID_BASE64_RE, '')\n  // Node converts strings with length < 2 to ''\n  if (str.length < 2) return ''\n  // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n  while (str.length % 4 !== 0) {\n    str = str + '='\n  }\n  return str\n}\n\nfunction utf8ToBytes (string, units) {\n  units = units || Infinity\n  var codePoint\n  var length = string.length\n  var leadSurrogate = null\n  var bytes = []\n\n  for (var i = 0; i < length; ++i) {\n    codePoint = string.charCodeAt(i)\n\n    // is surrogate component\n    if (codePoint > 0xD7FF && codePoint < 0xE000) {\n      // last char was a lead\n      if (!leadSurrogate) {\n        // no lead yet\n        if (codePoint > 0xDBFF) {\n          // unexpected trail\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        } else if (i + 1 === length) {\n          // unpaired lead\n          if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n          continue\n        }\n\n        // valid lead\n        leadSurrogate = codePoint\n\n        continue\n      }\n\n      // 2 leads in a row\n      if (codePoint < 0xDC00) {\n        if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n        leadSurrogate = codePoint\n        continue\n      }\n\n      // valid surrogate pair\n      codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n    } else if (leadSurrogate) {\n      // valid bmp char, but last char was a lead\n      if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n    }\n\n    leadSurrogate = null\n\n    // encode utf8\n    if (codePoint < 0x80) {\n      if ((units -= 1) < 0) break\n      bytes.push(codePoint)\n    } else if (codePoint < 0x800) {\n      if ((units -= 2) < 0) break\n      bytes.push(\n        codePoint >> 0x6 | 0xC0,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x10000) {\n      if ((units -= 3) < 0) break\n      bytes.push(\n        codePoint >> 0xC | 0xE0,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else if (codePoint < 0x110000) {\n      if ((units -= 4) < 0) break\n      bytes.push(\n        codePoint >> 0x12 | 0xF0,\n        codePoint >> 0xC & 0x3F | 0x80,\n        codePoint >> 0x6 & 0x3F | 0x80,\n        codePoint & 0x3F | 0x80\n      )\n    } else {\n      throw new Error('Invalid code point')\n    }\n  }\n\n  return bytes\n}\n\nfunction asciiToBytes (str) {\n  var byteArray = []\n  for (var i = 0; i < str.length; ++i) {\n    // Node's code seems to be doing this and not & 0x7F..\n    byteArray.push(str.charCodeAt(i) & 0xFF)\n  }\n  return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n  var c, hi, lo\n  var byteArray = []\n  for (var i = 0; i < str.length; ++i) {\n    if ((units -= 2) < 0) break\n\n    c = str.charCodeAt(i)\n    hi = c >> 8\n    lo = c % 256\n    byteArray.push(lo)\n    byteArray.push(hi)\n  }\n\n  return byteArray\n}\n\nfunction base64ToBytes (str) {\n  return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n  for (var i = 0; i < length; ++i) {\n    if ((i + offset >= dst.length) || (i >= src.length)) break\n    dst[i + offset] = src[i]\n  }\n  return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n  return obj instanceof type ||\n    (obj != null && obj.constructor != null && obj.constructor.name != null &&\n      obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n  // For IE11 support\n  return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nvar hexSliceLookupTable = (function () {\n  var alphabet = '0123456789abcdef'\n  var table = new Array(256)\n  for (var i = 0; i < 16; ++i) {\n    var i16 = i * 16\n    for (var j = 0; j < 16; ++j) {\n      table[i16 + j] = alphabet[i] + alphabet[j]\n    }\n  }\n  return table\n})()\n", null, null, null, null, "export default {};\n", "\nvar inherits;\nif (typeof Object.create === 'function'){\n  inherits = function inherits(ctor, superCtor) {\n    // implementation from standard node.js 'util' module\n    ctor.super_ = superCtor\n    ctor.prototype = Object.create(superCtor.prototype, {\n      constructor: {\n        value: ctor,\n        enumerable: false,\n        writable: true,\n        configurable: true\n      }\n    });\n  };\n} else {\n  inherits = function inherits(ctor, superCtor) {\n    ctor.super_ = superCtor\n    var TempCtor = function () {}\n    TempCtor.prototype = superCtor.prototype\n    ctor.prototype = new TempCtor()\n    ctor.prototype.constructor = ctor\n  }\n}\nexport default inherits;\n", "// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\nimport process from 'process';\nvar formatRegExp = /%[sdj%]/g;\nexport function format(f) {\n  if (!isString(f)) {\n    var objects = [];\n    for (var i = 0; i < arguments.length; i++) {\n      objects.push(inspect(arguments[i]));\n    }\n    return objects.join(' ');\n  }\n\n  var i = 1;\n  var args = arguments;\n  var len = args.length;\n  var str = String(f).replace(formatRegExp, function(x) {\n    if (x === '%%') return '%';\n    if (i >= len) return x;\n    switch (x) {\n      case '%s': return String(args[i++]);\n      case '%d': return Number(args[i++]);\n      case '%j':\n        try {\n          return JSON.stringify(args[i++]);\n        } catch (_) {\n          return '[Circular]';\n        }\n      default:\n        return x;\n    }\n  });\n  for (var x = args[i]; i < len; x = args[++i]) {\n    if (isNull(x) || !isObject(x)) {\n      str += ' ' + x;\n    } else {\n      str += ' ' + inspect(x);\n    }\n  }\n  return str;\n};\n\n\n// Mark that a method should not be used.\n// Returns a modified function which warns once by default.\n// If --no-deprecation is set, then it is a no-op.\nexport function deprecate(fn, msg) {\n  // Allow for deprecating things in the process of starting up.\n  if (isUndefined(global.process)) {\n    return function() {\n      return deprecate(fn, msg).apply(this, arguments);\n    };\n  }\n\n  if (process.noDeprecation === true) {\n    return fn;\n  }\n\n  var warned = false;\n  function deprecated() {\n    if (!warned) {\n      if (process.throwDeprecation) {\n        throw new Error(msg);\n      } else if (process.traceDeprecation) {\n        console.trace(msg);\n      } else {\n        console.error(msg);\n      }\n      warned = true;\n    }\n    return fn.apply(this, arguments);\n  }\n\n  return deprecated;\n};\n\n\nvar debugs = {};\nvar debugEnviron;\nexport function debuglog(set) {\n  if (isUndefined(debugEnviron))\n    debugEnviron = process.env.NODE_DEBUG || '';\n  set = set.toUpperCase();\n  if (!debugs[set]) {\n    if (new RegExp('\\\\b' + set + '\\\\b', 'i').test(debugEnviron)) {\n      var pid = 0;\n      debugs[set] = function() {\n        var msg = format.apply(null, arguments);\n        console.error('%s %d: %s', set, pid, msg);\n      };\n    } else {\n      debugs[set] = function() {};\n    }\n  }\n  return debugs[set];\n};\n\n\n/**\n * Echos the value of a value. Trys to print the value out\n * in the best way possible given the different types.\n *\n * @param {Object} obj The object to print out.\n * @param {Object} opts Optional options object that alters the output.\n */\n/* legacy: obj, showHidden, depth, colors*/\nexport function inspect(obj, opts) {\n  // default options\n  var ctx = {\n    seen: [],\n    stylize: stylizeNoColor\n  };\n  // legacy...\n  if (arguments.length >= 3) ctx.depth = arguments[2];\n  if (arguments.length >= 4) ctx.colors = arguments[3];\n  if (isBoolean(opts)) {\n    // legacy...\n    ctx.showHidden = opts;\n  } else if (opts) {\n    // got an \"options\" object\n    _extend(ctx, opts);\n  }\n  // set default options\n  if (isUndefined(ctx.showHidden)) ctx.showHidden = false;\n  if (isUndefined(ctx.depth)) ctx.depth = 2;\n  if (isUndefined(ctx.colors)) ctx.colors = false;\n  if (isUndefined(ctx.customInspect)) ctx.customInspect = true;\n  if (ctx.colors) ctx.stylize = stylizeWithColor;\n  return formatValue(ctx, obj, ctx.depth);\n}\n\n// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics\ninspect.colors = {\n  'bold' : [1, 22],\n  'italic' : [3, 23],\n  'underline' : [4, 24],\n  'inverse' : [7, 27],\n  'white' : [37, 39],\n  'grey' : [90, 39],\n  'black' : [30, 39],\n  'blue' : [34, 39],\n  'cyan' : [36, 39],\n  'green' : [32, 39],\n  'magenta' : [35, 39],\n  'red' : [31, 39],\n  'yellow' : [33, 39]\n};\n\n// Don't use 'blue' not visible on cmd.exe\ninspect.styles = {\n  'special': 'cyan',\n  'number': 'yellow',\n  'boolean': 'yellow',\n  'undefined': 'grey',\n  'null': 'bold',\n  'string': 'green',\n  'date': 'magenta',\n  // \"name\": intentionally not styling\n  'regexp': 'red'\n};\n\n\nfunction stylizeWithColor(str, styleType) {\n  var style = inspect.styles[styleType];\n\n  if (style) {\n    return '\\u001b[' + inspect.colors[style][0] + 'm' + str +\n           '\\u001b[' + inspect.colors[style][1] + 'm';\n  } else {\n    return str;\n  }\n}\n\n\nfunction stylizeNoColor(str, styleType) {\n  return str;\n}\n\n\nfunction arrayToHash(array) {\n  var hash = {};\n\n  array.forEach(function(val, idx) {\n    hash[val] = true;\n  });\n\n  return hash;\n}\n\n\nfunction formatValue(ctx, value, recurseTimes) {\n  // Provide a hook for user-specified inspect functions.\n  // Check that value is an object with an inspect function on it\n  if (ctx.customInspect &&\n      value &&\n      isFunction(value.inspect) &&\n      // Filter out the util module, it's inspect function is special\n      value.inspect !== inspect &&\n      // Also filter out any prototype objects using the circular check.\n      !(value.constructor && value.constructor.prototype === value)) {\n    var ret = value.inspect(recurseTimes, ctx);\n    if (!isString(ret)) {\n      ret = formatValue(ctx, ret, recurseTimes);\n    }\n    return ret;\n  }\n\n  // Primitive types cannot have properties\n  var primitive = formatPrimitive(ctx, value);\n  if (primitive) {\n    return primitive;\n  }\n\n  // Look up the keys of the object.\n  var keys = Object.keys(value);\n  var visibleKeys = arrayToHash(keys);\n\n  if (ctx.showHidden) {\n    keys = Object.getOwnPropertyNames(value);\n  }\n\n  // IE doesn't make error fields non-enumerable\n  // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx\n  if (isError(value)\n      && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {\n    return formatError(value);\n  }\n\n  // Some type of object without properties can be shortcutted.\n  if (keys.length === 0) {\n    if (isFunction(value)) {\n      var name = value.name ? ': ' + value.name : '';\n      return ctx.stylize('[Function' + name + ']', 'special');\n    }\n    if (isRegExp(value)) {\n      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n    }\n    if (isDate(value)) {\n      return ctx.stylize(Date.prototype.toString.call(value), 'date');\n    }\n    if (isError(value)) {\n      return formatError(value);\n    }\n  }\n\n  var base = '', array = false, braces = ['{', '}'];\n\n  // Make Array say that they are Array\n  if (isArray(value)) {\n    array = true;\n    braces = ['[', ']'];\n  }\n\n  // Make functions say that they are functions\n  if (isFunction(value)) {\n    var n = value.name ? ': ' + value.name : '';\n    base = ' [Function' + n + ']';\n  }\n\n  // Make RegExps say that they are RegExps\n  if (isRegExp(value)) {\n    base = ' ' + RegExp.prototype.toString.call(value);\n  }\n\n  // Make dates with properties first say the date\n  if (isDate(value)) {\n    base = ' ' + Date.prototype.toUTCString.call(value);\n  }\n\n  // Make error with message first say the error\n  if (isError(value)) {\n    base = ' ' + formatError(value);\n  }\n\n  if (keys.length === 0 && (!array || value.length == 0)) {\n    return braces[0] + base + braces[1];\n  }\n\n  if (recurseTimes < 0) {\n    if (isRegExp(value)) {\n      return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n    } else {\n      return ctx.stylize('[Object]', 'special');\n    }\n  }\n\n  ctx.seen.push(value);\n\n  var output;\n  if (array) {\n    output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);\n  } else {\n    output = keys.map(function(key) {\n      return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);\n    });\n  }\n\n  ctx.seen.pop();\n\n  return reduceToSingleString(output, base, braces);\n}\n\n\nfunction formatPrimitive(ctx, value) {\n  if (isUndefined(value))\n    return ctx.stylize('undefined', 'undefined');\n  if (isString(value)) {\n    var simple = '\\'' + JSON.stringify(value).replace(/^\"|\"$/g, '')\n                                             .replace(/'/g, \"\\\\'\")\n                                             .replace(/\\\\\"/g, '\"') + '\\'';\n    return ctx.stylize(simple, 'string');\n  }\n  if (isNumber(value))\n    return ctx.stylize('' + value, 'number');\n  if (isBoolean(value))\n    return ctx.stylize('' + value, 'boolean');\n  // For some reason typeof null is \"object\", so special case here.\n  if (isNull(value))\n    return ctx.stylize('null', 'null');\n}\n\n\nfunction formatError(value) {\n  return '[' + Error.prototype.toString.call(value) + ']';\n}\n\n\nfunction formatArray(ctx, value, recurseTimes, visibleKeys, keys) {\n  var output = [];\n  for (var i = 0, l = value.length; i < l; ++i) {\n    if (hasOwnProperty(value, String(i))) {\n      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n          String(i), true));\n    } else {\n      output.push('');\n    }\n  }\n  keys.forEach(function(key) {\n    if (!key.match(/^\\d+$/)) {\n      output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n          key, true));\n    }\n  });\n  return output;\n}\n\n\nfunction formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {\n  var name, str, desc;\n  desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };\n  if (desc.get) {\n    if (desc.set) {\n      str = ctx.stylize('[Getter/Setter]', 'special');\n    } else {\n      str = ctx.stylize('[Getter]', 'special');\n    }\n  } else {\n    if (desc.set) {\n      str = ctx.stylize('[Setter]', 'special');\n    }\n  }\n  if (!hasOwnProperty(visibleKeys, key)) {\n    name = '[' + key + ']';\n  }\n  if (!str) {\n    if (ctx.seen.indexOf(desc.value) < 0) {\n      if (isNull(recurseTimes)) {\n        str = formatValue(ctx, desc.value, null);\n      } else {\n        str = formatValue(ctx, desc.value, recurseTimes - 1);\n      }\n      if (str.indexOf('\\n') > -1) {\n        if (array) {\n          str = str.split('\\n').map(function(line) {\n            return '  ' + line;\n          }).join('\\n').substr(2);\n        } else {\n          str = '\\n' + str.split('\\n').map(function(line) {\n            return '   ' + line;\n          }).join('\\n');\n        }\n      }\n    } else {\n      str = ctx.stylize('[Circular]', 'special');\n    }\n  }\n  if (isUndefined(name)) {\n    if (array && key.match(/^\\d+$/)) {\n      return str;\n    }\n    name = JSON.stringify('' + key);\n    if (name.match(/^\"([a-zA-Z_][a-zA-Z_0-9]*)\"$/)) {\n      name = name.substr(1, name.length - 2);\n      name = ctx.stylize(name, 'name');\n    } else {\n      name = name.replace(/'/g, \"\\\\'\")\n                 .replace(/\\\\\"/g, '\"')\n                 .replace(/(^\"|\"$)/g, \"'\");\n      name = ctx.stylize(name, 'string');\n    }\n  }\n\n  return name + ': ' + str;\n}\n\n\nfunction reduceToSingleString(output, base, braces) {\n  var numLinesEst = 0;\n  var length = output.reduce(function(prev, cur) {\n    numLinesEst++;\n    if (cur.indexOf('\\n') >= 0) numLinesEst++;\n    return prev + cur.replace(/\\u001b\\[\\d\\d?m/g, '').length + 1;\n  }, 0);\n\n  if (length > 60) {\n    return braces[0] +\n           (base === '' ? '' : base + '\\n ') +\n           ' ' +\n           output.join(',\\n  ') +\n           ' ' +\n           braces[1];\n  }\n\n  return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];\n}\n\n\n// NOTE: These type checking functions intentionally don't use `instanceof`\n// because it is fragile and can be easily faked with `Object.create()`.\nexport function isArray(ar) {\n  return Array.isArray(ar);\n}\n\nexport function isBoolean(arg) {\n  return typeof arg === 'boolean';\n}\n\nexport function isNull(arg) {\n  return arg === null;\n}\n\nexport function isNullOrUndefined(arg) {\n  return arg == null;\n}\n\nexport function isNumber(arg) {\n  return typeof arg === 'number';\n}\n\nexport function isString(arg) {\n  return typeof arg === 'string';\n}\n\nexport function isSymbol(arg) {\n  return typeof arg === 'symbol';\n}\n\nexport function isUndefined(arg) {\n  return arg === void 0;\n}\n\nexport function isRegExp(re) {\n  return isObject(re) && objectToString(re) === '[object RegExp]';\n}\n\nexport function isObject(arg) {\n  return typeof arg === 'object' && arg !== null;\n}\n\nexport function isDate(d) {\n  return isObject(d) && objectToString(d) === '[object Date]';\n}\n\nexport function isError(e) {\n  return isObject(e) &&\n      (objectToString(e) === '[object Error]' || e instanceof Error);\n}\n\nexport function isFunction(arg) {\n  return typeof arg === 'function';\n}\n\nexport function isPrimitive(arg) {\n  return arg === null ||\n         typeof arg === 'boolean' ||\n         typeof arg === 'number' ||\n         typeof arg === 'string' ||\n         typeof arg === 'symbol' ||  // ES6 symbol\n         typeof arg === 'undefined';\n}\n\nexport function isBuffer(maybeBuf) {\n  return Buffer.isBuffer(maybeBuf);\n}\n\nfunction objectToString(o) {\n  return Object.prototype.toString.call(o);\n}\n\n\nfunction pad(n) {\n  return n < 10 ? '0' + n.toString(10) : n.toString(10);\n}\n\n\nvar months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',\n              'Oct', 'Nov', 'Dec'];\n\n// 26 Feb 16:19:34\nfunction timestamp() {\n  var d = new Date();\n  var time = [pad(d.getHours()),\n              pad(d.getMinutes()),\n              pad(d.getSeconds())].join(':');\n  return [d.getDate(), months[d.getMonth()], time].join(' ');\n}\n\n\n// log is just a thin wrapper to console.log that prepends a timestamp\nexport function log() {\n  console.log('%s - %s', timestamp(), format.apply(null, arguments));\n}\n\n\n/**\n * Inherit the prototype methods from one constructor into another.\n *\n * The Function.prototype.inherits from lang.js rewritten as a standalone\n * function (not on Function.prototype). NOTE: If this file is to be loaded\n * during bootstrapping this function needs to be rewritten using some native\n * functions as prototype setup using normal JavaScript does not work as\n * expected during bootstrapping (see mirror.js in r114903).\n *\n * @param {function} ctor Constructor function which needs to inherit the\n *     prototype.\n * @param {function} superCtor Constructor function to inherit prototype from.\n */\nimport inherits from './inherits';\nexport {inherits}\n\nexport function _extend(origin, add) {\n  // Don't do anything if add isn't an object\n  if (!add || !isObject(add)) return origin;\n\n  var keys = Object.keys(add);\n  var i = keys.length;\n  while (i--) {\n    origin[keys[i]] = add[keys[i]];\n  }\n  return origin;\n};\n\nfunction hasOwnProperty(obj, prop) {\n  return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nexport default {\n  inherits: inherits,\n  _extend: _extend,\n  log: log,\n  isBuffer: isBuffer,\n  isPrimitive: isPrimitive,\n  isFunction: isFunction,\n  isError: isError,\n  isDate: isDate,\n  isObject: isObject,\n  isRegExp: isRegExp,\n  isUndefined: isUndefined,\n  isSymbol: isSymbol,\n  isString: isString,\n  isNumber: isNumber,\n  isNullOrUndefined: isNullOrUndefined,\n  isNull: isNull,\n  isBoolean: isBoolean,\n  isArray: isArray,\n  inspect: inspect,\n  deprecate: deprecate,\n  format: format,\n  debuglog: debuglog\n}\n", null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, "// loaders.gl, MIT license\n\nimport type {DeserializeOptions} from 'bson';\nimport {deserialize} from 'bson';\n\nexport type ParseBSONOptions = DeserializeOptions;\n\nexport function parseBSONSync(\n  value: ArrayBuffer,\n  options?: ParseBSONOptions\n): Record<string, unknown> {\n  const parsedData = deserialize(new Uint8Array(value), options);\n  return parsedData;\n}\n", "// loaders.gl, MIT license\nimport type {LoaderWithParser, LoaderOptions} from '@loaders.gl/loader-utils';\nimport type {ParseBSONOptions} from './lib/parsers/parse-bson';\nimport {parseBSONSync} from './lib/parsers/parse-bson';\n\n// __VERSION__ is injected by babel-plugin-version-inline\n// @ts-ignore TS2304: Cannot find name '__VERSION__'.\nconst VERSION = typeof __VERSION__ !== 'undefined' ? __VERSION__ : 'latest';\n\n/**\n * @param table -\n * @param bsonpaths -\n */\nexport type BSONLoaderOptions = LoaderOptions & {\n  bson?: ParseBSONOptions;\n};\n\nexport const BSONLoader: LoaderWithParser<Record<string, unknown>, never, BSONLoaderOptions> = {\n  name: 'BSON',\n  id: 'bson',\n  module: 'bson',\n  version: VERSION,\n  extensions: ['bson'],\n  mimeTypes: ['application/bson'],\n  category: 'json',\n  binary: true,\n  parse,\n  parseSync,\n  options: {\n    bson: {}\n  }\n};\n\nasync function parse(arrayBuffer: ArrayBuffer, options?: BSONLoaderOptions) {\n  const bsonOptions = {...BSONLoader.options.bson, ...options?.bson};\n  return parseBSONSync(arrayBuffer, bsonOptions);\n}\n\nfunction parseSync(arrayBuffer: ArrayBuffer, options?: BSONLoaderOptions) {\n  const bsonOptions = {...BSONLoader.options.bson, ...options?.bson};\n  return parseBSONSync(arrayBuffer, bsonOptions);\n}\n", "// loaders.gl, MIT license\n\nimport type {SerializeOptions} from 'bson';\nimport {serialize} from 'bson';\n\nexport type EncodeBSONOptions = SerializeOptions;\n\nexport function encodeBSONSync(\n  value: Record<string, unknown>,\n  options?: EncodeBSONOptions\n): ArrayBuffer {\n  const uint8Array = serialize(value);\n  // TODO - make sure the uint8array occupies the entire buffer.\n  return uint8Array.buffer;\n}\n", "// loaders.gl, MIT license\n\nimport type {Writer, WriterOptions} from '@loaders.gl/loader-utils';\nimport type {EncodeBSONOptions} from './lib/encoders/encode-bson';\nimport {encodeBSONSync} from './lib/encoders/encode-bson';\n\n// __VERSION__ is injected by babel-plugin-version-inline\n// @ts-ignore TS2304: Cannot find name '__VERSION__'.\nconst VERSION = typeof __VERSION__ !== 'undefined' ? __VERSION__ : 'latest';\n\nexport type BSONWriterOptions = WriterOptions & {\n  bson?: EncodeBSONOptions\n}\n\nexport const BSONWriter: Writer<Record<string, unknown>, never, BSONWriterOptions> = {\n  name: 'BSON',\n  id: 'bson',\n  module: 'bson',\n  version: VERSION,\n  extensions: ['bson'],\n  options: {\n    bson: {}\n  },\n  async encode(data: Record<string, unknown>, options?: WriterOptions): Promise<ArrayBuffer> {\n    return encodeBSONSync(data, {}); // options\n  },\n  encodeSync(data: Record<string, unknown>, options?: WriterOptions): ArrayBuffer {\n    return encodeBSONSync(data, {}); // options\n  }\n};\n", "// Forked from https://github.com/kbajalc/parquets under MIT license (Copyright (c) 2017 ironSource Ltd.)\n/* eslint-disable camelcase */\nimport {BSONLoader, BSONWriter} from '@loaders.gl/bson';\nimport {OriginalType, ParquetField, ParquetType, PrimitiveType} from './declare';\n\nexport interface ParquetTypeKit {\n  primitiveType: PrimitiveType;\n  originalType?: OriginalType;\n  typeLength?: number;\n  toPrimitive: Function;\n  fromPrimitive?: Function;\n}\n\nexport const PARQUET_LOGICAL_TYPES: Record<ParquetType, ParquetTypeKit> = {\n  BOOLEAN: {\n    primitiveType: 'BOOLEAN',\n    toPrimitive: toPrimitive_BOOLEAN,\n    fromPrimitive: fromPrimitive_BOOLEAN\n  },\n  INT32: {\n    primitiveType: 'INT32',\n    toPrimitive: toPrimitive_INT32\n  },\n  INT64: {\n    primitiveType: 'INT64',\n    toPrimitive: toPrimitive_INT64\n  },\n  INT96: {\n    primitiveType: 'INT96',\n    toPrimitive: toPrimitive_INT96\n  },\n  FLOAT: {\n    primitiveType: 'FLOAT',\n    toPrimitive: toPrimitive_FLOAT\n  },\n  DOUBLE: {\n    primitiveType: 'DOUBLE',\n    toPrimitive: toPrimitive_DOUBLE\n  },\n  BYTE_ARRAY: {\n    primitiveType: 'BYTE_ARRAY',\n    toPrimitive: toPrimitive_BYTE_ARRAY\n  },\n  FIXED_LEN_BYTE_ARRAY: {\n    primitiveType: 'FIXED_LEN_BYTE_ARRAY',\n    toPrimitive: toPrimitive_BYTE_ARRAY\n  },\n  UTF8: {\n    primitiveType: 'BYTE_ARRAY',\n    originalType: 'UTF8',\n    toPrimitive: toPrimitive_UTF8,\n    fromPrimitive: fromPrimitive_UTF8\n  },\n  TIME_MILLIS: {\n    primitiveType: 'INT32',\n    originalType: 'TIME_MILLIS',\n    toPrimitive: toPrimitive_TIME_MILLIS\n  },\n  TIME_MICROS: {\n    primitiveType: 'INT64',\n    originalType: 'TIME_MICROS',\n    toPrimitive: toPrimitive_TIME_MICROS\n  },\n  DATE: {\n    primitiveType: 'INT32',\n    originalType: 'DATE',\n    toPrimitive: toPrimitive_DATE,\n    fromPrimitive: fromPrimitive_DATE\n  },\n  TIMESTAMP_MILLIS: {\n    primitiveType: 'INT64',\n    originalType: 'TIMESTAMP_MILLIS',\n    toPrimitive: toPrimitive_TIMESTAMP_MILLIS,\n    fromPrimitive: fromPrimitive_TIMESTAMP_MILLIS\n  },\n  TIMESTAMP_MICROS: {\n    primitiveType: 'INT64',\n    originalType: 'TIMESTAMP_MICROS',\n    toPrimitive: toPrimitive_TIMESTAMP_MICROS,\n    fromPrimitive: fromPrimitive_TIMESTAMP_MICROS\n  },\n  UINT_8: {\n    primitiveType: 'INT32',\n    originalType: 'UINT_8',\n    toPrimitive: toPrimitive_UINT8\n  },\n  UINT_16: {\n    primitiveType: 'INT32',\n    originalType: 'UINT_16',\n    toPrimitive: toPrimitive_UINT16\n  },\n  UINT_32: {\n    primitiveType: 'INT32',\n    originalType: 'UINT_32',\n    toPrimitive: toPrimitive_UINT32\n  },\n  UINT_64: {\n    primitiveType: 'INT64',\n    originalType: 'UINT_64',\n    toPrimitive: toPrimitive_UINT64\n  },\n  INT_8: {\n    primitiveType: 'INT32',\n    originalType: 'INT_8',\n    toPrimitive: toPrimitive_INT8\n  },\n  INT_16: {\n    primitiveType: 'INT32',\n    originalType: 'INT_16',\n    toPrimitive: toPrimitive_INT16\n  },\n  INT_32: {\n    primitiveType: 'INT32',\n    originalType: 'INT_32',\n    toPrimitive: toPrimitive_INT32\n  },\n  INT_64: {\n    primitiveType: 'INT64',\n    originalType: 'INT_64',\n    toPrimitive: toPrimitive_INT64\n  },\n  JSON: {\n    primitiveType: 'BYTE_ARRAY',\n    originalType: 'JSON',\n    toPrimitive: toPrimitive_JSON,\n    fromPrimitive: fromPrimitive_JSON\n  },\n  BSON: {\n    primitiveType: 'BYTE_ARRAY',\n    originalType: 'BSON',\n    toPrimitive: toPrimitive_BSON,\n    fromPrimitive: fromPrimitive_BSON\n  },\n  INTERVAL: {\n    primitiveType: 'FIXED_LEN_BYTE_ARRAY',\n    originalType: 'INTERVAL',\n    typeLength: 12,\n    toPrimitive: toPrimitive_INTERVAL,\n    fromPrimitive: fromPrimitive_INTERVAL\n  },\n  DECIMAL_INT32: {\n    primitiveType: 'INT32',\n    originalType: 'DECIMAL_INT32',\n    toPrimitive: decimalToPrimitive_INT32,\n    fromPrimitive: decimalFromPrimitive_INT\n  },\n  DECIMAL_INT64: {\n    primitiveType: 'INT64',\n    originalType: 'DECIMAL_INT64',\n    toPrimitive: decimalToPrimitive_INT64,\n    fromPrimitive: decimalFromPrimitive_INT\n  },\n  DECIMAL_BYTE_ARRAY: {\n    primitiveType: 'BYTE_ARRAY',\n    originalType: 'DECIMAL_BYTE_ARRAY',\n    toPrimitive: decimalToPrimitive_BYTE_ARRAY,\n    fromPrimitive: decimalFromPrimitive_BYTE_ARRAY\n  },\n  DECIMAL_FIXED_LEN_BYTE_ARRAY: {\n    primitiveType: 'FIXED_LEN_BYTE_ARRAY',\n    originalType: 'DECIMAL_FIXED_LEN_BYTE_ARRAY',\n    toPrimitive: decimalToPrimitive_BYTE_ARRAY,\n    fromPrimitive: decimalFromPrimitive_BYTE_ARRAY\n  }\n};\n\n/**\n * Convert a value from it's native representation to the internal/underlying\n * primitive type\n */\nexport function toPrimitive(type: ParquetType, value: unknown, field?: ParquetField): unknown {\n  if (!(type in PARQUET_LOGICAL_TYPES)) {\n    throw new Error(`invalid type: ${type}`);\n  }\n\n  return PARQUET_LOGICAL_TYPES[type].toPrimitive(value, field);\n}\n\n/**\n * Convert a value from it's internal/underlying primitive representation to\n * the native representation\n */\nexport function fromPrimitive(type: ParquetType, value: unknown, field?: ParquetField) {\n  if (!(type in PARQUET_LOGICAL_TYPES)) {\n    throw new Error(`invalid type: ${type}`);\n  }\n\n  if ('fromPrimitive' in PARQUET_LOGICAL_TYPES[type]) {\n    return PARQUET_LOGICAL_TYPES[type].fromPrimitive?.(value, field);\n    // tslint:disable-next-line:no-else-after-return\n  }\n  return value;\n}\n\nfunction toPrimitive_BOOLEAN(value: unknown): boolean {\n  return Boolean(value);\n}\n\nfunction fromPrimitive_BOOLEAN(value: any): boolean {\n  return Boolean(value);\n}\n\nfunction toPrimitive_FLOAT(value: any): number {\n  const v = parseFloat(value);\n  if (isNaN(v)) {\n    throw new Error(`invalid value for FLOAT: ${value}`);\n  }\n  return v;\n}\n\nfunction toPrimitive_DOUBLE(value: any): number {\n  const v = parseFloat(value);\n  if (isNaN(v)) {\n    throw new Error(`invalid value for DOUBLE: ${value}`);\n  }\n  return v;\n}\n\nfunction toPrimitive_INT8(value: any) {\n  const v = parseInt(value, 10);\n  if (v < -0x80 || v > 0x7f || isNaN(v)) {\n    throw new Error(`invalid value for INT8: ${value}`);\n  }\n\n  return v;\n}\n\nfunction toPrimitive_UINT8(value: any) {\n  const v = parseInt(value, 10);\n  if (v < 0 || v > 0xff || isNaN(v)) {\n    throw new Error(`invalid value for UINT8: ${value}`);\n  }\n\n  return v;\n}\n\nfunction toPrimitive_INT16(value: any) {\n  const v = parseInt(value, 10);\n  if (v < -0x8000 || v > 0x7fff || isNaN(v)) {\n    throw new Error(`invalid value for INT16: ${value}`);\n  }\n\n  return v;\n}\n\nfunction toPrimitive_UINT16(value: any) {\n  const v = parseInt(value, 10);\n  if (v < 0 || v > 0xffff || isNaN(v)) {\n    throw new Error(`invalid value for UINT16: ${value}`);\n  }\n\n  return v;\n}\n\nfunction toPrimitive_INT32(value: any) {\n  const v = parseInt(value, 10);\n  if (v < -0x80000000 || v > 0x7fffffff || isNaN(v)) {\n    throw new Error(`invalid value for INT32: ${value}`);\n  }\n\n  return v;\n}\n\nfunction decimalToPrimitive_INT32(value: number, field: ParquetField): number {\n  const primitiveValue = value * 10 ** (field.scale || 0);\n  const v = Math.round(((primitiveValue * 10 ** -field.presision!) % 1) * 10 ** field.presision!);\n  if (v < -0x80000000 || v > 0x7fffffff || isNaN(v)) {\n    throw new Error(`invalid value for INT32: ${value}`);\n  }\n  return v;\n}\n\nfunction toPrimitive_UINT32(value: any): number {\n  const v = parseInt(value, 10);\n  if (v < 0 || v > 0xffffffffffff || isNaN(v)) {\n    throw new Error(`invalid value for UINT32: ${value}`);\n  }\n  return v;\n}\n\nfunction toPrimitive_INT64(value: any): number {\n  const v = parseInt(value, 10);\n  if (isNaN(v)) {\n    throw new Error(`invalid value for INT64: ${value}`);\n  }\n  return v;\n}\n\nfunction decimalToPrimitive_INT64(value: number, field: ParquetField) {\n  const primitiveValue = value * 10 ** (field.scale || 0);\n  const v = Math.round(((primitiveValue * 10 ** -field.presision!) % 1) * 10 ** field.presision!);\n  if (isNaN(v)) {\n    throw new Error(`invalid value for INT64: ${value}`);\n  }\n\n  return v;\n}\n\nfunction toPrimitive_UINT64(value: any) {\n  const v = parseInt(value, 10);\n  if (v < 0 || isNaN(v)) {\n    throw new Error(`invalid value for UINT64: ${value}`);\n  }\n\n  return v;\n}\n\nfunction toPrimitive_INT96(value: any) {\n  const v = parseInt(value, 10);\n  if (isNaN(v)) {\n    throw new Error(`invalid value for INT96: ${value}`);\n  }\n\n  return v;\n}\n\nfunction toPrimitive_BYTE_ARRAY(value: any): Buffer {\n  return Buffer.from(value);\n}\n\nfunction decimalToPrimitive_BYTE_ARRAY(value: any): Buffer {\n  // TBD\n  return Buffer.from(value);\n}\n\nfunction toPrimitive_UTF8(value: any): Buffer {\n  return Buffer.from(value, 'utf8');\n}\n\nfunction fromPrimitive_UTF8(value: any): string {\n  return value.toString();\n}\n\nfunction toPrimitive_JSON(value: any): Buffer {\n  return Buffer.from(JSON.stringify(value));\n}\n\nfunction fromPrimitive_JSON(value: any): unknown {\n  return JSON.parse(value);\n}\n\nfunction toPrimitive_BSON(value: any): Buffer {\n  const arrayBuffer = BSONWriter.encodeSync?.(value) as ArrayBuffer;\n  return Buffer.from(arrayBuffer);\n}\n\nfunction fromPrimitive_BSON(value: any) {\n  return BSONLoader.parseSync?.(value);\n}\n\nfunction toPrimitive_TIME_MILLIS(value: any) {\n  const v = parseInt(value, 10);\n  if (v < 0 || v > 0xffffffffffffffff || isNaN(v)) {\n    throw new Error(`invalid value for TIME_MILLIS: ${value}`);\n  }\n\n  return v;\n}\n\nfunction toPrimitive_TIME_MICROS(value: any): number {\n  const v = parseInt(value, 10);\n  if (v < 0 || isNaN(v)) {\n    throw new Error(`invalid value for TIME_MICROS: ${value}`);\n  }\n  return v;\n}\n\nconst kMillisPerDay = 86400000;\n\nfunction toPrimitive_DATE(value: any): number {\n  /* convert from date */\n  if (value instanceof Date) {\n    return value.getTime() / kMillisPerDay;\n  }\n\n  /* convert from integer */\n  {\n    const v = parseInt(value, 10);\n    if (v < 0 || isNaN(v)) {\n      throw new Error(`invalid value for DATE: ${value}`);\n    }\n\n    return v;\n  }\n}\n\nfunction fromPrimitive_DATE(value: any): Date {\n  return new Date(value * kMillisPerDay);\n}\n\nfunction toPrimitive_TIMESTAMP_MILLIS(value: any): number {\n  /* convert from date */\n  if (value instanceof Date) {\n    return value.getTime();\n  }\n\n  /* convert from integer */\n  {\n    const v = parseInt(value, 10);\n    if (v < 0 || isNaN(v)) {\n      throw new Error(`invalid value for TIMESTAMP_MILLIS: ${value}`);\n    }\n\n    return v;\n  }\n}\n\nfunction fromPrimitive_TIMESTAMP_MILLIS(value: any): Date {\n  return new Date(value);\n}\n\nfunction toPrimitive_TIMESTAMP_MICROS(value: any) {\n  /* convert from date */\n  if (value instanceof Date) {\n    return value.getTime() * 1000;\n  }\n\n  /* convert from integer */\n  {\n    const v = parseInt(value, 10);\n    if (v < 0 || isNaN(v)) {\n      throw new Error(`invalid value for TIMESTAMP_MICROS: ${value}`);\n    }\n\n    return v;\n  }\n}\n\nfunction fromPrimitive_TIMESTAMP_MICROS(value: any) {\n  return new Date(value / 1000);\n}\n\nfunction toPrimitive_INTERVAL(value: any) {\n  if (!value.months || !value.days || !value.milliseconds) {\n    throw new Error(\n      'value for INTERVAL must be object { months: ..., days: ..., milliseconds: ... }'\n    );\n  }\n\n  const buf = Buffer.alloc(12);\n\n  buf.writeUInt32LE(value.months, 0);\n  buf.writeUInt32LE(value.days, 4);\n  buf.writeUInt32LE(value.milliseconds, 8);\n  return buf;\n}\n\nfunction fromPrimitive_INTERVAL(value: any) {\n  const buf = Buffer.from(value);\n  const months = buf.readUInt32LE(0);\n  const days = buf.readUInt32LE(4);\n  const millis = buf.readUInt32LE(8);\n\n  return {months, days, milliseconds: millis};\n}\n\nfunction decimalFromPrimitive_INT(value: any, field: ParquetField) {\n  const presisionInt = Math.round(((value * 10 ** -field.presision!) % 1) * 10 ** field.presision!);\n  return presisionInt * 10 ** -(field.scale || 0);\n}\n\nfunction decimalFromPrimitive_BYTE_ARRAY(value: any, field: ParquetField) {\n  let number = 0;\n  if (value.length <= 4) {\n    // Bytewise operators faster. Use them if it is possible\n    for (let i = 0; i < value.length; i++) {\n      // `value.length - i - 1` bytes have reverse order (big-endian)\n      const component = value[i] << (8 * (value.length - i - 1));\n      number += component;\n    }\n  } else {\n    for (let i = 0; i < value.length; i++) {\n      // `value.length - i - 1` bytes have reverse order (big-endian)\n      const component = value[i] * 2 ** (8 * (value.length - 1 - i));\n      number += component;\n    }\n  }\n\n  const presisionInt = Math.round(\n    ((number * 10 ** -field.presision!) % 1) * 10 ** field.presision!\n  );\n  return presisionInt * 10 ** -(field.scale || 0);\n}\n", "// Forked from https://github.com/kbajalc/parquets under MIT license (Copyright (c) 2017 ironSource Ltd.)\n\nimport {ArrayType} from '@loaders.gl/schema';\nimport {ParquetRowGroup, ParquetColumnChunk, ParquetField, ParquetRow} from './declare';\nimport {ParquetSchema} from './schema';\nimport * as Types from './types';\n\nexport {ParquetRowGroup};\n\nexport function shredBuffer(schema: ParquetSchema): ParquetRowGroup {\n  const columnData: Record<string, ParquetColumnChunk> = {};\n  for (const field of schema.fieldList) {\n    columnData[field.key] = {\n      dlevels: [],\n      rlevels: [],\n      values: [],\n      pageHeaders: [],\n      count: 0\n    };\n  }\n  return {rowCount: 0, columnData};\n}\n\n/**\n * 'Shred' a record into a list of <value, repetition_level, definition_level>\n * tuples per column using the Google Dremel Algorithm..\n *\n * The rowGroup argument must point to an object into which the shredded record\n * will be returned. You may re-use the rowGroup for repeated calls to this function\n * to append to an existing rowGroup, as long as the schema is unchanged.\n *\n * The format in which the shredded records will be stored in the rowGroup is as\n * follows:\n *\n *   rowGroup = {\n *     columnData: [\n *       'my_col': {\n *          dlevels: [d1, d2, .. dN],\n *          rlevels: [r1, r2, .. rN],\n *          values: [v1, v2, .. vN],\n *        }, ...\n *      ],\n *      rowCount: X,\n *   }\n */\nexport function shredRecord(\n  schema: ParquetSchema,\n  record: ParquetRow,\n  rowGroup: ParquetRowGroup\n): void {\n  /* shred the record, this may raise an exception */\n  const data = shredBuffer(schema).columnData;\n\n  shredRecordFields(schema.fields, record, data, 0, 0);\n\n  /* if no error during shredding, add the shredded record to the rowGroup */\n  if (rowGroup.rowCount === 0) {\n    rowGroup.rowCount = 1;\n    rowGroup.columnData = data;\n    return;\n  }\n  rowGroup.rowCount += 1;\n  for (const field of schema.fieldList) {\n    Array.prototype.push.apply(rowGroup.columnData[field.key].rlevels, data[field.key].rlevels);\n    Array.prototype.push.apply(rowGroup.columnData[field.key].dlevels, data[field.key].dlevels);\n    Array.prototype.push.apply(rowGroup.columnData[field.key].values, data[field.key].values);\n    rowGroup.columnData[field.key].count += data[field.key].count;\n  }\n}\n\n// eslint-disable-next-line max-statements, complexity\nfunction shredRecordFields(\n  fields: Record<string, ParquetField>,\n  record: ParquetRow,\n  data: Record<string, ParquetColumnChunk>,\n  rLevel: number,\n  dLevel: number\n) {\n  for (const name in fields) {\n    const field = fields[name];\n\n    // fetch values\n    let values: any[] = [];\n    if (\n      record &&\n      field.name in record &&\n      record[field.name] !== undefined &&\n      record[field.name] !== null\n    ) {\n      if (record[field.name].constructor === Array) {\n        values = record[field.name];\n      } else {\n        values.push(record[field.name]);\n      }\n    }\n    // check values\n    if (values.length === 0 && Boolean(record) && field.repetitionType === 'REQUIRED') {\n      throw new Error(`missing required field: ${field.name}`);\n    }\n    if (values.length > 1 && field.repetitionType !== 'REPEATED') {\n      throw new Error(`too many values for field: ${field.name}`);\n    }\n\n    // push null\n    if (values.length === 0) {\n      if (field.isNested) {\n        shredRecordFields(field.fields!, null!, data, rLevel, dLevel);\n      } else {\n        data[field.key].count += 1;\n        data[field.key].rlevels.push(rLevel);\n        data[field.key].dlevels.push(dLevel);\n      }\n      continue; // eslint-disable-line no-continue\n    }\n\n    // push values\n    for (let i = 0; i < values.length; i++) {\n      const rlvl = i === 0 ? rLevel : field.rLevelMax;\n      if (field.isNested) {\n        shredRecordFields(field.fields!, values[i], data, rlvl, field.dLevelMax);\n      } else {\n        data[field.key].count += 1;\n        data[field.key].rlevels.push(rlvl);\n        data[field.key].dlevels.push(field.dLevelMax);\n        data[field.key].values.push(\n          Types.toPrimitive((field.originalType || field.primitiveType)!, values[i])\n        );\n      }\n    }\n  }\n}\n\n/**\n * 'Materialize' a list of <value, repetition_level, definition_level>\n * tuples back to nested records (objects/arrays) using the Google Dremel\n * Algorithm..\n *\n * The rowGroup argument must point to an object with the following structure (i.e.\n * the same structure that is returned by shredRecords):\n *\n *   rowGroup = {\n *     columnData: [\n *       'my_col': {\n *          dlevels: [d1, d2, .. dN],\n *          rlevels: [r1, r2, .. rN],\n *          values: [v1, v2, .. vN],\n *        }, ...\n *      ],\n *      rowCount: X,\n *   }\n */\nexport function materializeRows(schema: ParquetSchema, rowGroup: ParquetRowGroup): ParquetRow[] {\n  const rows: ParquetRow[] = [];\n  // rows = new Array(rowGroup.rowCount).fill({})'\n  for (let i = 0; i < rowGroup.rowCount; i++) {\n    rows.push({});\n  }\n  for (const key in rowGroup.columnData) {\n    const columnData = rowGroup.columnData[key];\n    if (columnData.count) {\n      materializeColumnAsRows(schema, columnData, key, rows);\n    }\n  }\n  return rows;\n}\n\n/** Populate record fields for one column */\n// eslint-disable-next-line max-statements, complexity\nfunction materializeColumnAsRows(\n  schema: ParquetSchema,\n  columnData: ParquetColumnChunk,\n  key: string,\n  rows: ParquetRow[]\n): void {\n  const field = schema.findField(key);\n  const branch = schema.findFieldBranch(key);\n\n  // tslint:disable-next-line:prefer-array-literal\n  const rLevels: number[] = new Array(field.rLevelMax + 1).fill(0);\n  let vIndex = 0;\n  for (let i = 0; i < columnData.count; i++) {\n    const dLevel = columnData.dlevels[i];\n    const rLevel = columnData.rlevels[i];\n    rLevels[rLevel]++;\n    rLevels.fill(0, rLevel + 1);\n\n    let rIndex = 0;\n    let record = rows[rLevels[rIndex++] - 1];\n\n    // Internal nodes - Build a nested row object\n    for (const step of branch) {\n      if (step === field || dLevel < step.dLevelMax) {\n        break;\n      }\n\n      switch (step.repetitionType) {\n        case 'REPEATED':\n          if (!(step.name in record)) {\n            // eslint-disable max-depth\n            record[step.name] = [];\n          }\n          const ix = rLevels[rIndex++];\n          while (record[step.name].length <= ix) {\n            // eslint-disable max-depth\n            record[step.name].push({});\n          }\n          record = record[step.name][ix];\n          break;\n\n        default:\n          record[step.name] = record[step.name] || {};\n          record = record[step.name];\n      }\n    }\n\n    // Leaf node - Add the value\n    if (dLevel === field.dLevelMax) {\n      const value = Types.fromPrimitive(\n        // @ts-ignore\n        field.originalType || field.primitiveType,\n        columnData.values[vIndex],\n        field\n      );\n      vIndex++;\n\n      switch (field.repetitionType) {\n        case 'REPEATED':\n          if (!(field.name in record)) {\n            // eslint-disable max-depth\n            record[field.name] = [];\n          }\n          const ix = rLevels[rIndex];\n          while (record[field.name].length <= ix) {\n            // eslint-disable max-depth\n            record[field.name].push(null);\n          }\n          record[field.name][ix] = value;\n          break;\n\n        default:\n          record[field.name] = value;\n      }\n    }\n  }\n}\n\n// Columnar export\n\n/**\n * 'Materialize' a list of <value, repetition_level, definition_level>\n * tuples back to nested records (objects/arrays) using the Google Dremel\n * Algorithm..\n *\n * The rowGroup argument must point to an object with the following structure (i.e.\n * the same structure that is returned by shredRecords):\n *\n *   rowGroup = {\n *     columnData: [\n *       'my_col': {\n *          dlevels: [d1, d2, .. dN],\n *          rlevels: [r1, r2, .. rN],\n *          values: [v1, v2, .. vN],\n *        }, ...\n *      ],\n *      rowCount: X,\n *   }\n */\nexport function materializeColumns(\n  schema: ParquetSchema,\n  rowGroup: ParquetRowGroup\n): Record<string, ArrayType> {\n  const columns: Record<string, ArrayType> = {};\n  for (const key in rowGroup.columnData) {\n    const columnData = rowGroup.columnData[key];\n    if (columnData.count) {\n      materializeColumnAsColumnarArray(schema, columnData, rowGroup.rowCount, key, columns);\n    }\n  }\n  return columns;\n}\n\n// eslint-disable-next-line max-statements, complexity\nfunction materializeColumnAsColumnarArray(\n  schema: ParquetSchema,\n  columnData: ParquetColumnChunk,\n  rowCount: number,\n  key: string,\n  columns: Record<string, ArrayType<any>>\n) {\n  if (columnData.count <= 0) {\n    return;\n  }\n\n  const field = schema.findField(key);\n  const branch = schema.findFieldBranch(key);\n\n  const columnName = branch[0].name;\n\n  let column: ArrayType | undefined;\n  const {values} = columnData;\n  if (values.length === rowCount && branch[0].primitiveType) {\n    // if (branch[0].repetitionType === `REQUIRED`) {\n    //   switch (branch[0].primitiveType) {\n    //     case 'INT32': return values instanceof Int32Array ? values : new Int32Array(values);\n    //   }\n    // }\n    column = values;\n  }\n\n  if (column) {\n    columns[columnName] = column;\n    return;\n  }\n\n  column = new Array(rowCount);\n  for (let i = 0; i < rowCount; i++) {\n    column[i] = {};\n  }\n  columns[columnName] = column;\n\n  // tslint:disable-next-line:prefer-array-literal\n  const rLevels: number[] = new Array(field.rLevelMax + 1).fill(0);\n  let vIndex = 0;\n  for (let i = 0; i < columnData.count; i++) {\n    const dLevel = columnData.dlevels[i];\n    const rLevel = columnData.rlevels[i];\n    rLevels[rLevel]++;\n    rLevels.fill(0, rLevel + 1);\n\n    let rIndex = 0;\n    let record = column[rLevels[rIndex++] - 1] as ParquetRow;\n\n    // Internal nodes - Build a nested row object\n    for (const step of branch) {\n      if (step === field || dLevel < step.dLevelMax) {\n        break;\n      }\n\n      switch (step.repetitionType) {\n        case 'REPEATED':\n          if (!(step.name in record)) {\n            // eslint-disable max-depth\n            record[step.name] = [];\n          }\n          const ix = rLevels[rIndex++];\n          while (record[step.name].length <= ix) {\n            // eslint-disable max-depth\n            record[step.name].push({});\n          }\n          record = record[step.name][ix];\n          break;\n\n        default:\n          record[step.name] = record[step.name] || {};\n          record = record[step.name];\n      }\n    }\n\n    // Leaf node - Add the value\n    if (dLevel === field.dLevelMax) {\n      const value = Types.fromPrimitive(\n        // @ts-ignore\n        field.originalType || field.primitiveType,\n        columnData.values[vIndex],\n        field\n      );\n      vIndex++;\n\n      switch (field.repetitionType) {\n        case 'REPEATED':\n          if (!(field.name in record)) {\n            // eslint-disable max-depth\n            record[field.name] = [];\n          }\n          const ix = rLevels[rIndex];\n          while (record[field.name].length <= ix) {\n            // eslint-disable max-depth\n            record[field.name].push(null);\n          }\n          record[field.name][ix] = value;\n          break;\n\n        default:\n          record[field.name] = value;\n      }\n    }\n  }\n\n  // Remove one level of nesting\n  for (let i = 0; i < rowCount; ++i) {\n    if (columnName in (column[i] as object)) {\n      column[i] = (column[i] as object)[columnName];\n    }\n  }\n}\n", "// Forked from https://github.com/kbajalc/parquets under MIT license (Copyright (c) 2017 ironSource Ltd.)\n\nimport {PARQUET_CODECS} from '../codecs';\nimport {PARQUET_COMPRESSION_METHODS} from '../compression';\nimport {\n  FieldDefinition,\n  ParquetRowGroup,\n  ParquetCompression,\n  ParquetField,\n  ParquetRow,\n  RepetitionType,\n  SchemaDefinition\n} from './declare';\nimport {materializeRows, shredBuffer, shredRecord} from './shred';\nimport {PARQUET_LOGICAL_TYPES} from './types';\n\n/**\n * A parquet file schema\n */\nexport class ParquetSchema {\n  public schema: Record<string, FieldDefinition>;\n  public fields: Record<string, ParquetField>;\n  public fieldList: ParquetField[];\n\n  /**\n   * Create a new schema from a JSON schema definition\n   */\n  constructor(schema: SchemaDefinition) {\n    this.schema = schema;\n    this.fields = buildFields(schema, 0, 0, []);\n    this.fieldList = listFields(this.fields);\n  }\n\n  /**\n   * Retrieve a field definition\n   */\n  findField(path: string | string[]): ParquetField {\n    if (typeof path === 'string') {\n      // tslint:disable-next-line:no-parameter-reassignment\n      path = path.split(',');\n    } else {\n      // tslint:disable-next-line:no-parameter-reassignment\n      path = path.slice(0); // clone array\n    }\n\n    let n = this.fields;\n    for (; path.length > 1; path.shift()) {\n      n = n[path[0]].fields as Record<string, ParquetField>;\n    }\n\n    return n[path[0]];\n  }\n\n  /**\n   * Retrieve a field definition and all the field's ancestors\n   */\n  findFieldBranch(path: string | string[]): ParquetField[] {\n    if (typeof path === 'string') {\n      // tslint:disable-next-line:no-parameter-reassignment\n      path = path.split(',');\n    }\n    const branch: ParquetField[] = [];\n    let n = this.fields;\n    for (; path.length > 0; path.shift()) {\n      branch.push(n[path[0]]);\n      if (path.length > 1) {\n        n = n[path[0]].fields as Record<string, ParquetField>;\n      }\n    }\n    return branch;\n  }\n\n  shredRecord(row: ParquetRow, rowGroup: ParquetRowGroup): void {\n    shredRecord(this, row, rowGroup);\n  }\n\n  materializeRows(rowGroup: ParquetRowGroup): ParquetRow[] {\n    return materializeRows(this, rowGroup);\n  }\n\n  compress(type: ParquetCompression): this {\n    setCompress(this.schema, type);\n    setCompress(this.fields, type);\n    return this;\n  }\n\n  rowGroup(): ParquetRowGroup {\n    return shredBuffer(this);\n  }\n}\n\nfunction setCompress(schema: any, type: ParquetCompression) {\n  for (const name in schema) {\n    const node = schema[name];\n    if (node.fields) {\n      setCompress(node.fields, type);\n    } else {\n      node.compression = type;\n    }\n  }\n}\n\n// eslint-disable-next-line max-statements, complexity\nfunction buildFields(\n  schema: SchemaDefinition,\n  rLevelParentMax: number,\n  dLevelParentMax: number,\n  path: string[]\n): Record<string, ParquetField> {\n  const fieldList: Record<string, ParquetField> = {};\n\n  for (const name in schema) {\n    const opts = schema[name];\n\n    /* field repetition type */\n    const required = !opts.optional;\n    const repeated = Boolean(opts.repeated);\n    let rLevelMax = rLevelParentMax;\n    let dLevelMax = dLevelParentMax;\n\n    let repetitionType: RepetitionType = 'REQUIRED';\n    if (!required) {\n      repetitionType = 'OPTIONAL';\n      dLevelMax++;\n    }\n    if (repeated) {\n      repetitionType = 'REPEATED';\n      rLevelMax++;\n      if (required) dLevelMax++;\n    }\n\n    /* nested field */\n    if (opts.fields) {\n      const cpath = path.concat([name]);\n      fieldList[name] = {\n        name,\n        path: cpath,\n        key: cpath.join(),\n        repetitionType,\n        rLevelMax,\n        dLevelMax,\n        isNested: true,\n        fieldCount: Object.keys(opts.fields).length,\n        fields: buildFields(opts.fields, rLevelMax, dLevelMax, cpath)\n      };\n      continue; // eslint-disable-line no-continue\n    }\n\n    const typeDef: any = PARQUET_LOGICAL_TYPES[opts.type!];\n    if (!typeDef) {\n      throw new Error(`invalid parquet type: ${opts.type}`);\n    }\n\n    opts.encoding = opts.encoding || 'PLAIN';\n    if (!(opts.encoding in PARQUET_CODECS)) {\n      throw new Error(`unsupported parquet encoding: ${opts.encoding}`);\n    }\n\n    opts.compression = opts.compression || 'UNCOMPRESSED';\n    if (!(opts.compression in PARQUET_COMPRESSION_METHODS)) {\n      throw new Error(`unsupported compression method: ${opts.compression}`);\n    }\n\n    /* add to schema */\n    const cpath = path.concat([name]);\n    fieldList[name] = {\n      name,\n      primitiveType: typeDef.primitiveType,\n      originalType: typeDef.originalType,\n      path: cpath,\n      key: cpath.join(),\n      repetitionType,\n      encoding: opts.encoding,\n      compression: opts.compression,\n      typeLength: opts.typeLength || typeDef.typeLength,\n      presision: opts.presision,\n      scale: opts.scale,\n      rLevelMax,\n      dLevelMax\n    };\n  }\n  return fieldList;\n}\n\nfunction listFields(fields: Record<string, ParquetField>): ParquetField[] {\n  let list: ParquetField[] = [];\n  for (const k in fields) {\n    list.push(fields[k]);\n    if (fields[k].isNested) {\n      list = list.concat(listFields(fields[k].fields!));\n    }\n  }\n  return list;\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nexport {Buffer} from '../../buffer-polyfill/install-buffer-polyfill';\n\nexport {TBufferedTransport, TCompactProtocol, TFramedTransport} from 'thrift';\n\nexport * from './Type';\nexport * from './ConvertedType';\nexport * from './FieldRepetitionType';\nexport * from './Encoding';\nexport * from './CompressionCodec';\nexport * from './PageType';\nexport * from './BoundaryOrder';\nexport * from './Statistics';\nexport * from './StringType';\nexport * from './UUIDType';\nexport * from './MapType';\nexport * from './ListType';\nexport * from './EnumType';\nexport * from './DateType';\nexport * from './NullType';\nexport * from './DecimalType';\nexport * from './MilliSeconds';\nexport * from './MicroSeconds';\nexport * from './TimestampType';\nexport * from './TimeType';\nexport * from './IntType';\nexport * from './JsonType';\nexport * from './BsonType';\nexport * from './SchemaElement';\nexport * from './DataPageHeader';\nexport * from './IndexPageHeader';\nexport * from './DictionaryPageHeader';\nexport * from './DataPageHeaderV2';\nexport * from './PageHeader';\nexport * from './KeyValue';\nexport * from './SortingColumn';\nexport * from './PageEncodingStats';\nexport * from './ColumnMetaData';\nexport * from './ColumnChunk';\nexport * from './RowGroup';\nexport * from './TypeDefinedOrder';\nexport * from './PageLocation';\nexport * from './OffsetIndex';\nexport * from './ColumnIndex';\nexport * from './FileMetaData';\nexport * from './TimeUnit';\nexport * from './LogicalType';\nexport * from './ColumnOrder';\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nexport enum Type {\n  BOOLEAN = 0,\n  INT32 = 1,\n  INT64 = 2,\n  INT96 = 3,\n  FLOAT = 4,\n  DOUBLE = 5,\n  BYTE_ARRAY = 6,\n  FIXED_LEN_BYTE_ARRAY = 7\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nexport enum ConvertedType {\n  UTF8 = 0,\n  MAP = 1,\n  MAP_KEY_VALUE = 2,\n  LIST = 3,\n  ENUM = 4,\n  DECIMAL = 5,\n  DATE = 6,\n  TIME_MILLIS = 7,\n  TIME_MICROS = 8,\n  TIMESTAMP_MILLIS = 9,\n  TIMESTAMP_MICROS = 10,\n  UINT_8 = 11,\n  UINT_16 = 12,\n  UINT_32 = 13,\n  UINT_64 = 14,\n  INT_8 = 15,\n  INT_16 = 16,\n  INT_32 = 17,\n  INT_64 = 18,\n  JSON = 19,\n  BSON = 20,\n  INTERVAL = 21\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nexport enum FieldRepetitionType {\n  REQUIRED = 0,\n  OPTIONAL = 1,\n  REPEATED = 2\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nexport enum Encoding {\n  PLAIN = 0,\n  PLAIN_DICTIONARY = 2,\n  RLE = 3,\n  BIT_PACKED = 4,\n  DELTA_BINARY_PACKED = 5,\n  DELTA_LENGTH_BYTE_ARRAY = 6,\n  DELTA_BYTE_ARRAY = 7,\n  RLE_DICTIONARY = 8\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nexport enum CompressionCodec {\n  UNCOMPRESSED = 0,\n  SNAPPY = 1,\n  GZIP = 2,\n  LZO = 3,\n  BROTLI = 4,\n  LZ4 = 5,\n  ZSTD = 6,\n  LZ4_RAW = 7 // Added in 2.9\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nexport enum PageType {\n  DATA_PAGE = 0,\n  INDEX_PAGE = 1,\n  DICTIONARY_PAGE = 2,\n  DATA_PAGE_V2 = 3\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport Int64 from 'node-int64';\nimport * as thrift from 'thrift';\nexport interface IStatisticsArgs {\n  max?: Buffer;\n  min?: Buffer;\n  null_count?: number | Int64;\n  distinct_count?: number | Int64;\n  max_value?: Buffer;\n  min_value?: Buffer;\n}\nexport class Statistics {\n  public max?: Buffer;\n  public min?: Buffer;\n  public null_count?: Int64;\n  public distinct_count?: Int64;\n  public max_value?: Buffer;\n  public min_value?: Buffer;\n  constructor(args?: IStatisticsArgs) {\n    if (args != null && args.max != null) {\n      this.max = args.max;\n    }\n    if (args != null && args.min != null) {\n      this.min = args.min;\n    }\n    if (args != null && args.null_count != null) {\n      if (typeof args.null_count === 'number') {\n        this.null_count = new Int64(args.null_count);\n      } else {\n        this.null_count = args.null_count;\n      }\n    }\n    if (args != null && args.distinct_count != null) {\n      if (typeof args.distinct_count === 'number') {\n        this.distinct_count = new Int64(args.distinct_count);\n      } else {\n        this.distinct_count = args.distinct_count;\n      }\n    }\n    if (args != null && args.max_value != null) {\n      this.max_value = args.max_value;\n    }\n    if (args != null && args.min_value != null) {\n      this.min_value = args.min_value;\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('Statistics');\n    if (this.max != null) {\n      output.writeFieldBegin('max', thrift.Thrift.Type.STRING, 1);\n      output.writeBinary(this.max);\n      output.writeFieldEnd();\n    }\n    if (this.min != null) {\n      output.writeFieldBegin('min', thrift.Thrift.Type.STRING, 2);\n      output.writeBinary(this.min);\n      output.writeFieldEnd();\n    }\n    if (this.null_count != null) {\n      output.writeFieldBegin('null_count', thrift.Thrift.Type.I64, 3);\n      output.writeI64(this.null_count);\n      output.writeFieldEnd();\n    }\n    if (this.distinct_count != null) {\n      output.writeFieldBegin('distinct_count', thrift.Thrift.Type.I64, 4);\n      output.writeI64(this.distinct_count);\n      output.writeFieldEnd();\n    }\n    if (this.max_value != null) {\n      output.writeFieldBegin('max_value', thrift.Thrift.Type.STRING, 5);\n      output.writeBinary(this.max_value);\n      output.writeFieldEnd();\n    }\n    if (this.min_value != null) {\n      output.writeFieldBegin('min_value', thrift.Thrift.Type.STRING, 6);\n      output.writeBinary(this.min_value);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): Statistics {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.STRING) {\n            const value_1: Buffer = input.readBinary();\n            _args.max = value_1;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.STRING) {\n            const value_2: Buffer = input.readBinary();\n            _args.min = value_2;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 3:\n          if (fieldType === thrift.Thrift.Type.I64) {\n            const value_3: Int64 = input.readI64();\n            _args.null_count = value_3;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 4:\n          if (fieldType === thrift.Thrift.Type.I64) {\n            const value_4: Int64 = input.readI64();\n            _args.distinct_count = value_4;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 5:\n          if (fieldType === thrift.Thrift.Type.STRING) {\n            const value_5: Buffer = input.readBinary();\n            _args.max_value = value_5;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 6:\n          if (fieldType === thrift.Thrift.Type.STRING) {\n            const value_6: Buffer = input.readBinary();\n            _args.min_value = value_6;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    return new Statistics(_args);\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface IStringTypeArgs {}\nexport class StringType {\n  constructor() {}\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('StringType');\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): StringType {\n    input.readStructBegin();\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    return new StringType();\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface IUUIDTypeArgs {}\nexport class UUIDType {\n  constructor() {}\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('UUIDType');\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): UUIDType {\n    input.readStructBegin();\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    return new UUIDType();\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface IMapTypeArgs {}\nexport class MapType {\n  constructor() {}\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('MapType');\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): MapType {\n    input.readStructBegin();\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    return new MapType();\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface IListTypeArgs {}\nexport class ListType {\n  constructor() {}\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('ListType');\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): ListType {\n    input.readStructBegin();\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    return new ListType();\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface IEnumTypeArgs {}\nexport class EnumType {\n  constructor() {}\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('EnumType');\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): EnumType {\n    input.readStructBegin();\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    return new EnumType();\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface IDateTypeArgs {}\nexport class DateType {\n  constructor() {}\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('DateType');\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): DateType {\n    input.readStructBegin();\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    return new DateType();\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface INullTypeArgs {}\nexport class NullType {\n  constructor() {}\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('NullType');\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): NullType {\n    input.readStructBegin();\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    return new NullType();\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface IDecimalTypeArgs {\n  scale: number;\n  precision: number;\n}\nexport class DecimalType {\n  public scale: number;\n  public precision: number;\n  constructor(args: IDecimalTypeArgs) {\n    if (args != null && args.scale != null) {\n      this.scale = args.scale;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[scale] is unset!'\n      );\n    }\n    if (args != null && args.precision != null) {\n      this.precision = args.precision;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[precision] is unset!'\n      );\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('DecimalType');\n    if (this.scale != null) {\n      output.writeFieldBegin('scale', thrift.Thrift.Type.I32, 1);\n      output.writeI32(this.scale);\n      output.writeFieldEnd();\n    }\n    if (this.precision != null) {\n      output.writeFieldBegin('precision', thrift.Thrift.Type.I32, 2);\n      output.writeI32(this.precision);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): DecimalType {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_1: number = input.readI32();\n            _args.scale = value_1;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_2: number = input.readI32();\n            _args.precision = value_2;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (_args.scale !== undefined && _args.precision !== undefined) {\n      return new DecimalType(_args);\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read DecimalType from input'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface IMilliSecondsArgs {}\nexport class MilliSeconds {\n  constructor() {}\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('MilliSeconds');\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): MilliSeconds {\n    input.readStructBegin();\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    return new MilliSeconds();\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface IMicroSecondsArgs {}\nexport class MicroSeconds {\n  constructor() {}\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('MicroSeconds');\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): MicroSeconds {\n    input.readStructBegin();\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    return new MicroSeconds();\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nimport * as TimeUnit from './TimeUnit';\nexport interface ITimestampTypeArgs {\n  isAdjustedToUTC: boolean;\n  unit: TimeUnit.TimeUnit;\n}\nexport class TimestampType {\n  public isAdjustedToUTC: boolean;\n  public unit: TimeUnit.TimeUnit;\n  constructor(args: ITimestampTypeArgs) {\n    if (args != null && args.isAdjustedToUTC != null) {\n      this.isAdjustedToUTC = args.isAdjustedToUTC;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[isAdjustedToUTC] is unset!'\n      );\n    }\n    if (args != null && args.unit != null) {\n      this.unit = args.unit;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[unit] is unset!'\n      );\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('TimestampType');\n    if (this.isAdjustedToUTC != null) {\n      output.writeFieldBegin('isAdjustedToUTC', thrift.Thrift.Type.BOOL, 1);\n      output.writeBool(this.isAdjustedToUTC);\n      output.writeFieldEnd();\n    }\n    if (this.unit != null) {\n      output.writeFieldBegin('unit', thrift.Thrift.Type.STRUCT, 2);\n      this.unit.write(output);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): TimestampType {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.BOOL) {\n            const value_1: boolean = input.readBool();\n            _args.isAdjustedToUTC = value_1;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            const value_2: TimeUnit.TimeUnit = TimeUnit.TimeUnit.read(input);\n            _args.unit = value_2;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (_args.isAdjustedToUTC !== undefined && _args.unit !== undefined) {\n      return new TimestampType(_args);\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read TimestampType from input'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nimport * as MicroSeconds from './MicroSeconds';\nimport * as MilliSeconds from './MilliSeconds';\nexport interface ITimeUnitArgs {\n  MILLIS?: MilliSeconds.MilliSeconds;\n  MICROS?: MicroSeconds.MicroSeconds;\n}\nexport class TimeUnit {\n  public MILLIS?: MilliSeconds.MilliSeconds;\n  public MICROS?: MicroSeconds.MicroSeconds;\n  constructor(args?: ITimeUnitArgs) {\n    let _fieldsSet: number = 0;\n    if (args != null) {\n      if (args.MILLIS != null) {\n        _fieldsSet++;\n        this.MILLIS = args.MILLIS;\n      }\n      if (args.MICROS != null) {\n        _fieldsSet++;\n        this.MICROS = args.MICROS;\n      }\n      if (_fieldsSet > 1) {\n        throw new thrift.Thrift.TProtocolException(\n          thrift.Thrift.TProtocolExceptionType.INVALID_DATA,\n          'Cannot read a TUnion with more than one set value!'\n        );\n      } else if (_fieldsSet < 1) {\n        throw new thrift.Thrift.TProtocolException(\n          thrift.Thrift.TProtocolExceptionType.INVALID_DATA,\n          'Cannot read a TUnion with no set value!'\n        );\n      }\n    }\n  }\n  public static fromMILLIS(MILLIS: MilliSeconds.MilliSeconds): TimeUnit {\n    return new TimeUnit({MILLIS});\n  }\n  public static fromMICROS(MICROS: MicroSeconds.MicroSeconds): TimeUnit {\n    return new TimeUnit({MICROS});\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('TimeUnit');\n    if (this.MILLIS != null) {\n      output.writeFieldBegin('MILLIS', thrift.Thrift.Type.STRUCT, 1);\n      this.MILLIS.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.MICROS != null) {\n      output.writeFieldBegin('MICROS', thrift.Thrift.Type.STRUCT, 2);\n      this.MICROS.write(output);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): TimeUnit {\n    let _fieldsSet: number = 0;\n    let _returnValue: TimeUnit | null = null;\n    input.readStructBegin();\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            _fieldsSet++;\n            const value_1: MilliSeconds.MilliSeconds = MilliSeconds.MilliSeconds.read(input);\n            _returnValue = TimeUnit.fromMILLIS(value_1);\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            _fieldsSet++;\n            const value_2: MicroSeconds.MicroSeconds = MicroSeconds.MicroSeconds.read(input);\n            _returnValue = TimeUnit.fromMICROS(value_2);\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (_fieldsSet > 1) {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.INVALID_DATA,\n        'Cannot read a TUnion with more than one set value!'\n      );\n    } else if (_fieldsSet < 1) {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.INVALID_DATA,\n        'Cannot read a TUnion with no set value!'\n      );\n    }\n    if (_returnValue !== null) {\n      return _returnValue;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read data for TUnion'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nimport * as TimeUnit from './TimeUnit';\nexport interface ITimeTypeArgs {\n  isAdjustedToUTC: boolean;\n  unit: TimeUnit.TimeUnit;\n}\nexport class TimeType {\n  public isAdjustedToUTC: boolean;\n  public unit: TimeUnit.TimeUnit;\n  constructor(args: ITimeTypeArgs) {\n    if (args != null && args.isAdjustedToUTC != null) {\n      this.isAdjustedToUTC = args.isAdjustedToUTC;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[isAdjustedToUTC] is unset!'\n      );\n    }\n    if (args != null && args.unit != null) {\n      this.unit = args.unit;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[unit] is unset!'\n      );\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('TimeType');\n    if (this.isAdjustedToUTC != null) {\n      output.writeFieldBegin('isAdjustedToUTC', thrift.Thrift.Type.BOOL, 1);\n      output.writeBool(this.isAdjustedToUTC);\n      output.writeFieldEnd();\n    }\n    if (this.unit != null) {\n      output.writeFieldBegin('unit', thrift.Thrift.Type.STRUCT, 2);\n      this.unit.write(output);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): TimeType {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.BOOL) {\n            const value_1: boolean = input.readBool();\n            _args.isAdjustedToUTC = value_1;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            const value_2: TimeUnit.TimeUnit = TimeUnit.TimeUnit.read(input);\n            _args.unit = value_2;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (_args.isAdjustedToUTC !== undefined && _args.unit !== undefined) {\n      return new TimeType(_args);\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read TimeType from input'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface IIntTypeArgs {\n  bitWidth: number;\n  isSigned: boolean;\n}\nexport class IntType {\n  public bitWidth: number;\n  public isSigned: boolean;\n  constructor(args: IIntTypeArgs) {\n    if (args != null && args.bitWidth != null) {\n      this.bitWidth = args.bitWidth;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[bitWidth] is unset!'\n      );\n    }\n    if (args != null && args.isSigned != null) {\n      this.isSigned = args.isSigned;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[isSigned] is unset!'\n      );\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('IntType');\n    if (this.bitWidth != null) {\n      output.writeFieldBegin('bitWidth', thrift.Thrift.Type.BYTE, 1);\n      output.writeByte(this.bitWidth);\n      output.writeFieldEnd();\n    }\n    if (this.isSigned != null) {\n      output.writeFieldBegin('isSigned', thrift.Thrift.Type.BOOL, 2);\n      output.writeBool(this.isSigned);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): IntType {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.BYTE) {\n            const value_1: number = input.readByte();\n            _args.bitWidth = value_1;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.BOOL) {\n            const value_2: boolean = input.readBool();\n            _args.isSigned = value_2;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (_args.bitWidth !== undefined && _args.isSigned !== undefined) {\n      return new IntType(_args);\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read IntType from input'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface IJsonTypeArgs {}\nexport class JsonType {\n  constructor() {}\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('JsonType');\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): JsonType {\n    input.readStructBegin();\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    return new JsonType();\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface IBsonTypeArgs {}\nexport class BsonType {\n  constructor() {}\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('BsonType');\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): BsonType {\n    input.readStructBegin();\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    return new BsonType();\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nimport * as ConvertedType from './ConvertedType';\nimport * as FieldRepetitionType from './FieldRepetitionType';\nimport * as LogicalType from './LogicalType';\nimport * as Type from './Type';\nexport interface ISchemaElementArgs {\n  type?: Type.Type;\n  type_length?: number;\n  repetition_type?: FieldRepetitionType.FieldRepetitionType;\n  name: string;\n  num_children?: number;\n  converted_type?: ConvertedType.ConvertedType;\n  scale?: number;\n  precision?: number;\n  field_id?: number;\n  logicalType?: LogicalType.LogicalType;\n}\nexport class SchemaElement {\n  public type?: Type.Type;\n  public type_length?: number;\n  public repetition_type?: FieldRepetitionType.FieldRepetitionType;\n  public name: string;\n  public num_children?: number;\n  public converted_type?: ConvertedType.ConvertedType;\n  public scale?: number;\n  public precision?: number;\n  public field_id?: number;\n  public logicalType?: LogicalType.LogicalType;\n  constructor(args: ISchemaElementArgs) {\n    if (args != null && args.type != null) {\n      this.type = args.type;\n    }\n    if (args != null && args.type_length != null) {\n      this.type_length = args.type_length;\n    }\n    if (args != null && args.repetition_type != null) {\n      this.repetition_type = args.repetition_type;\n    }\n    if (args != null && args.name != null) {\n      this.name = args.name;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[name] is unset!'\n      );\n    }\n    if (args != null && args.num_children != null) {\n      this.num_children = args.num_children;\n    }\n    if (args != null && args.converted_type != null) {\n      this.converted_type = args.converted_type;\n    }\n    if (args != null && args.scale != null) {\n      this.scale = args.scale;\n    }\n    if (args != null && args.precision != null) {\n      this.precision = args.precision;\n    }\n    if (args != null && args.field_id != null) {\n      this.field_id = args.field_id;\n    }\n    if (args != null && args.logicalType != null) {\n      this.logicalType = args.logicalType;\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('SchemaElement');\n    if (this.type != null) {\n      output.writeFieldBegin('type', thrift.Thrift.Type.I32, 1);\n      output.writeI32(this.type);\n      output.writeFieldEnd();\n    }\n    if (this.type_length != null) {\n      output.writeFieldBegin('type_length', thrift.Thrift.Type.I32, 2);\n      output.writeI32(this.type_length);\n      output.writeFieldEnd();\n    }\n    if (this.repetition_type != null) {\n      output.writeFieldBegin('repetition_type', thrift.Thrift.Type.I32, 3);\n      output.writeI32(this.repetition_type);\n      output.writeFieldEnd();\n    }\n    if (this.name != null) {\n      output.writeFieldBegin('name', thrift.Thrift.Type.STRING, 4);\n      output.writeString(this.name);\n      output.writeFieldEnd();\n    }\n    if (this.num_children != null) {\n      output.writeFieldBegin('num_children', thrift.Thrift.Type.I32, 5);\n      output.writeI32(this.num_children);\n      output.writeFieldEnd();\n    }\n    if (this.converted_type != null) {\n      output.writeFieldBegin('converted_type', thrift.Thrift.Type.I32, 6);\n      output.writeI32(this.converted_type);\n      output.writeFieldEnd();\n    }\n    if (this.scale != null) {\n      output.writeFieldBegin('scale', thrift.Thrift.Type.I32, 7);\n      output.writeI32(this.scale);\n      output.writeFieldEnd();\n    }\n    if (this.precision != null) {\n      output.writeFieldBegin('precision', thrift.Thrift.Type.I32, 8);\n      output.writeI32(this.precision);\n      output.writeFieldEnd();\n    }\n    if (this.field_id != null) {\n      output.writeFieldBegin('field_id', thrift.Thrift.Type.I32, 9);\n      output.writeI32(this.field_id);\n      output.writeFieldEnd();\n    }\n    if (this.logicalType != null) {\n      output.writeFieldBegin('logicalType', thrift.Thrift.Type.STRUCT, 10);\n      this.logicalType.write(output);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): SchemaElement {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_1: Type.Type = input.readI32();\n            _args.type = value_1;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_2: number = input.readI32();\n            _args.type_length = value_2;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 3:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_3: FieldRepetitionType.FieldRepetitionType = input.readI32();\n            _args.repetition_type = value_3;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 4:\n          if (fieldType === thrift.Thrift.Type.STRING) {\n            const value_4: string = input.readString();\n            _args.name = value_4;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 5:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_5: number = input.readI32();\n            _args.num_children = value_5;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 6:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_6: ConvertedType.ConvertedType = input.readI32();\n            _args.converted_type = value_6;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 7:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_7: number = input.readI32();\n            _args.scale = value_7;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 8:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_8: number = input.readI32();\n            _args.precision = value_8;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 9:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_9: number = input.readI32();\n            _args.field_id = value_9;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 10:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            const value_10: LogicalType.LogicalType = LogicalType.LogicalType.read(input);\n            _args.logicalType = value_10;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (_args.name !== undefined) {\n      return new SchemaElement(_args);\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read SchemaElement from input'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nimport * as BsonType from './BsonType';\nimport * as DateType from './DateType';\nimport * as DecimalType from './DecimalType';\nimport * as EnumType from './EnumType';\nimport * as IntType from './IntType';\nimport * as JsonType from './JsonType';\nimport * as ListType from './ListType';\nimport * as MapType from './MapType';\nimport * as NullType from './NullType';\nimport * as StringType from './StringType';\nimport * as TimestampType from './TimestampType';\nimport * as TimeType from './TimeType';\nimport * as UUIDType from './UUIDType';\nexport interface ILogicalTypeArgs {\n  STRING?: StringType.StringType;\n  MAP?: MapType.MapType;\n  LIST?: ListType.ListType;\n  ENUM?: EnumType.EnumType;\n  DECIMAL?: DecimalType.DecimalType;\n  DATE?: DateType.DateType;\n  TIME?: TimeType.TimeType;\n  TIMESTAMP?: TimestampType.TimestampType;\n  INTEGER?: IntType.IntType;\n  UNKNOWN?: NullType.NullType;\n  JSON?: JsonType.JsonType;\n  BSON?: BsonType.BsonType;\n  UUID?: UUIDType.UUIDType;\n}\nexport class LogicalType {\n  public STRING?: StringType.StringType;\n  public MAP?: MapType.MapType;\n  public LIST?: ListType.ListType;\n  public ENUM?: EnumType.EnumType;\n  public DECIMAL?: DecimalType.DecimalType;\n  public DATE?: DateType.DateType;\n  public TIME?: TimeType.TimeType;\n  public TIMESTAMP?: TimestampType.TimestampType;\n  public INTEGER?: IntType.IntType;\n  public UNKNOWN?: NullType.NullType;\n  public JSON?: JsonType.JsonType;\n  public BSON?: BsonType.BsonType;\n  public UUID?: UUIDType.UUIDType;\n  constructor(args?: ILogicalTypeArgs) {\n    let _fieldsSet: number = 0;\n    if (args != null) {\n      if (args.STRING != null) {\n        _fieldsSet++;\n        this.STRING = args.STRING;\n      }\n      if (args.MAP != null) {\n        _fieldsSet++;\n        this.MAP = args.MAP;\n      }\n      if (args.LIST != null) {\n        _fieldsSet++;\n        this.LIST = args.LIST;\n      }\n      if (args.ENUM != null) {\n        _fieldsSet++;\n        this.ENUM = args.ENUM;\n      }\n      if (args.DECIMAL != null) {\n        _fieldsSet++;\n        this.DECIMAL = args.DECIMAL;\n      }\n      if (args.DATE != null) {\n        _fieldsSet++;\n        this.DATE = args.DATE;\n      }\n      if (args.TIME != null) {\n        _fieldsSet++;\n        this.TIME = args.TIME;\n      }\n      if (args.TIMESTAMP != null) {\n        _fieldsSet++;\n        this.TIMESTAMP = args.TIMESTAMP;\n      }\n      if (args.INTEGER != null) {\n        _fieldsSet++;\n        this.INTEGER = args.INTEGER;\n      }\n      if (args.UNKNOWN != null) {\n        _fieldsSet++;\n        this.UNKNOWN = args.UNKNOWN;\n      }\n      if (args.JSON != null) {\n        _fieldsSet++;\n        this.JSON = args.JSON;\n      }\n      if (args.BSON != null) {\n        _fieldsSet++;\n        this.BSON = args.BSON;\n      }\n      if (args.UUID != null) {\n        _fieldsSet++;\n        this.UUID = args.UUID;\n      }\n      if (_fieldsSet > 1) {\n        throw new thrift.Thrift.TProtocolException(\n          thrift.Thrift.TProtocolExceptionType.INVALID_DATA,\n          'Cannot read a TUnion with more than one set value!'\n        );\n      } else if (_fieldsSet < 1) {\n        throw new thrift.Thrift.TProtocolException(\n          thrift.Thrift.TProtocolExceptionType.INVALID_DATA,\n          'Cannot read a TUnion with no set value!'\n        );\n      }\n    }\n  }\n  public static fromSTRING(STRING: StringType.StringType): LogicalType {\n    return new LogicalType({STRING});\n  }\n  public static fromMAP(MAP: MapType.MapType): LogicalType {\n    return new LogicalType({MAP});\n  }\n  public static fromLIST(LIST: ListType.ListType): LogicalType {\n    return new LogicalType({LIST});\n  }\n  public static fromENUM(ENUM: EnumType.EnumType): LogicalType {\n    return new LogicalType({ENUM});\n  }\n  public static fromDECIMAL(DECIMAL: DecimalType.DecimalType): LogicalType {\n    return new LogicalType({DECIMAL});\n  }\n  public static fromDATE(DATE: DateType.DateType): LogicalType {\n    return new LogicalType({DATE});\n  }\n  public static fromTIME(TIME: TimeType.TimeType): LogicalType {\n    return new LogicalType({TIME});\n  }\n  public static fromTIMESTAMP(TIMESTAMP: TimestampType.TimestampType): LogicalType {\n    return new LogicalType({TIMESTAMP});\n  }\n  public static fromINTEGER(INTEGER: IntType.IntType): LogicalType {\n    return new LogicalType({INTEGER});\n  }\n  public static fromUNKNOWN(UNKNOWN: NullType.NullType): LogicalType {\n    return new LogicalType({UNKNOWN});\n  }\n  public static fromJSON(JSON: JsonType.JsonType): LogicalType {\n    return new LogicalType({JSON});\n  }\n  public static fromBSON(BSON: BsonType.BsonType): LogicalType {\n    return new LogicalType({BSON});\n  }\n  public static fromUUID(UUID: UUIDType.UUIDType): LogicalType {\n    return new LogicalType({UUID});\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('LogicalType');\n    if (this.STRING != null) {\n      output.writeFieldBegin('STRING', thrift.Thrift.Type.STRUCT, 1);\n      this.STRING.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.MAP != null) {\n      output.writeFieldBegin('MAP', thrift.Thrift.Type.STRUCT, 2);\n      this.MAP.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.LIST != null) {\n      output.writeFieldBegin('LIST', thrift.Thrift.Type.STRUCT, 3);\n      this.LIST.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.ENUM != null) {\n      output.writeFieldBegin('ENUM', thrift.Thrift.Type.STRUCT, 4);\n      this.ENUM.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.DECIMAL != null) {\n      output.writeFieldBegin('DECIMAL', thrift.Thrift.Type.STRUCT, 5);\n      this.DECIMAL.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.DATE != null) {\n      output.writeFieldBegin('DATE', thrift.Thrift.Type.STRUCT, 6);\n      this.DATE.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.TIME != null) {\n      output.writeFieldBegin('TIME', thrift.Thrift.Type.STRUCT, 7);\n      this.TIME.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.TIMESTAMP != null) {\n      output.writeFieldBegin('TIMESTAMP', thrift.Thrift.Type.STRUCT, 8);\n      this.TIMESTAMP.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.INTEGER != null) {\n      output.writeFieldBegin('INTEGER', thrift.Thrift.Type.STRUCT, 10);\n      this.INTEGER.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.UNKNOWN != null) {\n      output.writeFieldBegin('UNKNOWN', thrift.Thrift.Type.STRUCT, 11);\n      this.UNKNOWN.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.JSON != null) {\n      output.writeFieldBegin('JSON', thrift.Thrift.Type.STRUCT, 12);\n      this.JSON.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.BSON != null) {\n      output.writeFieldBegin('BSON', thrift.Thrift.Type.STRUCT, 13);\n      this.BSON.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.UUID != null) {\n      output.writeFieldBegin('UUID', thrift.Thrift.Type.STRUCT, 14);\n      this.UUID.write(output);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): LogicalType {\n    let _fieldsSet: number = 0;\n    let _returnValue: LogicalType | null = null;\n    input.readStructBegin();\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            _fieldsSet++;\n            const value_1: StringType.StringType = StringType.StringType.read(input);\n            _returnValue = LogicalType.fromSTRING(value_1);\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            _fieldsSet++;\n            const value_2: MapType.MapType = MapType.MapType.read(input);\n            _returnValue = LogicalType.fromMAP(value_2);\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 3:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            _fieldsSet++;\n            const value_3: ListType.ListType = ListType.ListType.read(input);\n            _returnValue = LogicalType.fromLIST(value_3);\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 4:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            _fieldsSet++;\n            const value_4: EnumType.EnumType = EnumType.EnumType.read(input);\n            _returnValue = LogicalType.fromENUM(value_4);\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 5:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            _fieldsSet++;\n            const value_5: DecimalType.DecimalType = DecimalType.DecimalType.read(input);\n            _returnValue = LogicalType.fromDECIMAL(value_5);\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 6:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            _fieldsSet++;\n            const value_6: DateType.DateType = DateType.DateType.read(input);\n            _returnValue = LogicalType.fromDATE(value_6);\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 7:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            _fieldsSet++;\n            const value_7: TimeType.TimeType = TimeType.TimeType.read(input);\n            _returnValue = LogicalType.fromTIME(value_7);\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 8:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            _fieldsSet++;\n            const value_8: TimestampType.TimestampType = TimestampType.TimestampType.read(input);\n            _returnValue = LogicalType.fromTIMESTAMP(value_8);\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 10:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            _fieldsSet++;\n            const value_9: IntType.IntType = IntType.IntType.read(input);\n            _returnValue = LogicalType.fromINTEGER(value_9);\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 11:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            _fieldsSet++;\n            const value_10: NullType.NullType = NullType.NullType.read(input);\n            _returnValue = LogicalType.fromUNKNOWN(value_10);\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 12:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            _fieldsSet++;\n            const value_11: JsonType.JsonType = JsonType.JsonType.read(input);\n            _returnValue = LogicalType.fromJSON(value_11);\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 13:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            _fieldsSet++;\n            const value_12: BsonType.BsonType = BsonType.BsonType.read(input);\n            _returnValue = LogicalType.fromBSON(value_12);\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 14:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            _fieldsSet++;\n            const value_13: UUIDType.UUIDType = UUIDType.UUIDType.read(input);\n            _returnValue = LogicalType.fromUUID(value_13);\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (_fieldsSet > 1) {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.INVALID_DATA,\n        'Cannot read a TUnion with more than one set value!'\n      );\n    } else if (_fieldsSet < 1) {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.INVALID_DATA,\n        'Cannot read a TUnion with no set value!'\n      );\n    }\n    if (_returnValue !== null) {\n      return _returnValue;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read data for TUnion'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nimport * as Encoding from './Encoding';\nimport * as Statistics from './Statistics';\nexport interface IDataPageHeaderArgs {\n  num_values: number;\n  encoding: Encoding.Encoding;\n  definition_level_encoding: Encoding.Encoding;\n  repetition_level_encoding: Encoding.Encoding;\n  statistics?: Statistics.Statistics;\n}\nexport class DataPageHeader {\n  public num_values: number;\n  public encoding: Encoding.Encoding;\n  public definition_level_encoding: Encoding.Encoding;\n  public repetition_level_encoding: Encoding.Encoding;\n  public statistics?: Statistics.Statistics;\n  constructor(args: IDataPageHeaderArgs) {\n    if (args != null && args.num_values != null) {\n      this.num_values = args.num_values;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[num_values] is unset!'\n      );\n    }\n    if (args != null && args.encoding != null) {\n      this.encoding = args.encoding;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[encoding] is unset!'\n      );\n    }\n    if (args != null && args.definition_level_encoding != null) {\n      this.definition_level_encoding = args.definition_level_encoding;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[definition_level_encoding] is unset!'\n      );\n    }\n    if (args != null && args.repetition_level_encoding != null) {\n      this.repetition_level_encoding = args.repetition_level_encoding;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[repetition_level_encoding] is unset!'\n      );\n    }\n    if (args != null && args.statistics != null) {\n      this.statistics = args.statistics;\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('DataPageHeader');\n    if (this.num_values != null) {\n      output.writeFieldBegin('num_values', thrift.Thrift.Type.I32, 1);\n      output.writeI32(this.num_values);\n      output.writeFieldEnd();\n    }\n    if (this.encoding != null) {\n      output.writeFieldBegin('encoding', thrift.Thrift.Type.I32, 2);\n      output.writeI32(this.encoding);\n      output.writeFieldEnd();\n    }\n    if (this.definition_level_encoding != null) {\n      output.writeFieldBegin('definition_level_encoding', thrift.Thrift.Type.I32, 3);\n      output.writeI32(this.definition_level_encoding);\n      output.writeFieldEnd();\n    }\n    if (this.repetition_level_encoding != null) {\n      output.writeFieldBegin('repetition_level_encoding', thrift.Thrift.Type.I32, 4);\n      output.writeI32(this.repetition_level_encoding);\n      output.writeFieldEnd();\n    }\n    if (this.statistics != null) {\n      output.writeFieldBegin('statistics', thrift.Thrift.Type.STRUCT, 5);\n      this.statistics.write(output);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): DataPageHeader {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_1: number = input.readI32();\n            _args.num_values = value_1;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_2: Encoding.Encoding = input.readI32();\n            _args.encoding = value_2;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 3:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_3: Encoding.Encoding = input.readI32();\n            _args.definition_level_encoding = value_3;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 4:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_4: Encoding.Encoding = input.readI32();\n            _args.repetition_level_encoding = value_4;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 5:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            const value_5: Statistics.Statistics = Statistics.Statistics.read(input);\n            _args.statistics = value_5;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (\n      _args.num_values !== undefined &&\n      _args.encoding !== undefined &&\n      _args.definition_level_encoding !== undefined &&\n      _args.repetition_level_encoding !== undefined\n    ) {\n      return new DataPageHeader(_args);\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read DataPageHeader from input'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface IIndexPageHeaderArgs {}\nexport class IndexPageHeader {\n  constructor() {}\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('IndexPageHeader');\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): IndexPageHeader {\n    input.readStructBegin();\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    return new IndexPageHeader();\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nimport * as Encoding from './Encoding';\nexport interface IDictionaryPageHeaderArgs {\n  num_values: number;\n  encoding: Encoding.Encoding;\n  is_sorted?: boolean;\n}\nexport class DictionaryPageHeader {\n  public num_values: number;\n  public encoding: Encoding.Encoding;\n  public is_sorted?: boolean;\n  constructor(args: IDictionaryPageHeaderArgs) {\n    if (args != null && args.num_values != null) {\n      this.num_values = args.num_values;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[num_values] is unset!'\n      );\n    }\n    if (args != null && args.encoding != null) {\n      this.encoding = args.encoding;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[encoding] is unset!'\n      );\n    }\n    if (args != null && args.is_sorted != null) {\n      this.is_sorted = args.is_sorted;\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('DictionaryPageHeader');\n    if (this.num_values != null) {\n      output.writeFieldBegin('num_values', thrift.Thrift.Type.I32, 1);\n      output.writeI32(this.num_values);\n      output.writeFieldEnd();\n    }\n    if (this.encoding != null) {\n      output.writeFieldBegin('encoding', thrift.Thrift.Type.I32, 2);\n      output.writeI32(this.encoding);\n      output.writeFieldEnd();\n    }\n    if (this.is_sorted != null) {\n      output.writeFieldBegin('is_sorted', thrift.Thrift.Type.BOOL, 3);\n      output.writeBool(this.is_sorted);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): DictionaryPageHeader {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_1: number = input.readI32();\n            _args.num_values = value_1;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_2: Encoding.Encoding = input.readI32();\n            _args.encoding = value_2;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 3:\n          if (fieldType === thrift.Thrift.Type.BOOL) {\n            const value_3: boolean = input.readBool();\n            _args.is_sorted = value_3;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (_args.num_values !== undefined && _args.encoding !== undefined) {\n      return new DictionaryPageHeader(_args);\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read DictionaryPageHeader from input'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nimport * as Encoding from './Encoding';\nimport * as Statistics from './Statistics';\nexport interface IDataPageHeaderV2Args {\n  num_values: number;\n  num_nulls: number;\n  num_rows: number;\n  encoding: Encoding.Encoding;\n  definition_levels_byte_length: number;\n  repetition_levels_byte_length: number;\n  is_compressed?: boolean;\n  statistics?: Statistics.Statistics;\n}\nexport class DataPageHeaderV2 {\n  public num_values: number;\n  public num_nulls: number;\n  public num_rows: number;\n  public encoding: Encoding.Encoding;\n  public definition_levels_byte_length: number;\n  public repetition_levels_byte_length: number;\n  public is_compressed?: boolean = true;\n  public statistics?: Statistics.Statistics;\n  constructor(args: IDataPageHeaderV2Args) {\n    if (args != null && args.num_values != null) {\n      this.num_values = args.num_values;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[num_values] is unset!'\n      );\n    }\n    if (args != null && args.num_nulls != null) {\n      this.num_nulls = args.num_nulls;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[num_nulls] is unset!'\n      );\n    }\n    if (args != null && args.num_rows != null) {\n      this.num_rows = args.num_rows;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[num_rows] is unset!'\n      );\n    }\n    if (args != null && args.encoding != null) {\n      this.encoding = args.encoding;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[encoding] is unset!'\n      );\n    }\n    if (args != null && args.definition_levels_byte_length != null) {\n      this.definition_levels_byte_length = args.definition_levels_byte_length;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[definition_levels_byte_length] is unset!'\n      );\n    }\n    if (args != null && args.repetition_levels_byte_length != null) {\n      this.repetition_levels_byte_length = args.repetition_levels_byte_length;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[repetition_levels_byte_length] is unset!'\n      );\n    }\n    if (args != null && args.is_compressed != null) {\n      this.is_compressed = args.is_compressed;\n    }\n    if (args != null && args.statistics != null) {\n      this.statistics = args.statistics;\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('DataPageHeaderV2');\n    if (this.num_values != null) {\n      output.writeFieldBegin('num_values', thrift.Thrift.Type.I32, 1);\n      output.writeI32(this.num_values);\n      output.writeFieldEnd();\n    }\n    if (this.num_nulls != null) {\n      output.writeFieldBegin('num_nulls', thrift.Thrift.Type.I32, 2);\n      output.writeI32(this.num_nulls);\n      output.writeFieldEnd();\n    }\n    if (this.num_rows != null) {\n      output.writeFieldBegin('num_rows', thrift.Thrift.Type.I32, 3);\n      output.writeI32(this.num_rows);\n      output.writeFieldEnd();\n    }\n    if (this.encoding != null) {\n      output.writeFieldBegin('encoding', thrift.Thrift.Type.I32, 4);\n      output.writeI32(this.encoding);\n      output.writeFieldEnd();\n    }\n    if (this.definition_levels_byte_length != null) {\n      output.writeFieldBegin('definition_levels_byte_length', thrift.Thrift.Type.I32, 5);\n      output.writeI32(this.definition_levels_byte_length);\n      output.writeFieldEnd();\n    }\n    if (this.repetition_levels_byte_length != null) {\n      output.writeFieldBegin('repetition_levels_byte_length', thrift.Thrift.Type.I32, 6);\n      output.writeI32(this.repetition_levels_byte_length);\n      output.writeFieldEnd();\n    }\n    if (this.is_compressed != null) {\n      output.writeFieldBegin('is_compressed', thrift.Thrift.Type.BOOL, 7);\n      output.writeBool(this.is_compressed);\n      output.writeFieldEnd();\n    }\n    if (this.statistics != null) {\n      output.writeFieldBegin('statistics', thrift.Thrift.Type.STRUCT, 8);\n      this.statistics.write(output);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): DataPageHeaderV2 {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_1: number = input.readI32();\n            _args.num_values = value_1;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_2: number = input.readI32();\n            _args.num_nulls = value_2;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 3:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_3: number = input.readI32();\n            _args.num_rows = value_3;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 4:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_4: Encoding.Encoding = input.readI32();\n            _args.encoding = value_4;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 5:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_5: number = input.readI32();\n            _args.definition_levels_byte_length = value_5;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 6:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_6: number = input.readI32();\n            _args.repetition_levels_byte_length = value_6;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 7:\n          if (fieldType === thrift.Thrift.Type.BOOL) {\n            const value_7: boolean = input.readBool();\n            _args.is_compressed = value_7;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 8:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            const value_8: Statistics.Statistics = Statistics.Statistics.read(input);\n            _args.statistics = value_8;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (\n      _args.num_values !== undefined &&\n      _args.num_nulls !== undefined &&\n      _args.num_rows !== undefined &&\n      _args.encoding !== undefined &&\n      _args.definition_levels_byte_length !== undefined &&\n      _args.repetition_levels_byte_length !== undefined\n    ) {\n      return new DataPageHeaderV2(_args);\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read DataPageHeaderV2 from input'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nimport * as DataPageHeader from './DataPageHeader';\nimport * as DataPageHeaderV2 from './DataPageHeaderV2';\nimport * as DictionaryPageHeader from './DictionaryPageHeader';\nimport * as IndexPageHeader from './IndexPageHeader';\nimport * as PageType from './PageType';\nexport interface IPageHeaderArgs {\n  type: PageType.PageType;\n  uncompressed_page_size: number;\n  compressed_page_size: number;\n  crc?: number;\n  data_page_header?: DataPageHeader.DataPageHeader;\n  index_page_header?: IndexPageHeader.IndexPageHeader;\n  dictionary_page_header?: DictionaryPageHeader.DictionaryPageHeader;\n  data_page_header_v2?: DataPageHeaderV2.DataPageHeaderV2;\n}\nexport class PageHeader {\n  public type: PageType.PageType;\n  public uncompressed_page_size: number;\n  public compressed_page_size: number;\n  public crc?: number;\n  public data_page_header?: DataPageHeader.DataPageHeader;\n  public index_page_header?: IndexPageHeader.IndexPageHeader;\n  public dictionary_page_header?: DictionaryPageHeader.DictionaryPageHeader;\n  public data_page_header_v2?: DataPageHeaderV2.DataPageHeaderV2;\n  constructor(args: IPageHeaderArgs) {\n    if (args != null && args.type != null) {\n      this.type = args.type;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[type] is unset!'\n      );\n    }\n    if (args != null && args.uncompressed_page_size != null) {\n      this.uncompressed_page_size = args.uncompressed_page_size;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[uncompressed_page_size] is unset!'\n      );\n    }\n    if (args != null && args.compressed_page_size != null) {\n      this.compressed_page_size = args.compressed_page_size;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[compressed_page_size] is unset!'\n      );\n    }\n    if (args != null && args.crc != null) {\n      this.crc = args.crc;\n    }\n    if (args != null && args.data_page_header != null) {\n      this.data_page_header = args.data_page_header;\n    }\n    if (args != null && args.index_page_header != null) {\n      this.index_page_header = args.index_page_header;\n    }\n    if (args != null && args.dictionary_page_header != null) {\n      this.dictionary_page_header = args.dictionary_page_header;\n    }\n    if (args != null && args.data_page_header_v2 != null) {\n      this.data_page_header_v2 = args.data_page_header_v2;\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('PageHeader');\n    if (this.type != null) {\n      output.writeFieldBegin('type', thrift.Thrift.Type.I32, 1);\n      output.writeI32(this.type);\n      output.writeFieldEnd();\n    }\n    if (this.uncompressed_page_size != null) {\n      output.writeFieldBegin('uncompressed_page_size', thrift.Thrift.Type.I32, 2);\n      output.writeI32(this.uncompressed_page_size);\n      output.writeFieldEnd();\n    }\n    if (this.compressed_page_size != null) {\n      output.writeFieldBegin('compressed_page_size', thrift.Thrift.Type.I32, 3);\n      output.writeI32(this.compressed_page_size);\n      output.writeFieldEnd();\n    }\n    if (this.crc != null) {\n      output.writeFieldBegin('crc', thrift.Thrift.Type.I32, 4);\n      output.writeI32(this.crc);\n      output.writeFieldEnd();\n    }\n    if (this.data_page_header != null) {\n      output.writeFieldBegin('data_page_header', thrift.Thrift.Type.STRUCT, 5);\n      this.data_page_header.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.index_page_header != null) {\n      output.writeFieldBegin('index_page_header', thrift.Thrift.Type.STRUCT, 6);\n      this.index_page_header.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.dictionary_page_header != null) {\n      output.writeFieldBegin('dictionary_page_header', thrift.Thrift.Type.STRUCT, 7);\n      this.dictionary_page_header.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.data_page_header_v2 != null) {\n      output.writeFieldBegin('data_page_header_v2', thrift.Thrift.Type.STRUCT, 8);\n      this.data_page_header_v2.write(output);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): PageHeader {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_1: PageType.PageType = input.readI32();\n            _args.type = value_1;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_2: number = input.readI32();\n            _args.uncompressed_page_size = value_2;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 3:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_3: number = input.readI32();\n            _args.compressed_page_size = value_3;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 4:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_4: number = input.readI32();\n            _args.crc = value_4;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 5:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            const value_5: DataPageHeader.DataPageHeader =\n              DataPageHeader.DataPageHeader.read(input);\n            _args.data_page_header = value_5;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 6:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            const value_6: IndexPageHeader.IndexPageHeader =\n              IndexPageHeader.IndexPageHeader.read(input);\n            _args.index_page_header = value_6;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 7:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            const value_7: DictionaryPageHeader.DictionaryPageHeader =\n              DictionaryPageHeader.DictionaryPageHeader.read(input);\n            _args.dictionary_page_header = value_7;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 8:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            const value_8: DataPageHeaderV2.DataPageHeaderV2 =\n              DataPageHeaderV2.DataPageHeaderV2.read(input);\n            _args.data_page_header_v2 = value_8;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (\n      _args.type !== undefined &&\n      _args.uncompressed_page_size !== undefined &&\n      _args.compressed_page_size !== undefined\n    ) {\n      return new PageHeader(_args);\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read PageHeader from input'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface IKeyValueArgs {\n  key: string;\n  value?: string;\n}\nexport class KeyValue {\n  public key: string;\n  public value?: string;\n  constructor(args: IKeyValueArgs) {\n    if (args != null && args.key != null) {\n      this.key = args.key;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[key] is unset!'\n      );\n    }\n    if (args != null && args.value != null) {\n      this.value = args.value;\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('KeyValue');\n    if (this.key != null) {\n      output.writeFieldBegin('key', thrift.Thrift.Type.STRING, 1);\n      output.writeString(this.key);\n      output.writeFieldEnd();\n    }\n    if (this.value != null) {\n      output.writeFieldBegin('value', thrift.Thrift.Type.STRING, 2);\n      output.writeString(this.value);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): KeyValue {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.STRING) {\n            const value_1: string = input.readString();\n            _args.key = value_1;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.STRING) {\n            const value_2: string = input.readString();\n            _args.value = value_2;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (_args.key !== undefined) {\n      return new KeyValue(_args);\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read KeyValue from input'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface ISortingColumnArgs {\n  column_idx: number;\n  descending: boolean;\n  nulls_first: boolean;\n}\nexport class SortingColumn {\n  public column_idx: number;\n  public descending: boolean;\n  public nulls_first: boolean;\n  constructor(args: ISortingColumnArgs) {\n    if (args != null && args.column_idx != null) {\n      this.column_idx = args.column_idx;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[column_idx] is unset!'\n      );\n    }\n    if (args != null && args.descending != null) {\n      this.descending = args.descending;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[descending] is unset!'\n      );\n    }\n    if (args != null && args.nulls_first != null) {\n      this.nulls_first = args.nulls_first;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[nulls_first] is unset!'\n      );\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('SortingColumn');\n    if (this.column_idx != null) {\n      output.writeFieldBegin('column_idx', thrift.Thrift.Type.I32, 1);\n      output.writeI32(this.column_idx);\n      output.writeFieldEnd();\n    }\n    if (this.descending != null) {\n      output.writeFieldBegin('descending', thrift.Thrift.Type.BOOL, 2);\n      output.writeBool(this.descending);\n      output.writeFieldEnd();\n    }\n    if (this.nulls_first != null) {\n      output.writeFieldBegin('nulls_first', thrift.Thrift.Type.BOOL, 3);\n      output.writeBool(this.nulls_first);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): SortingColumn {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_1: number = input.readI32();\n            _args.column_idx = value_1;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.BOOL) {\n            const value_2: boolean = input.readBool();\n            _args.descending = value_2;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 3:\n          if (fieldType === thrift.Thrift.Type.BOOL) {\n            const value_3: boolean = input.readBool();\n            _args.nulls_first = value_3;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (\n      _args.column_idx !== undefined &&\n      _args.descending !== undefined &&\n      _args.nulls_first !== undefined\n    ) {\n      return new SortingColumn(_args);\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read SortingColumn from input'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nimport * as Encoding from './Encoding';\nimport * as PageType from './PageType';\nexport interface IPageEncodingStatsArgs {\n  page_type: PageType.PageType;\n  encoding: Encoding.Encoding;\n  count: number;\n}\nexport class PageEncodingStats {\n  public page_type: PageType.PageType;\n  public encoding: Encoding.Encoding;\n  public count: number;\n  constructor(args: IPageEncodingStatsArgs) {\n    if (args != null && args.page_type != null) {\n      this.page_type = args.page_type;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[page_type] is unset!'\n      );\n    }\n    if (args != null && args.encoding != null) {\n      this.encoding = args.encoding;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[encoding] is unset!'\n      );\n    }\n    if (args != null && args.count != null) {\n      this.count = args.count;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[count] is unset!'\n      );\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('PageEncodingStats');\n    if (this.page_type != null) {\n      output.writeFieldBegin('page_type', thrift.Thrift.Type.I32, 1);\n      output.writeI32(this.page_type);\n      output.writeFieldEnd();\n    }\n    if (this.encoding != null) {\n      output.writeFieldBegin('encoding', thrift.Thrift.Type.I32, 2);\n      output.writeI32(this.encoding);\n      output.writeFieldEnd();\n    }\n    if (this.count != null) {\n      output.writeFieldBegin('count', thrift.Thrift.Type.I32, 3);\n      output.writeI32(this.count);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): PageEncodingStats {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_1: PageType.PageType = input.readI32();\n            _args.page_type = value_1;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_2: Encoding.Encoding = input.readI32();\n            _args.encoding = value_2;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 3:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_3: number = input.readI32();\n            _args.count = value_3;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (\n      _args.page_type !== undefined &&\n      _args.encoding !== undefined &&\n      _args.count !== undefined\n    ) {\n      return new PageEncodingStats(_args);\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read PageEncodingStats from input'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport Int64 from 'node-int64';\nimport * as thrift from 'thrift';\nimport * as CompressionCodec from './CompressionCodec';\nimport * as Encoding from './Encoding';\nimport * as KeyValue from './KeyValue';\nimport * as PageEncodingStats from './PageEncodingStats';\nimport * as Statistics from './Statistics';\nimport * as Type from './Type';\nexport interface IColumnMetaDataArgs {\n  type: Type.Type;\n  encodings: Array<Encoding.Encoding>;\n  path_in_schema: Array<string>;\n  codec: CompressionCodec.CompressionCodec;\n  num_values: number | Int64;\n  total_uncompressed_size: number | Int64;\n  total_compressed_size: number | Int64;\n  key_value_metadata?: Array<KeyValue.KeyValue>;\n  data_page_offset: number | Int64;\n  index_page_offset?: number | Int64;\n  dictionary_page_offset?: number | Int64;\n  statistics?: Statistics.Statistics;\n  encoding_stats?: Array<PageEncodingStats.PageEncodingStats>;\n}\nexport class ColumnMetaData {\n  public type: Type.Type;\n  public encodings: Array<Encoding.Encoding>;\n  public path_in_schema: Array<string>;\n  public codec: CompressionCodec.CompressionCodec;\n  public num_values: Int64;\n  public total_uncompressed_size: Int64;\n  public total_compressed_size: Int64;\n  public key_value_metadata?: Array<KeyValue.KeyValue>;\n  public data_page_offset: Int64;\n  public index_page_offset?: Int64;\n  public dictionary_page_offset?: Int64;\n  public statistics?: Statistics.Statistics;\n  public encoding_stats?: Array<PageEncodingStats.PageEncodingStats>;\n  constructor(args: IColumnMetaDataArgs) {\n    if (args != null && args.type != null) {\n      this.type = args.type;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[type] is unset!'\n      );\n    }\n    if (args != null && args.encodings != null) {\n      this.encodings = args.encodings;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[encodings] is unset!'\n      );\n    }\n    if (args != null && args.path_in_schema != null) {\n      this.path_in_schema = args.path_in_schema;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[path_in_schema] is unset!'\n      );\n    }\n    if (args != null && args.codec != null) {\n      this.codec = args.codec;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[codec] is unset!'\n      );\n    }\n    if (args != null && args.num_values != null) {\n      if (typeof args.num_values === 'number') {\n        this.num_values = new Int64(args.num_values);\n      } else {\n        this.num_values = args.num_values;\n      }\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[num_values] is unset!'\n      );\n    }\n    if (args != null && args.total_uncompressed_size != null) {\n      if (typeof args.total_uncompressed_size === 'number') {\n        this.total_uncompressed_size = new Int64(args.total_uncompressed_size);\n      } else {\n        this.total_uncompressed_size = args.total_uncompressed_size;\n      }\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[total_uncompressed_size] is unset!'\n      );\n    }\n    if (args != null && args.total_compressed_size != null) {\n      if (typeof args.total_compressed_size === 'number') {\n        this.total_compressed_size = new Int64(args.total_compressed_size);\n      } else {\n        this.total_compressed_size = args.total_compressed_size;\n      }\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[total_compressed_size] is unset!'\n      );\n    }\n    if (args != null && args.key_value_metadata != null) {\n      this.key_value_metadata = args.key_value_metadata;\n    }\n    if (args != null && args.data_page_offset != null) {\n      if (typeof args.data_page_offset === 'number') {\n        this.data_page_offset = new Int64(args.data_page_offset);\n      } else {\n        this.data_page_offset = args.data_page_offset;\n      }\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[data_page_offset] is unset!'\n      );\n    }\n    if (args != null && args.index_page_offset != null) {\n      if (typeof args.index_page_offset === 'number') {\n        this.index_page_offset = new Int64(args.index_page_offset);\n      } else {\n        this.index_page_offset = args.index_page_offset;\n      }\n    }\n    if (args != null && args.dictionary_page_offset != null) {\n      if (typeof args.dictionary_page_offset === 'number') {\n        this.dictionary_page_offset = new Int64(args.dictionary_page_offset);\n      } else {\n        this.dictionary_page_offset = args.dictionary_page_offset;\n      }\n    }\n    if (args != null && args.statistics != null) {\n      this.statistics = args.statistics;\n    }\n    if (args != null && args.encoding_stats != null) {\n      this.encoding_stats = args.encoding_stats;\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('ColumnMetaData');\n    if (this.type != null) {\n      output.writeFieldBegin('type', thrift.Thrift.Type.I32, 1);\n      output.writeI32(this.type);\n      output.writeFieldEnd();\n    }\n    if (this.encodings != null) {\n      output.writeFieldBegin('encodings', thrift.Thrift.Type.LIST, 2);\n      output.writeListBegin(thrift.Thrift.Type.I32, this.encodings.length);\n      this.encodings.forEach((value_1: Encoding.Encoding): void => {\n        output.writeI32(value_1);\n      });\n      output.writeListEnd();\n      output.writeFieldEnd();\n    }\n    if (this.path_in_schema != null) {\n      output.writeFieldBegin('path_in_schema', thrift.Thrift.Type.LIST, 3);\n      output.writeListBegin(thrift.Thrift.Type.STRING, this.path_in_schema.length);\n      this.path_in_schema.forEach((value_2: string): void => {\n        output.writeString(value_2);\n      });\n      output.writeListEnd();\n      output.writeFieldEnd();\n    }\n    if (this.codec != null) {\n      output.writeFieldBegin('codec', thrift.Thrift.Type.I32, 4);\n      output.writeI32(this.codec);\n      output.writeFieldEnd();\n    }\n    if (this.num_values != null) {\n      output.writeFieldBegin('num_values', thrift.Thrift.Type.I64, 5);\n      output.writeI64(this.num_values);\n      output.writeFieldEnd();\n    }\n    if (this.total_uncompressed_size != null) {\n      output.writeFieldBegin('total_uncompressed_size', thrift.Thrift.Type.I64, 6);\n      output.writeI64(this.total_uncompressed_size);\n      output.writeFieldEnd();\n    }\n    if (this.total_compressed_size != null) {\n      output.writeFieldBegin('total_compressed_size', thrift.Thrift.Type.I64, 7);\n      output.writeI64(this.total_compressed_size);\n      output.writeFieldEnd();\n    }\n    if (this.key_value_metadata != null) {\n      output.writeFieldBegin('key_value_metadata', thrift.Thrift.Type.LIST, 8);\n      output.writeListBegin(thrift.Thrift.Type.STRUCT, this.key_value_metadata.length);\n      this.key_value_metadata.forEach((value_3: KeyValue.KeyValue): void => {\n        value_3.write(output);\n      });\n      output.writeListEnd();\n      output.writeFieldEnd();\n    }\n    if (this.data_page_offset != null) {\n      output.writeFieldBegin('data_page_offset', thrift.Thrift.Type.I64, 9);\n      output.writeI64(this.data_page_offset);\n      output.writeFieldEnd();\n    }\n    if (this.index_page_offset != null) {\n      output.writeFieldBegin('index_page_offset', thrift.Thrift.Type.I64, 10);\n      output.writeI64(this.index_page_offset);\n      output.writeFieldEnd();\n    }\n    if (this.dictionary_page_offset != null) {\n      output.writeFieldBegin('dictionary_page_offset', thrift.Thrift.Type.I64, 11);\n      output.writeI64(this.dictionary_page_offset);\n      output.writeFieldEnd();\n    }\n    if (this.statistics != null) {\n      output.writeFieldBegin('statistics', thrift.Thrift.Type.STRUCT, 12);\n      this.statistics.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.encoding_stats != null) {\n      output.writeFieldBegin('encoding_stats', thrift.Thrift.Type.LIST, 13);\n      output.writeListBegin(thrift.Thrift.Type.STRUCT, this.encoding_stats.length);\n      this.encoding_stats.forEach((value_4: PageEncodingStats.PageEncodingStats): void => {\n        value_4.write(output);\n      });\n      output.writeListEnd();\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): ColumnMetaData {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_5: Type.Type = input.readI32();\n            _args.type = value_5;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.LIST) {\n            const value_6: Array<Encoding.Encoding> = new Array<Encoding.Encoding>();\n            const metadata_1: thrift.TList = input.readListBegin();\n            const size_1: number = metadata_1.size;\n            for (let i_1: number = 0; i_1 < size_1; i_1++) {\n              const value_7: Encoding.Encoding = input.readI32();\n              value_6.push(value_7);\n            }\n            input.readListEnd();\n            _args.encodings = value_6;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 3:\n          if (fieldType === thrift.Thrift.Type.LIST) {\n            const value_8: Array<string> = new Array<string>();\n            const metadata_2: thrift.TList = input.readListBegin();\n            const size_2: number = metadata_2.size;\n            for (let i_2: number = 0; i_2 < size_2; i_2++) {\n              const value_9: string = input.readString();\n              value_8.push(value_9);\n            }\n            input.readListEnd();\n            _args.path_in_schema = value_8;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 4:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_10: CompressionCodec.CompressionCodec = input.readI32();\n            _args.codec = value_10;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 5:\n          if (fieldType === thrift.Thrift.Type.I64) {\n            const value_11: Int64 = input.readI64();\n            _args.num_values = value_11;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 6:\n          if (fieldType === thrift.Thrift.Type.I64) {\n            const value_12: Int64 = input.readI64();\n            _args.total_uncompressed_size = value_12;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 7:\n          if (fieldType === thrift.Thrift.Type.I64) {\n            const value_13: Int64 = input.readI64();\n            _args.total_compressed_size = value_13;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 8:\n          if (fieldType === thrift.Thrift.Type.LIST) {\n            const value_14: Array<KeyValue.KeyValue> = new Array<KeyValue.KeyValue>();\n            const metadata_3: thrift.TList = input.readListBegin();\n            const size_3: number = metadata_3.size;\n            for (let i_3: number = 0; i_3 < size_3; i_3++) {\n              const value_15: KeyValue.KeyValue = KeyValue.KeyValue.read(input);\n              value_14.push(value_15);\n            }\n            input.readListEnd();\n            _args.key_value_metadata = value_14;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 9:\n          if (fieldType === thrift.Thrift.Type.I64) {\n            const value_16: Int64 = input.readI64();\n            _args.data_page_offset = value_16;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 10:\n          if (fieldType === thrift.Thrift.Type.I64) {\n            const value_17: Int64 = input.readI64();\n            _args.index_page_offset = value_17;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 11:\n          if (fieldType === thrift.Thrift.Type.I64) {\n            const value_18: Int64 = input.readI64();\n            _args.dictionary_page_offset = value_18;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 12:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            const value_19: Statistics.Statistics = Statistics.Statistics.read(input);\n            _args.statistics = value_19;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 13:\n          if (fieldType === thrift.Thrift.Type.LIST) {\n            const value_20: Array<PageEncodingStats.PageEncodingStats> =\n              new Array<PageEncodingStats.PageEncodingStats>();\n            const metadata_4: thrift.TList = input.readListBegin();\n            const size_4: number = metadata_4.size;\n            for (let i_4: number = 0; i_4 < size_4; i_4++) {\n              const value_21: PageEncodingStats.PageEncodingStats =\n                PageEncodingStats.PageEncodingStats.read(input);\n              value_20.push(value_21);\n            }\n            input.readListEnd();\n            _args.encoding_stats = value_20;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (\n      _args.type !== undefined &&\n      _args.encodings !== undefined &&\n      _args.path_in_schema !== undefined &&\n      _args.codec !== undefined &&\n      _args.num_values !== undefined &&\n      _args.total_uncompressed_size !== undefined &&\n      _args.total_compressed_size !== undefined &&\n      _args.data_page_offset !== undefined\n    ) {\n      return new ColumnMetaData(_args);\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read ColumnMetaData from input'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport Int64 from 'node-int64';\nimport * as thrift from 'thrift';\nimport * as ColumnMetaData from './ColumnMetaData';\nexport interface IColumnChunkArgs {\n  file_path?: string;\n  file_offset: number | Int64;\n  meta_data?: ColumnMetaData.ColumnMetaData;\n  offset_index_offset?: number | Int64;\n  offset_index_length?: number;\n  column_index_offset?: number | Int64;\n  column_index_length?: number;\n}\nexport class ColumnChunk {\n  public file_path?: string;\n  public file_offset: Int64;\n  public meta_data?: ColumnMetaData.ColumnMetaData;\n  public offset_index_offset?: Int64;\n  public offset_index_length?: number;\n  public column_index_offset?: Int64;\n  public column_index_length?: number;\n  constructor(args: IColumnChunkArgs) {\n    if (args != null && args.file_path != null) {\n      this.file_path = args.file_path;\n    }\n    if (args != null && args.file_offset != null) {\n      if (typeof args.file_offset === 'number') {\n        this.file_offset = new Int64(args.file_offset);\n      } else {\n        this.file_offset = args.file_offset;\n      }\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[file_offset] is unset!'\n      );\n    }\n    if (args != null && args.meta_data != null) {\n      this.meta_data = args.meta_data;\n    }\n    if (args != null && args.offset_index_offset != null) {\n      if (typeof args.offset_index_offset === 'number') {\n        this.offset_index_offset = new Int64(args.offset_index_offset);\n      } else {\n        this.offset_index_offset = args.offset_index_offset;\n      }\n    }\n    if (args != null && args.offset_index_length != null) {\n      this.offset_index_length = args.offset_index_length;\n    }\n    if (args != null && args.column_index_offset != null) {\n      if (typeof args.column_index_offset === 'number') {\n        this.column_index_offset = new Int64(args.column_index_offset);\n      } else {\n        this.column_index_offset = args.column_index_offset;\n      }\n    }\n    if (args != null && args.column_index_length != null) {\n      this.column_index_length = args.column_index_length;\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('ColumnChunk');\n    if (this.file_path != null) {\n      output.writeFieldBegin('file_path', thrift.Thrift.Type.STRING, 1);\n      output.writeString(this.file_path);\n      output.writeFieldEnd();\n    }\n    if (this.file_offset != null) {\n      output.writeFieldBegin('file_offset', thrift.Thrift.Type.I64, 2);\n      output.writeI64(this.file_offset);\n      output.writeFieldEnd();\n    }\n    if (this.meta_data != null) {\n      output.writeFieldBegin('meta_data', thrift.Thrift.Type.STRUCT, 3);\n      this.meta_data.write(output);\n      output.writeFieldEnd();\n    }\n    if (this.offset_index_offset != null) {\n      output.writeFieldBegin('offset_index_offset', thrift.Thrift.Type.I64, 4);\n      output.writeI64(this.offset_index_offset);\n      output.writeFieldEnd();\n    }\n    if (this.offset_index_length != null) {\n      output.writeFieldBegin('offset_index_length', thrift.Thrift.Type.I32, 5);\n      output.writeI32(this.offset_index_length);\n      output.writeFieldEnd();\n    }\n    if (this.column_index_offset != null) {\n      output.writeFieldBegin('column_index_offset', thrift.Thrift.Type.I64, 6);\n      output.writeI64(this.column_index_offset);\n      output.writeFieldEnd();\n    }\n    if (this.column_index_length != null) {\n      output.writeFieldBegin('column_index_length', thrift.Thrift.Type.I32, 7);\n      output.writeI32(this.column_index_length);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): ColumnChunk {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.STRING) {\n            const value_1: string = input.readString();\n            _args.file_path = value_1;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.I64) {\n            const value_2: Int64 = input.readI64();\n            _args.file_offset = value_2;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 3:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            const value_3: ColumnMetaData.ColumnMetaData =\n              ColumnMetaData.ColumnMetaData.read(input);\n            _args.meta_data = value_3;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 4:\n          if (fieldType === thrift.Thrift.Type.I64) {\n            const value_4: Int64 = input.readI64();\n            _args.offset_index_offset = value_4;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 5:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_5: number = input.readI32();\n            _args.offset_index_length = value_5;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 6:\n          if (fieldType === thrift.Thrift.Type.I64) {\n            const value_6: Int64 = input.readI64();\n            _args.column_index_offset = value_6;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 7:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_7: number = input.readI32();\n            _args.column_index_length = value_7;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (_args.file_offset !== undefined) {\n      return new ColumnChunk(_args);\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read ColumnChunk from input'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport Int64 from 'node-int64';\nimport * as thrift from 'thrift';\nimport * as ColumnChunk from './ColumnChunk';\nimport * as SortingColumn from './SortingColumn';\nexport interface IRowGroupArgs {\n  columns: Array<ColumnChunk.ColumnChunk>;\n  total_byte_size: number | Int64;\n  num_rows: number | Int64;\n  sorting_columns?: Array<SortingColumn.SortingColumn>;\n}\nexport class RowGroup {\n  public columns: Array<ColumnChunk.ColumnChunk>;\n  public total_byte_size: Int64;\n  public num_rows: Int64;\n  public sorting_columns?: Array<SortingColumn.SortingColumn>;\n  constructor(args: IRowGroupArgs) {\n    if (args != null && args.columns != null) {\n      this.columns = args.columns;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[columns] is unset!'\n      );\n    }\n    if (args != null && args.total_byte_size != null) {\n      if (typeof args.total_byte_size === 'number') {\n        this.total_byte_size = new Int64(args.total_byte_size);\n      } else {\n        this.total_byte_size = args.total_byte_size;\n      }\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[total_byte_size] is unset!'\n      );\n    }\n    if (args != null && args.num_rows != null) {\n      if (typeof args.num_rows === 'number') {\n        this.num_rows = new Int64(args.num_rows);\n      } else {\n        this.num_rows = args.num_rows;\n      }\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[num_rows] is unset!'\n      );\n    }\n    if (args != null && args.sorting_columns != null) {\n      this.sorting_columns = args.sorting_columns;\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('RowGroup');\n    if (this.columns != null) {\n      output.writeFieldBegin('columns', thrift.Thrift.Type.LIST, 1);\n      output.writeListBegin(thrift.Thrift.Type.STRUCT, this.columns.length);\n      this.columns.forEach((value_1: ColumnChunk.ColumnChunk): void => {\n        value_1.write(output);\n      });\n      output.writeListEnd();\n      output.writeFieldEnd();\n    }\n    if (this.total_byte_size != null) {\n      output.writeFieldBegin('total_byte_size', thrift.Thrift.Type.I64, 2);\n      output.writeI64(this.total_byte_size);\n      output.writeFieldEnd();\n    }\n    if (this.num_rows != null) {\n      output.writeFieldBegin('num_rows', thrift.Thrift.Type.I64, 3);\n      output.writeI64(this.num_rows);\n      output.writeFieldEnd();\n    }\n    if (this.sorting_columns != null) {\n      output.writeFieldBegin('sorting_columns', thrift.Thrift.Type.LIST, 4);\n      output.writeListBegin(thrift.Thrift.Type.STRUCT, this.sorting_columns.length);\n      this.sorting_columns.forEach((value_2: SortingColumn.SortingColumn): void => {\n        value_2.write(output);\n      });\n      output.writeListEnd();\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): RowGroup {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.LIST) {\n            const value_3: Array<ColumnChunk.ColumnChunk> = new Array<ColumnChunk.ColumnChunk>();\n            const metadata_1: thrift.TList = input.readListBegin();\n            const size_1: number = metadata_1.size;\n            for (let i_1: number = 0; i_1 < size_1; i_1++) {\n              const value_4: ColumnChunk.ColumnChunk = ColumnChunk.ColumnChunk.read(input);\n              value_3.push(value_4);\n            }\n            input.readListEnd();\n            _args.columns = value_3;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.I64) {\n            const value_5: Int64 = input.readI64();\n            _args.total_byte_size = value_5;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 3:\n          if (fieldType === thrift.Thrift.Type.I64) {\n            const value_6: Int64 = input.readI64();\n            _args.num_rows = value_6;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 4:\n          if (fieldType === thrift.Thrift.Type.LIST) {\n            const value_7: Array<SortingColumn.SortingColumn> =\n              new Array<SortingColumn.SortingColumn>();\n            const metadata_2: thrift.TList = input.readListBegin();\n            const size_2: number = metadata_2.size;\n            for (let i_2: number = 0; i_2 < size_2; i_2++) {\n              const value_8: SortingColumn.SortingColumn = SortingColumn.SortingColumn.read(input);\n              value_7.push(value_8);\n            }\n            input.readListEnd();\n            _args.sorting_columns = value_7;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (\n      _args.columns !== undefined &&\n      _args.total_byte_size !== undefined &&\n      _args.num_rows !== undefined\n    ) {\n      return new RowGroup(_args);\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read RowGroup from input'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nexport interface ITypeDefinedOrderArgs {}\nexport class TypeDefinedOrder {\n  constructor() {}\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('TypeDefinedOrder');\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): TypeDefinedOrder {\n    input.readStructBegin();\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    return new TypeDefinedOrder();\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport Int64 from 'node-int64';\nimport * as thrift from 'thrift';\nimport * as ColumnOrder from './ColumnOrder';\nimport * as KeyValue from './KeyValue';\nimport * as RowGroup from './RowGroup';\nimport * as SchemaElement from './SchemaElement';\nexport interface IFileMetaDataArgs {\n  version: number;\n  schema: Array<SchemaElement.SchemaElement>;\n  num_rows: number | Int64;\n  row_groups: Array<RowGroup.RowGroup>;\n  key_value_metadata?: Array<KeyValue.KeyValue>;\n  created_by?: string;\n  column_orders?: Array<ColumnOrder.ColumnOrder>;\n}\nexport class FileMetaData {\n  public version: number;\n  public schema: Array<SchemaElement.SchemaElement>;\n  public num_rows: Int64;\n  public row_groups: Array<RowGroup.RowGroup>;\n  public key_value_metadata?: Array<KeyValue.KeyValue>;\n  public created_by?: string;\n  public column_orders?: Array<ColumnOrder.ColumnOrder>;\n  constructor(args: IFileMetaDataArgs | null = null) {\n    if (args != null && args.version != null) {\n      this.version = args.version;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[version] is unset!'\n      );\n    }\n    if (args != null && args.schema != null) {\n      this.schema = args.schema;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[schema] is unset!'\n      );\n    }\n    if (args != null && args.num_rows != null) {\n      if (typeof args.num_rows === 'number') {\n        this.num_rows = new Int64(args.num_rows);\n      } else {\n        this.num_rows = args.num_rows;\n      }\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[num_rows] is unset!'\n      );\n    }\n    if (args != null && args.row_groups != null) {\n      this.row_groups = args.row_groups;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Required field[row_groups] is unset!'\n      );\n    }\n    if (args != null && args.key_value_metadata != null) {\n      this.key_value_metadata = args.key_value_metadata;\n    }\n    if (args != null && args.created_by != null) {\n      this.created_by = args.created_by;\n    }\n    if (args != null && args.column_orders != null) {\n      this.column_orders = args.column_orders;\n    }\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('FileMetaData');\n    if (this.version != null) {\n      output.writeFieldBegin('version', thrift.Thrift.Type.I32, 1);\n      output.writeI32(this.version);\n      output.writeFieldEnd();\n    }\n    if (this.schema != null) {\n      output.writeFieldBegin('schema', thrift.Thrift.Type.LIST, 2);\n      output.writeListBegin(thrift.Thrift.Type.STRUCT, this.schema.length);\n      this.schema.forEach((value_1: SchemaElement.SchemaElement): void => {\n        value_1.write(output);\n      });\n      output.writeListEnd();\n      output.writeFieldEnd();\n    }\n    if (this.num_rows != null) {\n      output.writeFieldBegin('num_rows', thrift.Thrift.Type.I64, 3);\n      output.writeI64(this.num_rows);\n      output.writeFieldEnd();\n    }\n    if (this.row_groups != null) {\n      output.writeFieldBegin('row_groups', thrift.Thrift.Type.LIST, 4);\n      output.writeListBegin(thrift.Thrift.Type.STRUCT, this.row_groups.length);\n      this.row_groups.forEach((value_2: RowGroup.RowGroup): void => {\n        value_2.write(output);\n      });\n      output.writeListEnd();\n      output.writeFieldEnd();\n    }\n    if (this.key_value_metadata != null) {\n      output.writeFieldBegin('key_value_metadata', thrift.Thrift.Type.LIST, 5);\n      output.writeListBegin(thrift.Thrift.Type.STRUCT, this.key_value_metadata.length);\n      this.key_value_metadata.forEach((value_3: KeyValue.KeyValue): void => {\n        value_3.write(output);\n      });\n      output.writeListEnd();\n      output.writeFieldEnd();\n    }\n    if (this.created_by != null) {\n      output.writeFieldBegin('created_by', thrift.Thrift.Type.STRING, 6);\n      output.writeString(this.created_by);\n      output.writeFieldEnd();\n    }\n    if (this.column_orders != null) {\n      output.writeFieldBegin('column_orders', thrift.Thrift.Type.LIST, 7);\n      output.writeListBegin(thrift.Thrift.Type.STRUCT, this.column_orders.length);\n      this.column_orders.forEach((value_4: ColumnOrder.ColumnOrder): void => {\n        value_4.write(output);\n      });\n      output.writeListEnd();\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): FileMetaData {\n    input.readStructBegin();\n    let _args: any = {};\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.I32) {\n            const value_5: number = input.readI32();\n            _args.version = value_5;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 2:\n          if (fieldType === thrift.Thrift.Type.LIST) {\n            const value_6: Array<SchemaElement.SchemaElement> =\n              new Array<SchemaElement.SchemaElement>();\n            const metadata_1: thrift.TList = input.readListBegin();\n            const size_1: number = metadata_1.size;\n            for (let i_1: number = 0; i_1 < size_1; i_1++) {\n              const value_7: SchemaElement.SchemaElement = SchemaElement.SchemaElement.read(input);\n              value_6.push(value_7);\n            }\n            input.readListEnd();\n            _args.schema = value_6;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 3:\n          if (fieldType === thrift.Thrift.Type.I64) {\n            const value_8: Int64 = input.readI64();\n            _args.num_rows = value_8;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 4:\n          if (fieldType === thrift.Thrift.Type.LIST) {\n            const value_9: Array<RowGroup.RowGroup> = new Array<RowGroup.RowGroup>();\n            const metadata_2: thrift.TList = input.readListBegin();\n            const size_2: number = metadata_2.size;\n            for (let i_2: number = 0; i_2 < size_2; i_2++) {\n              const value_10: RowGroup.RowGroup = RowGroup.RowGroup.read(input);\n              value_9.push(value_10);\n            }\n            input.readListEnd();\n            _args.row_groups = value_9;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 5:\n          if (fieldType === thrift.Thrift.Type.LIST) {\n            const value_11: Array<KeyValue.KeyValue> = new Array<KeyValue.KeyValue>();\n            const metadata_3: thrift.TList = input.readListBegin();\n            const size_3: number = metadata_3.size;\n            for (let i_3: number = 0; i_3 < size_3; i_3++) {\n              const value_12: KeyValue.KeyValue = KeyValue.KeyValue.read(input);\n              value_11.push(value_12);\n            }\n            input.readListEnd();\n            _args.key_value_metadata = value_11;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 6:\n          if (fieldType === thrift.Thrift.Type.STRING) {\n            const value_13: string = input.readString();\n            _args.created_by = value_13;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        case 7:\n          if (fieldType === thrift.Thrift.Type.LIST) {\n            const value_14: Array<ColumnOrder.ColumnOrder> = new Array<ColumnOrder.ColumnOrder>();\n            const metadata_4: thrift.TList = input.readListBegin();\n            const size_4: number = metadata_4.size;\n            for (let i_4: number = 0; i_4 < size_4; i_4++) {\n              const value_15: ColumnOrder.ColumnOrder = ColumnOrder.ColumnOrder.read(input);\n              value_14.push(value_15);\n            }\n            input.readListEnd();\n            _args.column_orders = value_14;\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (\n      _args.version !== undefined &&\n      _args.schema !== undefined &&\n      _args.num_rows !== undefined &&\n      _args.row_groups !== undefined\n    ) {\n      return new FileMetaData(_args);\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read FileMetaData from input'\n      );\n    }\n  }\n}\n", "/* tslint:disable */\n/* eslint-disable */\n/*\n * Autogenerated by @creditkarma/thrift-typescript v3.7.2\n * DO NOT EDIT UNLESS YOU ARE SURE THAT YOU KNOW WHAT YOU ARE DOING\n */\nimport * as thrift from 'thrift';\nimport * as TypeDefinedOrder from './TypeDefinedOrder';\nexport interface IColumnOrderArgs {\n  TYPE_ORDER?: TypeDefinedOrder.TypeDefinedOrder;\n}\nexport class ColumnOrder {\n  public TYPE_ORDER?: TypeDefinedOrder.TypeDefinedOrder;\n  constructor(args?: IColumnOrderArgs) {\n    let _fieldsSet: number = 0;\n    if (args != null) {\n      if (args.TYPE_ORDER != null) {\n        _fieldsSet++;\n        this.TYPE_ORDER = args.TYPE_ORDER;\n      }\n      if (_fieldsSet > 1) {\n        throw new thrift.Thrift.TProtocolException(\n          thrift.Thrift.TProtocolExceptionType.INVALID_DATA,\n          'Cannot read a TUnion with more than one set value!'\n        );\n      } else if (_fieldsSet < 1) {\n        throw new thrift.Thrift.TProtocolException(\n          thrift.Thrift.TProtocolExceptionType.INVALID_DATA,\n          'Cannot read a TUnion with no set value!'\n        );\n      }\n    }\n  }\n  public static fromTYPE_ORDER(TYPE_ORDER: TypeDefinedOrder.TypeDefinedOrder): ColumnOrder {\n    return new ColumnOrder({TYPE_ORDER});\n  }\n  public write(output: thrift.TProtocol): void {\n    output.writeStructBegin('ColumnOrder');\n    if (this.TYPE_ORDER != null) {\n      output.writeFieldBegin('TYPE_ORDER', thrift.Thrift.Type.STRUCT, 1);\n      this.TYPE_ORDER.write(output);\n      output.writeFieldEnd();\n    }\n    output.writeFieldStop();\n    output.writeStructEnd();\n    return;\n  }\n  public static read(input: thrift.TProtocol): ColumnOrder {\n    let _fieldsSet: number = 0;\n    let _returnValue: ColumnOrder | null = null;\n    input.readStructBegin();\n    while (true) {\n      const ret: thrift.TField = input.readFieldBegin();\n      const fieldType: thrift.Thrift.Type = ret.ftype;\n      const fieldId: number = ret.fid;\n      if (fieldType === thrift.Thrift.Type.STOP) {\n        break;\n      }\n      switch (fieldId) {\n        case 1:\n          if (fieldType === thrift.Thrift.Type.STRUCT) {\n            _fieldsSet++;\n            const value_1: TypeDefinedOrder.TypeDefinedOrder =\n              TypeDefinedOrder.TypeDefinedOrder.read(input);\n            _returnValue = ColumnOrder.fromTYPE_ORDER(value_1);\n          } else {\n            input.skip(fieldType);\n          }\n          break;\n        default: {\n          input.skip(fieldType);\n        }\n      }\n      input.readFieldEnd();\n    }\n    input.readStructEnd();\n    if (_fieldsSet > 1) {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.INVALID_DATA,\n        'Cannot read a TUnion with more than one set value!'\n      );\n    } else if (_fieldsSet < 1) {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.INVALID_DATA,\n        'Cannot read a TUnion with no set value!'\n      );\n    }\n    if (_returnValue !== null) {\n      return _returnValue;\n    } else {\n      throw new thrift.Thrift.TProtocolException(\n        thrift.Thrift.TProtocolExceptionType.UNKNOWN,\n        'Unable to read data for TUnion'\n      );\n    }\n  }\n}\n", "// Forked from https://github.com/kbajalc/parquets under MIT license (Copyright (c) 2017 ironSource Ltd.)\n/**\n * Parquet File Magic String\n */\nexport const PARQUET_MAGIC = 'PAR1';\nexport const PARQUET_MAGIC_ENCRYPTED = 'PARE';\n\n/**\n * Parquet File Format Version\n */\nexport const PARQUET_VERSION = 1;\n\n/**\n * Internal type used for repetition/definition levels\n */\nexport const PARQUET_RDLVL_TYPE = 'INT32';\nexport const PARQUET_RDLVL_ENCODING = 'RLE';\n", "import {TBufferedTransport, TCompactProtocol, TFramedTransport} from '../parquet-thrift';\nimport {FileMetaData, PageHeader} from '../parquet-thrift';\n\nclass UFramedTransport extends TFramedTransport {\n  public readPos: number = 0;\n}\n\n/**\n * Helper function that serializes a thrift object into a buffer\n */\nexport function serializeThrift(obj: any): Buffer {\n  const output: Buffer[] = [];\n\n  const transport = new TBufferedTransport(undefined, (buf) => {\n    output.push(buf as unknown as Buffer);\n  });\n\n  const protocol = new TCompactProtocol(transport);\n  obj.write(protocol);\n  transport.flush();\n\n  return Buffer.concat(output);\n}\n\nexport function decodeThrift(obj: any, buf: Buffer, offset?: number) {\n  if (!offset) {\n    // tslint:disable-next-line:no-parameter-reassignment\n    offset = 0;\n  }\n\n  const transport = new UFramedTransport(buf);\n  transport.readPos = offset;\n  const protocol = new TCompactProtocol(transport);\n  obj.read(protocol);\n  return transport.readPos - offset;\n}\n\n/**\n * FIXME not ideal that this is linear\n */\nexport function getThriftEnum(klass: any, value: number | string): string {\n  for (const k in klass) {\n    if (klass[k] === value) {\n      return k;\n    }\n  }\n  throw new Error('Invalid ENUM value');\n}\n\nexport function decodeFileMetadata(buf: Buffer, offset?: number) {\n  if (!offset) {\n    // tslint:disable-next-line:no-parameter-reassignment\n    offset = 0;\n  }\n\n  const transport = new UFramedTransport(buf);\n  transport.readPos = offset;\n  const protocol = new TCompactProtocol(transport);\n  const metadata = FileMetaData.read(protocol);\n  return {length: transport.readPos - offset, metadata};\n}\n\nexport function decodePageHeader(buf: Buffer, offset?: number) {\n  if (!offset) {\n    // tslint:disable-next-line:no-parameter-reassignment\n    offset = 0;\n  }\n\n  const transport = new UFramedTransport(buf);\n  transport.readPos = offset;\n  const protocol = new TCompactProtocol(transport);\n  const pageHeader = PageHeader.read(protocol);\n  return {length: transport.readPos - offset, pageHeader};\n}\n\n/**\n * Get the number of bits required to store a given value\n */\nexport function getBitWidth(val: number): number {\n  if (val === 0) {\n    return 0;\n    // tslint:disable-next-line:no-else-after-return\n  }\n  return Math.ceil(Math.log2(val + 1));\n}\n\n// Supports MQTT path wildcards\n// + all immediate children\n// # all descendents\nexport function fieldIndexOf(arr: string[][], elem: string[]): number {\n  for (let j = 0; j < arr.length; j++) {\n    if (arr[j].length > elem.length) {\n      continue; // eslint-disable-line no-continue\n    }\n    let m = true;\n    for (let i = 0; i < elem.length; i++) {\n      if (arr[j][i] === elem[i] || arr[j][i] === '+' || arr[j][i] === '#') {\n        continue; // eslint-disable-line no-continue\n      }\n      if (i >= arr[j].length && arr[j][arr[j].length - 1] === '#') {\n        continue; // eslint-disable-line no-continue\n      }\n      m = false;\n      break;\n    }\n    if (m) return j;\n  }\n  return -1;\n}\n", "// Forked from https://github.com/kbajalc/parquets under MIT license (Copyright (c) 2017 ironSource Ltd.)\nimport {\n  ParquetCodec,\n  ParquetColumnChunk,\n  ParquetReaderContext,\n  ParquetPageData,\n  ParquetType,\n  PrimitiveType,\n  SchemaDefinition\n} from '../schema/declare';\nimport {CursorBuffer, ParquetCodecOptions, PARQUET_CODECS} from '../codecs';\nimport {\n  ConvertedType,\n  Encoding,\n  FieldRepetitionType,\n  PageHeader,\n  PageType,\n  SchemaElement,\n  Type\n} from '../parquet-thrift';\nimport {decompress} from '../compression';\nimport {PARQUET_RDLVL_TYPE, PARQUET_RDLVL_ENCODING} from '../../constants';\nimport {decodePageHeader, getThriftEnum, getBitWidth} from '../utils/read-utils';\n\n/**\n * Decode data pages\n * @param buffer - input data\n * @param column - parquet column\n * @param compression - compression type\n * @returns parquet data page data\n */\nexport async function decodeDataPages(\n  buffer: Buffer,\n  context: ParquetReaderContext\n): Promise<ParquetColumnChunk> {\n  const cursor: CursorBuffer = {\n    buffer,\n    offset: 0,\n    size: buffer.length\n  };\n\n  const data: ParquetColumnChunk = {\n    rlevels: [],\n    dlevels: [],\n    values: [],\n    pageHeaders: [],\n    count: 0\n  };\n\n  let dictionary = context.dictionary || [];\n\n  while (\n    // @ts-ignore size can be undefined\n    cursor.offset < cursor.size &&\n    (!context.numValues || data.dlevels.length < Number(context.numValues))\n  ) {\n    // Looks like we have to decode these in sequence due to cursor updates?\n    const page = await decodePage(cursor, context);\n\n    if (page.dictionary) {\n      dictionary = page.dictionary;\n      // eslint-disable-next-line no-continue\n      continue;\n    }\n\n    if (dictionary.length) {\n      // eslint-disable-next-line no-loop-func\n      page.values = page.values.map((value) => dictionary[value]);\n    }\n\n    for (let index = 0; index < page.rlevels.length; index++) {\n      data.rlevels.push(page.rlevels[index]);\n      data.dlevels.push(page.dlevels[index]);\n      const value = page.values[index];\n\n      if (value !== undefined) {\n        data.values.push(value);\n      }\n    }\n\n    data.count += page.count;\n    data.pageHeaders.push(page.pageHeader);\n  }\n\n  return data;\n}\n\n/**\n * Decode parquet page based on page type\n * @param cursor\n * @param context\n */\nexport async function decodePage(\n  cursor: CursorBuffer,\n  context: ParquetReaderContext\n): Promise<ParquetPageData> {\n  let page;\n\n  const {pageHeader, length} = decodePageHeader(cursor.buffer, cursor.offset);\n  cursor.offset += length;\n\n  const pageType = getThriftEnum(PageType, pageHeader.type);\n\n  switch (pageType) {\n    case 'DATA_PAGE':\n      page = await decodeDataPage(cursor, pageHeader, context);\n      break;\n    case 'DATA_PAGE_V2':\n      page = await decodeDataPageV2(cursor, pageHeader, context);\n      break;\n    case 'DICTIONARY_PAGE':\n      page = {\n        dictionary: await decodeDictionaryPage(cursor, pageHeader, context),\n        pageHeader\n      };\n      break;\n    default:\n      throw new Error(`invalid page type: ${pageType}`);\n  }\n\n  return page;\n}\n\n/**\n * Decode parquet schema\n * @param schemaElements input schema elements data\n * @param offset offset to read from\n * @param len length of data\n * @returns result.offset\n *   result.next - offset at the end of function\n *   result.schema - schema read from the input data\n * @todo output offset is the same as input - possibly excess output field\n */\nexport function decodeSchema(\n  schemaElements: SchemaElement[],\n  offset: number,\n  len: number\n): {\n  offset: number;\n  next: number;\n  schema: SchemaDefinition;\n} {\n  const schema: SchemaDefinition = {};\n  let next = offset;\n  for (let i = 0; i < len; i++) {\n    const schemaElement = schemaElements[next];\n\n    const repetitionType =\n      next > 0 ? getThriftEnum(FieldRepetitionType, schemaElement.repetition_type!) : 'ROOT';\n\n    let optional = false;\n    let repeated = false;\n    switch (repetitionType) {\n      case 'REQUIRED':\n        break;\n      case 'OPTIONAL':\n        optional = true;\n        break;\n      case 'REPEATED':\n        repeated = true;\n        break;\n      default:\n        throw new Error('parquet: unknown repetition type');\n    }\n\n    if (schemaElement.num_children! > 0) {\n      const res = decodeSchema(schemaElements, next + 1, schemaElement.num_children!);\n      next = res.next;\n      schema[schemaElement.name] = {\n        // type: undefined,\n        optional,\n        repeated,\n        fields: res.schema\n      };\n    } else {\n      const type = getThriftEnum(Type, schemaElement.type!);\n      let logicalType = type;\n\n      if (schemaElement.converted_type) {\n        logicalType = getThriftEnum(ConvertedType, schemaElement.converted_type);\n      }\n\n      switch (logicalType) {\n        case 'DECIMAL':\n          logicalType = `${logicalType}_${type}` as ParquetType;\n          break;\n        default:\n      }\n\n      schema[schemaElement.name] = {\n        type: logicalType as ParquetType,\n        typeLength: schemaElement.type_length,\n        presision: schemaElement.precision,\n        scale: schemaElement.scale,\n        optional,\n        repeated\n      };\n      next++;\n    }\n  }\n  return {schema, offset, next};\n}\n\n/**\n * Decode a consecutive array of data using one of the parquet encodings\n */\nfunction decodeValues(\n  type: PrimitiveType,\n  encoding: ParquetCodec,\n  cursor: CursorBuffer,\n  count: number,\n  opts: ParquetCodecOptions\n): any[] {\n  if (!(encoding in PARQUET_CODECS)) {\n    throw new Error(`invalid encoding: ${encoding}`);\n  }\n  return PARQUET_CODECS[encoding].decodeValues(type, cursor, count, opts);\n}\n\n/**\n * Do decoding of parquet dataPage from column chunk\n * @param cursor\n * @param header\n * @param options\n */\nasync function decodeDataPage(\n  cursor: CursorBuffer,\n  header: PageHeader,\n  context: ParquetReaderContext\n): Promise<ParquetPageData> {\n  const cursorEnd = cursor.offset + header.compressed_page_size;\n  const valueCount = header.data_page_header?.num_values;\n\n  /* uncompress page */\n  let dataCursor = cursor;\n\n  if (context.compression !== 'UNCOMPRESSED') {\n    const valuesBuf = await decompress(\n      context.compression,\n      cursor.buffer.slice(cursor.offset, cursorEnd),\n      header.uncompressed_page_size\n    );\n    dataCursor = {\n      buffer: valuesBuf,\n      offset: 0,\n      size: valuesBuf.length\n    };\n    cursor.offset = cursorEnd;\n  }\n\n  /* read repetition levels */\n  const rLevelEncoding = getThriftEnum(\n    Encoding,\n    header.data_page_header?.repetition_level_encoding!\n  ) as ParquetCodec;\n  // tslint:disable-next-line:prefer-array-literal\n  let rLevels = new Array(valueCount);\n\n  if (context.column.rLevelMax > 0) {\n    rLevels = decodeValues(PARQUET_RDLVL_TYPE, rLevelEncoding, dataCursor, valueCount!, {\n      bitWidth: getBitWidth(context.column.rLevelMax),\n      disableEnvelope: false\n      // column: opts.column\n    });\n  } else {\n    rLevels.fill(0);\n  }\n\n  /* read definition levels */\n  const dLevelEncoding = getThriftEnum(\n    Encoding,\n    header.data_page_header?.definition_level_encoding!\n  ) as ParquetCodec;\n  // tslint:disable-next-line:prefer-array-literal\n  let dLevels = new Array(valueCount);\n  if (context.column.dLevelMax > 0) {\n    dLevels = decodeValues(PARQUET_RDLVL_TYPE, dLevelEncoding, dataCursor, valueCount!, {\n      bitWidth: getBitWidth(context.column.dLevelMax),\n      disableEnvelope: false\n      // column: opts.column\n    });\n  } else {\n    dLevels.fill(0);\n  }\n  let valueCountNonNull = 0;\n  for (const dlvl of dLevels) {\n    if (dlvl === context.column.dLevelMax) {\n      valueCountNonNull++;\n    }\n  }\n\n  /* read values */\n  const valueEncoding = getThriftEnum(Encoding, header.data_page_header?.encoding!) as ParquetCodec;\n  const decodeOptions: ParquetCodecOptions = {\n    typeLength: context.column.typeLength,\n    bitWidth: context.column.typeLength\n  };\n\n  const values = decodeValues(\n    context.column.primitiveType!,\n    valueEncoding,\n    dataCursor,\n    valueCountNonNull,\n    decodeOptions\n  );\n\n  return {\n    dlevels: dLevels,\n    rlevels: rLevels,\n    values,\n    count: valueCount!,\n    pageHeader: header\n  };\n}\n\n/**\n * Do decoding of parquet dataPage in version 2 from column chunk\n * @param cursor\n * @param header\n * @param opts\n * @returns\n */\nasync function decodeDataPageV2(\n  cursor: CursorBuffer,\n  header: PageHeader,\n  context: ParquetReaderContext\n): Promise<ParquetPageData> {\n  const cursorEnd = cursor.offset + header.compressed_page_size;\n\n  const valueCount = header.data_page_header_v2?.num_values;\n  // @ts-ignore\n  const valueCountNonNull = valueCount - header.data_page_header_v2?.num_nulls;\n  const valueEncoding = getThriftEnum(\n    Encoding,\n    header.data_page_header_v2?.encoding!\n  ) as ParquetCodec;\n\n  /* read repetition levels */\n  // tslint:disable-next-line:prefer-array-literal\n  let rLevels = new Array(valueCount);\n  if (context.column.rLevelMax > 0) {\n    rLevels = decodeValues(PARQUET_RDLVL_TYPE, PARQUET_RDLVL_ENCODING, cursor, valueCount!, {\n      bitWidth: getBitWidth(context.column.rLevelMax),\n      disableEnvelope: true\n    });\n  } else {\n    rLevels.fill(0);\n  }\n\n  /* read definition levels */\n  // tslint:disable-next-line:prefer-array-literal\n  let dLevels = new Array(valueCount);\n  if (context.column.dLevelMax > 0) {\n    dLevels = decodeValues(PARQUET_RDLVL_TYPE, PARQUET_RDLVL_ENCODING, cursor, valueCount!, {\n      bitWidth: getBitWidth(context.column.dLevelMax),\n      disableEnvelope: true\n    });\n  } else {\n    dLevels.fill(0);\n  }\n\n  /* read values */\n  let valuesBufCursor = cursor;\n\n  if (header.data_page_header_v2?.is_compressed) {\n    const valuesBuf = await decompress(\n      context.compression,\n      cursor.buffer.slice(cursor.offset, cursorEnd),\n      header.uncompressed_page_size\n    );\n\n    valuesBufCursor = {\n      buffer: valuesBuf,\n      offset: 0,\n      size: valuesBuf.length\n    };\n\n    cursor.offset = cursorEnd;\n  }\n\n  const decodeOptions = {\n    typeLength: context.column.typeLength,\n    bitWidth: context.column.typeLength\n  };\n\n  const values = decodeValues(\n    context.column.primitiveType!,\n    valueEncoding,\n    valuesBufCursor,\n    valueCountNonNull,\n    decodeOptions\n  );\n\n  return {\n    dlevels: dLevels,\n    rlevels: rLevels,\n    values,\n    count: valueCount!,\n    pageHeader: header\n  };\n}\n\n/**\n * Do decoding of dictionary page which helps to iterate over all indexes and get dataPage values.\n * @param cursor\n * @param pageHeader\n * @param context\n */\nasync function decodeDictionaryPage(\n  cursor: CursorBuffer,\n  pageHeader: PageHeader,\n  context: ParquetReaderContext\n): Promise<(string | ArrayBuffer)[]> {\n  const cursorEnd = cursor.offset + pageHeader.compressed_page_size;\n\n  let dictCursor = {\n    offset: 0,\n    buffer: cursor.buffer.slice(cursor.offset, cursorEnd),\n    size: cursorEnd - cursor.offset\n  };\n\n  cursor.offset = cursorEnd;\n\n  if (context.compression !== 'UNCOMPRESSED') {\n    const valuesBuf = await decompress(\n      context.compression,\n      dictCursor.buffer.slice(dictCursor.offset, cursorEnd),\n      pageHeader.uncompressed_page_size\n    );\n\n    dictCursor = {\n      buffer: valuesBuf,\n      offset: 0,\n      size: valuesBuf.length\n    };\n\n    cursor.offset = cursorEnd;\n  }\n\n  const numValues = pageHeader?.dictionary_page_header?.num_values || 0;\n\n  const decodedDictionaryValues = decodeValues(\n    context.column.primitiveType!,\n    context.column.encoding!,\n    dictCursor,\n    numValues,\n    // TODO - this looks wrong?\n    context as ParquetCodecOptions\n  );\n\n  // Makes it look a little easier\n  let values: any[];\n  if (context?.preserveBinary) {\n    values = decodedDictionaryValues.map((d) => preserveBinary(d));\n  } else {\n    values = decodedDictionaryValues.map((d) => d.toString());\n  }\n  return values;\n}\n\nfunction preserveBinary(d: any): ArrayBuffer | ArrayBufferView | string {\n  if (ArrayBuffer.isView(d)) {\n    return d;\n  }\n  // Convert to ArrayBuffer\n  if (Buffer.isBuffer(d)) {\n    return d.buffer.slice(d.byteOffset, d.byteLength);\n  }\n  return d.toString();\n}\n", "// Forked from https://github.com/kbajalc/parquets under MIT license (Copyright (c) 2017 ironSource Ltd.)\nimport type {ReadableFile} from '@loaders.gl/loader-utils';\n\nimport {ParquetSchema} from '../schema/schema';\nimport {decodeSchema} from './decoders';\nimport {materializeRows} from '../schema/shred';\n\nimport {PARQUET_MAGIC, PARQUET_MAGIC_ENCRYPTED} from '../../constants';\nimport {ColumnChunk, CompressionCodec, FileMetaData, RowGroup, Type} from '../parquet-thrift';\nimport {\n  ParquetRowGroup,\n  ParquetCompression,\n  ParquetColumnChunk,\n  PrimitiveType,\n  ParquetReaderContext\n} from '../schema/declare';\nimport {decodeFileMetadata, getThriftEnum, fieldIndexOf} from '../utils/read-utils';\nimport {decodeDataPages, decodePage} from './decoders';\n\nexport type ParquetReaderProps = {\n  defaultDictionarySize?: number;\n  preserveBinary?: boolean;\n};\n\n/** Properties for initializing a ParquetRowGroupReader */\nexport type ParquetIterationProps = {\n  /** Filter allowing some columns to be dropped */\n  columnList?: string[] | string[][];\n};\n\n/**\n * The parquet envelope reader allows direct, unbuffered access to the individual\n * sections of the parquet file, namely the header, footer and the row groups.\n * This class is intended for advanced/internal users; if you just want to retrieve\n * rows from a parquet file use the ParquetReader instead\n */\nexport class ParquetReader {\n  static defaultProps: Required<ParquetReaderProps> = {\n    defaultDictionarySize: 1e6,\n    preserveBinary: false\n  };\n\n  props: Required<ParquetReaderProps>;\n  file: ReadableFile;\n  metadata: Promise<FileMetaData> | null = null;\n\n  constructor(file: ReadableFile, props?: ParquetReaderProps) {\n    this.file = file;\n    this.props = {...ParquetReader.defaultProps, ...props};\n  }\n\n  close(): void {\n    // eslint-disable-next-line @typescript-eslint/no-floating-promises\n    this.file.close();\n  }\n\n  // HIGH LEVEL METHODS\n\n  /** Yield one row at a time */\n  async *rowIterator(props?: ParquetIterationProps) {\n    for await (const rows of this.rowBatchIterator(props)) {\n      // yield *rows\n      for (const row of rows) {\n        yield row;\n      }\n    }\n  }\n\n  /** Yield one batch of rows at a time */\n  async *rowBatchIterator(props?: ParquetIterationProps) {\n    const schema = await this.getSchema();\n    for await (const rowGroup of this.rowGroupIterator(props)) {\n      yield materializeRows(schema, rowGroup);\n    }\n  }\n\n  /** Iterate over the raw row groups */\n  async *rowGroupIterator(props?: ParquetIterationProps) {\n    // Ensure strings are nested in arrays\n    const columnList: string[][] = (props?.columnList || []).map((x) =>\n      Array.isArray(x) ? x : [x]\n    );\n\n    const metadata = await this.getFileMetadata();\n    const schema = await this.getSchema();\n\n    const rowGroupCount = metadata?.row_groups.length || 0;\n\n    for (let rowGroupIndex = 0; rowGroupIndex < rowGroupCount; rowGroupIndex++) {\n      const rowGroup = await this.readRowGroup(\n        schema,\n        metadata.row_groups[rowGroupIndex],\n        columnList\n      );\n      yield rowGroup;\n    }\n  }\n\n  async getRowCount(): Promise<number> {\n    const metadata = await this.getFileMetadata();\n    return Number(metadata.num_rows);\n  }\n\n  async getSchema(): Promise<ParquetSchema> {\n    const metadata = await this.getFileMetadata();\n    const root = metadata.schema[0];\n    const {schema: schemaDefinition} = decodeSchema(metadata.schema, 1, root.num_children!);\n    const schema = new ParquetSchema(schemaDefinition);\n    return schema;\n  }\n\n  /**\n   * Returns the user (key/value) metadata for this file\n   * In parquet this is not stored on the schema like it is in arrow\n   */\n  async getSchemaMetadata(): Promise<Record<string, string>> {\n    const metadata = await this.getFileMetadata();\n    const md: Record<string, string> = {};\n    for (const kv of metadata.key_value_metadata!) {\n      md[kv.key] = kv.value!;\n    }\n    return md;\n  }\n\n  async getFileMetadata(): Promise<FileMetaData> {\n    if (!this.metadata) {\n      await this.readHeader();\n      this.metadata = this.readFooter();\n    }\n    return this.metadata;\n  }\n\n  // LOW LEVEL METHODS\n\n  /** Metadata is stored in the footer */\n  async readHeader(): Promise<void> {\n    const buffer = await this.file.read(0, PARQUET_MAGIC.length);\n    const magic = buffer.toString();\n    switch (magic) {\n      case PARQUET_MAGIC:\n        break;\n      case PARQUET_MAGIC_ENCRYPTED:\n        throw new Error('Encrypted parquet file not supported');\n      default:\n        throw new Error(`Invalid parquet file (magic=${magic})`);\n    }\n  }\n\n  /** Metadata is stored in the footer */\n  async readFooter(): Promise<FileMetaData> {\n    const trailerLen = PARQUET_MAGIC.length + 4;\n    const trailerBuf = await this.file.read(this.file.size - trailerLen, trailerLen);\n\n    const magic = trailerBuf.slice(4).toString();\n    if (magic !== PARQUET_MAGIC) {\n      throw new Error(`Not a valid parquet file (magic=\"${magic})`);\n    }\n\n    const metadataSize = trailerBuf.readUInt32LE(0);\n    const metadataOffset = this.file.size - metadataSize - trailerLen;\n    if (metadataOffset < PARQUET_MAGIC.length) {\n      throw new Error(`Invalid metadata size ${metadataOffset}`);\n    }\n\n    const metadataBuf = await this.file.read(metadataOffset, metadataSize);\n    // let metadata = new parquet_thrift.FileMetaData();\n    // parquet_util.decodeThrift(metadata, metadataBuf);\n\n    const {metadata} = decodeFileMetadata(metadataBuf);\n    return metadata;\n  }\n\n  /** Data is stored in row groups (similar to Apache Arrow record batches) */\n  async readRowGroup(\n    schema: ParquetSchema,\n    rowGroup: RowGroup,\n    columnList: string[][]\n  ): Promise<ParquetRowGroup> {\n    const buffer: ParquetRowGroup = {\n      rowCount: Number(rowGroup.num_rows),\n      columnData: {}\n    };\n    for (const colChunk of rowGroup.columns) {\n      const colMetadata = colChunk.meta_data;\n      const colKey = colMetadata?.path_in_schema;\n      if (columnList.length > 0 && fieldIndexOf(columnList, colKey!) < 0) {\n        continue; // eslint-disable-line no-continue\n      }\n      buffer.columnData[colKey!.join()] = await this.readColumnChunk(schema, colChunk);\n    }\n    return buffer;\n  }\n\n  /**\n   * Each row group contains column chunks for all the columns.\n   */\n  async readColumnChunk(schema: ParquetSchema, colChunk: ColumnChunk): Promise<ParquetColumnChunk> {\n    if (colChunk.file_path !== undefined && colChunk.file_path !== null) {\n      throw new Error('external references are not supported');\n    }\n\n    const field = schema.findField(colChunk.meta_data?.path_in_schema!);\n    const type: PrimitiveType = getThriftEnum(Type, colChunk.meta_data?.type!) as any;\n\n    if (type !== field.primitiveType) {\n      throw new Error(`chunk type not matching schema: ${type}`);\n    }\n\n    const compression: ParquetCompression = getThriftEnum(\n      CompressionCodec,\n      colChunk.meta_data?.codec!\n    ) as any;\n\n    const pagesOffset = Number(colChunk.meta_data?.data_page_offset!);\n    let pagesSize = Number(colChunk.meta_data?.total_compressed_size!);\n\n    if (!colChunk.file_path) {\n      pagesSize = Math.min(\n        this.file.size - pagesOffset,\n        Number(colChunk.meta_data?.total_compressed_size)\n      );\n    }\n\n    const context: ParquetReaderContext = {\n      type,\n      rLevelMax: field.rLevelMax,\n      dLevelMax: field.dLevelMax,\n      compression,\n      column: field,\n      numValues: colChunk.meta_data?.num_values,\n      dictionary: [],\n      // Options - TBD is this the right place for these?\n      preserveBinary: this.props.preserveBinary\n    };\n\n    let dictionary;\n\n    const dictionaryPageOffset = colChunk?.meta_data?.dictionary_page_offset;\n\n    if (dictionaryPageOffset) {\n      const dictionaryOffset = Number(dictionaryPageOffset);\n      // Getting dictionary from column chunk to iterate all over indexes to get dataPage values.\n      dictionary = await this.getDictionary(dictionaryOffset, context, pagesOffset);\n    }\n\n    dictionary = context.dictionary?.length ? context.dictionary : dictionary;\n    const pagesBuf = await this.file.read(pagesOffset, pagesSize);\n    return await decodeDataPages(pagesBuf, {...context, dictionary});\n  }\n\n  /**\n   * Getting dictionary for allows to flatten values by indices.\n   * @param dictionaryPageOffset\n   * @param context\n   * @param pagesOffset\n   * @returns\n   */\n  async getDictionary(\n    dictionaryPageOffset: number,\n    context: ParquetReaderContext,\n    pagesOffset: number\n  ): Promise<string[]> {\n    if (dictionaryPageOffset === 0) {\n      // dictionarySize = Math.min(this.fileSize - pagesOffset, this.defaultDictionarySize);\n      // pagesBuf = await this.read(pagesOffset, dictionarySize);\n\n      // In this case we are working with parquet-mr files format. Problem is described below:\n      // https://stackoverflow.com/questions/55225108/why-is-dictionary-page-offset-0-for-plain-dictionary-encoding\n      // We need to get dictionary page from column chunk if it exists.\n      // Now if we use code commented above we don't get DICTIONARY_PAGE we get DATA_PAGE instead.\n      return [];\n    }\n\n    const dictionarySize = Math.min(\n      this.file.size - dictionaryPageOffset,\n      this.props.defaultDictionarySize\n    );\n    const pagesBuf = await this.file.read(dictionaryPageOffset, dictionarySize);\n\n    const cursor = {buffer: pagesBuf, offset: 0, size: pagesBuf.length};\n    const decodedPage = await decodePage(cursor, context);\n\n    return decodedPage.dictionary!;\n  }\n}\n", "// loaders.gl, MIT license\n\nimport {Schema, Field, DataType} from '@loaders.gl/schema';\n\nimport type {ParquetSchema} from '../../parquetjs/schema/schema';\nimport type {FieldDefinition, ParquetField, ParquetType} from '../../parquetjs/schema/declare';\nimport {FileMetaData} from '../../parquetjs/parquet-thrift';\n\nexport const PARQUET_TYPE_MAPPING: {[type in ParquetType]: DataType} = {\n  BOOLEAN: 'bool',\n  INT32: 'int32',\n  INT64: 'float64',\n  INT96: 'float64',\n  FLOAT: 'float32',\n  DOUBLE: 'float64',\n  BYTE_ARRAY: 'binary',\n  FIXED_LEN_BYTE_ARRAY: 'binary',\n  UTF8: 'utf8',\n  DATE: 'int32',\n  TIME_MILLIS: 'int64',\n  TIME_MICROS: 'int64',\n  TIMESTAMP_MILLIS: 'int64',\n  TIMESTAMP_MICROS: 'int64',\n  UINT_8: 'int32',\n  UINT_16: 'uint16',\n  UINT_32: 'uint32',\n  UINT_64: 'uint64',\n  INT_8: 'int8',\n  INT_16: 'int16',\n  INT_32: 'int32',\n  INT_64: 'int64',\n  JSON: 'binary',\n  BSON: 'binary',\n  // TODO check interal type\n  INTERVAL: 'binary',\n  DECIMAL_INT32: 'float32',\n  DECIMAL_INT64: 'float64',\n  DECIMAL_BYTE_ARRAY: 'float64',\n  DECIMAL_FIXED_LEN_BYTE_ARRAY: 'float64'\n};\n\nexport function convertParquetSchema(\n  parquetSchema: ParquetSchema,\n  parquetMetadata: FileMetaData | null\n): Schema {\n  const fields = getFields(parquetSchema.schema);\n  const metadata = parquetMetadata && getSchemaMetadata(parquetMetadata);\n\n  const schema: Schema = {\n    fields,\n    metadata: metadata || {}\n  };\n\n  return schema;\n}\n\nfunction getFields(schema: FieldDefinition): Field[] {\n  const fields: Field[] = [];\n\n  for (const name in schema) {\n    const field = schema[name];\n\n    if (field.fields) {\n      const children = getFields(field.fields);\n      fields.push({name, type: {type: 'struct', children}, nullable: field.optional});\n    } else {\n      const type = PARQUET_TYPE_MAPPING[field.type];\n      const metadata = getFieldMetadata(field);\n      const arrowField = {name, type, nullable: field.optional, metadata};\n      fields.push(arrowField);\n    }\n  }\n\n  return fields;\n}\n\nfunction getFieldMetadata(field: ParquetField): Record<string, string> | undefined {\n  let metadata: Record<string, string> | undefined;\n\n  for (const key in field) {\n    if (key !== 'name') {\n      let value = field[key] || '';\n      value = typeof field[key] !== 'string' ? JSON.stringify(field[key]) : field[key];\n      metadata = metadata || {};\n      metadata[key] = value;\n    }\n  }\n\n  return metadata;\n}\n\nfunction getSchemaMetadata(parquetMetadata: FileMetaData): Record<string, string> | undefined {\n  let metadata: Record<string, string> | undefined;\n\n  const keyValueList = parquetMetadata.key_value_metadata || [];\n  for (const {key, value} of keyValueList) {\n    if (typeof value === 'string') {\n      metadata = metadata || {};\n      metadata[key] = value;\n    }\n  }\n\n  return metadata;\n}\n", "// loaders.gl, MIT license\nimport {Schema, Field} from '@loaders.gl/schema';\n\n/* eslint-disable camelcase */\n\ntype GeometryType =\n  | 'Point'\n  | 'LineString'\n  | 'Polygon'\n  | 'MultiPoint'\n  | 'MultiLineString'\n  | 'MultiPolygon'\n  | 'GeometryCollection'\n  | 'Point Z'\n  | 'LineString Z'\n  | 'Polygon Z'\n  | 'MultiPoint Z'\n  | 'MultiLineString Z'\n  | 'MultiPolygon Z'\n  | 'GeometryCollection Z';\n\n/**\n * A geoarrow / geoparquet geo metadata object\n * (stored in stringified form in the top level metadata 'geo' key)\n * @see https://github.com/opengeospatial/geoparquet/blob/main/format-specs/geoparquet.md\n * @see https://github.com/geoarrow/geoarrow/blob/main/metadata.md\n * */\nexport type GeoMetadata = {\n  version?: string;\n  primary_column?: string;\n  columns: Record<string, GeoColumnMetadata>;\n  [key: string]: unknown;\n};\n\n/** A geoarrow / geoparquet geo metadata for one geometry column  */\nexport type GeoColumnMetadata = {\n  encoding: 'wkb' | 'wkt';\n  geometry_types: GeometryType[];\n  crs?: object | null;\n  orientation?: 'counterclockwise';\n  bbox?: [number, number, number, number] | [number, number, number, number, number, number];\n  edges?: 'planar' | 'spherical';\n  epoch?: number;\n  [key: string]: unknown;\n};\n\n/** Parse a key with stringified arrow metadata */\nexport function parseJSONStringMetadata(\n  schema: Schema,\n  metadataKey: string\n): Record<string, unknown> | null {\n  const stringifiedMetadata = schema.metadata[metadataKey];\n  if (!stringifiedMetadata) {\n    return null;\n  }\n\n  try {\n    const metadata = JSON.parse(stringifiedMetadata);\n    if (!metadata || typeof metadata !== 'object') {\n      return null;\n    }\n    return metadata;\n  } catch {\n    return null;\n  }\n}\n\nexport function unpackJSONStringMetadata(schema: Schema, metadataKey: string): void {\n  const json = parseJSONStringMetadata(schema, metadataKey);\n  for (const [key, value] of Object.entries(json || {})) {\n    schema.metadata[`${metadataKey}.${key}`] =\n      typeof value === 'string' ? value : JSON.stringify(value);\n  }\n}\n\n// GEO METADATA\n\n/**\n * Reads the GeoMetadata object from the metadata\n * @note geoarrow / parquet schema is stringified into a single key-value pair in the parquet metadata */\nexport function getGeoMetadata(schema: Schema): GeoMetadata | null {\n  const geoMetadata = parseJSONStringMetadata(schema, 'geo') as GeoMetadata;\n  return geoMetadata;\n}\n\n/**\n * Stores a geoarrow / geoparquet geo metadata object in the schema\n * @note geoarrow / geoparquet geo metadata is a single stringified JSON field\n */\nexport function setGeoMetadata(schema: Schema, geoMetadata: GeoMetadata): void {\n  const stringifiedGeoMetadata = JSON.stringify(geoMetadata);\n  schema.metadata.geo = stringifiedGeoMetadata;\n}\n\n/**\n * Unpacks geo metadata into separate metadata fields (parses the long JSON string)\n * @note geoarrow / parquet schema is stringified into a single key-value pair in the parquet metadata\n */\nexport function unpackGeoMetadata(schema: Schema): void {\n  const geoMetadata = getGeoMetadata(schema);\n  if (!geoMetadata) {\n    return;\n  }\n\n  // Store Parquet Schema Level Metadata\n\n  const {version, primary_column, columns} = geoMetadata;\n  if (version) {\n    schema.metadata['geo.version'] = version;\n  }\n\n  if (primary_column) {\n    schema.metadata['geo.primary_column'] = primary_column;\n  }\n\n  // store column names as comma separated list\n  schema.metadata['geo.columns'] = Object.keys(columns || {}).join('');\n\n  for (const [columnName, columnMetadata] of Object.entries(columns || {})) {\n    const field = schema.fields.find((field) => field.name === columnName);\n    if (field) {\n      if (field.name === primary_column) {\n        setFieldMetadata(field, 'geo.primary_field', 'true');\n      }\n      unpackGeoFieldMetadata(field, columnMetadata);\n    }\n  }\n}\n\n// eslint-disable-next-line complexity\nfunction unpackGeoFieldMetadata(field: Field, columnMetadata): void {\n  for (const [key, value] of Object.entries(columnMetadata || {})) {\n    switch (key) {\n      case 'geometry_type':\n        setFieldMetadata(field, `geo.${key}`, (value as string[]).join(','));\n        break;\n      case 'bbox':\n        setFieldMetadata(field, `geo.crs.${key}`, JSON.stringify(value));\n        break;\n      case 'crs':\n        for (const [crsKey, crsValue] of Object.entries(value || {})) {\n          switch (crsKey) {\n            case 'id':\n              const crsId =\n                typeof crsValue === 'object'\n                  ? `${crsValue?.authority}:${crsValue?.code}`\n                  : JSON.stringify(crsValue);\n              setFieldMetadata(field, `geo.crs.${crsKey}`, crsId);\n              break;\n            default:\n              setFieldMetadata(\n                field,\n                `geo.crs.${crsKey}`,\n                typeof crsValue === 'string' ? crsValue : JSON.stringify(crsValue)\n              );\n              break;\n          }\n        }\n        break;\n      case 'edges':\n      default:\n        setFieldMetadata(\n          field,\n          `geo.${key}`,\n          typeof value === 'string' ? value : JSON.stringify(value)\n        );\n    }\n  }\n}\n\nfunction setFieldMetadata(field: Field, key: string, value: string): void {\n  field.metadata = field.metadata || {};\n  field.metadata[key] = value;\n}\n", "// loaders.gl\nimport {Schema} from '@loaders.gl/schema';\nimport {ParquetReader} from '../../parquetjs/parser/parquet-reader';\nimport {convertParquetSchema} from '../arrow/convert-schema-from-parquet';\nimport {unpackGeoMetadata, unpackJSONStringMetadata} from '../geo/decode-geo-metadata';\n\nexport async function getSchemaFromParquetReader(reader: ParquetReader): Promise<Schema> {\n  const parquetSchema = await reader.getSchema();\n  const parquetMetadata = await reader.getFileMetadata();\n  const schema = convertParquetSchema(parquetSchema, parquetMetadata);\n  unpackGeoMetadata(schema);\n  unpackJSONStringMetadata(schema, 'pandas');\n  return schema;\n}\n", "// loaders.gl, MIT license\n\n/* eslint-disable no-else-return */\n\nimport {Table, ArrayRowTable, ObjectRowTable} from '../../../types/category-table';\n\n/**\n * Returns the length of the table (i.e. the number of rows)\n */\nexport function getTableLength(table: Table): number {\n  switch (table.shape) {\n    case 'array-row-table':\n    case 'object-row-table':\n      return table.data.length;\n\n    case 'geojson-table':\n      return table.features.length;\n\n    case 'arrow-table':\n      const arrowTable = table.data as any;\n      return arrowTable.numRows;\n\n    case 'columnar-table':\n      for (const column of Object.values(table.data)) {\n        return column.length || 0;\n      }\n      return 0;\n    default:\n      throw new Error('table');\n  }\n}\n\n/**\n * Returns the number of columns in the table\n * @throws Fails to deduce number of columns if the table has no schema and is empty\n */\nexport function getTableNumCols(table: Table): number {\n  if (table.schema) {\n    return table.schema.fields.length;\n  }\n  if (getTableLength(table) === 0) {\n    throw new Error('empty table');\n  }\n  switch (table.shape) {\n    case 'array-row-table':\n      return table.data[0].length;\n    case 'object-row-table':\n      return Object.keys(table.data[0]).length;\n    case 'geojson-table':\n      return Object.keys(table.features[0]).length;\n    case 'columnar-table':\n      return Object.keys(table.data).length;\n    case 'arrow-table':\n      const arrowTable = table.data as any;\n      return arrowTable.numCols;\n    default:\n      throw new Error('table');\n  }\n}\n\n/** Get a table cell value at row index and column name */\nexport function getTableCell(table: Table, rowIndex: number, columnName: string): unknown {\n  switch (table.shape) {\n    case 'array-row-table':\n      const columnIndex = getTableColumnIndex(table, columnName);\n      return table.data[rowIndex][columnIndex];\n\n    case 'object-row-table':\n      return table.data[rowIndex][columnName];\n\n    case 'geojson-table':\n      return table.features[rowIndex][columnName];\n\n    case 'columnar-table':\n      const column = table.data[columnName];\n      return column[rowIndex];\n\n    case 'arrow-table':\n      const arrowTable = table.data as any;\n      const arrowColumnIndex = arrowTable.schema.fields.findIndex(\n        (field) => field.name === columnName\n      );\n      return arrowTable.getChildAt(arrowColumnIndex)?.get(rowIndex);\n\n    default:\n      throw new Error('todo');\n  }\n}\n\n/** Get a table cell value at row index and column name */\nexport function getTableCellAt(table: Table, rowIndex: number, columnIndex: number): unknown {\n  switch (table.shape) {\n    case 'array-row-table':\n      return table.data[rowIndex][columnIndex];\n\n    case 'object-row-table':\n      const columnName1 = getTableColumnName(table, columnIndex);\n      return table.data[rowIndex][columnName1];\n\n    case 'geojson-table':\n      const columnName2 = getTableColumnName(table, columnIndex);\n      return table.features[rowIndex][columnName2];\n\n    case 'columnar-table':\n      const columnName3 = getTableColumnName(table, columnIndex);\n      const column = table.data[columnName3];\n      return column[rowIndex];\n\n    case 'arrow-table':\n      const arrowTable = table.data as any;\n      return arrowTable.getChildAt(columnIndex)?.get(rowIndex);\n\n    default:\n      throw new Error('todo');\n  }\n}\n\n/** Deduce the table row shape */\nexport function getTableRowShape(table: Table): 'array-row-table' | 'object-row-table' {\n  switch (table.shape) {\n    case 'array-row-table':\n    case 'object-row-table':\n      return table.shape;\n\n    case 'geojson-table':\n      // TODO - this is not correct, geojson-table is not a row table\n      return 'object-row-table';\n\n    case 'columnar-table':\n    default:\n      throw new Error('Not a row table');\n  }\n}\n\n/** Get the index of a named table column. Requires the table to have a schema */\nexport function getTableColumnIndex(table: Table, columnName: string): number {\n  const columnIndex = table.schema?.fields.findIndex((field) => field.name === columnName);\n  if (columnIndex === undefined) {\n    throw new Error(columnName);\n  }\n  return columnIndex;\n}\n\n/** Get the name of a table column by index. Requires the table to have a schema */\nexport function getTableColumnName(table: Table, columnIndex: number): string {\n  const columnName = table.schema?.fields[columnIndex]?.name;\n  if (!columnName) {\n    throw new Error(`${columnIndex}`);\n  }\n  return columnName;\n}\n\n/**\n * Returns one row of the table in object format.\n * @param target Optional parameter will be used if needed to store the row. Can be reused between calls to improve performance\n * @returns an array representing the row. May be the original array in the row, a new object, or the target parameter\n */\n// eslint-disable-next-line complexity\nexport function getTableRowAsObject(\n  table: Table,\n  rowIndex: number,\n  target?: {[columnName: string]: unknown},\n  copy?: 'copy'\n): {[columnName: string]: unknown} {\n  switch (table.shape) {\n    case 'object-row-table':\n      return copy ? Object.fromEntries(Object.entries(table.data[rowIndex])) : table.data[rowIndex];\n\n    case 'array-row-table':\n      if (table.schema) {\n        const objectRow: {[columnName: string]: unknown} = target || {};\n        for (let i = 0; i < table.schema.fields.length; i++) {\n          objectRow[table.schema.fields[i].name] = table.data[rowIndex][i];\n        }\n        return objectRow;\n      }\n      throw new Error('no schema');\n\n    case 'geojson-table':\n      if (table.schema) {\n        const objectRow: {[columnName: string]: unknown} = target || {};\n        // TODO - should lift properties to top level\n        for (let i = 0; i < table.schema.fields.length; i++) {\n          objectRow[table.schema.fields[i].name] = table.features[rowIndex][i];\n        }\n        return objectRow;\n      }\n      throw new Error('no schema');\n\n    case 'columnar-table':\n      if (table.schema) {\n        const objectRow: {[columnName: string]: unknown} = target || {};\n        for (let i = 0; i < table.schema.fields.length; i++) {\n          objectRow[table.schema.fields[i].name] =\n            table.data[table.schema.fields[i].name][rowIndex];\n        }\n        return objectRow;\n      } else {\n        // eslint-disable-line no-else-return\n        const objectRow: {[columnName: string]: unknown} = target || {};\n        for (const [name, column] of Object.entries(table.data)) {\n          objectRow[name] = column[rowIndex];\n        }\n        return objectRow;\n      }\n\n    case 'arrow-table':\n      const arrowTable = table.data as any;\n      const objectRow: {[columnName: string]: unknown} = target || {};\n      const row = arrowTable.get(rowIndex);\n      const schema = arrowTable.schema;\n      for (let i = 0; i < schema.fields.length; i++) {\n        objectRow[schema.fields[i].name] = row?.[schema.fields[i].name];\n      }\n      return objectRow;\n\n    default:\n      throw new Error('shape');\n  }\n}\n\n/**\n * Returns one row of the table in array format.\n * @param target Optional parameter will be used if needed to store the row. Can be reused between calls to improve performance.\n * @returns an array representing the row. May be the original array in the row, a new object, or the target parameter\n */\n// eslint-disable-next-line complexity\nexport function getTableRowAsArray(\n  table: Table,\n  rowIndex: number,\n  target?: unknown[],\n  copy?: 'copy'\n): unknown[] {\n  switch (table.shape) {\n    case 'array-row-table':\n      return copy ? Array.from(table.data[rowIndex]) : table.data[rowIndex];\n\n    case 'object-row-table':\n      if (table.schema) {\n        const arrayRow: unknown[] = target || [];\n        for (let i = 0; i < table.schema.fields.length; i++) {\n          arrayRow[i] = table.data[rowIndex][table.schema.fields[i].name];\n        }\n        return arrayRow;\n      }\n      // Warning: just slap on the values, this risks mismatches between rows\n      return Object.values(table.data[rowIndex]);\n\n    case 'geojson-table':\n      if (table.schema) {\n        const arrayRow: unknown[] = target || [];\n        // TODO - should lift properties to top level\n        for (let i = 0; i < table.schema.fields.length; i++) {\n          arrayRow[i] = table.features[rowIndex][table.schema.fields[i].name];\n        }\n        return arrayRow;\n      }\n      // Warning: just slap on the values, this risks mismatches between rows\n      return Object.values(table.features[rowIndex]);\n\n    case 'columnar-table':\n      if (table.schema) {\n        const arrayRow: unknown[] = target || [];\n        for (let i = 0; i < table.schema.fields.length; i++) {\n          arrayRow[i] = table.data[table.schema.fields[i].name][rowIndex];\n        }\n        return arrayRow;\n      } else {\n        // eslint-disable-line no-else-return\n        const arrayRow: unknown[] = target || [];\n        let i = 0;\n        for (const column of Object.values(table.data)) {\n          arrayRow[i] = column[rowIndex];\n          i++;\n        }\n        return arrayRow;\n      }\n\n    case 'arrow-table':\n      const arrowTable = table.data as any;\n      const arrayRow: unknown[] = target || [];\n      const row = arrowTable.get(rowIndex);\n      const schema = arrowTable.schema;\n      for (let i = 0; i < schema.fields.length; i++) {\n        arrayRow[i] = row?.[schema.fields[i].name];\n      }\n      return arrayRow;\n\n    default:\n      throw new Error('shape');\n  }\n}\n\n/** Convert any table into array row format */\nexport function makeArrayRowTable(table: Table): ArrayRowTable {\n  if (table.shape === 'array-row-table') {\n    return table;\n  }\n  const length = getTableLength(table);\n  const data = new Array<unknown[]>(length);\n  for (let rowIndex = 0; rowIndex < length; rowIndex++) {\n    data[rowIndex] = getTableRowAsArray(table, rowIndex);\n  }\n  return {\n    shape: 'array-row-table',\n    schema: table.schema,\n    data\n  };\n}\n\n/** Convert any table into object row format */\nexport function makeObjectRowTable(table: Table): ObjectRowTable {\n  if (table.shape === 'object-row-table') {\n    return table;\n  }\n  const length = getTableLength(table);\n  const data = new Array<{[key: string]: unknown}>(length);\n  for (let rowIndex = 0; rowIndex < length; rowIndex++) {\n    data[rowIndex] = getTableRowAsObject(table, rowIndex);\n  }\n  return {\n    shape: 'object-row-table',\n    schema: table.schema,\n    data\n  };\n}\n\n/** Convert any table into object row format */\nexport function makeColumnarTable(table: Table): ObjectRowTable {\n  if (table.shape === 'object-row-table') {\n    return table;\n  }\n  const length = getTableLength(table);\n  const data = new Array<{[key: string]: unknown}>(length);\n  for (let rowIndex = 0; rowIndex < length; rowIndex++) {\n    data[rowIndex] = getTableRowAsObject(table, rowIndex);\n  }\n  return {\n    shape: 'object-row-table',\n    schema: table.schema,\n    data\n  };\n}\n\n// Row Iterators\n\n/**\n * Iterate over table rows\n * @param table\n * @param shape\n */\nexport function* makeRowIterator(\n  table: Table,\n  shape: 'object-row-table' | 'array-row-table'\n): Iterable<unknown[] | {[key: string]: unknown}> {\n  switch (shape) {\n    case 'array-row-table':\n      yield* makeArrayRowIterator(table);\n      break;\n    case 'object-row-table':\n      yield* makeObjectRowIterator(table);\n      break;\n\n    default:\n      throw new Error(`Unknown row type ${shape}`);\n  }\n}\n\n/**\n * Streaming processing: Iterate over table, yielding array rows\n * @param table\n * @param shape\n */\nexport function* makeArrayRowIterator(table: Table, target: unknown[] = []): Iterable<unknown[]> {\n  const length = getTableLength(table);\n  for (let rowIndex = 0; rowIndex < length; rowIndex++) {\n    yield getTableRowAsArray(table, rowIndex, target);\n  }\n}\n\n/**\n * Streaming processing: Iterate over table, yielding object rows\n * @param table\n * @param shape\n */\nexport function* makeObjectRowIterator(\n  table: Table,\n  target: {[key: string]: unknown} = {}\n): Iterable<{[key: string]: unknown}> {\n  const length = getTableLength(table);\n  for (let rowIndex = 0; rowIndex < length; rowIndex++) {\n    yield getTableRowAsObject(table, rowIndex, target);\n  }\n}\n", "// Version constant cannot be imported, it needs to correspond to the build version of **this** module.\n// __VERSION__ is injected by babel-plugin-version-inline\n// @ts-ignore TS2304: Cannot find name '__VERSION__'.\nexport const VERSION = typeof __VERSION__ !== 'undefined' ? __VERSION__ : 'latest';\n", "// loaders.gl, MIT license\n// Fork of https://github.com/mapbox/wellknown under ISC license (MIT/BSD-2-clause equivalent)\n\nimport {Geometry} from '@loaders.gl/schema';\n\n/* eslint-disable */\n// @ts-nocheck\n\nconst numberRegexp = /[-+]?([0-9]*\\.[0-9]+|[0-9]+)([eE][-+]?[0-9]+)?/;\n// Matches sequences like '100 100' or '100 100 100'.\nconst tuples = new RegExp('^' + numberRegexp.source + '(\\\\s' + numberRegexp.source + '){1,}');\n\nexport const WKT_MAGIC_STRINGS = [\n  'POINT(',\n  'LINESTRING(',\n  'POLYGON(',\n  'MULTIPOINT(',\n  'MULTILINESTRING(',\n  'MULTIPOLYGON(',\n  'GEOMETRYCOLLECTION('\n  // We only support this \"geojson\" subset of the OGC simple features standard\n];\n\nexport type ParseWKTOptions = {\n  wkt?: {\n    /** Whether to add any CRS, if found, as undocumented CRS property on the return geometry */\n    crs?: boolean;\n  };\n};\n\n/** \n * Check if a string is WKT.\n * @param input A potential WKT geometry string\n * @return `true` if input appears to be a WKT geometry string, `false` otherwise\n\n * @note We only support the \"geojson\" subset of the OGC simple features standard\n * @todo Does not handle leading spaces which appear to be permitted per the spec:\n * \"A WKT string contains no white space outside of double quotes. \n * However padding with white space to improve human readability is permitted; \n * the examples of WKT that are included in this document have \n * spaces and line feeds inserted to improve clarity. Any padding is stripped out or ignored by parsers.\"\n */\nexport function isWKT(input: string): boolean {\n  return WKT_MAGIC_STRINGS.some((magicString) => input.startsWith(magicString));\n}\n\n/**\n * Parse WKT and return GeoJSON.\n * @param input A WKT geometry string\n * @return A GeoJSON geometry object\n *\n * @note We only support the \"geojson\" subset of the OGC simple features standard\n **/\nexport function parseWKT(input: string, options?: ParseWKTOptions): Geometry {\n  // TODO handle options.wkt.shape\n  return parseWKTToGeometry(input, options)!;\n}\n\n/** State of parser, passed around between parser functions */\ntype ParseWKTState = {\n  parts: string[];\n  _: string | undefined;\n  i: number;\n};\n\n/** Parse into GeoJSON geometry */\nfunction parseWKTToGeometry(input: string, options?: ParseWKTOptions): Geometry | null {\n  const parts = input.split(';');\n  let _ = parts.pop();\n  const srid = (parts.shift() || '').split('=').pop();\n\n  const state: ParseWKTState = {parts, _, i: 0};\n\n  const geometry = parseGeometry(state);\n\n  return options?.wkt?.crs ? addCRS(geometry, srid) : geometry;\n}\n\nfunction parseGeometry(state: ParseWKTState): Geometry | null {\n  return (\n    parsePoint(state) ||\n    parseLineString(state) ||\n    parsePolygon(state) ||\n    parseMultiPoint(state) ||\n    parseMultiLineString(state) ||\n    parseMultiPolygon(state) ||\n    parseGeometryCollection(state)\n  );\n}\n\n/** Adds a coordinate reference system as an undocumented  */\nfunction addCRS(obj: Geometry | null, srid?: string): Geometry | null {\n  if (obj && srid?.match(/\\d+/)) {\n    const crs = {\n      type: 'name',\n      properties: {\n        name: 'urn:ogc:def:crs:EPSG::' + srid\n      }\n    };\n    // @ts-expect-error we assign an undocumented property on the geometry\n    obj.crs = crs;\n  }\n\n  return obj;\n}\n\n// GEOMETRIES\n\nfunction parsePoint(state: ParseWKTState): Geometry | null {\n  if (!$(/^(POINT(\\sz)?)/i, state)) {\n    return null;\n  }\n  white(state);\n  if (!$(/^(\\()/, state)) {\n    return null;\n  }\n  const c = coords(state);\n  if (!c) {\n    return null;\n  }\n  white(state);\n  if (!$(/^(\\))/, state)) {\n    return null;\n  }\n  return {\n    type: 'Point',\n    coordinates: c[0]\n  };\n}\n\nfunction parseMultiPoint(state: ParseWKTState): Geometry | null {\n  if (!$(/^(MULTIPOINT)/i, state)) {\n    return null;\n  }\n  white(state);\n  const newCoordsFormat = state._?.substring(state._?.indexOf('(') + 1, state._.length - 1)\n    .replace(/\\(/g, '')\n    .replace(/\\)/g, '');\n  state._ = 'MULTIPOINT (' + newCoordsFormat + ')';\n  const c = multicoords(state);\n  if (!c) {\n    return null;\n  }\n  white(state);\n  return {\n    type: 'MultiPoint',\n    coordinates: c\n  };\n}\n\nfunction parseLineString(state: ParseWKTState): Geometry | null {\n  if (!$(/^(LINESTRING(\\sz)?)/i, state)) {\n    return null;\n  }\n  white(state);\n  if (!$(/^(\\()/, state)) {\n    return null;\n  }\n  const c = coords(state);\n  if (!c) {\n    return null;\n  }\n  if (!$(/^(\\))/, state)) {\n    return null;\n  }\n  return {\n    type: 'LineString',\n    coordinates: c\n  };\n}\n\nfunction parseMultiLineString(state: ParseWKTState): Geometry | null {\n  if (!$(/^(MULTILINESTRING)/i, state)) return null;\n  white(state);\n  const c = multicoords(state);\n  if (!c) {\n    return null;\n  }\n  white(state);\n  return {\n    type: 'MultiLineString',\n    // @ts-expect-error\n    coordinates: c\n  };\n}\n\nfunction parsePolygon(state: ParseWKTState): Geometry | null {\n  if (!$(/^(POLYGON(\\sz)?)/i, state)) {\n    return null;\n  }\n  white(state);\n  const c = multicoords(state);\n  if (!c) {\n    return null;\n  }\n  return {\n    type: 'Polygon',\n    // @ts-expect-error\n    coordinates: c\n  };\n}\n\nfunction parseMultiPolygon(state: ParseWKTState): Geometry | null {\n  if (!$(/^(MULTIPOLYGON)/i, state)) {\n    return null;\n  }\n  white(state);\n  const c = multicoords(state);\n  if (!c) {\n    return null;\n  }\n  return {\n    type: 'MultiPolygon',\n    // @ts-expect-error\n    coordinates: c\n  };\n}\n\nfunction parseGeometryCollection(state: ParseWKTState): Geometry | null {\n  const geometries: Geometry[] = [];\n  let geometry: Geometry | null;\n\n  if (!$(/^(GEOMETRYCOLLECTION)/i, state)) {\n    return null;\n  }\n  white(state);\n\n  if (!$(/^(\\()/, state)) {\n    return null;\n  }\n  while ((geometry = parseGeometry(state))) {\n    geometries.push(geometry);\n    white(state);\n    $(/^(,)/, state);\n    white(state);\n  }\n  if (!$(/^(\\))/, state)) {\n    return null;\n  }\n\n  return {\n    type: 'GeometryCollection',\n    geometries: geometries\n  };\n}\n\n// COORDINATES\n\nfunction multicoords(state: ParseWKTState): number[][] | null {\n  white(state);\n  let depth = 0;\n  const rings: number[][] = [];\n  const stack = [rings];\n  let pointer: any = rings;\n  let elem;\n\n  while ((elem = $(/^(\\()/, state) || $(/^(\\))/, state) || $(/^(,)/, state) || $(tuples, state))) {\n    if (elem === '(') {\n      stack.push(pointer);\n      pointer = [];\n      stack[stack.length - 1].push(pointer);\n      depth++;\n    } else if (elem === ')') {\n      // For the case: Polygon(), ...\n      if (pointer.length === 0) return null;\n\n      // @ts-ignore\n      pointer = stack.pop();\n      // the stack was empty, input was malformed\n      if (!pointer) return null;\n      depth--;\n      if (depth === 0) break;\n    } else if (elem === ',') {\n      pointer = [];\n      stack[stack.length - 1].push(pointer);\n    } else if (!elem.split(/\\s/g).some(isNaN)) {\n      Array.prototype.push.apply(pointer, elem.split(/\\s/g).map(parseFloat));\n    } else {\n      return null;\n    }\n    white(state);\n  }\n\n  if (depth !== 0) return null;\n\n  return rings;\n}\n\nfunction coords(state: ParseWKTState): number[][] | null {\n  const list: number[][] = [];\n  let item: any;\n  let pt;\n  while ((pt = $(tuples, state) || $(/^(,)/, state))) {\n    if (pt === ',') {\n      list.push(item);\n      item = [];\n    } else if (!pt.split(/\\s/g).some(isNaN)) {\n      if (!item) item = [];\n      Array.prototype.push.apply(item, pt.split(/\\s/g).map(parseFloat));\n    }\n    white(state);\n  }\n\n  if (item) list.push(item);\n  else return null;\n\n  return list.length ? list : null;\n}\n\n// HELPERS\n\nfunction $(regexp: RegExp, state: ParseWKTState) {\n  const match = state._?.substring(state.i).match(regexp);\n  if (!match) return null;\n  else {\n    state.i += match[0].length;\n    return match[0];\n  }\n}\n\nfunction white(state: ParseWKTState) {\n  $(/^\\s*/, state);\n}\n", "// loaders.gl, MIT license\n\nimport type {Loader, LoaderWithParser, LoaderOptions} from '@loaders.gl/loader-utils';\nimport {VERSION} from './lib/utils/version';\nimport {parseWKT} from './lib/parse-wkt';\nimport {Geometry} from '@loaders.gl/schema';\nimport {isWKT, WKT_MAGIC_STRINGS} from './lib/parse-wkt';\n\nexport type WKTLoaderOptions = LoaderOptions & {\n  /** Options for the WKT parser */\n  wkt?: {\n    /** Whether to add any CRS, if found, as undocumented CRS property on the return geometry */\n    crs?: boolean;\n  };\n};\n\n/**\n * Well-Known text loader\n */\nexport const WKTWorkerLoader: Loader<Geometry, never, WKTLoaderOptions> = {\n  name: 'WKT (Well-Known Text)',\n  id: 'wkt',\n  module: 'wkt',\n  version: VERSION,\n  worker: true,\n  extensions: ['wkt'],\n  mimeTypes: ['text/plain'],\n  category: 'geometry',\n  text: true,\n  tests: WKT_MAGIC_STRINGS,\n  testText: isWKT,\n  options: {\n    wkt: {\n      crs: true\n    }\n  }\n};\n\n/**\n * Well-Known text loader\n */\nexport const WKTLoader: LoaderWithParser<Geometry, never, WKTLoaderOptions> = {\n  ...WKTWorkerLoader,\n  parse: async (arrayBuffer, options) => parseWKT(new TextDecoder().decode(arrayBuffer), options),\n  parseTextSync: parseWKT\n};\n", "// loaders.gl, MIT license\n\nimport type {\n  BinaryGeometry,\n  BinaryGeometryType,\n  BinaryPointGeometry,\n  BinaryLineGeometry,\n  BinaryPolygonGeometry,\n  BinaryFeatureCollection,\n  BinaryFeature,\n  // BinaryPointFeature,\n  // BinaryLineFeature,\n  // BinaryPolygonFeature,\n  BinaryAttribute\n} from '@loaders.gl/schema';\nimport type {Feature, Geometry, Position, GeoJsonProperties} from '@loaders.gl/schema';\nimport type {\n  Point,\n  MultiPoint,\n  LineString,\n  MultiLineString,\n  Polygon,\n  MultiPolygon\n} from '@loaders.gl/schema';\n\n// Note:L We do not handle GeometryCollection, define a limited Geometry type that always has coordinates.\n// type FeatureGeometry = Point | MultiPoint | LineString | MultiLineString | Polygon | MultiPolygon;\n\ntype BinaryToGeoJsonOptions = {\n  type?: BinaryGeometryType;\n  globalFeatureId?: number;\n};\n\n/**\n * Convert binary geometry representation to GeoJSON\n * @param data   geometry data in binary representation\n * @param options\n * @param options.type  Input data type: Point, LineString, or Polygon\n * @param options.featureId  Global feature id. If specified, only a single feature is extracted\n * @return GeoJSON objects\n */\nexport function binaryToGeojson(\n  data: BinaryFeatureCollection,\n  options?: BinaryToGeoJsonOptions\n): Feature[] | Feature {\n  const globalFeatureId = options?.globalFeatureId;\n  if (globalFeatureId !== undefined) {\n    return getSingleFeature(data, globalFeatureId);\n  }\n  return parseFeatures(data, options?.type);\n}\n\n/** @deprecated use `binaryToGeojson` or `binaryToGeometry` instead *\nexport function binaryToGeoJson(\n  data: BinaryGeometry | BinaryFeatureCollection,\n  type?: BinaryGeometryType,\n  format: 'feature' | 'geometry' = 'feature'\n): Geometry | Feature[] {\n  switch (format) {\n    case 'feature':\n      return parseFeatures(data as BinaryFeatureCollection, type);\n    case 'geometry':\n      return binaryToGeometry(data as any);\n    default:\n      throw new Error(format);\n  }\n}\n*/\n\n/**\n * Return a single feature from a binary geometry representation as GeoJSON\n * @param data   geometry data in binary representation\n * @return GeoJSON feature\n */\nfunction getSingleFeature(data: BinaryFeatureCollection, globalFeatureId: number): Feature {\n  const dataArray = normalizeInput(data);\n  for (const data of dataArray) {\n    let lastIndex = 0;\n    let lastValue = data.featureIds.value[0];\n\n    // Scan through data until we find matching feature\n    for (let i = 0; i < data.featureIds.value.length; i++) {\n      const currValue = data.featureIds.value[i];\n      if (currValue === lastValue) {\n        // eslint-disable-next-line no-continue\n        continue;\n      }\n      if (globalFeatureId === data.globalFeatureIds.value[lastIndex]) {\n        return parseFeature(data, lastIndex, i);\n      }\n      lastIndex = i;\n      lastValue = currValue;\n    }\n\n    if (globalFeatureId === data.globalFeatureIds.value[lastIndex]) {\n      return parseFeature(data, lastIndex, data.featureIds.value.length);\n    }\n  }\n\n  throw new Error(`featureId:${globalFeatureId} not found`);\n}\n\nfunction parseFeatures(data: BinaryFeatureCollection, type?: BinaryGeometryType): Feature[] {\n  const dataArray = normalizeInput(data, type);\n  return parseFeatureCollection(dataArray);\n}\n\n/** Parse input binary data and return a valid GeoJSON geometry object */\nexport function binaryToGeometry(\n  data: BinaryGeometry,\n  startIndex?: number,\n  endIndex?: number\n): Geometry {\n  switch (data.type) {\n    case 'Point':\n      return pointToGeoJson(data, startIndex, endIndex);\n    case 'LineString':\n      return lineStringToGeoJson(data, startIndex, endIndex);\n    case 'Polygon':\n      return polygonToGeoJson(data, startIndex, endIndex);\n    default:\n      const unexpectedInput: never = data;\n      throw new Error(`Unsupported geometry type: ${(unexpectedInput as any)?.type}`);\n  }\n}\n\n// Normalize features\n// Return an array of data objects, each of which have a type key\nfunction normalizeInput(data: BinaryFeatureCollection, type?: BinaryGeometryType): BinaryFeature[] {\n  const features: BinaryFeature[] = [];\n  if (data.points) {\n    data.points.type = 'Point';\n    features.push(data.points);\n  }\n  if (data.lines) {\n    data.lines.type = 'LineString';\n    features.push(data.lines);\n  }\n  if (data.polygons) {\n    data.polygons.type = 'Polygon';\n    features.push(data.polygons);\n  }\n\n  return features;\n}\n\n/** Parse input binary data and return an array of GeoJSON Features */\nfunction parseFeatureCollection(dataArray: BinaryFeature[]): Feature[] {\n  const features: Feature[] = [];\n  for (const data of dataArray) {\n    if (data.featureIds.value.length === 0) {\n      // eslint-disable-next-line no-continue\n      continue;\n    }\n    let lastIndex = 0;\n    let lastValue = data.featureIds.value[0];\n\n    // Need to deduce start, end indices of each feature\n    for (let i = 0; i < data.featureIds.value.length; i++) {\n      const currValue = data.featureIds.value[i];\n      if (currValue === lastValue) {\n        // eslint-disable-next-line no-continue\n        continue;\n      }\n\n      features.push(parseFeature(data, lastIndex, i));\n      lastIndex = i;\n      lastValue = currValue;\n    }\n\n    // Last feature\n    features.push(parseFeature(data, lastIndex, data.featureIds.value.length));\n  }\n  return features;\n}\n\n/** Parse input binary data and return a single GeoJSON Feature */\nfunction parseFeature(data: BinaryFeature, startIndex?: number, endIndex?: number): Feature {\n  const geometry = binaryToGeometry(data, startIndex, endIndex);\n  const properties = parseProperties(data, startIndex, endIndex);\n  const fields = parseFields(data, startIndex, endIndex);\n  return {type: 'Feature', geometry, properties, ...fields};\n}\n\n/** Parse input binary data and return an object of fields */\nfunction parseFields(data, startIndex: number = 0, endIndex?: number): GeoJsonProperties {\n  return data.fields && data.fields[data.featureIds.value[startIndex]];\n}\n\n/** Parse input binary data and return an object of properties */\nfunction parseProperties(data, startIndex: number = 0, endIndex?: number): GeoJsonProperties {\n  const properties = Object.assign({}, data.properties[data.featureIds.value[startIndex]]);\n  for (const key in data.numericProps) {\n    properties[key] = data.numericProps[key].value[startIndex];\n  }\n  return properties;\n}\n\n/** Parse binary data of type Polygon */\nfunction polygonToGeoJson(\n  data: BinaryPolygonGeometry,\n  startIndex: number = -Infinity,\n  endIndex: number = Infinity\n): Polygon | MultiPolygon {\n  const {positions} = data;\n  const polygonIndices = data.polygonIndices.value.filter((x) => x >= startIndex && x <= endIndex);\n  const primitivePolygonIndices = data.primitivePolygonIndices.value.filter(\n    (x) => x >= startIndex && x <= endIndex\n  );\n  const multi = polygonIndices.length > 2;\n\n  // Polygon\n  if (!multi) {\n    const coordinates: Position[][] = [];\n    for (let i = 0; i < primitivePolygonIndices.length - 1; i++) {\n      const startRingIndex = primitivePolygonIndices[i];\n      const endRingIndex = primitivePolygonIndices[i + 1];\n      const ringCoordinates = ringToGeoJson(positions, startRingIndex, endRingIndex);\n      coordinates.push(ringCoordinates);\n    }\n\n    return {type: 'Polygon', coordinates};\n  }\n\n  // MultiPolygon\n  const coordinates: Position[][][] = [];\n  for (let i = 0; i < polygonIndices.length - 1; i++) {\n    const startPolygonIndex = polygonIndices[i];\n    const endPolygonIndex = polygonIndices[i + 1];\n    const polygonCoordinates = polygonToGeoJson(\n      data,\n      startPolygonIndex,\n      endPolygonIndex\n    ).coordinates;\n    coordinates.push(polygonCoordinates as Position[][]);\n  }\n\n  return {type: 'MultiPolygon', coordinates};\n}\n\n/** Parse binary data of type LineString */\nfunction lineStringToGeoJson(\n  data: BinaryLineGeometry,\n  startIndex: number = -Infinity,\n  endIndex: number = Infinity\n): LineString | MultiLineString {\n  const {positions} = data;\n  const pathIndices = data.pathIndices.value.filter((x) => x >= startIndex && x <= endIndex);\n  const multi = pathIndices.length > 2;\n\n  if (!multi) {\n    const coordinates = ringToGeoJson(positions, pathIndices[0], pathIndices[1]);\n    return {type: 'LineString', coordinates};\n  }\n\n  const coordinates: Position[][] = [];\n  for (let i = 0; i < pathIndices.length - 1; i++) {\n    const ringCoordinates = ringToGeoJson(positions, pathIndices[i], pathIndices[i + 1]);\n    coordinates.push(ringCoordinates);\n  }\n\n  return {type: 'MultiLineString', coordinates};\n}\n\n/** Parse binary data of type Point */\nfunction pointToGeoJson(data: BinaryPointGeometry, startIndex, endIndex): Point | MultiPoint {\n  const {positions} = data;\n  const coordinates = ringToGeoJson(positions, startIndex, endIndex);\n  const multi = coordinates.length > 1;\n\n  if (multi) {\n    return {type: 'MultiPoint', coordinates};\n  }\n\n  return {type: 'Point', coordinates: coordinates[0]};\n}\n\n/**\n * Parse a linear ring of positions to a GeoJSON linear ring\n *\n * @param positions Positions TypedArray\n * @param startIndex Start index to include in ring\n * @param endIndex End index to include in ring\n * @returns GeoJSON ring\n */\nfunction ringToGeoJson(\n  positions: BinaryAttribute,\n  startIndex?: number,\n  endIndex?: number\n): Position[] {\n  startIndex = startIndex || 0;\n  endIndex = endIndex || positions.value.length / positions.size;\n\n  const ringCoordinates: Position[] = [];\n  for (let j = startIndex; j < endIndex; j++) {\n    const coord = Array<number>();\n    for (let k = j * positions.size; k < (j + 1) * positions.size; k++) {\n      coord.push(Number(positions.value[k]));\n    }\n    ringCoordinates.push(coord);\n  }\n  return ringCoordinates;\n}\n", "// loaders.gl, MIT license\n\nconst EWKB_FLAG_Z = 0x80000000;\nconst EWKB_FLAG_M = 0x40000000;\nconst EWKB_FLAG_SRID = 0x20000000;\n\nconst MAX_SRID = 10000; // TBD: Assume no more than 10K SRIDs are defined\n\n/**\n * Integer code for geometry types in WKB and related formats\n * Reference: https://en.wikipedia.org/wiki/Well-known_text_representation_of_geometry#Well-known_binary\n */\nexport enum WKBGeometryType {\n  Point = 1,\n  LineString = 2,\n  Polygon = 3,\n  MultiPoint = 4,\n  MultiLineString = 5,\n  MultiPolygon = 6,\n  GeometryCollection = 7\n}\n\n/** Parsed WKB header */\nexport type WKBHeader = {\n  /** WKB variant */\n  type: 'wkb' | 'ewkb' | 'iso-wkb' | 'twkb';\n  /** geometry type encoded in this WKB: point, line, polygon etc */\n  geometryType: 1 | 2 | 3 | 4 | 5 | 6 | 7;\n  /** Number of dimensions for coordinate data */\n  dimensions: 2 | 3 | 4;\n  /** Coordinate names, Z and M are controlled by flags */\n  coordinates: 'xy' | 'xyz' | 'xym' | 'xyzm';\n  srid?: number;\n  /** true if binary data is stored as little endian */\n  littleEndian: boolean;\n  /** Offset to start of geometry */\n  byteOffset: number;\n};\n\n/** Sanity checks that first to 5-9 bytes could represent a supported WKB dialect header */\nexport function isWKB(arrayBuffer: ArrayBuffer): boolean {\n  const dataView = new DataView(arrayBuffer);\n  let byteOffset = 0;\n\n  const endianness = dataView.getUint8(byteOffset);\n  byteOffset += 1;\n\n  // Check valid endianness (only 0 or 1 are allowed)\n  if (endianness > 1) {\n    return false;\n  }\n\n  const littleEndian = endianness === 1;\n\n  const geometry = dataView.getUint32(byteOffset, littleEndian);\n  byteOffset += 4;\n\n  // check valid geometry type (we don't support extension geometries)\n  const geometryType = geometry & 0x07;\n  if (geometryType === 0 || geometryType > 7) {\n    return false;\n  }\n\n  const geometryFlags = geometry - geometryType;\n\n  // Accept iso-wkb flags\n  if (\n    geometryFlags === 0 ||\n    geometryFlags === 1000 ||\n    geometryFlags === 2000 ||\n    geometryFlags === 3000\n  ) {\n    return true;\n  }\n\n  // Accept ewkb flags but reject otherwise\n  if ((geometryFlags & ~(EWKB_FLAG_Z | EWKB_FLAG_M | EWKB_FLAG_SRID)) !== 0) {\n    return false;\n  }\n\n  if (geometryFlags & EWKB_FLAG_SRID) {\n    const srid = dataView.getUint32(byteOffset, littleEndian);\n    byteOffset += 4;\n\n    if (srid > MAX_SRID) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\n/**\n * Parses header and provides a byteOffset to start of geometry data\n * @param dataView\n * @param target optionally supply a WKBHeader object to avoid creating a new object for every call\n * @returns a header object describing the WKB data\n */\n// eslint-disable-next-line max-statements\nexport function parseWKBHeader(dataView: DataView, target?: WKBHeader): WKBHeader {\n  const wkbHeader: WKBHeader = Object.assign(target || {}, {\n    type: 'wkb',\n    geometryType: 1,\n    dimensions: 2,\n    coordinates: 'xy',\n    littleEndian: true,\n    byteOffset: 0\n  } as WKBHeader);\n\n  // Check endianness of data\n  wkbHeader.littleEndian = dataView.getUint8(wkbHeader.byteOffset) === 1;\n  wkbHeader.byteOffset++;\n\n  // 4-digit code representing dimension and type of geometry\n  const geometryCode = dataView.getUint32(wkbHeader.byteOffset, wkbHeader.littleEndian);\n  wkbHeader.byteOffset += 4;\n\n  wkbHeader.geometryType = (geometryCode & 0x7) as 1 | 2 | 3 | 4 | 5 | 6 | 7;\n\n  // Check if iso-wkb variant: iso-wkb adds 1000, 2000 or 3000 to the geometry code\n  const isoType = (geometryCode - wkbHeader.geometryType) / 1000;\n  switch (isoType) {\n    case 0:\n      break;\n    case 1:\n      wkbHeader.type = 'iso-wkb';\n      wkbHeader.dimensions = 3;\n      wkbHeader.coordinates = 'xyz';\n      break;\n    case 2:\n      wkbHeader.type = 'iso-wkb';\n      wkbHeader.dimensions = 3;\n      wkbHeader.coordinates = 'xym';\n      break;\n    case 3:\n      wkbHeader.type = 'iso-wkb';\n      wkbHeader.dimensions = 4;\n      wkbHeader.coordinates = 'xyzm';\n      break;\n    default:\n      throw new Error(`WKB: Unsupported iso-wkb type: ${isoType}`);\n  }\n\n  // Check if EWKB variant. Uses bitmasks for Z&M dimensions as well as optional SRID field\n  const ewkbZ = geometryCode & EWKB_FLAG_Z;\n  const ewkbM = geometryCode & EWKB_FLAG_M;\n  const ewkbSRID = geometryCode & EWKB_FLAG_SRID;\n\n  if (ewkbZ && ewkbM) {\n    wkbHeader.type = 'ewkb';\n    wkbHeader.dimensions = 4;\n    wkbHeader.coordinates = 'xyzm';\n  } else if (ewkbZ) {\n    wkbHeader.type = 'ewkb';\n    wkbHeader.dimensions = 3;\n    wkbHeader.coordinates = 'xyz';\n  } else if (ewkbM) {\n    wkbHeader.type = 'ewkb';\n    wkbHeader.dimensions = 3;\n    wkbHeader.coordinates = 'xym';\n  }\n\n  // If SRID present read four more bytes\n  if (ewkbSRID) {\n    wkbHeader.type = 'ewkb';\n    // 4-digit code representing dimension and type of geometry\n    wkbHeader.srid = dataView.getUint32(wkbHeader.byteOffset, wkbHeader.littleEndian);\n    wkbHeader.byteOffset += 4;\n  }\n\n  return wkbHeader;\n}\n", "// loaders.gl, MIT license\n\nimport type {\n  TypedArray,\n  BinaryGeometry,\n  BinaryPointGeometry,\n  BinaryLineGeometry,\n  BinaryPolygonGeometry,\n  Geometry\n} from '@loaders.gl/schema';\nimport {binaryToGeometry} from '@loaders.gl/gis';\nimport type {WKBLoaderOptions} from '../wkb-loader';\n\nimport {parseWKBHeader, WKBGeometryType} from './parse-wkb-header';\n\nexport function parseWKB(\n  arrayBuffer: ArrayBuffer,\n  options?: WKBLoaderOptions\n): BinaryGeometry | Geometry {\n  const binaryGeometry = parseWKBToBinary(arrayBuffer, options);\n  const shape = options?.wkb?.shape || 'binary-geometry';\n  switch (shape) {\n    case 'binary-geometry':\n      return binaryGeometry;\n    case 'geometry':\n      return binaryToGeometry(binaryGeometry);\n    default:\n      throw new Error(shape);\n  }\n}\n\nexport function parseWKBToBinary(\n  arrayBuffer: ArrayBuffer,\n  options?: WKBLoaderOptions\n): BinaryGeometry {\n  const dataView = new DataView(arrayBuffer);\n\n  const wkbHeader = parseWKBHeader(dataView);\n\n  const {geometryType, dimensions, littleEndian} = wkbHeader;\n  const offset = wkbHeader.byteOffset;\n\n  switch (geometryType) {\n    case WKBGeometryType.Point:\n      const point = parsePoint(dataView, offset, dimensions, littleEndian);\n      return point.geometry;\n    case WKBGeometryType.LineString:\n      const line = parseLineString(dataView, offset, dimensions, littleEndian);\n      return line.geometry;\n    case WKBGeometryType.Polygon:\n      const polygon = parsePolygon(dataView, offset, dimensions, littleEndian);\n      return polygon.geometry;\n    case WKBGeometryType.MultiPoint:\n      const multiPoint = parseMultiPoint(dataView, offset, dimensions, littleEndian);\n      multiPoint.type = 'Point';\n      return multiPoint;\n    case WKBGeometryType.MultiLineString:\n      const multiLine = parseMultiLineString(dataView, offset, dimensions, littleEndian);\n      multiLine.type = 'LineString';\n      return multiLine;\n    case WKBGeometryType.MultiPolygon:\n      const multiPolygon = parseMultiPolygon(dataView, offset, dimensions, littleEndian);\n      multiPolygon.type = 'Polygon';\n      return multiPolygon;\n    // case WKBGeometryType.GeometryCollection:\n    // TODO: handle GeometryCollections\n    // return parseGeometryCollection(dataView, offset, dimensions, littleEndian);\n    default:\n      throw new Error(`WKB: Unsupported geometry type: ${geometryType}`);\n  }\n}\n\n// Primitives; parse point and linear ring\nfunction parsePoint(\n  dataView: DataView,\n  offset: number,\n  dimension: number,\n  littleEndian: boolean\n): {geometry: BinaryPointGeometry; offset: number} {\n  const positions = new Float64Array(dimension);\n  for (let i = 0; i < dimension; i++) {\n    positions[i] = dataView.getFloat64(offset, littleEndian);\n    offset += 8;\n  }\n\n  return {\n    geometry: {type: 'Point', positions: {value: positions, size: dimension}},\n    offset\n  };\n}\n\nfunction parseLineString(\n  dataView: DataView,\n  offset: number,\n  dimension: number,\n  littleEndian: boolean\n): {geometry: BinaryLineGeometry; offset: number} {\n  const nPoints = dataView.getUint32(offset, littleEndian);\n  offset += 4;\n\n  // Instantiate array\n  const positions = new Float64Array(nPoints * dimension);\n  for (let i = 0; i < nPoints * dimension; i++) {\n    positions[i] = dataView.getFloat64(offset, littleEndian);\n    offset += 8;\n  }\n\n  const pathIndices = [0];\n  if (nPoints > 0) {\n    pathIndices.push(nPoints);\n  }\n\n  return {\n    geometry: {\n      type: 'LineString',\n      positions: {value: positions, size: dimension},\n      pathIndices: {value: new Uint16Array(pathIndices), size: 1}\n    },\n    offset\n  };\n}\n\n// https://stackoverflow.com/a/55261098\nconst cumulativeSum = (sum: number) => (value: number) => (sum += value);\n\nfunction parsePolygon(\n  dataView: DataView,\n  offset: number,\n  dimension: number,\n  littleEndian: boolean\n): {geometry: BinaryPolygonGeometry; offset: number} {\n  const nRings = dataView.getUint32(offset, littleEndian);\n  offset += 4;\n\n  const rings: TypedArray[] = [];\n  for (let i = 0; i < nRings; i++) {\n    const parsed = parseLineString(dataView, offset, dimension, littleEndian);\n    const {positions} = parsed.geometry;\n    offset = parsed.offset;\n    rings.push(positions.value);\n  }\n\n  const concatenatedPositions = new Float64Array(concatTypedArrays(rings).buffer);\n  const polygonIndices = [0];\n  if (concatenatedPositions.length > 0) {\n    polygonIndices.push(concatenatedPositions.length / dimension);\n  }\n  const primitivePolygonIndices = rings.map((l) => l.length / dimension).map(cumulativeSum(0));\n  primitivePolygonIndices.unshift(0);\n\n  return {\n    geometry: {\n      type: 'Polygon',\n      positions: {value: concatenatedPositions, size: dimension},\n      polygonIndices: {\n        value: new Uint16Array(polygonIndices),\n        size: 1\n      },\n      primitivePolygonIndices: {value: new Uint16Array(primitivePolygonIndices), size: 1}\n    },\n    offset\n  };\n}\n\nfunction parseMultiPoint(\n  dataView: DataView,\n  offset: number,\n  dimension: number,\n  littleEndian: boolean\n): BinaryPointGeometry {\n  const nPoints = dataView.getUint32(offset, littleEndian);\n  offset += 4;\n\n  const binaryPointGeometries: BinaryPointGeometry[] = [];\n  for (let i = 0; i < nPoints; i++) {\n    // Byte order for point\n    const littleEndianPoint = dataView.getUint8(offset) === 1;\n    offset++;\n\n    // Assert point type\n    if (dataView.getUint32(offset, littleEndianPoint) % 1000 !== 1) {\n      throw new Error('WKB: Inner geometries of MultiPoint not of type Point');\n    }\n\n    offset += 4;\n\n    const parsed = parsePoint(dataView, offset, dimension, littleEndianPoint);\n    offset = parsed.offset;\n    binaryPointGeometries.push(parsed.geometry);\n  }\n\n  return concatenateBinaryPointGeometries(binaryPointGeometries, dimension);\n}\n\nfunction parseMultiLineString(\n  dataView: DataView,\n  offset: number,\n  dimension: number,\n  littleEndian: boolean\n): BinaryLineGeometry {\n  const nLines = dataView.getUint32(offset, littleEndian);\n  offset += 4;\n\n  const binaryLineGeometries: BinaryLineGeometry[] = [];\n  for (let i = 0; i < nLines; i++) {\n    // Byte order for line\n    const littleEndianLine = dataView.getUint8(offset) === 1;\n    offset++;\n\n    // Assert type LineString\n    if (dataView.getUint32(offset, littleEndianLine) % 1000 !== 2) {\n      throw new Error('WKB: Inner geometries of MultiLineString not of type LineString');\n    }\n    offset += 4;\n\n    const parsed = parseLineString(dataView, offset, dimension, littleEndianLine);\n    offset = parsed.offset;\n    binaryLineGeometries.push(parsed.geometry);\n  }\n\n  return concatenateBinaryLineGeometries(binaryLineGeometries, dimension);\n}\n\nfunction parseMultiPolygon(\n  dataView: DataView,\n  offset: number,\n  dimension: number,\n  littleEndian: boolean\n): BinaryPolygonGeometry {\n  const nPolygons = dataView.getUint32(offset, littleEndian);\n  offset += 4;\n\n  const binaryPolygonGeometries: BinaryPolygonGeometry[] = [];\n  for (let i = 0; i < nPolygons; i++) {\n    // Byte order for polygon\n    const littleEndianPolygon = dataView.getUint8(offset) === 1;\n    offset++;\n\n    // Assert type Polygon\n    if (dataView.getUint32(offset, littleEndianPolygon) % 1000 !== 3) {\n      throw new Error('WKB: Inner geometries of MultiPolygon not of type Polygon');\n    }\n    offset += 4;\n\n    const parsed = parsePolygon(dataView, offset, dimension, littleEndianPolygon);\n    offset = parsed.offset;\n    binaryPolygonGeometries.push(parsed.geometry);\n  }\n\n  return concatenateBinaryPolygonGeometries(binaryPolygonGeometries, dimension);\n}\n\n// TODO - move to loaders.gl/schema/gis\n\nfunction concatenateBinaryPointGeometries(\n  binaryPointGeometries: BinaryPointGeometry[],\n  dimension: number\n): BinaryPointGeometry {\n  const positions: TypedArray[] = binaryPointGeometries.map((geometry) => geometry.positions.value);\n  const concatenatedPositions = new Float64Array(concatTypedArrays(positions).buffer);\n\n  return {\n    type: 'Point',\n    positions: {value: concatenatedPositions, size: dimension}\n  };\n}\n\nfunction concatenateBinaryLineGeometries(\n  binaryLineGeometries: BinaryLineGeometry[],\n  dimension: number\n): BinaryLineGeometry {\n  const lines: TypedArray[] = binaryLineGeometries.map((geometry) => geometry.positions.value);\n  const concatenatedPositions = new Float64Array(concatTypedArrays(lines).buffer);\n  const pathIndices = lines.map((line) => line.length / dimension).map(cumulativeSum(0));\n  pathIndices.unshift(0);\n\n  return {\n    type: 'LineString',\n    positions: {value: concatenatedPositions, size: dimension},\n    pathIndices: {value: new Uint16Array(pathIndices), size: 1}\n  };\n}\n\nfunction concatenateBinaryPolygonGeometries(\n  binaryPolygonGeometries: BinaryPolygonGeometry[],\n  dimension: number\n): BinaryPolygonGeometry {\n  const polygons: TypedArray[] = [];\n  const primitivePolygons: TypedArray[] = [];\n\n  for (const binaryPolygon of binaryPolygonGeometries) {\n    const {positions, primitivePolygonIndices} = binaryPolygon;\n    polygons.push(positions.value);\n    primitivePolygons.push(primitivePolygonIndices.value);\n  }\n\n  const concatenatedPositions = new Float64Array(concatTypedArrays(polygons).buffer);\n  const polygonIndices = polygons.map((p) => p.length / dimension).map(cumulativeSum(0));\n  polygonIndices.unshift(0);\n\n  // Combine primitivePolygonIndices from each individual polygon\n  const primitivePolygonIndices = [0];\n  for (const primitivePolygon of primitivePolygons) {\n    primitivePolygonIndices.push(\n      ...primitivePolygon\n        .filter((x: number) => x > 0)\n        .map((x: number) => x + primitivePolygonIndices[primitivePolygonIndices.length - 1])\n    );\n  }\n\n  return {\n    type: 'Polygon',\n    positions: {value: concatenatedPositions, size: dimension},\n    polygonIndices: {value: new Uint16Array(polygonIndices), size: 1},\n    primitivePolygonIndices: {value: new Uint16Array(primitivePolygonIndices), size: 1}\n  };\n}\n\n// TODO: remove copy; import from typed-array-utils\n// modules/math/src/geometry/typed-arrays/typed-array-utils.js\nfunction concatTypedArrays(arrays: TypedArray[]): TypedArray {\n  let byteLength = 0;\n  for (let i = 0; i < arrays.length; ++i) {\n    byteLength += arrays[i].byteLength;\n  }\n  const buffer = new Uint8Array(byteLength);\n\n  let byteOffset = 0;\n  for (let i = 0; i < arrays.length; ++i) {\n    const data = new Uint8Array(arrays[i].buffer);\n    byteLength = data.length;\n    for (let j = 0; j < byteLength; ++j) {\n      buffer[byteOffset++] = data[j];\n    }\n  }\n  return buffer;\n}\n", "// loaders.gl, MIT license\n\nimport type {Loader, LoaderWithParser, LoaderOptions} from '@loaders.gl/loader-utils';\nimport {BinaryGeometry, Geometry} from '@loaders.gl/schema';\nimport {VERSION} from './lib/utils/version';\nimport {parseWKB} from './lib/parse-wkb';\nimport {isWKB} from './lib/parse-wkb-header';\n\nexport type WKBLoaderOptions = LoaderOptions & {\n  wkb?: {\n    shape: 'binary-geometry' | 'geometry';\n  };\n};\n\n/**\n * Worker loader for WKB (Well-Known Binary)\n */\nexport const WKBWorkerLoader: Loader<BinaryGeometry | Geometry, never, WKBLoaderOptions> = {\n  name: 'WKB',\n  id: 'wkb',\n  module: 'wkt',\n  version: VERSION,\n  worker: true,\n  category: 'geometry',\n  extensions: ['wkb'],\n  mimeTypes: [],\n  // TODO can we define static, serializable tests, eg. some binary strings?\n  tests: [isWKB],\n  options: {\n    wkb: {\n      shape: 'binary-geometry'\n    }\n  }\n};\n\n/**\n * Loader for WKB (Well-Known Binary)\n */\nexport const WKBLoader: LoaderWithParser<BinaryGeometry | Geometry, never, WKBLoaderOptions> = {\n  ...WKBWorkerLoader,\n  parse: async (arrayBuffer: ArrayBuffer) => parseWKB(arrayBuffer),\n  parseSync: parseWKB\n};\n", "// loaders.gl, MIT license\n\nimport type {ArrayRowTable, GeoJSONTable, ObjectRowTable, Schema} from '@loaders.gl/schema';\nimport type {Feature, Geometry} from '@loaders.gl/schema';\nimport {getTableLength, getTableRowAsObject} from '@loaders.gl/schema';\n// import {binaryToGeometry} from '@loaders.gl/gis';\nimport {WKBLoader, WKTLoader} from '@loaders.gl/wkt';\n\nimport {GeoColumnMetadata, getGeoMetadata} from './decode-geo-metadata';\n\n/** TODO - move to loaders.gl/gis? */\nexport function convertWKBTableToGeoJSON(\n  table: ArrayRowTable | ObjectRowTable,\n  schema: Schema\n): GeoJSONTable {\n  const geoMetadata = getGeoMetadata(schema);\n  const primaryColumn = geoMetadata?.primary_column;\n  if (!primaryColumn) {\n    throw new Error('no geometry column');\n  }\n  const columnMetadata = geoMetadata.columns[primaryColumn];\n\n  const features: Feature[] = [];\n\n  const length = getTableLength(table);\n  for (let rowIndex = 0; rowIndex < length; rowIndex++) {\n    const row = getTableRowAsObject(table, rowIndex);\n    const geometry = parseGeometry(row[primaryColumn], columnMetadata);\n    delete row[primaryColumn];\n    const feature: Feature = {type: 'Feature', geometry: geometry!, properties: row};\n    features.push(feature);\n  }\n\n  return {shape: 'geojson-table', schema, type: 'FeatureCollection', features};\n}\n\nfunction parseGeometry(geometry: unknown, columnMetadata: GeoColumnMetadata): Geometry | null {\n  switch (columnMetadata.encoding) {\n    case 'wkt':\n      return WKTLoader.parseTextSync?.(geometry as string) || null;\n    case 'wkb':\n    default:\n      const arrayBuffer = ArrayBuffer.isView(geometry)\n        ? geometry.buffer.slice(geometry.byteOffset, geometry.byteOffset + geometry.byteLength)\n        : (geometry as ArrayBuffer);\n      const geojson = WKBLoader.parseSync?.(arrayBuffer, {\n        wkb: {shape: 'geometry'}\n      }) as unknown as Geometry;\n      return geojson; // binaryGeometry ? binaryToGeometry(binaryGeometry) : null;\n    // const binaryGeometry = WKBLoader.parseSync?.(geometry);\n    // ts-ignore\n    // return binaryGeometry ? binaryToGeometry(binaryGeometry) : null;\n  }\n}\n", "// import type {LoaderWithParser, Loader, LoaderOptions} from '@loaders.gl/loader-utils';\n// import {ColumnarTableBatch} from '@loaders.gl/schema';\nimport {makeReadableFile} from '@loaders.gl/loader-utils';\nimport {GeoJSONTable, ObjectRowTable, ObjectRowTableBatch} from '@loaders.gl/schema';\nimport type {ParquetLoaderOptions} from '../../parquet-loader';\nimport type {ParquetRow} from '../../parquetjs/schema/declare';\nimport {ParquetReader} from '../../parquetjs/parser/parquet-reader';\nimport {getSchemaFromParquetReader} from './get-parquet-schema';\nimport {installBufferPolyfill} from '../../buffer-polyfill';\nimport {convertWKBTableToGeoJSON} from '../geo/decode-geo-column';\n\nexport async function parseParquet(\n  arrayBuffer: ArrayBuffer,\n  options?: ParquetLoaderOptions\n): Promise<ObjectRowTable | GeoJSONTable> {\n  installBufferPolyfill();\n\n  const blob = new Blob([arrayBuffer]);\n  const file = makeReadableFile(blob);\n  const reader = new ParquetReader(file, {\n    preserveBinary: options?.parquet?.preserveBinary\n  });\n\n  const schema = await getSchemaFromParquetReader(reader);\n\n  const rows: ParquetRow[] = [];\n\n  const rowBatches = reader.rowBatchIterator(options?.parquet);\n  for await (const rowBatch of rowBatches) {\n    // we have only one input batch so return\n    for (const row of rowBatch) {\n      rows.push(row);\n    }\n  }\n  const objectRowTable: ObjectRowTable = {\n    shape: 'object-row-table',\n    schema,\n    data: rows\n  };\n\n  const shape = options?.parquet?.shape;\n  switch (shape) {\n    case 'object-row-table':\n      return objectRowTable;\n\n    case 'geojson-table':\n      try {\n        return convertWKBTableToGeoJSON(objectRowTable, schema);\n      } catch (error) {\n        return objectRowTable;\n      }\n\n    default:\n      throw new Error(shape);\n  }\n}\n\nexport async function* parseParquetFileInBatches(\n  reader: ParquetReader,\n  options?: ParquetLoaderOptions\n): AsyncIterable<ObjectRowTableBatch> {\n  const schema = await getSchemaFromParquetReader(reader);\n  const rowBatches = reader.rowBatchIterator(options?.parquet);\n  for await (const rows of rowBatches) {\n    yield {\n      batchType: 'data',\n      shape: 'object-row-table',\n      schema,\n      data: rows,\n      length: rows.length\n    };\n  }\n}\n", "// loaders.gl, MIT license\n\nimport {ColumnarTable, ColumnarTableBatch, Schema} from '@loaders.gl/schema';\nimport {makeReadableFile} from '@loaders.gl/loader-utils';\nimport type {ParquetLoaderOptions} from '../../parquet-loader';\nimport {ParquetReader} from '../../parquetjs/parser/parquet-reader';\nimport {ParquetRowGroup} from '../../parquetjs/schema/declare';\nimport {ParquetSchema} from '../../parquetjs/schema/schema';\nimport {materializeColumns} from '../../parquetjs/schema/shred';\nimport {getSchemaFromParquetReader} from './get-parquet-schema';\nimport {installBufferPolyfill} from '../../buffer-polyfill';\n\nexport async function parseParquetInColumns(\n  arrayBuffer: ArrayBuffer,\n  options?: ParquetLoaderOptions\n): Promise<ColumnarTable> {\n  installBufferPolyfill();\n  const blob = new Blob([arrayBuffer]);\n  const file = makeReadableFile(blob);\n  const reader = new ParquetReader(file);\n\n  for await (const batch of parseParquetFileInColumnarBatches(reader, options)) {\n    return {\n      shape: 'columnar-table',\n      schema: batch.schema,\n      data: batch.data\n    };\n  }\n  throw new Error('empty table');\n}\n\nexport async function* parseParquetFileInColumnarBatches(\n  reader: ParquetReader,\n  options?: ParquetLoaderOptions\n): AsyncIterable<ColumnarTableBatch> {\n  // Extract schema and geo metadata\n  const schema = await getSchemaFromParquetReader(reader);\n\n  const parquetSchema = await reader.getSchema();\n\n  // Iterate over row batches\n  const rowGroups = reader.rowGroupIterator(options?.parquet);\n  for await (const rowGroup of rowGroups) {\n    yield convertRowGroupToTableBatch(rowGroup, parquetSchema, schema);\n  }\n}\n\nfunction convertRowGroupToTableBatch(\n  rowGroup: ParquetRowGroup,\n  parquetSchema: ParquetSchema,\n  schema: Schema\n): ColumnarTableBatch {\n  // const data = convertParquetRowGroupToColumns(schema, rowGroup);\n  const data = materializeColumns(parquetSchema, rowGroup);\n  return {\n    shape: 'columnar-table',\n    batchType: 'data',\n    schema,\n    data,\n    length: rowGroup.rowCount\n  };\n}\n", "// loaders.gl, MIT license\n\nexport {Buffer} from './buffer-polyfill/install-buffer-polyfill';\n\nimport type {LoaderWithParser} from '@loaders.gl/loader-utils';\nimport type {\n  ObjectRowTable,\n  ObjectRowTableBatch,\n  ColumnarTable,\n  ColumnarTableBatch,\n  GeoJSONTable,\n  GeoJSONTableBatch\n} from '@loaders.gl/schema';\n// import type {Table as ApacheArrowTable} from 'apache-arrow';\n\n// ParquetLoader\n\nimport {\n  ParquetLoader as ParquetWorkerLoader,\n  ParquetLoader as ParquetColumnarWorkerLoader,\n  ParquetLoaderOptions\n} from './parquet-loader';\nimport {parseParquet, parseParquetFileInBatches} from './lib/parsers/parse-parquet-to-rows';\nimport {\n  parseParquetInColumns,\n  parseParquetFileInColumnarBatches\n} from './lib/parsers/parse-parquet-to-columns';\n\n// import type {ParquetWasmLoaderOptions} from './lib/wasm/parse-parquet-wasm';\n// import {parseParquetWasm} from './lib/wasm/parse-parquet-wasm';\n// import {ParquetWasmLoader as ParquetWasmWorkerLoader} from './parquet-wasm-loader';\n\nexport {ParquetWorkerLoader};\n// export {ParquetWasmWorkerLoader};\n\n/** ParquetJS table loader */\nexport const ParquetLoader: LoaderWithParser<\n  ObjectRowTable | GeoJSONTable,\n  ObjectRowTableBatch | GeoJSONTableBatch,\n  ParquetLoaderOptions\n> = {\n  ...ParquetWorkerLoader,\n  parse: parseParquet,\n  // @ts-expect-error\n  parseFileInBatches: parseParquetFileInBatches\n};\n\n/** ParquetJS table loader */\nexport const ParquetColumnarLoader: LoaderWithParser<\n  ColumnarTable,\n  ColumnarTableBatch,\n  ParquetLoaderOptions\n> = {\n  ...ParquetColumnarWorkerLoader,\n  parse: parseParquetInColumns,\n  // @ts-expect-error\n  parseFileInBatches: parseParquetFileInColumnarBatches\n};\n\n// export const ParquetWasmLoader: LoaderWithParser<\n//   ApacheArrowTable,\n//   never,\n//   ParquetWasmLoaderOptions\n// > = {\n//   ...ParquetWasmWorkerLoader,\n//   // @ts-expect-error Getting strange errors in wasm\n//   parse: () => {} // parseParquetWasm\n// };\n\n// ParquetWriter\n\nexport {ParquetWriter as _ParquetWriter} from './parquet-writer';\n// export {ParquetWasmWriter} from './parquet-wasm-writer';\n\n// EXPERIMENTAL - expose the internal parquetjs API\n\nexport {preloadCompressions} from './parquetjs/compression';\n\nexport {ParquetSchema} from './parquetjs/schema/schema';\nexport {ParquetReader} from './parquetjs/parser/parquet-reader';\nexport {ParquetEncoder} from './parquetjs/encoder/parquet-encoder';\n\nexport {\n  convertParquetSchema,\n  convertParquetSchema as convertParquetToArrowSchema\n} from './lib/arrow/convert-schema-from-parquet';\n\n// Geo Metadata\n// import {default as GEOPARQUET_METADATA_SCHEMA} from './lib/geo/geoparquet-metadata-schema.json';\n// export {GEOPARQUET_METADATA_SCHEMA};\nexport {GEOPARQUET_METADATA_JSON_SCHEMA} from './lib/geo/geoparquet-metadata-schema';\n\nexport type {GeoMetadata} from './lib/geo/decode-geo-metadata';\nexport {getGeoMetadata, setGeoMetadata, unpackGeoMetadata} from './lib/geo/decode-geo-metadata';\n\n// Experimental\nexport {BufferPolyfill, installBufferPolyfill} from './buffer-polyfill';\n", "import {createLoaderWorker} from '@loaders.gl/loader-utils';\nimport {ParquetLoader} from '../index';\n\ncreateLoaderWorker(ParquetLoader);\n"],
-  "mappings": "84BAAA,4BAEA,GAAQ,WAAa,GACrB,GAAQ,YAAc,GACtB,GAAQ,cAAgB,GAExB,GAAI,IAAS,GACT,GAAY,GACZ,GAAM,MAAO,aAAe,YAAc,WAAa,MAEvD,GAAO,mEACX,IAAS,GAAI,EAAG,GAAM,GAAK,OAAQ,GAAI,GAAK,EAAE,GAC5C,GAAO,IAAK,GAAK,IACjB,GAAU,GAAK,WAAW,KAAM,GAFzB,OAAO,GAOhB,GAAU,IAAI,WAAW,IAAM,GAC/B,GAAU,IAAI,WAAW,IAAM,GAE/B,YAAkB,EAAK,CACrB,GAAI,GAAM,EAAI,OAEd,GAAI,EAAM,EAAI,EACZ,KAAM,IAAI,OAAM,kDAKlB,GAAI,GAAW,EAAI,QAAQ,KAC3B,AAAI,IAAa,IAAI,GAAW,GAEhC,GAAI,GAAkB,IAAa,EAC/B,EACA,EAAK,EAAW,EAEpB,MAAO,CAAC,EAAU,GAIpB,YAAqB,EAAK,CACxB,GAAI,GAAO,GAAQ,GACf,EAAW,EAAK,GAChB,EAAkB,EAAK,GAC3B,MAAS,GAAW,GAAmB,EAAI,EAAK,EAGlD,YAAsB,EAAK,EAAU,EAAiB,CACpD,MAAS,GAAW,GAAmB,EAAI,EAAK,EAGlD,YAAsB,EAAK,CACzB,GAAI,GACA,EAAO,GAAQ,GACf,EAAW,EAAK,GAChB,EAAkB,EAAK,GAEvB,EAAM,GAAI,IAAI,GAAY,EAAK,EAAU,IAEzC,EAAU,EAGV,EAAM,EAAkB,EACxB,EAAW,EACX,EAEA,EACJ,IAAK,EAAI,EAAG,EAAI,EAAK,GAAK,EACxB,EACG,GAAU,EAAI,WAAW,KAAO,GAChC,GAAU,EAAI,WAAW,EAAI,KAAO,GACpC,GAAU,EAAI,WAAW,EAAI,KAAO,EACrC,GAAU,EAAI,WAAW,EAAI,IAC/B,EAAI,KAAc,GAAO,GAAM,IAC/B,EAAI,KAAc,GAAO,EAAK,IAC9B,EAAI,KAAa,EAAM,IAGzB,MAAI,KAAoB,GACtB,GACG,GAAU,EAAI,WAAW,KAAO,EAChC,GAAU,EAAI,WAAW,EAAI,KAAO,EACvC,EAAI,KAAa,EAAM,KAGrB,IAAoB,GACtB,GACG,GAAU,EAAI,WAAW,KAAO,GAChC,GAAU,EAAI,WAAW,EAAI,KAAO,EACpC,GAAU,EAAI,WAAW,EAAI,KAAO,EACvC,EAAI,KAAc,GAAO,EAAK,IAC9B,EAAI,KAAa,EAAM,KAGlB,EAGT,YAA0B,EAAK,CAC7B,MAAO,IAAO,GAAO,GAAK,IACxB,GAAO,GAAO,GAAK,IACnB,GAAO,GAAO,EAAI,IAClB,GAAO,EAAM,IAGjB,YAAsB,EAAO,EAAO,EAAK,CAGvC,OAFI,GACA,EAAS,GACJ,EAAI,EAAO,EAAI,EAAK,GAAK,EAChC,EACI,GAAM,IAAM,GAAM,UAClB,GAAM,EAAI,IAAM,EAAK,OACtB,GAAM,EAAI,GAAK,KAClB,EAAO,KAAK,GAAgB,IAE9B,MAAO,GAAO,KAAK,IAGrB,YAAwB,EAAO,CAQ7B,OAPI,GACA,EAAM,EAAM,OACZ,EAAa,EAAM,EACnB,EAAQ,GACR,EAAiB,MAGZ,EAAI,EAAG,EAAO,EAAM,EAAY,EAAI,EAAM,GAAK,EACtD,EAAM,KAAK,GAAY,EAAO,EAAI,EAAI,EAAkB,EAAO,EAAQ,EAAI,IAI7E,MAAI,KAAe,EACjB,GAAM,EAAM,EAAM,GAClB,EAAM,KACJ,GAAO,GAAO,GACd,GAAQ,GAAO,EAAK,IACpB,OAEO,IAAe,GACxB,GAAO,GAAM,EAAM,IAAM,GAAK,EAAM,EAAM,GAC1C,EAAM,KACJ,GAAO,GAAO,IACd,GAAQ,GAAO,EAAK,IACpB,GAAQ,GAAO,EAAK,IACpB,MAIG,EAAM,KAAK,OCpJpB,eACA,GAAQ,KAAO,SAAU,EAAQ,EAAQ,EAAM,EAAM,EAAQ,CAC3D,GAAI,GAAG,EACH,EAAQ,EAAS,EAAK,EAAO,EAC7B,EAAQ,IAAK,GAAQ,EACrB,EAAQ,GAAQ,EAChB,EAAQ,GACR,EAAI,EAAQ,EAAS,EAAK,EAC1B,EAAI,EAAO,GAAK,EAChB,EAAI,EAAO,EAAS,GAOxB,IALA,GAAK,EAEL,EAAI,EAAM,IAAM,CAAC,GAAU,EAC3B,IAAO,CAAC,EACR,GAAS,EACF,EAAQ,EAAG,EAAK,EAAI,IAAO,EAAO,EAAS,GAAI,GAAK,EAAG,GAAS,EAAG,CAK1E,IAHA,EAAI,EAAM,IAAM,CAAC,GAAU,EAC3B,IAAO,CAAC,EACR,GAAS,EACF,EAAQ,EAAG,EAAK,EAAI,IAAO,EAAO,EAAS,GAAI,GAAK,EAAG,GAAS,EAAG,CAE1E,GAAI,IAAM,EACR,EAAI,EAAI,MACH,IAAI,IAAM,EACf,MAAO,GAAI,IAAQ,GAAI,GAAK,GAAK,MAEjC,EAAI,EAAI,KAAK,IAAI,EAAG,GACpB,EAAI,EAAI,EAEV,MAAQ,GAAI,GAAK,GAAK,EAAI,KAAK,IAAI,EAAG,EAAI,IAG5C,GAAQ,MAAQ,SAAU,EAAQ,EAAO,EAAQ,EAAM,EAAM,EAAQ,CACnE,GAAI,GAAG,EAAG,EACN,EAAQ,EAAS,EAAK,EAAO,EAC7B,EAAQ,IAAK,GAAQ,EACrB,EAAQ,GAAQ,EAChB,EAAM,IAAS,GAAK,KAAK,IAAI,EAAG,KAAO,KAAK,IAAI,EAAG,KAAO,EAC1D,EAAI,EAAO,EAAK,EAAS,EACzB,EAAI,EAAO,EAAI,GACf,EAAI,EAAQ,GAAM,IAAU,GAAK,EAAI,EAAQ,EAAK,EAAI,EAmC1D,IAjCA,EAAQ,KAAK,IAAI,GAEjB,AAAI,MAAM,IAAU,IAAU,IAC5B,GAAI,MAAM,GAAS,EAAI,EACvB,EAAI,GAEJ,GAAI,KAAK,MAAM,KAAK,IAAI,GAAS,KAAK,KAClC,EAAS,GAAI,KAAK,IAAI,EAAG,CAAC,IAAM,GAClC,KACA,GAAK,GAEP,AAAI,EAAI,GAAS,EACf,GAAS,EAAK,EAEd,GAAS,EAAK,KAAK,IAAI,EAAG,EAAI,GAE5B,EAAQ,GAAK,GACf,KACA,GAAK,GAGP,AAAI,EAAI,GAAS,EACf,GAAI,EACJ,EAAI,GACC,AAAI,EAAI,GAAS,EACtB,GAAM,GAAQ,EAAK,GAAK,KAAK,IAAI,EAAG,GACpC,EAAI,EAAI,GAER,GAAI,EAAQ,KAAK,IAAI,EAAG,EAAQ,GAAK,KAAK,IAAI,EAAG,GACjD,EAAI,IAID,GAAQ,EAAG,EAAO,EAAS,GAAK,EAAI,IAAM,GAAK,EAAG,GAAK,IAAK,GAAQ,EAAG,CAI9E,IAFA,EAAK,GAAK,EAAQ,EAClB,GAAQ,EACD,EAAO,EAAG,EAAO,EAAS,GAAK,EAAI,IAAM,GAAK,EAAG,GAAK,IAAK,GAAQ,EAAG,CAE7E,EAAO,EAAS,EAAI,IAAM,EAAI,OCnFhC,uBAAI,IAAQ,GAER,GAAa,WACb,GAAa,iBAEjB,YAAwB,EAAQ,CAC/B,SAAS,CAAC,EACN,EAAS,GACZ,GAAU,GAAS,YAAc,YAE3B,EAGR,YAAqB,EAAQ,CAC5B,QAAQ,OAAO,EAAS,IAAM,GAAU,GAAW,uBACnD,QAAQ,OAAO,KAAK,MAAM,KAAY,EAAQ,6BAC9C,GAAI,GAAO,EACP,EAAU,EAAS,WACnB,EAAM,EAAU,EAAK,GAAS,YAAc,WAAa,EAC7D,MAAI,GAAS,IACZ,GAAQ,GAAS,GAAQ,IAAa,IAEhC,CAAC,EAAM,GAGf,YAAoB,EAAQ,CAC3B,GAAI,EAAS,GACZ,MAAO,IAAY,GAEpB,GAAI,GAAK,GAAY,CAAC,GAClB,EAAO,GAAe,EAAG,IACzB,EAAM,GAAe,EAAG,IAC5B,MAAI,KAAQ,GACX,IAAQ,EACR,EAAM,GAGN,GAAO,EAED,CAAC,EAAM,GAGf,YAAkB,EAAM,EAAK,EAAQ,CACpC,MAAI,IAAW,GAAO,aAAgB,EACrC,GAAO,GAAe,GACtB,EAAM,GAAe,GACrB,QAAQ,OAAO,EAAO,QAAY,oBAC3B,CAAG,GAAQ,IAAa,GAAM,EAAM,IAG3C,SAAQ,OAAO,EAAO,QAAY,oBAC1B,EAAQ,IAAa,GAAM,GAIrC,GAAM,YAAc,SAAU,EAAQ,EAAQ,CAC7C,EAAS,GAAU,EACnB,GAAI,GAAO,EAAO,aAAa,GAC3B,EAAM,EAAO,aAAa,EAAS,GACvC,MAAO,IAAS,EAAM,EAAK,KAG5B,GAAM,YAAc,SAAU,EAAQ,EAAQ,CAC7C,EAAS,GAAU,EACnB,GAAI,GAAM,EAAO,aAAa,GAC1B,EAAO,EAAO,aAAa,EAAS,GACxC,MAAO,IAAS,EAAM,EAAK,KAG5B,GAAM,aAAe,SAAU,EAAQ,EAAQ,CAC9C,EAAS,GAAU,EACnB,GAAI,GAAO,EAAO,aAAa,GAC3B,EAAM,EAAO,aAAa,EAAS,GACvC,MAAO,IAAS,EAAM,EAAK,KAG5B,GAAM,aAAe,SAAU,EAAQ,EAAQ,CAC9C,EAAS,GAAU,EACnB,GAAI,GAAM,EAAO,aAAa,GAC1B,EAAO,EAAO,aAAa,EAAS,GACxC,MAAO,IAAS,EAAM,EAAK,KAG5B,GAAM,aAAe,SAAU,EAAQ,EAAQ,EAAQ,CACtD,EAAS,GAAU,EACnB,GAAI,GAAK,GAAW,GACpB,EAAO,cAAc,EAAG,GAAI,GAC5B,EAAO,cAAc,EAAG,GAAI,EAAS,IAGtC,GAAM,aAAe,SAAU,EAAQ,EAAQ,EAAQ,CACtD,EAAS,GAAU,EACnB,GAAI,GAAK,GAAW,GACpB,EAAO,cAAc,EAAG,GAAI,GAC5B,EAAO,cAAc,EAAG,GAAI,EAAS,IAGtC,GAAM,cAAgB,SAAU,EAAQ,EAAQ,EAAQ,CACvD,EAAS,GAAU,EACnB,GAAI,GAAK,GAAY,GACrB,EAAO,cAAc,EAAG,GAAI,GAC5B,EAAO,cAAc,EAAG,GAAI,EAAS,IAGtC,GAAM,cAAgB,SAAU,EAAQ,EAAQ,EAAQ,CACvD,EAAS,GAAU,EACnB,GAAI,GAAK,GAAY,GACrB,EAAO,cAAc,EAAG,GAAI,GAC5B,EAAO,cAAc,EAAG,GAAI,EAAS,IAGtC,GAAO,QAAU,KC/GjB,uBAAO,QAAU,GAEjB,GAAI,IAAM,IACN,GAAO,IACP,GAAS,CAAC,GACV,GAAM,KAAK,IAAI,EAAG,IAEtB,YAAgB,EAAK,EAAK,EAAQ,CAChC,EAAM,GAAO,GACb,EAAS,GAAU,EAGnB,OAFI,GAAY,EAEV,GAAO,IACX,EAAI,KAAa,EAAM,IAAQ,GAC/B,GAAO,IAET,KAAM,EAAM,IACV,EAAI,KAAa,EAAM,IAAQ,GAC/B,KAAS,EAEX,SAAI,GAAU,EAAM,EAEpB,GAAO,MAAQ,EAAS,EAAY,EAE7B,KCxBT,uBAAO,QAAU,GAEjB,GAAI,IAAM,IACN,GAAO,IAEX,YAAc,EAAK,EAAQ,CACzB,GAAI,GAAS,EACT,EAAS,GAAU,EACnB,EAAS,EACT,EAAU,EACV,EACA,EAAI,EAAI,OAEZ,EAAG,CACD,GAAI,GAAW,EACb,SAAK,MAAQ,EACP,GAAI,YAAW,2BAEvB,EAAI,EAAI,KACR,GAAO,EAAQ,GACV,GAAI,KAAS,EACb,GAAI,IAAQ,KAAK,IAAI,EAAG,GAC7B,GAAS,QACF,GAAK,IAEd,UAAK,MAAQ,EAAU,EAEhB,KC3BT,oBACA,GAAI,IAAK,KAAK,IAAI,EAAI,GAClB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IACjB,GAAK,KAAK,IAAI,EAAG,IAErB,GAAO,QAAU,SAAU,EAAO,CAChC,MACE,GAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACb,EAAQ,GAAK,EACA,MCtBjB,uBAAO,QAAU,CACb,OAAQ,KACR,OAAQ,KACR,eAAgB,QCHpB,4BAGA,GAAI,IAAa,MAAO,aAAe,aACtB,MAAO,cAAgB,aACvB,MAAO,aAAe,YAEvC,YAAc,EAAK,EAAK,CACtB,MAAO,QAAO,UAAU,eAAe,KAAK,EAAK,GAGnD,GAAQ,OAAS,SAAU,EAAkC,CAE3D,OADI,GAAU,MAAM,UAAU,MAAM,KAAK,UAAW,GAC7C,EAAQ,QAAQ,CACrB,GAAI,GAAS,EAAQ,QACrB,GAAI,EAAC,EAEL,IAAI,MAAO,IAAW,SACpB,KAAM,IAAI,WAAU,EAAS,sBAG/B,OAAS,KAAK,GACZ,AAAI,GAAK,EAAQ,IACf,GAAI,GAAK,EAAO,KAKtB,MAAO,IAKT,GAAQ,UAAY,SAAU,EAAK,EAAM,CACvC,MAAI,GAAI,SAAW,EAAe,EAC9B,EAAI,SAAmB,EAAI,SAAS,EAAG,GAC3C,GAAI,OAAS,EACN,IAIT,GAAI,IAAU,CACZ,SAAU,SAAU,EAAM,EAAK,EAAU,EAAK,EAAW,CACvD,GAAI,EAAI,UAAY,EAAK,SAAU,CACjC,EAAK,IAAI,EAAI,SAAS,EAAU,EAAW,GAAM,GACjD,OAGF,OAAS,GAAI,EAAG,EAAI,EAAK,IACvB,EAAK,EAAY,GAAK,EAAI,EAAW,IAIzC,cAAe,SAAU,EAAQ,CAC/B,GAAI,GAAG,EAAG,EAAK,EAAK,EAAO,EAI3B,IADA,EAAM,EACD,EAAI,EAAG,EAAI,EAAO,OAAQ,EAAI,EAAG,IACpC,GAAO,EAAO,GAAG,OAMnB,IAFA,EAAS,GAAI,YAAW,GACxB,EAAM,EACD,EAAI,EAAG,EAAI,EAAO,OAAQ,EAAI,EAAG,IACpC,EAAQ,EAAO,GACf,EAAO,IAAI,EAAO,GAClB,GAAO,EAAM,OAGf,MAAO,KAIP,GAAY,CACd,SAAU,SAAU,EAAM,EAAK,EAAU,EAAK,EAAW,CACvD,OAAS,GAAI,EAAG,EAAI,EAAK,IACvB,EAAK,EAAY,GAAK,EAAI,EAAW,IAIzC,cAAe,SAAU,EAAQ,CAC/B,MAAO,GAAG,OAAO,MAAM,GAAI,KAO/B,GAAQ,SAAW,SAAU,EAAI,CAC/B,AAAI,EACF,IAAQ,KAAQ,WAChB,GAAQ,MAAQ,YAChB,GAAQ,MAAQ,WAChB,GAAQ,OAAO,GAAS,KAExB,IAAQ,KAAQ,MAChB,GAAQ,MAAQ,MAChB,GAAQ,MAAQ,MAChB,GAAQ,OAAO,GAAS,MAI5B,GAAQ,SAAS,MCxGjB,4BAuBA,GAAI,IAAQ,KASR,GAAwB,EAIxB,GAAwB,EACxB,GAAwB,EAExB,GAAwB,EAK5B,YAAc,EAAK,CAAwB,OAAlB,GAAM,EAAI,OAAe,EAAE,GAAO,GAAK,EAAI,GAAO,EAI3E,GAAI,IAAe,EACf,GAAe,EACf,GAAe,EAGf,GAAe,EACf,GAAe,IAQf,GAAgB,GAGhB,GAAgB,IAGhB,GAAgB,GAAW,EAAI,GAG/B,GAAgB,GAGhB,GAAgB,GAGhB,GAAgB,EAAI,GAAU,EAG9B,GAAgB,GAGhB,GAAgB,GAQhB,GAAc,EAGd,GAAc,IAGd,GAAc,GAGd,GAAc,GAGd,GAAc,GAId,GACF,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAEvD,GACF,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAEhE,GACF,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAEnC,GACF,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAa3C,GAAgB,IAGhB,GAAgB,GAAI,OAAO,IAAU,GAAK,GAC9C,GAAK,IAOL,GAAI,IAAgB,GAAI,OAAM,GAAU,GACxC,GAAK,IAKL,GAAI,IAAgB,GAAI,OAAM,IAC9B,GAAK,IAML,GAAI,IAAgB,GAAI,OAAM,GAAY,GAAY,GACtD,GAAK,IAGL,GAAI,IAAgB,GAAI,OAAM,IAC9B,GAAK,IAGL,GAAI,IAAgB,GAAI,OAAM,IAC9B,GAAK,IAIL,YAAwB,EAAa,EAAY,EAAY,EAAO,EAAY,CAE9E,KAAK,YAAe,EACpB,KAAK,WAAe,EACpB,KAAK,WAAe,EACpB,KAAK,MAAe,EACpB,KAAK,WAAe,EAGpB,KAAK,UAAe,GAAe,EAAY,OAIjD,GAAI,IACA,GACA,GAGJ,YAAkB,EAAU,EAAW,CACrC,KAAK,SAAW,EAChB,KAAK,SAAW,EAChB,KAAK,UAAY,EAKnB,YAAgB,EAAM,CACpB,MAAO,GAAO,IAAM,GAAW,GAAQ,GAAW,IAAO,KAAS,IAQpE,YAAmB,EAAG,EAAG,CAGvB,EAAE,YAAY,EAAE,WAAc,EAAK,IACnC,EAAE,YAAY,EAAE,WAAc,IAAM,EAAK,IAQ3C,YAAmB,EAAG,EAAO,EAAQ,CACnC,AAAI,EAAE,SAAY,GAAW,EAC3B,GAAE,QAAW,GAAS,EAAE,SAAY,MACpC,GAAU,EAAG,EAAE,QACf,EAAE,OAAS,GAAU,GAAW,EAAE,SAClC,EAAE,UAAY,EAAS,IAEvB,GAAE,QAAW,GAAS,EAAE,SAAY,MACpC,EAAE,UAAY,GAKlB,YAAmB,EAAG,EAAG,EAAM,CAC7B,GAAU,EAAG,EAAK,EAAI,GAAa,EAAK,EAAI,EAAI,IASlD,YAAoB,EAAM,EAAK,CAC7B,GAAI,GAAM,EACV,EACE,IAAO,EAAO,EACd,KAAU,EACV,IAAQ,QACD,EAAE,EAAM,GACjB,MAAO,KAAQ,EAOjB,YAAkB,EAAG,CACnB,AAAI,EAAE,WAAa,GACjB,IAAU,EAAG,EAAE,QACf,EAAE,OAAS,EACX,EAAE,SAAW,GAEJ,EAAE,UAAY,GACvB,GAAE,YAAY,EAAE,WAAa,EAAE,OAAS,IACxC,EAAE,SAAW,EACb,EAAE,UAAY,GAelB,YAAoB,EAAG,EAGvB,CACE,GAAI,GAAkB,EAAK,SACvB,EAAkB,EAAK,SACvB,EAAkB,EAAK,UAAU,YACjC,EAAkB,EAAK,UAAU,UACjC,EAAkB,EAAK,UAAU,WACjC,EAAkB,EAAK,UAAU,WACjC,EAAkB,EAAK,UAAU,WACjC,EACA,EAAG,EACH,EACA,EACA,EACA,EAAW,EAEf,IAAK,EAAO,EAAG,GAAQ,GAAU,IAC/B,EAAE,SAAS,GAAQ,EAQrB,IAFA,EAAK,EAAE,KAAK,EAAE,UAAY,EAAI,GAAa,EAEtC,EAAI,EAAE,SAAW,EAAG,EAAI,GAAW,IAUtC,AATA,EAAI,EAAE,KAAK,GACX,EAAO,EAAK,EAAK,EAAI,EAAI,GAAa,EAAI,GAAa,EACnD,EAAO,GACT,GAAO,EACP,KAEF,EAAK,EAAI,EAAI,GAAa,EAGtB,IAAI,IAER,GAAE,SAAS,KACX,EAAQ,EACJ,GAAK,GACP,GAAQ,EAAM,EAAI,IAEpB,EAAI,EAAK,EAAI,GACb,EAAE,SAAW,EAAK,GAAO,GACrB,GACF,GAAE,YAAc,EAAK,GAAM,EAAI,EAAI,GAAa,KAGpD,GAAI,IAAa,EAMjB,GAAG,CAED,IADA,EAAO,EAAa,EACb,EAAE,SAAS,KAAU,GAAK,IACjC,EAAE,SAAS,KACX,EAAE,SAAS,EAAO,IAAM,EACxB,EAAE,SAAS,KAIX,GAAY,QACL,EAAW,GAOpB,IAAK,EAAO,EAAY,IAAS,EAAG,IAElC,IADA,EAAI,EAAE,SAAS,GACR,IAAM,GAEX,AADA,EAAI,EAAE,KAAK,EAAE,GACT,IAAI,IACJ,GAAK,EAAI,EAAI,KAAe,GAE9B,GAAE,SAAY,GAAO,EAAK,EAAI,EAAI,IAAc,EAAK,EAAI,GACzD,EAAK,EAAI,EAAI,GAAa,GAE5B,MAcN,YAAmB,EAAM,EAAU,EAInC,CACE,GAAI,GAAY,GAAI,OAAM,GAAW,GACjC,EAAO,EACP,EACA,EAKJ,IAAK,EAAO,EAAG,GAAQ,GAAU,IAC/B,EAAU,GAAQ,EAAQ,EAAO,EAAS,EAAO,IAAO,EAS1D,IAAK,EAAI,EAAI,GAAK,EAAU,IAAK,CAC/B,GAAI,GAAM,EAAK,EAAI,EAAI,GACvB,AAAI,IAAQ,GAEZ,GAAK,EAAI,GAAc,GAAW,EAAU,KAAQ,KAWxD,aAA0B,CACxB,GAAI,GACA,EACA,EACA,EACA,EACA,EAAW,GAAI,OAAM,GAAW,GAiBpC,IADA,EAAS,EACJ,EAAO,EAAG,EAAO,GAAe,EAAG,IAEtC,IADA,GAAY,GAAQ,EACf,EAAI,EAAG,EAAK,GAAK,GAAY,GAAQ,IACxC,GAAa,KAAY,EAY7B,IAJA,GAAa,EAAS,GAAK,EAG3B,EAAO,EACF,EAAO,EAAG,EAAO,GAAI,IAExB,IADA,GAAU,GAAQ,EACb,EAAI,EAAG,EAAK,GAAK,GAAY,GAAQ,IACxC,GAAW,KAAU,EAKzB,IADA,IAAS,EACF,EAAO,GAAS,IAErB,IADA,GAAU,GAAQ,GAAQ,EACrB,EAAI,EAAG,EAAK,GAAM,GAAY,GAAQ,EAAK,IAC9C,GAAW,IAAM,KAAU,EAM/B,IAAK,EAAO,EAAG,GAAQ,GAAU,IAC/B,EAAS,GAAQ,EAInB,IADA,EAAI,EACG,GAAK,KACV,GAAa,EAAI,EAAI,GAAa,EAClC,IACA,EAAS,KAEX,KAAO,GAAK,KACV,GAAa,EAAI,EAAI,GAAa,EAClC,IACA,EAAS,KAEX,KAAO,GAAK,KACV,GAAa,EAAI,EAAI,GAAa,EAClC,IACA,EAAS,KAEX,KAAO,GAAK,KACV,GAAa,EAAI,EAAI,GAAa,EAClC,IACA,EAAS,KASX,IAHA,GAAU,GAAc,GAAU,EAAG,GAGhC,EAAI,EAAG,EAAI,GAAS,IACvB,GAAa,EAAI,EAAI,GAAa,EAClC,GAAa,EAAI,GAAc,GAAW,EAAG,GAI/C,GAAgB,GAAI,IAAe,GAAc,GAAa,GAAW,EAAG,GAAS,IACrF,GAAgB,GAAI,IAAe,GAAc,GAAa,EAAY,GAAS,IACnF,GAAiB,GAAI,IAAe,GAAI,OAAM,GAAI,GAAc,EAAW,GAAU,IASvF,YAAoB,EAAG,CACrB,GAAI,GAGJ,IAAK,EAAI,EAAG,EAAI,GAAU,IAAO,EAAE,UAAU,EAAI,GAAc,EAC/D,IAAK,EAAI,EAAG,EAAI,GAAU,IAAO,EAAE,UAAU,EAAI,GAAc,EAC/D,IAAK,EAAI,EAAG,EAAI,GAAU,IAAO,EAAE,QAAQ,EAAI,GAAc,EAE7D,EAAE,UAAU,GAAY,GAAc,EACtC,EAAE,QAAU,EAAE,WAAa,EAC3B,EAAE,SAAW,EAAE,QAAU,EAO3B,YAAmB,EACnB,CACE,AAAI,EAAE,SAAW,EACf,GAAU,EAAG,EAAE,QACN,EAAE,SAAW,GAEtB,GAAE,YAAY,EAAE,WAAa,EAAE,QAEjC,EAAE,OAAS,EACX,EAAE,SAAW,EAOf,YAAoB,EAAG,EAAK,EAAK,EAKjC,CACE,GAAU,GAEN,GACF,IAAU,EAAG,GACb,GAAU,EAAG,CAAC,IAKhB,GAAM,SAAS,EAAE,YAAa,EAAE,OAAQ,EAAK,EAAK,EAAE,SACpD,EAAE,SAAW,EAOf,YAAiB,EAAM,EAAG,EAAG,EAAO,CAClC,GAAI,GAAM,EAAI,EACV,EAAM,EAAI,EACd,MAAQ,GAAK,GAAgB,EAAK,IAC1B,EAAK,KAAkB,EAAK,IAAiB,EAAM,IAAM,EAAM,GASzE,YAAoB,EAAG,EAAM,EAI7B,CAGE,OAFI,GAAI,EAAE,KAAK,GACX,EAAI,GAAK,EACN,GAAK,EAAE,UAER,GAAI,EAAE,UACR,GAAQ,EAAM,EAAE,KAAK,EAAI,GAAI,EAAE,KAAK,GAAI,EAAE,QAC1C,IAGE,IAAQ,EAAM,EAAG,EAAE,KAAK,GAAI,EAAE,SAGlC,EAAE,KAAK,GAAK,EAAE,KAAK,GACnB,EAAI,EAGJ,IAAM,EAER,EAAE,KAAK,GAAK,EAUd,YAAwB,EAAG,EAAO,EAIlC,CACE,GAAI,GACA,EACA,EAAK,EACL,EACA,EAEJ,GAAI,EAAE,WAAa,EACjB,EACE,GAAQ,EAAE,YAAY,EAAE,MAAQ,EAAK,IAAM,EAAM,EAAE,YAAY,EAAE,MAAQ,EAAK,EAAI,GAClF,EAAK,EAAE,YAAY,EAAE,MAAQ,GAC7B,IAEA,AAAI,IAAS,EACX,GAAU,EAAG,EAAI,GAIjB,GAAO,GAAa,GACpB,GAAU,EAAG,EAAO,GAAW,EAAG,GAClC,EAAQ,GAAY,GAChB,IAAU,GACZ,IAAM,GAAY,GAClB,GAAU,EAAG,EAAI,IAEnB,IACA,EAAO,GAAO,GAGd,GAAU,EAAG,EAAM,GACnB,EAAQ,GAAY,GAChB,IAAU,GACZ,IAAQ,GAAU,GAClB,GAAU,EAAG,EAAM,WAQhB,EAAK,EAAE,UAGlB,GAAU,EAAG,GAAW,GAY1B,YAAoB,EAAG,EAGvB,CACE,GAAI,GAAW,EAAK,SAChB,EAAW,EAAK,UAAU,YAC1B,EAAY,EAAK,UAAU,UAC3B,EAAW,EAAK,UAAU,MAC1B,EAAG,EACH,EAAW,GACX,EASJ,IAHA,EAAE,SAAW,EACb,EAAE,SAAW,GAER,EAAI,EAAG,EAAI,EAAO,IACrB,AAAI,EAAK,EAAI,KAAgB,EAC3B,GAAE,KAAK,EAAE,EAAE,UAAY,EAAW,EAClC,EAAE,MAAM,GAAK,GAGb,EAAK,EAAI,EAAI,GAAa,EAS9B,KAAO,EAAE,SAAW,GAClB,EAAO,EAAE,KAAK,EAAE,EAAE,UAAa,EAAW,EAAI,EAAE,EAAW,EAC3D,EAAK,EAAO,GAAc,EAC1B,EAAE,MAAM,GAAQ,EAChB,EAAE,UAEE,GACF,GAAE,YAAc,EAAM,EAAO,EAAI,IASrC,IALA,EAAK,SAAW,EAKX,EAAK,EAAE,UAAY,EAAc,GAAK,EAAG,IAAO,GAAW,EAAG,EAAM,GAKzE,EAAO,EACP,EAGE,GAAI,EAAE,KAAK,GACX,EAAE,KAAK,GAAiB,EAAE,KAAK,EAAE,YACjC,GAAW,EAAG,EAAM,GAGpB,EAAI,EAAE,KAAK,GAEX,EAAE,KAAK,EAAE,EAAE,UAAY,EACvB,EAAE,KAAK,EAAE,EAAE,UAAY,EAGvB,EAAK,EAAO,GAAc,EAAK,EAAI,GAAc,EAAK,EAAI,GAC1D,EAAE,MAAM,GAAS,GAAE,MAAM,IAAM,EAAE,MAAM,GAAK,EAAE,MAAM,GAAK,EAAE,MAAM,IAAM,EACvE,EAAK,EAAI,EAAI,GAAa,EAAK,EAAI,EAAI,GAAa,EAGpD,EAAE,KAAK,GAAiB,IACxB,GAAW,EAAG,EAAM,SAEb,EAAE,UAAY,GAEvB,EAAE,KAAK,EAAE,EAAE,UAAY,EAAE,KAAK,GAK9B,GAAW,EAAG,GAGd,GAAU,EAAM,EAAU,EAAE,UAQ9B,YAAmB,EAAG,EAAM,EAI5B,CACE,GAAI,GACA,EAAU,GACV,EAEA,EAAU,EAAK,EAAI,EAAI,GAEvB,EAAQ,EACR,EAAY,EACZ,EAAY,EAQhB,IANI,IAAY,GACd,GAAY,IACZ,EAAY,GAEd,EAAM,GAAW,GAAK,EAAI,GAAa,MAElC,EAAI,EAAG,GAAK,EAAU,IAIzB,AAHA,EAAS,EACT,EAAU,EAAM,GAAI,GAAK,EAAI,GAEzB,IAAE,EAAQ,GAAa,IAAW,IAG/B,CAAI,EAAQ,EACjB,EAAE,QAAQ,EAAS,IAAe,EAE7B,AAAI,IAAW,EAEhB,KAAW,GAAW,EAAE,QAAQ,EAAS,KAC7C,EAAE,QAAQ,GAAU,MAEf,AAAI,GAAS,GAClB,EAAE,QAAQ,GAAY,KAGtB,EAAE,QAAQ,GAAc,KAG1B,EAAQ,EACR,EAAU,EAEV,AAAI,IAAY,EACd,GAAY,IACZ,EAAY,GAEP,AAAI,IAAW,EACpB,GAAY,EACZ,EAAY,GAGZ,GAAY,EACZ,EAAY,IAUlB,YAAmB,EAAG,EAAM,EAI5B,CACE,GAAI,GACA,EAAU,GACV,EAEA,EAAU,EAAK,EAAI,EAAI,GAEvB,EAAQ,EACR,EAAY,EACZ,EAAY,EAQhB,IALI,IAAY,GACd,GAAY,IACZ,EAAY,GAGT,EAAI,EAAG,GAAK,EAAU,IAIzB,GAHA,EAAS,EACT,EAAU,EAAM,GAAI,GAAK,EAAI,GAEzB,IAAE,EAAQ,GAAa,IAAW,GAG/B,IAAI,EAAQ,EACjB,EAAK,IAAU,EAAG,EAAQ,EAAE,eAAmB,EAAE,GAAU,OAEtD,AAAI,KAAW,EAChB,KAAW,GACb,IAAU,EAAG,EAAQ,EAAE,SACvB,KAGF,GAAU,EAAG,GAAS,EAAE,SACxB,GAAU,EAAG,EAAQ,EAAG,IAEnB,AAAI,GAAS,GAClB,IAAU,EAAG,GAAW,EAAE,SAC1B,GAAU,EAAG,EAAQ,EAAG,IAGxB,IAAU,EAAG,GAAa,EAAE,SAC5B,GAAU,EAAG,EAAQ,GAAI,IAG3B,EAAQ,EACR,EAAU,EACV,AAAI,IAAY,EACd,GAAY,IACZ,EAAY,GAEP,AAAI,IAAW,EACpB,GAAY,EACZ,EAAY,GAGZ,GAAY,EACZ,EAAY,IAUlB,YAAuB,EAAG,CACxB,GAAI,GAgBJ,IAbA,GAAU,EAAG,EAAE,UAAW,EAAE,OAAO,UACnC,GAAU,EAAG,EAAE,UAAW,EAAE,OAAO,UAGnC,GAAW,EAAG,EAAE,SASX,EAAc,GAAW,EAAG,GAAe,GAC1C,EAAE,QAAQ,GAAS,GAAe,EAAI,KAAe,EADR,IACjD,CAKF,SAAE,SAAW,EAAK,GAAc,GAAK,EAAI,EAAI,EAItC,EAST,YAAwB,EAAG,EAAQ,EAAQ,EAG3C,CACE,GAAI,GASJ,IAHA,GAAU,EAAG,EAAS,IAAK,GAC3B,GAAU,EAAG,EAAS,EAAK,GAC3B,GAAU,EAAG,EAAU,EAAI,GACtB,EAAO,EAAG,EAAO,EAAS,IAE7B,GAAU,EAAG,EAAE,QAAQ,GAAS,GAAQ,EAAI,GAAY,GAI1D,GAAU,EAAG,EAAE,UAAW,EAAS,GAGnC,GAAU,EAAG,EAAE,UAAW,EAAS,GAkBrC,YAA0B,EAAG,CAK3B,GAAI,GAAa,WACb,EAGJ,IAAK,EAAI,EAAG,GAAK,GAAI,IAAK,KAAgB,EACxC,GAAK,EAAa,GAAO,EAAE,UAAU,EAAI,KAAgB,EACvD,MAAO,IAKX,GAAI,EAAE,UAAU,EAAI,KAAgB,GAAK,EAAE,UAAU,GAAK,KAAgB,GACtE,EAAE,UAAU,GAAK,KAAgB,EACnC,MAAO,IAET,IAAK,EAAI,GAAI,EAAI,GAAU,IACzB,GAAI,EAAE,UAAU,EAAI,KAAgB,EAClC,MAAO,IAOX,MAAO,IAIT,GAAI,IAAmB,GAKvB,YAAkB,EAClB,CAEE,AAAK,IACH,MACA,GAAmB,IAGrB,EAAE,OAAU,GAAI,IAAS,EAAE,UAAW,IACtC,EAAE,OAAU,GAAI,IAAS,EAAE,UAAW,IACtC,EAAE,QAAU,GAAI,IAAS,EAAE,QAAS,IAEpC,EAAE,OAAS,EACX,EAAE,SAAW,EAGb,GAAW,GAOb,YAA0B,EAAG,EAAK,EAAY,EAK9C,CACE,GAAU,EAAI,KAAgB,GAAM,GAAO,EAAI,GAAI,GACnD,GAAW,EAAG,EAAK,EAAY,IAQjC,YAAmB,EAAG,CACpB,GAAU,EAAG,IAAgB,EAAG,GAChC,GAAU,EAAG,GAAW,IACxB,GAAS,GAQX,YAAyB,EAAG,EAAK,EAAY,EAK7C,CACE,GAAI,GAAU,EACV,EAAc,EAGlB,AAAI,EAAE,MAAQ,EAGR,GAAE,KAAK,YAAc,IACvB,GAAE,KAAK,UAAY,GAAiB,IAItC,GAAW,EAAG,EAAE,QAIhB,GAAW,EAAG,EAAE,QAUhB,EAAc,GAAc,GAG5B,EAAY,EAAE,QAAU,EAAI,IAAO,EACnC,EAAe,EAAE,WAAa,EAAI,IAAO,EAMrC,GAAe,GAAY,GAAW,IAI1C,EAAW,EAAc,EAAa,EAGxC,AAAK,EAAa,GAAK,GAAc,IAAQ,GAS3C,GAAiB,EAAG,EAAK,EAAY,GAEhC,AAAI,EAAE,WAAa,IAAW,IAAgB,EAEnD,IAAU,EAAI,KAAgB,GAAM,GAAO,EAAI,GAAI,GACnD,GAAe,EAAG,GAAc,KAGhC,IAAU,EAAI,KAAa,GAAM,GAAO,EAAI,GAAI,GAChD,GAAe,EAAG,EAAE,OAAO,SAAW,EAAG,EAAE,OAAO,SAAW,EAAG,EAAc,GAC9E,GAAe,EAAG,EAAE,UAAW,EAAE,YAMnC,GAAW,GAEP,GACF,GAAU,GAUd,YAAmB,EAAG,EAAM,EAI5B,CAGE,SAAE,YAAY,EAAE,MAAQ,EAAE,SAAW,GAAU,IAAS,EAAK,IAC7D,EAAE,YAAY,EAAE,MAAQ,EAAE,SAAW,EAAI,GAAK,EAAO,IAErD,EAAE,YAAY,EAAE,MAAQ,EAAE,UAAY,EAAK,IAC3C,EAAE,WAEF,AAAI,IAAS,EAEX,EAAE,UAAU,EAAK,KAEjB,GAAE,UAEF,IAKA,EAAE,UAAW,IAAa,GAAM,GAAW,GAAK,KAChD,EAAE,UAAU,GAAO,GAAQ,MA0BrB,EAAE,WAAa,EAAE,YAAc,EAOzC,GAAQ,SAAY,GACpB,GAAQ,iBAAmB,GAC3B,GAAQ,gBAAmB,GAC3B,GAAQ,UAAY,GACpB,GAAQ,UAAY,KCrsCpB,iCAyBA,YAAiB,EAAO,EAAK,EAAK,EAAK,CAKrC,OAJI,GAAM,EAAQ,MAAS,EACvB,EAAO,IAAU,GAAM,MAAS,EAChC,EAAI,EAED,IAAQ,GAAG,CAIhB,EAAI,EAAM,IAAO,IAAO,EACxB,GAAO,EAEP,EACE,GAAM,EAAK,EAAI,KAAS,EACxB,EAAM,EAAK,EAAK,QACT,EAAE,GAEX,GAAM,MACN,GAAM,MAGR,MAAQ,GAAM,GAAM,GAAM,EAI5B,GAAO,QAAU,KClDjB,iCA0BA,aAAqB,CAGnB,OAFI,GAAG,EAAQ,GAEN,EAAI,EAAG,EAAI,IAAK,IAAK,CAC5B,EAAI,EACJ,OAAS,GAAI,EAAG,EAAI,EAAG,IACrB,EAAM,EAAI,EAAM,WAAc,IAAM,EAAO,IAAM,EAEnD,EAAM,GAAK,EAGb,MAAO,GAIT,GAAI,IAAW,KAGf,YAAe,EAAK,EAAK,EAAK,EAAK,CACjC,GAAI,GAAI,GACJ,EAAM,EAAM,EAEhB,GAAO,GAEP,OAAS,GAAI,EAAK,EAAI,EAAK,IACzB,EAAO,IAAQ,EAAK,EAAG,GAAM,EAAI,IAAM,KAGzC,MAAQ,GAAO,GAIjB,GAAO,QAAU,KC1DjB,iCAqBA,GAAO,QAAU,CACf,EAAQ,kBACR,EAAQ,aACR,EAAQ,GACR,KAAQ,aACR,KAAQ,eACR,KAAQ,aACR,KAAQ,sBACR,KAAQ,eACR,KAAQ,0BC9BV,4BAqBA,GAAI,IAAU,KACV,GAAU,KACV,GAAU,KACV,GAAU,KACV,GAAU,KAOV,GAAkB,EAClB,GAAkB,EAElB,GAAkB,EAClB,GAAkB,EAClB,GAAkB,EAOlB,GAAkB,EAClB,GAAkB,EAGlB,GAAkB,GAClB,GAAkB,GAElB,GAAkB,GAQlB,GAAwB,GAGxB,GAAwB,EACxB,GAAwB,EACxB,GAAwB,EACxB,GAAwB,EACxB,GAAwB,EAMxB,GAAwB,EAIxB,GAAc,EAKd,GAAgB,EAEhB,GAAY,GAEZ,GAAgB,EAGhB,GAAgB,GAEhB,GAAgB,IAEhB,GAAgB,GAAW,EAAI,GAE/B,GAAgB,GAEhB,GAAgB,GAEhB,GAAgB,EAAI,GAAU,EAE9B,GAAY,GAGZ,GAAY,EACZ,GAAY,IACZ,GAAiB,GAAY,GAAY,EAEzC,GAAc,GAEd,GAAa,GACb,GAAc,GACd,GAAa,GACb,GAAgB,GAChB,GAAa,IACb,GAAa,IACb,GAAe,IAEf,GAAoB,EACpB,GAAoB,EACpB,GAAoB,EACpB,GAAoB,EAEpB,GAAU,EAEd,YAAa,EAAM,EAAW,CAC5B,SAAK,IAAM,GAAI,GACR,EAGT,YAAc,EAAG,CACf,MAAS,IAAM,GAAO,GAAK,EAAI,EAAI,GAGrC,YAAc,EAAK,CAAwB,OAAlB,GAAM,EAAI,OAAe,EAAE,GAAO,GAAK,EAAI,GAAO,EAS3E,YAAuB,EAAM,CAC3B,GAAI,GAAI,EAAK,MAGT,EAAM,EAAE,QAIZ,AAHI,EAAM,EAAK,WACb,GAAM,EAAK,WAET,IAAQ,GAEZ,IAAM,SAAS,EAAK,OAAQ,EAAE,YAAa,EAAE,YAAa,EAAK,EAAK,UACpE,EAAK,UAAY,EACjB,EAAE,aAAe,EACjB,EAAK,WAAa,EAClB,EAAK,WAAa,EAClB,EAAE,SAAW,EACT,EAAE,UAAY,GAChB,GAAE,YAAc,IAKpB,YAA0B,EAAG,EAAM,CACjC,GAAM,gBAAgB,EAAI,EAAE,aAAe,EAAI,EAAE,YAAc,GAAK,EAAE,SAAW,EAAE,YAAa,GAChG,EAAE,YAAc,EAAE,SAClB,GAAc,EAAE,MAIlB,YAAkB,EAAG,EAAG,CACtB,EAAE,YAAY,EAAE,WAAa,EAS/B,YAAqB,EAAG,EAAG,CAGzB,EAAE,YAAY,EAAE,WAAc,IAAM,EAAK,IACzC,EAAE,YAAY,EAAE,WAAa,EAAI,IAWnC,YAAkB,EAAM,EAAK,EAAO,EAAM,CACxC,GAAI,GAAM,EAAK,SAGf,MADI,GAAM,GAAQ,GAAM,GACpB,IAAQ,EAAY,EAExB,GAAK,UAAY,EAGjB,GAAM,SAAS,EAAK,EAAK,MAAO,EAAK,QAAS,EAAK,GACnD,AAAI,EAAK,MAAM,OAAS,EACtB,EAAK,MAAQ,GAAQ,EAAK,MAAO,EAAK,EAAK,GAGpC,EAAK,MAAM,OAAS,GAC3B,GAAK,MAAQ,GAAM,EAAK,MAAO,EAAK,EAAK,IAG3C,EAAK,SAAW,EAChB,EAAK,UAAY,EAEV,GAaT,YAAuB,EAAG,EAAW,CACnC,GAAI,GAAe,EAAE,iBACjB,EAAO,EAAE,SACT,EACA,EACA,EAAW,EAAE,YACb,EAAa,EAAE,WACf,EAAS,EAAE,SAAY,EAAE,OAAS,GAClC,EAAE,SAAY,GAAE,OAAS,IAAiB,EAE1C,EAAO,EAAE,OAET,EAAQ,EAAE,OACV,EAAQ,EAAE,KAMV,EAAS,EAAE,SAAW,GACtB,EAAa,EAAK,EAAO,EAAW,GACpC,EAAa,EAAK,EAAO,GAQ7B,AAAI,EAAE,aAAe,EAAE,YACrB,KAAiB,GAKf,EAAa,EAAE,WAAa,GAAa,EAAE,WAI/C,EAaE,IAXA,EAAQ,EAWJ,IAAK,EAAQ,KAAkB,GAC/B,EAAK,EAAQ,EAAW,KAAO,GAC/B,EAAK,KAA0B,EAAK,IACpC,EAAK,EAAE,KAAwB,EAAK,EAAO,IAU/C,IAAQ,EACR,IAMA,EAAG,OAEM,EAAK,EAAE,KAAU,EAAK,EAAE,IAAU,EAAK,EAAE,KAAU,EAAK,EAAE,IAC1D,EAAK,EAAE,KAAU,EAAK,EAAE,IAAU,EAAK,EAAE,KAAU,EAAK,EAAE,IAC1D,EAAK,EAAE,KAAU,EAAK,EAAE,IAAU,EAAK,EAAE,KAAU,EAAK,EAAE,IAC1D,EAAK,EAAE,KAAU,EAAK,EAAE,IAAU,EAAK,EAAE,KAAU,EAAK,EAAE,IAC1D,EAAO,GAOhB,GAHA,EAAM,GAAa,GAAS,GAC5B,EAAO,EAAS,GAEZ,EAAM,EAAU,CAGlB,GAFA,EAAE,YAAc,EAChB,EAAW,EACP,GAAO,EACT,MAEF,EAAa,EAAK,EAAO,EAAW,GACpC,EAAa,EAAK,EAAO,UAEnB,GAAY,EAAK,EAAY,IAAU,GAAS,EAAE,GAAiB,GAE7E,MAAI,IAAY,EAAE,UACT,EAEF,EAAE,UAcX,YAAqB,EAAG,CACtB,GAAI,GAAU,EAAE,OACZ,EAAG,EAAG,EAAG,EAAM,EAInB,EAAG,CAqBD,GApBA,EAAO,EAAE,YAAc,EAAE,UAAY,EAAE,SAoBnC,EAAE,UAAY,EAAW,GAAU,IAAgB,CAErD,GAAM,SAAS,EAAE,OAAQ,EAAE,OAAQ,EAAS,EAAS,GACrD,EAAE,aAAe,EACjB,EAAE,UAAY,EAEd,EAAE,aAAe,EASjB,EAAI,EAAE,UACN,EAAI,EACJ,EACE,GAAI,EAAE,KAAK,EAAE,GACb,EAAE,KAAK,GAAM,GAAK,EAAU,EAAI,EAAU,QACnC,EAAE,GAEX,EAAI,EACJ,EAAI,EACJ,EACE,GAAI,EAAE,KAAK,EAAE,GACb,EAAE,KAAK,GAAM,GAAK,EAAU,EAAI,EAAU,QAInC,EAAE,GAEX,GAAQ,EAEV,GAAI,EAAE,KAAK,WAAa,EACtB,MAmBF,GAJA,EAAI,GAAS,EAAE,KAAM,EAAE,OAAQ,EAAE,SAAW,EAAE,UAAW,GACzD,EAAE,WAAa,EAGX,EAAE,UAAY,EAAE,QAAU,GAS5B,IARA,EAAM,EAAE,SAAW,EAAE,OACrB,EAAE,MAAQ,EAAE,OAAO,GAGnB,EAAE,MAAU,GAAE,OAAS,EAAE,WAAc,EAAE,OAAO,EAAM,IAAM,EAAE,UAIvD,EAAE,QAEP,GAAE,MAAU,GAAE,OAAS,EAAE,WAAc,EAAE,OAAO,EAAM,GAAY,IAAM,EAAE,UAE1E,EAAE,KAAK,EAAM,EAAE,QAAU,EAAE,KAAK,EAAE,OAClC,EAAE,KAAK,EAAE,OAAS,EAClB,IACA,EAAE,SACE,IAAE,UAAY,EAAE,OAAS,MAA7B,QASG,EAAE,UAAY,IAAiB,EAAE,KAAK,WAAa,GAiD9D,YAAwB,EAAG,EAAO,CAIhC,GAAI,GAAiB,MAOrB,IALI,EAAiB,EAAE,iBAAmB,GACxC,GAAiB,EAAE,iBAAmB,KAI/B,CAEP,GAAI,EAAE,WAAa,EAAG,CAUpB,GADA,GAAY,GACR,EAAE,YAAc,GAAK,IAAU,GACjC,MAAO,IAGT,GAAI,EAAE,YAAc,EAClB,MAOJ,EAAE,UAAY,EAAE,UAChB,EAAE,UAAY,EAGd,GAAI,GAAY,EAAE,YAAc,EAkBhC,GAhBI,GAAE,WAAa,GAAK,EAAE,UAAY,IAEpC,GAAE,UAAY,EAAE,SAAW,EAC3B,EAAE,SAAW,EAEb,GAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,IAUvB,EAAE,SAAW,EAAE,aAAgB,EAAE,OAAS,IAE5C,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GACvB,MAAO,IAQb,MAFA,GAAE,OAAS,EAEP,IAAU,GAEZ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,EAChB,GAGF,IAGL,GAAE,SAAW,EAAE,aAEjB,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GAChB,IAeb,YAAsB,EAAG,EAAO,CAI9B,OAHI,GACA,IAEK,CAMP,GAAI,EAAE,UAAY,GAAe,CAE/B,GADA,GAAY,GACR,EAAE,UAAY,IAAiB,IAAU,GAC3C,MAAO,IAET,GAAI,EAAE,YAAc,EAClB,MA2BJ,GApBA,EAAY,EACR,EAAE,WAAa,IAEjB,GAAE,MAAU,GAAE,OAAS,EAAE,WAAc,EAAE,OAAO,EAAE,SAAW,GAAY,IAAM,EAAE,UACjF,EAAY,EAAE,KAAK,EAAE,SAAW,EAAE,QAAU,EAAE,KAAK,EAAE,OACrD,EAAE,KAAK,EAAE,OAAS,EAAE,UAOlB,IAAc,GAAc,EAAE,SAAW,GAAe,EAAE,OAAS,IAKrE,GAAE,aAAe,GAAc,EAAG,IAGhC,EAAE,cAAgB,GAYpB,GAPA,EAAS,GAAM,UAAU,EAAG,EAAE,SAAW,EAAE,YAAa,EAAE,aAAe,IAEzE,EAAE,WAAa,EAAE,aAKb,EAAE,cAAgB,EAAE,gBAAuC,EAAE,WAAa,GAAW,CACvF,EAAE,eACF,EACE,GAAE,WAEF,EAAE,MAAU,GAAE,OAAS,EAAE,WAAc,EAAE,OAAO,EAAE,SAAW,GAAY,IAAM,EAAE,UACjF,EAAY,EAAE,KAAK,EAAE,SAAW,EAAE,QAAU,EAAE,KAAK,EAAE,OACrD,EAAE,KAAK,EAAE,OAAS,EAAE,eAKb,EAAE,EAAE,cAAiB,GAC9B,EAAE,eAGF,GAAE,UAAY,EAAE,aAChB,EAAE,aAAe,EACjB,EAAE,MAAQ,EAAE,OAAO,EAAE,UAErB,EAAE,MAAU,GAAE,OAAS,EAAE,WAAc,EAAE,OAAO,EAAE,SAAW,IAAM,EAAE,cAavE,GAAS,GAAM,UAAU,EAAG,EAAG,EAAE,OAAO,EAAE,WAE1C,EAAE,YACF,EAAE,WAEJ,GAAI,GAEF,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GACvB,MAAO,IAMb,MADA,GAAE,OAAW,EAAE,SAAY,GAAY,EAAM,EAAE,SAAW,GAAY,EAClE,IAAU,GAEZ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,EAChB,GAGF,IAEL,EAAE,UAEJ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GAChB,GAIJ,GAQT,YAAsB,EAAG,EAAO,CAO9B,OANI,GACA,EAEA,IAGK,CAMP,GAAI,EAAE,UAAY,GAAe,CAE/B,GADA,GAAY,GACR,EAAE,UAAY,IAAiB,IAAU,GAC3C,MAAO,IAET,GAAI,EAAE,YAAc,EAAK,MA0C3B,GApCA,EAAY,EACR,EAAE,WAAa,IAEjB,GAAE,MAAU,GAAE,OAAS,EAAE,WAAc,EAAE,OAAO,EAAE,SAAW,GAAY,IAAM,EAAE,UACjF,EAAY,EAAE,KAAK,EAAE,SAAW,EAAE,QAAU,EAAE,KAAK,EAAE,OACrD,EAAE,KAAK,EAAE,OAAS,EAAE,UAMtB,EAAE,YAAc,EAAE,aAClB,EAAE,WAAa,EAAE,YACjB,EAAE,aAAe,GAAY,EAEzB,IAAc,GAAY,EAAE,YAAc,EAAE,gBAC5C,EAAE,SAAW,GAAc,EAAE,OAAS,IAKxC,GAAE,aAAe,GAAc,EAAG,GAG9B,EAAE,cAAgB,GAClB,GAAE,WAAa,IAAe,EAAE,eAAiB,IAAa,EAAE,SAAW,EAAE,YAAc,OAK7F,GAAE,aAAe,GAAY,IAM7B,EAAE,aAAe,IAAa,EAAE,cAAgB,EAAE,YAAa,CACjE,EAAa,EAAE,SAAW,EAAE,UAAY,GAOxC,EAAS,GAAM,UAAU,EAAG,EAAE,SAAW,EAAI,EAAE,WAAY,EAAE,YAAc,IAM3E,EAAE,WAAa,EAAE,YAAc,EAC/B,EAAE,aAAe,EACjB,EACE,AAAI,EAAE,EAAE,UAAY,GAElB,GAAE,MAAU,GAAE,OAAS,EAAE,WAAc,EAAE,OAAO,EAAE,SAAW,GAAY,IAAM,EAAE,UACjF,EAAY,EAAE,KAAK,EAAE,SAAW,EAAE,QAAU,EAAE,KAAK,EAAE,OACrD,EAAE,KAAK,EAAE,OAAS,EAAE,gBAGf,EAAE,EAAE,aAAgB,GAK7B,GAJA,EAAE,gBAAkB,EACpB,EAAE,aAAe,GAAY,EAC7B,EAAE,WAEE,GAEF,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GACvB,MAAO,YAKF,EAAE,iBAgBX,GATA,EAAS,GAAM,UAAU,EAAG,EAAG,EAAE,OAAO,EAAE,SAAW,IAEjD,GAEF,GAAiB,EAAG,IAGtB,EAAE,WACF,EAAE,YACE,EAAE,KAAK,YAAc,EACvB,MAAO,QAMT,GAAE,gBAAkB,EACpB,EAAE,WACF,EAAE,YAYN,MARI,GAAE,iBAGJ,GAAS,GAAM,UAAU,EAAG,EAAG,EAAE,OAAO,EAAE,SAAW,IAErD,EAAE,gBAAkB,GAEtB,EAAE,OAAS,EAAE,SAAW,GAAY,EAAI,EAAE,SAAW,GAAY,EAC7D,IAAU,GAEZ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,EAChB,GAGF,IAEL,EAAE,UAEJ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GAChB,GAKJ,GAST,YAAqB,EAAG,EAAO,CAO7B,OANI,GACA,EACA,EAAM,EAEN,EAAO,EAAE,SAEJ,CAKP,GAAI,EAAE,WAAa,GAAW,CAE5B,GADA,GAAY,GACR,EAAE,WAAa,IAAa,IAAU,GACxC,MAAO,IAET,GAAI,EAAE,YAAc,EAAK,MAK3B,GADA,EAAE,aAAe,EACb,EAAE,WAAa,IAAa,EAAE,SAAW,GAC3C,GAAO,EAAE,SAAW,EACpB,EAAO,EAAK,GACR,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IAAO,CAC3E,EAAS,EAAE,SAAW,GACtB,EAAG,OAEM,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IACzC,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IACzC,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IACzC,IAAS,EAAK,EAAE,IAAS,IAAS,EAAK,EAAE,IACzC,EAAO,GAChB,EAAE,aAAe,GAAa,GAAS,GACnC,EAAE,aAAe,EAAE,WACrB,GAAE,aAAe,EAAE,WAyBzB,GAlBA,AAAI,EAAE,cAAgB,GAIpB,GAAS,GAAM,UAAU,EAAG,EAAG,EAAE,aAAe,IAEhD,EAAE,WAAa,EAAE,aACjB,EAAE,UAAY,EAAE,aAChB,EAAE,aAAe,GAKjB,GAAS,GAAM,UAAU,EAAG,EAAG,EAAE,OAAO,EAAE,WAE1C,EAAE,YACF,EAAE,YAEA,GAEF,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GACvB,MAAO,IAMb,MADA,GAAE,OAAS,EACP,IAAU,GAEZ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,EAChB,GAGF,IAEL,EAAE,UAEJ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GAChB,GAIJ,GAOT,YAAsB,EAAG,EAAO,CAG9B,OAFI,KAEK,CAEP,GAAI,EAAE,YAAc,GAClB,IAAY,GACR,EAAE,YAAc,GAAG,CACrB,GAAI,IAAU,GACZ,MAAO,IAET,MAWJ,GANA,EAAE,aAAe,EAGjB,EAAS,GAAM,UAAU,EAAG,EAAG,EAAE,OAAO,EAAE,WAC1C,EAAE,YACF,EAAE,WACE,GAEF,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GACvB,MAAO,IAMb,MADA,GAAE,OAAS,EACP,IAAU,GAEZ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,EAChB,GAGF,IAEL,EAAE,UAEJ,IAAiB,EAAG,IAChB,EAAE,KAAK,YAAc,GAChB,GAIJ,GAQT,YAAgB,EAAa,EAAU,EAAa,EAAW,EAAM,CACnE,KAAK,YAAc,EACnB,KAAK,SAAW,EAChB,KAAK,YAAc,EACnB,KAAK,UAAY,EACjB,KAAK,KAAO,EAGd,GAAI,IAEJ,GAAsB,CAEpB,GAAI,IAAO,EAAG,EAAG,EAAG,EAAG,IACvB,GAAI,IAAO,EAAG,EAAG,EAAG,EAAG,IACvB,GAAI,IAAO,EAAG,EAAG,GAAI,EAAG,IACxB,GAAI,IAAO,EAAG,EAAG,GAAI,GAAI,IAEzB,GAAI,IAAO,EAAG,EAAG,GAAI,GAAI,IACzB,GAAI,IAAO,EAAG,GAAI,GAAI,GAAI,IAC1B,GAAI,IAAO,EAAG,GAAI,IAAK,IAAK,IAC5B,GAAI,IAAO,EAAG,GAAI,IAAK,IAAK,IAC5B,GAAI,IAAO,GAAI,IAAK,IAAK,KAAM,IAC/B,GAAI,IAAO,GAAI,IAAK,IAAK,KAAM,KAOjC,YAAiB,EAAG,CAClB,EAAE,YAAc,EAAI,EAAE,OAGtB,GAAK,EAAE,MAIP,EAAE,eAAiB,GAAoB,EAAE,OAAO,SAChD,EAAE,WAAa,GAAoB,EAAE,OAAO,YAC5C,EAAE,WAAa,GAAoB,EAAE,OAAO,YAC5C,EAAE,iBAAmB,GAAoB,EAAE,OAAO,UAElD,EAAE,SAAW,EACb,EAAE,YAAc,EAChB,EAAE,UAAY,EACd,EAAE,OAAS,EACX,EAAE,aAAe,EAAE,YAAc,GAAY,EAC7C,EAAE,gBAAkB,EACpB,EAAE,MAAQ,EAIZ,aAAwB,CACtB,KAAK,KAAO,KACZ,KAAK,OAAS,EACd,KAAK,YAAc,KACnB,KAAK,iBAAmB,EACxB,KAAK,YAAc,EACnB,KAAK,QAAU,EACf,KAAK,KAAO,EACZ,KAAK,OAAS,KACd,KAAK,QAAU,EACf,KAAK,OAAS,GACd,KAAK,WAAa,GAElB,KAAK,OAAS,EACd,KAAK,OAAS,EACd,KAAK,OAAS,EAEd,KAAK,OAAS,KAQd,KAAK,YAAc,EAKnB,KAAK,KAAO,KAMZ,KAAK,KAAO,KAEZ,KAAK,MAAQ,EACb,KAAK,UAAY,EACjB,KAAK,UAAY,EACjB,KAAK,UAAY,EAEjB,KAAK,WAAa,EAOlB,KAAK,YAAc,EAKnB,KAAK,aAAe,EACpB,KAAK,WAAa,EAClB,KAAK,gBAAkB,EACvB,KAAK,SAAW,EAChB,KAAK,YAAc,EACnB,KAAK,UAAY,EAEjB,KAAK,YAAc,EAKnB,KAAK,iBAAmB,EAMxB,KAAK,eAAiB,EAYtB,KAAK,MAAQ,EACb,KAAK,SAAW,EAEhB,KAAK,WAAa,EAGlB,KAAK,WAAa,EAYlB,KAAK,UAAa,GAAI,IAAM,MAAM,GAAY,GAC9C,KAAK,UAAa,GAAI,IAAM,MAAO,GAAI,GAAU,GAAK,GACtD,KAAK,QAAa,GAAI,IAAM,MAAO,GAAI,GAAW,GAAK,GACvD,GAAK,KAAK,WACV,GAAK,KAAK,WACV,GAAK,KAAK,SAEV,KAAK,OAAW,KAChB,KAAK,OAAW,KAChB,KAAK,QAAW,KAGhB,KAAK,SAAW,GAAI,IAAM,MAAM,GAAW,GAI3C,KAAK,KAAO,GAAI,IAAM,MAAM,EAAI,GAAU,GAC1C,GAAK,KAAK,MAEV,KAAK,SAAW,EAChB,KAAK,SAAW,EAKhB,KAAK,MAAQ,GAAI,IAAM,MAAM,EAAI,GAAU,GAC3C,GAAK,KAAK,OAIV,KAAK,MAAQ,EAEb,KAAK,YAAc,EAoBnB,KAAK,SAAW,EAEhB,KAAK,MAAQ,EAMb,KAAK,QAAU,EACf,KAAK,WAAa,EAClB,KAAK,QAAU,EACf,KAAK,OAAS,EAGd,KAAK,OAAS,EAId,KAAK,SAAW,EAgBlB,YAA0B,EAAM,CAC9B,GAAI,GAEJ,MAAI,CAAC,GAAQ,CAAC,EAAK,MACV,GAAI,EAAM,IAGnB,GAAK,SAAW,EAAK,UAAY,EACjC,EAAK,UAAY,GAEjB,EAAI,EAAK,MACT,EAAE,QAAU,EACZ,EAAE,YAAc,EAEZ,EAAE,KAAO,GACX,GAAE,KAAO,CAAC,EAAE,MAGd,EAAE,OAAU,EAAE,KAAO,GAAa,GAClC,EAAK,MAAS,EAAE,OAAS,EACvB,EAEA,EACF,EAAE,WAAa,GACf,GAAM,SAAS,GACR,IAIT,YAAsB,EAAM,CAC1B,GAAI,GAAM,GAAiB,GAC3B,MAAI,KAAQ,IACV,GAAQ,EAAK,OAER,EAIT,YAA0B,EAAM,EAAM,CAEpC,MADI,CAAC,GAAQ,CAAC,EAAK,OACf,EAAK,MAAM,OAAS,EAAY,GACpC,GAAK,MAAM,OAAS,EACb,IAIT,YAAsB,EAAM,EAAO,EAAQ,EAAY,EAAU,EAAU,CACzE,GAAI,CAAC,EACH,MAAO,IAET,GAAI,GAAO,EAiBX,GAfI,IAAU,IACZ,GAAQ,GAGV,AAAI,EAAa,EACf,GAAO,EACP,EAAa,CAAC,GAGP,EAAa,IACpB,GAAO,EACP,GAAc,IAIZ,EAAW,GAAK,EAAW,IAAiB,IAAW,IACzD,EAAa,GAAK,EAAa,IAAM,EAAQ,GAAK,EAAQ,GAC1D,EAAW,GAAK,EAAW,GAC3B,MAAO,IAAI,EAAM,IAInB,AAAI,IAAe,GACjB,GAAa,GAIf,GAAI,GAAI,GAAI,IAEZ,SAAK,MAAQ,EACb,EAAE,KAAO,EAET,EAAE,KAAO,EACT,EAAE,OAAS,KACX,EAAE,OAAS,EACX,EAAE,OAAS,GAAK,EAAE,OAClB,EAAE,OAAS,EAAE,OAAS,EAEtB,EAAE,UAAY,EAAW,EACzB,EAAE,UAAY,GAAK,EAAE,UACrB,EAAE,UAAY,EAAE,UAAY,EAC5B,EAAE,WAAa,CAAC,CAAG,IAAE,UAAY,GAAY,GAAK,IAElD,EAAE,OAAS,GAAI,IAAM,KAAK,EAAE,OAAS,GACrC,EAAE,KAAO,GAAI,IAAM,MAAM,EAAE,WAC3B,EAAE,KAAO,GAAI,IAAM,MAAM,EAAE,QAK3B,EAAE,YAAc,GAAM,EAAW,EAEjC,EAAE,iBAAmB,EAAE,YAAc,EAIrC,EAAE,YAAc,GAAI,IAAM,KAAK,EAAE,kBAIjC,EAAE,MAAQ,EAAI,EAAE,YAGhB,EAAE,MAAS,GAAI,GAAK,EAAE,YAEtB,EAAE,MAAQ,EACV,EAAE,SAAW,EACb,EAAE,OAAS,EAEJ,GAAa,GAGtB,YAAqB,EAAM,EAAO,CAChC,MAAO,IAAa,EAAM,EAAO,GAAY,GAAW,GAAe,IAIzE,YAAiB,EAAM,EAAO,CAC5B,GAAI,GAAW,EACX,EAAK,EAET,GAAI,CAAC,GAAQ,CAAC,EAAK,OACjB,EAAQ,IAAW,EAAQ,EAC3B,MAAO,GAAO,GAAI,EAAM,IAAkB,GAK5C,GAFA,EAAI,EAAK,MAEL,CAAC,EAAK,QACL,CAAC,EAAK,OAAS,EAAK,WAAa,GACjC,EAAE,SAAW,IAAgB,IAAU,GAC1C,MAAO,IAAI,EAAO,EAAK,YAAc,EAAK,GAAc,IAQ1D,GALA,EAAE,KAAO,EACT,EAAY,EAAE,WACd,EAAE,WAAa,EAGX,EAAE,SAAW,GAEf,GAAI,EAAE,OAAS,EACb,EAAK,MAAQ,EACb,GAAS,EAAG,IACZ,GAAS,EAAG,KACZ,GAAS,EAAG,GACZ,AAAK,EAAE,OAaL,IAAS,EAAI,GAAE,OAAO,KAAO,EAAI,GACpB,GAAE,OAAO,KAAO,EAAI,GACpB,CAAC,EAAE,OAAO,MAAY,EAAJ,GAClB,CAAC,EAAE,OAAO,KAAW,EAAJ,GACjB,CAAC,EAAE,OAAO,QAAc,GAAJ,IAEjC,GAAS,EAAG,EAAE,OAAO,KAAO,KAC5B,GAAS,EAAI,EAAE,OAAO,MAAQ,EAAK,KACnC,GAAS,EAAI,EAAE,OAAO,MAAQ,GAAM,KACpC,GAAS,EAAI,EAAE,OAAO,MAAQ,GAAM,KACpC,GAAS,EAAG,EAAE,QAAU,EAAI,EACf,EAAE,UAAY,IAAkB,EAAE,MAAQ,EAC1C,EAAI,GACjB,GAAS,EAAG,EAAE,OAAO,GAAK,KACtB,EAAE,OAAO,OAAS,EAAE,OAAO,MAAM,QACnC,IAAS,EAAG,EAAE,OAAO,MAAM,OAAS,KACpC,GAAS,EAAI,EAAE,OAAO,MAAM,QAAU,EAAK,MAEzC,EAAE,OAAO,MACX,GAAK,MAAQ,GAAM,EAAK,MAAO,EAAE,YAAa,EAAE,QAAS,IAE3D,EAAE,QAAU,EACZ,EAAE,OAAS,IAlCX,IAAS,EAAG,GACZ,GAAS,EAAG,GACZ,GAAS,EAAG,GACZ,GAAS,EAAG,GACZ,GAAS,EAAG,GACZ,GAAS,EAAG,EAAE,QAAU,EAAI,EACf,EAAE,UAAY,IAAkB,EAAE,MAAQ,EAC1C,EAAI,GACjB,GAAS,EAAG,IACZ,EAAE,OAAS,QA6Bf,CACE,GAAI,GAAU,GAAe,GAAE,OAAS,GAAM,IAAO,EACjD,EAAc,GAElB,AAAI,EAAE,UAAY,IAAkB,EAAE,MAAQ,EAC5C,EAAc,EACT,AAAI,EAAE,MAAQ,EACnB,EAAc,EACT,AAAI,EAAE,QAAU,EACrB,EAAc,EAEd,EAAc,EAEhB,GAAW,GAAe,EACtB,EAAE,WAAa,GAAK,IAAU,IAClC,GAAU,GAAM,EAAS,GAEzB,EAAE,OAAS,GACX,GAAY,EAAG,GAGX,EAAE,WAAa,GACjB,IAAY,EAAG,EAAK,QAAU,IAC9B,GAAY,EAAG,EAAK,MAAQ,QAE9B,EAAK,MAAQ,EAKjB,GAAI,EAAE,SAAW,GACf,GAAI,EAAE,OAAO,MAAqB,CAGhC,IAFA,EAAM,EAAE,QAED,EAAE,QAAW,GAAE,OAAO,MAAM,OAAS,QACtC,IAAE,UAAY,EAAE,kBACd,GAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,GAAM,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,IAEjE,GAAc,GACd,EAAM,EAAE,QACJ,EAAE,UAAY,EAAE,oBAItB,GAAS,EAAG,EAAE,OAAO,MAAM,EAAE,SAAW,KACxC,EAAE,UAEJ,AAAI,EAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,GAAM,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,IAE7D,EAAE,UAAY,EAAE,OAAO,MAAM,QAC/B,GAAE,QAAU,EACZ,EAAE,OAAS,QAIb,GAAE,OAAS,GAGf,GAAI,EAAE,SAAW,GACf,GAAI,EAAE,OAAO,KAAoB,CAC/B,EAAM,EAAE,QAGR,EAAG,CACD,GAAI,EAAE,UAAY,EAAE,kBACd,GAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,GAAM,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,IAEjE,GAAc,GACd,EAAM,EAAE,QACJ,EAAE,UAAY,EAAE,kBAAkB,CACpC,EAAM,EACN,MAIJ,AAAI,EAAE,QAAU,EAAE,OAAO,KAAK,OAC5B,EAAM,EAAE,OAAO,KAAK,WAAW,EAAE,WAAa,IAE9C,EAAM,EAER,GAAS,EAAG,SACL,IAAQ,GAEjB,AAAI,EAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,GAAM,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,IAE7D,IAAQ,GACV,GAAE,QAAU,EACZ,EAAE,OAAS,QAIb,GAAE,OAAS,GAGf,GAAI,EAAE,SAAW,GACf,GAAI,EAAE,OAAO,QAAuB,CAClC,EAAM,EAAE,QAGR,EAAG,CACD,GAAI,EAAE,UAAY,EAAE,kBACd,GAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,GAAM,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,IAEjE,GAAc,GACd,EAAM,EAAE,QACJ,EAAE,UAAY,EAAE,kBAAkB,CACpC,EAAM,EACN,MAIJ,AAAI,EAAE,QAAU,EAAE,OAAO,QAAQ,OAC/B,EAAM,EAAE,OAAO,QAAQ,WAAW,EAAE,WAAa,IAEjD,EAAM,EAER,GAAS,EAAG,SACL,IAAQ,GAEjB,AAAI,EAAE,OAAO,MAAQ,EAAE,QAAU,GAC/B,GAAK,MAAQ,GAAM,EAAK,MAAO,EAAE,YAAa,EAAE,QAAU,EAAK,IAE7D,IAAQ,GACV,GAAE,OAAS,QAIb,GAAE,OAAS,GAsBf,GAnBI,EAAE,SAAW,IACf,CAAI,EAAE,OAAO,KACP,GAAE,QAAU,EAAI,EAAE,kBACpB,GAAc,GAEZ,EAAE,QAAU,GAAK,EAAE,kBACrB,IAAS,EAAG,EAAK,MAAQ,KACzB,GAAS,EAAI,EAAK,OAAS,EAAK,KAChC,EAAK,MAAQ,EACb,EAAE,OAAS,KAIb,EAAE,OAAS,IAMX,EAAE,UAAY,GAEhB,GADA,GAAc,GACV,EAAK,YAAc,EAOrB,SAAE,WAAa,GACR,WAOA,EAAK,WAAa,GAAK,GAAK,IAAU,GAAK,IACpD,IAAU,GACV,MAAO,IAAI,EAAM,IAInB,GAAI,EAAE,SAAW,IAAgB,EAAK,WAAa,EACjD,MAAO,IAAI,EAAM,IAKnB,GAAI,EAAK,WAAa,GAAK,EAAE,YAAc,GACxC,IAAU,IAAc,EAAE,SAAW,GAAe,CACrD,GAAI,GAAU,EAAE,WAAa,GAAkB,GAAa,EAAG,GAC5D,EAAE,WAAa,GAAQ,GAAY,EAAG,GACrC,GAAoB,EAAE,OAAO,KAAK,EAAG,GAKzC,GAHI,KAAW,IAAqB,IAAW,KAC7C,GAAE,OAAS,IAET,IAAW,IAAgB,IAAW,GACxC,MAAI,GAAK,YAAc,GACrB,GAAE,WAAa,IAGV,GAST,GAAI,IAAW,IACb,CAAI,IAAU,GACZ,GAAM,UAAU,GAET,IAAU,IAEjB,IAAM,iBAAiB,EAAG,EAAG,EAAG,IAI5B,IAAU,IAEZ,IAAK,EAAE,MAEH,EAAE,YAAc,GAClB,GAAE,SAAW,EACb,EAAE,YAAc,EAChB,EAAE,OAAS,KAIjB,GAAc,GACV,EAAK,YAAc,GACrB,SAAE,WAAa,GACR,GAOb,MAAI,KAAU,GAAmB,GAC7B,EAAE,MAAQ,EAAY,GAG1B,CAAI,EAAE,OAAS,EACb,IAAS,EAAG,EAAK,MAAQ,KACzB,GAAS,EAAI,EAAK,OAAS,EAAK,KAChC,GAAS,EAAI,EAAK,OAAS,GAAM,KACjC,GAAS,EAAI,EAAK,OAAS,GAAM,KACjC,GAAS,EAAG,EAAK,SAAW,KAC5B,GAAS,EAAI,EAAK,UAAY,EAAK,KACnC,GAAS,EAAI,EAAK,UAAY,GAAM,KACpC,GAAS,EAAI,EAAK,UAAY,GAAM,MAIpC,IAAY,EAAG,EAAK,QAAU,IAC9B,GAAY,EAAG,EAAK,MAAQ,QAG9B,GAAc,GAIV,EAAE,KAAO,GAAK,GAAE,KAAO,CAAC,EAAE,MAEvB,EAAE,UAAY,EAAI,GAAO,IAGlC,YAAoB,EAAM,CACxB,GAAI,GAEJ,MAAI,CAAC,GAAqB,CAAC,EAAK,MACvB,GAGT,GAAS,EAAK,MAAM,OAChB,IAAW,IACb,IAAW,IACX,IAAW,IACX,IAAW,IACX,IAAW,IACX,IAAW,IACX,IAAW,GAEJ,GAAI,EAAM,IAGnB,GAAK,MAAQ,KAEN,IAAW,GAAa,GAAI,EAAM,IAAgB,KAQ3D,YAA8B,EAAM,EAAY,CAC9C,GAAI,GAAa,EAAW,OAExB,EACA,EAAK,EACL,EACA,EACA,EACA,EACA,EASJ,GAPI,CAAC,GAAqB,CAAC,EAAK,OAIhC,GAAI,EAAK,MACT,EAAO,EAAE,KAEL,IAAS,GAAM,IAAS,GAAK,EAAE,SAAW,IAAe,EAAE,WAC7D,MAAO,IAmCT,IA/BI,IAAS,GAEX,GAAK,MAAQ,GAAQ,EAAK,MAAO,EAAY,EAAY,IAG3D,EAAE,KAAO,EAGL,GAAc,EAAE,QACd,KAAS,GAEX,IAAK,EAAE,MACP,EAAE,SAAW,EACb,EAAE,YAAc,EAChB,EAAE,OAAS,GAIb,EAAU,GAAI,IAAM,KAAK,EAAE,QAC3B,GAAM,SAAS,EAAS,EAAY,EAAa,EAAE,OAAQ,EAAE,OAAQ,GACrE,EAAa,EACb,EAAa,EAAE,QAGjB,EAAQ,EAAK,SACb,EAAO,EAAK,QACZ,EAAQ,EAAK,MACb,EAAK,SAAW,EAChB,EAAK,QAAU,EACf,EAAK,MAAQ,EACb,GAAY,GACL,EAAE,WAAa,IAAW,CAC/B,EAAM,EAAE,SACR,EAAI,EAAE,UAAa,IAAY,GAC/B,EAEE,GAAE,MAAU,GAAE,OAAS,EAAE,WAAc,EAAE,OAAO,EAAM,GAAY,IAAM,EAAE,UAE1E,EAAE,KAAK,EAAM,EAAE,QAAU,EAAE,KAAK,EAAE,OAElC,EAAE,KAAK,EAAE,OAAS,EAClB,UACO,EAAE,GACX,EAAE,SAAW,EACb,EAAE,UAAY,GAAY,EAC1B,GAAY,GAEd,SAAE,UAAY,EAAE,UAChB,EAAE,YAAc,EAAE,SAClB,EAAE,OAAS,EAAE,UACb,EAAE,UAAY,EACd,EAAE,aAAe,EAAE,YAAc,GAAY,EAC7C,EAAE,gBAAkB,EACpB,EAAK,QAAU,EACf,EAAK,MAAQ,EACb,EAAK,SAAW,EAChB,EAAE,KAAO,EACF,GAIT,GAAQ,YAAc,GACtB,GAAQ,aAAe,GACvB,GAAQ,aAAe,GACvB,GAAQ,iBAAmB,GAC3B,GAAQ,iBAAmB,GAC3B,GAAQ,QAAU,GAClB,GAAQ,WAAa,GACrB,GAAQ,qBAAuB,GAC/B,GAAQ,YAAc,uCCx0DtB,eACA,aAGA,GAAI,IAAQ,KAQR,GAAe,GACf,GAAmB,GAEvB,GAAI,CAAE,OAAO,aAAa,MAAM,KAAM,CAAE,SAAQ,CAAa,GAAe,GAC5E,GAAI,CAAE,OAAO,aAAa,MAAM,KAAM,GAAI,YAAW,SAAO,CAAa,GAAmB,GAM5F,GAAI,IAAW,GAAI,IAAM,KAAK,KAC9B,IAAS,GAAI,EAAG,GAAI,IAAK,KACvB,GAAS,IAAM,IAAK,IAAM,EAAI,IAAK,IAAM,EAAI,IAAK,IAAM,EAAI,IAAK,IAAM,EAAI,IAAK,IAAM,EAAI,EADnF,OAGT,GAAS,KAAO,GAAS,KAAO,EAIhC,GAAQ,WAAa,SAAU,EAAK,CAClC,GAAI,GAAK,EAAG,EAAI,EAAO,EAAG,EAAU,EAAI,OAAQ,EAAU,EAG1D,IAAK,EAAQ,EAAG,EAAQ,EAAS,IAC/B,EAAI,EAAI,WAAW,GACd,GAAI,QAAY,OAAW,EAAQ,EAAI,GAC1C,GAAK,EAAI,WAAW,EAAQ,GACvB,GAAK,QAAY,OACpB,GAAI,MAAY,GAAI,OAAW,IAAO,GAAK,OAC3C,MAGJ,GAAW,EAAI,IAAO,EAAI,EAAI,KAAQ,EAAI,EAAI,MAAU,EAAI,EAO9D,IAHA,EAAM,GAAI,IAAM,KAAK,GAGhB,EAAI,EAAG,EAAQ,EAAG,EAAI,EAAS,IAClC,EAAI,EAAI,WAAW,GACd,GAAI,QAAY,OAAW,EAAQ,EAAI,GAC1C,GAAK,EAAI,WAAW,EAAQ,GACvB,GAAK,QAAY,OACpB,GAAI,MAAY,GAAI,OAAW,IAAO,GAAK,OAC3C,MAGJ,AAAI,EAAI,IAEN,EAAI,KAAO,EACN,AAAI,EAAI,KAEb,GAAI,KAAO,IAAQ,IAAM,EACzB,EAAI,KAAO,IAAQ,EAAI,IAClB,AAAI,EAAI,MAEb,GAAI,KAAO,IAAQ,IAAM,GACzB,EAAI,KAAO,IAAQ,IAAM,EAAI,GAC7B,EAAI,KAAO,IAAQ,EAAI,IAGvB,GAAI,KAAO,IAAQ,IAAM,GACzB,EAAI,KAAO,IAAQ,IAAM,GAAK,GAC9B,EAAI,KAAO,IAAQ,IAAM,EAAI,GAC7B,EAAI,KAAO,IAAQ,EAAI,IAI3B,MAAO,IAIT,YAAuB,EAAK,EAAK,CAI/B,GAAI,EAAM,OACH,GAAI,UAAY,IAAsB,CAAC,EAAI,UAAY,IAC1D,MAAO,QAAO,aAAa,MAAM,KAAM,GAAM,UAAU,EAAK,IAKhE,OADI,GAAS,GACJ,EAAI,EAAG,EAAI,EAAK,IACvB,GAAU,OAAO,aAAa,EAAI,IAEpC,MAAO,GAKT,GAAQ,cAAgB,SAAU,EAAK,CACrC,MAAO,IAAc,EAAK,EAAI,SAKhC,GAAQ,cAAgB,SAAU,EAAK,CAErC,OADI,GAAM,GAAI,IAAM,KAAK,EAAI,QACpB,EAAI,EAAG,EAAM,EAAI,OAAQ,EAAI,EAAK,IACzC,EAAI,GAAK,EAAI,WAAW,GAE1B,MAAO,IAKT,GAAQ,WAAa,SAAU,EAAK,EAAK,CACvC,GAAI,GAAG,EAAK,EAAG,EACX,EAAM,GAAO,EAAI,OAKjB,EAAW,GAAI,OAAM,EAAM,GAE/B,IAAK,EAAM,EAAG,EAAI,EAAG,EAAI,GAAM,CAG7B,GAFA,EAAI,EAAI,KAEJ,EAAI,IAAM,CAAE,EAAS,KAAS,EAAG,SAIrC,GAFA,EAAQ,GAAS,GAEb,EAAQ,EAAG,CAAE,EAAS,KAAS,MAAQ,GAAK,EAAQ,EAAG,SAK3D,IAFA,GAAK,IAAU,EAAI,GAAO,IAAU,EAAI,GAAO,EAExC,EAAQ,GAAK,EAAI,GACtB,EAAK,GAAK,EAAM,EAAI,KAAO,GAC3B,IAIF,GAAI,EAAQ,EAAG,CAAE,EAAS,KAAS,MAAQ,SAE3C,AAAI,EAAI,MACN,EAAS,KAAS,EAElB,IAAK,MACL,EAAS,KAAS,MAAW,GAAK,GAAM,KACxC,EAAS,KAAS,MAAU,EAAI,MAIpC,MAAO,IAAc,EAAU,IAUjC,GAAQ,WAAa,SAAU,EAAK,EAAK,CACvC,GAAI,GAOJ,IALA,EAAM,GAAO,EAAI,OACb,EAAM,EAAI,QAAU,GAAM,EAAI,QAGlC,EAAM,EAAM,EACL,GAAO,GAAM,GAAI,GAAO,MAAU,KAAQ,IAQjD,MAJI,GAAM,GAIN,IAAQ,EAAY,EAEhB,EAAM,GAAS,EAAI,IAAQ,EAAO,EAAM,KCzLlD,iCAqBA,aAAmB,CAEjB,KAAK,MAAQ,KACb,KAAK,QAAU,EAEf,KAAK,SAAW,EAEhB,KAAK,SAAW,EAEhB,KAAK,OAAS,KACd,KAAK,SAAW,EAEhB,KAAK,UAAY,EAEjB,KAAK,UAAY,EAEjB,KAAK,IAAM,GAEX,KAAK,MAAQ,KAEb,KAAK,UAAY,EAEjB,KAAK,MAAQ,EAGf,GAAO,QAAU,KC9CjB,4BAGA,GAAI,IAAe,KACf,GAAe,KACf,GAAe,KACf,GAAe,KACf,GAAe,KAEf,GAAW,OAAO,UAAU,SAK5B,GAAkB,EAClB,GAAkB,EAElB,GAAkB,EAClB,GAAkB,EAClB,GAAkB,EAElB,GAAwB,GAExB,GAAwB,EAExB,GAAc,EA8FlB,YAAiB,EAAS,CACxB,GAAI,CAAE,gBAAgB,KAAU,MAAO,IAAI,IAAQ,GAEnD,KAAK,QAAU,GAAM,OAAO,CAC1B,MAAO,GACP,OAAQ,GACR,UAAW,MACX,WAAY,GACZ,SAAU,EACV,SAAU,GACV,GAAI,IACH,GAAW,IAEd,GAAI,GAAM,KAAK,QAEf,AAAI,EAAI,KAAQ,EAAI,WAAa,EAC/B,EAAI,WAAa,CAAC,EAAI,WAGf,EAAI,MAAS,EAAI,WAAa,GAAO,EAAI,WAAa,IAC7D,GAAI,YAAc,IAGpB,KAAK,IAAS,EACd,KAAK,IAAS,GACd,KAAK,MAAS,GACd,KAAK,OAAS,GAEd,KAAK,KAAO,GAAI,IAChB,KAAK,KAAK,UAAY,EAEtB,GAAI,GAAS,GAAa,aACxB,KAAK,KACL,EAAI,MACJ,EAAI,OACJ,EAAI,WACJ,EAAI,SACJ,EAAI,UAGN,GAAI,IAAW,GACb,KAAM,IAAI,OAAM,GAAI,IAOtB,GAJI,EAAI,QACN,GAAa,iBAAiB,KAAK,KAAM,EAAI,QAG3C,EAAI,WAAY,CAClB,GAAI,GAaJ,GAXA,AAAI,MAAO,GAAI,YAAe,SAE5B,EAAO,GAAQ,WAAW,EAAI,YACzB,AAAI,GAAS,KAAK,EAAI,cAAgB,uBAC3C,EAAO,GAAI,YAAW,EAAI,YAE1B,EAAO,EAAI,WAGb,EAAS,GAAa,qBAAqB,KAAK,KAAM,GAElD,IAAW,GACb,KAAM,IAAI,OAAM,GAAI,IAGtB,KAAK,UAAY,IAiCrB,GAAQ,UAAU,KAAO,SAAU,EAAM,EAAM,CAC7C,GAAI,GAAO,KAAK,KACZ,EAAY,KAAK,QAAQ,UACzB,EAAQ,EAEZ,GAAI,KAAK,MAAS,MAAO,GAEzB,EAAS,IAAS,CAAC,CAAC,EAAQ,EAAS,IAAS,GAAQ,GAAW,GAGjE,AAAI,MAAO,IAAS,SAElB,EAAK,MAAQ,GAAQ,WAAW,GAC3B,AAAI,GAAS,KAAK,KAAU,uBACjC,EAAK,MAAQ,GAAI,YAAW,GAE5B,EAAK,MAAQ,EAGf,EAAK,QAAU,EACf,EAAK,SAAW,EAAK,MAAM,OAE3B,EAAG,CAQD,GAPI,EAAK,YAAc,GACrB,GAAK,OAAS,GAAI,IAAM,KAAK,GAC7B,EAAK,SAAW,EAChB,EAAK,UAAY,GAEnB,EAAS,GAAa,QAAQ,EAAM,GAEhC,IAAW,IAAgB,IAAW,GACxC,YAAK,MAAM,GACX,KAAK,MAAQ,GACN,GAET,AAAI,GAAK,YAAc,GAAM,EAAK,WAAa,GAAM,KAAU,IAAY,IAAU,MACnF,CAAI,KAAK,QAAQ,KAAO,SACtB,KAAK,OAAO,GAAQ,cAAc,GAAM,UAAU,EAAK,OAAQ,EAAK,YAEpE,KAAK,OAAO,GAAM,UAAU,EAAK,OAAQ,EAAK,kBAG1C,GAAK,SAAW,GAAK,EAAK,YAAc,IAAM,IAAW,IAGnE,MAAI,KAAU,GACZ,GAAS,GAAa,WAAW,KAAK,MACtC,KAAK,MAAM,GACX,KAAK,MAAQ,GACN,IAAW,IAIhB,KAAU,IACZ,MAAK,MAAM,IACX,EAAK,UAAY,GACV,KAgBX,GAAQ,UAAU,OAAS,SAAU,EAAO,CAC1C,KAAK,OAAO,KAAK,IAcnB,GAAQ,UAAU,MAAQ,SAAU,EAAQ,CAE1C,AAAI,IAAW,IACb,CAAI,KAAK,QAAQ,KAAO,SACtB,KAAK,OAAS,KAAK,OAAO,KAAK,IAE/B,KAAK,OAAS,GAAM,cAAc,KAAK,SAG3C,KAAK,OAAS,GACd,KAAK,IAAM,EACX,KAAK,IAAM,KAAK,KAAK,KAsCvB,YAAiB,EAAO,EAAS,CAC/B,GAAI,GAAW,GAAI,IAAQ,GAK3B,GAHA,EAAS,KAAK,EAAO,IAGjB,EAAS,IAAO,KAAM,GAAS,KAAO,GAAI,EAAS,KAEvD,MAAO,GAAS,OAYlB,YAAoB,EAAO,EAAS,CAClC,SAAU,GAAW,GACrB,EAAQ,IAAM,GACP,GAAQ,EAAO,GAYxB,YAAc,EAAO,EAAS,CAC5B,SAAU,GAAW,GACrB,EAAQ,KAAO,GACR,GAAQ,EAAO,GAIxB,GAAQ,QAAU,GAClB,GAAQ,QAAU,GAClB,GAAQ,WAAa,GACrB,GAAQ,KAAO,KC/Yf,iCAsBA,GAAI,IAAM,GACN,GAAO,GAqCX,GAAO,QAAU,SAAsB,EAAM,EAAO,CAClD,GAAI,GACA,EACA,EACA,EACA,EACA,EAEA,EAEA,EACA,EACA,EAEA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GACA,EAEA,EACA,GACA,EACA,GAGA,EAAO,EAGX,EAAQ,EAAK,MAEb,EAAM,EAAK,QACX,EAAQ,EAAK,MACb,EAAO,EAAO,GAAK,SAAW,GAC9B,EAAO,EAAK,SACZ,EAAS,EAAK,OACd,EAAM,EAAQ,GAAQ,EAAK,WAC3B,EAAM,EAAQ,GAAK,UAAY,KAE/B,EAAO,EAAM,KAEb,EAAQ,EAAM,MACd,EAAQ,EAAM,MACd,EAAQ,EAAM,MACd,EAAW,EAAM,OACjB,EAAO,EAAM,KACb,EAAO,EAAM,KACb,EAAQ,EAAM,QACd,EAAQ,EAAM,SACd,EAAS,IAAK,EAAM,SAAW,EAC/B,EAAS,IAAK,EAAM,UAAY,EAMhC,EACA,EAAG,CACD,AAAI,EAAO,IACT,IAAQ,EAAM,MAAU,EACxB,GAAQ,EACR,GAAQ,EAAM,MAAU,EACxB,GAAQ,GAGV,GAAO,EAAM,EAAO,GAEpB,EACA,OAAS,CAKP,GAJA,EAAK,KAAS,GACd,KAAU,EACV,GAAQ,EACR,EAAM,KAAS,GAAM,IACjB,IAAO,EAIT,EAAO,KAAU,GAAO,cAEjB,EAAK,GAAI,CAChB,EAAM,GAAO,MACb,GAAM,GACF,GACE,GAAO,GACT,IAAQ,EAAM,MAAU,EACxB,GAAQ,GAEV,GAAO,EAAS,IAAK,GAAM,EAC3B,KAAU,EACV,GAAQ,GAGN,EAAO,IACT,IAAQ,EAAM,MAAU,EACxB,GAAQ,EACR,GAAQ,EAAM,MAAU,EACxB,GAAQ,GAEV,GAAO,EAAM,EAAO,GAEpB,EACA,OAAS,CAMP,GALA,EAAK,KAAS,GACd,KAAU,EACV,GAAQ,EACR,EAAM,KAAS,GAAM,IAEjB,EAAK,GAAI,CAaX,GAZA,GAAO,GAAO,MACd,GAAM,GACF,EAAO,GACT,IAAQ,EAAM,MAAU,EACxB,GAAQ,EACJ,EAAO,GACT,IAAQ,EAAM,MAAU,EACxB,GAAQ,IAGZ,IAAQ,EAAS,IAAK,GAAM,EAExB,GAAO,EAAM,CACf,EAAK,IAAM,gCACX,EAAM,KAAO,GACb,QAOF,GAJA,KAAU,EACV,GAAQ,EAER,EAAK,EAAO,EACR,GAAO,EAAI,CAEb,GADA,EAAK,GAAO,EACR,EAAK,GACH,EAAM,KAAM,CACd,EAAK,IAAM,gCACX,EAAM,KAAO,GACb,QA2BJ,GAFA,EAAO,EACP,GAAc,EACV,IAAU,GAEZ,GADA,GAAQ,EAAQ,EACZ,EAAK,EAAK,CACZ,GAAO,EACP,EACE,GAAO,KAAU,EAAS,WACnB,EAAE,GACX,EAAO,EAAO,GACd,GAAc,WAGT,EAAQ,GAGf,GAFA,GAAQ,EAAQ,EAAQ,EACxB,GAAM,EACF,EAAK,EAAK,CACZ,GAAO,EACP,EACE,GAAO,KAAU,EAAS,WACnB,EAAE,GAEX,GADA,EAAO,EACH,EAAQ,EAAK,CACf,EAAK,EACL,GAAO,EACP,EACE,GAAO,KAAU,EAAS,WACnB,EAAE,GACX,EAAO,EAAO,GACd,GAAc,YAKlB,GAAQ,EAAQ,EACZ,EAAK,EAAK,CACZ,GAAO,EACP,EACE,GAAO,KAAU,EAAS,WACnB,EAAE,GACX,EAAO,EAAO,GACd,GAAc,EAGlB,KAAO,EAAM,GACX,EAAO,KAAU,GAAY,KAC7B,EAAO,KAAU,GAAY,KAC7B,EAAO,KAAU,GAAY,KAC7B,GAAO,EAET,AAAI,GACF,GAAO,KAAU,GAAY,KACzB,EAAM,GACR,GAAO,KAAU,GAAY,WAI9B,CACH,EAAO,EAAO,GACd,EACE,GAAO,KAAU,EAAO,KACxB,EAAO,KAAU,EAAO,KACxB,EAAO,KAAU,EAAO,KACxB,GAAO,QACA,EAAM,GACf,AAAI,GACF,GAAO,KAAU,EAAO,KACpB,EAAM,GACR,GAAO,KAAU,EAAO,gBAKtB,GAAK,KAAQ,EAAG,CACxB,GAAO,EAAO,IAAO,OAAuB,GAAS,IAAK,GAAM,IAChE,eAEG,CACH,EAAK,IAAM,wBACX,EAAM,KAAO,GACb,QAGF,eAGM,GAAK,KAAQ,EAAG,CACxB,GAAO,EAAO,IAAO,OAAuB,GAAS,IAAK,GAAM,IAChE,mBAEO,EAAK,GAAI,CAEhB,EAAM,KAAO,GACb,YAEG,CACH,EAAK,IAAM,8BACX,EAAM,KAAO,GACb,QAGF,aAEK,EAAM,GAAQ,EAAO,GAG9B,EAAM,GAAQ,EACd,GAAO,EACP,GAAQ,GAAO,EACf,GAAS,IAAK,GAAQ,EAGtB,EAAK,QAAU,EACf,EAAK,SAAW,EAChB,EAAK,SAAY,EAAM,EAAO,EAAK,GAAO,GAAO,EAAK,GAAM,GAC5D,EAAK,UAAa,EAAO,EAAM,IAAO,GAAM,GAAQ,IAAO,GAAO,GAClE,EAAM,KAAO,EACb,EAAM,KAAO,KCtVf,iCAqBA,GAAI,IAAQ,KAER,GAAU,GACV,GAAc,IACd,GAAe,IAGf,GAAQ,EACR,GAAO,EACP,GAAQ,EAER,GAAQ,CACV,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,EAAG,GAG3D,GAAO,CACT,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAGtD,GAAQ,CACV,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IACtD,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAClD,KAAM,MAAO,MAAO,MAAO,EAAG,GAG5B,GAAO,CACT,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACpC,GAAI,GAAI,GAAI,GAAI,GAAI,IAGtB,GAAO,QAAU,SAAuB,EAAM,EAAM,EAAY,EAAO,EAAO,EAAa,EAAM,EACjG,CACE,GAAI,GAAO,EAAK,KAGZ,EAAM,EACN,EAAM,EACN,EAAM,EAAG,EAAM,EACf,EAAO,EACP,EAAO,EACP,EAAO,EACP,EAAO,EACP,EAAO,EACP,EAAO,EACP,GACA,EACA,EACA,GACA,EACA,GAAO,KACP,EAAa,EAEb,EACA,EAAQ,GAAI,IAAM,MAAM,GAAU,GAClC,EAAO,GAAI,IAAM,MAAM,GAAU,GACjC,EAAQ,KACR,EAAc,EAEd,EAAW,EAAS,EAkCxB,IAAK,EAAM,EAAG,GAAO,GAAS,IAC5B,EAAM,GAAO,EAEf,IAAK,EAAM,EAAG,EAAM,EAAO,IACzB,EAAM,EAAK,EAAa,MAK1B,IADA,EAAO,EACF,EAAM,GAAS,GAAO,GACrB,EAAM,KAAS,EADS,IAC5B,CAKF,GAHI,EAAO,GACT,GAAO,GAEL,IAAQ,EAIV,SAAM,KAAkB,GAAK,GAAO,IAAM,GAAM,EAMhD,EAAM,KAAkB,GAAK,GAAO,IAAM,GAAM,EAEhD,EAAK,KAAO,EACL,EAET,IAAK,EAAM,EAAG,EAAM,GACd,EAAM,KAAS,EADI,IACvB,CAQF,IANI,EAAO,GACT,GAAO,GAIT,EAAO,EACF,EAAM,EAAG,GAAO,GAAS,IAG5B,GAFA,IAAS,EACT,GAAQ,EAAM,GACV,EAAO,EACT,MAAO,GAGX,GAAI,EAAO,GAAM,KAAS,IAAS,IAAQ,GACzC,MAAO,GAKT,IADA,EAAK,GAAK,EACL,EAAM,EAAG,EAAM,GAAS,IAC3B,EAAK,EAAM,GAAK,EAAK,GAAO,EAAM,GAIpC,IAAK,EAAM,EAAG,EAAM,EAAO,IACzB,AAAI,EAAK,EAAa,KAAS,GAC7B,GAAK,EAAK,EAAK,EAAa,OAAW,GAmE3C,GA7BA,AAAI,IAAS,GACX,IAAO,EAAQ,EACf,EAAM,IAED,AAAI,IAAS,GAClB,IAAO,GACP,GAAc,IACd,EAAQ,GACR,GAAe,IACf,EAAM,KAGN,IAAO,GACP,EAAQ,GACR,EAAM,IAIR,EAAO,EACP,EAAM,EACN,EAAM,EACN,EAAO,EACP,EAAO,EACP,EAAO,EACP,EAAM,GACN,EAAO,GAAK,EACZ,GAAO,EAAO,EAGT,IAAS,IAAQ,EAAO,IAC1B,IAAS,IAAS,EAAO,GAC1B,MAAO,GAIT,OAAS,CAEP,EAAY,EAAM,EAClB,AAAI,EAAK,GAAO,EACd,GAAU,EACV,EAAW,EAAK,IAEb,AAAI,EAAK,GAAO,EACnB,GAAU,EAAM,EAAc,EAAK,IACnC,EAAW,GAAK,EAAa,EAAK,KAGlC,GAAU,GAAK,GACf,EAAW,GAIb,GAAO,GAAM,EAAM,EACnB,EAAO,GAAK,EACZ,EAAM,EACN,EACE,IAAQ,GACR,EAAM,EAAQ,IAAQ,GAAQ,GAAS,GAAa,GAAO,GAAW,GAAM,EAAU,QAC/E,IAAS,GAIlB,IADA,GAAO,GAAM,EAAM,EACZ,EAAO,IACZ,KAAS,EAWX,GATA,AAAI,KAAS,EACX,IAAQ,GAAO,EACf,GAAQ,IAER,EAAO,EAIT,IACI,EAAE,EAAM,IAAS,EAAG,CACtB,GAAI,IAAQ,EAAO,MACnB,EAAM,EAAK,EAAa,EAAK,IAI/B,GAAI,EAAM,GAAS,GAAO,MAAU,EAAK,CAYvC,IAVI,IAAS,GACX,GAAO,GAIT,GAAQ,EAGR,EAAO,EAAM,EACb,EAAO,GAAK,EACL,EAAO,EAAO,GACnB,IAAQ,EAAM,EAAO,GACjB,KAAQ,KACZ,IACA,IAAS,EAKX,GADA,GAAQ,GAAK,EACR,IAAS,IAAQ,EAAO,IAC1B,IAAS,IAAS,EAAO,GAC1B,MAAO,GAIT,EAAM,EAAO,GAIb,EAAM,GAAQ,GAAQ,GAAO,GAAQ,GAAO,EAAO,EAAc,GAOrE,MAAI,KAAS,GAIX,GAAM,EAAO,GAAU,EAAM,GAAS,GAAO,IAAM,GAAK,GAK1D,EAAK,KAAO,EACL,KCrVT,4BAqBA,GAAI,IAAgB,KAChB,GAAgB,KAChB,GAAgB,KAChB,GAAgB,KAChB,GAAgB,KAEhB,GAAQ,EACR,GAAO,EACP,GAAQ,EAWR,GAAkB,EAClB,GAAkB,EAClB,GAAkB,EAMlB,GAAkB,EAClB,GAAkB,EAClB,GAAkB,EAElB,GAAkB,GAClB,GAAkB,GAClB,GAAkB,GAClB,GAAkB,GAIlB,GAAc,EAOX,GAAO,EACP,GAAQ,EACR,GAAO,EACP,GAAK,EACL,GAAQ,EACR,GAAQ,EACR,GAAO,EACP,GAAU,EACV,GAAO,EACP,GAAS,GACT,GAAO,GACH,GAAO,GACP,GAAS,GACT,GAAS,GACT,GAAQ,GACR,GAAO,GACP,GAAQ,GACR,GAAU,GACV,GAAW,GACP,GAAO,GACP,GAAM,GACN,GAAS,GACT,GAAO,GACP,GAAU,GACV,GAAQ,GACR,GAAM,GACd,GAAQ,GACR,GAAS,GACT,GAAO,GACP,GAAM,GACN,GAAM,GACN,GAAO,GAMV,GAAc,IACd,GAAe,IAGf,GAAY,GAEZ,GAAY,GAGhB,YAAiB,EAAG,CAClB,MAAW,KAAM,GAAM,KACb,KAAM,EAAK,OACX,IAAI,QAAW,GACf,IAAI,MAAS,IAIzB,aAAwB,CACtB,KAAK,KAAO,EACZ,KAAK,KAAO,GACZ,KAAK,KAAO,EACZ,KAAK,SAAW,GAChB,KAAK,MAAQ,EACb,KAAK,KAAO,EACZ,KAAK,MAAQ,EACb,KAAK,MAAQ,EAEb,KAAK,KAAO,KAGZ,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,MAAQ,EACb,KAAK,OAAS,KAGd,KAAK,KAAO,EACZ,KAAK,KAAO,EAGZ,KAAK,OAAS,EACd,KAAK,OAAS,EAGd,KAAK,MAAQ,EAGb,KAAK,QAAU,KACf,KAAK,SAAW,KAChB,KAAK,QAAU,EACf,KAAK,SAAW,EAGhB,KAAK,MAAQ,EACb,KAAK,KAAO,EACZ,KAAK,MAAQ,EACb,KAAK,KAAO,EACZ,KAAK,KAAO,KAEZ,KAAK,KAAO,GAAI,IAAM,MAAM,KAC5B,KAAK,KAAO,GAAI,IAAM,MAAM,KAO5B,KAAK,OAAS,KACd,KAAK,QAAU,KACf,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,IAAM,EAGb,YAA0B,EAAM,CAC9B,GAAI,GAEJ,MAAI,CAAC,GAAQ,CAAC,EAAK,MAAgB,GACnC,GAAQ,EAAK,MACb,EAAK,SAAW,EAAK,UAAY,EAAM,MAAQ,EAC/C,EAAK,IAAM,GACP,EAAM,MACR,GAAK,MAAQ,EAAM,KAAO,GAE5B,EAAM,KAAO,GACb,EAAM,KAAO,EACb,EAAM,SAAW,EACjB,EAAM,KAAO,MACb,EAAM,KAAO,KACb,EAAM,KAAO,EACb,EAAM,KAAO,EAEb,EAAM,QAAU,EAAM,OAAS,GAAI,IAAM,MAAM,IAC/C,EAAM,SAAW,EAAM,QAAU,GAAI,IAAM,MAAM,IAEjD,EAAM,KAAO,EACb,EAAM,KAAO,GAEN,IAGT,YAAsB,EAAM,CAC1B,GAAI,GAEJ,MAAI,CAAC,GAAQ,CAAC,EAAK,MAAgB,GACnC,GAAQ,EAAK,MACb,EAAM,MAAQ,EACd,EAAM,MAAQ,EACd,EAAM,MAAQ,EACP,GAAiB,IAI1B,YAAuB,EAAM,EAAY,CACvC,GAAI,GACA,EAmBJ,MAhBI,CAAC,GAAQ,CAAC,EAAK,OACnB,GAAQ,EAAK,MAGb,AAAI,EAAa,EACf,GAAO,EACP,EAAa,CAAC,GAGd,GAAQ,IAAc,GAAK,EACvB,EAAa,IACf,IAAc,KAKd,GAAe,GAAa,GAAK,EAAa,KACzC,GAEL,GAAM,SAAW,MAAQ,EAAM,QAAU,GAC3C,GAAM,OAAS,MAIjB,EAAM,KAAO,EACb,EAAM,MAAQ,EACP,GAAa,IAGtB,YAAsB,EAAM,EAAY,CACtC,GAAI,GACA,EAEJ,MAAK,GAGL,GAAQ,GAAI,IAIZ,EAAK,MAAQ,EACb,EAAM,OAAS,KACf,EAAM,GAAc,EAAM,GACtB,IAAQ,IACV,GAAK,MAAQ,MAER,GAba,GAgBtB,YAAqB,EAAM,CACzB,MAAO,IAAa,EAAM,IAc5B,GAAI,IAAS,GAET,GAAQ,GAEZ,YAAqB,EAAO,CAE1B,GAAI,GAAQ,CACV,GAAI,GAOJ,IALA,GAAS,GAAI,IAAM,MAAM,KACzB,GAAU,GAAI,IAAM,MAAM,IAG1B,EAAM,EACC,EAAM,KAAO,EAAM,KAAK,KAAS,EACxC,KAAO,EAAM,KAAO,EAAM,KAAK,KAAS,EACxC,KAAO,EAAM,KAAO,EAAM,KAAK,KAAS,EACxC,KAAO,EAAM,KAAO,EAAM,KAAK,KAAS,EAMxC,IAJA,GAAc,GAAO,EAAM,KAAM,EAAG,IAAK,GAAU,EAAG,EAAM,KAAM,CAAE,KAAM,IAG1E,EAAM,EACC,EAAM,IAAM,EAAM,KAAK,KAAS,EAEvC,GAAc,GAAO,EAAM,KAAM,EAAG,GAAM,GAAS,EAAG,EAAM,KAAM,CAAE,KAAM,IAG1E,GAAS,GAGX,EAAM,QAAU,GAChB,EAAM,QAAU,EAChB,EAAM,SAAW,GACjB,EAAM,SAAW,EAkBnB,YAAsB,EAAM,EAAK,EAAK,EAAM,CAC1C,GAAI,GACA,EAAQ,EAAK,MAGjB,MAAI,GAAM,SAAW,MACnB,GAAM,MAAQ,GAAK,EAAM,MACzB,EAAM,MAAQ,EACd,EAAM,MAAQ,EAEd,EAAM,OAAS,GAAI,IAAM,KAAK,EAAM,QAItC,AAAI,GAAQ,EAAM,MAChB,IAAM,SAAS,EAAM,OAAQ,EAAK,EAAM,EAAM,MAAO,EAAM,MAAO,GAClE,EAAM,MAAQ,EACd,EAAM,MAAQ,EAAM,OAGpB,GAAO,EAAM,MAAQ,EAAM,MACvB,EAAO,GACT,GAAO,GAGT,GAAM,SAAS,EAAM,OAAQ,EAAK,EAAM,EAAM,EAAM,EAAM,OAC1D,GAAQ,EACR,AAAI,EAEF,IAAM,SAAS,EAAM,OAAQ,EAAK,EAAM,EAAM,EAAM,GACpD,EAAM,MAAQ,EACd,EAAM,MAAQ,EAAM,OAGpB,GAAM,OAAS,EACX,EAAM,QAAU,EAAM,OAAS,GAAM,MAAQ,GAC7C,EAAM,MAAQ,EAAM,OAAS,GAAM,OAAS,KAG7C,EAGT,YAAiB,EAAM,EAAO,CAC5B,GAAI,GACA,EAAO,EACP,EACA,EACA,EAAM,EACN,EACA,EACA,EAAK,EACL,EACA,EACA,EACA,EAAO,EACP,EAAW,EAAS,EAEpB,GAAW,EAAS,EACpB,GACA,EACA,GAAO,GAAI,IAAM,KAAK,GACtB,EAEA,EAEA,EACF,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,IAGlE,GAAI,CAAC,GAAQ,CAAC,EAAK,OAAS,CAAC,EAAK,QAC7B,CAAC,EAAK,OAAS,EAAK,WAAa,EACpC,MAAO,IAGT,EAAQ,EAAK,MACT,EAAM,OAAS,IAAQ,GAAM,KAAO,IAIxC,EAAM,EAAK,SACX,EAAS,EAAK,OACd,EAAO,EAAK,UACZ,EAAO,EAAK,QACZ,EAAQ,EAAK,MACb,EAAO,EAAK,SACZ,EAAO,EAAM,KACb,EAAO,EAAM,KAGb,EAAM,EACN,EAAO,EACP,EAAM,GAEN,EACA,OACE,OAAQ,EAAM,UACP,IACH,GAAI,EAAM,OAAS,EAAG,CACpB,EAAM,KAAO,GACb,MAGF,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,GAAK,EAAM,KAAO,GAAM,IAAS,MAAQ,CACvC,EAAM,MAAQ,EAEd,GAAK,GAAK,EAAO,IACjB,GAAK,GAAM,IAAS,EAAK,IACzB,EAAM,MAAQ,GAAM,EAAM,MAAO,GAAM,EAAG,GAI1C,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,GACb,MAMF,GAJA,EAAM,MAAQ,EACV,EAAM,MACR,GAAM,KAAK,KAAO,IAEhB,CAAE,GAAM,KAAO,IACd,KAAO,MAAoB,GAAM,IAAQ,IAAM,GAAI,CACtD,EAAK,IAAM,yBACX,EAAM,KAAO,GACb,MAEF,GAAK,GAAO,MAAqB,GAAY,CAC3C,EAAK,IAAM,6BACX,EAAM,KAAO,GACb,MAOF,GAJA,KAAU,EACV,GAAQ,EAER,GAAO,GAAO,IAAmB,EAC7B,EAAM,QAAU,EAClB,EAAM,MAAQ,WAEP,GAAM,EAAM,MAAO,CAC1B,EAAK,IAAM,sBACX,EAAM,KAAO,GACb,MAEF,EAAM,KAAO,GAAK,GAElB,EAAK,MAAQ,EAAM,MAAQ,EAC3B,EAAM,KAAO,EAAO,IAAQ,GAAS,GAErC,EAAO,EACP,EAAO,EAEP,UACG,IAEH,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAIV,GADA,EAAM,MAAQ,EACT,GAAM,MAAQ,OAAU,GAAY,CACvC,EAAK,IAAM,6BACX,EAAM,KAAO,GACb,MAEF,GAAI,EAAM,MAAQ,MAAQ,CACxB,EAAK,IAAM,2BACX,EAAM,KAAO,GACb,MAEF,AAAI,EAAM,MACR,GAAM,KAAK,KAAS,GAAQ,EAAK,GAE/B,EAAM,MAAQ,KAEhB,IAAK,GAAK,EAAO,IACjB,GAAK,GAAM,IAAS,EAAK,IACzB,EAAM,MAAQ,GAAM,EAAM,MAAO,GAAM,EAAG,IAI5C,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,OAEV,IAEH,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,AAAI,EAAM,MACR,GAAM,KAAK,KAAO,GAEhB,EAAM,MAAQ,KAEhB,IAAK,GAAK,EAAO,IACjB,GAAK,GAAM,IAAS,EAAK,IACzB,GAAK,GAAM,IAAS,GAAM,IAC1B,GAAK,GAAM,IAAS,GAAM,IAC1B,EAAM,MAAQ,GAAM,EAAM,MAAO,GAAM,EAAG,IAI5C,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,OAEV,IAEH,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,AAAI,EAAM,MACR,GAAM,KAAK,OAAU,EAAO,IAC5B,EAAM,KAAK,GAAM,GAAQ,GAEvB,EAAM,MAAQ,KAEhB,IAAK,GAAK,EAAO,IACjB,GAAK,GAAM,IAAS,EAAK,IACzB,EAAM,MAAQ,GAAM,EAAM,MAAO,GAAM,EAAG,IAI5C,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,KAAQ,CAExB,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,EAAM,OAAS,EACX,EAAM,MACR,GAAM,KAAK,UAAY,GAErB,EAAM,MAAQ,KAEhB,IAAK,GAAK,EAAO,IACjB,GAAK,GAAM,IAAS,EAAK,IACzB,EAAM,MAAQ,GAAM,EAAM,MAAO,GAAM,EAAG,IAI5C,EAAO,EACP,EAAO,MAGJ,AAAI,GAAM,MACb,GAAM,KAAK,MAAQ,MAErB,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,MAChB,GAAO,EAAM,OACT,EAAO,GAAQ,GAAO,GACtB,GACE,GAAM,MACR,IAAM,EAAM,KAAK,UAAY,EAAM,OAC9B,EAAM,KAAK,OAEd,GAAM,KAAK,MAAQ,GAAI,OAAM,EAAM,KAAK,YAE1C,GAAM,SACJ,EAAM,KAAK,MACX,EACA,EAGA,EAEA,KAMA,EAAM,MAAQ,KAChB,GAAM,MAAQ,GAAM,EAAM,MAAO,EAAO,EAAM,IAEhD,GAAQ,EACR,GAAQ,EACR,EAAM,QAAU,GAEd,EAAM,QAAU,QAEtB,EAAM,OAAS,EACf,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,KAAQ,CACxB,GAAI,IAAS,EAAK,QAClB,EAAO,EACP,EAEE,IAAM,EAAM,EAAO,KAEf,EAAM,MAAQ,IACb,EAAM,OAAS,OAClB,GAAM,KAAK,MAAQ,OAAO,aAAa,WAElC,IAAO,EAAO,GAOvB,GALI,EAAM,MAAQ,KAChB,GAAM,MAAQ,GAAM,EAAM,MAAO,EAAO,EAAM,IAEhD,GAAQ,EACR,GAAQ,EACJ,GAAO,YAER,AAAI,GAAM,MACb,GAAM,KAAK,KAAO,MAEpB,EAAM,OAAS,EACf,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,KAAQ,CACxB,GAAI,IAAS,EAAK,QAClB,EAAO,EACP,EACE,IAAM,EAAM,EAAO,KAEf,EAAM,MAAQ,IACb,EAAM,OAAS,OAClB,GAAM,KAAK,SAAW,OAAO,aAAa,WAErC,IAAO,EAAO,GAMvB,GALI,EAAM,MAAQ,KAChB,GAAM,MAAQ,GAAM,EAAM,MAAO,EAAO,EAAM,IAEhD,GAAQ,EACR,GAAQ,EACJ,GAAO,YAER,AAAI,GAAM,MACb,GAAM,KAAK,QAAU,MAEvB,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,IAAQ,CAExB,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,GAAI,IAAU,GAAM,MAAQ,OAAS,CACnC,EAAK,IAAM,sBACX,EAAM,KAAO,GACb,MAGF,EAAO,EACP,EAAO,EAGT,AAAI,EAAM,MACR,GAAM,KAAK,KAAS,EAAM,OAAS,EAAK,EACxC,EAAM,KAAK,KAAO,IAEpB,EAAK,MAAQ,EAAM,MAAQ,EAC3B,EAAM,KAAO,GACb,UACG,IAEH,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,EAAK,MAAQ,EAAM,MAAQ,GAAQ,GAEnC,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,WAAa,EAErB,SAAK,SAAW,EAChB,EAAK,UAAY,EACjB,EAAK,QAAU,EACf,EAAK,SAAW,EAChB,EAAM,KAAO,EACb,EAAM,KAAO,EAEN,GAET,EAAK,MAAQ,EAAM,MAAQ,EAC3B,EAAM,KAAO,OAEV,IACH,GAAI,IAAU,IAAW,IAAU,GAAW,YAE3C,IACH,GAAI,EAAM,KAAM,CAEd,KAAU,EAAO,EACjB,GAAQ,EAAO,EAEf,EAAM,KAAO,GACb,MAGF,KAAO,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EASV,OANA,EAAM,KAAQ,EAAO,EAErB,KAAU,EACV,GAAQ,EAGC,EAAO,OACT,GAGH,EAAM,KAAO,GACb,UACG,GAKH,GAJA,GAAY,GAGZ,EAAM,KAAO,GACT,IAAU,GAAS,CAErB,KAAU,EACV,GAAQ,EAER,QAEF,UACG,GAGH,EAAM,KAAO,GACb,UACG,GACH,EAAK,IAAM,qBACX,EAAM,KAAO,GAGjB,KAAU,EACV,GAAQ,EAER,UACG,IAMH,IAJA,KAAU,EAAO,EACjB,GAAQ,EAAO,EAGR,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,GAAK,GAAO,QAAc,KAAS,GAAM,OAAS,CAChD,EAAK,IAAM,+BACX,EAAM,KAAO,GACb,MAUF,GARA,EAAM,OAAS,EAAO,MAItB,EAAO,EACP,EAAO,EAEP,EAAM,KAAO,GACT,IAAU,GAAW,YAEtB,IACH,EAAM,KAAO,OAEV,IAEH,GADA,EAAO,EAAM,OACT,EAAM,CAGR,GAFI,EAAO,GAAQ,GAAO,GACtB,EAAO,GAAQ,GAAO,GACtB,IAAS,EAAK,QAElB,GAAM,SAAS,EAAQ,EAAO,EAAM,EAAM,GAE1C,GAAQ,EACR,GAAQ,EACR,GAAQ,EACR,GAAO,EACP,EAAM,QAAU,EAChB,MAGF,EAAM,KAAO,GACb,UACG,IAEH,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAmBV,GAhBA,EAAM,KAAQ,GAAO,IAAmB,IAExC,KAAU,EACV,GAAQ,EAER,EAAM,MAAS,GAAO,IAAmB,EAEzC,KAAU,EACV,GAAQ,EAER,EAAM,MAAS,GAAO,IAAmB,EAEzC,KAAU,EACV,GAAQ,EAGJ,EAAM,KAAO,KAAO,EAAM,MAAQ,GAAI,CACxC,EAAK,IAAM,sCACX,EAAM,KAAO,GACb,MAIF,EAAM,KAAO,EACb,EAAM,KAAO,OAEV,IACH,KAAO,EAAM,KAAO,EAAM,OAAO,CAE/B,KAAO,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,EAAM,KAAK,EAAM,EAAM,SAAY,EAAO,EAE1C,KAAU,EACV,GAAQ,EAGV,KAAO,EAAM,KAAO,IAClB,EAAM,KAAK,EAAM,EAAM,SAAW,EAapC,GAPA,EAAM,QAAU,EAAM,OACtB,EAAM,QAAU,EAEhB,EAAO,CAAE,KAAM,EAAM,SACrB,EAAM,GAAc,GAAO,EAAM,KAAM,EAAG,GAAI,EAAM,QAAS,EAAG,EAAM,KAAM,GAC5E,EAAM,QAAU,EAAK,KAEjB,EAAK,CACP,EAAK,IAAM,2BACX,EAAM,KAAO,GACb,MAGF,EAAM,KAAO,EACb,EAAM,KAAO,OAEV,IACH,KAAO,EAAM,KAAO,EAAM,KAAO,EAAM,OAAO,CAC5C,KACE,EAAO,EAAM,QAAQ,EAAS,IAAK,EAAM,SAAW,GACpD,EAAY,IAAS,GACrB,EAAW,IAAS,GAAM,IAC1B,EAAW,EAAO,MAEb,KAAc,IANZ,CAQP,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,GAAI,EAAW,GAEb,KAAU,EACV,GAAQ,EAER,EAAM,KAAK,EAAM,QAAU,MAExB,CACH,GAAI,IAAa,GAAI,CAGnB,IADA,EAAI,EAAY,EACT,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAOV,GAHA,KAAU,EACV,GAAQ,EAEJ,EAAM,OAAS,EAAG,CACpB,EAAK,IAAM,4BACX,EAAM,KAAO,GACb,MAEF,GAAM,EAAM,KAAK,EAAM,KAAO,GAC9B,EAAO,EAAK,GAAO,GAEnB,KAAU,EACV,GAAQ,UAGD,IAAa,GAAI,CAGxB,IADA,EAAI,EAAY,EACT,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAIV,KAAU,EACV,GAAQ,EAER,GAAM,EACN,EAAO,EAAK,GAAO,GAEnB,KAAU,EACV,GAAQ,MAGL,CAGH,IADA,EAAI,EAAY,EACT,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAIV,KAAU,EACV,GAAQ,EAER,GAAM,EACN,EAAO,GAAM,GAAO,KAEpB,KAAU,EACV,GAAQ,EAGV,GAAI,EAAM,KAAO,EAAO,EAAM,KAAO,EAAM,MAAO,CAChD,EAAK,IAAM,4BACX,EAAM,KAAO,GACb,MAEF,KAAO,KACL,EAAM,KAAK,EAAM,QAAU,IAMjC,GAAI,EAAM,OAAS,GAAO,MAG1B,GAAI,EAAM,KAAK,OAAS,EAAG,CACzB,EAAK,IAAM,uCACX,EAAM,KAAO,GACb,MAeF,GATA,EAAM,QAAU,EAEhB,EAAO,CAAE,KAAM,EAAM,SACrB,EAAM,GAAc,GAAM,EAAM,KAAM,EAAG,EAAM,KAAM,EAAM,QAAS,EAAG,EAAM,KAAM,GAGnF,EAAM,QAAU,EAAK,KAGjB,EAAK,CACP,EAAK,IAAM,8BACX,EAAM,KAAO,GACb,MAcF,GAXA,EAAM,SAAW,EAGjB,EAAM,SAAW,EAAM,QACvB,EAAO,CAAE,KAAM,EAAM,UACrB,EAAM,GAAc,GAAO,EAAM,KAAM,EAAM,KAAM,EAAM,MAAO,EAAM,SAAU,EAAG,EAAM,KAAM,GAG/F,EAAM,SAAW,EAAK,KAGlB,EAAK,CACP,EAAK,IAAM,wBACX,EAAM,KAAO,GACb,MAIF,GADA,EAAM,KAAO,GACT,IAAU,GAAW,YAEtB,IACH,EAAM,KAAO,OAEV,IACH,GAAI,GAAQ,GAAK,GAAQ,IAAK,CAE5B,EAAK,SAAW,EAChB,EAAK,UAAY,EACjB,EAAK,QAAU,EACf,EAAK,SAAW,EAChB,EAAM,KAAO,EACb,EAAM,KAAO,EAEb,GAAa,EAAM,GAEnB,EAAM,EAAK,SACX,EAAS,EAAK,OACd,EAAO,EAAK,UACZ,EAAO,EAAK,QACZ,EAAQ,EAAK,MACb,EAAO,EAAK,SACZ,EAAO,EAAM,KACb,EAAO,EAAM,KAGT,EAAM,OAAS,IACjB,GAAM,KAAO,IAEf,MAGF,IADA,EAAM,KAAO,EAEX,EAAO,EAAM,QAAQ,EAAS,IAAK,EAAM,SAAW,GACpD,EAAY,IAAS,GACrB,EAAW,IAAS,GAAM,IAC1B,EAAW,EAAO,MAEd,KAAa,IANV,CAQP,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,GAAI,GAAY,GAAU,MAAU,EAAG,CAIrC,IAHA,GAAY,EACZ,EAAU,EACV,EAAW,EAET,EAAO,EAAM,QAAQ,EACX,IAAS,IAAM,GAAY,GAAY,IAAoC,KACrF,EAAY,IAAS,GACrB,EAAW,IAAS,GAAM,IAC1B,EAAW,EAAO,MAEb,KAAY,GAAc,IAPxB,CASP,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAIV,KAAU,GACV,GAAQ,GAER,EAAM,MAAQ,GAQhB,GALA,KAAU,EACV,GAAQ,EAER,EAAM,MAAQ,EACd,EAAM,OAAS,EACX,IAAY,EAAG,CAIjB,EAAM,KAAO,GACb,MAEF,GAAI,EAAU,GAAI,CAEhB,EAAM,KAAO,GACb,EAAM,KAAO,GACb,MAEF,GAAI,EAAU,GAAI,CAChB,EAAK,IAAM,8BACX,EAAM,KAAO,GACb,MAEF,EAAM,MAAQ,EAAU,GACxB,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAO,CAGf,IADA,EAAI,EAAM,MACH,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,EAAM,QAAU,EAAS,IAAK,EAAM,OAAS,EAE7C,KAAU,EAAM,MAChB,GAAQ,EAAM,MAEd,EAAM,MAAQ,EAAM,MAGtB,EAAM,IAAM,EAAM,OAClB,EAAM,KAAO,OAEV,IACH,KACE,EAAO,EAAM,SAAS,EAAS,IAAK,EAAM,UAAY,GACtD,EAAY,IAAS,GACrB,EAAW,IAAS,GAAM,IAC1B,EAAW,EAAO,MAEb,KAAc,IANZ,CAQP,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,GAAK,GAAU,MAAU,EAAG,CAI1B,IAHA,GAAY,EACZ,EAAU,EACV,EAAW,EAET,EAAO,EAAM,SAAS,EACZ,IAAS,IAAM,GAAY,GAAY,IAAoC,KACrF,EAAY,IAAS,GACrB,EAAW,IAAS,GAAM,IAC1B,EAAW,EAAO,MAEb,KAAY,GAAc,IAPxB,CASP,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAIV,KAAU,GACV,GAAQ,GAER,EAAM,MAAQ,GAOhB,GAJA,KAAU,EACV,GAAQ,EAER,EAAM,MAAQ,EACV,EAAU,GAAI,CAChB,EAAK,IAAM,wBACX,EAAM,KAAO,GACb,MAEF,EAAM,OAAS,EACf,EAAM,MAAS,EAAW,GAC1B,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAO,CAGf,IADA,EAAI,EAAM,MACH,EAAO,GAAG,CACf,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,EAAM,QAAU,EAAS,IAAK,EAAM,OAAS,EAE7C,KAAU,EAAM,MAChB,GAAQ,EAAM,MAEd,EAAM,MAAQ,EAAM,MAGtB,GAAI,EAAM,OAAS,EAAM,KAAM,CAC7B,EAAK,IAAM,gCACX,EAAM,KAAO,GACb,MAIF,EAAM,KAAO,OAEV,IACH,GAAI,IAAS,EAAK,QAElB,GADA,EAAO,EAAO,EACV,EAAM,OAAS,EAAM,CAEvB,GADA,EAAO,EAAM,OAAS,EAClB,EAAO,EAAM,OACX,EAAM,KAAM,CACd,EAAK,IAAM,gCACX,EAAM,KAAO,GACb,MAkBJ,AAAI,EAAO,EAAM,MACf,IAAQ,EAAM,MACd,EAAO,EAAM,MAAQ,GAGrB,EAAO,EAAM,MAAQ,EAEnB,EAAO,EAAM,QAAU,GAAO,EAAM,QACxC,EAAc,EAAM,WAGpB,GAAc,EACd,EAAO,EAAM,EAAM,OACnB,EAAO,EAAM,OAEf,AAAI,EAAO,GAAQ,GAAO,GAC1B,GAAQ,EACR,EAAM,QAAU,EAChB,EACE,GAAO,KAAS,EAAY,WACrB,EAAE,GACX,AAAI,EAAM,SAAW,GAAK,GAAM,KAAO,IACvC,UACG,IACH,GAAI,IAAS,EAAK,QAClB,EAAO,KAAS,EAAM,OACtB,IACA,EAAM,KAAO,GACb,UACG,IACH,GAAI,EAAM,KAAM,CAEd,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IAEA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAcV,GAXA,GAAQ,EACR,EAAK,WAAa,EAClB,EAAM,OAAS,EACX,GACF,GAAK,MAAQ,EAAM,MAEd,EAAM,MAAQ,GAAM,EAAM,MAAO,EAAQ,EAAM,EAAM,GAAQ,GAAQ,EAAM,MAAO,EAAQ,EAAM,EAAM,IAG7G,EAAO,EAEF,GAAM,MAAQ,EAAO,GAAQ,MAAW,EAAM,MAAO,CACxD,EAAK,IAAM,uBACX,EAAM,KAAO,GACb,MAGF,EAAO,EACP,EAAO,EAIT,EAAM,KAAO,OAEV,IACH,GAAI,EAAM,MAAQ,EAAM,MAAO,CAE7B,KAAO,EAAO,IAAI,CAChB,GAAI,IAAS,EAAK,QAClB,IACA,GAAQ,EAAM,MAAW,EACzB,GAAQ,EAGV,GAAI,IAAU,GAAM,MAAQ,YAAa,CACvC,EAAK,IAAM,yBACX,EAAM,KAAO,GACb,MAGF,EAAO,EACP,EAAO,EAIT,EAAM,KAAO,OAEV,IACH,EAAM,GACN,YACG,IACH,EAAM,GACN,YACG,IACH,MAAO,QACJ,YAGH,MAAO,IAsBb,MARA,GAAK,SAAW,EAChB,EAAK,UAAY,EACjB,EAAK,QAAU,EACf,EAAK,SAAW,EAChB,EAAM,KAAO,EACb,EAAM,KAAO,EAGT,GAAM,OAAU,IAAS,EAAK,WAAa,EAAM,KAAO,IACvC,GAAM,KAAO,IAAS,IAAU,MAC/C,GAAa,EAAM,EAAK,OAAQ,EAAK,SAAU,EAAO,EAAK,WAC7D,GAAM,KAAO,GACN,IAGX,IAAO,EAAK,SACZ,GAAQ,EAAK,UACb,EAAK,UAAY,EACjB,EAAK,WAAa,EAClB,EAAM,OAAS,EACX,EAAM,MAAQ,GAChB,GAAK,MAAQ,EAAM,MAChB,EAAM,MAAQ,GAAM,EAAM,MAAO,EAAQ,EAAM,EAAK,SAAW,GAAQ,GAAQ,EAAM,MAAO,EAAQ,EAAM,EAAK,SAAW,IAE/H,EAAK,UAAY,EAAM,KAAQ,GAAM,KAAO,GAAK,GAC9B,GAAM,OAAS,GAAO,IAAM,GAC5B,GAAM,OAAS,IAAQ,EAAM,OAAS,GAAQ,IAAM,GACjE,KAAQ,GAAK,IAAS,GAAM,IAAU,KAAa,IAAQ,IAC/D,GAAM,IAED,GAGT,YAAoB,EAAM,CAExB,GAAI,CAAC,GAAQ,CAAC,EAAK,MACjB,MAAO,IAGT,GAAI,GAAQ,EAAK,MACjB,MAAI,GAAM,QACR,GAAM,OAAS,MAEjB,EAAK,MAAQ,KACN,GAGT,YAA0B,EAAM,EAAM,CACpC,GAAI,GAKJ,MAFI,CAAC,GAAQ,CAAC,EAAK,OACnB,GAAQ,EAAK,MACR,GAAM,KAAO,IAAO,GAAY,GAGrC,GAAM,KAAO,EACb,EAAK,KAAO,GACL,IAGT,YAA8B,EAAM,EAAY,CAC9C,GAAI,GAAa,EAAW,OAExB,EACA,EACA,EAMJ,MAHI,CAAC,GAAwB,CAAC,EAAK,OACnC,GAAQ,EAAK,MAET,EAAM,OAAS,GAAK,EAAM,OAAS,IAC9B,GAIL,EAAM,OAAS,IACjB,GAAS,EAET,EAAS,GAAQ,EAAQ,EAAY,EAAY,GAC7C,IAAW,EAAM,OACZ,GAKX,GAAM,GAAa,EAAM,EAAY,EAAY,GAC7C,EACF,GAAM,KAAO,GACN,IAET,GAAM,SAAW,EAEV,KAGT,GAAQ,aAAe,GACvB,GAAQ,cAAgB,GACxB,GAAQ,iBAAmB,GAC3B,GAAQ,YAAc,GACtB,GAAQ,aAAe,GACvB,GAAQ,QAAU,GAClB,GAAQ,WAAa,GACrB,GAAQ,iBAAmB,GAC3B,GAAQ,qBAAuB,GAC/B,GAAQ,YAAc,uCCzgDtB,iCAqBA,GAAO,QAAU,CAGf,WAAoB,EACpB,gBAAoB,EACpB,aAAoB,EACpB,aAAoB,EACpB,SAAoB,EACpB,QAAoB,EACpB,QAAoB,EAKpB,KAAoB,EACpB,aAAoB,EACpB,YAAoB,EACpB,QAAmB,GACnB,eAAmB,GACnB,aAAmB,GAEnB,YAAmB,GAInB,iBAA0B,EAC1B,aAA0B,EAC1B,mBAA0B,EAC1B,sBAAyB,GAGzB,WAA0B,EAC1B,eAA0B,EAC1B,MAA0B,EAC1B,QAA0B,EAC1B,mBAA0B,EAG1B,SAA0B,EAC1B,OAA0B,EAE1B,UAA0B,EAG1B,WAA0B,KCjE5B,iCAqBA,aAAoB,CAElB,KAAK,KAAa,EAElB,KAAK,KAAa,EAElB,KAAK,OAAa,EAElB,KAAK,GAAa,EAElB,KAAK,MAAa,KAElB,KAAK,UAAa,EAWlB,KAAK,KAAa,GAIlB,KAAK,QAAa,GAIlB,KAAK,KAAa,EAElB,KAAK,KAAa,GAGpB,GAAO,QAAU,KCzDjB,4BAGA,GAAI,IAAe,KACf,GAAe,KACf,GAAe,KACf,GAAe,KACf,GAAe,KACf,GAAe,KACf,GAAe,KAEf,GAAW,OAAO,UAAU,SAiFhC,YAAiB,EAAS,CACxB,GAAI,CAAE,gBAAgB,KAAU,MAAO,IAAI,IAAQ,GAEnD,KAAK,QAAU,GAAM,OAAO,CAC1B,UAAW,MACX,WAAY,EACZ,GAAI,IACH,GAAW,IAEd,GAAI,GAAM,KAAK,QAIf,AAAI,EAAI,KAAQ,EAAI,YAAc,GAAO,EAAI,WAAa,IACxD,GAAI,WAAa,CAAC,EAAI,WAClB,EAAI,aAAe,GAAK,GAAI,WAAa,MAI1C,EAAI,YAAc,GAAO,EAAI,WAAa,IAC3C,CAAE,IAAW,EAAQ,aACvB,GAAI,YAAc,IAKf,EAAI,WAAa,IAAQ,EAAI,WAAa,IAGxC,GAAI,WAAa,KAAQ,GAC5B,GAAI,YAAc,IAItB,KAAK,IAAS,EACd,KAAK,IAAS,GACd,KAAK,MAAS,GACd,KAAK,OAAS,GAEd,KAAK,KAAS,GAAI,IAClB,KAAK,KAAK,UAAY,EAEtB,GAAI,GAAU,GAAa,aACzB,KAAK,KACL,EAAI,YAGN,GAAI,IAAW,GAAE,KACf,KAAM,IAAI,OAAM,GAAI,IAQtB,GALA,KAAK,OAAS,GAAI,IAElB,GAAa,iBAAiB,KAAK,KAAM,KAAK,QAG1C,EAAI,YAEN,CAAI,MAAO,GAAI,YAAe,SAC5B,EAAI,WAAa,GAAQ,WAAW,EAAI,YAC/B,GAAS,KAAK,EAAI,cAAgB,wBAC3C,GAAI,WAAa,GAAI,YAAW,EAAI,aAElC,EAAI,KACN,GAAS,GAAa,qBAAqB,KAAK,KAAM,EAAI,YACtD,IAAW,GAAE,OACf,KAAM,IAAI,OAAM,GAAI,IAkC5B,GAAQ,UAAU,KAAO,SAAU,EAAM,EAAM,CAC7C,GAAI,GAAO,KAAK,KACZ,EAAY,KAAK,QAAQ,UACzB,EAAa,KAAK,QAAQ,WAC1B,EAAQ,EACR,EAAe,EAAM,EAIrB,EAAgB,GAEpB,GAAI,KAAK,MAAS,MAAO,GACzB,EAAS,IAAS,CAAC,CAAC,EAAQ,EAAS,IAAS,GAAQ,GAAE,SAAW,GAAE,WAGrE,AAAI,MAAO,IAAS,SAElB,EAAK,MAAQ,GAAQ,cAAc,GAC9B,AAAI,GAAS,KAAK,KAAU,uBACjC,EAAK,MAAQ,GAAI,YAAW,GAE5B,EAAK,MAAQ,EAGf,EAAK,QAAU,EACf,EAAK,SAAW,EAAK,MAAM,OAE3B,EAAG,CAkBD,GAjBI,EAAK,YAAc,GACrB,GAAK,OAAS,GAAI,IAAM,KAAK,GAC7B,EAAK,SAAW,EAChB,EAAK,UAAY,GAGnB,EAAS,GAAa,QAAQ,EAAM,GAAE,YAElC,IAAW,GAAE,aAAe,GAC9B,GAAS,GAAa,qBAAqB,KAAK,KAAM,IAGpD,IAAW,GAAE,aAAe,IAAkB,IAChD,GAAS,GAAE,KACX,EAAgB,IAGd,IAAW,GAAE,cAAgB,IAAW,GAAE,KAC5C,YAAK,MAAM,GACX,KAAK,MAAQ,GACN,GAGT,AAAI,EAAK,UACH,GAAK,YAAc,GAAK,IAAW,GAAE,cAAiB,EAAK,WAAa,GAAM,KAAU,GAAE,UAAY,IAAU,GAAE,gBAEpH,CAAI,KAAK,QAAQ,KAAO,SAEtB,GAAgB,GAAQ,WAAW,EAAK,OAAQ,EAAK,UAErD,EAAO,EAAK,SAAW,EACvB,EAAU,GAAQ,WAAW,EAAK,OAAQ,GAG1C,EAAK,SAAW,EAChB,EAAK,UAAY,EAAY,EACzB,GAAQ,GAAM,SAAS,EAAK,OAAQ,EAAK,OAAQ,EAAe,EAAM,GAE1E,KAAK,OAAO,IAGZ,KAAK,OAAO,GAAM,UAAU,EAAK,OAAQ,EAAK,YAYhD,EAAK,WAAa,GAAK,EAAK,YAAc,GAC5C,GAAgB,UAGV,GAAK,SAAW,GAAK,EAAK,YAAc,IAAM,IAAW,GAAE,cAOrE,MALI,KAAW,GAAE,cACf,GAAQ,GAAE,UAIR,IAAU,GAAE,SACd,GAAS,GAAa,WAAW,KAAK,MACtC,KAAK,MAAM,GACX,KAAK,MAAQ,GACN,IAAW,GAAE,MAIlB,KAAU,GAAE,cACd,MAAK,MAAM,GAAE,MACb,EAAK,UAAY,GACV,KAgBX,GAAQ,UAAU,OAAS,SAAU,EAAO,CAC1C,KAAK,OAAO,KAAK,IAcnB,GAAQ,UAAU,MAAQ,SAAU,EAAQ,CAE1C,AAAI,IAAW,GAAE,MACf,CAAI,KAAK,QAAQ,KAAO,SAGtB,KAAK,OAAS,KAAK,OAAO,KAAK,IAE/B,KAAK,OAAS,GAAM,cAAc,KAAK,SAG3C,KAAK,OAAS,GACd,KAAK,IAAM,EACX,KAAK,IAAM,KAAK,KAAK,KA2CvB,YAAiB,EAAO,EAAS,CAC/B,GAAI,GAAW,GAAI,IAAQ,GAK3B,GAHA,EAAS,KAAK,EAAO,IAGjB,EAAS,IAAO,KAAM,GAAS,KAAO,GAAI,EAAS,KAEvD,MAAO,GAAS,OAYlB,YAAoB,EAAO,EAAS,CAClC,SAAU,GAAW,GACrB,EAAQ,IAAM,GACP,GAAQ,EAAO,GAcxB,GAAQ,QAAU,GAClB,GAAQ,QAAU,GAClB,GAAQ,WAAa,GACrB,GAAQ,OAAU,KCtalB,oBACA,aAEA,GAAI,IAAY,KAA8B,OAE1C,GAAY,KACZ,GAAY,KACZ,GAAY,KAEZ,GAAO,GAEX,GAAO,GAAM,GAAS,GAAS,IAE/B,GAAO,QAAU,KCbjB,kBCAA,eAsBA,aAEA,GAAI,IAAY,CAAC,EAAG,IAAM,MAAQ,SAAU,YAE5C,YAAoB,EAAW,EAAS,EAAS,EAAO,EAAQ,CAC9D,GAAI,GACJ,IAAK,EAAI,EAAG,EAAI,EAAQ,IACtB,EAAQ,EAAQ,GAAK,EAAU,EAAU,GAI7C,YAAwB,EAAO,EAAK,EAAQ,EAAQ,CAClD,GAAI,GACJ,IAAK,EAAI,EAAG,EAAI,EAAQ,IACtB,EAAM,EAAM,GAAK,EAAM,EAAM,EAAS,GAI1C,YAA6B,EAAY,CACvC,KAAK,MAAQ,EACb,KAAK,IAAM,EAGb,GAAmB,UAAU,uBAAyB,UAAY,CAIhE,OAHI,GAAS,EACT,EAAQ,EACR,EAAG,EACA,EAAQ,IAAM,KAAK,IAAM,KAAK,MAAM,QAAQ,CAIjD,GAHA,EAAI,KAAK,MAAM,KAAK,KACpB,KAAK,KAAO,EACZ,EAAM,EAAI,IACJ,GAAO,IAAW,IAAW,EACjC,MAAO,GAGT,GADA,GAAU,GAAO,EACb,EAAI,IACN,MAAO,GAET,GAAS,EAEX,MAAO,IAGT,GAAmB,UAAU,mBAAqB,SAAU,EAAW,CASrE,OARI,GAAQ,KAAK,MACb,EAAc,EAAM,OACpB,EAAM,KAAK,IACX,EAAS,EAET,EAAG,EAAK,EACR,EAEG,EAAM,EAAM,QAGjB,GAFA,EAAI,EAAM,GACV,GAAO,EACF,GAAI,IAAS,EAAG,CAGnB,GADA,EAAO,KAAM,GAAK,EACd,EAAM,GAAI,CACZ,GAAI,EAAM,GAAK,EACb,MAAO,GAET,EAAW,EAAM,GACjB,EAAM,EAAM,GAAQ,GAAM,EAAM,IAAM,GAAM,GAAM,EAAM,IAAM,IAAO,GAAM,EAAM,IAAM,IACvF,EAAO,GAAM,GAAU,IAAa,EACpC,GAAO,EAET,GAAI,EAAM,EAAM,EACd,MAAO,GAET,GAAU,EAAO,EAAK,EAAW,EAAQ,GACzC,GAAO,EACP,GAAU,MACL,CACL,OAAQ,EAAI,OACL,GACH,EAAQ,KAAM,EAAK,GAAO,EAC1B,EAAS,EAAM,GAAS,KAAM,GAAM,GACpC,GAAO,EACP,UACG,GACH,GAAI,EAAM,GAAK,EACb,MAAO,GAET,EAAO,KAAM,GAAK,EAClB,EAAS,EAAM,GAAQ,GAAM,EAAM,IAAM,GACzC,GAAO,EACP,UACG,GACH,GAAI,EAAM,GAAK,EACb,MAAO,GAET,EAAO,KAAM,GAAK,EAClB,EAAS,EAAM,GAAQ,GAAM,EAAM,IAAM,GAAM,GAAM,EAAM,IAAM,IAAO,GAAM,EAAM,IAAM,IAC1F,GAAO,EACP,cAEA,MAEJ,GAAI,IAAW,GAAK,EAAS,EAC3B,MAAO,GAET,GAAc,EAAW,EAAQ,EAAQ,GACzC,GAAU,EAGd,MAAO,IAGT,GAAQ,mBAAqB,KCnI7B,eAsBA,aAEA,GAAI,IAAY,GACZ,GAAa,GAAK,GAElB,GAAsB,GACtB,GAAmB,GAAI,OAAM,GAAsB,GAEvD,YAAmB,EAAK,EAAe,CACrC,MAAQ,GAAM,YAAgB,EAGhC,YAAiB,EAAO,EAAK,CAC3B,MAAO,GAAM,GAAQ,GAAM,EAAM,IAAM,GAAM,GAAM,EAAM,IAAM,IAAO,GAAM,EAAM,IAAM,IAG1F,YAAmB,EAAO,EAAM,EAAM,CACpC,MAAO,GAAM,KAAU,EAAM,IACtB,EAAM,EAAO,KAAO,EAAM,EAAO,IACjC,EAAM,EAAO,KAAO,EAAM,EAAO,IACjC,EAAM,EAAO,KAAO,EAAM,EAAO,GAG1C,YAAoB,EAAW,EAAS,EAAS,EAAO,EAAQ,CAC9D,GAAI,GACJ,IAAK,EAAI,EAAG,EAAI,EAAQ,IACtB,EAAQ,EAAQ,GAAK,EAAU,EAAU,GAI7C,YAAsB,EAAO,EAAI,EAAK,EAAQ,EAAI,CAChD,MAAI,IAAO,GACT,GAAO,GAAO,EAAM,GAAM,EAC1B,GAAM,GACD,AAAI,EAAM,IACf,GAAO,GAAM,IAAM,EACnB,EAAO,EAAK,GAAK,EAAM,EACvB,GAAM,GAEN,GAAO,GAAM,IAAM,EACnB,EAAO,EAAK,GAAM,EAAM,EAAK,IAC7B,EAAO,EAAK,GAAM,EAAM,IAAO,EAC/B,GAAM,GAER,GAAU,EAAO,EAAI,EAAQ,EAAI,GAC1B,EAAK,EAGd,YAA6B,EAAQ,EAAI,EAAQ,EAAK,CACpD,MAAI,GAAM,IAAM,EAAS,KACvB,GAAO,GAAM,EAAM,GAAM,GAAM,GAAO,KAAW,GAAM,GACvD,EAAO,EAAK,GAAK,EAAS,IACnB,EAAK,GAEZ,GAAO,GAAM,EAAM,GAAM,GAAM,GAC/B,EAAO,EAAK,GAAK,EAAS,IAC1B,EAAO,EAAK,GAAK,IAAW,EACrB,EAAK,GAIhB,YAAmB,EAAQ,EAAI,EAAQ,EAAK,CAC1C,KAAO,GAAO,IACZ,EAAK,GAAmB,EAAQ,EAAI,EAAQ,IAC5C,GAAO,GAET,MAAI,GAAM,IACR,GAAK,GAAmB,EAAQ,EAAI,EAAQ,IAC5C,GAAO,IAEF,GAAmB,EAAQ,EAAI,EAAQ,GAGhD,YAA2B,EAAO,EAAI,EAAW,EAAQ,EAAI,CAE3D,OADI,GAAgB,EACZ,GAAK,GAAkB,GACxB,GAAiB,IACtB,GAAiB,EAEnB,GAAiB,EACjB,GAAI,GAAgB,GAAK,EAEzB,AAAI,MAAO,IAAiB,IAAmB,aAC7C,IAAiB,GAAiB,GAAI,aAAY,GAAK,IAEzD,GAAI,GAAY,GAAiB,GAC7B,EACJ,IAAK,EAAI,EAAG,EAAI,EAAU,OAAQ,IAChC,EAAU,GAAK,EAGjB,GAAI,GAAQ,EAAK,EACb,EACA,EAAS,EACT,EAAW,EAEX,EAAM,EACN,EAAQ,EAAW,EACnB,EACA,EAAM,GAAS,EACf,EAAU,GACV,EAAO,GAEP,GAAe,GACnB,GAAI,GAAa,GAMf,IALA,EAAU,EAAQ,GAElB,GAAM,EACN,EAAW,GAAS,GAAO,EAAO,GAAK,GAEhC,GAAM,CACX,EAAO,GACP,EAAS,EACT,EAAG,CAMD,GALA,EAAK,EACL,EAAO,EACP,EAA0B,IAAS,EACnC,GAAQ,EACR,EAAS,EAAK,EACV,EAAK,EAAS,CAChB,EAAO,GACP,MAEF,EAAW,GAAS,GAAO,EAAO,GAAS,GAC3C,EAAY,EAAS,EAAU,GAC/B,EAAU,GAAQ,EAAK,QAChB,CAAC,GAAS,EAAO,EAAI,IAE9B,GAAI,CAAC,EACH,MAGF,EAAK,GAAY,EAAO,EAAU,EAAK,EAAU,EAAQ,GAEzD,EAAG,CAGD,IAFA,EAAO,EACP,GAAU,EACH,EAAK,GAAU,GAAS,EAAM,EAAK,MAAa,EAAM,EAAY,KACvE,IAAW,EAOb,GALA,GAAM,GACN,EAAS,EAAO,EAChB,EAAK,GAAS,EAAQ,EAAI,EAAQ,IAElC,EAAW,EACP,GAAM,EAAS,CACjB,EAAO,GACP,MAEF,EAAW,GAAS,GAAO,EAAO,EAAK,GAAI,GAC3C,EAAU,GAAY,EAAK,EAAI,EAC/B,GAAU,GAAS,GAAO,EAAO,GAAK,GACtC,EAAY,EAAS,EAAU,IAC/B,EAAU,IAAW,EAAK,QACnB,GAAS,EAAO,EAAI,IAE7B,GAAI,CAAC,EACH,MAGF,GAAM,EACN,EAAW,GAAS,GAAO,EAAO,GAAK,GAI3C,MAAI,GAAW,GACb,GAAK,GAAY,EAAO,EAAU,EAAQ,EAAU,EAAQ,IAGvD,EAGT,YAAoB,EAAO,EAAQ,EAAI,CACrC,EACE,GAAO,GAAM,EAAQ,IACrB,EAAQ,IAAU,EACd,EAAQ,GACV,GAAO,IAAO,KAEhB,GAAM,QACC,EAAQ,GACjB,MAAO,GAGT,YAA2B,EAAc,CACvC,KAAK,MAAQ,EAGf,GAAiB,UAAU,oBAAsB,UAAY,CAC3D,GAAI,GAAY,KAAK,MAAM,OAC3B,MAAO,IAAK,EAAY,KAAK,MAAM,EAAY,IAGjD,GAAiB,UAAU,iBAAmB,SAAU,EAAW,CACjE,GAAI,GAAQ,KAAK,MACb,EAAS,EAAM,OACf,EAAM,EACN,EAAS,EAET,EAGJ,IADA,EAAS,GAAU,EAAQ,EAAW,GAC/B,EAAM,GACX,EAAe,KAAK,IAAI,EAAS,EAAK,IACtC,EAAS,GAAiB,EAAO,EAAK,EAAc,EAAW,GAC/D,GAAO,EAGT,MAAO,IAGT,GAAQ,iBAAmB,KCzO3B,eAsBA,aAEA,aAAmB,CACjB,MAAI,OAAO,UAAY,UACjB,MAAO,SAAQ,UAAa,UAC1B,MAAO,SAAQ,SAAS,MAAS,YAQ3C,YAAuB,EAAQ,CAC7B,MAAO,aAAkB,aAAe,EAAC,MAAY,CAAC,OAAO,SAAS,IAGxE,YAAwB,EAAQ,CAC9B,MAAO,aAAkB,aAG3B,YAAmB,EAAQ,CACzB,MAAK,MAGE,OAAO,SAAS,GAFd,GAKX,GAAI,IAAqB,KAAiC,mBACtD,GAAmB,KAA+B,iBAElD,GAAiB,yEAErB,YAAqB,EAAY,CAC/B,GAAI,CAAC,GAAa,IAAe,CAAC,GAAc,IAAe,CAAC,GAAS,GACvE,KAAM,IAAI,WAAU,IAEtB,GAAI,GAAY,GACZ,EAAkB,GACtB,AAAI,GAAa,GACf,EAAY,GACH,GAAc,IACvB,GAAkB,GAClB,EAAa,GAAI,YAAW,IAE9B,GAAI,GAAe,GAAI,IAAmB,GACtC,EAAS,EAAa,yBAC1B,GAAI,IAAW,GACb,KAAM,IAAI,OAAM,4BAElB,GAAI,GAAc,EAClB,GAAI,GAEF,GADA,EAAe,GAAI,YAAW,GAC1B,CAAC,EAAa,mBAAmB,GACnC,KAAM,IAAI,OAAM,oCAET,GAGT,GAFA,EAAe,GAAI,aAAY,GAC/B,EAAmB,GAAI,YAAW,GAC9B,CAAC,EAAa,mBAAmB,GACnC,KAAM,IAAI,OAAM,oCAGlB,EAAe,OAAO,MAAM,GACxB,CAAC,EAAa,mBAAmB,GACnC,KAAM,IAAI,OAAM,4BAGpB,MAAO,GAGT,YAAmB,EAAc,CAC/B,GAAI,CAAC,GAAa,IAAiB,CAAC,GAAc,IAAiB,CAAC,GAAS,GAC3E,KAAM,IAAI,WAAU,IAEtB,GAAI,GAAY,GACZ,EAAkB,GACtB,AAAI,GAAa,GACf,EAAY,GACH,GAAc,IACvB,GAAkB,GAClB,EAAe,GAAI,YAAW,IAEhC,GAAI,GAAa,GAAI,IAAiB,GAClC,EAAY,EAAW,sBACvB,EAAY,EACZ,EAYJ,GAXA,AAAI,EACF,GAAa,GAAI,YAAW,GAC5B,EAAS,EAAW,iBAAiB,IAChC,AAAI,EACT,GAAa,GAAI,aAAY,GAC7B,EAAiB,GAAI,YAAW,GAChC,EAAS,EAAW,iBAAiB,IAErC,GAAa,OAAO,MAAM,GAC1B,EAAS,EAAW,iBAAiB,IAEnC,CAAC,EAAW,MAAO,CACrB,GAAI,GAAkB,GAAI,YAAW,MAAM,UAAU,MAAM,KAAK,EAAY,EAAG,IAC/E,GAAI,EACF,MAAO,GACF,GAAI,EACT,MAAO,GAAgB,OAEvB,KAAM,IAAI,OAAM,mBAIpB,MAAO,GAAW,MAAM,EAAG,GAG7B,GAAQ,WAAa,GACrB,GAAQ,SAAW,KCvInB,eAEA,GAAQ,QAAU,SAAkB,EAAG,CACrC,SAAI,EAAI,EACR,EAAI,EAAI,WAAc,IAAK,IAAM,EACjC,EAAI,EAAI,WAAa,IAAM,GAC3B,EAAI,EAAI,UAAa,IAAK,GAAK,EAC/B,EAAI,EAAI,WAAa,GAAK,EAC1B,EAAI,EAAI,UAAa,IAAK,GAAK,EACxB,EAAI,YAAc,IAAM,GAAK,GAItC,GAAQ,QAAU,SAAkB,EAAG,EAAG,CACxC,GAAI,GAAI,EACR,UAAK,EAAE,MAAQ,EACf,GAAK,EAAE,MAAQ,EACf,GAAK,EAAE,MAAQ,GACf,GAAK,EAAE,MAAQ,GACf,GAAK,EAAE,MAAQ,GACf,GAAK,EAAE,MAAQ,GACf,GAAK,EAAE,MAAQ,GACf,GAAK,EAAE,MAAQ,GACR,GAIT,GAAQ,QAAU,SAAkB,EAAG,EAAG,CACxC,GAAI,GAAI,EACR,UAAK,EAAE,MAAQ,EACf,GAAK,EAAE,MAAQ,EACf,GAAK,EAAE,MAAQ,GACf,GAAK,EAAE,MAAQ,GACR,GAIT,GAAQ,SAAW,SAAmB,EAAG,EAAG,EAAG,CAC7C,EAAE,KAAQ,GAAK,EAAK,IACpB,EAAE,KAAQ,GAAK,EAAK,IACpB,EAAE,KAAQ,GAAK,GAAM,IACrB,EAAE,KAAQ,GAAK,GAAM,KAKvB,GAAQ,KAAO,SAAe,EAAG,EAAG,CAClC,GAAI,GAAK,IAAM,GACX,EAAK,EAAI,MACT,EAAK,IAAM,GACX,EAAK,EAAI,MAEb,MAAO,GAAK,EAAM,GAAK,EAAK,EAAK,GAAM,IAAM,KCpD/C,eACA,GAAI,IAAO,KAGP,GAAS,WACT,GAAS,WACT,GAAS,WACT,GAAS,UACT,GAAS,UAKb,YAAiB,EAAG,EAAG,CACrB,SAAI,EAAI,EACR,EAAI,EAAI,EAED,IAAO,IAAK,EAAI,GAAK,GAAK,EAAI,EAGvC,YAAmB,EAAG,EAAG,EAAG,CAC1B,SAAI,EAAI,EACR,EAAI,EAAI,EACR,EAAI,EAAI,EAED,GAAK,KAAK,IAAO,IAAK,EAAI,GAAK,GAAK,EAAG,GAAK,EAGrD,YAAqB,EAAG,EAAG,CACzB,SAAI,EAAI,EACR,EAAI,EAAI,EAED,IAAM,EAAI,EAAI,EAMvB,YAAmB,EAAG,EAAK,EAAI,EAAG,EAAI,CACpC,MAAO,IAAS,GAAK,KAAK,EAAK,GAAM,EAAG,EAAG,GAG7C,YAAe,EAAG,EAAK,EAAO,CAC5B,MAAO,IAAU,EAAI,GAAK,KAAK,EAAI,GAAQ,IAAU,GAAI,IAG3D,YAAe,EAAG,EAAK,EAAO,CAC5B,MAAO,IAAS,EAAG,GAAK,QAAQ,EAAK,GAAQ,GAAQ,GAAI,IAG3D,YAAgB,EAAG,EAAK,EAAO,CAC7B,MAAO,CACL,GAAS,EAAE,GAAI,GAAK,QAAQ,EAAK,EAAQ,GAAI,GAAQ,GAAI,IACzD,GAAS,EAAE,GAAI,GAAK,QAAQ,EAAK,EAAQ,GAAI,GAAQ,GAAI,IACzD,GAAS,EAAE,GAAI,GAAK,QAAQ,EAAK,EAAQ,GAAI,GAAQ,GAAI,IACzD,GAAS,EAAE,GAAI,GAAK,QAAQ,EAAK,EAAQ,IAAK,GAAQ,GAAI,KAI9D,YAAgB,EAAM,EAAK,EAAO,EAAK,CACrC,GAAI,GAAG,EAEP,GADA,EAAI,EACA,GAAO,GAAI,CAQb,IAPA,EAAI,CACF,EAAO,GAAS,GAChB,EAAO,GACP,EACA,EAAO,IAGF,GAAO,IACZ,EAAI,GAAM,EAAG,EAAK,GAElB,GAAS,GACT,GAAO,GAGT,EAAI,GAAO,EAAE,GAAI,GAAK,GAAO,EAAE,GAAI,GAAK,GAAO,EAAE,GAAI,IAAM,GAAO,EAAE,GAAI,IAAM,MAE9E,GAAK,EAAO,GAAS,IAAS,EAGhC,KAAO,GAAO,GACZ,EAAI,GAAK,EAAG,EAAK,GAEjB,GAAS,EACT,GAAO,EAGT,KAAO,EAAM,GACX,EAAI,GAAK,EAAG,EAAK,GAEjB,IACA,IAGF,SAAI,GAAW,GAAK,KAAK,GAAW,GAAK,KAAK,GAAW,EAAG,IAAK,IAAS,IAAK,IAAS,IAEjF,IAAM,EAGf,GAAQ,KAAO,KCrGf,eAUA,GAAI,IAAS,KACT,GAAO,KAMP,GAAW,EACX,GAAY,GACZ,GAAc,EACd,GAAc,EACd,GAAW,GAAK,GAGhB,GAAS,EACT,GAAU,IAAK,IAAU,EACzB,GAAU,EACV,GAAW,IAAK,IAAW,EAG3B,GAAW,GAAW,GAAK,IAC3B,GAAY,KAGZ,GAAW,UAGX,GAAkB,EAClB,GAAgB,EAChB,GAAgB,GAEhB,GAAY,GACZ,GAAgB,IAGhB,GAAiB,WACjB,GAAY,EACZ,GAAU,EACV,GAAS,EACT,GAAQ,CACV,EAAG,MACH,EAAG,OACH,EAAG,QACH,EAAG,SAOL,aAA0B,CACxB,GAAI,CACF,MAAO,IAAI,aAAY,SACvB,CAGA,OAFI,GAAY,GAAI,OAAM,IAEjB,EAAI,EAAG,EAAI,GAAU,IAC5B,EAAU,GAAK,EAGjB,MAAO,IAKX,YAAyB,EAAO,CAC9B,OAAS,GAAI,EAAG,EAAI,GAAU,IAC5B,GAAU,GAAK,EAKnB,YAAqB,EAAM,CACzB,GAAI,CACF,MAAO,IAAI,YAAW,QACtB,CAGA,OAFI,GAAM,GAAI,OAAM,GAEX,EAAI,EAAG,EAAI,EAAM,IACxB,EAAI,GAAK,EAGX,MAAO,IAIX,YAAqB,EAAO,EAAO,EAAK,CACtC,GAAI,MAAO,GAAM,SAAW,OAAW,CACrC,GAAI,WAAW,UAAU,MACvB,MAAO,GAAM,MAAM,EAAO,GAG1B,GAAI,GAAM,EAAM,OAGhB,EAAQ,EAAQ,EAChB,EAAS,EAAQ,EAAK,KAAK,IAAI,EAAM,EAAO,GAAK,KAAK,IAAI,EAAO,GAGjE,EAAO,IAAQ,OAAa,EAAM,EAAM,EACxC,EAAO,EAAM,EAAK,KAAK,IAAI,EAAM,EAAK,GAAK,KAAK,IAAI,EAAK,GAIzD,OADI,GAAa,GAAI,YAAW,EAAM,GAC7B,EAAI,EAAO,EAAI,EAAG,EAAI,GAC7B,EAAW,KAAO,EAAM,KAG1B,MAAO,OAIT,OAAO,GAAM,MAAM,EAAO,GAQ9B,GAAQ,cAAgB,SAAwB,EAAG,CACjD,MAAQ,GAAK,EAAI,IAAO,GAAM,GAIhC,GAAQ,gBAAkB,SAA0B,EAAK,CACvD,GAAI,GAAS,EAGb,GAAI,GAAK,QAAQ,EAAK,KAAY,GAChC,KAAM,IAAI,OAAM,wBAGlB,GAAU,EAGV,GAAI,GAAa,EAAI,KAGrB,GAAK,GAAa,MAAmB,GACnC,KAAM,IAAI,OAAM,mCAAsC,GAAa,KAIrE,GAAI,GAAe,GAAa,KAAmB,EAC/C,EAAkB,GAAa,KAAmB,EAGlD,EAAS,EAAI,MAAa,GAAW,GAEzC,GAAI,GAAM,KAAW,OACnB,KAAM,IAAI,OAAM,sBAAwB,GAG1C,GAAI,GAAe,GAAM,GAGzB,GAAI,EACF,MAAO,IAAK,QAAQ,EAAK,GAI3B,IAIA,OADI,GAAU,IACD,CACX,GAAI,GAAY,GAAK,QAAQ,EAAK,GAUlC,GATA,GAAU,EAEV,AAAI,EAAY,GACd,IAAa,CAAC,GACd,GAAW,GAEX,GAAW,EAGT,IAAc,EAChB,MAAO,GAGT,AAAI,GACF,IAAU,GAGZ,GAAU,IAKd,GAAQ,WAAa,GAGrB,GAAQ,gBAAkB,SAA0B,EAAK,EAAK,EAAQ,EAAS,EAAQ,CACrF,GAAI,GAAS,EAAS,EAAM,EAAG,EAM/B,IAHA,EAAO,EAAS,EAGT,EAAS,GAAM,CACpB,GAAI,GAAQ,EAAI,KAGZ,EAAgB,GAAS,EAC7B,GAAI,EAAe,EAAG,CAEpB,GAAI,IAAiB,GACnB,KACE,GAAgB,EAAI,GAChB,EAAI,OAAc,KAAtB,CAOJ,IAAK,EAAI,EAAS,EAAc,EAAS,GACvC,EAAI,KAAY,EAAI,KAIxB,GAAI,GAAU,EACZ,MAUF,GANA,EAAW,EAAQ,GAGnB,EAAU,EAAI,KAAa,EAAI,MAAa,EAGxC,IAAY,GACd,KACE,GAAW,EAAI,GACX,EAAI,OAAc,KAAtB,CASJ,IAHA,GAAW,GAGN,EAAI,EAAS,EAAS,EAAI,EAAI,EAAS,EAAI,GAC9C,EAAI,KAAY,EAAI,KAAO,EAI/B,MAAO,IAIT,GAAQ,cAAgB,SAAwB,EAAK,EAAK,EAAQ,EAAS,EAAW,CACpF,GAAI,GAAQ,EAAS,EAAS,EAAS,EACnC,EAAc,EAAQ,EAAM,EAQhC,GALA,EAAS,EACT,EAAO,EAAU,EACjB,EAAU,EAGN,GAAW,GAIb,OAHI,GAAoB,IAAK,IAAe,EAGrC,EAAS,GAAW,EAAO,IAAa,CAC7C,GAAI,GAAM,GAAK,QAAQ,EAAK,GACxB,EAAO,GAAK,QAAQ,KAAS,EAYjC,GATA,EAAS,IAAQ,GAAM,KAAU,EAAI,MAGrC,EAAS,EAAU,GAAQ,EAG3B,EAAU,GAAQ,EAAS,EAGvB,EAAS,GAAO,EAAS,IAAY,GAAM,GAAK,GAAK,QAAQ,EAAK,KAAY,EAAK,CACrF,EAAQ,KAAsB,GAC9B,GAAU,EACV,SAiBF,IAdA,EAAoB,IAAK,IAAe,EAGxC,EAAe,EAAS,EACxB,EAAU,EAAS,EAGnB,GAAU,GACV,GAAU,GAKV,EAAU,EACH,EAAS,EAAO,IAAe,EAAI,KAAY,EAAI,IACxD,IACA,IAEF,EAAU,EAAS,EAGnB,GAAI,GAAQ,EAAU,GAAS,EAAU,GACzC,GAAI,GAAgB,GAAS,CAE3B,IADA,EAAI,KAAa,KAAW,IAAU,EACjC,EAAI,EAAe,GAAS,GAAK,IAAM,GAAK,IAC/C,EAAI,KAAY,IAElB,EAAI,KAAY,MAEhB,GAAI,KAAa,IAAgB,IAAU,EAI7C,OAAS,GAAI,EAAG,EAAI,EAAc,IAChC,EAAI,KAAY,EAAI,EAAU,GAQhC,GAJA,EAAI,KAAY,EAChB,EAAI,KAAa,GAAW,EAGxB,GAAW,GAAQ,CACrB,IAAK,EAAI,EAAU,GAAQ,GAAK,IAAM,GAAK,IACzC,EAAI,KAAY,IAElB,EAAI,KAAY,EAIlB,EAAU,EAKd,GAAI,IAAY,EACd,MAAO,GAMT,GADA,EAAe,EAAO,EAClB,GAAgB,GAAS,CAE3B,IADA,EAAI,KAAa,IAAW,GACvB,EAAI,EAAe,GAAS,GAAK,IAAM,GAAK,IAC/C,EAAI,KAAY,IAElB,EAAI,KAAY,MAEhB,GAAI,KAAa,GAAgB,GAKnC,IADA,EAAS,EACF,EAAS,GACd,EAAI,KAAY,EAAI,KAGtB,MAAO,IAIT,GAAQ,gBAAkB,SAA0B,EAAK,EAAK,CAC5D,GAAI,GAAa,EAAe,EAAgB,EAC5C,EAAS,EACT,EAAS,EAGb,GAAI,GAAK,QAAQ,EAAK,KAAY,GAChC,KAAM,IAAI,OAAM,wBASlB,GANA,GAAU,EAGV,EAAa,EAAI,KAGZ,GAAa,MAAmB,GACnC,KAAM,IAAI,OAAM,mCAIlB,EAAe,GAAa,KAAmB,EAC/C,EAAiB,GAAa,KAAqB,EACnD,EAAkB,GAAa,KAAmB,EAGlD,GAAI,GAAS,EAAI,MAAa,GAAW,GAEzC,GAAI,GAAM,KAAW,OACnB,KAAM,IAAI,OAAM,sBAWlB,IARI,GAEF,IAAU,GAGZ,MAGa,CACX,GAAI,GAKJ,GAHA,EAAW,GAAK,QAAQ,EAAK,GAC7B,GAAU,EAEN,IAAa,EACf,MASF,GANI,GAEF,IAAU,GAIP,GAAW,KAAoB,EAAG,CAErC,GAAY,CAAC,GAGb,OAAS,GAAI,EAAG,EAAI,EAAU,IAC5B,EAAI,KAAY,EAAI,SAItB,GAAS,GAAQ,gBAAgB,EAAK,EAAK,EAAQ,EAAU,GAC7D,GAAU,EAId,MAAI,IAEF,IAAU,GAGL,GAIT,GAAQ,cAAgB,SAAwB,EAAK,EAAK,CACxD,GAAI,GAAS,EAGb,GAAK,SAAS,EAAK,EAAQ,IAC3B,GAAU,EAGV,EAAI,KAAY,GAChB,EAAI,KAAY,IAAa,GAG7B,EAAI,GAAU,GAAO,KAAK,EAAG,EAAK,EAAG,EAAS,IAAM,EACpD,IAGA,GAAI,GAAe,GAAM,IACrB,EAAY,EAAI,OAChB,EAAS,EAMb,IAHA,GAAe,IAGR,EAAY,GAAG,CACpB,GAAI,GAAW,EACX,EAAY,EAAY,EAAe,EAAe,EAI1D,GAFA,EAAW,GAAQ,cAAc,EAAK,GAAU,EAAQ,EAAW,IAE/D,EAAW,GAAa,IAAa,EAAG,CAE1C,GAAK,SAAS,EAAK,EAAQ,WAAa,GACxC,GAAU,EAEV,OAAS,GAAI,EAAS,EAAW,EAAS,GACxC,EAAI,KAAY,EAAI,KAGtB,GAAa,MACR,CAEL,GAAK,SAAS,EAAK,EAAQ,GAC3B,GAAU,EAEV,OAAS,GAAI,EAAG,EAAI,GAClB,EAAI,KAAY,GAAS,KAG3B,GAAU,EACV,GAAa,GAKjB,UAAK,SAAS,EAAK,EAAQ,GAC3B,GAAU,EAEH,GAMT,GAAQ,WAAa,SAAqB,EAAK,EAAS,CACtD,GAAI,GAAK,EAET,MAAI,KAAY,QACd,GAAU,GAAQ,gBAAgB,IAGpC,EAAM,GAAQ,WAAW,GACzB,EAAO,GAAQ,gBAAgB,EAAK,GAEhC,IAAS,GACX,GAAM,GAAW,EAAK,EAAG,IAGpB,GAMT,GAAQ,SAAW,SAAmB,EAAK,EAAS,CAClD,GAAI,GAAK,EAET,MAAI,KAAY,QACd,GAAU,GAAQ,cAAc,EAAI,SAGtC,EAAM,GAAQ,WAAW,GACzB,EAAO,GAAQ,cAAc,EAAK,GAE9B,IAAS,GACX,GAAM,GAAW,EAAK,EAAG,IAGpB,KC9iBT,oBAkBA,GAAI,IAAO,GAAQ,QAEf,GAAO,GAAQ,KAAO,CACxB,KAAM,EACN,KAAM,EACN,KAAM,EACN,KAAM,EACN,IAAK,EACL,OAAQ,EACR,IAAK,EACL,IAAK,EACL,IAAK,GACL,OAAQ,GACR,KAAM,GACN,OAAQ,GACR,IAAK,GACL,IAAK,GACL,KAAM,GACN,KAAM,GACN,MAAO,IAGT,GAAQ,YAAc,CACpB,KAAM,EACN,MAAO,EACP,UAAW,EACX,OAAQ,GAGV,GAAQ,WAAa,GAErB,YAAoB,EAAS,CAC3B,MAAM,KAAK,MACP,MAAM,oBAAsB,QAC9B,MAAM,kBAAkB,KAAM,KAAK,aAGrC,KAAK,KAAO,KAAK,YAAY,KAC7B,KAAK,QAAU,EAEjB,GAAK,SAAS,GAAY,OAE1B,GAAI,IAA4B,GAAQ,0BAA4B,CAClE,QAAS,EACT,eAAgB,EAChB,qBAAsB,EACtB,kBAAmB,EACnB,gBAAiB,EACjB,eAAgB,EAChB,eAAgB,EAChB,eAAgB,EAChB,kBAAmB,EACnB,iBAAkB,EAClB,wBAAyB,IAG3B,GAAQ,sBAAwB,GAEhC,YAA+B,EAAM,EAAS,CAC5C,GAAW,KAAK,MACZ,MAAM,oBAAsB,QAC9B,MAAM,kBAAkB,KAAM,KAAK,aAGrC,KAAK,KAAO,GAAQ,GAA0B,QAC9C,KAAK,KAAO,KAAK,YAAY,KAC7B,KAAK,QAAU,EAEjB,GAAK,SAAS,GAAuB,IAErC,GAAsB,UAAU,KAAO,SAAS,EAAO,CAIrD,OAHI,GACA,EAAM,EAAM,gBAAgB,yBAG5B,EAAM,EAAM,iBACT,EAAI,OAAS,GAAK,MAFjB,CAKJ,OAAO,EAAI,SACF,GACD,AAAI,EAAI,OAAS,GAAK,OAClB,GAAM,EAAM,aACZ,KAAK,QAAU,GAEf,EAAM,EAAM,KAAK,EAAI,OAEzB,UACC,GACD,AAAI,EAAI,OAAS,GAAK,IAClB,GAAM,EAAM,UACZ,KAAK,KAAO,GAEZ,EAAQ,EAAM,KAAK,EAAI,OAE3B,cAEA,EAAM,EAAM,KAAK,EAAI,OACrB,MAER,EAAM,eAEV,EAAM,iBAGR,GAAsB,UAAU,MAAQ,SAAS,EAAO,CACtD,EAAO,iBAAiB,yBAEpB,KAAK,SACL,GAAO,gBAAgB,UAAW,GAAK,OAAQ,GAC/C,EAAO,YAAY,KAAK,SACxB,EAAO,iBAGP,KAAK,MACL,GAAO,gBAAgB,OAAQ,GAAK,IAAK,GACzC,EAAO,SAAS,KAAK,MACrB,EAAO,iBAGX,EAAO,iBACP,EAAO,kBAGT,GAAI,IAAyB,GAAQ,uBAAyB,CAC5D,QAAS,EACT,aAAc,EACd,cAAe,EACf,WAAY,EACZ,YAAa,EACb,gBAAiB,EACjB,YAAa,GAIf,GAAQ,mBAAqB,GAE7B,YAA4B,EAAM,EAAS,CACzC,MAAM,KAAK,MACP,MAAM,oBAAsB,QAC9B,MAAM,kBAAkB,KAAM,KAAK,aAGrC,KAAK,KAAO,KAAK,YAAY,KAC7B,KAAK,KAAO,EACZ,KAAK,QAAU,EAEjB,GAAK,SAAS,GAAoB,OAElC,GAAQ,aAAe,SAAS,EAAK,CACnC,MAAO,QAAO,KAAK,GAAK,QAG1B,GAAQ,SAAW,SAAS,EAAa,EAAkB,CACzD,GAAK,SAAS,EAAa,IAG7B,GAAI,IAAU,GAEd,GAAW,SAAS,EAAK,EAAO,CAE9B,GAAI,CAAC,EAAM,MAAO,GAElB,GAAI,GAEJ,AAAI,EAAM,QAAU,OAClB,EAAO,EAGP,EAAO,EAAM,GAEf,GAAI,GAAO,EAEP,EAAM,EAAI,OAAQ,EAAS,GAAI,EAAG,EACtC,IAAK,EAAI,EAAG,EAAI,EAAK,IACnB,EAAM,EAAI,GACV,AAAI,IAAS,KACX,EAAO,KAAK,GAET,AAAI,IAAS,IAAW,IAAS,GACpC,EAAO,KAAK,EAAK,EAAK,EAAM,MAAM,KAGlC,EAAO,KAAK,GAAI,GAAK,IAGzB,MAAO,IAGT,GAAU,SAAS,EAAK,EAAM,CAE5B,GAAI,CAAC,EAAM,MAAO,GAElB,GAAI,GAEJ,AAAI,EAAM,QAAU,OAClB,EAAO,EAGP,EAAO,EAAM,GAEf,GAAI,GAAO,EAEP,EAAS,GAAI,EACjB,OAAQ,KAAQ,GACd,AAAG,EAAI,eAAe,IACpB,GAAM,EAAI,GACV,AAAI,IAAS,KACX,EAAO,GAAQ,EAEZ,AAAI,IAAS,IAAW,IAAS,GACpC,EAAO,GAAQ,EAAK,EAAK,EAAM,MAAM,IAGrC,EAAO,GAAQ,GAAI,GAAK,IAI9B,MAAO,IAGT,GAAO,QAAQ,QAAU,GACzB,GAAO,QAAQ,SAAW,KChP1B,oBAEA,GAAI,IAAK,KAET,AAAI,MAAO,YAAc,YACvB,GAAK,UACA,AAAI,MAAO,eAAiB,YACjC,GAAK,aACA,AAAI,MAAO,SAAW,YAC3B,GAAK,OAAO,WAAa,OAAO,aAC3B,AAAI,MAAO,SAAW,YAC3B,GAAK,OAAO,WAAa,OAAO,aACvB,MAAO,OAAS,aACzB,IAAK,KAAK,WAAa,KAAK,cAG9B,GAAO,QAAU,KChBjB,oBAqBA,aAEA,GAAI,IAAI,MAAO,UAAY,SAAW,QAAU,KAC5C,GAAe,IAAK,MAAO,IAAE,OAAU,WACvC,GAAE,MACF,SAAsB,EAAQ,EAAU,EAAM,CAC9C,MAAO,UAAS,UAAU,MAAM,KAAK,EAAQ,EAAU,IAGvD,GACJ,AAAI,IAAK,MAAO,IAAE,SAAY,WAC5B,GAAiB,GAAE,QACd,AAAI,OAAO,sBAChB,GAAiB,SAAwB,EAAQ,CAC/C,MAAO,QAAO,oBAAoB,GAC/B,OAAO,OAAO,sBAAsB,KAGzC,GAAiB,SAAwB,EAAQ,CAC/C,MAAO,QAAO,oBAAoB,IAItC,YAA4B,EAAS,CACnC,AAAI,SAAW,QAAQ,MAAM,QAAQ,KAAK,GAG5C,GAAI,IAAc,OAAO,OAAS,SAAqB,EAAO,CAC5D,MAAO,KAAU,GAGnB,aAAwB,CACtB,GAAa,KAAK,KAAK,MAEzB,GAAO,QAAU,GACjB,GAAO,QAAQ,KAAO,GAGtB,GAAa,aAAe,GAE5B,GAAa,UAAU,QAAU,OACjC,GAAa,UAAU,aAAe,EACtC,GAAa,UAAU,cAAgB,OAIvC,GAAI,IAAsB,GAE1B,YAAuB,EAAU,CAC/B,GAAI,MAAO,IAAa,WACtB,KAAM,IAAI,WAAU,mEAAqE,MAAO,IAIpG,OAAO,eAAe,GAAc,sBAAuB,CACzD,WAAY,GACZ,IAAK,UAAW,CACd,MAAO,KAET,IAAK,SAAS,EAAK,CACjB,GAAI,MAAO,IAAQ,UAAY,EAAM,GAAK,GAAY,GACpD,KAAM,IAAI,YAAW,kGAAoG,EAAM,KAEjI,GAAsB,KAI1B,GAAa,KAAO,UAAW,CAE7B,AAAI,MAAK,UAAY,QACjB,KAAK,UAAY,OAAO,eAAe,MAAM,UAC/C,MAAK,QAAU,OAAO,OAAO,MAC7B,KAAK,aAAe,GAGtB,KAAK,cAAgB,KAAK,eAAiB,QAK7C,GAAa,UAAU,gBAAkB,SAAyB,EAAG,CACnE,GAAI,MAAO,IAAM,UAAY,EAAI,GAAK,GAAY,GAChD,KAAM,IAAI,YAAW,gFAAkF,EAAI,KAE7G,YAAK,cAAgB,EACd,MAGT,YAA0B,EAAM,CAC9B,MAAI,GAAK,gBAAkB,OAClB,GAAa,oBACf,EAAK,cAGd,GAAa,UAAU,gBAAkB,UAA2B,CAClE,MAAO,IAAiB,OAG1B,GAAa,UAAU,KAAO,SAAc,EAAM,CAEhD,OADI,GAAO,GACF,EAAI,EAAG,EAAI,UAAU,OAAQ,IAAK,EAAK,KAAK,UAAU,IAC/D,GAAI,GAAW,IAAS,QAEpB,EAAS,KAAK,QAClB,GAAI,IAAW,OACb,EAAW,GAAW,EAAO,QAAU,eAChC,CAAC,EACR,MAAO,GAGT,GAAI,EAAS,CACX,GAAI,GAGJ,GAFI,EAAK,OAAS,GAChB,GAAK,EAAK,IACR,YAAc,OAGhB,KAAM,GAGR,GAAI,GAAM,GAAI,OAAM,mBAAsB,GAAK,KAAO,EAAG,QAAU,IAAM,KACzE,QAAI,QAAU,EACR,EAGR,GAAI,GAAU,EAAO,GAErB,GAAI,IAAY,OACd,MAAO,GAET,GAAI,MAAO,IAAY,WACrB,GAAa,EAAS,KAAM,OAI5B,QAFI,GAAM,EAAQ,OACd,EAAY,GAAW,EAAS,GAC3B,EAAI,EAAG,EAAI,EAAK,EAAE,EACzB,GAAa,EAAU,GAAI,KAAM,GAGrC,MAAO,IAGT,YAAsB,EAAQ,EAAM,EAAU,EAAS,CACrD,GAAI,GACA,EACA,EAsBJ,GApBA,GAAc,GAEd,EAAS,EAAO,QAChB,AAAI,IAAW,OACb,GAAS,EAAO,QAAU,OAAO,OAAO,MACxC,EAAO,aAAe,GAIlB,GAAO,cAAgB,QACzB,GAAO,KAAK,cAAe,EACf,EAAS,SAAW,EAAS,SAAW,GAIpD,EAAS,EAAO,SAElB,EAAW,EAAO,IAGhB,IAAa,OAEf,EAAW,EAAO,GAAQ,EAC1B,EAAE,EAAO,qBAET,AAAI,MAAO,IAAa,WAEtB,EAAW,EAAO,GAChB,EAAU,CAAC,EAAU,GAAY,CAAC,EAAU,GAEzC,AAAI,EACT,EAAS,QAAQ,GAEjB,EAAS,KAAK,GAIhB,EAAI,GAAiB,GACjB,EAAI,GAAK,EAAS,OAAS,GAAK,CAAC,EAAS,OAAQ,CACpD,EAAS,OAAS,GAGlB,GAAI,GAAI,GAAI,OAAM,+CACE,EAAS,OAAS,IAAM,OAAO,GAAQ,qEAG3D,EAAE,KAAO,8BACT,EAAE,QAAU,EACZ,EAAE,KAAO,EACT,EAAE,MAAQ,EAAS,OACnB,GAAmB,GAIvB,MAAO,GAGT,GAAa,UAAU,YAAc,SAAqB,EAAM,EAAU,CACxE,MAAO,IAAa,KAAM,EAAM,EAAU,KAG5C,GAAa,UAAU,GAAK,GAAa,UAAU,YAEnD,GAAa,UAAU,gBACnB,SAAyB,EAAM,EAAU,CACvC,MAAO,IAAa,KAAM,EAAM,EAAU,KAGhD,aAAuB,CACrB,GAAI,CAAC,KAAK,MAGR,MAFA,MAAK,OAAO,eAAe,KAAK,KAAM,KAAK,QAC3C,KAAK,MAAQ,GACT,UAAU,SAAW,EAChB,KAAK,SAAS,KAAK,KAAK,QAC1B,KAAK,SAAS,MAAM,KAAK,OAAQ,WAI5C,YAAmB,EAAQ,EAAM,EAAU,CACzC,GAAI,GAAQ,CAAE,MAAO,GAAO,OAAQ,OAAW,OAAQ,EAAQ,KAAM,EAAM,SAAU,GACjF,EAAU,GAAY,KAAK,GAC/B,SAAQ,SAAW,EACnB,EAAM,OAAS,EACR,EAGT,GAAa,UAAU,KAAO,SAAc,EAAM,EAAU,CAC1D,UAAc,GACd,KAAK,GAAG,EAAM,GAAU,KAAM,EAAM,IAC7B,MAGT,GAAa,UAAU,oBACnB,SAA6B,EAAM,EAAU,CAC3C,UAAc,GACd,KAAK,gBAAgB,EAAM,GAAU,KAAM,EAAM,IAC1C,MAIb,GAAa,UAAU,eACnB,SAAwB,EAAM,EAAU,CACtC,GAAI,GAAM,EAAQ,EAAU,EAAG,EAK/B,GAHA,GAAc,GAEd,EAAS,KAAK,QACV,IAAW,OACb,MAAO,MAGT,GADA,EAAO,EAAO,GACV,IAAS,OACX,MAAO,MAET,GAAI,IAAS,GAAY,EAAK,WAAa,EACzC,AAAI,EAAE,KAAK,cAAiB,EAC1B,KAAK,QAAU,OAAO,OAAO,MAE7B,OAAO,GAAO,GACV,EAAO,gBACT,KAAK,KAAK,iBAAkB,EAAM,EAAK,UAAY,YAE9C,MAAO,IAAS,WAAY,CAGrC,IAFA,EAAW,GAEN,EAAI,EAAK,OAAS,EAAG,GAAK,EAAG,IAChC,GAAI,EAAK,KAAO,GAAY,EAAK,GAAG,WAAa,EAAU,CACzD,EAAmB,EAAK,GAAG,SAC3B,EAAW,EACX,MAIJ,GAAI,EAAW,EACb,MAAO,MAET,AAAI,IAAa,EACf,EAAK,QAEL,GAAU,EAAM,GAGd,EAAK,SAAW,GAClB,GAAO,GAAQ,EAAK,IAElB,EAAO,iBAAmB,QAC5B,KAAK,KAAK,iBAAkB,EAAM,GAAoB,GAG1D,MAAO,OAGb,GAAa,UAAU,IAAM,GAAa,UAAU,eAEpD,GAAa,UAAU,mBACnB,SAA4B,EAAM,CAChC,GAAI,GAAW,EAAQ,EAGvB,GADA,EAAS,KAAK,QACV,IAAW,OACb,MAAO,MAGT,GAAI,EAAO,iBAAmB,OAC5B,MAAI,WAAU,SAAW,EACvB,MAAK,QAAU,OAAO,OAAO,MAC7B,KAAK,aAAe,GACX,EAAO,KAAU,QAC1B,CAAI,EAAE,KAAK,cAAiB,EAC1B,KAAK,QAAU,OAAO,OAAO,MAE7B,MAAO,GAAO,IAEX,KAIT,GAAI,UAAU,SAAW,EAAG,CAC1B,GAAI,GAAO,OAAO,KAAK,GACnB,EACJ,IAAK,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EAE7B,AADA,EAAM,EAAK,GACP,IAAQ,kBACZ,KAAK,mBAAmB,GAE1B,YAAK,mBAAmB,kBACxB,KAAK,QAAU,OAAO,OAAO,MAC7B,KAAK,aAAe,EACb,KAKT,GAFA,EAAY,EAAO,GAEf,MAAO,IAAc,WACvB,KAAK,eAAe,EAAM,WACjB,IAAc,OAEvB,IAAK,EAAI,EAAU,OAAS,EAAG,GAAK,EAAG,IACrC,KAAK,eAAe,EAAM,EAAU,IAIxC,MAAO,OAGb,YAAoB,EAAQ,EAAM,EAAQ,CACxC,GAAI,GAAS,EAAO,QAEpB,GAAI,IAAW,OACb,MAAO,GAET,GAAI,GAAa,EAAO,GACxB,MAAI,KAAe,OACV,GAEL,MAAO,IAAe,WACjB,EAAS,CAAC,EAAW,UAAY,GAAc,CAAC,GAElD,EACL,GAAgB,GAAc,GAAW,EAAY,EAAW,QAGpE,GAAa,UAAU,UAAY,SAAmB,EAAM,CAC1D,MAAO,IAAW,KAAM,EAAM,KAGhC,GAAa,UAAU,aAAe,SAAsB,EAAM,CAChE,MAAO,IAAW,KAAM,EAAM,KAGhC,GAAa,cAAgB,SAAS,EAAS,EAAM,CACnD,MAAI,OAAO,GAAQ,eAAkB,WAC5B,EAAQ,cAAc,GAEtB,GAAc,KAAK,EAAS,IAIvC,GAAa,UAAU,cAAgB,GACvC,YAAuB,EAAM,CAC3B,GAAI,GAAS,KAAK,QAElB,GAAI,IAAW,OAAW,CACxB,GAAI,GAAa,EAAO,GAExB,GAAI,MAAO,IAAe,WACxB,MAAO,GACF,GAAI,IAAe,OACxB,MAAO,GAAW,OAItB,MAAO,GAGT,GAAa,UAAU,WAAa,UAAsB,CACxD,MAAO,MAAK,aAAe,EAAI,GAAe,KAAK,SAAW,IAGhE,YAAoB,EAAK,EAAG,CAE1B,OADI,GAAO,GAAI,OAAM,GACZ,EAAI,EAAG,EAAI,EAAG,EAAE,EACvB,EAAK,GAAK,EAAI,GAChB,MAAO,GAGT,YAAmB,EAAM,EAAO,CAC9B,KAAO,EAAQ,EAAI,EAAK,OAAQ,IAC9B,EAAK,GAAS,EAAK,EAAQ,GAC7B,EAAK,MAGP,YAAyB,EAAK,CAE5B,OADI,GAAM,GAAI,OAAM,EAAI,QACf,EAAI,EAAG,EAAI,EAAI,OAAQ,EAAE,EAChC,EAAI,GAAK,EAAI,GAAG,UAAY,EAAI,GAElC,MAAO,GAGT,YAAc,EAAS,EAAM,CAC3B,MAAO,IAAI,SAAQ,SAAU,EAAS,EAAQ,CAC5C,WAAuB,EAAK,CAC1B,EAAQ,eAAe,EAAM,GAC7B,EAAO,GAGT,YAAoB,CAClB,AAAI,MAAO,GAAQ,gBAAmB,YACpC,EAAQ,eAAe,QAAS,GAElC,EAAQ,GAAG,MAAM,KAAK,YAGxB,GAA+B,EAAS,EAAM,EAAU,CAAE,KAAM,KAC5D,IAAS,SACX,GAA8B,EAAS,EAAe,CAAE,KAAM,OAKpE,YAAuC,EAAS,EAAS,EAAO,CAC9D,AAAI,MAAO,GAAQ,IAAO,YACxB,GAA+B,EAAS,QAAS,EAAS,GAI9D,YAAwC,EAAS,EAAM,EAAU,EAAO,CACtE,GAAI,MAAO,GAAQ,IAAO,WACxB,AAAI,EAAM,KACR,EAAQ,KAAK,EAAM,GAEnB,EAAQ,GAAG,EAAM,WAEV,MAAO,GAAQ,kBAAqB,WAG7C,EAAQ,iBAAiB,EAAM,WAAsB,EAAK,CAGxD,AAAI,EAAM,MACR,EAAQ,oBAAoB,EAAM,GAEpC,EAAS,SAGX,MAAM,IAAI,WAAU,sEAAwE,MAAO,OC9evG,eAmBA,GAAI,IAAQ,KAAK,IAAI,EAAG,GACpB,GAAS,KAAK,IAAI,EAAG,IACrB,GAAS,KAAK,IAAI,EAAG,IACrB,GAAS,KAAK,IAAI,EAAG,IACrB,GAAS,KAAK,IAAI,EAAG,IACrB,GAAS,KAAK,IAAI,EAAG,IACrB,GAAS,KAAK,IAAI,EAAG,IACrB,GAAW,KAAK,IAAI,EAAG,MAE3B,GAAQ,SAAW,SAAS,EAAE,CAC7B,MAAO,GAAI,IAAM,EAAE,IAAM,GAG1B,GAAQ,QAAU,SAAS,EAAM,EAAK,CACpC,EAAM,GAAO,EACb,GAAI,GAAI,EAAK,EAAM,GACnB,UAAK,EAAK,IAAQ,EACd,EAAK,GAAO,KACd,IAAK,IAEA,GAGT,GAAQ,QAAU,SAAS,EAAM,EAAK,CACpC,EAAM,GAAO,EACb,GAAI,GAAI,EAAK,EAAM,GACnB,UAAK,EAAK,EAAM,IAAM,EACtB,GAAK,EAAK,EAAM,IAAM,GACtB,GAAK,EAAK,GAAO,GACb,EAAK,GAAO,KACd,IAAK,IAEA,GAGT,GAAQ,SAAW,SAAS,EAAM,EAAG,CACnC,SAAK,GAAK,EAAI,IACd,IAAM,EACN,EAAK,GAAK,EAAI,IACP,GAGT,GAAQ,SAAW,SAAS,EAAM,EAAG,CACnC,SAAK,GAAK,EAAI,IACd,IAAM,EACN,EAAK,GAAK,EAAI,IACd,IAAM,EACN,EAAK,GAAK,EAAI,IACd,IAAM,EACN,EAAK,GAAK,EAAI,IACP,GAGT,GAAQ,WAAa,SAAS,EAAM,EAAK,CACvC,EAAM,GAAO,EACb,GAAI,GAAS,EAAK,GAAO,IACrB,EAAK,GAAK,EAAI,GAAK,MAAS,EAChC,GAAM,GAAK,GAAO,MAAS,EAE3B,GAAI,GAAI,EAAK,EAAI,GAQjB,OAPA,GAAK,EAAK,EAAI,IAAM,EACpB,GAAK,EAAK,EAAI,IAAM,GACpB,GAAK,EAAK,EAAI,GAAK,GACnB,GAAK,EAAK,EAAI,GAAK,GACnB,GAAK,EAAK,EAAI,GAAK,GACnB,GAAM,GAAK,EAAI,GAAK,IAAQ,GAEpB,OACD,GACH,EAAI,MACJ,UACG,MACH,MAAO,GAAI,IAAO,EAAS,KAAY,YAEvC,GAAK,GACL,GAAK,KAGT,MAAI,IACF,IAAK,IAGA,EAAI,KAAK,IAAI,EAAG,EAAI,KAO7B,GAAQ,YAAc,SAAS,EAAM,EAAG,CACtC,GAAI,GAAG,EAAG,EAEV,SAAK,GAAM,EAAI,EAAI,IAAO,EAE1B,EAAI,KAAK,IAAI,GACb,AAAI,IAAM,EAER,GAAI,iBACJ,EAAI,MACC,AAAI,IAAM,IACf,GAAI,EACJ,EAAI,MAEJ,GAAI,KAAK,MAAM,KAAK,IAAI,GAAK,KAAK,KAClC,EAAI,KAAK,IAAI,EAAG,CAAC,GACb,EAAI,EAAI,GACV,KACA,GAAK,GAGP,AAAI,EAAI,MAAQ,KAGd,GAAI,EACJ,EAAI,MAED,AAAI,EAAI,MAAQ,EAGnB,GAAK,GAAE,EAAE,GAAK,GACd,GAAK,MAKL,GAAK,EAAI,GAAY,GACrB,EAAI,IAIR,EAAK,GAAM,GAAK,EAAK,IACrB,EAAK,IAAO,GAAK,EAAK,IAEtB,EAAK,GAAK,EAAI,IACd,EAAI,KAAK,MAAM,EAAI,IACnB,EAAK,GAAK,EAAI,IACd,EAAI,KAAK,MAAM,EAAI,IACnB,EAAK,GAAK,EAAI,IACd,EAAI,KAAK,MAAM,EAAI,IACnB,EAAK,GAAK,EAAI,IACd,IAAM,EACN,EAAK,GAAK,EAAI,IACd,IAAM,EACN,EAAK,GAAK,EAAI,IACd,IAAM,EACN,EAAK,IAAM,EAAI,GAER,KCtKT,oBAkBA,GAAI,IAAO,GAAQ,QAEnB,GAAO,QAAU,GAEjB,YAAkC,EAAS,CACzC,MAAM,KAAK,MACP,MAAM,oBAAsB,QAC9B,MAAM,kBAAkB,KAAM,KAAK,aAErC,KAAK,KAAO,KAAK,YAAY,KAC7B,KAAK,QAAU,EAGjB,GAAK,SAAS,GAA0B,SC/BxC,eAmBA,GAAI,IAAO,GAAQ,QAEf,GAAW,UAAY,GACvB,GAAU,QAAQ,IAClB,GAAW,QAEf,YAAiB,EAAO,CACtB,MAAO,WAAY,CAGjB,GAAI,GAAO,CAAC,YAAc,EAAQ,MAAM,OAAO,MAAM,KAAK,YAC1D,MAAO,IAAQ,GAAK,OAAO,MAAM,KAAM,KAI3C,GAAI,IAAQ,GACR,GAAQ,GACR,GAAQ,GACR,GAAU,GACV,GAAO,GAEX,GAAQ,WAAa,SAAU,EAAM,CACnC,GAAU,GAGZ,GAAI,IAAc,GAAQ,YAAc,SAAU,EAAO,CAGvD,OAFA,GAAQ,GAAQ,GAAQ,GAAU,GAAO,GACzC,GAAW,EACH,QACH,QACH,GAAQ,GAAQ,aACb,QACH,GAAQ,GAAQ,aACb,QACH,GAAQ,GAAQ,aACb,UACH,GAAU,GAAQ,YACf,OACH,GAAO,GAAQ,UAKnB,GAAY,IAEZ,GAAQ,YAAc,UAAY,CAChC,MAAO,KAGT,GAAQ,MAAQ,UAAY,CAC1B,MAAO,IAAM,MAAM,KAAM,YAG3B,GAAQ,MAAQ,UAAY,CAC1B,MAAO,IAAM,MAAM,KAAM,YAG3B,GAAQ,MAAQ,UAAY,CAC1B,MAAO,IAAM,MAAM,KAAM,YAG3B,GAAQ,QAAU,UAAY,CAC5B,MAAO,IAAQ,MAAM,KAAM,YAG7B,GAAQ,KAAO,UAAY,CACzB,MAAO,IAAK,MAAM,KAAM,cCrF1B,oBA+BA,GAA0B,IAAQ,WAG9B,GAAO,GACX,IAAS,GAAI,EAAG,GAAI,IAAK,KACvB,GAAK,IAAM,IAAI,GAAM,GAAK,KAAO,GAAE,SAAS,IADrC,OAiBL,GAAQ,GAAO,QAAU,SAAS,EAAI,EAAI,CAC5C,AAAI,YAAc,QAChB,MAAK,OAAS,EACd,KAAK,OAAS,GAAM,GACf,AAAI,OAAO,UAAU,SAAS,KAAK,IAAO,sBAK/C,MAAK,OAAS,GAAI,QAAO,GACzB,KAAK,OAAS,GAAM,GAEpB,MAAK,OAAS,KAAK,QAAU,GAAI,QAAO,GACxC,KAAK,OAAS,EACd,KAAK,SAAS,MAAM,KAAM,aAM9B,GAAM,QAAU,KAAK,IAAI,EAAG,IAG5B,GAAM,QAAU,CAAC,KAAK,IAAI,EAAG,IAE7B,GAAM,UAAY,CAEhB,YAAa,GAMb,QAAS,UAAW,CAElB,OADI,GAAI,KAAK,OAAQ,EAAI,KAAK,OAAQ,EAAQ,EACrC,EAAI,EAAI,EAAG,GAAK,EAAG,IAAK,CAC/B,GAAI,GAAK,GAAE,GAAK,KAAQ,EACxB,EAAE,GAAK,EAAI,IACX,EAAQ,GAAK,IAWjB,SAAU,SAAS,EAAI,EAAI,CACzB,GAAI,GAAS,GACb,GAAI,UAAU,QAAU,EACtB,GAAI,MAAO,IAAO,SAAU,CAO1B,GAJA,EAAS,EAAK,EACd,EAAK,KAAK,IAAI,GACd,EAAK,EAAK,GACV,EAAK,EAAK,GACN,EAAK,GAAO,KAAM,IAAI,YAAW,EAAM,2BAC3C,EAAK,EAAK,UACD,MAAO,IAAO,SACvB,EAAM,GAAK,IAAI,QAAQ,MAAO,IAC9B,EAAK,EAAG,OAAO,IACf,EAAK,EAAG,OAAS,EAAI,EAAG,OAAO,EAAG,EAAG,OAAS,GAAK,GACnD,EAAK,SAAS,EAAI,IAClB,EAAK,SAAS,EAAI,QAElB,MAAM,IAAI,OAAM,EAAK,+BASzB,OADI,GAAI,KAAK,OAAQ,EAAI,KAAK,OACrB,EAAI,EAAG,GAAK,EAAG,IACtB,EAAE,EAAE,GAAK,EAAK,IACd,EAAK,GAAK,EAAI,EAAK,IAAO,EAI5B,AAAI,GAAQ,KAAK,WAcnB,SAAU,SAAS,EAAgB,CAKjC,OAJI,GAAI,KAAK,OAAQ,EAAI,KAAK,OAG1B,EAAS,EAAE,GAAK,IAAM,EAAI,EAAG,EAAQ,EAChC,EAAI,EAAG,EAAI,EAAG,GAAK,EAAG,IAAK,GAAK,IAAK,CAC5C,GAAI,GAAI,EAAE,EAAE,GAGZ,AAAI,GACF,GAAK,GAAI,KAAQ,EACjB,EAAQ,GAAK,EACb,EAAI,EAAI,KAGV,GAAK,EAAI,EAIX,MAAI,CAAC,GAAkB,GAAK,GAAM,QACzB,EAAS,KAAY,IAGvB,EAAS,CAAC,EAAI,GAOvB,QAAS,UAAW,CAClB,MAAO,MAAK,SAAS,KAQvB,SAAU,SAAS,EAAO,CACxB,MAAO,MAAK,UAAU,SAAS,GAAS,KAQ1C,cAAe,SAAS,EAAK,CAG3B,OAFI,GAAM,GAAI,OAAM,GAChB,EAAI,KAAK,OAAQ,EAAI,KAAK,OACrB,EAAI,EAAG,EAAI,EAAG,IACrB,EAAI,GAAK,GAAK,EAAE,EAAE,IAEpB,MAAO,GAAI,KAAK,GAAO,KASzB,SAAU,SAAS,EAAW,CAC5B,GAAI,GAAa,KAAK,SAAW,EAAG,MAAO,MAAK,OAEhD,GAAI,GAAM,GAAI,QAAO,GACrB,YAAK,OAAO,KAAK,EAAK,EAAG,KAAK,OAAQ,KAAK,OAAS,GAC7C,GAST,KAAM,SAAS,EAAc,EAAc,CACzC,KAAK,OAAO,KAAK,EAAc,GAAgB,EAAG,KAAK,OAAQ,KAAK,OAAS,IAS/E,QAAS,SAAS,EAAO,CAGvB,GAAK,MAAK,OAAO,KAAK,QAAU,MAAU,GAAM,OAAO,EAAM,QAAU,KACrE,MAAO,GAAM,OAAO,EAAM,QAAU,KAAK,OAAO,KAAK,QAIvD,OAAS,GAAI,EAAG,EAAI,EAAG,IACrB,GAAI,KAAK,OAAO,KAAK,OAAO,KAAO,EAAM,OAAO,EAAM,OAAO,GAC3D,MAAO,MAAK,OAAO,KAAK,OAAO,GAAK,EAAM,OAAO,EAAM,OAAO,GAGlE,MAAO,IAQT,OAAQ,SAAS,EAAO,CACtB,MAAO,MAAK,QAAQ,KAAW,GAMjC,QAAS,UAAW,CAClB,MAAO,gBAAkB,KAAO,WAAa,KAAK,cAAc,KAAO,QCzQ3E,oBAmBA,GAAI,IAAM,KACN,GAAQ,KACR,GAAS,KACT,GAAO,GAAO,KAElB,GAAO,QAAU,EAEjB,GAAI,IAAQ,KAAK,IAAI,EAAG,GACpB,GAAS,KAAK,IAAI,EAAG,IACrB,GAAS,KAAK,IAAI,EAAG,IACrB,GAAS,KAAK,IAAI,EAAG,IACrB,GAAS,KAAK,IAAI,EAAG,IACrB,GAAS,KAAK,IAAI,EAAG,IACrB,GAAW,KAAK,IAAI,EAAG,MAU3B,WAA0B,EAAO,CAC/B,KAAK,MAAQ,EACb,KAAK,WAAa,GAClB,KAAK,aAAe,EACpB,KAAK,cAAgB,EACrB,KAAK,YAAc,KACnB,KAAK,iBAAmB,EACxB,KAAK,iBAAmB,EACxB,KAAK,cAAgB,CACnB,KAAM,KACN,aAAc,IAEhB,KAAK,WAAa,CAChB,aAAc,GACd,UAAW,IAcf,EAAiB,YAAc,KAO/B,EAAiB,UAAY,EAO7B,EAAiB,aAAe,GAOhC,EAAiB,UAAY,IAO7B,EAAiB,UAAY,EAO7B,EAAiB,kBAAoB,EAmBrC,EAAiB,MAAQ,CACvB,QAAmB,EACnB,gBAAmB,EACnB,iBAAmB,EACnB,QAAmB,EACnB,OAAmB,EACnB,OAAmB,EACnB,OAAmB,EACnB,UAAmB,EACnB,UAAmB,EACnB,QAAmB,EACnB,OAAmB,GACnB,OAAmB,GACnB,UAAmB,IAOrB,EAAiB,aAAe,CAC9B,EAAiB,MAAM,QACvB,EACA,EAAiB,MAAM,gBACvB,EAAiB,MAAM,QACvB,EAAiB,MAAM,UACvB,EACA,EAAiB,MAAM,OACvB,EACA,EAAiB,MAAM,OACvB,EACA,EAAiB,MAAM,OACvB,EAAiB,MAAM,UACvB,EAAiB,MAAM,UACvB,EAAiB,MAAM,OACvB,EAAiB,MAAM,OACvB,EAAiB,MAAM,SAWtB,EAAiB,UAAU,aAAe,UAAW,CACtD,MAAO,MAAK,OASd,EAAiB,UAAU,eAAiB,SAAS,EAAO,CAC1D,MAAO,GAAiB,aAAa,IASvC,EAAiB,UAAU,SAAW,SAAS,EAAM,CACnD,OAAQ,OACD,IAAK,KACR,MAAO,IAAK,SACT,GAAiB,MAAM,qBACvB,GAAiB,MAAM,gBAC1B,MAAO,IAAK,SACT,GAAiB,MAAM,QAC1B,MAAO,IAAK,SACT,GAAiB,MAAM,OAC1B,MAAO,IAAK,QACT,GAAiB,MAAM,OAC1B,MAAO,IAAK,QACT,GAAiB,MAAM,OAC1B,MAAO,IAAK,QACT,GAAiB,MAAM,UAC1B,MAAO,IAAK,WACT,GAAiB,MAAM,UAC1B,MAAO,IAAK,WACT,GAAiB,MAAM,QAC1B,MAAO,IAAK,SACT,GAAiB,MAAM,OAC1B,MAAO,IAAK,QACT,GAAiB,MAAM,OAC1B,MAAO,IAAK,QACT,GAAiB,MAAM,UAC1B,MAAO,IAAK,eAEZ,KAAM,IAAI,IAAO,mBAAmB,GAAO,uBAAuB,aAAc,iBAAmB,GAEvG,MAAO,IAAK,MAWd,EAAiB,UAAU,MAAQ,UAAW,CAC5C,MAAO,MAAK,MAAM,SASpB,EAAiB,UAAU,kBAAoB,SAAS,EAAM,EAAM,EAAO,CACzE,KAAK,UAAU,EAAiB,aAChC,KAAK,UAAW,EAAiB,UAAY,EAAiB,aACzC,GAAQ,EAAiB,kBAAqB,EAAiB,WACpF,KAAK,cAAc,GACnB,KAAK,YAAY,GAGjB,AAAI,KAAK,OACP,GAAI,QAAQ,oBAAqB,CAAE,KAAQ,IAE3C,MAAK,OAAS,EACd,KAAK,MAAM,aAAa,KAI5B,EAAiB,UAAU,gBAAkB,UAAW,GAGxD,EAAiB,UAAU,iBAAmB,SAAS,EAAM,CAC3D,KAAK,WAAW,KAAK,KAAK,cAC1B,KAAK,aAAe,GAGtB,EAAiB,UAAU,eAAiB,UAAW,CACrD,KAAK,aAAe,KAAK,WAAW,OAStC,EAAiB,UAAU,gBAAkB,SAAS,EAAM,EAAM,EAAI,CACpE,GAAI,GAAQ,GAAK,KACf,MAAO,MAAK,wBAAwB,EAAM,EAAM,EAAI,IAGtD,KAAK,cAAc,KAAO,EAC1B,KAAK,cAAc,UAAY,EAC/B,KAAK,cAAc,QAAU,GAG/B,EAAiB,UAAU,cAAgB,UAAW,GAGtD,EAAiB,UAAU,eAAiB,UAAW,CACrD,KAAK,UAAU,EAAiB,MAAM,UASxC,EAAiB,UAAU,cAAgB,SAAS,EAAS,EAAS,EAAM,CAC1E,AAAI,IAAS,EACX,KAAK,UAAU,GAEf,MAAK,cAAc,GACnB,KAAK,UAAU,KAAK,eAAe,IAAY,EAAI,KAAK,eAAe,MAI3E,EAAiB,UAAU,YAAc,UAAW,GAQpD,EAAiB,UAAU,eAAiB,SAAS,EAAU,EAAM,CACnE,KAAK,qBAAqB,EAAU,IAGtC,EAAiB,UAAU,aAAe,UAAW,GAQrD,EAAiB,UAAU,cAAgB,SAAS,EAAU,EAAM,CAClE,KAAK,qBAAqB,EAAU,IAGtC,EAAiB,UAAU,YAAc,UAAW,GAGpD,EAAiB,UAAU,UAAY,SAAS,EAAO,CACrD,AAAI,KAAK,cAAc,OAAS,KAE9B,MAAK,wBAAwB,KAAK,cAAc,KACnB,KAAK,cAAc,UACnB,KAAK,cAAc,QAClB,EAAQ,EAAiB,MAAM,gBACrB,EAAiB,MAAM,kBAC/D,KAAK,cAAc,KAAO,MAG1B,KAAK,UAAW,EAAQ,EAAiB,MAAM,gBACrB,EAAiB,MAAM,mBAIrD,EAAiB,UAAU,UAAY,SAAS,EAAG,CACjD,KAAK,MAAM,MAAM,GAAI,QAAO,CAAC,MAG/B,EAAiB,UAAU,SAAW,SAAS,EAAK,CAClD,KAAK,cAAc,KAAK,YAAY,KAGtC,EAAiB,UAAU,SAAW,SAAS,EAAK,CAClD,KAAK,cAAc,KAAK,YAAY,KAGtC,EAAiB,UAAU,SAAW,SAAS,EAAK,CAClD,KAAK,cAAc,KAAK,YAAY,KAItC,EAAiB,UAAU,YAAc,SAAS,EAAG,CACnD,GAAI,GAAO,GAAI,QAAO,GAClB,EAAG,EAAG,EAEV,EAAK,GAAM,EAAI,EAAI,IAAO,EAE1B,EAAI,KAAK,IAAI,GACb,AAAI,IAAM,EAER,GAAI,iBACJ,EAAI,MACC,AAAI,IAAM,IACf,GAAI,EACJ,EAAI,MAEJ,GAAI,KAAK,MAAM,KAAK,IAAI,GAAK,KAAK,KAClC,EAAI,KAAK,IAAI,EAAG,CAAC,GACb,EAAI,EAAI,GACV,KACA,GAAK,GAGP,AAAI,EAAI,MAAQ,KAGd,GAAI,EACJ,EAAI,MAED,AAAI,EAAI,MAAQ,EAGnB,GAAK,GAAE,EAAE,GAAK,GACd,GAAK,MAKL,GAAK,EAAI,GAAY,GACrB,EAAI,IAIR,EAAK,GAAM,GAAK,EAAK,IACrB,EAAK,IAAO,GAAK,EAAK,IAEtB,EAAK,GAAK,EAAI,IACd,EAAI,KAAK,MAAM,EAAI,IACnB,EAAK,GAAK,EAAI,IACd,EAAI,KAAK,MAAM,EAAI,IACnB,EAAK,GAAK,EAAI,IACd,EAAI,KAAK,MAAM,EAAI,IACnB,EAAK,GAAK,EAAI,IACd,IAAM,EACN,EAAK,GAAK,EAAI,IACd,IAAM,EACN,EAAK,GAAK,EAAI,IACd,IAAM,EACN,EAAK,IAAM,EAAI,GAEf,KAAK,MAAM,MAAM,IAGnB,EAAiB,UAAU,oBAAsB,SAAS,EAAM,EAAU,EAAK,CAC7E,GAAI,MAAO,IAAQ,SACjB,KAAK,cAAc,OAAO,WAAW,EAAK,IAC1C,KAAK,MAAM,MAAM,GAAI,QAAO,EAAK,YACxB,YAAe,SACf,OAAO,UAAU,SAAS,KAAK,IAAQ,sBAIhD,KAAK,cAAc,EAAI,QACvB,KAAK,MAAM,MAAM,OAEjB,MAAM,IAAI,OAAM,EAAO,6CAA+C,IAI1E,EAAiB,UAAU,YAAc,SAAS,EAAK,CACrD,KAAK,oBAAoB,cAAe,OAAQ,IAGlD,EAAiB,UAAU,YAAc,SAAS,EAAK,CACrD,KAAK,oBAAoB,cAAe,SAAU,IAQpD,EAAiB,UAAU,wBAA0B,SAAS,EACA,EACA,EACA,EAAc,CAE1E,GAAI,GAAe,GAAgB,GAAK,KAAK,eAAe,GAAa,EAEzE,AAAI,EAAU,KAAK,cAAgB,EAAU,KAAK,cAAgB,GAEhE,KAAK,UAAW,EAAU,KAAK,cAAiB,EAAI,GAGpD,MAAK,UAAU,GACf,KAAK,SAAS,IAEhB,KAAK,aAAe,GAGtB,EAAiB,UAAU,qBAAuB,SAAS,EAAU,EAAM,CACzE,AAAI,GAAQ,GAEV,KAAK,UAAU,GAAQ,EAAI,KAAK,eAAe,IAE/C,MAAK,UAAU,IAAO,KAAK,eAAe,IAC1C,KAAK,cAAc,KAOvB,EAAiB,UAAU,cAAgB,SAAS,EAAG,CAGrD,OAFI,GAAM,GAAI,QAAO,GACjB,EAAQ,IAEV,GAAK,GAAI,CAAC,MAAU,EAAG,CACrB,EAAI,KAAW,EACf,UAEA,GAAI,KAAa,EAAI,IAAQ,IAC7B,EAAI,IAAM,EAGd,GAAI,GAAO,GAAI,QAAO,GACtB,EAAI,KAAK,EAAK,EAAE,EAAE,GAClB,KAAK,MAAM,MAAM,IAOnB,EAAiB,UAAU,cAAgB,SAAS,EAAG,CAIrD,GAHI,MAAO,IAAM,UACf,GAAI,GAAI,IAAM,IAEZ,CAAG,aAAa,KAClB,KAAM,IAAI,IAAO,mBAAmB,GAAO,uBAAuB,aAAc,oCAAsC,GAQxH,OALI,GAAM,GAAI,QAAO,IACjB,EAAQ,EACR,EAAK,EAAE,OAAO,aAAa,EAAG,IAC9B,EAAK,EAAE,OAAO,aAAa,EAAG,IAC9B,EAAO,IAET,GAAM,GAAK,CAAC,MAAU,GAAO,IAAO,EAAI,CACtC,EAAI,KAAW,EACf,UAEA,GAAI,KAAa,EAAK,IAAQ,IAC9B,EAAO,GAAM,GACb,EAAK,IAAO,EACZ,EAAK,IAAO,EACZ,EAAK,EAAK,EAGd,GAAI,GAAO,GAAI,QAAO,GACtB,EAAI,KAAK,EAAK,EAAE,EAAE,GAClB,KAAK,MAAM,MAAM,IAOnB,EAAiB,UAAU,YAAc,SAAS,EAAG,CAMnD,GALA,AAAI,MAAO,IAAM,SACf,EAAI,GAAI,IAAM,SAAS,EAAG,KACjB,MAAO,IAAM,UACtB,GAAI,GAAI,IAAM,IAEZ,CAAG,aAAa,KAClB,KAAM,IAAI,IAAO,mBAAmB,GAAO,uBAAuB,aAAc,oCAAsC,GAExH,GAAI,GAAK,EAAE,OAAO,aAAa,EAAG,IAC9B,EAAK,EAAE,OAAO,aAAa,EAAG,IAC9B,EAAO,IAAO,GAClB,SAAO,IAAM,EAAM,IAAO,IAAS,CAAE,EAAQ,WAAa,GAC1D,EAAM,GAAM,EAAO,CAAE,EAAQ,WAAa,GACnC,GAAI,IAAM,EAAI,IAOvB,EAAiB,UAAU,YAAc,SAAS,EAAG,CACnD,MAAQ,IAAK,EAAO,GAAI,WAAc,WAAa,IAQrD,EAAiB,UAAU,iBAAmB,UAAW,CAEvD,GAAI,GAAa,KAAK,MAAM,WAC5B,GAAI,GAAc,EAAiB,YACjC,KAAM,IAAI,IAAO,mBAAmB,GAAO,uBAAuB,YAAa,2BAA6B,GAI9G,GAAI,GAAiB,KAAK,MAAM,WAC5B,EAAW,EAAiB,EAAiB,aACjD,GAAI,GAAW,EAAiB,UAC9B,KAAM,IAAI,IAAO,mBAAmB,GAAO,uBAAuB,YAAa,wBAA0B,GAE3G,GAAI,GAAS,GAAkB,EAAiB,kBAAqB,EAAiB,UAGlF,EAAQ,KAAK,eAGb,EAAO,KAAK,aAEhB,MAAO,CAAC,MAAO,EAAM,MAAO,EAAM,OAAQ,IAG5C,EAAiB,UAAU,eAAiB,UAAW,GAGvD,EAAiB,UAAU,gBAAkB,UAAW,CACtD,YAAK,WAAW,KAAK,KAAK,cAC1B,KAAK,aAAe,EACb,CAAC,MAAO,KAGjB,EAAiB,UAAU,cAAgB,UAAW,CACpD,KAAK,aAAe,KAAK,WAAW,OAGtC,EAAiB,UAAU,eAAiB,UAAW,CACrD,GAAI,GAAU,EACV,EAAI,KAAK,MAAM,SAAS,GACxB,EAAQ,EAAI,GAEhB,GAAI,GAAQ,EAAiB,MAAM,QACjC,MAAO,CAAC,MAAO,KAAM,MAAO,GAAO,KAAK,KAAM,IAAK,GAIrD,GAAI,GAAa,GAAI,OAAgB,EACrC,AAAI,IAAa,EAEf,EAAU,KAAK,UAGf,EAAW,KAAK,aAAe,EAEjC,GAAI,GAAY,KAAK,SAAS,GAG9B,MAAI,IAAQ,EAAiB,MAAM,iBAC/B,GAAQ,EAAiB,MAAM,mBACjC,MAAK,WAAW,aAAe,GAC/B,KAAK,WAAW,UACb,GAAQ,EAAiB,MAAM,iBAIpC,KAAK,aAAe,EACb,CAAC,MAAO,KAAM,MAAO,EAAW,IAAK,IAG9C,EAAiB,UAAU,aAAe,UAAW,GAGrD,EAAiB,UAAU,aAAe,UAAW,CACnD,GAAI,GAAQ,KAAK,eACjB,GAAI,EAAQ,EACV,KAAM,IAAI,IAAO,mBAAmB,GAAO,uBAAuB,cAAe,qBAGnF,GAAI,GAAS,EACb,AAAI,IAAU,GACZ,GAAS,KAAK,MAAM,YAGtB,GAAI,GAAU,KAAK,SAAU,GAAS,OAAU,GAC5C,EAAU,KAAK,SAAS,EAAS,IACrC,MAAO,CAAC,MAAO,EAAS,MAAO,EAAS,KAAM,IAGhD,EAAiB,UAAU,WAAa,UAAW,GAGnD,EAAiB,UAAU,cAAgB,UAAW,CACpD,GAAI,GAAgB,KAAK,MAAM,WAE3B,EAAS,IAAkB,EAAK,GAKpC,GAJI,GAAS,IACX,GAAQ,KAAK,gBAGX,EAAQ,EACV,KAAM,IAAI,IAAO,mBAAmB,GAAO,uBAAuB,cAAe,sBAGnF,GAAI,GAAW,KAAK,SAAS,EAAgB,IAE7C,MAAO,CAAC,MAAO,EAAU,KAAM,IAGjC,EAAiB,UAAU,YAAc,UAAW,GAGpD,EAAiB,UAAU,aAAe,UAAW,CACnD,MAAO,MAAK,iBAGd,EAAiB,UAAU,WAAa,UAAW,GAGnD,EAAiB,UAAU,SAAW,UAAW,CAC/C,GAAI,GAAQ,GACR,EAAQ,EACZ,GAAI,KAAK,WAAW,eAAiB,GACnC,EAAQ,KAAK,WAAW,UACxB,KAAK,WAAW,aAAe,OAC1B,CACL,GAAI,GAAM,KAAK,MAAM,WACrB,EAAQ,EAAI,MACZ,EAAS,EAAI,OAAS,EAAiB,MAAM,gBAE/C,MAAO,IAGT,EAAiB,UAAU,SAAW,UAAW,CAC/C,MAAO,MAAK,MAAM,YAGpB,EAAiB,UAAU,QAAU,UAAW,CAC9C,MAAO,MAAK,WAGd,EAAiB,UAAU,QAAU,UAAW,CAC9C,MAAO,MAAK,YAAY,KAAK,iBAG/B,EAAiB,UAAU,QAAU,UAAW,CAC9C,MAAO,MAAK,YAAY,KAAK,iBAI/B,EAAiB,UAAU,WAAa,UAAW,CACjD,GAAI,GAAO,KAAK,MAAM,KAAK,GACvB,EAAM,EAEN,EAAS,EAAK,EAAM,GAAK,IACzB,EAAK,GAAK,EAAI,GAAK,MAAS,EAChC,GAAM,GAAK,EAAI,GAAK,MAAS,EAE7B,GAAI,GAAI,EAAK,GAQb,OAPA,GAAK,EAAK,EAAI,IAAM,EACpB,GAAK,EAAK,EAAI,IAAM,GACpB,GAAK,EAAK,EAAI,GAAK,GACnB,GAAK,EAAK,EAAI,GAAK,GACnB,GAAK,EAAK,EAAI,GAAK,GACnB,GAAM,GAAK,EAAI,GAAK,IAAQ,GAEpB,OACD,GACH,EAAI,MACJ,UACG,MACH,MAAO,GAAI,IAAO,EAAS,KAAY,YAEvC,GAAK,GACL,GAAK,KAGT,MAAI,IACF,IAAK,IAGA,EAAI,KAAK,IAAI,EAAG,EAAI,KAG7B,EAAiB,UAAU,WAAa,UAAW,CACjD,GAAI,GAAO,KAAK,eAChB,GAAI,IAAS,EACX,MAAO,IAAI,QAAO,GAGpB,GAAI,EAAO,EACT,KAAM,IAAI,IAAO,mBAAmB,GAAO,uBAAuB,cAAe,wBAEnF,MAAO,MAAK,MAAM,KAAK,IAGzB,EAAiB,UAAU,WAAa,UAAW,CACjD,GAAI,GAAO,KAAK,eAEhB,GAAI,IAAS,EACX,MAAO,GAIT,GAAI,EAAO,EACT,KAAM,IAAI,IAAO,mBAAmB,GAAO,uBAAuB,cAAe,wBAEnF,MAAO,MAAK,MAAM,WAAW,IAY/B,EAAiB,UAAU,aAAe,UAAW,CACnD,MAAO,MAAK,eAAe,YAO7B,EAAiB,UAAU,aAAe,UAAW,CAKnD,OAJI,GAAQ,EACR,EAAK,EACL,EAAK,EACL,EAAQ,IACC,CACX,GAAI,GAAI,KAAK,MAAM,WAWnB,GAVA,IACA,AAAI,GAAS,GACX,EAAK,EAAO,GAAI,MAAS,EACpB,AAAI,GAAK,GAAS,EAAQ,GAC/B,GAAK,EAAO,GAAI,MAAS,EACzB,EAAK,EAAO,GAAI,OAAW,GAAG,GAE9B,EAAK,EAAO,GAAI,MAAU,EAAM,GAElC,GAAS,EACL,CAAE,GAAI,KACR,MAEF,GAAI,GAAS,GACX,KAAM,IAAI,IAAO,mBAAmB,GAAO,uBAAuB,aAAc,sCAGpF,MAAO,IAAI,IAAM,EAAI,IAMvB,EAAiB,UAAU,YAAc,SAAS,EAAG,CACnD,MAAQ,KAAM,EAAM,GAAM,GAAI,IAMhC,EAAiB,UAAU,YAAc,SAAS,EAAG,CACnD,GAAI,GAAK,EAAE,OAAO,aAAa,EAAG,IAC9B,EAAK,EAAE,OAAO,aAAa,EAAG,IAE9B,EAAM,GAAI,IAAM,EAAK,EAAG,EAAK,GACjC,EAAI,UACJ,GAAI,GAAS,EAAI,OAAO,aAAa,EAAG,IACpC,EAAS,EAAI,OAAO,aAAa,EAAG,IAEpC,EAAS,GAAM,GACnB,SAAM,IAAO,EAAM,EACnB,EAAO,KAAO,EAAK,GAAU,EACtB,GAAI,IAAM,EAAI,IAGvB,EAAiB,UAAU,KAAO,SAAS,EAAM,CAC/C,OAAQ,OACD,IAAK,KACR,KAAK,WACL,UACG,IAAK,KACR,KAAK,WACL,UACG,IAAK,IACR,KAAK,UACL,UACG,IAAK,IACR,KAAK,UACL,UACG,IAAK,IACR,KAAK,UACL,UACG,IAAK,OACR,KAAK,aACL,UACG,IAAK,OACR,KAAK,aACL,UACG,IAAK,OAER,IADA,KAAK,oBACQ,CACX,GAAI,GAAI,KAAK,iBACb,GAAI,EAAE,QAAU,GAAK,KACnB,MAEF,KAAK,KAAK,EAAE,OACZ,KAAK,eAEP,KAAK,gBACL,UACG,IAAK,IAER,OADI,GAAW,KAAK,eACX,EAAI,EAAG,EAAI,EAAS,KAAM,EAAE,EACnC,KAAK,KAAK,EAAS,OACnB,KAAK,KAAK,EAAS,OAErB,KAAK,aACL,UACG,IAAK,IAER,OADI,GAAW,KAAK,eACX,EAAK,EAAG,EAAK,EAAS,KAAM,EAAE,EACrC,KAAK,KAAK,EAAS,OAErB,KAAK,aACL,UACG,IAAK,KAER,OADI,GAAY,KAAK,gBACZ,EAAK,EAAG,EAAK,EAAU,KAAM,EAAE,EACtC,KAAK,KAAK,EAAU,OAEtB,KAAK,cACL,cAEA,KAAM,IAAK,OAAM,iBAAmB,OCh5B1C,oBAmBA,GAAI,IAAM,KACN,GAAS,KACT,GAAQ,KACR,GAAS,KACT,GAAO,GAAO,KAElB,GAAO,QAAU,GAMjB,GAAI,IAAe,OACf,GAAY,YACZ,GAAY,IAEhB,GAAgB,aAAe,GAC/B,GAAgB,UAAY,GAC5B,GAAgB,UAAY,GAE5B,YAAyB,EAAO,EAAY,EAAa,CACvD,KAAK,MAAQ,EACb,KAAK,WAAc,IAAe,OAAY,EAAa,GAC3D,KAAK,YAAe,IAAgB,OAAY,EAAc,GAC9D,KAAK,OAAS,KAGhB,GAAgB,UAAU,MAAQ,UAAW,CAC3C,MAAO,MAAK,MAAM,SAGpB,GAAgB,UAAU,kBAAoB,SAAS,EAAM,EAAM,EAAO,CACtE,AAAI,KAAK,YACP,MAAK,SAAS,GAAY,GAC1B,KAAK,YAAY,GACjB,KAAK,SAAS,IAEd,MAAK,YAAY,GACjB,KAAK,UAAU,GACf,KAAK,SAAS,IAGhB,AAAI,KAAK,SAAW,KAClB,GAAI,QAAQ,oBAAqB,CAAE,KAAQ,IAE3C,MAAK,OAAS,EACd,KAAK,MAAM,aAAa,KAI9B,GAAgB,UAAU,gBAAkB,UAAW,CACnD,AAAI,KAAK,SAAW,KAChB,KAAK,OAAS,KAEd,GAAI,QAAQ,sBAIpB,GAAgB,UAAU,iBAAmB,SAAS,EAAM,GAG5D,GAAgB,UAAU,eAAiB,UAAW,GAGtD,GAAgB,UAAU,gBAAkB,SAAS,EAAM,EAAM,EAAI,CACnE,KAAK,UAAU,GACf,KAAK,SAAS,IAGhB,GAAgB,UAAU,cAAgB,UAAW,GAGrD,GAAgB,UAAU,eAAiB,UAAW,CACpD,KAAK,UAAU,GAAK,OAGtB,GAAgB,UAAU,cAAgB,SAAS,EAAO,EAAO,EAAM,CACrE,KAAK,UAAU,GACf,KAAK,UAAU,GACf,KAAK,SAAS,IAGhB,GAAgB,UAAU,YAAc,UAAW,GAGnD,GAAgB,UAAU,eAAiB,SAAS,EAAO,EAAM,CAC/D,KAAK,UAAU,GACf,KAAK,SAAS,IAGhB,GAAgB,UAAU,aAAe,UAAW,GAGpD,GAAgB,UAAU,cAAgB,SAAS,EAAO,EAAM,CAC9D,KAAK,UAAU,GACf,KAAK,SAAS,IAGhB,GAAgB,UAAU,YAAc,UAAW,GAGnD,GAAgB,UAAU,UAAY,SAAS,EAAM,CACnD,AAAI,EACF,KAAK,UAAU,GAEf,KAAK,UAAU,IAInB,GAAgB,UAAU,UAAY,SAAS,EAAG,CAChD,KAAK,MAAM,MAAM,GAAI,QAAO,CAAC,MAG/B,GAAgB,UAAU,SAAW,SAAS,EAAK,CACjD,KAAK,MAAM,MAAM,GAAO,SAAS,GAAI,QAAO,GAAI,KAGlD,GAAgB,UAAU,SAAW,SAAS,EAAK,CACjD,KAAK,MAAM,MAAM,GAAO,SAAS,GAAI,QAAO,GAAI,KAGlD,GAAgB,UAAU,SAAW,SAAS,EAAK,CACjD,AAAI,EAAI,OACN,KAAK,MAAM,MAAM,EAAI,QAErB,KAAK,MAAM,MAAM,GAAI,IAAM,GAAK,SAIpC,GAAgB,UAAU,YAAc,SAAS,EAAK,CACpD,KAAK,MAAM,MAAM,GAAO,YAAY,GAAI,QAAO,GAAI,KAGrD,GAAgB,UAAU,oBAAsB,SAAS,EAAM,EAAU,EAAK,CAC5E,GAAI,MAAO,IAAS,SAClB,KAAK,SAAS,OAAO,WAAW,EAAK,IACrC,KAAK,MAAM,MAAM,GAAI,QAAO,EAAK,YACvB,YAAe,SACf,OAAO,UAAU,SAAS,KAAK,IAAQ,sBAIjD,KAAK,SAAS,EAAI,QAClB,KAAK,MAAM,MAAM,OAEjB,MAAM,IAAI,OAAM,EAAO,6CAA+C,IAI1E,GAAgB,UAAU,YAAc,SAAS,EAAK,CACpD,KAAK,oBAAoB,cAAe,OAAQ,IAGlD,GAAgB,UAAU,YAAc,SAAS,EAAK,CACpD,KAAK,oBAAoB,cAAe,SAAU,IAGpD,GAAgB,UAAU,iBAAmB,UAAW,CACtD,GAAI,GAAK,KAAK,UACV,EAAM,EAAM,EAEhB,GAAI,EAAK,EAAG,CACV,GAAI,GAAU,EAAK,GACnB,GAAI,GAAW,GACb,KAAM,IAAI,IAAO,mBAAmB,GAAO,uBAAuB,YAAa,oCAAsC,GAEvH,EAAO,EAAK,GACZ,EAAO,KAAK,aACZ,EAAQ,KAAK,cACR,CACL,GAAI,KAAK,WACP,KAAM,IAAI,IAAO,mBAAmB,GAAO,uBAAuB,YAAa,8BAEjF,EAAO,KAAK,MAAM,KAAK,GACvB,EAAO,KAAK,WACZ,EAAQ,KAAK,UAEf,MAAO,CAAC,MAAO,EAAM,MAAO,EAAM,OAAQ,IAG5C,GAAgB,UAAU,eAAiB,UAAW,GAGtD,GAAgB,UAAU,gBAAkB,UAAW,CACrD,MAAO,CAAC,MAAO,KAGjB,GAAgB,UAAU,cAAgB,UAAW,GAGrD,GAAgB,UAAU,eAAiB,UAAW,CACpD,GAAI,GAAO,KAAK,WAChB,GAAI,GAAQ,GAAK,KACf,MAAO,CAAC,MAAO,KAAM,MAAO,EAAM,IAAK,GAEzC,GAAI,GAAK,KAAK,UACd,MAAO,CAAC,MAAO,KAAM,MAAO,EAAM,IAAK,IAGzC,GAAgB,UAAU,aAAe,UAAW,GAGpD,GAAgB,UAAU,aAAe,UAAW,CAClD,GAAI,GAAQ,KAAK,WACb,EAAQ,KAAK,WACb,EAAO,KAAK,UAChB,MAAO,CAAC,MAAO,EAAO,MAAO,EAAO,KAAM,IAG5C,GAAgB,UAAU,WAAa,UAAW,GAGlD,GAAgB,UAAU,cAAgB,UAAW,CACnD,GAAI,GAAQ,KAAK,WACb,EAAO,KAAK,UAChB,MAAO,CAAC,MAAO,EAAO,KAAM,IAG9B,GAAgB,UAAU,YAAc,UAAW,GAGnD,GAAgB,UAAU,aAAe,UAAW,CAClD,GAAI,GAAQ,KAAK,WACb,EAAO,KAAK,UAChB,MAAO,CAAC,MAAO,EAAO,KAAM,IAG9B,GAAgB,UAAU,WAAa,UAAW,GAGlD,GAAgB,UAAU,SAAW,UAAW,CAC9C,GAAI,GAAI,KAAK,WACb,MAAI,KAAM,GAMZ,GAAgB,UAAU,SAAW,UAAW,CAC9C,MAAO,MAAK,MAAM,YAGpB,GAAgB,UAAU,QAAU,UAAW,CAC7C,MAAO,MAAK,MAAM,WAGpB,GAAgB,UAAU,QAAU,UAAW,CAC7C,MAAO,MAAK,MAAM,WAGpB,GAAgB,UAAU,QAAU,UAAW,CAC7C,GAAI,GAAO,KAAK,MAAM,KAAK,GAC3B,MAAO,IAAI,IAAM,IAGnB,GAAgB,UAAU,WAAa,UAAW,CAChD,MAAO,MAAK,MAAM,cAGpB,GAAgB,UAAU,WAAa,UAAW,CAChD,GAAI,GAAM,KAAK,UACf,GAAI,IAAQ,EACV,MAAO,IAAI,QAAO,GAGpB,GAAI,EAAM,EACR,KAAM,IAAI,IAAO,mBAAmB,GAAO,uBAAuB,cAAe,wBAEnF,MAAO,MAAK,MAAM,KAAK,IAGzB,GAAgB,UAAU,WAAa,UAAW,CAChD,GAAI,GAAM,KAAK,UACf,GAAI,IAAQ,EACV,MAAO,GAGT,GAAI,EAAM,EACR,KAAM,IAAI,IAAO,mBAAmB,GAAO,uBAAuB,cAAe,wBAEnF,MAAO,MAAK,MAAM,WAAW,IAG/B,GAAgB,UAAU,aAAe,UAAW,CAClD,MAAO,MAAK,OAGd,GAAgB,UAAU,KAAO,SAAS,EAAM,CAC9C,OAAQ,OACD,IAAK,KACR,KAAK,WACL,UACG,IAAK,KACR,KAAK,WACL,UACG,IAAK,IACR,KAAK,UACL,UACG,IAAK,IACR,KAAK,UACL,UACG,IAAK,IACR,KAAK,UACL,UACG,IAAK,OACR,KAAK,aACL,UACG,IAAK,OACR,KAAK,aACL,UACG,IAAK,OAER,IADA,KAAK,oBACQ,CACX,GAAI,GAAI,KAAK,iBACb,GAAI,EAAE,QAAU,GAAK,KACnB,MAEF,KAAK,KAAK,EAAE,OACZ,KAAK,eAEP,KAAK,gBACL,UACG,IAAK,IAER,OADI,GAAW,KAAK,eACX,EAAI,EAAG,EAAI,EAAS,KAAM,EAAE,EACnC,KAAK,KAAK,EAAS,OACnB,KAAK,KAAK,EAAS,OAErB,KAAK,aACL,UACG,IAAK,IAER,OADI,GAAW,KAAK,eACX,EAAK,EAAG,EAAK,EAAS,KAAM,EAAE,EACrC,KAAK,KAAK,EAAS,OAErB,KAAK,aACL,UACG,IAAK,KAER,OADI,GAAY,KAAK,gBACZ,EAAK,EAAG,EAAK,EAAU,KAAM,EAAE,EACtC,KAAK,KAAK,EAAU,OAEtB,KAAK,cACL,cAEA,KAAM,IAAK,OAAM,iBAAmB,OC5W1C,oBAmBA,GAAI,IAAO,GAAQ,QACf,GAAmB,KACnB,GAAkB,KAClB,GAA2B,KAE/B,YAA+B,EAAS,CACtC,MAAM,KAAK,MACP,MAAM,oBAAsB,QAC9B,MAAM,kBAAkB,KAAM,KAAK,aAErC,KAAK,KAAO,KAAK,YAAY,KAC7B,KAAK,QAAU,EAGjB,GAAK,SAAS,GAAuB,OAErC,GAAO,QAAU,GAGjB,GAAI,IAA0B,EAC1B,GAAkC,EAClC,GAAoB,EACpB,GAAsB,GAAK,EAC3B,GAAe,GAAK,EACpB,GAAe,GAAK,EACpB,GAAqB,GAAK,EAC1B,GAAsB,IAAM,EAE5B,GAAe,KAEf,GAA8B,EAC9B,GAAiB,WAIrB,YAAsB,EAAY,CAChC,GAAI,GAAqB,KACzB,KAAK,aAAe,KACpB,GAAI,GAAQ,KACZ,KAAK,UAAY,GAAI,GAAmB,KAAM,SAAS,EAAQ,CAC7D,EAAM,aAAe,IAGvB,KAAK,UAAU,MAAQ,GAAc,OAAO,MAAM,GAClD,KAAK,UAAU,YAAc,KAAK,UAAU,MAAM,OAClD,KAAK,SAAW,GAAI,IAAiB,KAAK,WAG5C,GAAa,UAAU,aAAe,UAAW,CAC/C,MAAO,MAAK,SAAS,gBAGvB,GAAa,UAAU,cAAgB,SAAS,EAAG,CACjD,KAAK,SAAS,cAAc,IAG9B,GAAa,UAAU,WAAa,UAAW,CAC7C,MAAO,MAAK,SAAS,cAGvB,GAAa,UAAU,YAAc,SAAS,EAAK,CACjD,KAAK,SAAS,YAAY,IAG5B,GAAa,UAAU,YAAc,UAAW,CAC9C,MAAO,MAAK,UAAU,UAGxB,GAAa,UAAU,MAAQ,SAAS,EAAK,CAC3C,KAAK,UAAU,MAAM,IAGvB,GAAa,UAAU,SAAW,UAAW,CAC3C,YAAK,UAAU,QACR,KAAK,cAId,GAAiB,cAAgB,CAC/B,OAAQ,EACR,KAAM,EACN,QAAS,GAmBX,aAA4B,CAC1B,KAAK,aAAe,GACpB,KAAK,WAAa,GAAiB,cAAc,OACjD,KAAK,SAAW,GAChB,KAAK,SAAW,GAChB,KAAK,MAAQ,OAAO,MAAM,GAC1B,KAAK,SAAW,EAChB,KAAK,MAAQ,KACb,KAAK,MAAQ,EACb,KAAK,mBAAqB,GAG5B,GAAI,IAAkB,SAAS,EAAK,EAAO,CACzC,GAAI,MAAO,IAAQ,UAAY,MAAO,IAAU,SAC9C,KAAM,IAAI,IAAsB,0CAIhC,GAAqB,SAAS,EAAY,CAE5C,OADI,GAAY,OAAO,KAAK,GAAiB,eACpC,EAAI,EAAG,EAAI,EAAU,OAAQ,IACpC,GAAI,IAAe,GAAiB,cAAc,EAAU,IAAK,MAAO,GAG1E,KAAM,IAAI,OAAM,EAAa,gCAG/B,GAAiB,UAAU,SAAW,SAAS,EAAO,CACpD,KAAK,MAAQ,GAGf,GAAiB,UAAU,SAAW,SAAS,EAAO,CACpD,MAAO,MAAK,OAGd,GAAiB,UAAU,SAAW,SAAS,EAAO,CACpD,KAAK,MAAQ,GAGf,GAAiB,UAAU,eAAiB,UAAW,CACrD,MAAO,MAAK,UAGd,GAAiB,UAAU,cAAgB,SAAS,EAAK,EAAO,CAC9D,GAAgB,EAAK,GACrB,KAAK,SAAS,GAAO,GAGvB,GAAiB,UAAU,iBAAmB,UAAW,CACvD,KAAK,SAAW,IAGlB,GAAiB,UAAU,gBAAkB,UAAW,CACtD,MAAO,MAAK,UAGd,GAAiB,UAAU,eAAiB,SAAS,EAAK,EAAO,CAC/D,GAAgB,EAAK,GACrB,KAAK,SAAS,GAAO,GAGvB,GAAiB,UAAU,kBAAoB,UAAW,CACxD,KAAK,SAAW,IAGlB,GAAiB,UAAU,gBAAkB,SAAS,EAAW,CAC/D,KAAK,aAAe,GAGtB,GAAiB,UAAU,cAAgB,SAAS,EAAY,CAC9D,GAAmB,GACnB,KAAK,WAAa,GAGpB,GAAiB,UAAU,cAAgB,UAAW,CACpD,MAAO,MAAK,YAGd,GAAI,IAAmB,SAAS,EAAY,CAC1C,GAAI,GAAU,EAAW,cACzB,MAAQ,GAAU,GAAgB,gBAAkB,GAAgB,WAGlE,GAAoB,SAAS,EAAY,CAC3C,GAAI,GAAa,EAAW,SAAS,IACjC,EAAU,EAAW,SAAS,IAClC,MAAO,KAAe,GAAiB,aACpC,GAAU,GAAiB,gBAAkB,GAAiB,WAGnE,GAAiB,UAAU,YAAc,UAAW,CAClD,GAAI,GAAa,KAAK,MAElB,EAAa,GAWjB,GAVI,GAAiB,IACnB,MAAK,cAAc,GAAiB,cAAc,QAClD,EAAa,IAGX,GAAkB,IACpB,MAAK,cAAc,GAAiB,cAAc,SAClD,EAAa,IAGX,EAAY,CACd,KAAK,mBAAqB,GAC1B,OAGF,GAAI,GAAY,EAAW,YAAY,IACvC,GAAI,EAAY,KAAK,aACnB,KAAM,IAAI,IAAsB,oCAGlC,GAAI,GAAc,EAAW,YAAY,IAEzC,GADA,KAAK,mBAAqB,IAAgB,GACtC,EAAC,KAAK,mBAIV,MAAK,SAAS,EAAW,YAAY,KACrC,KAAK,SAAS,EAAW,YAAY,KACrC,GAAI,GAAa,EAAW,YAAY,IAAsB,EAC1D,EAAe,GAAsB,EACzC,GAAI,EAAe,EAAW,OAC5B,KAAM,IAAI,IAAsB,0CAGlC,GAAI,GAAe,OAAO,MAAM,GAChC,EAAW,KAAK,EAAc,EAAG,GAAqB,GAEtD,GAAI,GAAe,GAAI,IAAa,GACpC,KAAK,cAAc,EAAa,gBAChC,GAAI,GAAiB,EAAa,eAClC,GAAI,EAAiB,EACnB,KAAM,IAAI,IAAsB,oCAGlC,OACE,GAAI,CACF,GAAI,GAAa,EAAa,eAC9B,GAAI,IAAe,GACjB,MAIF,OADI,GAAkB,EAAa,eAC1B,EAAI,EAAG,EAAI,EAAiB,IAAK,CACxC,GAAI,GAAM,EAAa,aACnB,EAAQ,EAAa,aACzB,KAAK,cAAc,EAAK,UAEnB,EAAP,CACA,GAAI,YAAa,IACf,MAEF,KAAM,GAKV,YAAK,KAAK,GACH,KAAK,mBAGd,GAAiB,UAAU,aAAe,UAAW,CAEnD,GAAI,EAAC,KAAK,mBAGV,IAAI,GAAU,KAAK,kBAEf,EAAe,GAAI,IACvB,EAAa,cAAc,KAAK,YAChC,EAAa,cAAc,GAG3B,GAAI,GAAa,OAAO,KAAK,GAC7B,GAAI,EAAW,OAAS,EAAG,CACzB,EAAa,cAAc,IAC3B,EAAa,cAAc,EAAW,QACtC,OAAS,GAAI,EAAG,EAAI,EAAW,OAAQ,IAAK,CAC1C,GAAI,GAAM,EAAW,GACjB,EAAQ,EAAQ,GAEpB,EAAa,YAAY,GACzB,EAAa,YAAY,IAG9B,GAAI,GAA2B,EAAa,cACvC,EAAiB,GAAK,EAA2B,GAAM,EAEvD,EAAa,OAAO,MAAM,GAC9B,EAAW,aAAa,KAAK,MAAO,GAA2B,GAAiB,IAEhF,GAAI,GAAgB,OAAO,MAAM,GACjC,EAAc,KAAK,GACnB,EAAa,MAAM,GACnB,GAAI,GAAsB,EAAa,WACnC,EAAY,OAAO,MAAM,GAC7B,EAAU,aAAa,GAAK,KAAK,SAAW,EAAoB,QAChE,GAAI,GAAc,OAAO,MAAM,GAC/B,EAAY,aAAa,IAGzB,GAAI,GAAQ,OAAO,MAAM,GACzB,EAAM,aAAa,GAEnB,GAAI,GAAQ,OAAO,MAAM,GACzB,EAAM,aAAa,KAAK,YAExB,GAAI,GAAe,OAAO,OAAO,CAC/B,EACA,EACA,EACA,EACA,EACA,IAGF,KAAK,WAAW,QAAQ,GACxB,KAAK,UAAY,EAAa,WCnVhC,oBAmBA,GAAI,IAAS,KACT,GAA2B,KAC3B,GAAmB,KAEvB,GAAO,QAAU,GAEjB,YAA4B,EAAQ,EAAU,CAC5C,KAAK,sBAAwB,KAC7B,KAAK,gBAAkB,IACvB,KAAK,MAAQ,GAAI,QAAO,KAAK,uBAC7B,KAAK,WAAa,EAClB,KAAK,YAAc,EACnB,KAAK,WAAa,GAClB,KAAK,SAAW,EAChB,KAAK,QAAU,EAGjB,GAAmB,UAAY,GAAI,IAEnC,GAAmB,UAAU,MAAQ,UAAW,CAC9C,KAAK,MAAQ,GAAI,QAAO,KAAK,uBAC7B,KAAK,WAAa,EAClB,KAAK,YAAc,EACnB,KAAK,WAAa,GAClB,KAAK,SAAW,GAGlB,GAAmB,SAAW,SAAS,EAAU,EAAO,CACtD,GAAI,GAAS,GAAI,IAEjB,MAAO,UAAS,EAAM,CACpB,GAAI,EAAO,YAAc,EAAK,OAAS,EAAO,MAAM,OAAQ,CAC1D,GAAI,GAAM,GAAI,QAAO,EAAO,YAAc,EAAK,QAC/C,EAAO,MAAM,KAAK,EAAK,EAAG,EAAG,EAAO,aACpC,EAAO,MAAQ,EAEjB,EAAK,KAAK,EAAO,MAAO,EAAO,YAAa,GAC5C,EAAO,aAAe,EAAK,OAE3B,EAAS,EAAQ,KAKrB,GAAmB,UAAU,eAAiB,UAAU,CACtD,GAAI,GAAa,KAAK,YAAc,KAAK,WACrC,EAAW,EAAa,EAAI,KAAK,sBACnC,EAAa,EAAI,KAAK,sBACpB,EAAM,GAAI,QAAO,GACrB,AAAI,EAAa,GACf,KAAK,MAAM,KAAK,EAAK,EAAG,KAAK,WAAY,KAAK,aAEhD,KAAK,WAAa,EAClB,KAAK,YAAc,EACnB,KAAK,MAAQ,GAGf,GAAmB,UAAU,iBAAmB,UAAU,CACxD,KAAK,WAAa,GAIpB,GAAmB,UAAU,OAAS,UAAW,CAC/C,MAAO,IAGT,GAAmB,UAAU,KAAO,UAAW,GAG/C,GAAmB,UAAU,MAAQ,UAAW,GAKhD,GAAmB,UAAU,aAAe,SAAS,EAAO,CAC1D,KAAK,OAAS,GAGhB,GAAmB,UAAU,gBAAkB,SAAS,EAAK,CAC3D,GAAI,KAAK,WAAa,EAAM,KAAK,YAC/B,KAAM,IAAI,KAId,GAAmB,UAAU,KAAO,SAAS,EAAK,CAChD,KAAK,gBAAgB,GACrB,GAAI,GAAM,GAAI,QAAO,GACrB,YAAK,MAAM,KAAK,EAAK,EAAG,KAAK,WAAY,KAAK,WAAa,GAC3D,KAAK,YAAc,EACZ,GAGT,GAAmB,UAAU,SAAW,UAAW,CACjD,YAAK,gBAAgB,GACd,GAAO,SAAS,KAAK,MAAM,KAAK,gBAGzC,GAAmB,UAAU,QAAU,UAAW,CAChD,KAAK,gBAAgB,GACrB,GAAI,GAAM,GAAO,QAAQ,KAAK,MAAO,KAAK,YAC1C,YAAK,YAAc,EACZ,GAGT,GAAmB,UAAU,QAAU,UAAW,CAChD,KAAK,gBAAgB,GACrB,GAAI,GAAM,GAAO,QAAQ,KAAK,MAAO,KAAK,YAC1C,YAAK,YAAc,EACZ,GAGT,GAAmB,UAAU,WAAa,UAAW,CACnD,KAAK,gBAAgB,GACrB,GAAI,GAAI,GAAO,WAAW,KAAK,MAAO,KAAK,YAC3C,YAAK,YAAc,EACZ,GAGT,GAAmB,UAAU,WAAa,SAAS,EAAK,CACtD,KAAK,gBAAgB,GACrB,GAAI,GAAM,KAAK,MAAM,SAAS,OAAQ,KAAK,WAAY,KAAK,WAAa,GACzE,YAAK,YAAc,EACZ,GAGT,GAAmB,UAAU,OAAS,UAAW,CAC/C,GAAI,GAAM,CAAC,IAAK,KAAK,MAAO,UAAW,KAAK,WAAY,WAAY,KAAK,aACzE,MAAO,IAGT,GAAmB,UAAU,QAAU,SAAS,EAAe,CAC7D,KAAK,YAAc,GAGrB,GAAmB,UAAU,MAAQ,SAAS,EAAK,CACjD,AAAI,MAAO,IAAS,UAClB,GAAM,GAAI,QAAO,EAAK,SAExB,KAAK,WAAW,KAAK,GACrB,KAAK,UAAY,EAAI,QAGvB,GAAmB,UAAU,MAAQ,UAAW,CAG9C,GAAI,GAAQ,KAAK,OAGjB,GAFA,KAAK,OAAS,KAEV,OAAK,SAAW,GAIpB,IAAI,GAAM,GAAI,QAAO,KAAK,UACtB,EAAM,EACV,KAAK,WAAW,QAAQ,SAAS,EAAK,CACpC,EAAI,KAAK,EAAK,EAAK,GACnB,GAAO,EAAI,SAGT,KAAK,SAEP,KAAK,QAAQ,EAAK,GAGpB,KAAK,WAAa,GAClB,KAAK,SAAW,MCxLlB,oBAmBA,GAAI,IAAQ,KAER,GAAY,GAAO,QAAU,GAE7B,GAAU,KAAK,IAAI,EAAG,IACtB,GAAU,KAAK,IAAI,EAAG,IACtB,GAAU,KAAK,IAAI,EAAG,IACtB,GAAW,KAAK,IAAI,GAAI,IAE5B,GAAU,gBAAkB,SAAS,EAAK,CACxC,GAAI,GAAI,EAAI,OACR,EAAI,EAAI,OACZ,GAAK,CAAC,EAAE,IAAM,CAAE,GAAE,EAAI,GAAK,MACtB,CAAC,CAAC,EAAE,IAAM,CAAC,CAAE,GAAE,EAAI,GAAK,KAE3B,MAAO,GAAI,WAEX,GAAI,GAAW,EAAE,GAAK,IACtB,GAAI,EAAU,CAIZ,OAFI,GAAc,GACd,EAAS,GAAI,QAAO,GACf,EAAI,EAAG,GAAK,EAAG,EAAE,EACxB,EAAO,GAAM,CAAC,EAAE,EAAI,GAAM,GAAc,EAAI,GAAM,IAClD,GAAe,EAAE,EAAI,GAEvB,EAAI,EAEN,GAAI,GAAQ,EAAE,EAAI,GAAM,GAAE,IAAM,GAE5B,EAAM,EAAE,EAAI,GAAM,GAAE,EAAI,IAAM,GAAM,GAAE,EAAI,IAAM,IAC9C,EAAE,EAAI,GAAK,GACV,GAAE,EAAI,GAAM,GAAE,EAAI,IAAM,IAAM,GAAU,EAAQ,YAEnD,EAAO,KAAK,MAAM,EAAM,IAAY,EAAQ,KAEhD,SAAO,eAAgB,OAAO,EAAM,KAAW,MAAM,KAC7C,GAAW,IAAM,IAAM,OAAO,GAAQ,GAIlD,GAAU,kBAAoB,SAAS,EAAM,CAC3C,GAAI,GAAW,EAAK,OAAO,KAAO,IAClC,GAAI,EAAK,OAAU,GAAW,GAAK,IAEjC,MAAO,IAAI,IAAM,CAAC,GACb,GAAI,EAAK,OAAU,GAAW,GAAK,IACxC,KAAM,IAAI,YAAW,8BAAgC,GAGrD,GAAI,GAAQ,CAAC,EAAK,MAAM,EAAW,EAAI,EAAG,KACtC,EAAM,CAAC,EAAK,MAAM,KAAO,EAAQ,WACjC,EAAO,KAAK,MAAM,EAAM,IAAW,EAAQ,OAE/C,GADA,EAAM,EAAM,GACR,GAAQ,IACR,CAAE,IAAY,GAAQ,IAAW,GAAO,GAE1C,KAAM,IAAI,YAAW,yCAEvB,MAAI,IAEF,GAAO,CAAC,EACR,AAAI,IAAQ,EACV,EAAQ,EAAO,EAAK,WAEpB,EAAM,CAAC,EAAM,EAEf,EAAO,WAAa,GAEf,GAAI,IAAM,EAAM,MCxF3B,oBAsBA,GAAI,IAAQ,KACR,GAAY,KAEZ,GAAa,GAAO,QAAW,UAAY,CAC3C,aAUA,GAAI,GACA,EACA,EAAU,CACN,IAAK,IACL,KAAM,KACN,IAAK,IACL,EAAG,KACH,EAAG,KACH,EAAG;AAAA,EACH,EAAG,KACH,EAAG,KAEP,EAEA,EAAQ,SAAU,EAAG,CAIjB,KAAM,IAAI,aAAY,IAG1B,EAAO,SAAU,EAAG,CAIhB,MAAI,IAAK,IAAM,GACX,EAAM,aAAe,EAAI,iBAAmB,EAAK,KAMrD,EAAK,EAAK,OAAO,GACjB,GAAM,EACC,GAGX,EAAS,UAAY,CAIjB,GAAI,GACA,EAAS,GAMb,IAJI,IAAO,KACP,GAAS,IACT,EAAK,MAEF,GAAM,KAAO,GAAM,KACtB,GAAU,EACV,IAEJ,GAAI,IAAO,IAEP,IADA,GAAU,IACH,KAAU,GAAM,KAAO,GAAM,KAChC,GAAU,EAGlB,GAAI,IAAO,KAAO,IAAO,IAOrB,IANA,GAAU,EACV,IACI,KAAO,KAAO,IAAO,MACrB,IAAU,EACV,KAEG,GAAM,KAAO,GAAM,KACtB,GAAU,EACV,IAIR,GADA,EAAS,CAAC,EACN,CAAC,SAAS,GACV,EAAM,kBACH,OAAI,IAAU,GAAM,SAAW,GAAU,GAAM,QAE3C,EAEA,GAIf,EAAS,UAAY,CAIjB,GAAI,GACA,EACA,EAAS,GACT,EAIJ,GAAI,IAAO,IACP,KAAO,KAAQ,CACX,GAAI,IAAO,IACP,WACO,EAEX,GAAI,IAAO,KAEP,GADA,IACI,IAAO,IAAK,CAEZ,IADA,EAAQ,EACH,EAAI,EAAG,EAAI,GACZ,GAAM,SAAS,IAAQ,IACnB,EAAC,SAAS,IAFC,GAAK,EAKpB,EAAQ,EAAQ,GAAK,EAEzB,GAAU,OAAO,aAAa,WACvB,MAAO,GAAQ,IAAQ,SAC9B,GAAU,EAAQ,OAElB,WAGJ,IAAU,EAItB,EAAM,eAGV,EAAQ,UAAY,CAIhB,KAAO,GAAM,GAAM,KACf,KAIR,EAAO,UAAY,CAIf,OAAQ,OACH,IACD,SAAK,KACL,EAAK,KACL,EAAK,KACL,EAAK,KACE,OACN,IACD,SAAK,KACL,EAAK,KACL,EAAK,KACL,EAAK,KACL,EAAK,KACE,OACN,IACD,SAAK,KACL,EAAK,KACL,EAAK,KACL,EAAK,KACE,KAEX,EAAM,eAAiB,EAAK,MAGhC,EAEA,EAAQ,UAAY,CAIhB,GAAI,GAAQ,GAEZ,GAAI,IAAO,IAAK,CAGZ,GAFA,EAAK,KACL,IACI,IAAO,IACP,SAAK,KACE,EAEX,KAAO,GAAI,CAGP,GAFA,EAAM,KAAK,KACX,IACI,IAAO,IACP,SAAK,KACE,EAEX,EAAK,KACL,KAGR,EAAM,cAGV,EAAS,UAAY,CAIjB,GAAI,GACA,EAAS,GAEb,GAAI,IAAO,IAAK,CAGZ,GAFA,EAAK,KACL,IACI,IAAO,IACP,SAAK,KACE,EAEX,KAAO,GAAI,CASP,GARA,EAAM,IACN,IACA,EAAK,KACD,OAAO,eAAe,KAAK,EAAQ,IACnC,EAAM,kBAAoB,EAAM,KAEpC,EAAO,GAAO,IACd,IACI,IAAO,IACP,SAAK,KACE,EAEX,EAAK,KACL,KAGR,EAAM,eAGd,SAAQ,UAAY,CAMhB,OADA,IACQ,OACH,IACD,MAAO,SACN,IACD,MAAO,SACN,IACD,MAAO,SACN,IACD,MAAO,aAEP,MAAO,IAAM,KAAO,GAAM,IACpB,IACA,MAOP,SAAU,EAAQ,CACrB,GAAI,GAEJ,SAAO,EACP,EAAK,EACL,EAAK,IACL,EAAS,IACT,IACI,GACA,EAAM,gBAGH,QCxSf,oBAmBA,GAAI,IAAQ,KACR,GAAS,KACT,GAAO,GAAO,KACd,GAAO,GAAQ,QAEf,GAAY,KACZ,GAAa,KAEb,GAA2B,KAE/B,GAAO,QAAU,GAYjB,YAAuB,EAAO,CAC5B,KAAK,OAAS,GACd,KAAK,KAAO,GACZ,KAAK,MAAQ,EAQf,GAAc,KAAO,GACrB,GAAc,KAAK,GAAK,MAAQ,OAChC,GAAc,KAAK,GAAK,MAAQ,OAChC,GAAc,KAAK,GAAK,KAAO,QAC/B,GAAc,KAAK,GAAK,KAAO,QAC/B,GAAc,KAAK,GAAK,KAAO,QAC/B,GAAc,KAAK,GAAK,QAAU,QAClC,GAAc,KAAK,GAAK,QAAU,QAClC,GAAc,KAAK,GAAK,QAAU,QAClC,GAAc,KAAK,GAAK,KAAO,QAC/B,GAAc,KAAK,GAAK,MAAQ,QAChC,GAAc,KAAK,GAAK,KAAO,QAO/B,GAAc,MAAQ,GACtB,GAAc,MAAM,GAAK,GAAK,KAC9B,GAAc,MAAM,GAAK,GAAK,KAC9B,GAAc,MAAM,IAAM,GAAK,IAC/B,GAAc,MAAM,IAAM,GAAK,IAC/B,GAAc,MAAM,IAAM,GAAK,IAC/B,GAAc,MAAM,IAAM,GAAK,OAC/B,GAAc,MAAM,IAAM,GAAK,OAC/B,GAAc,MAAM,IAAM,GAAK,OAC/B,GAAc,MAAM,IAAM,GAAK,IAC/B,GAAc,MAAM,IAAM,GAAK,KAC/B,GAAc,MAAM,IAAM,GAAK,IAQ/B,GAAc,QAAU,EAExB,GAAc,UAAU,MAAQ,UAAW,CACzC,YAAK,qCACE,KAAK,MAAM,SAGpB,GAAc,UAAU,mCAAqC,UAAW,CACtE,AAAI,KAAK,OAAO,SAAW,GACzB,KAAK,MAAM,MAAM,KAAK,OAAO,QAUjC,GAAc,UAAU,kBAAoB,SAAS,EAAM,EAAa,EAAO,CAC7E,KAAK,OAAO,KAAK,CAAC,GAAc,QAAS,IAAM,EAAO,IAAK,EAAa,KAM1E,GAAc,UAAU,gBAAkB,UAAW,CACnD,GAAI,GAAM,KAAK,OAAO,MAEtB,KAAK,KAAO,KAAK,OAAO,MACxB,KAAK,KAAK,KAAK,GAEf,KAAK,KAAO,IAAM,KAAK,KAAK,KAAK,KAAO,IAGxC,KAAK,MAAM,MAAM,KAAK,OAOxB,GAAc,UAAU,iBAAmB,SAAS,EAAM,CACxD,KAAK,KAAK,KAAK,KAAK,OAAO,QAC3B,KAAK,OAAO,KAAK,KAMnB,GAAc,UAAU,eAAiB,UAAW,CAClD,GAAI,GAAI,KAAK,KAAK,MACd,EAAS,KAAK,OAAO,GACrB,EAAM,IACN,EAAQ,GACZ,OAAS,KAAO,GACd,AAAI,EACF,EAAQ,GAER,GAAO,IAGT,GAAO,EAAM,IAAM,EAAO,GAG5B,GAAO,IACP,KAAK,OAAO,GAAK,EAEjB,KAAK,sCASP,GAAc,UAAU,gBAAkB,SAAS,EAAM,EAAW,EAAS,CAC3E,KAAK,KAAK,KAAK,KAAK,OAAO,QAC3B,KAAK,OAAO,KAAK,CAAE,QAAW,IAC5B,EAAU,IAAK,UAAa,GAAc,KAAK,MAOnD,GAAc,UAAU,cAAgB,UAAW,CACjD,GAAI,GAAQ,KAAK,OAAO,MACpB,EAAY,KAAK,OAAO,MAE5B,AAAI,IAAM,GAAU,mBAClB,KAAK,OAAO,KAAK,OAAO,OAAS,GAAG,EAAU,SAAW,IACvD,EAAU,UAAY,IAAM,KAAK,UAAU,GAAS,IAEtD,KAAK,OAAO,KAAK,OAAO,OAAS,GAAG,EAAU,SAAW,IACvD,EAAU,UAAY,IAAM,EAAQ,IAExC,KAAK,KAAK,MAEV,KAAK,sCAMP,GAAc,UAAU,eAAiB,UAAW,GASpD,GAAc,UAAU,cAAgB,SAAS,EAAS,EAAS,EAAM,CAEvE,KAAK,KAAK,KAAK,KAAK,OAAO,QAC3B,KAAK,OAAO,KAAK,CAAC,GAAc,KAAK,GAAU,GAAc,KAAK,GAAU,KAM9E,GAAc,UAAU,YAAc,UAAW,CAC/C,GAAI,GAAI,KAAK,KAAK,MAElB,GAAI,GAAK,KAAK,OAAO,OAIrB,CAAK,MAAK,OAAO,OAAS,EAAI,GAAK,GAAM,GACvC,KAAK,OAAO,KAAK,IAGnB,GAAI,GAAQ,MAAK,OAAO,OAAS,EAAI,GAAK,EAE1C,KAAK,OAAO,GAAG,KAAK,OAAO,GAAG,OAAS,GAAK,EAI5C,OAFI,GAAM,IACN,EAAQ,GACL,KAAK,OAAO,OAAS,EAAI,GAAG,CACjC,GAAI,GAAI,KAAK,OAAO,MAChB,EAAI,KAAK,OAAO,MACpB,AAAI,EACF,EAAQ,GAER,EAAM,IAAM,EAGR,MAAM,IAAM,GAAI,IAAM,EAAI,KAChC,EAAM,EAAI,IAAM,EAAI,EAEtB,EAAM,IAAM,EAEZ,KAAK,OAAO,GAAG,KAAK,GACpB,KAAK,OAAO,GAAK,IAAM,KAAK,OAAO,GAAG,KAAK,KAAO,IAElD,KAAK,uCAQP,GAAc,UAAU,eAAiB,SAAS,EAAU,EAAM,CAChE,KAAK,KAAK,KAAK,KAAK,OAAO,QAC3B,KAAK,OAAO,KAAK,CAAC,GAAc,KAAK,GAAW,KAMlD,GAAc,UAAU,aAAe,UAAW,CAGhD,OAFI,GAAI,KAAK,KAAK,MAEX,KAAK,OAAO,OAAS,EAAI,GAAG,CACjC,GAAI,GAAS,KAAK,OAAO,EAAI,GAC7B,KAAK,OAAO,OAAO,EAAI,EAAG,GAC1B,KAAK,OAAO,GAAG,KAAK,GAGtB,KAAK,OAAO,GAAK,IAAM,KAAK,OAAO,GAAG,KAAK,KAAO,IAElD,KAAK,sCAQP,GAAc,UAAU,cAAgB,SAAS,EAAU,EAAM,CAC7D,KAAK,KAAK,KAAK,KAAK,OAAO,QAC3B,KAAK,OAAO,KAAK,CAAC,GAAc,KAAK,GAAW,KAMpD,GAAc,UAAU,YAAc,UAAW,CAG/C,OAFI,GAAI,KAAK,KAAK,MAEX,KAAK,OAAO,OAAS,EAAI,GAAG,CACjC,GAAI,GAAS,KAAK,OAAO,EAAI,GAC7B,KAAK,OAAO,OAAO,EAAI,EAAG,GAC1B,KAAK,OAAO,GAAG,KAAK,GAGtB,KAAK,OAAO,GAAK,IAAM,KAAK,OAAO,GAAG,KAAK,KAAO,IAElD,KAAK,sCAIP,GAAc,UAAU,UAAY,SAAS,EAAM,CACjD,KAAK,OAAO,KAAK,EAAO,EAAI,IAI9B,GAAc,UAAU,UAAY,SAAS,EAAM,CACjD,KAAK,OAAO,KAAK,IAInB,GAAc,UAAU,SAAW,SAAS,EAAK,CAC/C,KAAK,OAAO,KAAK,IAInB,GAAc,UAAU,SAAW,SAAS,EAAK,CAC/C,KAAK,OAAO,KAAK,IAInB,GAAc,UAAU,SAAW,SAAS,EAAK,CAC/C,AAAI,YAAe,IACjB,KAAK,OAAO,KAAK,GAAU,gBAAgB,IAE3C,KAAK,OAAO,KAAK,IAKrB,GAAc,UAAU,YAAc,SAAS,EAAK,CAClD,KAAK,OAAO,KAAK,IAInB,GAAc,UAAU,YAAc,SAAS,EAAK,CAElD,GAAI,IAAQ,KACR,KAAK,OAAO,KAAK,UACd,CACH,GAAI,MAAO,IAAQ,SACjB,GAAI,GAAM,UACD,YAAe,QACxB,GAAI,GAAM,EAAI,SAAS,YAEvB,MAAM,IAAI,OAAM,wDAA0D,GAK5E,OADI,GAAgB,GACX,EAAI,EAAG,EAAI,EAAI,OAAQ,IAAK,CACjC,GAAI,GAAK,EAAI,OAAO,GACpB,AAAI,IAAO,IACP,GAAiB,MACd,AAAI,IAAO,KACd,GAAiB,OASd,AAAI,IAAO,KACd,GAAiB,MACd,AAAI,IAAO,KACd,GAAiB,MACd,AAAI,IAAO;AAAA,EACd,GAAiB,MACd,AAAI,IAAO,KACd,GAAiB,MACd,AAAI,IAAO,IACd,GAAiB,MAEjB,GAAiB,EAGzB,KAAK,OAAO,KAAK,IAAM,EAAgB,OAK7C,GAAc,UAAU,YAAc,SAAS,EAAK,CAClD,GAAI,MAAO,IAAQ,SACjB,GAAI,GAAM,GAAI,QAAO,EAAK,kBACjB,YAAe,SACf,OAAO,UAAU,SAAS,KAAK,IAAQ,sBAChD,GAAI,GAAM,MAEV,MAAM,IAAI,OAAM,wDAA0D,GAE5E,KAAK,OAAO,KAAK,IAAM,EAAI,SAAS,UAAY,MAclD,GAAc,UAAU,iBAAmB,UAAW,CACpD,KAAK,OAAS,GACd,KAAK,KAAO,GAGZ,GAAI,GAAW,KAAK,MAAM,SAC1B,GAAI,EAAS,WAAa,EAAS,WACjC,KAAM,IAAI,IAEZ,GAAI,GAAS,EAAS,UAEtB,GAAI,EAAS,IAAI,KAAY,GAC3B,KAAM,IAAI,OAAM,4CAKlB,IAGA,OAFI,GAAmB,EACnB,EAAW,GACR,EAAS,EAAS,WAAY,IAAU,CAC7C,GAAI,GAAM,EAAS,IAAI,GAEvB,GAAI,EACF,AAAI,IAAQ,GACV,EAAW,GACF,IAAQ,IAEjB,IAAU,WAGR,IAAQ,GACV,GAAoB,UACX,IAAQ,IAEjB,GADA,GAAoB,EAChB,IAAqB,EAEvB,UAEG,AAAI,KAAQ,IACjB,GAAW,IAKjB,GAAI,IAAqB,EAEvB,KAAM,IAAI,IAIZ,KAAK,KAAO,GAAW,EAAS,IAAI,MAAM,EAAS,UAAW,EAAO,GAAG,YACxE,KAAK,MAAM,QAAQ,EAAS,EAAI,EAAS,WAGzC,GAAI,GAAU,KAAK,KAAK,QACxB,GAAI,GAAW,GAAc,QAC3B,KAAM,IAAI,OAAM,kCAAoC,GAKtD,GAAI,GAAI,GACR,SAAE,MAAQ,KAAK,KAAK,QACpB,EAAE,MAAQ,KAAK,KAAK,QACpB,EAAE,OAAS,KAAK,KAAK,QACrB,KAAK,OAAO,KAAK,KAAK,KAAK,SACpB,GAIT,GAAc,UAAU,eAAiB,UAAW,GAQpD,GAAc,UAAU,gBAAkB,UAAW,CACnD,GAAI,GAAI,GACR,SAAE,MAAQ,GAGN,KAAK,OAAO,KAAK,OAAO,OAAS,YAAc,QACjD,KAAK,OAAO,KAAK,KAAK,OAAO,KAAK,OAAO,OAAS,GAAG,SAGhD,GAIT,GAAc,UAAU,cAAgB,UAAW,CACjD,KAAK,OAAO,OAcd,GAAc,UAAU,eAAiB,UAAW,CAClD,GAAI,GAAI,GAEJ,EAAM,GACN,EAAQ,GAAK,KAGjB,OAAS,KAAM,MAAK,OAAO,KAAK,OAAO,OAAS,GAC9C,GAAI,IAAM,KAIV,GAAM,SAAS,EAAG,IAClB,KAAK,KAAK,KAAK,KAAK,OAAO,QAE3B,GAAI,GAAQ,KAAK,OAAO,KAAK,OAAO,OAAS,GAAG,GAGhD,MAAO,MAAK,OAAO,KAAK,OAAO,OAAS,GAAG,GAE3C,KAAK,OAAO,KAAK,GAEjB,MAGF,GAAI,GAAO,GAGT,OAAS,KAAM,MAAK,OAAO,KAAK,OAAO,OAAS,GAC9C,AAAI,GAAc,MAAM,KAAO,MAI/B,GAAQ,GAAc,MAAM,GAC5B,KAAK,OAAO,KAAK,OAAO,OAAS,GAAK,KAAK,OAAO,KAAK,OAAO,OAAS,GAAG,IAI9E,SAAE,MAAQ,GACV,EAAE,MAAQ,EACV,EAAE,IAAM,EAED,GAIT,GAAc,UAAU,aAAe,UAAW,CAIhD,OAHI,GAAM,KAAK,KAAK,MAGb,KAAK,OAAO,OAAS,GAC1B,KAAK,OAAO,OAehB,GAAc,UAAU,aAAe,UAAW,CAChD,GAAI,GAAM,KAAK,OAAO,MAClB,EAAQ,EAAI,QAChB,AAAI,YAAiB,QACnB,MAAK,OAAO,KAAK,GACjB,EAAM,EACN,EAAQ,EAAI,SAGd,GAAI,GAAI,GACR,SAAE,MAAQ,GAAc,MAAM,GAC9B,EAAE,MAAQ,GAAc,MAAM,EAAI,SAClC,EAAE,KAAO,EAAI,QAGb,KAAK,KAAK,KAAK,KAAK,OAAO,QAC3B,KAAK,OAAO,KAAK,EAAI,SAEd,GAIT,GAAc,UAAU,WAAa,UAAW,CAC9C,KAAK,gBAaP,GAAc,UAAU,cAAgB,UAAW,CACjD,GAAI,GAAO,KAAK,OAAO,KAAK,OAAO,OAAS,GAExC,EAAI,GACR,SAAE,MAAQ,GAAc,MAAM,EAAK,SACnC,EAAE,KAAO,EAAK,QAEd,KAAK,KAAK,KAAK,KAAK,OAAO,QAC3B,KAAK,OAAO,KAAK,EAAK,SAEf,GAIT,GAAc,UAAU,YAAc,UAAW,CAC/C,GAAI,GAAM,KAAK,KAAK,MAAQ,EACxB,EAAK,KAAK,OACd,EAAG,MACC,YAAc,QAAS,EAAG,OAAS,GAAO,EAAG,GAAK,OAAS,GAC7D,EAAG,KAAK,EAAG,GAAK,UAQpB,GAAc,UAAU,aAAe,UAAW,CAChD,MAAO,MAAK,iBAId,GAAc,UAAU,WAAa,UAAW,CAC9C,MAAO,MAAK,eAGd,GAAc,UAAU,SAAW,UAAW,CAC5C,MAAO,MAAK,aAAe,KAG7B,GAAc,UAAU,SAAW,UAAW,CAC5C,MAAO,MAAK,WAGd,GAAc,UAAU,QAAU,UAAW,CAC3C,MAAO,MAAK,WAGd,GAAc,UAAU,QAAU,SAAS,EAAG,CAC5C,MAAO,CAAC,KAAK,aAIf,GAAc,UAAU,UAAY,SAAS,EAAG,CAC9C,AAAI,IAAM,QACR,GAAI,KAAK,OAAO,KAAK,OAAO,OAAS,IAGvC,GAAI,GAAI,GAER,GAAI,YAAa,OACf,AAAI,EAAE,SAAW,EACf,EAAE,MAAQ,OAEV,EAAE,MAAQ,EAAE,gBAEL,CAAE,aAAa,MAAU,YAAa,SAC/C,OAAS,KAAK,GACZ,GAAI,IAAM,KAGV,MAAK,OAAO,KAAK,EAAE,IACnB,MAAO,GAAE,GAET,EAAE,MAAQ,EACV,WAGF,GAAE,MAAQ,EACV,KAAK,OAAO,MAGd,MAAO,GAAE,OAGX,GAAc,UAAU,QAAU,UAAW,CAC3C,GAAI,GAAI,KAAK,YACb,MAAI,OAAO,IAAM,SAER,GAAU,kBAAkB,GAE5B,GAAI,IAAM,IAIrB,GAAc,UAAU,WAAa,UAAW,CAC9C,MAAO,MAAK,WAGd,GAAc,UAAU,WAAa,UAAW,CAC9C,MAAO,IAAI,QAAO,KAAK,YAAa,WAGtC,GAAc,UAAU,WAAa,UAAW,CAC9C,MAAO,MAAK,aAQd,GAAc,UAAU,aAAe,UAAW,CAChD,MAAO,MAAK,OAMd,GAAc,UAAU,KAAO,SAAS,EAAM,CAC1C,OAAQ,OACH,IAAK,KACR,KAAK,WACL,UACG,IAAK,KACR,KAAK,WACL,UACG,IAAK,IACR,KAAK,UACL,UACG,IAAK,IACR,KAAK,UACL,UACG,IAAK,IACR,KAAK,UACL,UACG,IAAK,OACR,KAAK,aACL,UACG,IAAK,OACR,KAAK,aACL,UACG,IAAK,OAER,IADA,KAAK,oBACQ,CACX,GAAI,GAAI,KAAK,iBACb,GAAI,EAAE,QAAU,GAAK,KACnB,MAEF,KAAK,KAAK,EAAE,OACZ,KAAK,eAEP,KAAK,gBACL,UACG,IAAK,IAER,OADI,GAAW,KAAK,eACX,EAAI,EAAG,EAAI,EAAS,KAAM,EAAE,EACnC,KAAK,KAAK,EAAS,OACnB,KAAK,KAAK,EAAS,OAErB,KAAK,aACL,UACG,IAAK,IAER,OADI,GAAW,KAAK,eACX,EAAK,EAAG,EAAK,EAAS,KAAM,EAAE,EACrC,KAAK,KAAK,EAAS,OAErB,KAAK,aACL,UACG,IAAK,KAER,OADI,GAAY,KAAK,gBACZ,EAAK,EAAG,EAAK,EAAU,KAAM,EAAE,EACtC,KAAK,KAAK,EAAU,OAEtB,KAAK,cACL,cAEA,KAAM,IAAK,OAAM,iBAAmB,OC5xB1C,oBAmBA,GAAO,QAAU,GAQjB,YAAsB,EAAe,EAAY,CAE/C,AAAI,EAAc,QAChB,GAAgB,EAAc,QAehC,GAAI,GAAU,SAAS,EAAK,EAAO,CACjC,EAAW,MAAM,EAAK,IAEpB,EAAY,GAAI,GAAW,UAAU,OAAW,GAChD,EAAS,GAAI,GAAc,EAAW,EAAW,UACrD,SAAU,OAAS,EACnB,EAAW,OAAS,EACb,KCpDT,4BAEA,OAAO,eAAe,GAAS,aAAc,CAC3C,MAAO,KAGT,GAAI,IAAU,MAAO,SAAW,YAAc,MAAO,QAAO,UAAa,SAAW,SAAU,EAAK,CAAE,MAAO,OAAO,IAAS,SAAU,EAAK,CAAE,MAAO,IAAO,MAAO,SAAW,YAAc,EAAI,cAAgB,QAAU,IAAQ,OAAO,UAAY,SAAW,MAAO,IAIlQ,GAAY,MAAO,SAAW,aAAe,MAAO,QAAO,UAAa,YAGxE,GAAe,OAAO,OAAS,YAAc,YAAc,GAAQ,SAAW,UAAY,KAAK,aAAe,KAAK,YAAY,OAAS,6BAGxI,GAAS,MAAO,UAAY,aAAe,QAAQ,UAAY,MAAQ,QAAQ,SAAS,MAAQ,KAOhG,GAAU,UAAmB,CAC/B,MAAO,OAAO,SAAW,aAAe,OAAO,OAAS,UAAY,UAAU,UAAU,SAAS,YAAc,UAAU,UAAU,SAAS,UAG9I,GAAQ,UAAY,GACpB,GAAQ,YAAc,GACtB,GAAQ,OAAS,GACjB,GAAQ,QAAU,KC9BlB,eAkBA,GAAI,IAAO,GAAQ,QACf,GAAY,KACZ,GAAe,KAAkB,aACjC,GAAS,KAET,GAAqB,KACrB,GAAgB,KAChB,GAA2B,KAE3B,GAAe,KACf,GAAQ,KACZ,GAAQ,aAAe,GA8CvB,YAAsB,EAAM,EAAM,EAAS,CAEzC,GAAa,KAAK,MAGlB,KAAK,QAAU,GAAW,GAC1B,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,OAAS,KAAK,QAAQ,QAAU,GACrC,KAAK,UAAY,KAAK,QAAQ,WAAa,GAC3C,KAAK,SAAW,KAAK,QAAQ,UAAY,GACzC,KAAK,KAAO,KAAK,QAAQ,KACzB,KAAK,aAAe,GAIpB,KAAK,cAAgB,GAGrB,KAAK,UAAY,CACf,KAAM,KAAK,KACX,KAAM,KAAK,MAAQ,GACnB,KAAM,KAAK,QAAQ,MAAQ,IAC3B,QAAS,KAAK,QAAQ,SAAW,IAEnC,OAAS,KAAY,MAAK,QAAQ,UAChC,KAAK,UAAU,GAAY,KAAK,QAAQ,UAAU,GAGtD,GAAK,SAAS,GAAc,IAE5B,GAAa,UAAU,QAAU,UAAW,CAC1C,KAAK,OAAS,KACd,KAAK,aAAe,IAGtB,GAAa,UAAU,SAAW,UAAW,CAC3C,KAAK,KAAK,QACN,KAAK,aAAa,OAAS,GAG7B,MAAK,aAAa,QAAQ,SAAS,EAAM,CACvC,KAAK,OAAO,KAAK,IAChB,MACH,KAAK,aAAe,KAIxB,GAAa,UAAU,UAAY,SAAS,EAAK,CAC/C,KAAK,KAAK,SACV,KAAK,WAGP,GAAa,UAAU,iBAAmB,SAAS,EAAqB,CACtE,GAAI,GAAQ,GAAI,MAAK,SAAS,GAC9B,GAAI,CACF,OAAa,CACX,GAAI,GAAS,EAAM,mBACf,EAAc,EAAO,OAAS,GAC9B,EAAS,KAAK,OAad,EAAe,KAAK,cAAc,EAAO,QAC7C,AAAI,GACF,GAAS,KAAK,OAAO,GACrB,MAAO,MAAK,cAAc,EAAO,SAGnC,EAAO,MAAM,GAAe,SAAS,EAAK,EAAS,CACjD,EAAoB,iBACpB,GAAI,GAAiB,EAAO,MAAM,EAAO,QACzC,MAAO,GAAO,MAAM,EAAO,QACvB,GACF,EAAe,EAAK,IAIxB,AAAI,EAAO,QAAU,EAAO,OAC1B,EAAO,QAAU,EAAO,OAAO,EAAO,EAAO,MAAO,GAEpD,OAAO,GAAO,MAAM,GACpB,KAAK,KAAK,QACR,GAAI,IAAO,sBACT,GAAO,0BAA0B,kBACjC,2DAGD,EAAP,CACA,GAAI,YAAa,IACf,EAAoB,uBAEpB,MAAM,KAKZ,GAAa,UAAU,SAAW,SAAS,EAAM,CAC/C,AAAI,OAAO,UAAU,SAAS,KAAK,KAAU,wBAC3C,GAAO,GAAI,YAAW,IAExB,GAAI,GAAM,GAAI,QAAO,GACrB,KAAK,UAAU,SAAS,KAAK,iBAAiB,KAAK,OAAO,IAI5D,GAAa,UAAU,YAAc,SAAS,EAAK,CACjD,KAAK,SAAS,EAAI,OAGpB,GAAa,UAAU,UAAY,SAAS,EAAK,CAC/C,KAAK,KAAK,QAAS,GACnB,KAAK,OAAO,SAQd,GAAa,UAAU,OAAS,UAAW,CACzC,MAAO,MAAK,QAAU,KAAK,OAAO,aAAe,KAAK,OAAO,MAM/D,GAAa,UAAU,KAAO,UAAW,CAEvC,AAAI,KAAK,QAAU,KAAK,OAAO,aAAe,KAAK,OAAO,QAI1D,CAAI,GAAM,UACR,KAAK,OAAS,GAAI,IAAU,KAAK,OAEjC,KAAK,OAAS,GAAI,IAAU,KAAK,MAAO,GAAI,KAAK,WAEnD,KAAK,OAAO,WAAa,cACzB,KAAK,OAAO,OAAS,KAAK,SAAS,KAAK,MACxC,KAAK,OAAO,UAAY,KAAK,YAAY,KAAK,MAC9C,KAAK,OAAO,QAAU,KAAK,UAAU,KAAK,MAC1C,KAAK,OAAO,QAAU,KAAK,UAAU,KAAK,QAM5C,GAAa,UAAU,MAAQ,UAAW,CACxC,KAAK,OAAO,SAOd,GAAa,UAAU,IAAM,UAAW,CACtC,GAAI,GAAS,KAAK,OAAS,MAAQ,KAC/B,EAAO,GACP,EAAO,KAAK,MAAQ,IACpB,EAAO,KAAK,KAGhB,MAAI,MAAK,MAAU,CAAU,IAAV,OAAoB,KAAK,OAAS,KAClD,AAAS,IAAT,MAAmB,KAAK,OAAS,KAClC,GAAO,IAAM,KAAK,MAGb,EAAS,MAAQ,EAAO,EAAO,GAUxC,GAAa,UAAU,MAAQ,SAAS,EAAM,CAC5C,AAAI,KAAK,SAEP,KAAK,OAAO,KAAK,GAGjB,KAAK,aAAa,KAAK,IAa3B,GAAQ,mBAAqB,SAAS,EAAM,EAAM,EAAS,CACzD,MAAO,IAAI,IAAa,EAAM,EAAM,IAGtC,GAAQ,eAAiB,KC7RzB,eAkBA,GAAI,IAAO,GAAQ,QACf,GAAe,KAAkB,aACjC,GAAS,KAET,GAAqB,KACrB,GAAgB,KAChB,GAA2B,KAE3B,GAAe,KAEnB,GAAQ,cAAgB,GAaxB,YAAuB,EAAM,EAAM,EAAS,CAC1C,KAAK,QAAU,GAAW,GAC1B,KAAK,KAAO,EACZ,KAAK,KAAO,EACZ,KAAK,QAAW,GAAW,EAAQ,QACnC,KAAK,SAAW,GAChB,KAAK,SAAW,GAChB,KAAK,UAAY,EAAQ,WAAa,GACtC,KAAK,SAAW,EAAQ,UAAY,GACpC,KAAK,QAAU,EAAQ,SAAW,GAElC,EAAO,GAAQ,OAAO,SAAS,KAC/B,EAAO,GAAQ,OAAO,SAAS,KAC/B,GAAI,GAAS,EAAQ,MAAQ,WAAa,UACtC,EAAO,EAAQ,MAAQ,IAE3B,AAAI,IAAS,IACX,GAAO,QAGT,AAAI,CAAC,GAAQ,IAAS,IAAM,IAAS,KACnC,KAAK,IAAM,EAAS,EAAO,EAE3B,KAAK,IAAM,EAAS,EAAO,IAAM,EAAO,EAK1C,KAAK,cAAgB,GAGvB,GAAK,SAAS,GAAe,IAM7B,GAAc,UAAU,wBAA0B,UAAW,CAC3D,GAAI,CAAE,MAAO,IAAI,qBAAoB,EACrC,GAAI,CAAE,MAAO,IAAI,eAAc,uBAAqB,EACpD,GAAI,CAAE,MAAO,IAAI,eAAc,0BAAwB,EAEvD,KAAM,qCAaR,GAAc,UAAU,MAAQ,UAAW,CACzC,GAAI,GAAO,KACX,GAAI,KAAK,MAAQ,QAAa,KAAK,MAAQ,GACzC,MAAO,MAAK,SAGd,GAAI,GAAO,KAAK,0BAEhB,AAAI,EAAK,kBACP,EAAK,iBAAiB,oBAGxB,EAAK,mBAAqB,UAAW,CACnC,AAAI,KAAK,YAAc,GAAK,KAAK,QAAU,KACzC,EAAK,cAAc,KAAK,eAI5B,EAAK,KAAK,OAAQ,KAAK,IAAK,IAE5B,OAAO,KAAK,KAAK,SAAS,QAAQ,SAAS,EAAW,CACpD,EAAK,iBAAiB,EAAW,EAAK,QAAQ,MAGhD,EAAK,KAAK,KAAK,WAOjB,GAAc,UAAU,cAAgB,SAAS,EAAK,CAMpD,GALA,KAAK,SAAW,EAChB,KAAK,YAAc,KAAK,SAAS,OACjC,KAAK,KAAO,KAAK,SAAS,OAC1B,KAAK,KAAO,EAER,OAAO,UAAU,SAAS,KAAK,IAAQ,uBACzC,GAAI,GAAO,GAAI,YAAW,GAE5B,GAAI,GAAQ,GAAI,QAAO,GAAQ,GAE/B,KAAK,UAAU,SAAS,KAAK,iBAAiB,KAAK,OAAO,IAI5D,GAAc,UAAU,iBAAmB,SAAS,EAAqB,CACvE,GAAI,GAAQ,GAAI,MAAK,SAAS,GAC9B,GAAI,CACF,OAAa,CACX,GAAI,GAAS,EAAM,mBACf,EAAc,EAAO,OAAS,GAC9B,EAAS,KAAK,OAad,EAAe,KAAK,cAAc,EAAO,QAC7C,AAAI,GACF,GAAS,KAAK,OAAO,GACrB,MAAO,MAAK,cAAc,EAAO,SAGnC,EAAO,MAAM,GAAe,SAAS,EAAK,EAAS,CACjD,EAAoB,iBACpB,GAAI,GAAiB,EAAO,MAAM,EAAO,QACzC,MAAO,GAAO,MAAM,EAAO,QACvB,GACF,EAAe,EAAK,IAIxB,AAAI,EAAO,QAAU,EAAO,OAC1B,EAAO,QAAU,EAAO,OAAO,EAAO,EAAO,MAAO,GAEpD,OAAO,GAAO,MAAM,GACpB,KAAK,KAAK,QACR,GAAI,IAAO,sBACT,GAAO,0BAA0B,kBACjC,2DAGD,EAAP,CACA,GAAI,YAAa,IACf,EAAoB,uBAEpB,MAAM,KAUZ,GAAc,UAAU,OAAS,UAAW,CAC1C,MAAO,IAMT,GAAc,UAAU,KAAO,UAAW,GAK1C,GAAc,UAAU,MAAQ,UAAW,GAQ3C,GAAc,UAAU,KAAO,SAAS,EAAK,CAC3C,GAAI,GAAQ,KAAK,KAAO,KAAK,KAE7B,GAAI,IAAU,EACZ,MAAO,GAGT,GAAI,GAAO,EAEX,AAAI,EAAQ,GACV,GAAO,GAGT,GAAI,GAAM,KAAK,SAAS,OAAO,KAAK,KAAM,GAC1C,YAAK,MAAQ,EAGN,GAOT,GAAc,UAAU,QAAU,UAAW,CAC3C,MAAO,MAAK,UAOd,GAAc,UAAU,MAAQ,SAAS,EAAK,CAC5C,KAAK,SAAW,EAChB,KAAK,SAQP,GAAc,UAAU,cAAgB,UAAW,CACjD,MAAO,MAAK,UAYd,GAAQ,oBAAsB,SAAS,EAAM,EAAM,EAAS,CAC1D,MAAO,IAAI,IAAc,EAAM,EAAM,IAGvC,GAAQ,gBAAkB,KCvR1B,oBACA,AA2BA,AAAC,UAAU,EAAY,CACnB,aAQA,GAAI,MAAO,YAAc,WACrB,UAAU,UAAW,WAGd,MAAO,KAAY,UAAY,MAAO,KAAW,SACxD,GAAO,QAAU,YAGV,MAAO,SAAW,YAAc,OAAO,IAC9C,OAAO,WAGA,MAAO,MAAQ,YACtB,GAAK,IAAI,KAGL,IAAI,MAAQ,MAFZ,gBAMG,MAAO,SAAW,aAAe,MAAO,OAAS,YAAa,CAGrE,GAAI,GAAS,MAAO,SAAW,YAAc,OAAS,KAIlD,EAAY,EAAO,EACvB,EAAO,EAAI,IAIX,EAAO,EAAE,WAAa,UAAY,CAC9B,SAAO,EAAI,EACJ,UAIX,MAAM,IAAI,OAAM,mEAGrB,UAAY,CACf,aAEA,GAAI,GAAY,GAChB,GAAI,CACA,KAAM,IAAI,aACL,EAAP,CACE,EAAY,CAAC,CAAC,EAAE,MAKpB,GAAI,GAAgB,KAChB,EAKA,EAAO,UAAY,GAInB,EAAW,UAAY,CAEvB,GAAI,GAAO,CAAC,KAAM,OAAQ,KAAM,MAC5B,EAAO,EACP,EAAW,GACX,EAAc,OACd,GAAW,GAEX,GAAa,GAEjB,aAAiB,CAIb,OAFI,IAAM,GAEH,EAAK,MACR,EAAO,EAAK,KACZ,GAAO,EAAK,KACZ,EAAK,KAAO,OACZ,GAAS,EAAK,OAEV,IACA,GAAK,OAAS,OACd,GAAO,SAEX,GAAU,GAAM,IAGpB,KAAO,GAAW,QACd,GAAO,GAAW,MAClB,GAAU,IAEd,EAAW,GAGf,YAAmB,GAAM,GAAQ,CAC7B,GAAI,CACA,WAEK,GAAP,CACE,GAAI,GAOA,KAAI,KACA,GAAO,OAEX,WAAW,GAAO,GACd,IACA,GAAO,QAGL,GAKN,WAAW,UAAY,CACnB,KAAM,KACP,GAIX,AAAI,IACA,GAAO,OAiBf,GAbA,EAAW,SAAU,GAAM,CACvB,EAAO,EAAK,KAAO,CACf,KAAM,GACN,OAAQ,IAAY,QAAQ,OAC5B,KAAM,MAGL,GACD,GAAW,GACX,MAIJ,MAAO,UAAY,UACnB,QAAQ,aAAe,oBAAsB,QAAQ,SASrD,GAAW,GAEX,EAAc,UAAY,CACtB,QAAQ,SAAS,aAGd,MAAO,eAAiB,WAE/B,AAAI,MAAO,SAAW,YAClB,EAAc,aAAa,KAAK,OAAQ,IAExC,EAAc,UAAY,CACtB,aAAa,aAId,MAAO,iBAAmB,YAAa,CAG9C,GAAI,IAAU,GAAI,gBAGlB,GAAQ,MAAM,UAAY,UAAY,CAClC,EAAc,GACd,GAAQ,MAAM,UAAY,GAC1B,MAEJ,GAAI,IAAkB,UAAY,CAG9B,GAAQ,MAAM,YAAY,IAE9B,EAAc,UAAY,CACtB,WAAW,GAAO,GAClB,UAKJ,GAAc,UAAY,CACtB,WAAW,GAAO,IAM1B,SAAS,SAAW,SAAU,GAAM,CAChC,GAAW,KAAK,IACX,GACD,GAAW,GACX,MAGD,KAaP,EAAO,SAAS,KACpB,WAAqB,EAAG,CACpB,MAAO,WAAY,CACf,MAAO,GAAK,MAAM,EAAG,YAO7B,GAAI,GAAc,EAAY,MAAM,UAAU,OAE1C,EAAe,EACf,MAAM,UAAU,QAAU,SAAU,EAAU,EAAO,CACjD,GAAI,GAAQ,EACR,EAAS,KAAK,OAElB,GAAI,UAAU,SAAW,EAGrB,EAAG,CACC,GAAI,IAAS,MAAM,CACf,EAAQ,KAAK,KACb,MAEJ,GAAI,EAAE,GAAS,EACX,KAAM,IAAI,iBAET,GAGb,KAAO,EAAQ,EAAQ,IAEnB,AAAI,IAAS,OACT,GAAQ,EAAS,EAAO,KAAK,GAAQ,IAG7C,MAAO,KAIX,EAAgB,EAChB,MAAM,UAAU,SAAW,SAAU,EAAO,CAExC,OAAS,GAAI,EAAG,EAAI,KAAK,OAAQ,IAC7B,GAAI,KAAK,KAAO,EACZ,MAAO,GAGf,MAAO,KAIX,EAAY,EACZ,MAAM,UAAU,KAAO,SAAU,EAAU,EAAO,CAC9C,GAAI,GAAO,KACP,EAAU,GACd,SAAa,EAAM,SAAU,GAAW,GAAO,GAAO,CAClD,EAAQ,KAAK,EAAS,KAAK,EAAO,GAAO,GAAO,KACjD,QACI,IAIX,EAAgB,OAAO,QAAU,SAAU,EAAW,CACtD,YAAgB,EAChB,SAAK,UAAY,EACV,GAAI,IAGX,EAAwB,OAAO,gBAAkB,SAAU,EAAK,EAAM,EAAY,CAClF,SAAI,GAAQ,EAAW,MAChB,GAGP,EAAwB,EAAY,OAAO,UAAU,gBAErD,EAAc,OAAO,MAAQ,SAAU,EAAQ,CAC/C,GAAI,GAAO,GACX,OAAS,KAAO,GACZ,AAAI,EAAsB,EAAQ,IAC9B,EAAK,KAAK,GAGlB,MAAO,IAGP,EAAkB,EAAY,OAAO,UAAU,UAEnD,WAAkB,EAAO,CACrB,MAAO,KAAU,OAAO,GAM5B,WAAyB,EAAW,CAChC,MACI,GAAgB,KAAe,0BAC/B,YAAqB,GAM7B,GAAI,GACJ,AAAI,MAAO,cAAgB,YACvB,EAAe,YAEf,EAAe,SAAU,EAAO,CAC5B,KAAK,MAAQ,GAMrB,GAAI,GAAuB,uBAE3B,YAA4B,EAAO,EAAS,CAGxC,GAAI,GACA,EAAQ,OACR,MAAO,IAAU,UACjB,IAAU,MACV,EAAM,MACR,CAEE,OADI,GAAS,GACJ,EAAI,EAAW,EAAG,EAAI,EAAE,OAC7B,AAAI,EAAE,OAAU,EAAC,EAAM,yBAA2B,EAAM,wBAA0B,EAAE,eAChF,GAAsB,EAAO,0BAA2B,CAAC,MAAO,EAAE,aAAc,aAAc,KAC9F,EAAO,QAAQ,EAAE,QAGzB,EAAO,QAAQ,EAAM,OAErB,GAAI,IAAiB,EAAO,KAAK;AAAA,EAAO,EAAuB;AAAA,GAC3D,GAAQ,EAAkB,IAC9B,EAAsB,EAAO,QAAS,CAAC,MAAO,GAAO,aAAc,MAI3E,WAA2B,EAAa,CAGpC,OAFI,GAAQ,EAAY,MAAM;AAAA,GAC1B,EAAe,GACV,EAAI,EAAG,EAAI,EAAM,OAAQ,EAAE,EAAG,CACnC,GAAI,IAAO,EAAM,GAEjB,AAAI,CAAC,EAAgB,KAAS,CAAC,EAAY,KAAS,IAChD,EAAa,KAAK,IAG1B,MAAO,GAAa,KAAK;AAAA,GAG7B,WAAqB,EAAW,CAC5B,MAAO,GAAU,QAAQ,iBAAmB,IACrC,EAAU,QAAQ,eAAiB,GAG9C,YAAkC,EAAW,CAGzC,GAAI,GAAW,gCAAgC,KAAK,GACpD,GAAI,EACA,MAAO,CAAC,EAAS,GAAI,OAAO,EAAS,KAIzC,GAAI,GAAW,4BAA4B,KAAK,GAChD,GAAI,EACA,MAAO,CAAC,EAAS,GAAI,OAAO,EAAS,KAIzC,GAAI,GAAW,iBAAiB,KAAK,GACrC,GAAI,EACA,MAAO,CAAC,EAAS,GAAI,OAAO,EAAS,KAI7C,WAAyB,EAAW,CAChC,GAAI,GAAwB,GAAyB,GAErD,GAAI,CAAC,EACD,MAAO,GAGX,GAAI,GAAW,EAAsB,GACjC,EAAa,EAAsB,GAEvC,MAAO,KAAa,GAChB,GAAc,GACd,GAAc,GAKtB,aAAuB,CACnB,GAAI,EAAC,EAIL,GAAI,CACA,KAAM,IAAI,aACL,EAAP,CACE,GAAI,GAAQ,EAAE,MAAM,MAAM;AAAA,GACtB,EAAY,EAAM,GAAG,QAAQ,KAAO,EAAI,EAAM,GAAK,EAAM,GACzD,EAAwB,GAAyB,GACrD,MAAK,GAIL,GAAY,EAAsB,GAC3B,EAAsB,IAJzB,QAQZ,WAAmB,EAAU,EAAM,EAAa,CAC5C,MAAO,WAAY,CACf,MAAI,OAAO,UAAY,aACnB,MAAO,SAAQ,MAAS,YACxB,QAAQ,KAAK,EAAO,uBAAyB,EAChC,YAAa,GAAI,OAAM,IAAI,OAErC,EAAS,MAAM,EAAU,YAYxC,WAAW,EAAO,CAId,MAAI,aAAiB,GACV,EAIP,GAAe,GACR,GAAO,GAEP,GAAQ,GAGvB,EAAE,QAAU,EAMZ,EAAE,SAAW,EAKb,EAAE,iBAAmB,GAQrB,GAAI,GAAmB,EAGvB,AAAI,MAAO,UAAY,UAAY,SAAW,QAAQ,KAAO,QAAQ,IAAI,SACrE,GAAE,iBAAmB,IAazB,EAAE,MAAQ,EACV,YAAiB,CAOb,GAAI,GAAW,GAAI,EAAoB,GAAI,EAEvC,EAAW,EAAc,EAAM,WAC/B,GAAU,EAAc,EAAQ,WAmCpC,GAjCA,GAAQ,gBAAkB,SAAU,GAAS,GAAI,GAAU,CACvD,GAAI,IAAO,EAAY,WACvB,AAAI,EACA,GAAS,KAAK,IACV,KAAO,QAAU,GAAS,IAC1B,EAAkB,KAAK,GAAS,KAGpC,EAAE,SAAS,UAAY,CACnB,EAAgB,gBAAgB,MAAM,EAAiB,OAMnE,GAAQ,QAAU,UAAY,CAC1B,GAAI,EACA,MAAO,IAEX,GAAI,IAAc,EAAO,GACzB,MAAI,IAAU,KACV,GAAkB,IAEf,IAGX,GAAQ,QAAU,UAAY,CAC1B,MAAK,GAGE,EAAgB,UAFZ,CAAE,MAAO,YAKpB,EAAE,kBAAoB,EACtB,GAAI,CACA,KAAM,IAAI,aACL,GAAP,CAOE,GAAQ,MAAQ,GAAE,MAAM,UAAU,GAAE,MAAM,QAAQ;AAAA,GAAQ,GAC1D,GAAQ,aAAe,IAQ/B,YAAgB,GAAY,CACxB,EAAkB,GAEd,EAAE,kBAAoB,GAGtB,IAAQ,OAAS,IAGrB,EAAa,EAAU,SAAU,GAAW,GAAS,CACjD,EAAE,SAAS,UAAY,CACnB,GAAW,gBAAgB,MAAM,GAAY,OAElD,QAEH,EAAW,OACX,EAAoB,OAGxB,SAAS,QAAU,GACnB,EAAS,QAAU,SAAU,GAAO,CAChC,AAAI,GAIJ,GAAO,EAAE,MAGb,EAAS,QAAU,SAAU,GAAO,CAChC,AAAI,GAIJ,GAAO,GAAQ,MAEnB,EAAS,OAAS,SAAU,GAAQ,CAChC,AAAI,GAIJ,GAAO,GAAO,MAElB,EAAS,OAAS,SAAU,GAAU,CAClC,AAAI,GAIJ,EAAa,EAAmB,SAAU,GAAW,GAAkB,CACnE,EAAE,SAAS,UAAY,CACnB,GAAiB,OAEtB,SAGA,EAQX,EAAM,UAAU,iBAAmB,UAAY,CAC3C,GAAI,GAAO,KACX,MAAO,UAAU,EAAO,EAAO,CAC3B,AAAI,EACA,EAAK,OAAO,GACT,AAAI,UAAU,OAAS,EAC1B,EAAK,QAAQ,EAAY,UAAW,IAEpC,EAAK,QAAQ,KAWzB,EAAE,QAAU,EACZ,EAAE,QAAU,EACZ,WAAiB,EAAU,CACvB,GAAI,MAAO,IAAa,WACpB,KAAM,IAAI,WAAU,gCAExB,GAAI,GAAW,IACf,GAAI,CACA,EAAS,EAAS,QAAS,EAAS,OAAQ,EAAS,cAChD,EAAP,CACE,EAAS,OAAO,GAEpB,MAAO,GAAS,QAGpB,EAAQ,KAAO,EACf,EAAQ,IAAM,EACd,EAAQ,OAAS,GACjB,EAAQ,QAAU,EAKlB,EAAE,WAAa,SAAU,EAAQ,CAG7B,MAAO,IAGX,EAAQ,UAAU,WAAa,UAAY,CAGvC,MAAO,OAYX,EAAE,KAAO,SAAU,EAAG,EAAG,CACrB,MAAO,GAAE,GAAG,KAAK,IAGrB,EAAQ,UAAU,KAAO,SAAU,EAAM,CACrC,MAAO,GAAE,CAAC,KAAM,IAAO,OAAO,SAAU,EAAG,EAAG,CAC1C,GAAI,IAAM,EAEN,MAAO,GAEP,KAAM,IAAI,OAAM,+BAAiC,EAAI,IAAM,MAUvE,EAAE,KAAO,EACT,WAAc,EAAU,CACpB,MAAO,GAAQ,SAAU,EAAS,EAAQ,CAMtC,OAAS,GAAI,EAAG,GAAM,EAAS,OAAQ,EAAI,GAAK,IAC5C,EAAE,EAAS,IAAI,KAAK,EAAS,KAKzC,EAAQ,UAAU,KAAO,UAAY,CACjC,MAAO,MAAK,KAAK,EAAE,OAcvB,EAAE,YAAc,EAChB,WAAiB,EAAY,EAAU,EAAS,CAC5C,AAAI,IAAa,QACb,GAAW,SAAU,GAAI,CACrB,MAAO,IAAO,GAAI,OACd,uCAAyC,OAIjD,IAAY,QACZ,GAAU,UAAY,CAClB,MAAO,CAAC,MAAO,aAIvB,GAAI,GAAU,EAAc,EAAQ,WAqBpC,GAnBA,EAAQ,gBAAkB,SAAU,GAAS,GAAI,GAAM,CACnD,GAAI,IACJ,GAAI,CACA,AAAI,EAAW,IACX,GAAS,EAAW,IAAI,MAAM,EAAS,IAEvC,GAAS,EAAS,KAAK,EAAS,GAAI,UAEnC,GAAP,CACE,GAAS,GAAO,IAEpB,AAAI,IACA,GAAQ,KAIhB,EAAQ,QAAU,EAGd,EAAS,CACT,GAAI,IAAY,IAChB,AAAI,GAAU,QAAU,YACpB,GAAQ,UAAY,GAAU,QAGlC,EAAQ,QAAU,UAAY,CAC1B,GAAI,IAAY,IAChB,MAAI,IAAU,QAAU,WACpB,GAAU,QAAU,WACb,EAEJ,GAAU,OAIzB,MAAO,GAGX,EAAQ,UAAU,SAAW,UAAY,CACrC,MAAO,oBAGX,EAAQ,UAAU,KAAO,SAAU,EAAW,EAAU,EAAY,CAChE,GAAI,GAAO,KACP,GAAW,IACX,GAAO,GAGX,YAAoB,GAAO,CACvB,GAAI,CACA,MAAO,OAAO,IAAc,WAAa,EAAU,IAAS,SACvD,GAAP,CACE,MAAO,IAAO,KAItB,YAAmB,GAAW,CAC1B,GAAI,MAAO,IAAa,WAAY,CAChC,GAAmB,GAAW,GAC9B,GAAI,CACA,MAAO,GAAS,UACX,GAAP,CACE,MAAO,IAAO,KAGtB,MAAO,IAAO,IAGlB,YAAqB,GAAO,CACxB,MAAO,OAAO,IAAe,WAAa,EAAW,IAAS,GAGlE,SAAE,SAAS,UAAY,CACnB,EAAK,gBAAgB,SAAU,GAAO,CAClC,AAAI,IAGJ,IAAO,GAEP,GAAS,QAAQ,GAAW,OAC7B,OAAQ,CAAC,SAAU,GAAW,CAC7B,AAAI,IAGJ,IAAO,GAEP,GAAS,QAAQ,GAAU,WAKnC,EAAK,gBAAgB,OAAQ,OAAQ,CAAC,OAAQ,SAAU,GAAO,CAC3D,GAAI,IACA,GAAQ,GACZ,GAAI,CACA,GAAW,GAAY,UAClB,GAAP,CAEE,GADA,GAAQ,GACJ,EAAE,QACF,EAAE,QAAQ,QAEV,MAAM,IAId,AAAK,IACD,GAAS,OAAO,OAIjB,GAAS,SAGpB,EAAE,IAAM,SAAU,EAAS,EAAU,CACjC,MAAO,GAAE,GAAS,IAAI,IAe1B,EAAQ,UAAU,IAAM,SAAU,EAAU,CACxC,SAAW,EAAE,GAEN,KAAK,KAAK,SAAU,EAAO,CAC9B,MAAO,GAAS,MAAM,GAAO,YAAY,MAoBjD,EAAE,KAAO,EACT,WAAc,EAAO,EAAW,EAAU,EAAY,CAClD,MAAO,GAAE,GAAO,KAAK,EAAW,EAAU,GAG9C,EAAQ,UAAU,YAAc,SAAU,EAAO,CAC7C,MAAO,MAAK,KAAK,UAAY,CAAE,MAAO,MAG1C,EAAE,YAAc,SAAU,EAAS,EAAO,CACtC,MAAO,GAAE,GAAS,YAAY,IAGlC,EAAQ,UAAU,WAAa,SAAU,EAAQ,CAC7C,MAAO,MAAK,KAAK,UAAY,CAAE,KAAM,MAGzC,EAAE,WAAa,SAAU,EAAS,EAAQ,CACtC,MAAO,GAAE,GAAS,WAAW,IAcjC,EAAE,OAAS,EACX,WAAgB,EAAO,CACnB,GAAI,GAAU,GAAQ,CAClB,GAAI,GAAY,EAAM,UACtB,GAAI,EAAU,QAAU,YACpB,MAAO,GAAU,MAGzB,MAAO,GAOX,EAAE,UAAY,GACd,YAAmB,EAAQ,CACvB,MAAO,aAAkB,GAG7B,EAAE,eAAiB,GACnB,YAAwB,EAAQ,CAC5B,MAAO,GAAS,IAAW,MAAO,GAAO,MAAS,WAOtD,EAAE,UAAY,EACd,WAAmB,EAAQ,CACvB,MAAO,IAAU,IAAW,EAAO,UAAU,QAAU,UAG3D,EAAQ,UAAU,UAAY,UAAY,CACtC,MAAO,MAAK,UAAU,QAAU,WAOpC,EAAE,YAAc,EAChB,WAAqB,EAAQ,CACzB,MAAO,CAAC,GAAU,IAAW,EAAO,UAAU,QAAU,YAG5D,EAAQ,UAAU,YAAc,UAAY,CACxC,MAAO,MAAK,UAAU,QAAU,aAMpC,EAAE,WAAa,GACf,YAAoB,EAAQ,CACxB,MAAO,IAAU,IAAW,EAAO,UAAU,QAAU,WAG3D,EAAQ,UAAU,WAAa,UAAY,CACvC,MAAO,MAAK,UAAU,QAAU,YASpC,GAAI,IAAmB,GACnB,GAAsB,GACtB,GAA8B,GAC9B,GAA2B,GAE/B,aAAoC,CAChC,GAAiB,OAAS,EAC1B,GAAoB,OAAS,EAExB,IACD,IAA2B,IAInC,YAAwB,EAAS,EAAQ,CACrC,AAAI,CAAC,IAGD,OAAO,UAAY,UAAY,MAAO,SAAQ,MAAS,YACvD,EAAE,SAAS,SAAS,UAAY,CAC5B,AAAI,EAAc,GAAqB,KAAa,IAChD,SAAQ,KAAK,qBAAsB,EAAQ,GAC3C,GAA4B,KAAK,MAK7C,GAAoB,KAAK,GACzB,AAAI,GAAU,MAAO,GAAO,OAAU,YAClC,GAAiB,KAAK,EAAO,OAE7B,GAAiB,KAAK,cAAgB,IAI9C,YAA0B,EAAS,CAC/B,GAAI,EAAC,GAIL,IAAI,GAAK,EAAc,GAAqB,GAC5C,AAAI,IAAO,IACH,OAAO,UAAY,UAAY,MAAO,SAAQ,MAAS,YACvD,EAAE,SAAS,SAAS,UAAY,CAC5B,GAAI,GAAW,EAAc,GAA6B,GAC1D,AAAI,IAAa,IACb,SAAQ,KAAK,mBAAoB,GAAiB,GAAK,GACvD,GAA4B,OAAO,EAAU,MAIzD,GAAoB,OAAO,EAAI,GAC/B,GAAiB,OAAO,EAAI,KAIpC,EAAE,yBAA2B,GAE7B,EAAE,oBAAsB,UAAY,CAEhC,MAAO,IAAiB,SAG5B,EAAE,+BAAiC,UAAY,CAC3C,KACA,GAA2B,IAG/B,KAQA,EAAE,OAAS,GACX,YAAgB,EAAQ,CACpB,GAAI,GAAY,EAAQ,CACpB,KAAQ,SAAU,EAAU,CAExB,MAAI,IACA,GAAiB,MAEd,EAAW,EAAS,GAAU,OAE1C,UAAoB,CACnB,MAAO,OACR,UAAmB,CAClB,MAAO,CAAE,MAAO,WAAY,OAAQ,KAIxC,UAAe,EAAW,GAEnB,EAOX,EAAE,QAAU,GACZ,YAAiB,EAAO,CACpB,MAAO,GAAQ,CACX,KAAQ,UAAY,CAChB,MAAO,IAEX,IAAO,SAAU,EAAM,CACnB,MAAO,GAAM,IAEjB,IAAO,SAAU,EAAM,EAAK,CACxB,EAAM,GAAQ,GAElB,OAAU,SAAU,EAAM,CACtB,MAAO,GAAM,IAEjB,KAAQ,SAAU,EAAM,EAAM,CAG1B,MAAI,IAAS,KACF,EAAM,MAAM,OAAQ,GAEpB,EAAM,GAAM,MAAM,EAAO,IAGxC,MAAS,SAAU,EAAO,EAAM,CAC5B,MAAO,GAAM,MAAM,EAAO,IAE9B,KAAQ,UAAY,CAChB,MAAO,GAAY,KAExB,OAAQ,UAAmB,CAC1B,MAAO,CAAE,MAAO,YAAa,MAAO,KAS5C,YAAgB,EAAS,CACrB,GAAI,GAAW,IACf,SAAE,SAAS,UAAY,CACnB,GAAI,CACA,EAAQ,KAAK,EAAS,QAAS,EAAS,OAAQ,EAAS,cACpD,EAAP,CACE,EAAS,OAAO,MAGjB,EAAS,QAYpB,EAAE,OAAS,GACX,YAAgB,EAAQ,CACpB,MAAO,GAAQ,CACX,MAAS,UAAY,IACtB,SAAkB,EAAI,EAAM,CAC3B,MAAO,GAAS,EAAQ,EAAI,IAC7B,UAAY,CACX,MAAO,GAAE,GAAQ,YAczB,EAAE,OAAS,EACX,WAAgB,EAAO,EAAW,EAAU,CACxC,MAAO,GAAE,GAAO,OAAO,EAAW,GAGtC,EAAQ,UAAU,OAAS,SAAU,EAAW,EAAU,CACtD,MAAO,MAAK,MAAM,KAAK,SAAU,EAAO,CACpC,MAAO,GAAU,MAAM,OAAQ,IAChC,IA6BP,EAAE,MAAQ,EACV,WAAe,EAAe,CAC1B,MAAO,WAAY,CAGf,WAAmB,GAAM,GAAK,CAC1B,GAAI,IAUJ,GAAI,MAAO,gBAAkB,YAAa,CAEtC,GAAI,CACA,GAAS,EAAU,IAAM,UACpB,GAAP,CACE,MAAO,IAAO,IAElB,MAAI,IAAO,KACA,EAAE,GAAO,OAET,EAAK,GAAO,MAAO,EAAU,QAErC,CAGH,GAAI,CACA,GAAS,EAAU,IAAM,UACpB,GAAP,CACE,MAAI,GAAgB,IACT,EAAE,GAAU,OAEZ,GAAO,IAGtB,MAAO,GAAK,GAAQ,EAAU,KAGtC,GAAI,GAAY,EAAc,MAAM,KAAM,WACtC,EAAW,EAAU,KAAK,EAAW,QACrC,GAAU,EAAU,KAAK,EAAW,SACxC,MAAO,MAWf,EAAE,MAAQ,EACV,WAAe,EAAe,CAC1B,EAAE,KAAK,EAAE,MAAM,MA4BnB,EAAE,OAAY,EACd,WAAiB,EAAO,CACpB,KAAM,IAAI,GAAa,GAkB3B,EAAE,SAAW,EACb,WAAkB,EAAU,CACxB,MAAO,WAAY,CACf,MAAO,GAAO,CAAC,KAAM,EAAI,YAAa,SAAU,EAAM,EAAM,CACxD,MAAO,GAAS,MAAM,EAAM,MAYxC,EAAE,SAAW,EACb,WAAkB,EAAQ,EAAI,EAAM,CAChC,MAAO,GAAE,GAAQ,SAAS,EAAI,GAGlC,EAAQ,UAAU,SAAW,SAAU,EAAI,EAAM,CAC7C,GAAI,GAAO,KACP,EAAW,IACf,SAAE,SAAS,UAAY,CACnB,EAAK,gBAAgB,EAAS,QAAS,EAAI,KAExC,EAAS,SASpB,EAAE,IAAM,SAAU,EAAQ,EAAK,CAC3B,MAAO,GAAE,GAAQ,SAAS,MAAO,CAAC,KAGtC,EAAQ,UAAU,IAAM,SAAU,EAAK,CACnC,MAAO,MAAK,SAAS,MAAO,CAAC,KAUjC,EAAE,IAAM,SAAU,EAAQ,EAAK,EAAO,CAClC,MAAO,GAAE,GAAQ,SAAS,MAAO,CAAC,EAAK,KAG3C,EAAQ,UAAU,IAAM,SAAU,EAAK,EAAO,CAC1C,MAAO,MAAK,SAAS,MAAO,CAAC,EAAK,KAStC,EAAE,IACF,EAAE,OAAY,SAAU,EAAQ,EAAK,CACjC,MAAO,GAAE,GAAQ,SAAS,SAAU,CAAC,KAGzC,EAAQ,UAAU,IAClB,EAAQ,UAAU,OAAY,SAAU,EAAK,CACzC,MAAO,MAAK,SAAS,SAAU,CAAC,KAgBpC,EAAE,OACF,EAAE,KAAO,SAAU,EAAQ,EAAM,EAAM,CACnC,MAAO,GAAE,GAAQ,SAAS,OAAQ,CAAC,EAAM,KAG7C,EAAQ,UAAU,OAClB,EAAQ,UAAU,KAAO,SAAU,EAAM,EAAM,CAC3C,MAAO,MAAK,SAAS,OAAQ,CAAC,EAAM,KAUxC,EAAE,KACF,EAAE,MACF,EAAE,OAAS,SAAU,EAAQ,EAAkB,CAC3C,MAAO,GAAE,GAAQ,SAAS,OAAQ,CAAC,EAAM,EAAY,UAAW,MAGpE,EAAQ,UAAU,KAClB,EAAQ,UAAU,MAClB,EAAQ,UAAU,OAAS,SAAU,EAAkB,CACnD,MAAO,MAAK,SAAS,OAAQ,CAAC,EAAM,EAAY,UAAW,MAQ/D,EAAE,OAAS,SAAU,EAAQ,EAAM,CAC/B,MAAO,GAAE,GAAQ,SAAS,QAAS,CAAC,OAAQ,KAGhD,EAAQ,UAAU,OAAS,SAAU,EAAM,CACvC,MAAO,MAAK,SAAS,QAAS,CAAC,OAAQ,KAQ3C,EAAE,IACF,EAAE,MAAQ,SAAU,EAAqB,CACrC,MAAO,GAAE,GAAQ,SAAS,QAAS,CAAC,OAAQ,EAAY,UAAW,MAGvE,EAAQ,UAAU,MAAQ,UAAuB,CAC7C,MAAO,MAAK,SAAS,QAAS,CAAC,OAAQ,EAAY,cASvD,EAAE,MAAQ,SAAU,EAAoB,CACpC,GAAI,GAAU,EAAE,GACZ,EAAO,EAAY,UAAW,GAClC,MAAO,WAAkB,CACrB,MAAO,GAAQ,SAAS,QAAS,CAC7B,KACA,EAAK,OAAO,EAAY,gBAIpC,EAAQ,UAAU,MAAQ,UAAuB,CAC7C,GAAI,GAAU,KACV,EAAO,EAAY,WACvB,MAAO,WAAkB,CACrB,MAAO,GAAQ,SAAS,QAAS,CAC7B,KACA,EAAK,OAAO,EAAY,gBAWpC,EAAE,KAAO,SAAU,EAAQ,CACvB,MAAO,GAAE,GAAQ,SAAS,OAAQ,KAGtC,EAAQ,UAAU,KAAO,UAAY,CACjC,MAAO,MAAK,SAAS,OAAQ,KAYjC,EAAE,IAAM,EACR,WAAa,EAAU,CACnB,MAAO,GAAK,EAAU,SAAU,EAAU,CACtC,GAAI,GAAe,EACf,EAAW,IACf,SAAa,EAAU,SAAU,GAAW,GAAS,GAAO,CACxD,GAAI,IACJ,AACI,GAAU,KACT,IAAW,GAAQ,WAAW,QAAU,YAEzC,EAAS,IAAS,GAAS,MAE3B,GAAE,EACF,EACI,GACA,SAAU,GAAO,CACb,EAAS,IAAS,GACd,EAAE,GAAiB,GACnB,EAAS,QAAQ,IAGzB,EAAS,OACT,SAAU,GAAU,CAChB,EAAS,OAAO,CAAE,MAAO,GAAO,MAAO,SAIpD,QACC,IAAiB,GACjB,EAAS,QAAQ,GAEd,EAAS,UAIxB,EAAQ,UAAU,IAAM,UAAY,CAChC,MAAO,GAAI,OAUf,EAAE,IAAM,GAER,YAAa,EAAU,CACnB,GAAI,EAAS,SAAW,EACpB,MAAO,GAAE,UAGb,GAAI,GAAW,EAAE,QACb,EAAe,EACnB,SAAa,EAAU,SAAU,EAAM,GAAS,GAAO,CACnD,GAAI,IAAU,EAAS,IAEvB,IAEA,EAAK,GAAS,GAAa,GAAY,IACvC,YAAqB,GAAQ,CACzB,EAAS,QAAQ,IAErB,YAAoB,GAAK,CAErB,GADA,IACI,IAAiB,EAAG,CACpB,GAAI,IAAY,IAAO,GAAI,OAAM,GAAK,IAEtC,GAAU,QAAW,mGACgC,GAAU,QAE/D,EAAS,OAAO,KAGxB,YAAoB,GAAU,CAC1B,EAAS,OAAO,CACZ,MAAO,GACP,MAAO,OAGhB,QAEI,EAAS,QAGpB,EAAQ,UAAU,IAAM,UAAY,CAChC,MAAO,IAAI,OAYf,EAAE,YAAc,EAAU,GAAa,cAAe,cACtD,YAAqB,EAAU,CAC3B,MAAO,GAAK,EAAU,SAAU,EAAU,CACtC,SAAW,EAAU,EAAU,GACxB,EAAK,EAAI,EAAU,EAAU,SAAU,EAAS,CACnD,MAAO,GAAK,EAAS,EAAM,MAC1B,UAAY,CACb,MAAO,OAKnB,EAAQ,UAAU,YAAc,UAAY,CACxC,MAAO,IAAY,OAMvB,EAAE,WAAa,GACf,YAAoB,EAAU,CAC1B,MAAO,GAAE,GAAU,aAUvB,EAAQ,UAAU,WAAa,UAAY,CACvC,MAAO,MAAK,KAAK,SAAU,EAAU,CACjC,MAAO,GAAI,EAAU,EAAU,SAAU,EAAS,CAC9C,EAAU,EAAE,GACZ,YAAsB,CAClB,MAAO,GAAQ,UAEnB,MAAO,GAAQ,KAAK,EAAY,SAc5C,EAAE,KACF,EAAE,MAAW,SAAU,EAAQ,EAAU,CACrC,MAAO,GAAE,GAAQ,KAAK,OAAQ,IAGlC,EAAQ,UAAU,KAClB,EAAQ,UAAU,MAAW,SAAU,EAAU,CAC7C,MAAO,MAAK,KAAK,OAAQ,IAW7B,EAAE,SAAW,GACb,YAAkB,EAAQ,EAAY,CAClC,MAAO,GAAE,GAAQ,KAAK,OAAQ,OAAQ,GAG1C,EAAQ,UAAU,SAAW,SAAU,EAAY,CAC/C,MAAO,MAAK,KAAK,OAAQ,OAAQ,IAcrC,EAAE,IACF,EAAE,QAAa,SAAU,EAAQ,EAAU,CACvC,MAAO,GAAE,GAAQ,QAAW,IAGhC,EAAQ,UAAU,IAClB,EAAQ,UAAU,QAAa,SAAU,EAAU,CAC/C,GAAI,CAAC,GAAY,MAAO,GAAS,OAAU,WACvC,KAAM,IAAI,OAAM,kCAEpB,SAAW,EAAE,GACN,KAAK,KAAK,SAAU,EAAO,CAC9B,MAAO,GAAS,QAAQ,KAAK,UAAY,CACrC,MAAO,MAEZ,SAAU,EAAQ,CAEjB,MAAO,GAAS,QAAQ,KAAK,UAAY,CACrC,KAAM,QAWlB,EAAE,KAAO,SAAU,EAAQ,EAAW,EAAU,EAAU,CACtD,MAAO,GAAE,GAAQ,KAAK,EAAW,EAAU,IAG/C,EAAQ,UAAU,KAAO,SAAU,EAAW,EAAU,EAAU,CAC9D,GAAI,GAAmB,SAAU,GAAO,CAGpC,EAAE,SAAS,UAAY,CAEnB,GADA,GAAmB,GAAO,IACtB,EAAE,QACF,EAAE,QAAQ,QAEV,MAAM,OAMd,GAAU,GAAa,GAAY,EACnC,KAAK,KAAK,EAAW,EAAU,GAC/B,KAEJ,AAAI,MAAO,UAAY,UAAY,SAAW,QAAQ,QAClD,GAAmB,QAAQ,OAAO,KAAK,IAG3C,GAAQ,KAAK,OAAQ,IAYzB,EAAE,QAAU,SAAU,EAAQ,EAAI,EAAO,CACrC,MAAO,GAAE,GAAQ,QAAQ,EAAI,IAGjC,EAAQ,UAAU,QAAU,SAAU,EAAI,EAAO,CAC7C,GAAI,GAAW,IACX,EAAY,WAAW,UAAY,CACnC,AAAI,EAAC,GAAS,AAAa,MAAO,IAApB,WACV,GAAQ,GAAI,OAAM,GAAS,mBAAqB,EAAK,OACrD,EAAM,KAAO,aAEjB,EAAS,OAAO,IACjB,GAEH,YAAK,KAAK,SAAU,GAAO,CACvB,aAAa,GACb,EAAS,QAAQ,KAClB,SAAU,GAAW,CACpB,aAAa,GACb,EAAS,OAAO,KACjB,EAAS,QAEL,EAAS,SAYpB,EAAE,MAAQ,SAAU,EAAQ,EAAS,CACjC,MAAI,KAAY,QACZ,GAAU,EACV,EAAS,QAEN,EAAE,GAAQ,MAAM,IAG3B,EAAQ,UAAU,MAAQ,SAAU,EAAS,CACzC,MAAO,MAAK,KAAK,SAAU,EAAO,CAC9B,GAAI,GAAW,IACf,kBAAW,UAAY,CACnB,EAAS,QAAQ,IAClB,GACI,EAAS,WAaxB,EAAE,QAAU,SAAU,EAAU,EAAM,CAClC,MAAO,GAAE,GAAU,QAAQ,IAG/B,EAAQ,UAAU,QAAU,SAAU,EAAM,CACxC,GAAI,GAAW,IACX,EAAW,EAAY,GAC3B,SAAS,KAAK,EAAS,oBACvB,KAAK,OAAO,GAAU,KAAK,EAAS,QAC7B,EAAS,SAYpB,EAAE,OAAS,SAAU,EAAsB,CACvC,GAAI,GAAO,EAAY,UAAW,GAClC,MAAO,GAAE,GAAU,QAAQ,IAG/B,EAAQ,UAAU,OAAS,UAAuB,CAC9C,GAAI,GAAW,EAAY,WACvB,EAAW,IACf,SAAS,KAAK,EAAS,oBACvB,KAAK,OAAO,GAAU,KAAK,EAAS,QAC7B,EAAS,SAWpB,EAAE,OACF,EAAE,UAAY,SAAU,EAAsB,CAC1C,GAAI,IAAa,OACb,KAAM,IAAI,OAAM,sCAEpB,GAAI,GAAW,EAAY,UAAW,GACtC,MAAO,WAAY,CACf,GAAI,GAAW,EAAS,OAAO,EAAY,YACvC,EAAW,IACf,SAAS,KAAK,EAAS,oBACvB,EAAE,GAAU,OAAO,GAAU,KAAK,EAAS,QACpC,EAAS,UAIxB,EAAQ,UAAU,OAClB,EAAQ,UAAU,UAAY,UAAuB,CACjD,GAAI,GAAO,EAAY,WACvB,SAAK,QAAQ,MACN,EAAE,UAAU,MAAM,OAAQ,IAGrC,EAAE,MAAQ,SAAU,EAAU,EAAmB,CAC7C,GAAI,GAAW,EAAY,UAAW,GACtC,MAAO,WAAY,CACf,GAAI,GAAW,EAAS,OAAO,EAAY,YACvC,GAAW,IACf,EAAS,KAAK,GAAS,oBACvB,aAAiB,CACb,MAAO,GAAS,MAAM,EAAO,WAEjC,SAAE,IAAO,OAAO,GAAU,KAAK,GAAS,QACjC,GAAS,UAIxB,EAAQ,UAAU,MAAQ,UAA8B,CACpD,GAAI,GAAO,EAAY,UAAW,GAClC,SAAK,QAAQ,MACN,EAAE,MAAM,MAAM,OAAQ,IAYjC,EAAE,QACF,EAAE,MAAQ,SAAU,EAAQ,EAAM,EAAM,CACpC,MAAO,GAAE,GAAQ,MAAM,EAAM,IAGjC,EAAQ,UAAU,QAClB,EAAQ,UAAU,MAAQ,SAAU,EAAM,EAAM,CAC5C,GAAI,GAAW,EAAY,GAAQ,IAC/B,EAAW,IACf,SAAS,KAAK,EAAS,oBACvB,KAAK,SAAS,OAAQ,CAAC,EAAM,IAAW,KAAK,EAAS,QAC/C,EAAS,SAapB,EAAE,MACF,EAAE,OACF,EAAE,QAAU,SAAU,EAAQ,EAAkB,CAC5C,GAAI,GAAW,EAAY,UAAW,GAClC,EAAW,IACf,SAAS,KAAK,EAAS,oBACvB,EAAE,GAAQ,SAAS,OAAQ,CAAC,EAAM,IAAW,KAAK,EAAS,QACpD,EAAS,SAGpB,EAAQ,UAAU,MAClB,EAAQ,UAAU,OAClB,EAAQ,UAAU,QAAU,SAAU,EAAkB,CACpD,GAAI,GAAW,EAAY,UAAW,GAClC,EAAW,IACf,SAAS,KAAK,EAAS,oBACvB,KAAK,SAAS,OAAQ,CAAC,EAAM,IAAW,KAAK,EAAS,QAC/C,EAAS,SAapB,EAAE,QAAU,GACZ,YAAiB,EAAQ,EAAU,CAC/B,MAAO,GAAE,GAAQ,QAAQ,GAG7B,EAAQ,UAAU,QAAU,SAAU,EAAU,CAC5C,GAAI,EACA,KAAK,KAAK,SAAU,EAAO,CACvB,EAAE,SAAS,UAAY,CACnB,EAAS,KAAM,MAEpB,SAAU,EAAO,CAChB,EAAE,SAAS,UAAY,CACnB,EAAS,WAIjB,OAAO,OAIf,EAAE,WAAa,UAAW,CACtB,KAAM,IAAI,OAAM,uDAIpB,GAAI,IAAc,KAElB,MAAO,OCzhEP,eAkBA,GAAI,IAAO,GAAQ,QACf,GAAS,KAEb,GAAQ,YAAc,GAEtB,YAAiB,EAAa,EAAU,EAAY,CAElD,WAA2B,EAAO,EAAY,EAAa,CACzD,EAAS,KAAK,KAAM,EAAO,EAAY,GAGzC,UAAK,SAAS,EAAmB,GAEjC,EAAkB,UAAU,kBAAoB,SAAS,EAAM,EAAM,EAAO,CAC1E,AAAI,GAAQ,GAAO,YAAY,MAAQ,GAAQ,GAAO,YAAY,OAChE,GAAW,cAAc,GAAS,EAClC,EAAkB,OAAO,UAAU,kBAAkB,KAAK,KACA,EAAc,IAAM,EACpB,EACA,IAE1D,EAAkB,OAAO,UAAU,kBAAkB,KAAK,KAAM,EAAM,EAAM,IAIzE,EAGT,aAAuB,CACrB,KAAK,MAAQ,EAGf,GAAY,UAAU,aAAe,SAAS,EAAa,EAAe,EAAY,CACpF,AAAI,EAAc,QAChB,GAAgB,EAAc,QAEhC,GAAI,GAAU,SAAS,EAAK,EAAO,CACjC,EAAW,MAAM,EAAI,IAEnB,EAAY,GAAI,GAAW,UAAU,OAAW,GAChD,EAAkB,GAAI,IAAQ,EAAa,EAAW,SAAU,GAChE,EAAS,GAAI,GAAc,EAAW,GACtC,EAAO,KACX,SAAO,UAAY,UAAW,CAC5B,SAAK,OAAS,EACP,EAAK,OAGV,MAAO,GAAW,QAAW,UAC/B,GAAW,OAAS,IAEtB,EAAW,OAAO,GAAe,EAE1B,KCvET,oBAmBA,GAAI,IAAS,KACT,GAA2B,KAC3B,GAAmB,KAEvB,GAAO,QAAU,GAEjB,YAA0B,EAAQ,EAAU,CAC1C,KAAK,MAAQ,GAAU,GAAI,QAAO,GAClC,KAAK,WAAa,GAClB,KAAK,SAAW,EAChB,KAAK,QAAU,EACf,KAAK,QAAU,EAGjB,GAAiB,UAAY,GAAI,IAEjC,GAAiB,SAAW,SAAS,EAAU,EAAO,CACpD,GAAI,GAAW,KAEf,MAAO,UAAS,EAAM,CAQpB,IANI,GACF,GAAO,OAAO,OAAO,CAAC,EAAU,IAChC,EAAW,MAIN,EAAK,QAAQ,CAClB,GAAI,EAAK,OAAS,EAAG,CAEnB,EAAW,EACX,OAEF,GAAI,GAAY,GAAO,QAAQ,EAAM,GACrC,GAAI,EAAK,OAAS,EAAI,EAAW,CAE/B,EAAW,EACX,OAGF,GAAI,GAAQ,EAAK,MAAM,EAAG,EAAI,GAC9B,EAAW,EAAK,MAAM,EAAI,GAE1B,EAAS,GAAI,IAAiB,GAAQ,GAEtC,EAAO,EACP,EAAW,QAKjB,GAAiB,UAAU,eAAiB,UAAU,GACtD,GAAiB,UAAU,iBAAmB,UAAU,GAGxD,GAAiB,UAAU,OAAS,UAAW,CAC7C,MAAO,IAET,GAAiB,UAAU,KAAO,UAAW,GAC7C,GAAiB,UAAU,MAAS,UAAW,GAI/C,GAAiB,UAAU,aAAe,SAAS,EAAO,CACxD,KAAK,OAAS,GAGhB,GAAiB,UAAU,gBAAkB,SAAS,EAAK,CACzD,GAAI,KAAK,QAAU,EAAM,KAAK,MAAM,OAClC,KAAM,IAAI,KAId,GAAiB,UAAU,KAAO,SAAS,EAAK,CAC9C,KAAK,gBAAgB,GACrB,GAAI,GAAM,KAAK,QAAU,EAEzB,GAAI,KAAK,MAAM,OAAS,EACtB,KAAM,IAAI,OAAM,QAAU,EAAM,8BAGlC,GAAI,GAAM,KAAK,MAAM,MAAM,KAAK,QAAS,GACzC,YAAK,QAAU,EACR,GAGT,GAAiB,UAAU,SAAW,UAAW,CAC/C,YAAK,gBAAgB,GACd,GAAO,SAAS,KAAK,MAAM,KAAK,aAGzC,GAAiB,UAAU,QAAU,UAAW,CAC9C,KAAK,gBAAgB,GACrB,GAAI,GAAM,GAAO,QAAQ,KAAK,MAAO,KAAK,SAC1C,YAAK,SAAW,EACT,GAGT,GAAiB,UAAU,QAAU,UAAW,CAC9C,KAAK,gBAAgB,GACrB,GAAI,GAAM,GAAO,QAAQ,KAAK,MAAO,KAAK,SAC1C,YAAK,SAAW,EACT,GAGT,GAAiB,UAAU,WAAa,UAAW,CACjD,KAAK,gBAAgB,GACrB,GAAI,GAAI,GAAO,WAAW,KAAK,MAAO,KAAK,SAC3C,YAAK,SAAW,EACT,GAGT,GAAiB,UAAU,WAAa,SAAS,EAAK,CACpD,KAAK,gBAAgB,GACrB,GAAI,GAAM,KAAK,MAAM,SAAS,OAAQ,KAAK,QAAS,KAAK,QAAU,GACnE,YAAK,SAAW,EACT,GAGT,GAAiB,UAAU,OAAS,UAAW,CAC7C,MAAO,CACL,IAAK,KAAK,MACV,UAAW,KAAK,QAChB,WAAY,KAAK,MAAM,SAI3B,GAAiB,UAAU,QAAU,SAAS,EAAe,CAC3D,KAAK,SAAW,GAGlB,GAAiB,UAAU,MAAQ,SAAS,EAAK,EAAU,CACzD,AAAI,MAAO,IAAS,UAClB,GAAM,GAAI,QAAO,EAAK,GAAY,SAEpC,KAAK,WAAW,KAAK,GACrB,KAAK,UAAY,EAAI,QAGvB,GAAiB,UAAU,MAAQ,UAAW,CAG5C,GAAI,GAAQ,KAAK,OACjB,KAAK,OAAS,KAEd,GAAI,GAAM,GAAI,QAAO,KAAK,UACtB,EAAM,EAMV,GALA,KAAK,WAAW,QAAQ,SAAS,EAAK,CACpC,EAAI,KAAK,EAAK,EAAK,GACnB,GAAO,EAAI,SAGT,KAAK,QAAS,CAEhB,GAAI,GAAM,GAAI,QAAO,EAAI,OAAS,GAClC,GAAO,SAAS,EAAK,EAAI,QACzB,EAAI,KAAK,EAAK,EAAG,EAAG,EAAI,QACpB,KAAK,SAEP,KAAK,QAAQ,EAAK,GAItB,KAAK,WAAa,GAClB,KAAK,SAAW,KCvLlB,oBAmBA,GAAI,IAAM,KAEV,GAAO,QAAU,GAajB,YAA6B,EAAK,CAC9B,KAAK,QAAQ,GAIjB,GAAoB,UAAU,QAAU,SAAS,EAAK,CACpD,KAAK,IAAM,EACX,KAAK,OAAS,KACd,KAAK,UAAY,GACjB,KAAK,aAAe,GACpB,KAAK,SAAW,GAChB,KAAK,SAAW,GAChB,KAAK,QAAU,EACf,KAAK,QAAU,GAWjB,GAAoB,UAAU,MAAQ,SAAS,EAAO,EAAU,CAC9D,GAAI,GAAO,KACX,AAAI,KAAK,SAEP,MAAK,OAAO,KAAK,KAAK,UACtB,KAAK,UAAU,KAAM,UAAW,CAC9B,GAAI,GAAiB,EACrB,MAAO,UAAS,EAAK,CACnB,EAAK,cAAc,GACnB,UAKJ,KAAK,aAAa,KAAK,CACrB,IAAK,KAAK,SACV,GAAK,KAKX,GAAoB,UAAU,SAAW,UAAW,CACjD,GAAI,GAAO,KACX,AAAI,KAAK,aAAa,OAAS,GAG5B,MAAK,aAAa,QAAQ,SAAS,EAAM,CACtC,EAAK,OAAO,KAAK,EAAK,KACtB,EAAK,UAAU,KAAM,UAAW,CAC9B,GAAI,GAAiB,EAAK,GAC1B,MAAO,UAAS,EAAK,CAClB,EAAK,cAAc,GACnB,WAIR,KAAK,aAAe,KAI1B,GAAoB,UAAU,UAAY,SAAS,EAAK,CACtD,KAAK,QAAQ,KAAK,MAGpB,GAAoB,UAAU,YAAc,SAAS,EAAK,CACxD,AAAI,KAAK,UAAU,QACjB,KAAK,UAAU,QAAQ,EAAI,OAI/B,GAAoB,UAAU,UAAY,SAAS,EAAK,CACtD,GAAI,MAAM,cAAgB,EAAI,YAC9B,KAAK,OAAO,SAOd,GAAoB,UAAU,cAAgB,SAAS,EAAK,CAC1D,KAAK,SAAW,EAChB,KAAK,YAAc,KAAK,SAAS,OACjC,KAAK,KAAO,KAAK,SAAS,OAC1B,KAAK,KAAO,GAQd,GAAoB,UAAU,OAAS,UAAW,CAChD,MAAO,MAAK,QAAU,KAAK,OAAO,YAAc,KAAK,OAAO,MAM9D,GAAoB,UAAU,KAAO,UAAW,CAE9C,AAAI,KAAK,QAAU,KAAK,OAAO,YAAc,KAAK,OAAO,QAIzD,MAAK,OAAS,GAAI,WAAU,KAAK,KACjC,KAAK,OAAO,OAAS,KAAK,SAAS,KAAK,MACxC,KAAK,OAAO,UAAY,KAAK,YAAY,KAAK,MAC9C,KAAK,OAAO,QAAU,KAAK,UAAU,KAAK,MAC1C,KAAK,OAAO,QAAU,KAAK,UAAU,KAAK,QAM5C,GAAoB,UAAU,MAAQ,UAAW,CAC/C,KAAK,OAAO,SASd,GAAoB,UAAU,KAAO,SAAS,EAAK,CACjD,GAAI,GAAQ,KAAK,KAAO,KAAK,KAE7B,GAAI,IAAU,EACZ,MAAO,GAGT,GAAI,GAAO,EAEX,AAAI,EAAQ,GACV,GAAO,GAGT,GAAI,GAAM,KAAK,SAAS,OAAO,KAAK,KAAM,GAC1C,YAAK,MAAQ,EAGN,GAOT,GAAoB,UAAU,QAAU,UAAW,CACjD,MAAO,MAAK,UAOd,GAAoB,UAAU,MAAQ,SAAS,EAAK,CAClD,KAAK,SAAW,GAQlB,GAAoB,UAAU,cAAgB,UAAW,CACvD,MAAO,MAAK,YC5Md,eAkBA,GAAQ,OAAS,KAEjB,GAAI,IAAe,KACnB,GAAQ,aAAe,GAAa,aACpC,GAAQ,mBAAqB,GAAa,mBAC1C,GAAQ,eAAiB,GAAa,eAEtC,GAAI,IAAgB,KACpB,GAAQ,cAAgB,GAAc,cACtC,GAAQ,oBAAsB,GAAc,oBAC5C,GAAQ,gBAAkB,GAAc,gBAGxC,GAAQ,MAAQ,KAChB,GAAQ,EAAI,KAEZ,GAAI,IAAc,KAClB,GAAQ,YAAc,GAAY,YAMlC,GAAQ,mBAAqB,KAC7B,GAAQ,iBAAmB,KAC3B,GAAQ,oBAAsB,KAE9B,GAAQ,SAAW,KACnB,GAAQ,cAAgB,KACxB,GAAQ,gBAAkB,KAC1B,GAAQ,iBAAmB,OC5C3B,GAAM,IAAU,CACd,KAAM,MAAO,OAAS,aAAe,KACrC,OAAQ,MAAO,SAAW,aAAe,OACzC,OAAQ,MAAO,SAAW,aAAe,OACzC,SAAU,MAAO,WAAa,aAAe,UAIzC,GAAa,GAAQ,MAAQ,GAAQ,QAAU,GAAQ,QAAU,GACjE,GAAe,GAAQ,QAAU,GAAQ,MAAQ,GAAQ,QAAU,GACnE,GAAe,GAAQ,QAAU,GAAQ,MAAQ,GAAQ,QAAU,GACnE,GAAiB,GAAQ,UAAY,GAKpC,GAAM,IAEX,QAAQ,MAAO,UAAY,UAAY,OAAO,WAAa,oBAAsB,QAAQ,SAM3F,GAAM,IACJ,MAAO,UAAY,aAAe,QAAQ,SAAW,YAAY,KAAK,QAAQ,SAEnE,GAAuB,IAAW,WAAW,GAAQ,KAAQ,ECpBnE,YACL,EACA,EAAqB,GACrB,EACgB,CAEhB,GAAM,GAAe,GAAa,GAAI,KAEtC,GAAK,GAEE,GAAI,GAAe,GACxB,EAAa,IAAI,WACR,GAAe,EAAO,QAE/B,EAAa,IAAI,EAAO,gBACf,aAAY,OAAO,IAGvB,GAAI,GAAa,MAAO,IAAW,SACxC,OAAW,KAAO,GAEhB,GAAgB,EAAO,GAAM,EAAW,IAM5C,MAAO,KAAc,OAAY,MAAM,KAAK,GAAgB,GAI9D,YAAwB,EAAiB,CACvC,MAAK,GAGD,YAAkB,cAGlB,MAAO,cAAgB,aAAe,YAAkB,cAGxD,MAAO,cAAgB,aAAe,YAAkB,cAIxD,MAAO,kBAAoB,aAAe,YAAkB,iBAZvD,GCxCX,aAAyB,CAEvB,GAAI,YACJ,GAAI,CAEF,KAAK,gEACL,WAAa,WAAW,gBAExB,EACF,MAAO,YAGT,GAAM,IAAsB,GAAI,KAKhC,QAAgC,OAEvB,iBAA0B,CAC/B,MAAO,OAAO,OAAS,aAAe,QAAQ,gBAMrC,WAAU,EAA4E,CAC/F,WAAuB,EAAS,CAE9B,GAAM,GAAa,KACb,CAAC,OAAM,WAAW,EAAa,EAAU,EAAQ,KAIvD,EAAU,EAAM,GAGlB,GAAM,GAAa,KACnB,AAAI,EACF,GAAW,GAAG,UAAW,GAGzB,EAAW,GAAG,OAAQ,IAAM,QAAQ,MAAM,yBAG1C,WAAW,UAAY,QAIpB,kBACL,EACA,CACA,GAAI,GAAmB,GAAoB,IAAI,GAE/C,AAAK,GACH,GAAmB,AAAC,GAA+B,CACjD,GAAI,CAAC,GAAe,GAClB,OAIF,GAAM,GAAa,KACb,CAAC,OAAM,WAAW,EAAa,EAAU,EAAQ,KACvD,EAAU,EAAM,KAKpB,AADmB,KAEjB,QAAQ,MAAM,mBAEd,WAAW,iBAAiB,UAAW,SAIpC,qBACL,EACA,CACA,GAAM,GAAmB,GAAoB,IAAI,GACjD,GAAoB,OAAO,GAE3B,AADmB,KAEjB,QAAQ,MAAM,mBAEd,WAAW,oBAAoB,UAAW,SASvC,aAAY,EAAyB,EAAqC,CAC/E,GAAM,GAA0B,CAAC,OAAQ,aAAc,OAAM,WAEvD,EAAe,GAAgB,GAE/B,EAAa,KACnB,AAAI,EACF,EAAW,YAAY,EAAM,GAI7B,WAAW,YAAY,EAAM,KAMnC,YAAwB,EAA4B,CAClD,GAAM,CAAC,OAAM,QAAQ,EACrB,MACE,KAAS,WACT,GACA,MAAO,GAAK,QAAW,UACvB,EAAK,OAAO,WAAW,cCnH3B,GAAI,IAAY,EAMT,YAA4B,EAA0B,CAE3D,AAAI,CAAC,GAAW,kBAIhB,IAAW,UAAY,MAAO,EAAM,IAAY,CAC9C,OAAQ,OACD,UACH,GAAI,CAGF,GAAM,CAAC,QAAO,UAAU,GAAI,UAAU,IAAM,EAEtC,EAAS,KAAM,IAAU,CAC7B,SACA,YAAa,EACb,UAEA,QAAS,IACJ,EACH,OAAQ,MAGZ,GAAW,YAAY,OAAQ,CAAC,iBACzB,EAAP,CACA,GAAM,GAAU,YAAiB,OAAQ,EAAM,QAAU,GACzD,GAAW,YAAY,QAAS,CAAC,MAAO,IAE1C,kBAMR,YACE,EACA,EACA,EACA,EACe,CACf,MAAO,IAAI,SAAQ,CAAC,EAAS,IAAW,CACtC,GAAM,GAAK,KAIL,EAAY,CAAC,EAAM,IAAY,CACnC,GAAI,EAAQ,KAAO,EAKnB,OAAQ,OACD,OACH,GAAW,oBAAoB,GAC/B,EAAQ,EAAQ,QAChB,UAEG,QACH,GAAW,oBAAoB,GAC/B,EAAO,EAAQ,OACf,iBAON,GAAW,iBAAiB,GAG5B,GAAM,GAAU,CAAC,KAAI,MAAO,EAAa,WACzC,GAAW,YAAY,UAAW,KAQtC,kBAAyB,CACvB,SACA,cACA,UACA,WAMC,CACD,GAAI,GACA,EACJ,GAAI,EAAO,WAAa,EAAO,MAC7B,EAAO,EACP,EAAS,EAAO,WAAa,EAAO,cAC3B,EAAO,cAEhB,EAAO,AADa,GAAI,eACL,OAAO,GAC1B,EAAS,EAAO,kBAEhB,MAAM,IAAI,OAAM,4BAA4B,EAAO,eAIrD,SAAU,IACL,EACH,QAAU,GAAU,EAAO,SAAW,EAAO,QAAQ,SAAY,GACjE,OAAQ,IAGH,KAAM,GAAO,EAAM,IAAI,GAAU,EAAS,GC3F5C,eAAoC,EAAoD,CAE7F,GAAM,GAAe,EAAQ,IAAI,AAAC,GAChC,YAAmB,aAAc,GAAI,YAAW,GAAW,GAIvD,EAAa,EAAa,OAAO,CAAC,EAAQ,IAAe,EAAS,EAAW,WAAY,GAGzF,EAAS,GAAI,YAAW,GAG1B,EAAS,EACb,OAAW,KAAe,GACxB,EAAO,IAAI,EAAa,GACxB,GAAU,EAAY,WAIxB,MAAO,GAAO,OCbhB,kBACE,EACsB,CACtB,GAAM,GAA8B,GACpC,aAAiB,KAAS,GACxB,EAAa,KAAK,GAEpB,MAAO,IAAwB,GAAG,GCnC7B,YAAuB,EAAQ,CACpC,MAAO,GCJF,YAAkB,EAAqB,CAC5C,MAAO,IAAS,MAAO,IAAU,UAAY,EAAM,SAc9C,YAAuB,EAA4B,CAExD,GAAI,GAAS,GACX,MAAO,AAAK,IAAc,GAG5B,GAAI,YAAgB,aAClB,MAAO,GAIT,GAAI,YAAY,OAAO,GACrB,MAAI,GAAK,aAAe,GAAK,EAAK,aAAe,EAAK,OAAO,WACpD,EAAK,OAEP,EAAK,OAAO,MAAM,EAAK,WAAY,EAAK,WAAa,EAAK,YAGnE,GAAI,MAAO,IAAS,SAAU,CAC5B,GAAM,GAAO,EAEb,MAAO,AADY,IAAI,eAAc,OAAO,GAC1B,OAIpB,GAAI,GAAQ,MAAO,IAAS,UAAa,EAAa,eACpD,MAAQ,GAAa,iBAGvB,KAAM,IAAI,OAAM,iBCLX,YAA0B,EAAiE,CAChG,MAAO,AAAC,IACN,GAAI,SAAQ,CAAC,EAAS,IACpB,EAAG,EAAM,CAAC,EAAO,IAAkB,EAAQ,EAAO,GAAS,EAAQ,KCvClE,YAA0B,EAAwC,CACvE,GAAI,YAAgB,aAElB,MAAO,CACL,KAAM,MAAO,EAAe,IAAmB,OAAO,KAAK,EAAM,EAAO,GACxE,MAAO,SAAY,GACnB,KAAM,AAJyB,EAIb,YAItB,GAAM,GAAa,EACnB,MAAO,CACL,KAAM,MAAO,EAAe,IAAmB,CAC7C,GAAM,GAAc,KAAM,GAAK,MAAM,EAAO,EAAQ,GAAQ,cAC5D,MAAO,QAAO,KAAK,IAErB,MAAO,SAAY,GACnB,KAAM,EAAK,MCCf,OAAmB,SACnB,GAAoB,SAzBpB,AA2BO,GAAM,IAAa,WACb,GAAoB,GAkB1B,gBAAqB,WAAW,CAgErC,YAAY,EAAK,EAAmB,EAAiB,CACnD,GAAI,MAAO,IAAQ,SACjB,MAAO,IAAO,KAAK,EAAK,EAAkB,GAI5C,GAAM,GAAO,EACb,GAAI,EAAO,GACT,KAAM,IAAI,YAAW,cAAc,mCAErC,GAAI,MAAO,IAAqB,SAC9B,KAAM,IAAI,WAAU,sEAEtB,MAAM,EAAO,EAAI,EAAI,GAAQ,GAAQ,GAvDvC,eAAY,MAjBR,SAAS,CACX,GAAI,EAAC,GAAO,SAAS,MACrB,MAAO,MAAK,UAGV,SAAS,CACX,GAAI,EAAC,GAAO,SAAS,MACrB,MAAO,MAAK,iBA8GP,MAAK,EAAO,EAAkB,EAAQ,CAC3C,GAAI,MAAO,IAAU,SACnB,MAAO,IAAW,EAAO,GAG3B,GAAI,YAAY,OAAO,GACrB,MAAO,IAAc,GAGvB,GAAI,GAAS,KACX,KAAM,IAAI,WACR,kHAGG,MAAO,MAQd,GAJI,GAAW,EAAO,cAAiB,GAAS,GAAW,EAAM,OAAQ,cAKvE,MAAO,oBAAsB,aAC5B,IAAW,EAAO,oBAChB,GAAS,GAAW,EAAM,OAAQ,oBAErC,MAAO,IAAgB,EAAO,EAAkB,GAGlD,GAAI,MAAO,IAAU,SACnB,KAAM,IAAI,WAAU,yEAGtB,GAAM,GAAU,EAAM,SAAW,EAAM,UACvC,GAAI,GAAW,MAAQ,IAAY,EACjC,MAAO,IAAO,KAAK,EAAS,EAAkB,GAGhD,GAAM,GAAI,GAAW,GACrB,GAAI,EAAG,MAAO,GAEd,GACE,MAAO,SAAW,aAClB,OAAO,aAAe,MACtB,MAAO,GAAM,OAAO,cAAiB,WAErC,MAAO,IAAO,KAAK,EAAM,OAAO,aAAa,UAAW,EAAkB,GAG5E,KAAM,IAAI,WACR,kHAGG,MAAO,YASP,UAAS,EAAuB,CACrC,MAAO,IAAK,MAAQ,EAAE,YAAc,IAAQ,IAAM,GAAO,gBAMpD,SAAQ,EAAwB,EAAgC,CAGrE,GAFI,CAAC,GAAO,SAAS,IAAM,GAAW,EAAG,aAAa,GAAI,GAAO,KAAK,EAAG,EAAE,OAAQ,EAAE,aACjF,CAAC,GAAO,SAAS,IAAM,GAAW,EAAG,aAAa,GAAI,GAAO,KAAK,EAAG,EAAE,OAAQ,EAAE,aACjF,CAAC,GAAO,SAAS,IAAM,CAAC,GAAO,SAAS,GAC1C,KAAM,IAAI,WAAU,yEAGtB,GAAI,IAAM,EAAG,MAAO,GAEpB,GAAI,GAAI,EAAE,OACN,EAAI,EAAE,OAEV,OAAS,GAAI,EAAG,EAAM,KAAK,IAAI,EAAG,GAAI,EAAI,EAAK,EAAE,EAC/C,GAAI,EAAE,KAAO,EAAE,GAAI,CACjB,EAAI,EAAE,GACN,EAAI,EAAE,GACN,MAIJ,MAAI,GAAI,EAAU,GACd,EAAI,EAAU,EACX,QASF,YAAW,EAA2B,CAC3C,OAAQ,OAAO,GAAU,mBAClB,UACA,WACA,YACA,YACA,aACA,aACA,aACA,WACA,YACA,cACA,WACH,MAAO,WAEP,MAAO,UAeN,QAAO,EAA+B,EAAyB,CACpE,GAAI,CAAC,MAAM,QAAQ,GACjB,KAAM,IAAI,WAAU,+CAGtB,GAAI,EAAK,SAAW,EAClB,MAAO,IAAO,MAAM,GAGtB,GAAI,GACJ,GAAI,IAAW,OAEb,IADA,EAAS,EACJ,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EAC7B,GAAU,EAAK,GAAG,OAItB,GAAM,GAAS,GAAO,YAAY,GAC9B,EAAM,EACV,IAAK,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EAAG,CAChC,GAAI,GAAM,EAAK,GACf,GAAI,GAAW,EAAK,YAClB,AAAI,EAAM,EAAI,OAAS,EAAO,OACvB,IAAO,SAAS,IACnB,GAAM,GAAO,KAAK,EAAI,OAAQ,EAAI,WAAY,EAAI,aAEpD,EAAI,KAAK,EAAQ,IAEjB,WAAW,UAAU,IAAI,KAAK,EAAQ,EAAK,WAEnC,GAAO,SAAS,GAG1B,EAAI,KAAK,EAAQ,OAFjB,MAAM,IAAI,WAAU,+CAItB,GAAO,EAAI,OAEb,MAAO,SAWF,OAAM,EAAc,EAAiC,EAA2B,CACrF,MAAO,IAAM,EAAM,EAAM,SASpB,aAAY,EAAsB,CACvC,UAAW,GACJ,GAAI,IAAO,SASb,iBAAgB,EAAsB,CAC3C,MAAO,aAAY,GAGrB,SAAS,EAA+B,EAAqB,EAA4B,CACvF,MAAO,MAAK,QAAQ,EAAK,EAAY,KAAc,GAGrD,QAAQ,EAA+B,EAAqB,EAA2B,CACrF,MAAO,IAAqB,KAAM,EAAK,EAAY,EAAU,IAG/D,YAAY,EAA+B,EAAqB,EAA2B,CACzF,MAAO,IAAqB,KAAM,EAAK,EAAY,EAAU,IAG/D,SAAS,EAAgB,EAA4B,CAGnD,MAFA,GAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACvC,AAAE,KAAK,GAAU,IACb,KAAO,KAAK,GAAU,GAAK,GADA,KAAK,GAI1C,YAAY,EAAgB,EAA4B,CACtD,EAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAC3C,GAAM,GAAM,KAAK,GAAW,KAAK,EAAS,IAAM,EAChD,MAAO,GAAM,MAAS,EAAM,WAAa,EAG3C,YAAY,EAAgB,EAA4B,CACtD,EAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAC3C,GAAM,GAAM,KAAK,EAAS,GAAM,KAAK,IAAW,EAChD,MAAO,GAAM,MAAS,EAAM,WAAa,EAG3C,YAAY,EAAgB,EAA4B,CACtD,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAGzC,KAAK,GAAW,KAAK,EAAS,IAAM,EAAM,KAAK,EAAS,IAAM,GAAO,KAAK,EAAS,IAAM,GAI7F,YAAY,EAAgB,EAA4B,CACtD,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAGxC,KAAK,IAAW,GAAO,KAAK,EAAS,IAAM,GAAO,KAAK,EAAS,IAAM,EAAK,KAAK,EAAS,GAI9F,UAAU,EAAgB,EAAoB,EAA4B,CACxE,EAAS,IAAW,EACpB,EAAa,IAAe,EACvB,GAAU,GAAY,EAAQ,EAAY,KAAK,QAEpD,GAAI,GAAI,EACJ,EAAM,EACN,EAAM,KAAK,EAAS,EAAE,GAC1B,KAAO,EAAI,GAAM,IAAO,MACtB,GAAO,KAAK,EAAS,EAAE,GAAK,EAE9B,UAAO,IAEH,GAAO,GAAK,IAAO,KAAK,IAAI,EAAG,EAAI,IAEhC,EAGT,UAAU,EAAgB,EAAoB,EAA4B,CACxE,EAAS,IAAW,EACpB,EAAa,IAAe,EACvB,GAAU,GAAY,EAAQ,EAAY,KAAK,QAEpD,GAAI,GAAM,KAAK,GACX,EAAM,EACN,EAAI,EACR,KAAO,EAAE,EAAI,GAAe,IAAO,MACjC,GAAO,KAAK,EAAS,GAAK,EAE5B,UAAO,IAEH,GAAO,GAAK,IAAO,KAAK,IAAI,EAAG,EAAI,IAEhC,EAGT,eAAe,EAAwB,CACrC,EAAS,IAAW,EACpB,GAAe,EAAQ,UACvB,GAAM,GAAQ,KAAK,GACb,EAAO,KAAK,EAAS,GAC3B,AAAI,KAAU,QAAa,IAAS,SAClC,GAAY,EAAQ,KAAK,OAAS,GAGpC,GAAM,GACJ,KAAK,EAAS,GAAK,KAAK,EAAS,GAAK,GAAK,EAAI,KAAK,EAAS,GAAK,GAAK,GAAM,IAAQ,IAEvF,MACG,QAAO,IAAQ,OAAO,KACvB,OAAO,EAAQ,KAAK,EAAE,GAAU,GAAK,EAAI,KAAK,EAAE,GAAU,GAAK,GAAK,KAAK,EAAE,GAAU,GAAK,IAI9F,eAAe,EAAwB,CACrC,EAAS,IAAW,EACpB,GAAe,EAAQ,UACvB,GAAM,GAAQ,KAAK,GACb,EAAO,KAAK,EAAS,GAC3B,AAAI,KAAU,QAAa,IAAS,SAClC,GAAY,EAAQ,KAAK,OAAS,GAGpC,GAAM,GACH,IAAS,IACV,KAAK,EAAE,GAAU,GAAK,GACtB,KAAK,EAAE,GAAU,GAAK,EACtB,KAAK,EAAE,GAET,MACG,QAAO,IAAQ,OAAO,KACvB,OAAO,KAAK,EAAE,GAAU,GAAK,GAAK,KAAK,EAAE,GAAU,GAAK,GAAK,KAAK,EAAE,GAAU,GAAK,EAAI,GAI3F,UAAU,EAAgB,EAA4B,CACpD,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,KAAK,GAGd,aAAa,EAAgB,EAA4B,CACvD,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,KAAK,GAAW,KAAK,EAAS,IAAM,EAG7C,aAAa,EAAgB,EAA4B,CACvD,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACnC,KAAK,IAAW,EAAK,KAAK,EAAS,GAG7C,aAAa,EAAgB,EAA4B,CACvD,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAGxC,MAAK,GAAW,KAAK,EAAS,IAAM,EAAM,KAAK,EAAS,IAAM,IAC/D,KAAK,EAAS,GAAK,SAIvB,aAAa,EAAgB,EAA4B,CACvD,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAGzC,KAAK,GAAU,SACb,MAAK,EAAS,IAAM,GAAO,KAAK,EAAS,IAAM,EAAK,KAAK,EAAS,IAIxE,WAAW,EAAQ,EAAY,EAAU,CACvC,EAAS,IAAW,EACpB,EAAa,IAAe,EACvB,GAAU,GAAY,EAAQ,EAAY,KAAK,QAEpD,GAAI,GAAM,KAAK,GACX,EAAM,EACN,EAAI,EACR,KAAO,EAAE,EAAI,GAAe,IAAO,MACjC,GAAO,KAAK,EAAS,GAAK,EAG5B,MAAO,GAGT,WAAW,EAAQ,EAAY,EAAU,CACvC,EAAS,IAAW,EACpB,EAAa,IAAe,EACvB,GACH,GAAY,EAAQ,EAAY,KAAK,QAGvC,GAAI,GAAM,KAAK,EAAS,EAAE,GACtB,EAAM,EACV,KAAO,EAAa,GAAM,IAAO,MAC/B,GAAO,KAAK,EAAS,EAAE,GAAc,EAGvC,MAAO,GAGT,gBAAgB,EAAwB,CACtC,EAAS,IAAW,EACpB,GAAe,EAAQ,UACvB,GAAM,GAAQ,KAAK,GACb,EAAO,KAAK,EAAS,GAC3B,AAAI,KAAU,QAAa,IAAS,SAClC,GAAY,EAAQ,KAAK,OAAS,GAGpC,GAAM,GACJ,EAAQ,KAAK,EAAE,GAAU,GAAK,EAAI,KAAK,EAAE,GAAU,GAAK,GAAK,KAAK,EAAE,GAAU,GAAK,GAE/E,EAAK,KAAK,EAAE,GAAU,KAAK,EAAE,GAAU,GAAK,EAAI,KAAK,EAAE,GAAU,GAAK,GAAK,EAAO,GAAK,GAE7F,MAAO,QAAO,GAAO,QAAO,IAAO,OAAO,KAG5C,gBAAgB,EAAwB,CACtC,EAAS,IAAW,EACpB,GAAe,EAAQ,UACvB,GAAM,GAAQ,KAAK,GACb,EAAO,KAAK,EAAS,GAC3B,AAAI,KAAU,QAAa,IAAS,SAClC,GAAY,EAAQ,KAAK,OAAS,GAGpC,GAAM,GACJ,EAAQ,GAAK,GAAK,KAAK,EAAE,GAAU,GAAK,GAAK,KAAK,EAAE,GAAU,GAAK,EAAI,KAAK,EAAE,GAE1E,EAAK,KAAK,EAAE,GAAU,GAAK,GAAK,KAAK,EAAE,GAAU,GAAK,GAAK,KAAK,EAAE,GAAU,GAAK,EAAI,EAE3F,MAAQ,QAAO,IAAO,OAAO,KAAO,OAAO,GAG7C,YAAY,EAAgB,EAA4B,CACtD,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,WAAQ,KAAK,KAAM,EAAQ,GAAM,GAAI,GAG9C,YAAY,EAAgB,EAA4B,CACtD,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,WAAQ,KAAK,KAAM,EAAQ,GAAO,GAAI,GAG/C,aAAa,EAAgB,EAA4B,CACvD,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,WAAQ,KAAK,KAAM,EAAQ,GAAM,GAAI,GAG9C,aAAa,EAAgB,EAA4B,CACvD,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,WAAQ,KAAK,KAAM,EAAQ,GAAO,GAAI,GAG/C,WAAW,EAAe,EAAgB,EAA4B,CACpE,SAAQ,OAAO,GACf,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,IAAM,GACtD,KAAK,GAAU,EAAQ,IAChB,EAAS,EAGlB,cAAc,EAAe,EAAgB,EAA4B,CACvE,SAAQ,OAAO,GACf,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,MAAQ,GACxD,KAAK,GAAU,EAAQ,IACvB,KAAK,EAAS,GAAK,IAAU,EACtB,EAAS,EAGlB,cAAc,EAAe,EAAgB,EAA4B,CACvE,SAAQ,OAAO,GACf,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,MAAQ,GACxD,KAAK,GAAU,IAAU,EACzB,KAAK,EAAS,GAAK,EAAQ,IACpB,EAAS,EAGlB,cAAc,EAAe,EAAgB,EAA4B,CACvE,SAAQ,OAAO,GACf,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,WAAY,GAC5D,KAAK,EAAS,GAAK,IAAU,GAC7B,KAAK,EAAS,GAAK,IAAU,GAC7B,KAAK,EAAS,GAAK,IAAU,EAC7B,KAAK,GAAU,EAAQ,IAChB,EAAS,EAGlB,cAAc,EAAe,EAAgB,EAA4B,CACvE,SAAQ,OAAO,GACf,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,WAAY,GAC5D,KAAK,GAAU,IAAU,GACzB,KAAK,EAAS,GAAK,IAAU,GAC7B,KAAK,EAAS,GAAK,IAAU,EAC7B,KAAK,EAAS,GAAK,EAAQ,IACpB,EAAS,EAGlB,YAAY,EAAO,EAAQ,EAAY,EAAU,CAI/C,GAHA,EAAQ,OAAO,GACf,EAAS,IAAW,EACpB,EAAa,IAAe,EACxB,CAAC,EAAU,CACb,GAAM,GAAW,KAAK,IAAI,EAAG,EAAI,GAAc,EAC/C,GAAS,KAAM,EAAO,EAAQ,EAAY,EAAU,GAGtD,GAAI,GAAM,EACN,EAAI,EAER,IADA,KAAK,GAAU,EAAQ,IAChB,EAAE,EAAI,GAAe,IAAO,MACjC,KAAK,EAAS,GAAM,EAAQ,EAAO,IAGrC,MAAO,GAAS,EAGlB,YAAY,EAAO,EAAQ,EAAY,EAAU,CAI/C,GAHA,EAAQ,OAAO,GACf,EAAS,IAAW,EACpB,EAAa,IAAe,EACxB,CAAC,EAAU,CACb,GAAM,GAAW,KAAK,IAAI,EAAG,EAAI,GAAc,EAC/C,GAAS,KAAM,EAAO,EAAQ,EAAY,EAAU,GAGtD,GAAI,GAAI,EAAa,EACjB,EAAM,EAEV,IADA,KAAK,EAAS,GAAK,EAAQ,IACpB,EAAE,GAAK,GAAM,IAAO,MACzB,KAAK,EAAS,GAAM,EAAQ,EAAO,IAGrC,MAAO,GAAS,EAGlB,iBAAiB,EAAe,EAAiB,EAAW,CAC1D,MAAO,IAAe,KAAM,EAAO,EAAQ,OAAO,GAAI,OAAO,uBAG/D,iBAAiB,EAAe,EAAiB,EAAW,CAC1D,MAAO,IAAe,KAAM,EAAO,EAAQ,OAAO,GAAI,OAAO,uBAG/D,WAAW,EAAO,EAAQ,EAAY,EAAU,CAG9C,GAFA,EAAQ,OAAO,GACf,EAAS,IAAW,EAChB,CAAC,EAAU,CACb,GAAM,GAAQ,KAAK,IAAI,EAAG,EAAI,EAAa,GAE3C,GAAS,KAAM,EAAO,EAAQ,EAAY,EAAQ,EAAG,CAAC,GAGxD,GAAI,GAAI,EACJ,EAAM,EACN,EAAM,EAEV,IADA,KAAK,GAAU,EAAQ,IAChB,EAAE,EAAI,GAAe,IAAO,MACjC,AAAI,EAAQ,GAAK,IAAQ,GAAK,KAAK,EAAS,EAAI,KAAO,GACrD,GAAM,GAER,KAAK,EAAS,GAAQ,GAAQ,GAAQ,GAAK,EAAO,IAGpD,MAAO,GAAS,EAGlB,WAAW,EAAO,EAAQ,EAAY,EAAU,CAG9C,GAFA,EAAQ,OAAO,GACf,EAAS,IAAW,EAChB,CAAC,EAAU,CACb,GAAM,GAAQ,KAAK,IAAI,EAAG,EAAI,EAAa,GAE3C,GAAS,KAAM,EAAO,EAAQ,EAAY,EAAQ,EAAG,CAAC,GAGxD,GAAI,GAAI,EAAa,EACjB,EAAM,EACN,EAAM,EAEV,IADA,KAAK,EAAS,GAAK,EAAQ,IACpB,EAAE,GAAK,GAAM,IAAO,MACzB,AAAI,EAAQ,GAAK,IAAQ,GAAK,KAAK,EAAS,EAAI,KAAO,GACrD,GAAM,GAER,KAAK,EAAS,GAAQ,GAAQ,GAAQ,GAAK,EAAO,IAGpD,MAAO,GAAS,EAGlB,UAAU,EAAe,EAAgB,EAA4B,CACnE,SAAQ,OAAO,GACf,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,IAAM,MAClD,EAAQ,GAAG,GAAQ,IAAO,EAAQ,GACtC,KAAK,GAAU,EAAQ,IAChB,EAAS,EAGlB,aAAa,EAAe,EAAgB,EAA4B,CACtE,SAAQ,OAAO,GACf,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,MAAQ,QACxD,KAAK,GAAU,EAAQ,IACvB,KAAK,EAAS,GAAK,IAAU,EACtB,EAAS,EAGlB,aAAa,EAAe,EAAgB,EAA4B,CACtE,SAAQ,OAAO,GACf,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,MAAQ,QACxD,KAAK,GAAU,IAAU,EACzB,KAAK,EAAS,GAAK,EAAQ,IACpB,EAAS,EAGlB,aAAa,EAAe,EAAgB,EAA4B,CACtE,SAAQ,OAAO,GACf,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,WAAY,aAC5D,KAAK,GAAU,EAAQ,IACvB,KAAK,EAAS,GAAK,IAAU,EAC7B,KAAK,EAAS,GAAK,IAAU,GAC7B,KAAK,EAAS,GAAK,IAAU,GACtB,EAAS,EAGlB,aAAa,EAAe,EAAgB,EAA4B,CACtE,SAAQ,OAAO,GACf,EAAS,IAAW,EACf,GAAU,GAAS,KAAM,EAAO,EAAQ,EAAG,WAAY,aACxD,EAAQ,GAAG,GAAQ,WAAa,EAAQ,GAC5C,KAAK,GAAU,IAAU,GACzB,KAAK,EAAS,GAAK,IAAU,GAC7B,KAAK,EAAS,GAAK,IAAU,EAC7B,KAAK,EAAS,GAAK,EAAQ,IACpB,EAAS,EAGlB,gBAAgB,EAAe,EAAiB,EAAW,CACzD,MAAO,IACL,KACA,EACA,EACA,CAAC,OAAO,sBACR,OAAO,uBAIX,gBAAgB,EAAe,EAAiB,EAAW,CACzD,MAAO,IACL,KACA,EACA,EACA,CAAC,OAAO,sBACR,OAAO,uBAIX,aAAa,EAAe,EAAgB,EAA4B,CACtE,MAAO,IAAW,KAAM,EAAO,EAAQ,GAAM,GAG/C,aAAa,EAAe,EAAgB,EAA4B,CACtE,MAAO,IAAW,KAAM,EAAO,EAAQ,GAAO,GAGhD,cAAc,EAAe,EAAgB,EAA4B,CACvE,MAAO,IAAY,KAAM,EAAO,EAAQ,GAAM,GAGhD,cAAc,EAAe,EAAgB,EAA4B,CACvE,MAAO,IAAY,KAAM,EAAO,EAAQ,GAAO,GAMjD,MAAM,EAAgB,EAAQ,EAAQ,EAAkB,CAEtD,GAAI,IAAW,OACb,EAAW,OACX,EAAS,KAAK,OACd,EAAS,UAEA,IAAW,QAAa,MAAO,IAAW,SACnD,EAAW,EACX,EAAS,KAAK,OACd,EAAS,UAEA,SAAS,GAClB,EAAS,IAAW,EACpB,AAAI,SAAS,GACX,GAAS,IAAW,EAChB,IAAa,QAAW,GAAW,SAEvC,GAAW,EACX,EAAS,YAGX,MAAM,IAAI,OAAM,2EAGlB,GAAM,GAAY,KAAK,OAAS,EAGhC,GAFI,KAAW,QAAa,EAAS,IAAW,GAAS,GAEpD,EAAO,OAAS,GAAM,GAAS,GAAK,EAAS,IAAO,EAAS,KAAK,OACrE,KAAM,IAAI,YAAW,0CAGvB,AAAK,GAAU,GAAW,QAE1B,GAAI,GAAc,GAClB,OACE,OAAQ,OACD,MACH,MAAO,IAAS,KAAM,EAAQ,EAAQ,OAEnC,WACA,QACH,MAAO,IAAU,KAAM,EAAQ,EAAQ,OAEpC,YACA,aACA,SACH,MAAO,IAAW,KAAM,EAAQ,EAAQ,OAErC,SAEH,MAAO,IAAY,KAAM,EAAQ,EAAQ,OAEtC,WACA,YACA,cACA,WACH,MAAO,IAAU,KAAM,EAAQ,EAAQ,WAGvC,GAAI,EAAa,KAAM,IAAI,WAAU,qBAAqB,KAC1D,EAAW,GAAG,IAAW,cACzB,EAAc,IAMtB,KAAK,EAAgB,EAAsB,EAAgB,EAAsB,CAC/E,GAAI,CAAC,GAAO,SAAS,GAAS,KAAM,IAAI,WAAU,+BASlD,GARK,GAAO,GAAQ,GAChB,CAAC,GAAO,IAAQ,GAAG,GAAM,KAAK,QAC9B,GAAe,EAAO,QAAQ,GAAc,EAAO,QAClD,GAAa,GAAc,GAC5B,EAAM,GAAK,EAAM,GAAO,GAAM,GAG9B,IAAQ,GACR,EAAO,SAAW,GAAK,KAAK,SAAW,EAAG,MAAO,GAGrD,GAAI,EAAc,EAChB,KAAM,IAAI,YAAW,6BAEvB,GAAI,EAAQ,GAAK,GAAS,KAAK,OAAQ,KAAM,IAAI,YAAW,sBAC5D,GAAI,EAAM,EAAG,KAAM,IAAI,YAAW,2BAGlC,AAAI,EAAM,KAAK,QAAQ,GAAM,KAAK,QAC9B,EAAO,OAAS,EAAc,EAAM,GACtC,GAAM,EAAO,OAAS,EAAc,GAGtC,GAAM,GAAM,EAAM,EAElB,MAAI,QAAS,GAAU,MAAO,YAAW,UAAU,YAAe,WAEhE,KAAK,WAAW,EAAa,EAAO,GAEpC,WAAW,UAAU,IAAI,KAAK,EAAQ,KAAK,SAAS,EAAO,GAAM,GAG5D,EAOT,KAAK,EAAU,EAAgB,EAAc,EAAiB,CAE5D,GAAI,MAAO,IAAQ,SAAU,CAS3B,GARA,AAAI,MAAO,IAAU,SACnB,GAAW,EACX,EAAQ,EACR,EAAM,KAAK,QACF,MAAO,IAAQ,UACxB,GAAW,EACX,EAAM,KAAK,QAET,IAAa,QAAa,MAAO,IAAa,SAChD,KAAM,IAAI,WAAU,6BAEtB,GAAI,MAAO,IAAa,UAAY,CAAC,GAAO,WAAW,GACrD,KAAM,IAAI,WAAU,qBAAqB,KAE3C,GAAI,EAAI,SAAW,EAAG,CACpB,GAAM,GAAO,EAAI,WAAW,GAC5B,AAAK,KAAa,QAAU,EAAO,KAAQ,IAAa,WAEtD,GAAM,QAGL,AAAI,OAAO,IAAQ,SACxB,EAAM,EAAM,IACH,MAAO,IAAQ,WACxB,GAAM,OAAO,IAIf,GAAI,EAAQ,GAAK,KAAK,OAAS,GAAS,KAAK,OAAS,EACpD,KAAM,IAAI,YAAW,sBAGvB,GAAI,GAAO,EACT,MAAO,MAGT,EAAQ,IAAU,EAClB,EAAM,IAAQ,OAAY,KAAK,OAAS,IAAQ,EAE3C,GAAK,GAAM,GAEhB,GAAI,GACJ,GAAI,MAAO,IAAQ,SACjB,IAAK,EAAI,EAAO,EAAI,EAAK,EAAE,EACzB,KAAK,GAAK,MAEP,CACL,GAAM,GAAQ,GAAO,SAAS,GAAO,EAAM,GAAO,KAAK,EAAK,GACtD,EAAM,EAAM,OAClB,GAAI,IAAQ,EACV,KAAM,IAAI,WAAU,cAAc,sCAEpC,IAAK,EAAI,EAAG,EAAI,EAAM,EAAO,EAAE,EAC7B,KAAK,EAAI,GAAS,EAAM,EAAI,GAIhC,MAAO,MAGT,QAAS,CACP,GAAM,GAAM,KAAK,OACjB,GAAI,EAAM,GAAM,EACd,KAAM,IAAI,YAAW,6CAEvB,OAAS,GAAI,EAAG,EAAI,EAAK,GAAK,EAC5B,GAAK,KAAM,EAAG,EAAI,GAEpB,MAAO,MAGT,QAAS,CACP,GAAM,GAAM,KAAK,OACjB,GAAI,EAAM,GAAM,EACd,KAAM,IAAI,YAAW,6CAEvB,OAAS,GAAI,EAAG,EAAI,EAAK,GAAK,EAC5B,GAAK,KAAM,EAAG,EAAI,GAClB,GAAK,KAAM,EAAI,EAAG,EAAI,GAExB,MAAO,MAGT,QAAS,CACP,GAAM,GAAM,KAAK,OACjB,GAAI,EAAM,GAAM,EACd,KAAM,IAAI,YAAW,6CAEvB,OAAS,GAAI,EAAG,EAAI,EAAK,GAAK,EAC5B,GAAK,KAAM,EAAG,EAAI,GAClB,GAAK,KAAM,EAAI,EAAG,EAAI,GACtB,GAAK,KAAM,EAAI,EAAG,EAAI,GACtB,GAAK,KAAM,EAAI,EAAG,EAAI,GAExB,MAAO,MAGT,SAAS,EAAmB,EAAgB,EAAsB,CAChE,GAAM,GAAS,KAAK,OACpB,MAAI,KAAW,EAAU,GACrB,UAAU,SAAW,EAAU,GAAU,KAAM,EAAG,GAC/C,KAAK,cAAc,GAAG,WAS/B,SAAU,CACR,GAAI,GAAM,GACJ,EAAM,GACZ,SAAM,KAAK,SAAS,MAAO,EAAG,GAC3B,QAAQ,UAAW,OACnB,OACC,KAAK,OAAS,GAAK,IAAO,SACvB,WAAW,KAOpB,OAAO,EAAoB,CACzB,GAAI,CAAC,GAAO,SAAS,GAAI,KAAM,IAAI,WAAU,6BAC7C,MAAI,QAAS,EAAU,GAChB,GAAO,QAAQ,KAAM,KAAO,EAGrC,QACE,EACA,EACA,EACA,EACA,EACQ,CAIR,GAHI,CAAC,GAAO,SAAS,IAAW,GAAW,EAAQ,aACjD,GAAS,GAAO,KAAK,EAAQ,EAAO,OAAQ,EAAO,aAEjD,CAAC,GAAO,SAAS,GACnB,KAAM,IAAI,WACR,iFAEG,MAAO,MAiBd,GAbI,IAAU,QACZ,GAAQ,GAEN,IAAQ,QACV,GAAM,EAAS,EAAO,OAAS,GAE7B,IAAc,QAChB,GAAY,GAEV,IAAY,QACd,GAAU,KAAK,QAGb,EAAQ,GAAK,EAAM,EAAO,QAAU,EAAY,GAAK,EAAU,KAAK,OACtE,KAAM,IAAI,YAAW,sBAGvB,GAAI,GAAa,GAAW,GAAS,EACnC,MAAO,GAET,GAAI,GAAa,EACf,MAAO,GAET,GAAI,GAAS,EACX,MAAO,GAQT,GALA,KAAW,EACX,KAAS,EACT,KAAe,EACf,KAAa,EAET,OAAS,EAAQ,MAAO,GAE5B,GAAI,GAAI,EAAU,EACd,EAAI,EAAM,EACR,EAAM,KAAK,IAAI,EAAG,GAElB,EAAW,KAAK,MAAM,EAAW,GACjC,EAAa,EAAO,MAAM,EAAO,GAEvC,OAAS,GAAI,EAAG,EAAI,EAAK,EAAE,EACzB,GAAI,EAAS,KAAO,EAAW,GAAI,CACjC,EAAI,EAAS,GACb,EAAI,EAAW,GACf,MAIJ,MAAI,GAAI,EAAU,GACd,EAAI,EAAU,EACX,EAGT,QAAwC,CACtC,MAAO,CACL,KAAM,SACN,KAAM,MAAM,UAAU,MAAM,KAAK,KAAK,MAAQ,KAAM,IAIxD,MAAM,EAAgB,EAAoB,CACxC,GAAM,GAAM,KAAK,OACjB,EAAQ,CAAC,CAAC,EACV,EAAM,IAAQ,OAAY,EAAM,CAAC,CAAC,EAElC,AAAI,EAAQ,EACV,IAAS,EACL,EAAQ,GAAG,GAAQ,IACd,EAAQ,GACjB,GAAQ,GAGV,AAAI,EAAM,EACR,IAAO,EACH,EAAM,GAAG,GAAM,IACV,EAAM,GACf,GAAM,GAGJ,EAAM,GAAO,GAAM,GAEvB,GAAM,GAAS,KAAK,SAAS,EAAO,GAGpC,cAAO,eAAe,EAAQ,GAAO,WAE9B,EAkCC,cAAc,EAAU,EAAO,EAAK,CAC5C,GAAI,GAAc,GA8BlB,GArBI,KAAU,QAAa,EAAQ,IACjC,GAAQ,GAIN,EAAQ,KAAK,QAIb,MAAQ,QAAa,EAAM,KAAK,SAClC,GAAM,KAAK,QAGT,GAAO,IAKX,MAAS,EACT,KAAW,EAEP,GAAO,GACT,MAAO,GAKT,IAFK,GAAU,GAAW,UAGxB,OAAQ,OACD,MACH,MAAO,IAAS,KAAM,EAAO,OAE1B,WACA,QACH,MAAO,IAAU,KAAM,EAAO,OAE3B,QACH,MAAO,IAAW,KAAM,EAAO,OAE5B,aACA,SACH,MAAO,IAAY,KAAM,EAAO,OAE7B,SACH,MAAO,IAAY,KAAM,EAAO,OAE7B,WACA,YACA,cACA,WACH,MAAO,IAAa,KAAM,EAAO,WAGjC,GAAI,EAAa,KAAM,IAAI,WAAU,qBAAqB,KAC1D,EAAW,GAAG,IAAW,cACzB,EAAc,MAtuCjB,MACE,AADF,GACE,SAAW,KA2uCpB,YAAkB,EAAa,EAAO,EAAQ,EAAK,EAAK,EAAK,CAC3D,GAAI,CAAC,GAAO,SAAS,GAAM,KAAM,IAAI,WAAU,+CAC/C,GAAI,EAAQ,GAAO,EAAQ,EAAK,KAAM,IAAI,YAAW,qCACrD,GAAI,EAAS,EAAM,EAAI,OAAQ,KAAM,IAAI,YAAW,sBAGtD,YAAwB,EAAa,EAAO,EAAQ,EAAK,EAAK,CAC5D,GAAW,EAAO,EAAK,EAAK,EAAK,EAAQ,GAEzC,GAAI,GAAK,OAAO,EAAQ,OAAO,aAC/B,EAAI,KAAY,EAChB,EAAK,GAAM,EACX,EAAI,KAAY,EAChB,EAAK,GAAM,EACX,EAAI,KAAY,EAChB,EAAK,GAAM,EACX,EAAI,KAAY,EAChB,GAAI,GAAK,OAAQ,GAAS,OAAO,IAAO,OAAO,aAC/C,SAAI,KAAY,EAChB,EAAK,GAAM,EACX,EAAI,KAAY,EAChB,EAAK,GAAM,EACX,EAAI,KAAY,EAChB,EAAK,GAAM,EACX,EAAI,KAAY,EACT,EAGT,YAAwB,EAAa,EAAO,EAAQ,EAAK,EAAK,CAC5D,GAAW,EAAO,EAAK,EAAK,EAAK,EAAQ,GAEzC,GAAI,GAAK,OAAO,EAAQ,OAAO,aAC/B,EAAI,EAAS,GAAK,EAClB,EAAK,GAAM,EACX,EAAI,EAAS,GAAK,EAClB,EAAK,GAAM,EACX,EAAI,EAAS,GAAK,EAClB,EAAK,GAAM,EACX,EAAI,EAAS,GAAK,EAClB,GAAI,GAAK,OAAQ,GAAS,OAAO,IAAO,OAAO,aAC/C,SAAI,EAAS,GAAK,EAClB,EAAK,GAAM,EACX,EAAI,EAAS,GAAK,EAClB,EAAK,GAAM,EACX,EAAI,EAAS,GAAK,EAClB,EAAK,GAAM,EACX,EAAI,GAAU,EACP,EAAS,EAQlB,YAAoB,EAAoB,CACtC,GAAI,MAAO,IAAS,SAClB,KAAM,IAAI,WAAU,0CACf,GAAI,EAAO,EAChB,KAAM,IAAI,YAAW,cAAc,mCAIvC,YAAe,EAAM,EAAM,EAAkB,CAE3C,MADA,IAAW,GACP,GAAQ,EACH,GAAI,IAAO,GAEhB,IAAS,OAIJ,MAAO,IAAa,SACvB,GAAI,IAAO,GAAM,KAAK,EAAM,GAC5B,GAAI,IAAO,GAAM,KAAK,GAErB,GAAI,IAAO,GAGpB,YAAoB,EAAgB,EAAkC,CAKpE,GAJI,OAAO,IAAa,UAAY,IAAa,KAC/C,GAAW,QAGT,CAAC,GAAO,WAAW,GACrB,KAAM,IAAI,WAAU,qBAAqB,KAG3C,GAAM,GAAS,GAAW,EAAQ,GAAY,EAC1C,EAAM,GAAI,IAAO,GAEf,EAAS,EAAI,MAAM,EAAQ,GAEjC,MAAI,KAAW,GAIb,GAAM,EAAI,MAAM,EAAG,IAGd,EAGT,YAAuB,EAA+B,CACpD,GAAM,GAAS,EAAM,OAAS,EAAI,EAAI,GAAQ,EAAM,QAAU,EACxD,EAAM,GAAI,IAAO,GACvB,OAAS,GAAI,EAAG,EAAI,EAAQ,GAAK,EAC/B,EAAI,GAAK,EAAM,GAAK,IAEtB,MAAO,GAGT,YAAuB,EAAmB,CACxC,GAAI,GAAW,EAAW,YAAa,CACrC,GAAM,GAAO,GAAI,YAAW,GAC5B,MAAO,IAAgB,EAAK,OAAQ,EAAK,WAAY,EAAK,YAE5D,MAAO,IAAc,GAGvB,YAAyB,EAAoB,EAAoB,EAAwB,CACvF,GAAI,EAAa,GAAK,EAAM,WAAa,EACvC,KAAM,IAAI,YAAW,wCAGvB,GAAI,EAAM,WAAa,EAAc,IAAU,GAC7C,KAAM,IAAI,YAAW,wCAGvB,GAAI,GACJ,MAAI,KAAe,QAAa,IAAW,OACzC,EAAM,GAAI,YAAW,GAChB,AAAI,IAAW,OACpB,EAAM,GAAI,YAAW,EAAO,GAE5B,EAAM,GAAI,YAAW,EAAO,EAAY,GAI1C,OAAO,eAAe,EAAK,GAAO,WAE3B,EAGT,YAAoB,EAAK,CACvB,GAAI,GAAO,SAAS,GAAM,CACxB,GAAM,GAAM,GAAQ,EAAI,QAAU,EAC5B,EAAM,GAAI,IAAO,GAEvB,MAAI,GAAI,SAAW,GAInB,EAAI,KAAK,EAAK,EAAG,EAAG,GACb,EAGT,GAAI,EAAI,SAAW,OACjB,MAAI,OAAO,GAAI,QAAW,UAAY,GAAY,EAAI,QAC7C,GAAI,IAAO,GAEb,GAAc,GAGvB,GAAI,EAAI,OAAS,UAAY,MAAM,QAAQ,EAAI,MAC7C,MAAO,IAAc,EAAI,MAI7B,YAAiB,EAAQ,CAGvB,GAAI,GAAU,GACZ,KAAM,IAAI,YACR,0DAAoE,GAAW,SAC7E,aAIN,MAAO,GAAS,EAGlB,YAAoB,EAAQ,EAAU,CACpC,GAAI,GAAO,SAAS,GAClB,MAAO,GAAO,OAEhB,GAAI,YAAY,OAAO,IAAW,GAAW,EAAQ,aACnD,MAAO,GAAO,WAEhB,GAAI,MAAO,IAAW,SACpB,KAAM,IAAI,WACR,2FAGG,MAAO,MAId,GAAM,GAAM,EAAO,OACb,EAAY,UAAU,OAAS,GAAK,UAAU,KAAO,GAC3D,GAAI,CAAC,GAAa,IAAQ,EAAG,MAAO,GAGpC,GAAI,GAAc,GAClB,OACE,OAAQ,OACD,YACA,aACA,SACH,MAAO,OACJ,WACA,QACH,MAAO,IAAY,GAAQ,WACxB,WACA,YACA,cACA,WACH,MAAO,GAAM,MACV,MACH,MAAO,KAAQ,MACZ,SACH,MAAO,IAAc,GAAQ,eAE7B,GAAI,EACF,MAAO,GAAY,GAAK,GAAY,GAAQ,OAE9C,EAAW,GAAG,IAAW,cACzB,EAAc,IAOtB,YAAc,EAAG,EAAG,EAAG,CACrB,GAAM,GAAI,EAAE,GACZ,EAAE,GAAK,EAAE,GACT,EAAE,GAAK,EAYT,YAA8B,EAAQ,EAAK,EAAY,EAAU,EAAK,CAEpE,GAAI,EAAO,SAAW,EAAG,MAAO,GAmBhC,GAhBA,AAAI,MAAO,IAAe,SACxB,GAAW,EACX,EAAa,GACR,AAAI,EAAa,WACtB,EAAa,WACJ,EAAa,aACtB,GAAa,aAEf,EAAa,OAAO,GAChB,GAAY,IAEd,GAAa,EAAM,EAAI,EAAO,OAAS,GAIrC,EAAa,GAAG,GAAa,EAAO,OAAS,GAC7C,GAAc,EAAO,OAAQ,CAC/B,GAAI,EAAK,MAAO,GAChB,EAAa,EAAO,OAAS,UACpB,EAAa,EACtB,GAAI,EAAK,EAAa,MACjB,OAAO,GASd,GALI,MAAO,IAAQ,UACjB,GAAM,GAAO,KAAK,EAAK,IAIrB,GAAO,SAAS,GAElB,MAAI,GAAI,SAAW,EACV,GAEF,GAAa,EAAQ,EAAK,EAAY,EAAU,GAClD,GAAI,MAAO,IAAQ,SAExB,MADA,GAAM,EAAM,IACR,MAAO,YAAW,UAAU,SAAY,WACtC,EACK,WAAW,UAAU,QAAQ,KAAK,EAAQ,EAAK,GAEjD,WAAW,UAAU,YAAY,KAAK,EAAQ,EAAK,GAErD,GAAa,EAAQ,CAAC,GAAM,EAAY,EAAU,GAG3D,KAAM,IAAI,WAAU,wCAGtB,YAAsB,EAAK,EAAK,EAAY,EAAU,EAAK,CACzD,GAAI,GAAY,EACZ,EAAY,EAAI,OAChB,EAAY,EAAI,OAEpB,GAAI,IAAa,QACf,GAAW,OAAO,GAAU,cAE1B,IAAa,QACb,IAAa,SACb,IAAa,WACb,IAAa,YACb,CACA,GAAI,EAAI,OAAS,GAAK,EAAI,OAAS,EACjC,MAAO,GAET,EAAY,EACZ,GAAa,EACb,GAAa,EACb,GAAc,EAIlB,WAAc,EAAK,EAAG,CACpB,MAAI,KAAc,EACT,EAAI,GAEN,EAAI,aAAa,EAAI,GAG9B,GAAI,GACJ,GAAI,EAAK,CACP,GAAI,GAAa,GACjB,IAAK,EAAI,EAAY,EAAI,EAAW,IAClC,GAAI,EAAK,EAAK,KAAO,EAAK,EAAK,IAAe,GAAK,EAAI,EAAI,IAEzD,GADI,IAAe,IAAI,GAAa,GAChC,EAAI,EAAa,IAAM,EAAW,MAAO,GAAa,MAE1D,AAAI,KAAe,IAAI,IAAK,EAAI,GAChC,EAAa,OAKjB,KADI,EAAa,EAAY,GAAW,GAAa,EAAY,GAC5D,EAAI,EAAY,GAAK,EAAG,IAAK,CAChC,GAAI,GAAQ,GACZ,OAAS,GAAI,EAAG,EAAI,EAAW,IAC7B,GAAI,EAAK,EAAK,EAAI,KAAO,EAAK,EAAK,GAAI,CACrC,EAAQ,GACR,MAGJ,GAAI,EAAO,MAAO,GAItB,MAAO,GAGT,YAAkB,EAAa,EAAQ,EAAQ,EAAgB,CAC7D,EAAS,OAAO,IAAW,EAC3B,GAAM,GAAY,EAAI,OAAS,EAC/B,AAAK,EAGH,GAAS,OAAO,GACZ,EAAS,GACX,GAAS,IAJX,EAAS,EAQX,GAAM,GAAS,EAAO,OAEtB,AAAI,EAAS,EAAS,GACpB,GAAS,EAAS,GAEpB,GAAI,GACJ,IAAK,EAAI,EAAG,EAAI,EAAQ,EAAE,EAAG,CAC3B,GAAM,GAAS,SAAS,EAAO,OAAO,EAAI,EAAG,GAAI,IACjD,GAAI,GAAY,GAAS,MAAO,GAChC,EAAI,EAAS,GAAK,EAEpB,MAAO,GAGT,YAAmB,EAAa,EAAQ,EAAQ,EAAQ,CACtD,MAAO,IAAW,GAAY,EAAQ,EAAI,OAAS,GAAS,EAAK,EAAQ,GAG3E,YAAoB,EAAa,EAAQ,EAAQ,EAAQ,CACvD,MAAO,IAAW,GAAa,GAAS,EAAK,EAAQ,GAGvD,YAAqB,EAAa,EAAQ,EAAQ,EAAQ,CACxD,MAAO,IAAW,GAAc,GAAS,EAAK,EAAQ,GAGxD,YAAmB,EAAa,EAAQ,EAAQ,EAAQ,CACtD,MAAO,IAAW,GAAe,EAAQ,EAAI,OAAS,GAAS,EAAK,EAAQ,GAG9E,YAAqB,EAAa,EAAO,EAAK,CAC5C,MAAI,KAAU,GAAK,IAAQ,EAAI,OACtB,WAAO,cAAc,GAEvB,WAAO,cAAc,EAAI,MAAM,EAAO,IAG/C,YAAmB,EAAa,EAAO,EAAK,CAC1C,EAAM,KAAK,IAAI,EAAI,OAAQ,GAC3B,GAAM,GAAgB,GAElB,EAAI,EACR,KAAO,EAAI,GAAK,CACd,GAAM,GAAY,EAAI,GAClB,EAA2B,KAC3B,EAAmB,EAAY,IAAO,EAAI,EAAY,IAAO,EAAI,EAAY,IAAO,EAAI,EAE5F,GAAI,EAAI,GAAoB,EAAK,CAC/B,GAAI,GACA,EACA,EACA,EAEJ,OAAQ,OACD,GACH,AAAI,EAAY,KACd,GAAY,GAEd,UACG,GACH,EAAa,EAAI,EAAI,GAChB,GAAa,MAAU,KAC1B,GAAkB,GAAY,KAAS,EAAQ,EAAa,GACxD,EAAgB,KAClB,GAAY,IAGhB,UACG,GACH,EAAa,EAAI,EAAI,GACrB,EAAY,EAAI,EAAI,GACf,GAAa,MAAU,KAAS,GAAY,MAAU,KACzD,GACI,GAAY,KAAQ,GAAS,GAAa,KAAS,EAAQ,EAAY,GACvE,EAAgB,MAAU,GAAgB,OAAU,EAAgB,QACtE,GAAY,IAGhB,UACG,GACH,EAAa,EAAI,EAAI,GACrB,EAAY,EAAI,EAAI,GACpB,EAAa,EAAI,EAAI,GAElB,GAAa,MAAU,KACvB,GAAY,MAAU,KACtB,GAAa,MAAU,KAExB,GACI,GAAY,KAAQ,GACpB,GAAa,KAAS,GACtB,GAAY,KAAS,EACtB,EAAa,GACZ,EAAgB,OAAU,EAAgB,SAC5C,GAAY,KAMtB,AAAI,IAAc,KAGhB,GAAY,MACZ,EAAmB,GACV,EAAY,OAErB,IAAa,MACb,EAAI,KAAO,IAAc,GAAM,KAAS,OACxC,EAAY,MAAU,EAAY,MAGpC,EAAI,KAAK,GACT,GAAK,EAGP,MAAO,IAAsB,GAM/B,GAAM,IAAuB,KAE7B,YAA+B,EAA8B,CAC3D,GAAM,GAAM,EAAW,OACvB,GAAI,GAAO,GACT,MAAO,QAAO,aAAa,MAAM,OAAQ,GAI3C,GAAI,GAAM,GACN,EAAI,EACR,KAAO,EAAI,GACT,GAAO,OAAO,aAAa,MAAM,OAAQ,EAAW,MAAM,EAAI,GAAK,KAErE,MAAO,GAGT,YAAoB,EAAa,EAAO,EAAa,CACnD,GAAI,GAAM,GACV,EAAM,KAAK,IAAI,EAAI,OAAQ,GAE3B,OAAS,GAAI,EAAO,EAAI,EAAK,EAAE,EAC7B,GAAO,OAAO,aAAa,EAAI,GAAK,KAEtC,MAAO,GAGT,YAAqB,EAAa,EAAO,EAAa,CACpD,GAAI,GAAM,GACV,EAAM,KAAK,IAAI,EAAI,OAAQ,GAE3B,OAAS,GAAI,EAAO,EAAI,EAAK,EAAE,EAC7B,GAAO,OAAO,aAAa,EAAI,IAEjC,MAAO,GAGT,YAAkB,EAAa,EAAO,EAAa,CACjD,GAAM,GAAM,EAAI,OAEhB,AAAI,EAAC,GAAS,EAAQ,IAAG,GAAQ,GAC7B,EAAC,GAAO,EAAM,GAAK,EAAM,IAAK,GAAM,GAExC,GAAI,GAAM,GACV,OAAS,GAAI,EAAO,EAAI,EAAK,EAAE,EAC7B,GAAO,GAAoB,EAAI,IAEjC,MAAO,GAGT,YAAsB,EAAa,EAAO,EAAa,CACrD,GAAM,GAAQ,EAAI,MAAM,EAAO,GAC3B,EAAM,GAEV,OAAS,GAAI,EAAG,EAAI,EAAM,OAAS,EAAG,GAAK,EACzC,GAAO,OAAO,aAAa,EAAM,GAAK,EAAM,EAAI,GAAK,KAEvD,MAAO,GAMT,YAAqB,EAAQ,EAAK,EAAc,CAC9C,GAAI,EAAS,GAAM,GAAK,EAAS,EAAG,KAAM,IAAI,YAAW,sBACzD,GAAI,EAAS,EAAM,EAAQ,KAAM,IAAI,YAAW,yCAGlD,YAAsB,EAAa,EAAO,EAAQ,EAAK,EAAK,EAAW,CACrE,GAAI,EAAS,EAAM,EAAI,OAAQ,KAAM,IAAI,YAAW,sBACpD,GAAI,EAAS,EAAG,KAAM,IAAI,YAAW,sBAGvC,YAAoB,EAAa,EAAO,EAAQ,EAAc,EAAkB,CAC9E,SAAQ,OAAO,GACf,EAAS,IAAW,EACf,GACH,GAAa,EAAK,EAAO,EAAQ,EAAG,qBAAuB,uBAE7D,WAAQ,MAAM,EAAK,EAAO,EAAQ,EAAc,GAAI,GAC7C,EAAS,EAGlB,YAAqB,EAAa,EAAO,EAAQ,EAAc,EAAkB,CAC/E,SAAQ,OAAO,GACf,EAAS,IAAW,EACf,GACH,GAAa,EAAK,EAAO,EAAQ,EAAG,sBAAwB,wBAE9D,WAAQ,MAAM,EAAK,EAAO,EAAQ,EAAc,GAAI,GAC7C,EAAS,EAOlB,GAAM,IAA8B,GACpC,YAAW,EAAK,EAAY,EAAM,CAChC,GAAO,GAAO,aAAwB,EAAK,CACzC,aAAc,CACZ,QAEA,OAAO,eAAe,KAAM,UAAW,CACrC,MAAO,EAAW,MAAM,KAAM,WAC9B,SAAU,GACV,aAAc,KAIhB,KAAK,KAAO,GAAG,KAAK,SAAS,KAG7B,KAAK,MAEL,MAAO,MAAK,QAGV,OAAO,CACT,MAAO,MAGL,MAAK,EAAO,CACd,OAAO,eAAe,KAAM,OAAQ,CAClC,aAAc,GACd,WAAY,GACZ,QACA,SAAU,KAId,UAAW,CACT,MAAO,GAAG,KAAK,SAAS,OAAS,KAAK,YAK5C,GACE,2BACA,SAAU,EAAM,CACd,MAAI,GACK,GAAG,gCAGL,kDAET,YAEF,GACE,uBACA,SAAU,EAAM,EAAQ,CACtB,MAAO,QAAQ,qDAAwD,MAAO,MAEhF,WAEF,GACE,mBACA,SAAU,EAAK,EAAO,EAAO,CAC3B,GAAI,GAAM,iBAAiB,sBACvB,EAAW,EACf,MAAI,QAAO,UAAU,IAAU,KAAK,IAAI,GAAS,GAAK,GACpD,EAAW,GAAsB,OAAO,IAC/B,MAAO,IAAU,UAC1B,GAAW,OAAO,GACd,GAAQ,OAAO,IAAM,OAAO,KAAO,EAAQ,CAAE,QAAO,IAAM,OAAO,OACnE,GAAW,GAAsB,IAEnC,GAAY,KAEd,GAAO,eAAe,eAAmB,IAClC,GAET,YAGF,YAA+B,EAAK,CAClC,GAAI,GAAM,GACN,EAAI,EAAI,OACN,EAAQ,EAAI,KAAO,IAAM,EAAI,EACnC,KAAO,GAAK,EAAQ,EAAG,GAAK,EAC1B,EAAM,IAAI,EAAI,MAAM,EAAI,EAAG,KAAK,IAElC,MAAO,GAAG,EAAI,MAAM,EAAG,KAAK,IAM9B,YAAqB,EAAK,EAAQ,EAAY,CAC5C,GAAe,EAAQ,UACnB,GAAI,KAAY,QAAa,EAAI,EAAS,KAAgB,SAC5D,GAAY,EAAQ,EAAI,OAAU,GAAa,IAInD,YAAoB,EAAO,EAAK,EAAK,EAAK,EAAQ,EAAY,CAC5D,GAAI,EAAQ,GAAO,EAAQ,EAAK,CAC9B,GAAM,GAAI,MAAO,IAAQ,SAAW,IAAM,GACtC,EACJ,KAAI,GAAa,EACf,AAAI,IAAQ,GAAK,IAAQ,OAAO,GAC9B,EAAQ,OAAO,YAAY,QAAS,GAAa,GAAK,IAAI,IAE1D,EACE,SAAS,QAAS,GAAa,GAAK,EAAI,IAAI,iBACxC,GAAa,GAAK,EAAI,IAAI,IAGlC,EAAQ,MAAM,IAAM,YAAY,IAAM,IAElC,GAAI,IAAO,iBAAiB,QAAS,EAAO,GAEpD,GAAY,EAAK,EAAQ,GAG3B,YAAwB,EAAO,EAAM,CACnC,GAAI,MAAO,IAAU,SACnB,KAAM,IAAI,IAAO,qBAAqB,EAAM,SAAU,GAI1D,YAAqB,EAAO,EAAQ,EAAO,CACzC,KAAI,MAAK,MAAM,KAAW,EACxB,IAAe,EAAO,GAChB,GAAI,IAAO,iBAAiB,GAAQ,SAAU,aAAc,IAGhE,EAAS,EACL,GAAI,IAAO,yBAGb,GAAI,IAAO,iBAAiB,GAAQ,SAAU,MAAM,EAAO,EAAI,YAAY,IAAU,GAM7F,GAAM,IAAoB,oBAE1B,YAAqB,EAAqB,CAMxC,GAJA,EAAM,EAAI,MAAM,KAAK,GAErB,EAAM,EAAI,OAAO,QAAQ,GAAmB,IAExC,EAAI,OAAS,EAAG,MAAO,GAE3B,KAAO,EAAI,OAAS,GAAM,GACxB,EAAM,GAAG,KAEX,MAAO,GAGT,YAAqB,EAAgB,EAA0B,CAC7D,EAAQ,GAAS,IACjB,GAAI,GACE,EAAS,EAAO,OAClB,EAAgB,KACd,EAAkB,GAExB,OAAS,GAAI,EAAG,EAAI,EAAQ,EAAE,EAAG,CAI/B,GAHA,EAAY,EAAO,WAAW,GAG1B,EAAY,OAAU,EAAY,MAAQ,CAE5C,GAAI,CAAC,EAAe,CAElB,GAAI,EAAY,MAAQ,CAEtB,AAAK,IAAS,GAAK,IAAI,EAAM,KAAK,IAAM,IAAM,KAC9C,iBACS,EAAI,IAAM,EAAQ,CAE3B,AAAK,IAAS,GAAK,IAAI,EAAM,KAAK,IAAM,IAAM,KAC9C,SAIF,EAAgB,EAEhB,SAIF,GAAI,EAAY,MAAQ,CACtB,AAAK,IAAS,GAAK,IAAI,EAAM,KAAK,IAAM,IAAM,KAC9C,EAAgB,EAChB,SAIF,EAAe,GAAgB,OAAW,GAAO,EAAY,OAAW,UACnE,AAAI,IAEJ,IAAS,GAAK,IAAI,EAAM,KAAK,IAAM,IAAM,KAMhD,GAHA,EAAgB,KAGZ,EAAY,IAAM,CACpB,GAAK,IAAS,GAAK,EAAG,MACtB,EAAM,KAAK,WACF,EAAY,KAAO,CAC5B,GAAK,IAAS,GAAK,EAAG,MACtB,EAAM,KAAM,GAAa,EAAO,IAAO,EAAY,GAAQ,aAClD,EAAY,MAAS,CAC9B,GAAK,IAAS,GAAK,EAAG,MACtB,EAAM,KACH,GAAa,GAAO,IACnB,GAAa,EAAO,GAAQ,IAC7B,EAAY,GAAQ,aAEd,EAAY,QAAU,CAC/B,GAAK,IAAS,GAAK,EAAG,MACtB,EAAM,KACH,GAAa,GAAQ,IACpB,GAAa,GAAO,GAAQ,IAC5B,GAAa,EAAO,GAAQ,IAC7B,EAAY,GAAQ,SAGvB,MAAM,IAAI,OAAM,sBAIpB,MAAO,GAGT,YAAsB,EAAuB,CAC3C,GAAM,GAAsB,GAC5B,OAAS,GAAI,EAAG,EAAI,EAAI,OAAQ,EAAE,EAEhC,EAAU,KAAK,EAAI,WAAW,GAAK,KAErC,MAAO,GAGT,YAAwB,EAAa,EAAyB,CAC5D,GAAI,GACA,EACA,EACE,EAAsB,GAC5B,OAAS,GAAI,EAAG,EAAI,EAAI,QACjB,MAAS,GAAK,GADW,EAAE,EAGhC,EAAI,EAAI,WAAW,GACnB,EAAK,GAAK,EACV,EAAK,EAAI,IACT,EAAU,KAAK,GACf,EAAU,KAAK,GAGjB,MAAO,GAGT,YAAuB,EAAyB,CAC9C,MAAO,YAAO,YAAY,GAAY,IAGxC,YAAoB,EAAK,EAAK,EAAQ,EAAgB,CACpD,GAAI,GACJ,IAAK,EAAI,EAAG,EAAI,GACV,IAAI,GAAU,EAAI,QAAU,GAAK,EAAI,QADnB,EAAE,EAExB,EAAI,EAAI,GAAU,EAAI,GAExB,MAAO,GAMT,YAAoB,EAAK,EAAe,CACtC,MACE,aAAe,IACd,GAAO,MACN,EAAI,aAAe,MACnB,EAAI,YAAY,MAAQ,MACxB,EAAI,YAAY,OAAS,EAAK,KAGpC,YAAqB,EAAc,CAEjC,MAAO,KAAQ,EAKjB,GAAM,IAAuB,UAAY,CACvC,GAAM,GAAW,mBACX,EAAQ,GAAI,OAAM,KACxB,OAAS,GAAI,EAAG,EAAI,GAAI,EAAE,EAAG,CAC3B,GAAM,GAAM,EAAI,GAChB,OAAS,GAAI,EAAG,EAAI,GAAI,EAAE,EACxB,EAAM,EAAM,GAAK,EAAS,GAAK,EAAS,GAG5C,MAAO,MCxpEF,aAAgD,CAErD,kBAAW,OAAS,WAAW,QAAU,GAElC,WAAW,OCIpB,GAAM,IAA+C,eAoBxC,GAIT,CACF,KAAM,iBACN,GAAI,UACJ,OAAQ,UACR,QAAS,GACT,OAAQ,GACR,SAAU,QACV,WAAY,CAAC,WACb,UAAW,CAAC,4BACZ,OAAQ,GACR,MAAO,CAAC,OAAQ,QAChB,QAAS,CACP,QAAS,CACP,MAAO,mBACP,WAAY,GACZ,WAAY,GACZ,IAAK,OACL,eAAgB,MAKT,GAIT,CACF,KAAM,iBACN,GAAI,UACJ,OAAQ,UACR,QAAS,GACT,OAAQ,GACR,SAAU,QACV,WAAY,CAAC,WACb,UAAW,CAAC,4BACZ,OAAQ,GACR,MAAO,CAAC,OAAQ,QAChB,QAAS,GAAc,SCtEzB,OAAkB,SAEX,YACL,EACA,EACA,EACQ,CACR,OAAQ,OACD,UACH,MAAO,IAAqB,OACzB,QACH,MAAO,IAAmB,OACvB,QACH,MAAO,IAAmB,OACvB,QACH,MAAO,IAAmB,OACvB,QACH,MAAO,IAAmB,OACvB,SACH,MAAO,IAAoB,OACxB,aACH,MAAO,IAAwB,OAC5B,uBACH,MAAO,IAAkC,EAAQ,WAEjD,KAAM,IAAI,OAAM,qBAAqB,MAIpC,YACL,EACA,EACA,EACA,EACO,CACP,OAAQ,OACD,UACH,MAAO,IAAqB,EAAQ,OACjC,QACH,MAAO,IAAmB,EAAQ,OAC/B,QACH,MAAO,IAAmB,EAAQ,OAC/B,QACH,MAAO,IAAmB,EAAQ,OAC/B,QACH,MAAO,IAAmB,EAAQ,OAC/B,SACH,MAAO,IAAoB,EAAQ,OAChC,aACH,MAAO,IAAwB,EAAQ,OACpC,uBACH,MAAO,IAAkC,EAAQ,EAAO,WAExD,KAAM,IAAI,OAAM,qBAAqB,MAI3C,YAA8B,EAA2B,CACvD,GAAM,GAAM,OAAO,MAAM,KAAK,KAAK,EAAO,OAAS,IACnD,EAAI,KAAK,GACT,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IACjC,AAAI,EAAO,IACT,GAAI,KAAK,MAAM,EAAI,KAAO,GAAK,EAAI,GAGvC,MAAO,GAGT,YAA8B,EAAsB,EAA0B,CAC5E,GAAM,GAAoB,GAC1B,OAAS,GAAI,EAAG,EAAI,EAAO,IAAK,CAC9B,GAAM,GAAI,EAAO,OAAO,EAAO,OAAS,KAAK,MAAM,EAAI,IACvD,EAAO,KAAM,GAAK,GAAK,EAAI,GAAM,GAEnC,SAAO,QAAU,KAAK,KAAK,EAAQ,GAC5B,EAGT,YAA4B,EAA0B,CACpD,GAAM,GAAM,OAAO,MAAM,EAAI,EAAO,QACpC,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IACjC,EAAI,aAAa,EAAO,GAAI,EAAI,GAElC,MAAO,GAGT,YAA4B,EAAsB,EAAyB,CACzE,GAAM,GAAmB,GACzB,OAAS,GAAI,EAAG,EAAI,EAAO,IACzB,EAAO,KAAK,EAAO,OAAO,YAAY,EAAO,SAC7C,EAAO,QAAU,EAEnB,MAAO,GAGT,YAA4B,EAA0B,CACpD,GAAM,GAAM,OAAO,MAAM,EAAI,EAAO,QACpC,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IACjC,WAAM,aAAa,EAAO,GAAI,EAAK,EAAI,GAEzC,MAAO,GAGT,YAA4B,EAAsB,EAAyB,CACzE,GAAM,GAAmB,GACzB,OAAS,GAAI,EAAG,EAAI,EAAO,IACzB,EAAO,KAAK,WAAM,YAAY,EAAO,OAAQ,EAAO,SACpD,EAAO,QAAU,EAEnB,MAAO,GAGT,YAA4B,EAA0B,CACpD,GAAM,GAAM,OAAO,MAAM,GAAK,EAAO,QACrC,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IACjC,AAAI,EAAO,IAAM,EACf,YAAM,aAAa,EAAO,GAAI,EAAK,EAAI,IACvC,EAAI,cAAc,EAAG,EAAI,GAAK,IAE9B,YAAM,aAAa,CAAC,CAAC,EAAO,GAAK,EAAG,EAAK,EAAI,IAC7C,EAAI,cAAc,WAAY,EAAI,GAAK,IAG3C,MAAO,GAGT,YAA4B,EAAsB,EAAyB,CACzE,GAAM,GAAmB,GACzB,OAAS,GAAI,EAAG,EAAI,EAAO,IAAK,CAC9B,GAAM,GAAM,WAAM,YAAY,EAAO,OAAQ,EAAO,QAEpD,AAAI,AADS,EAAO,OAAO,aAAa,EAAO,OAAS,KAC3C,WACX,EAAO,KAAK,CAAC,CAAC,EAAM,GAEpB,EAAO,KAAK,GAEd,EAAO,QAAU,GAEnB,MAAO,GAGT,YAA4B,EAA0B,CACpD,GAAM,GAAM,OAAO,MAAM,EAAI,EAAO,QACpC,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IACjC,EAAI,aAAa,EAAO,GAAI,EAAI,GAElC,MAAO,GAGT,YAA4B,EAAsB,EAAyB,CACzE,GAAM,GAAmB,GACzB,OAAS,GAAI,EAAG,EAAI,EAAO,IACzB,EAAO,KAAK,EAAO,OAAO,YAAY,EAAO,SAC7C,EAAO,QAAU,EAEnB,MAAO,GAGT,YAA6B,EAA0B,CACrD,GAAM,GAAM,OAAO,MAAM,EAAI,EAAO,QACpC,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IACjC,EAAI,cAAc,EAAO,GAAI,EAAI,GAEnC,MAAO,GAGT,YAA6B,EAAsB,EAAyB,CAC1E,GAAM,GAAmB,GACzB,OAAS,GAAI,EAAG,EAAI,EAAO,IACzB,EAAO,KAAK,EAAO,OAAO,aAAa,EAAO,SAC9C,EAAO,QAAU,EAEnB,MAAO,GAGT,YAAiC,EAA0B,CAEzD,GAAI,GAAU,EACd,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IACjC,EAAO,GAAK,OAAO,KAAK,EAAO,IAC/B,GAAW,EAAI,EAAO,GAAG,OAE3B,GAAM,GAAM,OAAO,MAAM,GAErB,EAAU,EACd,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IACjC,EAAI,cAAc,EAAO,GAAG,OAAQ,GACpC,EAAO,GAAG,KAAK,EAAK,EAAU,GAC9B,GAAW,EAAI,EAAO,GAAG,OAE3B,MAAO,GAGT,YAAiC,EAAsB,EAAyB,CAC9E,GAAM,GAAmB,GACzB,OAAS,GAAI,EAAG,EAAI,EAAO,IAAK,CAC9B,GAAM,GAAM,EAAO,OAAO,aAAa,EAAO,QAC9C,EAAO,QAAU,EAEjB,EAAO,KAAK,EAAO,OAAO,MAAM,EAAO,OAAQ,EAAO,OAAS,IAC/D,EAAO,QAAU,EAEnB,MAAO,GAGT,YAA2C,EAAkB,EAAmC,CAC9F,GAAI,CAAC,EAAK,WACR,KAAM,IAAI,OAAM,kEAElB,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IAEjC,GADA,EAAO,GAAK,OAAO,KAAK,EAAO,IAC3B,EAAO,GAAG,SAAW,EAAK,WAC5B,KAAM,IAAI,OAAM,2CAA2C,EAAO,MAGtE,MAAO,QAAO,OAAO,GAGvB,YACE,EACA,EACA,EACU,CACV,GAAM,GAAmB,GACzB,GAAI,CAAC,EAAK,WACR,KAAM,IAAI,OAAM,kEAElB,OAAS,GAAI,EAAG,EAAI,EAAO,IACzB,EAAO,KAAK,EAAO,OAAO,MAAM,EAAO,OAAQ,EAAO,OAAS,EAAK,aACpE,EAAO,QAAU,EAAK,WAExB,MAAO,GCvOT,OAAmB,SAGZ,YACL,EACA,EACA,EACQ,CACR,GAAI,CAAE,aAAc,IAClB,KAAM,IAAI,OAAM,wBAGlB,OAAQ,OACD,cACA,YACA,QAEH,EAAS,EAAO,IAAI,AAAC,GAAM,SAAS,EAAG,KACvC,cAGA,KAAM,IAAI,OAAM,qBAAqB,KAGzC,GAAI,GAAM,OAAO,MAAM,GACnB,EAAa,GACb,EAAU,EAEd,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IAGjC,AAAI,IAAY,GAAK,EAAI,OAAS,GAAM,GAAK,EAAO,KAAO,EAAO,EAAI,GAEhE,GAAI,QACN,GAAM,OAAO,OAAO,CAAC,EAAK,GAAmB,EAAK,KAClD,EAAM,IAER,EAAU,GACL,AAAI,EAAU,GAAK,EAAO,KAAO,EAAO,EAAI,GACjD,GAAW,EAGP,IACF,GAAM,OAAO,OAAO,CAAC,EAAK,GAAkB,EAAO,EAAI,GAAI,EAAS,KACpE,EAAU,GAEZ,EAAI,KAAK,EAAO,KAUpB,GANA,AAAI,EACF,EAAM,OAAO,OAAO,CAAC,EAAK,GAAkB,EAAO,EAAO,OAAS,GAAI,EAAS,KACvE,EAAI,QACb,GAAM,OAAO,OAAO,CAAC,EAAK,GAAmB,EAAK,MAGhD,EAAK,gBACP,MAAO,GAGT,GAAM,GAAW,OAAO,MAAM,EAAI,OAAS,GAG3C,SAAS,cAAc,EAAI,OAAQ,QACnC,EAAI,KAAK,EAAU,GAEZ,EAGF,YACL,EACA,EACA,EACA,EACU,CACV,GAAI,CAAE,aAAc,IAClB,KAAM,IAAI,OAAM,wBAGlB,AAAK,EAAK,iBACR,GAAO,QAAU,GAGnB,GAAI,GAAmB,GACvB,KAAO,EAAO,OAAS,GAAO,CAC5B,GAAM,GAAS,WAAO,OAAO,EAAO,OAAQ,EAAO,QAEnD,GADA,EAAO,QAAU,WAAO,eAAe,GACnC,EAAS,EAAG,CACd,GAAM,GAAS,IAAU,GAAK,EAC9B,EAAO,KAAK,GAAG,GAAmB,EAAQ,EAAO,QAC5C,CACL,GAAM,GAAQ,GAAU,EACxB,EAAO,KAAK,GAAG,GAAkB,EAAQ,EAAO,KAKpD,GAFA,EAAS,EAAO,MAAM,EAAG,GAErB,EAAO,SAAW,EACpB,KAAM,IAAI,OAAM,wBAGlB,MAAO,GAGT,YACE,EACA,EACA,EACU,CAEV,GAAM,GAAmB,EAAK,SAE9B,GAAI,EAAQ,GAAM,EAChB,KAAM,IAAI,OAAM,2BAIlB,GAAM,GAAS,GAAI,OAAM,GAAO,KAAK,GACrC,OAAS,GAAI,EAAG,EAAI,EAAW,EAAO,IACpC,AAAI,EAAO,OAAO,EAAO,OAAS,KAAK,MAAM,EAAI,IAAO,GAAK,EAAI,GAC/D,GAAO,KAAK,MAAM,EAAI,KAAc,GAAK,EAAI,GAIjD,SAAO,QAAU,EAAY,GAAQ,GAC9B,EAGT,YACE,EACA,EACA,EACU,CAEV,GAAM,GAAmB,EAAK,SAE1B,EAAQ,EACZ,OAAS,GAAI,EAAG,EAAI,KAAK,KAAK,EAAW,GAAI,IAE3C,GAAS,EACT,GAAS,EAAO,OAAO,EAAO,QAC9B,EAAO,QAAU,EAInB,MAAO,IAAI,OAAM,GAAO,KAAK,GAG/B,YAA4B,EAAkB,EAAmC,CAE/E,GAAM,GAAmB,EAAK,SAE9B,OAAS,GAAI,EAAG,EAAI,EAAO,OAAS,EAAG,IACrC,EAAO,KAAK,GAGd,GAAM,GAAM,OAAO,MAAM,KAAK,KAAK,EAAY,GAAO,OAAS,KAC/D,OAAS,GAAI,EAAG,EAAI,EAAW,EAAO,OAAQ,IAC5C,AAAK,GAAO,KAAK,MAAM,EAAI,IAAc,GAAK,EAAI,GAAa,GAC7D,GAAI,KAAK,MAAM,EAAI,KAAO,GAAK,EAAI,GAIvC,MAAO,QAAO,OAAO,CAAC,OAAO,KAAK,WAAO,OAAS,EAAO,OAAS,GAAM,EAAK,IAAK,IAGpF,YAA2B,EAAe,EAAe,EAAmC,CAE1F,GAAM,GAAmB,EAAK,SAExB,EAAM,OAAO,MAAM,KAAK,KAAK,EAAW,IAE9C,OAAS,GAAI,EAAG,EAAI,EAAI,OAAQ,IAC9B,EAAI,WAAW,EAAQ,IAAM,GAE7B,GAAS,EAGX,MAAO,QAAO,OAAO,CAAC,OAAO,KAAK,WAAO,OAAO,GAAS,IAAK,ICpLzD,YAAsB,EAAM,EAAQ,EAAO,EAAM,CACtD,SAAK,SAAW,EAAO,OAAO,MAAM,EAAO,OAAQ,EAAO,OAAS,GAAG,SAAS,GAC/E,EAAO,QAAU,EACV,GAAgB,EAAM,EAAQ,EAAO,IAAI,EAAM,gBAAiB,KAGlE,YAAsB,EAAM,EAAQ,EAAO,EAAM,CACtD,KAAM,IAAI,OAAM,oDCAX,GAAM,IAAwD,CACnE,MAAO,CACL,aAAoB,GACpB,aAAoB,IAEtB,IAAK,CACH,aAAkB,GAClB,aAAkB,IAGpB,iBAAkB,CAEhB,aAAyB,GACzB,aAAyB,IAG3B,eAAgB,CAEd,aAAyB,GACzB,aAAyB,KClBtB,YAA2B,CAMhC,YAAY,EAA8B,CACxC,KAAK,gBAAkB,KAAK,gBAAgB,KAAK,MACjD,KAAK,kBAAoB,KAAK,kBAAkB,KAAK,WAIjD,UAAyB,OAKzB,UAAS,EAA0C,CACvD,YAAM,MAAK,UACJ,KAAK,aAAa,QAIrB,YAAW,EAAoB,EAAqC,CACxE,YAAM,MAAK,UACJ,KAAK,eAAe,EAAO,GAIpC,aAAa,EAAiC,CAC5C,KAAM,IAAI,OAAM,GAAG,KAAK,wCAI1B,eAAe,EAAoB,EAA4B,CAC7D,KAAM,IAAI,OAAM,GAAG,KAAK,gDAInB,gBACL,EAC4B,CAE5B,GAAM,GAAQ,KAAM,MAAK,YAAY,GACrC,KAAM,MAAK,SAAS,SAIf,kBACL,EAC4B,CAE5B,GAAM,GAAQ,KAAM,MAAK,YAAY,GACrC,KAAM,MAAK,WAAW,GAKd,YAAY,EAAqC,CACzD,MAAO,IAA6B,GAG5B,aAAa,EAAO,CAC5B,MAAK,GAAM,QAAQ,SAAS,KAAK,OAC/B,GAAM,QAAU,GAAG,KAAK,QAAQ,EAAM,WAEjC,ICrEJ,oBAA4B,GAAY,CAQ7C,YAAY,EAA8B,CACxC,MAAM,GARC,UAAe,eACf,gBAAuB,GACvB,sBAA6B,GAC7B,iBAAc,GAMrB,KAAK,QAAU,GAAW,GAG5B,aAAa,EAAiC,CAC5C,MAAO,GAGT,eAAe,EAAiC,CAC9C,MAAO,SAGF,gBACL,EAC4B,CAC5B,MAAO,OAAO,QAGT,kBACL,EAC4B,CAC5B,MAAO,OAAO,ICjClB,OAAiB,SACjB,GAAiB,SAYV,oBAAiC,GAAY,CAUlD,YAAY,EAAqC,GAAI,CACnD,MAAM,GAVC,UAAe,UACf,gBAAuB,GACvB,sBAAmB,CAAC,WACpB,iBAAc,GAIf,aAAyB,GAI/B,KAAK,QAAU,OAGX,UAAS,EAA0C,CAEvD,GAAI,CAAC,IAAa,KAAK,QAAQ,SAAS,QAAS,CAC/C,GAAM,GAAS,KAAK,QAAQ,SAAS,KACjC,KAAM,IAAW,WAAK,MAAM,GAC5B,KAAM,IAAW,WAAK,SAAS,GACnC,MAAO,IAAc,GAEvB,MAAO,MAAK,aAAa,QAGrB,YAAW,EAA0C,CAEzD,GAAI,CAAC,IAAa,KAAK,QAAQ,SAAS,QAAS,CAC/C,GAAM,GAAS,KAAK,QAAQ,SAAS,KACjC,KAAM,IAAW,WAAK,QAAQ,GAC9B,KAAM,IAAW,WAAK,SAAS,GACnC,MAAO,IAAc,GAEvB,MAAO,MAAK,eAAe,GAG7B,aAAa,EAAiC,CAE5C,GAAI,CAAC,IAAa,KAAK,QAAQ,SAAS,QAAS,CAC/C,GAAM,GAAS,KAAK,QAAQ,SAAS,KAAO,WAAK,SAAS,GAAS,WAAK,YAAY,GACpF,MAAO,IAAc,GAEvB,GAAM,GAAmC,KAAK,SAAS,SAAW,GAC5D,EAAa,GAAI,YAAW,GAElC,MAAO,AADS,MAAK,SAAS,IAAM,WAAK,WAAa,WAAK,SAC5C,EAAY,GAAa,OAG1C,eAAe,EAAiC,CAE9C,GAAI,CAAC,IAAa,KAAK,QAAQ,SAAS,QAAS,CAC/C,GAAM,GAAS,KAAK,QAAQ,SAAS,KAAO,WAAK,WAAW,GAAS,WAAK,YAAY,GACtF,MAAO,IAAc,GAEvB,GAAM,GAAmC,KAAK,SAAS,SAAW,GAC5D,EAAa,GAAI,YAAW,GAElC,MAAO,AADS,MAAK,SAAS,IAAM,WAAK,WAAa,WAAK,SAC5C,EAAY,GAAa,aAGnC,gBACL,EAC4B,CAC5B,GAAM,GAAmC,KAAK,SAAS,SAAW,GAC5D,EAAgB,GAAI,YAAK,QAAQ,GACvC,MAAO,KAAK,iBAAiB,EAAe,SAGvC,kBACL,EAC4B,CAC5B,GAAM,GAAmC,KAAK,SAAS,SAAW,GAC5D,EAAgB,GAAI,YAAK,QAAQ,GACvC,MAAO,KAAK,iBAAiB,EAAe,SAGvC,iBACL,EACA,EAC4B,CAC5B,EAAc,OAAS,KAAK,QAAQ,KAAK,MACzC,EAAc,MAAQ,KAAK,OAAO,KAAK,MACvC,aAAiB,KAAS,GAAe,CACvC,GAAM,GAAa,GAAI,YAAW,GAElC,GAAI,CADO,EAAc,KAAK,EAAY,IAExC,KAAM,IAAI,OAAM,GAAG,KAAK,oBAG1B,MADe,KAAK,aAKtB,GAAM,GAAa,GAAI,YAAW,GAC5B,EAAK,EAAc,KAAK,EAAY,IAM1C,MADe,KAAK,aAItB,QAAQ,EAAO,CACb,KAAK,QAAQ,KAAK,GAGpB,OAAO,EAAQ,CACb,GAAI,IAAW,EACb,KAAM,IAAI,OAAM,KAAK,UAAU,GAAU,KAAK,QAAQ,QAI1D,YAA4B,CAC1B,GAAM,GAAS,KAAK,QACpB,YAAK,QAAU,GACR,EAIT,UAAU,EAAe,EAAW,CAClC,GAAM,GAAW,CAEf,EAAG,kBAEH,EAAG,aAEH,EAAG,GAEH,KAAM,aAEN,KAAM,eAEN,KAAM,aAEN,KAAM,sBAEN,KAAM,eAEN,KAAM,wBAER,MAAO,GAAG,KAAK,SAAS,EAAS,OClJ9B,oBAA8B,GAAmB,CAMtD,YAAY,EAAkC,CAC5C,MAAM,IAAI,EAAS,QAAS,IAAI,GAAS,KAAM,KAAM,MAN9C,UAAe,OACf,gBAAa,CAAC,KAAM,QACpB,sBAAmB,CAAC,OAAQ,UAC5B,iBAAc,KCIzB,GAAI,IAAmB,IAAM,CAM3B,WAAqB,EAAO,CAE1B,KAAK,KAAO,EAEZ,KAAK,OAAS,EAKhB,GAAI,GAAyB,WAAW,KAAK,CAC3C,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAC1F,IAAK,KAAM,KAAM,OAGf,EAAyB,WAAW,KAAK,CAC3C,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,KAGxD,EAAmC,WAAW,KAAK,CACrD,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAG3C,EAAmC,WAAW,KAAK,CACrD,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,IAGjD,EAAc,WAAW,KAAK,CAChC,OAAU,OAAU,OAAU,OAAU,OAAU,OAAU,OAAU,OAAU,OAChF,OAAU,OAAU,OAAU,OAAU,OAAU,OAAU,SAG1D,EAAsB,WAAW,KAAK,CACxC,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAC1F,KAAM,KAAM,KAAM,QAGhB,EAAsB,WAAW,KAAK,CACxC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,KAG7E,EAAuB,WAAW,KAAK,CACzC,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAC1F,EAAM,EAAM,EAAM,EAAM,GAAM,GAAM,GAAM,KAGxC,EAAqB,WAAW,KAAK,CACvC,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAC1F,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,GAAM,KAGxC,EAAa,GAAI,YAAW,MAE9B,EAAyB,GAM3B,WAAmB,EAAG,CACpB,GAAyB,GAAS,GACT,EAAO,GAChC,KAAO,EAAO,GACZ,AAAI,IAAM,GAAQ,GAChB,IAAU,EACV,EAAI,IAAM,GAEZ,EAAO,GAAQ,EAEjB,MAAO,GAAS,EAQlB,WAAuC,EAAU,EAAS,EAAc,CACtE,MAAO,IAAK,EAAU,EAAK,IAAgB,GAQ7C,WAAwC,EAAa,EAAU,EAAS,CACtE,GAAI,EAAc,EAAW,IAAK,GAChC,KAAM,2BAER,GAAyB,GAAW,GAAc,GAAY,GAAY,EACjD,EAAY,EAAU,GAAU,EAEzD,MAAS,CAD0B,GAAY,GAAM,EAAO,GAAU,EAAa,GAClE,GAAM,GAAa,IAAK,GAAY,EAAU,GAMjE,WAAkC,EAAW,CAC3C,GAA8B,GAAsB,GAAI,YAAW,IACrC,EAAoB,GAAI,YAAW,IACjE,EAAkB,GAAK,EACvB,OAA8B,GAAI,EAAG,EAAI,GAAI,EAAE,EAC7C,EAAoB,EAAI,GAAK,EAAoB,GAAM,IAAK,EAAqB,IACjF,EAAkB,EAAI,GAAK,EAAkB,GAAM,IAAK,EAAmB,IAE7E,OAA8B,GAAU,EAAG,EAAU,IAAK,EAAE,EAAS,CACnE,GAAyB,GAAW,IAAY,EACvB,EAAwB,GACjD,AAAI,GAAY,GACd,IAAY,EACZ,EAAwB,GAE1B,GAAyB,GAClB,UAAa,EAAW,EAAM,IAAQ,EAAO,IAAY,EAAK,EAC5C,GAClB,UAAa,EAAW,EAAM,IAAQ,EAAM,EAAU,EACpC,GAAmB,EAAkB,IACrC,GACrB,EAAyB,IAAmB,EAAI,EAAI,GAAmB,GAClD,GAAQ,EAAU,EAC3C,EAAU,GAAQ,GAAK,EAAqB,GAAe,EAAmB,KAAa,EAC3F,EAAU,GAAQ,GAAK,EAAoB,GAC3C,EAAU,GAAQ,GAAK,EAAkB,IACzC,EAAU,GAAQ,GAAK,IAO3B,WAA0B,EAAG,CAC3B,GAAyB,GAAqB,EAAE,cAMhD,GALA,EAAE,cAAgB,EACd,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEb,GAAY,EAAG,IAAM,EACvB,MAAO,IAET,GAAyB,GAAI,GAAY,EAAG,GAC5C,MAAI,IAAK,EACA,GAAK,EAEd,GAAI,GAAY,EAAG,GACf,GAAK,EACH,GAAK,EACH,GAAsB,GAG1B,GAAE,cAAgB,EACd,GAAY,EAAG,IAAM,IAGzB,GAAI,GAAY,EAAG,GACf,EAAI,IAAM,EAAI,IACT,GAEF,EAEA,EAAI,EAGR,IAMT,WAA2B,EAAG,CAC5B,GAAI,EAAE,cAAgB,EACpB,KAAM,oCAER,EAAE,QAAU,EAMd,WAA2B,EAAG,CAC5B,GAAI,EAAE,cAAgB,EACpB,KAAM,oCAER,EAAE,cAAgB,EAOpB,WAA+B,EAAG,EAAM,CACtC,GAAI,EAAE,cAAgB,EACpB,KAAM,oCAOR,GALI,EAAE,aAAe,GACnB,GAAE,SAAW,GAAI,OAAM,IACvB,EAAE,eAAiB,GAAI,YAAW,IAClC,EAAE,YAAc,IAEd,EAAE,aAAe,GACnB,KAAM,6BAER,EAAE,SAAS,EAAE,aAAe,EAC5B,EAAE,cACF,EAAE,aAAe,EAAK,OACtB,EAAE,eAAe,EAAE,aAAe,EAAE,YAOtC,WAAmB,EAAG,EAAO,CAC3B,GAAI,EAAE,cAAgB,EACpB,KAAM,8BAER,EAAE,WAAa,GAAI,YAAW,MAC9B,EAAE,WAAW,GAAK,EAClB,EAAE,UAAY,EACd,GAAyB,GAA2B,EAChD,WACA,EACA,IAAM,GAEV,EAAE,cAAgB,GAAI,WAAU,GAChC,EAAE,WAAa,GAAI,YAAW,GAC9B,EAAE,MAAQ,EACV,EAAc,GACd,EAAE,aAAe,EAMnB,YAAe,EAAG,CAChB,GAAI,EAAE,cAAgB,EACpB,KAAM,4BAER,AAAI,EAAE,cAAgB,IAGtB,GAAE,aAAe,GACb,EAAE,OAAS,MACb,IAAW,EAAE,OACb,EAAE,MAAQ,OAOd,WAAkC,EAAG,CAKnC,GAJI,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEb,GAAY,EAAG,IAAM,EAAG,CAC1B,GAAyB,GAAI,GAAY,EAAG,GAC5C,MAAI,IAAK,EACA,EAEA,GAAY,EAAG,GAAM,IAAK,GAGrC,MAAO,GAMT,WAA+B,EAAG,CAShC,GARI,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,EAAE,SAAW,GAAY,EAAG,GAC5B,EAAE,gBAAkB,EACpB,EAAE,eAAiB,EACnB,EAAE,WAAa,EACX,EAAE,UAAY,GAAK,GAAY,EAAG,IAAM,EAC1C,OAEF,GAAyB,GAAc,GAAY,EAAG,GAAK,EAC3D,GAAI,GAAe,EAAG,CAEpB,GADA,EAAE,WAAa,EACX,GAAY,EAAG,IAAM,EACvB,KAAM,yBAER,GAAyB,GAAY,GAAY,EAAG,GACpD,GAAI,GAAa,EACf,OAEF,OAA8B,GAAI,EAAG,EAAI,EAAW,IAAK,CACvD,AAAI,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAyB,GAAO,GAAY,EAAG,GAC/C,GAAI,GAAQ,GAAK,EAAI,GAAK,GAAa,EAAY,EACjD,KAAM,mBAER,EAAE,iBAAmB,GAAS,EAAI,OAGpC,QAA8B,GAAI,EAAG,EAAI,EAAa,IAAK,CACzD,AAAI,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAyB,GAAO,GAAY,EAAG,GAC/C,GAAI,GAAQ,GAAK,EAAI,GAAK,GAAe,EAAc,EACrD,KAAM,mBAER,EAAE,iBAAmB,GAAS,EAAI,EAGtC,EAAE,kBACE,EAAE,UAAY,GAChB,GAAE,eAAiB,GAAY,EAAG,IAStC,YAAoB,EAAY,EAAU,EAAG,CAC3C,GAAyB,GAAS,EAAW,GACpB,EAAM,EAAE,gBAAkB,EAAE,UACrD,GAAU,EAAM,IAChB,GAAyB,GAAO,EAAW,IAAW,GAC7B,EAAM,EAAW,GAAU,MACpD,GAAI,GAAQ,EACV,SAAE,WAAa,EACR,EAET,GAAU,EACV,GAAyB,IAAQ,IAAK,GAAQ,EAC9C,UAAW,GAAM,MAAU,EAC3B,EAAE,WAAc,GAAW,IAAW,IAAM,EACrC,EAAW,GAAU,MAQ9B,WAAyB,EAAY,EAAU,EAAG,CAChD,AAAI,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAyB,GAAO,GAAW,EAAY,EAAU,GACxC,EAAI,EAAoB,GACjD,MAAI,GAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEV,EAAoB,GAAS,IAAK,GAAK,GAAY,EAAG,GAAK,GAAa,EAAG,IAOpF,YAAqB,EAAG,EAAO,CAC7B,GAAyB,GAAQ,EAAE,GACnC,KAAO,EAAQ,EAAG,IAChB,EAAE,GAAS,EAAE,EAAQ,GAEvB,EAAE,GAAK,EAOT,WAAqC,EAAG,EAAM,CAC5C,GAA8B,GAAM,GAAI,YAAW,KACnD,OAA8B,GAAI,EAAG,EAAI,IAAK,IAC5C,EAAI,GAAK,EAEX,OAA8B,GAAI,EAAG,EAAI,EAAM,IAAK,CAClD,GAAyB,GAAQ,EAAE,GAAK,IACxC,EAAE,GAAK,EAAI,GACP,GAAS,GACX,GAAY,EAAK,IAWvB,WAAgC,EAAuB,EAAY,EAAa,EAAG,CACjF,GAAyB,GAAS,EACT,EAAc,EACd,EAAS,EACT,GAAgB,EAChB,GAAQ,MACH,GAAQ,GAAI,YAAW,GAAK,GACjC,GAAW,GAAM,OAAS,EAEnD,IADA,GAAkB,GAAO,GAAU,EAAG,EAAuB,IACtD,EAAS,GAAc,GAAQ,GAAG,CACvC,AAAI,EAAE,WAAa,MACjB,GAAgB,GAEd,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAyB,IAAK,EAAE,gBAAkB,EAAE,UAAa,GACjE,EAAE,WAAa,GAAM,KAAM,GAC3B,GAAyB,IAAU,GAAM,IAAK,MAC9C,GAAI,GAAU,GACZ,EAAS,EACT,EAAY,KAAY,GACpB,IAAW,GACb,GAAc,GACd,IAAS,OAAS,QAEf,CACL,GAAyB,IAAY,GAAU,GACtB,GAAS,EAClC,AAAI,IAAW,IACb,IAAS,GAEP,IAAiB,IACnB,GAAS,EACT,GAAgB,IAElB,GAAyB,IAAY,EACrC,AAAI,EAAS,GACX,IAAU,EACV,IAAW,IAET,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAU,GAAY,EAAG,IAAa,EACtC,GAAyB,IAAc,EAAS,GAChD,GAAI,EAAS,GAAc,EACzB,KAAM,oCAER,OAA8B,IAAI,EAAG,GAAI,GAAa,KACpD,EAAY,KAAY,GAE1B,AAAI,IAAiB,GACnB,KAAS,IAAgB,GAAK,KAIpC,GAAI,IAAS,EACX,KAAM,eAER,EAAY,KAAK,EAAG,EAAQ,GAO9B,WAAoB,EAAS,EAAQ,CACnC,OAA8B,GAAI,EAAG,EAAI,EAAS,EAAG,EAAE,EACrD,OAA8B,GAAI,EAAI,EAAG,EAAI,EAAQ,EAAE,EACrD,GAAI,EAAQ,IAAM,EAAQ,GACxB,KAAM,uCAad,WAA+B,EAAiB,EAAmB,EAAY,EAAU,EAAG,CAC1F,GAA8B,GAAc,GAAI,YAAW,GAC7B,EAAU,GAAI,YAAW,GAC9B,GAAU,EAAI,EAAU,EAAkB,GAC1C,GAAa,GAAY,EAAG,GAAK,EAC1D,OAA8B,IAAI,EAAG,GAAI,GAAY,KAAK,CACxD,AAAI,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAyB,IAAS,GAAY,EAAG,IACjD,GAAI,IAAU,EACZ,KAAM,wBAER,EAAQ,IAAK,GAEf,EAAW,EAAS,IACpB,GAAyB,IAAc,GAIvC,OAHI,IAAc,GAChB,KAAe,GAAY,EAAG,IAExB,QACD,GACH,EAAY,EAAQ,IAAM,EAC1B,UACG,GACH,EAAY,EAAQ,IAAM,EAC1B,EAAY,EAAQ,IAAM,EAC1B,UACG,GACH,EAAY,EAAQ,IAAM,EAC1B,EAAY,EAAQ,IAAM,EAC1B,EAAY,EAAQ,IAAM,EAC1B,UACG,GACH,EAAY,EAAQ,IAAM,EAC1B,EAAY,EAAQ,IAAM,EAC1B,EAAY,EAAQ,IAAM,EAC1B,EAAY,EAAQ,IAAM,EAC1B,UACG,GACH,EAAY,EAAQ,IAAM,EAC1B,EAAY,EAAQ,IAAM,EAC1B,EAAY,EAAQ,IAAM,EAC1B,EAAY,EAAQ,IAAM,EAC1B,cAEA,MAEJ,MAAO,IAAkB,EAAY,EAAU,EAAG,EAAa,GAUjE,WAAgC,EAAmB,EAAM,EAAY,EAAU,EAAG,CAChF,GAA8B,GAAc,GAAI,YAAW,GAC7B,EAAwB,GAAI,YAAW,IAC5C,GAAQ,GACR,GAAW,EACpC,OAA8B,IAAI,EAAM,GAAI,IAAM,GAAQ,EAAG,KAAK,CAChE,GAAyB,IAAa,EAAuB,IAC7D,AAAI,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAyB,IAAK,EAAE,gBAAkB,EAAE,UAAa,GACjE,EAAE,WAAa,EAAY,KAAM,GACjC,GAAyB,IAAI,EAAY,IAAK,MAC9C,EAAsB,IAAc,GAChC,IAAK,GACP,KAAS,IAAM,GACf,MAGJ,GAAI,IAAS,GAAK,IAAY,EAC5B,KAAM,mCAER,SAAuB,EAAuB,EAAmB,EAAa,GACvE,GAAkB,EAAY,EAAU,EAAG,EAAa,GAUjE,WAAyB,EAAiB,EAAmB,EAAY,EAAU,EAAG,CACpF,AAAI,EAAE,WAAa,MACjB,GAAgB,GAEd,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAyB,GAAmB,GAAY,EAAG,GAC3D,MAAI,IAAoB,EACf,EAAsB,EAAiB,EAAmB,EAAY,EAAU,GAEhF,EAAuB,EAAmB,EAAkB,EAAY,EAAU,GAS7F,WAA0B,EAAgB,EAAY,EAAG,CACvD,AAAI,EAAE,WAAa,MACjB,GAAgB,GAElB,GAAyB,GAAW,EAAyB,GAAK,EAClE,GAAI,GAAY,EACd,SAAW,KAAK,EAAG,EAAG,GACf,EAET,AAAI,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAyB,GAAiB,GAAY,EAAG,GAChC,EAAqB,EAC9C,AAAI,GAAkB,GACpB,GAAqB,GAAY,EAAG,GAAK,GAE3C,GAAyB,GAAe,EAAW,EAC1B,GAAY,EAAwB,EAAe,IAAO,GACrD,GAAQ,GAAI,YAAW,GAAY,GACxC,GAAW,GAAM,OAAS,EACnD,EAAgB,EAAc,EAAc,GAAO,GAAU,GAC7D,OAA8B,IAAI,EAAG,GAAI,GAAkB,CACzD,AAAI,EAAE,WAAa,MACjB,GAAgB,GAEd,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAyB,IAAO,GAAW,GAAO,GAAU,GAC5D,GAAI,IAAQ,EACV,EAAW,IAAK,EAChB,aACS,IAAQ,EAAoB,CACrC,AAAI,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAyB,IAAQ,IAAK,IAAQ,GAAY,EAAG,IAC7D,KAAO,IAAQ,GAAG,CAChB,GAAI,IAAK,EACP,KAAM,wBAER,EAAW,IAAK,EAChB,KACA,UAGF,GAAW,IAAK,GAAO,EACvB,KAGJ,MAAI,GAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEb,GAAY,EAAG,IAAM,GACvB,EAA4B,EAAY,GAEnC,EAQT,WAAkC,EAAG,EAAU,EAAe,CAC5D,GAA8B,GAAc,EAAE,MACrB,EAAS,EAAI,EAAW,EACjD,AAAI,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAyB,GAAY,GAAW,EAAE,WAAY,EAAI,EAAU,GACnD,EAAS,EAAgB,EAAE,WAAY,EAAI,EAAW,EAAG,GAClF,MAAI,IAAa,EACf,EAAY,EAAY,EAAS,GAAK,EACjC,AAAI,GAAa,EACtB,EAAY,EAAY,GAExB,GAAa,EAEX,GAAa,GACf,IAAa,GAEf,EAAY,GAAU,EAAY,EAAS,GAC3C,EAAY,EAAS,GAAK,EACnB,EAMT,WAAkC,EAAG,CACnC,EAAE,mBAAqB,EAAyB,EAAG,EAAG,EAAE,sBACxD,GAAyB,GAAmB,EAAE,MAAM,GACpD,EAAE,gBAAkB,GAAoB,EACxC,EAAE,eAAiB,EAAE,WAAW,EAAE,iBAAmB,IACrD,GAAyB,GAAc,EAAE,aAAa,GACtD,EAAE,qBAAuB,GAAe,EACxC,EAAE,qBAAuB,EAAE,qBAAuB,IAMpD,YAAkC,EAAG,CACnC,EAAE,mBAAqB,EAAyB,EAAG,EAAG,EAAE,sBACxD,EAAE,eAAiB,EAAE,MAAM,GAM7B,YAAmC,EAAG,CACpC,EAAE,oBAAsB,EAAyB,EAAG,EAAG,EAAE,uBACzD,EAAE,oBAAsB,EAAE,MAAM,IAAM,EAMxC,WAAmC,EAAG,CACpC,GAAyB,GAAU,EAAE,kBACrC,GAAI,EAAU,EAAE,kBAAmB,CACjC,GAAyB,GAAiB,EAAE,kBAC5C,KAAO,GAAW,EAAI,GACpB,IAAY,EAEd,AAAI,EAAE,UAAY,GAAK,EAAU,OAAS,EAAE,mBAAqB,OAC/D,GAAU,OAGd,GAAI,GAAW,EAAE,eACf,OAEF,GAAyB,GAA0B,EAAU,GAChC,EAAY,GAAI,WAAU,GACvD,AAAI,EAAE,WAAW,QAAU,GACzB,EAAU,IAAI,EAAE,WAAW,SAAS,EAAG,EAAI,EAAE,gBAAiB,GAEhE,EAAE,WAAa,EACf,EAAE,eAAiB,EAMrB,WAAiC,EAAG,CAClC,GAAI,EAAE,UAAY,EAAG,CACnB,EAAE,iBAAmB,GACrB,EAAE,aAAe,GACjB,OASF,AAPA,EAAE,iBAAmB,GAAI,YAAW,GACpC,EAAE,iBAAmB,GAAI,YAAW,GACpC,EAAE,kBAAoB,GAAI,YAAW,GACjC,EAAE,WAAa,MACjB,GAAgB,GAElB,EAAsB,GAClB,IAAE,iBAAmB,GAAK,EAAE,YAAc,IAG9C,CAAI,EAAE,gBAAkB,GAAK,EAAE,YAAc,EAC3C,GAAmB,GACnB,EAAE,aAAe,EAAE,YAAc,EAAI,EAAI,GAEzC,EAAE,aAAe,EAEf,EAAE,YAAc,GAGpB,GAAE,mBAAqB,EAAE,gBACrB,EAAE,kBAAoB,GAAK,IAC7B,GAAE,kBAAoB,GAAK,IAEzB,EAAE,eAAiB,EAAE,mBACvB,EAA0B,KAS9B,YAAgC,EAAG,EAAU,EAAe,CAC1D,GAAyB,GAAS,EAAE,WAAW,EAAI,GACnD,GAAI,GAAiB,EACnB,SAAE,WAAW,EAAI,EAAW,GAAK,EACjC,EAAE,WAAW,EAAI,EAAW,GAAK,EAC1B,GAAK,GAEd,GAAyB,GAAwB,EAAgB,EACjE,GAAU,EACR,EACA,EACA,EAAE,WACF,EAAI,EACJ,GAEF,EAAE,WAAW,EAAI,EAAW,GAAK,EACjC,GAAyB,GAA0B,GACnD,UAAU,EACR,EACA,EACA,EAAE,WACF,EAAI,EAAW,EACf,GAEF,EAAE,WAAW,EAAI,EAAW,GAAK,EAC1B,EAAgB,EAAE,WAAY,EAAI,EAAW,EAAG,GAOzD,YAA8B,EAAG,EAAmB,CAClD,GAA6B,GAAgB,EAAE,cACjB,EAAa,EAAE,WACpB,EAAW,EAAE,oBACb,EAAU,EAAE,uBACZ,EAAU,GAAK,EACf,GAAO,EACP,GAAO,EACP,GAAI,GAC7B,OAA8B,IAAI,EAAG,GAAI,EAAS,EAAE,GAClD,EAAc,IAAK,EACnB,EAAW,IAAK,GAAI,EACpB,EAAE,GAEJ,KAAO,GAAI,GAAmB,CAC5B,GAAyB,IAAO,EAAc,IAAI,IAAS,IAAQ,GAAM,GAAY,EACrF,OAA8B,IAAI,EAAG,GAAI,EAAS,EAAE,GAClD,EAAc,IAAK,GACnB,EAAW,IAAK,GAAO,GACvB,EAAE,GAEJ,GAAO,GAAO,GACd,GAAO,GAAO,GAOlB,YAAiD,EAAG,CAClD,EAAE,qBAAuB,EAAyB,GAAK,EACvD,EAAE,mBAAqB,GAAuB,EAAG,EAAG,EAAE,sBACtD,EAAE,qBAAuB,EAAyB,GAAK,EACvD,EAAE,mBAAqB,GAAuB,EAAG,EAAG,EAAE,sBACtD,EAAE,sBAAwB,EAAyB,GAAK,EACxD,EAAE,oBAAsB,GAAuB,EAAG,EAAG,EAAE,uBACnD,EAAE,WAAa,MACjB,GAAgB,GAEd,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,EAAE,oBAAsB,GAAY,EAAG,GACvC,EAAE,uBAAyB,GAAY,EAAG,IAAM,EAAE,oBAClD,EAAE,aAAe,GAAI,WAAU,EAAE,sBACjC,OAA8B,GAAI,EAAG,EAAI,EAAE,sBAAwB,CACjE,GAAyB,GAAQ,GAAI,EAAI,GAAI,EAAE,sBAC/C,KAAO,EAAI,EAAO,EAAE,EAClB,AAAI,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,EAAE,aAAa,GAAK,GAAY,EAAG,GAErC,AAAI,EAAE,WAAa,MACjB,GAAgB,GAGpB,EAAE,WAAa,GAAI,WAAU,EAAE,sBAAwB,GACvD,GAAyB,GAAkB,EACvC,EAAE,sBAAwB,EAC1B,EAAE,WACF,GAEJ,EAAE,sBAAwB,EAC1B,OAA8B,GAAI,EAAG,EAAI,EAAE,sBAAwB,EAAG,IACpE,GAAI,EAAE,WAAW,IAAM,GAAK,EAAG,CAC7B,EAAE,sBAAwB,EAC1B,MAGJ,EAAE,eAAiB,GAAI,WAAU,EAAE,uBAAyB,GAC5D,GAAyB,GAAe,EACpC,EAAE,uBAAyB,EAC3B,EAAE,eACF,GAEJ,EAAE,iBAAmB,GAAuB,IAAK,IAAK,EAAiB,GACvE,EAAE,iBAAmB,GAAuB,IAAK,IAAK,EAAE,qBAAsB,GAC9E,GAAyB,GAA0B,EAC/C,EAAE,oBACF,EAAE,uBACF,IAEqB,EAA4B,EACrD,AAAI,EAAE,eAAiB,GACrB,GAA0B,EACxB,EAAE,oBACF,EAAE,uBACF,IAEF,EAA4B,EAC1B,WACA,EAAE,oBACF,EAAE,yBAGN,EAAE,kBAAoB,GACpB,EACA,EACA,EACA,GAEF,GAAqB,EAAG,GACxB,EAAE,gBAAkB,EACpB,EAAE,oBAAsB,EACxB,EAAE,qBAAuB,EAAE,aAAa,GAAK,IAC7C,EAAE,qBAAuB,EAAE,qBAAuB,IAClD,EAAE,eAAiB,EACnB,EAAE,eAAiB,EACnB,EAAE,MAAM,GAAK,EACb,EAAE,MAAM,GAAK,EACb,EAAE,MAAM,GAAK,EACb,EAAE,MAAM,GAAK,EACb,EAAE,MAAM,GAAK,EACb,EAAE,MAAM,GAAK,EAMf,YAA8B,EAAG,CAC/B,GAA6B,GAAa,EAAE,WAC5C,GAAI,EAAE,iBAAmB,EAAG,CAC1B,EAAO,GACP,EAAE,aAAe,EACjB,OAEF,GAAyB,GAAc,GAAI,EAAE,eAAiB,EAAE,IAAK,EAAE,iBAIvE,GAHA,GAAa,EAAG,EAAY,EAAE,IAAK,GACnC,EAAE,iBAAmB,EACrB,EAAE,KAAO,EACL,EAAE,KAAO,EAAE,eAAgB,CAC7B,EAAE,iBAAmB,EACrB,EAAE,aAAe,GACjB,OAEF,EAAO,GACP,EAAE,aAAe,EAMnB,YAAyB,EAAG,CAC1B,GAAyB,GAAU,GAC/B,EAAE,aAAe,EAAE,WACnB,EAAE,qBAAuB,EAAE,wBAU/B,MARI,IAAW,GACb,GAAE,OAAO,IACP,EAAE,WAAW,SAAS,EAAE,uBAAwB,EAAE,uBAAyB,GAC3E,EAAE,aAAe,EAAE,YAErB,EAAE,YAAc,EAChB,EAAE,wBAA0B,GAE1B,EAAE,WAAa,EAAE,aACZ,EAEA,EAUX,YAAgC,EAAiB,EAAmB,EAAG,EAAG,CACxE,GAAyB,GAAe,EAAwB,EAAoB,IAAO,GAC7D,EAAQ,GAAI,YAAW,EAAI,EAAI,GACpC,EAAO,EAChC,OAA8B,IAAI,EAAG,GAAI,EAAG,EAAE,GAC5C,EAAM,IAAK,EACX,GAAQ,EAAgB,EAAiB,EAAmB,EAAO,GAAG,GAExE,MAAO,GAMT,YAAwB,EAAG,CACzB,GAAyB,GAAS,EAAE,eACpC,MAAI,GAAE,SAAW,GACf,GAAS,GAAI,EAAQ,EAAE,uBAAyB,EAAE,aAAe,EAAE,aAE9D,EAOT,YAAyB,EAAG,EAAO,CACjC,GAAI,EAAE,SAAW,WACf,KAAM,6BAER,GAAyB,GAAU,EAAE,SAAW,EAAE,YAAc,EAAI,EAAE,YACtE,GAAI,EAAU,EACZ,GAAiC,EAAG,CAAC,EAAU,EAAG,EAAE,YACpD,EAAE,aAAe,OACZ,CACL,GAA6B,GAA0C,GAC9C,EAAa,EAAE,WACxC,GAAI,EAAa,GACf,KAAM,6BAER,GAAyB,GAAQ,GAAS,GAC1C,GAAI,GAAS,EACX,KAAM,6BAER,GAAyB,GAAS,GAAQ,GACjB,GAAQ,IAAK,GAAS,EACtB,GAAU,EAAU,GACpB,GAAe,IAAY,EACpD,GAAU,GAAU,EACpB,GAA8B,IAAa,EAC3C,GAAI,IAAgB,GAAW,cAC7B,KAAM,6BAER,GAAyB,IAAM,EAC3B,EAAE,WACF,EAAE,IACF,EACA,EACA,EACA,GACA,IAIJ,GAFA,EAAE,KAAO,GACT,EAAE,iBAAmB,GACjB,EAAE,KAAO,EAAO,CAClB,EAAE,iBAAmB,EACrB,EAAE,aAAe,GACjB,OAEF,EAAE,aAAe,GAOrB,YAAsC,EAAG,CACvC,EAAE,WAAa,GAAI,WAAU,KAC7B,GAAyB,GAAY,EACrC,KAAQ,EAAE,YAAc,IAAO,GAAa,GAC1C,IAEF,GAAa,EACb,EAAE,YAAc,EAChB,GAAyB,GAAS,EACT,EAAQ,EACjC,KAAO,EAAS,EAAE,aAAa,CAC7B,KAAO,EAAE,eAAe,EAAQ,GAAK,GACnC,IAEF,EAAE,WAAW,IAAW,GAAa,EACrC,GAAU,GAAK,GASnB,YAA0C,EAAG,EAAS,EAAQ,CAC5D,AAAI,EAAE,aAAe,IACnB,GAA6B,GAE/B,GAAyB,GAAQ,EAAE,WAAW,IAAY,EAAE,aAC5D,KAAO,GAAW,EAAE,eAAe,EAAQ,IACzC,IAEF,GAAI,EAAE,YAAc,EAAU,EAC5B,KAAM,6BAER,EAAE,UAAa,EAAE,UAAY,EAAK,EAClC,EAAE,MAAM,EAAE,WAAa,EAAE,SACzB,EAAE,iBAAmB,EACrB,EAAE,UAAY,EACd,EAAE,WAAa,EAAU,EAAE,eAAe,GAC1C,EAAE,WAAa,EACf,EAAE,WAAa,EAOjB,YAAoC,EAAG,EAAO,CAC5C,GAAyB,GAAM,EAAE,IACR,EAAU,EACnC,KAAO,EAAE,YAAc,EAAE,YAAY,CACnC,GAAyB,GAAQ,EAAQ,EAGhB,EAAiB,AADtC,EAAE,eAAe,EAAE,UAAY,GAAK,EAAE,eAAe,EAAE,WACH,EAAE,WACjC,GAAS,EAAE,WAAa,EAAE,WAenD,GAdI,GAAS,GACX,IAAS,GAEP,GAAS,GACX,IAAS,GAEX,GAAU,EAAE,WAAY,EAAK,EAAE,SAAS,EAAE,WAAY,EAAE,WAAY,EAAE,WAAa,IACnF,GAAO,GACP,EAAE,YAAc,GAChB,EAAE,YAAc,GACZ,IAAU,GACZ,GAAE,YACF,EAAE,WAAa,GAEb,GAAO,EACT,MAGJ,MAAO,GAAM,EAMf,YAAoB,EAAG,CACrB,GAAI,EAAE,cAAgB,EACpB,KAAM,qCAER,GAAI,EAAE,cAAgB,GACpB,KAAM,+BAER,GAAI,EAAE,cAAgB,EAAG,CACvB,GAAyB,GAAa,EAAiB,GACvD,GAAI,GAAc,GAChB,KAAM,4BAER,EAAE,kBAAoB,GAAK,EAC3B,EAAE,oBAAsB,EAAE,kBAAoB,GAC9C,EAAE,aAAe,EAEnB,GAAyB,GAAQ,GAAe,GACvB,EAAiB,EAAE,eAAiB,EAChC,EAAa,EAAE,WAC5C,KAAO,EAAE,cAAgB,IACvB,OAAQ,EAAE,kBACH,GACH,GAAI,EAAE,gBAAkB,EACtB,KAAM,2BAER,EAAwB,GACxB,EAAQ,GAAe,GACvB,EAAiB,EAAE,eAAiB,EACpC,EAAa,EAAE,WACf,aACG,GACH,GAAwC,GACxC,EAAE,aAAe,MACd,GACH,GAAI,EAAE,iBAAmB,EAAG,CAC1B,EAAE,aAAe,EACjB,SAEF,AAAI,EAAE,WAAa,MACjB,GAAgB,GAEd,EAAE,oBAAsB,GAC1B,GAAyB,GAE3B,EAAE,qBACE,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAyB,GACrB,GAAW,EAAE,iBAAkB,EAAE,eAAgB,IAAM,EAClC,EAAyB,EAAW,GACpC,EAAqB,EAAW,EAAU,GAC1C,GAAmB,EAAW,EAAU,GACjE,EAAE,aAAe,EAAW,EAAU,GAClC,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAyB,IAAwB,EAAyB,IAC1E,EAAE,aACA,EACC,KAAyB,GACtB,GAAY,EAAG,IACf,GAAa,EAAG,KAClB,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAyB,IAAsB,GAA0B,EACzE,EAAE,WACA,GACC,KAAuB,GACpB,GAAY,EAAG,IACf,GAAa,EAAG,KACtB,EAAE,EAAI,EACN,EAAE,aAAe,MACd,GACH,GAAI,EAAE,uBAAyB,GAC7B,KAAO,EAAE,EAAI,EAAE,cAeb,GAdI,EAAE,WAAa,MACjB,GAAgB,GAEd,EAAE,oBAAsB,GAC1B,EAAyB,GAE3B,EAAE,qBACE,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,EAAW,EAAE,KAAO,GAAW,EAAE,iBAAkB,EAAE,eAAgB,GACrE,EAAE,MACF,EAAE,IACE,EAAE,KAAO,EAAO,CAClB,EAAE,iBAAmB,EACrB,EAAE,aAAe,GACjB,WAGC,CACL,GAAyB,IAAY,EAAY,EAAE,IAAM,EAAK,GAAkB,IACvD,GAAY,EAAY,EAAE,IAAM,EAAK,GAAkB,IAChF,KAAO,EAAE,EAAI,EAAE,cAAc,CAC3B,AAAI,EAAE,WAAa,MACjB,GAAgB,GAEd,EAAE,oBAAsB,GAC1B,EAAyB,GAE3B,GAAyB,IACrB,GAAO,EAAE,qBAAuB,IAChC,GAAO,EAAE,qBAAuB,IACX,GACrB,EAAE,WAAW,EAAE,gBAAkB,IAAkB,IAWvD,GAVA,EAAE,qBACF,GAAY,GACR,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAY,GAAW,EAAE,iBAAkB,GAAgB,GAC3D,EAAW,EAAE,KAAO,GACpB,EAAE,MACF,EAAE,IACE,EAAE,KAAO,EAAO,CAClB,EAAE,iBAAmB,EACrB,EAAE,aAAe,GACjB,QAIN,GAAI,EAAE,cAAgB,EACpB,SAGF,GADA,EAAE,iBAAmB,EAAE,aACnB,EAAE,iBAAmB,EAAG,CAC1B,EAAE,aAAe,EACjB,SAEF,GAAyB,IAAe,EAAE,aAC1C,GAAI,GAAe,EACjB,EAAE,SAAW,EAAE,MAAM,EAAE,eAClB,CACL,AAAI,EAAE,WAAa,MACjB,GAAgB,GAEd,EAAE,qBAAuB,GAC3B,GAA0B,GAE5B,EAAE,sBACE,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAyB,IACrB,EAAE,eAAe,EAAE,oBAAsB,IAAgB,IAE7D,GADA,GAAe,GAAW,EAAE,kBAAmB,GAAa,GACxD,GAAe,GAAI,CACrB,GAAyB,IACpB,EAAE,UAAY,EAAiC,IAAiB,EAErE,GADA,EAAE,SAAW,EAAE,MAAM,IAAS,EAAiC,IAC3D,EAAE,SAAW,EACf,KAAM,wBAEH,CACL,GAAyB,IAAY,EAAE,cAAc,IAC5B,GACzB,AAAI,EAAE,UAAY,IAAa,GAC7B,GAAO,GAAY,EAAG,IAElB,GAAE,WAAa,IACjB,GAAE,cACC,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/D,EAAE,WAAa,IAEjB,GAAO,IAAa,GAAK,GAAY,EAAG,IAAa,GAAa,EAAG,KAEvE,EAAE,SAAW,EAAE,WAAW,IAAiB,KAAQ,EAAE,sBAQzD,GALA,AAAI,EAAE,aAAe,EAAE,qBAAuB,EAAE,IAAM,EAAE,oBACtD,EAAE,YAAc,EAAE,IAElB,EAAE,YAAc,EAAE,oBAEhB,EAAE,SAAW,EAAE,YAAa,CAC9B,EAAE,aAAe,EACjB,SAMF,GAJI,GAAe,GACjB,GAAE,UAAa,EAAE,UAAY,EAAK,EAClC,EAAE,MAAM,EAAE,WAAa,EAAE,UAEvB,EAAE,WAAa,EAAE,gBACnB,KAAM,6BAER,EAAE,EAAI,EACN,EAAE,aAAe,MACd,GACH,GAAyB,IAAO,EAAE,IAAM,EAAE,SAAY,EAC7B,GAAM,EAAE,IACR,GAAa,EAAE,WAAa,EAAE,EAC9B,GAAS,GAAM,GACf,GAAS,GAAM,GACxC,GAAI,GAAS,GAAkB,GAAS,EAAgB,CACtD,GAAI,GAAa,IAAO,GAAS,IAAO,GAAS,GAC/C,OAA8B,IAAI,EAAG,GAAI,GAAY,IAAK,EACxD,EAAW,MAAS,EAAW,MAC/B,EAAW,MAAS,EAAW,MAC/B,EAAW,MAAS,EAAW,MAC/B,EAAW,MAAS,EAAW,UAGjC,GAAW,WAAW,GAAK,GAAK,IAElC,EAAE,GAAK,GACP,EAAE,iBAAmB,GACrB,EAAE,KAAO,OAET,MAAO,EAAE,EAAI,EAAE,YAKb,GAJA,EAAW,EAAE,KAAO,EAAY,EAAE,IAAM,EAAE,SAAY,GACtD,EAAE,kBACF,EAAE,MACF,EAAE,IACE,EAAE,KAAO,EAAO,CAClB,EAAE,iBAAmB,EACrB,EAAE,aAAe,GACjB,MAIN,AAAI,EAAE,cAAgB,GACpB,GAAE,aAAe,GAEnB,aACG,GACH,GAAgB,EAAG,GACnB,aACG,IAEH,GADA,EAAE,KAAO,GAA2B,EAAG,GACnC,EAAE,KAAO,EAAO,CAClB,EAAE,iBAAmB,GACrB,EAAE,aAAe,GACjB,OAEF,EAAE,aAAe,EACjB,aACG,GACH,KAAO,EAAE,gBAAkB,GACzB,AAAI,EAAE,WAAa,MACjB,GAAgB,GAEd,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEjB,GAAY,EAAG,GACf,EAAE,kBAEJ,EAAE,aAAe,EACjB,aACG,GACH,GAAqB,GACrB,aACG,IACH,EAAE,qBAAuB,GAAI,EAAE,IAAK,EAAE,gBACtC,EAAE,aAAe,OACd,IACH,GAAI,GAAgB,IAAM,EACxB,OAEF,AAAI,EAAE,KAAO,EAAE,qBACb,GAAE,YAAc,EAAE,qBAEhB,EAAE,KAAO,EAAE,gBACT,GAAE,IAAM,EAAE,gBACZ,EAAW,WAAW,EAAG,EAAE,eAAgB,EAAE,KAE/C,EAAE,KAAO,EACT,EAAE,uBAAyB,GAE7B,EAAE,aAAe,EAAE,iBACnB,iBAEA,KAAM,oBAAsB,EAAE,aAGpC,GAAI,EAAE,cAAgB,GAAI,CACxB,GAAI,EAAE,gBAAkB,EACtB,KAAM,2BAER,EAAmB,GACnB,GAAY,EAAG,IAWnB,WAAoB,EAAe,EAAiB,EAAmB,CAErE,KAAK,cAAgB,EAErB,KAAK,SAAW,GAAI,YAAW,GAE/B,KAAK,oBAAsB,GAAI,WAAU,GAEzC,KAAK,kBAAoB,GAAI,YAAW,GAExC,KAAK,OAAS,GAAI,YAAW,GAC7B,KAAK,cAAgB,EACrB,KAAK,SAAW,GAAI,YAAW,EAAgB,GAC/C,KAAK,OAAS,GAAI,YAAW,GAC7B,KAAK,oBAAsB,GAAI,WAAU,GACzC,KAAK,kBAAoB,GAAI,YAAW,EAAoB,GAI9D,GAAI,GAAiB,GAAI,GAAW,IAAK,IAAK,IAS9C,WACE,EACA,EACA,EACA,EACA,EACA,CACA,GAAyB,GAAI,EAAgB,OACpB,EAAQ,EACR,GAAI,EAC7B,OAA8B,IAAI,EAAG,GAAI,EAAG,EAAE,GAAG,CAC/C,GAAyB,IAAI,EAAgB,WAAW,IACxD,AAAI,IAAK,GACP,EAAkB,KAAW,GAE7B,EAAa,MAAO,GAGxB,OAA8B,IAAI,EAAG,GAAI,IAAK,EAAE,GAC9C,EAAW,IAAK,EAAc,WAAW,IAAK,GAIhD,EACE,EAAe,oBACf,EAAe,kBACf,EAAe,SACf;AAAA;AAAA,2FACA,+WAaJ,WACE,EACA,EACA,EACA,EACA,EACA,EACA,EACA,CACA,GAAyB,IAAS,EACJ,GAAW,EAAW,SACvB,GAAsB,EAAW,oBAChC,GAAoB,EAAW,kBACpC,GAAkB,EAAI,EACtB,GAAY,GAAS,IACrB,GAAgB,GAAS,GAAkB,GAC3C,GAAY,GAAS,GAAkB,GACvC,GAAS,GAAkB,IAC3B,GAAY,GAAkB,GAAY,GAC1C,GAAS,GAAkB,IAC3B,GAAY,GAAkB,GAAY,GAC1C,GAAY,GAAgB,GAC5B,GAAW,GAAgB,EAOpD,IANI,IAAY,GAAK,GAAY,IAC/B,IAAY,GAEV,IAAW,GAAK,GAAW,IAC7B,IAAW,GAEN,IAAU,IACf,EAAI,MAAY,GAAoB,MAEtC,AAAI,GAAY,GACd,IAAY,GAEd,GAAa,GACb,GAAO,GACP,GAAO,GACP,GAAyB,IAAI,EAC7B,KAAO,GAAI,GACT,EAAI,MAAY,EAAI,KACpB,KAEF,GAAI,IAAiB,IAAM,IAAiB,GAAI,CAC9C,GAAyB,IAAkB,GAAS,EAIpD,IAHI,IAAiB,IACnB,GAAM,GAED,EAAM,GAAG,CACd,GAAyB,IAAK,EAAI,IAAmB,IACrD,AAAI,GAAK,IACH,KAAM,IAAM,IAAM,KACpB,GAAI,KAAoB,IAE1B,IAAmB,EACnB,GAAO,GACF,AAAI,GAAK,IACd,GAAI,GAAkB,IAAM,GAC5B,IAAmB,EACnB,GAAO,GAEP,GAAI,GAAkB,IAAM,EAC5B,IAAmB,EACnB,GAAO,YAGF,IAAiB,IAAM,IAAiB,GAAI,CACrD,GAAyB,IAAc,GAAS,EACvB,GAAQ,EAAW,OAAO,GAC1B,GAAU,IAAQ,OAAW,UAAa,IAAQ,QAC3E,KAAO,EAAM,GAAG,CACd,GAAyB,IAAO,EACP,GAAK,EAAI,IAAe,IACjD,GAAI,GAAK,IACP,IAAU,GACV,EAAI,IAAe,GAAS,YACnB,KAAK,MACT,GAAI,GAAK,IACd,GAAI,GAAO,EAAG,CACZ,GAAyB,IAAK,EAAI,GAAc,GAChD,IAAW,GAAK,GAAU,IAAK,KAAS,EACxC,EAAI,IAAe,IAAS,IAAU,EAAK,GAC3C,EAAI,GAAc,GAAM,GAAK,IAAS,GAAS,GAC/C,GAAO,MAEP,IAAO,UAEA,GAAK,IACd,GAAI,GAAO,EAAG,CACZ,GAAyB,IAAK,EAAI,GAAc,GACvB,GAAK,EAAI,GAAc,GAChD,IAAW,GAAK,GAAU,IAAK,KAAS,EAAO,IAAK,KAAS,GAC7D,EAAI,IAAe,IAAS,IAAU,GAAM,GAC5C,EAAI,GAAc,GAAM,GAAK,IAAU,IAAU,EAAK,GACtD,EAAI,GAAc,GAAM,GAAK,IAAS,GAAS,GAC/C,GAAO,MAEP,IAAO,UAEA,GAAK,IACd,GAAI,GAAO,EAAG,CACZ,GAAyB,IAAK,EAAI,GAAc,GACvB,GAAK,EAAI,GAAc,GACvB,GAAK,EAAI,GAAc,GAChD,IAAW,GAAK,GAAU,IAAK,KAAS,EAAO,IAAK,KAAS,GAAQ,IAAK,IAAS,GACnF,EAAI,IAAe,IAAS,IAAU,GAAM,EAC5C,EAAI,GAAc,GAAM,GAAK,IAAU,IAAU,GAAM,GACvD,EAAI,GAAc,GAAM,GAAK,IAAU,IAAU,EAAK,GACtD,EAAI,GAAc,GAAM,GAAK,IAAS,GAAS,GAC/C,GAAO,MAEP,IAAO,EAGX,IAAe,GACf,GAAO,GACH,IAAiB,IACnB,GAAM,IAIZ,KAAO,IAAU,IACf,EAAI,MAAY,GAAoB,MAEtC,MAAO,IAAS,EAQlB,WAAoB,EAAK,EAAK,CAC5B,GAAyB,GAAO,GAAM,EAAM,EAC5C,KAAQ,GAAM,IAAS,GACrB,IAAS,EAEX,MAAQ,GAAO,EAAO,GAAM,EAU9B,WAAwB,EAAO,EAAQ,EAAM,EAAK,EAAM,CACtD,EACE,IAAO,EACP,EAAM,EAAS,GAAO,QACf,EAAM,GAQjB,WAA0B,EAAO,EAAK,EAAU,CAC9C,GAAyB,GAAO,GAAM,EAAM,EAC5C,KAAO,EAAM,IACX,IAAQ,EAAM,GACV,KAAQ,KAGZ,IACA,IAAS,EAEX,MAAO,GAAM,EAUf,YAA2B,EAAY,EAAU,EAAU,EAAa,EAAiB,CACvF,GAAyB,GAAc,EAAW,GACzB,EACK,GAAS,GAAI,YAAW,GACxB,GAAQ,GAAI,YAAW,IACvB,GAAS,GAAI,YAAW,IAC7B,GACzB,IAAK,GAAS,EAAG,GAAS,EAAiB,KACzC,GAAM,EAAY,OAEpB,GAAO,GAAK,EACZ,OAA8B,IAAM,EAAG,GAAM,GAAI,KAC/C,GAAO,GAAM,GAAK,GAAO,IAAO,GAAM,IAExC,IAAK,GAAS,EAAG,GAAS,EAAiB,KACzC,AAAI,EAAY,KAAW,GACzB,IAAO,GAAO,EAAY,QAAc,IAG5C,GAAyB,IAAY,EACZ,GAAY,GAAK,GACjB,GAAY,GACrC,GAAI,GAAO,KAAO,EAAG,CACnB,IAAK,EAAM,EAAG,EAAM,GAAW,IAC7B,EAAW,EAAc,GAAO,GAAO,GAEzC,MAAO,IAET,EAAM,EACN,GAAS,EACT,OAA8B,IAAM,EAAG,GAAO,EAAG,IAAO,EAAU,KAAO,KAAS,EAChF,KAAO,GAAM,IAAO,EAAG,GAAM,MAC3B,EACE,EACA,EAAc,EACd,GACA,GACC,IAAO,GAAM,GAAO,OAEvB,EAAM,EAAW,EAAK,IAG1B,GAAyB,IAAO,GAAY,EACnB,GAAM,GACN,GAAgB,EACzC,OAA8B,IAAM,EAAW,EAAG,GAAO,EAAG,IAAO,GAAI,KAAO,KAAS,EACrF,KAAO,GAAM,IAAO,EAAG,GAAM,MAC3B,AAAK,GAAM,KAAS,IAClB,KAAiB,GACjB,GAAY,EAAiB,GAAO,GAAK,GACzC,GAAY,GAAK,GACjB,IAAa,GACb,GAAM,EAAM,GACZ,EAAW,EAAc,IACrB,GAAY,GAAa,GAAO,GAAgB,EAAc,IAEpE,EACE,EACA,GAAiB,IAAO,GACxB,GACA,GACE,GAAM,GAAa,GAAM,GAAO,OAEpC,EAAM,EAAW,EAAK,IAG1B,MAAO,IAOT,YAAyB,EAAG,CAC1B,GAAI,EAAE,oBAAsB,EAAG,CAC7B,GAAI,GAAc,IAAM,GACtB,OAEF,KAAM,gBAER,GAAyB,GAAa,EAAE,YAAc,EAC7B,EAAgB,KAAO,EAGhD,IAFA,EAAE,WAAW,WAAW,EAAG,EAAY,MACvC,EAAE,WAAa,EACR,EAAgB,MAAM,CAC3B,GAAyB,GAAY,KAAO,EACnB,EAAM,GAAU,EAAE,MAAO,EAAE,WAAY,EAAe,GAC/E,GAAI,GAAO,EAAG,CACZ,EAAE,mBAAqB,EACvB,EAAE,UAAY,EACd,GAAiB,EACjB,MAEF,GAAiB,EAEnB,GAAe,EAAG,GAOpB,YAAqB,EAAG,EAAa,CACnC,GAAI,EAAE,oBAAsB,EAC1B,OAEF,GAAyB,GAAc,GAAE,YAAc,GAAO,GAAE,UAAY,GAAM,GAAK,EACvF,GAAI,EAAa,EAAE,UACjB,KAAM,iBAER,GAAI,GAAe,GAAK,GAAc,EAAE,UACtC,KAAM,yBAOV,YAAkC,EAAG,CACnC,GAAI,EAAE,UAAY,GAChB,KAAM,4BAA8B,EAAE,UAQ1C,YAAqB,EAAG,EAAG,CACzB,GAAyB,GAAO,EAAE,gBAAkB,EAAE,UAAe,IAAK,GAAK,EAC/E,SAAE,WAAa,EACR,EAOT,YAAsB,EAAG,EAAG,CAC1B,GAAyB,GAAM,GAAY,EAAG,IAC9C,SAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,GACR,EAAO,GAAY,EAAG,EAAI,KAAO,GAM1C,WAAuB,EAAG,CACxB,EAAE,WAAa,GAAI,WAAU,MAC7B,EAAE,cAAgB,EAClB,EAAE,YAAc,GAAI,YAAW,MAC/B,EAAE,UAAY,GACd,EAAE,WAAa,KACf,EAAE,mBAAqB,EACvB,EAAQ,GAMV,WAAiB,EAAG,CAClB,AAAI,EAAE,WAAa,MACjB,GAAgB,GAElB,GAAY,EAAG,GACf,EAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,GACf,EAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,GAMjB,WAAgB,EAAG,CACjB,AAAI,EAAE,WAAa,IACjB,EAAQ,GAOZ,WAA4B,EAAG,CAC7B,GAAyB,GAAW,GAAK,EAAE,UAAa,EACxD,GAAI,GAAW,GAET,AADmC,GAAY,EAAG,IACnC,EACjB,KAAM,yBAQZ,YAAuB,EAAG,CACxB,GAAyB,GAAQ,KACjC,MAAI,GAAE,oBAAsB,GAC1B,GAAS,EAAE,UAAY,GAAM,GAExB,EAAQ,EAAE,WASnB,YAAsB,EAAG,EAAM,EAAQ,EAAQ,CAC7C,GAAK,GAAE,UAAY,IAAM,EACvB,KAAM,sBAER,KAAO,EAAE,WAAa,IAAM,GAAU,GACpC,EAAK,KAAY,EAAE,gBAAkB,EAAE,UACvC,EAAE,WAAa,EACf,IAEF,GAAI,GAAU,EACZ,OAEF,GAAyB,GAAc,GAAI,GAAc,GAAI,GAAU,GACvE,GAAI,EAAc,EAAG,CACnB,GAAyB,GAAa,EAAE,YAAc,EAC7B,EAAQ,GAAe,EAChD,EAAK,IAAI,EAAE,WAAW,SAAS,EAAY,EAAa,GAAQ,GAChE,GAAU,EACV,GAAU,EACV,EAAE,YAAc,EAElB,GAAI,GAAU,EAGd,IAAI,GAAc,GAAK,EAAG,CAKxB,IAJI,EAAE,WAAa,IACjB,GAAE,cAAiB,EAAE,YAAY,EAAE,eAAiB,GAAO,EAAE,gBAAkB,GAC/E,EAAE,WAAa,IAEV,GAAU,GACf,EAAK,KAAY,EAAE,gBAAkB,EAAE,UACvC,EAAE,WAAa,EACf,IAEF,GAAY,EAAG,GACf,OAEF,KAAO,EAAS,GAAG,CACjB,GAAyB,GAAM,GAAU,EAAE,MAAO,EAAM,EAAQ,GAChE,GAAI,GAAO,GACT,KAAM,0BAER,GAAU,EACV,GAAU,IAQd,YAAwB,EAAG,EAAS,CAClC,GAA6B,GAAa,EAAE,WACnB,EAAU,GAAW,EAChB,EAAc,EAAE,YAC9C,OAA8B,GAAI,EAAG,EAAI,EAAS,EAAE,EAClD,EAAY,GAAM,EAAW,EAAI,GAAK,IAAU,GAAW,EAAI,EAAI,GAAK,MAAS,EAKrF,GAAI,IAAS,GAAI,YAAW,MAO5B,YAA2B,EAAQ,EAAK,EAAK,CAC3C,OAA8B,GAAI,EAAG,EAAI,IAAK,EAAE,EAC9C,EAAO,GAAK,EAAI,GAChB,EAAO,IAAM,GAAK,GAAK,EACvB,EAAO,KAAO,GAAK,EAAK,IAAK,GAE/B,OAA8B,GAAI,EAAG,EAAI,IAAK,EAAE,EAC9C,EAAO,KAAO,GAAK,EAAK,GAAI,WAAW,GAAK,IAE9C,OAA8B,GAAI,EAAG,EAAI,GAAI,EAAE,EAC7C,EAAO,KAAO,GAAK,EAAI,EACvB,EAAO,KAAO,GAAK,EAAK,GAAI,GAE9B,GAAyB,GAAS,KAClC,OAA8B,GAAI,EAAG,EAAI,GAAI,EAAE,EAAG,CAChD,GAAyB,GAAQ,EAAI,EACZ,EAAM,EAAI,WAAW,GAAK,GACnD,OAA8B,IAAI,EAAG,GAAI,EAAK,EAAE,GAC9C,EAAO,KAAY,EAGvB,OAA8B,GAAI,EAAG,EAAI,GAAI,EAAE,EAC7C,EAAO,KAAO,GAAK,EACnB,EAAO,KAAO,GAAK,EAErB,EAAO,MAAQ,EACf,EAAO,MAAQ,EACf,OAA8B,GAAI,EAAG,EAAI,IAAK,EAAE,EAC9C,EAAO,KAAO,GAAK,EAAO,KAAO,IAAM,EAIzC,GACE,GACA,mIACA,0BAQJ,aAAiB,CAEf,KAAK,WAAa,GAAI,WAAU,GAEhC,KAAK,aAAe,GAAI,WAAU,GAElC,KAAK,WAAa,GAAI,WAAU,GAEhC,KAAK,eAAiB,GAAI,WAAU,GAEpC,KAAK,cAAgB,GAAI,WAAU,GAEnC,KAAK,OAAS,GAAI,WAAU,GAE5B,KAAK,WAAa,GAAI,WAAU,GAEhC,KAAK,YAAc,GAAI,YAAW,GAElC,KAAK,UAAY,GAAI,YAAW,GAEhC,KAAK,MAAQ,GAAI,YAAW,GAE5B,KAAK,WAAa,GAAI,YAAW,GAEjC,KAAK,iBAAmB,GAAI,YAAW,GAEvC,KAAK,iBAAmB,GAAI,YAAW,GAEvC,KAAK,kBAAoB,GAAI,YAAW,GAExC,KAAK,WAAa,GAAI,YAAW,GAEjC,KAAK,aAAe,EAEpB,KAAK,iBAAmB,EAExB,KAAK,cAAgB,EAErB,KAAK,UAAY,EAEjB,KAAK,WAAa,EAElB,KAAK,UAAY,EAEjB,KAAK,mBAAqB,EAE1B,KAAK,gBAAkB,EAEvB,KAAK,SAAW,EAEhB,KAAK,eAAiB,EAEtB,KAAK,WAAa,EAElB,KAAK,mBAAqB,EAE1B,KAAK,qBAAuB,EAE5B,KAAK,mBAAqB,EAE1B,KAAK,qBAAuB,EAE5B,KAAK,oBAAsB,EAE3B,KAAK,sBAAwB,EAE7B,KAAK,IAAM,EAEX,KAAK,YAAc,EAEnB,KAAK,UAAY,EAEjB,KAAK,sBAAwB,EAE7B,KAAK,eAAiB,EAEtB,KAAK,eAAiB,EAEtB,KAAK,EAAI,EAET,KAAK,aAAe,EAEpB,KAAK,gBAAkB,EAEvB,KAAK,oBAAsB,EAE3B,KAAK,qBAAuB,EAE5B,KAAK,qBAAuB,EAE5B,KAAK,aAAe,EAEpB,KAAK,uBAAyB,EAE9B,KAAK,oBAAsB,EAE3B,KAAK,SAAW,EAEhB,KAAK,WAAa,EAElB,KAAK,oBAAsB,EAE3B,KAAK,kBAAoB,EAEzB,KAAK,eAAiB,EAEtB,KAAK,kBAAoB,EAEzB,KAAK,aAAe,EAEpB,KAAK,aAAe,EAEpB,KAAK,WAAa,EAElB,KAAK,uBAAyB,EAE9B,KAAK,qBAAuB,EAE5B,KAAK,QAAU,EAEf,KAAK,cAAgB,EAErB,KAAK,YAAc,EAEnB,KAAK,YAAc,EAEnB,KAAK,UAAY,EAEjB,KAAK,WAAa,EAElB,KAAK,WAAa,EAElB,KAAK,WAAa,EAElB,KAAK,SAAW,GAAI,OAAM,GAE1B,KAAK,eAAiB,GAAI,YAAW,GAErC,KAAK,YAAc,EAEnB,KAAK,WAAa,GAAI,WAAU,GAEhC,KAAK,MAAQ,KACb,KAAK,WAAa,GAAI,WAAU,GAChC,KAAK,MAAQ,GAAI,YAAW,IAC5B,KAAK,MAAM,GAAK,GAChB,KAAK,MAAM,GAAK,GAChB,KAAK,MAAM,GAAK,GAChB,KAAK,MAAM,GAAK,EAIlB,GAAI,IAAO,KAEP,GAAU,GAAI,YAAW,IAEzB,GAAW,GAAI,YAAW,IAM9B,YAAiB,EAAS,EAAa,CACrC,GAAI,GAAS,IAAY,GAAK,GAAW,IAAY,EACnD,KAAM,iDAER,GAAI,EAAY,OAAS,GACvB,KAAM,mCAAqC,GAE7C,OAA8B,GAAI,EAAG,EAAI,EAAG,EAAE,EAC5C,GAAI,EAAY,IAAM,EACpB,KAAM,SAAW,EAAI,aAGzB,GAA8B,GAAoB,GACpB,EAAqB,GACnD,EAAmB,IAAI,EAAY,SAAS,EAAG,EAAI,EAAY,QAAS,GACxE,GAAyB,GAAM,EACN,EAAQ,EAAQ,OACzC,OAA8B,GAAI,EAAG,EAAI,EAAY,OAAQ,EAAE,EAAG,CAChE,EAAkB,GAAK,EACvB,GAAyB,IAAO,EAAmB,GACnD,GAAI,IAAQ,EAAG,CACb,GAAI,IAAQ,GACV,KAAM,0CAGR,GADA,GAAO,GAAK,GACR,GAAO,GAAK,EAAM,EACpB,KAAM,yCAIZ,OAA8B,GAAI,EAAY,OAAQ,EAAI,GAAI,EAAE,EAC9D,EAAkB,GAAK,EAEzB,GAAI,GAAO,EACT,KAAM,yCAER,GAAO,EAYT,YAA8B,EAAY,EAAO,EAAO,EAAU,EAAU,EAAc,CACxF,GAA6B,GAAO,GAAe,EAAQ,GAC3D,GAAI,EAAK,QAAU,EAAW,OAC5B,KAAM,8BAER,GAAyB,IAAS,EACT,GAAI,EAAS,OACtC,OAA8B,IAAI,EAAG,GAAI,GAAG,IAAK,EAAG,CAClD,GAAyB,IAAO,EAAS,WAAW,IAAK,GAChC,GAAO,EAAS,WAAW,GAAI,GAAK,GAC7D,OAA8B,IAAI,EAAG,GAAI,GAAM,EAAE,GAC/C,EAAK,KAAW,EAChB,KAEF,OAA8B,IAAI,EAAG,GAAI,GAAM,EAAE,GAC/C,EAAK,KAAW,IAChB,KAGJ,OAA8B,IAAI,EAAG,GAAI,EAAa,OAAQ,EAAE,GAC9D,EAAS,IAAK,EAAa,WAAW,IAAK,GAE7C,EAAW,IAAI,GAEjB,CACE,GAA6B,GAAiB,GAAI,WAAU,QAC9B,EAAqB,GAAI,YAAW,IAClE,GACE,EACA,q27DACA,ik8DACA,uxBACA,EACA,6BAEF,GAAW,GACX,GAAQ,GAAiB,GAAiB,GAU5C,YAAa,EAAG,EAAG,CACjB,MAAO,IAAK,EAAI,EAAI,EAWtB,YAAmB,EAAK,EAAQ,EAAK,EAAO,EAAK,CAC/C,EAAI,IAAI,EAAI,MAAM,EAAO,GAAM,GAUjC,YAAmB,EAAK,EAAK,EAAQ,EAAQ,CAC3C,GAAI,GAAO,KAAM,MAAO,GACxB,GAAkB,GAAM,GAAI,EAAI,OAAS,EAAQ,EAAI,KAAK,QACxC,EAAY,EAAM,EAAI,OACxC,SAAI,IAAI,EAAI,KAAK,SAAS,EAAI,OAAQ,GAAM,GAC5C,EAAI,QAAU,EACP,EAOT,YAAoB,EAAK,CACvB,MAAO,GAOT,YAA0B,EAAK,CAC7B,MAAO,GAOT,YAAoB,EAAK,CACvB,MAAO,GAOT,YAAkB,EAAK,CACrB,MAAO,GAOT,YAAoB,EAAQ,EAQ5B,YAAwB,EAAK,CAC3B,GAAmB,GAAI,EAAI,OACL,EAAS,GAAI,WAAU,GAC7C,OAAwB,GAAI,EAAG,EAAI,EAAG,EAAE,EACtC,EAAO,GAAK,EAAI,WAAW,GAE7B,MAAO,GAQT,YAAgB,EAAO,EAAS,CAC9B,GAAkB,GAAI,GAAI,IAE1B,GADA,EAAU,EAAG,GAAI,GAAY,IACzB,EAAS,CACX,GAAI,IAA6C,EAAQ,iBACzD,AAAI,IAAkB,EAAsB,EAAG,IAEjD,GAAmB,GAAc,EACH,EAAS,GACvC,OAAa,CACX,GAAsB,IAAQ,GAAI,WAAU,OAQ5C,GAPA,EAAO,KAAK,IACZ,EAAE,OAAS,GACX,EAAE,aAAe,EACjB,EAAE,aAAe,MACjB,EAAE,WAAa,EACf,GAAW,GACX,GAAe,EAAE,WACb,EAAE,WAAa,MAAO,MAE5B,GAAM,GACN,GAAsB,GAAS,GAAI,WAAU,GAC1B,EAAS,EAC5B,OAAwB,IAAI,EAAG,GAAI,EAAO,OAAQ,EAAE,GAAG,CACrD,GAAsB,IAAQ,EAAO,IAElB,GAAM,AADA,GAAI,EAAa,EAAS,OACpB,EAC/B,AAAI,GAAM,MACR,EAAO,IAAI,GAAM,SAAS,EAAG,IAAM,GAEnC,EAAO,IAAI,GAAO,GAEpB,GAAU,GAEZ,MAAO,GAGT,MAAO,KAME,GAAe,KCj4E1B,OAAiB,SAYjB,GAAM,IAAyB,CAC7B,OAAQ,CACN,KAAM,EACN,QAAS,EACT,MAAO,KAIP,GAKG,gBAAgC,GAAY,CAOjD,YAAY,EAAmC,CAC7C,MAAM,GAPC,UAAe,SACf,gBAAa,CAAC,MACd,sBAAmB,CAAC,MACpB,iBAAc,GAKrB,KAAK,QAAU,OAOX,UAAyB,CAC7B,GAAS,IAAU,KAAK,SAAS,SAAS,OACrC,IAEH,QAAQ,KAAK,GAAG,KAAK,mCAInB,UAAS,EAA0C,CAEvD,GAAI,CAAC,IAAa,KAAK,QAAQ,QAAQ,QAAS,CAC9C,GAAM,GAAS,KAAM,IAAW,WAAK,gBAAgB,GACrD,MAAO,IAAc,GAEvB,MAAO,MAAK,aAAa,GAG3B,aAAa,EAAiC,CAE5C,GAAI,CAAC,IAAa,KAAK,QAAQ,QAAQ,QAAS,CAC9C,GAAM,GAAS,WAAK,mBAAmB,GACvC,MAAO,IAAc,GAEvB,GAAM,GAAgB,IAAI,GAAuB,UAAW,KAAK,SAAS,QACpE,EAAa,GAAI,YAAW,GAElC,GAAI,CAAC,GACH,KAAM,IAAI,OAAM,mDAKlB,MAAO,AADa,IAAO,SAAS,EAAY,GAC7B,YAGf,YAAW,EAA0C,CAEzD,GAAI,CAAC,IAAa,KAAK,QAAQ,QAAQ,QAAS,CAC9C,GAAM,GAAS,KAAM,IAAW,WAAK,kBAAkB,GACvD,MAAO,IAAc,GAEvB,MAAO,MAAK,eAAe,GAG7B,eAAe,EAAiC,CAE9C,GAAI,CAAC,IAAa,KAAK,QAAQ,QAAQ,QAAS,CAC9C,GAAM,GAAS,WAAK,qBAAqB,GACzC,MAAO,IAAc,GAGvB,GAAM,GAAgB,IAAI,GAAuB,UAAW,KAAK,SAAS,QACpE,EAAa,GAAI,YAAW,GAElC,MAAI,IAGK,AADa,GAAO,WAAW,EAAY,GAC/B,OAGd,AADa,GAAa,EAAY,QAC1B,SCzGvB,OAAmC,SAK5B,gBAAgC,GAAY,CAOjD,YAAY,EAA8B,CACxC,MAAM,GAPC,UAAe,SACf,gBAAa,GACb,sBAAmB,GACnB,iBAAc,GAKrB,KAAK,QAAU,GAAW,GAG5B,aAAa,EAAiC,CAE5C,MAAO,gBAAS,GAGlB,eAAe,EAAiC,CAE9C,MAAO,kBAAW,KCCtB,GAAM,IAAmB,UAErB,GAKG,gBAA6B,GAAY,CAO9C,YAAY,EAA6B,CACvC,MAAM,GAPC,UAAe,MACf,gBAAa,CAAC,OACd,sBAAmB,CAAC,SACpB,iBAAc,GAQrB,GAHA,KAAK,QAAU,EAEf,GAAQ,IAAS,KAAK,SAAS,SAAS,MACpC,CAAC,GACH,KAAM,IAAI,OAAM,KAAK,MAIzB,aAAa,EAAiC,CAC5C,GAAM,GAAa,GAAI,YAAW,GAClC,MAAO,IAAM,SAAS,GAAY,OASpC,eAAe,EAAmB,EAA+B,CAC/D,GAAI,CACF,GAAM,GAAsB,KAAK,iBAAiB,GAC5C,EAAa,GAAI,YAAW,GAElC,GAAI,EACF,MAAO,IAAM,WAAW,EAAY,GAAS,OAG/C,GAAI,CAAC,EAAS,CACZ,GAAM,GAAQ,GAAI,OAAM,2BACxB,KAAM,MAAK,aAAa,GAG1B,GAAI,GAAe,GAAI,YAAW,GAC5B,EAAmB,KAAK,YAAY,EAAY,GACtD,SAAe,EAAa,MAAM,EAAG,GAE9B,GAAc,SACd,EAAP,CACA,KAAM,MAAK,aAAa,IAa5B,YACE,EACA,EACA,EACA,EACQ,CACR,EAAa,GAAc,EAC3B,EAAW,GAAY,EAAK,OAAS,EAErC,GAAI,GAAmB,EAEvB,OAAS,GAAQ,EAAY,EAAQ,GAAY,CAC/C,GAAM,GAAQ,EAAK,KAGf,EAAiB,GAAS,EAE9B,GAAI,EAAiB,EAAG,CAEtB,GAAI,GAAS,EAAiB,IAE9B,KAAO,IAAW,KAChB,EAAS,EAAK,KACd,GAAkB,EAIpB,GAAM,GAAM,EAAQ,EAEpB,KAAO,EAAQ,GACb,EAAO,KAAsB,EAAK,KAIpC,GAAI,IAAU,EACZ,MAAO,GAMX,GAAM,GAAS,EAAK,KAAY,EAAK,MAAY,EAGjD,GAAI,IAAW,GAAK,EAAS,EAC3B,MAAO,CAAE,GAAQ,GAInB,GAAI,GAAc,EAAQ,GACtB,EAAS,EAAc,IAE3B,KAAO,IAAW,KAChB,EAAS,EAAK,KACd,GAAe,EAIjB,GAAI,GAAM,EAAmB,EACvB,EAAM,EAAmB,EAAc,EAE7C,KAAO,EAAmB,GACxB,EAAO,KAAsB,EAAO,KAIxC,MAAO,GAOT,iBAAiB,EAA4B,CAE3C,MAAO,AADO,IAAI,aAAY,EAAK,MAAM,EAAG,IAC/B,KAAO,KCtKxB,GAAI,IACA,GAKG,gBAA8B,GAAY,CAW/C,YAAY,EAA6B,CACvC,MAAM,GAXC,UAAe,OACf,gBAAa,GACb,sBAAmB,GACnB,iBAAc,GASrB,KAAK,QAAU,EAEf,GAAY,KAAK,SAAS,UAAU,cAC/B,IAEH,QAAQ,KAAK,GAAG,KAAK,mCAInB,UAAyB,CAC7B,AAAI,CAAC,IAAQ,IACX,IAAO,KAAM,IAAI,SAAQ,AAAC,GAAY,GAAU,IAAI,AAAC,GAAS,EAAQ,MAI1E,aAAa,EAAiC,CAC5C,GAAM,GAAa,GAAI,IAAK,OACtB,EAAa,GAAI,YAAW,GAClC,MAAO,GAAW,SAAS,GAAY,OAGzC,eAAe,EAAiC,CAC9C,GAAM,GAAa,GAAI,IAAK,OAGtB,EAAa,GAAI,YAAW,GAClC,MAAO,GAAW,WAAW,GAAY,SCf7C,OAAkB,SAjBlB,YAAkB,EAAkC,CAClD,MAAO,QAAO,KAAK,GAGrB,YAAuB,EAA6B,CAElD,MAAI,QAAO,SAAS,GAEX,AADY,GAAI,YAAW,EAAO,OAAQ,EAAO,WAAY,EAAO,QACzD,QAAQ,OAErB,EAYT,GAAM,IAAU,CAQd,kBASW,GAAuE,CAClF,aAAc,GAAI,IAClB,KAAM,GAAI,IACV,OAAQ,GAAI,IACZ,OAAQ,GAAI,IAAkB,CAAC,aAE/B,IAAK,GAAI,IAAe,CAAC,aACzB,QAAS,GAAI,IAAe,CAAC,aAG7B,KAAM,GAAI,IAAgB,CAAC,cA4B7B,kBACE,EACA,EACA,EACiB,CACjB,GAAM,GAAc,GAA4B,GAChD,GAAI,CAAC,EACH,KAAM,IAAI,OAAM,wCAAwC,KAE1D,GAAM,GAAmB,GAAc,GACjC,EAAwB,KAAM,GAAY,WAAW,EAAkB,GAC7E,MAAO,IAAS,8TCxGlB,GAAA,IAAqB,GACrB,GAAsB,GACtB,GAAwB,GAEpB,GAAS,GACT,GAAY,GACZ,GAAM,MAAO,aAAe,YAAc,WAAa,MAEvD,GAAO,mEACX,IAAS,GAAI,EAAG,GAAM,GAAK,OAAQ,GAAI,GAAK,EAAE,GAC5C,GAAO,IAAK,GAAK,IACjB,GAAU,GAAK,WAAW,KAAM,GAFzB,OAAO,GAOhB,GAAU,IAAI,WAAW,IAAM,GAC/B,GAAU,IAAI,WAAW,IAAM,GAE/B,YAAkB,EAAK,CACrB,GAAI,GAAM,EAAI,OAEd,GAAI,EAAM,EAAI,EACZ,KAAM,IAAI,OAAM,kDAKlB,GAAI,GAAW,EAAI,QAAQ,KAC3B,AAAI,IAAa,IAAI,GAAW,GAEhC,GAAI,GAAkB,IAAa,EAC/B,EACA,EAAK,EAAW,EAEpB,MAAO,CAAC,EAAU,GAIpB,YAAqB,EAAK,CACxB,GAAI,GAAO,GAAQ,GACf,EAAW,EAAK,GAChB,EAAkB,EAAK,GAC3B,MAAS,GAAW,GAAmB,EAAI,EAAK,EAGlD,YAAsB,EAAK,EAAU,EAAiB,CACpD,MAAS,GAAW,GAAmB,EAAI,EAAK,EAGlD,YAAsB,EAAK,CACzB,GAAI,GACA,EAAO,GAAQ,GACf,EAAW,EAAK,GAChB,EAAkB,EAAK,GAEvB,EAAM,GAAI,IAAI,GAAY,EAAK,EAAU,IAEzC,EAAU,EAGV,EAAM,EAAkB,EACxB,EAAW,EACX,EAEA,EACJ,IAAK,EAAI,EAAG,EAAI,EAAK,GAAK,EACxB,EACG,GAAU,EAAI,WAAW,KAAO,GAChC,GAAU,EAAI,WAAW,EAAI,KAAO,GACpC,GAAU,EAAI,WAAW,EAAI,KAAO,EACrC,GAAU,EAAI,WAAW,EAAI,IAC/B,EAAI,KAAc,GAAO,GAAM,IAC/B,EAAI,KAAc,GAAO,EAAK,IAC9B,EAAI,KAAa,EAAM,IAGzB,MAAI,KAAoB,GACtB,GACG,GAAU,EAAI,WAAW,KAAO,EAChC,GAAU,EAAI,WAAW,EAAI,KAAO,EACvC,EAAI,KAAa,EAAM,KAGrB,IAAoB,GACtB,GACG,GAAU,EAAI,WAAW,KAAO,GAChC,GAAU,EAAI,WAAW,EAAI,KAAO,EACpC,GAAU,EAAI,WAAW,EAAI,KAAO,EACvC,EAAI,KAAc,GAAO,EAAK,IAC9B,EAAI,KAAa,EAAM,KAGlB,EAGT,YAA0B,EAAK,CAC7B,MAAO,IAAO,GAAO,GAAK,IACxB,GAAO,GAAO,GAAK,IACnB,GAAO,GAAO,EAAI,IAClB,GAAO,EAAM,IAGjB,YAAsB,EAAO,EAAO,EAAK,CAGvC,OAFI,GACA,EAAS,GACJ,EAAI,EAAO,EAAI,EAAK,GAAK,EAChC,EACI,GAAM,IAAM,GAAM,UAClB,GAAM,EAAI,IAAM,EAAK,OACtB,GAAM,EAAI,GAAK,KAClB,EAAO,KAAK,GAAgB,IAE9B,MAAO,GAAO,KAAK,IAGrB,YAAwB,EAAO,CAQ7B,OAPI,GACA,EAAM,EAAM,OACZ,EAAa,EAAM,EACnB,EAAQ,GACR,EAAiB,MAGZ,EAAI,EAAG,EAAO,EAAM,EAAY,EAAI,EAAM,GAAK,EACtD,EAAM,KAAK,GACT,EAAO,EAAI,EAAI,EAAkB,EAAO,EAAQ,EAAI,IAKxD,MAAI,KAAe,EACjB,GAAM,EAAM,EAAM,GAClB,EAAM,KACJ,GAAO,GAAO,GACd,GAAQ,GAAO,EAAK,IACpB,OAEO,IAAe,GACxB,GAAO,GAAM,EAAM,IAAM,GAAK,EAAM,EAAM,GAC1C,EAAM,KACJ,GAAO,GAAO,IACd,GAAQ,GAAO,EAAK,IACpB,GAAQ,GAAO,EAAK,IACpB,MAIG,EAAM,KAAK,2DCtJpB,GAAe,SAAU,EAAQ,EAAQ,EAAM,EAAM,EAAQ,CAC3D,GAAI,GAAG,EACH,EAAQ,EAAS,EAAK,EAAO,EAC7B,EAAQ,IAAK,GAAQ,EACrB,EAAQ,GAAQ,EAChB,EAAQ,GACR,EAAI,EAAQ,EAAS,EAAK,EAC1B,EAAI,EAAO,GAAK,EAChB,EAAI,EAAO,EAAS,GAOxB,IALA,GAAK,EAEL,EAAI,EAAM,IAAM,CAAC,GAAU,EAC3B,IAAO,CAAC,EACR,GAAS,EACF,EAAQ,EAAG,EAAK,EAAI,IAAO,EAAO,EAAS,GAAI,GAAK,EAAG,GAAS,EAAG,CAK1E,IAHA,EAAI,EAAM,IAAM,CAAC,GAAU,EAC3B,IAAO,CAAC,EACR,GAAS,EACF,EAAQ,EAAG,EAAK,EAAI,IAAO,EAAO,EAAS,GAAI,GAAK,EAAG,GAAS,EAAG,CAE1E,GAAI,IAAM,EACR,EAAI,EAAI,MACH,IAAI,IAAM,EACf,MAAO,GAAI,IAAQ,GAAI,GAAK,GAAK,MAEjC,EAAI,EAAI,KAAK,IAAI,EAAG,GACpB,EAAI,EAAI,EAEV,MAAQ,GAAI,GAAK,GAAK,EAAI,KAAK,IAAI,EAAG,EAAI,IAG5C,GAAgB,SAAU,EAAQ,EAAO,EAAQ,EAAM,EAAM,EAAQ,CACnE,GAAI,GAAG,EAAG,EACN,EAAQ,EAAS,EAAK,EAAO,EAC7B,EAAQ,IAAK,GAAQ,EACrB,EAAQ,GAAQ,EAChB,EAAM,IAAS,GAAK,KAAK,IAAI,EAAG,KAAO,KAAK,IAAI,EAAG,KAAO,EAC1D,EAAI,EAAO,EAAK,EAAS,EACzB,EAAI,EAAO,EAAI,GACf,EAAI,EAAQ,GAAM,IAAU,GAAK,EAAI,EAAQ,EAAK,EAAI,EAmC1D,IAjCA,EAAQ,KAAK,IAAI,GAEjB,AAAI,MAAM,IAAU,IAAU,IAC5B,GAAI,MAAM,GAAS,EAAI,EACvB,EAAI,GAEJ,GAAI,KAAK,MAAM,KAAK,IAAI,GAAS,KAAK,KAClC,EAAS,GAAI,KAAK,IAAI,EAAG,CAAC,IAAM,GAClC,KACA,GAAK,GAEP,AAAI,EAAI,GAAS,EACf,GAAS,EAAK,EAEd,GAAS,EAAK,KAAK,IAAI,EAAG,EAAI,GAE5B,EAAQ,GAAK,GACf,KACA,GAAK,GAGP,AAAI,EAAI,GAAS,EACf,GAAI,EACJ,EAAI,GACC,AAAI,EAAI,GAAS,EACtB,GAAM,GAAQ,EAAK,GAAK,KAAK,IAAI,EAAG,GACpC,EAAI,EAAI,GAER,GAAI,EAAQ,KAAK,IAAI,EAAG,EAAQ,GAAK,KAAK,IAAI,EAAG,GACjD,EAAI,IAID,GAAQ,EAAG,EAAO,EAAS,GAAK,EAAI,IAAM,GAAK,EAAG,GAAK,IAAK,GAAQ,EAAG,CAI9E,IAFA,EAAK,GAAK,EAAQ,EAClB,GAAQ,EACD,EAAO,EAAG,EAAO,EAAS,GAAK,EAAI,IAAM,GAAK,EAAG,GAAK,IAAK,GAAQ,EAAG,CAE7E,EAAO,EAAS,EAAI,IAAM,EAAI,+CCtEhC,GAAI,GACD,MAAO,SAAW,YAAc,MAAO,QAAM,KAAS,WACnD,OAAM,IAAK,8BACX,KAEN,EAAA,OAAiB,EACjB,EAAA,WAAqB,EACrB,EAAA,kBAA4B,GAE5B,GAAI,GAAe,WACnB,EAAA,WAAqB,EAgBrB,EAAO,oBAAsB,IAEzB,CAAC,EAAO,qBAAuB,MAAO,UAAY,aAClD,MAAO,SAAQ,OAAU,YAC3B,QAAQ,MACN,iJAKJ,YAA8B,CAE5B,GAAI,CACF,GAAI,GAAM,GAAI,YAAW,GACrB,EAAQ,CAAE,IAAK,UAAY,CAAE,MAAO,MACxC,cAAO,eAAe,EAAO,WAAW,WACxC,OAAO,eAAe,EAAK,GACpB,EAAI,QAAU,QACrB,CACA,MAAO,IAIX,OAAO,eAAe,EAAO,UAAW,SAAU,CAChD,WAAY,GACZ,IAAK,UAAY,CACf,GAAI,EAAC,EAAO,SAAS,MACrB,MAAO,MAAK,UAIhB,OAAO,eAAe,EAAO,UAAW,SAAU,CAChD,WAAY,GACZ,IAAK,UAAY,CACf,GAAI,EAAC,EAAO,SAAS,MACrB,MAAO,MAAK,cAIhB,WAAuB,EAAQ,CAC7B,GAAI,EAAS,EACX,KAAM,IAAI,YAAW,cAAgB,EAAS,kCAGhD,GAAI,GAAM,GAAI,YAAW,GACzB,cAAO,eAAe,EAAK,EAAO,WAC3B,EAaT,WAAiB,EAAK,EAAkB,EAAQ,CAE9C,GAAI,MAAO,IAAQ,SAAU,CAC3B,GAAI,MAAO,IAAqB,SAC9B,KAAM,IAAI,WACR,sEAGJ,MAAO,GAAY,GAErB,MAAO,GAAK,EAAK,EAAkB,GAGrC,EAAO,SAAW,KAElB,WAAe,EAAO,EAAkB,EAAQ,CAC9C,GAAI,MAAO,IAAU,SACnB,MAAO,GAAW,EAAO,GAG3B,GAAI,YAAY,OAAO,GACrB,MAAO,GAAc,GAGvB,GAAI,GAAS,KACX,KAAM,IAAI,WACR,kHAAA,aAAA,OACiD,IASrD,GALI,GAAW,EAAO,cACjB,GAAS,GAAW,EAAM,OAAQ,cAInC,MAAO,oBAAsB,aAC5B,IAAW,EAAO,oBAClB,GAAS,GAAW,EAAM,OAAQ,oBACrC,MAAO,GAAgB,EAAO,EAAkB,GAGlD,GAAI,MAAO,IAAU,SACnB,KAAM,IAAI,WACR,yEAIJ,GAAI,GAAU,EAAM,SAAW,EAAM,UACrC,GAAI,GAAW,MAAQ,IAAY,EACjC,MAAO,GAAO,KAAK,EAAS,EAAkB,GAGhD,GAAI,GAAI,EAAW,GACnB,GAAI,EAAG,MAAO,GAEd,GAAI,MAAO,SAAW,aAAe,OAAO,aAAe,MACvD,MAAO,GAAM,OAAO,cAAiB,WACvC,MAAO,GAAO,KACZ,EAAM,OAAO,aAAa,UAAW,EAAkB,GAI3D,KAAM,IAAI,WACR,kHAAA,aAAA,OACiD,IAYrD,EAAO,KAAO,SAAU,EAAO,EAAkB,EAAQ,CACvD,MAAO,GAAK,EAAO,EAAkB,IAKvC,OAAO,eAAe,EAAO,UAAW,WAAW,WACnD,OAAO,eAAe,EAAQ,YAE9B,WAAqB,EAAM,CACzB,GAAI,MAAO,IAAS,SAClB,KAAM,IAAI,WAAU,0CACf,GAAI,EAAO,EAChB,KAAM,IAAI,YAAW,cAAgB,EAAO,kCAIhD,WAAgB,EAAM,EAAM,EAAU,CAEpC,MADA,GAAW,GACP,GAAQ,EACH,EAAa,GAElB,IAAS,OAIJ,MAAO,IAAa,SACvB,EAAa,GAAM,KAAK,EAAM,GAC9B,EAAa,GAAM,KAAK,GAEvB,EAAa,GAOtB,EAAO,MAAQ,SAAU,EAAM,EAAM,EAAU,CAC7C,MAAO,GAAM,EAAM,EAAM,IAG3B,WAAsB,EAAM,CAC1B,SAAW,GACJ,EAAa,EAAO,EAAI,EAAI,EAAQ,GAAQ,GAMrD,EAAO,YAAc,SAAU,EAAM,CACnC,MAAO,GAAY,IAKrB,EAAO,gBAAkB,SAAU,EAAM,CACvC,MAAO,GAAY,IAGrB,WAAqB,EAAQ,EAAU,CAKrC,GAJI,OAAO,IAAa,UAAY,IAAa,KAC/C,GAAW,QAGT,CAAC,EAAO,WAAW,GACrB,KAAM,IAAI,WAAU,qBAAuB,GAG7C,GAAI,GAAS,EAAW,EAAQ,GAAY,EACxC,EAAM,EAAa,GAEnB,EAAS,EAAI,MAAM,EAAQ,GAE/B,MAAI,KAAW,GAIb,GAAM,EAAI,MAAM,EAAG,IAGd,EAGT,WAAwB,EAAO,CAG7B,OAFI,GAAS,EAAM,OAAS,EAAI,EAAI,EAAQ,EAAM,QAAU,EACxD,EAAM,EAAa,GACd,EAAI,EAAG,EAAI,EAAQ,GAAK,EAC/B,EAAI,GAAK,EAAM,GAAK,IAEtB,MAAO,GAGT,WAA0B,EAAO,EAAY,EAAQ,CACnD,GAAI,EAAa,GAAK,EAAM,WAAa,EACvC,KAAM,IAAI,YAAW,wCAGvB,GAAI,EAAM,WAAa,EAAc,IAAU,GAC7C,KAAM,IAAI,YAAW,wCAGvB,GAAI,GACJ,MAAI,KAAe,QAAa,IAAW,OACzC,EAAM,GAAI,YAAW,GAChB,AAAI,IAAW,OACpB,EAAM,GAAI,YAAW,EAAO,GAE5B,EAAM,GAAI,YAAW,EAAO,EAAY,GAI1C,OAAO,eAAe,EAAK,EAAO,WAE3B,EAGT,WAAqB,EAAK,CACxB,GAAI,EAAO,SAAS,GAAM,CACxB,GAAI,GAAM,EAAQ,EAAI,QAAU,EAC5B,EAAM,EAAa,GAEvB,MAAI,GAAI,SAAW,GAInB,EAAI,KAAK,EAAK,EAAG,EAAG,GACb,EAGT,GAAI,EAAI,SAAW,OACjB,MAAI,OAAO,GAAI,QAAW,UAAY,GAAY,EAAI,QAC7C,EAAa,GAEf,EAAc,GAGvB,GAAI,EAAI,OAAS,UAAY,MAAM,QAAQ,EAAI,MAC7C,MAAO,GAAc,EAAI,MAI7B,WAAkB,EAAQ,CAGxB,GAAI,GAAU,EACZ,KAAM,IAAI,YAAW,0DACa,EAAa,SAAS,IAAM,UAEhE,MAAO,GAAS,EAGlB,WAAqB,EAAQ,CAC3B,MAAI,CAAC,GAAU,GACb,GAAS,GAEJ,EAAO,MAAM,CAAC,GAGvB,EAAO,SAAW,SAAmB,EAAG,CACtC,MAAO,IAAK,MAAQ,EAAE,YAAc,IAClC,IAAM,EAAO,WAGjB,EAAO,QAAU,SAAkB,EAAG,EAAG,CAGvC,GAFI,GAAW,EAAG,aAAa,GAAI,EAAO,KAAK,EAAG,EAAE,OAAQ,EAAE,aAC1D,GAAW,EAAG,aAAa,GAAI,EAAO,KAAK,EAAG,EAAE,OAAQ,EAAE,aAC1D,CAAC,EAAO,SAAS,IAAM,CAAC,EAAO,SAAS,GAC1C,KAAM,IAAI,WACR,yEAIJ,GAAI,IAAM,EAAG,MAAO,GAKpB,OAHI,GAAI,EAAE,OACN,EAAI,EAAE,OAED,EAAI,EAAG,EAAM,KAAK,IAAI,EAAG,GAAI,EAAI,EAAK,EAAE,EAC/C,GAAI,EAAE,KAAO,EAAE,GAAI,CACjB,EAAI,EAAE,GACN,EAAI,EAAE,GACN,MAIJ,MAAI,GAAI,EAAU,GACd,EAAI,EAAU,EACX,GAGT,EAAO,WAAa,SAAqB,EAAU,CACjD,OAAQ,OAAO,GAAU,mBAClB,UACA,WACA,YACA,YACA,aACA,aACA,aACA,WACA,YACA,cACA,WACH,MAAO,WAEP,MAAO,KAIb,EAAO,OAAS,SAAiB,EAAM,EAAQ,CAC7C,GAAI,CAAC,MAAM,QAAQ,GACjB,KAAM,IAAI,WAAU,+CAGtB,GAAI,EAAK,SAAW,EAClB,MAAO,GAAO,MAAM,GAGtB,GAAI,GACJ,GAAI,IAAW,OAEb,IADA,EAAS,EACJ,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EAC7B,GAAU,EAAK,GAAG,OAItB,GAAI,GAAS,EAAO,YAAY,GAC5B,EAAM,EACV,IAAK,EAAI,EAAG,EAAI,EAAK,OAAQ,EAAE,EAAG,CAChC,GAAI,GAAM,EAAK,GAIf,GAHI,GAAW,EAAK,aAClB,GAAM,EAAO,KAAK,IAEhB,CAAC,EAAO,SAAS,GACnB,KAAM,IAAI,WAAU,+CAEtB,EAAI,KAAK,EAAQ,GACjB,GAAO,EAAI,OAEb,MAAO,IAGT,WAAqB,EAAQ,EAAU,CACrC,GAAI,EAAO,SAAS,GAClB,MAAO,GAAO,OAEhB,GAAI,YAAY,OAAO,IAAW,GAAW,EAAQ,aACnD,MAAO,GAAO,WAEhB,GAAI,MAAO,IAAW,SACpB,KAAM,IAAI,WACR,2FAAA,aAAA,OAC0B,IAI9B,GAAI,GAAM,EAAO,OACb,EAAa,UAAU,OAAS,GAAK,UAAU,KAAO,GAC1D,GAAI,CAAC,GAAa,IAAQ,EAAG,MAAO,GAIpC,OADI,GAAc,KAEhB,OAAQ,OACD,YACA,aACA,SACH,MAAO,OACJ,WACA,QACH,MAAO,IAAY,GAAQ,WACxB,WACA,YACA,cACA,WACH,MAAO,GAAM,MACV,MACH,MAAO,KAAQ,MACZ,SACH,MAAO,IAAc,GAAQ,eAE7B,GAAI,EACF,MAAO,GAAY,GAAK,GAAY,GAAQ,OAE9C,EAAY,IAAK,GAAU,cAC3B,EAAc,IAItB,EAAO,WAAa,EAEpB,WAAuB,EAAU,EAAO,EAAK,CAC3C,GAAI,GAAc,GA8BlB,GArBI,KAAU,QAAa,EAAQ,IACjC,GAAQ,GAIN,EAAQ,KAAK,QAIb,MAAQ,QAAa,EAAM,KAAK,SAClC,GAAM,KAAK,QAGT,GAAO,IAKX,MAAS,EACT,KAAW,EAEP,GAAO,GACT,MAAO,GAKT,IAFK,GAAU,GAAW,UAGxB,OAAQ,OACD,MACH,MAAO,GAAS,KAAM,EAAO,OAE1B,WACA,QACH,MAAO,GAAU,KAAM,EAAO,OAE3B,QACH,MAAO,GAAW,KAAM,EAAO,OAE5B,aACA,SACH,MAAO,GAAY,KAAM,EAAO,OAE7B,SACH,MAAO,GAAY,KAAM,EAAO,OAE7B,WACA,YACA,cACA,WACH,MAAO,IAAa,KAAM,EAAO,WAGjC,GAAI,EAAa,KAAM,IAAI,WAAU,qBAAuB,GAC5D,EAAY,GAAW,IAAI,cAC3B,EAAc,IAWtB,EAAO,UAAU,UAAY,GAE7B,WAAe,EAAG,EAAG,EAAG,CACtB,GAAI,GAAI,EAAE,GACV,EAAE,GAAK,EAAE,GACT,EAAE,GAAK,EAGT,EAAO,UAAU,OAAS,UAAmB,CAC3C,GAAI,GAAM,KAAK,OACf,GAAI,EAAM,GAAM,EACd,KAAM,IAAI,YAAW,6CAEvB,OAAS,GAAI,EAAG,EAAI,EAAK,GAAK,EAC5B,EAAK,KAAM,EAAG,EAAI,GAEpB,MAAO,OAGT,EAAO,UAAU,OAAS,UAAmB,CAC3C,GAAI,GAAM,KAAK,OACf,GAAI,EAAM,GAAM,EACd,KAAM,IAAI,YAAW,6CAEvB,OAAS,GAAI,EAAG,EAAI,EAAK,GAAK,EAC5B,EAAK,KAAM,EAAG,EAAI,GAClB,EAAK,KAAM,EAAI,EAAG,EAAI,GAExB,MAAO,OAGT,EAAO,UAAU,OAAS,UAAmB,CAC3C,GAAI,GAAM,KAAK,OACf,GAAI,EAAM,GAAM,EACd,KAAM,IAAI,YAAW,6CAEvB,OAAS,GAAI,EAAG,EAAI,EAAK,GAAK,EAC5B,EAAK,KAAM,EAAG,EAAI,GAClB,EAAK,KAAM,EAAI,EAAG,EAAI,GACtB,EAAK,KAAM,EAAI,EAAG,EAAI,GACtB,EAAK,KAAM,EAAI,EAAG,EAAI,GAExB,MAAO,OAGT,EAAO,UAAU,SAAW,UAAqB,CAC/C,GAAI,GAAS,KAAK,OAClB,MAAI,KAAW,EAAU,GACrB,UAAU,SAAW,EAAU,EAAU,KAAM,EAAG,GAC/C,EAAa,MAAM,KAAM,YAGlC,EAAO,UAAU,eAAiB,EAAO,UAAU,SAEnD,EAAO,UAAU,OAAS,SAAiB,EAAG,CAC5C,GAAI,CAAC,EAAO,SAAS,GAAI,KAAM,IAAI,WAAU,6BAC7C,MAAI,QAAS,EAAU,GAChB,EAAO,QAAQ,KAAM,KAAO,GAGrC,EAAO,UAAU,QAAU,UAAoB,CAC7C,GAAI,GAAM,GACN,EAAM,EAAQ,kBAClB,SAAM,KAAK,SAAS,MAAO,EAAG,GAAK,QAAQ,UAAW,OAAO,OACzD,KAAK,OAAS,GAAK,IAAO,SACvB,WAAa,EAAM,KAExB,GACF,GAAO,UAAU,GAAuB,EAAO,UAAU,SAG3D,EAAO,UAAU,QAAU,SAAkB,EAAQ,EAAO,EAAK,EAAW,EAAS,CAInF,GAHI,GAAW,EAAQ,aACrB,GAAS,EAAO,KAAK,EAAQ,EAAO,OAAQ,EAAO,aAEjD,CAAC,EAAO,SAAS,GACnB,KAAM,IAAI,WACR,iFAAA,aAAA,OAC2B,IAiB/B,GAbI,IAAU,QACZ,GAAQ,GAEN,IAAQ,QACV,GAAM,EAAS,EAAO,OAAS,GAE7B,IAAc,QAChB,GAAY,GAEV,IAAY,QACd,GAAU,KAAK,QAGb,EAAQ,GAAK,EAAM,EAAO,QAAU,EAAY,GAAK,EAAU,KAAK,OACtE,KAAM,IAAI,YAAW,sBAGvB,GAAI,GAAa,GAAW,GAAS,EACnC,MAAO,GAET,GAAI,GAAa,EACf,MAAO,GAET,GAAI,GAAS,EACX,MAAO,GAQT,GALA,KAAW,EACX,KAAS,EACT,KAAe,EACf,KAAa,EAET,OAAS,EAAQ,MAAO,GAS5B,OAPI,GAAI,EAAU,EACd,GAAI,EAAM,EACV,GAAM,KAAK,IAAI,EAAG,IAElB,GAAW,KAAK,MAAM,EAAW,GACjC,GAAa,EAAO,MAAM,EAAO,GAE5B,GAAI,EAAG,GAAI,GAAK,EAAE,GACzB,GAAI,GAAS,MAAO,GAAW,IAAI,CACjC,EAAI,GAAS,IACb,GAAI,GAAW,IACf,MAIJ,MAAI,GAAI,GAAU,GACd,GAAI,EAAU,EACX,GAYT,YAA+B,EAAQ,EAAK,EAAY,EAAU,EAAK,CAErE,GAAI,EAAO,SAAW,EAAG,MAAO,GAmBhC,GAhBA,AAAI,MAAO,IAAe,SACxB,GAAW,EACX,EAAa,GACR,AAAI,EAAa,WACtB,EAAa,WACJ,EAAa,aACtB,GAAa,aAEf,EAAa,CAAC,EACV,GAAY,IAEd,GAAa,EAAM,EAAK,EAAO,OAAS,GAItC,EAAa,GAAG,GAAa,EAAO,OAAS,GAC7C,GAAc,EAAO,OAAQ,CAC/B,GAAI,EAAK,MAAO,GACX,EAAa,EAAO,OAAS,UACzB,EAAa,EACtB,GAAI,EAAK,EAAa,MACjB,OAAO,GASd,GALI,MAAO,IAAQ,UACjB,GAAM,EAAO,KAAK,EAAK,IAIrB,EAAO,SAAS,GAElB,MAAI,GAAI,SAAW,EACV,GAEF,EAAa,EAAQ,EAAK,EAAY,EAAU,GAClD,GAAI,MAAO,IAAQ,SAExB,MADA,GAAM,EAAM,IACR,MAAO,YAAW,UAAU,SAAY,WACtC,EACK,WAAW,UAAU,QAAQ,KAAK,EAAQ,EAAK,GAE/C,WAAW,UAAU,YAAY,KAAK,EAAQ,EAAK,GAGvD,EAAa,EAAQ,CAAC,GAAM,EAAY,EAAU,GAG3D,KAAM,IAAI,WAAU,wCAGtB,WAAuB,EAAK,EAAK,EAAY,EAAU,EAAK,CAC1D,GAAI,GAAY,EACZ,EAAY,EAAI,OAChB,GAAY,EAAI,OAEpB,GAAI,IAAa,QACf,GAAW,OAAO,GAAU,cACxB,IAAa,QAAU,IAAa,SACpC,IAAa,WAAa,IAAa,YAAY,CACrD,GAAI,EAAI,OAAS,GAAK,EAAI,OAAS,EACjC,MAAO,GAET,EAAY,EACZ,GAAa,EACb,IAAa,EACb,GAAc,EAIlB,YAAe,EAAK,EAAG,CACrB,MAAI,KAAc,EACT,EAAI,GAEJ,EAAI,aAAa,EAAI,GAIhC,GAAI,IACJ,GAAI,EAAK,CACP,GAAI,IAAa,GACjB,IAAK,GAAI,EAAY,GAAI,EAAW,KAClC,GAAI,GAAK,EAAK,MAAO,GAAK,EAAK,KAAe,GAAK,EAAI,GAAI,KAEzD,GADI,KAAe,IAAI,IAAa,IAChC,GAAI,GAAa,IAAM,GAAW,MAAO,IAAa,MAE1D,AAAI,MAAe,IAAI,KAAK,GAAI,IAChC,GAAa,OAKjB,KADI,EAAa,GAAY,GAAW,GAAa,EAAY,IAC5D,GAAI,EAAY,IAAK,EAAG,KAAK,CAEhC,OADI,IAAQ,GACH,GAAI,EAAG,GAAI,GAAW,KAC7B,GAAI,GAAK,EAAK,GAAI,MAAO,GAAK,EAAK,IAAI,CACrC,GAAQ,GACR,MAGJ,GAAI,GAAO,MAAO,IAItB,MAAO,GAGT,EAAO,UAAU,SAAW,SAAmB,EAAK,EAAY,EAAU,CACxE,MAAO,MAAK,QAAQ,EAAK,EAAY,KAAc,IAGrD,EAAO,UAAU,QAAU,SAAkB,EAAK,EAAY,EAAU,CACtE,MAAO,IAAqB,KAAM,EAAK,EAAY,EAAU,KAG/D,EAAO,UAAU,YAAc,SAAsB,EAAK,EAAY,EAAU,CAC9E,MAAO,IAAqB,KAAM,EAAK,EAAY,EAAU,KAG/D,WAAmB,EAAK,EAAQ,EAAQ,EAAQ,CAC9C,EAAS,OAAO,IAAW,EAC3B,GAAI,GAAY,EAAI,OAAS,EAC7B,AAAK,EAGH,GAAS,OAAO,GACZ,EAAS,GACX,GAAS,IAJX,EAAS,EAQX,GAAI,GAAS,EAAO,OAEpB,AAAI,EAAS,EAAS,GACpB,GAAS,EAAS,GAEpB,OAAS,GAAI,EAAG,EAAI,EAAQ,EAAE,EAAG,CAC/B,GAAI,IAAS,SAAS,EAAO,OAAO,EAAI,EAAG,GAAI,IAC/C,GAAI,GAAY,IAAS,MAAO,GAChC,EAAI,EAAS,GAAK,GAEpB,MAAO,GAGT,YAAoB,EAAK,EAAQ,EAAQ,EAAQ,CAC/C,MAAO,IAAW,GAAY,EAAQ,EAAI,OAAS,GAAS,EAAK,EAAQ,GAG3E,WAAqB,EAAK,EAAQ,EAAQ,EAAQ,CAChD,MAAO,IAAW,GAAa,GAAS,EAAK,EAAQ,GAGvD,YAAsB,EAAK,EAAQ,EAAQ,EAAQ,CACjD,MAAO,GAAW,EAAK,EAAQ,EAAQ,GAGzC,WAAsB,EAAK,EAAQ,EAAQ,EAAQ,CACjD,MAAO,IAAW,GAAc,GAAS,EAAK,EAAQ,GAGxD,WAAoB,EAAK,EAAQ,EAAQ,EAAQ,CAC/C,MAAO,IAAW,GAAe,EAAQ,EAAI,OAAS,GAAS,EAAK,EAAQ,GAG9E,EAAO,UAAU,MAAQ,SAAgB,EAAQ,EAAQ,EAAQ,EAAU,CAEzE,GAAI,IAAW,OACb,EAAW,OACX,EAAS,KAAK,OACd,EAAS,UAEA,IAAW,QAAa,MAAO,IAAW,SACnD,EAAW,EACX,EAAS,KAAK,OACd,EAAS,UAEA,SAAS,GAClB,EAAS,IAAW,EACpB,AAAI,SAAS,GACX,GAAS,IAAW,EAChB,IAAa,QAAW,GAAW,SAEvC,GAAW,EACX,EAAS,YAGX,MAAM,IAAI,OACR,2EAIJ,GAAI,GAAY,KAAK,OAAS,EAG9B,GAFI,KAAW,QAAa,EAAS,IAAW,GAAS,GAEpD,EAAO,OAAS,GAAM,GAAS,GAAK,EAAS,IAAO,EAAS,KAAK,OACrE,KAAM,IAAI,YAAW,0CAGvB,AAAK,GAAU,GAAW,QAG1B,OADI,GAAc,KAEhB,OAAQ,OACD,MACH,MAAO,GAAS,KAAM,EAAQ,EAAQ,OAEnC,WACA,QACH,MAAO,IAAU,KAAM,EAAQ,EAAQ,OAEpC,QACH,MAAO,GAAW,KAAM,EAAQ,EAAQ,OAErC,aACA,SACH,MAAO,IAAY,KAAM,EAAQ,EAAQ,OAEtC,SAEH,MAAO,GAAY,KAAM,EAAQ,EAAQ,OAEtC,WACA,YACA,cACA,WACH,MAAO,GAAU,KAAM,EAAQ,EAAQ,WAGvC,GAAI,EAAa,KAAM,IAAI,WAAU,qBAAuB,GAC5D,EAAY,IAAK,GAAU,cAC3B,EAAc,KAKtB,EAAO,UAAU,OAAS,UAAmB,CAC3C,MAAO,CACL,KAAM,SACN,KAAM,MAAM,UAAU,MAAM,KAAK,KAAK,MAAQ,KAAM,KAIxD,WAAsB,EAAK,EAAO,EAAK,CACrC,MAAI,KAAU,GAAK,IAAQ,EAAI,OACtB,GAAO,cAAc,GAErB,GAAO,cAAc,EAAI,MAAM,EAAO,IAIjD,WAAoB,EAAK,EAAO,EAAK,CACnC,EAAM,KAAK,IAAI,EAAI,OAAQ,GAI3B,OAHI,GAAM,GAEN,EAAI,EACD,EAAI,GAAK,CACd,GAAI,GAAY,EAAI,GAChB,EAAY,KACZ,GAAoB,EAAY,IAAQ,EACvC,EAAY,IAAQ,EAClB,EAAY,IAAQ,EACnB,EAER,GAAI,EAAI,IAAoB,EAAK,CAC/B,GAAI,IAAY,GAAW,GAAY,GAEvC,OAAQ,QACD,GACH,AAAI,EAAY,KACd,GAAY,GAEd,UACG,GACH,GAAa,EAAI,EAAI,GAChB,IAAa,MAAU,KAC1B,IAAiB,GAAY,KAAS,EAAO,GAAa,GACtD,GAAgB,KAClB,GAAY,KAGhB,UACG,GACH,GAAa,EAAI,EAAI,GACrB,GAAY,EAAI,EAAI,GACf,IAAa,MAAU,KAAS,IAAY,MAAU,KACzD,IAAiB,GAAY,KAAQ,GAAO,IAAa,KAAS,EAAO,GAAY,GACjF,GAAgB,MAAU,IAAgB,OAAU,GAAgB,QACtE,GAAY,KAGhB,UACG,GACH,GAAa,EAAI,EAAI,GACrB,GAAY,EAAI,EAAI,GACpB,GAAa,EAAI,EAAI,GAChB,IAAa,MAAU,KAAS,IAAY,MAAU,KAAS,IAAa,MAAU,KACzF,IAAiB,GAAY,KAAQ,GAAQ,IAAa,KAAS,GAAO,IAAY,KAAS,EAAO,GAAa,GAC/G,GAAgB,OAAU,GAAgB,SAC5C,GAAY,MAMtB,AAAI,IAAc,KAGhB,GAAY,MACZ,GAAmB,GACV,EAAY,OAErB,IAAa,MACb,EAAI,KAAK,IAAc,GAAK,KAAQ,OACpC,EAAY,MAAS,EAAY,MAGnC,EAAI,KAAK,GACT,GAAK,GAGP,MAAO,GAAsB,GAM/B,GAAI,GAAuB,KAE3B,WAAgC,EAAY,CAC1C,GAAI,GAAM,EAAW,OACrB,GAAI,GAAO,EACT,MAAO,QAAO,aAAa,MAAM,OAAQ,GAM3C,OAFI,GAAM,GACN,EAAI,EACD,EAAI,GACT,GAAO,OAAO,aAAa,MACzB,OACA,EAAW,MAAM,EAAG,GAAK,IAG7B,MAAO,GAGT,WAAqB,EAAK,EAAO,EAAK,CACpC,GAAI,GAAM,GACV,EAAM,KAAK,IAAI,EAAI,OAAQ,GAE3B,OAAS,GAAI,EAAO,EAAI,EAAK,EAAE,EAC7B,GAAO,OAAO,aAAa,EAAI,GAAK,KAEtC,MAAO,GAGT,WAAsB,EAAK,EAAO,EAAK,CACrC,GAAI,GAAM,GACV,EAAM,KAAK,IAAI,EAAI,OAAQ,GAE3B,OAAS,GAAI,EAAO,EAAI,EAAK,EAAE,EAC7B,GAAO,OAAO,aAAa,EAAI,IAEjC,MAAO,GAGT,WAAmB,EAAK,EAAO,EAAK,CAClC,GAAI,GAAM,EAAI,OAEd,AAAI,EAAC,GAAS,EAAQ,IAAG,GAAQ,GAC7B,EAAC,GAAO,EAAM,GAAK,EAAM,IAAK,GAAM,GAGxC,OADI,GAAM,GACD,EAAI,EAAO,EAAI,EAAK,EAAE,EAC7B,GAAO,GAAoB,EAAI,IAEjC,MAAO,GAGT,YAAuB,EAAK,EAAO,EAAK,CAGtC,OAFI,GAAQ,EAAI,MAAM,EAAO,GACzB,EAAM,GACD,EAAI,EAAG,EAAI,EAAM,OAAQ,GAAK,EACrC,GAAO,OAAO,aAAa,EAAM,GAAM,EAAM,EAAI,GAAK,KAExD,MAAO,GAGT,EAAO,UAAU,MAAQ,SAAgB,EAAO,EAAK,CACnD,GAAI,GAAM,KAAK,OACf,EAAQ,CAAC,CAAC,EACV,EAAM,IAAQ,OAAY,EAAM,CAAC,CAAC,EAElC,AAAI,EAAQ,EACV,IAAS,EACL,EAAQ,GAAG,GAAQ,IACd,EAAQ,GACjB,GAAQ,GAGV,AAAI,EAAM,EACR,IAAO,EACH,EAAM,GAAG,GAAM,IACV,EAAM,GACf,GAAM,GAGJ,EAAM,GAAO,GAAM,GAEvB,GAAI,GAAS,KAAK,SAAS,EAAO,GAElC,cAAO,eAAe,EAAQ,EAAO,WAE9B,GAMT,YAAsB,EAAQ,EAAK,EAAQ,CACzC,GAAK,EAAS,GAAO,GAAK,EAAS,EAAG,KAAM,IAAI,YAAW,sBAC3D,GAAI,EAAS,EAAM,EAAQ,KAAM,IAAI,YAAW,yCAGlD,EAAO,UAAU,WAAa,SAAqB,EAAQ,EAAY,EAAU,CAC/E,EAAS,IAAW,EACpB,EAAa,IAAe,EACvB,GAAU,GAAY,EAAQ,EAAY,KAAK,QAKpD,OAHI,GAAM,KAAK,GACX,EAAM,EACN,EAAI,EACD,EAAE,EAAI,GAAe,IAAO,MACjC,GAAO,KAAK,EAAS,GAAK,EAG5B,MAAO,IAGT,EAAO,UAAU,WAAa,SAAqB,EAAQ,EAAY,EAAU,CAC/E,EAAS,IAAW,EACpB,EAAa,IAAe,EACvB,GACH,GAAY,EAAQ,EAAY,KAAK,QAKvC,OAFI,GAAM,KAAK,EAAS,EAAE,GACtB,EAAM,EACH,EAAa,GAAM,IAAO,MAC/B,GAAO,KAAK,EAAS,EAAE,GAAc,EAGvC,MAAO,IAGT,EAAO,UAAU,UAAY,SAAoB,EAAQ,EAAU,CACjE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,KAAK,IAGd,EAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,KAAK,GAAW,KAAK,EAAS,IAAM,GAG7C,EAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACnC,KAAK,IAAW,EAAK,KAAK,EAAS,IAG7C,EAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAElC,MAAK,GACT,KAAK,EAAS,IAAM,EACpB,KAAK,EAAS,IAAM,IACpB,KAAK,EAAS,GAAK,UAG1B,EAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAEnC,KAAK,GAAU,SACnB,MAAK,EAAS,IAAM,GACrB,KAAK,EAAS,IAAM,EACrB,KAAK,EAAS,KAGlB,EAAO,UAAU,UAAY,SAAoB,EAAQ,EAAY,EAAU,CAC7E,EAAS,IAAW,EACpB,EAAa,IAAe,EACvB,GAAU,GAAY,EAAQ,EAAY,KAAK,QAKpD,OAHI,GAAM,KAAK,GACX,EAAM,EACN,EAAI,EACD,EAAE,EAAI,GAAe,IAAO,MACjC,GAAO,KAAK,EAAS,GAAK,EAE5B,UAAO,IAEH,GAAO,GAAK,IAAO,KAAK,IAAI,EAAG,EAAI,IAEhC,GAGT,EAAO,UAAU,UAAY,SAAoB,EAAQ,EAAY,EAAU,CAC7E,EAAS,IAAW,EACpB,EAAa,IAAe,EACvB,GAAU,GAAY,EAAQ,EAAY,KAAK,QAKpD,OAHI,GAAI,EACJ,EAAM,EACN,EAAM,KAAK,EAAS,EAAE,GACnB,EAAI,GAAM,IAAO,MACtB,GAAO,KAAK,EAAS,EAAE,GAAK,EAE9B,UAAO,IAEH,GAAO,GAAK,IAAO,KAAK,IAAI,EAAG,EAAI,IAEhC,GAGT,EAAO,UAAU,SAAW,SAAmB,EAAQ,EAAU,CAG/D,MAFA,GAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACvC,AAAE,KAAK,GAAU,IACZ,KAAO,KAAK,GAAU,GAAK,GADA,KAAK,IAI3C,EAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,EAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAC3C,GAAI,GAAM,KAAK,GAAW,KAAK,EAAS,IAAM,EAC9C,MAAQ,GAAM,MAAU,EAAM,WAAa,GAG7C,EAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,EAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAC3C,GAAI,GAAM,KAAK,EAAS,GAAM,KAAK,IAAW,EAC9C,MAAQ,GAAM,MAAU,EAAM,WAAa,GAG7C,EAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAEnC,KAAK,GACV,KAAK,EAAS,IAAM,EACpB,KAAK,EAAS,IAAM,GACpB,KAAK,EAAS,IAAM,IAGzB,EAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QAEnC,KAAK,IAAW,GACrB,KAAK,EAAS,IAAM,GACpB,KAAK,EAAS,IAAM,EACpB,KAAK,EAAS,IAGnB,EAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,GAAQ,KAAK,KAAM,EAAQ,GAAM,GAAI,IAG9C,EAAO,UAAU,YAAc,SAAsB,EAAQ,EAAU,CACrE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,GAAQ,KAAK,KAAM,EAAQ,GAAO,GAAI,IAG/C,EAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,GAAQ,KAAK,KAAM,EAAQ,GAAM,GAAI,IAG9C,EAAO,UAAU,aAAe,SAAuB,EAAQ,EAAU,CACvE,SAAS,IAAW,EACf,GAAU,GAAY,EAAQ,EAAG,KAAK,QACpC,GAAQ,KAAK,KAAM,EAAQ,GAAO,GAAI,IAG/C,WAAmB,EAAK,EAAO,EAAQ,EAAK,EAAK,EAAK,CACpD,GAAI,CAAC,EAAO,SAAS,GAAM,KAAM,IAAI,WAAU,+CAC/C,GAAI,EAAQ,GAAO,EAAQ,EAAK,KAAM,IAAI,YAAW,qCACrD,GAAI,EAAS,EAAM,EAAI,OAAQ,KAAM,IAAI,YAAW,sBAGtD,EAAO,UAAU,YAAc,SAAsB,EAAO,EAAQ,EAAY,EAAU,CAIxF,GAHA,EAAQ,CAAC,EACT,EAAS,IAAW,EACpB,EAAa,IAAe,EACxB,CAAC,EAAU,CACb,GAAI,GAAW,KAAK,IAAI,EAAG,EAAI,GAAc,EAC7C,EAAS,KAAM,EAAO,EAAQ,EAAY,EAAU,GAGtD,GAAI,GAAM,EACN,GAAI,EAER,IADA,KAAK,GAAU,EAAQ,IAChB,EAAE,GAAI,GAAe,IAAO,MACjC,KAAK,EAAS,IAAM,EAAQ,EAAO,IAGrC,MAAO,GAAS,GAGlB,EAAO,UAAU,YAAc,SAAsB,EAAO,EAAQ,EAAY,EAAU,CAIxF,GAHA,EAAQ,CAAC,EACT,EAAS,IAAW,EACpB,EAAa,IAAe,EACxB,CAAC,EAAU,CACb,GAAI,GAAW,KAAK,IAAI,EAAG,EAAI,GAAc,EAC7C,EAAS,KAAM,EAAO,EAAQ,EAAY,EAAU,GAGtD,GAAI,GAAI,EAAa,EACjB,GAAM,EAEV,IADA,KAAK,EAAS,GAAK,EAAQ,IACpB,EAAE,GAAK,GAAM,KAAO,MACzB,KAAK,EAAS,GAAM,EAAQ,GAAO,IAGrC,MAAO,GAAS,GAGlB,EAAO,UAAU,WAAa,SAAqB,EAAO,EAAQ,EAAU,CAC1E,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,EAAS,KAAM,EAAO,EAAQ,EAAG,IAAM,GACtD,KAAK,GAAW,EAAQ,IACjB,EAAS,GAGlB,EAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,EAAS,KAAM,EAAO,EAAQ,EAAG,MAAQ,GACxD,KAAK,GAAW,EAAQ,IACxB,KAAK,EAAS,GAAM,IAAU,EACvB,EAAS,GAGlB,EAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,EAAS,KAAM,EAAO,EAAQ,EAAG,MAAQ,GACxD,KAAK,GAAW,IAAU,EAC1B,KAAK,EAAS,GAAM,EAAQ,IACrB,EAAS,GAGlB,EAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,EAAS,KAAM,EAAO,EAAQ,EAAG,WAAY,GAC5D,KAAK,EAAS,GAAM,IAAU,GAC9B,KAAK,EAAS,GAAM,IAAU,GAC9B,KAAK,EAAS,GAAM,IAAU,EAC9B,KAAK,GAAW,EAAQ,IACjB,EAAS,GAGlB,EAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,EAAS,KAAM,EAAO,EAAQ,EAAG,WAAY,GAC5D,KAAK,GAAW,IAAU,GAC1B,KAAK,EAAS,GAAM,IAAU,GAC9B,KAAK,EAAS,GAAM,IAAU,EAC9B,KAAK,EAAS,GAAM,EAAQ,IACrB,EAAS,GAGlB,EAAO,UAAU,WAAa,SAAqB,EAAO,EAAQ,EAAY,EAAU,CAGtF,GAFA,EAAQ,CAAC,EACT,EAAS,IAAW,EAChB,CAAC,EAAU,CACb,GAAI,GAAQ,KAAK,IAAI,EAAI,EAAI,EAAc,GAE3C,EAAS,KAAM,EAAO,EAAQ,EAAY,EAAQ,EAAG,CAAC,GAGxD,GAAI,GAAI,EACJ,GAAM,EACN,GAAM,EAEV,IADA,KAAK,GAAU,EAAQ,IAChB,EAAE,EAAI,GAAe,KAAO,MACjC,AAAI,EAAQ,GAAK,KAAQ,GAAK,KAAK,EAAS,EAAI,KAAO,GACrD,IAAM,GAER,KAAK,EAAS,GAAO,GAAQ,IAAQ,GAAK,GAAM,IAGlD,MAAO,GAAS,GAGlB,EAAO,UAAU,WAAa,SAAqB,EAAO,EAAQ,EAAY,EAAU,CAGtF,GAFA,EAAQ,CAAC,EACT,EAAS,IAAW,EAChB,CAAC,EAAU,CACb,GAAI,GAAQ,KAAK,IAAI,EAAI,EAAI,EAAc,GAE3C,EAAS,KAAM,EAAO,EAAQ,EAAY,EAAQ,EAAG,CAAC,GAGxD,GAAI,GAAI,EAAa,EACjB,GAAM,EACN,GAAM,EAEV,IADA,KAAK,EAAS,GAAK,EAAQ,IACpB,EAAE,GAAK,GAAM,KAAO,MACzB,AAAI,EAAQ,GAAK,KAAQ,GAAK,KAAK,EAAS,EAAI,KAAO,GACrD,IAAM,GAER,KAAK,EAAS,GAAO,GAAQ,IAAQ,GAAK,GAAM,IAGlD,MAAO,GAAS,GAGlB,EAAO,UAAU,UAAY,SAAoB,EAAO,EAAQ,EAAU,CACxE,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,EAAS,KAAM,EAAO,EAAQ,EAAG,IAAM,MAClD,EAAQ,GAAG,GAAQ,IAAO,EAAQ,GACtC,KAAK,GAAW,EAAQ,IACjB,EAAS,GAGlB,EAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,EAAS,KAAM,EAAO,EAAQ,EAAG,MAAQ,QACxD,KAAK,GAAW,EAAQ,IACxB,KAAK,EAAS,GAAM,IAAU,EACvB,EAAS,GAGlB,EAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,EAAS,KAAM,EAAO,EAAQ,EAAG,MAAQ,QACxD,KAAK,GAAW,IAAU,EAC1B,KAAK,EAAS,GAAM,EAAQ,IACrB,EAAS,GAGlB,EAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,EAAS,KAAM,EAAO,EAAQ,EAAG,WAAY,aAC5D,KAAK,GAAW,EAAQ,IACxB,KAAK,EAAS,GAAM,IAAU,EAC9B,KAAK,EAAS,GAAM,IAAU,GAC9B,KAAK,EAAS,GAAM,IAAU,GACvB,EAAS,GAGlB,EAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GAAU,EAAS,KAAM,EAAO,EAAQ,EAAG,WAAY,aACxD,EAAQ,GAAG,GAAQ,WAAa,EAAQ,GAC5C,KAAK,GAAW,IAAU,GAC1B,KAAK,EAAS,GAAM,IAAU,GAC9B,KAAK,EAAS,GAAM,IAAU,EAC9B,KAAK,EAAS,GAAM,EAAQ,IACrB,EAAS,GAGlB,WAAuB,EAAK,EAAO,EAAQ,EAAK,EAAK,EAAK,CACxD,GAAI,EAAS,EAAM,EAAI,OAAQ,KAAM,IAAI,YAAW,sBACpD,GAAI,EAAS,EAAG,KAAM,IAAI,YAAW,sBAGvC,YAAqB,EAAK,EAAO,EAAQ,EAAc,EAAU,CAC/D,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GACH,EAAa,EAAK,EAAO,EAAQ,GAEnC,GAAQ,MAAM,EAAK,EAAO,EAAQ,EAAc,GAAI,GAC7C,EAAS,EAGlB,EAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,MAAO,IAAW,KAAM,EAAO,EAAQ,GAAM,IAG/C,EAAO,UAAU,aAAe,SAAuB,EAAO,EAAQ,EAAU,CAC9E,MAAO,IAAW,KAAM,EAAO,EAAQ,GAAO,IAGhD,YAAsB,EAAK,EAAO,EAAQ,EAAc,EAAU,CAChE,SAAQ,CAAC,EACT,EAAS,IAAW,EACf,GACH,EAAa,EAAK,EAAO,EAAQ,GAEnC,GAAQ,MAAM,EAAK,EAAO,EAAQ,EAAc,GAAI,GAC7C,EAAS,EAGlB,EAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,MAAO,IAAY,KAAM,EAAO,EAAQ,GAAM,IAGhD,EAAO,UAAU,cAAgB,SAAwB,EAAO,EAAQ,EAAU,CAChF,MAAO,IAAY,KAAM,EAAO,EAAQ,GAAO,IAIjD,EAAO,UAAU,KAAO,SAAe,EAAQ,EAAa,EAAO,EAAK,CACtE,GAAI,CAAC,EAAO,SAAS,GAAS,KAAM,IAAI,WAAU,+BASlD,GARK,GAAO,GAAQ,GAChB,CAAC,GAAO,IAAQ,GAAG,GAAM,KAAK,QAC9B,GAAe,EAAO,QAAQ,GAAc,EAAO,QAClD,GAAa,GAAc,GAC5B,EAAM,GAAK,EAAM,GAAO,GAAM,GAG9B,IAAQ,GACR,EAAO,SAAW,GAAK,KAAK,SAAW,EAAG,MAAO,GAGrD,GAAI,EAAc,EAChB,KAAM,IAAI,YAAW,6BAEvB,GAAI,EAAQ,GAAK,GAAS,KAAK,OAAQ,KAAM,IAAI,YAAW,sBAC5D,GAAI,EAAM,EAAG,KAAM,IAAI,YAAW,2BAGlC,AAAI,EAAM,KAAK,QAAQ,GAAM,KAAK,QAC9B,EAAO,OAAS,EAAc,EAAM,GACtC,GAAM,EAAO,OAAS,EAAc,GAGtC,GAAI,GAAM,EAAM,EAEhB,GAAI,OAAS,GAAU,MAAO,YAAW,UAAU,YAAe,WAEhE,KAAK,WAAW,EAAa,EAAO,WAC3B,OAAS,GAAU,EAAQ,GAAe,EAAc,EAEjE,OAAS,GAAI,EAAM,EAAG,GAAK,EAAG,EAAE,EAC9B,EAAO,EAAI,GAAe,KAAK,EAAI,OAGrC,YAAW,UAAU,IAAI,KACvB,EACA,KAAK,SAAS,EAAO,GACrB,GAIJ,MAAO,IAOT,EAAO,UAAU,KAAO,SAAe,EAAK,EAAO,EAAK,EAAU,CAEhE,GAAI,MAAO,IAAQ,SAAU,CAS3B,GARA,AAAI,MAAO,IAAU,SACnB,GAAW,EACX,EAAQ,EACR,EAAM,KAAK,QACF,MAAO,IAAQ,UACxB,GAAW,EACX,EAAM,KAAK,QAET,IAAa,QAAa,MAAO,IAAa,SAChD,KAAM,IAAI,WAAU,6BAEtB,GAAI,MAAO,IAAa,UAAY,CAAC,EAAO,WAAW,GACrD,KAAM,IAAI,WAAU,qBAAuB,GAE7C,GAAI,EAAI,SAAW,EAAG,CACpB,GAAI,GAAO,EAAI,WAAW,GAC1B,AAAK,KAAa,QAAU,EAAO,KAC/B,IAAa,WAEf,GAAM,QAGL,AAAI,OAAO,IAAQ,SACxB,EAAM,EAAM,IACH,MAAO,IAAQ,WACxB,GAAM,OAAO,IAIf,GAAI,EAAQ,GAAK,KAAK,OAAS,GAAS,KAAK,OAAS,EACpD,KAAM,IAAI,YAAW,sBAGvB,GAAI,GAAO,EACT,MAAO,MAGT,EAAQ,IAAU,EAClB,EAAM,IAAQ,OAAY,KAAK,OAAS,IAAQ,EAE3C,GAAK,GAAM,GAEhB,GAAI,GACJ,GAAI,MAAO,IAAQ,SACjB,IAAK,EAAI,EAAO,EAAI,EAAK,EAAE,EACzB,KAAK,GAAK,MAEP,CACL,GAAI,IAAQ,EAAO,SAAS,GACxB,EACA,EAAO,KAAK,EAAK,GACjB,GAAM,GAAM,OAChB,GAAI,KAAQ,EACV,KAAM,IAAI,WAAU,cAAgB,EAClC,qCAEJ,IAAK,EAAI,EAAG,EAAI,EAAM,EAAO,EAAE,EAC7B,KAAK,EAAI,GAAS,GAAM,EAAI,IAIhC,MAAO,OAMT,GAAI,IAAoB,oBAExB,YAAsB,EAAK,CAMzB,GAJA,EAAM,EAAI,MAAM,KAAK,GAErB,EAAM,EAAI,OAAO,QAAQ,GAAmB,IAExC,EAAI,OAAS,EAAG,MAAO,GAE3B,KAAO,EAAI,OAAS,GAAM,GACxB,EAAM,EAAM,IAEd,MAAO,GAGT,YAAsB,EAAQ,EAAO,CACnC,EAAQ,GAAS,IAMjB,OALI,GACA,EAAS,EAAO,OAChB,EAAgB,KAChB,EAAQ,GAEH,EAAI,EAAG,EAAI,EAAQ,EAAE,EAAG,CAI/B,GAHA,EAAY,EAAO,WAAW,GAG1B,EAAY,OAAU,EAAY,MAAQ,CAE5C,GAAI,CAAC,EAAe,CAElB,GAAI,EAAY,MAAQ,CAEtB,AAAK,IAAS,GAAK,IAAI,EAAM,KAAK,IAAM,IAAM,KAC9C,iBACS,EAAI,IAAM,EAAQ,CAE3B,AAAK,IAAS,GAAK,IAAI,EAAM,KAAK,IAAM,IAAM,KAC9C,SAIF,EAAgB,EAEhB,SAIF,GAAI,EAAY,MAAQ,CACtB,AAAK,IAAS,GAAK,IAAI,EAAM,KAAK,IAAM,IAAM,KAC9C,EAAgB,EAChB,SAIF,EAAa,GAAgB,OAAU,GAAK,EAAY,OAAU,UAC7D,AAAI,IAEJ,IAAS,GAAK,IAAI,EAAM,KAAK,IAAM,IAAM,KAMhD,GAHA,EAAgB,KAGZ,EAAY,IAAM,CACpB,GAAK,IAAS,GAAK,EAAG,MACtB,EAAM,KAAK,WACF,EAAY,KAAO,CAC5B,GAAK,IAAS,GAAK,EAAG,MACtB,EAAM,KACJ,GAAa,EAAM,IACnB,EAAY,GAAO,aAEZ,EAAY,MAAS,CAC9B,GAAK,IAAS,GAAK,EAAG,MACtB,EAAM,KACJ,GAAa,GAAM,IACnB,GAAa,EAAM,GAAO,IAC1B,EAAY,GAAO,aAEZ,EAAY,QAAU,CAC/B,GAAK,IAAS,GAAK,EAAG,MACtB,EAAM,KACJ,GAAa,GAAO,IACpB,GAAa,GAAM,GAAO,IAC1B,GAAa,EAAM,GAAO,IAC1B,EAAY,GAAO,SAGrB,MAAM,IAAI,OAAM,sBAIpB,MAAO,GAGT,YAAuB,EAAK,CAE1B,OADI,GAAY,GACP,EAAI,EAAG,EAAI,EAAI,OAAQ,EAAE,EAEhC,EAAU,KAAK,EAAI,WAAW,GAAK,KAErC,MAAO,GAGT,YAAyB,EAAK,EAAO,CAGnC,OAFI,GAAG,EAAI,EACP,EAAY,GACP,EAAI,EAAG,EAAI,EAAI,QACjB,MAAS,GAAK,GADW,EAAE,EAGhC,EAAI,EAAI,WAAW,GACnB,EAAK,GAAK,EACV,EAAK,EAAI,IACT,EAAU,KAAK,GACf,EAAU,KAAK,GAGjB,MAAO,GAGT,YAAwB,EAAK,CAC3B,MAAO,IAAO,YAAY,GAAY,IAGxC,YAAqB,EAAK,EAAK,EAAQ,EAAQ,CAC7C,OAAS,GAAI,EAAG,EAAI,GACb,IAAI,GAAU,EAAI,QAAY,GAAK,EAAI,QADlB,EAAE,EAE5B,EAAI,EAAI,GAAU,EAAI,GAExB,MAAO,GAMT,YAAqB,EAAK,EAAM,CAC9B,MAAO,aAAe,IACnB,GAAO,MAAQ,EAAI,aAAe,MAAQ,EAAI,YAAY,MAAQ,MACjE,EAAI,YAAY,OAAS,EAAK,KAEpC,YAAsB,EAAK,CAEzB,MAAO,KAAQ,EAKjB,GAAI,IAAuB,UAAY,CAGrC,OAFI,GAAW,mBACX,EAAQ,GAAI,OAAM,KACb,EAAI,EAAG,EAAI,GAAI,EAAE,EAExB,OADI,GAAM,EAAI,GACL,EAAI,EAAG,EAAI,GAAI,EAAE,EACxB,EAAM,EAAM,GAAK,EAAS,GAAK,EAAS,GAG5C,MAAO,0KCtvDT,WAA6B,EAAuD,CAClF,GAAI,GAAA,OAAO,SAAS,GAClB,MAAO,GAGT,GAAI,YAAY,OAAO,GACrB,MAAO,IAAA,OAAO,KAAK,EAAgB,QAGrC,GAAI,YAA2B,aAC7B,MAAO,IAAA,OAAO,KAAK,GAGrB,KAAM,IAAI,WAAU,wCAbtB,EAAA,aAAA,0HCNA,GAAM,GAAU,sHAYhB,WAA0B,EAAY,CACpC,GAAI,MAAO,IAAS,SAClB,KAAM,IAAI,WAAU,kDAAoD,MAAO,IAGjF,GAAI,CAAC,EAAQ,KAAK,GAChB,KAAM,IAAI,WAAU,4BAA8B,GAGpD,GAAI,GACE,EAAM,GAAI,YAAW,IAG3B,SAAI,GAAM,GAAI,SAAS,EAAK,MAAM,EAAG,GAAI,OAAS,GAClD,EAAI,GAAM,IAAM,GAAM,IACtB,EAAI,GAAM,IAAM,EAAK,IACrB,EAAI,GAAK,EAAI,IAGb,EAAI,GAAM,GAAI,SAAS,EAAK,MAAM,EAAG,IAAK,OAAS,EACnD,EAAI,GAAK,EAAI,IAGb,EAAI,GAAM,GAAI,SAAS,EAAK,MAAM,GAAI,IAAK,OAAS,EACpD,EAAI,GAAK,EAAI,IAGb,EAAI,GAAM,GAAI,SAAS,EAAK,MAAM,GAAI,IAAK,OAAS,EACpD,EAAI,GAAK,EAAI,IAIb,EAAI,IAAQ,GAAI,SAAS,EAAK,MAAM,GAAI,IAAK,KAAO,cAAiB,IACrE,EAAI,IAAO,EAAI,WAAe,IAC9B,EAAI,IAAO,IAAM,GAAM,IACvB,EAAI,IAAO,IAAM,GAAM,IACvB,EAAI,IAAO,IAAM,EAAK,IACtB,EAAI,IAAM,EAAI,IAEP,EAvCT,EAAA,UAAA,oHCUA,OAAmB,CAkCjB,YAAY,EAAkC,EAAgB,CAC5D,GACE,AAAE,GAAU,MACV,MAAO,IAAW,UACpB,CAAC,YAAY,OAAO,IACpB,CAAE,aAAkB,eACpB,CAAC,MAAM,QAAQ,GAEf,KAAM,IAAI,WACR,oFAIJ,KAAK,SAAW,GAAW,EAAO,4BAElC,AAAI,GAAU,KAEZ,MAAK,OAAS,GAAA,OAAO,MAAM,EAAO,aAClC,KAAK,SAAW,GAEhB,CAAI,MAAO,IAAW,SAEpB,KAAK,OAAS,GAAA,OAAO,KAAK,EAAQ,UAC7B,AAAI,MAAM,QAAQ,GAEvB,KAAK,OAAS,GAAA,OAAO,KAAK,GAG1B,KAAK,OAAS,GAAA,aAAa,GAG7B,KAAK,SAAW,KAAK,OAAO,YAShC,IAAI,EAA2D,CAE7D,GAAI,MAAO,IAAc,UAAY,EAAU,SAAW,EACxD,KAAM,IAAI,WAAU,wCACf,GAAI,MAAO,IAAc,UAAY,EAAU,SAAW,EAC/D,KAAM,IAAI,WAAU,qDAGtB,GAAI,GASJ,GARA,AAAI,MAAO,IAAc,SACvB,EAAc,EAAU,WAAW,GAC9B,AAAI,MAAO,IAAc,SAC9B,EAAc,EAEd,EAAc,EAAU,GAGtB,EAAc,GAAK,EAAc,IACnC,KAAM,IAAI,WAAU,4DAGtB,GAAI,KAAK,OAAO,OAAS,KAAK,SAC5B,KAAK,OAAO,KAAK,YAAc,MAC1B,CACL,GAAM,GAAS,GAAA,OAAO,MAAM,EAAO,YAAc,KAAK,OAAO,QAE7D,KAAK,OAAO,KAAK,EAAQ,EAAG,EAAG,KAAK,OAAO,QAC3C,KAAK,OAAS,EACd,KAAK,OAAO,KAAK,YAAc,GAUnC,MAAM,EAAmC,EAAc,CAIrD,GAHA,EAAS,MAAO,IAAW,SAAW,EAAS,KAAK,SAGhD,KAAK,OAAO,OAAS,EAAS,EAAS,OAAQ,CACjD,GAAM,GAAS,GAAA,OAAO,MAAM,KAAK,OAAO,OAAS,EAAS,QAC1D,KAAK,OAAO,KAAK,EAAQ,EAAG,EAAG,KAAK,OAAO,QAG3C,KAAK,OAAS,EAGhB,AAAI,YAAY,OAAO,GACrB,MAAK,OAAO,IAAI,GAAA,aAAa,GAAW,GACxC,KAAK,SACH,EAAS,EAAS,WAAa,KAAK,SAAW,EAAS,EAAS,OAAS,KAAK,UACxE,MAAO,IAAa,UAC7B,MAAK,OAAO,MAAM,EAAU,EAAQ,EAAS,OAAQ,UACrD,KAAK,SACH,EAAS,EAAS,OAAS,KAAK,SAAW,EAAS,EAAS,OAAS,KAAK,UAUjF,KAAK,EAAkB,EAAc,CACnC,SAAS,GAAU,EAAS,EAAI,EAAS,KAAK,SAGvC,KAAK,OAAO,MAAM,EAAU,EAAW,GAShD,MAAM,EAAe,CAInB,MAHA,GAAQ,CAAC,CAAC,EAGN,GAAS,KAAK,OAAO,SAAW,KAAK,SAChC,KAAK,OAIV,EACK,KAAK,OAAO,MAAM,EAAG,KAAK,UAE5B,KAAK,OAAO,SAAS,SAAU,EAAG,KAAK,UAIhD,QAAM,CACJ,MAAO,MAAK,SAId,QAAM,CACJ,MAAO,MAAK,OAAO,SAAS,UAI9B,SAAS,EAAc,CACrB,MAAO,MAAK,OAAO,SAAS,GAI9B,eAAe,EAAsB,CACnC,EAAU,GAAW,GACrB,GAAM,GAAe,KAAK,OAAO,SAAS,UAEpC,EAAU,OAAO,KAAK,UAAU,SAAS,IAC/C,MAAI,GAAQ,OACH,CACL,QAAS,EACT,MAAO,EAAQ,SAAW,EAAI,IAAM,EAAU,GAG3C,CACL,QAAS,CACP,OAAQ,EACR,QAAS,EAAQ,SAAW,EAAI,IAAM,EAAU,UAM/C,kBACL,EACA,EAAsB,CAEtB,EAAU,GAAW,GACrB,GAAI,GACA,EAeJ,GAdA,AAAI,WAAa,GACf,AAAI,EAAQ,QAAU,MAAO,GAAI,SAAY,UAAY,SAAW,GAClE,GAAO,EAAI,MAAQ,SAAS,EAAI,MAAO,IAAM,EAC7C,EAAO,GAAA,OAAO,KAAK,EAAI,QAAS,WAE5B,MAAO,GAAI,SAAY,UACzB,GAAO,EAAI,QAAQ,QAAU,SAAS,EAAI,QAAQ,QAAS,IAAM,EACjE,EAAO,GAAA,OAAO,KAAK,EAAI,QAAQ,OAAQ,WAGlC,SAAW,IACpB,GAAO,EACP,EAAO,GAAA,OAAO,KAAK,GAAA,UAAU,EAAI,SAE/B,CAAC,EACH,KAAM,IAAI,WAAU,0CAA0C,KAAK,UAAU,MAE/E,MAAO,IAAI,GAAO,EAAM,IArO5B,EAAA,OAAA,EAO0B,EAAA,4BAA8B,EAGtC,EAAA,YAAc,IAEd,EAAA,gBAAkB,EAElB,EAAA,iBAAmB,EAEnB,EAAA,mBAAqB,EAErB,EAAA,iBAAmB,EAEnB,EAAA,aAAe,EAEf,EAAA,YAAc,EAEd,EAAA,qBAAuB,IAiNzC,OAAO,eAAe,EAAO,UAAW,YAAa,CAAE,MAAO,wHCvP9D,OAAiB,CASf,YAAY,EAAyB,EAAgB,CACnD,KAAK,KAAO,EACZ,KAAK,MAAQ,EAIf,QAAM,CACJ,MAAO,CAAE,KAAM,KAAK,KAAM,MAAO,KAAK,OAIxC,gBAAc,CACZ,MAAI,MAAK,MACA,CAAE,MAAO,KAAK,KAAM,OAAQ,KAAK,OAGnC,CAAE,MAAO,KAAK,YAIhB,kBAAiB,EAAiB,CACvC,MAAO,IAAI,GAAK,EAAI,MAAO,EAAI,SA9BnC,EAAA,KAAA,EAkCA,OAAO,eAAe,EAAK,UAAW,YAAa,CAAE,MAAO,iCC9C5D,GAAe,GCCX,GACJ,AAAI,MAAO,QAAO,QAAW,WAC3B,GAAW,SAAkB,EAAM,EAAW,CAE5C,EAAK,OAAS,EACd,EAAK,UAAY,OAAO,OAAO,EAAU,UAAW,CAClD,YAAa,CACX,MAAO,EACP,WAAY,GACZ,SAAU,GACV,aAAc,OAKpB,GAAW,SAAkB,EAAM,EAAW,CAC5C,EAAK,OAAS,EACd,GAAI,GAAW,UAAY,GAC3B,EAAS,UAAY,EAAU,UAC/B,EAAK,UAAY,GAAI,GACrB,EAAK,UAAU,YAAc,GAGjC,GAAA,IAAe,GCHX,GAAe,WACZ,YAAgB,EAAG,CACxB,GAAI,CAAC,GAAS,GAAI,CAEhB,OADI,GAAU,GACL,EAAI,EAAG,EAAI,UAAU,OAAQ,IACpC,EAAQ,KAAK,GAAQ,UAAU,KAEjC,MAAO,GAAQ,KAAK,KAsBtB,OAnBI,GAAI,EACJ,EAAO,UACP,EAAM,EAAK,OACX,EAAM,OAAO,GAAG,QAAQ,GAAc,SAAS,EAAG,CACpD,GAAI,IAAM,KAAM,MAAO,IACvB,GAAI,GAAK,EAAK,MAAO,GACrB,OAAQ,OACD,KAAM,MAAO,QAAO,EAAK,UACzB,KAAM,MAAO,QAAO,EAAK,UACzB,KACH,GAAI,CACF,MAAO,MAAK,UAAU,EAAK,WAC3B,CACA,MAAO,qBAGT,MAAO,MAGJ,EAAI,EAAK,GAAI,EAAI,EAAK,EAAI,EAAK,EAAE,GACxC,AAAI,GAAO,IAAM,CAAC,GAAS,GACzB,GAAO,IAAM,EAEb,GAAO,IAAM,GAAQ,GAGzB,MAAO,GAOF,YAAmB,EAAI,EAAK,CAEjC,GAAI,GAAY,OAAO,SACrB,MAAO,WAAW,CAChB,MAAO,IAAU,EAAI,GAAK,MAAM,KAAM,YAQ1C,GAAI,GAAS,GACb,YAAsB,CACpB,MAAK,IAMD,SAAQ,MAAM,GAEhB,EAAS,IAEJ,EAAG,MAAM,KAAM,WAGxB,MAAO,GAIT,GAAI,IAAS,GACT,GACG,YAAkB,EAAK,CAI5B,GAHI,GAAY,KACd,IAAyC,IAC3C,EAAM,EAAI,cACN,CAAC,GAAO,GACV,GAAI,GAAI,QAAO,MAAQ,EAAM,MAAO,KAAK,KAAK,IAAe,CAC3D,GAAI,GAAM,EACV,GAAO,GAAO,UAAW,CACvB,GAAI,GAAM,GAAO,MAAM,KAAM,WAC7B,QAAQ,MAAM,YAAa,EAAK,EAAK,QAGvC,IAAO,GAAO,UAAW,GAG7B,MAAO,IAAO,GAYT,YAAiB,EAAK,EAAM,CAEjC,GAAI,GAAM,CACR,KAAM,GACN,QAAS,IAGX,MAAI,WAAU,QAAU,GAAG,GAAI,MAAQ,UAAU,IAC7C,UAAU,QAAU,GAAG,GAAI,OAAS,UAAU,IAClD,AAAI,GAAU,GAEZ,EAAI,WAAa,EACR,GAET,GAAQ,EAAK,GAGX,GAAY,EAAI,aAAa,GAAI,WAAa,IAC9C,GAAY,EAAI,QAAQ,GAAI,MAAQ,GACpC,GAAY,EAAI,SAAS,GAAI,OAAS,IACtC,GAAY,EAAI,gBAAgB,GAAI,cAAgB,IACpD,EAAI,QAAQ,GAAI,QAAU,IACvB,GAAY,EAAK,EAAK,EAAI,OAInC,GAAQ,OAAS,CACf,KAAS,CAAC,EAAG,IACb,OAAW,CAAC,EAAG,IACf,UAAc,CAAC,EAAG,IAClB,QAAY,CAAC,EAAG,IAChB,MAAU,CAAC,GAAI,IACf,KAAS,CAAC,GAAI,IACd,MAAU,CAAC,GAAI,IACf,KAAS,CAAC,GAAI,IACd,KAAS,CAAC,GAAI,IACd,MAAU,CAAC,GAAI,IACf,QAAY,CAAC,GAAI,IACjB,IAAQ,CAAC,GAAI,IACb,OAAW,CAAC,GAAI,KAIlB,GAAQ,OAAS,CACf,QAAW,OACX,OAAU,SACV,QAAW,SACX,UAAa,OACb,KAAQ,OACR,OAAU,QACV,KAAQ,UAER,OAAU,OAIZ,YAA0B,EAAK,EAAW,CACxC,GAAI,GAAQ,GAAQ,OAAO,GAE3B,MAAI,GACK,KAAY,GAAQ,OAAO,GAAO,GAAK,IAAM,EAC7C,KAAY,GAAQ,OAAO,GAAO,GAAK,IAEvC,EAKX,YAAwB,EAAK,EAAW,CACtC,MAAO,GAIT,YAAqB,EAAO,CAC1B,GAAI,GAAO,GAEX,SAAM,QAAQ,SAAS,EAAK,EAAK,CAC/B,EAAK,GAAO,KAGP,EAIT,YAAqB,EAAK,EAAO,EAAc,CAG7C,GAAI,EAAI,eACJ,GACA,GAAW,EAAM,UAEjB,EAAM,UAAY,IAElB,CAAE,GAAM,aAAe,EAAM,YAAY,YAAc,GAAQ,CACjE,GAAI,GAAM,EAAM,QAAQ,EAAc,GACtC,MAAK,IAAS,IACZ,GAAM,GAAY,EAAK,EAAK,IAEvB,EAIT,GAAI,GAAY,GAAgB,EAAK,GACrC,GAAI,EACF,MAAO,GAIT,GAAI,GAAO,OAAO,KAAK,GACnB,EAAc,GAAY,GAQ9B,GANI,EAAI,YACN,GAAO,OAAO,oBAAoB,IAKhC,GAAQ,IACJ,GAAK,QAAQ,YAAc,GAAK,EAAK,QAAQ,gBAAkB,GACrE,MAAO,IAAY,GAIrB,GAAI,EAAK,SAAW,EAAG,CACrB,GAAI,GAAW,GAAQ,CACrB,GAAI,GAAO,EAAM,KAAO,KAAO,EAAM,KAAO,GAC5C,MAAO,GAAI,QAAQ,YAAc,EAAO,IAAK,WAE/C,GAAI,GAAS,GACX,MAAO,GAAI,QAAQ,OAAO,UAAU,SAAS,KAAK,GAAQ,UAE5D,GAAI,GAAO,GACT,MAAO,GAAI,QAAQ,KAAK,UAAU,SAAS,KAAK,GAAQ,QAE1D,GAAI,GAAQ,GACV,MAAO,IAAY,GAIvB,GAAI,GAAO,GAAI,EAAQ,GAAO,EAAS,CAAC,IAAK,KAS7C,GANI,GAAQ,IACV,GAAQ,GACR,EAAS,CAAC,IAAK,MAIb,GAAW,GAAQ,CACrB,GAAI,GAAI,EAAM,KAAO,KAAO,EAAM,KAAO,GACzC,EAAO,aAAe,EAAI,IAkB5B,GAdI,GAAS,IACX,GAAO,IAAM,OAAO,UAAU,SAAS,KAAK,IAI1C,GAAO,IACT,GAAO,IAAM,KAAK,UAAU,YAAY,KAAK,IAI3C,GAAQ,IACV,GAAO,IAAM,GAAY,IAGvB,EAAK,SAAW,GAAM,EAAC,GAAS,EAAM,QAAU,GAClD,MAAO,GAAO,GAAK,EAAO,EAAO,GAGnC,GAAI,EAAe,EACjB,MAAI,IAAS,GACJ,EAAI,QAAQ,OAAO,UAAU,SAAS,KAAK,GAAQ,UAEnD,EAAI,QAAQ,WAAY,WAInC,EAAI,KAAK,KAAK,GAEd,GAAI,GACJ,MAAI,GACF,EAAS,GAAY,EAAK,EAAO,EAAc,EAAa,GAE5D,EAAS,EAAK,IAAI,SAAS,EAAK,CAC9B,MAAO,IAAe,EAAK,EAAO,EAAc,EAAa,EAAK,KAItE,EAAI,KAAK,MAEF,GAAqB,EAAQ,EAAM,GAI5C,YAAyB,EAAK,EAAO,CACnC,GAAI,GAAY,GACd,MAAO,GAAI,QAAQ,YAAa,aAClC,GAAI,GAAS,GAAQ,CACnB,GAAI,GAAS,IAAO,KAAK,UAAU,GAAO,QAAQ,SAAU,IAClB,QAAQ,KAAM,OACd,QAAQ,OAAQ,KAAO,IACjE,MAAO,GAAI,QAAQ,EAAQ,UAE7B,GAAI,GAAS,GACX,MAAO,GAAI,QAAQ,GAAK,EAAO,UACjC,GAAI,GAAU,GACZ,MAAO,GAAI,QAAQ,GAAK,EAAO,WAEjC,GAAI,GAAO,GACT,MAAO,GAAI,QAAQ,OAAQ,QAI/B,YAAqB,EAAO,CAC1B,MAAO,IAAM,MAAM,UAAU,SAAS,KAAK,GAAS,IAItD,YAAqB,EAAK,EAAO,EAAc,EAAa,EAAM,CAEhE,OADI,GAAS,GACJ,EAAI,EAAG,EAAI,EAAM,OAAQ,EAAI,EAAG,EAAE,EACzC,AAAI,GAAe,EAAO,OAAO,IAC/B,EAAO,KAAK,GAAe,EAAK,EAAO,EAAc,EACjD,OAAO,GAAI,KAEf,EAAO,KAAK,IAGhB,SAAK,QAAQ,SAAS,EAAK,CACzB,AAAK,EAAI,MAAM,UACb,EAAO,KAAK,GAAe,EAAK,EAAO,EAAc,EACjD,EAAK,OAGN,EAIT,YAAwB,EAAK,EAAO,EAAc,EAAa,EAAK,EAAO,CACzE,GAAI,GAAM,EAAK,EAsCf,GArCA,EAAO,OAAO,yBAAyB,EAAO,IAAQ,CAAE,MAAO,EAAM,IACrE,AAAI,EAAK,IACP,AAAI,EAAK,IACP,EAAM,EAAI,QAAQ,kBAAmB,WAErC,EAAM,EAAI,QAAQ,WAAY,WAG5B,EAAK,KACP,GAAM,EAAI,QAAQ,WAAY,YAG7B,GAAe,EAAa,IAC/B,GAAO,IAAM,EAAM,KAEhB,GACH,CAAI,EAAI,KAAK,QAAQ,EAAK,OAAS,EACjC,CAAI,GAAO,GACT,EAAM,GAAY,EAAK,EAAK,MAAO,MAEnC,EAAM,GAAY,EAAK,EAAK,MAAO,EAAe,GAEhD,EAAI,QAAQ;GAAQ,IACtB,CAAI,EACF,EAAM,EAAI,MAAM;GAAM,IAAI,SAAS,EAAM,CACvC,MAAO,KAAO,IACb,KAAK;GAAM,OAAO,GAErB,EAAM;EAAO,EAAI,MAAM;GAAM,IAAI,SAAS,EAAM,CAC9C,MAAO,MAAQ,IACd,KAAK;KAIZ,EAAM,EAAI,QAAQ,aAAc,YAGhC,GAAY,GAAO,CACrB,GAAI,GAAS,EAAI,MAAM,SACrB,MAAO,GAET,EAAO,KAAK,UAAU,GAAK,GAC3B,AAAI,EAAK,MAAM,gCACb,GAAO,EAAK,OAAO,EAAG,EAAK,OAAS,GACpC,EAAO,EAAI,QAAQ,EAAM,SAEzB,GAAO,EAAK,QAAQ,KAAM,OACd,QAAQ,OAAQ,KAChB,QAAQ,WAAY,KAChC,EAAO,EAAI,QAAQ,EAAM,WAI7B,MAAO,GAAO,KAAO,EAIvB,YAA8B,EAAQ,EAAM,EAAQ,CAElD,GAAI,GAAS,EAAO,OAAO,SAAS,EAAM,EAAK,CAE7C,MAAI,GAAI,QAAQ;IAAS,EAClB,EAAO,EAAI,QAAQ,kBAAmB,IAAI,OAAS,GACzD,GAEH,MAAI,GAAS,GACJ,EAAO,GACN,KAAS,GAAK,GAAK,EAAO;IAC3B,IACA,EAAO,KAAK;KACZ,IACA,EAAO,GAGT,EAAO,GAAK,EAAO,IAAM,EAAO,KAAK,MAAQ,IAAM,EAAO,GAM5D,YAAiB,EAAI,CAC1B,MAAO,OAAM,QAAQ,GAGhB,YAAmB,EAAK,CAC7B,MAAO,OAAO,IAAQ,UAGjB,YAAgB,EAAK,CAC1B,MAAO,KAAQ,KAGV,YAA2B,EAAK,CACrC,MAAO,IAAO,KAGT,YAAkB,EAAK,CAC5B,MAAO,OAAO,IAAQ,SAGjB,YAAkB,EAAK,CAC5B,MAAO,OAAO,IAAQ,SAGjB,YAAkB,EAAK,CAC5B,MAAO,cAAA,OAAO,KAAQ,SAGjB,YAAqB,EAAK,CAC/B,MAAO,KAAQ,OAGV,YAAkB,EAAI,CAC3B,MAAO,IAAS,IAAO,GAAe,KAAQ,kBAGzC,YAAkB,EAAK,CAC5B,MAAO,cAAA,OAAO,KAAQ,UAAY,IAAQ,KAGrC,YAAgB,EAAG,CACxB,MAAO,IAAS,IAAM,GAAe,KAAO,gBAGvC,YAAiB,EAAG,CACzB,MAAO,IAAS,IACX,IAAe,KAAO,kBAAoB,YAAa,QAGvD,YAAoB,EAAK,CAC9B,MAAO,OAAO,IAAQ,WAGjB,YAAqB,EAAK,CAC/B,MAAO,KAAQ,MACR,MAAO,IAAQ,WACf,MAAO,IAAQ,UACf,MAAO,IAAQ,UACf,aAAA,OAAO,KAAQ,UACf,MAAO,IAAQ,YAGjB,YAAkB,EAAU,CACjC,MAAO,QAAO,SAAS,GAGzB,YAAwB,EAAG,CACzB,MAAO,QAAO,UAAU,SAAS,KAAK,GAIxC,YAAa,EAAG,CACd,MAAO,GAAI,GAAK,IAAM,EAAE,SAAS,IAAM,EAAE,SAAS,IAIpD,GAAI,IAAS,CAAC,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MACxD,MAAO,MAAO,OAG5B,aAAqB,CACnB,GAAI,GAAI,GAAI,MACR,EAAO,CAAC,GAAI,EAAE,YACN,GAAI,EAAE,cACN,GAAI,EAAE,eAAe,KAAK,KACtC,MAAO,CAAC,EAAE,UAAW,GAAO,EAAE,YAAa,GAAM,KAAK,KAKjD,aAAe,CACpB,QAAQ,IAAI,UAAW,KAAa,GAAO,MAAM,KAAM,YAoBlD,YAAiB,EAAQ,EAAK,CAEnC,GAAI,CAAC,GAAO,CAAC,GAAS,GAAM,MAAO,GAInC,OAFI,GAAO,OAAO,KAAK,GACnB,EAAI,EAAK,OACN,KACL,EAAO,EAAK,IAAM,EAAI,EAAK,IAE7B,MAAO,GAGT,YAAwB,EAAK,EAAM,CACjC,MAAO,QAAO,UAAU,eAAe,KAAK,EAAK,GAGnD,GAAA,IAAe,CACb,SAAU,GACV,QAAS,GACT,IAAK,GACL,SAAU,GACV,YAAa,GACb,WAAY,GACZ,QAAS,GACT,OAAQ,GACR,SAAU,GACV,SAAU,GACV,YAAa,GACb,SAAU,GACV,SAAU,GACV,SAAU,GACV,kBAAmB,GACnB,OAAQ,GACR,UAAW,GACX,QAAS,GACT,QAAS,GACT,UAAW,GACX,OAAQ,GACR,SAAU,yOC9kBZ,WAAyC,EAAY,CACnD,MAAO,GAAG,WAAW,QAAQ,YAAa,cAD5C,EAAA,yBAAA,EAIA,WAA6B,EAAY,CACvC,GAAM,GAAS,GAAA,OAAO,MAAM,GAC5B,OAAS,GAAI,EAAG,EAAI,EAAM,EAAE,EAAG,EAAO,GAAK,KAAK,MAAM,KAAK,SAAW,KACtE,MAAO,GAYT,GADW,EAAA,YAAc,EACrB,MAAO,SAAW,aAAe,OAAO,QAAU,OAAO,OAAO,gBAClE,EAAA,YAAc,GAAQ,OAAO,OAAO,gBAAgB,GAAA,OAAO,MAAM,QAC5D,CACL,GAAI,CAEF,EAAA,YAAc,GAAkB,iBAChC,EAKF,AAAI,EAAA,aAAe,MACjB,GAAA,YAAc,GAIlB,WAA6B,EAAc,CACzC,MAAO,QAAO,UAAU,SAAS,KAAK,KAAW,sBADnD,EAAA,aAAA,EAIA,WAAgC,EAAc,CAC5C,MAAO,QAAO,UAAU,SAAS,KAAK,KAAW,yBADnD,EAAA,gBAAA,EAIA,WAAiC,EAAc,CAC7C,MAAO,QAAO,UAAU,SAAS,KAAK,KAAW,0BADnD,EAAA,iBAAA,EAKA,YAA0B,CACxB,MAAO,OAAO,KAAW,aAAe,MAAO,IAAO,QAAW,YADnE,EAAA,WAAA,EAKA,WAAyB,EAAc,CACrC,MAAO,MAAgB,GAAA,OAAO,SAAS,GADzC,EAAA,SAAA,EAKA,WAAuB,EAAU,CAC/B,MAAO,GAAa,IAAM,OAAO,UAAU,SAAS,KAAK,KAAO,gBADlE,EAAA,OAAA,EASA,WAA6B,EAAkB,CAC7C,MAAO,OAAO,IAAc,UAAY,IAAc,KADxD,EAAA,aAAA,EAKA,WAA8C,EAAO,EAAe,CAClE,GAAI,MAAO,SAAW,aAAe,MAAO,OAAS,YAEnD,MAAO,IAAgB,UAAU,EAAI,GAEvC,GAAI,GAAS,GACb,cAAsC,EAAe,CACnD,MAAK,IACH,SAAQ,KAAK,GACb,EAAS,IAEJ,EAAG,MAAM,KAAM,GAAG,GAE3B,MAAQ,GAbV,EAAA,UAAA,kTCjEA,WAA4B,EAAc,CACxC,MAAO,IAAA,aAAa,IAAU,EAAM,KAAU,MAAQ,EAAM,MAAW,KADzE,EAAA,YAAA,EAQA,OAAkB,CAahB,YAAY,EAAoB,EAAe,EAAa,EAAiB,CAE3E,GAAM,GAAQ,EAAW,MAAM,KAC/B,AAAI,EAAM,SAAW,GACnB,GAAK,EAAM,QAEX,EAAa,EAAM,SAGrB,KAAK,WAAa,EAClB,KAAK,IAAM,EACX,KAAK,GAAK,EACV,KAAK,OAAS,GAAU,MAOtB,YAAS,CACX,MAAO,MAAK,cAGV,WAAU,EAAa,CACzB,KAAK,WAAa,EAIpB,QAAM,CACJ,GAAM,GAAI,OAAO,OACf,CACE,KAAM,KAAK,WACX,IAAK,KAAK,KAEZ,KAAK,QAGP,MAAI,MAAK,IAAM,MAAM,GAAE,IAAM,KAAK,IAC3B,EAIT,eAAe,EAAsB,CACnC,EAAU,GAAW,GACrB,GAAI,GAAe,CACjB,KAAM,KAAK,WACX,IAAK,KAAK,KAGZ,MAAI,GAAQ,QAIR,MAAK,IAAI,GAAE,IAAM,KAAK,IAC1B,EAAI,OAAO,OAAO,EAAG,KAAK,SACnB,QAIF,kBAAiB,EAAc,CACpC,GAAM,GAAO,OAAO,OAAO,GAAI,GAC/B,aAAO,GAAK,KACZ,MAAO,GAAK,IACZ,MAAO,GAAK,IACL,GAAI,GAAM,EAAI,KAAM,EAAI,IAAK,EAAI,IAAK,IA7EjD,EAAA,MAAA,EAiFA,OAAO,eAAe,EAAM,UAAW,YAAa,CAAE,MAAO,wIChF7D,GAAI,GAMJ,GAAI,CACF,EAAQ,GAAI,aAAY,SACtB,GAAI,aAAY,OAEd,GAAI,YAAW,CAAC,EAAG,GAAI,IAAK,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,IAAK,IAAK,IAAK,EAAG,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,IAAK,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,EAAG,EAAG,EAAG,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,IAAK,EAAG,EAAG,GAAI,IAAK,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,EAAG,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,IAAK,GAAI,EAAG,IAAK,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,EAAG,GAAI,GAAI,IAAK,IAAK,GAAI,EAAG,GAAI,EAAG,IAAK,MAE5oC,IACA,aACF,EAIF,GAAM,GAAiB,GAAK,GACtB,EAAiB,GAAK,GACtB,EAAiB,EAAiB,EAClC,EAAiB,EAAiB,EAClC,EAAiB,EAAiB,EAGlC,EAAqC,GAGrC,EAAsC,GAyB5C,OAAiB,CA4Bf,YAAY,EAAM,EAAG,EAAO,EAAG,EAAkB,CAoRjD,KAAA,KAAO,EAAK,UAAU,QA2GtB,KAAA,IAAM,EAAK,UAAU,OAcrB,KAAA,GAAK,EAAK,UAAU,OAwCpB,KAAA,GAAK,EAAK,UAAU,YAQpB,KAAA,IAAM,EAAK,UAAU,mBAErB,KAAA,GAAK,EAAK,UAAU,mBAiCpB,KAAA,GAAK,EAAK,UAAU,SAQpB,KAAA,IAAM,EAAK,UAAU,gBAqBrB,KAAA,IAAM,EAAK,UAAU,OAErB,KAAA,IAAM,EAAK,UAAU,OAuErB,KAAA,IAAM,EAAK,UAAU,SASrB,KAAA,IAAM,EAAK,UAAU,OAarB,KAAA,IAAM,EAAK,UAAU,UAErB,KAAA,GAAK,EAAK,UAAU,UA4BpB,KAAA,IAAM,EAAK,UAAU,UAoBrB,KAAA,IAAM,EAAK,UAAU,WA0BrB,KAAA,MAAQ,EAAK,UAAU,mBAEvB,KAAA,KAAO,EAAK,UAAU,mBAatB,KAAA,IAAM,EAAK,UAAU,SAgIrB,KAAA,IAAM,EAAK,UAAU,OAGrB,KAAA,GAAK,EAAK,UAAU,gBAzzBlB,KAAK,IAAM,EAAM,EACjB,KAAK,KAAO,EAAO,EACnB,KAAK,SAAW,CAAC,CAAC,EAElB,OAAO,eAAe,KAAM,aAAc,CACxC,MAAO,GACP,aAAc,GACd,SAAU,GACV,WAAY,WA+BT,UAAS,EAAiB,EAAkB,EAAkB,CACnE,MAAO,IAAI,GAAK,EAAS,EAAU,SAS9B,SAAQ,EAAe,EAAkB,CAC9C,GAAI,GAAK,EAAW,EACpB,MAAI,GACF,MAAW,EACN,GAAQ,GAAK,GAAS,EAAQ,MACjC,GAAY,EAAW,GACnB,GAAkB,EAExB,GAAM,EAAK,SAAS,EAAQ,GAAQ,GAAK,EAAI,GAAK,EAAG,IACjD,GAAO,GAAW,GAAS,GACxB,IAEP,IAAS,EACJ,GAAQ,MAAQ,GAAS,EAAQ,MACpC,GAAY,EAAU,GAClB,GAAkB,EAExB,GAAM,EAAK,SAAS,EAAO,EAAQ,EAAI,GAAK,EAAG,IAC3C,GAAO,GAAU,GAAS,GACvB,UAUJ,YAAW,EAAe,EAAkB,CACjD,GAAI,MAAM,GAAQ,MAAO,GAAW,EAAK,MAAQ,EAAK,KACtD,GAAI,EAAU,CACZ,GAAI,EAAQ,EAAG,MAAO,GAAK,MAC3B,GAAI,GAAS,EAAgB,MAAO,GAAK,uBACpC,CACL,GAAI,GAAS,CAAC,EAAgB,MAAO,GAAK,UAC1C,GAAI,EAAQ,GAAK,EAAgB,MAAO,GAAK,UAE/C,MAAI,GAAQ,EAAU,EAAK,WAAW,CAAC,EAAO,GAAU,MACjD,EAAK,SAAS,EAAQ,EAAiB,EAAI,EAAQ,EAAkB,EAAG,SAS1E,YAAW,EAAe,EAAkB,CACjD,MAAO,GAAK,WAAW,EAAM,WAAY,SAUpC,YAAW,EAAa,EAAoB,EAAc,CAC/D,GAAI,EAAI,SAAW,EAAG,KAAM,OAAM,gBAClC,GAAI,IAAQ,OAAS,IAAQ,YAAc,IAAQ,aAAe,IAAQ,YACxE,MAAO,GAAK,KAQd,GAPA,AAAI,MAAO,IAAa,SAErB,GAAQ,EAAY,EAAW,IAEhC,EAAW,CAAC,CAAC,EAEf,EAAQ,GAAS,GACb,EAAQ,GAAK,GAAK,EAAO,KAAM,YAAW,SAE9C,GAAI,GACJ,GAAK,GAAI,EAAI,QAAQ,MAAQ,EAAG,KAAM,OAAM,mBACvC,GAAI,IAAM,EACb,MAAO,GAAK,WAAW,EAAI,UAAU,GAAI,EAAU,GAAO,MAK5D,GAAM,GAAe,EAAK,WAAW,KAAK,IAAI,EAAO,IAEjD,EAAS,EAAK,KAClB,OAAS,GAAI,EAAG,EAAI,EAAI,OAAQ,GAAK,EAAG,CACtC,GAAM,GAAO,KAAK,IAAI,EAAG,EAAI,OAAS,GACpC,GAAQ,SAAS,EAAI,UAAU,EAAG,EAAI,GAAO,GAC/C,GAAI,EAAO,EAAG,CACZ,GAAM,GAAQ,EAAK,WAAW,KAAK,IAAI,EAAO,IAC9C,EAAS,EAAO,IAAI,GAAO,IAAI,EAAK,WAAW,SAE/C,GAAS,EAAO,IAAI,GACpB,EAAS,EAAO,IAAI,EAAK,WAAW,KAGxC,SAAO,SAAW,EACX,QAUF,WAAU,EAAiB,EAAoB,EAAY,CAChE,MAAO,GAAK,EAAK,YAAY,EAAO,GAAY,EAAK,YAAY,EAAO,SASnE,aAAY,EAAiB,EAAkB,CACpD,MAAO,IAAI,GACT,EAAM,GAAM,EAAM,IAAM,EAAM,EAAM,IAAM,GAAO,EAAM,IAAM,GAC7D,EAAM,GAAM,EAAM,IAAM,EAAM,EAAM,IAAM,GAAO,EAAM,IAAM,GAC7D,SAUG,aAAY,EAAiB,EAAkB,CACpD,MAAO,IAAI,GACR,EAAM,IAAM,GAAO,EAAM,IAAM,GAAO,EAAM,IAAM,EAAK,EAAM,GAC7D,EAAM,IAAM,GAAO,EAAM,IAAM,GAAO,EAAM,IAAM,EAAK,EAAM,GAC9D,SAOG,QAAO,EAAc,CAC1B,MAAO,IAAA,aAAa,IAAU,EAAM,aAAkB,SAOjD,WACL,EACA,EAAkB,CAElB,MAAI,OAAO,IAAQ,SAAiB,EAAK,WAAW,EAAK,GACrD,MAAO,IAAQ,SAAiB,EAAK,WAAW,EAAK,GAElD,EAAK,SACV,EAAI,IACJ,EAAI,KACJ,MAAO,IAAa,UAAY,EAAW,EAAI,UAKnD,IAAI,EAA0C,CAC5C,AAAK,EAAK,OAAO,IAAS,GAAS,EAAK,UAAU,IAIlD,GAAM,GAAM,KAAK,OAAS,GACpB,EAAM,KAAK,KAAO,MAClB,EAAM,KAAK,MAAQ,GACnB,EAAM,KAAK,IAAM,MAEjB,EAAM,EAAO,OAAS,GACtB,EAAM,EAAO,KAAO,MACpB,EAAM,EAAO,MAAQ,GACrB,GAAM,EAAO,IAAM,MAErB,EAAM,EACR,EAAM,EACN,GAAM,EACN,EAAM,EACR,UAAO,EAAM,GACb,IAAO,IAAQ,GACf,GAAO,MACP,IAAO,EAAM,EACb,GAAO,KAAQ,GACf,IAAO,MACP,GAAO,EAAM,EACb,GAAO,IAAQ,GACf,GAAO,MACP,GAAO,EAAM,EACb,GAAO,MACA,EAAK,SAAU,IAAO,GAAM,EAAM,GAAO,GAAM,EAAK,KAAK,UAOlE,IAAI,EAAyC,CAC3C,MAAK,GAAK,OAAO,IAAQ,GAAQ,EAAK,UAAU,IACzC,EAAK,SAAS,KAAK,IAAM,EAAM,IAAK,KAAK,KAAO,EAAM,KAAM,KAAK,UAO1E,QAAQ,EAAyC,CAE/C,GADK,EAAK,OAAO,IAAQ,GAAQ,EAAK,UAAU,IAC5C,KAAK,GAAG,GAAQ,MAAO,GAC3B,GAAM,GAAU,KAAK,aACnB,EAAW,EAAM,aACnB,MAAI,IAAW,CAAC,EAAiB,GAC7B,CAAC,GAAW,EAAiB,EAE5B,KAAK,SAEH,EAAM,OAAS,EAAI,KAAK,OAAS,GACrC,EAAM,OAAS,KAAK,MAAQ,EAAM,MAAQ,EAAI,KAAK,MAAQ,EAC1D,GACA,EALuB,KAAK,IAAI,GAAO,aAAe,GAAK,EAejE,OAAO,EAA2C,CAEhD,GADK,EAAK,OAAO,IAAU,GAAU,EAAK,UAAU,IAChD,EAAQ,SAAU,KAAM,OAAM,oBAGlC,GAAI,EAAM,CAIR,GACE,CAAC,KAAK,UACN,KAAK,OAAS,aACd,EAAQ,MAAQ,IAChB,EAAQ,OAAS,GAGjB,MAAO,MAET,GAAM,GAAO,MAAK,SAAW,EAAK,MAAQ,EAAK,OAC7C,KAAK,IACL,KAAK,KACL,EAAQ,IACR,EAAQ,MAEV,MAAO,GAAK,SAAS,EAAK,EAAK,WAAY,KAAK,UAGlD,GAAI,KAAK,SAAU,MAAO,MAAK,SAAW,EAAK,MAAQ,EAAK,KAC5D,GAAI,GAAQ,EAAK,EACjB,GAAK,KAAK,SAyBH,CAIL,GADK,EAAQ,UAAU,GAAU,EAAQ,cACrC,EAAQ,GAAG,MAAO,MAAO,GAAK,MAClC,GAAI,EAAQ,GAAG,KAAK,KAAK,IAEvB,MAAO,GAAK,KACd,EAAM,EAAK,UAjCO,CAGlB,GAAI,KAAK,GAAG,EAAK,WACf,MAAI,GAAQ,GAAG,EAAK,MAAQ,EAAQ,GAAG,EAAK,SAAiB,EAAK,UAEzD,EAAQ,GAAG,EAAK,WAAmB,EAAK,IAI/C,GAAS,AADQ,KAAK,IAAI,GACR,IAAI,GAAS,IAAI,GAC/B,EAAO,GAAG,EAAK,MACV,EAAQ,aAAe,EAAK,IAAM,EAAK,QAE9C,GAAM,KAAK,IAAI,EAAQ,IAAI,IAC3B,EAAM,EAAO,IAAI,EAAI,IAAI,IAClB,IAGN,GAAI,EAAQ,GAAG,EAAK,WAAY,MAAO,MAAK,SAAW,EAAK,MAAQ,EAAK,KAChF,GAAI,KAAK,aACP,MAAI,GAAQ,aAAqB,KAAK,MAAM,IAAI,EAAQ,OACjD,KAAK,MAAM,IAAI,GAAS,MAC1B,GAAI,EAAQ,aAAc,MAAO,MAAK,IAAI,EAAQ,OAAO,MAChE,EAAM,EAAK,KAkBb,IADA,EAAM,KACC,EAAI,IAAI,IAAU,CAGvB,EAAS,KAAK,IAAI,EAAG,KAAK,MAAM,EAAI,WAAa,EAAQ,aAIzD,GAAM,GAAO,KAAK,KAAK,KAAK,IAAI,GAAU,KAAK,KACzC,EAAQ,GAAQ,GAAK,EAAI,KAAK,IAAI,EAAG,EAAO,IAG9C,EAAY,EAAK,WAAW,GAC5B,EAAY,EAAU,IAAI,GAC9B,KAAO,EAAU,cAAgB,EAAU,GAAG,IAC5C,GAAU,EACV,EAAY,EAAK,WAAW,EAAQ,KAAK,UACzC,EAAY,EAAU,IAAI,GAK5B,AAAI,EAAU,UAAU,GAAY,EAAK,KAEzC,EAAM,EAAI,IAAI,GACd,EAAM,EAAI,IAAI,GAEhB,MAAO,GAUT,OAAO,EAAyC,CAE9C,MADK,GAAK,OAAO,IAAQ,GAAQ,EAAK,UAAU,IAC5C,KAAK,WAAa,EAAM,UAAY,KAAK,OAAS,IAAO,GAAK,EAAM,OAAS,IAAO,EAC/E,GACF,KAAK,OAAS,EAAM,MAAQ,KAAK,MAAQ,EAAM,IAOxD,aAAW,CACT,MAAO,MAAK,KAId,qBAAmB,CACjB,MAAO,MAAK,OAAS,EAIvB,YAAU,CACR,MAAO,MAAK,IAId,oBAAkB,CAChB,MAAO,MAAK,MAAQ,EAItB,eAAa,CACX,GAAI,KAAK,aAEP,MAAO,MAAK,GAAG,EAAK,WAAa,GAAK,KAAK,MAAM,gBAEnD,GAAM,GAAM,KAAK,OAAS,EAAI,KAAK,KAAO,KAAK,IAC3C,EACJ,IAAK,EAAM,GAAI,EAAM,GAAe,GAAO,GAAK,IAAU,EAAlC,IAAO,CAC/B,MAAO,MAAK,OAAS,EAAI,EAAM,GAAK,EAAM,EAI5C,YAAY,EAAyC,CACnD,MAAO,MAAK,KAAK,GAAS,EAO5B,mBAAmB,EAAyC,CAC1D,MAAO,MAAK,KAAK,IAAU,EAS7B,QAAM,CACJ,MAAQ,MAAK,IAAM,IAAO,EAI5B,YAAU,CACR,MAAO,CAAC,KAAK,UAAY,KAAK,KAAO,EAIvC,OAAK,CACH,MAAQ,MAAK,IAAM,IAAO,EAI5B,YAAU,CACR,MAAO,MAAK,UAAY,KAAK,MAAQ,EAIvC,QAAM,CACJ,MAAO,MAAK,OAAS,GAAK,KAAK,MAAQ,EAIzC,SAAS,EAAyC,CAChD,MAAO,MAAK,KAAK,GAAS,EAO5B,gBAAgB,EAAyC,CACvD,MAAO,MAAK,KAAK,IAAU,EAO7B,OAAO,EAA2C,CAIhD,GAHK,EAAK,OAAO,IAAU,GAAU,EAAK,UAAU,IAGhD,EAAM,CACR,GAAM,GAAO,MAAK,SAAW,EAAK,MAAQ,EAAK,OAC7C,KAAK,IACL,KAAK,KACL,EAAQ,IACR,EAAQ,MAEV,MAAO,GAAK,SAAS,EAAK,EAAK,WAAY,KAAK,UAGlD,MAAO,MAAK,IAAI,KAAK,IAAI,GAAS,IAAI,IAaxC,SAAS,EAA8C,CACrD,GAAI,KAAK,SAAU,MAAO,GAAK,KAI/B,GAHK,EAAK,OAAO,IAAa,GAAa,EAAK,UAAU,IAGtD,EAAM,CACR,GAAM,IAAM,EAAK,IAAI,KAAK,IAAK,KAAK,KAAM,EAAW,IAAK,EAAW,MACrE,MAAO,GAAK,SAAS,GAAK,EAAK,WAAY,KAAK,UAGlD,GAAI,EAAW,SAAU,MAAO,GAAK,KACrC,GAAI,KAAK,GAAG,EAAK,WAAY,MAAO,GAAW,QAAU,EAAK,UAAY,EAAK,KAC/E,GAAI,EAAW,GAAG,EAAK,WAAY,MAAO,MAAK,QAAU,EAAK,UAAY,EAAK,KAE/E,GAAI,KAAK,aACP,MAAI,GAAW,aAAqB,KAAK,MAAM,IAAI,EAAW,OAClD,KAAK,MAAM,IAAI,GAAY,MAClC,GAAI,EAAW,aAAc,MAAO,MAAK,IAAI,EAAW,OAAO,MAGtE,GAAI,KAAK,GAAG,EAAK,aAAe,EAAW,GAAG,EAAK,YACjD,MAAO,GAAK,WAAW,KAAK,WAAa,EAAW,WAAY,KAAK,UAKvE,GAAM,GAAM,KAAK,OAAS,GACpB,EAAM,KAAK,KAAO,MAClB,EAAM,KAAK,MAAQ,GACnB,EAAM,KAAK,IAAM,MAEjB,EAAM,EAAW,OAAS,GAC1B,EAAM,EAAW,KAAO,MACxB,EAAM,EAAW,MAAQ,GACzB,GAAM,EAAW,IAAM,MAEzB,EAAM,EACR,EAAM,EACN,GAAM,EACN,EAAM,EACR,UAAO,EAAM,GACb,IAAO,IAAQ,GACf,GAAO,MACP,IAAO,EAAM,GACb,GAAO,KAAQ,GACf,IAAO,MACP,IAAO,EAAM,EACb,GAAO,KAAQ,GACf,IAAO,MACP,GAAO,EAAM,GACb,GAAO,IAAQ,GACf,GAAO,MACP,GAAO,EAAM,EACb,GAAO,IAAQ,GACf,GAAO,MACP,GAAO,EAAM,EACb,GAAO,IAAQ,GACf,GAAO,MACP,GAAO,EAAM,GAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EACjD,GAAO,MACA,EAAK,SAAU,IAAO,GAAM,EAAM,GAAO,GAAM,EAAK,KAAK,UAOlE,QAAM,CACJ,MAAI,CAAC,KAAK,UAAY,KAAK,GAAG,EAAK,WAAmB,EAAK,UACpD,KAAK,MAAM,IAAI,EAAK,KAO7B,KAAG,CACD,MAAO,GAAK,SAAS,CAAC,KAAK,IAAK,CAAC,KAAK,KAAM,KAAK,UAInD,UAAU,EAAyC,CACjD,MAAO,CAAC,KAAK,OAAO,GAWtB,GAAG,EAA6B,CAC9B,MAAK,GAAK,OAAO,IAAQ,GAAQ,EAAK,UAAU,IACzC,EAAK,SAAS,KAAK,IAAM,EAAM,IAAK,KAAK,KAAO,EAAM,KAAM,KAAK,UAQ1E,UAAU,EAAsB,CAE9B,MADI,GAAK,OAAO,IAAU,GAAU,EAAQ,SACvC,IAAW,KAAQ,EAAU,KACzB,EAAU,GACV,EAAK,SACV,KAAK,KAAO,EACX,KAAK,MAAQ,EAAY,KAAK,MAAS,GAAK,EAC7C,KAAK,UAEG,EAAK,SAAS,EAAG,KAAK,KAAQ,EAAU,GAAK,KAAK,UAWhE,WAAW,EAAsB,CAE/B,MADI,GAAK,OAAO,IAAU,GAAU,EAAQ,SACvC,IAAW,KAAQ,EAAU,KACzB,EAAU,GACV,EAAK,SACT,KAAK,MAAQ,EAAY,KAAK,MAAS,GAAK,EAC7C,KAAK,MAAQ,EACb,KAAK,UAEG,EAAK,SAAS,KAAK,MAAS,EAAU,GAAK,KAAK,MAAQ,EAAI,EAAI,GAAI,KAAK,UAWvF,mBAAmB,EAAsB,CAGvC,GAFI,EAAK,OAAO,IAAU,GAAU,EAAQ,SAC5C,GAAW,GACP,IAAY,EAAG,MAAO,MACrB,CACH,GAAM,GAAO,KAAK,KAClB,GAAI,EAAU,GAAI,CAChB,GAAM,GAAM,KAAK,IACjB,MAAO,GAAK,SACT,IAAQ,EAAY,GAAS,GAAK,EACnC,IAAS,EACT,KAAK,cAEF,OAAI,KAAY,GAAW,EAAK,SAAS,EAAM,EAAG,KAAK,UAClD,EAAK,SAAS,IAAU,EAAU,GAAK,EAAG,KAAK,WAc/D,SAAS,EAA8C,CACrD,MAAK,GAAK,OAAO,IAAa,GAAa,EAAK,UAAU,IACnD,KAAK,IAAI,EAAW,OAO7B,OAAK,CACH,MAAO,MAAK,SAAW,KAAK,MAAQ,EAAI,KAAK,IAI/C,UAAQ,CACN,MAAI,MAAK,SAAkB,MAAK,OAAS,GAAK,EAAkB,MAAK,MAAQ,GACtE,KAAK,KAAO,EAAkB,MAAK,MAAQ,GAIpD,UAAQ,CACN,MAAO,QAAO,KAAK,YAQrB,QAAQ,EAAY,CAClB,MAAO,GAAK,KAAK,YAAc,KAAK,YAOtC,WAAS,CACP,GAAM,GAAK,KAAK,KACd,EAAK,KAAK,IACZ,MAAO,CACL,EAAK,IACJ,IAAO,EAAK,IACZ,IAAO,GAAM,IACd,IAAO,GACP,EAAK,IACJ,IAAO,EAAK,IACZ,IAAO,GAAM,IACd,IAAO,IAQX,WAAS,CACP,GAAM,GAAK,KAAK,KACd,EAAK,KAAK,IACZ,MAAO,CACL,IAAO,GACN,IAAO,GAAM,IACb,IAAO,EAAK,IACb,EAAK,IACL,IAAO,GACN,IAAO,GAAM,IACb,IAAO,EAAK,IACb,EAAK,KAOT,UAAQ,CACN,MAAK,MAAK,SACH,EAAK,SAAS,KAAK,IAAK,KAAK,KAAM,IADf,KAS7B,SAAS,EAAc,CAErB,GADA,EAAQ,GAAS,GACb,EAAQ,GAAK,GAAK,EAAO,KAAM,YAAW,SAC9C,GAAI,KAAK,SAAU,MAAO,IAC1B,GAAI,KAAK,aAEP,GAAI,KAAK,GAAG,EAAK,WAAY,CAG3B,GAAM,GAAY,EAAK,WAAW,GAChC,EAAM,KAAK,IAAI,GACf,EAAO,EAAI,IAAI,GAAW,IAAI,MAChC,MAAO,GAAI,SAAS,GAAS,EAAK,QAAQ,SAAS,OAC9C,OAAO,IAAM,KAAK,MAAM,SAAS,GAK1C,GAAM,GAAe,EAAK,WAAW,KAAK,IAAI,EAAO,GAAI,KAAK,UAE1D,EAAY,KACZ,EAAS,GAEb,OAAa,CACX,GAAM,GAAS,EAAI,IAAI,GAEnB,EAAS,AADE,GAAI,IAAI,EAAO,IAAI,IAAe,UAAY,GACzC,SAAS,GAE7B,GADA,EAAM,EACF,EAAI,SACN,MAAO,GAAS,EAEhB,KAAO,EAAO,OAAS,GAAG,EAAS,IAAM,EACzC,EAAS,GAAK,EAAS,GAM7B,YAAU,CACR,MAAI,MAAK,SAAiB,KACnB,EAAK,SAAS,KAAK,IAAK,KAAK,KAAM,IAI5C,IAAI,EAA6B,CAC/B,MAAK,GAAK,OAAO,IAAQ,GAAQ,EAAK,UAAU,IACzC,EAAK,SAAS,KAAK,IAAM,EAAM,IAAK,KAAK,KAAO,EAAM,KAAM,KAAK,UAc1E,eAAe,EAAsB,CACnC,MAAI,IAAW,EAAQ,QAAgB,KAAK,WACrC,CAAE,YAAa,KAAK,kBAEtB,kBAAiB,EAA8B,EAAsB,CAC1E,GAAM,GAAS,EAAK,WAAW,EAAI,aACnC,MAAO,IAAW,EAAQ,QAAU,EAAO,WAAa,GAn2B5D,EAAA,KAAA,EAyCS,EAAA,WAAa,EAAK,QAAQ,GAG1B,EAAA,mBAAqB,EAAK,SAAS,WAAa,EAAG,WAAa,EAAG,IAEnE,EAAA,KAAO,EAAK,QAAQ,GAEpB,EAAA,MAAQ,EAAK,QAAQ,EAAG,IAExB,EAAA,IAAM,EAAK,QAAQ,GAEnB,EAAA,KAAO,EAAK,QAAQ,EAAG,IAEvB,EAAA,QAAU,EAAK,QAAQ,IAEvB,EAAA,UAAY,EAAK,SAAS,WAAa,EAAG,WAAa,EAAG,IAE1D,EAAA,UAAY,EAAK,SAAS,EAAG,WAAa,EAAG,IA6yBtD,OAAO,eAAe,EAAK,UAAW,aAAc,CAAE,MAAO,KAC7D,OAAO,eAAe,EAAK,UAAW,YAAa,CAAE,MAAO,0HCh7B5D,GAAM,GAAsB,gDACtB,EAAmB,2BACnB,EAAmB,gBAEnB,EAAe,KACf,EAAe,MACf,EAAgB,KAChB,EAAa,GAGb,EAAa,CACjB,IACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GACA,UAEI,EAAsB,CAC1B,IACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GACA,UACI,EAAsB,CAC1B,IACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GACA,UAEI,EAAiB,kBAGjB,EAAmB,GAEnB,EAAgB,MAEhB,EAAuB,GAEvB,EAAkB,GAGxB,WAAiB,GAAa,CAC5B,MAAO,CAAC,MAAM,SAAS,GAAO,KAIhC,WAAoB,GAAkD,CACpE,GAAM,GAAU,GAAA,KAAK,WAAW,IAAO,IAAO,KAC1C,GAAO,GAAA,KAAK,WAAW,GAE3B,GAAI,CAAC,GAAM,MAAM,IAAM,CAAC,GAAM,MAAM,IAAM,CAAC,GAAM,MAAM,IAAM,CAAC,GAAM,MAAM,GACxE,MAAO,CAAE,SAAU,GAAO,IAAK,IAGjC,OAAS,GAAI,EAAG,GAAK,EAAG,IAEtB,GAAO,GAAK,UAAU,IAEtB,GAAO,GAAK,IAAI,GAAI,IAAA,KAAK,GAAM,MAAM,GAAI,IACzC,GAAM,MAAM,GAAK,GAAK,IAAI,GAAS,IACnC,GAAO,GAAK,OAAO,GAGrB,MAAO,CAAE,SAAU,GAAO,IAAK,IAIjC,WAAsB,GAAY,EAAW,CAC3C,GAAI,CAAC,IAAQ,CAAC,EACZ,MAAO,CAAE,KAAM,GAAA,KAAK,WAAW,GAAI,IAAK,GAAA,KAAK,WAAW,IAG1D,GAAM,IAAW,GAAK,mBAAmB,IACnC,EAAU,GAAI,IAAA,KAAK,GAAK,aAAc,GACtC,EAAY,EAAM,mBAAmB,IACrC,EAAW,GAAI,IAAA,KAAK,EAAM,aAAc,GAE1C,EAAc,GAAS,SAAS,GAChC,EAAa,GAAS,SAAS,GAC7B,EAAc,EAAQ,SAAS,GACjC,EAAa,EAAQ,SAAS,GAElC,SAAc,EAAY,IAAI,EAAW,mBAAmB,KAC5D,EAAa,GAAI,IAAA,KAAK,EAAW,aAAc,GAC5C,IAAI,GACJ,IAAI,EAAW,mBAAmB,KAErC,EAAc,EAAY,IAAI,EAAW,mBAAmB,KAC5D,EAAa,EAAW,UAAU,IAAI,IAAI,GAAI,IAAA,KAAK,EAAW,aAAc,IAGrE,CAAE,KAAM,EAAa,IAAK,GAGnC,YAAkB,GAAY,EAAW,CAEvC,GAAM,IAAS,GAAK,OAAS,EACvB,EAAU,EAAM,OAAS,EAG/B,GAAI,GAAS,EACX,MAAO,GACF,GAAI,KAAW,EAAS,CAC7B,GAAM,GAAS,GAAK,MAAQ,EACtB,EAAU,EAAM,MAAQ,EAC9B,GAAI,EAAS,EAAS,MAAO,GAG/B,MAAO,GAGT,WAAoB,GAAgB,EAAe,CACjD,KAAM,IAAI,WAAU,IAAI,0CAA8C,KAYxE,OAAuB,CAMrB,YAAY,EAAa,CACvB,KAAK,MAAQ,QAQR,YAAW,EAAsB,CAEtC,GAAI,IAAa,GACb,EAAW,GACX,EAAe,GAGf,EAAoB,EAEpB,EAAc,EAEd,EAAU,EAEV,EAAgB,EAEhB,EAAe,EAGb,EAAS,CAAC,GAEZ,EAAgB,EAEhB,GAAe,EAEf,GAAa,EAEb,EAAY,EAGZ,EAAW,EAEX,GAAI,EAEJ,GAAkB,GAAI,IAAA,KAAK,EAAG,GAE9B,GAAiB,GAAI,IAAA,KAAK,EAAG,GAE7B,GAAiB,EAGjB,GAAQ,EAKZ,GAAI,EAAe,QAAU,IAC3B,KAAM,IAAI,WAAU,GAAK,EAAiB,kCAI5C,GAAM,IAAc,EAAe,MAAM,GACnC,GAAW,EAAe,MAAM,GAChC,GAAW,EAAe,MAAM,GAGtC,GAAK,CAAC,IAAe,CAAC,IAAY,CAAC,IAAa,EAAe,SAAW,EACxE,KAAM,IAAI,WAAU,GAAK,EAAiB,kCAG5C,GAAI,GAAa,CAIf,GAAM,IAAiB,GAAY,GAI7B,EAAI,GAAY,GAChB,EAAU,GAAY,GACtB,EAAY,GAAY,GAG9B,AAAI,GAAK,IAAc,QAAW,EAAW,EAAgB,0BAGzD,GAAK,KAAmB,QAAW,EAAW,EAAgB,yBAE9D,IAAM,QAAc,IAAW,IACjC,EAAW,EAAgB,6BAU/B,GALI,GAAe,MAAW,KAAO,EAAe,MAAW,MAC7D,IAAa,EAAe,QAAa,KAIvC,CAAC,EAAQ,EAAe,MAAW,EAAe,MAAW,IAAK,CACpE,GAAI,EAAe,MAAW,KAAO,EAAe,MAAW,IAC7D,MAAO,IAAI,GAAW,GAAA,OAAO,KAAK,GAAa,EAAsB,IAChE,GAAI,EAAe,MAAW,IACnC,MAAO,IAAI,GAAW,GAAA,OAAO,KAAK,IAKtC,KAAO,EAAQ,EAAe,MAAW,EAAe,MAAW,KAAK,CACtE,GAAI,EAAe,MAAW,IAAK,CACjC,AAAI,GAAU,EAAW,EAAgB,6BAEzC,EAAW,GACX,GAAQ,GAAQ,EAChB,SAGF,AAAI,EAAgB,IACd,GAAe,MAAW,KAAO,IAC9B,IACH,GAAe,GAGjB,EAAe,GAGf,EAAO,MAAkB,SAAS,EAAe,IAAQ,IACzD,EAAgB,EAAgB,GAIhC,GAAc,GAAU,EAAU,GAClC,GAAU,GAAgB,EAAgB,GAE9C,EAAc,EAAc,EAC5B,GAAQ,GAAQ,EAGlB,GAAI,GAAY,CAAC,EACf,KAAM,IAAI,WAAU,GAAK,EAAiB,kCAG5C,GAAI,EAAe,MAAW,KAAO,EAAe,MAAW,IAAK,CAElE,GAAM,IAAQ,EAAe,OAAO,EAAE,IAAO,MAAM,GAGnD,GAAI,CAAC,IAAS,CAAC,GAAM,GAAI,MAAO,IAAI,GAAW,GAAA,OAAO,KAAK,IAG3D,EAAW,SAAS,GAAM,GAAI,IAG9B,GAAQ,GAAQ,GAAM,GAAG,OAI3B,GAAI,EAAe,IAAQ,MAAO,IAAI,GAAW,GAAA,OAAO,KAAK,IAM7D,GAFA,GAAa,EAET,CAAC,EACH,GAAa,EACb,EAAY,EACZ,EAAO,GAAK,EACZ,EAAU,EACV,EAAgB,EAChB,EAAoB,UAEpB,EAAY,EAAgB,EAC5B,EAAoB,EAChB,IAAsB,EACxB,KAAO,EAAe,EAAe,EAAoB,KAAO,KAC9D,EAAoB,EAAoB,EAiB9C,IAPA,AAAI,GAAY,GAAiB,EAAgB,EAAW,GAAK,GAC/D,EAAW,EAEX,EAAW,EAAW,EAIjB,EAAW,GAAc,CAI9B,GAFA,EAAY,EAAY,EAEpB,EAAY,GAAa,EAAY,CAGvC,GAAI,AADiB,EAAO,KAAK,IAChB,MAAM,QAAS,CAC9B,EAAW,EACX,MAGF,EAAW,EAAgB,YAE7B,EAAW,EAAW,EAGxB,KAAO,EAAW,GAAgB,EAAgB,GAAS,CAEzD,GAAI,IAAc,GAAK,EAAoB,EAAe,CACxD,EAAW,EACX,EAAoB,EACpB,MAWF,GARA,AAAI,EAAgB,EAElB,EAAU,EAAU,EAGpB,EAAY,EAAY,EAGtB,EAAW,EACb,EAAW,EAAW,MACjB,CAGL,GAAI,AADiB,EAAO,KAAK,IAChB,MAAM,QAAS,CAC9B,EAAW,EACX,MAEF,EAAW,EAAgB,aAM/B,GAAI,EAAY,GAAa,EAAI,EAAmB,CAClD,GAAI,IAAc,EAKlB,AAAI,GACF,GAAe,EAAe,EAC9B,GAAc,GAAc,GAG1B,IACF,GAAe,EAAe,EAC9B,GAAc,GAAc,GAG9B,GAAM,GAAa,SAAS,EAAe,EAAe,EAAY,GAAI,IACtE,EAAW,EAEf,GAAI,GAAc,GAChB,GAAW,EACP,IAAe,IAEjB,IADA,EAAW,EAAO,GAAa,GAAM,EAAI,EAAI,EACxC,GAAI,EAAe,EAAY,EAAG,GAAI,GAAa,KACtD,GAAI,SAAS,EAAe,IAAI,IAAK,CACnC,EAAW,EACX,OAMR,GAAI,EAAU,CACZ,GAAI,GAAO,EAEX,KAAO,GAAQ,EAAG,IAChB,GAAI,EAAE,EAAO,GAAQ,GACnB,GAAO,GAAQ,EAGX,IAAS,GACX,GAAI,EAAW,EACb,EAAW,EAAW,EACtB,EAAO,GAAQ,MAEf,OAAO,IAAI,GACT,GAAA,OAAO,KAAK,GAAa,EAAsB,KAgB7D,GALA,GAAkB,GAAA,KAAK,WAAW,GAElC,GAAiB,GAAA,KAAK,WAAW,GAG7B,IAAsB,EACxB,GAAkB,GAAA,KAAK,WAAW,GAClC,GAAiB,GAAA,KAAK,WAAW,WACxB,EAAY,GAAa,GAAI,CACtC,GAAI,IAAO,GAIX,IAHA,GAAiB,GAAA,KAAK,WAAW,EAAO,OACxC,GAAkB,GAAI,IAAA,KAAK,EAAG,GAEvB,IAAQ,EAAW,KACxB,GAAiB,GAAe,SAAS,GAAA,KAAK,WAAW,KACzD,GAAiB,GAAe,IAAI,GAAA,KAAK,WAAW,EAAO,UAExD,CACL,GAAI,IAAO,GAGX,IAFA,GAAkB,GAAA,KAAK,WAAW,EAAO,OAElC,IAAQ,EAAY,GAAI,KAC7B,GAAkB,GAAgB,SAAS,GAAA,KAAK,WAAW,KAC3D,GAAkB,GAAgB,IAAI,GAAA,KAAK,WAAW,EAAO,MAK/D,IAFA,GAAiB,GAAA,KAAK,WAAW,EAAO,OAEjC,IAAQ,EAAW,KACxB,GAAiB,GAAe,SAAS,GAAA,KAAK,WAAW,KACzD,GAAiB,GAAe,IAAI,GAAA,KAAK,WAAW,EAAO,MAI/D,GAAM,IAAc,EAAa,GAAiB,GAAA,KAAK,WAAW,uBAClE,GAAY,IAAM,GAAY,IAAI,IAAI,IAElC,GAAS,GAAY,IAAK,KAC5B,IAAY,KAAO,GAAY,KAAK,IAAI,GAAA,KAAK,WAAW,KAI1D,GAAiB,EAAW,EAC5B,GAAM,IAAM,CAAE,IAAK,GAAA,KAAK,WAAW,GAAI,KAAM,GAAA,KAAK,WAAW,IAG7D,AACE,GAAY,KAAK,mBAAmB,IAAI,IAAI,GAAA,KAAK,WAAW,IAAI,OAAO,GAAA,KAAK,WAAW,IAGvF,IAAI,KAAO,GAAI,KAAK,GAAG,GAAA,KAAK,WAAW,GAAK,UAAU,KACtD,GAAI,KAAO,GAAI,KAAK,GAClB,GAAA,KAAK,WAAW,IAAgB,IAAI,GAAA,KAAK,WAAW,OAAQ,UAAU,MAExE,GAAI,KAAO,GAAI,KAAK,GAAG,GAAY,KAAK,IAAI,GAAA,KAAK,WAAW,oBAE5D,IAAI,KAAO,GAAI,KAAK,GAAG,GAAA,KAAK,WAAW,GAAiB,OAAQ,UAAU,KAC1E,GAAI,KAAO,GAAI,KAAK,GAAG,GAAY,KAAK,IAAI,GAAA,KAAK,WAAW,oBAG9D,GAAI,IAAM,GAAY,IAGlB,IACF,IAAI,KAAO,GAAI,KAAK,GAAG,GAAA,KAAK,WAAW,yBAIzC,GAAM,IAAS,GAAA,OAAO,MAAM,IAC5B,UAAQ,EAIR,GAAO,MAAW,GAAI,IAAI,IAAM,IAChC,GAAO,MAAY,GAAI,IAAI,KAAO,EAAK,IACvC,GAAO,MAAY,GAAI,IAAI,KAAO,GAAM,IACxC,GAAO,MAAY,GAAI,IAAI,KAAO,GAAM,IAExC,GAAO,MAAW,GAAI,IAAI,KAAO,IACjC,GAAO,MAAY,GAAI,IAAI,MAAQ,EAAK,IACxC,GAAO,MAAY,GAAI,IAAI,MAAQ,GAAM,IACzC,GAAO,MAAY,GAAI,IAAI,MAAQ,GAAM,IAIzC,GAAO,MAAW,GAAI,KAAK,IAAM,IACjC,GAAO,MAAY,GAAI,KAAK,KAAO,EAAK,IACxC,GAAO,MAAY,GAAI,KAAK,KAAO,GAAM,IACzC,GAAO,MAAY,GAAI,KAAK,KAAO,GAAM,IAEzC,GAAO,MAAW,GAAI,KAAK,KAAO,IAClC,GAAO,MAAY,GAAI,KAAK,MAAQ,EAAK,IACzC,GAAO,MAAY,GAAI,KAAK,MAAQ,GAAM,IAC1C,GAAO,MAAY,GAAI,KAAK,MAAQ,GAAM,IAGnC,GAAI,GAAW,IAIxB,UAAQ,CAKN,GAAI,GAEA,GAAqB,EAEnB,EAAc,GAAI,OAAc,IACtC,OAAS,IAAI,EAAG,GAAI,EAAY,OAAQ,KAAK,EAAY,IAAK,EAE9D,GAAI,GAAQ,EAGR,EAAU,GAGV,EAEA,EAA8D,CAAE,MAAO,CAAC,EAAG,EAAG,EAAG,IAEjF,EAAG,EAGD,EAAmB,GAGzB,EAAQ,EAGR,GAAM,GAAS,KAAK,MAId,GACJ,EAAO,KAAY,EAAO,MAAY,EAAM,EAAO,MAAY,GAAO,EAAO,MAAY,GAErF,GACJ,EAAO,KAAY,EAAO,MAAY,EAAM,EAAO,MAAY,GAAO,EAAO,MAAY,GAIrF,EACJ,EAAO,KAAY,EAAO,MAAY,EAAM,EAAO,MAAY,GAAO,EAAO,MAAY,GAErF,EACJ,EAAO,KAAY,EAAO,MAAY,EAAM,EAAO,MAAY,GAAO,EAAO,MAAY,GAG3F,EAAQ,EAQJ,AALQ,CACV,IAAK,GAAI,IAAA,KAAK,GAAK,IACnB,KAAM,GAAI,IAAA,KAAK,EAAM,IAGf,KAAK,SAAS,GAAA,KAAK,OACzB,EAAO,KAAK,KAKd,GAAM,IAAe,GAAQ,GAAM,EAEnC,GAAI,IAAe,GAAM,EAAG,CAE1B,GAAI,KAAgB,EAClB,MAAO,GAAO,KAAK,IAAM,WACpB,GAAI,KAAgB,EACzB,MAAO,MAEP,EAAmB,GAAQ,GAAM,EACjC,EAAkB,EAAS,IAAQ,GAAM,OAG3C,GAAmB,GAAQ,GAAM,EACjC,EAAmB,GAAQ,GAAM,EAInC,GAAM,IAAW,EAAkB,EAYnC,GALA,EAAe,MAAM,GAAM,GAAO,OAAY,IAAkB,KAAQ,IACxE,EAAe,MAAM,GAAK,EAC1B,EAAe,MAAM,GAAK,GAC1B,EAAe,MAAM,GAAK,GAGxB,EAAe,MAAM,KAAO,GAC5B,EAAe,MAAM,KAAO,GAC5B,EAAe,MAAM,KAAO,GAC5B,EAAe,MAAM,KAAO,EAE5B,EAAU,OAEV,KAAK,EAAI,EAAG,GAAK,EAAG,IAAK,CACvB,GAAI,IAAe,EAEb,GAAS,EAAW,GAM1B,GALA,EAAiB,GAAO,SACxB,GAAe,GAAO,IAAI,IAItB,EAAC,GAEL,IAAK,EAAI,EAAG,GAAK,EAAG,IAElB,EAAY,EAAI,EAAI,GAAK,GAAe,GAExC,GAAe,KAAK,MAAM,GAAe,IAS/C,GAAI,EACF,GAAqB,EACrB,EAAY,GAAS,MAGrB,KADA,GAAqB,GACd,CAAC,EAAY,IAClB,GAAqB,GAAqB,EAC1C,EAAQ,EAAQ,EAKpB,GAAM,IAAsB,GAAqB,EAAI,GASrD,GAAI,IAAuB,IAAM,IAAuB,IAAM,GAAW,EAAG,CAM1E,GAAI,GAAqB,GACvB,SAAO,KAAK,GAAG,KACf,AAAI,GAAW,EAAG,EAAO,KAAK,KAAO,IAC5B,GAAW,GAAG,EAAO,KAAK,IAAM,IAClC,EAAO,KAAK,IAGrB,EAAO,KAAK,GAAG,EAAY,QAC3B,GAAqB,GAAqB,EAEtC,IACF,EAAO,KAAK,KAGd,OAAS,IAAI,EAAG,GAAI,GAAoB,KACtC,EAAO,KAAK,GAAG,EAAY,QAI7B,EAAO,KAAK,KACZ,AAAI,GAAsB,EACxB,EAAO,KAAK,IAAM,IAElB,EAAO,KAAK,GAAG,cAIb,IAAY,EACd,OAAS,IAAI,EAAG,GAAI,GAAoB,KACtC,EAAO,KAAK,GAAG,EAAY,YAExB,CACL,GAAI,IAAiB,GAAqB,GAG1C,GAAI,GAAiB,EACnB,OAAS,IAAI,EAAG,GAAI,GAAgB,KAClC,EAAO,KAAK,GAAG,EAAY,YAG7B,GAAO,KAAK,KAKd,IAFA,EAAO,KAAK,KAEL,KAAmB,GACxB,EAAO,KAAK,KAGd,OAAS,IAAI,EAAG,GAAI,GAAqB,KAAK,IAAI,GAAiB,EAAG,GAAI,KACxE,EAAO,KAAK,GAAG,EAAY,QAKjC,MAAO,GAAO,KAAK,IAGrB,QAAM,CACJ,MAAO,CAAE,eAAgB,KAAK,YAIhC,gBAAc,CACZ,MAAO,CAAE,eAAgB,KAAK,kBAIzB,kBAAiB,EAAuB,CAC7C,MAAO,GAAW,WAAW,EAAI,iBA/mBrC,EAAA,WAAA,EAmnBA,OAAO,eAAe,EAAW,UAAW,YAAa,CAAE,MAAO,kIC5wBlE,OAAmB,CASjB,YAAY,EAAa,CACvB,AAAK,YAA6B,SAChC,GAAQ,EAAM,WAGhB,KAAK,MAAQ,CAAC,EAQhB,SAAO,CACL,MAAO,MAAK,MAId,QAAM,CACJ,MAAO,MAAK,MAId,eAAe,EAAsB,CACnC,GAAI,GAAY,GAAQ,QAAW,EAAQ,SAAW,SAAS,KAAK,QAClE,MAAO,MAAK,MAKd,GAAI,OAAO,GAAG,KAAK,KAAK,KAAK,OAAQ,IACnC,MAAO,CAAE,cAAe,IAAI,KAAK,MAAM,QAAQ,MAGjD,GAAI,GACJ,MAAI,QAAO,UAAU,KAAK,OACxB,GAAgB,KAAK,MAAM,QAAQ,GAC/B,EAAc,QAAU,IAC1B,GAAgB,KAAK,MAAM,cAAc,IAAI,gBAG/C,EAAgB,KAAK,MAAM,WAGtB,CAAE,uBAIJ,kBAAiB,EAAqB,EAAsB,CACjE,GAAM,GAAc,WAAW,EAAI,eACnC,MAAO,IAAW,EAAQ,QAAU,EAAc,GAAI,GAAO,IA3DjE,EAAA,OAAA,EA+DA,OAAO,eAAe,EAAO,UAAW,YAAa,CAAE,MAAO,yHC/D9D,OAAkB,CAShB,YAAY,EAAsB,CAChC,AAAK,YAA6B,SAChC,GAAQ,EAAM,WAGhB,KAAK,MAAQ,CAAC,EAQhB,SAAO,CACL,MAAO,MAAK,MAId,QAAM,CACJ,MAAO,MAAK,MAId,eAAe,EAAsB,CACnC,MAAI,IAAY,GAAQ,SAAW,EAAQ,QAAgB,KAAK,MACzD,CAAE,WAAY,KAAK,MAAM,kBAI3B,kBAAiB,EAAoB,EAAsB,CAChE,MAAO,IAAW,EAAQ,QAAU,SAAS,EAAI,WAAY,IAAM,GAAI,GAAM,EAAI,aAvCrF,EAAA,MAAA,EA2CA,OAAO,eAAe,EAAM,UAAW,YAAa,CAAE,MAAO,qHC7C7D,GAAI,GAiIgB,EAAA,IAAA,EA/HpB,GAAM,GAAQ,SAAU,EAAoB,CAE1C,MAAO,IAAmB,EAAgB,MAAQ,MAAQ,GAI5D,YAAkB,CAEhB,MACE,GAAM,MAAO,aAAe,UAAY,aACxC,EAAM,MAAO,SAAW,UAAY,SACpC,EAAM,MAAO,OAAS,UAAY,OAClC,EAAM,MAAO,KAAW,UAAY,KACpC,SAAS,iBAIb,GAAM,GAAa,IACnB,AAAI,OAAO,UAAU,eAAe,KAAK,EAAY,OACnD,EAAA,IAAA,EAAU,EAAW,IAGrB,EAAA,IAAA,EAAW,KAAS,CAGlB,YAAY,EAAyB,GAAE,CACrC,KAAK,MAAQ,GACb,KAAK,QAAU,GAEf,OAAS,GAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACrC,GAAI,EAAM,IAAM,KAAM,SACtB,GAAM,GAAQ,EAAM,GACd,EAAM,EAAM,GACZ,EAAQ,EAAM,GAEpB,KAAK,MAAM,KAAK,GAGhB,KAAK,QAAQ,GAAO,CAAE,EAAG,EAAO,EAAG,KAAK,MAAM,OAAS,IAG3D,OAAK,CACH,KAAK,MAAQ,GACb,KAAK,QAAU,GAEjB,OAAO,EAAW,CAChB,GAAM,GAAQ,KAAK,QAAQ,GAC3B,MAAI,IAAS,KAAa,GAE1B,OAAO,MAAK,QAAQ,GAEpB,KAAK,MAAM,OAAO,EAAM,EAAG,GACpB,IAET,SAAO,CACL,GAAI,GAAQ,EAEZ,MAAO,CACL,KAAM,IAAA,CACJ,GAAM,GAAM,KAAK,MAAM,KACvB,MAAO,CACL,MAAO,IAAQ,OAAY,CAAC,EAAK,KAAK,QAAQ,GAAK,GAAK,OACxD,KAAM,IAAQ,UAKtB,QAAQ,EAAqE,EAAW,CACtF,EAAO,GAAQ,KAEf,OAAS,GAAI,EAAG,EAAI,KAAK,MAAM,OAAQ,IAAK,CAC1C,GAAM,GAAM,KAAK,MAAM,GAEvB,EAAS,KAAK,EAAM,KAAK,QAAQ,GAAK,EAAG,EAAK,IAGlD,IAAI,EAAW,CACb,MAAO,MAAK,QAAQ,GAAO,KAAK,QAAQ,GAAK,EAAI,OAEnD,IAAI,EAAW,CACb,MAAO,MAAK,QAAQ,IAAQ,KAE9B,MAAI,CACF,GAAI,GAAQ,EAEZ,MAAO,CACL,KAAM,IAAA,CACJ,GAAM,GAAM,KAAK,MAAM,KACvB,MAAO,CACL,MAAO,IAAQ,OAAY,EAAM,OACjC,KAAM,IAAQ,UAKtB,IAAI,EAAa,EAAU,CACzB,MAAI,MAAK,QAAQ,GACf,MAAK,QAAQ,GAAK,EAAI,EACf,MAIT,MAAK,MAAM,KAAK,GAGhB,KAAK,QAAQ,GAAO,CAAE,EAAG,EAAO,EAAG,KAAK,MAAM,OAAS,GAChD,MAET,QAAM,CACJ,GAAI,GAAQ,EAEZ,MAAO,CACL,KAAM,IAAA,CACJ,GAAM,GAAM,KAAK,MAAM,KACvB,MAAO,CACL,MAAO,IAAQ,OAAY,KAAK,QAAQ,GAAK,EAAI,OACjD,KAAM,IAAQ,aAKlB,OAAI,CACN,MAAO,MAAK,MAAM,qHC5HxB,OAAmB,CAIjB,gBAAc,CACZ,MAAO,CAAE,QAAS,SAIb,mBAAgB,CACrB,MAAO,IAAI,IAVf,EAAA,OAAA,EAcA,OAAO,eAAe,EAAO,UAAW,YAAa,CAAE,MAAO,0HCd9D,OAAmB,CAIjB,gBAAc,CACZ,MAAO,CAAE,QAAS,SAIb,mBAAgB,CACrB,MAAO,IAAI,IAVf,EAAA,OAAA,EAcA,OAAO,eAAe,EAAO,UAAW,YAAa,CAAE,MAAO,4HClB9D,GAAM,GAAiB,GAAA,YAAY,GAG7B,EAAoB,GAAI,QAAO,qBAG/B,EAAqB,GAC3B,OAAS,GAAI,EAAG,EAAI,IAAK,IACvB,EAAS,GAAM,IAAK,GAAK,IAAM,IAAM,EAAE,SAAS,IAIlD,GAAM,GAAyB,GAC3B,EAAI,EACR,KAAO,EAAI,IAAI,EAAa,GAAO,GAAK,IACxC,KAAO,EAAI,IAAI,EAAa,GAAO,GAAK,GAAK,EAAa,GAAO,GAAK,GAAK,IAc3E,GAAM,GAAM,OAAO,MAMnB,OAAqB,CAkBnB,YAAY,EAAuD,CA6BjE,GA3BI,YAAc,IAChB,MAAK,GAAO,EAAG,GACf,KAAK,KAAO,EAAG,MAGb,MAAO,IAAO,UAAY,GAAM,MAAQ,IAC1C,CAAI,eAAiB,IAAM,MAAO,GAAG,aAAgB,WACnD,KAAK,GAAO,GAAA,OAAO,KAAK,EAAG,cAAe,OAE1C,KAAK,GAAO,MAAO,GAAG,IAAO,SAAW,GAAA,OAAO,KAAK,EAAG,IAAM,EAAG,IAKhE,IAAM,MAAQ,MAAO,IAAO,WAE9B,MAAK,GAAO,EAAS,SAAS,MAAO,IAAO,SAAW,EAAK,QAExD,EAAS,gBACX,MAAK,KAAO,KAAK,GAAG,SAAS,SAI7B,YAAY,OAAO,IAAO,EAAG,aAAe,IAC9C,MAAK,GAAO,GAAA,aAAa,IAGvB,MAAO,IAAO,SAChB,GAAI,EAAG,SAAW,GAAI,CACpB,GAAM,GAAQ,GAAA,OAAO,KAAK,GAC1B,AAAI,EAAM,aAAe,IACvB,MAAK,GAAO,WAEL,EAAG,SAAW,IAAM,EAAkB,KAAK,GACpD,KAAK,GAAO,GAAA,OAAO,KAAK,EAAI,WAE5B,MAAM,IAAI,WACR,8FAKN,AAAI,EAAS,gBACX,MAAK,KAAO,KAAK,GAAG,SAAS,WAQ7B,KAAE,CACJ,MAAO,MAAK,MAGV,IAAG,EAAa,CAClB,KAAK,GAAO,EACR,EAAS,gBACX,MAAK,KAAO,EAAM,SAAS,WAQ3B,iBAAc,CAChB,MAAO,MAAK,GAAG,YAAY,MAGzB,gBAAe,EAAa,CAE9B,KAAK,GAAG,cAAc,EAAO,GAI/B,aAAW,CACT,GAAI,EAAS,gBAAkB,KAAK,KAClC,MAAO,MAAK,KAGd,GAAM,GAAY,KAAK,GAAG,SAAS,OAEnC,MAAI,GAAS,gBAAkB,CAAC,KAAK,MACnC,MAAK,KAAO,GAGP,QASF,SAAM,CACX,MAAQ,GAAS,MAAS,GAAS,MAAQ,GAAK,eAQ3C,UAAS,EAAa,CAC3B,AAAI,AAAa,MAAO,IAApB,UACF,GAAO,CAAC,CAAE,MAAK,MAAQ,MAGzB,GAAM,GAAM,EAAS,SACf,EAAS,GAAA,OAAO,MAAM,IAG5B,SAAO,cAAc,EAAM,GAG3B,EAAO,GAAK,EAAe,GAC3B,EAAO,GAAK,EAAe,GAC3B,EAAO,GAAK,EAAe,GAC3B,EAAO,GAAK,EAAe,GAC3B,EAAO,GAAK,EAAe,GAG3B,EAAO,IAAM,EAAM,IACnB,EAAO,IAAO,GAAO,EAAK,IAC1B,EAAO,GAAM,GAAO,GAAM,IAEnB,EAST,SAAS,EAAe,CAEtB,MAAI,GAAe,KAAK,GAAG,SAAS,GAC7B,KAAK,cAOd,QAAM,CACJ,MAAO,MAAK,cAQd,OAAO,EAAyC,CAC9C,MAAI,AAAyB,IAAY,KAChC,GAGL,YAAmB,GACd,KAAK,aAAe,EAAQ,WAInC,MAAO,IAAY,UACnB,EAAS,QAAQ,IACjB,EAAQ,SAAW,IACnB,KAAK,aAAc,IAAA,OAEZ,IAAY,KAAK,GAAG,SAAS,UAGlC,MAAO,IAAY,UAAY,EAAS,QAAQ,IAAY,EAAQ,SAAW,GAC1E,EAAQ,gBAAkB,KAAK,cAGpC,MAAO,IAAY,UAAY,EAAS,QAAQ,IAAY,EAAQ,SAAW,GAC1E,GAAA,OAAO,KAAK,GAAS,OAAO,KAAK,IAIxC,MAAO,IAAY,UACnB,eAAiB,IACjB,MAAO,GAAQ,aAAgB,WAExB,EAAQ,gBAAkB,KAAK,cAGjC,GAIT,cAAY,CACV,GAAM,GAAY,GAAI,MAChB,EAAO,KAAK,GAAG,aAAa,GAClC,SAAU,QAAQ,KAAK,MAAM,GAAQ,KAC9B,QAIF,WAAQ,CACb,MAAO,IAAI,SAQN,gBAAe,EAAY,CAChC,GAAM,GAAS,GAAA,OAAO,KAAK,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAE7D,SAAO,cAAc,EAAM,GAEpB,GAAI,GAAS,SAQf,qBAAoB,EAAiB,CAE1C,GAAI,MAAO,IAAc,aAAgB,GAAa,MAAQ,EAAU,SAAW,GACjF,KAAM,IAAI,WACR,2FAIJ,MAAO,IAAI,GAAS,GAAA,OAAO,KAAK,EAAW,cAQtC,SAAQ,EAAsD,CACnE,MAAI,IAAM,KAAa,GAEnB,MAAO,IAAO,SACT,GAGL,MAAO,IAAO,SACT,EAAG,SAAW,IAAO,EAAG,SAAW,IAAM,EAAkB,KAAK,GAGrE,YAAc,IAId,YAAc,IAAA,QAAU,EAAG,SAAW,GACjC,GAIL,MAAO,IAAO,UAAY,eAAiB,IAAM,MAAO,GAAG,aAAgB,WACzE,MAAO,GAAG,IAAO,SACZ,EAAG,GAAG,SAAW,GAEnB,EAAG,cAAc,SAAW,IAAM,EAAkB,KAAK,EAAG,GAAG,SAAS,QAG1E,GAIT,gBAAc,CACZ,MAAI,MAAK,YAAoB,CAAE,KAAM,KAAK,eACnC,CAAE,KAAM,KAAK,SAAS,cAIxB,kBAAiB,EAAqB,CAC3C,MAAO,IAAI,GAAS,EAAI,OA1S5B,EAAA,SAAA,EAIS,EAAA,MAAQ,CAAC,CAAE,MAAK,SAAW,UA2SpC,OAAO,eAAe,EAAS,UAAW,WAAY,CACpD,MAAO,GAAA,UACL,AAAC,GAAiB,EAAS,SAAS,GACpC,6DAIJ,OAAO,eAAe,EAAS,UAAW,SAAU,CAClD,MAAO,GAAA,UAAU,IAAM,EAAS,SAAU,uDAG5C,OAAO,eAAe,EAAS,UAAW,UAAW,CACnD,MAAO,GAAA,UAAU,IAAM,EAAS,SAAU,uDAG5C,OAAO,eAAe,EAAU,UAAW,CACzC,MAAO,GAAA,UAAU,IAAM,EAAS,SAAU,uDAG5C,GAAM,GAAU,OAAO,IAAI,8BAO3B,OAAO,eAAe,EAAS,UAAW,EAAS,EAAS,UAAU,UACtE,OAAO,eAAe,EAAS,UAAW,UAAW,EAAS,UAAU,UAExE,OAAO,eAAe,EAAS,UAAW,YAAa,CAAE,MAAO,6zBCnXnD,EAAA,eAAiB,WAEjB,EAAA,eAAiB,YAEjB,EAAA,eAAiB,KAAK,IAAI,EAAG,IAAM,EAEnC,EAAA,eAAiB,CAAC,KAAK,IAAI,EAAG,IAM9B,EAAA,WAAa,KAAK,IAAI,EAAG,IAMzB,EAAA,WAAa,CAAC,KAAK,IAAI,EAAG,IAG1B,EAAA,iBAAmB,EAGnB,EAAA,iBAAmB,EAGnB,EAAA,iBAAmB,EAGnB,EAAA,gBAAkB,EAGlB,EAAA,iBAAmB,EAGnB,EAAA,oBAAsB,EAGtB,EAAA,cAAgB,EAGhB,EAAA,kBAAoB,EAGpB,EAAA,eAAiB,EAGjB,EAAA,eAAiB,GAGjB,EAAA,iBAAmB,GAGnB,EAAA,oBAAsB,GAGtB,EAAA,eAAiB,GAGjB,EAAA,iBAAmB,GAGnB,EAAA,uBAAyB,GAGzB,EAAA,cAAgB,GAGhB,EAAA,oBAAsB,GAGtB,EAAA,eAAiB,GAGjB,EAAA,qBAAuB,GAGvB,EAAA,kBAAoB,IAGpB,EAAA,kBAAoB,IAGpB,EAAA,4BAA8B,EAG9B,EAAA,6BAA+B,EAG/B,EAAA,+BAAiC,EAGjC,EAAA,yBAA2B,EAG3B,EAAA,6BAA+B,EAG/B,EAAA,wBAA0B,EAG1B,EAAA,iCAAmC,i6BCjGhD,WACE,EACA,EACA,EAAyB,CAEzB,GAAI,GAAc,EAAI,EAEtB,GAAI,MAAM,QAAQ,GAChB,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IACjC,GAAe,EACb,EAAE,WACF,EAAO,GACP,EACA,GACA,OAGC,CAGL,AAAI,EAAO,QACT,GAAS,EAAO,UAIlB,OAAW,KAAO,GAChB,GAAe,EAAiB,EAAK,EAAO,GAAM,EAAoB,GAAO,GAIjF,MAAO,GA9BT,EAAA,oBAAA,EAkCA,WACE,EAEA,EACA,EAAqB,GACrB,EAAU,GACV,EAAkB,GAAK,CAOvB,OAJI,GAAS,EAAM,QACjB,GAAQ,EAAM,UAGR,MAAO,QACR,SACH,MAAO,GAAI,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,EAAI,GAAA,OAAO,WAAW,EAAO,QAAU,MACrF,SACH,MACE,MAAK,MAAM,KAAW,GACtB,GAAS,EAAU,YACnB,GAAS,EAAU,YAEf,GAAS,EAAU,gBAAkB,GAAS,EAAU,eAElD,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GAAM,GAAI,GAMjE,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GAAM,GAAI,OAEtE,YACH,MAAI,IAAW,CAAC,EACN,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GAAK,EAC7D,MACJ,UACH,MAAQ,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GAAM,GAAI,OACpE,SACH,GAAI,GAAS,MAAQ,EAAM,YAAiB,UAAY,EAAM,YAAiB,SAC7E,MAAQ,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GAAK,EAC7D,GAAI,EAAM,YAAiB,YAAc,EAAM,YAAiB,WACrE,MAAQ,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GAAM,IAAK,GACnE,GAAI,YAAiB,OAAQ,GAAA,OAAO,GACzC,MAAQ,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GAAM,GAAI,GAClE,GAAI,YAAY,OAAO,IAAU,YAAiB,aACvD,MACG,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GAAM,GAAI,EAAI,GAAK,EAAM,WAE5E,GACL,EAAM,YAAiB,QACvB,EAAM,YAAiB,UACvB,EAAM,YAAiB,YAEvB,MAAQ,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GAAM,GAAI,GAClE,GAAI,EAAM,YAAiB,aAChC,MAAQ,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GAAM,IAAK,GACnE,GAAI,EAAM,YAAiB,OAEhC,MAAI,GAAM,OAAS,MAAQ,OAAO,KAAK,EAAM,OAAO,OAAS,EAExD,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GACtD,EACA,EACA,EACA,GAAA,OAAO,WAAW,EAAM,KAAK,WAAY,QACzC,EACA,EAAoB,EAAM,MAAO,EAAoB,GAIpD,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GACtD,EACA,EACA,GAAA,OAAO,WAAW,EAAM,KAAK,WAAY,QACzC,EAGC,GAAI,EAAM,YAAiB,SAEhC,MAAI,GAAM,WAAa,GAAA,OAAO,mBAEzB,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GACrD,GAAM,SAAW,EAAI,EAAI,EAAI,GAI7B,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GAAM,GAAM,SAAW,EAAI,EAAI,GAGpF,GAAI,EAAM,YAAiB,SAChC,MACG,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GACtD,GAAA,OAAO,WAAW,EAAM,MAAO,QAC/B,EACA,EACA,EAEG,GAAI,EAAM,YAAiB,QAAS,CAEzC,GAAM,GAAiB,OAAO,OAC5B,CACE,KAAM,EAAM,WACZ,IAAK,EAAM,KAEb,EAAM,QAIR,MAAI,GAAM,IAAM,MACd,GAAe,IAAS,EAAM,IAI7B,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GACtD,EACA,EAAoB,EAAgB,EAAoB,OAErD,OACL,aAAiB,SACjB,OAAO,UAAU,SAAS,KAAK,KAAW,kBAGvC,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GACtD,EACA,GAAA,OAAO,WAAW,EAAM,OAAQ,QAChC,EACC,GAAM,OAAS,EAAI,GACnB,GAAM,WAAa,EAAI,GACvB,GAAM,UAAY,EAAI,GACvB,EAEO,EAAM,YAAiB,aAE7B,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GACtD,EACA,GAAA,OAAO,WAAW,EAAM,QAAS,QACjC,EACA,GAAA,OAAO,WAAW,EAAM,QAAS,QACjC,EAIC,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GACtD,EAAoB,EAAO,EAAoB,GAC/C,MAGD,WAEH,GACE,YAAiB,SACjB,OAAO,UAAU,SAAS,KAAK,KAAW,mBAC1C,OAAO,KAAK,KAAW,kBAEvB,MACG,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GACtD,EACA,GAAA,OAAO,WAAW,EAAM,OAAQ,QAChC,EACC,GAAM,OAAS,EAAI,GACnB,GAAM,WAAa,EAAI,GACvB,GAAM,UAAY,EAAI,GACvB,EAGF,GAAI,GAAsB,EAAM,OAAS,MAAQ,OAAO,KAAK,EAAM,OAAO,OAAS,EACjF,MACG,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GACtD,EACA,EACA,EACA,GAAA,OAAO,WAAW,GAAA,yBAAyB,GAAQ,QACnD,EACA,EAAoB,EAAM,MAAO,EAAoB,GAElD,GAAI,EACT,MACG,IAAQ,KAAO,GAAA,OAAO,WAAW,EAAM,QAAU,EAAI,GACtD,EACA,EACA,GAAA,OAAO,WAAW,GAAA,yBAAyB,GAAQ,QACnD,EAMV,MAAO,oIClOT,WAAqB,EAAW,CAC9B,MAAO,GAAI,MAAM,IAAI,OAAO,KAAK,IAqBnC,OAAuB,CASrB,YAAY,EAAiB,EAAgB,CAC3C,KAAK,QAAU,EACf,KAAK,QAAU,GAAW,GAE1B,EAAY,KAAK,SAGjB,OAAS,GAAI,EAAG,EAAI,KAAK,QAAQ,OAAQ,IACvC,GACE,CACE,MAAK,QAAQ,KAAO,KACpB,KAAK,QAAQ,KAAO,KACpB,KAAK,QAAQ,KAAO,KACpB,KAAK,QAAQ,KAAO,KACpB,KAAK,QAAQ,KAAO,KACpB,KAAK,QAAQ,KAAO,KAGtB,KAAM,IAAI,OAAM,kCAAkC,KAAK,QAAQ,8BAK9D,cAAa,EAAgB,CAClC,MAAO,GAAU,EAAQ,MAAM,IAAI,OAAO,KAAK,IAAM,GAIvD,eAAe,EAAsB,CAEnC,MADA,GAAU,GAAW,GACjB,EAAQ,OACH,CAAE,OAAQ,KAAK,QAAS,SAAU,KAAK,SAEzC,CAAE,mBAAoB,CAAE,QAAS,KAAK,QAAS,QAAS,KAAK,gBAI/D,kBAAiB,EAAkD,CACxE,GAAI,UAAY,GACd,GAAI,MAAO,GAAI,QAAW,UAExB,GAAI,EAAI,OAAO,YAAc,aAC3B,MAAQ,OAGV,OAAO,IAAI,GAAW,EAAI,OAAQ,EAAW,aAAa,EAAI,WAGlE,GAAI,sBAAwB,GAC1B,MAAO,IAAI,GACT,EAAI,mBAAmB,QACvB,EAAW,aAAa,EAAI,mBAAmB,UAGnD,KAAM,IAAI,WAAU,4CAA4C,KAAK,UAAU,OA/DnF,EAAA,WAAA,EAmEA,OAAO,eAAe,EAAW,UAAW,YAAa,CAAE,MAAO,sIClFlE,OAAuB,CAOrB,YAAY,EAAa,CACvB,KAAK,MAAQ,EAIf,SAAO,CACL,MAAO,MAAK,MAId,UAAQ,CACN,MAAO,MAAK,MAId,SAAO,CACL,MAAO,MAAK,MAId,QAAM,CACJ,MAAO,MAAK,MAId,gBAAc,CACZ,MAAO,CAAE,QAAS,KAAK,aAIlB,kBAAiB,EAAuB,CAC7C,MAAO,IAAI,GAAW,EAAI,UAtC9B,EAAA,WAAA,EA0CA,OAAO,eAAe,EAAW,UAAW,YAAa,CAAE,MAAO,6JC1CrD,EAAA,0BAAmD,GAAA,KAWhE,eAA+B,GAAA,yBAAyB,CActD,YAAY,EAAoB,EAAa,CAC3C,AAAI,GAAA,KAAK,OAAO,GACd,MAAM,EAAI,IAAK,EAAI,KAAM,IAEzB,MAAM,EAAK,EAAM,IAEnB,OAAO,eAAe,KAAM,YAAa,CACvC,MAAO,YACP,SAAU,GACV,aAAc,GACd,WAAY,KAIhB,QAAM,CACJ,MAAO,CACL,WAAY,KAAK,kBAKd,SAAQ,EAAa,CAC1B,MAAO,IAAI,GAAU,GAAA,KAAK,QAAQ,EAAO,WAIpC,YAAW,EAAa,CAC7B,MAAO,IAAI,GAAU,GAAA,KAAK,WAAW,EAAO,WASvC,UAAS,EAAiB,EAAgB,CAC/C,MAAO,IAAI,GAAU,EAAS,SASzB,YAAW,EAAa,EAAgB,CAC7C,MAAO,IAAI,GAAU,GAAA,KAAK,WAAW,EAAK,GAAM,IAIlD,gBAAc,CACZ,MAAO,CAAE,WAAY,CAAE,EAAG,KAAK,OAAS,EAAG,EAAG,KAAK,MAAQ,UAItD,kBAAiB,EAAsB,CAC5C,MAAO,IAAI,GAAU,EAAI,WAAW,EAAG,EAAI,WAAW,IAvE1D,EAAA,UAAA,EAGkB,EAAA,UAAY,GAAA,KAAK,2KCvBnC,GAAM,GAAY,IACZ,EAAiB,IACjB,EAAmB,IACnB,EAAkB,IAClB,EAAkB,IAElB,EAAe,IACf,EAAiB,IACjB,EAAgB,IAChB,EAAkB,IAQxB,WACE,EACA,EACA,EAAW,CAEX,GAAI,GAAe,EAEnB,OAAS,GAAI,EAAO,EAAI,EAAK,GAAK,EAAG,CACnC,GAAM,GAAO,EAAM,GAEnB,GAAI,EAAc,CAChB,GAAK,GAAO,KAAoB,EAC9B,MAAO,GAET,GAAgB,UACP,EAAO,EAChB,GAAK,GAAO,KAAsB,EAChC,EAAe,UACL,GAAO,KAAqB,EACtC,EAAe,UACL,GAAO,KAAqB,EACtC,EAAe,MAEf,OAAO,GAKb,MAAO,CAAC,EA5BV,EAAA,aAAA,4HCgCA,GAAM,GAAkB,GAAA,KAAK,WAAW,EAAU,YAC5C,EAAkB,GAAA,KAAK,WAAW,EAAU,YAE5C,EAA8C,GAEpD,WACE,EACA,EACA,EAAiB,CAEjB,EAAU,GAAkB,GAC5B,GAAM,GAAQ,GAAW,EAAQ,MAAQ,EAAQ,MAAQ,EAEnD,EACJ,EAAO,GACN,EAAO,EAAQ,IAAM,EACrB,EAAO,EAAQ,IAAM,GACrB,EAAO,EAAQ,IAAM,GAExB,GAAI,EAAO,EACT,KAAM,IAAI,OAAM,8BAA8B,KAGhD,GAAI,EAAQ,kCAAoC,EAAO,OAAS,EAC9D,KAAM,IAAI,OAAM,iBAAiB,EAAO,+BAA+B,KAGzE,GAAI,CAAC,EAAQ,kCAAoC,EAAO,SAAW,EACjE,KAAM,IAAI,OAAM,iBAAiB,EAAO,6BAA6B,KAGvE,GAAI,EAAO,EAAQ,EAAO,WACxB,KAAM,IAAI,OACR,cAAc,qBAAwB,8BAAkC,EAAO,eAKnF,GAAI,EAAO,EAAQ,EAAO,KAAO,EAC/B,KAAM,IAAI,OAAM,+EAIlB,MAAO,GAAkB,EAAQ,EAAO,EAAS,GAtCnD,EAAA,YAAA,EAyCA,WACE,EACA,EACA,EACA,EAAU,GAAK,CAEf,GAAM,GAAgB,EAAQ,eAAoB,KAAO,GAAQ,EAAQ,cACnE,EAAiB,EAAQ,gBAAqB,KAAO,GAAQ,EAAQ,eAErE,EAAc,EAAQ,aAAkB,KAAO,KAAO,EAAQ,YAG9D,EAAM,EAAQ,KAAU,KAAO,GAAQ,EAAQ,IAG/C,EAAa,MAAO,GAAQ,YAAkB,UAAY,EAAQ,WAAgB,GAGlF,EAAiB,EAAQ,gBAAqB,KAAO,GAAQ,EAAQ,eACrE,EAAe,EAAQ,cAAmB,KAAO,GAAO,EAAQ,aAChE,EAAgB,EAAQ,eAAoB,KAAO,GAAO,EAAQ,cAGlE,GAAa,EAGnB,GAAI,EAAO,OAAS,EAAG,KAAM,IAAI,OAAM,uCAGvC,GAAM,GACJ,EAAO,KAAY,EAAO,MAAY,EAAM,EAAO,MAAY,GAAO,EAAO,MAAY,GAG3F,GAAI,EAAO,GAAK,EAAO,EAAO,OAAQ,KAAM,IAAI,OAAM,wBAGtD,GAAM,GAAmB,EAAU,GAAK,GAEpC,GAAa,EACX,EAAO,GAGb,KAAO,CAAC,GAAM,CAEZ,GAAM,GAAc,EAAO,KAG3B,GAAI,IAAgB,EAAG,MAGvB,GAAI,GAAI,EAER,KAAO,EAAO,KAAO,GAAQ,EAAI,EAAO,QACtC,IAIF,GAAI,GAAK,EAAO,WAAY,KAAM,IAAI,OAAM,sCAC5C,GAAM,GAAO,EAAU,KAAe,EAAO,SAAS,OAAQ,EAAO,GAIrE,GAFA,EAAQ,EAAI,EAER,IAAgB,EAAU,iBAAkB,CAC9C,GAAM,GACJ,EAAO,KACN,EAAO,MAAY,EACnB,EAAO,MAAY,GACnB,EAAO,MAAY,GACtB,GACE,GAAc,GACd,EAAa,EAAO,OAAS,GAC7B,EAAO,EAAQ,EAAa,KAAO,EAEnC,KAAM,IAAI,OAAM,6BAElB,GAAI,CAAC,GAAA,aAAa,EAAQ,EAAO,EAAQ,EAAa,GACpD,KAAM,IAAI,OAAM,yCAGlB,GAAM,GAAI,EAAO,SAAS,OAAQ,EAAO,EAAQ,EAAa,GAE9D,EAAO,GAAQ,EACf,EAAQ,EAAQ,UACP,IAAgB,EAAU,cAAe,CAClD,GAAM,GAAM,GAAA,OAAO,MAAM,IACzB,EAAO,KAAK,EAAK,EAAG,EAAO,EAAQ,IACnC,EAAO,GAAQ,GAAI,IAAA,SAAS,GAC5B,EAAQ,EAAQ,WACP,IAAgB,EAAU,eAAiB,IAAkB,GACtE,EAAO,GAAQ,GAAI,IAAA,MACjB,EAAO,KAAY,EAAO,MAAY,EAAM,EAAO,MAAY,GAAO,EAAO,MAAY,YAElF,IAAgB,EAAU,cACnC,EAAO,GACL,EAAO,KACN,EAAO,MAAY,EACnB,EAAO,MAAY,GACnB,EAAO,MAAY,WACb,IAAgB,EAAU,kBAAoB,IAAkB,GACzE,EAAO,GAAQ,GAAI,IAAA,OAAO,EAAO,aAAa,IAC9C,EAAQ,EAAQ,UACP,IAAgB,EAAU,iBACnC,EAAO,GAAQ,EAAO,aAAa,GACnC,EAAQ,EAAQ,UACP,IAAgB,EAAU,eAAgB,CACnD,GAAM,GACJ,EAAO,KACN,EAAO,MAAY,EACnB,EAAO,MAAY,GACnB,EAAO,MAAY,GAChB,EACJ,EAAO,KACN,EAAO,MAAY,EACnB,EAAO,MAAY,GACnB,EAAO,MAAY,GACtB,EAAO,GAAQ,GAAI,MAAK,GAAI,IAAA,KAAK,EAAS,GAAU,oBAC3C,IAAgB,EAAU,kBAAmB,CACtD,GAAI,EAAO,KAAW,GAAK,EAAO,KAAW,EAAG,KAAM,IAAI,OAAM,8BAChE,EAAO,GAAQ,EAAO,OAAa,UAC1B,IAAgB,EAAU,iBAAkB,CACrD,GAAM,GAAS,EACT,EACJ,EAAO,GACN,EAAO,EAAQ,IAAM,EACrB,EAAO,EAAQ,IAAM,GACrB,EAAO,EAAQ,IAAM,GACxB,GAAI,GAAc,GAAK,EAAa,EAAO,OAAS,EAClD,KAAM,IAAI,OAAM,wCAGlB,AAAI,EACF,EAAO,GAAQ,EAAO,MAAM,EAAO,EAAQ,GAE3C,EAAO,GAAQ,EAAkB,EAAQ,EAAQ,EAAS,IAG5D,EAAQ,EAAQ,UACP,IAAgB,EAAU,gBAAiB,CACpD,GAAM,GAAS,EACT,EACJ,EAAO,GACN,EAAO,EAAQ,IAAM,EACrB,EAAO,EAAQ,IAAM,GACrB,EAAO,EAAQ,IAAM,GACpB,EAAe,EAGb,EAAY,EAAQ,EAG1B,GAAI,GAAe,EAAY,GAAO,CACpC,EAAe,GACf,OAAW,KAAK,GACb,EAEE,GAAK,EAAQ,GAElB,EAAa,IAAS,GAMxB,GAHA,EAAO,GAAQ,EAAkB,EAAQ,EAAQ,EAAc,IAC/D,EAAQ,EAAQ,EAEZ,EAAO,EAAQ,KAAO,EAAG,KAAM,IAAI,OAAM,iCAC7C,GAAI,IAAU,EAAW,KAAM,IAAI,OAAM,gCAChC,IAAgB,EAAU,oBACnC,EAAO,GAAQ,eACN,IAAgB,EAAU,eACnC,EAAO,GAAQ,aACN,IAAgB,EAAU,eAAgB,CAEnD,GAAM,GACJ,EAAO,KACN,EAAO,MAAY,EACnB,EAAO,MAAY,GACnB,EAAO,MAAY,GAChB,EACJ,EAAO,KACN,EAAO,MAAY,EACnB,EAAO,MAAY,GACnB,EAAO,MAAY,GAChB,EAAO,GAAI,IAAA,KAAK,EAAS,GAE/B,AAAI,GAAgB,IAAkB,GACpC,EAAO,GACL,EAAK,gBAAgB,IAAoB,EAAK,mBAAmB,GAC7D,EAAK,WACL,EAEN,EAAO,GAAQ,UAER,IAAgB,EAAU,qBAAsB,CAEzD,GAAM,GAAQ,GAAA,OAAO,MAAM,IAE3B,EAAO,KAAK,EAAO,EAAG,EAAO,EAAQ,IAErC,EAAQ,EAAQ,GAEhB,GAAM,GAAa,GAAI,IAAA,WAAW,GAElC,AAAI,YAAc,IAAc,MAAO,GAAW,UAAa,WAC7D,EAAO,GAAQ,EAAW,WAE1B,EAAO,GAAQ,UAER,IAAgB,EAAU,iBAAkB,CACrD,GAAI,GACF,EAAO,KACN,EAAO,MAAY,EACnB,EAAO,MAAY,GACnB,EAAO,MAAY,GAChB,EAAkB,EAClB,EAAU,EAAO,KAGvB,GAAI,EAAa,EAAG,KAAM,IAAI,OAAM,2CAGpC,GAAI,EAAa,EAAO,WACtB,KAAM,IAAI,OAAM,8CAGlB,GAAI,EAAO,OAAY,KAAM,CAE3B,GAAI,IAAY,GAAA,OAAO,mBAAoB,CAMzC,GALA,EACE,EAAO,KACN,EAAO,MAAY,EACnB,EAAO,MAAY,GACnB,EAAO,MAAY,GAClB,EAAa,EACf,KAAM,IAAI,OAAM,4DAClB,GAAI,EAAa,EAAkB,EACjC,KAAM,IAAI,OAAM,+DAClB,GAAI,EAAa,EAAkB,EACjC,KAAM,IAAI,OAAM,gEAGpB,AAAI,GAAkB,EACpB,EAAO,GAAQ,EAAO,MAAM,EAAO,EAAQ,GAE3C,EAAO,GAAQ,GAAI,IAAA,OAAO,EAAO,MAAM,EAAO,EAAQ,GAAa,OAEhE,CACL,GAAM,GAAU,GAAA,OAAO,MAAM,GAE7B,GAAI,IAAY,GAAA,OAAO,mBAAoB,CAMzC,GALA,EACE,EAAO,KACN,EAAO,MAAY,EACnB,EAAO,MAAY,GACnB,EAAO,MAAY,GAClB,EAAa,EACf,KAAM,IAAI,OAAM,4DAClB,GAAI,EAAa,EAAkB,EACjC,KAAM,IAAI,OAAM,+DAClB,GAAI,EAAa,EAAkB,EACjC,KAAM,IAAI,OAAM,gEAIpB,IAAK,EAAI,EAAG,EAAI,EAAY,IAC1B,EAAQ,GAAK,EAAO,EAAQ,GAG9B,AAAI,GAAkB,EACpB,EAAO,GAAQ,EAEf,EAAO,GAAQ,GAAI,IAAA,OAAO,EAAS,GAKvC,EAAQ,EAAQ,UACP,IAAgB,EAAU,kBAAoB,IAAe,GAAO,CAI7E,IAFA,EAAI,EAEG,EAAO,KAAO,GAAQ,EAAI,EAAO,QACtC,IAGF,GAAI,GAAK,EAAO,OAAQ,KAAM,IAAI,OAAM,sCAExC,GAAM,GAAS,EAAO,SAAS,OAAQ,EAAO,GAO9C,IALA,EAAQ,EAAI,EAGZ,EAAI,EAEG,EAAO,KAAO,GAAQ,EAAI,EAAO,QACtC,IAGF,GAAI,GAAK,EAAO,OAAQ,KAAM,IAAI,OAAM,sCAExC,GAAM,GAAgB,EAAO,SAAS,OAAQ,EAAO,GACrD,EAAQ,EAAI,EAGZ,GAAM,GAAe,GAAI,OAAM,EAAc,QAG7C,IAAK,EAAI,EAAG,EAAI,EAAc,OAAQ,IACpC,OAAQ,EAAc,QACf,IACH,EAAa,GAAK,IAClB,UACG,IACH,EAAa,GAAK,IAClB,UACG,IACH,EAAa,GAAK,IAClB,MAIN,EAAO,GAAQ,GAAI,QAAO,EAAQ,EAAa,KAAK,aAC3C,IAAgB,EAAU,kBAAoB,IAAe,GAAM,CAI5E,IAFA,EAAI,EAEG,EAAO,KAAO,GAAQ,EAAI,EAAO,QACtC,IAGF,GAAI,GAAK,EAAO,OAAQ,KAAM,IAAI,OAAM,sCAExC,GAAM,GAAS,EAAO,SAAS,OAAQ,EAAO,GAM9C,IALA,EAAQ,EAAI,EAGZ,EAAI,EAEG,EAAO,KAAO,GAAQ,EAAI,EAAO,QACtC,IAGF,GAAI,GAAK,EAAO,OAAQ,KAAM,IAAI,OAAM,sCAExC,GAAM,GAAgB,EAAO,SAAS,OAAQ,EAAO,GACrD,EAAQ,EAAI,EAGZ,EAAO,GAAQ,GAAI,IAAA,WAAW,EAAQ,WAC7B,IAAgB,EAAU,iBAAkB,CACrD,GAAM,GACJ,EAAO,KACN,EAAO,MAAY,EACnB,EAAO,MAAY,GACnB,EAAO,MAAY,GACtB,GACE,GAAc,GACd,EAAa,EAAO,OAAS,GAC7B,EAAO,EAAQ,EAAa,KAAO,EAEnC,KAAM,IAAI,OAAM,6BAClB,GAAM,GAAS,EAAO,SAAS,OAAQ,EAAO,EAAQ,EAAa,GACnE,EAAO,GAAQ,EAAgB,EAAS,GAAI,IAAA,WAAW,GACvD,EAAQ,EAAQ,UACP,IAAgB,EAAU,oBAAqB,CACxD,GAAM,GACJ,EAAO,KACN,EAAO,MAAY,EACnB,EAAO,MAAY,GACnB,EAAO,MAAY,GAChB,EACJ,EAAO,KACN,EAAO,MAAY,EACnB,EAAO,MAAY,GACnB,EAAO,MAAY,GAEtB,EAAO,GAAQ,GAAI,IAAA,UAAU,EAAS,WAC7B,IAAgB,EAAU,kBACnC,EAAO,GAAQ,GAAI,IAAA,eACV,IAAgB,EAAU,kBACnC,EAAO,GAAQ,GAAI,IAAA,eACV,IAAgB,EAAU,eAAgB,CACnD,GAAM,GACJ,EAAO,KACN,EAAO,MAAY,EACnB,EAAO,MAAY,GACnB,EAAO,MAAY,GACtB,GACE,GAAc,GACd,EAAa,EAAO,OAAS,GAC7B,EAAO,EAAQ,EAAa,KAAO,EAEnC,KAAM,IAAI,OAAM,6BAClB,GAAM,GAAiB,EAAO,SAAS,OAAQ,EAAO,EAAQ,EAAa,GAG3E,AAAI,EAEF,AAAI,EAEF,EAAO,GAAQ,EAAY,EAAgB,EAAe,GAE1D,EAAO,GAAQ,EAAY,GAG7B,EAAO,GAAQ,GAAI,IAAA,KAAK,GAI1B,EAAQ,EAAQ,UACP,IAAgB,EAAU,uBAAwB,CAC3D,GAAM,GACJ,EAAO,KACN,EAAO,MAAY,EACnB,EAAO,MAAY,GACnB,EAAO,MAAY,GAGtB,GAAI,EAAY,EAAI,EAAI,EAAI,EAC1B,KAAM,IAAI,OAAM,2DAIlB,GAAM,GACJ,EAAO,KACN,EAAO,MAAY,EACnB,EAAO,MAAY,GACnB,EAAO,MAAY,GAEtB,GACE,GAAc,GACd,EAAa,EAAO,OAAS,GAC7B,EAAO,EAAQ,EAAa,KAAO,EAEnC,KAAM,IAAI,OAAM,6BAGlB,GAAM,GAAiB,EAAO,SAAS,OAAQ,EAAO,EAAQ,EAAa,GAE3E,EAAQ,EAAQ,EAEhB,GAAM,GAAS,EAET,EACJ,EAAO,GACN,EAAO,EAAQ,IAAM,EACrB,EAAO,EAAQ,IAAM,GACrB,EAAO,EAAQ,IAAM,GAElB,GAAc,EAAkB,EAAQ,EAAQ,EAAS,IAK/D,GAHA,EAAQ,EAAQ,EAGZ,EAAY,EAAI,EAAI,EAAa,EACnC,KAAM,IAAI,OAAM,0DAIlB,GAAI,EAAY,EAAI,EAAI,EAAa,EACnC,KAAM,IAAI,OAAM,6DAIlB,AAAI,EAEF,CAAI,EAEF,EAAO,GAAQ,EAAY,EAAgB,EAAe,GAE1D,EAAO,GAAQ,EAAY,GAG7B,EAAO,GAAM,MAAQ,IAErB,EAAO,GAAQ,GAAI,IAAA,KAAK,EAAgB,YAEjC,IAAgB,EAAU,oBAAqB,CAExD,GAAM,GACJ,EAAO,KACN,EAAO,MAAY,EACnB,EAAO,MAAY,GACnB,EAAO,MAAY,GAEtB,GACE,GAAc,GACd,EAAa,EAAO,OAAS,GAC7B,EAAO,EAAQ,EAAa,KAAO,EAEnC,KAAM,IAAI,OAAM,6BAElB,GAAI,CAAC,GAAA,aAAa,EAAQ,EAAO,EAAQ,EAAa,GACpD,KAAM,IAAI,OAAM,yCAElB,GAAM,GAAY,EAAO,SAAS,OAAQ,EAAO,EAAQ,EAAa,GAEtE,EAAQ,EAAQ,EAGhB,GAAM,GAAY,GAAA,OAAO,MAAM,IAC/B,EAAO,KAAK,EAAW,EAAG,EAAO,EAAQ,IACzC,GAAM,GAAM,GAAI,IAAA,SAAS,GAGzB,EAAQ,EAAQ,GAGhB,EAAO,GAAQ,GAAI,IAAA,MAAM,EAAW,OAEpC,MAAM,IAAI,OACR,8BAAgC,EAAY,SAAS,IAAM,mBAAqB,EAAO,KAM7F,GAAI,IAAS,EAAQ,GACnB,KAAI,GAAe,GAAI,OAAM,sBACvB,GAAI,OAAM,uBAIlB,GAAM,IAAa,OAAO,KAAK,GAAQ,OAAO,GAAK,EAAE,WAAW,MAC5D,EAAQ,GAMZ,GALA,GAAW,QAAQ,GAAC,CAClB,AAAI,CAAC,OAAQ,MAAO,OAAO,QAAQ,KAAO,IAAI,GAAQ,MAIpD,CAAC,EAAO,MAAO,GAEnB,GAAI,GAAA,YAAY,GAAS,CACvB,GAAM,GAAO,OAAO,OAAO,GAAI,GAC/B,aAAO,GAAK,KACZ,MAAO,GAAK,IACZ,MAAO,GAAK,IACL,GAAI,IAAA,MAAM,EAAO,KAAM,EAAO,IAAK,EAAO,IAAK,GAGxD,MAAO,GAQT,WACE,EACA,EACA,EAAiB,CAEjB,MAAK,GAED,GAAc,IAAmB,MACnC,GAAc,GAAkB,GAAI,UAAS,IAIxC,EAAc,GAAgB,KAAK,IAPf,GAAI,UAAS,oICnmB1C,WAA2B,EAAc,CACvC,MACE,IAAA,aAAa,IAAU,QAAQ,IAAI,EAAO,cAAgB,MAAO,GAAM,WAAc,SAFzF,EAAA,WAAA,EAOA,GAAM,GAAiB,WACjB,EAAiB,YAEjB,EAAiB,mBACjB,EAAiB,oBAIjB,EAAe,CACnB,KAAM,GAAA,SACN,QAAS,GAAA,OACT,MAAO,GAAA,OACP,QAAS,GAAA,WACT,WAAY,GAAA,MACZ,eAAgB,GAAA,WAChB,cAAe,GAAA,OACf,YAAa,GAAA,KACb,QAAS,GAAA,OACT,QAAS,GAAA,OACT,OAAQ,GAAA,WACR,mBAAoB,GAAA,WACpB,WAAY,GAAA,WAId,WAA0B,EAAY,EAAyB,GAAE,CAC/D,GAAI,MAAO,IAAU,SAAU,CAC7B,GAAI,EAAQ,SAAW,EAAQ,OAC7B,MAAO,GAKT,GAAI,KAAK,MAAM,KAAW,EAAO,CAC/B,GAAI,GAAS,GAAkB,GAAS,EAAgB,MAAO,IAAI,IAAA,MAAM,GACzE,GAAI,GAAS,GAAkB,GAAS,EAAgB,MAAO,IAAA,KAAK,WAAW,GAIjF,MAAO,IAAI,IAAA,OAAO,GAIpB,GAAI,GAAS,MAAQ,MAAO,IAAU,SAAU,MAAO,GAGvD,GAAI,EAAM,WAAY,MAAO,MAE7B,GAAM,GAAO,OAAO,KAAK,GAAO,OAC9B,GAAK,EAAE,WAAW,MAAQ,EAAM,IAAM,MAExC,OAAS,GAAI,EAAG,EAAI,EAAK,OAAQ,IAAK,CACpC,GAAM,GAAI,EAAa,EAAK,IAC5B,GAAI,EAAG,MAAO,GAAE,iBAAiB,EAAO,GAG1C,GAAI,EAAM,OAAS,KAAM,CACvB,GAAM,GAAI,EAAM,MACV,EAAO,GAAI,MAEjB,MAAI,GAAQ,OACV,AAAI,MAAO,IAAM,SAAU,EAAK,QAAQ,GAC/B,MAAO,IAAM,UAAU,EAAK,QAAQ,KAAK,MAAM,IAExD,AAAI,MAAO,IAAM,SAAU,EAAK,QAAQ,KAAK,MAAM,IAC9C,AAAI,GAAA,KAAK,OAAO,GAAI,EAAK,QAAQ,EAAE,YAC/B,MAAO,IAAM,UAAY,EAAQ,SAAS,EAAK,QAAQ,GAE3D,EAGT,GAAI,EAAM,OAAS,KAAM,CACvB,GAAM,GAAO,OAAO,OAAO,GAAI,GAC/B,MAAI,GAAM,QACR,GAAK,OAAS,EAAiB,EAAM,SAGhC,GAAA,KAAK,iBAAiB,GAG/B,GAAI,EAAM,MAAQ,MAAQ,EAAM,YAAc,KAAM,CAClD,GAAM,GAAI,EAAM,KAAO,EAAQ,EAAM,WAIrC,GAAI,YAAa,IAAA,MAAO,MAAO,GAE/B,GAAM,GAAa,OAAO,KAAK,GAAG,OAAO,GAAK,EAAE,WAAW,MACvD,GAAQ,GAMZ,GALA,EAAW,QAAQ,GAAC,CAClB,AAAI,CAAC,OAAQ,MAAO,OAAO,QAAQ,KAAO,IAAI,IAAQ,MAIpD,GAAO,MAAO,IAAA,MAAM,iBAAiB,GAG3C,MAAO,GAIT,WAAwB,EAAc,EAAsB,CAC1D,MAAO,GAAM,IAAI,AAAC,GAAe,EAAe,EAAG,IAGrD,WAAsB,EAAU,CAC9B,GAAM,GAAS,EAAK,cAEpB,MAAO,GAAK,uBAAyB,EAAI,EAAS,EAAO,MAAM,EAAG,IAAM,IAI1E,WAAwB,EAAY,EAAsB,CACxD,GAAI,MAAM,QAAQ,GAAQ,MAAO,GAAe,EAAO,GAEvD,GAAI,IAAU,OAAW,MAAO,MAEhC,GAAI,YAAiB,MAAM,CACzB,GAAM,GAAU,EAAM,UAEpB,EAAU,EAAU,IAAM,EAAU,aAEtC,MAAI,GAAQ,OACH,EAAQ,SAAW,EACtB,CAAE,MAAO,EAAM,WACf,CAAE,MAAO,EAAa,IAErB,EAAQ,SAAW,EACtB,CAAE,MAAO,EAAa,IACtB,CAAE,MAAO,CAAE,YAAa,EAAM,UAAU,aAG9C,GAAI,MAAO,IAAU,UAAY,CAAC,EAAQ,QAAS,CAEjD,GAAI,KAAK,MAAM,KAAW,EAAO,CAC/B,GAAM,GAAa,GAAS,GAAkB,GAAS,EACrD,EAAa,GAAS,GAAkB,GAAS,EAGnD,GAAI,EAAY,MAAO,CAAE,WAAY,EAAM,YAC3C,GAAI,EAAY,MAAO,CAAE,YAAa,EAAM,YAE9C,MAAO,CAAE,cAAe,EAAM,YAGhC,GAAI,YAAiB,QAAQ,CAC3B,GAAI,GAAQ,EAAM,MAClB,GAAI,IAAU,OAAW,CACvB,GAAM,GAAQ,EAAM,WAAW,MAAM,aACrC,AAAI,GACF,GAAQ,EAAM,IAKlB,MAAO,AADI,IAAI,IAAA,WAAW,EAAM,OAAQ,GAC9B,eAAe,GAG3B,MAAI,IAAS,MAAQ,MAAO,IAAU,SAAiB,EAAkB,EAAO,GACzE,EAGT,GAAM,GAAqB,CACzB,OAAQ,AAAC,GAAc,GAAI,IAAA,OAAO,EAAE,QAAS,EAAE,UAC/C,KAAM,AAAC,GAAY,GAAI,IAAA,KAAK,EAAE,KAAM,EAAE,OACtC,MAAO,AAAC,GAAa,GAAI,IAAA,MAAM,EAAE,YAAc,EAAE,UAAW,EAAE,IAAK,EAAE,GAAI,EAAE,QAC3E,WAAY,AAAC,GAAkB,GAAI,IAAA,WAAW,EAAE,OAChD,OAAQ,AAAC,GAAc,GAAI,IAAA,OAAO,EAAE,OACpC,MAAO,AAAC,GAAa,GAAI,IAAA,MAAM,EAAE,OACjC,KAAM,AACJ,GAMA,GAAA,KAAK,SAEH,EAAE,KAAO,KAAO,EAAE,IAAM,EAAE,KAC1B,EAAE,KAAO,KAAO,EAAE,KAAO,EAAE,MAC3B,EAAE,KAAO,KAAO,EAAE,SAAW,EAAE,WAEnC,OAAQ,IAAM,GAAI,IAAA,OAClB,OAAQ,IAAM,GAAI,IAAA,OAClB,SAAU,AAAC,GAAgB,GAAI,IAAA,SAAS,GACxC,SAAU,AAAC,GAAgB,GAAI,IAAA,SAAS,GACxC,WAAY,AAAC,GAAkB,GAAI,IAAA,WAAW,EAAE,QAAS,EAAE,SAC3D,OAAQ,AAAC,GAAkB,GAAI,IAAA,WAAW,EAAE,OAC5C,UAAW,AAAC,GAAiB,GAAA,UAAU,SAAS,EAAE,IAAK,EAAE,OAI3D,WAA2B,EAAU,EAAsB,CACzD,GAAI,GAAO,MAAQ,MAAO,IAAQ,SAAU,KAAM,IAAI,OAAM,0BAE5D,GAAM,GAAkC,EAAI,UAC5C,GAAI,MAAO,IAAa,YAAa,CAEnC,GAAM,GAAiB,GACvB,OAAW,KAAQ,GACjB,EAAK,GAAQ,EAAe,EAAI,GAAO,GAEzC,MAAO,WACE,EAAW,GAAM,CAG1B,GAAI,GAAc,EAClB,GAAI,MAAO,GAAO,gBAAmB,WAAY,CAK/C,GAAM,GAAS,EAAmB,EAAI,WACtC,GAAI,CAAC,EACH,KAAM,IAAI,WAAU,sCAAwC,EAAI,WAElE,EAAS,EAAO,GAIlB,MAAI,KAAa,QAAU,EAAO,MAChC,EAAS,GAAI,IAAA,KAAK,EAAO,KAAM,EAAe,EAAO,MAAO,IACnD,IAAa,SAAW,EAAO,KACxC,GAAS,GAAI,IAAA,MACX,EAAO,WACP,EAAe,EAAO,IAAK,GAC3B,EAAO,GACP,EAAO,SAIJ,EAAO,eAAe,OAE7B,MAAM,IAAI,OAAM,wCAA0C,MAAO,IAWrE,GAAiB,GAAjB,AAAA,UAAiB,EAAK,CA6BpB,WAAsB,GAAc,EAAuB,CACzD,GAAM,GAAe,OAAO,OAAO,GAAI,CAAE,QAAS,GAAM,OAAQ,IAAS,GAGzE,MAAI,OAAO,GAAa,SAAY,WAAW,GAAa,OAAS,CAAC,EAAa,SAC/E,MAAO,GAAa,QAAW,WAAW,GAAa,QAAU,CAAC,EAAa,QAE5E,KAAK,MAAM,GAAM,CAAC,GAAM,IAAU,EAAiB,EAAO,IAPnD,EAAA,MAAK,EAsCrB,WACE,GAEA,EACA,EACA,GAAuB,CAEvB,AAAI,GAAS,MAAQ,MAAO,IAAU,UACpC,IAAU,EACV,EAAQ,GAEN,GAAY,MAAQ,MAAO,IAAa,UAAY,CAAC,MAAM,QAAQ,IACrE,IAAU,EACV,EAAW,OACX,EAAQ,GAEV,GAAU,OAAO,OAAO,GAAI,CAAE,QAAS,GAAM,OAAQ,IAAS,IAE9D,GAAM,GAAM,EAAe,GAAO,IAClC,MAAO,MAAK,UAAU,EAAK,EAA8C,GAnB3D,EAAA,UAAS,EA4BzB,WAA0B,GAA0B,EAAuB,CACzE,SAAU,GAAW,GACd,KAAK,MAAM,EAAU,GAAO,IAFrB,EAAA,UAAS,EAWzB,WAA4B,GAAiB,EAAuB,CAClE,SAAU,GAAW,GACd,EAAM,KAAK,UAAU,IAAQ,GAFtB,EAAA,YAAW,IA1GZ,EAAA,EAAA,OAAA,GAAA,MAAK,wJC5PtB,WACE,EACA,EACA,EACA,EACA,EAAc,CAEd,GAAI,GACA,EACE,EAAM,IAAW,MACjB,EAAO,EAAS,EAAI,EAAO,EAC3B,EAAQ,IAAK,GAAQ,EACrB,EAAQ,GAAQ,EAClB,EAAQ,GACR,EAAI,EAAM,EAAI,EAAS,EACrB,EAAI,EAAM,EAAI,GAChB,EAAI,EAAO,EAAS,GAOxB,IALA,GAAK,EAEL,EAAI,EAAM,IAAK,CAAC,GAAS,EACzB,IAAM,CAAC,EACP,GAAS,EACF,EAAQ,EAAG,EAAI,EAAI,IAAM,EAAO,EAAS,GAAI,GAAK,EAAG,GAAS,EAAE,CAKvE,IAHA,EAAI,EAAM,IAAK,CAAC,GAAS,EACzB,IAAM,CAAC,EACP,GAAS,EACF,EAAQ,EAAG,EAAI,EAAI,IAAM,EAAO,EAAS,GAAI,GAAK,EAAG,GAAS,EAAE,CAEvE,GAAI,IAAM,EACR,EAAI,EAAI,MACH,IAAI,IAAM,EACf,MAAO,GAAI,IAAO,GAAI,GAAK,GAAK,MAEhC,EAAI,EAAI,KAAK,IAAI,EAAG,GACpB,EAAI,EAAI,EAEV,MAAQ,GAAI,GAAK,GAAK,EAAI,KAAK,IAAI,EAAG,EAAI,GAtC5C,EAAA,YAAA,EAyCA,WACE,EACA,EACA,EACA,EACA,EACA,EAAc,CAEd,GAAI,GACA,EACA,EACE,EAAM,IAAW,MACnB,EAAO,EAAS,EAAI,EAAO,EACzB,EAAQ,IAAK,GAAQ,EACrB,EAAQ,GAAQ,EAChB,EAAK,IAAS,GAAK,KAAK,IAAI,EAAG,KAAO,KAAK,IAAI,EAAG,KAAO,EAC3D,EAAI,EAAM,EAAS,EAAI,EACrB,EAAI,EAAM,GAAK,EACf,GAAI,EAAQ,GAAM,IAAU,GAAK,EAAI,EAAQ,EAAK,EAAI,EAqC5D,IAnCA,EAAQ,KAAK,IAAI,GAEjB,AAAI,MAAM,IAAU,IAAU,IAC5B,GAAI,MAAM,GAAS,EAAI,EACvB,EAAI,GAEJ,GAAI,KAAK,MAAM,KAAK,IAAI,GAAS,KAAK,KAClC,EAAS,GAAI,KAAK,IAAI,EAAG,CAAC,IAAM,GAClC,KACA,GAAK,GAEP,AAAI,EAAI,GAAS,EACf,GAAS,EAAK,EAEd,GAAS,EAAK,KAAK,IAAI,EAAG,EAAI,GAE5B,EAAQ,GAAK,GACf,KACA,GAAK,GAGP,AAAI,EAAI,GAAS,EACf,GAAI,EACJ,EAAI,GACC,AAAI,EAAI,GAAS,EACtB,GAAK,GAAQ,EAAI,GAAK,KAAK,IAAI,EAAG,GAClC,EAAI,EAAI,GAER,GAAI,EAAQ,KAAK,IAAI,EAAG,EAAQ,GAAK,KAAK,IAAI,EAAG,GACjD,EAAI,IAIJ,MAAM,IAAQ,GAAI,GAEf,GAAQ,GACb,EAAO,EAAS,GAAK,EAAI,IACzB,GAAK,EACL,GAAK,IACL,GAAQ,EASV,IANA,EAAK,GAAK,EAAQ,EAEd,MAAM,IAAQ,IAAK,GAEvB,GAAQ,EAED,EAAO,GACZ,EAAO,EAAS,GAAK,EAAI,IACzB,GAAK,EACL,GAAK,IACL,GAAQ,EAGV,EAAO,EAAS,EAAI,IAAM,GAAI,IA3EhC,EAAA,aAAA,gJCpCA,GAAM,GAAS,OACT,EAAa,GAAI,KAAI,CAAC,MAAO,OAAQ,MAAO,iBAElD,WAAkB,EAAU,CAC1B,MAAO,QAAO,UAAU,SAAS,KAAK,KAAO,kBAS/C,WACE,EACA,EACA,EACA,EACA,EAAiB,CAGjB,EAAO,KAAW,EAAU,iBAE5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAGxC,EAAQ,EAAQ,EAAuB,EACvC,EAAO,EAAQ,GAAK,EAEpB,GAAM,GAAO,EAAO,MAAM,EAAO,EAAQ,EAAG,OAAW,QAEvD,SAAO,EAAQ,GAAO,EAAO,GAAM,GAAM,IACzC,EAAO,EAAQ,GAAO,EAAO,GAAM,GAAM,IACzC,EAAO,EAAQ,GAAO,EAAO,GAAM,EAAK,IACxC,EAAO,GAAU,EAAO,EAAK,IAE7B,EAAQ,EAAQ,EAAI,EAEpB,EAAO,KAAW,EACX,EAGT,WACE,EACA,EACA,EACA,EACA,EAAiB,CAIjB,GACE,OAAO,UAAU,IACjB,GAAS,EAAU,gBACnB,GAAS,EAAU,eACnB,CAGA,EAAO,KAAW,EAAU,cAE5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAGxC,EAAQ,EAAQ,EAChB,EAAO,KAAW,EAElB,EAAO,KAAW,EAAQ,IAC1B,EAAO,KAAY,GAAS,EAAK,IACjC,EAAO,KAAY,GAAS,GAAM,IAClC,EAAO,KAAY,GAAS,GAAM,QAC7B,CAEL,EAAO,KAAW,EAAU,iBAE5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAGxC,EAAQ,EAAQ,EAChB,EAAO,KAAW,EAElB,GAAA,aAAa,EAAQ,EAAO,EAAO,SAAU,GAAI,GAEjD,EAAQ,EAAQ,EAGlB,MAAO,GAGT,WAAuB,EAAgB,EAAa,EAAY,EAAe,EAAiB,CAE9F,EAAO,KAAW,EAAU,eAG5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAIxC,SAAQ,EAAQ,EAChB,EAAO,KAAW,EACX,EAGT,WACE,EACA,EACA,EACA,EACA,EAAiB,CAGjB,EAAO,KAAW,EAAU,kBAE5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAGxC,SAAQ,EAAQ,EAChB,EAAO,KAAW,EAElB,EAAO,KAAW,EAAQ,EAAI,EACvB,EAGT,WAAuB,EAAgB,EAAa,EAAa,EAAe,EAAiB,CAE/F,EAAO,KAAW,EAAU,eAE5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAGxC,EAAQ,EAAQ,EAChB,EAAO,KAAW,EAGlB,GAAM,GAAc,GAAA,KAAK,WAAW,EAAM,WACpC,EAAU,EAAY,aACtB,EAAW,EAAY,cAE7B,SAAO,KAAW,EAAU,IAC5B,EAAO,KAAY,GAAW,EAAK,IACnC,EAAO,KAAY,GAAW,GAAM,IACpC,EAAO,KAAY,GAAW,GAAM,IAEpC,EAAO,KAAW,EAAW,IAC7B,EAAO,KAAY,GAAY,EAAK,IACpC,EAAO,KAAY,GAAY,GAAM,IACrC,EAAO,KAAY,GAAY,GAAM,IAC9B,EAGT,WACE,EACA,EACA,EACA,EACA,EAAiB,CAGjB,EAAO,KAAW,EAAU,iBAE5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAMxC,GAFA,EAAQ,EAAQ,EAChB,EAAO,KAAW,EACd,EAAM,QAAU,EAAM,OAAO,MAAM,IAAW,KAChD,KAAM,OAAM,SAAW,EAAM,OAAS,gCAGxC,SAAQ,EAAQ,EAAO,MAAM,EAAM,OAAQ,EAAO,OAAW,QAE7D,EAAO,KAAW,EAEd,EAAM,YAAY,GAAO,KAAW,KACpC,EAAM,QAAQ,GAAO,KAAW,KAChC,EAAM,WAAW,GAAO,KAAW,KAGvC,EAAO,KAAW,EACX,EAGT,WACE,EACA,EACA,EACA,EACA,EAAiB,CAGjB,EAAO,KAAW,EAAU,iBAE5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAOxC,GAJA,EAAQ,EAAQ,EAChB,EAAO,KAAW,EAGd,EAAM,QAAQ,MAAM,IAAW,KAGjC,KAAM,OAAM,WAAa,EAAM,QAAU,gCAI3C,SAAQ,EAAQ,EAAO,MAAM,EAAM,QAAS,EAAO,OAAW,QAE9D,EAAO,KAAW,EAElB,EAAQ,EAAQ,EAAO,MAAM,EAAM,QAAQ,MAAM,IAAI,OAAO,KAAK,IAAK,EAAO,OAAW,QAExF,EAAO,KAAW,EACX,EAGT,WACE,EACA,EACA,EACA,EACA,EAAiB,CAGjB,AAAI,IAAU,KACZ,EAAO,KAAW,EAAU,eACvB,AAAI,EAAM,YAAc,SAC7B,EAAO,KAAW,EAAU,kBAE5B,EAAO,KAAW,EAAU,kBAI9B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAGxC,SAAQ,EAAQ,EAChB,EAAO,KAAW,EACX,EAGT,WACE,EACA,EACA,EACA,EACA,EAAiB,CAGjB,EAAO,KAAW,EAAU,cAE5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAQxC,GAJA,EAAQ,EAAQ,EAChB,EAAO,KAAW,EAGd,MAAO,GAAM,IAAO,SACtB,EAAO,MAAM,EAAM,GAAI,EAAO,OAAW,kBAChC,EAAM,IAAM,EAAM,GAAG,KAC9B,EAAM,GAAG,KAAK,EAAQ,EAAO,EAAG,QAEhC,MAAM,IAAI,WAAU,WAAa,KAAK,UAAU,GAAS,6BAI3D,MAAO,GAAQ,GAGjB,WACE,EACA,EACA,EACA,EACA,EAAiB,CAGjB,EAAO,KAAW,EAAU,iBAE5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAGxC,EAAQ,EAAQ,EAChB,EAAO,KAAW,EAElB,GAAM,GAAO,EAAM,OAEnB,SAAO,KAAW,EAAO,IACzB,EAAO,KAAY,GAAQ,EAAK,IAChC,EAAO,KAAY,GAAQ,GAAM,IACjC,EAAO,KAAY,GAAQ,GAAM,IAEjC,EAAO,KAAW,EAAU,4BAE5B,EAAO,IAAI,GAAA,aAAa,GAAQ,GAEhC,EAAQ,EAAQ,EACT,EAGT,WACE,EACA,EACA,EACA,EACA,EAAY,GACZ,EAAQ,EACR,EAAqB,GACrB,EAAkB,GAClB,EAAU,GACV,GAAmB,GAAE,CAErB,OAAS,GAAI,EAAG,EAAI,GAAK,OAAQ,IAC/B,GAAI,GAAK,KAAO,EAAO,KAAM,IAAI,OAAM,8BAIzC,GAAK,KAAK,GAEV,EAAO,KAAW,MAAM,QAAQ,GAAS,EAAU,gBAAkB,EAAU,iBAE/E,GAAM,IAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAGxC,EAAQ,EAAQ,GAChB,EAAO,KAAW,EAClB,GAAM,GAAW,GACf,EACA,EACA,EACA,EACA,EAAQ,EACR,EACA,EACA,IAGF,UAAK,MACE,EAGT,WACE,EACA,EACA,EACA,EACA,EAAiB,CAEjB,EAAO,KAAW,EAAU,qBAE5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAGxC,SAAQ,EAAQ,EAChB,EAAO,KAAW,EAElB,EAAM,MAAM,KAAK,EAAQ,EAAO,EAAG,IAC5B,EAAQ,GAGjB,WAAuB,EAAgB,EAAa,EAAa,EAAe,EAAiB,CAE/F,EAAO,KACL,EAAM,YAAc,OAAS,EAAU,eAAiB,EAAU,oBAEpE,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAGxC,EAAQ,EAAQ,EAChB,EAAO,KAAW,EAElB,GAAM,GAAU,EAAM,aAChB,EAAW,EAAM,cAEvB,SAAO,KAAW,EAAU,IAC5B,EAAO,KAAY,GAAW,EAAK,IACnC,EAAO,KAAY,GAAW,GAAM,IACpC,EAAO,KAAY,GAAW,GAAM,IAEpC,EAAO,KAAW,EAAW,IAC7B,EAAO,KAAY,GAAY,EAAK,IACpC,EAAO,KAAY,GAAY,GAAM,IACrC,EAAO,KAAY,GAAY,GAAM,IAC9B,EAGT,WACE,EACA,EACA,EACA,EACA,EAAiB,CAEjB,EAAQ,EAAM,UAEd,EAAO,KAAW,EAAU,cAE5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAGxC,SAAQ,EAAQ,EAChB,EAAO,KAAW,EAElB,EAAO,KAAW,EAAQ,IAC1B,EAAO,KAAY,GAAS,EAAK,IACjC,EAAO,KAAY,GAAS,GAAM,IAClC,EAAO,KAAY,GAAS,GAAM,IAC3B,EAGT,WACE,EACA,EACA,EACA,EACA,EAAiB,CAGjB,EAAO,KAAW,EAAU,iBAG5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAIxC,SAAQ,EAAQ,EAChB,EAAO,KAAW,EAGlB,GAAA,aAAa,EAAQ,EAAM,MAAO,EAAO,SAAU,GAAI,GAGvD,EAAQ,EAAQ,EACT,EAGT,YACE,EACA,EACA,EACA,EACA,EAAa,GACb,EAAS,EACT,EAAiB,CAEjB,EAAO,KAAW,EAAU,eAE5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAGxC,EAAQ,EAAQ,EAChB,EAAO,KAAW,EAElB,GAAM,GAAiB,GAAA,yBAAyB,GAG1C,GAAO,EAAO,MAAM,EAAgB,EAAQ,EAAG,OAAW,QAAU,EAE1E,SAAO,GAAS,GAAO,IACvB,EAAO,EAAQ,GAAM,IAAQ,EAAK,IAClC,EAAO,EAAQ,GAAM,IAAQ,GAAM,IACnC,EAAO,EAAQ,GAAM,IAAQ,GAAM,IAEnC,EAAQ,EAAQ,EAAI,GAAO,EAE3B,EAAO,KAAW,EACX,EAGT,WACE,EACA,EACA,EACA,EACA,EAAY,GACZ,EAAQ,EACR,EAAqB,GACrB,EAAkB,GAClB,EAAU,GAAK,CAEf,GAAI,EAAM,OAAS,MAAO,GAAM,OAAU,SAAU,CAElD,EAAO,KAAW,EAAU,uBAE5B,GAAM,IAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAGxC,EAAQ,EAAQ,GAChB,EAAO,KAAW,EAGlB,GAAI,IAAa,EAIX,EAAiB,MAAO,GAAM,MAAS,SAAW,EAAM,KAAO,EAAM,KAAK,WAEhF,EAAQ,EAAQ,EAEhB,GAAM,GAAW,EAAO,MAAM,EAAgB,EAAQ,EAAG,OAAW,QAAU,EAE9E,EAAO,GAAS,EAAW,IAC3B,EAAO,EAAQ,GAAM,GAAY,EAAK,IACtC,EAAO,EAAQ,GAAM,GAAY,GAAM,IACvC,EAAO,EAAQ,GAAM,GAAY,GAAM,IAEvC,EAAO,EAAQ,EAAI,EAAW,GAAK,EAEnC,EAAQ,EAAQ,EAAW,EAI3B,GAAM,IAAW,GACf,EACA,EAAM,MACN,EACA,EACA,EAAQ,EACR,EACA,GAEF,EAAQ,GAAW,EAGnB,GAAM,IAAY,GAAW,GAG7B,EAAO,MAAgB,GAAY,IACnC,EAAO,MAAiB,IAAa,EAAK,IAC1C,EAAO,MAAiB,IAAa,GAAM,IAC3C,EAAO,MAAiB,IAAa,GAAM,IAE3C,EAAO,KAAW,MACb,CACL,EAAO,KAAW,EAAU,eAE5B,GAAM,IAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAGxC,EAAQ,EAAQ,GAChB,EAAO,KAAW,EAElB,GAAM,IAAiB,EAAM,KAAK,WAE5B,EAAO,EAAO,MAAM,GAAgB,EAAQ,EAAG,OAAW,QAAU,EAE1E,EAAO,GAAS,EAAO,IACvB,EAAO,EAAQ,GAAM,GAAQ,EAAK,IAClC,EAAO,EAAQ,GAAM,GAAQ,GAAM,IACnC,EAAO,EAAQ,GAAM,GAAQ,GAAM,IAEnC,EAAQ,EAAQ,EAAI,EAAO,EAE3B,EAAO,KAAW,EAGpB,MAAO,GAGT,WACE,EACA,EACA,EACA,EACA,EAAiB,CAGjB,EAAO,KAAW,EAAU,iBAE5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAGxC,EAAQ,EAAQ,EAChB,EAAO,KAAW,EAElB,GAAM,GAAO,EAAM,MAAM,IAErB,EAAO,EAAM,SAEjB,MAAI,GAAM,WAAa,GAAA,OAAO,oBAAoB,GAAO,EAAO,GAEhE,EAAO,KAAW,EAAO,IACzB,EAAO,KAAY,GAAQ,EAAK,IAChC,EAAO,KAAY,GAAQ,GAAM,IACjC,EAAO,KAAY,GAAQ,GAAM,IAEjC,EAAO,KAAW,EAAM,SAGpB,EAAM,WAAa,GAAA,OAAO,oBAC5B,GAAO,EAAO,EACd,EAAO,KAAW,EAAO,IACzB,EAAO,KAAY,GAAQ,EAAK,IAChC,EAAO,KAAY,GAAQ,GAAM,IACjC,EAAO,KAAY,GAAQ,GAAM,KAInC,EAAO,IAAI,EAAM,GAEjB,EAAQ,EAAQ,EAAM,SACf,EAGT,YACE,EACA,EACA,EACA,EACA,EAAiB,CAGjB,EAAO,KAAW,EAAU,iBAE5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAGxC,EAAQ,EAAQ,EAChB,EAAO,KAAW,EAElB,GAAM,GAAO,EAAO,MAAM,EAAM,MAAO,EAAQ,EAAG,OAAW,QAAU,EAEvE,SAAO,GAAS,EAAO,IACvB,EAAO,EAAQ,GAAM,GAAQ,EAAK,IAClC,EAAO,EAAQ,GAAM,GAAQ,GAAM,IACnC,EAAO,EAAQ,GAAM,GAAQ,GAAM,IAEnC,EAAQ,EAAQ,EAAI,EAAO,EAE3B,EAAO,KAAW,EACX,EAGT,WACE,EACA,EACA,EACA,EACA,EACA,EACA,EAAiB,CAGjB,EAAO,KAAW,EAAU,iBAE5B,GAAM,GAAuB,AAAC,EAE1B,EAAO,MAAM,EAAK,EAAO,OAAW,SADpC,EAAO,MAAM,EAAK,EAAO,OAAW,QAIxC,EAAQ,EAAQ,EAChB,EAAO,KAAW,EAElB,GAAI,GAAa,EACb,GAAoB,CACtB,KAAM,EAAM,YAAc,EAAM,UAChC,IAAK,EAAM,KAGb,AAAI,EAAM,IAAM,MACd,IAAO,IAAM,EAAM,IAGrB,GAAS,OAAO,OAAO,GAAQ,EAAM,QACrC,GAAM,IAAW,GAAc,EAAQ,GAAQ,GAAO,EAAO,EAAQ,EAAG,GAGlE,EAAO,GAAW,EAExB,SAAO,KAAgB,EAAO,IAC9B,EAAO,KAAiB,GAAQ,EAAK,IACrC,EAAO,KAAiB,GAAQ,GAAM,IACtC,EAAO,KAAiB,GAAQ,GAAM,IAE/B,GAGT,YACE,EACA,EACA,EAAY,GACZ,EAAgB,EAChB,EAAQ,EACR,EAAqB,GACrB,EAAkB,GAClB,EAAmB,GAAE,CAErB,EAAgB,GAAiB,EACjC,EAAO,GAAQ,GAGf,EAAK,KAAK,GAGV,GAAI,GAAQ,EAAgB,EAG5B,GAAI,MAAM,QAAQ,GAEhB,OAAS,IAAI,EAAG,GAAI,EAAO,OAAQ,KAAK,CACtC,GAAM,GAAM,GAAK,GACb,EAAQ,EAAO,IAGnB,GAAI,GAAS,EAAM,OAAQ,CACzB,GAAI,MAAO,GAAM,QAAW,WAAY,KAAM,IAAI,WAAU,4BAC5D,EAAQ,EAAM,SAGhB,GAAI,MAAO,IAAU,SACnB,EAAQ,EAAgB,EAAQ,EAAK,EAAO,EAAO,YAC1C,MAAO,IAAU,SAC1B,EAAQ,EAAgB,EAAQ,EAAK,EAAO,EAAO,QAC9C,IAAI,MAAO,IAAU,SAC1B,KAAM,IAAI,WAAU,kDACf,GAAI,MAAO,IAAU,UAC1B,EAAQ,EAAiB,EAAQ,EAAK,EAAO,EAAO,YAC3C,YAAiB,OAAQ,GAAA,OAAO,GACzC,EAAQ,EAAc,EAAQ,EAAK,EAAO,EAAO,YACxC,IAAU,OACnB,EAAQ,EAAc,EAAQ,EAAK,EAAO,EAAO,YACxC,IAAU,KACnB,EAAQ,EAAc,EAAQ,EAAK,EAAO,EAAO,YACxC,EAAM,YAAiB,YAAc,EAAM,YAAiB,WACrE,EAAQ,EAAkB,EAAQ,EAAK,EAAO,EAAO,YAC5C,GAAA,OAAO,SAAS,IAAU,GAAA,aAAa,GAChD,EAAQ,EAAgB,EAAQ,EAAK,EAAO,EAAO,YAC1C,YAAiB,SAAU,EAAS,GAC7C,EAAQ,EAAgB,EAAQ,EAAK,EAAO,EAAO,YAC1C,MAAO,IAAU,UAAY,EAAM,WAAgB,KAC5D,EAAQ,EACN,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GACA,WAGF,MAAO,IAAU,UACjB,GAAA,WAAW,IACX,EAAM,YAAc,aAEpB,EAAQ,EAAoB,EAAQ,EAAK,EAAO,EAAO,YAC9C,EAAM,YAAiB,QAAU,EAAM,YAAiB,YACjE,EAAQ,EAAc,EAAQ,EAAK,EAAO,EAAO,YACxC,EAAM,YAAiB,SAChC,EAAQ,EAAgB,EAAQ,EAAK,EAAO,EAAO,YAC1C,MAAO,IAAU,YAAc,EACxC,EAAQ,GAAkB,EAAQ,EAAK,EAAO,EAAO,EAAW,EAAO,YAC9D,EAAM,YAAiB,OAChC,EAAQ,EACN,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,YAEO,EAAM,YAAiB,SAChC,EAAQ,EAAgB,EAAQ,EAAK,EAAO,EAAO,YAC1C,EAAM,YAAiB,SAChC,EAAQ,GAAgB,EAAQ,EAAK,EAAO,EAAO,YAC1C,EAAM,YAAiB,QAChC,EAAQ,EAAe,EAAQ,EAAK,EAAO,EAAO,EAAO,EAAoB,YACpE,EAAM,YAAiB,aAChC,EAAQ,EAAoB,EAAQ,EAAK,EAAO,EAAO,YAC9C,EAAM,YAAiB,QAChC,EAAQ,EAAe,EAAQ,EAAK,EAAO,EAAO,YACzC,EAAM,YAAiB,UAAY,EAAM,YAAiB,SACnE,EAAQ,EAAgB,EAAQ,EAAK,EAAO,EAAO,YAC1C,MAAO,GAAM,WAAiB,YACvC,KAAM,IAAI,WAAU,sCAAwC,EAAM,oBAG7D,YAAkB,IAAA,IAAK,CAChC,GAAM,IAAW,EAAO,UACpB,EAAO,GAEX,KAAO,CAAC,GAAM,CAEZ,GAAM,GAAQ,GAAS,OAGvB,GAFA,EAAO,CAAC,CAAC,EAAM,KAEX,EAAM,SAGV,GAAM,IAAM,EAAM,MAAM,GAClB,GAAQ,EAAM,MAAM,GAGpB,GAAO,MAAO,IAGpB,GAAI,MAAO,KAAQ,UAAY,CAAC,EAAW,IAAI,IAAM,CACnD,GAAI,GAAI,MAAM,IAAW,KAGvB,KAAM,OAAM,OAAS,GAAM,gCAG7B,GAAI,EAAW,CACb,GAAI,AAAQ,GAAI,KAAZ,IACF,KAAM,OAAM,OAAS,GAAM,4BACtB,GAAI,CAAC,GAAI,QAAQ,KACtB,KAAM,OAAM,OAAS,GAAM,0BAKjC,GAAI,KAAS,SACX,EAAQ,EAAgB,EAAQ,GAAK,GAAO,WACnC,KAAS,SAClB,EAAQ,EAAgB,EAAQ,GAAK,GAAO,OACvC,IAAI,KAAS,UAAY,GAAA,gBAAgB,KAAU,GAAA,iBAAiB,IACzE,KAAM,IAAI,WAAU,kDACf,GAAI,KAAS,UAClB,EAAQ,EAAiB,EAAQ,GAAK,GAAO,WACpC,aAAiB,OAAQ,GAAA,OAAO,IACzC,EAAQ,EAAc,EAAQ,GAAK,GAAO,WACjC,KAAU,MAAS,KAAU,QAAa,IAAoB,GACvE,EAAQ,EAAc,EAAQ,GAAK,GAAO,WACjC,GAAM,YAAiB,YAAc,GAAM,YAAiB,WACrE,EAAQ,EAAkB,EAAQ,GAAK,GAAO,WACrC,GAAA,OAAO,SAAS,KAAU,GAAA,aAAa,IAChD,EAAQ,EAAgB,EAAQ,GAAK,GAAO,WACnC,aAAiB,SAAU,EAAS,IAC7C,EAAQ,EAAgB,EAAQ,GAAK,GAAO,WACnC,KAAS,UAAY,GAAM,WAAgB,KACpD,EAAQ,EACN,EACA,GACA,GACA,EACA,EACA,EACA,EACA,EACA,GACA,WAEO,KAAS,UAAY,GAAM,YAAiB,aACrD,EAAQ,EAAoB,EAAQ,GAAK,GAAO,WACvC,GAAM,YAAiB,QAAU,GAAM,YAAiB,YACjE,EAAQ,EAAc,EAAQ,GAAK,GAAO,WACjC,GAAM,YAAiB,SAChC,EAAQ,EAAgB,EAAQ,GAAK,GAAO,WACnC,GAAM,YAAiB,OAChC,EAAQ,EACN,EACA,GACA,GACA,EACA,EACA,EACA,EACA,WAEO,MAAO,KAAU,YAAc,EACxC,EAAQ,GAAkB,EAAQ,GAAK,GAAO,EAAO,EAAW,EAAO,WAC9D,GAAM,YAAiB,SAChC,EAAQ,EAAgB,EAAQ,GAAK,GAAO,WACnC,GAAM,YAAiB,SAChC,EAAQ,GAAgB,EAAQ,GAAK,GAAO,WACnC,GAAM,YAAiB,QAChC,EAAQ,EAAe,EAAQ,GAAK,GAAO,EAAO,EAAO,WAChD,GAAM,YAAiB,aAChC,EAAQ,EAAoB,EAAQ,GAAK,GAAO,WACvC,GAAM,YAAiB,QAChC,EAAQ,EAAe,EAAQ,GAAK,GAAO,WAClC,GAAM,YAAiB,UAAY,GAAM,YAAiB,SACnE,EAAQ,EAAgB,EAAQ,GAAK,GAAO,WACnC,MAAO,IAAM,WAAiB,YACvC,KAAM,IAAI,WAAU,sCAAwC,GAAM,iBAGjE,CAEL,GAAI,EAAO,OAAQ,CACjB,GAAI,MAAO,GAAO,QAAW,WAAY,KAAM,IAAI,WAAU,4BAE7D,GADA,EAAS,EAAO,SACZ,GAAU,MAAQ,MAAO,IAAW,SACtC,KAAM,IAAI,WAAU,4CAIxB,OAAW,MAAO,GAAQ,CACxB,GAAI,GAAQ,EAAO,IAEnB,GAAI,GAAS,EAAM,OAAQ,CACzB,GAAI,MAAO,GAAM,QAAW,WAAY,KAAM,IAAI,WAAU,4BAC5D,EAAQ,EAAM,SAIhB,GAAM,GAAO,MAAO,GAGpB,GAAI,MAAO,KAAQ,UAAY,CAAC,EAAW,IAAI,IAAM,CACnD,GAAI,GAAI,MAAM,IAAW,KAGvB,KAAM,OAAM,OAAS,GAAM,gCAG7B,GAAI,EAAW,CACb,GAAI,AAAQ,GAAI,KAAZ,IACF,KAAM,OAAM,OAAS,GAAM,4BACtB,GAAI,CAAC,GAAI,QAAQ,KACtB,KAAM,OAAM,OAAS,GAAM,0BAKjC,GAAI,IAAS,SACX,EAAQ,EAAgB,EAAQ,GAAK,EAAO,WACnC,IAAS,SAClB,EAAQ,EAAgB,EAAQ,GAAK,EAAO,OACvC,IAAI,IAAS,SAClB,KAAM,IAAI,WAAU,kDACf,GAAI,IAAS,UAClB,EAAQ,EAAiB,EAAQ,GAAK,EAAO,WACpC,YAAiB,OAAQ,GAAA,OAAO,GACzC,EAAQ,EAAc,EAAQ,GAAK,EAAO,WACjC,IAAU,OACnB,AAAI,IAAoB,IAAO,GAAQ,EAAc,EAAQ,GAAK,EAAO,YAChE,IAAU,KACnB,EAAQ,EAAc,EAAQ,GAAK,EAAO,WACjC,EAAM,YAAiB,YAAc,EAAM,YAAiB,WACrE,EAAQ,EAAkB,EAAQ,GAAK,EAAO,WACrC,GAAA,OAAO,SAAS,IAAU,GAAA,aAAa,GAChD,EAAQ,EAAgB,EAAQ,GAAK,EAAO,WACnC,YAAiB,SAAU,EAAS,GAC7C,EAAQ,EAAgB,EAAQ,GAAK,EAAO,WACnC,IAAS,UAAY,EAAM,WAAgB,KACpD,EAAQ,EACN,EACA,GACA,EACA,EACA,EACA,EACA,EACA,EACA,GACA,WAEO,IAAS,UAAY,EAAM,YAAiB,aACrD,EAAQ,EAAoB,EAAQ,GAAK,EAAO,WACvC,EAAM,YAAiB,QAAU,EAAM,YAAiB,YACjE,EAAQ,EAAc,EAAQ,GAAK,EAAO,WACjC,EAAM,YAAiB,SAChC,EAAQ,EAAgB,EAAQ,GAAK,EAAO,WACnC,EAAM,YAAiB,OAChC,EAAQ,EACN,EACA,GACA,EACA,EACA,EACA,EACA,EACA,WAEO,MAAO,IAAU,YAAc,EACxC,EAAQ,GAAkB,EAAQ,GAAK,EAAO,EAAO,EAAW,EAAO,WAC9D,EAAM,YAAiB,SAChC,EAAQ,EAAgB,EAAQ,GAAK,EAAO,WACnC,EAAM,YAAiB,SAChC,EAAQ,GAAgB,EAAQ,GAAK,EAAO,WACnC,EAAM,YAAiB,QAChC,EAAQ,EAAe,EAAQ,GAAK,EAAO,EAAO,EAAO,WAChD,EAAM,YAAiB,aAChC,EAAQ,EAAoB,EAAQ,GAAK,EAAO,WACvC,EAAM,YAAiB,QAChC,EAAQ,EAAe,EAAQ,GAAK,EAAO,WAClC,EAAM,YAAiB,UAAY,EAAM,YAAiB,SACnE,EAAQ,EAAgB,EAAQ,GAAK,EAAO,WACnC,MAAO,GAAM,WAAiB,YACvC,KAAM,IAAI,WAAU,sCAAwC,EAAM,aAMxE,EAAK,MAGL,EAAO,KAAW,EAGlB,GAAM,IAAO,EAAQ,EAErB,SAAO,KAAmB,GAAO,IACjC,EAAO,KAAoB,IAAQ,EAAK,IACxC,EAAO,KAAoB,IAAQ,GAAM,IACzC,EAAO,KAAoB,IAAQ,GAAM,IAClC,EAvUT,EAAA,cAAA,wmCCjpBE,OAAA,eAAA,EAAA,SAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAjFO,IAAA,UA6EP,OAAA,eAAA,EAAA,OAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MA5EO,IAAA,QA+EP,OAAA,eAAA,EAAA,QAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MA9EO,IAAA,SAwFP,OAAA,eAAA,EAAA,aAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAvFO,IAAA,cAkFP,OAAA,eAAA,EAAA,SAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAjFO,IAAA,UAkFP,OAAA,eAAA,EAAA,QAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAhFO,IAAA,SA6EP,OAAA,eAAA,EAAA,OAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MA5EO,IAAA,QAuEP,OAAA,eAAA,EAAA,MAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAtEO,IAAA,OAgFP,OAAA,eAAA,EAAA,SAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MA/EO,IAAA,UA8EP,OAAA,eAAA,EAAA,SAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MA7EO,IAAA,UAwEP,OAAA,eAAA,EAAA,WAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAvEO,IAAA,YAmFK,OAAA,eAAA,EAAA,WAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAnFL,IAAA,YA8EP,OAAA,eAAA,EAAA,aAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAzEO,IAAA,cA+DP,OAAA,eAAA,EAAA,aAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MA9DO,IAAA,cAmEP,OAAA,eAAA,EAAA,YAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAlEO,IAAA,aAIP,OAAA,eAAA,EAAA,iCAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,kCACA,OAAA,eAAA,EAAA,8BAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,+BACA,OAAA,eAAA,EAAA,+BAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,gCACA,OAAA,eAAA,EAAA,0BAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,2BACA,OAAA,eAAA,EAAA,mCAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,oCACA,OAAA,eAAA,EAAA,2BAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,4BACA,OAAA,eAAA,EAAA,+BAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,gCACA,OAAA,eAAA,EAAA,kBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,mBACA,OAAA,eAAA,EAAA,mBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,oBACA,OAAA,eAAA,EAAA,oBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,qBACA,OAAA,eAAA,EAAA,iBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,kBACA,OAAA,eAAA,EAAA,yBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,0BACA,OAAA,eAAA,EAAA,iBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,kBACA,OAAA,eAAA,EAAA,sBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,uBACA,OAAA,eAAA,EAAA,uBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,wBACA,OAAA,eAAA,EAAA,gBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,iBACA,OAAA,eAAA,EAAA,iBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,kBACA,OAAA,eAAA,EAAA,oBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,qBACA,OAAA,eAAA,EAAA,oBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,qBACA,OAAA,eAAA,EAAA,iBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,kBACA,OAAA,eAAA,EAAA,mBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,oBACA,OAAA,eAAA,EAAA,mBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,oBACA,OAAA,eAAA,EAAA,gBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,iBACA,OAAA,eAAA,EAAA,mBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,oBACA,OAAA,eAAA,EAAA,mBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,oBACA,OAAA,eAAA,EAAA,mBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,oBACA,OAAA,eAAA,EAAA,sBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,uBACA,OAAA,eAAA,EAAA,sBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,uBACA,OAAA,eAAA,EAAA,iBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,kBACA,OAAA,eAAA,EAAA,iBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,kBACA,OAAA,eAAA,EAAA,iBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,kBACA,OAAA,eAAA,EAAA,iBAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,kBACA,OAAA,eAAA,EAAA,aAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,cACA,OAAA,eAAA,EAAA,aAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,cAKO,OAAA,eAAA,EAAA,QAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,IAAA,SAQT,GAAA,GAAA,GAEE,OAAA,eAAA,EAAA,4BAAA,CAAA,WAAA,GAAA,IAAA,UAAA,CAAA,MAAA,GAAA,6BAmCF,GAAM,GAAU,KAAO,KAAO,GAG1B,EAAS,GAAA,OAAO,MAAM,GAQ1B,WAAsC,EAAY,CAEhD,AAAI,EAAO,OAAS,GAClB,GAAS,GAAA,OAAO,MAAM,IAH1B,EAAA,sBAAA,EAcA,WAA0B,EAAkB,EAA4B,GAAE,CAExE,GAAM,GAAY,MAAO,GAAQ,WAAc,UAAY,EAAQ,UAAY,GACzE,EACJ,MAAO,GAAQ,oBAAuB,UAAY,EAAQ,mBAAqB,GAC3E,EACJ,MAAO,GAAQ,iBAAoB,UAAY,EAAQ,gBAAkB,GACrE,EACJ,MAAO,GAAQ,uBAA0B,SAAW,EAAQ,sBAAwB,EAGtF,AAAI,EAAO,OAAS,GAClB,GAAS,GAAA,OAAO,MAAM,IAIxB,GAAM,GAAqB,GAAA,cACzB,EACA,EACA,EACA,EACA,EACA,EACA,EACA,IAII,EAAiB,GAAA,OAAO,MAAM,GAGpC,SAAO,KAAK,EAAgB,EAAG,EAAG,EAAe,QAG1C,EAlCT,EAAA,UAAA,EA8CA,WACE,EACA,EACA,EAA4B,GAAE,CAG9B,GAAM,GAAY,MAAO,GAAQ,WAAc,UAAY,EAAQ,UAAY,GACzE,EACJ,MAAO,GAAQ,oBAAuB,UAAY,EAAQ,mBAAqB,GAC3E,EACJ,MAAO,GAAQ,iBAAoB,UAAY,EAAQ,gBAAkB,GACrE,EAAa,MAAO,GAAQ,OAAU,SAAW,EAAQ,MAAQ,EAGjE,EAAqB,GAAA,cACzB,EACA,EACA,EACA,EACA,EACA,EACA,GAEF,SAAO,KAAK,EAAa,EAAY,EAAG,GAGjC,EAAa,EAAqB,EA1B3C,EAAA,4BAAA,EAoCA,WACE,EACA,EAA8B,GAAE,CAEhC,MAAO,IAAA,YAAoB,GAAA,aAAa,GAAS,GAJnD,EAAA,YAAA,EAoBA,WACE,EACA,EAAsC,GAAE,CAExC,EAAU,GAAW,GAErB,GAAM,GACJ,MAAO,GAAQ,oBAAuB,UAAY,EAAQ,mBAAqB,GAC3E,EACJ,MAAO,GAAQ,iBAAoB,UAAY,EAAQ,gBAAkB,GAE3E,MAAO,IAAA,oBAA4B,EAAQ,EAAoB,GAXjE,EAAA,oBAAA,EA0BA,WACE,EACA,EACA,EACA,EACA,EACA,EAA2B,CAE3B,GAAM,GAAkB,OAAO,OAC7B,CAAE,iCAAkC,GAAM,MAAO,GACjD,GAEI,EAAa,GAAA,aAAa,GAE5B,EAAQ,EAEZ,OAAS,IAAI,EAAG,GAAI,EAAmB,KAAK,CAE1C,GAAM,GACJ,EAAW,GACV,EAAW,EAAQ,IAAM,EACzB,EAAW,EAAQ,IAAM,GACzB,EAAW,EAAQ,IAAM,GAE5B,EAAgB,MAAQ,EAExB,EAAU,EAAgB,IAAK,GAAA,YAAoB,EAAY,GAE/D,EAAQ,EAAQ,EAIlB,MAAO,GAhCT,EAAA,kBAAA,0uCC5PO,YACL,EACA,EACyB,CAEzB,MADmB,IAAY,GAAI,YAAW,GAAQ,GCJxD,GAAM,IAA4C,eAUrC,GAAkF,CAC7F,KAAM,OACN,GAAI,OACJ,OAAQ,OACR,QAAS,GACT,WAAY,CAAC,QACb,UAAW,CAAC,oBACZ,SAAU,OACV,OAAQ,GACR,SACA,aACA,QAAS,CACP,KAAM,KAIV,kBAAqB,EAA0B,EAA6B,CAC1E,GAAM,GAAc,IAAI,GAAW,QAAQ,QAAS,GAAO,KAAA,OAAP,EAAS,MAC7D,MAAO,IAAc,EAAa,GAGpC,YAAmB,EAA0B,EAA6B,CACxE,GAAM,GAAc,IAAI,GAAW,QAAQ,QAAS,GAAO,KAAA,OAAP,EAAS,MAC7D,MAAO,IAAc,EAAa,GCjC7B,YACL,EACA,EACa,CAGb,MAAO,AAFY,IAAU,GAEX,OCLpB,GAAM,IAA4C,eAMrC,GAAwE,CACnF,KAAM,OACN,GAAI,OACJ,OAAQ,OACR,QAAS,GACT,WAAY,CAAC,QACb,QAAS,CACP,KAAM,SAEF,QAAO,EAA+B,EAA+C,CACzF,MAAO,IAAe,EAAM,KAE9B,WAAW,EAA+B,EAAsC,CAC9E,MAAO,IAAe,EAAM,MCdzB,GAAM,IAA6D,CACxE,QAAS,CACP,cAAe,UACf,YAAa,GACb,cAAe,IAEjB,MAAO,CACL,cAAe,QACf,YAAa,IAEf,MAAO,CACL,cAAe,QACf,YAAa,IAEf,MAAO,CACL,cAAe,QACf,YAAa,IAEf,MAAO,CACL,cAAe,QACf,YAAa,IAEf,OAAQ,CACN,cAAe,SACf,YAAa,IAEf,WAAY,CACV,cAAe,aACf,YAAa,IAEf,qBAAsB,CACpB,cAAe,uBACf,YAAa,IAEf,KAAM,CACJ,cAAe,aACf,aAAc,OACd,YAAa,GACb,cAAe,IAEjB,YAAa,CACX,cAAe,QACf,aAAc,cACd,YAAa,IAEf,YAAa,CACX,cAAe,QACf,aAAc,cACd,YAAa,IAEf,KAAM,CACJ,cAAe,QACf,aAAc,OACd,YAAa,GACb,cAAe,IAEjB,iBAAkB,CAChB,cAAe,QACf,aAAc,mBACd,YAAa,GACb,cAAe,IAEjB,iBAAkB,CAChB,cAAe,QACf,aAAc,mBACd,YAAa,GACb,cAAe,IAEjB,OAAQ,CACN,cAAe,QACf,aAAc,SACd,YAAa,IAEf,QAAS,CACP,cAAe,QACf,aAAc,UACd,YAAa,IAEf,QAAS,CACP,cAAe,QACf,aAAc,UACd,YAAa,IAEf,QAAS,CACP,cAAe,QACf,aAAc,UACd,YAAa,IAEf,MAAO,CACL,cAAe,QACf,aAAc,QACd,YAAa,IAEf,OAAQ,CACN,cAAe,QACf,aAAc,SACd,YAAa,IAEf,OAAQ,CACN,cAAe,QACf,aAAc,SACd,YAAa,IAEf,OAAQ,CACN,cAAe,QACf,aAAc,SACd,YAAa,IAEf,KAAM,CACJ,cAAe,aACf,aAAc,OACd,YAAa,GACb,cAAe,IAEjB,KAAM,CACJ,cAAe,aACf,aAAc,OACd,YAAa,GACb,cAAe,IAEjB,SAAU,CACR,cAAe,uBACf,aAAc,WACd,WAAY,GACZ,YAAa,GACb,cAAe,IAEjB,cAAe,CACb,cAAe,QACf,aAAc,gBACd,YAAa,GACb,cAAe,IAEjB,cAAe,CACb,cAAe,QACf,aAAc,gBACd,YAAa,GACb,cAAe,IAEjB,mBAAoB,CAClB,cAAe,aACf,aAAc,qBACd,YAAa,GACb,cAAe,IAEjB,6BAA8B,CAC5B,cAAe,uBACf,aAAc,+BACd,YAAa,GACb,cAAe,KAQZ,YAAqB,EAAmB,EAAgB,EAA+B,CAC5F,GAAI,CAAE,KAAQ,KACZ,KAAM,IAAI,OAAM,iBAAiB,KAGnC,MAAO,IAAsB,GAAM,YAAY,EAAO,GAOjD,YAAuB,EAAmB,EAAgB,EAAsB,CACrF,GAAI,CAAE,KAAQ,KACZ,KAAM,IAAI,OAAM,iBAAiB,KAGnC,MAAI,iBAAmB,IAAsB,GACpC,GAAsB,GAAM,gBAAgB,EAAO,GAGrD,EAGT,YAA6B,EAAyB,CACpD,MAAO,SAAQ,GAGjB,YAA+B,EAAqB,CAClD,MAAO,SAAQ,GAGjB,YAA2B,EAAoB,CAC7C,GAAM,GAAI,WAAW,GACrB,GAAI,MAAM,GACR,KAAM,IAAI,OAAM,4BAA4B,KAE9C,MAAO,GAGT,YAA4B,EAAoB,CAC9C,GAAM,GAAI,WAAW,GACrB,GAAI,MAAM,GACR,KAAM,IAAI,OAAM,6BAA6B,KAE/C,MAAO,GAGT,YAA0B,EAAY,CACpC,GAAM,GAAI,SAAS,EAAO,IAC1B,GAAI,EAAI,MAAS,EAAI,KAAQ,MAAM,GACjC,KAAM,IAAI,OAAM,2BAA2B,KAG7C,MAAO,GAGT,YAA2B,EAAY,CACrC,GAAM,GAAI,SAAS,EAAO,IAC1B,GAAI,EAAI,GAAK,EAAI,KAAQ,MAAM,GAC7B,KAAM,IAAI,OAAM,4BAA4B,KAG9C,MAAO,GAGT,YAA2B,EAAY,CACrC,GAAM,GAAI,SAAS,EAAO,IAC1B,GAAI,EAAI,QAAW,EAAI,OAAU,MAAM,GACrC,KAAM,IAAI,OAAM,4BAA4B,KAG9C,MAAO,GAGT,YAA4B,EAAY,CACtC,GAAM,GAAI,SAAS,EAAO,IAC1B,GAAI,EAAI,GAAK,EAAI,OAAU,MAAM,GAC/B,KAAM,IAAI,OAAM,6BAA6B,KAG/C,MAAO,GAGT,YAA2B,EAAY,CACrC,GAAM,GAAI,SAAS,EAAO,IAC1B,GAAI,EAAI,aAAe,EAAI,YAAc,MAAM,GAC7C,KAAM,IAAI,OAAM,4BAA4B,KAG9C,MAAO,GAGT,YAAkC,EAAe,EAA6B,CAC5E,GAAM,GAAiB,EAAQ,IAAO,GAAM,OAAS,GAC/C,EAAI,KAAK,MAAQ,EAAiB,IAAM,CAAC,EAAM,UAAc,EAAK,IAAM,EAAM,WACpF,GAAI,EAAI,aAAe,EAAI,YAAc,MAAM,GAC7C,KAAM,IAAI,OAAM,4BAA4B,KAE9C,MAAO,GAGT,YAA4B,EAAoB,CAC9C,GAAM,GAAI,SAAS,EAAO,IAC1B,GAAI,EAAI,GAAK,EAAI,iBAAkB,MAAM,GACvC,KAAM,IAAI,OAAM,6BAA6B,KAE/C,MAAO,GAGT,YAA2B,EAAoB,CAC7C,GAAM,GAAI,SAAS,EAAO,IAC1B,GAAI,MAAM,GACR,KAAM,IAAI,OAAM,4BAA4B,KAE9C,MAAO,GAGT,YAAkC,EAAe,EAAqB,CACpE,GAAM,GAAiB,EAAQ,IAAO,GAAM,OAAS,GAC/C,EAAI,KAAK,MAAQ,EAAiB,IAAM,CAAC,EAAM,UAAc,EAAK,IAAM,EAAM,WACpF,GAAI,MAAM,GACR,KAAM,IAAI,OAAM,4BAA4B,KAG9C,MAAO,GAGT,YAA4B,EAAY,CACtC,GAAM,GAAI,SAAS,EAAO,IAC1B,GAAI,EAAI,GAAK,MAAM,GACjB,KAAM,IAAI,OAAM,6BAA6B,KAG/C,MAAO,GAGT,YAA2B,EAAY,CACrC,GAAM,GAAI,SAAS,EAAO,IAC1B,GAAI,MAAM,GACR,KAAM,IAAI,OAAM,4BAA4B,KAG9C,MAAO,GAGT,YAAgC,EAAoB,CAClD,MAAO,QAAO,KAAK,GAGrB,YAAuC,EAAoB,CAEzD,MAAO,QAAO,KAAK,GAGrB,YAA0B,EAAoB,CAC5C,MAAO,QAAO,KAAK,EAAO,QAG5B,YAA4B,EAAoB,CAC9C,MAAO,GAAM,WAGf,YAA0B,EAAoB,CAC5C,MAAO,QAAO,KAAK,KAAK,UAAU,IAGpC,YAA4B,EAAqB,CAC/C,MAAO,MAAK,MAAM,GAGpB,YAA0B,EAAoB,CAC5C,GAAM,GAAc,GAAW,aAAa,GAC5C,MAAO,QAAO,KAAK,GAGrB,YAA4B,EAAY,CACtC,MAAO,IAAW,YAAY,GAGhC,YAAiC,EAAY,CAC3C,GAAM,GAAI,SAAS,EAAO,IAC1B,GAAI,EAAI,GAAK,EAAI,qBAAsB,MAAM,GAC3C,KAAM,IAAI,OAAM,kCAAkC,KAGpD,MAAO,GAGT,YAAiC,EAAoB,CACnD,GAAM,GAAI,SAAS,EAAO,IAC1B,GAAI,EAAI,GAAK,MAAM,GACjB,KAAM,IAAI,OAAM,kCAAkC,KAEpD,MAAO,GAGT,GAAM,IAAgB,MAEtB,YAA0B,EAAoB,CAE5C,GAAI,YAAiB,MACnB,MAAO,GAAM,UAAY,GAI3B,CACE,GAAM,GAAI,SAAS,EAAO,IAC1B,GAAI,EAAI,GAAK,MAAM,GACjB,KAAM,IAAI,OAAM,2BAA2B,KAG7C,MAAO,IAIX,YAA4B,EAAkB,CAC5C,MAAO,IAAI,MAAK,EAAQ,IAG1B,YAAsC,EAAoB,CAExD,GAAI,YAAiB,MACnB,MAAO,GAAM,UAIf,CACE,GAAM,GAAI,SAAS,EAAO,IAC1B,GAAI,EAAI,GAAK,MAAM,GACjB,KAAM,IAAI,OAAM,uCAAuC,KAGzD,MAAO,IAIX,YAAwC,EAAkB,CACxD,MAAO,IAAI,MAAK,GAGlB,YAAsC,EAAY,CAEhD,GAAI,YAAiB,MACnB,MAAO,GAAM,UAAY,IAI3B,CACE,GAAM,GAAI,SAAS,EAAO,IAC1B,GAAI,EAAI,GAAK,MAAM,GACjB,KAAM,IAAI,OAAM,uCAAuC,KAGzD,MAAO,IAIX,YAAwC,EAAY,CAClD,MAAO,IAAI,MAAK,EAAQ,KAG1B,YAA8B,EAAY,CACxC,GAAI,CAAC,EAAM,QAAU,CAAC,EAAM,MAAQ,CAAC,EAAM,aACzC,KAAM,IAAI,OACR,mFAIJ,GAAM,GAAM,OAAO,MAAM,IAEzB,SAAI,cAAc,EAAM,OAAQ,GAChC,EAAI,cAAc,EAAM,KAAM,GAC9B,EAAI,cAAc,EAAM,aAAc,GAC/B,EAGT,YAAgC,EAAY,CAC1C,GAAM,GAAM,OAAO,KAAK,GAClB,EAAS,EAAI,aAAa,GAC1B,EAAO,EAAI,aAAa,GACxB,EAAS,EAAI,aAAa,GAEhC,MAAO,CAAC,SAAQ,OAAM,aAAc,GAGtC,YAAkC,EAAY,EAAqB,CAEjE,MAAO,AADc,MAAK,MAAQ,EAAQ,IAAM,CAAC,EAAM,UAAc,EAAK,IAAM,EAAM,WAChE,IAAM,CAAE,GAAM,OAAS,GAG/C,YAAyC,EAAY,EAAqB,CACxE,GAAI,GAAS,EACb,GAAI,EAAM,QAAU,EAElB,OAAS,GAAI,EAAG,EAAI,EAAM,OAAQ,IAGhC,GADkB,EAAM,IAAO,EAAK,GAAM,OAAS,EAAI,OAIzD,QAAS,GAAI,EAAG,EAAI,EAAM,OAAQ,IAGhC,GADkB,EAAM,GAAK,GAAM,GAAK,GAAM,OAAS,EAAI,IAQ/D,MAAO,AAHc,MAAK,MACtB,EAAS,IAAM,CAAC,EAAM,UAAc,EAAK,IAAM,EAAM,WAEnC,IAAM,CAAE,GAAM,OAAS,GCxdxC,YAAqB,EAAwC,CAClE,GAAM,GAAiD,GACvD,OAAW,KAAS,GAAO,UACzB,EAAW,EAAM,KAAO,CACtB,QAAS,GACT,QAAS,GACT,OAAQ,GACR,YAAa,GACb,MAAO,GAGX,MAAO,CAAC,SAAU,EAAG,cAyBhB,YACL,EACA,EACA,EACM,CAEN,GAAM,GAAO,GAAY,GAAQ,WAKjC,GAHA,GAAkB,EAAO,OAAQ,EAAQ,EAAM,EAAG,GAG9C,EAAS,WAAa,EAAG,CAC3B,EAAS,SAAW,EACpB,EAAS,WAAa,EACtB,OAEF,EAAS,UAAY,EACrB,OAAW,KAAS,GAAO,UACzB,MAAM,UAAU,KAAK,MAAM,EAAS,WAAW,EAAM,KAAK,QAAS,EAAK,EAAM,KAAK,SACnF,MAAM,UAAU,KAAK,MAAM,EAAS,WAAW,EAAM,KAAK,QAAS,EAAK,EAAM,KAAK,SACnF,MAAM,UAAU,KAAK,MAAM,EAAS,WAAW,EAAM,KAAK,OAAQ,EAAK,EAAM,KAAK,QAClF,EAAS,WAAW,EAAM,KAAK,OAAS,EAAK,EAAM,KAAK,MAK5D,YACE,EACA,EACA,EACA,EACA,EACA,CACA,OAAW,KAAQ,GAAQ,CACzB,GAAM,GAAQ,EAAO,GAGjB,EAAgB,GAcpB,GAZE,GACA,EAAM,OAAQ,IACd,EAAO,EAAM,QAAU,QACvB,EAAO,EAAM,QAAU,MAEvB,CAAI,EAAO,EAAM,MAAM,cAAgB,MACrC,EAAS,EAAO,EAAM,MAEtB,EAAO,KAAK,EAAO,EAAM,QAIzB,EAAO,SAAW,GAAK,QAAQ,IAAW,EAAM,iBAAmB,WACrE,KAAM,IAAI,OAAM,2BAA2B,EAAM,QAEnD,GAAI,EAAO,OAAS,GAAK,EAAM,iBAAmB,WAChD,KAAM,IAAI,OAAM,8BAA8B,EAAM,QAItD,GAAI,EAAO,SAAW,EAAG,CACvB,AAAI,EAAM,SACR,GAAkB,EAAM,OAAS,KAAO,EAAM,EAAQ,GAEtD,GAAK,EAAM,KAAK,OAAS,EACzB,EAAK,EAAM,KAAK,QAAQ,KAAK,GAC7B,EAAK,EAAM,KAAK,QAAQ,KAAK,IAE/B,SAIF,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IAAK,CACtC,GAAM,GAAO,IAAM,EAAI,EAAS,EAAM,UACtC,AAAI,EAAM,SACR,GAAkB,EAAM,OAAS,EAAO,GAAI,EAAM,EAAM,EAAM,WAE9D,GAAK,EAAM,KAAK,OAAS,EACzB,EAAK,EAAM,KAAK,QAAQ,KAAK,GAC7B,EAAK,EAAM,KAAK,QAAQ,KAAK,EAAM,WACnC,EAAK,EAAM,KAAK,OAAO,KACrB,AAAM,GAAa,EAAM,cAAgB,EAAM,cAAiB,EAAO,QA0B1E,YAAyB,EAAuB,EAAyC,CAC9F,GAAM,GAAqB,GAE3B,OAAS,GAAI,EAAG,EAAI,EAAS,SAAU,IACrC,EAAK,KAAK,IAEZ,OAAW,KAAO,GAAS,WAAY,CACrC,GAAM,GAAa,EAAS,WAAW,GACvC,AAAI,EAAW,OACb,GAAwB,EAAQ,EAAY,EAAK,GAGrD,MAAO,GAKT,YACE,EACA,EACA,EACA,EACM,CACN,GAAM,GAAQ,EAAO,UAAU,GACzB,EAAS,EAAO,gBAAgB,GAGhC,EAAoB,GAAI,OAAM,EAAM,UAAY,GAAG,KAAK,GAC1D,EAAS,EACb,OAAS,GAAI,EAAG,EAAI,EAAW,MAAO,IAAK,CACzC,GAAM,GAAS,EAAW,QAAQ,GAC5B,EAAS,EAAW,QAAQ,GAClC,EAAQ,KACR,EAAQ,KAAK,EAAG,EAAS,GAEzB,GAAI,GAAS,EACT,EAAS,EAAK,EAAQ,KAAY,GAGtC,OAAW,KAAQ,GAAQ,CACzB,GAAI,IAAS,GAAS,EAAS,EAAK,UAClC,MAGF,OAAQ,EAAK,oBACN,WACH,AAAM,EAAK,OAAQ,IAEjB,GAAO,EAAK,MAAQ,IAEtB,GAAM,GAAK,EAAQ,KACnB,KAAO,EAAO,EAAK,MAAM,QAAU,GAEjC,EAAO,EAAK,MAAM,KAAK,IAEzB,EAAS,EAAO,EAAK,MAAM,GAC3B,cAGA,EAAO,EAAK,MAAQ,EAAO,EAAK,OAAS,GACzC,EAAS,EAAO,EAAK,OAK3B,GAAI,IAAW,EAAM,UAAW,CAC9B,GAAM,GAAQ,AAAM,GAElB,EAAM,cAAgB,EAAM,cAC5B,EAAW,OAAO,GAClB,GAIF,OAFA,IAEQ,EAAM,oBACP,WACH,AAAM,EAAM,OAAQ,IAElB,GAAO,EAAM,MAAQ,IAEvB,GAAM,GAAK,EAAQ,GACnB,KAAO,EAAO,EAAM,MAAM,QAAU,GAElC,EAAO,EAAM,MAAM,KAAK,MAE1B,EAAO,EAAM,MAAM,GAAM,EACzB,cAGA,EAAO,EAAM,MAAQ,KA2BxB,YACL,EACA,EAC2B,CAC3B,GAAM,GAAqC,GAC3C,OAAW,KAAO,GAAS,WAAY,CACrC,GAAM,GAAa,EAAS,WAAW,GACvC,AAAI,EAAW,OACb,GAAiC,EAAQ,EAAY,EAAS,SAAU,EAAK,GAGjF,MAAO,GAIT,YACE,EACA,EACA,EACA,EACA,EACA,CACA,GAAI,EAAW,OAAS,EACtB,OAGF,GAAM,GAAQ,EAAO,UAAU,GACzB,EAAS,EAAO,gBAAgB,GAEhC,EAAa,EAAO,GAAG,KAEzB,EACE,CAAC,UAAU,EAUjB,GATI,EAAO,SAAW,GAAY,EAAO,GAAG,eAM1C,GAAS,GAGP,EAAQ,CACV,EAAQ,GAAc,EACtB,OAGF,EAAS,GAAI,OAAM,GACnB,OAAS,GAAI,EAAG,EAAI,EAAU,IAC5B,EAAO,GAAK,GAEd,EAAQ,GAAc,EAGtB,GAAM,GAAoB,GAAI,OAAM,EAAM,UAAY,GAAG,KAAK,GAC1D,EAAS,EACb,OAAS,GAAI,EAAG,EAAI,EAAW,MAAO,IAAK,CACzC,GAAM,GAAS,EAAW,QAAQ,GAC5B,EAAS,EAAW,QAAQ,GAClC,EAAQ,KACR,EAAQ,KAAK,EAAG,EAAS,GAEzB,GAAI,GAAS,EACT,EAAS,EAAO,EAAQ,KAAY,GAGxC,OAAW,KAAQ,GAAQ,CACzB,GAAI,IAAS,GAAS,EAAS,EAAK,UAClC,MAGF,OAAQ,EAAK,oBACN,WACH,AAAM,EAAK,OAAQ,IAEjB,GAAO,EAAK,MAAQ,IAEtB,GAAM,GAAK,EAAQ,KACnB,KAAO,EAAO,EAAK,MAAM,QAAU,GAEjC,EAAO,EAAK,MAAM,KAAK,IAEzB,EAAS,EAAO,EAAK,MAAM,GAC3B,cAGA,EAAO,EAAK,MAAQ,EAAO,EAAK,OAAS,GACzC,EAAS,EAAO,EAAK,OAK3B,GAAI,IAAW,EAAM,UAAW,CAC9B,GAAM,GAAQ,AAAM,GAElB,EAAM,cAAgB,EAAM,cAC5B,EAAW,OAAO,GAClB,GAIF,OAFA,IAEQ,EAAM,oBACP,WACH,AAAM,EAAM,OAAQ,IAElB,GAAO,EAAM,MAAQ,IAEvB,GAAM,GAAK,EAAQ,GACnB,KAAO,EAAO,EAAM,MAAM,QAAU,GAElC,EAAO,EAAM,MAAM,KAAK,MAE1B,EAAO,EAAM,MAAM,GAAM,EACzB,cAGA,EAAO,EAAM,MAAQ,IAM7B,OAAS,GAAI,EAAG,EAAI,EAAU,EAAE,EAC9B,AAAI,IAAe,GAAO,IACxB,GAAO,GAAM,EAAO,GAAc,ICpXjC,YAAoB,CAQzB,YAAY,EAA0B,CACpC,KAAK,OAAS,EACd,KAAK,OAAS,GAAY,EAAQ,EAAG,EAAG,IACxC,KAAK,UAAY,GAAW,KAAK,QAMnC,UAAU,EAAuC,CAC/C,AAAI,MAAO,IAAS,SAElB,EAAO,EAAK,MAAM,KAGlB,EAAO,EAAK,MAAM,GAGpB,GAAI,GAAI,KAAK,OACb,KAAO,EAAK,OAAS,EAAG,EAAK,QAC3B,EAAI,EAAE,EAAK,IAAI,OAGjB,MAAO,GAAE,EAAK,IAMhB,gBAAgB,EAAyC,CACvD,AAAI,MAAO,IAAS,UAElB,GAAO,EAAK,MAAM,MAEpB,GAAM,GAAyB,GAC3B,EAAI,KAAK,OACb,KAAO,EAAK,OAAS,EAAG,EAAK,QAC3B,EAAO,KAAK,EAAE,EAAK,KACf,EAAK,OAAS,GAChB,GAAI,EAAE,EAAK,IAAI,QAGnB,MAAO,GAGT,YAAY,EAAiB,EAAiC,CAC5D,GAAY,KAAM,EAAK,GAGzB,gBAAgB,EAAyC,CACvD,MAAO,IAAgB,KAAM,GAG/B,SAAS,EAAgC,CACvC,UAAY,KAAK,OAAQ,GACzB,GAAY,KAAK,OAAQ,GAClB,KAGT,UAA4B,CAC1B,MAAO,IAAY,QAIvB,YAAqB,EAAa,EAA0B,CAC1D,OAAW,KAAQ,GAAQ,CACzB,GAAM,GAAO,EAAO,GACpB,AAAI,EAAK,OACP,GAAY,EAAK,OAAQ,GAEzB,EAAK,YAAc,GAMzB,YACE,EACA,EACA,EACA,EAC8B,CAC9B,GAAM,GAA0C,GAEhD,OAAW,KAAQ,GAAQ,CACzB,GAAM,GAAO,EAAO,GAGd,EAAW,CAAC,EAAK,SACjB,EAAW,QAAQ,EAAK,UAC1B,EAAY,EACZ,EAAY,EAEZ,EAAiC,WAYrC,GAXK,GACH,GAAiB,WACjB,KAEE,GACF,GAAiB,WACjB,IACI,GAAU,KAIZ,EAAK,OAAQ,CACf,GAAM,GAAQ,EAAK,OAAO,CAAC,IAC3B,EAAU,GAAQ,CAChB,OACA,KAAM,EACN,IAAK,EAAM,OACX,iBACA,YACA,YACA,SAAU,GACV,WAAY,OAAO,KAAK,EAAK,QAAQ,OACrC,OAAQ,GAAY,EAAK,OAAQ,EAAW,EAAW,IAEzD,SAGF,GAAM,GAAe,GAAsB,EAAK,MAChD,GAAI,CAAC,EACH,KAAM,IAAI,OAAM,yBAAyB,EAAK,QAIhD,GADA,EAAK,SAAW,EAAK,UAAY,QAC7B,CAAE,GAAK,WAAY,KACrB,KAAM,IAAI,OAAM,iCAAiC,EAAK,YAIxD,GADA,EAAK,YAAc,EAAK,aAAe,eACnC,CAAE,GAAK,cAAe,KACxB,KAAM,IAAI,OAAM,mCAAmC,EAAK,eAI1D,GAAM,GAAQ,EAAK,OAAO,CAAC,IAC3B,EAAU,GAAQ,CAChB,OACA,cAAe,EAAQ,cACvB,aAAc,EAAQ,aACtB,KAAM,EACN,IAAK,EAAM,OACX,iBACA,SAAU,EAAK,SACf,YAAa,EAAK,YAClB,WAAY,EAAK,YAAc,EAAQ,WACvC,UAAW,EAAK,UAChB,MAAO,EAAK,MACZ,YACA,aAGJ,MAAO,GAGT,YAAoB,EAAsD,CACxE,GAAI,GAAuB,GAC3B,OAAW,KAAK,GACd,EAAK,KAAK,EAAO,IACb,EAAO,GAAG,UACZ,GAAO,EAAK,OAAO,GAAW,EAAO,GAAG,UAG5C,MAAO,GCxLT,OAAqE,SCF9D,GAAK,IAAL,UAAK,EAAL,CACL,YAAU,GAAV,UACA,UAAQ,GAAR,QACA,UAAQ,GAAR,QACA,UAAQ,GAAR,QACA,UAAQ,GAAR,QACA,WAAS,GAAT,SACA,eAAa,GAAb,aACA,yBAAuB,GAAvB,yBARU,aCAL,GAAK,IAAL,UAAK,EAAL,CACL,SAAO,GAAP,OACA,QAAM,GAAN,MACA,kBAAgB,GAAhB,gBACA,SAAO,GAAP,OACA,SAAO,GAAP,OACA,YAAU,GAAV,UACA,SAAO,GAAP,OACA,gBAAc,GAAd,cACA,gBAAc,GAAd,cACA,qBAAmB,GAAnB,mBACA,qBAAmB,IAAnB,mBACA,WAAS,IAAT,SACA,YAAU,IAAV,UACA,YAAU,IAAV,UACA,YAAU,IAAV,UACA,UAAQ,IAAR,QACA,WAAS,IAAT,SACA,WAAS,IAAT,SACA,WAAS,IAAT,SACA,SAAO,IAAP,OACA,SAAO,IAAP,OACA,aAAW,IAAX,aAtBU,aCAL,GAAK,IAAL,UAAK,EAAL,CACL,aAAW,GAAX,WACA,aAAW,GAAX,WACA,aAAW,GAAX,aAHU,aCAL,GAAK,IAAL,UAAK,EAAL,CACL,UAAQ,GAAR,QACA,qBAAmB,GAAnB,mBACA,QAAM,GAAN,MACA,eAAa,GAAb,aACA,wBAAsB,GAAtB,sBACA,4BAA0B,GAA1B,0BACA,qBAAmB,GAAnB,mBACA,mBAAiB,GAAjB,mBARU,aCAL,GAAK,IAAL,UAAK,EAAL,CACL,iBAAe,GAAf,eACA,WAAS,GAAT,SACA,SAAO,GAAP,OACA,QAAM,GAAN,MACA,WAAS,GAAT,SACA,QAAM,GAAN,MACA,SAAO,GAAP,OACA,YAAU,GAAV,YARU,aCAL,GAAK,IAAL,UAAK,EAAL,CACL,cAAY,GAAZ,YACA,eAAa,GAAb,aACA,oBAAkB,GAAlB,kBACA,iBAAe,GAAf,iBAJU,aCAZ,OAAkB,SAClB,GAAwB,SASjB,QAAiB,CAOtB,YAAY,EAAwB,CAClC,AAAI,GAAQ,MAAQ,EAAK,KAAO,MAC9B,MAAK,IAAM,EAAK,KAEd,GAAQ,MAAQ,EAAK,KAAO,MAC9B,MAAK,IAAM,EAAK,KAEd,GAAQ,MAAQ,EAAK,YAAc,MACrC,CAAI,MAAO,GAAK,YAAe,SAC7B,KAAK,WAAa,GAAI,YAAM,EAAK,YAEjC,KAAK,WAAa,EAAK,YAGvB,GAAQ,MAAQ,EAAK,gBAAkB,MACzC,CAAI,MAAO,GAAK,gBAAmB,SACjC,KAAK,eAAiB,GAAI,YAAM,EAAK,gBAErC,KAAK,eAAiB,EAAK,gBAG3B,GAAQ,MAAQ,EAAK,WAAa,MACpC,MAAK,UAAY,EAAK,WAEpB,GAAQ,MAAQ,EAAK,WAAa,MACpC,MAAK,UAAY,EAAK,WAGnB,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,cACpB,KAAK,KAAO,MACd,GAAO,gBAAgB,MAAO,AAAO,UAAO,KAAK,OAAQ,GACzD,EAAO,YAAY,KAAK,KACxB,EAAO,iBAEL,KAAK,KAAO,MACd,GAAO,gBAAgB,MAAO,AAAO,UAAO,KAAK,OAAQ,GACzD,EAAO,YAAY,KAAK,KACxB,EAAO,iBAEL,KAAK,YAAc,MACrB,GAAO,gBAAgB,aAAc,AAAO,UAAO,KAAK,IAAK,GAC7D,EAAO,SAAS,KAAK,YACrB,EAAO,iBAEL,KAAK,gBAAkB,MACzB,GAAO,gBAAgB,iBAAkB,AAAO,UAAO,KAAK,IAAK,GACjE,EAAO,SAAS,KAAK,gBACrB,EAAO,iBAEL,KAAK,WAAa,MACpB,GAAO,gBAAgB,YAAa,AAAO,UAAO,KAAK,OAAQ,GAC/D,EAAO,YAAY,KAAK,WACxB,EAAO,iBAEL,KAAK,WAAa,MACpB,GAAO,gBAAgB,YAAa,AAAO,UAAO,KAAK,OAAQ,GAC/D,EAAO,YAAY,KAAK,WACxB,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAqC,CACtD,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GAAkB,EAAM,aAC9B,EAAM,IAAM,MAEZ,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GAAkB,EAAM,aAC9B,EAAM,IAAM,MAEZ,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAiB,EAAM,UAC7B,EAAM,WAAa,MAEnB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAiB,EAAM,UAC7B,EAAM,eAAiB,MAEvB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GAAkB,EAAM,aAC9B,EAAM,UAAY,MAElB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GAAkB,EAAM,aAC9B,EAAM,UAAY,MAElB,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAER,SAAM,gBACC,GAAI,IAAW,KCnJ1B,OAAwB,SAEjB,QAAiB,CACtB,aAAc,EACP,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,cACxB,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAqC,CAEtD,IADA,EAAM,oBACO,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,WAEJ,EAAM,KAAK,GAGf,EAAM,eAER,SAAM,gBACC,GAAI,MC3Bf,OAAwB,SAEjB,QAAe,CACpB,aAAc,EACP,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,YACxB,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAmC,CAEpD,IADA,EAAM,oBACO,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,WAEJ,EAAM,KAAK,GAGf,EAAM,eAER,SAAM,gBACC,GAAI,MC3Bf,OAAwB,SAEjB,QAAc,CACnB,aAAc,EACP,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,WACxB,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAkC,CAEnD,IADA,EAAM,oBACO,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,WAEJ,EAAM,KAAK,GAGf,EAAM,eAER,SAAM,gBACC,GAAI,MC3Bf,OAAwB,SAEjB,QAAe,CACpB,aAAc,EACP,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,YACxB,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAmC,CAEpD,IADA,EAAM,oBACO,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,WAEJ,EAAM,KAAK,GAGf,EAAM,eAER,SAAM,gBACC,GAAI,MC3Bf,OAAwB,SAEjB,QAAe,CACpB,aAAc,EACP,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,YACxB,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAmC,CAEpD,IADA,EAAM,oBACO,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,WAEJ,EAAM,KAAK,GAGf,EAAM,eAER,SAAM,gBACC,GAAI,MC3Bf,OAAwB,SAEjB,QAAe,CACpB,aAAc,EACP,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,YACxB,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAmC,CAEpD,IADA,EAAM,oBACO,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,WAEJ,EAAM,KAAK,GAGf,EAAM,eAER,SAAM,gBACC,GAAI,MC3Bf,OAAwB,SAEjB,QAAe,CACpB,aAAc,EACP,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,YACxB,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAmC,CAEpD,IADA,EAAM,oBACO,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,WAEJ,EAAM,KAAK,GAGf,EAAM,eAER,SAAM,gBACC,GAAI,MC3Bf,OAAwB,SAKjB,QAAkB,CAGvB,YAAY,EAAwB,CAClC,GAAI,GAAQ,MAAQ,EAAK,OAAS,KAChC,KAAK,MAAQ,EAAK,UAElB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,mCAGJ,GAAI,GAAQ,MAAQ,EAAK,WAAa,KACpC,KAAK,UAAY,EAAK,cAEtB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,uCAIC,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,eACpB,KAAK,OAAS,MAChB,GAAO,gBAAgB,QAAS,AAAO,UAAO,KAAK,IAAK,GACxD,EAAO,SAAS,KAAK,OACrB,EAAO,iBAEL,KAAK,WAAa,MACpB,GAAO,gBAAgB,YAAa,AAAO,UAAO,KAAK,IAAK,GAC5D,EAAO,SAAS,KAAK,WACrB,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAsC,CACvD,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,MAAQ,MAEd,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,UAAY,MAElB,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBACF,EAAM,QAAU,QAAa,EAAM,YAAc,OACnD,MAAO,IAAI,IAAY,GAEvB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,2CCjFR,OAAwB,SAEjB,QAAmB,CACxB,aAAc,EACP,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,gBACxB,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAuC,CAExD,IADA,EAAM,oBACO,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,WAEJ,EAAM,KAAK,GAGf,EAAM,eAER,SAAM,gBACC,GAAI,MC3Bf,OAAwB,SAEjB,QAAmB,CACxB,aAAc,EACP,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,gBACxB,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAuC,CAExD,IADA,EAAM,oBACO,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,WAEJ,EAAM,KAAK,GAGf,EAAM,eAER,SAAM,gBACC,GAAI,MC3Bf,OAAwB,SCAxB,OAAwB,SAOjB,YAAe,CAGpB,YAAY,EAAsB,CAChC,GAAI,GAAqB,EACzB,GAAI,GAAQ,KAAM,CAShB,GARI,EAAK,QAAU,MACjB,KACA,KAAK,OAAS,EAAK,QAEjB,EAAK,QAAU,MACjB,KACA,KAAK,OAAS,EAAK,QAEjB,EAAa,EACf,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,aACrC,sDAEG,GAAI,EAAa,EACtB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,aACrC,kDAKM,YAAW,EAA6C,CACpE,MAAO,IAAI,IAAS,CAAC,iBAET,YAAW,EAA6C,CACpE,MAAO,IAAI,IAAS,CAAC,WAEhB,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,YACpB,KAAK,QAAU,MACjB,GAAO,gBAAgB,SAAU,AAAO,UAAO,KAAK,OAAQ,GAC5D,KAAK,OAAO,MAAM,GAClB,EAAO,iBAEL,KAAK,QAAU,MACjB,GAAO,gBAAgB,SAAU,AAAO,UAAO,KAAK,OAAQ,GAC5D,KAAK,OAAO,MAAM,GAClB,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAmC,CACpD,GAAI,GAAqB,EACrB,EAAgC,KAEpC,IADA,EAAM,oBACO,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,IACA,GAAM,GAAqC,AAAa,GAAa,KAAK,GAC1E,EAAe,GAAS,WAAW,OAEnC,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,IACA,GAAM,GAAqC,AAAa,GAAa,KAAK,GAC1E,EAAe,GAAS,WAAW,OAEnC,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBACF,EAAa,EACf,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,aACrC,sDAEG,GAAI,EAAa,EACtB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,aACrC,2CAGJ,GAAI,IAAiB,KACnB,MAAO,GAEP,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,oCDvGD,YAAoB,CAGzB,YAAY,EAA0B,CACpC,GAAI,GAAQ,MAAQ,EAAK,iBAAmB,KAC1C,KAAK,gBAAkB,EAAK,oBAE5B,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,6CAGJ,GAAI,GAAQ,MAAQ,EAAK,MAAQ,KAC/B,KAAK,KAAO,EAAK,SAEjB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,kCAIC,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,iBACpB,KAAK,iBAAmB,MAC1B,GAAO,gBAAgB,kBAAmB,AAAO,UAAO,KAAK,KAAM,GACnE,EAAO,UAAU,KAAK,iBACtB,EAAO,iBAEL,KAAK,MAAQ,MACf,GAAO,gBAAgB,OAAQ,AAAO,UAAO,KAAK,OAAQ,GAC1D,KAAK,KAAK,MAAM,GAChB,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAwC,CACzD,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GAAmB,EAAM,WAC/B,EAAM,gBAAkB,MAExB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GAA6B,AAAS,GAAS,KAAK,GAC1D,EAAM,KAAO,MAEb,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBACF,EAAM,kBAAoB,QAAa,EAAM,OAAS,OACxD,MAAO,IAAI,IAAc,GAEzB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,6CElFR,OAAwB,SAMjB,YAAe,CAGpB,YAAY,EAAqB,CAC/B,GAAI,GAAQ,MAAQ,EAAK,iBAAmB,KAC1C,KAAK,gBAAkB,EAAK,oBAE5B,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,6CAGJ,GAAI,GAAQ,MAAQ,EAAK,MAAQ,KAC/B,KAAK,KAAO,EAAK,SAEjB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,kCAIC,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,YACpB,KAAK,iBAAmB,MAC1B,GAAO,gBAAgB,kBAAmB,AAAO,UAAO,KAAK,KAAM,GACnE,EAAO,UAAU,KAAK,iBACtB,EAAO,iBAEL,KAAK,MAAQ,MACf,GAAO,gBAAgB,OAAQ,AAAO,UAAO,KAAK,OAAQ,GAC1D,KAAK,KAAK,MAAM,GAChB,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAmC,CACpD,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GAAmB,EAAM,WAC/B,EAAM,gBAAkB,MAExB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GAA6B,AAAS,GAAS,KAAK,GAC1D,EAAM,KAAO,MAEb,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBACF,EAAM,kBAAoB,QAAa,EAAM,OAAS,OACxD,MAAO,IAAI,IAAS,GAEpB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,wCClFR,OAAwB,SAKjB,QAAc,CAGnB,YAAY,EAAoB,CAC9B,GAAI,GAAQ,MAAQ,EAAK,UAAY,KACnC,KAAK,SAAW,EAAK,aAErB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,sCAGJ,GAAI,GAAQ,MAAQ,EAAK,UAAY,KACnC,KAAK,SAAW,EAAK,aAErB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,sCAIC,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,WACpB,KAAK,UAAY,MACnB,GAAO,gBAAgB,WAAY,AAAO,UAAO,KAAK,KAAM,GAC5D,EAAO,UAAU,KAAK,UACtB,EAAO,iBAEL,KAAK,UAAY,MACnB,GAAO,gBAAgB,WAAY,AAAO,UAAO,KAAK,KAAM,GAC5D,EAAO,UAAU,KAAK,UACtB,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAkC,CACnD,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GAAkB,EAAM,WAC9B,EAAM,SAAW,MAEjB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GAAmB,EAAM,WAC/B,EAAM,SAAW,MAEjB,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBACF,EAAM,WAAa,QAAa,EAAM,WAAa,OACrD,MAAO,IAAI,IAAQ,GAEnB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,uCCjFR,OAAwB,SAEjB,QAAe,CACpB,aAAc,EACP,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,YACxB,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAmC,CAEpD,IADA,EAAM,oBACO,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,WAEJ,EAAM,KAAK,GAGf,EAAM,eAER,SAAM,gBACC,GAAI,MC3Bf,OAAwB,SAEjB,QAAe,CACpB,aAAc,EACP,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,YACxB,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAmC,CAEpD,IADA,EAAM,oBACO,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,WAEJ,EAAM,KAAK,GAGf,EAAM,eAER,SAAM,gBACC,GAAI,MC3Bf,OAAwB,SCAxB,OAAwB,SA6BjB,YAAkB,CAcvB,YAAY,EAAyB,CACnC,GAAI,GAAqB,EACzB,GAAI,GAAQ,KAAM,CAqDhB,GApDI,EAAK,QAAU,MACjB,KACA,KAAK,OAAS,EAAK,QAEjB,EAAK,KAAO,MACd,KACA,KAAK,IAAM,EAAK,KAEd,EAAK,MAAQ,MACf,KACA,KAAK,KAAO,EAAK,MAEf,EAAK,MAAQ,MACf,KACA,KAAK,KAAO,EAAK,MAEf,EAAK,SAAW,MAClB,KACA,KAAK,QAAU,EAAK,SAElB,EAAK,MAAQ,MACf,KACA,KAAK,KAAO,EAAK,MAEf,EAAK,MAAQ,MACf,KACA,KAAK,KAAO,EAAK,MAEf,EAAK,WAAa,MACpB,KACA,KAAK,UAAY,EAAK,WAEpB,EAAK,SAAW,MAClB,KACA,KAAK,QAAU,EAAK,SAElB,EAAK,SAAW,MAClB,KACA,KAAK,QAAU,EAAK,SAElB,EAAK,MAAQ,MACf,KACA,KAAK,KAAO,EAAK,MAEf,EAAK,MAAQ,MACf,KACA,KAAK,KAAO,EAAK,MAEf,EAAK,MAAQ,MACf,KACA,KAAK,KAAO,EAAK,MAEf,EAAa,EACf,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,aACrC,sDAEG,GAAI,EAAa,EACtB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,aACrC,kDAKM,YAAW,EAA4C,CACnE,MAAO,IAAI,IAAY,CAAC,iBAEZ,SAAQ,EAAmC,CACvD,MAAO,IAAI,IAAY,CAAC,cAEZ,UAAS,EAAsC,CAC3D,MAAO,IAAI,IAAY,CAAC,eAEZ,UAAS,EAAsC,CAC3D,MAAO,IAAI,IAAY,CAAC,eAEZ,aAAY,EAA+C,CACvE,MAAO,IAAI,IAAY,CAAC,kBAEZ,UAAS,EAAsC,CAC3D,MAAO,IAAI,IAAY,CAAC,eAEZ,UAAS,EAAsC,CAC3D,MAAO,IAAI,IAAY,CAAC,eAEZ,eAAc,EAAqD,CAC/E,MAAO,IAAI,IAAY,CAAC,oBAEZ,aAAY,EAAuC,CAC/D,MAAO,IAAI,IAAY,CAAC,kBAEZ,aAAY,EAAyC,CACjE,MAAO,IAAI,IAAY,CAAC,kBAEZ,UAAS,EAAsC,CAC3D,MAAO,IAAI,IAAY,CAAC,eAEZ,UAAS,EAAsC,CAC3D,MAAO,IAAI,IAAY,CAAC,eAEZ,UAAS,EAAsC,CAC3D,MAAO,IAAI,IAAY,CAAC,SAEnB,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,eACpB,KAAK,QAAU,MACjB,GAAO,gBAAgB,SAAU,AAAO,UAAO,KAAK,OAAQ,GAC5D,KAAK,OAAO,MAAM,GAClB,EAAO,iBAEL,KAAK,KAAO,MACd,GAAO,gBAAgB,MAAO,AAAO,UAAO,KAAK,OAAQ,GACzD,KAAK,IAAI,MAAM,GACf,EAAO,iBAEL,KAAK,MAAQ,MACf,GAAO,gBAAgB,OAAQ,AAAO,UAAO,KAAK,OAAQ,GAC1D,KAAK,KAAK,MAAM,GAChB,EAAO,iBAEL,KAAK,MAAQ,MACf,GAAO,gBAAgB,OAAQ,AAAO,UAAO,KAAK,OAAQ,GAC1D,KAAK,KAAK,MAAM,GAChB,EAAO,iBAEL,KAAK,SAAW,MAClB,GAAO,gBAAgB,UAAW,AAAO,UAAO,KAAK,OAAQ,GAC7D,KAAK,QAAQ,MAAM,GACnB,EAAO,iBAEL,KAAK,MAAQ,MACf,GAAO,gBAAgB,OAAQ,AAAO,UAAO,KAAK,OAAQ,GAC1D,KAAK,KAAK,MAAM,GAChB,EAAO,iBAEL,KAAK,MAAQ,MACf,GAAO,gBAAgB,OAAQ,AAAO,UAAO,KAAK,OAAQ,GAC1D,KAAK,KAAK,MAAM,GAChB,EAAO,iBAEL,KAAK,WAAa,MACpB,GAAO,gBAAgB,YAAa,AAAO,UAAO,KAAK,OAAQ,GAC/D,KAAK,UAAU,MAAM,GACrB,EAAO,iBAEL,KAAK,SAAW,MAClB,GAAO,gBAAgB,UAAW,AAAO,UAAO,KAAK,OAAQ,IAC7D,KAAK,QAAQ,MAAM,GACnB,EAAO,iBAEL,KAAK,SAAW,MAClB,GAAO,gBAAgB,UAAW,AAAO,UAAO,KAAK,OAAQ,IAC7D,KAAK,QAAQ,MAAM,GACnB,EAAO,iBAEL,KAAK,MAAQ,MACf,GAAO,gBAAgB,OAAQ,AAAO,UAAO,KAAK,OAAQ,IAC1D,KAAK,KAAK,MAAM,GAChB,EAAO,iBAEL,KAAK,MAAQ,MACf,GAAO,gBAAgB,OAAQ,AAAO,UAAO,KAAK,OAAQ,IAC1D,KAAK,KAAK,MAAM,GAChB,EAAO,iBAEL,KAAK,MAAQ,MACf,GAAO,gBAAgB,OAAQ,AAAO,UAAO,KAAK,OAAQ,IAC1D,KAAK,KAAK,MAAM,GAChB,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAsC,CACvD,GAAI,GAAqB,EACrB,EAAmC,KAEvC,IADA,EAAM,oBACO,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,IACA,GAAM,GAAiC,AAAW,GAAW,KAAK,GAClE,EAAe,GAAY,WAAW,OAEtC,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,IACA,GAAM,GAA2B,AAAQ,GAAQ,KAAK,GACtD,EAAe,GAAY,QAAQ,OAEnC,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,IACA,GAAM,GAA6B,AAAS,GAAS,KAAK,GAC1D,EAAe,GAAY,SAAS,OAEpC,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,IACA,GAAM,GAA6B,AAAS,GAAS,KAAK,GAC1D,EAAe,GAAY,SAAS,OAEpC,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,IACA,GAAM,GAAmC,AAAY,GAAY,KAAK,GACtE,EAAe,GAAY,YAAY,OAEvC,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,IACA,GAAM,GAA6B,AAAS,GAAS,KAAK,GAC1D,EAAe,GAAY,SAAS,OAEpC,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,IACA,GAAM,GAA6B,AAAS,GAAS,KAAK,GAC1D,EAAe,GAAY,SAAS,OAEpC,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,IACA,GAAM,GAAuC,AAAc,GAAc,KAAK,GAC9E,EAAe,GAAY,cAAc,OAEzC,GAAM,KAAK,GAEb,UACG,IACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,IACA,GAAM,GAA2B,AAAQ,GAAQ,KAAK,GACtD,EAAe,GAAY,YAAY,OAEvC,GAAM,KAAK,GAEb,UACG,IACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,IACA,GAAM,GAA8B,AAAS,GAAS,KAAK,GAC3D,EAAe,GAAY,YAAY,OAEvC,GAAM,KAAK,GAEb,UACG,IACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,IACA,GAAM,GAA8B,AAAS,GAAS,KAAK,GAC3D,EAAe,GAAY,SAAS,OAEpC,GAAM,KAAK,GAEb,UACG,IACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,IACA,GAAM,GAA8B,AAAS,GAAS,KAAK,GAC3D,EAAe,GAAY,SAAS,OAEpC,GAAM,KAAK,GAEb,UACG,IACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,IACA,GAAM,GAA8B,AAAS,GAAS,KAAK,GAC3D,EAAe,GAAY,SAAS,OAEpC,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBACF,EAAa,EACf,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,aACrC,sDAEG,GAAI,EAAa,EACtB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,aACrC,2CAGJ,GAAI,IAAiB,KACnB,MAAO,GAEP,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,oCDpWD,YAAoB,CAWzB,YAAY,EAA0B,CAUpC,GATI,GAAQ,MAAQ,EAAK,MAAQ,MAC/B,MAAK,KAAO,EAAK,MAEf,GAAQ,MAAQ,EAAK,aAAe,MACtC,MAAK,YAAc,EAAK,aAEtB,GAAQ,MAAQ,EAAK,iBAAmB,MAC1C,MAAK,gBAAkB,EAAK,iBAE1B,GAAQ,MAAQ,EAAK,MAAQ,KAC/B,KAAK,KAAO,EAAK,SAEjB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,kCAGJ,AAAI,GAAQ,MAAQ,EAAK,cAAgB,MACvC,MAAK,aAAe,EAAK,cAEvB,GAAQ,MAAQ,EAAK,gBAAkB,MACzC,MAAK,eAAiB,EAAK,gBAEzB,GAAQ,MAAQ,EAAK,OAAS,MAChC,MAAK,MAAQ,EAAK,OAEhB,GAAQ,MAAQ,EAAK,WAAa,MACpC,MAAK,UAAY,EAAK,WAEpB,GAAQ,MAAQ,EAAK,UAAY,MACnC,MAAK,SAAW,EAAK,UAEnB,GAAQ,MAAQ,EAAK,aAAe,MACtC,MAAK,YAAc,EAAK,aAGrB,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,iBACpB,KAAK,MAAQ,MACf,GAAO,gBAAgB,OAAQ,AAAO,UAAO,KAAK,IAAK,GACvD,EAAO,SAAS,KAAK,MACrB,EAAO,iBAEL,KAAK,aAAe,MACtB,GAAO,gBAAgB,cAAe,AAAO,UAAO,KAAK,IAAK,GAC9D,EAAO,SAAS,KAAK,aACrB,EAAO,iBAEL,KAAK,iBAAmB,MAC1B,GAAO,gBAAgB,kBAAmB,AAAO,UAAO,KAAK,IAAK,GAClE,EAAO,SAAS,KAAK,iBACrB,EAAO,iBAEL,KAAK,MAAQ,MACf,GAAO,gBAAgB,OAAQ,AAAO,UAAO,KAAK,OAAQ,GAC1D,EAAO,YAAY,KAAK,MACxB,EAAO,iBAEL,KAAK,cAAgB,MACvB,GAAO,gBAAgB,eAAgB,AAAO,UAAO,KAAK,IAAK,GAC/D,EAAO,SAAS,KAAK,cACrB,EAAO,iBAEL,KAAK,gBAAkB,MACzB,GAAO,gBAAgB,iBAAkB,AAAO,UAAO,KAAK,IAAK,GACjE,EAAO,SAAS,KAAK,gBACrB,EAAO,iBAEL,KAAK,OAAS,MAChB,GAAO,gBAAgB,QAAS,AAAO,UAAO,KAAK,IAAK,GACxD,EAAO,SAAS,KAAK,OACrB,EAAO,iBAEL,KAAK,WAAa,MACpB,GAAO,gBAAgB,YAAa,AAAO,UAAO,KAAK,IAAK,GAC5D,EAAO,SAAS,KAAK,WACrB,EAAO,iBAEL,KAAK,UAAY,MACnB,GAAO,gBAAgB,WAAY,AAAO,UAAO,KAAK,IAAK,GAC3D,EAAO,SAAS,KAAK,UACrB,EAAO,iBAEL,KAAK,aAAe,MACtB,GAAO,gBAAgB,cAAe,AAAO,UAAO,KAAK,OAAQ,IACjE,KAAK,YAAY,MAAM,GACvB,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAwC,CACzD,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAqB,EAAM,UACjC,EAAM,KAAO,MAEb,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,YAAc,MAEpB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAmD,EAAM,UAC/D,EAAM,gBAAkB,MAExB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GAAkB,EAAM,aAC9B,EAAM,KAAO,MAEb,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,aAAe,MAErB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAuC,EAAM,UACnD,EAAM,eAAiB,MAEvB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,MAAQ,MAEd,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,UAAY,MAElB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,SAAW,MAEjB,GAAM,KAAK,GAEb,UACG,IACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GAAoC,AAAY,GAAY,KAAK,GACvE,EAAM,YAAc,MAEpB,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBACF,EAAM,OAAS,OACjB,MAAO,IAAI,IAAc,GAEzB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,6CEhOR,OAAwB,SAUjB,YAAqB,CAM1B,YAAY,EAA2B,CACrC,GAAI,GAAQ,MAAQ,EAAK,YAAc,KACrC,KAAK,WAAa,EAAK,eAEvB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,wCAGJ,GAAI,GAAQ,MAAQ,EAAK,UAAY,KACnC,KAAK,SAAW,EAAK,aAErB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,sCAGJ,GAAI,GAAQ,MAAQ,EAAK,2BAA6B,KACpD,KAAK,0BAA4B,EAAK,8BAEtC,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,uDAGJ,GAAI,GAAQ,MAAQ,EAAK,2BAA6B,KACpD,KAAK,0BAA4B,EAAK,8BAEtC,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,uDAGJ,AAAI,GAAQ,MAAQ,EAAK,YAAc,MACrC,MAAK,WAAa,EAAK,YAGpB,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,kBACpB,KAAK,YAAc,MACrB,GAAO,gBAAgB,aAAc,AAAO,UAAO,KAAK,IAAK,GAC7D,EAAO,SAAS,KAAK,YACrB,EAAO,iBAEL,KAAK,UAAY,MACnB,GAAO,gBAAgB,WAAY,AAAO,UAAO,KAAK,IAAK,GAC3D,EAAO,SAAS,KAAK,UACrB,EAAO,iBAEL,KAAK,2BAA6B,MACpC,GAAO,gBAAgB,4BAA6B,AAAO,UAAO,KAAK,IAAK,GAC5E,EAAO,SAAS,KAAK,2BACrB,EAAO,iBAEL,KAAK,2BAA6B,MACpC,GAAO,gBAAgB,4BAA6B,AAAO,UAAO,KAAK,IAAK,GAC5E,EAAO,SAAS,KAAK,2BACrB,EAAO,iBAEL,KAAK,YAAc,MACrB,GAAO,gBAAgB,aAAc,AAAO,UAAO,KAAK,OAAQ,GAChE,KAAK,WAAW,MAAM,GACtB,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAyC,CAC1D,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,WAAa,MAEnB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAA6B,EAAM,UACzC,EAAM,SAAW,MAEjB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAA6B,EAAM,UACzC,EAAM,0BAA4B,MAElC,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAA6B,EAAM,UACzC,EAAM,0BAA4B,MAElC,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GAAiC,AAAW,GAAW,KAAK,GAClE,EAAM,WAAa,MAEnB,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBAEJ,EAAM,aAAe,QACrB,EAAM,WAAa,QACnB,EAAM,4BAA8B,QACpC,EAAM,4BAA8B,OAEpC,MAAO,IAAI,IAAe,GAE1B,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,8CCxJR,OAAwB,SAEjB,QAAsB,CAC3B,aAAc,EACP,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,mBACxB,EAAO,iBACP,EAAO,uBAGK,MAAK,EAA0C,CAE3D,IADA,EAAM,oBACO,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,WAEJ,EAAM,KAAK,GAGf,EAAM,eAER,SAAM,gBACC,GAAI,MC3Bf,OAAwB,SAOjB,QAA2B,CAIhC,YAAY,EAAiC,CAC3C,GAAI,GAAQ,MAAQ,EAAK,YAAc,KACrC,KAAK,WAAa,EAAK,eAEvB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,wCAGJ,GAAI,GAAQ,MAAQ,EAAK,UAAY,KACnC,KAAK,SAAW,EAAK,aAErB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,sCAGJ,AAAI,GAAQ,MAAQ,EAAK,WAAa,MACpC,MAAK,UAAY,EAAK,WAGnB,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,wBACpB,KAAK,YAAc,MACrB,GAAO,gBAAgB,aAAc,AAAO,UAAO,KAAK,IAAK,GAC7D,EAAO,SAAS,KAAK,YACrB,EAAO,iBAEL,KAAK,UAAY,MACnB,GAAO,gBAAgB,WAAY,AAAO,UAAO,KAAK,IAAK,GAC3D,EAAO,SAAS,KAAK,UACrB,EAAO,iBAEL,KAAK,WAAa,MACpB,GAAO,gBAAgB,YAAa,AAAO,UAAO,KAAK,KAAM,GAC7D,EAAO,UAAU,KAAK,WACtB,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAA+C,CAChE,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,WAAa,MAEnB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAA6B,EAAM,UACzC,EAAM,SAAW,MAEjB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GAAmB,EAAM,WAC/B,EAAM,UAAY,MAElB,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBACF,EAAM,aAAe,QAAa,EAAM,WAAa,OACvD,MAAO,IAAI,IAAqB,GAEhC,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,oDCpGR,OAAwB,SAajB,YAAuB,CAS5B,YAAY,EAA6B,CAFlC,mBAA0B,GAG/B,GAAI,GAAQ,MAAQ,EAAK,YAAc,KACrC,KAAK,WAAa,EAAK,eAEvB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,wCAGJ,GAAI,GAAQ,MAAQ,EAAK,WAAa,KACpC,KAAK,UAAY,EAAK,cAEtB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,uCAGJ,GAAI,GAAQ,MAAQ,EAAK,UAAY,KACnC,KAAK,SAAW,EAAK,aAErB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,sCAGJ,GAAI,GAAQ,MAAQ,EAAK,UAAY,KACnC,KAAK,SAAW,EAAK,aAErB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,sCAGJ,GAAI,GAAQ,MAAQ,EAAK,+BAAiC,KACxD,KAAK,8BAAgC,EAAK,kCAE1C,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,2DAGJ,GAAI,GAAQ,MAAQ,EAAK,+BAAiC,KACxD,KAAK,8BAAgC,EAAK,kCAE1C,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,2DAGJ,AAAI,GAAQ,MAAQ,EAAK,eAAiB,MACxC,MAAK,cAAgB,EAAK,eAExB,GAAQ,MAAQ,EAAK,YAAc,MACrC,MAAK,WAAa,EAAK,YAGpB,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,oBACpB,KAAK,YAAc,MACrB,GAAO,gBAAgB,aAAc,AAAO,UAAO,KAAK,IAAK,GAC7D,EAAO,SAAS,KAAK,YACrB,EAAO,iBAEL,KAAK,WAAa,MACpB,GAAO,gBAAgB,YAAa,AAAO,UAAO,KAAK,IAAK,GAC5D,EAAO,SAAS,KAAK,WACrB,EAAO,iBAEL,KAAK,UAAY,MACnB,GAAO,gBAAgB,WAAY,AAAO,UAAO,KAAK,IAAK,GAC3D,EAAO,SAAS,KAAK,UACrB,EAAO,iBAEL,KAAK,UAAY,MACnB,GAAO,gBAAgB,WAAY,AAAO,UAAO,KAAK,IAAK,GAC3D,EAAO,SAAS,KAAK,UACrB,EAAO,iBAEL,KAAK,+BAAiC,MACxC,GAAO,gBAAgB,gCAAiC,AAAO,UAAO,KAAK,IAAK,GAChF,EAAO,SAAS,KAAK,+BACrB,EAAO,iBAEL,KAAK,+BAAiC,MACxC,GAAO,gBAAgB,gCAAiC,AAAO,UAAO,KAAK,IAAK,GAChF,EAAO,SAAS,KAAK,+BACrB,EAAO,iBAEL,KAAK,eAAiB,MACxB,GAAO,gBAAgB,gBAAiB,AAAO,UAAO,KAAK,KAAM,GACjE,EAAO,UAAU,KAAK,eACtB,EAAO,iBAEL,KAAK,YAAc,MACrB,GAAO,gBAAgB,aAAc,AAAO,UAAO,KAAK,OAAQ,GAChE,KAAK,WAAW,MAAM,GACtB,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAA2C,CAC5D,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,WAAa,MAEnB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,UAAY,MAElB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,SAAW,MAEjB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAA6B,EAAM,UACzC,EAAM,SAAW,MAEjB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,8BAAgC,MAEtC,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,8BAAgC,MAEtC,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GAAmB,EAAM,WAC/B,EAAM,cAAgB,MAEtB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GAAiC,AAAW,GAAW,KAAK,GAClE,EAAM,WAAa,MAEnB,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBAEJ,EAAM,aAAe,QACrB,EAAM,YAAc,QACpB,EAAM,WAAa,QACnB,EAAM,WAAa,QACnB,EAAM,gCAAkC,QACxC,EAAM,gCAAkC,OAExC,MAAO,IAAI,IAAiB,GAE5B,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,gDC1NR,OAAwB,SAgBjB,YAAiB,CAStB,YAAY,EAAuB,CACjC,GAAI,GAAQ,MAAQ,EAAK,MAAQ,KAC/B,KAAK,KAAO,EAAK,SAEjB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,kCAGJ,GAAI,GAAQ,MAAQ,EAAK,wBAA0B,KACjD,KAAK,uBAAyB,EAAK,2BAEnC,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,oDAGJ,GAAI,GAAQ,MAAQ,EAAK,sBAAwB,KAC/C,KAAK,qBAAuB,EAAK,yBAEjC,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,kDAGJ,AAAI,GAAQ,MAAQ,EAAK,KAAO,MAC9B,MAAK,IAAM,EAAK,KAEd,GAAQ,MAAQ,EAAK,kBAAoB,MAC3C,MAAK,iBAAmB,EAAK,kBAE3B,GAAQ,MAAQ,EAAK,mBAAqB,MAC5C,MAAK,kBAAoB,EAAK,mBAE5B,GAAQ,MAAQ,EAAK,wBAA0B,MACjD,MAAK,uBAAyB,EAAK,wBAEjC,GAAQ,MAAQ,EAAK,qBAAuB,MAC9C,MAAK,oBAAsB,EAAK,qBAG7B,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,cACpB,KAAK,MAAQ,MACf,GAAO,gBAAgB,OAAQ,AAAO,UAAO,KAAK,IAAK,GACvD,EAAO,SAAS,KAAK,MACrB,EAAO,iBAEL,KAAK,wBAA0B,MACjC,GAAO,gBAAgB,yBAA0B,AAAO,UAAO,KAAK,IAAK,GACzE,EAAO,SAAS,KAAK,wBACrB,EAAO,iBAEL,KAAK,sBAAwB,MAC/B,GAAO,gBAAgB,uBAAwB,AAAO,UAAO,KAAK,IAAK,GACvE,EAAO,SAAS,KAAK,sBACrB,EAAO,iBAEL,KAAK,KAAO,MACd,GAAO,gBAAgB,MAAO,AAAO,UAAO,KAAK,IAAK,GACtD,EAAO,SAAS,KAAK,KACrB,EAAO,iBAEL,KAAK,kBAAoB,MAC3B,GAAO,gBAAgB,mBAAoB,AAAO,UAAO,KAAK,OAAQ,GACtE,KAAK,iBAAiB,MAAM,GAC5B,EAAO,iBAEL,KAAK,mBAAqB,MAC5B,GAAO,gBAAgB,oBAAqB,AAAO,UAAO,KAAK,OAAQ,GACvE,KAAK,kBAAkB,MAAM,GAC7B,EAAO,iBAEL,KAAK,wBAA0B,MACjC,GAAO,gBAAgB,yBAA0B,AAAO,UAAO,KAAK,OAAQ,GAC5E,KAAK,uBAAuB,MAAM,GAClC,EAAO,iBAEL,KAAK,qBAAuB,MAC9B,GAAO,gBAAgB,sBAAuB,AAAO,UAAO,KAAK,OAAQ,GACzE,KAAK,oBAAoB,MAAM,GAC/B,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAqC,CACtD,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAA6B,EAAM,UACzC,EAAM,KAAO,MAEb,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,uBAAyB,MAE/B,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,qBAAuB,MAE7B,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,IAAM,MAEZ,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GACJ,AAAe,GAAe,KAAK,GACrC,EAAM,iBAAmB,MAEzB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GACJ,AAAgB,GAAgB,KAAK,GACvC,EAAM,kBAAoB,MAE1B,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GACJ,AAAqB,GAAqB,KAAK,GACjD,EAAM,uBAAyB,MAE/B,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GACJ,AAAiB,GAAiB,KAAK,GACzC,EAAM,oBAAsB,MAE5B,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBAEJ,EAAM,OAAS,QACf,EAAM,yBAA2B,QACjC,EAAM,uBAAyB,OAE/B,MAAO,IAAI,IAAW,GAEtB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,0CC/MR,OAAwB,SAKjB,QAAe,CAGpB,YAAY,EAAqB,CAC/B,GAAI,GAAQ,MAAQ,EAAK,KAAO,KAC9B,KAAK,IAAM,EAAK,QAEhB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,iCAGJ,AAAI,GAAQ,MAAQ,EAAK,OAAS,MAChC,MAAK,MAAQ,EAAK,OAGf,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,YACpB,KAAK,KAAO,MACd,GAAO,gBAAgB,MAAO,AAAO,UAAO,KAAK,OAAQ,GACzD,EAAO,YAAY,KAAK,KACxB,EAAO,iBAEL,KAAK,OAAS,MAChB,GAAO,gBAAgB,QAAS,AAAO,UAAO,KAAK,OAAQ,GAC3D,EAAO,YAAY,KAAK,OACxB,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAmC,CACpD,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GAAkB,EAAM,aAC9B,EAAM,IAAM,MAEZ,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GAAkB,EAAM,aAC9B,EAAM,MAAQ,MAEd,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBACF,EAAM,MAAQ,OAChB,MAAO,IAAI,IAAS,GAEpB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,wCC5ER,OAAwB,SAMjB,QAAoB,CAIzB,YAAY,EAA0B,CACpC,GAAI,GAAQ,MAAQ,EAAK,YAAc,KACrC,KAAK,WAAa,EAAK,eAEvB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,wCAGJ,GAAI,GAAQ,MAAQ,EAAK,YAAc,KACrC,KAAK,WAAa,EAAK,eAEvB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,wCAGJ,GAAI,GAAQ,MAAQ,EAAK,aAAe,KACtC,KAAK,YAAc,EAAK,gBAExB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,yCAIC,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,iBACpB,KAAK,YAAc,MACrB,GAAO,gBAAgB,aAAc,AAAO,UAAO,KAAK,IAAK,GAC7D,EAAO,SAAS,KAAK,YACrB,EAAO,iBAEL,KAAK,YAAc,MACrB,GAAO,gBAAgB,aAAc,AAAO,UAAO,KAAK,KAAM,GAC9D,EAAO,UAAU,KAAK,YACtB,EAAO,iBAEL,KAAK,aAAe,MACtB,GAAO,gBAAgB,cAAe,AAAO,UAAO,KAAK,KAAM,GAC/D,EAAO,UAAU,KAAK,aACtB,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAwC,CACzD,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,WAAa,MAEnB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GAAmB,EAAM,WAC/B,EAAM,WAAa,MAEnB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GAAmB,EAAM,WAC/B,EAAM,YAAc,MAEpB,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBAEJ,EAAM,aAAe,QACrB,EAAM,aAAe,QACrB,EAAM,cAAgB,OAEtB,MAAO,IAAI,IAAc,GAEzB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,6CC5GR,OAAwB,SAQjB,QAAwB,CAI7B,YAAY,EAA8B,CACxC,GAAI,GAAQ,MAAQ,EAAK,WAAa,KACpC,KAAK,UAAY,EAAK,cAEtB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,uCAGJ,GAAI,GAAQ,MAAQ,EAAK,UAAY,KACnC,KAAK,SAAW,EAAK,aAErB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,sCAGJ,GAAI,GAAQ,MAAQ,EAAK,OAAS,KAChC,KAAK,MAAQ,EAAK,UAElB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,mCAIC,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,qBACpB,KAAK,WAAa,MACpB,GAAO,gBAAgB,YAAa,AAAO,UAAO,KAAK,IAAK,GAC5D,EAAO,SAAS,KAAK,WACrB,EAAO,iBAEL,KAAK,UAAY,MACnB,GAAO,gBAAgB,WAAY,AAAO,UAAO,KAAK,IAAK,GAC3D,EAAO,SAAS,KAAK,UACrB,EAAO,iBAEL,KAAK,OAAS,MAChB,GAAO,gBAAgB,QAAS,AAAO,UAAO,KAAK,IAAK,GACxD,EAAO,SAAS,KAAK,OACrB,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAA4C,CAC7D,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAA6B,EAAM,UACzC,EAAM,UAAY,MAElB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAA6B,EAAM,UACzC,EAAM,SAAW,MAEjB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,MAAQ,MAEd,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBAEJ,EAAM,YAAc,QACpB,EAAM,WAAa,QACnB,EAAM,QAAU,OAEhB,MAAO,IAAI,IAAkB,GAE7B,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,iDC9GR,OAAkB,SAClB,GAAwB,SAsBjB,YAAqB,CAc1B,YAAY,EAA2B,CACrC,GAAI,GAAQ,MAAQ,EAAK,MAAQ,KAC/B,KAAK,KAAO,EAAK,SAEjB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,kCAGJ,GAAI,GAAQ,MAAQ,EAAK,WAAa,KACpC,KAAK,UAAY,EAAK,cAEtB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,uCAGJ,GAAI,GAAQ,MAAQ,EAAK,gBAAkB,KACzC,KAAK,eAAiB,EAAK,mBAE3B,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,4CAGJ,GAAI,GAAQ,MAAQ,EAAK,OAAS,KAChC,KAAK,MAAQ,EAAK,UAElB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,mCAGJ,GAAI,GAAQ,MAAQ,EAAK,YAAc,KACrC,AAAI,MAAO,GAAK,YAAe,SAC7B,KAAK,WAAa,GAAI,YAAM,EAAK,YAEjC,KAAK,WAAa,EAAK,eAGzB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,wCAGJ,GAAI,GAAQ,MAAQ,EAAK,yBAA2B,KAClD,AAAI,MAAO,GAAK,yBAA4B,SAC1C,KAAK,wBAA0B,GAAI,YAAM,EAAK,yBAE9C,KAAK,wBAA0B,EAAK,4BAGtC,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,qDAGJ,GAAI,GAAQ,MAAQ,EAAK,uBAAyB,KAChD,AAAI,MAAO,GAAK,uBAA0B,SACxC,KAAK,sBAAwB,GAAI,YAAM,EAAK,uBAE5C,KAAK,sBAAwB,EAAK,0BAGpC,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,mDAMJ,GAHI,GAAQ,MAAQ,EAAK,oBAAsB,MAC7C,MAAK,mBAAqB,EAAK,oBAE7B,GAAQ,MAAQ,EAAK,kBAAoB,KAC3C,AAAI,MAAO,GAAK,kBAAqB,SACnC,KAAK,iBAAmB,GAAI,YAAM,EAAK,kBAEvC,KAAK,iBAAmB,EAAK,qBAG/B,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,8CAGJ,AAAI,GAAQ,MAAQ,EAAK,mBAAqB,MAC5C,CAAI,MAAO,GAAK,mBAAsB,SACpC,KAAK,kBAAoB,GAAI,YAAM,EAAK,mBAExC,KAAK,kBAAoB,EAAK,mBAG9B,GAAQ,MAAQ,EAAK,wBAA0B,MACjD,CAAI,MAAO,GAAK,wBAA2B,SACzC,KAAK,uBAAyB,GAAI,YAAM,EAAK,wBAE7C,KAAK,uBAAyB,EAAK,wBAGnC,GAAQ,MAAQ,EAAK,YAAc,MACrC,MAAK,WAAa,EAAK,YAErB,GAAQ,MAAQ,EAAK,gBAAkB,MACzC,MAAK,eAAiB,EAAK,gBAGxB,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,kBACpB,KAAK,MAAQ,MACf,GAAO,gBAAgB,OAAQ,AAAO,UAAO,KAAK,IAAK,GACvD,EAAO,SAAS,KAAK,MACrB,EAAO,iBAEL,KAAK,WAAa,MACpB,GAAO,gBAAgB,YAAa,AAAO,UAAO,KAAK,KAAM,GAC7D,EAAO,eAAe,AAAO,UAAO,KAAK,IAAK,KAAK,UAAU,QAC7D,KAAK,UAAU,QAAQ,AAAC,GAAqC,CAC3D,EAAO,SAAS,KAElB,EAAO,eACP,EAAO,iBAEL,KAAK,gBAAkB,MACzB,GAAO,gBAAgB,iBAAkB,AAAO,UAAO,KAAK,KAAM,GAClE,EAAO,eAAe,AAAO,UAAO,KAAK,OAAQ,KAAK,eAAe,QACrE,KAAK,eAAe,QAAQ,AAAC,GAA0B,CACrD,EAAO,YAAY,KAErB,EAAO,eACP,EAAO,iBAEL,KAAK,OAAS,MAChB,GAAO,gBAAgB,QAAS,AAAO,UAAO,KAAK,IAAK,GACxD,EAAO,SAAS,KAAK,OACrB,EAAO,iBAEL,KAAK,YAAc,MACrB,GAAO,gBAAgB,aAAc,AAAO,UAAO,KAAK,IAAK,GAC7D,EAAO,SAAS,KAAK,YACrB,EAAO,iBAEL,KAAK,yBAA2B,MAClC,GAAO,gBAAgB,0BAA2B,AAAO,UAAO,KAAK,IAAK,GAC1E,EAAO,SAAS,KAAK,yBACrB,EAAO,iBAEL,KAAK,uBAAyB,MAChC,GAAO,gBAAgB,wBAAyB,AAAO,UAAO,KAAK,IAAK,GACxE,EAAO,SAAS,KAAK,uBACrB,EAAO,iBAEL,KAAK,oBAAsB,MAC7B,GAAO,gBAAgB,qBAAsB,AAAO,UAAO,KAAK,KAAM,GACtE,EAAO,eAAe,AAAO,UAAO,KAAK,OAAQ,KAAK,mBAAmB,QACzE,KAAK,mBAAmB,QAAQ,AAAC,GAAqC,CACpE,EAAQ,MAAM,KAEhB,EAAO,eACP,EAAO,iBAEL,KAAK,kBAAoB,MAC3B,GAAO,gBAAgB,mBAAoB,AAAO,UAAO,KAAK,IAAK,GACnE,EAAO,SAAS,KAAK,kBACrB,EAAO,iBAEL,KAAK,mBAAqB,MAC5B,GAAO,gBAAgB,oBAAqB,AAAO,UAAO,KAAK,IAAK,IACpE,EAAO,SAAS,KAAK,mBACrB,EAAO,iBAEL,KAAK,wBAA0B,MACjC,GAAO,gBAAgB,yBAA0B,AAAO,UAAO,KAAK,IAAK,IACzE,EAAO,SAAS,KAAK,wBACrB,EAAO,iBAEL,KAAK,YAAc,MACrB,GAAO,gBAAgB,aAAc,AAAO,UAAO,KAAK,OAAQ,IAChE,KAAK,WAAW,MAAM,GACtB,EAAO,iBAEL,KAAK,gBAAkB,MACzB,GAAO,gBAAgB,iBAAkB,AAAO,UAAO,KAAK,KAAM,IAClE,EAAO,eAAe,AAAO,UAAO,KAAK,OAAQ,KAAK,eAAe,QACrE,KAAK,eAAe,QAAQ,AAAC,GAAuD,CAClF,EAAQ,MAAM,KAEhB,EAAO,eACP,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAyC,CAC1D,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAqB,EAAM,UACjC,EAAM,KAAO,MAEb,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GAAoC,GAAI,OAExC,EAAiB,AADU,EAAM,gBACL,KAClC,OAAS,GAAc,EAAG,EAAM,EAAQ,IAAO,CAC7C,GAAM,GAA6B,EAAM,UACzC,EAAQ,KAAK,GAEf,EAAM,cACN,EAAM,UAAY,MAElB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GAAyB,GAAI,OAE7B,EAAiB,AADU,EAAM,gBACL,KAClC,OAAS,GAAc,EAAG,EAAM,EAAQ,IAAO,CAC7C,GAAM,GAAkB,EAAM,aAC9B,EAAQ,KAAK,GAEf,EAAM,cACN,EAAM,eAAiB,MAEvB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAA8C,EAAM,UAC1D,EAAM,MAAQ,MAEd,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,WAAa,MAEnB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,wBAA0B,MAEhC,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,sBAAwB,MAE9B,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GAAqC,GAAI,OAEzC,EAAiB,AADU,EAAM,gBACL,KAClC,OAAS,GAAc,EAAG,EAAM,EAAQ,IAAO,CAC7C,GAAM,GAA8B,AAAS,GAAS,KAAK,GAC3D,EAAS,KAAK,GAEhB,EAAM,cACN,EAAM,mBAAqB,MAE3B,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,iBAAmB,MAEzB,GAAM,KAAK,GAEb,UACG,IACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,kBAAoB,MAE1B,GAAM,KAAK,GAEb,UACG,IACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,uBAAyB,MAE/B,GAAM,KAAK,GAEb,UACG,IACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GAAkC,AAAW,GAAW,KAAK,GACnE,EAAM,WAAa,MAEnB,GAAM,KAAK,GAEb,UACG,IACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GACJ,GAAI,OAEA,EAAiB,AADU,EAAM,gBACL,KAClC,OAAS,GAAc,EAAG,EAAM,EAAQ,IAAO,CAC7C,GAAM,GACJ,AAAkB,GAAkB,KAAK,GAC3C,EAAS,KAAK,GAEhB,EAAM,cACN,EAAM,eAAiB,MAEvB,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBAEJ,EAAM,OAAS,QACf,EAAM,YAAc,QACpB,EAAM,iBAAmB,QACzB,EAAM,QAAU,QAChB,EAAM,aAAe,QACrB,EAAM,0BAA4B,QAClC,EAAM,wBAA0B,QAChC,EAAM,mBAAqB,OAE3B,MAAO,IAAI,IAAe,GAE1B,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,8CC3YR,OAAkB,SAClB,GAAwB,SAWjB,YAAkB,CAQvB,YAAY,EAAwB,CAIlC,GAHI,GAAQ,MAAQ,EAAK,WAAa,MACpC,MAAK,UAAY,EAAK,WAEpB,GAAQ,MAAQ,EAAK,aAAe,KACtC,AAAI,MAAO,GAAK,aAAgB,SAC9B,KAAK,YAAc,GAAI,YAAM,EAAK,aAElC,KAAK,YAAc,EAAK,gBAG1B,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,yCAGJ,AAAI,GAAQ,MAAQ,EAAK,WAAa,MACpC,MAAK,UAAY,EAAK,WAEpB,GAAQ,MAAQ,EAAK,qBAAuB,MAC9C,CAAI,MAAO,GAAK,qBAAwB,SACtC,KAAK,oBAAsB,GAAI,YAAM,EAAK,qBAE1C,KAAK,oBAAsB,EAAK,qBAGhC,GAAQ,MAAQ,EAAK,qBAAuB,MAC9C,MAAK,oBAAsB,EAAK,qBAE9B,GAAQ,MAAQ,EAAK,qBAAuB,MAC9C,CAAI,MAAO,GAAK,qBAAwB,SACtC,KAAK,oBAAsB,GAAI,YAAM,EAAK,qBAE1C,KAAK,oBAAsB,EAAK,qBAGhC,GAAQ,MAAQ,EAAK,qBAAuB,MAC9C,MAAK,oBAAsB,EAAK,qBAG7B,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,eACpB,KAAK,WAAa,MACpB,GAAO,gBAAgB,YAAa,AAAO,UAAO,KAAK,OAAQ,GAC/D,EAAO,YAAY,KAAK,WACxB,EAAO,iBAEL,KAAK,aAAe,MACtB,GAAO,gBAAgB,cAAe,AAAO,UAAO,KAAK,IAAK,GAC9D,EAAO,SAAS,KAAK,aACrB,EAAO,iBAEL,KAAK,WAAa,MACpB,GAAO,gBAAgB,YAAa,AAAO,UAAO,KAAK,OAAQ,GAC/D,KAAK,UAAU,MAAM,GACrB,EAAO,iBAEL,KAAK,qBAAuB,MAC9B,GAAO,gBAAgB,sBAAuB,AAAO,UAAO,KAAK,IAAK,GACtE,EAAO,SAAS,KAAK,qBACrB,EAAO,iBAEL,KAAK,qBAAuB,MAC9B,GAAO,gBAAgB,sBAAuB,AAAO,UAAO,KAAK,IAAK,GACtE,EAAO,SAAS,KAAK,qBACrB,EAAO,iBAEL,KAAK,qBAAuB,MAC9B,GAAO,gBAAgB,sBAAuB,AAAO,UAAO,KAAK,IAAK,GACtE,EAAO,SAAS,KAAK,qBACrB,EAAO,iBAEL,KAAK,qBAAuB,MAC9B,GAAO,gBAAgB,sBAAuB,AAAO,UAAO,KAAK,IAAK,GACtE,EAAO,SAAS,KAAK,qBACrB,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAsC,CACvD,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GAAkB,EAAM,aAC9B,EAAM,UAAY,MAElB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAiB,EAAM,UAC7B,EAAM,YAAc,MAEpB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GACJ,AAAe,GAAe,KAAK,GACrC,EAAM,UAAY,MAElB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAiB,EAAM,UAC7B,EAAM,oBAAsB,MAE5B,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,oBAAsB,MAE5B,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAiB,EAAM,UAC7B,EAAM,oBAAsB,MAE5B,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,oBAAsB,MAE5B,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBACF,EAAM,cAAgB,OACxB,MAAO,IAAI,IAAY,GAEvB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,2CCrLR,OAAkB,SAClB,GAAwB,SASjB,YAAe,CAKpB,YAAY,EAAqB,CAC/B,GAAI,GAAQ,MAAQ,EAAK,SAAW,KAClC,KAAK,QAAU,EAAK,YAEpB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,qCAGJ,GAAI,GAAQ,MAAQ,EAAK,iBAAmB,KAC1C,AAAI,MAAO,GAAK,iBAAoB,SAClC,KAAK,gBAAkB,GAAI,YAAM,EAAK,iBAEtC,KAAK,gBAAkB,EAAK,oBAG9B,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,6CAGJ,GAAI,GAAQ,MAAQ,EAAK,UAAY,KACnC,AAAI,MAAO,GAAK,UAAa,SAC3B,KAAK,SAAW,GAAI,YAAM,EAAK,UAE/B,KAAK,SAAW,EAAK,aAGvB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,sCAGJ,AAAI,GAAQ,MAAQ,EAAK,iBAAmB,MAC1C,MAAK,gBAAkB,EAAK,iBAGzB,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,YACpB,KAAK,SAAW,MAClB,GAAO,gBAAgB,UAAW,AAAO,UAAO,KAAK,KAAM,GAC3D,EAAO,eAAe,AAAO,UAAO,KAAK,OAAQ,KAAK,QAAQ,QAC9D,KAAK,QAAQ,QAAQ,AAAC,GAA2C,CAC/D,EAAQ,MAAM,KAEhB,EAAO,eACP,EAAO,iBAEL,KAAK,iBAAmB,MAC1B,GAAO,gBAAgB,kBAAmB,AAAO,UAAO,KAAK,IAAK,GAClE,EAAO,SAAS,KAAK,iBACrB,EAAO,iBAEL,KAAK,UAAY,MACnB,GAAO,gBAAgB,WAAY,AAAO,UAAO,KAAK,IAAK,GAC3D,EAAO,SAAS,KAAK,UACrB,EAAO,iBAEL,KAAK,iBAAmB,MAC1B,GAAO,gBAAgB,kBAAmB,AAAO,UAAO,KAAK,KAAM,GACnE,EAAO,eAAe,AAAO,UAAO,KAAK,OAAQ,KAAK,gBAAgB,QACtE,KAAK,gBAAgB,QAAQ,AAAC,GAA+C,CAC3E,EAAQ,MAAM,KAEhB,EAAO,eACP,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAmC,CACpD,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GAA0C,GAAI,OAE9C,EAAiB,AADU,EAAM,gBACL,KAClC,OAAS,GAAc,EAAG,EAAM,EAAQ,IAAO,CAC7C,GAAM,GAAmC,AAAY,GAAY,KAAK,GACtE,EAAQ,KAAK,GAEf,EAAM,cACN,EAAM,QAAU,MAEhB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAiB,EAAM,UAC7B,EAAM,gBAAkB,MAExB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAiB,EAAM,UAC7B,EAAM,SAAW,MAEjB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GACJ,GAAI,OAEA,EAAiB,AADU,EAAM,gBACL,KAClC,OAAS,GAAc,EAAG,EAAM,EAAQ,IAAO,CAC7C,GAAM,GAAuC,AAAc,GAAc,KAAK,GAC9E,EAAQ,KAAK,GAEf,EAAM,cACN,EAAM,gBAAkB,MAExB,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBAEJ,EAAM,UAAY,QAClB,EAAM,kBAAoB,QAC1B,EAAM,WAAa,OAEnB,MAAO,IAAI,IAAS,GAEpB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,wCChKR,OAAwB,SAEjB,QAAuB,CAC5B,aAAc,EACP,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,oBACxB,EAAO,iBACP,EAAO,uBAGK,MAAK,EAA2C,CAE5D,IADA,EAAM,oBACO,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,WAEJ,EAAM,KAAK,GAGf,EAAM,eAER,SAAM,gBACC,GAAI,MC3Bf,OAAkB,SAClB,GAAwB,SCDxB,OAAwB,SAKjB,YAAkB,CAEvB,YAAY,EAAyB,CACnC,GAAI,GAAqB,EACzB,GAAI,GAAQ,KAAM,CAKhB,GAJI,EAAK,YAAc,MACrB,KACA,KAAK,WAAa,EAAK,YAErB,EAAa,EACf,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,aACrC,sDAEG,GAAI,EAAa,EACtB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,aACrC,kDAKM,gBAAe,EAA4D,CACvF,MAAO,IAAI,IAAY,CAAC,eAEnB,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,eACpB,KAAK,YAAc,MACrB,GAAO,gBAAgB,aAAc,AAAO,UAAO,KAAK,OAAQ,GAChE,KAAK,WAAW,MAAM,GACtB,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAsC,CACvD,GAAI,GAAqB,EACrB,EAAmC,KAEvC,IADA,EAAM,oBACO,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,IACA,GAAM,GACJ,AAAiB,GAAiB,KAAK,GACzC,EAAe,GAAY,eAAe,OAE1C,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBACF,EAAa,EACf,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,aACrC,sDAEG,GAAI,EAAa,EACtB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,aACrC,2CAGJ,GAAI,IAAiB,KACnB,MAAO,GAEP,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,oCDvED,YAAmB,CAQxB,YAAY,EAAiC,KAAM,CACjD,GAAI,GAAQ,MAAQ,EAAK,SAAW,KAClC,KAAK,QAAU,EAAK,YAEpB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,qCAGJ,GAAI,GAAQ,MAAQ,EAAK,QAAU,KACjC,KAAK,OAAS,EAAK,WAEnB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,oCAGJ,GAAI,GAAQ,MAAQ,EAAK,UAAY,KACnC,AAAI,MAAO,GAAK,UAAa,SAC3B,KAAK,SAAW,GAAI,YAAM,EAAK,UAE/B,KAAK,SAAW,EAAK,aAGvB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,sCAGJ,GAAI,GAAQ,MAAQ,EAAK,YAAc,KACrC,KAAK,WAAa,EAAK,eAEvB,MAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,wCAGJ,AAAI,GAAQ,MAAQ,EAAK,oBAAsB,MAC7C,MAAK,mBAAqB,EAAK,oBAE7B,GAAQ,MAAQ,EAAK,YAAc,MACrC,MAAK,WAAa,EAAK,YAErB,GAAQ,MAAQ,EAAK,eAAiB,MACxC,MAAK,cAAgB,EAAK,eAGvB,MAAM,EAAgC,CAC3C,EAAO,iBAAiB,gBACpB,KAAK,SAAW,MAClB,GAAO,gBAAgB,UAAW,AAAO,UAAO,KAAK,IAAK,GAC1D,EAAO,SAAS,KAAK,SACrB,EAAO,iBAEL,KAAK,QAAU,MACjB,GAAO,gBAAgB,SAAU,AAAO,UAAO,KAAK,KAAM,GAC1D,EAAO,eAAe,AAAO,UAAO,KAAK,OAAQ,KAAK,OAAO,QAC7D,KAAK,OAAO,QAAQ,AAAC,GAA+C,CAClE,EAAQ,MAAM,KAEhB,EAAO,eACP,EAAO,iBAEL,KAAK,UAAY,MACnB,GAAO,gBAAgB,WAAY,AAAO,UAAO,KAAK,IAAK,GAC3D,EAAO,SAAS,KAAK,UACrB,EAAO,iBAEL,KAAK,YAAc,MACrB,GAAO,gBAAgB,aAAc,AAAO,UAAO,KAAK,KAAM,GAC9D,EAAO,eAAe,AAAO,UAAO,KAAK,OAAQ,KAAK,WAAW,QACjE,KAAK,WAAW,QAAQ,AAAC,GAAqC,CAC5D,EAAQ,MAAM,KAEhB,EAAO,eACP,EAAO,iBAEL,KAAK,oBAAsB,MAC7B,GAAO,gBAAgB,qBAAsB,AAAO,UAAO,KAAK,KAAM,GACtE,EAAO,eAAe,AAAO,UAAO,KAAK,OAAQ,KAAK,mBAAmB,QACzE,KAAK,mBAAmB,QAAQ,AAAC,GAAqC,CACpE,EAAQ,MAAM,KAEhB,EAAO,eACP,EAAO,iBAEL,KAAK,YAAc,MACrB,GAAO,gBAAgB,aAAc,AAAO,UAAO,KAAK,OAAQ,GAChE,EAAO,YAAY,KAAK,YACxB,EAAO,iBAEL,KAAK,eAAiB,MACxB,GAAO,gBAAgB,gBAAiB,AAAO,UAAO,KAAK,KAAM,GACjE,EAAO,eAAe,AAAO,UAAO,KAAK,OAAQ,KAAK,cAAc,QACpE,KAAK,cAAc,QAAQ,AAAC,GAA2C,CACrE,EAAQ,MAAM,KAEhB,EAAO,eACP,EAAO,iBAET,EAAO,iBACP,EAAO,uBAGK,MAAK,EAAuC,CACxD,EAAM,kBACN,GAAI,GAAa,GACjB,OAAa,CACX,GAAM,GAAqB,EAAM,iBAC3B,EAAgC,EAAI,MACpC,EAAkB,EAAI,IAC5B,GAAI,IAAc,AAAO,UAAO,KAAK,KACnC,MAEF,OAAQ,OACD,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAkB,EAAM,UAC9B,EAAM,QAAU,MAEhB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GACJ,GAAI,OAEA,EAAiB,AADU,EAAM,gBACL,KAClC,OAAS,GAAc,EAAG,EAAM,EAAQ,IAAO,CAC7C,GAAM,GAAuC,AAAc,GAAc,KAAK,GAC9E,EAAQ,KAAK,GAEf,EAAM,cACN,EAAM,OAAS,MAEf,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,IAAK,CACxC,GAAM,GAAiB,EAAM,UAC7B,EAAM,SAAW,MAEjB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GAAoC,GAAI,OAExC,EAAiB,AADU,EAAM,gBACL,KAClC,OAAS,GAAc,EAAG,EAAM,EAAQ,IAAO,CAC7C,GAAM,GAA8B,AAAS,GAAS,KAAK,GAC3D,EAAQ,KAAK,GAEf,EAAM,cACN,EAAM,WAAa,MAEnB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GAAqC,GAAI,OAEzC,EAAiB,AADU,EAAM,gBACL,KAClC,OAAS,GAAc,EAAG,EAAM,EAAQ,IAAO,CAC7C,GAAM,GAA8B,AAAS,GAAS,KAAK,GAC3D,EAAS,KAAK,GAEhB,EAAM,cACN,EAAM,mBAAqB,MAE3B,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,OAAQ,CAC3C,GAAM,GAAmB,EAAM,aAC/B,EAAM,WAAa,MAEnB,GAAM,KAAK,GAEb,UACG,GACH,GAAI,IAAc,AAAO,UAAO,KAAK,KAAM,CACzC,GAAM,GAA2C,GAAI,OAE/C,EAAiB,AADU,EAAM,gBACL,KAClC,OAAS,GAAc,EAAG,EAAM,EAAQ,IAAO,CAC7C,GAAM,GAAoC,AAAY,GAAY,KAAK,GACvE,EAAS,KAAK,GAEhB,EAAM,cACN,EAAM,cAAgB,MAEtB,GAAM,KAAK,GAEb,cAEA,EAAM,KAAK,GAGf,EAAM,eAGR,GADA,EAAM,gBAEJ,EAAM,UAAY,QAClB,EAAM,SAAW,QACjB,EAAM,WAAa,QACnB,EAAM,aAAe,OAErB,MAAO,IAAI,IAAa,GAExB,KAAM,IAAI,AAAO,WAAO,mBACtB,AAAO,UAAO,uBAAuB,QACrC,4CElPD,GAAM,IAAgB,OAChB,GAA0B,OAUhC,GAAM,IAAqB,QACrB,GAAyB,MCbtC,oBAA+B,oBAAiB,CAAhD,aAHA,CAGA,oBACS,aAAkB,IAoCpB,YAAuB,EAAY,EAAgC,CACxE,OAAW,KAAK,GACd,GAAI,EAAM,KAAO,EACf,MAAO,GAGX,KAAM,IAAI,OAAM,sBAGX,YAA4B,EAAa,EAAiB,CAC/D,AAAK,GAEH,GAAS,GAGX,GAAM,GAAY,GAAI,IAAiB,GACvC,EAAU,QAAU,EACpB,GAAM,GAAW,GAAI,qBAAiB,GAChC,EAAW,GAAa,KAAK,GACnC,MAAO,CAAC,OAAQ,EAAU,QAAU,EAAQ,YAGvC,YAA0B,EAAa,EAAiB,CAC7D,AAAK,GAEH,GAAS,GAGX,GAAM,GAAY,GAAI,IAAiB,GACvC,EAAU,QAAU,EACpB,GAAM,GAAW,GAAI,qBAAiB,GAChC,EAAa,GAAW,KAAK,GACnC,MAAO,CAAC,OAAQ,EAAU,QAAU,EAAQ,cAMvC,YAAqB,EAAqB,CAC/C,MAAI,KAAQ,EACH,EAGF,KAAK,KAAK,KAAK,KAAK,EAAM,IAM5B,YAAsB,EAAiB,EAAwB,CACpE,OAAS,GAAI,EAAG,EAAI,EAAI,OAAQ,IAAK,CACnC,GAAI,EAAI,GAAG,OAAS,EAAK,OACvB,SAEF,GAAI,GAAI,GACR,OAAS,GAAI,EAAG,EAAI,EAAK,OAAQ,IAC/B,GAAI,IAAI,GAAG,KAAO,EAAK,IAAM,EAAI,GAAG,KAAO,KAAO,EAAI,GAAG,KAAO,MAG5D,KAAK,EAAI,GAAG,QAAU,EAAI,GAAG,EAAI,GAAG,OAAS,KAAO,KAGxD,GAAI,GACJ,MAEF,GAAI,EAAG,MAAO,GAEhB,MAAO,GC5ET,kBACE,EACA,EAC6B,CAC7B,GAAM,GAAuB,CAC3B,SACA,OAAQ,EACR,KAAM,EAAO,QAGT,EAA2B,CAC/B,QAAS,GACT,QAAS,GACT,OAAQ,GACR,YAAa,GACb,MAAO,GAGL,EAAa,EAAQ,YAAc,GAEvC,KAEE,EAAO,OAAS,EAAO,MACtB,EAAC,EAAQ,WAAa,EAAK,QAAQ,OAAS,OAAO,EAAQ,aAC5D,CAEA,GAAM,GAAO,KAAM,IAAW,EAAQ,GAEtC,GAAI,EAAK,WAAY,CACnB,EAAa,EAAK,WAElB,SAGF,AAAI,EAAW,QAEb,GAAK,OAAS,EAAK,OAAO,IAAI,AAAC,GAAU,EAAW,KAGtD,OAAS,GAAQ,EAAG,EAAQ,EAAK,QAAQ,OAAQ,IAAS,CACxD,EAAK,QAAQ,KAAK,EAAK,QAAQ,IAC/B,EAAK,QAAQ,KAAK,EAAK,QAAQ,IAC/B,GAAM,GAAQ,EAAK,OAAO,GAE1B,AAAI,IAAU,QACZ,EAAK,OAAO,KAAK,GAIrB,EAAK,OAAS,EAAK,MACnB,EAAK,YAAY,KAAK,EAAK,YAG7B,MAAO,GAQT,kBACE,EACA,EAC0B,CAC1B,GAAI,GAEE,CAAC,aAAY,UAAU,GAAiB,EAAO,OAAQ,EAAO,QACpE,EAAO,QAAU,EAEjB,GAAM,GAAW,GAAc,GAAU,EAAW,MAEpD,OAAQ,OACD,YACH,EAAO,KAAM,IAAe,EAAQ,EAAY,GAChD,UACG,eACH,EAAO,KAAM,IAAiB,EAAQ,EAAY,GAClD,UACG,kBACH,EAAO,CACL,WAAY,KAAM,IAAqB,EAAQ,EAAY,GAC3D,cAEF,cAEA,KAAM,IAAI,OAAM,sBAAsB,KAG1C,MAAO,GAaF,YACL,EACA,EACA,EAKA,CACA,GAAM,GAA2B,GAC7B,EAAO,EACX,OAAS,GAAI,EAAG,EAAI,EAAK,IAAK,CAC5B,GAAM,GAAgB,EAAe,GAE/B,EACJ,EAAO,EAAI,GAAc,GAAqB,EAAc,iBAAoB,OAE9E,EAAW,GACX,EAAW,GACf,OAAQ,OACD,WACH,UACG,WACH,EAAW,GACX,UACG,WACH,EAAW,GACX,cAEA,KAAM,IAAI,OAAM,oCAGpB,GAAI,EAAc,aAAgB,EAAG,CACnC,GAAM,GAAM,GAAa,EAAgB,EAAO,EAAG,EAAc,cACjE,EAAO,EAAI,KACX,EAAO,EAAc,MAAQ,CAE3B,WACA,WACA,OAAQ,EAAI,YAET,CACL,GAAM,GAAO,GAAc,GAAM,EAAc,MAC3C,EAAc,EAMlB,OAJI,EAAc,gBAChB,GAAc,GAAc,GAAe,EAAc,iBAGnD,OACD,UACH,EAAc,GAAG,KAAe,IAChC,eAIJ,EAAO,EAAc,MAAQ,CAC3B,KAAM,EACN,WAAY,EAAc,YAC1B,UAAW,EAAc,UACzB,MAAO,EAAc,MACrB,WACA,YAEF,KAGJ,MAAO,CAAC,SAAQ,SAAQ,QAM1B,YACE,EACA,EACA,EACA,EACA,EACO,CACP,GAAI,CAAE,KAAY,KAChB,KAAM,IAAI,OAAM,qBAAqB,KAEvC,MAAO,IAAe,GAAU,aAAa,EAAM,EAAQ,EAAO,GASpE,kBACE,EACA,EACA,EAC0B,CAC1B,GAAM,GAAY,EAAO,OAAS,EAAO,qBACnC,EAAa,EAAO,kBAAkB,WAGxC,EAAa,EAEjB,GAAI,EAAQ,cAAgB,eAAgB,CAC1C,GAAM,GAAY,KAAM,IACtB,EAAQ,YACR,EAAO,OAAO,MAAM,EAAO,OAAQ,GACnC,EAAO,wBAET,EAAa,CACX,OAAQ,EACR,OAAQ,EACR,KAAM,EAAU,QAElB,EAAO,OAAS,EAIlB,GAAM,GAAiB,GACrB,GACA,EAAO,kBAAkB,2BAGvB,EAAU,GAAI,OAAM,GAExB,AAAI,EAAQ,OAAO,UAAY,EAC7B,EAAU,GAAa,GAAoB,EAAgB,EAAY,EAAa,CAClF,SAAU,GAAY,EAAQ,OAAO,WACrC,gBAAiB,KAInB,EAAQ,KAAK,GAIf,GAAM,GAAiB,GACrB,GACA,EAAO,kBAAkB,2BAGvB,EAAU,GAAI,OAAM,GACxB,AAAI,EAAQ,OAAO,UAAY,EAC7B,EAAU,GAAa,GAAoB,EAAgB,EAAY,EAAa,CAClF,SAAU,GAAY,EAAQ,OAAO,WACrC,gBAAiB,KAInB,EAAQ,KAAK,GAEf,GAAI,GAAoB,EACxB,OAAW,KAAQ,GACjB,AAAI,IAAS,EAAQ,OAAO,WAC1B,IAKJ,GAAM,GAAgB,GAAc,GAAU,EAAO,kBAAkB,UACjE,EAAqC,CACzC,WAAY,EAAQ,OAAO,WAC3B,SAAU,EAAQ,OAAO,YAGrB,EAAS,GACb,EAAQ,OAAO,cACf,EACA,EACA,EACA,GAGF,MAAO,CACL,QAAS,EACT,QAAS,EACT,SACA,MAAO,EACP,WAAY,GAWhB,kBACE,EACA,EACA,EAC0B,CAC1B,GAAM,GAAY,EAAO,OAAS,EAAO,qBAEnC,EAAa,EAAO,qBAAqB,WAEzC,EAAoB,EAAa,EAAO,qBAAqB,UAC7D,EAAgB,GACpB,GACA,EAAO,qBAAqB,UAK1B,EAAU,GAAI,OAAM,GACxB,AAAI,EAAQ,OAAO,UAAY,EAC7B,EAAU,GAAa,GAAoB,GAAwB,EAAQ,EAAa,CACtF,SAAU,GAAY,EAAQ,OAAO,WACrC,gBAAiB,KAGnB,EAAQ,KAAK,GAKf,GAAI,GAAU,GAAI,OAAM,GACxB,AAAI,EAAQ,OAAO,UAAY,EAC7B,EAAU,GAAa,GAAoB,GAAwB,EAAQ,EAAa,CACtF,SAAU,GAAY,EAAQ,OAAO,WACrC,gBAAiB,KAGnB,EAAQ,KAAK,GAIf,GAAI,GAAkB,EAEtB,GAAI,EAAO,qBAAqB,cAAe,CAC7C,GAAM,GAAY,KAAM,IACtB,EAAQ,YACR,EAAO,OAAO,MAAM,EAAO,OAAQ,GACnC,EAAO,wBAGT,EAAkB,CAChB,OAAQ,EACR,OAAQ,EACR,KAAM,EAAU,QAGlB,EAAO,OAAS,EAGlB,GAAM,GAAgB,CACpB,WAAY,EAAQ,OAAO,WAC3B,SAAU,EAAQ,OAAO,YAGrB,EAAS,GACb,EAAQ,OAAO,cACf,EACA,EACA,EACA,GAGF,MAAO,CACL,QAAS,EACT,QAAS,EACT,SACA,MAAO,EACP,WAAY,GAUhB,kBACE,EACA,EACA,EACmC,CACnC,GAAM,GAAY,EAAO,OAAS,EAAW,qBAEzC,EAAa,CACf,OAAQ,EACR,OAAQ,EAAO,OAAO,MAAM,EAAO,OAAQ,GAC3C,KAAM,EAAY,EAAO,QAK3B,GAFA,EAAO,OAAS,EAEZ,EAAQ,cAAgB,eAAgB,CAC1C,GAAM,GAAY,KAAM,IACtB,EAAQ,YACR,EAAW,OAAO,MAAM,EAAW,OAAQ,GAC3C,EAAW,wBAGb,EAAa,CACX,OAAQ,EACR,OAAQ,EACR,KAAM,EAAU,QAGlB,EAAO,OAAS,EAGlB,GAAM,GAAY,GAAY,wBAAwB,YAAc,EAE9D,EAA0B,GAC9B,EAAQ,OAAO,cACf,EAAQ,OAAO,SACf,EACA,EAEA,GAIE,EACJ,MAAI,IAAS,eACX,EAAS,EAAwB,IAAI,AAAC,GAAM,GAAe,IAE3D,EAAS,EAAwB,IAAI,AAAC,GAAM,EAAE,YAEzC,EAGT,YAAwB,EAAgD,CACtE,MAAI,aAAY,OAAO,GACd,EAGL,OAAO,SAAS,GACX,EAAE,OAAO,MAAM,EAAE,WAAY,EAAE,YAEjC,EAAE,WChbJ,YAAoB,CAUzB,YAAY,EAAoB,EAA4B,CAF5D,cAAyC,KAGvC,KAAK,KAAO,EACZ,KAAK,MAAQ,IAAI,GAAc,gBAAiB,GAGlD,OAAc,CAEZ,KAAK,KAAK,cAML,YAAY,EAA+B,CAChD,aAAiB,KAAQ,MAAK,iBAAiB,GAE7C,OAAW,KAAO,GAChB,KAAM,SAML,iBAAiB,EAA+B,CACrD,GAAM,GAAS,KAAM,MAAK,YAC1B,aAAiB,KAAY,MAAK,iBAAiB,GACjD,KAAM,IAAgB,EAAQ,SAK3B,iBAAiB,EAA+B,CAErD,GAAM,GAA0B,IAAO,YAAc,IAAI,IAAI,AAAC,GAC5D,MAAM,QAAQ,GAAK,EAAI,CAAC,IAGpB,EAAW,KAAM,MAAK,kBACtB,EAAS,KAAM,MAAK,YAEpB,EAAgB,GAAU,WAAW,QAAU,EAErD,OAAS,GAAgB,EAAG,EAAgB,EAAe,IAMzD,KALiB,MAAM,MAAK,aAC1B,EACA,EAAS,WAAW,GACpB,QAMA,cAA+B,CACnC,GAAM,GAAW,KAAM,MAAK,kBAC5B,MAAO,QAAO,EAAS,eAGnB,YAAoC,CACxC,GAAM,GAAW,KAAM,MAAK,kBACtB,EAAO,EAAS,OAAO,GACvB,CAAC,OAAQ,GAAoB,GAAa,EAAS,OAAQ,EAAG,EAAK,cAEzE,MADe,IAAI,IAAc,QAQ7B,oBAAqD,CACzD,GAAM,GAAW,KAAM,MAAK,kBACtB,EAA6B,GACnC,OAAW,KAAM,GAAS,mBACxB,EAAG,EAAG,KAAO,EAAG,MAElB,MAAO,QAGH,kBAAyC,CAC7C,MAAK,MAAK,UACR,MAAM,MAAK,aACX,KAAK,SAAW,KAAK,cAEhB,KAAK,cAMR,aAA4B,CAEhC,GAAM,GAAQ,AADC,MAAM,MAAK,KAAK,KAAK,EAAG,GAAc,SAChC,WACrB,OAAQ,OACD,IACH,UACG,IACH,KAAM,IAAI,OAAM,gDAEhB,KAAM,IAAI,OAAM,+BAA+B,YAK/C,aAAoC,CACxC,GAAM,GAAa,GAAc,OAAS,EACpC,EAAa,KAAM,MAAK,KAAK,KAAK,KAAK,KAAK,KAAO,EAAY,GAE/D,EAAQ,EAAW,MAAM,GAAG,WAClC,GAAI,IAAU,GACZ,KAAM,IAAI,OAAM,oCAAoC,MAGtD,GAAM,GAAe,EAAW,aAAa,GACvC,EAAiB,KAAK,KAAK,KAAO,EAAe,EACvD,GAAI,EAAiB,GAAc,OACjC,KAAM,IAAI,OAAM,yBAAyB,KAG3C,GAAM,GAAc,KAAM,MAAK,KAAK,KAAK,EAAgB,GAInD,CAAC,YAAY,GAAmB,GACtC,MAAO,QAIH,cACJ,EACA,EACA,EAC0B,CAC1B,GAAM,GAA0B,CAC9B,SAAU,OAAO,EAAS,UAC1B,WAAY,IAEd,OAAW,KAAY,GAAS,QAAS,CAEvC,GAAM,GAAS,AADK,EAAS,WACD,eAC5B,AAAI,EAAW,OAAS,GAAK,GAAa,EAAY,GAAW,GAGjE,GAAO,WAAW,EAAQ,QAAU,KAAM,MAAK,gBAAgB,EAAQ,IAEzE,MAAO,QAMH,iBAAgB,EAAuB,EAAoD,CAC/F,GAAI,EAAS,YAAc,QAAa,EAAS,YAAc,KAC7D,KAAM,IAAI,OAAM,yCAGlB,GAAM,GAAQ,EAAO,UAAU,EAAS,WAAW,gBAC7C,EAAsB,GAAc,GAAM,EAAS,WAAW,MAEpE,GAAI,IAAS,EAAM,cACjB,KAAM,IAAI,OAAM,mCAAmC,KAGrD,GAAM,GAAkC,GACtC,GACA,EAAS,WAAW,OAGhB,EAAc,OAAO,EAAS,WAAW,kBAC3C,EAAY,OAAO,EAAS,WAAW,uBAE3C,AAAK,EAAS,WACZ,GAAY,KAAK,IACf,KAAK,KAAK,KAAO,EACjB,OAAO,EAAS,WAAW,yBAI/B,GAAM,GAAgC,CACpC,OACA,UAAW,EAAM,UACjB,UAAW,EAAM,UACjB,cACA,OAAQ,EACR,UAAW,EAAS,WAAW,WAC/B,WAAY,GAEZ,eAAgB,KAAK,MAAM,gBAGzB,EAEE,EAAuB,GAAU,WAAW,uBAElD,GAAI,EAAsB,CACxB,GAAM,GAAmB,OAAO,GAEhC,EAAa,KAAM,MAAK,cAAc,EAAkB,EAAS,GAGnE,EAAa,EAAQ,YAAY,OAAS,EAAQ,WAAa,EAC/D,GAAM,GAAW,KAAM,MAAK,KAAK,KAAK,EAAa,GACnD,MAAO,MAAM,IAAgB,EAAU,IAAI,EAAS,oBAUhD,eACJ,EACA,EACA,EACmB,CACnB,GAAI,IAAyB,EAQ3B,MAAO,GAGT,GAAM,GAAiB,KAAK,IAC1B,KAAK,KAAK,KAAO,EACjB,KAAK,MAAM,uBAEP,EAAW,KAAM,MAAK,KAAK,KAAK,EAAsB,GAEtD,EAAS,CAAC,OAAQ,EAAU,OAAQ,EAAG,KAAM,EAAS,QAG5D,MAAO,AAFa,MAAM,IAAW,EAAQ,IAE1B,aAtPhB,MACE,AADF,GACE,aAA6C,CAClD,sBAAuB,IACvB,eAAgB,IC/Bb,GAAM,IAA0D,CACrE,QAAS,OACT,MAAO,QACP,MAAO,UACP,MAAO,UACP,MAAO,UACP,OAAQ,UACR,WAAY,SACZ,qBAAsB,SACtB,KAAM,OACN,KAAM,QACN,YAAa,QACb,YAAa,QACb,iBAAkB,QAClB,iBAAkB,QAClB,OAAQ,QACR,QAAS,SACT,QAAS,SACT,QAAS,SACT,MAAO,OACP,OAAQ,QACR,OAAQ,QACR,OAAQ,QACR,KAAM,SACN,KAAM,SAEN,SAAU,SACV,cAAe,UACf,cAAe,UACf,mBAAoB,UACpB,6BAA8B,WAGzB,YACL,EACA,EACQ,CACR,GAAM,GAAS,GAAU,EAAc,QACjC,EAAW,GAAmB,GAAkB,GAOtD,MALuB,CACrB,SACA,SAAU,GAAY,IAM1B,YAAmB,EAAkC,CACnD,GAAM,GAAkB,GAExB,OAAW,KAAQ,GAAQ,CACzB,GAAM,GAAQ,EAAO,GAErB,GAAI,EAAM,OAAQ,CAChB,GAAM,GAAW,GAAU,EAAM,QACjC,EAAO,KAAK,CAAC,OAAM,KAAM,CAAC,KAAM,SAAU,YAAW,SAAU,EAAM,eAChE,CACL,GAAM,GAAO,GAAqB,EAAM,MAClC,EAAW,GAAiB,GAC5B,EAAa,CAAC,OAAM,OAAM,SAAU,EAAM,SAAU,YAC1D,EAAO,KAAK,IAIhB,MAAO,GAGT,YAA0B,EAAyD,CACjF,GAAI,GAEJ,OAAW,KAAO,GAChB,GAAI,IAAQ,OAAQ,CAClB,GAAI,GAAQ,EAAM,IAAQ,GAC1B,EAAQ,MAAO,GAAM,IAAS,SAAW,KAAK,UAAU,EAAM,IAAQ,EAAM,GAC5E,EAAW,GAAY,GACvB,EAAS,GAAO,EAIpB,MAAO,GAGT,YAA2B,EAAmE,CAC5F,GAAI,GAEE,EAAe,EAAgB,oBAAsB,GAC3D,OAAW,CAAC,MAAK,UAAU,GACzB,AAAI,MAAO,IAAU,UACnB,GAAW,GAAY,GACvB,EAAS,GAAO,GAIpB,MAAO,GCvDF,YACL,EACA,EACgC,CAChC,GAAM,GAAsB,EAAO,SAAS,GAC5C,GAAI,CAAC,EACH,MAAO,MAGT,GAAI,CACF,GAAM,GAAW,KAAK,MAAM,GAC5B,MAAI,CAAC,GAAY,MAAO,IAAa,SAC5B,KAEF,OACP,CACA,MAAO,OAIJ,YAAkC,EAAgB,EAA2B,CAClF,GAAM,GAAO,GAAwB,EAAQ,GAC7C,OAAW,CAAC,EAAK,IAAU,QAAO,QAAQ,GAAQ,IAChD,EAAO,SAAS,GAAG,KAAe,KAChC,MAAO,IAAU,SAAW,EAAQ,KAAK,UAAU,GASlD,YAAwB,EAAoC,CAEjE,MADoB,IAAwB,EAAQ,OAiB/C,YAA2B,EAAsB,CACtD,GAAM,GAAc,GAAe,GACnC,GAAI,CAAC,EACH,OAKF,GAAM,CAAC,UAAS,iBAAgB,WAAW,EAC3C,AAAI,GACF,GAAO,SAAS,eAAiB,GAG/B,GACF,GAAO,SAAS,sBAAwB,GAI1C,EAAO,SAAS,eAAiB,OAAO,KAAK,GAAW,IAAI,KAAK,IAEjE,OAAW,CAAC,EAAY,IAAmB,QAAO,QAAQ,GAAW,IAAK,CACxE,GAAM,GAAQ,EAAO,OAAO,KAAK,AAAC,GAAU,EAAM,OAAS,GAC3D,AAAI,GACE,GAAM,OAAS,GACjB,GAAiB,EAAO,oBAAqB,QAE/C,GAAuB,EAAO,KAMpC,YAAgC,EAAc,EAAsB,CAClE,OAAW,CAAC,EAAK,IAAU,QAAO,QAAQ,GAAkB,IAC1D,OAAQ,OACD,gBACH,GAAiB,EAAO,OAAO,IAAQ,EAAmB,KAAK,MAC/D,UACG,OACH,GAAiB,EAAO,WAAW,IAAO,KAAK,UAAU,IACzD,UACG,MACH,OAAW,CAAC,EAAQ,IAAa,QAAO,QAAQ,GAAS,IACvD,OAAQ,OACD,KACH,GAAM,GACJ,MAAO,IAAa,SAChB,GAAG,GAAU,aAAa,GAAU,OACpC,KAAK,UAAU,GACrB,GAAiB,EAAO,WAAW,IAAU,GAC7C,cAEA,GACE,EACA,WAAW,IACX,MAAO,IAAa,SAAW,EAAW,KAAK,UAAU,IAE3D,MAGN,UACG,gBAEH,GACE,EACA,OAAO,IACP,MAAO,IAAU,SAAW,EAAQ,KAAK,UAAU,KAM7D,YAA0B,EAAc,EAAa,EAAqB,CACxE,EAAM,SAAW,EAAM,UAAY,GACnC,EAAM,SAAS,GAAO,ECtKxB,kBAAiD,EAAwC,CACvF,GAAM,GAAgB,KAAM,GAAO,YAC7B,EAAkB,KAAM,GAAO,kBAC/B,EAAS,GAAqB,EAAe,GACnD,UAAkB,GAClB,GAAyB,EAAQ,UAC1B,ECHF,YAAwB,EAAsB,CACnD,OAAQ,EAAM,WACP,sBACA,mBACH,MAAO,GAAM,KAAK,WAEf,gBACH,MAAO,GAAM,SAAS,WAEnB,cAEH,MAAO,AADY,GAAM,KACP,YAEf,iBACH,OAAW,KAAU,QAAO,OAAO,EAAM,MACvC,MAAO,GAAO,QAAU,EAE1B,MAAO,WAEP,KAAM,IAAI,OAAM,UAkIf,YACL,EACA,EACA,EACA,EACiC,CACjC,OAAQ,EAAM,WACP,mBACH,MAAO,GAAO,OAAO,YAAY,OAAO,QAAQ,EAAM,KAAK,KAAc,EAAM,KAAK,OAEjF,kBACH,GAAI,EAAM,OAAQ,CAChB,GAAM,GAA6C,GAAU,GAC7D,OAAS,GAAI,EAAG,EAAI,EAAM,OAAO,OAAO,OAAQ,IAC9C,EAAU,EAAM,OAAO,OAAO,GAAG,MAAQ,EAAM,KAAK,GAAU,GAEhE,MAAO,GAET,KAAM,IAAI,OAAM,iBAEb,gBACH,GAAI,EAAM,OAAQ,CAChB,GAAM,GAA6C,GAAU,GAE7D,OAAS,GAAI,EAAG,EAAI,EAAM,OAAO,OAAO,OAAQ,IAC9C,EAAU,EAAM,OAAO,OAAO,GAAG,MAAQ,EAAM,SAAS,GAAU,GAEpE,MAAO,GAET,KAAM,IAAI,OAAM,iBAEb,iBACH,GAAI,EAAM,OAAQ,CAChB,GAAM,GAA6C,GAAU,GAC7D,OAAS,GAAI,EAAG,EAAI,EAAM,OAAO,OAAO,OAAQ,IAC9C,EAAU,EAAM,OAAO,OAAO,GAAG,MAC/B,EAAM,KAAK,EAAM,OAAO,OAAO,GAAG,MAAM,GAE5C,MAAO,OACF,CAEL,GAAM,GAA6C,GAAU,GAC7D,OAAW,CAAC,EAAM,IAAW,QAAO,QAAQ,EAAM,MAChD,EAAU,GAAQ,EAAO,GAE3B,MAAO,OAGN,cACH,GAAM,GAAa,EAAM,KACnB,EAA6C,GAAU,GACvD,EAAM,EAAW,IAAI,GACrB,EAAS,EAAW,OAC1B,OAAS,GAAI,EAAG,EAAI,EAAO,OAAO,OAAQ,IACxC,EAAU,EAAO,OAAO,GAAG,MAAQ,IAAM,EAAO,OAAO,GAAG,MAE5D,MAAO,WAGP,KAAM,IAAI,OAAM,UCtNf,GAAM,IAA+C,eCK5D,GAAM,IAAe,iDAEf,GAAS,GAAI,QAAO,IAAM,GAAa,OAAS,OAAS,GAAa,OAAS,SAExE,GAAoB,CAC/B,SACA,cACA,WACA,cACA,mBACA,gBACA,uBAuBK,YAAe,EAAwB,CAC5C,MAAO,IAAkB,KAAK,AAAC,GAAgB,EAAM,WAAW,IAU3D,YAAkB,EAAe,EAAqC,CAE3E,MAAO,IAAmB,EAAO,GAWnC,YAA4B,EAAe,EAA4C,CACrF,GAAM,GAAQ,EAAM,MAAM,KACtB,EAAI,EAAM,MACR,EAAQ,GAAM,SAAW,IAAI,MAAM,KAAK,MAIxC,EAAW,GAFY,CAAC,QAAO,IAAG,EAAG,IAI3C,MAAO,IAAS,KAAK,IAAM,GAAO,EAAU,GAAQ,EAGtD,YAAuB,EAAuC,CAC5D,MACE,IAAW,IACX,GAAgB,IAChB,GAAa,IACb,GAAgB,IAChB,GAAqB,IACrB,GAAkB,IAClB,GAAwB,GAK5B,YAAgB,EAAsB,EAAgC,CACpE,GAAI,GAAO,GAAM,MAAM,OAAQ,CAC7B,GAAM,GAAM,CACV,KAAM,OACN,WAAY,CACV,KAAM,yBAA2B,IAIrC,EAAI,IAAM,EAGZ,MAAO,GAKT,YAAoB,EAAuC,CAKzD,GAJI,CAAC,GAAE,kBAAmB,IAG1B,IAAM,GACF,CAAC,GAAE,QAAS,IACd,MAAO,MAET,GAAM,GAAI,GAAO,GAKjB,MAJI,CAAC,GAGL,IAAM,GACF,CAAC,GAAE,QAAS,IACP,KAEF,CACL,KAAM,QACN,YAAa,EAAE,IAInB,YAAyB,EAAuC,CAC9D,GAAI,CAAC,GAAE,iBAAkB,GACvB,MAAO,MAET,GAAM,GACN,GAAM,GAAkB,EAAM,GAAG,UAAU,EAAM,GAAG,QAAQ,KAAO,EAAG,EAAM,EAAE,OAAS,GACpF,QAAQ,MAAO,IACf,QAAQ,MAAO,IAClB,EAAM,EAAI,eAAiB,EAAkB,IAC7C,GAAM,GAAI,GAAY,GACtB,MAAK,GAGL,IAAM,GACC,CACL,KAAM,aACN,YAAa,IALN,KASX,YAAyB,EAAuC,CAK9D,GAJI,CAAC,GAAE,uBAAwB,IAG/B,IAAM,GACF,CAAC,GAAE,QAAS,IACd,MAAO,MAET,GAAM,GAAI,GAAO,GAIjB,MAHI,CAAC,GAGD,CAAC,GAAE,QAAS,GACP,KAEF,CACL,KAAM,aACN,YAAa,GAIjB,YAA8B,EAAuC,CACnE,GAAI,CAAC,GAAE,sBAAuB,GAAQ,MAAO,MAC7C,GAAM,GACN,GAAM,GAAI,GAAY,GACtB,MAAK,GAGL,IAAM,GACC,CACL,KAAM,kBAEN,YAAa,IANN,KAUX,YAAsB,EAAuC,CAC3D,GAAI,CAAC,GAAE,oBAAqB,GAC1B,MAAO,MAET,GAAM,GACN,GAAM,GAAI,GAAY,GACtB,MAAK,GAGE,CACL,KAAM,UAEN,YAAa,GALN,KASX,YAA2B,EAAuC,CAChE,GAAI,CAAC,GAAE,mBAAoB,GACzB,MAAO,MAET,GAAM,GACN,GAAM,GAAI,GAAY,GACtB,MAAK,GAGE,CACL,KAAM,eAEN,YAAa,GALN,KASX,YAAiC,EAAuC,CACtE,GAAM,GAAyB,GAC3B,EAOJ,GALI,CAAC,GAAE,yBAA0B,IAGjC,IAAM,GAEF,CAAC,GAAE,QAAS,IACd,MAAO,MAET,KAAQ,EAAW,GAAc,IAC/B,EAAW,KAAK,GAChB,GAAM,GACN,GAAE,OAAQ,GACV,GAAM,GAER,MAAK,IAAE,QAAS,GAIT,CACL,KAAM,qBACN,WAAY,GALL,KAWX,YAAqB,EAAyC,CAC5D,GAAM,GACN,GAAI,GAAQ,EACN,EAAoB,GACpB,EAAQ,CAAC,GACX,EAAe,EACf,EAEJ,KAAQ,EAAO,GAAE,QAAS,IAAU,GAAE,QAAS,IAAU,GAAE,OAAQ,IAAU,GAAE,GAAQ,IAAS,CAC9F,GAAI,IAAS,IACX,EAAM,KAAK,GACX,EAAU,GACV,EAAM,EAAM,OAAS,GAAG,KAAK,GAC7B,YACS,IAAS,IAAK,CAOvB,GALI,EAAQ,SAAW,GAGvB,GAAU,EAAM,MAEZ,CAAC,GAAS,MAAO,MAErB,GADA,IACI,IAAU,EAAG,cACR,IAAS,IAClB,EAAU,GACV,EAAM,EAAM,OAAS,GAAG,KAAK,WACpB,CAAC,EAAK,MAAM,OAAO,KAAK,OACjC,MAAM,UAAU,KAAK,MAAM,EAAS,EAAK,MAAM,OAAO,IAAI,iBAE1D,OAAO,MAET,GAAM,GAGR,MAAI,KAAU,EAAU,KAEjB,EAGT,YAAgB,EAAyC,CACvD,GAAM,GAAmB,GACrB,EACA,EACJ,KAAQ,EAAK,GAAE,GAAQ,IAAU,GAAE,OAAQ,IACzC,AAAI,IAAO,IACT,GAAK,KAAK,GACV,EAAO,IACG,EAAG,MAAM,OAAO,KAAK,QAC1B,IAAM,GAAO,IAClB,MAAM,UAAU,KAAK,MAAM,EAAM,EAAG,MAAM,OAAO,IAAI,cAEvD,GAAM,GAGR,GAAI,EAAM,EAAK,KAAK,OACf,OAAO,MAEZ,MAAO,GAAK,OAAS,EAAO,KAK9B,YAAW,EAAgB,EAAsB,CAC/C,GAAM,GAAQ,EAAM,GAAG,UAAU,EAAM,GAAG,MAAM,GAChD,MAAK,GAEH,GAAM,GAAK,EAAM,GAAG,OACb,EAAM,IAHI,KAOrB,YAAe,EAAsB,CACnC,GAAE,OAAQ,GC9SL,GAAM,IAA6D,CACxE,KAAM,wBACN,GAAI,MACJ,OAAQ,MACR,QAAS,GACT,OAAQ,GACR,WAAY,CAAC,OACb,UAAW,CAAC,cACZ,SAAU,WACV,KAAM,GACN,MAAO,GACP,SAAU,GACV,QAAS,CACP,IAAK,CACH,IAAK,MAQE,GAAiE,IACzE,GACH,MAAO,MAAO,EAAa,IAAY,GAAS,GAAI,eAAc,OAAO,GAAc,GACvF,cAAe,ICgEV,YACL,EACA,EACA,EACU,CACV,OAAQ,EAAK,UACN,QACH,MAAO,IAAe,EAAM,EAAY,OACrC,aACH,MAAO,IAAoB,EAAM,EAAY,OAC1C,UACH,MAAO,IAAiB,EAAM,EAAY,WAE1C,GAAM,GAAyB,EAC/B,KAAM,IAAI,OAAM,8BAA+B,GAAyB,SA6E9E,YACE,EACA,EAAqB,KACrB,EAAmB,IACK,CACxB,GAAM,CAAC,aAAa,EACd,EAAiB,EAAK,eAAe,MAAM,OAAO,AAAC,GAAM,GAAK,GAAc,GAAK,GACjF,EAA0B,EAAK,wBAAwB,MAAM,OACjE,AAAC,GAAM,GAAK,GAAc,GAAK,GAKjC,GAAI,CAHU,GAAe,OAAS,GAG1B,CACV,GAAM,GAA4B,GAClC,OAAS,GAAI,EAAG,EAAI,EAAwB,OAAS,EAAG,IAAK,CAC3D,GAAM,GAAiB,EAAwB,GACzC,EAAe,EAAwB,EAAI,GAC3C,EAAkB,GAAc,EAAW,EAAgB,GACjE,EAAY,KAAK,GAGnB,MAAO,CAAC,KAAM,UAAW,eAI3B,GAAM,GAA8B,GACpC,OAAS,GAAI,EAAG,EAAI,EAAe,OAAS,EAAG,IAAK,CAClD,GAAM,GAAoB,EAAe,GACnC,EAAkB,EAAe,EAAI,GACrC,EAAqB,GACzB,EACA,EACA,GACA,YACF,EAAY,KAAK,GAGnB,MAAO,CAAC,KAAM,eAAgB,eAIhC,YACE,EACA,EAAqB,KACrB,EAAmB,IACW,CAC9B,GAAM,CAAC,aAAa,EACd,EAAc,EAAK,YAAY,MAAM,OAAO,AAAC,GAAM,GAAK,GAAc,GAAK,GAGjF,GAAI,CAFU,GAAY,OAAS,GAEvB,CACV,GAAM,GAAc,GAAc,EAAW,EAAY,GAAI,EAAY,IACzE,MAAO,CAAC,KAAM,aAAc,eAG9B,GAAM,GAA4B,GAClC,OAAS,GAAI,EAAG,EAAI,EAAY,OAAS,EAAG,IAAK,CAC/C,GAAM,GAAkB,GAAc,EAAW,EAAY,GAAI,EAAY,EAAI,IACjF,EAAY,KAAK,GAGnB,MAAO,CAAC,KAAM,kBAAmB,eAInC,YAAwB,EAA2B,EAAY,EAA8B,CAC3F,GAAM,CAAC,aAAa,EACd,EAAc,GAAc,EAAW,EAAY,GAGzD,MAFc,GAAY,OAAS,EAG1B,CAAC,KAAM,aAAc,eAGvB,CAAC,KAAM,QAAS,YAAa,EAAY,IAWlD,YACE,EACA,EACA,EACY,CACZ,EAAa,GAAc,EAC3B,EAAW,GAAY,EAAU,MAAM,OAAS,EAAU,KAE1D,GAAM,GAA8B,GACpC,OAAS,GAAI,EAAY,EAAI,EAAU,IAAK,CAC1C,GAAM,GAAQ,QACd,OAAS,GAAI,EAAI,EAAU,KAAM,EAAK,GAAI,GAAK,EAAU,KAAM,IAC7D,EAAM,KAAK,OAAO,EAAU,MAAM,KAEpC,EAAgB,KAAK,GAEvB,MAAO,GC3ST,GAAM,IAAc,WACd,GAAc,WACd,GAAiB,UAEjB,GAAW,IAML,GAAL,UAAK,EAAL,CACL,UAAQ,GAAR,QACA,eAAa,GAAb,aACA,YAAU,GAAV,UACA,eAAa,GAAb,aACA,oBAAkB,GAAlB,kBACA,iBAAe,GAAf,eACA,uBAAqB,GAArB,uBAPU,aA4BL,YAAe,EAAmC,CACvD,GAAM,GAAW,GAAI,UAAS,GAC1B,EAAa,EAEX,EAAa,EAAS,SAAS,GAIrC,GAHA,GAAc,EAGV,EAAa,EACf,MAAO,GAGT,GAAM,GAAe,IAAe,EAE9B,EAAW,EAAS,UAAU,EAAY,GAChD,GAAc,EAGd,GAAM,GAAe,EAAW,EAChC,GAAI,IAAiB,GAAK,EAAe,EACvC,MAAO,GAGT,GAAM,GAAgB,EAAW,EAGjC,GACE,IAAkB,GAClB,IAAkB,KAClB,IAAkB,KAClB,IAAkB,IAElB,MAAO,GAIT,GAAK,GAAgB,CAAE,IAAc,GAAc,MAAqB,EACtE,MAAO,GAGT,GAAI,EAAgB,GAAgB,CAClC,GAAM,GAAO,EAAS,UAAU,EAAY,GAG5C,GAFA,GAAc,EAEV,EAAO,GACT,MAAO,GAIX,MAAO,GAUF,YAAwB,EAAoB,EAA+B,CAChF,GAAM,GAAuB,OAAO,OAAO,GAAU,GAAI,CACvD,KAAM,MACN,aAAc,EACd,WAAY,EACZ,YAAa,KACb,aAAc,GACd,WAAY,IAId,EAAU,aAAe,EAAS,SAAS,EAAU,cAAgB,EACrE,EAAU,aAGV,GAAM,GAAe,EAAS,UAAU,EAAU,WAAY,EAAU,cACxE,EAAU,YAAc,EAExB,EAAU,aAAgB,EAAe,EAGzC,GAAM,GAAW,GAAe,EAAU,cAAgB,IAC1D,OAAQ,OACD,GACH,UACG,GACH,EAAU,KAAO,UACjB,EAAU,WAAa,EACvB,EAAU,YAAc,MACxB,UACG,GACH,EAAU,KAAO,UACjB,EAAU,WAAa,EACvB,EAAU,YAAc,MACxB,UACG,GACH,EAAU,KAAO,UACjB,EAAU,WAAa,EACvB,EAAU,YAAc,OACxB,cAEA,KAAM,IAAI,OAAM,kCAAkC,KAItD,GAAM,GAAQ,EAAe,GACvB,EAAQ,EAAe,GACvB,EAAW,EAAe,GAEhC,MAAI,IAAS,EACX,GAAU,KAAO,OACjB,EAAU,WAAa,EACvB,EAAU,YAAc,QACnB,AAAI,EACT,GAAU,KAAO,OACjB,EAAU,WAAa,EACvB,EAAU,YAAc,OACf,GACT,GAAU,KAAO,OACjB,EAAU,WAAa,EACvB,EAAU,YAAc,OAItB,GACF,GAAU,KAAO,OAEjB,EAAU,KAAO,EAAS,UAAU,EAAU,WAAY,EAAU,cACpE,EAAU,YAAc,GAGnB,EC3JF,YACL,EACA,EAC2B,CAC3B,GAAM,GAAiB,GAAiB,EAAa,GAC/C,EAAQ,GAAS,KAAK,OAAS,kBACrC,OAAQ,OACD,kBACH,MAAO,OACJ,WACH,MAAO,IAAiB,WAExB,KAAM,IAAI,OAAM,IAIf,YACL,EACA,EACgB,CAChB,GAAM,GAAW,GAAI,UAAS,GAExB,EAAY,GAAe,GAE3B,CAAC,eAAc,aAAY,gBAAgB,EAC3C,EAAS,EAAU,WAEzB,OAAQ,OACD,IAAgB,MAEnB,MAAO,AADO,IAAW,EAAU,EAAQ,EAAY,GAC1C,aACV,IAAgB,WAEnB,MAAO,AADM,IAAgB,EAAU,EAAQ,EAAY,GAC/C,aACT,IAAgB,QAEnB,MAAO,AADS,IAAa,EAAU,EAAQ,EAAY,GAC5C,aACZ,IAAgB,WACnB,GAAM,GAAa,GAAgB,EAAU,EAAQ,EAAY,GACjE,SAAW,KAAO,QACX,MACJ,IAAgB,gBACnB,GAAM,GAAY,GAAqB,EAAU,EAAQ,EAAY,GACrE,SAAU,KAAO,aACV,MACJ,IAAgB,aACnB,GAAM,GAAe,GAAkB,EAAU,EAAQ,EAAY,GACrE,SAAa,KAAO,UACb,UAKP,KAAM,IAAI,OAAM,mCAAmC,MAKzD,YACE,EACA,EACA,EACA,EACiD,CACjD,GAAM,GAAY,GAAI,cAAa,GACnC,OAAS,GAAI,EAAG,EAAI,EAAW,IAC7B,EAAU,GAAK,EAAS,WAAW,EAAQ,GAC3C,GAAU,EAGZ,MAAO,CACL,SAAU,CAAC,KAAM,QAAS,UAAW,CAAC,MAAO,EAAW,KAAM,IAC9D,UAIJ,YACE,EACA,EACA,EACA,EACgD,CAChD,GAAM,GAAU,EAAS,UAAU,EAAQ,GAC3C,GAAU,EAGV,GAAM,GAAY,GAAI,cAAa,EAAU,GAC7C,OAAS,GAAI,EAAG,EAAI,EAAU,EAAW,IACvC,EAAU,GAAK,EAAS,WAAW,EAAQ,GAC3C,GAAU,EAGZ,GAAM,GAAc,CAAC,GACrB,MAAI,GAAU,GACZ,EAAY,KAAK,GAGZ,CACL,SAAU,CACR,KAAM,aACN,UAAW,CAAC,MAAO,EAAW,KAAM,GACpC,YAAa,CAAC,MAAO,GAAI,aAAY,GAAc,KAAM,IAE3D,UAKJ,GAAM,IAAgB,AAAC,GAAgB,AAAC,GAAmB,GAAO,EAElE,YACE,EACA,EACA,EACA,EACmD,CACnD,GAAM,GAAS,EAAS,UAAU,EAAQ,GAC1C,GAAU,EAEV,GAAM,GAAsB,GAC5B,OAAS,GAAI,EAAG,EAAI,EAAQ,IAAK,CAC/B,GAAM,GAAS,GAAgB,EAAU,EAAQ,EAAW,GACtD,CAAC,aAAa,EAAO,SAC3B,EAAS,EAAO,OAChB,EAAM,KAAK,EAAU,OAGvB,GAAM,GAAwB,GAAI,cAAa,GAAkB,GAAO,QAClE,EAAiB,CAAC,GACxB,AAAI,EAAsB,OAAS,GACjC,EAAe,KAAK,EAAsB,OAAS,GAErD,GAAM,GAA0B,EAAM,IAAI,AAAC,GAAM,EAAE,OAAS,GAAW,IAAI,GAAc,IACzF,SAAwB,QAAQ,GAEzB,CACL,SAAU,CACR,KAAM,UACN,UAAW,CAAC,MAAO,EAAuB,KAAM,GAChD,eAAgB,CACd,MAAO,GAAI,aAAY,GACvB,KAAM,GAER,wBAAyB,CAAC,MAAO,GAAI,aAAY,GAA0B,KAAM,IAEnF,UAIJ,YACE,EACA,EACA,EACA,EACqB,CACrB,GAAM,GAAU,EAAS,UAAU,EAAQ,GAC3C,GAAU,EAEV,GAAM,GAA+C,GACrD,OAAS,GAAI,EAAG,EAAI,EAAS,IAAK,CAEhC,GAAM,GAAoB,EAAS,SAAS,KAAY,EAIxD,GAHA,IAGI,EAAS,UAAU,EAAQ,GAAqB,KAAS,EAC3D,KAAM,IAAI,OAAM,yDAGlB,GAAU,EAEV,GAAM,GAAS,GAAW,EAAU,EAAQ,EAAW,GACvD,EAAS,EAAO,OAChB,EAAsB,KAAK,EAAO,UAGpC,MAAO,IAAiC,EAAuB,GAGjE,YACE,EACA,EACA,EACA,EACoB,CACpB,GAAM,GAAS,EAAS,UAAU,EAAQ,GAC1C,GAAU,EAEV,GAAM,GAA6C,GACnD,OAAS,GAAI,EAAG,EAAI,EAAQ,IAAK,CAE/B,GAAM,GAAmB,EAAS,SAAS,KAAY,EAIvD,GAHA,IAGI,EAAS,UAAU,EAAQ,GAAoB,KAAS,EAC1D,KAAM,IAAI,OAAM,mEAElB,GAAU,EAEV,GAAM,GAAS,GAAgB,EAAU,EAAQ,EAAW,GAC5D,EAAS,EAAO,OAChB,EAAqB,KAAK,EAAO,UAGnC,MAAO,IAAgC,EAAsB,GAG/D,YACE,EACA,EACA,EACA,EACuB,CACvB,GAAM,GAAY,EAAS,UAAU,EAAQ,GAC7C,GAAU,EAEV,GAAM,GAAmD,GACzD,OAAS,GAAI,EAAG,EAAI,EAAW,IAAK,CAElC,GAAM,GAAsB,EAAS,SAAS,KAAY,EAI1D,GAHA,IAGI,EAAS,UAAU,EAAQ,GAAuB,KAAS,EAC7D,KAAM,IAAI,OAAM,6DAElB,GAAU,EAEV,GAAM,GAAS,GAAa,EAAU,EAAQ,EAAW,GACzD,EAAS,EAAO,OAChB,EAAwB,KAAK,EAAO,UAGtC,MAAO,IAAmC,EAAyB,GAKrE,YACE,EACA,EACqB,CACrB,GAAM,GAA0B,EAAsB,IAAI,AAAC,GAAa,EAAS,UAAU,OACrF,EAAwB,GAAI,cAAa,GAAkB,GAAW,QAE5E,MAAO,CACL,KAAM,QACN,UAAW,CAAC,MAAO,EAAuB,KAAM,IAIpD,YACE,EACA,EACoB,CACpB,GAAM,GAAsB,EAAqB,IAAI,AAAC,GAAa,EAAS,UAAU,OAChF,EAAwB,GAAI,cAAa,GAAkB,GAAO,QAClE,EAAc,EAAM,IAAI,AAAC,GAAS,EAAK,OAAS,GAAW,IAAI,GAAc,IACnF,SAAY,QAAQ,GAEb,CACL,KAAM,aACN,UAAW,CAAC,MAAO,EAAuB,KAAM,GAChD,YAAa,CAAC,MAAO,GAAI,aAAY,GAAc,KAAM,IAI7D,YACE,EACA,EACuB,CACvB,GAAM,GAAyB,GACzB,EAAkC,GAExC,OAAW,KAAiB,GAAyB,CACnD,GAAM,CAAC,YAAW,2BAA2B,EAC7C,EAAS,KAAK,EAAU,OACxB,EAAkB,KAAK,EAAwB,OAGjD,GAAM,GAAwB,GAAI,cAAa,GAAkB,GAAU,QACrE,EAAiB,EAAS,IAAI,AAAC,GAAM,EAAE,OAAS,GAAW,IAAI,GAAc,IACnF,EAAe,QAAQ,GAGvB,GAAM,GAA0B,CAAC,GACjC,OAAW,KAAoB,GAC7B,EAAwB,KACtB,GAAG,EACA,OAAO,AAAC,GAAc,EAAI,GAC1B,IAAI,AAAC,GAAc,EAAI,EAAwB,EAAwB,OAAS,KAIvF,MAAO,CACL,KAAM,UACN,UAAW,CAAC,MAAO,EAAuB,KAAM,GAChD,eAAgB,CAAC,MAAO,GAAI,aAAY,GAAiB,KAAM,GAC/D,wBAAyB,CAAC,MAAO,GAAI,aAAY,GAA0B,KAAM,IAMrF,YAA2B,EAAkC,CAC3D,GAAI,GAAa,EACjB,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,EAAE,EACnC,GAAc,EAAO,GAAG,WAE1B,GAAM,GAAS,GAAI,YAAW,GAE1B,EAAa,EACjB,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,EAAE,EAAG,CACtC,GAAM,GAAO,GAAI,YAAW,EAAO,GAAG,QACtC,EAAa,EAAK,OAClB,OAAS,GAAI,EAAG,EAAI,EAAY,EAAE,EAChC,EAAO,KAAgB,EAAK,GAGhC,MAAO,GC9TF,GAAM,IAA8E,CACzF,KAAM,MACN,GAAI,MACJ,OAAQ,MACR,QAAS,GACT,OAAQ,GACR,SAAU,WACV,WAAY,CAAC,OACb,UAAW,GAEX,MAAO,CAAC,IACR,QAAS,CACP,IAAK,CACH,MAAO,qBAQA,GAAkF,IAC1F,GACH,MAAO,KAAO,IAA6B,GAAS,GACpD,UAAW,IC9BN,YACL,EACA,EACc,CACd,GAAM,GAAc,GAAe,GAC7B,EAAgB,GAAa,eACnC,GAAI,CAAC,EACH,KAAM,IAAI,OAAM,sBAElB,GAAM,GAAiB,EAAY,QAAQ,GAErC,EAAsB,GAEtB,EAAS,GAAe,GAC9B,OAAS,GAAW,EAAG,EAAW,EAAQ,IAAY,CACpD,GAAM,GAAM,GAAoB,EAAO,GACjC,EAAW,GAAc,EAAI,GAAgB,GACnD,MAAO,GAAI,GACX,GAAM,GAAmB,CAAC,KAAM,UAAW,SAAU,EAAW,WAAY,GAC5E,EAAS,KAAK,GAGhB,MAAO,CAAC,MAAO,gBAAiB,SAAQ,KAAM,oBAAqB,YAGrE,YAAuB,EAAmB,EAAoD,CAC5F,OAAQ,EAAe,cAChB,MACH,MAAO,IAAU,gBAAgB,IAAuB,SACrD,cAEH,GAAM,GAAc,YAAY,OAAO,GACnC,EAAS,OAAO,MAAM,EAAS,WAAY,EAAS,WAAa,EAAS,YACzE,EAIL,MAHgB,IAAU,YAAY,EAAa,CACjD,IAAK,CAAC,MAAO,eCnCrB,kBACE,EACA,EACwC,CACxC,KAEA,GAAM,GAAO,GAAI,MAAK,CAAC,IACjB,EAAO,GAAiB,GACxB,EAAS,GAAI,IAAc,EAAM,CACrC,eAAgB,GAAS,SAAS,iBAG9B,EAAS,KAAM,IAA2B,GAE1C,EAAqB,GAErB,EAAa,EAAO,iBAAiB,GAAS,SACpD,aAAiB,KAAY,GAE3B,OAAW,KAAO,GAChB,EAAK,KAAK,GAGd,GAAM,GAAiC,CACrC,MAAO,mBACP,SACA,KAAM,GAGF,EAAQ,GAAS,SAAS,MAChC,OAAQ,OACD,mBACH,MAAO,OAEJ,gBACH,GAAI,CACF,MAAO,IAAyB,EAAgB,QAChD,CACA,MAAO,WAIT,KAAM,IAAI,OAAM,IAItB,kBACE,EACA,EACoC,CACpC,GAAM,GAAS,KAAM,IAA2B,GAC1C,EAAa,EAAO,iBAAiB,GAAS,SACpD,aAAiB,KAAQ,GACvB,KAAM,CACJ,UAAW,OACX,MAAO,mBACP,SACA,KAAM,EACN,OAAQ,EAAK,QCzDnB,kBACE,EACA,EACwB,CACxB,KACA,GAAM,GAAO,GAAI,MAAK,CAAC,IACjB,EAAO,GAAiB,GACxB,EAAS,GAAI,IAAc,GAEjC,aAAiB,KAAS,IAAkC,EAAQ,GAClE,MAAO,CACL,MAAO,iBACP,OAAQ,EAAM,OACd,KAAM,EAAM,MAGhB,KAAM,IAAI,OAAM,eAGlB,kBACE,EACA,EACmC,CAEnC,GAAM,GAAS,KAAM,IAA2B,GAE1C,EAAgB,KAAM,GAAO,YAG7B,EAAY,EAAO,iBAAiB,GAAS,SACnD,aAAiB,KAAY,GAC3B,KAAM,IAA4B,EAAU,EAAe,GAI/D,YACE,EACA,EACA,EACoB,CAEpB,GAAM,GAAO,GAAmB,EAAe,GAC/C,MAAO,CACL,MAAO,iBACP,UAAW,OACX,SACA,OACA,OAAQ,EAAS,UCvBd,GAAM,IAIT,IACC,GACH,MAAO,GAEP,mBAAoB,IAIT,GAIT,IACC,GACH,MAAO,GAEP,mBAAoB,ICrDtB,GAAmB",
-  "names": []
-}