(function(){
(function (global, factory) {
  if (typeof exports === 'object' && typeof module !== 'undefined') {
    factory(module.exports)
  } else if (typeof define === 'function' && define.amd) {
    define(factory);
  } else {
    factory(global);
  }
}) (this, function (exports) {
var Module = {
  TOTAL_MEMORY: 8*1024*1024,
  TOTAL_STACK: 2*1024*1024 ,
  preRun: [],
  postRun: [],
  print: function( text ) {
    console.log(text);
  },
  printErr: function(text) {
    text = Array.prototype.slice.call(arguments).join(' ');
    if ( text.indexOf( 'pre-main prep time' ) >= 0 ) {
      return;
    }
    console.error(text);
  }
};
var Module = typeof Module !== 'undefined' ? Module : {};
var moduleOverrides = {};
var key;
for (key in Module) {
    if (Module.hasOwnProperty(key)) {
        moduleOverrides[key] = Module[key];
    }
}
Module['arguments'] = [];
Module['thisProgram'] = './this.program';
Module['quit'] = function (status, toThrow) {
    throw toThrow;
};
Module['preRun'] = [];
Module['postRun'] = [];
var ENVIRONMENT_IS_WEB = false;
var ENVIRONMENT_IS_WORKER = false;
var ENVIRONMENT_IS_NODE = false;
var ENVIRONMENT_IS_SHELL = false;
ENVIRONMENT_IS_WEB = typeof window === 'object';
ENVIRONMENT_IS_WORKER = typeof importScripts === 'function';
ENVIRONMENT_IS_NODE = typeof process === 'object' && typeof require === 'function' && !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_WORKER;
ENVIRONMENT_IS_SHELL = !ENVIRONMENT_IS_WEB && !ENVIRONMENT_IS_NODE && !ENVIRONMENT_IS_WORKER;
var scriptDirectory = '';
function locateFile(path) {
    if (Module['locateFile']) {
        return Module['locateFile'](path, scriptDirectory);
    } else {
        return scriptDirectory + path;
    }
}
if (ENVIRONMENT_IS_NODE) {
    scriptDirectory = __dirname + '/';
    var nodeFS;
    var nodePath;
    Module['read'] = function shell_read(filename, binary) {
        var ret;
        ret = tryParseAsDataURI(filename);
        if (!ret) {
            if (!nodeFS)
                nodeFS = require('fs');
            if (!nodePath)
                nodePath = require('path');
            filename = nodePath['normalize'](filename);
            ret = nodeFS['readFileSync'](filename);
        }
        return binary ? ret : ret.toString();
    };
    Module['readBinary'] = function readBinary(filename) {
        var ret = Module['read'](filename, true);
        if (!ret.buffer) {
            ret = new Uint8Array(ret);
        }
        return ret;
    };
    if (process['argv'].length > 1) {
        Module['thisProgram'] = process['argv'][1].replace(/\\/g, '/');
    }
    Module['arguments'] = process['argv'].slice(2);
    if (typeof module !== 'undefined') {
        module['exports'] = Module;
    }
    process['on']('uncaughtException', function (ex) {
        if (!(ex instanceof ExitStatus)) {
            throw ex;
        }
    });
    process['on']('unhandledRejection', abort);
    Module['quit'] = function (status) {
        process['exit'](status);
    };
    Module['inspect'] = function () {
        return '[Emscripten Module object]';
    };
} else if (ENVIRONMENT_IS_SHELL) {
    if (typeof read != 'undefined') {
        Module['read'] = function shell_read(f) {
            var data = tryParseAsDataURI(f);
            if (data) {
                return intArrayToString(data);
            }
            return read(f);
        };
    }
    Module['readBinary'] = function readBinary(f) {
        var data;
        data = tryParseAsDataURI(f);
        if (data) {
            return data;
        }
        if (typeof readbuffer === 'function') {
            return new Uint8Array(readbuffer(f));
        }
        data = read(f, 'binary');
        return data;
    };
    if (typeof scriptArgs != 'undefined') {
        Module['arguments'] = scriptArgs;
    } else if (typeof arguments != 'undefined') {
        Module['arguments'] = arguments;
    }
    if (typeof quit === 'function') {
        Module['quit'] = function (status) {
            quit(status);
        };
    }
} else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
    if (ENVIRONMENT_IS_WORKER) {
        scriptDirectory = self.location.href;
    } else if (document.currentScript) {
        scriptDirectory = document.currentScript.src;
    }
    if (scriptDirectory.indexOf('blob:') !== 0) {
        scriptDirectory = scriptDirectory.substr(0, scriptDirectory.lastIndexOf('/') + 1);
    } else {
        scriptDirectory = '';
    }
    Module['read'] = function shell_read(url) {
        try {
            var xhr = new XMLHttpRequest();
            xhr.open('GET', url, false);
            xhr.send(null);
            return xhr.responseText;
        } catch (err) {
            var data = tryParseAsDataURI(url);
            if (data) {
                return intArrayToString(data);
            }
            throw err;
        }
    };
    if (ENVIRONMENT_IS_WORKER) {
        Module['readBinary'] = function readBinary(url) {
            try {
                var xhr = new XMLHttpRequest();
                xhr.open('GET', url, false);
                xhr.responseType = 'arraybuffer';
                xhr.send(null);
                return new Uint8Array(xhr.response);
            } catch (err) {
                var data = tryParseAsDataURI(url);
                if (data) {
                    return data;
                }
                throw err;
            }
        };
    }
    Module['readAsync'] = function readAsync(url, onload, onerror) {
        var xhr = new XMLHttpRequest();
        xhr.open('GET', url, true);
        xhr.responseType = 'arraybuffer';
        xhr.onload = function xhr_onload() {
            if (xhr.status == 200 || xhr.status == 0 && xhr.response) {
                onload(xhr.response);
                return;
            }
            var data = tryParseAsDataURI(url);
            if (data) {
                onload(data.buffer);
                return;
            }
            onerror();
        };
        xhr.onerror = onerror;
        xhr.send(null);
    };
    Module['setWindowTitle'] = function (title) {
        document.title = title;
    };
} else {
}
var out = Module['print'] || (typeof console !== 'undefined' ? console.log.bind(console) : typeof print !== 'undefined' ? print : null);
var err = Module['printErr'] || (typeof printErr !== 'undefined' ? printErr : typeof console !== 'undefined' && console.warn.bind(console) || out);
for (key in moduleOverrides) {
    if (moduleOverrides.hasOwnProperty(key)) {
        Module[key] = moduleOverrides[key];
    }
}
moduleOverrides = undefined;
var STACK_ALIGN = 16;
function dynamicAlloc(size) {
    var ret = HEAP32[DYNAMICTOP_PTR >> 2];
    var end = ret + size + 15 & -16;
    if (end <= _emscripten_get_heap_size()) {
        HEAP32[DYNAMICTOP_PTR >> 2] = end;
    } else {
        var success = _emscripten_resize_heap(end);
        if (!success)
            return 0;
    }
    return ret;
}
function getNativeTypeSize(type) {
    switch (type) {
    case 'i1':
    case 'i8':
        return 1;
    case 'i16':
        return 2;
    case 'i32':
        return 4;
    case 'i64':
        return 8;
    case 'float':
        return 4;
    case 'double':
        return 8;
    default: {
            if (type[type.length - 1] === '*') {
                return 4;
            } else if (type[0] === 'i') {
                var bits = parseInt(type.substr(1));
                return bits / 8;
            } else {
                return 0;
            }
        }
    }
}
function warnOnce(text) {
    if (!warnOnce.shown)
        warnOnce.shown = {};
    if (!warnOnce.shown[text]) {
        warnOnce.shown[text] = 1;
        err(text);
    }
}
var jsCallStartIndex = 1;
var functionPointers = new Array(0);
var funcWrappers = {};
function dynCall(sig, ptr, args) {
    if (args && args.length) {
        return Module['dynCall_' + sig].apply(null, [ptr].concat(args));
    } else {
        return Module['dynCall_' + sig].call(null, ptr);
    }
}
var tempRet0 = 0;
var setTempRet0 = function (value) {
    tempRet0 = value;
};
var getTempRet0 = function () {
    return tempRet0;
};
var GLOBAL_BASE = 8;
var ABORT = false;
var EXITSTATUS = 0;
function assert_em(condition, text) {
    if (!condition) {
        abort('Assertion failed: ' + text);
    }
}
function getCFunc(ident) {
    var func = Module['_' + ident];
    return func;
}
function ccall(ident, returnType, argTypes, args, opts) {
    var toC = {
        'string': function (str) {
            var ret = 0;
            if (str !== null && str !== undefined && str !== 0) {
                var len = (str.length << 2) + 1;
                ret = stackAlloc(len);
                stringToUTF8(str, ret, len);
            }
            return ret;
        },
        'array': function (arr) {
            var ret = stackAlloc(arr.length);
            writeArrayToMemory(arr, ret);
            return ret;
        }
    };
    function convertReturnValue(ret) {
        if (returnType === 'string')
            return UTF8ToString(ret);
        if (returnType === 'boolean')
            return Boolean(ret);
        return ret;
    }
    var func = getCFunc(ident);
    var cArgs = [];
    var stack = 0;
    if (args) {
        for (var i = 0; i < args.length; i++) {
            var converter = toC[argTypes[i]];
            if (converter) {
                if (stack === 0)
                    stack = stackSave();
                cArgs[i] = converter(args[i]);
            } else {
                cArgs[i] = args[i];
            }
        }
    }
    var ret = func.apply(null, cArgs);
    ret = convertReturnValue(ret);
    if (stack !== 0)
        stackRestore(stack);
    return ret;
}
function setValue(ptr, value, type, noSafe) {
    type = type || 'i8';
    if (type.charAt(type.length - 1) === '*')
        type = 'i32';
    switch (type) {
    case 'i1':
        HEAP8[ptr >> 0] = value;
        break;
    case 'i8':
        HEAP8[ptr >> 0] = value;
        break;
    case 'i16':
        HEAP16[ptr >> 1] = value;
        break;
    case 'i32':
        HEAP32[ptr >> 2] = value;
        break;
    case 'i64':
        tempI64 = [
            value >>> 0,
            (tempDouble = value, +Math_abs(tempDouble) >= +1 ? tempDouble > +0 ? (Math_min(+Math_floor(tempDouble / +4294967296), +4294967295) | 0) >>> 0 : ~~+Math_ceil((tempDouble - +(~~tempDouble >>> 0)) / +4294967296) >>> 0 : 0)
        ], HEAP32[ptr >> 2] = tempI64[0], HEAP32[ptr + 4 >> 2] = tempI64[1];
        break;
    case 'float':
        HEAPF32[ptr >> 2] = value;
        break;
    case 'double':
        HEAPF64[ptr >> 3] = value;
        break;
    default:
        abort('invalid type for setValue: ' + type);
    }
}
var ALLOC_NONE = 3;
function getMemory(size) {
    if (!runtimeInitialized)
        return dynamicAlloc(size);
    return _malloc(size);
}
var UTF8Decoder = typeof TextDecoder !== 'undefined' ? new TextDecoder('utf8') : undefined;
function UTF8ArrayToString(u8Array, idx, maxBytesToRead) {
    var endIdx = idx + maxBytesToRead;
    var endPtr = idx;
    while (u8Array[endPtr] && !(endPtr >= endIdx))
        ++endPtr;
    if (endPtr - idx > 16 && u8Array.subarray && UTF8Decoder) {
        return UTF8Decoder.decode(u8Array.subarray(idx, endPtr));
    } else {
        var str = '';
        while (idx < endPtr) {
            var u0 = u8Array[idx++];
            if (!(u0 & 128)) {
                str += String.fromCharCode(u0);
                continue;
            }
            var u1 = u8Array[idx++] & 63;
            if ((u0 & 224) == 192) {
                str += String.fromCharCode((u0 & 31) << 6 | u1);
                continue;
            }
            var u2 = u8Array[idx++] & 63;
            if ((u0 & 240) == 224) {
                u0 = (u0 & 15) << 12 | u1 << 6 | u2;
            } else {
                u0 = (u0 & 7) << 18 | u1 << 12 | u2 << 6 | u8Array[idx++] & 63;
            }
            if (u0 < 65536) {
                str += String.fromCharCode(u0);
            } else {
                var ch = u0 - 65536;
                str += String.fromCharCode(55296 | ch >> 10, 56320 | ch & 1023);
            }
        }
    }
    return str;
}
function UTF8ToString(ptr, maxBytesToRead) {
    return ptr ? UTF8ArrayToString(HEAPU8, ptr, maxBytesToRead) : '';
}
function stringToUTF8Array(str, outU8Array, outIdx, maxBytesToWrite) {
    if (!(maxBytesToWrite > 0))
        return 0;
    var startIdx = outIdx;
    var endIdx = outIdx + maxBytesToWrite - 1;
    for (var i = 0; i < str.length; ++i) {
        var u = str.charCodeAt(i);
        if (u >= 55296 && u <= 57343) {
            var u1 = str.charCodeAt(++i);
            u = 65536 + ((u & 1023) << 10) | u1 & 1023;
        }
        if (u <= 127) {
            if (outIdx >= endIdx)
                break;
            outU8Array[outIdx++] = u;
        } else if (u <= 2047) {
            if (outIdx + 1 >= endIdx)
                break;
            outU8Array[outIdx++] = 192 | u >> 6;
            outU8Array[outIdx++] = 128 | u & 63;
        } else if (u <= 65535) {
            if (outIdx + 2 >= endIdx)
                break;
            outU8Array[outIdx++] = 224 | u >> 12;
            outU8Array[outIdx++] = 128 | u >> 6 & 63;
            outU8Array[outIdx++] = 128 | u & 63;
        } else {
            if (outIdx + 3 >= endIdx)
                break;
            outU8Array[outIdx++] = 240 | u >> 18;
            outU8Array[outIdx++] = 128 | u >> 12 & 63;
            outU8Array[outIdx++] = 128 | u >> 6 & 63;
            outU8Array[outIdx++] = 128 | u & 63;
        }
    }
    outU8Array[outIdx] = 0;
    return outIdx - startIdx;
}
function stringToUTF8(str, outPtr, maxBytesToWrite) {
    return stringToUTF8Array(str, HEAPU8, outPtr, maxBytesToWrite);
}
function lengthBytesUTF8(str) {
    var len = 0;
    for (var i = 0; i < str.length; ++i) {
        var u = str.charCodeAt(i);
        if (u >= 55296 && u <= 57343)
            u = 65536 + ((u & 1023) << 10) | str.charCodeAt(++i) & 1023;
        if (u <= 127)
            ++len;
        else if (u <= 2047)
            len += 2;
        else if (u <= 65535)
            len += 3;
        else
            len += 4;
    }
    return len;
}
var UTF16Decoder = typeof TextDecoder !== 'undefined' ? new TextDecoder('utf-16le') : undefined;
function UTF16ToString(ptr) {
    var endPtr = ptr;
    var idx = endPtr >> 1;
    while (HEAP16[idx])
        ++idx;
    endPtr = idx << 1;
    if (endPtr - ptr > 32 && UTF16Decoder) {
        return UTF16Decoder.decode(HEAPU8.subarray(ptr, endPtr));
    } else {
        var i = 0;
        var str = '';
        while (1) {
            var codeUnit = HEAP16[ptr + i * 2 >> 1];
            if (codeUnit == 0)
                return str;
            ++i;
            str += String.fromCharCode(codeUnit);
        }
    }
}
function stringToUTF16(str, outPtr, maxBytesToWrite) {
    if (maxBytesToWrite === undefined) {
        maxBytesToWrite = 2147483647;
    }
    if (maxBytesToWrite < 2)
        return 0;
    maxBytesToWrite -= 2;
    var startPtr = outPtr;
    var numCharsToWrite = maxBytesToWrite < str.length * 2 ? maxBytesToWrite / 2 : str.length;
    for (var i = 0; i < numCharsToWrite; ++i) {
        var codeUnit = str.charCodeAt(i);
        HEAP16[outPtr >> 1] = codeUnit;
        outPtr += 2;
    }
    HEAP16[outPtr >> 1] = 0;
    return outPtr - startPtr;
}
function writeArrayToMemory(array, buffer) {
    HEAP8.set(array, buffer);
}
function writeAsciiToMemory(str, buffer, dontAddNull) {
    for (var i = 0; i < str.length; ++i) {
        HEAP8[buffer++ >> 0] = str.charCodeAt(i);
    }
    if (!dontAddNull)
        HEAP8[buffer >> 0] = 0;
}
function demangle(func) {
    return func;
}
function demangleAll(text) {
    var regex = /__Z[\w\d_]+/g;
    return text.replace(regex, function (x) {
        var y = demangle(x);
        return x === y ? x : y + ' [' + x + ']';
    });
}
function jsStackTrace() {
    var err = new Error();
    if (!err.stack) {
        try {
            throw new Error(0);
        } catch (e) {
            err = e;
        }
        if (!err.stack) {
            return '(no stack trace available)';
        }
    }
    return err.stack.toString();
}
function alignUp(x, multiple) {
    if (x % multiple > 0) {
        x += multiple - x % multiple;
    }
    return x;
}
var buffer, HEAP8, HEAPU8, HEAP16, HEAPU16, HEAP32, HEAPU32, HEAPF32, HEAPF64;
function updateGlobalBufferViews() {
    Module['HEAP8'] = HEAP8 = new Int8Array(buffer);
    Module['HEAP16'] = HEAP16 = new Int16Array(buffer);
    Module['HEAP32'] = HEAP32 = new Int32Array(buffer);
    Module['HEAPU8'] = HEAPU8 = new Uint8Array(buffer);
    Module['HEAPU16'] = HEAPU16 = new Uint16Array(buffer);
    Module['HEAPU32'] = HEAPU32 = new Uint32Array(buffer);
    Module['HEAPF32'] = HEAPF32 = new Float32Array(buffer);
    Module['HEAPF64'] = HEAPF64 = new Float64Array(buffer);
}
var STACK_BASE = 71120, DYNAMIC_BASE = 5314000, DYNAMICTOP_PTR = 71088;
var TOTAL_STACK = 5242880;
var INITIAL_TOTAL_MEMORY = Module['TOTAL_MEMORY'] || 16777216;
if (INITIAL_TOTAL_MEMORY < TOTAL_STACK)
    err('TOTAL_MEMORY should be larger than TOTAL_STACK, was ' + INITIAL_TOTAL_MEMORY + '! (TOTAL_STACK=' + TOTAL_STACK + ')');
if (Module['buffer']) {
    buffer = Module['buffer'];
} else {
    {
        buffer = new ArrayBuffer(INITIAL_TOTAL_MEMORY);
    }
}
updateGlobalBufferViews();
HEAP32[DYNAMICTOP_PTR >> 2] = DYNAMIC_BASE;
function callRuntimeCallbacks(callbacks) {
    while (callbacks.length > 0) {
        var callback = callbacks.shift();
        if (typeof callback == 'function') {
            callback();
            continue;
        }
        var func = callback.func;
        if (typeof func === 'number') {
            if (callback.arg === undefined) {
                Module['dynCall_v'](func);
            } else {
                Module['dynCall_vi'](func, callback.arg);
            }
        } else {
            func(callback.arg === undefined ? null : callback.arg);
        }
    }
}
var __ATPRERUN__ = [];
var __ATINIT__ = [];
var __ATMAIN__ = [];
var __ATPOSTRUN__ = [];
var runtimeInitialized = false;
var runtimeExited = false;
function preRun() {
    if (Module['preRun']) {
        if (typeof Module['preRun'] == 'function')
            Module['preRun'] = [Module['preRun']];
        while (Module['preRun'].length) {
            addOnPreRun(Module['preRun'].shift());
        }
    }
    callRuntimeCallbacks(__ATPRERUN__);
}
function ensureInitRuntime() {
    if (runtimeInitialized)
        return;
    runtimeInitialized = true;
    callRuntimeCallbacks(__ATINIT__);
}
function preMain() {
    callRuntimeCallbacks(__ATMAIN__);
}
function exitRuntime() {
    runtimeExited = true;
}
function postRun() {
    if (Module['postRun']) {
        if (typeof Module['postRun'] == 'function')
            Module['postRun'] = [Module['postRun']];
        while (Module['postRun'].length) {
            addOnPostRun(Module['postRun'].shift());
        }
    }
    callRuntimeCallbacks(__ATPOSTRUN__);
}
function addOnPreRun(cb) {
    __ATPRERUN__.unshift(cb);
}
function addOnPostRun(cb) {
    __ATPOSTRUN__.unshift(cb);
}
var Math_abs = Math.abs;
var Math_ceil = Math.ceil;
var Math_floor = Math.floor;
var Math_min = Math.min;
var runDependencies = 0;
var runDependencyWatcher = null;
var dependenciesFulfilled = null;
function addRunDependency(id) {
    runDependencies++;
    if (Module['monitorRunDependencies']) {
        Module['monitorRunDependencies'](runDependencies);
    }
}
function removeRunDependency(id) {
    runDependencies--;
    if (Module['monitorRunDependencies']) {
        Module['monitorRunDependencies'](runDependencies);
    }
    if (runDependencies == 0) {
        if (runDependencyWatcher !== null) {
            clearInterval(runDependencyWatcher);
            runDependencyWatcher = null;
        }
        if (dependenciesFulfilled) {
            var callback = dependenciesFulfilled;
            dependenciesFulfilled = null;
            callback();
        }
    }
}
Module['preloadedImages'] = {};
Module['preloadedAudios'] = {};
var memoryInitializer = null;
var dataURIPrefix = 'data:application/octet-stream;base64,';
function isDataURI(filename) {
    return String.prototype.startsWith ? filename.startsWith(dataURIPrefix) : filename.indexOf(dataURIPrefix) === 0;
}
__ATINIT__.push({
    func: function () {
        ___emscripten_environ_constructor();
    }
});
memoryInitializer = 'data:application/octet-stream;base64,AAAAAAAAAAAAAQIHCAMJBgUEBAoKDAoKCgsKBAQEBA0OAAAAAAAAAAECBAUHDxEHCQcABwMSFQQBIiQlJy8xJyknAQEjMjUAIQIkJScvMScpJwICIzI1ASEiJiYoMDEoKCgDAwMyNQEhIgQlJy8xSgtKBAQjEhUCISIkBScvMScpTAUFIzI1AyEiBgYoMDEoKE0GBiMSFQMhIiQlBy8xB04HBwcjMjUEISImJggwMQgICAgIIzI1BCEiBCUHLzEHCQcJCSMSFQRhYgRlh29xh46HCodjEhUCISIEJScvMScLJwsLIxIVAmFiZAWHb3GHjocMh2NydQNhYgYGiHBxiIiIDYhjEhUDISKEJQcvMQcOBw4OI5KVBCEiJCUnDzEnKScPJyMyNQUhIiYmKBAxKCgoECgjMjUFISIkJScvEScpJxEnIzI1BiEiEiUnLzFTFFMSEiMSFQBhYhJlh29xh46HE4djEhUAISISJScvMScUJxQUIxIVACEiFSUnLzFWF1YVFSMSFQNhYhVlh29xh46HFodjEhUDISIVJScvMScXJxcXIxIVAwACEREAAAAAAEIBAQAAAAAAAgQEExMAAQAiNDQDAwAAAAIEBBMTAAIAAAAAAAAAAAEAAgIAAAAAAQABAhMTAAEBAAICAAAAASEwBgQDAzAAITAGBAUFMAMhMAYEBQUwAiEwBgQDAzABAAAAAAAAAAAAYgEBAAAAAABiAQEAMAAEAGJUVBMwAAMwQlRUAzAwAzBCBAQTMDAEAAAAAAAAAAATAAEBAAAAACMAAQECQAABIwABAQJAAAADAAM2FEAAAVNABTYEQEAAU0AFNgRAQAFTQAYGBEBAAwAAAAAAAAAAAAEAAgAAAAAAAQMDFBQAAQABAAIVFQACAAEDAxQUAAIAITMzBAQAAAAhADIFBQAAAGMAAQAAAAAAYwABEjAABCBjIAECMCADAGNVVhQwAAMwQ1VWBDAwAzBDBVYUMDAEMENVBhQwMAQAAAAAAAAAAAABAAAAAAAAAAEAABQUAAEAAQAAFRUAAgABAAAUFAACIAEgIAQEIAEgASAgBQUgAQEAAQEAAAAAAQABARQUAAEBAAEBAAAAAQEAAQEFBQABIQAhIQQEAAABAAEBBQUAAAADEREAAAAAIAMBAQIgIAIgAwEBAiAgAQADBQUUAAABIAMFBQQgIAEAAwUFFAAAAgIAAQEAAAAAAgABAQAAAAECABQUEwAAASIABAQDAAAAIgAEBAMAAAEAAAAAAAAAAAEAAgIAAAAAAQABAxQUAAEBAAICAAAAAQEAAQMFBQABIQAhAwQEAAABAAEDBQUAAHEGcQZ7BnsGewZ7Bn4GfgZ+Bn4GAAAAAAAAAAB6BnoGegZ6BgAAAAAAAAAAeQZ5BnkGeQYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIYGhgaGBoYGAAAAAAAAAACNBo0GjAaMBo4GjgaIBogGmAaYBpEGkQapBqkGqQapBq8GrwavBq8GAAAAAAAAAAAAAAAAAAAAALoGuga7BrsGuwa7BsAGwAbBBsEGwQbBBr4Gvga+Br4G0gbSBtMG0wYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMcGxwbGBsYGyAbIBgAAywbLBsUGxQbJBskG0AbQBtAG0AYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAzAbMBswGzAZLBksGTAZMBk0GTQZOBk4GTwZPBlAGUAZRBlEGUgZSBiEGIgYiBiMGIwYkBiQGJQYlBiYGJgYmBiYGJwYnBigGKAYoBigGKQYpBioGKgYqBioGKwYrBisGKwYsBiwGLAYsBi0GLQYtBi0GLgYuBi4GLgYvBi8GMAYwBjEGMQYyBjIGMwYzBjMGMwY0BjQGNAY0BjUGNQY1BjUGNgY2BjYGNgY3BjcGNwY3BjgGOAY4BjgGOQY5BjkGOQY6BjoGOgY6BkEGQQZBBkEGQgZCBkIGQgZDBkMGQwZDBkQGRAZEBkQGRQZFBkUGRQZGBkYGRgZGBkcGRwZHBkcGSAZIBkkGSQZKBkoGSgZKBlwGXAZdBl0GXgZeBl8GXwYAAAAAAAAAAAAAAAAAAAABAAMAAQABAAACAgAAAQIAAQECAAEBAwAAAAAAAAAAAAEAAwABAAMAAAECAAABAgABAQIAAQEDIREhEwEVIRcDGSEdAx8BIwMlAykDLQMxAzUBOQE7AT0BPwNBA0UDSQNNA1EDVQNZA10AAAAAAAAAAAAAAwADYQNlA2kTbQNxA3UDeQF9AX8DgQQBhAGEAYQBhAGEAUQDBAEEBwQIBAgEAQAAAAAAAAAAAAABhQGHAYkBiwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAYJACEAIQAAACEAAQABAAMACxYLDgsCAwADAAsGAwADAAMAAwADAAMAAwALKgMACTgBAAEAAQAJNAkyCTYBAAEACTwBAAEAAQABAAEAAQAJOgEAAwADAAMAAwADAAMAAwADAAMAAwADAAMAAwADAAMACz4DAAMAAwADAAMAC0IDAAMAAwADAAMAAwADAAMAAwADAAlOC1ADAAMAC1oDAAlUC1YBAAEAAQAJkAmJCYcJiwmSAQAJjgusAQADAAMAC5QDAAleCWAAAAAAAAAAAAAAAAAAAQAAAAAAAQIDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQIDAAAAAAAAAAAAAAAAAAEAAAABAgMAAQIDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAECAwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEBAQEBAAAAAAAAAAAAAAAAAADAwMAAwADAwMDAwMDAwMDAAABAAEAAQABAAECAwABAAECAwABAAECAwABAgMAAQIDAAECAwABAgMAAQABAAEAAQABAgMAAQIDAAECAwABAgMAAQIDAAECAwABAgMAAQIDAAECAwABAgMAAQIDAAECAwABAgMAAQIDAAECAwABAAEAAQIDAAEAAQABAAEAAABdBGUEbQR1BI0ElQSdBKUErQS1BLsEwwTLBNME2wTjBOkE8QT5BAEFBAUMBRQFHAUkBSwFKAUwBTgFQAVFBU0FVQVdBWEFaQVxBXkFgQWJBYUFjQWSBZoFoAWoBbAFuAXABcgF0AXYBd0F5QXoBfAF+AUABgYGDgYNBhUGHQYlBjUGLQY9BkUGfQRVBl0GTQZtBm8GdwZlBocGjQaVBn8GpQarBrMGnQbDBskG0Qa7BuEG5wbvBtkG/wYHBw8H9wYfByUHLQcXBz0HQwdLBzUHWwdgB2gHUwd4B38HhwdwBwkGjweXB30EnwenB68HfQS3B78HxwfMB9QH2wfjB30EyAXrB/MH+wcDCFUFEwgLCMgFyAXIBcgFyAXIBcgFyAXIBcgFGwjIBSMIJwgvCMgFNQjIBTsIQwhLCFUFVQVTCFsIyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFYAhoCMgFyAVwCHgIgAiICJAIyAWYCKAIqAi4CMgFwAjCCMoIsAjIBc0I4QjVCN0I6QjIBfEI9wj/CAcJyAUXCR8JJwkPCX0EfQQ3CToJQgkvCVIJSgnIBVkJyAVoCWEJcAl4CXwJhAmMCf0ElAmXCZ0JpAmXCSQFrAmtBK0ErQStBLQJrQStBK0ExAnMCdQJ3AnkCegJ8Am8CQgKEAr4CQAKGAogCigKMApICjgKQApQClgKZwpsCl8KdAp0CnQKdAp0CnQKdAp0CnwKhAr/CIcKjwqWCpsKowr/CKoKqQq6Cr0K/wj/CLIK/wj/CP8I/wj/CMwK1ArECv8I/wj/CNkK/wj/CP8I/wj/CP8I/wjfCucK/wjvCvYK/wj/CP8I/wj/CP8I/wj/CHQKdAp0CnQK/gp0CgULDAt0CnQKdAp0CnQKdAp0CnQK/wgUCxsLHwslC/8IKwukClUFOwszC0MLrQStBK0ESwv9BFMLyAVZC2kLYQthCyQFcQt5C4ELfQSJC/8I/wiQC/8I/wj/CP8I/wj/CJgLnguuC6YLCQbIBbYLWwjIBb4LxgvKC8gFyAXPC9cL/wjfC6QK5wvtC/8I5wv1C/8IpAr/CP8I/wj/CP8I/wj/CP8I/QvIBcgFyAUFDMgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFCwzIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAUQDMgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXNCP8I/wgYDMgFGwzIBSMMKQwxDDkMPgzIBcgFQgzIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAVJDMgFUAxWDMgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAVeDMgFyAXIBWYMyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBWgMyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAVvDMgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFdgzIBcgFyAV9DIUMyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFigzIBcgFkgzIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFlgzIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAWZDMgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAWcDMgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFogzIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFqgzIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBa8MyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAW0DMgFyAXIBbkMyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcEMyAzMDMgFyAXIBdMMyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBdkM6QzIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgF4Qz/CPEMcAnIBcgFyAXIBcgFyAXIBcgF9gz+DK0EDg0GDcgFyAUWDR4NLg2tBDMNOw1BDX0EJg1JDVENyAVZDWkNbA1hDXQNHQZ8DYMNwQhtBpMNiw2bDcgFow2rDbMNyAW7DcMNyw3TDdsN3w3nDf0E/QTIBe8NyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAX3DQMO+w19BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0ECw4LDgsOCw4LDgsOCw4LDgsOCw4LDgsOCw4LDgsOCw4LDgsOCw4LDgsOCw4LDgsOCw4LDgsOCw4LDgsOCw4LDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw7IBcgFyAUbDsgF1AwiDicOyAXIBcgFLw7IBcgFzAh9BEUONQ49DsgFyAVNDlUOyAXIBcgFyAXIBcgFyAXIBcgFyAVaDmIOyAVmDsgFbA5wDngOgA6HDo8OyAXIBcgFlQ6tDm0EtQ69DsIO4QidDqUOCw4LDgsOCw4LDgsOCw4LDgsOCw4LDgsOCw4LDgsOCw4LDgsOCw4LDgsOCw4LDgsOCw4LDgsOCw4LDgsOCw4LDvQR9BE0EnQStBLsEiwTbBOkE+QTEBRQFJAUoBTgFBQVVBWEFcQVBBYUFkgWgBbAFgAXQBd0F6AX4BcYGDQYdBiACsAKAAtAC4ALQArAC0AK4gtACkAKQApACiIM2wHbAWIMogxACkAKQApACuIMAg1ACkAKQg2CDcINAg5CDoIOwg75DtsB2wEdD1EP2wF5D9sB2wHbAdsBpg/bAdsB2wHbAdsB2wHbAboP2wHyDzIQ2wE9ENsB2wHbAXMQQAqzEEAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAK8xBACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACkAKQApACgAHAAcABwAHAAcABwAHAAcABwAHAAcABwAHAAcABwAHAAcABwAHAAcABwAHAAcABwAHAAcABwAHAAcABwAHMxEABwAHAAcABwAHAAcABwAHAAcABwAHAAcABwAHAAcABwAHAAcABwAHAAcABwAHAAcABwAHAAcABwAHAAcABzMRfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQTKDtEO2Q59BMgFyAXIBdcL6Q7hDgAP8Q74DggPhQsQD30EfQR9BH0EwQjIBRgPIA/IBSgPMA80DzwPyAVED30EVQVfBUwPyAVQD1gPaA9gD8gFcA/IBXcPfQR9BH0EfQTIBcgFyAXIBcgFyAXIBcgFyAVpC80IbA59BH0EfQR9BIcPfw+KD5IP4QiaD30Eog+qD7IPfQR9BMgFwg/KD7oP2g/hD9IP6Q/xD30EARD5D8gFBBAMEBQQHBAkEH0EfQTIBcgFLBB9BFUFNBD9BDwQyAVEEH0EfQR9BH0EfQR9BH0EfQR9BEwQfQR9BH0EfQRUEFwQYxB9BH0EfQR9BH0EcxD+BXsQaxBSCYMQixCREKkQmRChEK0QUgm9ELUQxRDVEM0QfQR9BNwQ5BAgBuwQ/BACEQoR9BB9BH0EfQR9BMgFEhEaEX0EyAUiESoRfQR9BH0EfQR9BMgFMhE6EX0EyAVCEUoRUhHIBWIRWhF9BDsIahF9BH0EfQR9BH0EfQTIBXIRfQR9BH0EVQX9BHoRfQR9BH0EfQR9BH0EfQR9BJIRghGKEcgFohGaEcgFwgh9BH0EfQR9BH0EfQR9BH0EuBG9EaoRshHNEcURfQR9BNwR4BHUEfAR6BFaEX0EfQR9BH0EfQR9BH0EfQR9BPQRfQR9BH0EfQR9BH0EfQR9BMgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFzAh9BH0EfQQEEgwSFBL8EcgFyAXIBcgFyAXIBRwSfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFJBJ9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFJhJ9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BMgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXCCOEILhJ9BH0EYg42EsgFPhJGEk4S2Qx9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQRVBf0EVhJ9BH0EfQTIBcgFXhJjEmsSfQR9BHMSyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFexLIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFgxJ9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BMgFyAXIBcgFyAXIBcgFyAXhCH0EfQRiDsgFyAXIBcgFyAXIBcgFyAXIBcgFyAX7DX0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EyAXIBcgFixKQEpgSfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BP8I/wj/CP8I/wj/CP8ImAv/CKAS/winEq8StRL/CLsS/wj/CMMSfQR9BH0EfQTLEv8I/wimCtMSfQR9BH0EfQTjEuoS7xL1Ev0SBRMNE+cSFRMdEyUTKhP8EuMS6hLmEvUSMhPkEjUT5xI9E0UTTRNUE0ATSBNQE1cTQxNfE9sS/wj/CP8I/wj/CP8I/wj/CP8I/wj/CP8I/wj/CP8I/wgkBW8TJAV2E30TZxN9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQSEE4wTfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BMgFyAXIBcgFyAXIBZQTfQRVBaQTnBN9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQSsE7wTtBN9BH0EfQR9BH0EfQR9BH0EfQR9BMwT1BPcE+QT7BP0E30ExBN9BH0EfQR9BH0EfQR9BH0E/wj8E/8I/wiQCwEUBRSYCw0U/wj/CPwT/wi6En0EFRQdFCEUKRQxFH0EfQR9BH0E/wj/CP8I/wj/CP8I/wg5FP8I/wj/CP8I/wj/CP8I/wj/CP8I/wj/CP8I/wj/CP8I/wj/CP8I/wj/CP8IQRRJFP8I/wj/CJAL/wj/CFEUfQT8E/8IWRT/CGEUmgt9BH0E/BOkCv8IZRT/CG0UHRT/CH0EfQR9BJoLfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BHUUyAXIBXwUyAXIBcgFhBTIBYwUyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFegzIBcgFlBTIBcgFyAXIBcgFyAXIBcgFyAXIBZwUpBTIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAW5DMgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAWrFMgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBbIUyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFuRTIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAVpC30EyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFvRTIBcgFyAXIBcgFyAVQD8gFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBX8SyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXIBcgFyAXCFH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQTIBcgFyAXIBcoUyAXIBcgFyAXIBcgFyAXIBcgFyAXIBVAPfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BNoU0hTSFNIUfQR9BH0EfQQkBSQFJAUkBSQFJAUkBeIUfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EfQR9BH0EEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMOEw4TDhMO6hRcBA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAMABcAFwAXABkAFwAXABcAFAAVABcAGAAXABMAFwAXAEkAiQDJAAkBSQGJAckBCQJJAokCFwAXABgAGAAYABcAFwABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAFAAXABUAGgAWABoAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACABQAGAAVABgADwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAPAA8ADwAMABcAGQAZABkAGQAbABcAGgAbAAUAHAAYABAAGwAaABsAGABLA4sDGgACABcAFwAaAAsDBQAdAMs0SzTLPBcAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABABgAAQABAAEAAQABAAEAAQACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgAYAAIAAgACAAIAAgACAAIAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAgABAAIAAQACAAEAAgABAAIAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAQACAAEAAgABAAIAAgACAAEAAQACAAEAAgABAAEAAgABAAEAAQACAAIAAQABAAEAAQACAAEAAQACAAEAAQABAAIAAgACAAEAAQACAAEAAQACAAEAAgABAAIAAQABAAIAAQACAAIAAQACAAEAAQACAAEAAQABAAIAAQACAAEAAQACAAIABQABAAIAAgACAAUABQAFAAUAAQADAAIAAQADAAIAAQADAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAIAAQADAAIAAQACAAEAAQABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAIAAgACAAIAAgACAAEAAQACAAEAAQACAAIAAQACAAEAAQABAAEAAgABAAIAAQACAAEAAgABAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIABQACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAaABoAGgAaAAQABAAEAAQABAAEAAQABAAEAAQABAAEABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAEAAQABAAEAAQAGgAaABoAGgAaABoAGgAEABoABAAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgABAAIAAQACAAQAGgABAAIAAAAAAAQAAgACAAIAFwABAAAAAAAAAAAAGgAaAAEAFwABAAEAAQAAAAEAAAABAAEAAgABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAAABAAEAAQABAAEAAQABAAEAAQACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAQACAAIAAQABAAEAAgACAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAgACAAIAAgABAAIAGAABAAIAAQABAAIAAgABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgAbAAYABgAGAAYABgAHAAcAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgAAAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQAAAAAABAAXABcAFwAXABcAFwACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgAXABMAAAAAABsAGwAZAAAABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYAEwAGABcABgAGABcABgAGABcABgAAAAAAAAAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAAAAAAAAAFAAUABQAFABcAFwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAQABAAEAAQABAAGAAYABgAFwAXABkAFwAXABsAGwAGAAYABgAGAAYABgAGAAYABgAGAAYAFwAQAAAAFwAXAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAEAAUABQAFAAUABQAFAAUABQAFAAUABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYASQCJAMkACQFJAYkByQEJAkkCiQIXABcAFwAXAAUABQAGAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAFwAFAAYABgAGAAYABgAGAAYAEAAbAAYABgAGAAYABgAGAAQABAAGAAYAGwAGAAYABgAGAAUABQBJAIkAyQAJAUkBiQHJAQkCSQKJAgUABQAFABsAGwAFABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAAABAABQAGAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAGAAYABgAGAAYABgAGAAYABgAGAAYABQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAASQCJAMkACQFJAYkByQEJAkkCiQIFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAGAAYABgAGAAYABgAGAAYABgAEAAQAGwAXABcAFwAEAAAAAAAGABkAGQAGAAYABgAGAAQABgAGAAYABAAGAAYABgAGAAYAAAAAABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAGAAYABgAGAAQABgAGAAYABgAGAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABgAGAAYAAAAAABcAAAAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABgAGABAABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAABQAFAAUABQAFAAUABQAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABQAFAAYABgAXABcASQCJAMkACQFJAYkByQEJAkkCiQIXAAQABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAYABgAGAAgABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABgAIAAYABQAIAAgACAAGAAYABgAGAAYABgAGAAYACAAIAAgACAAGAAgACAAFAAYABgAGAAYABgAGAAYABQAFAAUABQAFAAUABQAFAAUABQAGAAYAAAAAAEkAiQDJAAkBSQGJAckBCQJJAokCBQAFABkAGQDLN8s1yz/LNMs8SwkbABkABQAXAAYAAAAFAAYACAAIAAAABQAFAAUABQAFAAUABQAFAAAAAAAFAAUAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAUABQAFAAUABQAFAAUAAAAFAAAAAAAAAAUABQAFAAUAAAAAAAYABQAIAAgACAAGAAYABgAGAAAAAAAIAAgAAAAAAAgACAAGAAUAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAFAAUAAAAFAAAAAAAAAAAAAAAAAEkAiQDJAAkBSQGJAckBCQJJAokCBgAGAAUABQAFAAYAFwAAAAAAAAAAAAAAAAAAAAAAAAAAAAYABgAIAAAABQAFAAUABQAFAAUAAAAAAAAAAAAFAAUAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAUABQAFAAUABQAFAAUAAAAFAAUAAAAFAAUAAAAFAAUAAAAAAAYAAAAIAAgACAAGAAYAAAAAAAAAAAAGAAYAAAAAAAYABgAGAAAAAAAAAAYAAAAAAAAAAAAAAAAAAAAFAAUABQAFAAAABQAAAAUABQAGAAYAAAAAAEkAiQDJAAkBSQGJAckBCQJJAokCFwAZAAAAAAAAAAAAAAAAAAAABQAGAAYABgAGAAYABgAAAAYABgAIAAAABQAFAAUABQAFAAUABQAFAAUAAAAFAAUABQAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAUABQAFAAUABQAFAAUAAAAFAAUAAAAFAAUABQAFAAUAAAAAAAYABQAIAAgACAAGAAYABgAGAAYAAAAGAAYACAAAAAgACAAGAAAAAAAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUABQAGAAYAAAAAAEkAiQDJAAkBSQGJAckBCQJJAokCGwAFAMs0SzTLPMs3yzXLPwAAAAAAAAAAAAAAAAAAAAAAAAYACAAIAAAABQAFAAUABQAFAAUABQAFAAAAAAAFAAUAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAUABQAFAAUABQAFAAUAAAAFAAUAAAAFAAUABQAFAAUAAAAAAAYABQAIAAYACAAGAAYABgAGAAAAAAAIAAgAAAAAAAgACAAGAAAAAAAAAAAAAAAAAAAAAAAGAAgAAAAAAAAAAAAFAAUAAAAFAAAAAAAAAAAAAAAAAEkAiQDJAAkBSQGJAckBCQJJAokCywdLHkt4GwAbABsAGwAbABsAGQAbAAAAAAAAAAAAAAAAAAAABgAFAAAABQAFAAUABQAFAAUAAAAAAAAABQAFAAUAAAAFAAUABQAFAAAAAAAAAAUABQAAAAUAAAAFAAUAAAAAAAAABQAFAAAAAAAAAAUABQAFAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAAAAAAAAAACAAIAAYACAAIAAAAAAAAAAgACAAIAAAACAAIAAgABgAAAAAABQAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAAAAAAFAAUABgAGAAAAAABJAIkAyQAJAUkBiQHJAQkCSQKJAgAAAAAAAAAAAAAAAAAAAABLBYsFywULBosFywULBhsABgAIAAgACAAGAAUABQAFAAUABQAFAAUABQAAAAUABQAFAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAAAAAAAAUABgAGAAYACAAIAAgACAAAAAYABgAGAAAABgAGAAYABgAAAAAAAAAAAAAAAAAAAAYABgAAAAUABQAFAAAAAAAAAAAAAAAFAAUABgAGAAAAAABJAIkAyQAJAUkBiQHJAQkCSQKJAgAABQAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABQAGAAgACAAXAAUABQAFAAUABQAFAAUABQAAAAUABQAFAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAFAAUABQAFAAUABQAFAAUABQAFAAAABQAFAAUABQAFAAAAAAAGAAUACAAGAAgACAAIAAgACAAAAAYACAAIAAAACAAIAAYABgAAAAAAAAAAAAAAAAAAAAgACAAAAAAAAAAAAAAAAAAAAAUAAAAFAAUABgAGAAAAAABJAIkAyQAJAUkBiQHJAQkCSQKJAssHSx5LeMs0SzTLPMs3yzXLPxsABQAFAAUABQAFAAUABgAGAAgACAAAAAUABQAFAAUABQAFAAUABQAAAAUABQAFAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAYABgAFAAgACAAIAAYABgAGAAYAAAAIAAgACAAAAAgACAAIAAYABQAbAAAAAAAAAAAABQAFAAUACAALzAvKS8sLyUs2S8kLNQUAAAAAAAAAAAAAAAAASQCJAMkACQFJAYkByQEJAkkCiQIAAAAACAAIABcAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAgAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAFAAUABQAFAAUABQAFAAUABQAAAAUAAAAAAAUABQAFAAUABQAFAAUAAAAAAAAABgAAAAAAAAAAAAgACAAIAAYABgAGAAAABgAAAAgACAAIAAgACAAIAAgACAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABgAFAAUABgAGAAYABgAGAAYABgAAAAAAAAAAABkABQAFAAUABQAFAAUABAAGAAYABgAGAAYABgAGAAYAFwBJAIkAyQAJAUkBiQHJAQkCSQKJAhcAFwAAAAAAAAAAAAAABQAFAAAABQAAAAAABQAFAAAABQAAAAAABQAAAAAAAAAAAAAAAAAFAAUABQAFAAAABQAFAAUABQAFAAUABQAAAAUABQAFAAAABQAAAAUAAAAAAAUABQAAAAUABQAFAAUABgAFAAUABgAGAAYABgAGAAYAAAAGAAYABQAAAAAABQAFAAUABQAFAAAABAAAAAYABgAGAAYABgAGAAAAAABJAIkAyQAJAUkBiQHJAQkCSQKJAgAAAAAFAAUABQAFAAUAGwAbABsAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAGwAXABsAGwAbAAYABgAbABsAGwAbABsAGwBJAIkAyQAJAUkBiQHJAQkCSQKJAks0SzxLREtMS1RLXEtkS2xLdEssGwAGABsABgAbAAYAFAAVABQAFQAIAAgABQAFAAUABQAFAAUABQAFAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAAAAAAAAAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYACAAGAAYABgAGAAYAFwAGAAYABQAFAAUABQAFAAYABgAGAAYABgAGAAYABgAGAAYABgAAAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAAABsAGwAbABsAGwAbABsAGwAGABsAGwAbABsAGwAbAAAAGwAbABcAFwAXABcAFwAbABsAGwAbABcAFwAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAgACAAGAAYABgAGAAgABgAGAAYABgAGAAYACAAGAAYACAAIAAYABgAFAEkAiQDJAAkBSQGJAckBCQJJAokCFwAXABcAFwAXABcABQAFAAUABQAFAAUACAAIAAYABgAFAAUABQAFAAYABgAGAAUACAAIAAgABQAFAAgACAAIAAgACAAIAAgABQAFAAUABgAGAAYABgAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAYACAAIAAYABgAIAAgACAAIAAgACAAGAAUACABJAIkAyQAJAUkBiQHJAQkCSQKJAggACAAIAAYAGwAbAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACABcABAACAAIAAgABAAEAAQABAAEAAQAAAAEAAAAAAAAAAAAAAAEAAAAAAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIABQAFAAUABQAFAAUABQAFAAUAAAAFAAUABQAFAAAAAAAFAAUABQAFAAUABQAFAAAABQAAAAUABQAFAAUAAAAAAAUABQAFAAUABQAFAAUABQAFAAAABQAFAAUABQAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAABQAFAAUABQAAAAAABQAFAAUABQAFAAUABQAAAAUAAAAFAAUABQAFAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAUABQAFAAUAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAAAAAGAAYABgAXABcAFwAXABcAFwAXABcAFwALA0sDiwPLAwsESwSLBMsECwXLB0sKywxLD8sRSxTLFksZyxtLHot4AAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAbABsAGwAbABsAGwAbABsAGwAbAAAAAAAAAAAAAAAAAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAAAAAAIAAgACAAIAAgACAAAAAAATAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAXABcABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAwABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFABQAFQAAAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUAFwAXABcAignKCQoKBQAFAAUABQAFAAUABQAFAAAAAAAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAUABQAFAAUABgAGAAYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAYABgAGABcAFwAAAAAAAAAAAAAAAAAAAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAGAAYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAUABQAFAAAABgAGAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAGAAYACAAGAAYABgAGAAYABgAGAAgACAAIAAgACAAIAAgACAAGAAgACAAGAAYABgAGAAYABgAGAAYABgAGAAYAFwAXABcABAAXABcAFwAZAAUABgAAAAAASQCJAMkACQFJAYkByQEJAkkCiQIAAAAAAAAAAAAAAABLBYsFywULBksGiwbLBgsHSweLBwAAAAAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAYABQAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAXABcAFwAXABcAFwATABcAFwAXABcABgAGAAYAEAAAAEkAiQDJAAkBSQGJAckBCQJJAokCAAAAAAAAAAAAAAAABQAFAAUABAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAAAAAAAAAAAAAAAAAFAAUABQAFAAUABgAGAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAAAAAAAAAAAAAAAAAAAAAAAAAABgAGAAYACAAIAAgACAAGAAYACAAIAAgAAAAAAAAAAAAIAAgABgAIAAgACAAIAAgACAAGAAYABgAAAAAAAAAAABsAAAAAAAAAFwAXAEkAiQDJAAkBSQGJAckBCQJJAokCBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAABQAFAAUABQAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAAAAAAAAAAAAAAAEkAiQDJAAkBSQGJAckBCQJJAokCCwMAAAAAAAAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAGAAYACAAIAAYAAAAAABcAFwAXABcAFwAXABcAFwAXAAQAFwAXABcAFwAXABcAAAAAAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAHAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUACAAGAAgABgAGAAYABgAGAAYABgAAAAYACAAGAAgACAAGAAYABgAGAAYABgAGAAYACAAIAAgACAAIAAgABgAGAAYABgAGAAYABgAGAAYABgAAAAAABgBJAIkAyQAJAUkBiQHJAQkCSQKJAgAAAAAAAAAAAAAAAEkAiQDJAAkBSQGJAckBCQJJAokCAAAAAAAAAAAAAAAAFwAbABsAGwAbABsAGwAbABsAGwAbAAYABgAGAAYABgAGAAYABgAGABsAGwAbABsAGwAbABsAGwAbAAAAAAAAAAYABgAGAAYACAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAGAAgABgAGAAYABgAGAAgABgAIAAgACAAIAAgABgAIAAgABQAFAAUABQAFAAUABQAAAAAAAAAAAEkAiQDJAAkBSQGJAckBCQJJAokCFwAXABcAFwAXABcABQAIAAYABgAGAAYACAAIAAYABgAIAAYABgAGAAUABQBJAIkAyQAJAUkBiQHJAQkCSQKJAgUABQAFAAUABQAFAAYABgAIAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABgAIAAYABgAIAAgACAAGAAgABgAGAAYACAAIAAAAAAAAAAAAAAAAAAAAAAAXABcAFwAXAEkAiQDJAAkBSQGJAckBCQJJAokCAAAAAAAABQAFAAUASQCJAMkACQFJAYkByQEJAkkCiQIFAAUABQAFAAUABQAIAAgACAAIAAgACAAIAAgABgAGAAYABgAGAAYABgAGAAgACAAGAAYAAAAAAAAAFwAXABcAFwAXAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAQABAAEAAQABAAEABcAFwACAAIAAgACAAIAAgACAAIAAgAAAAAAAAAAAAAAAAAAAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAAAAAABAAEAAQAXABcAFwAXABcAFwAXABcAAAAAAAAAAAAAAAAAAAAAAAYABgAGABcABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAIAAYABgAGAAYABgAGAAYABQAFAAUABQAGAAUABQAFAAUACAAIAAYABQAFAAgABgAGAAAAAAAAAAAAAAAAAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAQAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIABAAEAAQABAAEAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAAAAYABgAGAAYABgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAIAAgACAAIAAgACAAIAAgABAAIAAgACAAIAAgACAAIAAgACAAEAAQABAAEAAQAaABoAGgAAAAAAAgACAAIAAAACAAIAAQABAAEAAQADABoAGgAAAAIAAgACAAIAAgACAAIAAgABAAEAAQABAAEAAQABAAEAAgACAAIAAgACAAIAAAAAAAEAAQABAAEAAQABAAAAAAACAAIAAgACAAIAAgACAAIAAQABAAEAAQABAAEAAQABAAIAAgACAAIAAgACAAIAAgABAAEAAQABAAEAAQABAAEAAgACAAIAAgACAAIAAAAAAAEAAQABAAEAAQABAAAAAAACAAIAAgACAAIAAgACAAIAAAABAAAAAQAAAAEAAAABAAIAAgACAAIAAgACAAIAAgABAAEAAQABAAEAAQABAAEAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAAAAAACAAIAAgACAAIAAgACAAIAAwADAAMAAwADAAMAAwADAAIAAgACAAIAAgACAAIAAgADAAMAAwADAAMAAwADAAMAAgACAAIAAgACAAAAAgACAAEAAQABAAEAAwAaAAIAGgAaABoAAgACAAIAAAACAAIAAQABAAEAAQADABoAGgAaAAIAAgACAAIAAAAAAAIAAgABAAEAAQABAAAAGgAaABoAFgAXABcAFwAYABQAFQAXABcAFwAXABcAFwAXABcAFwAXABcAGAAXABYAFwAXABcAFwAXABcAFwAXABcAFwAMABAAEAAQABAAEAAAABAAEAAQABAAEAAQABAAEAAQABAAywIEAAAAAADLAwsESwSLBMsECwUYABgAGAAUABUABAAMAAwADAAMAAwADAAMAAwADAAMAAwAEAAQABAAEAAQABMAEwATABMAEwATABcAFwAcAB0AFAAcABwAHQAUABwAFwAXABcAFwAXABcAFwAXAA0ADgAQABAAEAAQABAADAAXABcAFwAXABcAFwAXABcAFwAcAB0AFwAXABcAFwAWAMsCCwNLA4sDywMLBEsEiwTLBAsFGAAYABgAFAAVAAAABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAAAAAAAAAZABkAGQAZABkAGQAZABkAGQAZABkAGQAZABkAGQAZABkAGQAZABkAGQAZABkAGQAZABkAGQAZABkAGQAZABkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAcABwAHAAcABgAHAAcABwAGAAYABgAGAAYABgAGAAYABgAGAAYABgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAbABsAGwAbAAEAGwABABsAAQAbAAEAAQABAAEAGwACAAEAAQABAAEAAgAFAAUABQAFAAIAGwAbAAIAAgABAAEAGAAYABgAGAAYAAEAAgACAAIAAgAbABgAGwAbAAIAGwCLNQs2SzaLNIs4CzULOQs9C0FLNUtFyzXLPctFy02LBRsAGwABABsAGwAbABsAAQAbABsAAgABAAEAAQACAAIAAQABAAEAAgAbAAEAGwAbABgAAQABAAEAAQABABsAGwCKBcoFCgZKBooGygYKB0oHigfKBwoISgjKEUoeCphKeIoFygUKBkoGigbKBgoHSgeKB8oHCghKCMoRSh4KmEp4SnhKmIp4AQACAMoGyhGKmMp4SwUbABsAAAAAAAAAAAAYABgAGAAYABgAGwAbABsAGwAbABgAGAAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAbABsAGAAbABsAGAAbABsAGwAbABsAGwAbABgAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAYABgAGwAbABgAGwAYABsAGwAbABsAGwAbABsAGwAbABsAGwAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGwAbABsAGwAbABsAGwAbABQAFQAUABUAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABgAGAAbABsAGwAbABsAGwAbABQAFQAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGAAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABgAGAAYABgAGAAYABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGwAbABsAGwAbABsAGwAbABsAGwDLAgsISwiLCMsICwlLCYsJywkLCksKCwNLA4sDywMLBEsEiwTLBAsFywfLAgsDSwOLA8sDCwRLBIsEywQLBcsHCwhLCIsIywgLCUsJiwnLCQsKSwoLA0sDiwPLAwsESwSLBMsECwXLBwsISwiLCMsICwlLCYsJywkLCksKGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGAAYABgAGAAYABgAGAAYABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAYABsAGwAbABsAGwAbABsAGwAbABgAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGAAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABQAFQAUABUAFAAVABQAFQAUABUAFAAVABQAFQALA0sDiwPLAwsESwSLBMsECwXLBwsDSwOLA8sDCwRLBIsEywQLBcsHCwNLA4sDywMLBEsEiwTLBAsFywcbABsAGwAbABsAGwAbABsAGwAbABsAGwAYABgAGAAYABgAFAAVABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABQAFQAUABUAFAAVABQAFQAUABUAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAUABUAFAAVABQAFQAUABUAFAAVABQAFQAUABUAFAAVABQAFQAUABUAFAAVABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABQAFQAUABUAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAUABUAGAAYABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABsAGwAYABgAGAAYABgAGAAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAAAAAABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbAAAAAAAbABsAGwAbABsAGwAbABsAGwAAABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgAAAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAAAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgABAAIAAQABAAEAAgACAAEAAgABAAIAAQACAAEAAQABAAEAAgABAAIAAgABAAIAAgACAAIAAgACAAQABAABAAEAAQACAAEAAgACABsAGwAbABsAGwAbAAEAAgABAAIABgAGAAYAAQACAAAAAAAAAAAAAAAXABcAFwAXAEs0FwAXAAIAAgACAAIAAgACAAAAAgAAAAAAAAAAAAAAAgAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAAAAAAAAAAAAAAAAQAFwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABgAFAAUABQAFAAUABQAFAAAABQAFAAUABQAFAAUABQAAAAUABQAFAAUABQAFAAUAAAAFAAUABQAFAAUABQAFAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAAAAAAAAAAAAAAAAAAAAAAABcAFwAcAB0AHAAdABcAFwAXABwAHQAXABwAHQAXABcAFwAXABcAFwAXABcAFwATABcAFwATABcAHAAdABcAFwAcAB0AFAAVABQAFQAUABUAFAAVABcAFwAXABcAFwAEABcAFwAXABcAFwAXABcAFwAXABcAEwATABcAFwAXABcAEwAXABQAFwAXABcAFwAXABcAFwAXABcAFwAXABcAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAAABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGwAbABsAGwAbABsAGwAbABsAGwAbABsAAAAAAAAAAAAbAIoFygUKBkoGigbKBgoHSgeKBwYABgAGAAYACAAIABMABAAEAAQABAAEABsAGwDKB0oKygwEAAUAFwAbABsADAAXABcAFwAbAAQABQBKBRQAFQAUABUAFAAVABQAFQAUABUAGwAbABQAFQAUABUAFAAVABQAFQATABQAFQAVAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAABgAGABoAGgAEAAQABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAXAAQABAAEAAUAAAAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAbABsAiwXLBQsGSwYbABsAGwAbABsAGwAbABsAGwAbAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAAAAAAAAAAAAAbABsAGwAbAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAiwXLBQsGSwaLBssGCwdLB4sHywcbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbAMsHSwrLDEsPyxFLFMsWSxkbAIsKywoLC0sLiwvLCwsMSwyLDMsMCw1LDYsNyw0LDhsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwBLDosOyw4LD0sPiw/LDwsQSxCLEMsQCxFLEYsRyxEFAAUABQAFAAUAhQYFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAxQUFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQCFBgUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQcFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQCFBQUABQAFBwUABQAFAIV4BQAFBgUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAhQcFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAxQUFAAUABQAFAAUABQAFAIUGBQBFBgUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQCFecUHBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUARXgFAAUABQAFAAUABQAFAAUABQYFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQCFBgUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAEUeBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAhXkFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAhXoFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAxQUFAEUHBQDFBgUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAxQcFAEV4RQrFDAUABQAFAAUABQAFAEUPBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUGBQYFBgUGBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUARQYFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAhQUFAAUABQAFAAUABQAFAIUFBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQCFBQUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAhQdFCgUABQAFAAUABQAFAAUABQAFAAUABQAFAIUFxQUFBgUAxQUFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQDFBwUABQAFAAUABQAFAAUABQAFAAUABQAFAAUARQcFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFBwUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAIUHBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQBFHgUABQAFAAUABQAFAAUARQYFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAIV4BQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAxQUFAAUABQAFAMUFBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQDFBQUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUARXgFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAxQYFAAUABQAFAAUARR4FAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQDFBgUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUARQUFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAAAAAAABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABAAFAAUABQAFAAUABQAFAAUABQAFABsAGwAbABsAGwAbABsAAAAAAAAAAAAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAEABcAFwAXAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUASQCJAMkACQFJAYkByQEJAkkCiQIFAAUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIABAAEAAYABgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIABQAGAAcABwAHABcABgAGAAYABgAGAAYABgAGAAYABgAXAAQABQAFAAUABQAFAAUAigXKBQoGSgaKBsoGCgdKB4oHSgUGAAYAFwAXABcAFwAXABcAAAAAAAAAAAAAAAAAAAAAABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAEAAQABAAEAAQABAAEAAQABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABQAEAAQAAgAFAAUABQAFAAUAGgAaAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgACAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAgABAAIABAACAAIAAgACAAIAAgACAAIAAQACAAEAAgABAAEAAgABAAIAAQACAAEAAgABAAIABAAaABoAAQACAAEAAgAFAAEAAgABAAIAAgACAAEAAgABAAIAAQACAAEAAgABAAIAAQACAAEAAQABAAEAAQACAAEAAQABAAEAAQACAAEAAgABAAIAAAAAAAAAAAAAAAAABQAFAAYABQAFAAUABgAFAAUABQAFAAYABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAgACAAGAAYACAAbABsAGwAbAAAAAAAAAAAAyzRLNMs8yzfLNcs/GwAbABkAGwAAAAAAAAAAAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAFwAXABcAFwAAAAAAAAAAAAAAAAAAAAAACAAIAAgACAAGAAYAAAAAAAAAAAAAAAAAAAAAABcAFwBJAIkAyQAJAUkBiQHJAQkCSQKJAgAAAAAAAAAAAAAAAAgACAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAIAAgACAAIAAgACAAIAAgACAAIAAgACAAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAFAAUABQAFAAUABQAXABcAFwAFABcABQAFAAYABQAFAAUABQAFAAUABgAGAAYABgAGAAYABgAGABcAFwAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAYABgAGAAYABgAGAAYABgAGAAYABgAIAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABcACAAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXAAAABABJAIkAyQAJAUkBiQHJAQkCSQKJAgAAAAAAAAAAFwAXAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABgAIAAgABgAGAAYABgAIAAgABgAIAAgACAAFAAUABQAFAAUABgAEAAUABQAFAAUABQAFAAUABQAFAEkAiQDJAAkBSQGJAckBCQJJAokCBQAFAAUABQAFAAAABQAFAAUABQAFAAUABQAFAAUABgAGAAYABgAGAAYACAAIAAYABgAIAAgABgAGAAAAAAAAAAAAAAAAAAAAAAAAAAUABQAFAAYABQAFAAUABQAFAAUABQAFAAYACAAAAAAASQCJAMkACQFJAYkByQEJAkkCiQIAAAAAFwAXABcAFwAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAQABQAFAAUABQAFAAUAGwAbABsABQAIAAYACAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAGAAUABgAGAAYABQAFAAYABgAFAAUABQAFAAUABgAGAAUABgAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUABQAEABcAFwAFAAUABQAFAAUABQAFAAUABQAFAAUACAAGAAYACAAIABcAFwAFAAQABAAIAAYAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAUABQAFAAUABQAAAAAABQAFAAUABQAFAAUAAAAAAAUABQAFAAUABQAFAAAAAAAAAAAAAAAAAAAAAAAAAAUABQAFAAUABQAFAAUAAAAFAAUABQAFAAUABQAFAAAAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAGgAEAAQABAAEAAIAAgACAAIAAgACAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgAFAAUABQAIAAgABgAIAAgABgAIAAgAFwAIAAYAAAAAAEkAiQDJAAkBSQGJAckBCQJJAokCAAAAAAAAAAAAAAAABQAFAAUABQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAAAAAAAAAABQAFAAUABQAFAAUABQAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgARABEAEQARABEAEQARABEAEQARABEAEQARABEAEQARABEAEQARABEAEQARABEAEQARABEAEQARABEAEQARABEABQAFAAUABQAFAAUABQAFAAUABQAFAAUGBQAFAAUABQAFAAUABQDFBwUABQAFAAUAxQUFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAxQYFAMUGBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAMUHBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFABgABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAUABQAFAAUABQAAAAUAAAAFAAUAAAAFAAUAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAgACAAIAAgACAAIAAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACAAIAAgACAAIAAAAAAAAAAAAAAAUABgAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAFQAUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFABkAGwAAAAAABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAXABcAFwAXABcAFwAXABQAFQAXAAAAAAAAAAAAAAAAAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYAFwATABMAFgAWABQAFQAUABUAFAAVABQAFQAUABUAFAAVABcAFwAUABUAFwAXABcAFwAWABYAFgAXABcAFwAAABcAFwAXABcAEwAUABUAFAAVABQAFQAXABcAFwAYABMAGAAYABgAAAAXABkAFwAXAAAAAAAAAAAABQAFAAUABQAFAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAAEAAAAAAABQAFAAUABQAFAAUAAAAAAAUABQAFAAUABQAFAAAAAAAFAAUABQAFAAUABQAAAAAABQAFAAUAAAAAAAAAGQAZABgAGgAbABkAGQAAABsAGAAYABgAGAAbABsAAAAAAAAAAAAAAAAAAAAAAAAAAAAQABAAEAAbABsAAAAAAAAAFwAXABcAGQAXABcAFwAUABUAFwAYABcAEwAXABcASQCJAMkACQFJAYkByQEJAkkCiQIXABcAGAAYABgAFwAaAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgAUABgAFQAYABQAFQAXABQAFQAXABcABQAFAAUABQAFAAUABQAFAAUABQAEAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAQABAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAABQAFAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAAC7ALuEt4S4BLiEuQS5hLoEuoS7BLuIt4i4CLiIuQi5iLoIuoi7CLuAAAAAAAABsAGwAbABsAGwAbABsAGwAbABcAFwAXAAAAAAAAAAAAiwXLBQsGSwaLBssGCwdLB4sHywdLCssMSw/LEUsUyxZLGcsbSx4LgAuIC5ALmAugC6jKB8oHygfKB8oHygzKEcoRyhHKEUoeCogKmAqYCpgKmAqYSnhKmIoGyhFLNEs0izjLPBsAGwAbABsAGwAbABsAGwAbABsAGwAbABsASwXLNBsAGwAbAAAAGwAbABsAGwAbABsAGwAbABsAGwAbABsAAAAAAAAAAADKNEo0igWKBsoRCphKmIqYigbKB8oRSh4KmEp4SpiKBsoHyhFKHgqYSniKeIqYygeKBYoFigXKBcoFygXKBYoGGwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAGAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABgCLBcsFCwZLBosGywYLB0sHiwfLB0sKywxLD8sRSxTLFksZyxtLHguAC4gLkAuYC6ALqAuwC7gAAAAAAAAAAIsFiwbLB8sRAAAAAAAAAAAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAMobBQAFAAUABQAFAAUABQAFAAq4AAAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABgAGAAYABgAGAAAAAAAAAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAABcABQAFAAUABQAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAXAIoFygXKB0oKSh4AAAAAAAAAAAAAAAAAAAAAAAAAAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAAAEkAiQDJAAkBSQGJAckBCQJJAokCAAAAAAAAAAAAAAAAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAAAAAAAAAAAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAAAAAAAAAAAAgACAAIAAgACAAIAAgACAAUABQAFAAUABQAFAAUABQAAAAAAAAAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAFAAUAAAAAAAAABQAAAAAABQAFAAUABQAFAAUABQAAAAAABQAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAAFwCLBcsFCwbLB0sKSx5LeIt4BQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFABsAGwCLBcsFCwZLBosGywdLCgAAAAAAAAAAAAAAAAAAiwXLBQsGSwZLBosGywdLCkseAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAABQAFAAAAAAAAAAAAAACLBYsGywdLCkseBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQCLBcsHSwpLHssFCwYAAAAAAAAXAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAAAAAAAAAAFwBLoEuoS7BLuIt4i4CLiIuQi5iLoIuoi7CLuMt4y4DLiMuQy5jLoMuoy7DLuMs2SzXLNIs0y0ZLNMtOizjLPEtFBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAAAAAAAADLXks0BQAFAIsFywULBksGiwbLBgsHSweLB8sHSwrLDEsPyxFLFMsWAAAAAEseC4ALiAuQC5gLoAuoC7ALuEt4S4BLiEuQS5gLA0sDiwPLA8sHSwpLHkt4SzQAAAAAAAAAAAAAAAAAABcAFwAXABcAFwAXABcAFwAXAAAAAAAAAAAAAAAAAAAABQAGAAYABgAAAAYABgAAAAAAAAAAAAAABgAGAAYABgAFAAUABQAFAAAABQAFAAUAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAAAAAGAAYABgAAAAAAAAAAAAYABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAIsFyxEXAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQCLBcsHSwoFAAUABQAFAAUABgAGAAAAAAAAAAAAiwWLBssHSwpLHhcAFwAXABcAFwAXABcAAAAAAAAAAAAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFABsABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAAAAAXABcAFwAXABcAFwAXAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAAAIsFywULBksGywdLCkseS3gFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAAAAAAAAAAAACLBcsFCwZLBssHSwpLHkt4BQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAAAAAAAAAAAAAAAAAXABcAFwAXAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIsFywULBksGywdLCkseAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAUABQAFAAUABQAFAAUABQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAAAAAAAAAAAAAAAAAACLBYsGywfLEUseS3gFAAUABQAFAAYABgAGAAYAAAAAAAAAAAAAAAAAAAAAAEkAiQDJAAkBSQGJAckBCQJJAokCAAAAAAAAAAAAAAAACwNLA4sDywMLBEsEiwTLBAsFywdLCssMSw/LEUsUyxZLGcsbSx4LgAuIC5ALmAugC6gLsAu4SzTLNIs0izgAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQCLBcsFCwZLBosGywdLCssMSx5LNAUAAAAAAAAAAAAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAYABgAGAAYABgAGAAYABgAGAAYABgCLBcsHSwpLHhcAFwAXABcAFwAAAAAAAAAAAAAAAABLFMsWSxnLG0seS3hJAIkAyQAJAUkBiQHJAQkCSQKJAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAYACAAGAAgABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAYABgAGAAYABgAGAAYAFwAXABcAFwAXABcAFwAAAAAAAAAAAAsDSwOLA8sDCwRLBIsEywQLBcsHSwrLDEsPyxEFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAgACAAIAAYABgAGAAYACAAIAAYABgAXABcAEAAXABcAFwAXAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAAAAAAAAAAAAAAAABJAIkAyQAJAUkBiQHJAQkCSQKJAgAAAAAAAAAAAAAAAAUABQAFAAUABQAFAAUABgAGAAYABgAGAAgABgAGAAYABgAGAAYABgAGAAAASQCJAMkACQFJAYkByQEJAkkCiQIXABcAFwAXAAUACAAIAAAAAAAAAAAAAAAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABgAGAAYABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAYAFwAXAAUAAAAAAAAAAAAAAAAAAAAAAAAACAAFAAUABQAFABcAFwAXABcABgAGAAYABgAXAAAAAABJAIkAyQAJAUkBiQHJAQkCSQKJAgUAFwAFABcAFwAXAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUACAAIAAgABgAGAAYABgAGAAYABgAGAAYACAAAAIsFywULBksGiwbLBgsHSweLB8sHSwrLDEsPyxFLFMsWSxnLG0seS3gAAAAAAAAAAAAAAAAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUACAAIAAgABgAGAAYACAAIAAYACAAGAAYAFwAXABcAFwAXABcABgAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAUAAAAFAAUABQAFAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAFAAUABQAFAAUABQAFAAUABQAFABcAAAAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAIAAgACAAGAAYABgAGAAYABgAGAAYAAAAAAAAAAAAAAEkAiQDJAAkBSQGJAckBCQJJAokCAAAAAAAAAAAAAAAABQAFAAgACAAAAAAABgAGAAYABgAGAAYABgAAAAAAAAAGAAYABgAGAAYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAYABgAIAAgAAAAFAAUABQAFAAUABQAFAAUAAAAAAAUABQAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAABQAFAAUABQAFAAUABQAAAAUABQAAAAUABQAFAAUABQAAAAYABgAFAAgACAAGAAgACAAIAAgAAAAAAAgACAAAAAAACAAIAAgAAAAAAAUAAAAAAAAAAAAAAAAACAAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUACAAIAAgABgAGAAYABgAGAAYABgAGAAgACAAGAAYABgAIAAYABQAFAAUABQAXABcAFwAXABcASQCJAMkACQFJAYkByQEJAkkCiQIAABcAAAAXAAYAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAgACAAIAAYABgAGAAYABgAGAAgABgAIAAgACAAIAAYABgAIAAYABgAFAAUAFwAFAAAAAAAAAAAAAAAAAAAAAABJAIkAyQAJAUkBiQHJAQkCSQKJAgAAAAAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAgACAAIAAYABgAGAAYAAAAAAAgACAAIAAgABgAGAAgABgAGABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXABcAFwAFAAUABQAFAAYABgAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAIAAgACAAGAAYABgAGAAYABgAGAAYACAAIAAYACAAGAAYAFwAXABcABQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAASQCJAMkACQFJAYkByQEJAkkCiQIAAAAAAAAAAAAAAAAXABcAFwAXABcAFwAXABcAFwAXABcAFwAXAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAASQCJAMkACQFJAYkByQEJAkkCiQIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAGAAgABgAIAAgABgAGAAYABgAGAAYACAAGAAAAAAAAAAAAAAAAAAAAAAAIAAgABgAGAAYABgAIAAYABgAGAAYABgAAAAAAAAAAAEkAiQDJAAkBSQGJAckBCQJJAokCywdLChcAFwAXABsABQAFAAUABQAFAAUABQAFAAUABQAFAAUACAAIAAgABgAGAAYABgAGAAYABgAGAAYACAAGAAYAFwAAAAAAAAAAAEkAiQDJAAkBSQGJAckBCQJJAokCywdLCssMSw/LEUsUyxZLGcsbAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAYABgAGAAYABgAGAAgABQAGAAYABgAGABcAFwAXABcAFwAXABcAFwAGAAAAAAAAAAAAAAAAAAAAAAAFAAYABgAGAAYABgAGAAgACAAGAAYABgAFAAUABQAFAAUABgAGAAYABgAGAAYABgAGAAYABgAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAXABcAFwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABQAFAAUABQAAAAAABQAFAAUABQAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAgABgAGABcAFwAXAAUAFwAXAAUAFwAXABcAFwAXAAAAAAAAAAAAAAAAAAAAAAAAAAAASQCJAMkACQFJAYkByQEJAkkCiQKLBcsFCwZLBosGywYLB0sHiwfLB0sKywxLD8sRSxTLFksZyxtLHgAAAAAAABcAFwAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUACAAGAAYABgAGAAYABgAGAAAABgAGAAYABgAGAAYACAAGAAYABgAGAAYABgAGAAYABgAAAAgABgAGAAYABgAGAAYABgAIAAYABgAIAAYABgAAAAAAAAAAAAAAAAAAAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAAAAAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAUABgAAAAAAAAAAAAAAAAAAAAAASQCJAMkACQFJAYkByQEJAkkCiQIAAAAAAAAAAAAAAAAFAAUABQAFAAUABQAFAAAABQAFAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAGAAYABgAGAAYABgAAAAAAAAAGAAAABgAGAAAABgAFAAUABQAFAAUABQAFAAUABQAFAAgACAAIAAgACAAAAAYABgAAAAgACAAGAAgABgAFAAAAAAAAAAAAAAAAAAAABQAFAAUABQAFAAUAAAAFAAUAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAYABgAIAAgAFwAXAAAAAAAAAAAAAAAAAAAAyjRKNco0yjRKNIo0ijhKD8oRSgaKBsoGCgdKB4oHAAAXABcAFwAXABcAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMoFCgZKBooGygYKB0oHigcKBkoGigbKBgoHSgeKB0oGigbKBgoHSgeKB4oFygUKBkoGigbKBgoHSgeKB4oFygUKBkoGigbKBQoGCgZKBooGygYKB0oHigeKBcoFCgYKBkoGigaKwIrBigXKBQoGCgZKBooGCgYKBkoGSgZKBkoGygYKBwoHCgdKB0oHigeKB4oHigfKBQoGSgaKBsoGigXKBQoGSgZKBooGigbKBQoGigXKBYo0ijhKRYo0ijjKNQUABQAFAAUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEkAiQDJAAkBSQGJAckBCQJJAokCAAAAAAAAAAAXABcAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAAAAYABgAGAAYABgAXAAAAAAAAAAAAAAAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAGAAYABgAGAAYABgAGABcAFwAXABcAFwAbABsAGwAbAAQABAAEAAQAFwAbAAAAAAAAAAAAAAAAAAAAAAAAAAAASQCJAMkACQFJAYkByQEJAkkCiQIAAMsHSx6LeAt5i3kLeot6AAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAAAAAAAAAABQAFAAUASwWLBcsFCwZLBosGywYLB0sHiwfLBwsISwiLCMsICwlLCYsJywkLCosFywULBhcAFwAXABcAAAAAAAAAAAAAAAUABQAFAAUABQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABQAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABgAGAAYABgAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAAAAAAAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAAAAAAAAAAAAAAAAUABQAFAAUABQAFAAUABQAFAAUAAAAAABsABgAGABcAEAAQABAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABsAGwAbABsAGwAbABsAAAAAABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbAAgACAAGAAYABgAbABsAGwAIAAgACAAIAAgACAAQABAAEAAQABAAEAAQABAABgAGAAYABgAGAAYABgAGABsAGwAGAAYABgAGAAYABgAGABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsABgAGAAYABgAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAbABsABgAGAAYAGwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAASwWLBcsFCwZLBosGywYLB0sHiwfLBwsISwiLCMsICwlLCYsJywkLCgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIsFywULBksGiwbLBgsHSweLB8sHSwrLDEsPyxFLFMsWSxnLG4sFywULBksGiwaLBYsGAAAAAAAAAAAAAAAAAABJAokCSQCJAMkACQFJAYkByQEJAkkCiQJJAIkAyQAJAUkBiQHJAQkCSQKJAkkAiQDJAAkBSQGJAckBCQJJAokCAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAIAAgACAAIAAgACAAIAAAACAAIAAgACAAIAAgACAAIAAgACAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAQAAAAEAAQAAAAAAAQAAAAAAAQABAAAAAAABAAEAAQABAAAAAQABAAEAAQABAAEAAQABAAIAAgACAAIAAAACAAAAAgACAAIAAgACAAIAAgAAAAIAAgACAAIAAgACAAIAAgACAAIAAgABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAIAAgACAAIAAQABAAAAAQABAAEAAQAAAAAAAQABAAEAAQABAAEAAQABAAAAAQABAAEAAQABAAEAAQAAAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgABAAEAAAABAAEAAQABAAAAAQABAAEAAQABAAAAAQAAAAAAAAABAAEAAQABAAEAAQABAAAAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAgACAAIAAgACAAIAAAAAAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAGAACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACABgAAgACAAIAAgACAAIAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQAYAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACABgAAgACAAIAAgACAAIAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQACAAIAAgAYAAIAAgACAAIAAgACAAEAAgAAAAAASQCJAMkACQFJAYkByQEJAkkCiQJJAIkAyQAJAUkBiQHJAQkCAAAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAbABsAGwAbAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAbABsAGwAbABsAGwAbABsABgAbABsAGwAbABsAGwAbABsAGwAbAAYAGwAbABcAFwAXABcAFwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGAAYABgAGAAYABgAGAAYAAAAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYAAAAAAAYABgAGAAYABgAGAAYAAAAGAAYAAAAGAAYABgAGAAYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABQAFAAUABQAFAAAAAACLBcsFCwZLBosGywYLB0sHiwcGAAYABgAGAAYABgAGAAAAAAAAAAAAAAAAAAAAAAAAAAIAAgACAAIABgAGAAYABgAGAAYABgAAAAAAAAAAAAAASQCJAMkACQFJAYkByQEJAkkCiQIAAAAAAAAAABcAFwABAAEAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIsFywULBksGiwbLBgsHSweLB8sHSwrLDEsPyxFLFMt4S3lLgYsFywULBksGiwbLBgsHSweLBxsAyzRLNMs8GQCLBcsFi3jLeAAAAAAAAAAAAAAAAAAAAAAAAAAAAADLFksZyxtLHguAC4gLkAuYC6ALqAuwC7hLeEuAS4hLkEuYS6BLqEuwS7iLeIuAi4iLkIuYi6CLqIuwi7jLeMuAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAYABgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUABQAFAAUAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAUABQAAAAUAAAAAAAUAAAAFAAUABQAFAAUABQAFAAUABQAFAAAABQAFAAUABQAAAAUAAAAFAAAAAAAAAAAAAAAAAAUAAAAAAAAAAAAFAAAABQAAAAUAAAAFAAUABQAAAAUABQAAAAUAAAAAAAUAAAAFAAAABQAAAAUAAAAFAAAABQAFAAAABQAAAAAABQAFAAUABQAAAAUABQAFAAUABQAFAAUAAAAFAAUABQAFAAAABQAFAAUABQAAAAUAAAAFAAUABQAFAAUABQAFAAUABQAFAAAABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAAAAAAAAAAAAAAFAAUABQAAAAUABQAFAAUABQAAAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAAAAAAAAAAABsAGwAbABsAGwAbABsAGwAbABsAGwAbAAAAAAAAAAAAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAAAAAAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAAAAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwDLAssCCwNLA4sDywMLBEsEiwTLBAsFSwVLBQAAAAAAABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAAAAAAAAAAAAAAAAAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAAAAAAAAAAABsAGwAbABsAGwAbABsAGwAbAAAAAAAAAAAAAAAAAAAAGwAbAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAbABsAGwAbABsAGwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGgAaABoAGgAaABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbAAAAAAAAABsAGwAbABsAGwAbABsAGwAbABsAAAAAAAAAAAAAAAAAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAAAAAAAAAAAAAAAAAAABsAGwAbABsAGwAbABsAGwAAAAAAAAAAAAAAAAAAAAAAGwAbABsAGwAbABsAGwAbABsAGwAAAAAAAAAAAAAAAAAbABsAGwAbABsAGwAbABsAAAAAAAAAAAAAAAAAAAAAABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAbABsAGwAAAAAAGwAbABsAGwAAAAAAAAAbAAAAGwAbABsAGwAbABsAGwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABsAGwAbABsAGwAbABsAGwAbABsAAAAAAAAAAAAAAAAABQAFBwUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAEUGBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAEUGBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAhQYFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQDFDAUABQAFAAUABQAFAAUABQBFDwUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAEUPBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQDFBgUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUGBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQYFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQYFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFBgUABQAFAAUABQAFAAUABQAFAAUABQAFAAUARQYFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAIUHBQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAYABgAGAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEQARABEAEQARABEAEQARABEAEQARABEAEQARABEAEQARABEAEQARABEAEQARABEAEQARABEAEQARABEAAAAAAAAAAAAAAAAAAAAAAAAAAACrACAAuwAAABUiIAQfIuAEICLgAyEioAMiIsADJCLABEMiIAJFIkABTCIgAZgiAASmIkAEqCKABKkiYASrIqAEuCKAA80iAAHyIuAC8yIAA/QiIAP2IkAD9yJgA/oiQAL7ImAC/CKAAv0ioAL+IsAC3CcAApspoACgKcAAoymAALgpYAH1KUAA3iqAAeMqwAHkKqAB5SrgAe4q4AD+K2AAbwN3A38DhwOfA6cDrwO3A48DlwOPA5cDjwOXA48DlwOPA5cDjwOXA70DxQPNA9UD3QPlA+ED6QPxA/kD9AP8A48DlwOPA5cDBAQMBI8DlwOPA5cDjwOXAxIEGgQiBCoEMgQ6BEIESgRQBFgEYARoBHAEeAR+BIYEjgSWBJ4EpgSyBK4EugTCBCQE0gTaBMoE4gTkBOwE9AT8BP0EBQUNBRUF/QQdBSIFFQX9BCoFMgX8BDoFQgX0BEcFjwNPBVMFWwVdBWUFbQX8BHUFfQX0BAYEgQUFBfQEjwOPA4kFjwOPA48FlwWPA48DmwWjBY8DpwWuBY8DtgW+BcUFRgWPA48DzQXVBd0F5QWPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwPtBY8D9QWPA48DjwP9BY8DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DBQaPA48DjwMNBg0GCQUJBY8DEwYbBvUFMQYjBiMGOQZABikGjwOPA48DSAZQBo8DjwOPA1IGWgZiBo8DaQZxBo8DeQaPA48DOQWBBkcFiQYGBJEGjwOYBo8DnQaPA48DjwOPA6MGqwaPA48DjwOPA48DjwPdA7MGjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwO7BsMGxwbfBuUGzwbXBu0G9Qb5BsgFAQcJBxEHjwMZB1oGWgZaBikHMQc5B0EHRgdOB1YHIQdeB2YHjwNsB3MHWgZaBloGWgZzBXkHWgaBB48DjwNXBloGWgZaBloGWgZaBloGWgZaBloGWgZaBloGiQdaBloGWgZaBloGjwdaBloGlwefB48DjwOPA48DjwOPA48DjwNaBloGWgZaBq8Htwe/B6cHzwfXB98H5gftB/UH+QfHB1oGWgZaBgEIBwhaBg0IEAiPA48DjwOPA48DjwOPAxgIjwOPA48DIAiPA48DjwPdAygIMAg1CI8DPQhaBloGXQZaBloGWgZaBloGWgZECEoIWghSCI8DjwNiCP0FjwO2A48DjwOPA48DjwOPA1oGHwjEA48DOQhqCI8Dcgh6CI8DjwOPA48DfgiPA48DUga1A48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwNaBloGjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPAzkIWgZzBY8DjwOPA48DjwOPA48DjwOPA4UIjwOPA4oIXQWPA48DqQVaBlEGjwOPA5IIjwOPA48DmgihCCMGqQiPA48DfwWxCI8DuQjACI8D4gTFCI8D+wSPA80I1Qj9BI8D2Qj8BOEIjwOPA48DjwOPA48DjwPoCI8DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwP8CPAI9AiOBI4EjgSOBI4EjgSOBI4EjgSOBI4EjgSOBI4EBAmOBI4EjgSOBAwJEAkYCSAJJAksCY4EjgSOBDAJOAl/A0AJSAmPA48DjwNQCY8DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwM8DjwOfA68DjwOPA48DjwOPA48DvQONA90D4QPxA/QDzwOPA4QEDwOPA48DkgQiBDIEAgRQBGAEcAR+BE4EngSQAqACsAK/wqgAaABoAGgAaABoAGgAaABoAE3C6ABoAGgAaABoAGgAaABoAGgAXQLoAGgAakL6QspDGkMqQzpDKABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABKQ2gAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgASkNoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAEpDaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABKQ2gAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgASkNoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAEpDaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABKQ2gAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgASkNoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAEpDaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABKQ2gAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgASkNoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAEpDWkNeQ2gAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABKQ2gAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgASkNoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAGgAaABoAEpDY8DjwOPA48DjwOPA48DjwNYCY8DWgZaBmAJ/QWPA/UEjwOPA48DjwOPA48DjwNoCY8DjwOPA28JjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DJAQkBCQEJAQkBCQEJAQkBHcJJAQkBCQEJAQkBCQEJAR/CYMJJAQkBCQEJASTCYsJJASbCSQEJASjCakJJAQkBCQEJAQkBCQEJAQkBCQEJAS5CbEJJAQkBCQEJAQkBCQEJAQkBCQEwQkkBCQEJAQkBCQEyQnQCdYJJAQkBCQEJAT8BN4J5QnsCQYE7wmPA48D4gT2CY8D/AkGBAEKCQqPA48DDgqPA48DjwOPAyAIFgoGBIEFXAUdCo8DjwOPA48DjwPeCSUKjwOPAy0KNQqPA48DjwOPA48DjwM5CkEKjwOPA0kKXAVRCo8DVwqPA48D7QVfCo8DjwOPA48DjwOPA2QKjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA2wKcAp4Co8DfwqPA48DjwOPA48DjwOPA48DjwOPA48DjwOGCo8DjwOUCo4KjwOPA48DnAqkCo8DqAqPA48DjwOPA48DjwOPA48DjwOPA4MFjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA64KjwO0Co8DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DugqPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwMWBcIKjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA8kK0QrXCo8DjwNaBloG3wqPA48DjwOPA48DWgZaBjMIjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48D4QqPA+gKjwPkCo8D6wqPA/MK9wqPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA90D/wrdAwYLDQsVC48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPAx0LJQuPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DJAQkBCQEJAQkBCQELQskBDULNQs8CyQEJAQkBCQEJAQkBCQEJAQkBCQEJAQkBCQEJAQkBCQEJAQkBCQEJAQkBCQEJAQkBPQIjgSOBCQEJAQkBCQEJAQkBCQEJAQkBCQEjgSOBI4EjgSOBI4EjgRECyQEJAQkBCQEJAQkBCQEJARaBkwLWgZaBl0GUQtVC0QIXQuxA48DYwuPA48DjwOPA48DjwOPA2oHjwOPA48DjwNaBloGWgZaBloGWgZaBloGWgZaBloGWgZaBloGWgZaBloGWgZaBloGWgZaBloGWgZaBloGWgZaBloGWgZrC3MLWgZaBloGXQZaBloGewuPA0wLWgaDC1oGiwtGCI8DjwNMC48LWgaXC1oGnwunC1oGjwOPA48DRgiPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA68LjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48DjwOPA48Drwu/C7cLtwu3C8ALwAvAC8AL3QPdA90D3QPdA90D3QPIC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALwAvAC8ALbgNuA24DEgASABIAEgASABIAEgASABIACAAHAAgACQAHABIAEgASABIAEgASABIAEgASABIAEgASABIAEgAHAAcABwAIAAkACgAKAAQABAAEAAoACgAKMQryCgADAAYAAwAGAAYAAgACAAIAAgACAAIAAgACAAIAAgAGAAoAClAKAArQCgAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKUQoACtIKAAoACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAClEKAArSCgASAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEgASABIAEgASAAcAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASAAYACgAEAAQABAAEAAoACgAKAAoAAAAKkAoAsgAKAAoABAAEAAIAAgAKAAAACgAKAAoAAgAAAAqQCgAKAAoACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACgAKAAAAAAAAAAAAAAAAAAAACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAAAAAAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoAAAAAAAAAAAAAAAoACgAKAAoACgAKAAoACgAKAAAACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAAAAAAAAAAAAKAAoAAAAAAAAAAAAAAAAAAAAAAAoAAAAAAAAAAAAAAAoACgAAAAoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQCxALEAsQCxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoAAAAAAAoACgAEAAEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAAQCxAAEAsQCxAAEAsQCxAAEAsQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEABQAFAAUABQAFAAUACgAKAA0ABAAEAA0ABgANAAoACgCxALEAsQCxALEAsQCxALEAsQCxALEADQCtCA0ADQANAE0ADQCNAI0AjQCNAE0AjQBNAI0ATQBNAE0ATQBNAI0AjQCNAI0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQAtAE0ATQBNAE0ATQBNAE0AjQBNAE0AsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEABQAFAAUABQAFAAUABQAFAAUABQAEAAUABQANAE0ATQCxAI0AjQCNAA0AjQCNAI0ATQBNAE0ATQBNAE0ATQBNAI0AjQCNAI0AjQCNAI0AjQCNAI0AjQCNAI0AjQCNAI0AjQCNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQCNAE0ATQCNAI0AjQCNAI0AjQCNAI0AjQBNAI0ATQCNAE0ATQCNAI0ADQCNALEAsQCxALEAsQCxALEABQAKALEAsQCxALEAsQCxAA0ADQCxALEACgCxALEAsQCxAI0AjQACAAIAAgACAAIAAgACAAIAAgACAE0ATQBNAA0ADQBNAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAK0AjQCxAE0ATQBNAI0AjQCNAI0AjQBNAE0ATQBNAI0ATQBNAE0ATQBNAE0ATQBNAE0AjQBNAI0ATQCNAE0ATQCNALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEADQANAI0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAI0AjQCNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAI0AjQBNAE0ATQBNAI0ATQCNAI0ATQBNAE0AjQCNAE0ATQBNAE0ATQBNAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQCxALEAsQCxALEAsQCxALEAsQCxALEADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0AAQABAAEAAQABAAEAAQABAAEAAQBBAEEAQQBBAEEAQQBBAEEAQQBBAEEAQQBBAEEAQQBBAEEAQQBBAEEAQQBBAEEAQQBBAEEAQQBBAEEAQQBBAEEAQQCxALEAsQCxALEAsQCxALEAsQABAAEACgAKAAoACgAhAAEAAQCxAAEAAQCxALEAsQCxAAEAsQCxALEAAQCxALEAsQCxALEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAsQCxALEAsQABALEAsQCxALEAsQCBAEEAQQBBAEEAQQCBAIEAQQCBAEEAQQBBAEEAQQBBAEEAQQBBAEEAgQBBAAEAAQABALEAsQCxAAEAAQABAAEATQANAE0ATQBNAE0ADQCNAE0AjQCNAA0ADQANAA0ADQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABALEAsQAFALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQBNAE0ATQBNAE0ATQBNAE0ATQBNAI0AjQCNAA0AjQBNAE0AjQCNAE0ATQANAE0ATQBNAI0ATQBNAE0ATQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQAAALEAAAAAAAAAAACxALEAsQCxALEAsQCxALEAAAAAAAAAAACxAAAAAAAAALEAsQCxALEAsQCxALEAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQAAAAAAAAAAALEAsQCxALEAAAAAAAAAAAAAAAAAAAAAALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAEAAAAAAAAAAAAAAAAAAAABAAAAAAAsQAAAAAAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQAAAAAAAAAAALEAsQAAAAAAsQCxALEAAAAAAAAAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAAAAAAAAAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQCxAAAAsQCxAAAAAAAAAAAAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQCxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxAAAAAACxAAAAsQCxALEAsQAAAAAAAAAAAAAAAAAAAAAAsQAAAAAAAAAAAAAAAAAAAAAAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoACgAKAAoACgAKAAQACgAAAAAAAAAAAAAAsQAAAAAAAACxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQCxAAAAAAAAAAAAAACxALEAsQAAALEAsQCxALEAAAAAAAAAAAAAAAAAAACxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACgAKAAoACgAKAAoACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQAAAAAAoAAAAAAAAAAAAAAAAACgAAAAAAAAAAAAAACxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAAAAAAAAAAAAAAAAAAACxALEAsQAAALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQAAAAAAsQCxALEAsQCxALEAsQAAAAAAAAAAAAQAAAAAAAAAAAAAAAAAAACxALEAsQCxALEAsQCxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQAAAAAAsQCxALEAsQCxALEAAACxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQCxALEAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAAACxAAAAsQAKMQryCjEK8gAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxAAAAsQCxALEAsQCxAAAAsQCxAAAAAAAAAAAAAACxALEAsQCxALEAsQCxALEAsQCxALEAAACxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAsQCxAAAAsQCxALEAsQCxALEAAACxALEAAAAAALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQAAAAAAAAAAALEAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAAAAAALEAsQAAAAAAAAAAAAAAAACxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoACgAKAAoACgAKAAoACgAKAAoAAAAAAAAAAAAAAAAACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoxCvIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxAAAAsQCxALEAsQCxALEAsQAAAAAAAAAAAAAAAAAAAAAAsQAAAAAAsQCxALEAsQCxALEAsQCxALEAsQCxAAAAAAAAAAAAAAAAAAAABAAAALEAAAAAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAALEAQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAAoACgAKAAoACgAKAEoACgAKACoAsQCxALEAEgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQAAAAAAAAAAAAAAAAAAAAAAAsQCxAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAsQCxALEAAAAAAAAAAACxALEAAAAAAAAAAAAAAAAAAAAAAAAAsQAAAAAAAAAAAAAAAACxALEAsQAAAAAAAAAAAAoAAAAAAAAACgAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAAAAAALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxAAAAsQCxALEAsQCxALEAsQAAALEAAACxAAAAAACxALEAsQCxALEAsQCxALEAAAAAAAAAAAAAAAAAsQCxALEAsQCxALEAsQCxALEAsQAAAAAAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAAACxALEAsQCxALEAAACxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAsQCxALEAsQCxALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQAAAAAAsQCxAAAAsQCxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAAACxALEAAAAAAAAAsQAAALEAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAsQCxALEAsQCxALEAAAAAALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQCxAAAAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQAAALEAsQCxALEAsQCxALEAAAAAAAAAAACxAAAAAAAAAAAAAAAAALEAAAAAAAAAsQCxAAAAAAAAAAAAAAAAALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQAAALEAsQCxALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACgAAAAoACgAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAAoACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoACgAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACgAKAAAACgAKAAoACgAGAAoxCvIKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAJALIAsgCyALIAsgASABQIFQgTCBYIsgCyALIAsgCyALIAAgAAAAAAAAACAAIAAgACAAIAAgADAAMACgAKMQryAAAJAAkACQAJAAkACQAJAAkACQAJAAkAsgASBDIEoAihCAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACQAHAKsIrgiwCKwIrwgGAAQABAAEAAQABAAKAAoACgAKAAowCvAKAAoACgAKAAoAAgACAAIAAgACAAIAAgACAAIAAgADAAMACgAKMQryAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABACxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxAAoACgAAAAoACgAKAAoAAAAKAAoAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAAAACgAKAAoAAAAAAAAAAAAAAAoACgAKAAoACgAKAAAACgAAAAoAAAAKAAAAAAAAAAAABAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACgAKAAAAAAAAAAAAChAKAAoACgAKAAAAAAAAAAAAAAAKAAoACgAKAAAAAAAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAAAAAAAAAAAAAAAAAAAAAAAAAoACgAKAAAAAAAAAAAACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKMArwCjAK8AowCvAKMArwCjAK8AowCvAKMArwCgAKAAowCvAKkAqQCpAKEAqQCpAKEAoQCpAKkAqQCpAKkAoQCgAKEAoQChAKEAoACgAKAApwCnAKcAqwCrAKsAoACgAKAAoQAwAEAAoACpAKEAoACgAKAAoQChAKEAoQCgAKkAqQCpAKkAoACpAKAAoQCgAKAAoACgAKEAoQChAKEAoQChAKEAoQChAKAAoACgAKAAoAChAKAAoQCjAK8AoQChAKEAoQChAKkAoQCpAKEAoQChAKEAoQChAKkAoACgAKAAoACgAKMArwCjAK8AoACgAKAAoACgAKAAoACgAKAAoQChAKAAoQCgAKMArwCjAK8AowCvAKMArwCgAKAAowCvAKMArwCjAK8AowCvAKMArwCjAK8AowCvAKMArwCjAK8AoQCgAKAAowCvAKMArwCgAKAAoACgAKAAqQCgAKAAoACgAKAAoACgAKAAoACjAK8AoACgAKkAoQCpAKkAoQCpAKEAoQChAKEAowCvAKMArwCjAK8AowCvAKkAoACgAKAAoACgAKEAoQCgAKAAoACgAKAAoACgAKAAoACjAK8AowCvAKkAoACgAKMArwCgAKAAoACgAKMArwCjAK8AowCvAKMArwCjAK8AoACgAKAAoACgAKAAoACgAKMQryCjEK8goACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKEAoQCgAKAAoACgAKAAoACgAKMQryCgAKAAoACgAKAAoACgAKAAoACgAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAAACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAAoACgAKAAoACgAKAAoAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAAAAAAAAAAACgAKAAoACgAKAAoACgAKAAoACgAKAAoAAAAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoxCvIKMQryCjEK8goxCvIKMQryCjEK8goxCvIKAAoACgAKAAoACgAKAAoACgAKAAoQCgAKAAowCvAKMQryCgAKMArwCgAKUAoQCtAKAAoACgAKAAoAChAKEAowCvAKAAoACgAKAAoACpAKMArwCgAKAAoACjAK8AowCvAKMQryCjEK8goxCvIKMQryCjEK8goACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKEAoAChAKEAoQCgAKAAowCvAKAAoACgAKAAoACgAKAAoACgAKAAoQCpAKEAoQCjAK8AoACgAKMQryCgAKAAoACgAKAAoxCvIKMQryCjEK8goxCvIKMQryCnEKMgrxCrIKMQryCjEK8goxCvIKMQryCgAKAAqQChAKEAoQChAKkAoAChAKkAowCvAKEAoQCjAK8AowCvAKMArwCjAK8AoACgAKAAoACgAKAAoACgAKkAoACgAKAAoACgAKAAoACjAK8AoQChAKMArwCgAKAAoAChAKAAoACgAKAAoQCjAK8AowCvAKAAowCvAKAAoACjEK8goxCvIKEAoACgAKAAoACgAKEAqQCpAKkAoQCgAKAAoACgAKAAowCvAKkAoACgAKAAoAChAKAAoACgAKMArwCjAK8AoQCgAKEAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoQChAKEAoQChAKEAoQChAKEAoQChAKEAoQChAKEAoQChAKEAoQCgAKEAoQChAKEAoACgAKEAoAChAKAAoAChAKAAowCvAKMArwCgAKAAoACgAKAAowCvAKAAoACgAKAAoACgAKMArwChAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKEAoQCgAKAAoACgAKAAoACgAKMArwCgAKAAoACgAKEAoQChAKEAoAChAKEAoACgAKEAoQCgAKAAoACgAKMArwCjAK8AowCvAKMArwCjAK8AowCvAKMArwCjAK8AowCvAKMArwCjAK8AowCvAKMArwCjAK8AowCvAKMArwCjAK8AowCvAKMArwChAKAAoACjAK8AowCvAKMArwCjAK8AoACjAK8AowCvAKMArwCjAK8AowCvAKMArwCjAK8AowCvAKMArwCjAK8AowCvAKMArwCgAKAAoACgAKAAoQCgAKkAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAAAAAAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAAAAAACgAKAAoACgAKAAoACgAKAAoAAAAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACpAAAAAAAAAAAAAAAAAKAAoACgAKAAoACgAAAAAAAAAAALEAsQCxAAAAAAAAAAAAAAAAAAAACgAKAAoACgAKAAoACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEACgAKAAowCvAKMArwCgAKAAoACjAK8AoACjAK8AoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKMArwCgAKAAowCvAKMQryCjEK8goxCvIKMQryCgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAAACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAAAAAAAAAAACgAAAAAAAAAAAAAAAAAAAAAAAACxALEAsQCxAAAAAAAKAAAAAAAAAAAAAAAKAAoAAAAAAAAAAAAAAAoACgAKAAkACgAKAAoACgAAAAAAAAAKMQryCjEK8goxCvIKMQryCjEK8goACgAKMQryCjEK8goxCvIKMQryCgAKAAoACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQAKAAoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAAoACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAAoACgAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAAoACgAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAAoACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQCxALEACgCxALEAsQCxALEAsQCxALEAsQCxAAoACgAAAAAAAAAAAAAAAAAAAAAACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAAAAAAAAAsQAAAAAAAAAAALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxAAAACgAKAAoACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAQAAAAAAAAAAAAAAAAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAYAAAAAoACgAKAAoAAAAAAAAAAAAAAAAAAAAAALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQAAAAAAAAAAAAAAAACxALEAsQCxALEAsQCxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQCxALEAsQCxALEAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAAAAAALEAsQCxALEAAAAAALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQCxALEAAAAAALEAsQAAAAAAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAAAAAAAAAAAAAAAAAAAAAALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxAAAAsQCxALEAAAAAALEAsQAAAAAAAAAAAAAAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQAAAAAAAAAAAAAAAAAAAAAAsQAAAAAAAAAAAAAAAAAAAAAAAAAAALEAAAAAALEAAAAAAAAAAACxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAQABAAEAAQABAAEAAQABAAMAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABALEAAQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQAKAAoADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ACgANAA0AsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQAKAAoACgAKAAoACgAKAAoACgAKAAAAAAAAAAAAAAAAALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAGAAoABgAAAAoABgAKAAoACgAKMQryCjEK8goxCvIEAAoACgADAAMACjAK8AoAAAAKAAQABAAKAAAAAAAAAAAADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQCyAAAACgAKAAQABAAEAAoACgAKMQryCgADAAYAAwAGAAYAAgACAAIAAgACAAIAAgACAAIAAgAGAAoAClAKAArQCgAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKUQoACtIKAAoxCvIKAAoxCvIKAAoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQABAAKAAoACgAEAAQAAAAKAAoACgAKAAoACgAKAAAAEgASABIAEgASABIAEgASABIAqgCqAKoACgAKABIAEgAAAAoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAAAAAAAAAKAAoACgAKAAoACgAKAAoACgAKAAoACgAAAAAAAAAAALEAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAsQCxALEAAAAAAAAAAAAAAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEACgABALEAsQCxAAEAsQCxAAEAAQABAAEAAQCxALEAsQCxAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABALEAsQCxAAEAAQABAAEAsQBBAIEAAQABAIEAsQCxAAEAAQABAAEAQQBBAEEAQQCBAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAQQBBAEEAQQBBAIEAAQCBAAEAgQCBAAEAAQBhAIEAgQCBAIEAgQBBAEEAQQBBAGEAQQBBAEEAQQBBAIEAQQBBAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEACgAKAAoACgAKAAoACgBBAIEAQQCBAIEAgQBBAEEAQQCBAEEAQQCBAEEAgQCBAEEAgQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQCBAIEAgQCBAEEAQQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEATQBNAI0ATQCxALEAsQCxAA0ADQANAA0ADQANAA0ADQAFAAUABQAFAAUABQAFAAUABQAFAA0ADQANAA0ADQANAG0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAUABQAFAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQBNAE0ATQCNAE0ATQBNAE0ATQBNAE0ATQBNAE0ATQBNAE0ADQCxALEAsQCxALEAsQCxALEAsQCxALEATQBNAE0AjQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQCxALEAsQCxALEAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQAAAAAAsQCxAAAAAAAAAAAAAAAAAAAAAACxALEAsQCxALEAAACxALEAsQCxALEAsQCxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQCxALEAsQCxALEAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAAAAAALEAAACxALEAAAAAAAAAAAAAAAAAsQAAAAAAAAAAALEAsQCxALEAsQCxALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQCxALEAsQAAAAAAAACxALEAsQCxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAsQAAALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQCxALEAsQCxAAAAsQAAAAAAAAAAALEAsQAAALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAsQCxAAAAAAAAAAAAAAAAALEAsQAAALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQCxALEAsQCxAAAAAACxAAAAsQAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQAAALEAAAAAALEAsQCxALEAsQCxAAAAsQAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQCxALEAAACxALEAsQCxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQCxALEAsQCxALEAsQCxAAAAsQCxAAAAAAAAAAAAAAAAALEAsQCxALEAsQCxAKAAoACxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQCxALEAAAAAALEAsQCxALEAAAAAAAAAAAAAAAAAAAAAALEAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQCxALEAAAAAALEAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQAAALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAsQCxALEAsQCxAAAAsQCxALEAsQCxALEAAACgALEAsQCxALEAsQCxALEAsQAAAAAAsQCxALEAsQCxALEAsQAAALEAsQAAALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQCxALEAAAAAAAAAsQAAALEAsQAAALEAsQCxALEAsQCxALEAAACxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQAAAAAAAACxAAAAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQCxALEAsQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQCxALEAsQCxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsgCyALIAsgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAALEAsQCxAAAAAAAAAAAAAAAAAAAAAAAAALIAsgCyALIAsgCyALIAsgCxALEAsQCxALEAsQCxALEAAAAAALEAsQCxALEAsQCxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoACgCxALEAsQAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKEAAAAAAAAAAAAAAAAAAAAAAAAAAAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgACAAIAAgCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAAAAAAAAAAACxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAAAAAAAAAAAAAAAAAAAAAALEAAAAAAAAAAAAAAAAAAAAAAAAAAACxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAsQCxALEAsQCxAAAAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACxALEAsQCxALEAsQCxAAAAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxAAAAAACxALEAsQCxALEAsQCxAAAAsQCxAAAAsQCxALEAsQCxAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAsQCxALEAsQCxALEAsQABAAEAAQABAAEAAQABAAEAAQBBAEEAQQBBAEEAQQBBAEEAQQBBAEEAQQBBAEEAQQBBAEEAQQBBAEEAQQBBAEEAQQBBAEEAQQBBAEEAQQBBAEEAsQCxALEAsQCxALEAsQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQABAAEAAQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAAoACgANAA0ADQANAA0ADQANAA0ADQANAA0ADQANAA0ACgAKAAoACgAKAAoACgAKAAoACgAKAAoAAAAAAAAAAAAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAAAAAAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAAAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAIAAgACAAIAAgACAAIAAgACAAIAAgAKAAoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACgAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAAAAAAAAAKAAoACgAKAAoACgAKAAoACgAKAAAAAAAAAAAAAAAAAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoAAAAAAAAAAAAAAAAAAAAKAAoACgAKAAoACgAKAAoAAAAAAAAAAAAAAAAAAAAAAAoACgAKAAoACgAKAAoACgAKAAoAAAAAAAAAAAAAAAAACgAKAAoACgAKAAoACgAKAAAAAAAAAAAAAAAAAAAAAAAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAAACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAAAAAAKAAoACgAKAAAAAAAAAAoAAAAKAAoACgAKAAoACgAKAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACgAKAAoACgAKAAoACgAKAAoACgAAAAAAAAAAAAAAAAAKAAoACgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoACgAKAAoAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEgASALIAsgCyALIAsgCyALIAsgCyALIAsgCyALIAsgCyALIAsgCyALIAsgCyALIAsgCyALIAsgCyALIAsgCyALIAsgASALIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAEgCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxALEAsQCxABIAEgASABIAEgASABIAEgASABIAEgASABIAEgASABIAAAAAAAAAAAAAAAAAAAAAAMARAQBREgEAsBABAAAAAADAEQEA/hEBAMAQAQAAAAAAmBEBAB8SAQDAEQEALBIBAKAQAQAAAAAAwBEBAJcSAQCwEAEAAAAAAMARAQBzEgEA2BABAAAAAAABAAAAAgAAAJACAADAAwAA4BEBAOARAQCwAQAAwAMAAOARAQDgEQEAYAMAAJADAADgEQEA4BEBAAADAAAwAwAA4BEBAOARAQDAAgAAUAIAAOkRAQDwEQEAkAIAAOABAADgEQEA5REBACACAABQAgAA6REBAPARAQCwAQAA4AEAAOARAQDlEQEAABAAAACAAAAACAAAAEAAAAAAAACgEAEAAQAAAAIAAAADAAAABAAAAAEAAAABAAAAAQAAAAEAAAAAAAAAyBABAAEAAAAFAAAAAwAAAAQAAAABAAAAAgAAAAIAAAACAAAAAAECAwQAAQ0OAAECBQYHCAABCQoLDAACBAYICgwOTjEwX19jeHhhYml2MTE2X19zaGltX3R5cGVfaW5mb0UAU3Q5dHlwZV9pbmZvAE4xMF9fY3h4YWJpdjEyMF9fc2lfY2xhc3NfdHlwZV9pbmZvRQBOMTBfX2N4eGFiaXYxMTdfX2NsYXNzX3R5cGVfaW5mb0UATjEwX19jeHhhYml2MTE5X19wb2ludGVyX3R5cGVfaW5mb0UATjEwX19jeHhhYml2MTE3X19wYmFzZV90eXBlX2luZm9F';
var tempDoublePtr = 71104;
var ENV = {};
function ___buildEnvironment(environ) {
    var MAX_ENV_VALUES = 64;
    var TOTAL_ENV_SIZE = 1024;
    var poolPtr;
    var envPtr;
    if (!___buildEnvironment.called) {
        ___buildEnvironment.called = true;
        ENV['USER'] = ENV['LOGNAME'] = 'web_user';
        ENV['PATH'] = '/';
        ENV['PWD'] = '/';
        ENV['HOME'] = '/home/web_user';
        ENV['LANG'] = 'C.UTF-8';
        ENV['_'] = Module['thisProgram'];
        poolPtr = getMemory(TOTAL_ENV_SIZE);
        envPtr = getMemory(MAX_ENV_VALUES * 4);
        HEAP32[envPtr >> 2] = poolPtr;
        HEAP32[environ >> 2] = envPtr;
    } else {
        envPtr = HEAP32[environ >> 2];
        poolPtr = HEAP32[envPtr >> 2];
    }
    var strings = [];
    var totalSize = 0;
    for (var key in ENV) {
        if (typeof ENV[key] === 'string') {
            var line = key + '=' + ENV[key];
            strings.push(line);
            totalSize += line.length;
        }
    }
    if (totalSize > TOTAL_ENV_SIZE) {
        throw new Error('Environment size exceeded TOTAL_ENV_SIZE!');
    }
    var ptrSize = 4;
    for (var i = 0; i < strings.length; i++) {
        var line = strings[i];
        writeAsciiToMemory(line, poolPtr);
        HEAP32[envPtr + i * ptrSize >> 2] = poolPtr;
        poolPtr += line.length + 1;
    }
    HEAP32[envPtr + strings.length * ptrSize >> 2] = 0;
}
function __ZSt18uncaught_exceptionv() {
    return !!__ZSt18uncaught_exceptionv.uncaught_exception;
}
function ___cxa_free_exception(ptr) {
    try {
        return _free(ptr);
    } catch (e) {
    }
}
var EXCEPTIONS = {
    last: 0,
    caught: [],
    infos: {},
    deAdjust: function (adjusted) {
        if (!adjusted || EXCEPTIONS.infos[adjusted])
            return adjusted;
        for (var key in EXCEPTIONS.infos) {
            var ptr = +key;
            var adj = EXCEPTIONS.infos[ptr].adjusted;
            var len = adj.length;
            for (var i = 0; i < len; i++) {
                if (adj[i] === adjusted) {
                    return ptr;
                }
            }
        }
        return adjusted;
    },
    addRef: function (ptr) {
        if (!ptr)
            return;
        var info = EXCEPTIONS.infos[ptr];
        info.refcount++;
    },
    decRef: function (ptr) {
        if (!ptr)
            return;
        var info = EXCEPTIONS.infos[ptr];
        info.refcount--;
        if (info.refcount === 0 && !info.rethrown) {
            if (info.destructor) {
                Module['dynCall_vi'](info.destructor, ptr);
            }
            delete EXCEPTIONS.infos[ptr];
            ___cxa_free_exception(ptr);
        }
    },
    clearRef: function (ptr) {
        if (!ptr)
            return;
        var info = EXCEPTIONS.infos[ptr];
        info.refcount = 0;
    }
};
function ___resumeException(ptr) {
    if (!EXCEPTIONS.last) {
        EXCEPTIONS.last = ptr;
    }
    throw ptr;
}
function ___cxa_find_matching_catch() {
    var thrown = EXCEPTIONS.last;
    if (!thrown) {
        return (setTempRet0(0), 0) | 0;
    }
    var info = EXCEPTIONS.infos[thrown];
    var throwntype = info.type;
    if (!throwntype) {
        return (setTempRet0(0), thrown) | 0;
    }
    var typeArray = Array.prototype.slice.call(arguments);
    var pointer = Module['___cxa_is_pointer_type'](throwntype);
    if (!___cxa_find_matching_catch.buffer)
        ___cxa_find_matching_catch.buffer = _malloc(4);
    HEAP32[___cxa_find_matching_catch.buffer >> 2] = thrown;
    thrown = ___cxa_find_matching_catch.buffer;
    for (var i = 0; i < typeArray.length; i++) {
        if (typeArray[i] && Module['___cxa_can_catch'](typeArray[i], throwntype, thrown)) {
            thrown = HEAP32[thrown >> 2];
            info.adjusted.push(thrown);
            return (setTempRet0(typeArray[i]), thrown) | 0;
        }
    }
    thrown = HEAP32[thrown >> 2];
    return (setTempRet0(throwntype), thrown) | 0;
}
function ___gxx_personality_v0() {
}
function _emscripten_get_heap_size() {
    return HEAP8.length;
}
function abortOnCannotGrowMemory(requestedSize) {
    abort('OOM');
}
function emscripten_realloc_buffer(size) {
    try {
        var newBuffer = new ArrayBuffer(size);
        if (newBuffer.byteLength != size)
            return false;
        new Int8Array(newBuffer).set(HEAP8);
    } catch (e) {
        return false;
    }
    buffer = newBuffer;
    Module['_emscripten_replace_memory'](newBuffer);
    return true;
}
function _emscripten_resize_heap(requestedSize) {
    var oldSize = _emscripten_get_heap_size();
    var PAGE_MULTIPLE = 16777216;
    var LIMIT = 2147483648 - PAGE_MULTIPLE;
    if (requestedSize > LIMIT) {
        return false;
    }
    var MIN_TOTAL_MEMORY = 16777216;
    var newSize = Math.max(oldSize, MIN_TOTAL_MEMORY);
    while (newSize < requestedSize) {
        if (newSize <= 536870912) {
            newSize = alignUp(2 * newSize, PAGE_MULTIPLE);
        } else {
            newSize = Math.min(alignUp((3 * newSize + 2147483648) / 4, PAGE_MULTIPLE), LIMIT);
        }
    }
    if (!emscripten_realloc_buffer(newSize)) {
        return false;
    }
    updateGlobalBufferViews();
    return true;
}
function _emscripten_memcpy_big(dest, src, num) {
    HEAPU8.set(HEAPU8.subarray(src, src + num), dest);
}
function ___setErrNo(value) {
    if (Module['___errno_location'])
        HEAP32[Module['___errno_location']() >> 2] = value;
    return value;
}
var ASSERTIONS = false;
function intArrayToString(array) {
    var ret = [];
    for (var i = 0; i < array.length; i++) {
        var chr = array[i];
        if (chr > 255) {
            if (ASSERTIONS) {
            }
            chr &= 255;
        }
        ret.push(String.fromCharCode(chr));
    }
    return ret.join('');
}
var decodeBase64 = typeof atob === 'function' ? atob : function (input) {
    var keyStr = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';
    var output = '';
    var chr1, chr2, chr3;
    var enc1, enc2, enc3, enc4;
    var i = 0;
    input = input.replace(/[^A-Za-z0-9\+\/\=]/g, '');
    do {
        enc1 = keyStr.indexOf(input.charAt(i++));
        enc2 = keyStr.indexOf(input.charAt(i++));
        enc3 = keyStr.indexOf(input.charAt(i++));
        enc4 = keyStr.indexOf(input.charAt(i++));
        chr1 = enc1 << 2 | enc2 >> 4;
        chr2 = (enc2 & 15) << 4 | enc3 >> 2;
        chr3 = (enc3 & 3) << 6 | enc4;
        output = output + String.fromCharCode(chr1);
        if (enc3 !== 64) {
            output = output + String.fromCharCode(chr2);
        }
        if (enc4 !== 64) {
            output = output + String.fromCharCode(chr3);
        }
    } while (i < input.length);
    return output;
};
function intArrayFromBase64(s) {
    if (typeof ENVIRONMENT_IS_NODE === 'boolean' && ENVIRONMENT_IS_NODE) {
        var buf;
        try {
            buf = Buffer.from(s, 'base64');
        } catch (_) {
            buf = new Buffer(s, 'base64');
        }
        return new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength);
    }
    try {
        var decoded = decodeBase64(s);
        var bytes = new Uint8Array(decoded.length);
        for (var i = 0; i < decoded.length; ++i) {
            bytes[i] = decoded.charCodeAt(i);
        }
        return bytes;
    } catch (_) {
        throw new Error('Converting base64 string to bytes failed.');
    }
}
function tryParseAsDataURI(filename) {
    if (!isDataURI(filename)) {
        return;
    }
    return intArrayFromBase64(filename.slice(dataURIPrefix.length));
}
var asmGlobalArg = {
    'Int8Array': Int8Array,
    'Int16Array': Int16Array,
    'Int32Array': Int32Array,
    'Uint8Array': Uint8Array,
    'Uint16Array': Uint16Array
};
var asmLibraryArg = {
    'a': abort,
    'b': setTempRet0,
    'c': getTempRet0,
    'd': __ZSt18uncaught_exceptionv,
    'e': ___buildEnvironment,
    'f': ___cxa_find_matching_catch,
    'g': ___cxa_free_exception,
    'h': ___gxx_personality_v0,
    'i': ___resumeException,
    'j': ___setErrNo,
    'k': _emscripten_get_heap_size,
    'l': _emscripten_memcpy_big,
    'm': _emscripten_resize_heap,
    'n': abortOnCannotGrowMemory,
    'o': emscripten_realloc_buffer,
    'p': tempDoublePtr,
    'q': DYNAMICTOP_PTR
};
var asm = function (global, env, buffer) {
    'almost asm';
    var a = new global.Int8Array(buffer), b = new global.Int16Array(buffer), c = new global.Int32Array(buffer), d = new global.Uint8Array(buffer), e = new global.Uint16Array(buffer), f = env.p | 0, g = env.q | 0, h = 0, i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = env.a, q = env.b, r = env.c, s = env.d, t = env.e, u = env.f, v = env.g, w = env.h, x = env.i, y = env.j, z = env.k, A = env.l, B = env.m, C = env.n, D = env.o, E = 71120, F = 5314000, G = 0;
    function H(newBuffer) {
        a = new Int8Array(newBuffer);
        d = new Uint8Array(newBuffer);
        b = new Int16Array(newBuffer);
        e = new Uint16Array(newBuffer);
        c = new Int32Array(newBuffer);
        buffer = newBuffer;
        return true;
    }
    function O(a) {
        a = a | 0;
        var b = 0;
        b = E;
        E = E + a | 0;
        E = E + 15 & -16;
        return b | 0;
    }
    function P() {
        return E | 0;
    }
    function Q(a) {
        a = a | 0;
        E = a;
    }
    function R(a, b) {
        a = a | 0;
        b = b | 0;
        E = a;
        F = b;
    }
    function S(a, d) {
        a = a | 0;
        d = d | 0;
        var e = 0, f = 0, g = 0, h = 0, i = 0;
        g = E;
        E = E + 16 | 0;
        h = g;
        c[h >> 2] = 0;
        f = Ya(a, d, 0, 0, h) | 0;
        i = f + 1 | 0;
        c[h >> 2] = 0;
        e = Ab(i << 1) | 0;
        Ya(a, d, e, i, h) | 0;
        if ((c[h >> 2] | 0) > 0) {
            Bb(e);
            e = 0;
        } else
            b[e + (f << 1) >> 1] = 0;
        E = g;
        return e | 0;
    }
    function T(a, b) {
        a = a | 0;
        b = b | 0;
        var d = 0, e = 0, f = 0;
        f = E;
        E = E + 16 | 0;
        e = f;
        d = c[17592] | 0;
        if (!d) {
            d = Z() | 0;
            c[17592] = d;
        }
        c[e >> 2] = 0;
        ea(d, a, b, -2, e);
        if ((c[e >> 2] | 0) > 0)
            d = 0;
        else
            d = Ea(c[17592] | 0) | 0;
        E = f;
        return d | 0;
    }
    function U(a) {
        a = a | 0;
        var b = 0, d = 0, e = 0;
        e = E;
        E = E + 16 | 0;
        d = e + 4 | 0;
        b = e;
        c[d >> 2] = 0;
        c[b >> 2] = 0;
        Fa(c[17592] | 0, a, b, d);
        E = e;
        return ((c[d >> 2] | 0) > 0 ? 0 : c[b >> 2] | 0) | 0;
    }
    function V(a, b, d) {
        a = a | 0;
        b = b | 0;
        d = d | 0;
        return (Va(c[17593] | 0, a, b, d) | 0) == 1 | 0;
    }
    function W(a, b) {
        a = a | 0;
        b = b | 0;
        var d = 0, e = 0, f = 0;
        f = E;
        E = E + 16 | 0;
        e = f;
        c[e >> 2] = 0;
        d = c[17593] | 0;
        if (!d) {
            d = Z() | 0;
            c[17593] = d;
        }
        Ma(c[17592] | 0, a, b, d, e);
        if ((c[e >> 2] | 0) > 0)
            d = 0;
        else {
            c[e >> 2] = 0;
            d = Qa(d, e) | 0;
            d = (c[e >> 2] | 0) > 0 ? 0 : d;
        }
        E = f;
        return d | 0;
    }
    function X(a, d, e) {
        a = a | 0;
        d = d | 0;
        e = e | 0;
        var f = 0, g = 0, h = 0;
        g = E;
        E = E + 16 | 0;
        h = g;
        c[h >> 2] = 0;
        f = Ab((e << 1) + 2 | 0) | 0;
        a = Ha(a + (d << 1) | 0, e, f, e, h) | 0;
        if ((c[h >> 2] | 0) > 0)
            f = 0;
        else
            b[f + (a << 1) >> 1] = 0;
        E = g;
        return f | 0;
    }
    function Y(a, d) {
        a = a | 0;
        d = d | 0;
        var e = 0, f = 0, g = 0, h = 0, i = 0;
        i = E;
        E = E + 16 | 0;
        h = i;
        c[h >> 2] = 0;
        f = c[17593] | 0;
        if (!f) {
            f = Z() | 0;
            c[17593] = f;
        }
        Ma(c[17592] | 0, a, d, f, h);
        if ((c[h >> 2] | 0) <= 0 ? (g = Da(f) | 0, d = g + 1 | 0, e = Ab(d << 1) | 0, Ka(c[17593] | 0, e, d, 10, h) | 0, (c[h >> 2] | 0) <= 0) : 0)
            b[e + (g << 1) >> 1] = 0;
        else
            e = 0;
        E = i;
        return e | 0;
    }
    function Z() {
        var a = 0, b = 0;
        b = E;
        E = E + 16 | 0;
        a = b;
        c[a >> 2] = 0;
        a = _(a) | 0;
        E = b;
        return a | 0;
    }
    function _(b) {
        b = b | 0;
        var d = 0;
        if (!b) {
            d = 0;
            return d | 0;
        }
        if (($(c[b >> 2] | 0) | 0) << 24 >> 24) {
            d = 0;
            return d | 0;
        }
        d = lb(360) | 0;
        if (!d) {
            c[b >> 2] = 7;
            d = 0;
            return d | 0;
        }
        fc(d | 0, 0, 360) | 0;
        a[d + 68 >> 0] = 1;
        a[d + 69 >> 0] = 1;
        if ((ba(c[b >> 2] | 0) | 0) << 24 >> 24)
            return d | 0;
        ca(d);
        d = 0;
        return d | 0;
    }
    function $(a) {
        a = a | 0;
        return (a | 0) > 0 | 0;
    }
    function aa(a, b, d, e) {
        a = a | 0;
        b = b | 0;
        d = d | 0;
        e = e | 0;
        var f = 0, g = 0;
        g = c[a >> 2] | 0;
        if (!g)
            if (d << 24 >> 24 != 0 ? (g = lb(e) | 0, c[a >> 2] = g, (g | 0) != 0) : 0) {
                c[b >> 2] = e;
                a = 1;
            } else
                a = 0;
        else if ((c[b >> 2] | 0) < (e | 0))
            if (d << 24 >> 24 != 0 ? (f = mb(g, e) | 0, (f | 0) != 0) : 0) {
                c[a >> 2] = f;
                c[b >> 2] = e;
                a = 1;
            } else
                a = 0;
        else
            a = 1;
        return a | 0;
    }
    function ba(a) {
        a = a | 0;
        return (a | 0) < 1 | 0;
    }
    function ca(a) {
        a = a | 0;
        var b = 0;
        if (!a)
            return;
        c[a >> 2] = 0;
        b = c[a + 44 >> 2] | 0;
        if (b | 0)
            nb(b);
        b = c[a + 48 >> 2] | 0;
        if (b | 0)
            nb(b);
        b = c[a + 52 >> 2] | 0;
        if (b | 0)
            nb(b);
        b = c[a + 56 >> 2] | 0;
        if (b | 0)
            nb(b);
        b = c[a + 60 >> 2] | 0;
        if (b | 0)
            nb(b);
        b = c[a + 64 >> 2] | 0;
        if (b | 0)
            nb(b);
        b = c[a + 344 >> 2] | 0;
        if (b | 0)
            nb(b);
        nb(a);
        return;
    }
    function da(a, b, d) {
        a = a | 0;
        b = b | 0;
        d = d | 0;
        var e = 0, f = 0;
        e = 0;
        while (1) {
            if ((e | 0) >= (a | 0)) {
                f = 5;
                break;
            }
            if ((c[b + (e << 3) >> 2] | 0) > (d | 0))
                break;
            e = e + 1 | 0;
        }
        if ((f | 0) == 5)
            e = a + -1 | 0;
        return c[b + (e << 3) + 4 >> 2] & 255 | 0;
    }
    function ea(b, e, f, g, h) {
        b = b | 0;
        e = e | 0;
        f = f | 0;
        g = g | 0;
        h = h | 0;
        var i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0, q = 0, r = 0, s = 0, t = 0, u = 0, v = 0, w = 0, x = 0, y = 0, z = 0;
        if (!h)
            return;
        if (($(c[h >> 2] | 0) | 0) << 24 >> 24)
            return;
        if ((b | 0) == 0 | (e | 0) == 0 | (f | 0) < -1 | g + -126 << 24 >> 24 << 24 >> 24 > -1) {
            c[h >> 2] = 1;
            return;
        }
        if ((f | 0) == -1)
            f = ob(e) | 0;
        u = b + 84 | 0;
        if ((c[u >> 2] | 0) == 3) {
            fa(b, e, f, g, h);
            return;
        }
        c[b >> 2] = 0;
        c[b + 4 >> 2] = e;
        z = b + 16 | 0;
        c[z >> 2] = f;
        c[b + 8 >> 2] = f;
        l = b + 12 | 0;
        c[l >> 2] = f;
        s = b + 93 | 0;
        a[s >> 0] = g;
        i = g & 1;
        j = i & 255;
        m = b + 116 | 0;
        c[m >> 2] = j;
        x = b + 132 | 0;
        c[x >> 2] = 1;
        k = b + 72 | 0;
        c[k >> 2] = 0;
        n = b + 76 | 0;
        c[n >> 2] = 0;
        c[b + 224 >> 2] = 0;
        y = b + 332 | 0;
        c[y >> 2] = 0;
        c[b + 336 >> 2] = 0;
        e = (g & 255) > 253;
        t = b + 94 | 0;
        a[t >> 0] = e & 1;
        if (!f) {
            if (e) {
                a[s >> 0] = i;
                a[t >> 0] = 0;
            }
            c[b + 120 >> 2] = c[69880 + (j << 2) >> 2];
            c[b + 220 >> 2] = 0;
            c[x >> 2] = 0;
            ga(b);
            return;
        }
        c[b + 220 >> 2] = -1;
        e = c[b + 56 >> 2] | 0;
        w = b + 136 | 0;
        c[w >> 2] = (e | 0) == 0 ? b + 140 | 0 : e;
        e = b + 44 | 0;
        i = b + 68 | 0;
        if (!((aa(e, b + 20 | 0, a[i >> 0] | 0, f) | 0) << 24 >> 24)) {
            c[h >> 2] = 7;
            return;
        }
        c[k >> 2] = c[e >> 2];
        if (!((ha(b) | 0) << 24 >> 24)) {
            c[h >> 2] = 7;
            return;
        }
        v = c[k >> 2] | 0;
        q = c[l >> 2] | 0;
        k = b + 128 | 0;
        c[k >> 2] = q;
        f = b + 48 | 0;
        if (!((aa(f, b + 24 | 0, a[i >> 0] | 0, q) | 0) << 24 >> 24)) {
            c[h >> 2] = 7;
            return;
        }
        c[n >> 2] = c[f >> 2];
        j = ia(b, h) | 0;
        if (($(c[h >> 2] | 0) | 0) << 24 >> 24)
            return;
        g = b + 240 | 0;
        f = c[g >> 2] | 0;
        do
            if ((f | 0) < 6)
                c[b + 244 >> 2] = b + 248;
            else {
                f = f << 4;
                e = b + 40 | 0;
                i = b + 64 | 0;
                if ((f | 0) <= (c[e >> 2] | 0)) {
                    c[b + 244 >> 2] = c[i >> 2];
                    break;
                }
                if ((aa(i, e, 1, f) | 0) << 24 >> 24) {
                    c[b + 244 >> 2] = c[i >> 2];
                    break;
                }
                c[h >> 2] = 7;
                return;
            }
        while (0);
        c[g >> 2] = -1;
        c[m >> 2] = j;
        a:
            do
                switch (j | 0) {
                case 0: {
                        c[k >> 2] = 0;
                        break;
                    }
                case 1: {
                        c[k >> 2] = 0;
                        break;
                    }
                default: {
                        b:
                            do
                                switch (c[u >> 2] | 0) {
                                case 0: {
                                        c[b + 112 >> 2] = 69888;
                                        break;
                                    }
                                case 1: {
                                        c[b + 112 >> 2] = 69904;
                                        break;
                                    }
                                case 2: {
                                        c[b + 112 >> 2] = 69920;
                                        break;
                                    }
                                case 4: {
                                        c[b + 112 >> 2] = 69936;
                                        break;
                                    }
                                case 5: {
                                        f = b + 112 | 0;
                                        if (!(c[b + 88 >> 2] & 1)) {
                                            c[f >> 2] = 69968;
                                            break b;
                                        } else {
                                            c[f >> 2] = 69952;
                                            break b;
                                        }
                                    }
                                case 6: {
                                        f = b + 112 | 0;
                                        if (!(c[b + 88 >> 2] & 1)) {
                                            c[f >> 2] = 70000;
                                            break b;
                                        } else {
                                            c[f >> 2] = 69984;
                                            break b;
                                        }
                                    }
                                default: {
                                    }
                                }
                            while (0);
                        j = c[x >> 2] | 0;
                        if ((j | 0) < 2 ? (c[b + 120 >> 2] | 0) >= 0 : 0) {
                            do
                                if (a[t >> 0] | 0) {
                                    e = c[w >> 2] | 0;
                                    i = c[e >> 2] | 0;
                                    if ((i | 0) > 0)
                                        f = a[s >> 0] | 0;
                                    else
                                        f = da(j, e, 0) | 0;
                                    f = f & 1;
                                    if ((q | 0) > (i | 0)) {
                                        e = da(j, e, q + -1 | 0) | 0;
                                        break;
                                    } else {
                                        e = a[s >> 0] | 0;
                                        break;
                                    }
                                } else {
                                    f = a[s >> 0] | 0;
                                    e = f;
                                    f = f & 1;
                                }
                            while (0);
                            ja(b, 0, q, f, e & 1);
                        } else {
                            o = c[n >> 2] | 0;
                            if ((a[t >> 0] | 0) != 0 ? (p = c[w >> 2] | 0, (c[p >> 2] | 0) <= 0) : 0)
                                f = da(j, p, 0) | 0;
                            else
                                f = a[s >> 0] | 0;
                            p = a[o >> 0] | 0;
                            n = q + -1 | 0;
                            l = p;
                            m = 0;
                            f = ((f & 255) < (p & 255) ? p : f) & 1;
                            while (1) {
                                if ((m | 0) > 0 ? (a[v + (m + -1) >> 0] | 0) == 7 : 0) {
                                    do
                                        if (!(a[t >> 0] | 0))
                                            r = 61;
                                        else {
                                            f = c[w >> 2] | 0;
                                            if ((m | 0) < (c[f >> 2] | 0)) {
                                                r = 61;
                                                break;
                                            }
                                            f = da(c[x >> 2] | 0, f, m) | 0;
                                        }
                                    while (0);
                                    if ((r | 0) == 61) {
                                        r = 0;
                                        f = a[s >> 0] | 0;
                                    }
                                    f = f & 1;
                                }
                                g = m;
                                while (1) {
                                    k = g + 1 | 0;
                                    if ((k | 0) >= (q | 0)) {
                                        r = 69;
                                        break;
                                    }
                                    e = a[o + k >> 0] | 0;
                                    if (e << 24 >> 24 != l << 24 >> 24 ? (1 << d[v + k >> 0] & 382976 | 0) == 0 : 0) {
                                        j = 1;
                                        break;
                                    }
                                    g = k;
                                }
                                c:
                                    do
                                        if ((r | 0) == 69) {
                                            r = 0;
                                            do
                                                if (a[t >> 0] | 0) {
                                                    e = c[w >> 2] | 0;
                                                    if ((q | 0) <= (c[e >> 2] | 0))
                                                        break;
                                                    e = da(c[x >> 2] | 0, e, n) | 0;
                                                    j = 0;
                                                    break c;
                                                }
                                            while (0);
                                            e = a[s >> 0] | 0;
                                            j = 0;
                                        }
                                    while (0);
                                p = l & 255;
                                i = e & 255;
                                i = ((p & 127) >>> 0 < (i & 127) >>> 0 ? i : p) & 1;
                                if (!(p & 128))
                                    ja(b, m, k, f, i);
                                else {
                                    f = m;
                                    while (1) {
                                        p = o + f | 0;
                                        a[p >> 0] = a[p >> 0] & 127;
                                        if ((f | 0) < (g | 0))
                                            f = f + 1 | 0;
                                        else
                                            break;
                                    }
                                }
                                if (j) {
                                    l = e;
                                    m = k;
                                    f = i;
                                } else
                                    break;
                            }
                        }
                        f = c[b + 340 >> 2] | 0;
                        if (!(($(f) | 0) << 24 >> 24)) {
                            ka(b);
                            break a;
                        }
                        c[h >> 2] = f;
                        return;
                    }
                }
            while (0);
        k = b + 88 | 0;
        d:
            do
                if ((a[t >> 0] | 0 ? c[k >> 2] & 1 | 0 : 0) ? ((c[u >> 2] | 0) + -5 | 0) >>> 0 < 2 : 0) {
                    g = 0;
                    while (1) {
                        if ((g | 0) >= (c[x >> 2] | 0))
                            break d;
                        e = c[w >> 2] | 0;
                        f = (c[e + (g << 3) >> 2] | 0) + -1 | 0;
                        e:
                            do
                                if (c[e + (g << 3) + 4 >> 2] & 255 | 0) {
                                    if (!g)
                                        i = 0;
                                    else
                                        i = c[e + (g + -1 << 3) >> 2] | 0;
                                    e = f;
                                    while (1) {
                                        if ((e | 0) < (i | 0))
                                            break e;
                                        j = a[v + e >> 0] | 0;
                                        if (!(j << 24 >> 24))
                                            break;
                                        if (1 << (j & 255) & 8194 | 0)
                                            break e;
                                        e = e + -1 | 0;
                                    }
                                    if ((e | 0) < (f | 0))
                                        while (1)
                                            if ((a[v + f >> 0] | 0) == 7)
                                                f = f + -1 | 0;
                                            else
                                                break;
                                    la(b, f, 4);
                                }
                            while (0);
                        g = g + 1 | 0;
                    }
                }
            while (0);
        if (!(c[k >> 2] & 2))
            f = (c[z >> 2] | 0) + (c[y >> 2] | 0) | 0;
        else
            f = (c[z >> 2] | 0) - (c[b + 348 >> 2] | 0) | 0;
        c[z >> 2] = f;
        ga(b);
        return;
    }
    function fa(b, e, f, g, h) {
        b = b | 0;
        e = e | 0;
        f = f | 0;
        g = g | 0;
        h = h | 0;
        var i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0, q = 0, r = 0, s = 0, t = 0, u = 0, v = 0, w = 0, x = 0, y = 0, z = 0, A = 0, B = 0, C = 0, D = 0, E = 0;
        C = b + 84 | 0;
        c[C >> 2] = 0;
        if (!f) {
            ea(b, e, 0, g, h);
            D = 0;
            nb(D);
            c[C >> 2] = 3;
            return;
        }
        D = lb(f * 7 | 0) | 0;
        if (!D) {
            c[h >> 2] = 7;
            D = 0;
            nb(D);
            c[C >> 2] = 3;
            return;
        }
        j = D + (f << 2) | 0;
        B = j + (f << 1) | 0;
        k = b + 88 | 0;
        l = c[k >> 2] | 0;
        if (l & 1 | 0)
            c[k >> 2] = l & -4 | 2;
        g = g & 1;
        ea(b, e, f, g, h);
        if (($(c[h >> 2] | 0) | 0) << 24 >> 24) {
            nb(D);
            c[C >> 2] = 3;
            return;
        }
        x = Pa(b, h) | 0;
        v = b + 12 | 0;
        w = c[v >> 2] | 0;
        ec(B | 0, x | 0, w | 0) | 0;
        x = b + 128 | 0;
        y = c[x >> 2] | 0;
        z = b + 116 | 0;
        A = c[z >> 2] | 0;
        i = Ka(b, j, f, 2, h) | 0;
        Wa(b, D, h);
        if (!(($(c[h >> 2] | 0) | 0) << 24 >> 24)) {
            c[k >> 2] = l;
            c[C >> 2] = 5;
            u = b + 68 | 0;
            t = a[u >> 0] | 0;
            a[u >> 0] = 0;
            ea(b, j, i, g ^ 1, h);
            a[u >> 0] = t;
            Ra(b, h);
            a:
                do
                    if (!(($(c[h >> 2] | 0) | 0) << 24 >> 24)) {
                        n = b + 220 | 0;
                        q = c[n >> 2] | 0;
                        o = b + 224 | 0;
                        p = c[o >> 2] | 0;
                        j = 0;
                        g = 0;
                        h = 0;
                        while (1) {
                            if ((h | 0) >= (q | 0))
                                break;
                            m = c[p + (h * 12 | 0) + 4 >> 2] | 0;
                            g = m - g | 0;
                            b:
                                do
                                    if ((g | 0) < 2)
                                        g = j;
                                    else {
                                        i = c[p + (h * 12 | 0) >> 2] & 2147483647;
                                        l = i + g | 0;
                                        g = j;
                                        while (1) {
                                            do {
                                                j = i;
                                                i = i + 1 | 0;
                                                if ((i | 0) >= (l | 0))
                                                    break b;
                                                k = c[D + (i << 2) >> 2] | 0;
                                                j = c[D + (j << 2) >> 2] | 0;
                                                u = k - j | 0;
                                                if ((((u | 0) > -1 ? u : 0 - u | 0) | 0) != 1)
                                                    break;
                                            } while ((a[B + k >> 0] | 0) == (a[B + j >> 0] | 0));
                                            g = g + 1 | 0;
                                        }
                                    }
                                while (0);
                            j = g;
                            g = m;
                            h = h + 1 | 0;
                        }
                        if (!j)
                            t = p;
                        else {
                            g = b + 60 | 0;
                            if (!((aa(g, b + 36 | 0, a[b + 69 >> 0] | 0, (j + q | 0) * 12 | 0) | 0) << 24 >> 24))
                                break;
                            if ((q | 0) == 1) {
                                u = c[g >> 2] | 0;
                                c[u >> 2] = c[p >> 2];
                                c[u + 4 >> 2] = c[p + 4 >> 2];
                                c[u + 8 >> 2] = c[p + 8 >> 2];
                            }
                            t = c[g >> 2] | 0;
                            c[o >> 2] = t;
                            c[n >> 2] = (c[n >> 2] | 0) + j;
                        }
                        u = t + 4 | 0;
                        g = q;
                        i = j;
                        while (1) {
                            s = g + -1 | 0;
                            if ((g | 0) <= 0)
                                break a;
                            if (!s)
                                g = c[u >> 2] | 0;
                            else
                                g = (c[t + (s * 12 | 0) + 4 >> 2] | 0) - (c[t + ((g + -2 | 0) * 12 | 0) + 4 >> 2] | 0) | 0;
                            q = t + (s * 12 | 0) | 0;
                            j = c[q >> 2] | 0;
                            r = j >>> 31;
                            j = j & 2147483647;
                            if ((g | 0) < 2) {
                                if (!i)
                                    g = s;
                                else {
                                    g = s + i | 0;
                                    p = t + (g * 12 | 0) | 0;
                                    c[p >> 2] = c[q >> 2];
                                    c[p + 4 >> 2] = c[q + 4 >> 2];
                                    c[p + 8 >> 2] = c[q + 8 >> 2];
                                }
                                j = c[D + (j << 2) >> 2] | 0;
                            } else {
                                l = (r | 0) == 0;
                                h = g + -1 + j | 0;
                                p = l ? j : h;
                                m = l ? -1 : 1;
                                n = t + (s * 12 | 0) + 4 | 0;
                                o = t + (s * 12 | 0) + 8 | 0;
                                h = l ? h : j;
                                c:
                                    while (1) {
                                        g = h;
                                        while (1) {
                                            if ((g | 0) == (p | 0))
                                                break c;
                                            j = c[D + (g << 2) >> 2] | 0;
                                            k = g + m | 0;
                                            l = c[D + (k << 2) >> 2] | 0;
                                            E = j - l | 0;
                                            if ((((E | 0) > -1 ? E : 0 - E | 0) | 0) != 1)
                                                break;
                                            if ((a[B + j >> 0] | 0) == (a[B + l >> 0] | 0))
                                                g = k;
                                            else
                                                break;
                                        }
                                        E = c[D + (h << 2) >> 2] | 0;
                                        E = (E | 0) < (j | 0) ? E : j;
                                        l = i + s | 0;
                                        c[t + (l * 12 | 0) >> 2] = (r ^ d[B + E >> 0]) << 31 | E;
                                        c[t + (l * 12 | 0) + 4 >> 2] = c[n >> 2];
                                        E = g - h | 0;
                                        c[n >> 2] = (c[n >> 2] | 0) + ~((E | 0) > -1 ? E : 0 - E | 0);
                                        E = c[o >> 2] & 10;
                                        c[t + (l * 12 | 0) + 8 >> 2] = E;
                                        c[o >> 2] = c[o >> 2] & ~E;
                                        h = k;
                                        i = i + -1 | 0;
                                    }
                                if (!i)
                                    g = s;
                                else {
                                    g = i + s | 0;
                                    E = t + (g * 12 | 0) | 0;
                                    c[E >> 2] = c[q >> 2];
                                    c[E + 4 >> 2] = c[q + 4 >> 2];
                                    c[E + 8 >> 2] = c[q + 8 >> 2];
                                }
                                E = c[D + (h << 2) >> 2] | 0;
                                j = c[D + (p << 2) >> 2] | 0;
                                j = (E | 0) < (j | 0) ? E : j;
                            }
                            c[t + (g * 12 | 0) >> 2] = (r ^ d[B + j >> 0]) << 31 | j;
                            g = s;
                        }
                    }
                while (0);
            E = b + 93 | 0;
            a[E >> 0] = a[E >> 0] ^ 1;
        }
        c[b + 4 >> 2] = e;
        c[v >> 2] = w;
        c[b + 8 >> 2] = f;
        c[z >> 2] = A;
        E = c[b + 24 >> 2] | 0;
        ec(c[b + 76 >> 2] | 0, B | 0, ((w | 0) > (E | 0) ? E : w) | 0) | 0;
        c[x >> 2] = y;
        if ((c[b + 220 >> 2] | 0) <= 1) {
            E = D;
            nb(E);
            c[C >> 2] = 3;
            return;
        }
        c[z >> 2] = 2;
        E = D;
        nb(E);
        c[C >> 2] = 3;
        return;
    }
    function ga(a) {
        a = a | 0;
        c[a + 100 >> 2] = 0;
        c[a + 108 >> 2] = 0;
        c[a >> 2] = a;
        return;
    }
    function ha(f) {
        f = f | 0;
        var g = 0, h = 0, i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0, q = 0, r = 0, s = 0, t = 0, u = 0, v = 0, w = 0, x = 0, y = 0, z = 0, A = 0, B = 0, C = 0, D = 0, F = 0, G = 0, H = 0, I = 0, J = 0, K = 0, L = 0, M = 0, N = 0;
        N = E;
        E = E + 1024 | 0;
        x = N + 512 | 0;
        G = N;
        B = c[f + 4 >> 2] | 0;
        D = c[f + 44 >> 2] | 0;
        J = c[f + 8 >> 2] | 0;
        K = f + 93 | 0;
        g = a[K >> 0] | 0;
        H = (g & 255) > 253;
        if (H)
            C = ((c[f + 84 >> 2] | 0) + -5 | 0) >>> 0 < 2;
        else
            C = 0;
        I = f + 88 | 0;
        M = c[I >> 2] | 0;
        j = M & 2;
        if (M & 4 | 0)
            c[f + 12 >> 2] = 0;
        g = g & 255;
        v = g & 1;
        w = v & 255;
        M = f + 136 | 0;
        h = (c[M >> 2] | 0) + 4 | 0;
        if (H) {
            c[h >> 2] = v;
            if ((c[f + 100 >> 2] | 0) > 0 ? (i = Ba(f) | 0, i << 24 >> 24 != 10) : 0) {
                c[(c[M >> 2] | 0) + 4 >> 2] = i << 24 >> 24 != 0 & 1;
                i = w;
                k = 0;
            } else {
                i = w;
                k = 1;
            }
        } else {
            c[h >> 2] = g;
            i = 10;
            k = 0;
        }
        u = (j | 0) == 0;
        y = f + 132 | 0;
        z = f + 12 | 0;
        A = f + 348 | 0;
        h = -1;
        j = 0;
        l = 0;
        F = -1;
        g = 0;
        a:
            while (1) {
                b:
                    while (1) {
                        t = C & i << 24 >> 24 == 1;
                        i = l;
                        c:
                            while (1) {
                                d:
                                    while (1) {
                                        s = (h | 0) < 126;
                                        r = (k | 0) == 2 & s;
                                        q = (h | 0) > -1;
                                        e:
                                            while (1) {
                                                p = i;
                                                f:
                                                    while (1) {
                                                        if ((j | 0) >= (J | 0))
                                                            break a;
                                                        i = j + 1 | 0;
                                                        l = e[B + (j << 1) >> 1] | 0;
                                                        if (!((i | 0) == (J | 0) | (l & 64512 | 0) != 55296)) {
                                                            m = e[B + (i << 1) >> 1] | 0;
                                                            o = (m & 64512 | 0) == 56320;
                                                            j = o ? j + 2 | 0 : i;
                                                            if (o)
                                                                l = (l << 10) + -56613888 + m | 0;
                                                        } else
                                                            j = i;
                                                        o = pa(f, l) | 0;
                                                        i = o & 255;
                                                        o = o & 255;
                                                        g = 1 << o | g;
                                                        n = j + -1 | 0;
                                                        m = D + n | 0;
                                                        a[m >> 0] = i;
                                                        if ((l | 0) > 65535) {
                                                            a[D + (j + -2) >> 0] = 18;
                                                            g = g | 262144;
                                                        }
                                                        if (!u)
                                                            p = p + (((l + -8294 | 0) >>> 0 < 4 | ((l & -4 | 0) == 8204 | (l + -8234 | 0) >>> 0 < 5)) & 1) | 0;
                                                        switch (i << 24 >> 24) {
                                                        case 13:
                                                        case 1:
                                                            break b;
                                                        case 0: {
                                                                L = 25;
                                                                break c;
                                                            }
                                                        default: {
                                                            }
                                                        }
                                                        if ((o + -19 | 0) >>> 0 < 3) {
                                                            L = 35;
                                                            break e;
                                                        }
                                                        switch (i << 24 >> 24) {
                                                        case 22:
                                                            break f;
                                                        case 7: {
                                                                i = (j | 0) < (J | 0);
                                                                if (!((l | 0) == 13 & i))
                                                                    break d;
                                                                if ((b[B + (j << 1) >> 1] | 0) != 10) {
                                                                    i = 1;
                                                                    break d;
                                                                }
                                                                break;
                                                            }
                                                        default: {
                                                            }
                                                        }
                                                    }
                                                g = r ? g | 1048576 : g;
                                                if (q) {
                                                    L = 43;
                                                    break;
                                                } else
                                                    i = p;
                                            }
                                        if ((L | 0) == 35) {
                                            L = 0;
                                            i = h + 1 | 0;
                                            if ((h | 0) < 125) {
                                                c[x + (i << 2) >> 2] = n;
                                                c[G + (i << 2) >> 2] = k;
                                            }
                                            if ((o | 0) == 19) {
                                                a[m >> 0] = 20;
                                                h = i;
                                                k = 2;
                                            } else {
                                                h = i;
                                                k = 3;
                                            }
                                        } else if ((L | 0) == 43) {
                                            L = 0;
                                            if (s)
                                                k = c[G + (h << 2) >> 2] | 0;
                                            h = h + -1 | 0;
                                        }
                                        i = p;
                                    }
                                c[(c[M >> 2] | 0) + ((c[y >> 2] | 0) + -1 << 3) >> 2] = j;
                                if (t)
                                    c[(c[M >> 2] | 0) + ((c[y >> 2] | 0) + -1 << 3) + 4 >> 2] = 1;
                                if (c[I >> 2] & 4 | 0) {
                                    c[z >> 2] = j;
                                    c[A >> 2] = p;
                                }
                                if (i) {
                                    c[y >> 2] = (c[y >> 2] | 0) + 1;
                                    if (!((Ca(f) | 0) << 24 >> 24)) {
                                        g = 0;
                                        L = 76;
                                        break a;
                                    }
                                    if (H) {
                                        L = 56;
                                        break;
                                    }
                                    c[(c[M >> 2] | 0) + ((c[y >> 2] | 0) + -1 << 3) + 4 >> 2] = d[K >> 0];
                                    h = -1;
                                    k = 0;
                                }
                                i = p;
                            }
                        g:
                            do
                                if ((L | 0) == 25) {
                                    L = 0;
                                    switch (k | 0) {
                                    case 1: {
                                            c[(c[M >> 2] | 0) + ((c[y >> 2] | 0) + -1 << 3) + 4 >> 2] = 0;
                                            i = 0;
                                            k = 0;
                                            break g;
                                        }
                                    case 2: {
                                            g = s ? g | 1048576 : g;
                                            i = 0;
                                            k = 3;
                                            break g;
                                        }
                                    default: {
                                            i = 0;
                                            break g;
                                        }
                                    }
                                } else if ((L | 0) == 56) {
                                    L = 0;
                                    c[(c[M >> 2] | 0) + ((c[y >> 2] | 0) + -1 << 3) + 4 >> 2] = v;
                                    h = -1;
                                    i = w;
                                    k = 1;
                                }
                            while (0);
                        l = p;
                    }
                switch (k | 0) {
                case 1: {
                        c[(c[M >> 2] | 0) + ((c[y >> 2] | 0) + -1 << 3) + 4 >> 2] = 1;
                        k = 0;
                        break;
                    }
                case 2: {
                        if (s) {
                            a[D + (c[x + (h << 2) >> 2] | 0) >> 0] = 21;
                            k = 3;
                            g = g | 2097152;
                        } else
                            k = 3;
                        break;
                    }
                default: {
                    }
                }
                l = p;
                F = (o | 0) == 13 ? n : F;
                i = 1;
            }
        if ((L | 0) == 76) {
            E = N;
            return g | 0;
        }
        D = (h | 0) > 125;
        i = D ? 2 : k;
        h = D ? 125 : h;
        while (1) {
            if ((h | 0) <= -1)
                break;
            if ((i | 0) == 2) {
                L = 62;
                break;
            }
            i = c[G + (h << 2) >> 2] | 0;
            h = h + -1 | 0;
        }
        if ((L | 0) == 62)
            g = g | 1048576;
        if (c[I >> 2] & 4) {
            if ((c[z >> 2] | 0) < (J | 0))
                c[y >> 2] = (c[y >> 2] | 0) + -1;
        } else {
            c[(c[M >> 2] | 0) + ((c[y >> 2] | 0) + -1 << 3) >> 2] = J;
            c[A >> 2] = p;
        }
        if (t)
            c[(c[M >> 2] | 0) + ((c[y >> 2] | 0) + -1 << 3) + 4 >> 2] = 1;
        if (H)
            a[K >> 0] = c[(c[M >> 2] | 0) + 4 >> 2];
        i = c[y >> 2] | 0;
        h = 0;
        while (1) {
            if ((h | 0) >= (i | 0))
                break;
            L = c[69880 + ((c[(c[M >> 2] | 0) + (h << 3) + 4 >> 2] & 1) << 2) >> 2] | g;
            h = h + 1 | 0;
            g = L;
        }
        c[f + 120 >> 2] = g | (g & 128 | 0) != 0 & (a[f + 92 >> 0] | 0) != 0 & 1;
        c[f + 124 >> 2] = F;
        f = 1;
        E = N;
        return f | 0;
    }
    function ia(f, g) {
        f = f | 0;
        g = g | 0;
        var h = 0, i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0, q = 0, r = 0, s = 0, t = 0, u = 0, v = 0, w = 0, x = 0, y = 0, z = 0, A = 0, B = 0, C = 0, D = 0, F = 0, G = 0, H = 0, I = 0, J = 0, K = 0, L = 0;
        L = E;
        E = E + 5328 | 0;
        o = L + 2788 | 0;
        B = L;
        C = L + 256 | 0;
        I = c[f + 72 >> 2] | 0;
        K = c[f + 76 >> 2] | 0;
        G = c[f + 4 >> 2] | 0;
        H = c[f + 12 >> 2] | 0;
        D = f + 120 | 0;
        i = c[D >> 2] | 0;
        y = f + 94 | 0;
        if ((a[y >> 0] | 0) != 0 ? (h = c[f + 136 >> 2] | 0, (c[h >> 2] | 0) <= 0) : 0)
            j = da(c[f + 132 >> 2] | 0, h, 0) | 0;
        else
            j = a[f + 93 >> 0] | 0;
        x = f + 240 | 0;
        c[x >> 2] = 0;
        if (($(c[g >> 2] | 0) | 0) << 24 >> 24) {
            K = 0;
            E = L;
            return K | 0;
        }
        h = ra(i) | 0;
        if ((h | 0) != 2) {
            K = h;
            E = L;
            return K | 0;
        }
        if ((c[f + 84 >> 2] | 0) > 1) {
            m = f + 132 | 0;
            k = f + 136 | 0;
            j = 0;
            while (1) {
                if ((j | 0) >= (c[m >> 2] | 0)) {
                    F = 2;
                    break;
                }
                if (!j) {
                    h = 0;
                    i = c[k >> 2] | 0;
                } else {
                    i = c[k >> 2] | 0;
                    h = c[i + (j + -1 << 3) >> 2] | 0;
                }
                l = c[i + (j << 3) >> 2] | 0;
                i = c[i + (j << 3) + 4 >> 2] & 255;
                while (1) {
                    if ((h | 0) >= (l | 0))
                        break;
                    a[K + h >> 0] = i;
                    h = h + 1 | 0;
                }
                j = j + 1 | 0;
            }
            E = L;
            return F | 0;
        }
        if (!(i & 7985152)) {
            sa(f, o);
            n = f + 132 | 0;
            l = f + 136 | 0;
            k = 0;
            a:
                while (1) {
                    if ((k | 0) >= (c[n >> 2] | 0)) {
                        F = 2;
                        J = 89;
                        break;
                    }
                    if (!k) {
                        i = 0;
                        h = c[l >> 2] | 0;
                    } else {
                        h = c[l >> 2] | 0;
                        i = c[h + (k + -1 << 3) >> 2] | 0;
                    }
                    m = c[h + (k << 3) >> 2] | 0;
                    j = c[h + (k << 3) + 4 >> 2] & 255;
                    while (1) {
                        if ((i | 0) >= (m | 0))
                            break;
                        a[K + i >> 0] = j;
                        b:
                            do
                                switch (a[I + i >> 0] | 0) {
                                case 18:
                                    break;
                                case 7: {
                                        h = i + 1 | 0;
                                        if ((h | 0) < (H | 0)) {
                                            if ((b[G + (i << 1) >> 1] | 0) == 13 ? (b[G + (h << 1) >> 1] | 0) == 10 : 0)
                                                break b;
                                            ta(o, j);
                                        }
                                        break;
                                    }
                                default:
                                    if (!((ua(o, i) | 0) << 24 >> 24))
                                        break a;
                                }
                            while (0);
                        i = i + 1 | 0;
                    }
                    k = k + 1 | 0;
                }
            if ((J | 0) == 89) {
                E = L;
                return F | 0;
            }
            c[g >> 2] = 7;
            K = 0;
            E = L;
            return K | 0;
        }
        sa(f, C);
        b[B >> 1] = j & 255;
        v = f + 93 | 0;
        w = f + 136 | 0;
        u = f + 132 | 0;
        r = 0;
        p = 0;
        s = 0;
        i = 0;
        m = 0;
        g = j;
        q = j;
        h = 0;
        t = 0;
        c:
            while (1) {
                if ((t | 0) >= (H | 0))
                    break;
                o = I + t | 0;
                l = a[o >> 0] | 0;
                n = l & 255;
                d:
                    do
                        switch (l << 24 >> 24) {
                        case 15:
                        case 12:
                        case 14:
                        case 11: {
                                h = h | 262144;
                                a[K + t >> 0] = g;
                                if ((l + -11 & 255) < 2)
                                    j = q + 2 & 126;
                                else
                                    j = (q & 127) + 1 << 24 >> 24 | 1;
                                if (!((p | s | 0) == 0 & (j & 255) < 126)) {
                                    k = r;
                                    p = p + ((s | 0) == 0 & 1) | 0;
                                    l = s;
                                    j = q;
                                    break d;
                                }
                                switch (l << 24 >> 24) {
                                case 15:
                                case 12: {
                                        j = j | -128;
                                        break;
                                    }
                                default: {
                                    }
                                }
                                i = i + 1 | 0;
                                b[B + (i << 1) >> 1] = j & 255;
                                k = r;
                                l = s;
                                m = t;
                                break;
                            }
                        case 16: {
                                h = h | 262144;
                                a[K + t >> 0] = g;
                                if (!s) {
                                    if (p | 0) {
                                        k = r;
                                        p = p + -1 | 0;
                                        l = 0;
                                        j = q;
                                        break d;
                                    }
                                    if (i) {
                                        n = i + -1 | 0;
                                        if ((e[B + (i << 1) >> 1] | 0) < 256) {
                                            k = r;
                                            p = 0;
                                            l = 0;
                                            m = t;
                                            j = b[B + (n << 1) >> 1] & 255;
                                            i = n;
                                        } else {
                                            k = r;
                                            p = 0;
                                            l = 0;
                                            j = q;
                                        }
                                    } else {
                                        k = r;
                                        p = 0;
                                        l = 0;
                                        j = q;
                                        i = 0;
                                    }
                                } else {
                                    k = r;
                                    l = s;
                                    j = q;
                                }
                                break;
                            }
                        case 21:
                        case 20: {
                                k = q & 255;
                                h = h | c[69880 + ((k & 1) << 2) >> 2];
                                j = k & 127;
                                a[K + t >> 0] = j;
                                if ((j | 0) == (g & 127 | 0))
                                    h = h | 1024;
                                else {
                                    va(C, m, g, q);
                                    h = h | -2147482624;
                                }
                                l = l << 24 >> 24 == 20 ? k + 2 & 382 : j + 1 | 1;
                                j = l & 255;
                                if (!((p | s | 0) == 0 & (l & 254) >>> 0 < 126)) {
                                    a[o >> 0] = 9;
                                    g = q;
                                    k = r;
                                    l = s + 1 | 0;
                                    j = q;
                                    break d;
                                }
                                k = r + 1 | 0;
                                if ((r | 0) >= (c[x >> 2] | 0))
                                    c[x >> 2] = k;
                                i = i + 1 | 0;
                                b[B + (i << 1) >> 1] = l | 256;
                                wa(C, j);
                                g = q;
                                l = s;
                                m = t;
                                h = h | 1 << n;
                                break;
                            }
                        case 22: {
                                if ((g ^ q) & 127) {
                                    va(C, m, g, q);
                                    h = h | -2147483648;
                                }
                                do
                                    if (!s) {
                                        if (!r) {
                                            a[o >> 0] = 9;
                                            k = 0;
                                            j = p;
                                            l = 0;
                                            break;
                                        }
                                        do {
                                            s = i;
                                            i = i + -1 | 0;
                                        } while ((e[B + (s << 1) >> 1] | 0) < 256);
                                        xa(C);
                                        k = r + -1 | 0;
                                        j = 0;
                                        l = 0;
                                        m = t;
                                        h = h | 4194304;
                                    } else {
                                        a[o >> 0] = 9;
                                        k = r;
                                        j = p;
                                        l = s + -1 | 0;
                                    }
                                while (0);
                                g = b[B + (i << 1) >> 1] | 0;
                                s = g & 255;
                                g = g & 255;
                                h = h | c[69880 + ((g & 1) << 2) >> 2] | 1024;
                                a[K + t >> 0] = g & 127;
                                g = s;
                                p = j;
                                j = s;
                                break;
                            }
                        case 7: {
                                h = h | 128;
                                if ((a[y >> 0] | 0) != 0 ? (z = c[w >> 2] | 0, (t | 0) >= (c[z >> 2] | 0)) : 0)
                                    j = da(c[u >> 2] | 0, z, t) | 0;
                                else
                                    j = a[v >> 0] | 0;
                                a[K + t >> 0] = j;
                                j = t + 1 | 0;
                                if ((j | 0) < (H | 0)) {
                                    if ((b[G + (t << 1) >> 1] | 0) == 13 ? (b[G + (j << 1) >> 1] | 0) == 10 : 0) {
                                        k = r;
                                        l = s;
                                        j = q;
                                        break d;
                                    }
                                    if ((a[y >> 0] | 0) != 0 ? (A = c[w >> 2] | 0, (j | 0) >= (c[A >> 2] | 0)) : 0)
                                        i = da(c[u >> 2] | 0, A, j) | 0;
                                    else
                                        i = a[v >> 0] | 0;
                                    b[B >> 1] = i & 255;
                                    ta(C, i);
                                    g = i;
                                    k = 0;
                                    p = 0;
                                    l = 0;
                                    j = i;
                                    i = 0;
                                } else {
                                    k = r;
                                    l = s;
                                    j = q;
                                }
                                break;
                            }
                        case 18: {
                                a[K + t >> 0] = g;
                                k = r;
                                l = s;
                                j = q;
                                h = h | 262144;
                                break;
                            }
                        default: {
                                j = q & 255;
                                if ((j & 127 | 0) == (g & 127 | 0))
                                    n = h;
                                else {
                                    va(C, m, g, q);
                                    n = c[((j & 128 | 0) == 0 ? 70024 : 70016) + ((j & 1) << 2) >> 2] | (h | -2147483648);
                                }
                                a[K + t >> 0] = q;
                                if (!((ua(C, t) | 0) << 24 >> 24)) {
                                    F = -1;
                                    J = 89;
                                    break c;
                                }
                                g = q;
                                k = r;
                                l = s;
                                j = q;
                                h = 1 << d[o >> 0] | n;
                            }
                        }
                    while (0);
                r = k;
                s = l;
                q = j;
                t = t + 1 | 0;
            }
        if ((J | 0) == 89) {
            E = L;
            return F | 0;
        }
        if (h & 8380376)
            h = c[69880 + ((a[v >> 0] & 1) << 2) >> 2] | h;
        K = h | (h & 128 | 0) != 0 & (a[f + 92 >> 0] | 0) != 0 & 1;
        c[D >> 2] = K;
        K = ra(K) | 0;
        E = L;
        return K | 0;
    }
    function ja(d, e, f, g, h) {
        d = d | 0;
        e = e | 0;
        f = f | 0;
        g = g | 0;
        h = h | 0;
        var i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0, q = 0, r = 0, s = 0, t = 0, u = 0;
        u = E;
        E = E + 32 | 0;
        s = u;
        t = c[d + 72 >> 2] | 0;
        if ((c[d + 124 >> 2] | 0) > (e | 0)) {
            if ((a[d + 94 >> 0] | 0) != 0 ? (i = c[d + 136 >> 2] | 0, (c[i >> 2] | 0) <= (e | 0)) : 0)
                i = da(c[d + 132 >> 2] | 0, i, e) | 0;
            else
                i = a[d + 93 >> 0] | 0;
            if (i & 1)
                q = ((c[d + 84 >> 2] | 0) + -5 | 0) >>> 0 < 2;
            else
                q = 0;
        } else
            q = 0;
        c[s + 12 >> 2] = -1;
        c[s + 16 >> 2] = -1;
        c[s + 24 >> 2] = e;
        r = a[(c[d + 76 >> 2] | 0) + e >> 0] | 0;
        a[s + 28 >> 0] = r;
        p = c[d + 112 >> 2] | 0;
        r = r & 1;
        c[s >> 2] = c[p + (r << 2) >> 2];
        c[s + 4 >> 2] = c[p + 8 + (r << 2) >> 2];
        if ((e | 0) == 0 ? (c[d + 100 >> 2] | 0) > 0 : 0) {
            i = ma(d) | 0;
            i = i << 24 >> 24 == 4 ? g : i;
        } else
            i = g;
        g = t + e | 0;
        r = d + 240 | 0;
        if ((a[g >> 0] | 0) == 22 ? (j = c[r >> 2] | 0, (j | 0) > -1) : 0) {
            o = c[d + 244 >> 2] | 0;
            c[s + 8 >> 2] = c[o + (j << 4) >> 2];
            g = c[o + (j << 4) + 4 >> 2] | 0;
            p = b[o + (j << 4) + 12 >> 1] | 0;
            c[s + 20 >> 2] = c[o + (j << 4) + 8 >> 2];
            c[r >> 2] = j + -1;
            j = p;
        } else {
            c[s + 8 >> 2] = -1;
            j = (a[g >> 0] | 0) == 17 ? (i & 255) + 1 & 65535 : 0;
            c[s + 20 >> 2] = 0;
            na(d, s, i, e, e);
            g = e;
        }
        i = -1;
        m = 1;
        n = e;
        o = e;
        p = g;
        l = j;
        while (1) {
            if ((n | 0) > (f | 0))
                break;
            if ((n | 0) >= (f | 0)) {
                g = f;
                do {
                    g = g + -1 | 0;
                    j = a[t + g >> 0] | 0;
                    if ((g | 0) <= (e | 0))
                        break;
                } while ((1 << (j & 255) & 382976 | 0) != 0);
                if ((j & -2) << 24 >> 24 == 20)
                    break;
                else {
                    k = h;
                    j = m;
                }
            } else {
                g = a[t + n >> 0] | 0;
                if (g << 24 >> 24 == 7)
                    c[r >> 2] = -1;
                a:
                    do
                        if (q) {
                            switch (g << 24 >> 24) {
                            case 13: {
                                    g = 1;
                                    j = m;
                                    break a;
                                }
                            case 2:
                                break;
                            default: {
                                    j = m;
                                    break a;
                                }
                            }
                            b:
                                do
                                    if ((i | 0) > (n | 0))
                                        j = m;
                                    else {
                                        i = n;
                                        while (1) {
                                            i = i + 1 | 0;
                                            if ((i | 0) >= (f | 0)) {
                                                g = 2;
                                                i = f;
                                                j = 1;
                                                break a;
                                            }
                                            g = a[t + i >> 0] | 0;
                                            switch (g << 24 >> 24) {
                                            case 13:
                                            case 1:
                                            case 0: {
                                                    j = g;
                                                    break b;
                                                }
                                            default: {
                                                }
                                            }
                                        }
                                    }
                                while (0);
                            g = j << 24 >> 24 == 13 ? 5 : 2;
                        } else
                            j = m;
                    while (0);
                k = a[16 + (g & 255) >> 0] | 0;
            }
            g = l & 65535;
            k = a[(k & 255) + (48 + (g << 4)) >> 0] | 0;
            l = k & 31;
            k = (k & 255) >>> 5;
            k = (n | 0) == (f | 0) & k << 24 >> 24 == 0 ? 1 : k & 255;
            c:
                do
                    if (!(k << 16 >> 16)) {
                        k = o;
                        g = p;
                    } else {
                        g = a[48 + (g << 4) + 15 >> 0] | 0;
                        switch (k & 7) {
                        case 1: {
                                na(d, s, g, p, n);
                                k = o;
                                g = n;
                                break c;
                            }
                        case 2: {
                                k = n;
                                g = p;
                                break c;
                            }
                        case 3: {
                                na(d, s, g, p, o);
                                na(d, s, 4, o, n);
                                k = o;
                                g = n;
                                break c;
                            }
                        case 4: {
                                na(d, s, g, p, o);
                                k = n;
                                g = o;
                                break c;
                            }
                        default: {
                                k = o;
                                g = p;
                                break c;
                            }
                        }
                    }
                while (0);
            m = j;
            n = n + 1 | 0;
            o = k;
            p = g;
        }
        k = d + 12 | 0;
        if ((c[k >> 2] | 0) == (f | 0) ? (c[d + 108 >> 2] | 0) > 0 : 0) {
            i = oa(d) | 0;
            i = i << 24 >> 24 == 4 ? h : i;
        } else
            i = h;
        g = f;
        do {
            g = g + -1 | 0;
            j = a[t + g >> 0] | 0;
            if ((g | 0) <= (e | 0))
                break;
        } while ((1 << (j & 255) & 382976 | 0) != 0);
        if ((j & -2) << 24 >> 24 == 20 ? (c[k >> 2] | 0) > (f | 0) : 0) {
            f = (c[r >> 2] | 0) + 1 | 0;
            c[r >> 2] = f;
            t = d + 244 | 0;
            b[(c[t >> 2] | 0) + (f << 4) + 12 >> 1] = l;
            c[(c[t >> 2] | 0) + (c[r >> 2] << 4) + 8 >> 2] = c[s + 20 >> 2];
            c[(c[t >> 2] | 0) + (c[r >> 2] << 4) + 4 >> 2] = p;
            c[(c[t >> 2] | 0) + (c[r >> 2] << 4) >> 2] = c[s + 8 >> 2];
            E = u;
            return;
        }
        na(d, s, i, f, f);
        E = u;
        return;
    }
    function ka(b) {
        b = b | 0;
        var d = 0, e = 0, f = 0, g = 0, h = 0, i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0;
        l = c[b + 72 >> 2] | 0;
        n = c[b + 76 >> 2] | 0;
        if (!(c[b + 120 >> 2] & 8248192))
            return;
        h = (a[b + 92 >> 0] | 0) != 0;
        i = b + 94 | 0;
        j = b + 93 | 0;
        k = b + 136 | 0;
        g = b + 132 | 0;
        b = c[b + 128 >> 2] | 0;
        while (1) {
            if ((b | 0) <= 0)
                break;
            while (1) {
                if ((b | 0) <= 0)
                    break;
                e = b + -1 | 0;
                d = a[l + e >> 0] | 0;
                if (!(1 << (d & 255) & 8248192)) {
                    b = e;
                    break;
                }
                do
                    if (h & d << 24 >> 24 == 7)
                        b = 0;
                    else {
                        if (a[i >> 0] | 0 ? (m = c[k >> 2] | 0, (b | 0) > (c[m >> 2] | 0)) : 0) {
                            b = da(c[g >> 2] | 0, m, e) | 0;
                            break;
                        }
                        b = a[j >> 0] | 0;
                    }
                while (0);
                a[n + e >> 0] = b;
                b = e;
            }
            while (1) {
                if ((b | 0) <= 0)
                    break;
                f = b + -1 | 0;
                d = a[l + f >> 0] | 0;
                e = 1 << (d & 255);
                if (!(e & 382976)) {
                    if (h & d << 24 >> 24 == 7) {
                        b = 0;
                        p = 24;
                        break;
                    }
                    if (e & 384 | 0) {
                        p = 20;
                        break;
                    }
                } else
                    a[n + f >> 0] = a[n + b >> 0] | 0;
                b = f;
            }
            do
                if ((p | 0) == 20) {
                    if (a[i >> 0] | 0 ? (o = c[k >> 2] | 0, (b | 0) > (c[o >> 2] | 0)) : 0) {
                        b = da(c[g >> 2] | 0, o, f) | 0;
                        p = 24;
                        break;
                    }
                    b = a[j >> 0] | 0;
                    p = 24;
                }
            while (0);
            if ((p | 0) == 24) {
                p = 0;
                a[n + f >> 0] = b;
                b = f;
            }
        }
        return;
    }
    function la(a, b, d) {
        a = a | 0;
        b = b | 0;
        d = d | 0;
        var e = 0, f = 0, g = 0, h = 0, i = 0, j = 0, k = 0;
        k = a + 328 | 0;
        e = c[k >> 2] | 0;
        do
            if (!e) {
                g = lb(80) | 0;
                e = a + 344 | 0;
                c[e >> 2] = g;
                if (g | 0) {
                    c[k >> 2] = 10;
                    i = e;
                    f = g;
                    h = 10;
                    break;
                }
                c[a + 340 >> 2] = 7;
                return;
            } else {
                i = a + 344 | 0;
                g = c[i >> 2] | 0;
                f = g;
                h = e;
            }
        while (0);
        j = a + 332 | 0;
        e = c[j >> 2] | 0;
        do
            if ((e | 0) >= (h | 0)) {
                f = mb(g, h << 4) | 0;
                c[i >> 2] = f;
                if (f | 0) {
                    c[k >> 2] = c[k >> 2] << 1;
                    e = c[j >> 2] | 0;
                    break;
                }
                c[i >> 2] = g;
                c[a + 340 >> 2] = 7;
                return;
            }
        while (0);
        c[f + (e << 3) >> 2] = b;
        c[f + (e << 3) + 4 >> 2] = d;
        c[j >> 2] = (c[j >> 2] | 0) + 1;
        return;
    }
    function ma(a) {
        a = a | 0;
        var b = 0, d = 0, f = 0, g = 0, h = 0, i = 0;
        g = c[a + 96 >> 2] | 0;
        b = c[a + 100 >> 2] | 0;
        a:
            while (1) {
                if ((b | 0) <= 0) {
                    b = 4;
                    d = 8;
                    break;
                }
                f = b + -1 | 0;
                d = e[g + (f << 1) >> 1] | 0;
                if ((b | 0) != 1 & (d & 64512 | 0) == 56320) {
                    b = b + -2 | 0;
                    i = e[g + (b << 1) >> 1] | 0;
                    h = (i & 64512 | 0) == 55296;
                    d = h ? d + -56613888 + (i << 10) | 0 : d;
                    b = h ? b : f;
                } else
                    b = f;
                switch (((pa(a, d) | 0) & 255) << 24 >> 24) {
                case 13:
                case 1: {
                        d = 6;
                        break a;
                    }
                case 7: {
                        d = 7;
                        break a;
                    }
                case 0: {
                        b = 0;
                        d = 8;
                        break a;
                    }
                default: {
                    }
                }
            }
        if ((d | 0) == 6) {
            i = 1;
            return i | 0;
        } else if ((d | 0) == 7) {
            i = 4;
            return i | 0;
        } else if ((d | 0) == 8)
            return b | 0;
        return 0;
    }
    function na(b, e, f, g, h) {
        b = b | 0;
        e = e | 0;
        f = f | 0;
        g = g | 0;
        h = h | 0;
        var i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0, q = 0, r = 0, s = 0, t = 0;
        l = c[e >> 2] | 0;
        p = c[e + 4 >> 2] | 0;
        s = b + 76 | 0;
        t = c[s >> 2] | 0;
        o = e + 20 | 0;
        k = c[o >> 2] & 255;
        q = d[(f & 255) + (l + (k << 3)) >> 0] | 0;
        r = q & 15;
        c[o >> 2] = r;
        r = a[l + (r << 3) + 7 >> 0] | 0;
        a:
            do
                switch (a[p + (q >>> 4) >> 0] | 0) {
                case 14: {
                        l = e + 8 | 0;
                        m = (a[e + 28 >> 0] | 0) + 1 << 24 >> 24;
                        i = g;
                        while (1) {
                            k = i + -1 | 0;
                            if ((i | 0) <= (c[l >> 2] | 0)) {
                                i = g;
                                break a;
                            }
                            i = t + k | 0;
                            j = a[i >> 0] | 0;
                            if ((j & 255) > (m & 255))
                                a[i >> 0] = (j & 255) + 254;
                            i = k;
                        }
                    }
                case 1: {
                        c[e + 8 >> 2] = g;
                        i = g;
                        break;
                    }
                case 2: {
                        i = c[e + 8 >> 2] | 0;
                        break;
                    }
                case 3: {
                        qa(c[b + 72 >> 2] | 0, c[s >> 2] | 0, c[e + 8 >> 2] | 0, g, (d[e + 28 >> 0] | 0) + 1 & 255);
                        i = g;
                        break;
                    }
                case 4: {
                        qa(c[b + 72 >> 2] | 0, c[s >> 2] | 0, c[e + 8 >> 2] | 0, g, (d[e + 28 >> 0] | 0) + 2 & 255);
                        i = g;
                        break;
                    }
                case 5: {
                        i = e + 12 | 0;
                        j = c[i >> 2] | 0;
                        if ((j | 0) > -1)
                            la(b, j, 1);
                        c[i >> 2] = -1;
                        if (c[b + 328 >> 2] | 0 ? (m = b + 332 | 0, n = b + 336 | 0, (c[m >> 2] | 0) > (c[n >> 2] | 0)) : 0) {
                            j = e + 16 | 0;
                            i = c[j >> 2] | 0;
                            while (1) {
                                i = i + 1 | 0;
                                if ((i | 0) >= (g | 0))
                                    break;
                                q = t + i | 0;
                                a[q >> 0] = (a[q >> 0] | 0) + -2 << 24 >> 24 & -2;
                            }
                            c[n >> 2] = c[m >> 2];
                            c[j >> 2] = -1;
                            if (f << 24 >> 24 != 5) {
                                i = g;
                                break a;
                            }
                            la(b, g, 1);
                            c[n >> 2] = c[m >> 2];
                            i = g;
                            break a;
                        }
                        c[e + 16 >> 2] = -1;
                        if (!(a[l + (k << 3) + 7 >> 0] & 1))
                            i = g;
                        else {
                            i = c[e + 8 >> 2] | 0;
                            i = (i | 0) > 0 ? i : g;
                        }
                        if (f << 24 >> 24 == 5) {
                            la(b, g, 1);
                            c[b + 336 >> 2] = c[b + 332 >> 2];
                        }
                        break;
                    }
                case 6: {
                        if ((c[b + 328 >> 2] | 0) > 0)
                            c[b + 332 >> 2] = c[b + 336 >> 2];
                        c[e + 8 >> 2] = -1;
                        c[e + 12 >> 2] = -1;
                        c[e + 16 >> 2] = h + -1;
                        i = g;
                        break;
                    }
                case 7: {
                        if ((f << 24 >> 24 == 3 ? (a[(c[b + 72 >> 2] | 0) + g >> 0] | 0) == 5 : 0) ? (c[b + 84 >> 2] | 0) != 6 : 0) {
                            i = e + 12 | 0;
                            j = c[i >> 2] | 0;
                            if ((j | 0) == -1) {
                                c[e + 16 >> 2] = h + -1;
                                i = g;
                                break a;
                            }
                            if ((j | 0) > -1) {
                                la(b, j, 1);
                                c[i >> 2] = -2;
                            }
                            la(b, g, 1);
                            i = g;
                            break a;
                        }
                        i = e + 12 | 0;
                        if ((c[i >> 2] | 0) == -1) {
                            c[i >> 2] = g;
                            i = g;
                        } else
                            i = g;
                        break;
                    }
                case 8: {
                        c[e + 16 >> 2] = h + -1;
                        c[e + 8 >> 2] = -1;
                        i = g;
                        break;
                    }
                case 9: {
                        i = g;
                        while (1) {
                            q = i;
                            i = i + -1 | 0;
                            if ((q | 0) <= 0)
                                break;
                            if (a[t + i >> 0] & 1) {
                                j = 36;
                                break;
                            }
                        }
                        if ((j | 0) == 36) {
                            la(b, i, 4);
                            c[b + 336 >> 2] = c[b + 332 >> 2];
                        }
                        c[e + 8 >> 2] = g;
                        i = g;
                        break;
                    }
                case 10: {
                        la(b, g, 1);
                        la(b, g, 2);
                        i = g;
                        break;
                    }
                case 11: {
                        i = b + 336 | 0;
                        j = b + 332 | 0;
                        c[j >> 2] = c[i >> 2];
                        if (f << 24 >> 24 == 5) {
                            la(b, g, 4);
                            c[i >> 2] = c[j >> 2];
                            i = g;
                        } else
                            i = g;
                        break;
                    }
                case 12: {
                        l = (d[e + 28 >> 0] | 0) + (r & 255) | 0;
                        j = l & 255;
                        k = e + 8 | 0;
                        l = l & 255;
                        i = c[k >> 2] | 0;
                        while (1) {
                            if ((i | 0) >= (g | 0))
                                break;
                            m = t + i | 0;
                            if (l >>> 0 > (d[m >> 0] | 0) >>> 0)
                                a[m >> 0] = j;
                            i = i + 1 | 0;
                        }
                        c[b + 336 >> 2] = c[b + 332 >> 2];
                        c[k >> 2] = g;
                        i = g;
                        break;
                    }
                case 13: {
                        n = a[e + 28 >> 0] | 0;
                        f = e + 8 | 0;
                        q = n & 255;
                        o = q + 3 | 0;
                        p = q + 2 | 0;
                        q = q + 1 & 255;
                        i = g;
                        while (1) {
                            k = i + -1 | 0;
                            if ((i | 0) <= (c[f >> 2] | 0)) {
                                i = g;
                                break a;
                            }
                            j = t + k | 0;
                            l = a[j >> 0] | 0;
                            m = l & 255;
                            if ((o | 0) == (m | 0)) {
                                i = k;
                                j = l;
                                while (1) {
                                    if ((o | 0) != (j & 255 | 0))
                                        break;
                                    j = i + -1 | 0;
                                    a[t + i >> 0] = q;
                                    i = j;
                                    j = a[t + j >> 0] | 0;
                                }
                                l = i;
                                while (1) {
                                    i = l + -1 | 0;
                                    if (j << 24 >> 24 != n << 24 >> 24)
                                        break;
                                    l = i;
                                    j = a[t + i >> 0] | 0;
                                }
                                i = l;
                                k = j & 255;
                                j = t + l | 0;
                            } else {
                                i = k;
                                k = m;
                            }
                            a[j >> 0] = (p | 0) == (k | 0) ? n : q;
                        }
                    }
                default:
                    i = g;
                }
            while (0);
        if (!(r << 24 >> 24 != 0 | (i | 0) < (g | 0)))
            return;
        j = (d[e + 28 >> 0] | 0) + (r & 255) & 255;
        if ((i | 0) < (c[e + 24 >> 2] | 0)) {
            qa(c[b + 72 >> 2] | 0, c[s >> 2] | 0, i, h, j);
            return;
        }
        while (1) {
            if ((i | 0) >= (h | 0))
                break;
            a[t + i >> 0] = j;
            i = i + 1 | 0;
        }
        return;
    }
    function oa(a) {
        a = a | 0;
        var b = 0, d = 0, f = 0, g = 0, h = 0, i = 0, j = 0;
        g = c[a + 104 >> 2] | 0;
        h = c[a + 108 >> 2] | 0;
        b = 0;
        a:
            while (1) {
                if ((b | 0) >= (h | 0)) {
                    b = 4;
                    d = 7;
                    break;
                }
                f = b + 1 | 0;
                d = e[g + (b << 1) >> 1] | 0;
                if ((f | 0) == (h | 0) | (d & 64512 | 0) != 55296)
                    b = f;
                else {
                    j = e[g + (f << 1) >> 1] | 0;
                    i = (j & 64512 | 0) == 56320;
                    d = i ? (d << 10) + -56613888 + j | 0 : d;
                    b = i ? b + 2 | 0 : f;
                }
                switch (((pa(a, d) | 0) & 255) << 24 >> 24) {
                case 0: {
                        b = 0;
                        d = 7;
                        break a;
                    }
                case 13:
                case 1: {
                        d = 8;
                        break a;
                    }
                case 5: {
                        d = 6;
                        break a;
                    }
                case 2: {
                        b = 2;
                        d = 9;
                        break a;
                    }
                default: {
                    }
                }
            }
        if ((d | 0) == 6) {
            j = 3;
            return j | 0;
        } else if ((d | 0) == 7) {
            j = b;
            return j | 0;
        } else if ((d | 0) == 8) {
            j = 1;
            return j | 0;
        } else if ((d | 0) == 9)
            return b | 0;
        return 0;
    }
    function pa(a, b) {
        a = a | 0;
        b = b | 0;
        var d = 0, e = 0;
        e = c[a + 352 >> 2] | 0;
        if (!((e | 0) != 0 ? (d = I[e & 0](c[a + 356 >> 2] | 0, b) | 0, (d | 0) != 23) : 0))
            d = tb(b) | 0;
        return ((d | 0) > 22 ? 10 : d) | 0;
    }
    function qa(b, c, d, e, f) {
        b = b | 0;
        c = c | 0;
        d = d | 0;
        e = e | 0;
        f = f | 0;
        var g = 0, h = 0;
        g = 0;
        while (1) {
            if ((d | 0) >= (e | 0))
                break;
            h = a[b + d >> 0] | 0;
            g = g + ((h << 24 >> 24 == 22) << 31 >> 31) | 0;
            if (!g)
                a[c + d >> 0] = f;
            d = d + 1 | 0;
            g = g + ((h & -2) << 24 >> 24 == 20 & 1) | 0;
        }
        return;
    }
    function ra(a) {
        a = a | 0;
        if ((a & 2154498 | 0) == 0 ? (a & 32 | 0) == 0 | (a & 8249304 | 0) == 0 : 0) {
            a = 0;
            return a | 0;
        }
        a = (a & 26220581 | 0) == 0 ? 1 : 2;
        return a | 0;
    }
    function sa(d, e) {
        d = d | 0;
        e = e | 0;
        var f = 0, g = 0, h = 0;
        c[e >> 2] = d;
        c[e + 492 >> 2] = 0;
        b[e + 500 >> 1] = 0;
        b[e + 502 >> 1] = 0;
        h = d + 94 | 0;
        if ((a[h >> 0] | 0) != 0 ? (f = c[d + 136 >> 2] | 0, (c[f >> 2] | 0) <= 0) : 0)
            f = da(c[d + 132 >> 2] | 0, f, 0) | 0;
        else
            f = a[d + 93 >> 0] | 0;
        a[e + 504 >> 0] = f;
        if ((a[h >> 0] | 0) != 0 ? (g = c[d + 136 >> 2] | 0, (c[g >> 2] | 0) <= 0) : 0)
            f = da(c[d + 132 >> 2] | 0, g, 0) | 0;
        else
            f = a[d + 93 >> 0] | 0;
        f = f & 1;
        a[e + 506 >> 0] = f;
        a[e + 505 >> 0] = f;
        c[e + 508 >> 2] = f & 255;
        c[e + 496 >> 2] = 0;
        f = c[d + 52 >> 2] | 0;
        if (!f) {
            c[e + 484 >> 2] = e + 4;
            g = 20;
            h = e + 488 | 0;
            c[h >> 2] = g;
            d = d + 84 | 0;
            d = c[d >> 2] | 0;
            h = (d | 0) == 1;
            d = (d | 0) == 6;
            d = h | d;
            d = d & 1;
            e = e + 2528 | 0;
            a[e >> 0] = d;
            return;
        } else {
            c[e + 484 >> 2] = f;
            g = ((c[d + 28 >> 2] | 0) >>> 0) / 24 | 0;
            h = e + 488 | 0;
            c[h >> 2] = g;
            d = d + 84 | 0;
            d = c[d >> 2] | 0;
            h = (d | 0) == 1;
            d = (d | 0) == 6;
            d = h | d;
            d = d & 1;
            e = e + 2528 | 0;
            a[e >> 0] = d;
            return;
        }
    }
    function ta(d, e) {
        d = d | 0;
        e = e | 0;
        c[d + 492 >> 2] = 0;
        b[d + 502 >> 1] = 0;
        a[d + 504 >> 0] = e;
        e = e & 1;
        a[d + 506 >> 0] = e;
        a[d + 505 >> 0] = e;
        c[d + 508 >> 2] = e & 255;
        c[d + 496 >> 2] = 0;
        return;
    }
    function ua(f, g) {
        f = f | 0;
        g = g | 0;
        var h = 0, i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0, q = 0, r = 0, s = 0, t = 0;
        s = c[f + 492 >> 2] | 0;
        p = f + 496 + (s << 4) | 0;
        h = c[f >> 2] | 0;
        r = (c[h + 72 >> 2] | 0) + g | 0;
        m = a[r >> 0] | 0;
        do
            if (m << 24 >> 24 == 10) {
                h = b[(c[h + 4 >> 2] | 0) + (g << 1) >> 1] | 0;
                l = f + 496 + (s << 4) + 4 | 0;
                i = e[l >> 1] | 0;
                o = f + 484 | 0;
                j = h & 65535;
                n = e[f + 496 + (s << 4) + 6 >> 1] | 0;
                while (1) {
                    t = n;
                    n = n + -1 | 0;
                    if ((t | 0) <= (i | 0))
                        break;
                    if ((c[(c[o >> 2] | 0) + (n * 24 | 0) + 4 >> 2] | 0) == (j | 0)) {
                        q = 5;
                        break;
                    }
                }
                if ((q | 0) == 5) {
                    h = ya(f, n, g) | 0;
                    if (h << 24 >> 24 == 10)
                        break;
                    a[f + 496 + (s << 4) + 10 >> 0] = 10;
                    c[f + 496 + (s << 4) + 12 >> 2] = h & 255;
                    c[p >> 2] = g;
                    h = c[(c[f >> 2] | 0) + 76 >> 2] | 0;
                    i = d[h + g >> 0] | 0;
                    if (i & 128) {
                        i = i & 1;
                        a[f + 496 + (s << 4) + 9 >> 0] = i;
                        i = 1 << i;
                        h = e[l >> 1] | 0;
                        while (1) {
                            if ((h | 0) >= (n | 0))
                                break;
                            t = (c[o >> 2] | 0) + (h * 24 | 0) + 12 | 0;
                            b[t >> 1] = i | e[t >> 1];
                            h = h + 1 | 0;
                        }
                        h = (c[(c[f >> 2] | 0) + 76 >> 2] | 0) + g | 0;
                        a[h >> 0] = a[h >> 0] & 127;
                        h = c[(c[f >> 2] | 0) + 76 >> 2] | 0;
                    }
                    t = h + (c[(c[o >> 2] | 0) + (n * 24 | 0) >> 2] | 0) | 0;
                    a[t >> 0] = a[t >> 0] & 127;
                    t = 1;
                    return t | 0;
                }
                if ((h << 16 >> 16 ? (k = (zb(j) | 0) & 65535, h << 16 >> 16 != k << 16 >> 16) : 0) ? (wb(j) | 0) == 1 : 0) {
                    a:
                        do
                            if (k << 16 >> 16 < 12297) {
                                switch (k << 16 >> 16) {
                                case 9002:
                                    break;
                                default:
                                    break a;
                                }
                                if (!((za(f, 12297, g) | 0) << 24 >> 24)) {
                                    t = 0;
                                    return t | 0;
                                }
                            } else {
                                switch (k << 16 >> 16) {
                                case 12297:
                                    break;
                                default:
                                    break a;
                                }
                                if (!((za(f, 9002, g) | 0) << 24 >> 24)) {
                                    t = 0;
                                    return t | 0;
                                }
                            }
                        while (0);
                    if (!((za(f, k, g) | 0) << 24 >> 24)) {
                        t = 0;
                        return t | 0;
                    }
                }
            }
        while (0);
        h = d[(c[(c[f >> 2] | 0) + 76 >> 2] | 0) + g >> 0] | 0;
        b:
            do
                if (!(h & 128))
                    switch (m << 24 >> 24) {
                    case 0:
                    case 1:
                    case 13: {
                            h = m << 24 >> 24 != 0;
                            a[f + 496 + (s << 4) + 10 >> 0] = m;
                            a[f + 496 + (s << 4) + 9 >> 0] = m;
                            c[f + 496 + (s << 4) + 12 >> 2] = h & 1;
                            c[p >> 2] = g;
                            h = h & 1;
                            q = 35;
                            break b;
                        }
                    case 2: {
                            a[f + 496 + (s << 4) + 10 >> 0] = 2;
                            switch (a[f + 496 + (s << 4) + 9 >> 0] | 0) {
                            case 0: {
                                    if (!(a[f + 2528 >> 0] | 0))
                                        a[r >> 0] = 23;
                                    c[f + 496 + (s << 4) + 12 >> 2] = 0;
                                    c[p >> 2] = g;
                                    h = 0;
                                    break b;
                                }
                            case 13: {
                                    h = 5;
                                    break;
                                }
                            default:
                                h = 24;
                            }
                            a[r >> 0] = h;
                            c[f + 496 + (s << 4) + 12 >> 2] = 1;
                            c[p >> 2] = g;
                            h = 1;
                            break b;
                        }
                    case 5: {
                            a[f + 496 + (s << 4) + 10 >> 0] = 5;
                            c[f + 496 + (s << 4) + 12 >> 2] = 1;
                            c[p >> 2] = g;
                            h = 1;
                            break b;
                        }
                    case 17: {
                            h = a[f + 496 + (s << 4) + 10 >> 0] | 0;
                            if (h << 24 >> 24 != 10) {
                                q = 35;
                                break b;
                            }
                            a[r >> 0] = 10;
                            t = 1;
                            return t | 0;
                        }
                    default: {
                            a[f + 496 + (s << 4) + 10 >> 0] = m;
                            h = m;
                            q = 35;
                            break b;
                        }
                    }
                else {
                    i = h & 1;
                    h = i & 255;
                    if ((m + -8 & 255) >= 3)
                        a[r >> 0] = h;
                    a[f + 496 + (s << 4) + 10 >> 0] = h;
                    a[f + 496 + (s << 4) + 9 >> 0] = h;
                    c[f + 496 + (s << 4) + 12 >> 2] = i;
                    c[p >> 2] = g;
                    q = 35;
                }
            while (0);
        c:
            do
                if ((q | 0) == 35) {
                    switch (h << 24 >> 24) {
                    case 0:
                    case 1:
                    case 13:
                        break c;
                    default:
                        h = 1;
                    }
                    return h | 0;
                }
            while (0);
        j = 1 << (h << 24 >> 24 != 0 & 1);
        k = f + 496 + (s << 4) + 6 | 0;
        l = f + 484 | 0;
        h = e[f + 496 + (s << 4) + 4 >> 1] | 0;
        while (1) {
            if (h >>> 0 >= (e[k >> 1] | 0) >>> 0) {
                h = 1;
                break;
            }
            i = c[l >> 2] | 0;
            if ((c[i + (h * 24 | 0) >> 2] | 0) < (g | 0)) {
                t = i + (h * 24 | 0) + 12 | 0;
                b[t >> 1] = j | e[t >> 1];
            }
            h = h + 1 | 0;
        }
        return h | 0;
    }
    function va(e, f, g, h) {
        e = e | 0;
        f = f | 0;
        g = g | 0;
        h = h | 0;
        var i = 0;
        i = c[e + 492 >> 2] | 0;
        if (1 << (d[(c[(c[e >> 2] | 0) + 72 >> 2] | 0) + f >> 0] | 0) & 7864320 | 0)
            return;
        b[e + 496 + (i << 4) + 6 >> 1] = b[e + 496 + (i << 4) + 4 >> 1] | 0;
        a[e + 496 + (i << 4) + 8 >> 0] = h;
        h = ((h & 127) > (g & 127) ? h : g) & 1;
        a[e + 496 + (i << 4) + 10 >> 0] = h;
        a[e + 496 + (i << 4) + 9 >> 0] = h;
        c[e + 496 + (i << 4) + 12 >> 2] = h & 255;
        c[e + 496 + (i << 4) >> 2] = f;
        return;
    }
    function wa(d, e) {
        d = d | 0;
        e = e | 0;
        var f = 0, g = 0, h = 0;
        g = d + 492 | 0;
        h = c[g >> 2] | 0;
        f = d + 496 + (h << 4) | 0;
        a[d + 496 + (h << 4) + 10 >> 0] = 10;
        d = b[d + 496 + (h << 4) + 6 >> 1] | 0;
        c[g >> 2] = h + 1;
        b[f + 22 >> 1] = d;
        b[f + 20 >> 1] = d;
        a[f + 24 >> 0] = e;
        e = e & 1;
        a[f + 26 >> 0] = e;
        a[f + 25 >> 0] = e;
        c[f + 28 >> 2] = e & 255;
        c[f + 16 >> 2] = 0;
        return;
    }
    function xa(b) {
        b = b | 0;
        var d = 0, e = 0;
        e = b + 492 | 0;
        d = (c[e >> 2] | 0) + -1 | 0;
        c[e >> 2] = d;
        a[b + 496 + (d << 4) + 10 >> 0] = 10;
        return;
    }
    function ya(d, f, g) {
        d = d | 0;
        f = f | 0;
        g = g | 0;
        var h = 0, i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0, q = 0;
        o = c[d + 492 >> 2] | 0;
        q = d + 484 | 0;
        m = c[q >> 2] | 0;
        j = a[d + 496 + (o << 4) + 8 >> 0] & 1;
        h = j & 255;
        i = b[m + (f * 24 | 0) + 12 >> 1] | 0;
        if (!(j << 24 >> 24))
            if (!(i & 1))
                l = 4;
            else {
                p = 0;
                k = 0;
            }
        else if (!(i & 2))
            l = 4;
        else {
            p = 1;
            k = 0;
        }
        do
            if ((l | 0) == 4) {
                if (i & 3) {
                    p = c[m + (f * 24 | 0) + 16 >> 2] | 0;
                    p = (p | 0) == (h | 0) ? j : p & 255;
                    k = (e[d + 496 + (o << 4) + 4 >> 1] | 0 | 0) != (f | 0);
                    break;
                }
                b[d + 496 + (o << 4) + 6 >> 1] = f;
                q = 10;
                return q | 0;
            }
        while (0);
        n = m + (f * 24 | 0) | 0;
        a[(c[(c[d >> 2] | 0) + 72 >> 2] | 0) + (c[n >> 2] | 0) >> 0] = p;
        a[(c[(c[d >> 2] | 0) + 72 >> 2] | 0) + g >> 0] = p;
        Aa(d, f, c[n >> 2] | 0, p);
        if (!k) {
            i = d + 496 + (o << 4) + 6 | 0;
            h = b[d + 496 + (o << 4) + 4 >> 1] | 0;
            j = f & 65535;
            while (1) {
                b[i >> 1] = j;
                if ((j & 65535) <= (h & 65535)) {
                    h = p;
                    l = 21;
                    break;
                }
                if ((c[(c[q >> 2] | 0) + (((j & 65535) + -1 | 0) * 24 | 0) >> 2] | 0) == (c[n >> 2] | 0))
                    j = j + -1 << 16 >> 16;
                else {
                    h = p;
                    l = 21;
                    break;
                }
            }
            if ((l | 0) == 21)
                return h | 0;
        }
        c[m + (f * 24 | 0) + 4 >> 2] = 0 - g;
        j = d + 496 + (o << 4) + 4 | 0;
        h = f;
        while (1) {
            i = h + -1 | 0;
            if ((h | 0) <= (e[j >> 1] | 0 | 0))
                break;
            h = c[q >> 2] | 0;
            if ((c[h + (i * 24 | 0) >> 2] | 0) != (c[n >> 2] | 0))
                break;
            c[h + (i * 24 | 0) + 4 >> 2] = 0;
            h = i;
        }
        i = d + 496 + (o << 4) + 6 | 0;
        while (1) {
            f = f + 1 | 0;
            if ((f | 0) >= (e[i >> 1] | 0 | 0)) {
                h = p;
                l = 21;
                break;
            }
            h = c[q >> 2] | 0;
            if ((c[h + (f * 24 | 0) >> 2] | 0) >= (g | 0)) {
                h = p;
                l = 21;
                break;
            }
            h = h + (f * 24 | 0) + 4 | 0;
            if ((c[h >> 2] | 0) > 0)
                c[h >> 2] = 0;
        }
        if ((l | 0) == 21)
            return h | 0;
        return 0;
    }
    function za(a, d, f) {
        a = a | 0;
        d = d | 0;
        f = f | 0;
        var g = 0, h = 0, i = 0, j = 0, k = 0, l = 0, m = 0;
        l = c[a + 492 >> 2] | 0;
        m = a + 496 + (l << 4) + 6 | 0;
        g = e[m >> 1] | 0;
        k = a + 488 | 0;
        if ((c[k >> 2] | 0) > (g | 0))
            h = c[a + 484 >> 2] | 0;
        else {
            j = c[a >> 2] | 0;
            i = j + 52 | 0;
            j = j + 28 | 0;
            if (!((aa(i, j, 1, g * 48 | 0) | 0) << 24 >> 24)) {
                m = 0;
                return m | 0;
            }
            g = a + 484 | 0;
            h = c[g >> 2] | 0;
            if ((h | 0) == (a + 4 | 0))
                ec(c[i >> 2] | 0, h | 0, 480) | 0;
            h = c[i >> 2] | 0;
            c[g >> 2] = h;
            c[k >> 2] = ((c[j >> 2] | 0) >>> 0) / 24 | 0;
            g = e[m >> 1] | 0;
        }
        c[h + (g * 24 | 0) >> 2] = f;
        c[h + (g * 24 | 0) + 4 >> 2] = d & 65535;
        c[h + (g * 24 | 0) + 16 >> 2] = c[a + 496 + (l << 4) + 12 >> 2];
        c[h + (g * 24 | 0) + 8 >> 2] = c[a + 496 + (l << 4) >> 2];
        b[h + (g * 24 | 0) + 12 >> 1] = 0;
        b[m >> 1] = (b[m >> 1] | 0) + 1 << 16 >> 16;
        m = 1;
        return m | 0;
    }
    function Aa(b, d, f, g) {
        b = b | 0;
        d = d | 0;
        f = f | 0;
        g = g | 0;
        var h = 0, i = 0, j = 0, k = 0, l = 0, m = 0, n = 0;
        m = c[(c[b >> 2] | 0) + 72 >> 2] | 0;
        h = d + 1 | 0;
        i = g & 255;
        j = b + 496 + (c[b + 492 >> 2] << 4) + 6 | 0;
        d = (c[b + 484 >> 2] | 0) + (h * 24 | 0) | 0;
        while (1) {
            if ((h | 0) >= (e[j >> 1] | 0 | 0)) {
                d = 9;
                break;
            }
            k = d + 4 | 0;
            if ((c[k >> 2] | 0) <= -1) {
                if ((c[d + 8 >> 2] | 0) > (f | 0)) {
                    d = 9;
                    break;
                }
                l = c[d >> 2] | 0;
                if ((l | 0) > (f | 0)) {
                    if ((c[d + 16 >> 2] | 0) == (i | 0)) {
                        d = 9;
                        break;
                    }
                    a[m + l >> 0] = g;
                    n = 0 - (c[k >> 2] | 0) | 0;
                    a[m + n >> 0] = g;
                    c[k >> 2] = 0;
                    Aa(b, h, l, g);
                    Aa(b, h, n, g);
                }
            }
            d = d + 24 | 0;
            h = h + 1 | 0;
        }
        if ((d | 0) == 9)
            return;
    }
    function Ba(a) {
        a = a | 0;
        var b = 0, d = 0, f = 0, g = 0, h = 0, i = 0, j = 0, k = 0;
        h = c[a + 96 >> 2] | 0;
        i = c[a + 100 >> 2] | 0;
        g = 0;
        b = 10;
        while (1) {
            if ((g | 0) >= (i | 0))
                break;
            f = g + 1 | 0;
            d = e[h + (g << 1) >> 1] | 0;
            if ((f | 0) == (i | 0) | (d & 64512 | 0) != 55296)
                g = f;
            else {
                k = e[h + (f << 1) >> 1] | 0;
                j = (k & 64512 | 0) == 56320;
                d = j ? (d << 10) + -56613888 + k | 0 : d;
                g = j ? g + 2 | 0 : f;
            }
            d = pa(a, d) | 0;
            f = d & 255;
            a:
                do
                    if (b << 24 >> 24 == 10) {
                        switch (f << 24 >> 24) {
                        case 13:
                        case 1:
                        case 0:
                            break;
                        default: {
                                b = 10;
                                break a;
                            }
                        }
                        b = f;
                    } else
                        b = (d & 255 | 0) == 7 ? 10 : b;
                while (0);
        }
        return b | 0;
    }
    function Ca(a) {
        a = a | 0;
        var b = 0, d = 0, e = 0;
        d = c[a + 132 >> 2] | 0;
        e = a + 136 | 0;
        b = c[e >> 2] | 0;
        if ((b | 0) != (a + 140 | 0)) {
            b = a + 56 | 0;
            if (!((aa(b, a + 32 | 0, 1, d << 4) | 0) << 24 >> 24)) {
                e = 0;
                return e | 0;
            }
            c[e >> 2] = c[b >> 2];
            e = 1;
            return e | 0;
        }
        if ((d | 0) < 11) {
            e = 1;
            return e | 0;
        }
        d = a + 56 | 0;
        if (!((aa(d, a + 32 | 0, 1, 160) | 0) << 24 >> 24)) {
            e = 0;
            return e | 0;
        }
        a = c[d >> 2] | 0;
        c[e >> 2] = a;
        d = a + 80 | 0;
        do {
            c[a >> 2] = c[b >> 2];
            a = a + 4 | 0;
            b = b + 4 | 0;
        } while ((a | 0) < (d | 0));
        e = 1;
        return e | 0;
    }
    function Da(a) {
        a = a | 0;
        var b = 0;
        do
            if (!a)
                a = 0;
            else {
                b = c[a >> 2] | 0;
                if ((b | 0) != (a | 0)) {
                    if (!b) {
                        a = 0;
                        break;
                    }
                    if ((c[b >> 2] | 0) != (b | 0)) {
                        a = 0;
                        break;
                    }
                }
                a = c[a + 12 >> 2] | 0;
            }
        while (0);
        return a | 0;
    }
    function Ea(a) {
        a = a | 0;
        var b = 0;
        do
            if (!a)
                a = 0;
            else {
                b = c[a >> 2] | 0;
                if ((b | 0) != (a | 0)) {
                    if (!b) {
                        a = 0;
                        break;
                    }
                    if ((c[b >> 2] | 0) != (b | 0)) {
                        a = 0;
                        break;
                    }
                }
                a = c[a + 132 >> 2] | 0;
            }
        while (0);
        return a | 0;
    }
    function Fa(a, b, d, e) {
        a = a | 0;
        b = b | 0;
        d = d | 0;
        e = e | 0;
        var f = 0;
        if (!e)
            return;
        if (($(c[e >> 2] | 0) | 0) << 24 >> 24)
            return;
        do
            if (a | 0) {
                f = c[a >> 2] | 0;
                if ((f | 0) != (a | 0)) {
                    if (!f)
                        break;
                    if ((c[f >> 2] | 0) != (f | 0))
                        break;
                }
                if ((b | 0) >= 0 ? (c[a + 132 >> 2] | 0) > (b | 0) : 0) {
                    if (!d)
                        return;
                    c[d >> 2] = c[(c[f + 136 >> 2] | 0) + (b << 3) >> 2];
                    return;
                }
                c[e >> 2] = 1;
                return;
            }
        while (0);
        c[e >> 2] = 27;
        return;
    }
    function Ga(a, b, d) {
        a = a | 0;
        b = b | 0;
        d = d | 0;
        var e = 0, f = 0;
        if (!d) {
            f = -1;
            return f | 0;
        }
        if (($(c[d >> 2] | 0) | 0) << 24 >> 24) {
            f = -1;
            return f | 0;
        }
        do
            if (a | 0) {
                f = c[a >> 2] | 0;
                if ((f | 0) != (a | 0)) {
                    if (!f)
                        break;
                    if ((c[f >> 2] | 0) != (f | 0))
                        break;
                }
                if ((b | 0) >= 0 ? (c[f + 12 >> 2] | 0) > (b | 0) : 0) {
                    e = c[f + 136 >> 2] | 0;
                    a = 0;
                    while (1)
                        if ((c[e + (a << 3) >> 2] | 0) > (b | 0))
                            break;
                        else
                            a = a + 1 | 0;
                    Fa(f, a, 0, d);
                    f = a;
                    return f | 0;
                }
                c[d >> 2] = 1;
                f = -1;
                return f | 0;
            }
        while (0);
        c[d >> 2] = 27;
        f = -1;
        return f | 0;
    }
    function Ha(a, b, d, e, f) {
        a = a | 0;
        b = b | 0;
        d = d | 0;
        e = e | 0;
        f = f | 0;
        var g = 0;
        if (!f) {
            f = 0;
            return f | 0;
        }
        if ((Ia(c[f >> 2] | 0) | 0) << 24 >> 24) {
            f = 0;
            return f | 0;
        }
        if (!((a | 0) == 0 | (b | 0) < -1 | (e | 0) < 0) ? (g = (d | 0) == 0, !(g & (e | 0) > 0)) : 0) {
            do
                if (!g) {
                    if (!(a >>> 0 >= d >>> 0 & (d + (e << 1) | 0) >>> 0 > a >>> 0) ? !(d >>> 0 >= a >>> 0 & (a + (b << 1) | 0) >>> 0 > d >>> 0) : 0)
                        break;
                    c[f >> 2] = 1;
                    f = 0;
                    return f | 0;
                }
            while (0);
            if ((b | 0) == -1)
                b = ob(a) | 0;
            if ((b | 0) > 0)
                b = Ja(a, b, d, e, 10, f) | 0;
            else
                b = 0;
            f = qb(d, e, b, f) | 0;
            return f | 0;
        }
        c[f >> 2] = 1;
        f = 0;
        return f | 0;
    }
    function Ia(a) {
        a = a | 0;
        return (a | 0) > 0 | 0;
    }
    function Ja(a, d, f, g, h, i) {
        a = a | 0;
        d = d | 0;
        f = f | 0;
        g = g | 0;
        h = h | 0;
        i = i | 0;
        var j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0;
        l = h & 65535;
        switch (l & 11) {
        case 0: {
                if ((g | 0) < (d | 0)) {
                    c[i >> 2] = 15;
                    o = d;
                    return o | 0;
                }
                k = d;
                h = f;
                while (1) {
                    j = k + -1 | 0;
                    f = k + -2 | 0;
                    if ((k | 0) > 1 ? (b[a + (j << 1) >> 1] & -1024) << 16 >> 16 == -9216 : 0)
                        j = (b[a + (f << 1) >> 1] & -1024) << 16 >> 16 == -10240 ? f : j;
                    f = j;
                    do {
                        n = f;
                        f = f + 1 | 0;
                        o = h;
                        h = h + 2 | 0;
                        b[o >> 1] = b[a + (n << 1) >> 1] | 0;
                    } while ((f | 0) < (k | 0));
                    if ((j | 0) > 0)
                        k = j;
                    else {
                        h = d;
                        break;
                    }
                }
                return h | 0;
            }
        case 1: {
                if ((g | 0) < (d | 0)) {
                    c[i >> 2] = 15;
                    o = d;
                    return o | 0;
                }
                i = d;
                g = f;
                while (1) {
                    f = i;
                    while (1) {
                        j = f + -1 | 0;
                        h = e[a + (j << 1) >> 1] | 0;
                        if ((f | 0) > 1 & (h & 64512 | 0) == 56320) {
                            f = f + -2 | 0;
                            n = e[a + (f << 1) >> 1] | 0;
                            o = (n & 64512 | 0) == 55296;
                            h = o ? h + -56613888 + (n << 10) | 0 : h;
                            f = o ? f : j;
                        } else
                            f = j;
                        if ((f | 0) <= 0) {
                            k = 0;
                            break;
                        }
                        if (!(1 << ((sb(h) | 0) << 24 >> 24) & 448)) {
                            k = 1;
                            break;
                        }
                    }
                    j = f;
                    h = g;
                    do {
                        n = j;
                        j = j + 1 | 0;
                        o = h;
                        h = h + 2 | 0;
                        b[o >> 1] = b[a + (n << 1) >> 1] | 0;
                    } while ((j | 0) < (i | 0));
                    if (k) {
                        i = f;
                        g = h;
                    } else {
                        h = d;
                        break;
                    }
                }
                return h | 0;
            }
        default: {
                n = (l & 8 | 0) != 0;
                if (n) {
                    j = a;
                    k = d;
                    h = 0;
                    while (1) {
                        m = j;
                        j = j + 2 | 0;
                        m = e[m >> 1] | 0;
                        h = h + ((((m + -8294 | 0) >>> 0 < 4 | ((m & 65532 | 0) == 8204 | (m + -8234 | 0) >>> 0 < 5)) ^ 1) & 1) | 0;
                        if ((k | 0) <= 1)
                            break;
                        else
                            k = k + -1 | 0;
                    }
                    a = j + (0 - d << 1) | 0;
                } else
                    h = d;
                if ((h | 0) > (g | 0)) {
                    c[i >> 2] = 15;
                    o = h;
                    return o | 0;
                }
                m = (l & 1 | 0) == 0;
                l = (l & 2 | 0) == 0;
                i = d;
                while (1) {
                    k = i + -1 | 0;
                    j = e[a + (k << 1) >> 1] | 0;
                    if ((i | 0) > 1 & (j & 64512 | 0) == 56320) {
                        d = i + -2 | 0;
                        p = e[a + (d << 1) >> 1] | 0;
                        g = (p & 64512 | 0) == 55296;
                        j = g ? j + -56613888 + (p << 10) | 0 : j;
                        k = g ? d : k;
                    }
                    a:
                        do
                            if (!m)
                                while (1) {
                                    if ((k | 0) <= 0)
                                        break a;
                                    if (!(1 << ((sb(j) | 0) << 24 >> 24) & 448))
                                        break a;
                                    g = k + -1 | 0;
                                    j = e[a + (g << 1) >> 1] | 0;
                                    if ((k | 0) > 1 & (j & 64512 | 0) == 56320) {
                                        k = k + -2 | 0;
                                        d = e[a + (k << 1) >> 1] | 0;
                                        p = (d & 64512 | 0) == 55296;
                                        j = p ? j + -56613888 + (d << 10) | 0 : j;
                                        k = p ? k : g;
                                    } else
                                        k = g;
                                }
                        while (0);
                    if (n) {
                        if ((j & -4 | 0) != 8204)
                            switch (j | 0) {
                            case 8234:
                            case 8235:
                            case 8236:
                            case 8237:
                            case 8238:
                            case 8294:
                            case 8295:
                            case 8296:
                            case 8297:
                                break;
                            default:
                                o = 40;
                            }
                    } else
                        o = 40;
                    b:
                        do
                            if ((o | 0) == 40) {
                                o = 0;
                                if (l)
                                    g = k;
                                else {
                                    j = yb(j) | 0;
                                    if (j >>> 0 < 65536) {
                                        b[f >> 1] = j;
                                        j = 1;
                                    } else {
                                        b[f >> 1] = (j >>> 10) + 55232;
                                        b[f + 2 >> 1] = j & 1023 | 56320;
                                        j = 2;
                                    }
                                    g = j + k | 0;
                                    f = f + (j << 1) | 0;
                                }
                                j = g;
                                while (1) {
                                    if ((j | 0) >= (i | 0))
                                        break b;
                                    b[f >> 1] = b[a + (j << 1) >> 1] | 0;
                                    j = j + 1 | 0;
                                    f = f + 2 | 0;
                                }
                            }
                        while (0);
                    if ((k | 0) > 0)
                        i = k;
                    else
                        break;
                }
                return h | 0;
            }
        }
        return 0;
    }
    function Ka(e, f, g, h, i) {
        e = e | 0;
        f = f | 0;
        g = g | 0;
        h = h | 0;
        i = i | 0;
        var j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0, q = 0, r = 0, s = 0, t = 0, u = 0, v = 0, w = 0, x = 0, y = 0, z = 0;
        y = E;
        E = E + 16 | 0;
        w = y + 4 | 0;
        x = y;
        if (!i) {
            i = 0;
            E = y;
            return i | 0;
        }
        if ((Ia(c[i >> 2] | 0) | 0) << 24 >> 24) {
            i = 0;
            E = y;
            return i | 0;
        }
        if (((e | 0 ? (v = c[e + 4 >> 2] | 0, v | 0) : 0) ? (j = c[e + 12 >> 2] | 0, (j | g | 0) >= 0) : 0) ? (k = (f | 0) == 0, !(k & (g | 0) > 0)) : 0) {
            do
                if (!k) {
                    if (!(v >>> 0 >= f >>> 0 & v >>> 0 < (f + (g << 1) | 0) >>> 0)) {
                        if (v >>> 0 > f >>> 0)
                            break;
                        if ((v + (c[e + 8 >> 2] << 1) | 0) >>> 0 <= f >>> 0)
                            break;
                    }
                    c[i >> 2] = 1;
                    i = 0;
                    E = y;
                    return i | 0;
                }
            while (0);
            if (!j) {
                qb(f, g, 0, i) | 0;
                i = 0;
                E = y;
                return i | 0;
            }
            t = Qa(e, i) | 0;
            if ((Ia(c[i >> 2] | 0) | 0) << 24 >> 24) {
                i = 0;
                E = y;
                return i | 0;
            }
            k = c[e + 88 >> 2] | 0;
            u = h & -13;
            u = (k & 2 | 0) == 0 ? (k & 1 | 0) == 0 ? h : u | 4 : u | 8;
            u = ((c[e + 84 >> 2] | 0) + -3 | 0) >>> 0 < 4 ? u : u & -5;
            k = u & 65535;
            j = (k & 4 | 0) != 0;
            a:
                do
                    if (!(k & 16)) {
                        if (!j) {
                            n = k & 65533;
                            l = f;
                            j = g;
                            m = 0;
                            while (1) {
                                if ((m | 0) >= (t | 0))
                                    break a;
                                s = (Va(e, m, w, x) | 0) == 0;
                                k = v + (c[w >> 2] << 1) | 0;
                                h = c[x >> 2] | 0;
                                if (s)
                                    k = La(k, h, l, j, n, i) | 0;
                                else
                                    k = Ja(k, h, l, j, u, i) | 0;
                                c[x >> 2] = k;
                                l = (l | 0) == 0 ? 0 : l + (k << 1) | 0;
                                j = j - k | 0;
                                m = m + 1 | 0;
                            }
                        }
                        q = c[e + 72 >> 2] | 0;
                        r = e + 224 | 0;
                        s = e + 80 | 0;
                        p = k & 65533;
                        j = g;
                        o = 0;
                        k = f;
                        while (1) {
                            if ((o | 0) >= (t | 0))
                                break a;
                            z = Va(e, o, w, x) | 0;
                            l = c[w >> 2] | 0;
                            n = v + (l << 1) | 0;
                            h = c[(c[r >> 2] | 0) + (o * 12 | 0) + 8 >> 2] | 0;
                            h = (h | 0) > 0 ? h : 0;
                            m = (a[s >> 0] | 0) != 0;
                            do
                                if (!z) {
                                    if (m)
                                        h = h | (a[q + l >> 0] | 0) != 0;
                                    l = 8207 - (h & 1) << 16 >> 16;
                                    if (h & 5) {
                                        if ((j | 0) > 0) {
                                            b[k >> 1] = l;
                                            k = k + 2 | 0;
                                        }
                                        j = j + -1 | 0;
                                    }
                                    l = La(n, c[x >> 2] | 0, k, j, p, i) | 0;
                                    c[x >> 2] = l;
                                    k = (k | 0) == 0 ? 0 : k + (l << 1) | 0;
                                    j = j - l | 0;
                                    if (a[s >> 0] | 0)
                                        h = (a[q + (l + -1 + (c[w >> 2] | 0)) >> 0] | 0) == 0 ? h : h | 2;
                                    if (!(h & 10))
                                        break;
                                    if ((j | 0) > 0) {
                                        b[k >> 1] = 8207 - (h >>> 1 & 1) << 16 >> 16;
                                        k = k + 2 | 0;
                                    }
                                    j = j + -1 | 0;
                                } else {
                                    if (m)
                                        h = (1 << d[q + (l + -1 + (c[x >> 2] | 0)) >> 0] & 8194 | 0) == 0 ? h | 4 : h;
                                    l = 8207 - (h & 1) << 16 >> 16;
                                    if (h & 5) {
                                        if ((j | 0) > 0) {
                                            b[k >> 1] = l;
                                            k = k + 2 | 0;
                                        }
                                        j = j + -1 | 0;
                                    }
                                    z = Ja(n, c[x >> 2] | 0, k, j, u, i) | 0;
                                    c[x >> 2] = z;
                                    k = (k | 0) == 0 ? 0 : k + (z << 1) | 0;
                                    j = j - z | 0;
                                    if (a[s >> 0] | 0)
                                        h = (1 << d[q + (c[w >> 2] | 0) >> 0] & 8194 | 0) == 0 ? h | 8 : h;
                                    if (!(h & 10))
                                        break;
                                    if ((j | 0) > 0) {
                                        b[k >> 1] = 8207 - (h >>> 1 & 1) << 16 >> 16;
                                        k = k + 2 | 0;
                                    }
                                    j = j + -1 | 0;
                                }
                            while (0);
                            o = o + 1 | 0;
                        }
                    } else {
                        if (!j) {
                            n = k & 65533;
                            m = f;
                            k = t;
                            j = g;
                            while (1) {
                                l = k + -1 | 0;
                                if ((k | 0) <= 0)
                                    break a;
                                z = (Va(e, l, w, x) | 0) == 0;
                                k = v + (c[w >> 2] << 1) | 0;
                                h = c[x >> 2] | 0;
                                if (z)
                                    h = Ja(k, h, m, j, n, i) | 0;
                                else
                                    h = La(k, h, m, j, u, i) | 0;
                                c[x >> 2] = h;
                                m = (m | 0) == 0 ? 0 : m + (h << 1) | 0;
                                k = l;
                                j = j - h | 0;
                            }
                        }
                        p = c[e + 72 >> 2] | 0;
                        o = k & 65533;
                        k = f;
                        h = t;
                        j = g;
                        while (1) {
                            n = h + -1 | 0;
                            if ((h | 0) <= 0)
                                break a;
                            z = Va(e, n, w, x) | 0;
                            l = c[w >> 2] | 0;
                            m = v + (l << 1) | 0;
                            if (!z) {
                                h = c[x >> 2] | 0;
                                if (a[p + (l + -1 + h) >> 0] | 0) {
                                    if ((j | 0) > 0) {
                                        b[k >> 1] = 8206;
                                        k = k + 2 | 0;
                                        h = c[x >> 2] | 0;
                                    }
                                    j = j + -1 | 0;
                                }
                                z = Ja(m, h, k, j, o, i) | 0;
                                c[x >> 2] = z;
                                k = (k | 0) == 0 ? 0 : k + (z << 1) | 0;
                                j = j - z | 0;
                                if (a[p + (c[w >> 2] | 0) >> 0] | 0) {
                                    if ((j | 0) > 0) {
                                        b[k >> 1] = 8206;
                                        k = k + 2 | 0;
                                    }
                                    j = j + -1 | 0;
                                }
                            } else {
                                if (!(1 << d[p + l >> 0] & 8194)) {
                                    if ((j | 0) > 0) {
                                        b[k >> 1] = 8207;
                                        k = k + 2 | 0;
                                    }
                                    j = j + -1 | 0;
                                }
                                z = La(m, c[x >> 2] | 0, k, j, u, i) | 0;
                                c[x >> 2] = z;
                                k = (k | 0) == 0 ? 0 : k + (z << 1) | 0;
                                j = j - z | 0;
                                if (!(1 << d[p + (z + -1 + (c[w >> 2] | 0)) >> 0] & 8194)) {
                                    if ((j | 0) > 0) {
                                        b[k >> 1] = 8207;
                                        k = k + 2 | 0;
                                    }
                                    j = j + -1 | 0;
                                }
                            }
                            h = n;
                        }
                    }
                while (0);
            z = qb(f, g, g - j | 0, i) | 0;
            E = y;
            return z | 0;
        }
        c[i >> 2] = 1;
        z = 0;
        E = y;
        return z | 0;
    }
    function La(a, d, f, g, h, i) {
        a = a | 0;
        d = d | 0;
        f = f | 0;
        g = g | 0;
        h = h | 0;
        i = i | 0;
        var j = 0, k = 0, l = 0, m = 0, n = 0;
        switch (h & 10) {
        case 0: {
                if ((g | 0) < (d | 0)) {
                    c[i >> 2] = 15;
                    g = d;
                    return g | 0;
                }
                j = d;
                h = f;
                while (1) {
                    b[h >> 1] = b[a >> 1] | 0;
                    if ((j | 0) > 1) {
                        a = a + 2 | 0;
                        j = j + -1 | 0;
                        h = h + 2 | 0;
                    } else {
                        h = d;
                        break;
                    }
                }
                return h | 0;
            }
        case 2: {
                if ((g | 0) < (d | 0)) {
                    c[i >> 2] = 15;
                    g = d;
                    return g | 0;
                }
                l = 0;
                j = 0;
                while (1) {
                    k = j + 1 | 0;
                    h = e[a + (j << 1) >> 1] | 0;
                    if ((k | 0) == (d | 0) | (h & 64512 | 0) != 55296)
                        j = k;
                    else {
                        m = e[a + (k << 1) >> 1] | 0;
                        g = (m & 64512 | 0) == 56320;
                        h = g ? (h << 10) + -56613888 + m | 0 : h;
                        j = g ? j + 2 | 0 : k;
                    }
                    h = yb(h) | 0;
                    if (h >>> 0 < 65536)
                        k = l + 1 | 0;
                    else {
                        b[f + (l + 1 << 1) >> 1] = h & 1023 | 56320;
                        k = l + 2 | 0;
                        h = (h >>> 10) + 55232 | 0;
                    }
                    b[f + (l << 1) >> 1] = h;
                    if ((j | 0) < (d | 0))
                        l = k;
                    else {
                        h = d;
                        break;
                    }
                }
                return h | 0;
            }
        case 8: {
                l = g;
                h = a;
                a = f;
                a:
                    while (1) {
                        k = h;
                        h = h + 2 | 0;
                        k = b[k >> 1] | 0;
                        b:
                            do
                                if ((k & -4) << 16 >> 16 == 8204)
                                    j = l;
                                else {
                                    switch (k << 16 >> 16) {
                                    case 8234:
                                    case 8235:
                                    case 8236:
                                    case 8237:
                                    case 8238:
                                    case 8294:
                                    case 8295:
                                    case 8296:
                                    case 8297: {
                                            j = l;
                                            break b;
                                        }
                                    default: {
                                        }
                                    }
                                    j = l + -1 | 0;
                                    if ((l | 0) < 1)
                                        break a;
                                    b[a >> 1] = k;
                                    a = a + 2 | 0;
                                }
                            while (0);
                        if ((d | 0) <= 1) {
                            m = 26;
                            break;
                        } else {
                            l = j;
                            d = d + -1 | 0;
                        }
                    }
                if ((m | 0) == 26) {
                    g = g - j | 0;
                    return g | 0;
                }
                c[i >> 2] = 15;
                a = d;
                while (1) {
                    if ((a | 0) <= 1)
                        break;
                    f = e[h >> 1] | 0;
                    j = j + ((((f + -8294 | 0) >>> 0 < 4 | ((f & 65532 | 0) == 8204 | (f + -8234 | 0) >>> 0 < 5)) ^ 1) << 31 >> 31) | 0;
                    a = a + -1 | 0;
                    h = h + 2 | 0;
                }
                g = g - j | 0;
                return g | 0;
            }
        default: {
                h = 0;
                k = g;
                j = d;
                c:
                    while (1) {
                        l = e[a >> 1] | 0;
                        if ((j | 0) == 1 | (l & 64512 | 0) != 55296)
                            d = 1;
                        else {
                            n = e[a + 2 >> 1] | 0;
                            d = (n & 64512 | 0) == 56320;
                            l = d ? (l << 10) + -56613888 + n | 0 : l;
                            d = d ? 2 : 1;
                        }
                        a = a + (d << 1) | 0;
                        j = j - d | 0;
                        d:
                            do
                                if ((l & -4 | 0) != 8204) {
                                    switch (l | 0) {
                                    case 8234:
                                    case 8235:
                                    case 8236:
                                    case 8237:
                                    case 8238:
                                    case 8294:
                                    case 8295:
                                    case 8296:
                                    case 8297:
                                        break d;
                                    default: {
                                        }
                                    }
                                    k = k - d | 0;
                                    if ((k | 0) < 0)
                                        break c;
                                    l = yb(l) | 0;
                                    if (l >>> 0 < 65536) {
                                        b[f + (h << 1) >> 1] = l;
                                        h = h + 1 | 0;
                                        break;
                                    } else {
                                        b[f + (h << 1) >> 1] = (l >>> 10) + 55232;
                                        b[f + (h + 1 << 1) >> 1] = l & 1023 | 56320;
                                        h = h + 2 | 0;
                                        break;
                                    }
                                }
                            while (0);
                        if ((j | 0) <= 0) {
                            m = 40;
                            break;
                        }
                    }
                if ((m | 0) == 40)
                    return h | 0;
                c[i >> 2] = 15;
                h = a;
                while (1) {
                    if ((j | 0) <= 0)
                        break;
                    n = e[h >> 1] | 0;
                    k = k + ((((n + -8294 | 0) >>> 0 < 4 | ((n & 65532 | 0) == 8204 | (n + -8234 | 0) >>> 0 < 5)) ^ 1) << 31 >> 31) | 0;
                    j = j + -1 | 0;
                    h = h + 2 | 0;
                }
                n = g - k | 0;
                return n | 0;
            }
        }
        return 0;
    }
    function Ma(d, e, f, g, h) {
        d = d | 0;
        e = e | 0;
        f = f | 0;
        g = g | 0;
        h = h | 0;
        var i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0;
        if (!h)
            return;
        if ((Na(c[h >> 2] | 0) | 0) << 24 >> 24)
            return;
        if (d | 0 ? (c[d >> 2] | 0) == (d | 0) : 0) {
            if (!((e | 0) > -1 & (f | 0) > (e | 0))) {
                c[h >> 2] = 1;
                return;
            }
            if ((f | 0) >= 0 ? (c[d + 12 >> 2] | 0) >= (f | 0) : 0) {
                if (!g) {
                    c[h >> 2] = 1;
                    return;
                }
                p = Ga(d, e, h) | 0;
                if ((p | 0) != (Ga(d, f + -1 | 0, h) | 0)) {
                    c[h >> 2] = 1;
                    return;
                }
                c[g >> 2] = 0;
                l = d + 4 | 0;
                c[g + 4 >> 2] = (c[l >> 2] | 0) + (e << 1);
                o = f - e | 0;
                c[g + 12 >> 2] = o;
                c[g + 8 >> 2] = o;
                m = g + 16 | 0;
                c[m >> 2] = o;
                if ((a[d + 94 >> 0] | 0) != 0 ? (i = c[d + 136 >> 2] | 0, (c[i >> 2] | 0) <= (e | 0)) : 0) {
                    h = d + 132 | 0;
                    j = h;
                    h = da(c[h >> 2] | 0, i, e) | 0;
                } else {
                    j = d + 132 | 0;
                    h = a[d + 93 >> 0] | 0;
                }
                p = g + 93 | 0;
                a[p >> 0] = h;
                c[g + 132 >> 2] = c[j >> 2];
                c[g + 224 >> 2] = 0;
                c[g + 120 >> 2] = 0;
                c[g + 84 >> 2] = c[d + 84 >> 2];
                c[g + 88 >> 2] = c[d + 88 >> 2];
                k = g + 348 | 0;
                c[k >> 2] = 0;
                if ((c[d + 348 >> 2] | 0) > 0) {
                    j = e;
                    h = 0;
                    while (1) {
                        if ((j | 0) >= (f | 0))
                            break;
                        i = b[(c[l >> 2] | 0) + (j << 1) >> 1] | 0;
                        if ((i & -4) << 16 >> 16 == 8204)
                            n = 24;
                        else
                            switch (i << 16 >> 16) {
                            case 8234:
                            case 8235:
                            case 8236:
                            case 8237:
                            case 8238:
                            case 8294:
                            case 8295:
                            case 8296:
                            case 8297: {
                                    n = 24;
                                    break;
                                }
                            default: {
                                }
                            }
                        if ((n | 0) == 24) {
                            n = 0;
                            h = h + 1 | 0;
                            c[k >> 2] = h;
                        }
                        j = j + 1 | 0;
                    }
                    c[m >> 2] = o - h;
                }
                c[g + 72 >> 2] = (c[d + 72 >> 2] | 0) + e;
                l = (c[d + 76 >> 2] | 0) + e | 0;
                c[g + 76 >> 2] = l;
                c[g + 220 >> 2] = -1;
                h = c[d + 116 >> 2] | 0;
                a:
                    do
                        if ((h | 0) != 2) {
                            c[g + 116 >> 2] = h;
                            h = c[d + 128 >> 2] | 0;
                            if ((h | 0) <= (e | 0)) {
                                c[g + 128 >> 2] = 0;
                                break;
                            }
                            if ((h | 0) < (f | 0)) {
                                c[g + 128 >> 2] = h - e;
                                break;
                            } else {
                                c[g + 128 >> 2] = o;
                                break;
                            }
                        } else {
                            Oa(g);
                            k = g + 128 | 0;
                            j = c[k >> 2] | 0;
                            b:
                                do
                                    if (!j)
                                        h = a[p >> 0] & 1;
                                    else {
                                        h = a[l >> 0] & 1;
                                        if ((j | 0) < (o | 0) ? (a[p >> 0] & 1) != h << 24 >> 24 : 0) {
                                            h = 2;
                                            break;
                                        }
                                        i = 1;
                                        while (1) {
                                            if ((i | 0) == (j | 0))
                                                break b;
                                            if ((a[l + i >> 0] & 1) == h << 24 >> 24)
                                                i = i + 1 | 0;
                                            else {
                                                h = 2;
                                                break;
                                            }
                                        }
                                    }
                                while (0);
                            c[g + 116 >> 2] = h & 255;
                            switch (h & 3) {
                            case 0: {
                                    a[p >> 0] = (a[p >> 0] | 0) + 1 << 24 >> 24 & -2;
                                    c[k >> 2] = 0;
                                    break a;
                                }
                            case 1: {
                                    a[p >> 0] = a[p >> 0] | 1;
                                    c[k >> 2] = 0;
                                    break a;
                                }
                            default:
                                break a;
                            }
                        }
                    while (0);
                c[g >> 2] = d;
                return;
            }
            c[h >> 2] = 1;
            return;
        }
        c[h >> 2] = 27;
        return;
    }
    function Na(a) {
        a = a | 0;
        return (a | 0) > 0 | 0;
    }
    function Oa(b) {
        b = b | 0;
        var e = 0, f = 0, g = 0, h = 0, i = 0;
        g = c[b + 72 >> 2] | 0;
        h = c[b + 76 >> 2] | 0;
        e = c[b + 12 >> 2] | 0;
        i = a[b + 93 >> 0] | 0;
        if ((a[g + (e + -1) >> 0] | 0) == 7) {
            i = e;
            b = b + 128 | 0;
            c[b >> 2] = i;
            return;
        }
        while (1) {
            if ((e | 0) <= 0)
                break;
            f = e + -1 | 0;
            if (!(1 << d[g + f >> 0] & 8248192))
                break;
            else
                e = f;
        }
        while (1) {
            if ((e | 0) <= 0) {
                f = 8;
                break;
            }
            f = e + -1 | 0;
            if ((a[h + f >> 0] | 0) == i << 24 >> 24)
                e = f;
            else {
                f = 8;
                break;
            }
        }
        if ((f | 0) == 8) {
            b = b + 128 | 0;
            c[b >> 2] = e;
            return;
        }
    }
    function Pa(b, d) {
        b = b | 0;
        d = d | 0;
        var e = 0, f = 0, g = 0, h = 0, i = 0;
        if (!d) {
            i = 0;
            return i | 0;
        }
        if ((Na(c[d >> 2] | 0) | 0) << 24 >> 24) {
            i = 0;
            return i | 0;
        }
        do
            if (b | 0) {
                e = c[b >> 2] | 0;
                if ((e | 0) != (b | 0)) {
                    if (!e)
                        break;
                    if ((c[e >> 2] | 0) != (e | 0))
                        break;
                }
                f = c[b + 12 >> 2] | 0;
                if ((f | 0) < 1) {
                    c[d >> 2] = 1;
                    i = 0;
                    return i | 0;
                }
                g = b + 128 | 0;
                h = c[g >> 2] | 0;
                if ((f | 0) == (h | 0)) {
                    i = c[b + 76 >> 2] | 0;
                    return i | 0;
                }
                e = b + 48 | 0;
                if (!((aa(e, b + 24 | 0, a[b + 68 >> 0] | 0, f) | 0) << 24 >> 24)) {
                    c[d >> 2] = 7;
                    i = 0;
                    return i | 0;
                }
                e = c[e >> 2] | 0;
                d = b + 76 | 0;
                if ((h | 0) > 0 ? (i = c[d >> 2] | 0, (e | 0) != (i | 0)) : 0)
                    ec(e | 0, i | 0, h | 0) | 0;
                fc(e + h | 0, a[b + 93 >> 0] | 0, f - h | 0) | 0;
                c[g >> 2] = f;
                c[d >> 2] = e;
                i = e;
                return i | 0;
            }
        while (0);
        c[d >> 2] = 27;
        i = 0;
        return i | 0;
    }
    function Qa(a, b) {
        a = a | 0;
        b = b | 0;
        var d = 0;
        if (!b) {
            d = -1;
            return d | 0;
        }
        if ((Na(c[b >> 2] | 0) | 0) << 24 >> 24) {
            d = -1;
            return d | 0;
        }
        do
            if (a | 0) {
                d = c[a >> 2] | 0;
                if ((d | 0) != (a | 0)) {
                    if (!d)
                        break;
                    if ((c[d >> 2] | 0) != (d | 0))
                        break;
                }
                Ra(a, b);
                if ((Na(c[b >> 2] | 0) | 0) << 24 >> 24) {
                    d = -1;
                    return d | 0;
                }
                d = c[a + 220 >> 2] | 0;
                return d | 0;
            }
        while (0);
        c[b >> 2] = 27;
        d = -1;
        return d | 0;
    }
    function Ra(e, f) {
        e = e | 0;
        f = f | 0;
        var g = 0, h = 0, i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0, q = 0, r = 0, s = 0, t = 0;
        s = e + 220 | 0;
        if ((c[s >> 2] | 0) > -1)
            return;
        do
            if ((c[e + 116 >> 2] | 0) == 2) {
                o = c[e + 12 >> 2] | 0;
                r = c[e + 76 >> 2] | 0;
                p = c[e + 128 >> 2] | 0;
                g = 0;
                i = 0;
                h = -2;
                while (1) {
                    if ((g | 0) >= (p | 0))
                        break;
                    q = a[r + g >> 0] | 0;
                    g = g + 1 | 0;
                    i = i + (q << 24 >> 24 != h << 24 >> 24 & 1) | 0;
                    h = q;
                }
                if ((o | 0) == (p | 0) & (i | 0) == 1) {
                    Sa(e, a[r >> 0] | 0);
                    break;
                }
                l = (o | 0) > (p | 0);
                q = i + (l & 1) | 0;
                g = e + 60 | 0;
                if (!((aa(g, e + 36 | 0, a[e + 69 >> 0] | 0, q * 12 | 0) | 0) << 24 >> 24))
                    return;
                n = c[g >> 2] | 0;
                m = 0;
                g = 126;
                k = 0;
                i = 0;
                while (1) {
                    h = a[r + i >> 0] | 0;
                    g = (h & 255) < (g & 255) ? h : g;
                    k = (h & 255) > (k & 255) ? h : k;
                    j = i;
                    while (1) {
                        j = j + 1 | 0;
                        if ((j | 0) >= (p | 0)) {
                            h = 0;
                            break;
                        }
                        if ((a[r + j >> 0] | 0) != h << 24 >> 24) {
                            h = 1;
                            break;
                        }
                    }
                    c[n + (m * 12 | 0) >> 2] = i;
                    c[n + (m * 12 | 0) + 4 >> 2] = j - i;
                    c[n + (m * 12 | 0) + 8 >> 2] = 0;
                    m = m + 1 | 0;
                    if (!h)
                        break;
                    else
                        i = j;
                }
                if (l) {
                    c[n + (m * 12 | 0) >> 2] = p;
                    c[n + (m * 12 | 0) + 4 >> 2] = o - p;
                    p = a[e + 93 >> 0] | 0;
                    g = (p & 255) < (g & 255) ? p : g;
                }
                c[e + 224 >> 2] = n;
                c[s >> 2] = q;
                Ta(e, g, k);
                g = 0;
                h = 0;
                while (1) {
                    if ((h | 0) == (q | 0))
                        break;
                    o = n + (h * 12 | 0) | 0;
                    p = c[o >> 2] | 0;
                    c[o >> 2] = d[r + p >> 0] << 31 | p;
                    o = n + (h * 12 | 0) + 4 | 0;
                    p = (c[o >> 2] | 0) + g | 0;
                    c[o >> 2] = p;
                    g = p;
                    h = h + 1 | 0;
                }
                if (m >>> 0 < q >>> 0) {
                    q = d[e + 93 >> 0] | 0;
                    r = n + (((q & 1 | 0) == 0 ? m : 0) * 12 | 0) | 0;
                    c[r >> 2] = q << 31 | c[r >> 2];
                }
            } else
                Sa(e, a[e + 93 >> 0] | 0);
        while (0);
        g = c[e + 332 >> 2] | 0;
        a:
            do
                if ((g | 0) > 0) {
                    r = c[e + 344 >> 2] | 0;
                    h = r + (g << 3) | 0;
                    i = e + 224 | 0;
                    g = r;
                    while (1) {
                        if (g >>> 0 >= h >>> 0)
                            break a;
                        r = Ua(c[s >> 2] | 0, c[i >> 2] | 0, c[g >> 2] | 0, f) | 0;
                        r = (c[i >> 2] | 0) + (r * 12 | 0) + 8 | 0;
                        c[r >> 2] = c[r >> 2] | c[g + 4 >> 2];
                        g = g + 8 | 0;
                    }
                }
            while (0);
        if ((c[e + 348 >> 2] | 0) <= 0)
            return;
        g = c[e + 4 >> 2] | 0;
        j = g + (c[e + 12 >> 2] << 1) | 0;
        k = g;
        h = e + 224 | 0;
        while (1) {
            if (g >>> 0 >= j >>> 0)
                break;
            i = b[g >> 1] | 0;
            if ((i & -4) << 16 >> 16 == 8204)
                t = 31;
            else
                switch (i << 16 >> 16) {
                case 8234:
                case 8235:
                case 8236:
                case 8237:
                case 8238:
                case 8294:
                case 8295:
                case 8296:
                case 8297: {
                        t = 31;
                        break;
                    }
                default: {
                    }
                }
            if ((t | 0) == 31) {
                t = 0;
                e = Ua(c[s >> 2] | 0, c[h >> 2] | 0, g - k >> 1, f) | 0;
                e = (c[h >> 2] | 0) + (e * 12 | 0) + 8 | 0;
                c[e >> 2] = (c[e >> 2] | 0) + -1;
            }
            g = g + 2 | 0;
        }
        return;
    }
    function Sa(a, b) {
        a = a | 0;
        b = b | 0;
        var d = 0;
        d = a + 228 | 0;
        c[a + 224 >> 2] = d;
        c[a + 220 >> 2] = 1;
        c[d >> 2] = (b & 255) << 31;
        c[a + 232 >> 2] = c[a + 12 >> 2];
        c[a + 236 >> 2] = 0;
        return;
    }
    function Ta(a, b, e) {
        a = a | 0;
        b = b | 0;
        e = e | 0;
        var f = 0, g = 0, h = 0, i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0, q = 0;
        o = E;
        E = E + 16 | 0;
        n = o;
        if (((b | 1) & 255) >= (e & 255)) {
            E = o;
            return;
        }
        l = b + 1 << 24 >> 24;
        m = c[a + 224 >> 2] | 0;
        i = c[a + 76 >> 2] | 0;
        j = a + 128 | 0;
        k = a + 12 | 0;
        h = (c[a + 220 >> 2] | 0) + (((c[j >> 2] | 0) < (c[k >> 2] | 0)) << 31 >> 31) | 0;
        b = e;
        while (1) {
            b = b + -1 << 24 >> 24;
            if ((b & 255) < (l & 255))
                break;
            a = 0;
            while (1) {
                if ((a | 0) >= (h | 0))
                    break;
                if ((d[i + (c[m + (a * 12 | 0) >> 2] | 0) >> 0] | 0) >= (b & 255)) {
                    e = a;
                    while (1) {
                        g = e + 1 | 0;
                        if ((g | 0) >= (h | 0))
                            break;
                        if ((d[i + (c[m + (g * 12 | 0) >> 2] | 0) >> 0] | 0) < (b & 255))
                            break;
                        else
                            e = g;
                    }
                    f = e;
                    while (1) {
                        if ((a | 0) >= (f | 0))
                            break;
                        q = m + (a * 12 | 0) | 0;
                        c[n >> 2] = c[q >> 2];
                        c[n + 4 >> 2] = c[q + 4 >> 2];
                        c[n + 8 >> 2] = c[q + 8 >> 2];
                        p = m + (f * 12 | 0) | 0;
                        c[q >> 2] = c[p >> 2];
                        c[q + 4 >> 2] = c[p + 4 >> 2];
                        c[q + 8 >> 2] = c[p + 8 >> 2];
                        c[p >> 2] = c[n >> 2];
                        c[p + 4 >> 2] = c[n + 4 >> 2];
                        c[p + 8 >> 2] = c[n + 8 >> 2];
                        f = f + -1 | 0;
                        a = a + 1 | 0;
                    }
                    if ((g | 0) == (h | 0))
                        break;
                    else
                        a = e + 2 | 0;
                } else
                    a = a + 1 | 0;
            }
        }
        if (l & 1) {
            E = o;
            return;
        }
        b = h + (((c[j >> 2] | 0) == (c[k >> 2] | 0)) << 31 >> 31) | 0;
        a = 0;
        while (1) {
            if ((a | 0) >= (b | 0))
                break;
            p = m + (a * 12 | 0) | 0;
            c[n >> 2] = c[p >> 2];
            c[n + 4 >> 2] = c[p + 4 >> 2];
            c[n + 8 >> 2] = c[p + 8 >> 2];
            q = m + (b * 12 | 0) | 0;
            c[p >> 2] = c[q >> 2];
            c[p + 4 >> 2] = c[q + 4 >> 2];
            c[p + 8 >> 2] = c[q + 8 >> 2];
            c[q >> 2] = c[n >> 2];
            c[q + 4 >> 2] = c[n + 4 >> 2];
            c[q + 8 >> 2] = c[n + 8 >> 2];
            b = b + -1 | 0;
            a = a + 1 | 0;
        }
        E = o;
        return;
    }
    function Ua(a, b, d, e) {
        a = a | 0;
        b = b | 0;
        d = d | 0;
        e = e | 0;
        var f = 0, g = 0, h = 0, i = 0, j = 0;
        g = 0;
        f = 0;
        while (1) {
            if ((f | 0) >= (a | 0))
                break;
            h = c[b + (f * 12 | 0) + 4 >> 2] | 0;
            j = c[b + (f * 12 | 0) >> 2] & 2147483647;
            if ((j | 0) <= (d | 0) ? (h - g + j | 0) > (d | 0) : 0) {
                i = 7;
                break;
            }
            g = h;
            f = f + 1 | 0;
        }
        if ((i | 0) == 7)
            return f | 0;
        c[e >> 2] = 27;
        j = 0;
        return j | 0;
    }
    function Va(a, b, d, e) {
        a = a | 0;
        b = b | 0;
        d = d | 0;
        e = e | 0;
        var f = 0, g = 0, h = 0;
        h = E;
        E = E + 16 | 0;
        f = h;
        c[f >> 2] = 0;
        do
            if (a | 0) {
                g = c[a >> 2] | 0;
                if ((g | 0) != (a | 0)) {
                    if (!g)
                        break;
                    if ((c[g >> 2] | 0) != (g | 0))
                        break;
                }
                Ra(a, f);
                if ((Na(c[f >> 2] | 0) | 0) << 24 >> 24) {
                    e = 0;
                    E = h;
                    return e | 0;
                }
                if ((b | 0) >= 0 ? (c[a + 220 >> 2] | 0) > (b | 0) : 0) {
                    a = a + 224 | 0;
                    f = c[(c[a >> 2] | 0) + (b * 12 | 0) >> 2] | 0;
                    if (d | 0)
                        c[d >> 2] = f & 2147483647;
                    if (e | 0) {
                        a = c[a >> 2] | 0;
                        if ((b | 0) > 0)
                            a = (c[a + (b * 12 | 0) + 4 >> 2] | 0) - (c[a + ((b + -1 | 0) * 12 | 0) + 4 >> 2] | 0) | 0;
                        else
                            a = c[a + 4 >> 2] | 0;
                        c[e >> 2] = a;
                    }
                    e = f >>> 31;
                    E = h;
                    return e | 0;
                }
                c[f >> 2] = 1;
                e = 0;
                E = h;
                return e | 0;
            }
        while (0);
        c[f >> 2] = 27;
        e = 0;
        E = h;
        return e | 0;
    }
    function Wa(a, d, e) {
        a = a | 0;
        d = d | 0;
        e = e | 0;
        var f = 0, g = 0, h = 0, i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0;
        if (!e)
            return;
        if ((Na(c[e >> 2] | 0) | 0) << 24 >> 24)
            return;
        if (!d) {
            c[e >> 2] = 1;
            return;
        }
        Qa(a, e) | 0;
        if (!((Xa(c[e >> 2] | 0) | 0) << 24 >> 24))
            return;
        m = a + 224 | 0;
        e = c[m >> 2] | 0;
        k = a + 220 | 0;
        l = e + ((c[k >> 2] | 0) * 12 | 0) | 0;
        n = a + 16 | 0;
        if ((c[n >> 2] | 0) < 1)
            return;
        g = 0;
        f = d;
        while (1) {
            if (e >>> 0 >= l >>> 0)
                break;
            h = c[e >> 2] | 0;
            j = c[e + 4 >> 2] | 0;
            if ((h | 0) > -1)
                while (1) {
                    i = f + 4 | 0;
                    c[f >> 2] = h;
                    g = g + 1 | 0;
                    if ((g | 0) < (j | 0)) {
                        h = h + 1 | 0;
                        f = i;
                    } else {
                        f = i;
                        break;
                    }
                }
            else {
                i = j - g + (h & 2147483647) | 0;
                while (1) {
                    i = i + -1 | 0;
                    h = f + 4 | 0;
                    c[f >> 2] = i;
                    g = g + 1 | 0;
                    if ((g | 0) >= (j | 0)) {
                        f = h;
                        break;
                    } else
                        f = h;
                }
            }
            e = e + 12 | 0;
        }
        if ((c[a + 332 >> 2] | 0) > 0) {
            g = c[k >> 2] | 0;
            m = c[m >> 2] | 0;
            f = 0;
            e = 0;
            while (1) {
                if ((e | 0) >= (g | 0))
                    break;
                p = c[m + (e * 12 | 0) + 8 >> 2] | 0;
                f = f + ((p & 5 | 0) != 0 & 1) + ((p & 10 | 0) != 0 & 1) | 0;
                e = e + 1 | 0;
            }
            e = c[n >> 2] | 0;
            while (1) {
                l = g + -1 | 0;
                if (!((g | 0) > 0 & (f | 0) > 0))
                    break;
                k = c[m + (l * 12 | 0) + 8 >> 2] | 0;
                h = e + -1 | 0;
                if (k & 10) {
                    c[d + (h << 2) >> 2] = -1;
                    e = h;
                    f = f + -1 | 0;
                }
                if ((g | 0) > 1)
                    j = c[m + ((g + -2 | 0) * 12 | 0) + 4 >> 2] | 0;
                else
                    j = 0;
                i = (f | 0) > 0;
                h = c[m + (l * 12 | 0) + 4 >> 2] | 0;
                while (1) {
                    g = h + -1 | 0;
                    if (!(i & (h | 0) > (j | 0)))
                        break;
                    p = e + -1 | 0;
                    c[d + (p << 2) >> 2] = c[d + (g << 2) >> 2];
                    h = g;
                    e = p;
                }
                g = e + -1 | 0;
                if (k & 5) {
                    c[d + (g << 2) >> 2] = -1;
                    e = g;
                    f = f + -1 | 0;
                }
                g = l;
            }
            return;
        }
        if ((c[a + 348 >> 2] | 0) <= 0)
            return;
        p = c[k >> 2] | 0;
        o = c[m >> 2] | 0;
        a = a + 4 | 0;
        e = 0;
        m = 0;
        f = 0;
        while (1) {
            if ((m | 0) >= (p | 0))
                break;
            n = c[o + (m * 12 | 0) + 4 >> 2] | 0;
            l = n - f | 0;
            g = (c[o + (m * 12 | 0) + 8 >> 2] | 0) == 0;
            a:
                do
                    if ((e | 0) == (f | 0) & g)
                        e = l + e | 0;
                    else {
                        if (g)
                            while (1) {
                                if ((f | 0) >= (n | 0))
                                    break a;
                                c[d + (e << 2) >> 2] = c[d + (f << 2) >> 2];
                                f = f + 1 | 0;
                                e = e + 1 | 0;
                            }
                        j = c[o + (m * 12 | 0) >> 2] | 0;
                        i = (j | 0) > -1;
                        j = j & 2147483647;
                        k = l + -1 + j | 0;
                        h = 0;
                        while (1) {
                            if ((h | 0) >= (l | 0))
                                break a;
                            f = i ? h + j | 0 : k - h | 0;
                            g = b[(c[a >> 2] | 0) + (f << 1) >> 1] | 0;
                            b:
                                do
                                    if ((g & -4) << 16 >> 16 != 8204) {
                                        switch (g << 16 >> 16) {
                                        case 8234:
                                        case 8235:
                                        case 8236:
                                        case 8237:
                                        case 8238:
                                        case 8294:
                                        case 8295:
                                        case 8296:
                                        case 8297:
                                            break b;
                                        default: {
                                            }
                                        }
                                        c[d + (e << 2) >> 2] = f;
                                        e = e + 1 | 0;
                                    }
                                while (0);
                            h = h + 1 | 0;
                        }
                    }
                while (0);
            m = m + 1 | 0;
            f = n;
        }
        return;
    }
    function Xa(a) {
        a = a | 0;
        return (a | 0) < 1 | 0;
    }
    function Ya(a, d, e, f, g) {
        a = a | 0;
        d = d | 0;
        e = e | 0;
        f = f | 0;
        g = g | 0;
        var h = 0, i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0;
        o = E;
        E = E + 656 | 0;
        j = o + 632 | 0;
        l = o;
        m = o + 628 | 0;
        n = o + 624 | 0;
        k = o + 600 | 0;
        if (!g) {
            n = 0;
            E = o;
            return n | 0;
        }
        if ((Za(c[g >> 2] | 0) | 0) << 24 >> 24) {
            n = 0;
            E = o;
            return n | 0;
        }
        if (!((a | 0) == 0 | (d | 0) < -1) ? (h = (e | 0) == 0, !((f | 0) < 0 | h & (f | 0) != 0)) : 0) {
            if ((d | 0) == -1)
                d = ob(a) | 0;
            if ((d | 0) < 1) {
                qb(e, f, 0, g) | 0;
                n = 0;
                E = o;
                return n | 0;
            }
            do
                if (!h) {
                    if (!(a >>> 0 <= e >>> 0 & (a + (d << 1) | 0) >>> 0 > e >>> 0) ? !(e >>> 0 <= a >>> 0 & (e + (f << 1) | 0) >>> 0 > a >>> 0) : 0)
                        break;
                    c[g >> 2] = 1;
                    n = 0;
                    E = o;
                    return n | 0;
                }
            while (0);
            c[m >> 2] = 0;
            c[n >> 2] = 0;
            h = $a(a, d) | 0;
            if ((h | 0) > (f | 0)) {
                c[g >> 2] = 15;
                n = h;
                E = o;
                return n | 0;
            }
            h = (d | 0) > (h | 0) ? d : h;
            if ((h | 0) >= 301) {
                i = lb(h << 1) | 0;
                if (!i) {
                    c[g >> 2] = 7;
                    n = 0;
                    E = o;
                    return n | 0;
                }
            } else {
                i = l;
                h = 300;
            }
            pb(i, a, d) | 0;
            if ((h | 0) > (d | 0))
                fc(i + (d << 1) | 0, 0, h - d << 1 | 0) | 0;
            ab(i, d, m, n);
            bb(i, d, c[m >> 2] | 0, c[n >> 2] | 0);
            b[k >> 1] = 8203;
            b[k + 2 >> 1] = 0;
            c[k + 4 >> 2] = 3;
            c[k + 8 >> 2] = 2;
            c[k + 12 >> 2] = 262144;
            c[k + 16 >> 2] = 393216;
            c[k + 20 >> 2] = 0;
            c[j >> 2] = c[k >> 2];
            c[j + 4 >> 2] = c[k + 4 >> 2];
            c[j + 8 >> 2] = c[k + 8 >> 2];
            c[j + 12 >> 2] = c[k + 12 >> 2];
            c[j + 16 >> 2] = c[k + 16 >> 2];
            c[j + 20 >> 2] = c[k + 20 >> 2];
            d = cb(i, d, g, j) | 0;
            ab(i, d, m, n);
            bb(i, d, c[m >> 2] | 0, c[n >> 2] | 0);
            pb(e, i, kb(d, f) | 0) | 0;
            if ((i | 0) != (l | 0))
                nb(i);
            if ((d | 0) > (f | 0)) {
                c[g >> 2] = 15;
                n = d;
                E = o;
                return n | 0;
            } else {
                n = qb(e, f, d, g) | 0;
                E = o;
                return n | 0;
            }
        }
        c[g >> 2] = 1;
        n = 0;
        E = o;
        return n | 0;
    }
    function Za(a) {
        a = a | 0;
        return (a | 0) > 0 | 0;
    }
    function _a(a) {
        a = a | 0;
        var c = 0;
        c = a & 65535;
        if ((a + -1570 & 65535) < 178) {
            c = b[1712 + (c + -1570 << 1) >> 1] | 0;
            return c | 0;
        }
        if (a << 16 >> 16 == 8205) {
            c = 3;
            return c | 0;
        }
        if ((a + -8301 & 65535) < 3) {
            c = 4;
            return c | 0;
        }
        if ((a + 1200 & 65535) < 275) {
            c = d[2080 + (c + -64336) >> 0] | 0;
            return c | 0;
        }
        if ((a + 400 & 65535) >= 141) {
            c = 0;
            return c | 0;
        }
        c = d[2368 + (c + -65136) >> 0] | 0;
        return c | 0;
    }
    function $a(a, c) {
        a = a | 0;
        c = c | 0;
        var d = 0, e = 0, f = 0, g = 0, h = 0;
        g = c + -1 | 0;
        f = 0;
        d = c;
        while (1) {
            if ((f | 0) >= (c | 0))
                break;
            e = b[a + (f << 1) >> 1] | 0;
            if ((f | 0) < (g | 0) & e << 16 >> 16 == 1604 ? (ib(b[a + (f + 1 << 1) >> 1] | 0) | 0) != 0 : 0)
                h = 6;
            else if (jb(e) | 0)
                h = 6;
            if ((h | 0) == 6) {
                h = 0;
                d = d + -1 | 0;
            }
            f = f + 1 | 0;
        }
        return d | 0;
    }
    function ab(a, d, e, f) {
        a = a | 0;
        d = d | 0;
        e = e | 0;
        f = f | 0;
        var g = 0, h = 0;
        h = 0;
        while (1) {
            g = (h | 0) < (d | 0);
            if (g & (b[a + (h << 1) >> 1] | 0) == 32)
                h = h + 1 | 0;
            else
                break;
        }
        if (!g) {
            a = 0;
            c[e >> 2] = h;
            c[f >> 2] = a;
            return;
        }
        g = 0;
        while (1) {
            d = d + -1 | 0;
            if ((b[a + (d << 1) >> 1] | 0) != 32)
                break;
            else
                g = g + 1 | 0;
        }
        c[e >> 2] = h;
        c[f >> 2] = g;
        return;
    }
    function bb(a, c, d, e) {
        a = a | 0;
        c = c | 0;
        d = d | 0;
        e = e | 0;
        var f = 0, g = 0;
        c = c - e | 0;
        while (1) {
            c = c + -1 | 0;
            if ((d | 0) >= (c | 0))
                break;
            g = a + (d << 1) | 0;
            f = b[g >> 1] | 0;
            e = a + (c << 1) | 0;
            b[g >> 1] = b[e >> 1] | 0;
            b[e >> 1] = f;
            d = d + 1 | 0;
        }
        return;
    }
    function cb(a, e, f, g) {
        a = a | 0;
        e = e | 0;
        f = f | 0;
        g = g | 0;
        var h = 0, i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0, q = 0, r = 0, s = 0, t = 0, u = 0, v = 0, w = 0, x = 0, y = 0, z = 0;
        z = E;
        E = E + 32 | 0;
        x = z;
        j = 0;
        while (1) {
            if ((j | 0) >= (e | 0))
                break;
            k = a + (j << 1) | 0;
            h = b[k >> 1] | 0;
            i = h & 65535;
            if ((h + 1200 & 65535) < 176) {
                h = b[1008 + (i + -64336 << 1) >> 1] | 0;
                if (h << 16 >> 16)
                    b[k >> 1] = h;
            } else if ((h + 400 & 65535) < 141)
                b[k >> 1] = b[1360 + (i + -65136 << 1) >> 1] | 0;
            j = j + 1 | 0;
        }
        l = e + -1 | 0;
        w = l;
        j = 0;
        h = _a(b[a + (l << 1) >> 1] | 0) | 0;
        m = 0;
        v = 0;
        r = 0;
        s = 0;
        p = 0;
        k = -2;
        while (1) {
            if ((l | 0) == -1)
                break;
            o = h & 65535;
            if (!((o & 65280 | 0) == 0 ? ((_a(b[a + (l << 1) >> 1] | 0) | 0) & 4) == 0 : 0))
                y = 13;
            do
                if ((y | 0) == 13) {
                    y = 0;
                    n = l + -1 | 0;
                    while (1) {
                        if ((k | 0) >= 0)
                            break;
                        if ((n | 0) == -1) {
                            i = -1;
                            j = 0;
                            k = 3000;
                        } else {
                            j = _a(b[a + (n << 1) >> 1] | 0) | 0;
                            u = (j & 4) == 0;
                            i = n + ((u ^ 1) << 31 >> 31) | 0;
                            k = u ? n : k;
                        }
                        n = i;
                    }
                    do
                        if (!((m & 16) == 0 | (o & 32 | 0) == 0)) {
                            h = a + (l << 1) | 0;
                            i = eb(b[h >> 1] | 0) | 0;
                            if (!(i << 16 >> 16)) {
                                h = _a(0) | 0;
                                t = v;
                                u = 1;
                                break;
                            } else {
                                b[h >> 1] = -1;
                                b[a + (w << 1) >> 1] = i;
                                h = _a(i) | 0;
                                t = v;
                                u = 1;
                                l = w;
                                break;
                            }
                        } else {
                            t = m;
                            u = p;
                        }
                    while (0);
                    if ((l | 0) > 0) {
                        if ((b[a + (l + -1 << 1) >> 1] | 0) == 32) {
                            p = b[a + (l << 1) >> 1] | 0;
                            q = (fb(p) | 0) == 0;
                            r = p << 16 >> 16 == 1574 & q ? 1 : r;
                            s = q ? s : 1;
                        }
                    } else if (!l) {
                        p = b[a >> 1] | 0;
                        q = (fb(p) | 0) == 0;
                        r = p << 16 >> 16 == 1574 & q ? 1 : r;
                        s = q ? s : 1;
                    }
                    n = j & 65535;
                    o = t & 65535;
                    q = h & 65535;
                    m = q & 3;
                    p = d[1648 + ((n & 3) << 4) + ((o & 3) << 2) + m >> 0] | 0;
                    if ((m | 0) != 1) {
                        m = a + (l << 1) | 0;
                        i = b[m >> 1] | 0;
                        if (gb(i) | 0)
                            if ((o & 2 | 0) == 0 | (n & 1 | 0) == 0 | (i & -2) << 16 >> 16 == 1612)
                                p = 0;
                            else
                                p = o >>> 4 & 1 ^ 1 | n >>> 5 & 1 ^ 1;
                    } else {
                        i = a + (l << 1) | 0;
                        p = p & 1;
                        m = i;
                        i = b[i >> 1] | 0;
                    }
                    if (((i ^ 1536) & 65535) < 256) {
                        if (gb(i) | 0) {
                            b[m >> 1] = p + 65136 + (d[70134 + ((i & 65535) + -1611) >> 0] | 0);
                            m = t;
                            p = u;
                            break;
                        }
                        i = q >>> 8;
                        if (q & 8 | 0) {
                            b[m >> 1] = p + i + 64336;
                            m = t;
                            p = u;
                            break;
                        }
                        if ((i | 0) != 0 & (q & 4 | 0) == 0) {
                            b[m >> 1] = p + i + 65136;
                            m = t;
                            p = u;
                        } else {
                            m = t;
                            p = u;
                        }
                    } else {
                        m = t;
                        p = u;
                    }
                }
            while (0);
            i = (h & 4) == 0;
            n = i ? m : v;
            m = i ? h : m;
            i = i ? l : w;
            o = l + -1 | 0;
            if ((o | 0) != (k | 0)) {
                if (l)
                    h = _a(b[a + (o << 1) >> 1] | 0) | 0;
            } else {
                h = j;
                k = -2;
            }
            w = i;
            v = n;
            l = o;
        }
        if (p) {
            c[x >> 2] = c[g >> 2];
            c[x + 4 >> 2] = c[g + 4 >> 2];
            c[x + 8 >> 2] = c[g + 8 >> 2];
            c[x + 12 >> 2] = c[g + 12 >> 2];
            c[x + 16 >> 2] = c[g + 16 >> 2];
            c[x + 20 >> 2] = c[g + 20 >> 2];
            e = hb(a, e, f, x) | 0;
        }
        if (!(r | s)) {
            y = e;
            E = z;
            return y | 0;
        }
        y = db(e) | 0;
        E = z;
        return y | 0;
    }
    function db(a) {
        a = a | 0;
        return a | 0;
    }
    function eb(a) {
        a = a | 0;
        switch (a << 16 >> 16) {
        case 1570: {
                a = 1628;
                break;
            }
        case 1571: {
                a = 1629;
                break;
            }
        case 1573: {
                a = 1630;
                break;
            }
        case 1575: {
                a = 1631;
                break;
            }
        default:
            a = 0;
        }
        return a | 0;
    }
    function fb(a) {
        a = a | 0;
        return (a + -1587 & 65535) < 4 | 0;
    }
    function gb(a) {
        a = a | 0;
        return (a + -1611 & 65535) < 8 | 0;
    }
    function hb(a, d, e, f) {
        a = a | 0;
        d = d | 0;
        e = e | 0;
        f = f | 0;
        var g = 0, h = 0, i = 0, j = 0, k = 0, l = 0, m = 0, n = 0;
        m = (d << 1) + 2 | 0;
        n = lb(m) | 0;
        if (!n) {
            c[e >> 2] = 7;
            n = 0;
            return n | 0;
        }
        fc(n | 0, 0, m | 0) | 0;
        e = 0;
        h = 0;
        g = 0;
        while (1) {
            if ((g | 0) >= (d | 0))
                break;
            i = b[a + (g << 1) >> 1] | 0;
            if (i << 16 >> 16 == -1) {
                e = e + 1 | 0;
                h = h + -1 | 0;
            } else
                b[n + (h << 1) >> 1] = i;
            h = h + 1 | 0;
            g = g + 1 | 0;
        }
        while (1) {
            if ((e | 0) <= -1)
                break;
            b[n + (g << 1) >> 1] = 0;
            g = g + -1 | 0;
            e = e + -1 | 0;
        }
        pb(a, n, d) | 0;
        if (c[f + 4 >> 2] | 0) {
            e = ob(a) | 0;
            if (!(c[f + 12 >> 2] | 0)) {
                j = 0;
                k = 1;
                l = 15;
            }
        } else {
            j = 1;
            k = (c[f + 12 >> 2] | 0) == 0;
            l = 15;
        }
        if ((l | 0) == 15) {
            fc(n | 0, 0, m | 0) | 0;
            e = d;
            g = 0;
            i = d;
            while (1) {
                if ((i | 0) <= -1)
                    break;
                h = b[a + (i << 1) >> 1] | 0;
                if (j & h << 16 >> 16 == -1 | k & h << 16 >> 16 == -2) {
                    e = e + 1 | 0;
                    g = g + 1 | 0;
                } else
                    b[n + (e << 1) >> 1] = h;
                e = e + -1 | 0;
                i = i + -1 | 0;
            }
            e = 0;
            while (1) {
                if ((e | 0) >= (g | 0))
                    break;
                b[n + (e << 1) >> 1] = 32;
                e = e + 1 | 0;
            }
            pb(a, n, d) | 0;
            e = d;
        }
        k = (c[f + 8 >> 2] | 0) == 0;
        f = (c[f + 16 >> 2] | 0) == 0;
        j = f | k ^ 1;
        if (k | f) {
            fc(n | 0, 0, m | 0) | 0;
            h = 0;
            e = 0;
            g = 0;
            while (1) {
                if ((g | 0) >= (d | 0))
                    break;
                i = b[a + (g << 1) >> 1] | 0;
                if (k & i << 16 >> 16 == -1 | j & i << 16 >> 16 == -2) {
                    h = h + -1 | 0;
                    e = e + 1 | 0;
                } else
                    b[n + (h << 1) >> 1] = i;
                h = h + 1 | 0;
                g = g + 1 | 0;
            }
            while (1) {
                if ((e | 0) <= -1)
                    break;
                b[n + (g << 1) >> 1] = 32;
                g = g + -1 | 0;
                e = e + -1 | 0;
            }
            pb(a, n, d) | 0;
            e = d;
        }
        nb(n);
        n = e;
        return n | 0;
    }
    function ib(a) {
        a = a | 0;
        switch (a << 16 >> 16) {
        case 1573:
        case 1571:
        case 1570: {
                a = 1;
                break;
            }
        default:
            a = a << 16 >> 16 == 1575 & 1;
        }
        return a | 0;
    }
    function jb(a) {
        a = a | 0;
        return (a & -16) << 16 >> 16 == -400 | 0;
    }
    function kb(a, b) {
        a = a | 0;
        b = b | 0;
        return ((a | 0) > (b | 0) ? b : a) | 0;
    }
    function lb(a) {
        a = a | 0;
        if (!a)
            a = 70336;
        else
            a = Ab(a) | 0;
        return a | 0;
    }
    function mb(a, b) {
        a = a | 0;
        b = b | 0;
        do
            if ((a | 0) != 70336)
                if (!b) {
                    Bb(a);
                    a = 70336;
                    break;
                } else {
                    a = Cb(a, b) | 0;
                    break;
                }
            else
                a = lb(b) | 0;
        while (0);
        return a | 0;
    }
    function nb(a) {
        a = a | 0;
        if ((a | 0) == 70336)
            return;
        Bb(a);
        return;
    }
    function ob(a) {
        a = a | 0;
        var c = 0;
        c = a;
        while (1)
            if (!(b[c >> 1] | 0))
                break;
            else
                c = c + 2 | 0;
        return c - a >> 1 | 0;
    }
    function pb(a, b, c) {
        a = a | 0;
        b = b | 0;
        c = c | 0;
        if ((c | 0) <= 0)
            return a | 0;
        ec(a | 0, b | 0, c << 1 | 0) | 0;
        return a | 0;
    }
    function qb(a, d, e, f) {
        a = a | 0;
        d = d | 0;
        e = e | 0;
        f = f | 0;
        do
            if (f | 0 ? !((e | 0) < 0 | (rb(c[f >> 2] | 0) | 0) << 24 >> 24 == 0) : 0) {
                if ((e | 0) < (d | 0)) {
                    b[a + (e << 1) >> 1] = 0;
                    if ((c[f >> 2] | 0) != -124)
                        break;
                    c[f >> 2] = 0;
                    break;
                }
                if ((e | 0) == (d | 0)) {
                    c[f >> 2] = -124;
                    break;
                } else {
                    c[f >> 2] = 15;
                    break;
                }
            }
        while (0);
        return e | 0;
    }
    function rb(a) {
        a = a | 0;
        return (a | 0) < 1 | 0;
    }
    function sb(a) {
        a = a | 0;
        var c = 0;
        do
            if (a >>> 0 >= 55296) {
                if (a >>> 0 < 65536) {
                    c = ((a | 0) < 56320 ? 320 : 0) + (a >>> 5) | 0;
                    break;
                }
                if (a >>> 0 > 1114111) {
                    a = 4596;
                    a = 2512 + (a << 1) | 0;
                    a = b[a >> 1] | 0;
                    a = a & 255;
                    a = a & 31;
                    return a | 0;
                } else {
                    c = (a >>> 5 & 63) + (e[2512 + ((a >>> 11) + 2080 << 1) >> 1] | 0) | 0;
                    break;
                }
            } else
                c = a >>> 5;
        while (0);
        a = ((e[2512 + (c << 1) >> 1] | 0) << 2) + (a & 31) | 0;
        a = 2512 + (a << 1) | 0;
        a = b[a >> 1] | 0;
        a = a & 255;
        a = a & 31;
        return a | 0;
    }
    function tb(a) {
        a = a | 0;
        var c = 0;
        do
            if (a >>> 0 >= 55296) {
                if (a >>> 0 < 65536) {
                    c = ((a | 0) < 56320 ? 320 : 0) + (a >>> 5) | 0;
                    break;
                }
                if (a >>> 0 > 1114111) {
                    a = 3644;
                    a = 45584 + (a << 1) | 0;
                    a = b[a >> 1] | 0;
                    a = a & 31;
                    a = a & 65535;
                    return a | 0;
                } else {
                    c = (a >>> 5 & 63) + (e[45584 + ((a >>> 11) + 2080 << 1) >> 1] | 0) | 0;
                    break;
                }
            } else
                c = a >>> 5;
        while (0);
        a = ((e[45584 + (c << 1) >> 1] | 0) << 2) + (a & 31) | 0;
        a = 45584 + (a << 1) | 0;
        a = b[a >> 1] | 0;
        a = a & 31;
        a = a & 65535;
        return a | 0;
    }
    function ub(a) {
        a = a | 0;
        var c = 0;
        do
            if (a >>> 0 >= 55296) {
                if (a >>> 0 < 65536) {
                    c = ((a | 0) < 56320 ? 320 : 0) + (a >>> 5) | 0;
                    break;
                }
                if (a >>> 0 > 1114111) {
                    c = 3644;
                    c = 45584 + (c << 1) | 0;
                    c = b[c >> 1] | 0;
                    a = vb(a, c) | 0;
                    return a | 0;
                } else {
                    c = (a >>> 5 & 63) + (e[45584 + ((a >>> 11) + 2080 << 1) >> 1] | 0) | 0;
                    break;
                }
            } else
                c = a >>> 5;
        while (0);
        c = ((e[45584 + (c << 1) >> 1] | 0) << 2) + (a & 31) | 0;
        c = 45584 + (c << 1) | 0;
        c = b[c >> 1] | 0;
        a = vb(a, c) | 0;
        return a | 0;
    }
    function vb(a, b) {
        a = a | 0;
        b = b | 0;
        var d = 0, e = 0;
        b = b << 16 >> 16 >> 13;
        if ((b | 0) != -4) {
            e = b + a | 0;
            return e | 0;
        }
        b = 0;
        while (1) {
            if (b >>> 0 >= 40) {
                b = 8;
                break;
            }
            e = c[45424 + (b << 2) >> 2] | 0;
            d = e & 2097151;
            if ((d | 0) == (a | 0)) {
                b = 6;
                break;
            }
            if ((d | 0) > (a | 0)) {
                b = 8;
                break;
            } else
                b = b + 1 | 0;
        }
        if ((b | 0) == 6) {
            e = c[45424 + (e >>> 21 << 2) >> 2] & 2097151;
            return e | 0;
        } else if ((b | 0) == 8)
            return a | 0;
        return 0;
    }
    function wb(a) {
        a = a | 0;
        var c = 0, d = 0;
        do
            if (a >>> 0 >= 55296) {
                if (a >>> 0 < 65536) {
                    c = ((a | 0) < 56320 ? 320 : 0) + (a >>> 5) | 0;
                    d = 7;
                    break;
                }
                if (a >>> 0 > 1114111)
                    c = 3644;
                else {
                    c = (a >>> 5 & 63) + (e[45584 + ((a >>> 11) + 2080 << 1) >> 1] | 0) | 0;
                    d = 7;
                }
            } else {
                c = a >>> 5;
                d = 7;
            }
        while (0);
        if ((d | 0) == 7)
            c = ((e[45584 + (c << 1) >> 1] | 0) << 2) + (a & 31) | 0;
        return (b[45584 + (c << 1) >> 1] & 768) >>> 8 | 0;
    }
    function xb(a) {
        a = a | 0;
        var c = 0, d = 0;
        do
            if (a >>> 0 >= 55296) {
                if (a >>> 0 < 65536) {
                    c = ((a | 0) < 56320 ? 320 : 0) + (a >>> 5) | 0;
                    d = 7;
                    break;
                }
                if (a >>> 0 > 1114111)
                    c = 3644;
                else {
                    c = (a >>> 5 & 63) + (e[45584 + ((a >>> 11) + 2080 << 1) >> 1] | 0) | 0;
                    d = 7;
                }
            } else {
                c = a >>> 5;
                d = 7;
            }
        while (0);
        if ((d | 0) == 7)
            c = ((e[45584 + (c << 1) >> 1] | 0) << 2) + (a & 31) | 0;
        c = b[45584 + (c << 1) >> 1] | 0;
        if (!(c & 768))
            return a | 0;
        a = vb(a, c) | 0;
        return a | 0;
    }
    function yb(a) {
        a = a | 0;
        return ub(a) | 0;
    }
    function zb(a) {
        a = a | 0;
        return xb(a) | 0;
    }
    function Ab(a) {
        a = a | 0;
        var b = 0, d = 0, e = 0, f = 0, g = 0, h = 0, i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0, q = 0, r = 0, s = 0, t = 0;
        t = E;
        E = E + 16 | 0;
        n = t;
        do
            if (a >>> 0 < 245) {
                k = a >>> 0 < 11 ? 16 : a + 11 & -8;
                a = k >>> 3;
                m = c[17594] | 0;
                d = m >>> a;
                if (d & 3 | 0) {
                    b = (d & 1 ^ 1) + a | 0;
                    a = 70416 + (b << 1 << 2) | 0;
                    d = a + 8 | 0;
                    e = c[d >> 2] | 0;
                    f = e + 8 | 0;
                    g = c[f >> 2] | 0;
                    if ((g | 0) == (a | 0))
                        c[17594] = m & ~(1 << b);
                    else {
                        c[g + 12 >> 2] = a;
                        c[d >> 2] = g;
                    }
                    s = b << 3;
                    c[e + 4 >> 2] = s | 3;
                    s = e + s + 4 | 0;
                    c[s >> 2] = c[s >> 2] | 1;
                    s = f;
                    E = t;
                    return s | 0;
                }
                l = c[17596] | 0;
                if (k >>> 0 > l >>> 0) {
                    if (d | 0) {
                        b = 2 << a;
                        b = d << a & (b | 0 - b);
                        b = (b & 0 - b) + -1 | 0;
                        i = b >>> 12 & 16;
                        b = b >>> i;
                        d = b >>> 5 & 8;
                        b = b >>> d;
                        g = b >>> 2 & 4;
                        b = b >>> g;
                        a = b >>> 1 & 2;
                        b = b >>> a;
                        e = b >>> 1 & 1;
                        e = (d | i | g | a | e) + (b >>> e) | 0;
                        b = 70416 + (e << 1 << 2) | 0;
                        a = b + 8 | 0;
                        g = c[a >> 2] | 0;
                        i = g + 8 | 0;
                        d = c[i >> 2] | 0;
                        if ((d | 0) == (b | 0)) {
                            a = m & ~(1 << e);
                            c[17594] = a;
                        } else {
                            c[d + 12 >> 2] = b;
                            c[a >> 2] = d;
                            a = m;
                        }
                        s = e << 3;
                        h = s - k | 0;
                        c[g + 4 >> 2] = k | 3;
                        f = g + k | 0;
                        c[f + 4 >> 2] = h | 1;
                        c[g + s >> 2] = h;
                        if (l | 0) {
                            e = c[17599] | 0;
                            b = l >>> 3;
                            d = 70416 + (b << 1 << 2) | 0;
                            b = 1 << b;
                            if (!(a & b)) {
                                c[17594] = a | b;
                                b = d;
                                a = d + 8 | 0;
                            } else {
                                a = d + 8 | 0;
                                b = c[a >> 2] | 0;
                            }
                            c[a >> 2] = e;
                            c[b + 12 >> 2] = e;
                            c[e + 8 >> 2] = b;
                            c[e + 12 >> 2] = d;
                        }
                        c[17596] = h;
                        c[17599] = f;
                        s = i;
                        E = t;
                        return s | 0;
                    }
                    g = c[17595] | 0;
                    if (g) {
                        d = (g & 0 - g) + -1 | 0;
                        f = d >>> 12 & 16;
                        d = d >>> f;
                        e = d >>> 5 & 8;
                        d = d >>> e;
                        h = d >>> 2 & 4;
                        d = d >>> h;
                        i = d >>> 1 & 2;
                        d = d >>> i;
                        j = d >>> 1 & 1;
                        j = c[70680 + ((e | f | h | i | j) + (d >>> j) << 2) >> 2] | 0;
                        d = j;
                        i = j;
                        j = (c[j + 4 >> 2] & -8) - k | 0;
                        while (1) {
                            a = c[d + 16 >> 2] | 0;
                            if (!a) {
                                a = c[d + 20 >> 2] | 0;
                                if (!a)
                                    break;
                            }
                            h = (c[a + 4 >> 2] & -8) - k | 0;
                            f = h >>> 0 < j >>> 0;
                            d = a;
                            i = f ? a : i;
                            j = f ? h : j;
                        }
                        h = i + k | 0;
                        if (h >>> 0 > i >>> 0) {
                            f = c[i + 24 >> 2] | 0;
                            b = c[i + 12 >> 2] | 0;
                            do
                                if ((b | 0) == (i | 0)) {
                                    a = i + 20 | 0;
                                    b = c[a >> 2] | 0;
                                    if (!b) {
                                        a = i + 16 | 0;
                                        b = c[a >> 2] | 0;
                                        if (!b) {
                                            d = 0;
                                            break;
                                        }
                                    }
                                    while (1) {
                                        e = b + 20 | 0;
                                        d = c[e >> 2] | 0;
                                        if (!d) {
                                            e = b + 16 | 0;
                                            d = c[e >> 2] | 0;
                                            if (!d)
                                                break;
                                            else {
                                                b = d;
                                                a = e;
                                            }
                                        } else {
                                            b = d;
                                            a = e;
                                        }
                                    }
                                    c[a >> 2] = 0;
                                    d = b;
                                } else {
                                    d = c[i + 8 >> 2] | 0;
                                    c[d + 12 >> 2] = b;
                                    c[b + 8 >> 2] = d;
                                    d = b;
                                }
                            while (0);
                            do
                                if (f | 0) {
                                    b = c[i + 28 >> 2] | 0;
                                    a = 70680 + (b << 2) | 0;
                                    if ((i | 0) == (c[a >> 2] | 0)) {
                                        c[a >> 2] = d;
                                        if (!d) {
                                            c[17595] = g & ~(1 << b);
                                            break;
                                        }
                                    } else {
                                        s = f + 16 | 0;
                                        c[((c[s >> 2] | 0) == (i | 0) ? s : f + 20 | 0) >> 2] = d;
                                        if (!d)
                                            break;
                                    }
                                    c[d + 24 >> 2] = f;
                                    b = c[i + 16 >> 2] | 0;
                                    if (b | 0) {
                                        c[d + 16 >> 2] = b;
                                        c[b + 24 >> 2] = d;
                                    }
                                    b = c[i + 20 >> 2] | 0;
                                    if (b | 0) {
                                        c[d + 20 >> 2] = b;
                                        c[b + 24 >> 2] = d;
                                    }
                                }
                            while (0);
                            if (j >>> 0 < 16) {
                                s = j + k | 0;
                                c[i + 4 >> 2] = s | 3;
                                s = i + s + 4 | 0;
                                c[s >> 2] = c[s >> 2] | 1;
                            } else {
                                c[i + 4 >> 2] = k | 3;
                                c[h + 4 >> 2] = j | 1;
                                c[h + j >> 2] = j;
                                if (l | 0) {
                                    e = c[17599] | 0;
                                    b = l >>> 3;
                                    d = 70416 + (b << 1 << 2) | 0;
                                    b = 1 << b;
                                    if (!(b & m)) {
                                        c[17594] = b | m;
                                        b = d;
                                        a = d + 8 | 0;
                                    } else {
                                        a = d + 8 | 0;
                                        b = c[a >> 2] | 0;
                                    }
                                    c[a >> 2] = e;
                                    c[b + 12 >> 2] = e;
                                    c[e + 8 >> 2] = b;
                                    c[e + 12 >> 2] = d;
                                }
                                c[17596] = j;
                                c[17599] = h;
                            }
                            s = i + 8 | 0;
                            E = t;
                            return s | 0;
                        } else
                            m = k;
                    } else
                        m = k;
                } else
                    m = k;
            } else if (a >>> 0 <= 4294967231) {
                a = a + 11 | 0;
                k = a & -8;
                e = c[17595] | 0;
                if (e) {
                    f = 0 - k | 0;
                    a = a >>> 8;
                    if (a)
                        if (k >>> 0 > 16777215)
                            j = 31;
                        else {
                            m = (a + 1048320 | 0) >>> 16 & 8;
                            r = a << m;
                            i = (r + 520192 | 0) >>> 16 & 4;
                            r = r << i;
                            j = (r + 245760 | 0) >>> 16 & 2;
                            j = 14 - (i | m | j) + (r << j >>> 15) | 0;
                            j = k >>> (j + 7 | 0) & 1 | j << 1;
                        }
                    else
                        j = 0;
                    d = c[70680 + (j << 2) >> 2] | 0;
                    a:
                        do
                            if (!d) {
                                d = 0;
                                a = 0;
                                r = 61;
                            } else {
                                a = 0;
                                i = k << ((j | 0) == 31 ? 0 : 25 - (j >>> 1) | 0);
                                g = 0;
                                while (1) {
                                    h = (c[d + 4 >> 2] & -8) - k | 0;
                                    if (h >>> 0 < f >>> 0)
                                        if (!h) {
                                            a = d;
                                            f = 0;
                                            r = 65;
                                            break a;
                                        } else {
                                            a = d;
                                            f = h;
                                        }
                                    r = c[d + 20 >> 2] | 0;
                                    d = c[d + 16 + (i >>> 31 << 2) >> 2] | 0;
                                    g = (r | 0) == 0 | (r | 0) == (d | 0) ? g : r;
                                    if (!d) {
                                        d = g;
                                        r = 61;
                                        break;
                                    } else
                                        i = i << 1;
                                }
                            }
                        while (0);
                    if ((r | 0) == 61) {
                        if ((d | 0) == 0 & (a | 0) == 0) {
                            a = 2 << j;
                            a = (a | 0 - a) & e;
                            if (!a) {
                                m = k;
                                break;
                            }
                            m = (a & 0 - a) + -1 | 0;
                            h = m >>> 12 & 16;
                            m = m >>> h;
                            g = m >>> 5 & 8;
                            m = m >>> g;
                            i = m >>> 2 & 4;
                            m = m >>> i;
                            j = m >>> 1 & 2;
                            m = m >>> j;
                            d = m >>> 1 & 1;
                            a = 0;
                            d = c[70680 + ((g | h | i | j | d) + (m >>> d) << 2) >> 2] | 0;
                        }
                        if (!d) {
                            i = a;
                            h = f;
                        } else
                            r = 65;
                    }
                    if ((r | 0) == 65) {
                        g = d;
                        while (1) {
                            m = (c[g + 4 >> 2] & -8) - k | 0;
                            d = m >>> 0 < f >>> 0;
                            f = d ? m : f;
                            a = d ? g : a;
                            d = c[g + 16 >> 2] | 0;
                            if (!d)
                                d = c[g + 20 >> 2] | 0;
                            if (!d) {
                                i = a;
                                h = f;
                                break;
                            } else
                                g = d;
                        }
                    }
                    if (((i | 0) != 0 ? h >>> 0 < ((c[17596] | 0) - k | 0) >>> 0 : 0) ? (l = i + k | 0, l >>> 0 > i >>> 0) : 0) {
                        g = c[i + 24 >> 2] | 0;
                        b = c[i + 12 >> 2] | 0;
                        do
                            if ((b | 0) == (i | 0)) {
                                a = i + 20 | 0;
                                b = c[a >> 2] | 0;
                                if (!b) {
                                    a = i + 16 | 0;
                                    b = c[a >> 2] | 0;
                                    if (!b) {
                                        b = 0;
                                        break;
                                    }
                                }
                                while (1) {
                                    f = b + 20 | 0;
                                    d = c[f >> 2] | 0;
                                    if (!d) {
                                        f = b + 16 | 0;
                                        d = c[f >> 2] | 0;
                                        if (!d)
                                            break;
                                        else {
                                            b = d;
                                            a = f;
                                        }
                                    } else {
                                        b = d;
                                        a = f;
                                    }
                                }
                                c[a >> 2] = 0;
                            } else {
                                s = c[i + 8 >> 2] | 0;
                                c[s + 12 >> 2] = b;
                                c[b + 8 >> 2] = s;
                            }
                        while (0);
                        do
                            if (g) {
                                a = c[i + 28 >> 2] | 0;
                                d = 70680 + (a << 2) | 0;
                                if ((i | 0) == (c[d >> 2] | 0)) {
                                    c[d >> 2] = b;
                                    if (!b) {
                                        e = e & ~(1 << a);
                                        c[17595] = e;
                                        break;
                                    }
                                } else {
                                    s = g + 16 | 0;
                                    c[((c[s >> 2] | 0) == (i | 0) ? s : g + 20 | 0) >> 2] = b;
                                    if (!b)
                                        break;
                                }
                                c[b + 24 >> 2] = g;
                                a = c[i + 16 >> 2] | 0;
                                if (a | 0) {
                                    c[b + 16 >> 2] = a;
                                    c[a + 24 >> 2] = b;
                                }
                                a = c[i + 20 >> 2] | 0;
                                if (a) {
                                    c[b + 20 >> 2] = a;
                                    c[a + 24 >> 2] = b;
                                }
                            }
                        while (0);
                        b:
                            do
                                if (h >>> 0 < 16) {
                                    s = h + k | 0;
                                    c[i + 4 >> 2] = s | 3;
                                    s = i + s + 4 | 0;
                                    c[s >> 2] = c[s >> 2] | 1;
                                } else {
                                    c[i + 4 >> 2] = k | 3;
                                    c[l + 4 >> 2] = h | 1;
                                    c[l + h >> 2] = h;
                                    b = h >>> 3;
                                    if (h >>> 0 < 256) {
                                        d = 70416 + (b << 1 << 2) | 0;
                                        a = c[17594] | 0;
                                        b = 1 << b;
                                        if (!(a & b)) {
                                            c[17594] = a | b;
                                            b = d;
                                            a = d + 8 | 0;
                                        } else {
                                            a = d + 8 | 0;
                                            b = c[a >> 2] | 0;
                                        }
                                        c[a >> 2] = l;
                                        c[b + 12 >> 2] = l;
                                        c[l + 8 >> 2] = b;
                                        c[l + 12 >> 2] = d;
                                        break;
                                    }
                                    b = h >>> 8;
                                    if (b)
                                        if (h >>> 0 > 16777215)
                                            d = 31;
                                        else {
                                            r = (b + 1048320 | 0) >>> 16 & 8;
                                            s = b << r;
                                            q = (s + 520192 | 0) >>> 16 & 4;
                                            s = s << q;
                                            d = (s + 245760 | 0) >>> 16 & 2;
                                            d = 14 - (q | r | d) + (s << d >>> 15) | 0;
                                            d = h >>> (d + 7 | 0) & 1 | d << 1;
                                        }
                                    else
                                        d = 0;
                                    b = 70680 + (d << 2) | 0;
                                    c[l + 28 >> 2] = d;
                                    a = l + 16 | 0;
                                    c[a + 4 >> 2] = 0;
                                    c[a >> 2] = 0;
                                    a = 1 << d;
                                    if (!(a & e)) {
                                        c[17595] = a | e;
                                        c[b >> 2] = l;
                                        c[l + 24 >> 2] = b;
                                        c[l + 12 >> 2] = l;
                                        c[l + 8 >> 2] = l;
                                        break;
                                    }
                                    b = c[b >> 2] | 0;
                                    c:
                                        do
                                            if ((c[b + 4 >> 2] & -8 | 0) != (h | 0)) {
                                                e = h << ((d | 0) == 31 ? 0 : 25 - (d >>> 1) | 0);
                                                while (1) {
                                                    d = b + 16 + (e >>> 31 << 2) | 0;
                                                    a = c[d >> 2] | 0;
                                                    if (!a)
                                                        break;
                                                    if ((c[a + 4 >> 2] & -8 | 0) == (h | 0)) {
                                                        b = a;
                                                        break c;
                                                    } else {
                                                        e = e << 1;
                                                        b = a;
                                                    }
                                                }
                                                c[d >> 2] = l;
                                                c[l + 24 >> 2] = b;
                                                c[l + 12 >> 2] = l;
                                                c[l + 8 >> 2] = l;
                                                break b;
                                            }
                                        while (0);
                                    r = b + 8 | 0;
                                    s = c[r >> 2] | 0;
                                    c[s + 12 >> 2] = l;
                                    c[r >> 2] = l;
                                    c[l + 8 >> 2] = s;
                                    c[l + 12 >> 2] = b;
                                    c[l + 24 >> 2] = 0;
                                }
                            while (0);
                        s = i + 8 | 0;
                        E = t;
                        return s | 0;
                    } else
                        m = k;
                } else
                    m = k;
            } else
                m = -1;
        while (0);
        d = c[17596] | 0;
        if (d >>> 0 >= m >>> 0) {
            b = d - m | 0;
            a = c[17599] | 0;
            if (b >>> 0 > 15) {
                s = a + m | 0;
                c[17599] = s;
                c[17596] = b;
                c[s + 4 >> 2] = b | 1;
                c[a + d >> 2] = b;
                c[a + 4 >> 2] = m | 3;
            } else {
                c[17596] = 0;
                c[17599] = 0;
                c[a + 4 >> 2] = d | 3;
                s = a + d + 4 | 0;
                c[s >> 2] = c[s >> 2] | 1;
            }
            s = a + 8 | 0;
            E = t;
            return s | 0;
        }
        h = c[17597] | 0;
        if (h >>> 0 > m >>> 0) {
            q = h - m | 0;
            c[17597] = q;
            s = c[17600] | 0;
            r = s + m | 0;
            c[17600] = r;
            c[r + 4 >> 2] = q | 1;
            c[s + 4 >> 2] = m | 3;
            s = s + 8 | 0;
            E = t;
            return s | 0;
        }
        if (!(c[17712] | 0)) {
            c[17714] = 4096;
            c[17713] = 4096;
            c[17715] = -1;
            c[17716] = -1;
            c[17717] = 0;
            c[17705] = 0;
            c[17712] = n & -16 ^ 1431655768;
            a = 4096;
        } else
            a = c[17714] | 0;
        i = m + 48 | 0;
        j = m + 47 | 0;
        g = a + j | 0;
        f = 0 - a | 0;
        k = g & f;
        if (k >>> 0 <= m >>> 0) {
            s = 0;
            E = t;
            return s | 0;
        }
        a = c[17704] | 0;
        if (a | 0 ? (l = c[17702] | 0, n = l + k | 0, n >>> 0 <= l >>> 0 | n >>> 0 > a >>> 0) : 0) {
            s = 0;
            E = t;
            return s | 0;
        }
        d:
            do
                if (!(c[17705] & 4)) {
                    e = c[17600] | 0;
                    e:
                        do
                            if (e) {
                                a = 70824;
                                while (1) {
                                    d = c[a >> 2] | 0;
                                    if (d >>> 0 <= e >>> 0 ? (q = a + 4 | 0, (d + (c[q >> 2] | 0) | 0) >>> 0 > e >>> 0) : 0)
                                        break;
                                    a = c[a + 8 >> 2] | 0;
                                    if (!a) {
                                        r = 128;
                                        break e;
                                    }
                                }
                                b = g - h & f;
                                if (b >>> 0 < 2147483647) {
                                    e = gc(b | 0) | 0;
                                    if ((e | 0) == ((c[a >> 2] | 0) + (c[q >> 2] | 0) | 0)) {
                                        if ((e | 0) != (-1 | 0))
                                            break d;
                                    } else
                                        r = 136;
                                } else
                                    b = 0;
                            } else
                                r = 128;
                        while (0);
                    do
                        if ((r | 0) == 128) {
                            a = gc(0) | 0;
                            if ((a | 0) != (-1 | 0) ? (b = a, o = c[17713] | 0, p = o + -1 | 0, b = ((p & b | 0) == 0 ? 0 : (p + b & 0 - o) - b | 0) + k | 0, o = c[17702] | 0, p = b + o | 0, b >>> 0 > m >>> 0 & b >>> 0 < 2147483647) : 0) {
                                q = c[17704] | 0;
                                if (q | 0 ? p >>> 0 <= o >>> 0 | p >>> 0 > q >>> 0 : 0) {
                                    b = 0;
                                    break;
                                }
                                e = gc(b | 0) | 0;
                                if ((e | 0) == (a | 0)) {
                                    e = a;
                                    break d;
                                } else
                                    r = 136;
                            } else
                                b = 0;
                        }
                    while (0);
                    do
                        if ((r | 0) == 136) {
                            d = 0 - b | 0;
                            if (!(i >>> 0 > b >>> 0 & (b >>> 0 < 2147483647 & (e | 0) != (-1 | 0))))
                                if ((e | 0) == (-1 | 0)) {
                                    b = 0;
                                    break;
                                } else
                                    break d;
                            a = c[17714] | 0;
                            a = j - b + a & 0 - a;
                            if (a >>> 0 >= 2147483647)
                                break d;
                            if ((gc(a | 0) | 0) == (-1 | 0)) {
                                gc(d | 0) | 0;
                                b = 0;
                                break;
                            } else {
                                b = a + b | 0;
                                break d;
                            }
                        }
                    while (0);
                    c[17705] = c[17705] | 4;
                    r = 143;
                } else {
                    b = 0;
                    r = 143;
                }
            while (0);
        if ((r | 0) == 143) {
            if (k >>> 0 >= 2147483647) {
                s = 0;
                E = t;
                return s | 0;
            }
            e = gc(k | 0) | 0;
            q = gc(0) | 0;
            a = q - e | 0;
            d = a >>> 0 > (m + 40 | 0) >>> 0;
            if ((e | 0) == (-1 | 0) | d ^ 1 | e >>> 0 < q >>> 0 & ((e | 0) != (-1 | 0) & (q | 0) != (-1 | 0)) ^ 1) {
                s = 0;
                E = t;
                return s | 0;
            } else
                b = d ? a : b;
        }
        a = (c[17702] | 0) + b | 0;
        c[17702] = a;
        if (a >>> 0 > (c[17703] | 0) >>> 0)
            c[17703] = a;
        j = c[17600] | 0;
        f:
            do
                if (j) {
                    a = 70824;
                    while (1) {
                        d = c[a >> 2] | 0;
                        f = a + 4 | 0;
                        g = c[f >> 2] | 0;
                        if ((e | 0) == (d + g | 0)) {
                            r = 154;
                            break;
                        }
                        h = c[a + 8 >> 2] | 0;
                        if (!h)
                            break;
                        else
                            a = h;
                    }
                    if (((r | 0) == 154 ? (c[a + 12 >> 2] & 8 | 0) == 0 : 0) ? e >>> 0 > j >>> 0 & d >>> 0 <= j >>> 0 : 0) {
                        c[f >> 2] = g + b;
                        s = (c[17597] | 0) + b | 0;
                        q = j + 8 | 0;
                        q = (q & 7 | 0) == 0 ? 0 : 0 - q & 7;
                        r = j + q | 0;
                        q = s - q | 0;
                        c[17600] = r;
                        c[17597] = q;
                        c[r + 4 >> 2] = q | 1;
                        c[j + s + 4 >> 2] = 40;
                        c[17601] = c[17716];
                        break;
                    }
                    if (e >>> 0 < (c[17598] | 0) >>> 0)
                        c[17598] = e;
                    f = e + b | 0;
                    a = 70824;
                    while (1) {
                        if ((c[a >> 2] | 0) == (f | 0)) {
                            r = 162;
                            break;
                        }
                        d = c[a + 8 >> 2] | 0;
                        if (!d)
                            break;
                        else
                            a = d;
                    }
                    if ((r | 0) == 162 ? (c[a + 12 >> 2] & 8 | 0) == 0 : 0) {
                        c[a >> 2] = e;
                        l = a + 4 | 0;
                        c[l >> 2] = (c[l >> 2] | 0) + b;
                        l = e + 8 | 0;
                        l = e + ((l & 7 | 0) == 0 ? 0 : 0 - l & 7) | 0;
                        b = f + 8 | 0;
                        b = f + ((b & 7 | 0) == 0 ? 0 : 0 - b & 7) | 0;
                        k = l + m | 0;
                        i = b - l - m | 0;
                        c[l + 4 >> 2] = m | 3;
                        g:
                            do
                                if ((j | 0) == (b | 0)) {
                                    s = (c[17597] | 0) + i | 0;
                                    c[17597] = s;
                                    c[17600] = k;
                                    c[k + 4 >> 2] = s | 1;
                                } else {
                                    if ((c[17599] | 0) == (b | 0)) {
                                        s = (c[17596] | 0) + i | 0;
                                        c[17596] = s;
                                        c[17599] = k;
                                        c[k + 4 >> 2] = s | 1;
                                        c[k + s >> 2] = s;
                                        break;
                                    }
                                    a = c[b + 4 >> 2] | 0;
                                    if ((a & 3 | 0) == 1) {
                                        h = a & -8;
                                        e = a >>> 3;
                                        h:
                                            do
                                                if (a >>> 0 < 256) {
                                                    a = c[b + 8 >> 2] | 0;
                                                    d = c[b + 12 >> 2] | 0;
                                                    if ((d | 0) == (a | 0)) {
                                                        c[17594] = c[17594] & ~(1 << e);
                                                        break;
                                                    } else {
                                                        c[a + 12 >> 2] = d;
                                                        c[d + 8 >> 2] = a;
                                                        break;
                                                    }
                                                } else {
                                                    g = c[b + 24 >> 2] | 0;
                                                    a = c[b + 12 >> 2] | 0;
                                                    do
                                                        if ((a | 0) == (b | 0)) {
                                                            d = b + 16 | 0;
                                                            e = d + 4 | 0;
                                                            a = c[e >> 2] | 0;
                                                            if (!a) {
                                                                a = c[d >> 2] | 0;
                                                                if (!a) {
                                                                    a = 0;
                                                                    break;
                                                                }
                                                            } else
                                                                d = e;
                                                            while (1) {
                                                                f = a + 20 | 0;
                                                                e = c[f >> 2] | 0;
                                                                if (!e) {
                                                                    f = a + 16 | 0;
                                                                    e = c[f >> 2] | 0;
                                                                    if (!e)
                                                                        break;
                                                                    else {
                                                                        a = e;
                                                                        d = f;
                                                                    }
                                                                } else {
                                                                    a = e;
                                                                    d = f;
                                                                }
                                                            }
                                                            c[d >> 2] = 0;
                                                        } else {
                                                            s = c[b + 8 >> 2] | 0;
                                                            c[s + 12 >> 2] = a;
                                                            c[a + 8 >> 2] = s;
                                                        }
                                                    while (0);
                                                    if (!g)
                                                        break;
                                                    d = c[b + 28 >> 2] | 0;
                                                    e = 70680 + (d << 2) | 0;
                                                    do
                                                        if ((c[e >> 2] | 0) != (b | 0)) {
                                                            s = g + 16 | 0;
                                                            c[((c[s >> 2] | 0) == (b | 0) ? s : g + 20 | 0) >> 2] = a;
                                                            if (!a)
                                                                break h;
                                                        } else {
                                                            c[e >> 2] = a;
                                                            if (a | 0)
                                                                break;
                                                            c[17595] = c[17595] & ~(1 << d);
                                                            break h;
                                                        }
                                                    while (0);
                                                    c[a + 24 >> 2] = g;
                                                    d = b + 16 | 0;
                                                    e = c[d >> 2] | 0;
                                                    if (e | 0) {
                                                        c[a + 16 >> 2] = e;
                                                        c[e + 24 >> 2] = a;
                                                    }
                                                    d = c[d + 4 >> 2] | 0;
                                                    if (!d)
                                                        break;
                                                    c[a + 20 >> 2] = d;
                                                    c[d + 24 >> 2] = a;
                                                }
                                            while (0);
                                        b = b + h | 0;
                                        f = h + i | 0;
                                    } else
                                        f = i;
                                    b = b + 4 | 0;
                                    c[b >> 2] = c[b >> 2] & -2;
                                    c[k + 4 >> 2] = f | 1;
                                    c[k + f >> 2] = f;
                                    b = f >>> 3;
                                    if (f >>> 0 < 256) {
                                        d = 70416 + (b << 1 << 2) | 0;
                                        a = c[17594] | 0;
                                        b = 1 << b;
                                        if (!(a & b)) {
                                            c[17594] = a | b;
                                            b = d;
                                            a = d + 8 | 0;
                                        } else {
                                            a = d + 8 | 0;
                                            b = c[a >> 2] | 0;
                                        }
                                        c[a >> 2] = k;
                                        c[b + 12 >> 2] = k;
                                        c[k + 8 >> 2] = b;
                                        c[k + 12 >> 2] = d;
                                        break;
                                    }
                                    b = f >>> 8;
                                    do
                                        if (!b)
                                            e = 0;
                                        else {
                                            if (f >>> 0 > 16777215) {
                                                e = 31;
                                                break;
                                            }
                                            r = (b + 1048320 | 0) >>> 16 & 8;
                                            s = b << r;
                                            q = (s + 520192 | 0) >>> 16 & 4;
                                            s = s << q;
                                            e = (s + 245760 | 0) >>> 16 & 2;
                                            e = 14 - (q | r | e) + (s << e >>> 15) | 0;
                                            e = f >>> (e + 7 | 0) & 1 | e << 1;
                                        }
                                    while (0);
                                    b = 70680 + (e << 2) | 0;
                                    c[k + 28 >> 2] = e;
                                    a = k + 16 | 0;
                                    c[a + 4 >> 2] = 0;
                                    c[a >> 2] = 0;
                                    a = c[17595] | 0;
                                    d = 1 << e;
                                    if (!(a & d)) {
                                        c[17595] = a | d;
                                        c[b >> 2] = k;
                                        c[k + 24 >> 2] = b;
                                        c[k + 12 >> 2] = k;
                                        c[k + 8 >> 2] = k;
                                        break;
                                    }
                                    b = c[b >> 2] | 0;
                                    i:
                                        do
                                            if ((c[b + 4 >> 2] & -8 | 0) != (f | 0)) {
                                                e = f << ((e | 0) == 31 ? 0 : 25 - (e >>> 1) | 0);
                                                while (1) {
                                                    d = b + 16 + (e >>> 31 << 2) | 0;
                                                    a = c[d >> 2] | 0;
                                                    if (!a)
                                                        break;
                                                    if ((c[a + 4 >> 2] & -8 | 0) == (f | 0)) {
                                                        b = a;
                                                        break i;
                                                    } else {
                                                        e = e << 1;
                                                        b = a;
                                                    }
                                                }
                                                c[d >> 2] = k;
                                                c[k + 24 >> 2] = b;
                                                c[k + 12 >> 2] = k;
                                                c[k + 8 >> 2] = k;
                                                break g;
                                            }
                                        while (0);
                                    r = b + 8 | 0;
                                    s = c[r >> 2] | 0;
                                    c[s + 12 >> 2] = k;
                                    c[r >> 2] = k;
                                    c[k + 8 >> 2] = s;
                                    c[k + 12 >> 2] = b;
                                    c[k + 24 >> 2] = 0;
                                }
                            while (0);
                        s = l + 8 | 0;
                        E = t;
                        return s | 0;
                    }
                    a = 70824;
                    while (1) {
                        d = c[a >> 2] | 0;
                        if (d >>> 0 <= j >>> 0 ? (s = d + (c[a + 4 >> 2] | 0) | 0, s >>> 0 > j >>> 0) : 0)
                            break;
                        a = c[a + 8 >> 2] | 0;
                    }
                    f = s + -47 | 0;
                    a = f + 8 | 0;
                    a = f + ((a & 7 | 0) == 0 ? 0 : 0 - a & 7) | 0;
                    f = j + 16 | 0;
                    a = a >>> 0 < f >>> 0 ? j : a;
                    r = a + 8 | 0;
                    d = b + -40 | 0;
                    p = e + 8 | 0;
                    p = (p & 7 | 0) == 0 ? 0 : 0 - p & 7;
                    q = e + p | 0;
                    p = d - p | 0;
                    c[17600] = q;
                    c[17597] = p;
                    c[q + 4 >> 2] = p | 1;
                    c[e + d + 4 >> 2] = 40;
                    c[17601] = c[17716];
                    d = a + 4 | 0;
                    c[d >> 2] = 27;
                    c[r >> 2] = c[17706];
                    c[r + 4 >> 2] = c[17707];
                    c[r + 8 >> 2] = c[17708];
                    c[r + 12 >> 2] = c[17709];
                    c[17706] = e;
                    c[17707] = b;
                    c[17709] = 0;
                    c[17708] = r;
                    b = a + 24 | 0;
                    do {
                        r = b;
                        b = b + 4 | 0;
                        c[b >> 2] = 7;
                    } while ((r + 8 | 0) >>> 0 < s >>> 0);
                    if ((a | 0) != (j | 0)) {
                        g = a - j | 0;
                        c[d >> 2] = c[d >> 2] & -2;
                        c[j + 4 >> 2] = g | 1;
                        c[a >> 2] = g;
                        b = g >>> 3;
                        if (g >>> 0 < 256) {
                            d = 70416 + (b << 1 << 2) | 0;
                            a = c[17594] | 0;
                            b = 1 << b;
                            if (!(a & b)) {
                                c[17594] = a | b;
                                b = d;
                                a = d + 8 | 0;
                            } else {
                                a = d + 8 | 0;
                                b = c[a >> 2] | 0;
                            }
                            c[a >> 2] = j;
                            c[b + 12 >> 2] = j;
                            c[j + 8 >> 2] = b;
                            c[j + 12 >> 2] = d;
                            break;
                        }
                        b = g >>> 8;
                        if (b)
                            if (g >>> 0 > 16777215)
                                e = 31;
                            else {
                                r = (b + 1048320 | 0) >>> 16 & 8;
                                s = b << r;
                                q = (s + 520192 | 0) >>> 16 & 4;
                                s = s << q;
                                e = (s + 245760 | 0) >>> 16 & 2;
                                e = 14 - (q | r | e) + (s << e >>> 15) | 0;
                                e = g >>> (e + 7 | 0) & 1 | e << 1;
                            }
                        else
                            e = 0;
                        d = 70680 + (e << 2) | 0;
                        c[j + 28 >> 2] = e;
                        c[j + 20 >> 2] = 0;
                        c[f >> 2] = 0;
                        b = c[17595] | 0;
                        a = 1 << e;
                        if (!(b & a)) {
                            c[17595] = b | a;
                            c[d >> 2] = j;
                            c[j + 24 >> 2] = d;
                            c[j + 12 >> 2] = j;
                            c[j + 8 >> 2] = j;
                            break;
                        }
                        b = c[d >> 2] | 0;
                        j:
                            do
                                if ((c[b + 4 >> 2] & -8 | 0) != (g | 0)) {
                                    e = g << ((e | 0) == 31 ? 0 : 25 - (e >>> 1) | 0);
                                    while (1) {
                                        d = b + 16 + (e >>> 31 << 2) | 0;
                                        a = c[d >> 2] | 0;
                                        if (!a)
                                            break;
                                        if ((c[a + 4 >> 2] & -8 | 0) == (g | 0)) {
                                            b = a;
                                            break j;
                                        } else {
                                            e = e << 1;
                                            b = a;
                                        }
                                    }
                                    c[d >> 2] = j;
                                    c[j + 24 >> 2] = b;
                                    c[j + 12 >> 2] = j;
                                    c[j + 8 >> 2] = j;
                                    break f;
                                }
                            while (0);
                        r = b + 8 | 0;
                        s = c[r >> 2] | 0;
                        c[s + 12 >> 2] = j;
                        c[r >> 2] = j;
                        c[j + 8 >> 2] = s;
                        c[j + 12 >> 2] = b;
                        c[j + 24 >> 2] = 0;
                    }
                } else {
                    s = c[17598] | 0;
                    if ((s | 0) == 0 | e >>> 0 < s >>> 0)
                        c[17598] = e;
                    c[17706] = e;
                    c[17707] = b;
                    c[17709] = 0;
                    c[17603] = c[17712];
                    c[17602] = -1;
                    c[17607] = 70416;
                    c[17606] = 70416;
                    c[17609] = 70424;
                    c[17608] = 70424;
                    c[17611] = 70432;
                    c[17610] = 70432;
                    c[17613] = 70440;
                    c[17612] = 70440;
                    c[17615] = 70448;
                    c[17614] = 70448;
                    c[17617] = 70456;
                    c[17616] = 70456;
                    c[17619] = 70464;
                    c[17618] = 70464;
                    c[17621] = 70472;
                    c[17620] = 70472;
                    c[17623] = 70480;
                    c[17622] = 70480;
                    c[17625] = 70488;
                    c[17624] = 70488;
                    c[17627] = 70496;
                    c[17626] = 70496;
                    c[17629] = 70504;
                    c[17628] = 70504;
                    c[17631] = 70512;
                    c[17630] = 70512;
                    c[17633] = 70520;
                    c[17632] = 70520;
                    c[17635] = 70528;
                    c[17634] = 70528;
                    c[17637] = 70536;
                    c[17636] = 70536;
                    c[17639] = 70544;
                    c[17638] = 70544;
                    c[17641] = 70552;
                    c[17640] = 70552;
                    c[17643] = 70560;
                    c[17642] = 70560;
                    c[17645] = 70568;
                    c[17644] = 70568;
                    c[17647] = 70576;
                    c[17646] = 70576;
                    c[17649] = 70584;
                    c[17648] = 70584;
                    c[17651] = 70592;
                    c[17650] = 70592;
                    c[17653] = 70600;
                    c[17652] = 70600;
                    c[17655] = 70608;
                    c[17654] = 70608;
                    c[17657] = 70616;
                    c[17656] = 70616;
                    c[17659] = 70624;
                    c[17658] = 70624;
                    c[17661] = 70632;
                    c[17660] = 70632;
                    c[17663] = 70640;
                    c[17662] = 70640;
                    c[17665] = 70648;
                    c[17664] = 70648;
                    c[17667] = 70656;
                    c[17666] = 70656;
                    c[17669] = 70664;
                    c[17668] = 70664;
                    s = b + -40 | 0;
                    q = e + 8 | 0;
                    q = (q & 7 | 0) == 0 ? 0 : 0 - q & 7;
                    r = e + q | 0;
                    q = s - q | 0;
                    c[17600] = r;
                    c[17597] = q;
                    c[r + 4 >> 2] = q | 1;
                    c[e + s + 4 >> 2] = 40;
                    c[17601] = c[17716];
                }
            while (0);
        b = c[17597] | 0;
        if (b >>> 0 <= m >>> 0) {
            s = 0;
            E = t;
            return s | 0;
        }
        q = b - m | 0;
        c[17597] = q;
        s = c[17600] | 0;
        r = s + m | 0;
        c[17600] = r;
        c[r + 4 >> 2] = q | 1;
        c[s + 4 >> 2] = m | 3;
        s = s + 8 | 0;
        E = t;
        return s | 0;
    }
    function Bb(a) {
        a = a | 0;
        var b = 0, d = 0, e = 0, f = 0, g = 0, h = 0, i = 0, j = 0;
        if (!a)
            return;
        d = a + -8 | 0;
        f = c[17598] | 0;
        a = c[a + -4 >> 2] | 0;
        b = a & -8;
        j = d + b | 0;
        do
            if (!(a & 1)) {
                e = c[d >> 2] | 0;
                if (!(a & 3))
                    return;
                h = d + (0 - e) | 0;
                g = e + b | 0;
                if (h >>> 0 < f >>> 0)
                    return;
                if ((c[17599] | 0) == (h | 0)) {
                    a = j + 4 | 0;
                    b = c[a >> 2] | 0;
                    if ((b & 3 | 0) != 3) {
                        i = h;
                        b = g;
                        break;
                    }
                    c[17596] = g;
                    c[a >> 2] = b & -2;
                    c[h + 4 >> 2] = g | 1;
                    c[h + g >> 2] = g;
                    return;
                }
                d = e >>> 3;
                if (e >>> 0 < 256) {
                    a = c[h + 8 >> 2] | 0;
                    b = c[h + 12 >> 2] | 0;
                    if ((b | 0) == (a | 0)) {
                        c[17594] = c[17594] & ~(1 << d);
                        i = h;
                        b = g;
                        break;
                    } else {
                        c[a + 12 >> 2] = b;
                        c[b + 8 >> 2] = a;
                        i = h;
                        b = g;
                        break;
                    }
                }
                f = c[h + 24 >> 2] | 0;
                a = c[h + 12 >> 2] | 0;
                do
                    if ((a | 0) == (h | 0)) {
                        b = h + 16 | 0;
                        d = b + 4 | 0;
                        a = c[d >> 2] | 0;
                        if (!a) {
                            a = c[b >> 2] | 0;
                            if (!a) {
                                a = 0;
                                break;
                            }
                        } else
                            b = d;
                        while (1) {
                            e = a + 20 | 0;
                            d = c[e >> 2] | 0;
                            if (!d) {
                                e = a + 16 | 0;
                                d = c[e >> 2] | 0;
                                if (!d)
                                    break;
                                else {
                                    a = d;
                                    b = e;
                                }
                            } else {
                                a = d;
                                b = e;
                            }
                        }
                        c[b >> 2] = 0;
                    } else {
                        i = c[h + 8 >> 2] | 0;
                        c[i + 12 >> 2] = a;
                        c[a + 8 >> 2] = i;
                    }
                while (0);
                if (f) {
                    b = c[h + 28 >> 2] | 0;
                    d = 70680 + (b << 2) | 0;
                    if ((c[d >> 2] | 0) == (h | 0)) {
                        c[d >> 2] = a;
                        if (!a) {
                            c[17595] = c[17595] & ~(1 << b);
                            i = h;
                            b = g;
                            break;
                        }
                    } else {
                        i = f + 16 | 0;
                        c[((c[i >> 2] | 0) == (h | 0) ? i : f + 20 | 0) >> 2] = a;
                        if (!a) {
                            i = h;
                            b = g;
                            break;
                        }
                    }
                    c[a + 24 >> 2] = f;
                    b = h + 16 | 0;
                    d = c[b >> 2] | 0;
                    if (d | 0) {
                        c[a + 16 >> 2] = d;
                        c[d + 24 >> 2] = a;
                    }
                    b = c[b + 4 >> 2] | 0;
                    if (b) {
                        c[a + 20 >> 2] = b;
                        c[b + 24 >> 2] = a;
                        i = h;
                        b = g;
                    } else {
                        i = h;
                        b = g;
                    }
                } else {
                    i = h;
                    b = g;
                }
            } else {
                i = d;
                h = d;
            }
        while (0);
        if (h >>> 0 >= j >>> 0)
            return;
        a = j + 4 | 0;
        e = c[a >> 2] | 0;
        if (!(e & 1))
            return;
        if (!(e & 2)) {
            if ((c[17600] | 0) == (j | 0)) {
                j = (c[17597] | 0) + b | 0;
                c[17597] = j;
                c[17600] = i;
                c[i + 4 >> 2] = j | 1;
                if ((i | 0) != (c[17599] | 0))
                    return;
                c[17599] = 0;
                c[17596] = 0;
                return;
            }
            if ((c[17599] | 0) == (j | 0)) {
                j = (c[17596] | 0) + b | 0;
                c[17596] = j;
                c[17599] = h;
                c[i + 4 >> 2] = j | 1;
                c[h + j >> 2] = j;
                return;
            }
            f = (e & -8) + b | 0;
            d = e >>> 3;
            do
                if (e >>> 0 < 256) {
                    b = c[j + 8 >> 2] | 0;
                    a = c[j + 12 >> 2] | 0;
                    if ((a | 0) == (b | 0)) {
                        c[17594] = c[17594] & ~(1 << d);
                        break;
                    } else {
                        c[b + 12 >> 2] = a;
                        c[a + 8 >> 2] = b;
                        break;
                    }
                } else {
                    g = c[j + 24 >> 2] | 0;
                    a = c[j + 12 >> 2] | 0;
                    do
                        if ((a | 0) == (j | 0)) {
                            b = j + 16 | 0;
                            d = b + 4 | 0;
                            a = c[d >> 2] | 0;
                            if (!a) {
                                a = c[b >> 2] | 0;
                                if (!a) {
                                    d = 0;
                                    break;
                                }
                            } else
                                b = d;
                            while (1) {
                                e = a + 20 | 0;
                                d = c[e >> 2] | 0;
                                if (!d) {
                                    e = a + 16 | 0;
                                    d = c[e >> 2] | 0;
                                    if (!d)
                                        break;
                                    else {
                                        a = d;
                                        b = e;
                                    }
                                } else {
                                    a = d;
                                    b = e;
                                }
                            }
                            c[b >> 2] = 0;
                            d = a;
                        } else {
                            d = c[j + 8 >> 2] | 0;
                            c[d + 12 >> 2] = a;
                            c[a + 8 >> 2] = d;
                            d = a;
                        }
                    while (0);
                    if (g | 0) {
                        a = c[j + 28 >> 2] | 0;
                        b = 70680 + (a << 2) | 0;
                        if ((c[b >> 2] | 0) == (j | 0)) {
                            c[b >> 2] = d;
                            if (!d) {
                                c[17595] = c[17595] & ~(1 << a);
                                break;
                            }
                        } else {
                            e = g + 16 | 0;
                            c[((c[e >> 2] | 0) == (j | 0) ? e : g + 20 | 0) >> 2] = d;
                            if (!d)
                                break;
                        }
                        c[d + 24 >> 2] = g;
                        a = j + 16 | 0;
                        b = c[a >> 2] | 0;
                        if (b | 0) {
                            c[d + 16 >> 2] = b;
                            c[b + 24 >> 2] = d;
                        }
                        a = c[a + 4 >> 2] | 0;
                        if (a | 0) {
                            c[d + 20 >> 2] = a;
                            c[a + 24 >> 2] = d;
                        }
                    }
                }
            while (0);
            c[i + 4 >> 2] = f | 1;
            c[h + f >> 2] = f;
            if ((i | 0) == (c[17599] | 0)) {
                c[17596] = f;
                return;
            }
        } else {
            c[a >> 2] = e & -2;
            c[i + 4 >> 2] = b | 1;
            c[h + b >> 2] = b;
            f = b;
        }
        a = f >>> 3;
        if (f >>> 0 < 256) {
            d = 70416 + (a << 1 << 2) | 0;
            b = c[17594] | 0;
            a = 1 << a;
            if (!(b & a)) {
                c[17594] = b | a;
                a = d;
                b = d + 8 | 0;
            } else {
                b = d + 8 | 0;
                a = c[b >> 2] | 0;
            }
            c[b >> 2] = i;
            c[a + 12 >> 2] = i;
            c[i + 8 >> 2] = a;
            c[i + 12 >> 2] = d;
            return;
        }
        a = f >>> 8;
        if (a)
            if (f >>> 0 > 16777215)
                e = 31;
            else {
                h = (a + 1048320 | 0) >>> 16 & 8;
                j = a << h;
                g = (j + 520192 | 0) >>> 16 & 4;
                j = j << g;
                e = (j + 245760 | 0) >>> 16 & 2;
                e = 14 - (g | h | e) + (j << e >>> 15) | 0;
                e = f >>> (e + 7 | 0) & 1 | e << 1;
            }
        else
            e = 0;
        a = 70680 + (e << 2) | 0;
        c[i + 28 >> 2] = e;
        c[i + 20 >> 2] = 0;
        c[i + 16 >> 2] = 0;
        b = c[17595] | 0;
        d = 1 << e;
        a:
            do
                if (!(b & d)) {
                    c[17595] = b | d;
                    c[a >> 2] = i;
                    c[i + 24 >> 2] = a;
                    c[i + 12 >> 2] = i;
                    c[i + 8 >> 2] = i;
                } else {
                    a = c[a >> 2] | 0;
                    b:
                        do
                            if ((c[a + 4 >> 2] & -8 | 0) != (f | 0)) {
                                e = f << ((e | 0) == 31 ? 0 : 25 - (e >>> 1) | 0);
                                while (1) {
                                    d = a + 16 + (e >>> 31 << 2) | 0;
                                    b = c[d >> 2] | 0;
                                    if (!b)
                                        break;
                                    if ((c[b + 4 >> 2] & -8 | 0) == (f | 0)) {
                                        a = b;
                                        break b;
                                    } else {
                                        e = e << 1;
                                        a = b;
                                    }
                                }
                                c[d >> 2] = i;
                                c[i + 24 >> 2] = a;
                                c[i + 12 >> 2] = i;
                                c[i + 8 >> 2] = i;
                                break a;
                            }
                        while (0);
                    h = a + 8 | 0;
                    j = c[h >> 2] | 0;
                    c[j + 12 >> 2] = i;
                    c[h >> 2] = i;
                    c[i + 8 >> 2] = j;
                    c[i + 12 >> 2] = a;
                    c[i + 24 >> 2] = 0;
                }
            while (0);
        j = (c[17602] | 0) + -1 | 0;
        c[17602] = j;
        if (j | 0)
            return;
        a = 70832;
        while (1) {
            a = c[a >> 2] | 0;
            if (!a)
                break;
            else
                a = a + 8 | 0;
        }
        c[17602] = -1;
        return;
    }
    function Cb(a, b) {
        a = a | 0;
        b = b | 0;
        var d = 0, e = 0;
        if (!a) {
            b = Ab(b) | 0;
            return b | 0;
        }
        if (b >>> 0 > 4294967231) {
            b = 0;
            return b | 0;
        }
        d = Db(a + -8 | 0, b >>> 0 < 11 ? 16 : b + 11 & -8) | 0;
        if (d | 0) {
            b = d + 8 | 0;
            return b | 0;
        }
        d = Ab(b) | 0;
        if (!d) {
            b = 0;
            return b | 0;
        }
        e = c[a + -4 >> 2] | 0;
        e = (e & -8) - ((e & 3 | 0) == 0 ? 8 : 4) | 0;
        ec(d | 0, a | 0, (e >>> 0 < b >>> 0 ? e : b) | 0) | 0;
        Bb(a);
        b = d;
        return b | 0;
    }
    function Db(a, b) {
        a = a | 0;
        b = b | 0;
        var d = 0, e = 0, f = 0, g = 0, h = 0, i = 0, j = 0, k = 0, l = 0, m = 0;
        l = a + 4 | 0;
        m = c[l >> 2] | 0;
        d = m & -8;
        i = a + d | 0;
        if (!(m & 3)) {
            if (b >>> 0 < 256) {
                a = 0;
                return a | 0;
            }
            if (d >>> 0 >= (b + 4 | 0) >>> 0 ? (d - b | 0) >>> 0 <= c[17714] << 1 >>> 0 : 0)
                return a | 0;
            a = 0;
            return a | 0;
        }
        if (d >>> 0 >= b >>> 0) {
            d = d - b | 0;
            if (d >>> 0 <= 15)
                return a | 0;
            k = a + b | 0;
            c[l >> 2] = m & 1 | b | 2;
            c[k + 4 >> 2] = d | 3;
            m = i + 4 | 0;
            c[m >> 2] = c[m >> 2] | 1;
            Eb(k, d);
            return a | 0;
        }
        if ((c[17600] | 0) == (i | 0)) {
            k = (c[17597] | 0) + d | 0;
            d = k - b | 0;
            e = a + b | 0;
            if (k >>> 0 <= b >>> 0) {
                a = 0;
                return a | 0;
            }
            c[l >> 2] = m & 1 | b | 2;
            c[e + 4 >> 2] = d | 1;
            c[17600] = e;
            c[17597] = d;
            return a | 0;
        }
        if ((c[17599] | 0) == (i | 0)) {
            e = (c[17596] | 0) + d | 0;
            if (e >>> 0 < b >>> 0) {
                a = 0;
                return a | 0;
            }
            d = e - b | 0;
            if (d >>> 0 > 15) {
                k = a + b | 0;
                e = a + e | 0;
                c[l >> 2] = m & 1 | b | 2;
                c[k + 4 >> 2] = d | 1;
                c[e >> 2] = d;
                e = e + 4 | 0;
                c[e >> 2] = c[e >> 2] & -2;
                e = k;
            } else {
                c[l >> 2] = m & 1 | e | 2;
                e = a + e + 4 | 0;
                c[e >> 2] = c[e >> 2] | 1;
                e = 0;
                d = 0;
            }
            c[17596] = d;
            c[17599] = e;
            return a | 0;
        }
        e = c[i + 4 >> 2] | 0;
        if (e & 2 | 0) {
            a = 0;
            return a | 0;
        }
        j = (e & -8) + d | 0;
        if (j >>> 0 < b >>> 0) {
            a = 0;
            return a | 0;
        }
        k = j - b | 0;
        f = e >>> 3;
        do
            if (e >>> 0 < 256) {
                e = c[i + 8 >> 2] | 0;
                d = c[i + 12 >> 2] | 0;
                if ((d | 0) == (e | 0)) {
                    c[17594] = c[17594] & ~(1 << f);
                    break;
                } else {
                    c[e + 12 >> 2] = d;
                    c[d + 8 >> 2] = e;
                    break;
                }
            } else {
                h = c[i + 24 >> 2] | 0;
                d = c[i + 12 >> 2] | 0;
                do
                    if ((d | 0) == (i | 0)) {
                        e = i + 16 | 0;
                        f = e + 4 | 0;
                        d = c[f >> 2] | 0;
                        if (!d) {
                            d = c[e >> 2] | 0;
                            if (!d) {
                                f = 0;
                                break;
                            }
                        } else
                            e = f;
                        while (1) {
                            g = d + 20 | 0;
                            f = c[g >> 2] | 0;
                            if (!f) {
                                g = d + 16 | 0;
                                f = c[g >> 2] | 0;
                                if (!f)
                                    break;
                                else {
                                    d = f;
                                    e = g;
                                }
                            } else {
                                d = f;
                                e = g;
                            }
                        }
                        c[e >> 2] = 0;
                        f = d;
                    } else {
                        f = c[i + 8 >> 2] | 0;
                        c[f + 12 >> 2] = d;
                        c[d + 8 >> 2] = f;
                        f = d;
                    }
                while (0);
                if (h | 0) {
                    d = c[i + 28 >> 2] | 0;
                    e = 70680 + (d << 2) | 0;
                    if ((c[e >> 2] | 0) == (i | 0)) {
                        c[e >> 2] = f;
                        if (!f) {
                            c[17595] = c[17595] & ~(1 << d);
                            break;
                        }
                    } else {
                        g = h + 16 | 0;
                        c[((c[g >> 2] | 0) == (i | 0) ? g : h + 20 | 0) >> 2] = f;
                        if (!f)
                            break;
                    }
                    c[f + 24 >> 2] = h;
                    d = i + 16 | 0;
                    e = c[d >> 2] | 0;
                    if (e | 0) {
                        c[f + 16 >> 2] = e;
                        c[e + 24 >> 2] = f;
                    }
                    d = c[d + 4 >> 2] | 0;
                    if (d | 0) {
                        c[f + 20 >> 2] = d;
                        c[d + 24 >> 2] = f;
                    }
                }
            }
        while (0);
        if (k >>> 0 < 16) {
            c[l >> 2] = m & 1 | j | 2;
            m = a + j + 4 | 0;
            c[m >> 2] = c[m >> 2] | 1;
            return a | 0;
        } else {
            i = a + b | 0;
            c[l >> 2] = m & 1 | b | 2;
            c[i + 4 >> 2] = k | 3;
            m = a + j + 4 | 0;
            c[m >> 2] = c[m >> 2] | 1;
            Eb(i, k);
            return a | 0;
        }
        return 0;
    }
    function Eb(a, b) {
        a = a | 0;
        b = b | 0;
        var d = 0, e = 0, f = 0, g = 0, h = 0, i = 0;
        i = a + b | 0;
        d = c[a + 4 >> 2] | 0;
        do
            if (!(d & 1)) {
                f = c[a >> 2] | 0;
                if (!(d & 3))
                    return;
                h = a + (0 - f) | 0;
                b = f + b | 0;
                if ((c[17599] | 0) == (h | 0)) {
                    a = i + 4 | 0;
                    d = c[a >> 2] | 0;
                    if ((d & 3 | 0) != 3)
                        break;
                    c[17596] = b;
                    c[a >> 2] = d & -2;
                    c[h + 4 >> 2] = b | 1;
                    c[i >> 2] = b;
                    return;
                }
                e = f >>> 3;
                if (f >>> 0 < 256) {
                    a = c[h + 8 >> 2] | 0;
                    d = c[h + 12 >> 2] | 0;
                    if ((d | 0) == (a | 0)) {
                        c[17594] = c[17594] & ~(1 << e);
                        break;
                    } else {
                        c[a + 12 >> 2] = d;
                        c[d + 8 >> 2] = a;
                        break;
                    }
                }
                g = c[h + 24 >> 2] | 0;
                a = c[h + 12 >> 2] | 0;
                do
                    if ((a | 0) == (h | 0)) {
                        d = h + 16 | 0;
                        e = d + 4 | 0;
                        a = c[e >> 2] | 0;
                        if (!a) {
                            a = c[d >> 2] | 0;
                            if (!a) {
                                a = 0;
                                break;
                            }
                        } else
                            d = e;
                        while (1) {
                            f = a + 20 | 0;
                            e = c[f >> 2] | 0;
                            if (!e) {
                                f = a + 16 | 0;
                                e = c[f >> 2] | 0;
                                if (!e)
                                    break;
                                else {
                                    a = e;
                                    d = f;
                                }
                            } else {
                                a = e;
                                d = f;
                            }
                        }
                        c[d >> 2] = 0;
                    } else {
                        f = c[h + 8 >> 2] | 0;
                        c[f + 12 >> 2] = a;
                        c[a + 8 >> 2] = f;
                    }
                while (0);
                if (g) {
                    d = c[h + 28 >> 2] | 0;
                    e = 70680 + (d << 2) | 0;
                    if ((c[e >> 2] | 0) == (h | 0)) {
                        c[e >> 2] = a;
                        if (!a) {
                            c[17595] = c[17595] & ~(1 << d);
                            break;
                        }
                    } else {
                        f = g + 16 | 0;
                        c[((c[f >> 2] | 0) == (h | 0) ? f : g + 20 | 0) >> 2] = a;
                        if (!a)
                            break;
                    }
                    c[a + 24 >> 2] = g;
                    d = h + 16 | 0;
                    e = c[d >> 2] | 0;
                    if (e | 0) {
                        c[a + 16 >> 2] = e;
                        c[e + 24 >> 2] = a;
                    }
                    d = c[d + 4 >> 2] | 0;
                    if (d) {
                        c[a + 20 >> 2] = d;
                        c[d + 24 >> 2] = a;
                    }
                }
            } else
                h = a;
        while (0);
        a = i + 4 | 0;
        e = c[a >> 2] | 0;
        if (!(e & 2)) {
            if ((c[17600] | 0) == (i | 0)) {
                i = (c[17597] | 0) + b | 0;
                c[17597] = i;
                c[17600] = h;
                c[h + 4 >> 2] = i | 1;
                if ((h | 0) != (c[17599] | 0))
                    return;
                c[17599] = 0;
                c[17596] = 0;
                return;
            }
            if ((c[17599] | 0) == (i | 0)) {
                i = (c[17596] | 0) + b | 0;
                c[17596] = i;
                c[17599] = h;
                c[h + 4 >> 2] = i | 1;
                c[h + i >> 2] = i;
                return;
            }
            f = (e & -8) + b | 0;
            d = e >>> 3;
            do
                if (e >>> 0 < 256) {
                    a = c[i + 8 >> 2] | 0;
                    b = c[i + 12 >> 2] | 0;
                    if ((b | 0) == (a | 0)) {
                        c[17594] = c[17594] & ~(1 << d);
                        break;
                    } else {
                        c[a + 12 >> 2] = b;
                        c[b + 8 >> 2] = a;
                        break;
                    }
                } else {
                    g = c[i + 24 >> 2] | 0;
                    b = c[i + 12 >> 2] | 0;
                    do
                        if ((b | 0) == (i | 0)) {
                            a = i + 16 | 0;
                            d = a + 4 | 0;
                            b = c[d >> 2] | 0;
                            if (!b) {
                                b = c[a >> 2] | 0;
                                if (!b) {
                                    d = 0;
                                    break;
                                }
                            } else
                                a = d;
                            while (1) {
                                e = b + 20 | 0;
                                d = c[e >> 2] | 0;
                                if (!d) {
                                    e = b + 16 | 0;
                                    d = c[e >> 2] | 0;
                                    if (!d)
                                        break;
                                    else {
                                        b = d;
                                        a = e;
                                    }
                                } else {
                                    b = d;
                                    a = e;
                                }
                            }
                            c[a >> 2] = 0;
                            d = b;
                        } else {
                            d = c[i + 8 >> 2] | 0;
                            c[d + 12 >> 2] = b;
                            c[b + 8 >> 2] = d;
                            d = b;
                        }
                    while (0);
                    if (g | 0) {
                        b = c[i + 28 >> 2] | 0;
                        a = 70680 + (b << 2) | 0;
                        if ((c[a >> 2] | 0) == (i | 0)) {
                            c[a >> 2] = d;
                            if (!d) {
                                c[17595] = c[17595] & ~(1 << b);
                                break;
                            }
                        } else {
                            e = g + 16 | 0;
                            c[((c[e >> 2] | 0) == (i | 0) ? e : g + 20 | 0) >> 2] = d;
                            if (!d)
                                break;
                        }
                        c[d + 24 >> 2] = g;
                        b = i + 16 | 0;
                        a = c[b >> 2] | 0;
                        if (a | 0) {
                            c[d + 16 >> 2] = a;
                            c[a + 24 >> 2] = d;
                        }
                        b = c[b + 4 >> 2] | 0;
                        if (b | 0) {
                            c[d + 20 >> 2] = b;
                            c[b + 24 >> 2] = d;
                        }
                    }
                }
            while (0);
            c[h + 4 >> 2] = f | 1;
            c[h + f >> 2] = f;
            if ((h | 0) == (c[17599] | 0)) {
                c[17596] = f;
                return;
            }
        } else {
            c[a >> 2] = e & -2;
            c[h + 4 >> 2] = b | 1;
            c[h + b >> 2] = b;
            f = b;
        }
        b = f >>> 3;
        if (f >>> 0 < 256) {
            d = 70416 + (b << 1 << 2) | 0;
            a = c[17594] | 0;
            b = 1 << b;
            if (!(a & b)) {
                c[17594] = a | b;
                b = d;
                a = d + 8 | 0;
            } else {
                a = d + 8 | 0;
                b = c[a >> 2] | 0;
            }
            c[a >> 2] = h;
            c[b + 12 >> 2] = h;
            c[h + 8 >> 2] = b;
            c[h + 12 >> 2] = d;
            return;
        }
        b = f >>> 8;
        if (b)
            if (f >>> 0 > 16777215)
                e = 31;
            else {
                g = (b + 1048320 | 0) >>> 16 & 8;
                i = b << g;
                d = (i + 520192 | 0) >>> 16 & 4;
                i = i << d;
                e = (i + 245760 | 0) >>> 16 & 2;
                e = 14 - (d | g | e) + (i << e >>> 15) | 0;
                e = f >>> (e + 7 | 0) & 1 | e << 1;
            }
        else
            e = 0;
        b = 70680 + (e << 2) | 0;
        c[h + 28 >> 2] = e;
        c[h + 20 >> 2] = 0;
        c[h + 16 >> 2] = 0;
        a = c[17595] | 0;
        d = 1 << e;
        if (!(a & d)) {
            c[17595] = a | d;
            c[b >> 2] = h;
            c[h + 24 >> 2] = b;
            c[h + 12 >> 2] = h;
            c[h + 8 >> 2] = h;
            return;
        }
        b = c[b >> 2] | 0;
        a:
            do
                if ((c[b + 4 >> 2] & -8 | 0) != (f | 0)) {
                    e = f << ((e | 0) == 31 ? 0 : 25 - (e >>> 1) | 0);
                    while (1) {
                        d = b + 16 + (e >>> 31 << 2) | 0;
                        a = c[d >> 2] | 0;
                        if (!a)
                            break;
                        if ((c[a + 4 >> 2] & -8 | 0) == (f | 0)) {
                            b = a;
                            break a;
                        } else {
                            e = e << 1;
                            b = a;
                        }
                    }
                    c[d >> 2] = h;
                    c[h + 24 >> 2] = b;
                    c[h + 12 >> 2] = h;
                    c[h + 8 >> 2] = h;
                    return;
                }
            while (0);
        g = b + 8 | 0;
        i = c[g >> 2] | 0;
        c[i + 12 >> 2] = h;
        c[g >> 2] = h;
        c[h + 8 >> 2] = i;
        c[h + 12 >> 2] = b;
        c[h + 24 >> 2] = 0;
        return;
    }
    function Fb(a, b) {
        a = a | 0;
        b = b | 0;
        if (a >>> 0 < 9) {
            b = Ab(b) | 0;
            return b | 0;
        } else {
            b = Gb(a, b) | 0;
            return b | 0;
        }
        return 0;
    }
    function Gb(a, b) {
        a = a | 0;
        b = b | 0;
        var d = 0, e = 0, f = 0, g = 0, h = 0, i = 0;
        d = a >>> 0 > 16 ? a : 16;
        if (!(d + -1 & d))
            a = d;
        else {
            a = 16;
            while (1)
                if (a >>> 0 < d >>> 0)
                    a = a << 1;
                else
                    break;
        }
        if ((-64 - a | 0) >>> 0 <= b >>> 0) {
            h = 0;
            return h | 0;
        }
        g = b >>> 0 < 11 ? 16 : b + 11 & -8;
        d = Ab(g + 12 + a | 0) | 0;
        if (!d) {
            h = 0;
            return h | 0;
        }
        f = d + -8 | 0;
        do
            if (a + -1 & d) {
                e = (d + a + -1 & 0 - a) + -8 | 0;
                b = f;
                e = (e - b | 0) >>> 0 > 15 ? e : e + a | 0;
                b = e - b | 0;
                a = d + -4 | 0;
                i = c[a >> 2] | 0;
                d = (i & -8) - b | 0;
                if (!(i & 3)) {
                    c[e >> 2] = (c[f >> 2] | 0) + b;
                    c[e + 4 >> 2] = d;
                    a = e;
                    b = e;
                    break;
                } else {
                    i = e + 4 | 0;
                    c[i >> 2] = d | c[i >> 2] & 1 | 2;
                    d = e + d + 4 | 0;
                    c[d >> 2] = c[d >> 2] | 1;
                    c[a >> 2] = b | c[a >> 2] & 1 | 2;
                    c[i >> 2] = c[i >> 2] | 1;
                    Eb(f, b);
                    a = e;
                    b = e;
                    break;
                }
            } else {
                a = f;
                b = f;
            }
        while (0);
        a = a + 4 | 0;
        d = c[a >> 2] | 0;
        if (d & 3 | 0 ? (h = d & -8, h >>> 0 > (g + 16 | 0) >>> 0) : 0) {
            i = h - g | 0;
            f = b + g | 0;
            c[a >> 2] = g | d & 1 | 2;
            c[f + 4 >> 2] = i | 3;
            h = b + h + 4 | 0;
            c[h >> 2] = c[h >> 2] | 1;
            Eb(f, i);
        }
        i = b + 8 | 0;
        return i | 0;
    }
    function Hb() {
        t(70888);
        return;
    }
    function Ib() {
        return 70872;
    }
    function Jb() {
        return 70880;
    }
    function Kb() {
        return 70884;
    }
    function Lb() {
        return 70888;
    }
    function Mb(a) {
        a = a | 0;
        return;
    }
    function Nb(a) {
        a = a | 0;
        bc(a);
        return;
    }
    function Ob(a) {
        a = a | 0;
        return;
    }
    function Pb(a) {
        a = a | 0;
        return;
    }
    function Qb(a, b, d) {
        a = a | 0;
        b = b | 0;
        d = d | 0;
        var e = 0, f = 0, g = 0, h = 0;
        h = E;
        E = E + 64 | 0;
        f = h;
        if (!(Ub(a, b) | 0))
            if ((b | 0) != 0 ? (g = Yb(b, 69792) | 0, (g | 0) != 0) : 0) {
                b = f + 4 | 0;
                e = b + 52 | 0;
                do {
                    c[b >> 2] = 0;
                    b = b + 4 | 0;
                } while ((b | 0) < (e | 0));
                c[f >> 2] = g;
                c[f + 8 >> 2] = a;
                c[f + 12 >> 2] = -1;
                c[f + 48 >> 2] = 1;
                L[c[(c[g >> 2] | 0) + 28 >> 2] & 3](g, f, c[d >> 2] | 0, 1);
                if ((c[f + 24 >> 2] | 0) == 1) {
                    c[d >> 2] = c[f + 16 >> 2];
                    b = 1;
                } else
                    b = 0;
            } else
                b = 0;
        else
            b = 1;
        E = h;
        return b | 0;
    }
    function Rb(a, b, d, e, f, g) {
        a = a | 0;
        b = b | 0;
        d = d | 0;
        e = e | 0;
        f = f | 0;
        g = g | 0;
        if (Ub(a, c[b + 8 >> 2] | 0) | 0)
            Xb(b, d, e, f);
        return;
    }
    function Sb(b, d, e, f, g) {
        b = b | 0;
        d = d | 0;
        e = e | 0;
        f = f | 0;
        g = g | 0;
        var h = 0;
        do
            if (!(Ub(b, c[d + 8 >> 2] | 0) | 0)) {
                if (Ub(b, c[d >> 2] | 0) | 0) {
                    if ((c[d + 16 >> 2] | 0) != (e | 0) ? (h = d + 20 | 0, (c[h >> 2] | 0) != (e | 0)) : 0) {
                        c[d + 32 >> 2] = f;
                        c[h >> 2] = e;
                        g = d + 40 | 0;
                        c[g >> 2] = (c[g >> 2] | 0) + 1;
                        if ((c[d + 36 >> 2] | 0) == 1 ? (c[d + 24 >> 2] | 0) == 2 : 0)
                            a[d + 54 >> 0] = 1;
                        c[d + 44 >> 2] = 4;
                        break;
                    }
                    if ((f | 0) == 1)
                        c[d + 32 >> 2] = 1;
                }
            } else
                Wb(d, e, f);
        while (0);
        return;
    }
    function Tb(a, b, d, e) {
        a = a | 0;
        b = b | 0;
        d = d | 0;
        e = e | 0;
        if (Ub(a, c[b + 8 >> 2] | 0) | 0)
            Vb(b, d, e);
        return;
    }
    function Ub(a, b) {
        a = a | 0;
        b = b | 0;
        return (a | 0) == (b | 0) | 0;
    }
    function Vb(b, d, e) {
        b = b | 0;
        d = d | 0;
        e = e | 0;
        var f = 0, g = 0;
        f = b + 16 | 0;
        g = c[f >> 2] | 0;
        do
            if (g) {
                if ((g | 0) != (d | 0)) {
                    e = b + 36 | 0;
                    c[e >> 2] = (c[e >> 2] | 0) + 1;
                    c[b + 24 >> 2] = 2;
                    a[b + 54 >> 0] = 1;
                    break;
                }
                b = b + 24 | 0;
                if ((c[b >> 2] | 0) == 2)
                    c[b >> 2] = e;
            } else {
                c[f >> 2] = d;
                c[b + 24 >> 2] = e;
                c[b + 36 >> 2] = 1;
            }
        while (0);
        return;
    }
    function Wb(a, b, d) {
        a = a | 0;
        b = b | 0;
        d = d | 0;
        var e = 0;
        if ((c[a + 4 >> 2] | 0) == (b | 0) ? (e = a + 28 | 0, (c[e >> 2] | 0) != 1) : 0)
            c[e >> 2] = d;
        return;
    }
    function Xb(b, d, e, f) {
        b = b | 0;
        d = d | 0;
        e = e | 0;
        f = f | 0;
        var g = 0;
        a[b + 53 >> 0] = 1;
        do
            if ((c[b + 4 >> 2] | 0) == (e | 0)) {
                a[b + 52 >> 0] = 1;
                g = b + 16 | 0;
                e = c[g >> 2] | 0;
                if (!e) {
                    c[g >> 2] = d;
                    c[b + 24 >> 2] = f;
                    c[b + 36 >> 2] = 1;
                    if (!((f | 0) == 1 ? (c[b + 48 >> 2] | 0) == 1 : 0))
                        break;
                    a[b + 54 >> 0] = 1;
                    break;
                }
                if ((e | 0) != (d | 0)) {
                    f = b + 36 | 0;
                    c[f >> 2] = (c[f >> 2] | 0) + 1;
                    a[b + 54 >> 0] = 1;
                    break;
                }
                g = b + 24 | 0;
                e = c[g >> 2] | 0;
                if ((e | 0) == 2) {
                    c[g >> 2] = f;
                    e = f;
                }
                if ((e | 0) == 1 ? (c[b + 48 >> 2] | 0) == 1 : 0)
                    a[b + 54 >> 0] = 1;
            }
        while (0);
        return;
    }
    function Yb(d, e) {
        d = d | 0;
        e = e | 0;
        var f = 0, g = 0, h = 0, i = 0, j = 0, k = 0, l = 0, m = 0, n = 0, o = 0, p = 0, q = 0;
        q = E;
        E = E + 64 | 0;
        n = q;
        p = c[d >> 2] | 0;
        o = d + (c[p + -8 >> 2] | 0) | 0;
        p = c[p + -4 >> 2] | 0;
        c[n >> 2] = e;
        c[n + 4 >> 2] = d;
        c[n + 8 >> 2] = 69808;
        g = n + 12 | 0;
        h = n + 16 | 0;
        i = n + 20 | 0;
        j = n + 24 | 0;
        k = n + 28 | 0;
        l = n + 32 | 0;
        m = n + 40 | 0;
        d = Ub(p, e) | 0;
        e = g;
        f = e + 40 | 0;
        do {
            c[e >> 2] = 0;
            e = e + 4 | 0;
        } while ((e | 0) < (f | 0));
        b[g + 40 >> 1] = 0;
        a[g + 42 >> 0] = 0;
        a:
            do
                if (d) {
                    c[n + 48 >> 2] = 1;
                    N[c[(c[p >> 2] | 0) + 20 >> 2] & 3](p, n, o, o, 1, 0);
                    d = (c[j >> 2] | 0) == 1 ? o : 0;
                } else {
                    M[c[(c[p >> 2] | 0) + 24 >> 2] & 3](p, n, o, 1, 0);
                    switch (c[n + 36 >> 2] | 0) {
                    case 0: {
                            d = (c[m >> 2] | 0) == 1 & (c[k >> 2] | 0) == 1 & (c[l >> 2] | 0) == 1 ? c[i >> 2] | 0 : 0;
                            break a;
                        }
                    case 1:
                        break;
                    default: {
                            d = 0;
                            break a;
                        }
                    }
                    if ((c[j >> 2] | 0) != 1 ? !((c[m >> 2] | 0) == 0 & (c[k >> 2] | 0) == 1 & (c[l >> 2] | 0) == 1) : 0) {
                        d = 0;
                        break;
                    }
                    d = c[h >> 2] | 0;
                }
            while (0);
        E = q;
        return d | 0;
    }
    function Zb(a) {
        a = a | 0;
        bc(a);
        return;
    }
    function _b(a, b, d, e, f, g) {
        a = a | 0;
        b = b | 0;
        d = d | 0;
        e = e | 0;
        f = f | 0;
        g = g | 0;
        if (Ub(a, c[b + 8 >> 2] | 0) | 0)
            Xb(b, d, e, f);
        else {
            a = c[a + 8 >> 2] | 0;
            N[c[(c[a >> 2] | 0) + 20 >> 2] & 3](a, b, d, e, f, g);
        }
        return;
    }
    function $b(b, d, e, f, g) {
        b = b | 0;
        d = d | 0;
        e = e | 0;
        f = f | 0;
        g = g | 0;
        var h = 0, i = 0, j = 0;
        do
            if (!(Ub(b, c[d + 8 >> 2] | 0) | 0)) {
                if (!(Ub(b, c[d >> 2] | 0) | 0)) {
                    i = c[b + 8 >> 2] | 0;
                    M[c[(c[i >> 2] | 0) + 24 >> 2] & 3](i, d, e, f, g);
                    break;
                }
                if ((c[d + 16 >> 2] | 0) != (e | 0) ? (h = d + 20 | 0, (c[h >> 2] | 0) != (e | 0)) : 0) {
                    c[d + 32 >> 2] = f;
                    i = d + 44 | 0;
                    if ((c[i >> 2] | 0) == 4)
                        break;
                    f = d + 52 | 0;
                    a[f >> 0] = 0;
                    j = d + 53 | 0;
                    a[j >> 0] = 0;
                    b = c[b + 8 >> 2] | 0;
                    N[c[(c[b >> 2] | 0) + 20 >> 2] & 3](b, d, e, e, 1, g);
                    if (a[j >> 0] | 0)
                        if (!(a[f >> 0] | 0)) {
                            f = 1;
                            b = 11;
                        } else
                            b = 15;
                    else {
                        f = 0;
                        b = 11;
                    }
                    do
                        if ((b | 0) == 11) {
                            c[h >> 2] = e;
                            j = d + 40 | 0;
                            c[j >> 2] = (c[j >> 2] | 0) + 1;
                            if ((c[d + 36 >> 2] | 0) == 1 ? (c[d + 24 >> 2] | 0) == 2 : 0) {
                                a[d + 54 >> 0] = 1;
                                if (f) {
                                    b = 15;
                                    break;
                                } else {
                                    f = 4;
                                    break;
                                }
                            }
                            if (f)
                                b = 15;
                            else
                                f = 4;
                        }
                    while (0);
                    if ((b | 0) == 15)
                        f = 3;
                    c[i >> 2] = f;
                    break;
                }
                if ((f | 0) == 1)
                    c[d + 32 >> 2] = 1;
            } else
                Wb(d, e, f);
        while (0);
        return;
    }
    function ac(a, b, d, e) {
        a = a | 0;
        b = b | 0;
        d = d | 0;
        e = e | 0;
        if (Ub(a, c[b + 8 >> 2] | 0) | 0)
            Vb(b, d, e);
        else {
            a = c[a + 8 >> 2] | 0;
            L[c[(c[a >> 2] | 0) + 28 >> 2] & 3](a, b, d, e);
        }
        return;
    }
    function bc(a) {
        a = a | 0;
        Bb(a);
        return;
    }
    function cc(a, b, d) {
        a = a | 0;
        b = b | 0;
        d = d | 0;
        var e = 0, f = 0;
        f = E;
        E = E + 16 | 0;
        e = f;
        c[e >> 2] = c[d >> 2];
        a = J[c[(c[a >> 2] | 0) + 16 >> 2] & 1](a, b, e) | 0;
        if (a)
            c[d >> 2] = c[e >> 2];
        E = f;
        return a & 1 | 0;
    }
    function dc(a) {
        a = a | 0;
        if (!a)
            a = 0;
        else
            a = (Yb(a, 69864) | 0) != 0 & 1;
        return a | 0;
    }
    function ec(b, d, e) {
        b = b | 0;
        d = d | 0;
        e = e | 0;
        var f = 0, g = 0, h = 0;
        if ((e | 0) >= 8192) {
            A(b | 0, d | 0, e | 0) | 0;
            return b | 0;
        }
        h = b | 0;
        g = b + e | 0;
        if ((b & 3) == (d & 3)) {
            while (b & 3) {
                if (!e)
                    return h | 0;
                a[b >> 0] = a[d >> 0] | 0;
                b = b + 1 | 0;
                d = d + 1 | 0;
                e = e - 1 | 0;
            }
            e = g & -4 | 0;
            f = e - 64 | 0;
            while ((b | 0) <= (f | 0)) {
                c[b >> 2] = c[d >> 2];
                c[b + 4 >> 2] = c[d + 4 >> 2];
                c[b + 8 >> 2] = c[d + 8 >> 2];
                c[b + 12 >> 2] = c[d + 12 >> 2];
                c[b + 16 >> 2] = c[d + 16 >> 2];
                c[b + 20 >> 2] = c[d + 20 >> 2];
                c[b + 24 >> 2] = c[d + 24 >> 2];
                c[b + 28 >> 2] = c[d + 28 >> 2];
                c[b + 32 >> 2] = c[d + 32 >> 2];
                c[b + 36 >> 2] = c[d + 36 >> 2];
                c[b + 40 >> 2] = c[d + 40 >> 2];
                c[b + 44 >> 2] = c[d + 44 >> 2];
                c[b + 48 >> 2] = c[d + 48 >> 2];
                c[b + 52 >> 2] = c[d + 52 >> 2];
                c[b + 56 >> 2] = c[d + 56 >> 2];
                c[b + 60 >> 2] = c[d + 60 >> 2];
                b = b + 64 | 0;
                d = d + 64 | 0;
            }
            while ((b | 0) < (e | 0)) {
                c[b >> 2] = c[d >> 2];
                b = b + 4 | 0;
                d = d + 4 | 0;
            }
        } else {
            e = g - 4 | 0;
            while ((b | 0) < (e | 0)) {
                a[b >> 0] = a[d >> 0] | 0;
                a[b + 1 >> 0] = a[d + 1 >> 0] | 0;
                a[b + 2 >> 0] = a[d + 2 >> 0] | 0;
                a[b + 3 >> 0] = a[d + 3 >> 0] | 0;
                b = b + 4 | 0;
                d = d + 4 | 0;
            }
        }
        while ((b | 0) < (g | 0)) {
            a[b >> 0] = a[d >> 0] | 0;
            b = b + 1 | 0;
            d = d + 1 | 0;
        }
        return h | 0;
    }
    function fc(b, d, e) {
        b = b | 0;
        d = d | 0;
        e = e | 0;
        var f = 0, g = 0, h = 0, i = 0;
        h = b + e | 0;
        d = d & 255;
        if ((e | 0) >= 67) {
            while (b & 3) {
                a[b >> 0] = d;
                b = b + 1 | 0;
            }
            f = h & -4 | 0;
            i = d | d << 8 | d << 16 | d << 24;
            g = f - 64 | 0;
            while ((b | 0) <= (g | 0)) {
                c[b >> 2] = i;
                c[b + 4 >> 2] = i;
                c[b + 8 >> 2] = i;
                c[b + 12 >> 2] = i;
                c[b + 16 >> 2] = i;
                c[b + 20 >> 2] = i;
                c[b + 24 >> 2] = i;
                c[b + 28 >> 2] = i;
                c[b + 32 >> 2] = i;
                c[b + 36 >> 2] = i;
                c[b + 40 >> 2] = i;
                c[b + 44 >> 2] = i;
                c[b + 48 >> 2] = i;
                c[b + 52 >> 2] = i;
                c[b + 56 >> 2] = i;
                c[b + 60 >> 2] = i;
                b = b + 64 | 0;
            }
            while ((b | 0) < (f | 0)) {
                c[b >> 2] = i;
                b = b + 4 | 0;
            }
        }
        while ((b | 0) < (h | 0)) {
            a[b >> 0] = d;
            b = b + 1 | 0;
        }
        return h - e | 0;
    }
    function gc(a) {
        a = a | 0;
        var b = 0, d = 0, e = 0;
        e = z() | 0;
        d = c[g >> 2] | 0;
        b = d + a | 0;
        if ((a | 0) > 0 & (b | 0) < (d | 0) | (b | 0) < 0) {
            C(b | 0) | 0;
            y(12);
            return -1;
        }
        if ((b | 0) > (e | 0))
            if (!(B(b | 0) | 0)) {
                y(12);
                return -1;
            }
        c[g >> 2] = b;
        return d | 0;
    }
    function hc(a, b, c) {
        a = a | 0;
        b = b | 0;
        c = c | 0;
        return I[a & 0](b | 0, c | 0) | 0;
    }
    function ic(a, b, c, d) {
        a = a | 0;
        b = b | 0;
        c = c | 0;
        d = d | 0;
        return J[a & 1](b | 0, c | 0, d | 0) | 0;
    }
    function jc(a, b) {
        a = a | 0;
        b = b | 0;
        K[a & 7](b | 0);
    }
    function kc(a, b, c, d, e) {
        a = a | 0;
        b = b | 0;
        c = c | 0;
        d = d | 0;
        e = e | 0;
        L[a & 3](b | 0, c | 0, d | 0, e | 0);
    }
    function lc(a, b, c, d, e, f) {
        a = a | 0;
        b = b | 0;
        c = c | 0;
        d = d | 0;
        e = e | 0;
        f = f | 0;
        M[a & 3](b | 0, c | 0, d | 0, e | 0, f | 0);
    }
    function mc(a, b, c, d, e, f, g) {
        a = a | 0;
        b = b | 0;
        c = c | 0;
        d = d | 0;
        e = e | 0;
        f = f | 0;
        g = g | 0;
        N[a & 3](b | 0, c | 0, d | 0, e | 0, f | 0, g | 0);
    }
    function nc(a, b) {
        a = a | 0;
        b = b | 0;
        p(0);
        return 0;
    }
    function oc(a, b, c) {
        a = a | 0;
        b = b | 0;
        c = c | 0;
        p(1);
        return 0;
    }
    function pc(a) {
        a = a | 0;
        p(2);
    }
    function qc(a, b, c, d) {
        a = a | 0;
        b = b | 0;
        c = c | 0;
        d = d | 0;
        p(3);
    }
    function rc(a, b, c, d, e) {
        a = a | 0;
        b = b | 0;
        c = c | 0;
        d = d | 0;
        e = e | 0;
        p(4);
    }
    function sc(a, b, c, d, e, f) {
        a = a | 0;
        b = b | 0;
        c = c | 0;
        d = d | 0;
        e = e | 0;
        f = f | 0;
        p(5);
    }
    var I = [nc];
    var J = [
        oc,
        Qb
    ];
    var K = [
        pc,
        Mb,
        Nb,
        Ob,
        Pb,
        Zb,
        pc,
        pc
    ];
    var L = [
        qc,
        Tb,
        ac,
        qc
    ];
    var M = [
        rc,
        Sb,
        $b,
        rc
    ];
    var N = [
        sc,
        Rb,
        _b,
        sc
    ];
    return {
        ___cxa_can_catch: cc,
        ___cxa_is_pointer_type: dc,
        ___emscripten_environ_constructor: Hb,
        __get_daylight: Jb,
        __get_environ: Lb,
        __get_timezone: Kb,
        __get_tzname: Ib,
        _bidi_getLine: Y,
        _bidi_getParagraphEndIndex: U,
        _bidi_getVisualRun: V,
        _bidi_processText: T,
        _bidi_setLine: W,
        _bidi_writeReverse: X,
        _emscripten_replace_memory: H,
        _free: Bb,
        _malloc: Ab,
        _memalign: Fb,
        _memcpy: ec,
        _memset: fc,
        _sbrk: gc,
        _ushape_arabic: S,
        dynCall_iii: hc,
        dynCall_iiii: ic,
        dynCall_vi: jc,
        dynCall_viiii: kc,
        dynCall_viiiii: lc,
        dynCall_viiiiii: mc,
        establishStackSpace: R,
        stackAlloc: O,
        stackRestore: Q,
        stackSave: P
    };
}(asmGlobalArg, asmLibraryArg, buffer);
var ___cxa_can_catch = Module['___cxa_can_catch'] = asm['___cxa_can_catch'];
var ___cxa_is_pointer_type = Module['___cxa_is_pointer_type'] = asm['___cxa_is_pointer_type'];
var ___emscripten_environ_constructor = Module['___emscripten_environ_constructor'] = asm['___emscripten_environ_constructor'];
var __get_daylight = Module['__get_daylight'] = asm['__get_daylight'];
var __get_environ = Module['__get_environ'] = asm['__get_environ'];
var __get_timezone = Module['__get_timezone'] = asm['__get_timezone'];
var __get_tzname = Module['__get_tzname'] = asm['__get_tzname'];
var _bidi_getLine = Module['_bidi_getLine'] = asm['_bidi_getLine'];
var _bidi_getParagraphEndIndex = Module['_bidi_getParagraphEndIndex'] = asm['_bidi_getParagraphEndIndex'];
var _bidi_getVisualRun = Module['_bidi_getVisualRun'] = asm['_bidi_getVisualRun'];
var _bidi_processText = Module['_bidi_processText'] = asm['_bidi_processText'];
var _bidi_setLine = Module['_bidi_setLine'] = asm['_bidi_setLine'];
var _bidi_writeReverse = Module['_bidi_writeReverse'] = asm['_bidi_writeReverse'];
var _emscripten_replace_memory = Module['_emscripten_replace_memory'] = asm['_emscripten_replace_memory'];
var _free = Module['_free'] = asm['_free'];
var _malloc = Module['_malloc'] = asm['_malloc'];
var _memalign = Module['_memalign'] = asm['_memalign'];
var _memcpy = Module['_memcpy'] = asm['_memcpy'];
var _memset = Module['_memset'] = asm['_memset'];
var _sbrk = Module['_sbrk'] = asm['_sbrk'];
var _ushape_arabic = Module['_ushape_arabic'] = asm['_ushape_arabic'];
var establishStackSpace = Module['establishStackSpace'] = asm['establishStackSpace'];
var stackAlloc = Module['stackAlloc'] = asm['stackAlloc'];
var stackRestore = Module['stackRestore'] = asm['stackRestore'];
var stackSave = Module['stackSave'] = asm['stackSave'];
var dynCall_iii = Module['dynCall_iii'] = asm['dynCall_iii'];
var dynCall_iiii = Module['dynCall_iiii'] = asm['dynCall_iiii'];
var dynCall_vi = Module['dynCall_vi'] = asm['dynCall_vi'];
var dynCall_viiii = Module['dynCall_viiii'] = asm['dynCall_viiii'];
var dynCall_viiiii = Module['dynCall_viiiii'] = asm['dynCall_viiiii'];
var dynCall_viiiiii = Module['dynCall_viiiiii'] = asm['dynCall_viiiiii'];
Module['asm'] = asm;
Module['ccall'] = ccall;
Module['UTF16ToString'] = UTF16ToString;
Module['stringToUTF16'] = stringToUTF16;
if (memoryInitializer) {
    if (!isDataURI(memoryInitializer)) {
        memoryInitializer = locateFile(memoryInitializer);
    }
    if (ENVIRONMENT_IS_NODE || ENVIRONMENT_IS_SHELL) {
        var data = Module['readBinary'](memoryInitializer);
        HEAPU8.set(data, GLOBAL_BASE);
    } else {
        addRunDependency('memory initializer');
        var applyMemoryInitializer = function (data) {
            if (data.byteLength)
                data = new Uint8Array(data);
            HEAPU8.set(data, GLOBAL_BASE);
            if (Module['memoryInitializerRequest'])
                delete Module['memoryInitializerRequest'].response;
            removeRunDependency('memory initializer');
        };
        var doBrowserLoad = function () {
            Module['readAsync'](memoryInitializer, applyMemoryInitializer, function () {
                throw 'could not load memory initializer ' + memoryInitializer;
            });
        };
        var memoryInitializerBytes = tryParseAsDataURI(memoryInitializer);
        if (memoryInitializerBytes) {
            applyMemoryInitializer(memoryInitializerBytes.buffer);
        } else if (Module['memoryInitializerRequest']) {
            var useRequest = function () {
                var request = Module['memoryInitializerRequest'];
                var response = request.response;
                if (request.status !== 200 && request.status !== 0) {
                    var data = tryParseAsDataURI(Module['memoryInitializerRequestURL']);
                    if (data) {
                        response = data.buffer;
                    } else {
                        console.warn('a problem seems to have happened with Module.memoryInitializerRequest, status: ' + request.status + ', retrying ' + memoryInitializer);
                        doBrowserLoad();
                        return;
                    }
                }
                applyMemoryInitializer(response);
            };
            if (Module['memoryInitializerRequest'].response) {
                setTimeout(useRequest, 0);
            } else {
                Module['memoryInitializerRequest'].addEventListener('load', useRequest);
            }
        } else {
            doBrowserLoad();
        }
    }
}
function ExitStatus(status) {
    this.name = 'ExitStatus';
    this.message = 'Program terminated with exit(' + status + ')';
    this.status = status;
}
ExitStatus.prototype = new Error();
ExitStatus.prototype.constructor = ExitStatus;
dependenciesFulfilled = function runCaller() {
    if (!Module['calledRun'])
        run();
    if (!Module['calledRun'])
        dependenciesFulfilled = runCaller;
};
function run(args) {
    args = args || Module['arguments'];
    if (runDependencies > 0) {
        return;
    }
    preRun();
    if (runDependencies > 0)
        return;
    if (Module['calledRun'])
        return;
    function doRun() {
        if (Module['calledRun'])
            return;
        Module['calledRun'] = true;
        if (ABORT)
            return;
        ensureInitRuntime();
        preMain();
        if (Module['onRuntimeInitialized'])
            Module['onRuntimeInitialized']();
        postRun();
    }
    if (Module['setStatus']) {
        Module['setStatus']('Running...');
        setTimeout(function () {
            setTimeout(function () {
                Module['setStatus']('');
            }, 1);
            doRun();
        }, 1);
    } else {
        doRun();
    }
}
Module['run'] = run;
function abort(what) {
    if (Module['onAbort']) {
        Module['onAbort'](what);
    }
    if (what !== undefined) {
        out(what);
        err(what);
        what = JSON.stringify(what);
    } else {
        what = '';
    }
    ABORT = true;
    EXITSTATUS = 1;
    throw 'abort(' + what + '). Build with -s ASSERTIONS=1 for more info.';
}
Module['abort'] = abort;
if (Module['preInit']) {
    if (typeof Module['preInit'] == 'function')
        Module['preInit'] = [Module['preInit']];
    while (Module['preInit'].length > 0) {
        Module['preInit'].pop()();
    }
}
Module['noExitRuntime'] = true;
run();
'use strict';


/**
 * Takes logical input and replaces Arabic characters with the "presentation form"
 * of their initial/medial/final forms, based on their order in the input.
 *
 * The results are still in logical order.
 *
 * @param {string} [input] Input text in logical order
 * @returns {string} Transformed text using Arabic presentation forms
 */
function applyArabicShaping(input) {
    if (!input)
        { return input; }

    var nDataBytes = (input.length + 1) * 2;
    var stringInputPtr = Module._malloc(nDataBytes);
    Module.stringToUTF16(input, stringInputPtr, nDataBytes);
    var returnStringPtr = Module.ccall('ushape_arabic', 'number', ['number', 'number'], [stringInputPtr, input.length]);
    Module._free(stringInputPtr);

    if (returnStringPtr === 0)
        { return input; }

    var result = Module.UTF16ToString(returnStringPtr);
    Module._free(returnStringPtr);

    return result;
}

function mergeParagraphLineBreakPoints(lineBreakPoints, paragraphCount) {
    var mergedParagraphLineBreakPoints = [];

    for (var i = 0; i < paragraphCount; i++) {
        var paragraphEndIndex = Module.ccall('bidi_getParagraphEndIndex', 'number', ['number'], [i]);
        // TODO: Handle error?

        for (var i$1 = 0, list = lineBreakPoints; i$1 < list.length; i$1 += 1) {
            var lineBreakPoint = list[i$1];

            if (lineBreakPoint < paragraphEndIndex &&
                (!mergedParagraphLineBreakPoints[mergedParagraphLineBreakPoints.length - 1] || lineBreakPoint > mergedParagraphLineBreakPoints[mergedParagraphLineBreakPoints.length - 1]))
                { mergedParagraphLineBreakPoints.push(lineBreakPoint); }
        }
        mergedParagraphLineBreakPoints.push(paragraphEndIndex);
    }

    for (var i$2 = 0, list$1 = lineBreakPoints; i$2 < list$1.length; i$2 += 1) {
        var lineBreakPoint$1 = list$1[i$2];

        if (lineBreakPoint$1 > mergedParagraphLineBreakPoints[mergedParagraphLineBreakPoints.length - 1])
            { mergedParagraphLineBreakPoints.push(lineBreakPoint$1); }
    }

    return mergedParagraphLineBreakPoints;
}

// This function is stateful: it sets a static BiDi paragaph object
// on the "native" side
function setParagraph(input, stringInputPtr, nDataBytes) {
    if (!input) {
        return null;
    }

    Module.stringToUTF16(input, stringInputPtr, nDataBytes);
    var paragraphCount = Module.ccall('bidi_processText', 'number', ['number', 'number'], [stringInputPtr, input.length]);

    if (paragraphCount === 0) {
        Module._free(stringInputPtr);
        return null;
    }
    return paragraphCount;
}

/**
 * Takes input text in logical order and applies the BiDi algorithm using the chosen
 * line break point to generate a set of lines with the characters re-arranged into
 * visual order.
 *
 * @param {string} [input] Input text in logical order
 * @param {Array<number>} [lineBreakPoints] Each line break is an index into the input string
 *
 * @returns {Array<string>} One string per line, with each string in visual order
 */
function processBidirectionalText(input, lineBreakPoints) {
    var nDataBytes = (input.length + 1) * 2;
    var stringInputPtr = Module._malloc(nDataBytes);
    var paragraphCount = setParagraph(input, stringInputPtr, nDataBytes);
    if (!paragraphCount) {
        return [input];
    }

    var mergedParagraphLineBreakPoints = mergeParagraphLineBreakPoints(lineBreakPoints, paragraphCount);

    var lineStartIndex = 0;
    var lines = [];

    for (var i = 0, list = mergedParagraphLineBreakPoints; i < list.length; i += 1) {
        var lineBreakPoint = list[i];

        var returnStringPtr = Module.ccall('bidi_getLine', 'number', ['number', 'number'], [lineStartIndex, lineBreakPoint]);

        if (returnStringPtr === 0) {
            Module._free(stringInputPtr);
            return []; // TODO: throw exception?
        }

        lines.push(Module.UTF16ToString(returnStringPtr));
        Module._free(returnStringPtr);

        lineStartIndex = lineBreakPoint;
    }

    Module._free(stringInputPtr); // Input string must live until getLine calls are finished

    return lines;
}

function createInt32Ptr() {
    return Module._malloc(4);
}

function consumeInt32Ptr(ptr) {
    var heapView = new Int32Array(Module.HEAPU8.buffer, ptr, 1);
    var result = heapView[0];
    Module._free(ptr);
    return result;
}

function writeReverse(stringInputPtr, logicalStart, logicalEnd) {
    var returnStringPtr = Module.ccall('bidi_writeReverse', 'number', ['number', 'number', 'number'], [stringInputPtr, logicalStart, logicalEnd - logicalStart]);

    if (returnStringPtr === 0) {
        return null;
    }
    var reversed = Module.UTF16ToString(returnStringPtr);
    Module._free(returnStringPtr);
    return reversed;
}

/**
 * Takes input text in logical order and applies the BiDi algorithm using the chosen
 * line break point to generate a set of lines with the characters re-arranged into
 * visual order.
 *
 * Also takes an array of "style indices" that specify different styling on the input
 * characters (the styles are represented as integers here, the caller is responsible
 * for the actual implementation of styling). BiDi can both reorder and add/remove
 * characters from the input string, but this function copies style information from
 * the "source" logical characters to their corresponding visual characters in the output.
 *
 * @param {string} [input] Input text in logical order
 * @param {Array<number>} [styleIndices] Same length as input text, each entry represents the style
 *                                       of the corresponding input character.
 * @param {Array<number>} [lineBreakPoints] Each line break is an index into the input string
 * @returns {Array<[string,Array<number>>]} One string per line, with each string in visual order.
 *                               Each string has a matching array of style indices in the same order.
 */
function processStyledBidirectionalText(text, styleIndices, lineBreakPoints) {
    var nDataBytes = (text.length + 1) * 2;
    var stringInputPtr = Module._malloc(nDataBytes);
    var paragraphCount = setParagraph(text, stringInputPtr, nDataBytes);
    if (!paragraphCount) {
        return [{text: text, styleIndices: styleIndices}];
    }

    var mergedParagraphLineBreakPoints = mergeParagraphLineBreakPoints(lineBreakPoints, paragraphCount);

    var lineStartIndex = 0;
    var lines = [];

    for (var i$1 = 0, list = mergedParagraphLineBreakPoints; i$1 < list.length; i$1 += 1) {
        var lineBreakPoint = list[i$1];

        var lineText = "";
        var lineStyleIndices = [];
        var runCount = Module.ccall('bidi_setLine', 'number', ['number', 'number'], [lineStartIndex, lineBreakPoint]);

        if (!runCount) {
            Module._free(stringInputPtr);
            return []; // TODO: throw exception?
        }

        for (var i = 0; i < runCount; i++) {
            var logicalStartPtr = createInt32Ptr();
            var logicalLengthPtr = createInt32Ptr();
            var isReversed = Module.ccall('bidi_getVisualRun', 'number', ['number', 'number', 'number'], [i, logicalStartPtr, logicalLengthPtr]);

            var logicalStart = lineStartIndex + consumeInt32Ptr(logicalStartPtr);
            var logicalLength = consumeInt32Ptr(logicalLengthPtr);
            var logicalEnd = logicalStart + logicalLength;
            if (isReversed) {
                // Within this reversed section, iterate logically backwards
                // Each time we see a change in style, render a reversed chunk
                // of everything since the last change
                var styleRunStart = logicalEnd;
                var currentStyleIndex = styleIndices[styleRunStart - 1];
                for (var j = logicalEnd - 1; j >= logicalStart; j--) {
                    if (currentStyleIndex !== styleIndices[j] || j === logicalStart) {
                        var styleRunEnd = j === logicalStart ? j : j + 1;
                        var reversed = writeReverse(stringInputPtr, styleRunEnd, styleRunStart);
                        if (!reversed) {
                            Module._free(stringInputPtr);
                            return [];
                        }
                        lineText += reversed;
                        for (var k = 0; k < reversed.length; k++) {
                            lineStyleIndices.push(currentStyleIndex);
                        }
                        currentStyleIndex = styleIndices[j];
                        styleRunStart = styleRunEnd;
                    }
                }

            } else {
                lineText += text.substring(logicalStart, logicalEnd);
                lineStyleIndices = lineStyleIndices.concat(styleIndices.slice(logicalStart, logicalEnd));
            }
        }

        lines.push([lineText, lineStyleIndices]);
        lineStartIndex = lineBreakPoint;
    }

    Module._free(stringInputPtr); // Input string must live until getLine calls are finished

    return lines;
}

self.registerRTLTextPlugin({'applyArabicShaping': applyArabicShaping, 'processBidirectionalText': processBidirectionalText, 'processStyledBidirectionalText': processStyledBidirectionalText});

});
})();