var DracoEncoderModule = function (DracoEncoderModule) {
    DracoEncoderModule = DracoEncoderModule || {}

    var Module = typeof DracoEncoderModule !== 'undefined' ? DracoEncoderModule : {}
    var isRuntimeInitialized = false
    var isModuleParsed = false
    Module['onRuntimeInitialized'] = function () {
        isRuntimeInitialized = true
        if (isModuleParsed) {
            if (typeof Module['onModuleLoaded'] === 'function') {
                Module['onModuleLoaded'](Module)
            }
        }
    }
    Module['onModuleParsed'] = function () {
        isModuleParsed = true
        if (isRuntimeInitialized) {
            if (typeof Module['onModuleLoaded'] === 'function') {
                Module['onModuleLoaded'](Module)
            }
        }
    }
    function isVersionSupported(versionString) {
        if (typeof versionString !== 'string') return false
        const version = versionString.split('.')
        if (version.length < 2 || version.length > 3) return false
        if (version[0] == 1 && version[1] >= 0 && version[1] <= 3) return true
        if (version[0] != 0 || version[1] > 10) return false
        return true
    }
    Module['isVersionSupported'] = isVersionSupported
    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
    if (Module['ENVIRONMENT']) {
        if (Module['ENVIRONMENT'] === 'WEB') {
            ENVIRONMENT_IS_WEB = true
        } else if (Module['ENVIRONMENT'] === 'WORKER') {
            ENVIRONMENT_IS_WORKER = true
        } else if (Module['ENVIRONMENT'] === 'NODE') {
            ENVIRONMENT_IS_NODE = true
        } else if (Module['ENVIRONMENT'] === 'SHELL') {
            ENVIRONMENT_IS_SHELL = true
        } else {
            throw new Error("Module['ENVIRONMENT'] value is not valid. must be one of: WEB|WORKER|NODE|SHELL.")
        }
    } else {
        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
    }
    if (ENVIRONMENT_IS_NODE) {
        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)
            }
            assert(ret.buffer)
            return ret
        }
        if (process['argv'].length > 1) {
            Module['thisProgram'] = process['argv'][1].replace(/\\/g, '/')
        }
        Module['arguments'] = process['argv'].slice(2)
        process['on']('uncaughtException', function (ex) {
            if (!(ex instanceof ExitStatus)) {
                throw ex
            }
        })
        process['on']('unhandledRejection', function (reason, p) {
            process['exit'](1)
        })
        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')
            assert(typeof data === 'object')
            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, toThrow) {
                quit(status)
            }
        }
    } else if (ENVIRONMENT_IS_WEB || ENVIRONMENT_IS_WORKER) {
        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
        }
    }
    Module['print'] = typeof console !== 'undefined' ? console.log.bind(console) : typeof print !== 'undefined' ? print : null
    Module['printErr'] = typeof printErr !== 'undefined' ? printErr : (typeof console !== 'undefined' && console.warn.bind(console)) || Module['print']
    Module.print = Module['print']
    Module.printErr = Module['printErr']
    for (key in moduleOverrides) {
        if (moduleOverrides.hasOwnProperty(key)) {
            Module[key] = moduleOverrides[key]
        }
    }
    moduleOverrides = undefined
    var STACK_ALIGN = 16
    function staticAlloc(size) {
        assert(!staticSealed)
        var ret = STATICTOP
        STATICTOP = (STATICTOP + size + 15) & -16
        return ret
    }
    function dynamicAlloc(size) {
        assert(DYNAMICTOP_PTR)
        var ret = HEAP32[DYNAMICTOP_PTR >> 2]
        var end = (ret + size + 15) & -16
        HEAP32[DYNAMICTOP_PTR >> 2] = end
        if (end >= TOTAL_MEMORY) {
            var success = enlargeMemory()
            if (!success) {
                HEAP32[DYNAMICTOP_PTR >> 2] = ret
                return 0
            }
        }
        return ret
    }
    function alignMemory(size, factor) {
        if (!factor) factor = STACK_ALIGN
        var ret = (size = Math.ceil(size / factor) * factor)
        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))
                    assert(bits % 8 === 0)
                    return bits / 8
                } else {
                    return 0
                }
            }
        }
    }
    function warnOnce(text) {
        if (!warnOnce.shown) warnOnce.shown = {}
        if (!warnOnce.shown[text]) {
            warnOnce.shown[text] = 1
            Module.printErr(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 GLOBAL_BASE = 8
    var ABORT = 0
    var EXITSTATUS = 0
    function assert(condition, text) {
        if (!condition) {
            abort('Assertion failed: ' + text)
        }
    }
    function getCFunc(ident) {
        var func = Module['_' + ident]
        assert(func, 'Cannot call unknown function ' + ident + ', make sure it is exported')
        return func
    }
    var JSfuncs = {
        stackSave: function () {
            stackSave()
        },
        stackRestore: function () {
            stackRestore()
        },
        arrayToC: function (arr) {
            var ret = stackAlloc(arr.length)
            writeArrayToMemory(arr, ret)
            return ret
        },
        stringToC: 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
        },
    }
    var toC = { string: JSfuncs['stringToC'], array: JSfuncs['arrayToC'] }
    function ccall(ident, returnType, argTypes, args, opts) {
        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)
        if (returnType === 'string') ret = Pointer_stringify(ret)
        if (returnType === 'boolean') ret = Boolean(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_STATIC = 2
    var ALLOC_NONE = 4
    function allocate(slab, types, allocator, ptr) {
        var zeroinit, size
        if (typeof slab === 'number') {
            zeroinit = true
            size = slab
        } else {
            zeroinit = false
            size = slab.length
        }
        var singleType = typeof types === 'string' ? types : null
        var ret
        if (allocator == ALLOC_NONE) {
            ret = ptr
        } else {
            ret = [typeof _malloc === 'function' ? _malloc : staticAlloc, stackAlloc, staticAlloc, dynamicAlloc][allocator === undefined ? ALLOC_STATIC : allocator](
                Math.max(size, singleType ? 1 : types.length)
            )
        }
        if (zeroinit) {
            var stop
            ptr = ret
            assert((ret & 3) == 0)
            stop = ret + (size & ~3)
            for (; ptr < stop; ptr += 4) {
                HEAP32[ptr >> 2] = 0
            }
            stop = ret + size
            while (ptr < stop) {
                HEAP8[ptr++ >> 0] = 0
            }
            return ret
        }
        if (singleType === 'i8') {
            if (slab.subarray || slab.slice) {
                HEAPU8.set(slab, ret)
            } else {
                HEAPU8.set(new Uint8Array(slab), ret)
            }
            return ret
        }
        var i = 0,
            type,
            typeSize,
            previousType
        while (i < size) {
            var curr = slab[i]
            type = singleType || types[i]
            if (type === 0) {
                i++
                continue
            }
            if (type == 'i64') type = 'i32'
            setValue(ret + i, curr, type)
            if (previousType !== type) {
                typeSize = getNativeTypeSize(type)
                previousType = type
            }
            i += typeSize
        }
        return ret
    }
    function Pointer_stringify(ptr, length) {
        if (length === 0 || !ptr) return ''
        var hasUtf = 0
        var t
        var i = 0
        while (1) {
            t = HEAPU8[(ptr + i) >> 0]
            hasUtf |= t
            if (t == 0 && !length) break
            i++
            if (length && i == length) break
        }
        if (!length) length = i
        var ret = ''
        if (hasUtf < 128) {
            var MAX_CHUNK = 1024
            var curr
            while (length > 0) {
                curr = String.fromCharCode.apply(String, HEAPU8.subarray(ptr, ptr + Math.min(length, MAX_CHUNK)))
                ret = ret ? ret + curr : curr
                ptr += MAX_CHUNK
                length -= MAX_CHUNK
            }
            return ret
        }
        return UTF8ToString(ptr)
    }
    var UTF8Decoder = typeof TextDecoder !== 'undefined' ? new TextDecoder('utf8') : undefined
    function UTF8ArrayToString(u8Array, idx) {
        var endPtr = idx
        while (u8Array[endPtr]) ++endPtr
        if (endPtr - idx > 16 && u8Array.subarray && UTF8Decoder) {
            return UTF8Decoder.decode(u8Array.subarray(idx, endPtr))
        } else {
            var u0, u1, u2, u3, u4, u5
            var str = ''
            while (1) {
                u0 = u8Array[idx++]
                if (!u0) return str
                if (!(u0 & 128)) {
                    str += String.fromCharCode(u0)
                    continue
                }
                u1 = u8Array[idx++] & 63
                if ((u0 & 224) == 192) {
                    str += String.fromCharCode(((u0 & 31) << 6) | u1)
                    continue
                }
                u2 = u8Array[idx++] & 63
                if ((u0 & 240) == 224) {
                    u0 = ((u0 & 15) << 12) | (u1 << 6) | u2
                } else {
                    u3 = u8Array[idx++] & 63
                    if ((u0 & 248) == 240) {
                        u0 = ((u0 & 7) << 18) | (u1 << 12) | (u2 << 6) | u3
                    } else {
                        u4 = u8Array[idx++] & 63
                        if ((u0 & 252) == 248) {
                            u0 = ((u0 & 3) << 24) | (u1 << 18) | (u2 << 12) | (u3 << 6) | u4
                        } else {
                            u5 = u8Array[idx++] & 63
                            u0 = ((u0 & 1) << 30) | (u1 << 24) | (u2 << 18) | (u3 << 12) | (u4 << 6) | u5
                        }
                    }
                }
                if (u0 < 65536) {
                    str += String.fromCharCode(u0)
                } else {
                    var ch = u0 - 65536
                    str += String.fromCharCode(55296 | (ch >> 10), 56320 | (ch & 1023))
                }
            }
        }
    }
    function UTF8ToString(ptr) {
        return UTF8ArrayToString(HEAPU8, ptr)
    }
    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) u = (65536 + ((u & 1023) << 10)) | (str.charCodeAt(++i) & 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 (u <= 2097151) {
                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)
            } else if (u <= 67108863) {
                if (outIdx + 4 >= endIdx) break
                outU8Array[outIdx++] = 248 | (u >> 24)
                outU8Array[outIdx++] = 128 | ((u >> 18) & 63)
                outU8Array[outIdx++] = 128 | ((u >> 12) & 63)
                outU8Array[outIdx++] = 128 | ((u >> 6) & 63)
                outU8Array[outIdx++] = 128 | (u & 63)
            } else {
                if (outIdx + 5 >= endIdx) break
                outU8Array[outIdx++] = 252 | (u >> 30)
                outU8Array[outIdx++] = 128 | ((u >> 24) & 63)
                outU8Array[outIdx++] = 128 | ((u >> 18) & 63)
                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 if (u <= 2097151) {
                len += 4
            } else if (u <= 67108863) {
                len += 5
            } else {
                len += 6
            }
        }
        return len
    }
    var UTF16Decoder = typeof TextDecoder !== 'undefined' ? new TextDecoder('utf-16le') : undefined
    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 : x + ' [' + y + ']'
        })
    }
    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()
    }
    var WASM_PAGE_SIZE = 65536
    var ASMJS_PAGE_SIZE = 16777216
    var MIN_TOTAL_MEMORY = 16777216
    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 updateGlobalBuffer(buf) {
        Module['buffer'] = buffer = buf
    }
    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 STATIC_BASE, STATICTOP, staticSealed
    var STACK_BASE, STACKTOP, STACK_MAX
    var DYNAMIC_BASE, DYNAMICTOP_PTR
    STATIC_BASE = STATICTOP = STACK_BASE = STACKTOP = STACK_MAX = DYNAMIC_BASE = DYNAMICTOP_PTR = 0
    staticSealed = false
    function abortOnCannotGrowMemory() {
        abort(
            'Cannot enlarge memory arrays. Either (1) compile with  -s TOTAL_MEMORY=X  with X higher than the current value ' +
                TOTAL_MEMORY +
                ', (2) compile with  -s ALLOW_MEMORY_GROWTH=1  which allows increasing the size at runtime but prevents some optimizations, (3) set Module.TOTAL_MEMORY to a higher value before the program runs, or (4) if you want malloc to return NULL (0) instead of this abort, compile with  -s ABORTING_MALLOC=0 '
        )
    }
    if (!Module['reallocBuffer'])
        Module['reallocBuffer'] = function (size) {
            var ret
            try {
                if (ArrayBuffer.transfer) {
                    ret = ArrayBuffer.transfer(buffer, size)
                } else {
                    var oldHEAP8 = HEAP8
                    ret = new ArrayBuffer(size)
                    var temp = new Int8Array(ret)
                    temp.set(oldHEAP8)
                }
            } catch (e) {
                return false
            }
            var success = _emscripten_replace_memory(ret)
            if (!success) return false
            return ret
        }
    function enlargeMemory() {
        var PAGE_MULTIPLE = Module['usingWasm'] ? WASM_PAGE_SIZE : ASMJS_PAGE_SIZE
        var LIMIT = 2147483648 - PAGE_MULTIPLE
        if (HEAP32[DYNAMICTOP_PTR >> 2] > LIMIT) {
            return false
        }
        var OLD_TOTAL_MEMORY = TOTAL_MEMORY
        TOTAL_MEMORY = Math.max(TOTAL_MEMORY, MIN_TOTAL_MEMORY)
        while (TOTAL_MEMORY < HEAP32[DYNAMICTOP_PTR >> 2]) {
            if (TOTAL_MEMORY <= 536870912) {
                TOTAL_MEMORY = alignUp(2 * TOTAL_MEMORY, PAGE_MULTIPLE)
            } else {
                TOTAL_MEMORY = Math.min(alignUp((3 * TOTAL_MEMORY + 2147483648) / 4, PAGE_MULTIPLE), LIMIT)
            }
        }
        var replacement = Module['reallocBuffer'](TOTAL_MEMORY)
        if (!replacement || replacement.byteLength != TOTAL_MEMORY) {
            TOTAL_MEMORY = OLD_TOTAL_MEMORY
            return false
        }
        updateGlobalBuffer(replacement)
        updateGlobalBufferViews()
        return true
    }
    var byteLength
    try {
        byteLength = Function.prototype.call.bind(Object.getOwnPropertyDescriptor(ArrayBuffer.prototype, 'byteLength').get)
        byteLength(new ArrayBuffer(4))
    } catch (e) {
        byteLength = function (buffer) {
            return buffer.byteLength
        }
    }
    var TOTAL_STACK = Module['TOTAL_STACK'] || 5242880
    var TOTAL_MEMORY = Module['TOTAL_MEMORY'] || 16777216
    if (TOTAL_MEMORY < TOTAL_STACK) Module.printErr('TOTAL_MEMORY should be larger than TOTAL_STACK, was ' + TOTAL_MEMORY + '! (TOTAL_STACK=' + TOTAL_STACK + ')')
    if (Module['buffer']) {
        buffer = Module['buffer']
    } else {
        {
            buffer = new ArrayBuffer(TOTAL_MEMORY)
        }
        Module['buffer'] = buffer
    }
    updateGlobalBufferViews()
    function getTotalMemory() {
        return TOTAL_MEMORY
    }
    HEAP32[0] = 1668509029
    HEAP16[1] = 25459
    if (HEAPU8[2] !== 115 || HEAPU8[3] !== 99) throw 'Runtime error: expected the system to be little-endian!'
    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 __ATEXIT__ = []
    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() {
        callRuntimeCallbacks(__ATEXIT__)
        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 addOnPreMain(cb) {
        __ATMAIN__.unshift(cb)
    }
    function addOnPostRun(cb) {
        __ATPOSTRUN__.unshift(cb)
    }
    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
    }
    var Math_abs = Math.abs
    var Math_cos = Math.cos
    var Math_sin = Math.sin
    var Math_tan = Math.tan
    var Math_acos = Math.acos
    var Math_asin = Math.asin
    var Math_atan = Math.atan
    var Math_atan2 = Math.atan2
    var Math_exp = Math.exp
    var Math_log = Math.log
    var Math_sqrt = Math.sqrt
    var Math_ceil = Math.ceil
    var Math_floor = Math.floor
    var Math_pow = Math.pow
    var Math_imul = Math.imul
    var Math_fround = Math.fround
    var Math_round = Math.round
    var Math_min = Math.min
    var Math_max = Math.max
    var Math_clz32 = Math.clz32
    var Math_trunc = Math.trunc
    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
    }
    STATIC_BASE = GLOBAL_BASE
    STATICTOP = STATIC_BASE + 18640
    __ATINIT__.push()
    memoryInitializer =
        'data:application/octet-stream;base64,vBoAACwbAADkGgAAehsAACAAAAAAAAAAvBoAAKEbAADkGgAAvhsAACAAAAAAAAAAvBoAAOcbAADkGgAAAxwAADgAAAAAAAAAvBoAACUcAADkGgAAShwAADgAAAAAAAAA5BoAAI4mAABQAAAAAAAAAOQaAAB6HAAAiAAAAAAAAADkGgAA0xwAAJgAAAAAAAAA5BoAACcdAACoAAAAAAAAAOQaAABbHQAAuAAAAAAAAAC8GgAAhh0AAOQaAACqHQAA0AAAAAAAAAC8GgAASB4AAOQaAADmHgAA6AAAAAAAAADkGgAAfh8AAIgAAAAAAAAA5BoAAAcgAADoAAAAAAAAAOQaAAChIAAA6AAAAAAAAADkGgAARyEAAOgAAAAAAAAA5BoAAN0hAAA4AQAAAAAAALwaAACIIgAA5BoAADMjAABQAQAAAAAAAOQaAADYIwAAiAAAAAAAAADkGgAAbiQAAFABAAAAAAAA5BoAABUlAABQAQAAAAAAAOQaAADIJQAAUAEAAAAAAADkGgAAqDEAAGgAAAAAAAAA5BoAALomAACwAQAAAAAAAOQaAAArJwAAmAAAAAAAAADkGgAAlycAANABAAAAAAAAvBoAAE0oAADkGgAAAykAAOgBAAAAAAAA5BoAALMpAACwAQAAAAAAAOQaAABUKgAA6AEAAAAAAADkGgAABisAAOgBAAAAAAAA5BoAAMQrAADoAQAAAAAAAOQaAAByLAAAOAIAAAAAAAC8GgAANS0AAOQaAAD4LQAAUAIAAAAAAADkGgAAtS4AALABAAAAAAAA5BoAAGMvAABQAgAAAAAAAOQaAAAiMAAAUAIAAAAAAADkGgAA7TAAAFACAAAAAAAA5BoAANMxAABoAAAAAAAAAOQaAABJMgAACAAAAAAAAAC8GgAAFjIAAOQaAABcMgAAsAIAAAAAAADkGgAAbDMAAHgDAAAAAAAA5BoAAOE3AABgAwAAAAAAALwaAAAsNAAA5BoAAJM0AADoAgAAAAAAAOQaAAAANQAAEAMAAAAAAAC8GgAAizUAALwaAAClNQAA5BoAAP81AAAYAwAAAAAAAOQaAABfNgAAEAMAAAAAAADkGgAA3TYAABgDAAAAAAAA5BoAAEY3AAAQAwAAAAAAALwaAAAtOAAA5BoAAFs4AABgAwAAAAAAAOQaAADMOAAAqAMAAAAAAADkGgAAEjkAAHgDAAAAAAAA5BoAAPg4AAAQAwAAAAAAALwaAAAyOQAA5BoAAAc6AACoAwAAAAAAAOQaAAApOgAAqAMAAAAAAADkGgAATzoAAOADAAAAAAAAvBoAAKE6AAC8GgAA0EQAAOQaAAAwRQAAAAQAAAAAAADkGgAA3UQAABAEAAAAAAAAvBoAAP5EAADkGgAAC0UAAPADAAAAAAAA5BoAABJGAADoAwAAAAAAAOQaAAAiRgAAKAQAAAAAAADkGgAAV0YAAAAEAAAAAAAA5BoAADNGAABIBAAAAAAAAAAAAAAIAAAAAQAAAAIAAAAAAAAAEAAAAAMAAAAEAAAAAQAAAAEAAAABAAAAAAAAACgAAAAFAAAABgAAAAIAAAACAAAAAgAAAP//////////AAAAADgAAAAHAAAACAAAAAEAAAADAAAAAQAAAAQAAAAFAAAAAgAAAAYAAAAHAAAAAwAAAAEAAAAIAAAAAAAAAEAAAAAJAAAACgAAAAEAAAADAAAABAAAAAQAAAAFAAAAAgAAAAYAAAAHAAAABQAAAAkAAAAKAAAAAAAAAFAAAAALAAAADAAAAAMAAAALAAAADAAAAAQAAAANAAAABgAAAAcAAAAOAAAADwAAAAUAAAAAAAAAWAAAAA0AAAAOAAAABgAAABAAAAAIAAAAEQAAABIAAAAHAAAAEwAAABQAAAAJAAAAFQAAABYAAAAKAAAAAQAAAAAAAABoAAAADwAAABAAAAAIAAAACwAAABcAAAAEAAAADQAAAAYAAAALAAAADgAAAA8AAAAJAAAAAgAAAAoAAAD/////AAAAAIgAAAARAAAAEgAAAAEAAAAMAAAAAQAAAA0AAAAYAAAAGQAAAA4AAAAPAAAAGgAAAAEAAAAAAAAAeAAAABEAAAATAAAAEAAAAAwAAAARAAAADQAAABgAAAAZAAAADgAAAA8AAAAaAAAAAQAAAAAAAAAYAQAAEQAAABQAAAASAAAADAAAABMAAAANAAAAGAAAABkAAAAOAAAADwAAABoAAAACAAAAAAAAAPgAAAAVAAAAFgAAABQAAAAMAAAAFQAAABYAAAAbAAAAHAAAAA4AAAAPAAAAHQAAAAMAAAAAAAAA2AAAABcAAAAYAAAAFwAAAAwAAAAYAAAAGQAAAB4AAAAfAAAADgAAAA8AAAAgAAAABAAAAAAAAADAAAAAGQAAABoAAAAhAAAAGgAAAAMAAAAAAAAA6AAAABEAAAAbAAAAAQAAAAwAAAABAAAADQAAABgAAAAZAAAADgAAAA8AAAAaAAAAAQAAAAAAAAAIAQAAHAAAAB0AAAAbAAAADAAAABwAAAANAAAAGAAAABkAAAAOAAAADwAAACIAAAAFAAAAAAAAAIABAAARAAAAHgAAAB0AAAAMAAAAHgAAAA0AAAAYAAAAGQAAAA4AAAAPAAAAGgAAAAYAAAAAAAAAYAEAAB8AAAAgAAAAHwAAAAwAAAAgAAAAIQAAACMAAAAkAAAADgAAAA8AAAAlAAAABwAAAAAAAABAAQAAIQAAACIAAAAiAAAADAAAACMAAAAkAAAAJgAAACcAAAAOAAAADwAAACgAAAAIAAAAAAAAACgBAAAjAAAAJAAAACkAAAAlAAAABAAAAAAAAABQAQAAEQAAACUAAAABAAAADAAAAAEAAAANAAAAGAAAABkAAAAOAAAADwAAABoAAAABAAAAAAAAAHABAAAmAAAAJwAAACYAAAAMAAAAJwAAAA0AAAAYAAAAGQAAAA4AAAAPAAAAKgAAAAkAAAAAAAAAkAEAACgAAAApAAAACwAAAAsAAAAXAAAABAAAACsAAAAoAAAAKQAAAA4AAAAPAAAACQAAAAUAAAAMAAAAAAAAAKABAAAqAAAAKwAAACoAAAArAAAALAAAAC0AAAAsAAAALQAAAC4AAAAvAAAALgAAAAoAAAAAAAAAGAIAACoAAAAsAAAAMAAAACsAAAAxAAAALQAAACwAAAAtAAAALgAAAC8AAAAuAAAACwAAAAAAAAAIAgAALQAAAC4AAAAyAAAAKwAAADMAAAAtAAAALAAAAC0AAAAuAAAALwAAAC8AAAAMAAAAAAAAAPgBAAAvAAAAMAAAADQAAAArAAAANQAAADYAAAAwAAAAMQAAAC4AAAAvAAAAMgAAAA0AAAAAAAAA2AEAADEAAAAyAAAANwAAACsAAAA4AAAAOQAAADMAAAA0AAAALgAAAC8AAAA1AAAADgAAAAAAAADAAQAAMwAAADQAAAA2AAAAOgAAAAYAAAAAAAAAgAIAACoAAAA1AAAAOwAAACsAAAA8AAAALQAAACwAAAAtAAAALgAAAC8AAAAuAAAADwAAAAAAAABwAgAANgAAADcAAAA9AAAAKwAAAD4AAAAtAAAALAAAAC0AAAAuAAAALwAAADcAAAAQAAAAAAAAAGACAAA4AAAAOQAAAD8AAAArAAAAQAAAAEEAAAA4AAAAOQAAAC4AAAAvAAAAOgAAABEAAAAAAAAAQAIAADoAAAA7AAAAQgAAACsAAABDAAAARAAAADsAAAA8AAAALgAAAC8AAAA9AAAAEgAAAAAAAAAoAgAAPAAAAD0AAAA+AAAARQAAAAcAAAAAAAAAkAIAAD4AAAA/AAAADQAAAAsAAAAXAAAABAAAAD8AAABGAAAARwAAAA4AAAAPAAAACQAAAAIAAAAOAAAAAAAAAKACAAABAAAAQAAAAAEAAAACAAAAAAAAALACAABBAAAAQgAAAAAAAAC4AgAAQQAAAEMAAAAAAAAAyAIAAEQAAABFAAAASAAAAEkAAABKAAAASwAAAAMAAABMAAAATQAAAEAAAABBAAAATgAAAEYAAABPAAAAQgAAAEMAAAAEAAAARwAAAAAAAADYAgAASAAAAEkAAABEAAAARQAAAEYAAABHAAAASAAAAAUAAABQAAAASQAAAFEAAAABAAAAAwAAAAAAAAADAAAAAAAAAAMAAAAAAAAAAwAAAAAAAAAAAwAASgAAAEsAAABKAAAAUgAAAAAAAADwAgAATAAAAE0AAAAIAAAAAAAAAOgCAABOAAAATwAAAAgAAAD/////AAAAADADAABQAAAAUQAAAEsAAABTAAAAAAAAACADAABSAAAAUwAAAAkAAAAAAAAAGAMAAFQAAABVAAAACQAAAAAAAABQAwAAVgAAAFcAAABMAAAAVAAAAAAAAABAAwAAWAAAAFkAAAAJAAAAAAAAAGgDAABaAAAAWwAAAE0AAABOAAAATwAAAFAAAABRAAAABgAAAFUAAABSAAAAVgAAAAAAAAABAAAABQAAAAIAAAAFAAAAAwAAAAUAAAAEAAAAAAAAAHgDAABcAAAAXQAAAEgAAAABAAAAVwAAAEsAAAADAAAATAAAAE0AAAABAAAAUwAAAE4AAAABAAAAWAAAAFQAAABVAAAAAQAAAAEAAAAAAAAAiAMAAFwAAABeAAAASAAAAFkAAABXAAAASwAAAAMAAABMAAAATQAAAFYAAABTAAAATgAAAF8AAABYAAAAVAAAAFUAAAAHAAAAYAAAAAAAAACYAwAAYQAAAGIAAABXAAAAWgAAAAAAAACoAwAAXAAAAGMAAABbAAAAAQAAAFcAAABLAAAACAAAAEwAAABNAAAAAQAAAFMAAABOAAAAAQAAAAAAAACwAwAAXAAAAGQAAABbAAAAXAAAAFcAAABLAAAACQAAAEwAAABNAAAAWAAAAFMAAABOAAAAZQAAAAAAAADAAwAAXAAAAGYAAABbAAAAXQAAAFcAAABLAAAACgAAAEwAAABNAAAAWQAAAFMAAABOAAAAZwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAAAFZVVVUCAAAAAAAAAAIAAACamZmZAwAAAFZVVVUDAAAAJUmSJAMAAAAAAAAAAwAAAMhxHMcEAAAAmpmZmQQAAABGF110BAAAAFZVVVUEAAAAPLETOwQAAAAlSZIkBAAAABIREREEAAAAAAAAAAQAAADi4eHhBQAAAMhxHMcFAAAAy2sorwUAAACamZmZBQAAAIdhGIYFAAAARhdddAUAAACRhSxkBQAAAFZVVVUFAAAAexSuRwUAAAA8sRM7BQAAANtLaC8FAAAAJUmSJAUAAAASlnsaBQAAABIREREFAAAAhRBCCAUAAAAAAAAABQAAAAgffPAGAAAA4uHh4QYAAADVQR3UBgAAAMhxHMcGAAAATZHPugYAAADLayivBgAAAKVBGqQGAAAAmpmZmQYAAAD6GJyPBgAAAIdhGIYGAAAAGPQFfQYAAABGF110BgAAAG3BFmwGAAAAkYUsZAYAAAC6gphcBgAAAFZVVVUGAAAAcwpeTgYAAAB7FK5HBgAAAEJBQUEGAAAAPLETOwYAAACzzyE1BgAAANtLaC8GAAAAnxLkKQYAAAAlSZIkBgAAAN1HcB8GAAAAEpZ7GgYAAAD45bEVBgAAABIREREGAAAA/BSXDAYAAACFEEIIBgAAAAVBEAQGAAAAAAAAAAYAAAD5gR/4BwAAAAgffPAHAAAAwBoT6QcAAADi4eHhBwAAAGwH5toHAAAA1UEd1AcAAACRaIXNBwAAAMhxHMcHAAAAOXDgwAcAAABNkc+6BwAAAE8b6LQHAAAAy2sorwcAAAAH9o6pBwAAAKVBGqQHAAAAUunIngcAAACamZmZBwAAAM4Pi5QHAAAA+hicjwcAAAD3kMuKBwAAAIdhGIYHAAAAgoGBgQcAAAAY9AV9BwAAABjIpHgHAAAARhdddAcAAADBBS5wBwAAAG3BFmwHAAAAaYEWaAcAAACRhSxkBwAAAAYWWGAHAAAAuoKYXAcAAAAJI+1YBwAAAFZVVVUHAAAAr37QUQcAAABzCl5OBwAAAAZq/UoHAAAAexSuRwcAAABXhm9EBwAAAEJBQUEHAAAAz8siPgcAAAA8sRM7BwAAADmBEzgHAAAAs88hNQcAAACjND4yBwAAANtLaC8HAAAA2bSfLAcAAACfEuQpBwAAAIkLNScHAAAAJUmSJAcAAAATePshBwAAAN1HcB8HAAAA22rwHAcAAAASlnsaBwAAABmBERgHAAAA+OWxFQcAAAAUgVwTBwAAABIREREHAAAAv1bPDgcAAAD8FJcMBwAAAKcQaAoHAAAAhRBCCAcAAAAw3SQGBwAAAAVBEAQHAAAAEQgEAgcAAAAAAAAABwAAACDwB/wIAAAA+YEf+AgAAADlWUb0CAAAAAgffPAIAAAAMXvA7AgAAADAGhPpCAAAAJGsc+UIAAAA4uHh4QgAAABAbl3eCAAAAGwH5toIAAAATGV71wgAAADVQR3UCAAAAPdYy9AIAAAAkWiFzQgAAABWMEvKCAAAAMhxHMcIAAAAHfD4wwgAAAA5cODACAAAAJq40r0IAAAATZHPuggAAADew9a3CAAAAE8b6LQIAAAAB2QDsggAAADLayivCAAAAK0BV6wIAAAAB/aOqQgAAABuGtCmCAAAAKVBGqQIAAAAmD9toQgAAABS6cieCAAAAO8ULZwIAAAAmpmZmQgAAACBTw6XCAAAAM4Pi5QIAAAAnrQPkggAAAD6GJyPCAAAANQYMI0IAAAA95DLiggAAAALX26ICAAAAIdhGIYIAAAArHfJgwgAAACCgYGBCAAAANFfQH8IAAAAGPQFfQgAAACPINJ6CAAAABjIpHgIAAAARM59dggAAABGF110CAAAAPWHQnIIAAAAwQUucAgAAAC1dh9uCAAAAG3BFmwIAAAAFs0TaggAAABpgRZoCAAAAKbGHmYIAAAAkYUsZAgAAABxpz9iCAAAAAYWWGAIAAAAjrt1XggAAAC6gphcCAAAALFWwFoIAAAACSPtWAgAAADG0x5XCAAAAFZVVVUIAAAAkJSQUwgAAACvftBRCAAAAFEBFVAIAAAAcwpeTggAAABziKtMCAAAAAZq/UoIAAAAPJ5TSQgAAAB7FK5HCAAAAIC8DEYIAAAAV4ZvRAgAAABeYtZCCAAAAEJBQUEIAAAA/BOwPwgAAADPyyI+CAAAAEhamTwIAAAAPLETOwgAAADCwpE5CAAAADmBEzgIAAAAPt+YNggAAACzzyE1CAAAALZFrjMIAAAAozQ+MggAAAAUkNEwCAAAANtLaC8IAAAABVwCLggAAADZtJ8sCAAAANFKQCsIAAAAnxLkKQgAAAApAYsoCAAAAIkLNScIAAAACSfiJQgAAAAlSZIkCAAAAIpnRSMIAAAAE3j7IQgAAADHcLQgCAAAAN1HcB8IAAAAtPMuHggAAADbavAcCAAAAAWktBsIAAAAEpZ7GggAAAAJOEUZCAAAABmBERgIAAAAlWjgFggAAAD45bEVCAAAAOHwhRQIAAAAFIFcEwgAAAB2jjUSCAAAABIREREIAAAAEAHvDwgAAAC/Vs8OCAAAAIkKsg0IAAAA/BSXDAgAAADDbn4LCAAAAKcQaAoIAAAAkfNTCQgAAACFEEIICAAAAKVgMgcIAAAAMN0kBggAAAB+fxkFCAAAAAVBEAQIAAAAUhsJAwgAAAARCAQCCAAAAAIBAQEIAAAA/////wAAAADQAwAAaAAAAGkAAAAKAAAACwAAAF4AAABqAAAACwAAAP////8AAAAA4AMAAGsAAABsAAAADAAAAAwAAABeAAAAagAAAA0AAAD/////HBcAAAUAAAAAAAAAAAAAAF8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8AAAAQAAAAyEgAAAAAAAAAAAAAAAAAAAIAAAAAAAAAAAAAAAAAAP//////AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAJxIAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA//////8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoAAABkAAAA6AMAABAnAACghgEAQEIPAICWmAAA4fUFX3CJAP8JLw8AAAAAAgAAAAMAAAAFAAAABwAAAAsAAAANAAAAEQAAABMAAAAXAAAAHQAAAB8AAAAlAAAAKQAAACsAAAAvAAAANQAAADsAAAA9AAAAQwAAAEcAAABJAAAATwAAAFMAAABZAAAAYQAAAGUAAABnAAAAawAAAG0AAABxAAAAfwAAAIMAAACJAAAAiwAAAJUAAACXAAAAnQAAAKMAAACnAAAArQAAALMAAAC1AAAAvwAAAMEAAADFAAAAxwAAANMAAAABAAAACwAAAA0AAAARAAAAEwAAABcAAAAdAAAAHwAAACUAAAApAAAAKwAAAC8AAAA1AAAAOwAAAD0AAABDAAAARwAAAEkAAABPAAAAUwAAAFkAAABhAAAAZQAAAGcAAABrAAAAbQAAAHEAAAB5AAAAfwAAAIMAAACJAAAAiwAAAI8AAACVAAAAlwAAAJ0AAACjAAAApwAAAKkAAACtAAAAswAAALUAAAC7AAAAvwAAAMEAAADFAAAAxwAAANEAAAACAAAAAAAAAPADAABtAAAAbgAAAG8AAABwAAAAEgAAAAEAAAABAAAAAwAAAAAAAAAYBAAAbQAAAHEAAABvAAAAcAAAABIAAAACAAAAAgAAAAQAAAAAAAAAKAQAAHIAAABzAAAAYAAAAAAAAAA4BAAAcgAAAHQAAABgAAAATjVkcmFjbzExRW5jb2RlckJhc2VJTlNfMThFbmNvZGVyT3B0aW9uc0Jhc2VJTlNfMTdHZW9tZXRyeUF0dHJpYnV0ZTRUeXBlRUVFRUUATjVkcmFjbzI4QXR0cmlidXRlT2N0YWhlZHJvblRyYW5zZm9ybUUATjVkcmFjbzE4QXR0cmlidXRlVHJhbnNmb3JtRQBONWRyYWNvMzBBdHRyaWJ1dGVRdWFudGl6YXRpb25UcmFuc2Zvcm1FAE41ZHJhY28xN0F0dHJpYnV0ZXNFbmNvZGVyRQBONWRyYWNvMjNLZFRyZWVBdHRyaWJ1dGVzRW5jb2RlckUATjVkcmFjbzI2U2VxdWVudGlhbEF0dHJpYnV0ZUVuY29kZXJFAE41ZHJhY28zN1NlcXVlbnRpYWxBdHRyaWJ1dGVFbmNvZGVyc0NvbnRyb2xsZXJFAE41ZHJhY28yOFByZWRpY3Rpb25TY2hlbWVEZWx0YUVuY29kZXJJaU5TXzM3UHJlZGljdGlvblNjaGVtZVdyYXBFbmNvZGluZ1RyYW5zZm9ybUlpaUVFRUUATjVkcmFjbzIzUHJlZGljdGlvblNjaGVtZUVuY29kZXJJaU5TXzM3UHJlZGljdGlvblNjaGVtZVdyYXBFbmNvZGluZ1RyYW5zZm9ybUlpaUVFRUUATjVkcmFjbzM3UHJlZGljdGlvblNjaGVtZVR5cGVkRW5jb2RlckludGVyZmFjZUlpaUVFAE41ZHJhY28zMlByZWRpY3Rpb25TY2hlbWVFbmNvZGVySW50ZXJmYWNlRQBONWRyYWNvMjVQcmVkaWN0aW9uU2NoZW1lSW50ZXJmYWNlRQBONWRyYWNvNDhNZXNoUHJlZGljdGlvblNjaGVtZUdlb21ldHJpY05vcm1hbFByZWRpY3RvckFyZWFJaU5TXzM3UHJlZGljdGlvblNjaGVtZVdyYXBFbmNvZGluZ1RyYW5zZm9ybUlpaUVFTlNfMjRNZXNoUHJlZGljdGlvblNjaGVtZURhdGFJTlNfMTFDb3JuZXJUYWJsZUVFRUVFAE41ZHJhY280OE1lc2hQcmVkaWN0aW9uU2NoZW1lR2VvbWV0cmljTm9ybWFsUHJlZGljdG9yQmFzZUlpTlNfMzdQcmVkaWN0aW9uU2NoZW1lV3JhcEVuY29kaW5nVHJhbnNmb3JtSWlpRUVOU18yNE1lc2hQcmVkaWN0aW9uU2NoZW1lRGF0YUlOU18xMUNvcm5lclRhYmxlRUVFRUUATjVkcmFjbzQyTWVzaFByZWRpY3Rpb25TY2hlbWVHZW9tZXRyaWNOb3JtYWxFbmNvZGVySWlOU18zN1ByZWRpY3Rpb25TY2hlbWVXcmFwRW5jb2RpbmdUcmFuc2Zvcm1JaWlFRU5TXzI0TWVzaFByZWRpY3Rpb25TY2hlbWVEYXRhSU5TXzExQ29ybmVyVGFibGVFRUVFRQBONWRyYWNvMjdNZXNoUHJlZGljdGlvblNjaGVtZUVuY29kZXJJaU5TXzM3UHJlZGljdGlvblNjaGVtZVdyYXBFbmNvZGluZ1RyYW5zZm9ybUlpaUVFTlNfMjRNZXNoUHJlZGljdGlvblNjaGVtZURhdGFJTlNfMTFDb3JuZXJUYWJsZUVFRUVFAE41ZHJhY280NE1lc2hQcmVkaWN0aW9uU2NoZW1lVGV4Q29vcmRzUG9ydGFibGVFbmNvZGVySWlOU18zN1ByZWRpY3Rpb25TY2hlbWVXcmFwRW5jb2RpbmdUcmFuc2Zvcm1JaWlFRU5TXzI0TWVzaFByZWRpY3Rpb25TY2hlbWVEYXRhSU5TXzExQ29ybmVyVGFibGVFRUVFRQBONWRyYWNvNTZNZXNoUHJlZGljdGlvblNjaGVtZUNvbnN0cmFpbmVkTXVsdGlQYXJhbGxlbG9ncmFtRW5jb2RlcklpTlNfMzdQcmVkaWN0aW9uU2NoZW1lV3JhcEVuY29kaW5nVHJhbnNmb3JtSWlpRUVOU18yNE1lc2hQcmVkaWN0aW9uU2NoZW1lRGF0YUlOU18xMUNvcm5lclRhYmxlRUVFRUUATjVkcmFjbzQwTWVzaFByZWRpY3Rpb25TY2hlbWVQYXJhbGxlbG9ncmFtRW5jb2RlcklpTlNfMzdQcmVkaWN0aW9uU2NoZW1lV3JhcEVuY29kaW5nVHJhbnNmb3JtSWlpRUVOU18yNE1lc2hQcmVkaWN0aW9uU2NoZW1lRGF0YUlOU18xMUNvcm5lclRhYmxlRUVFRUUATjVkcmFjbzQ4TWVzaFByZWRpY3Rpb25TY2hlbWVHZW9tZXRyaWNOb3JtYWxQcmVkaWN0b3JBcmVhSWlOU18zN1ByZWRpY3Rpb25TY2hlbWVXcmFwRW5jb2RpbmdUcmFuc2Zvcm1JaWlFRU5TXzI0TWVzaFByZWRpY3Rpb25TY2hlbWVEYXRhSU5TXzI0TWVzaEF0dHJpYnV0ZUNvcm5lclRhYmxlRUVFRUUATjVkcmFjbzQ4TWVzaFByZWRpY3Rpb25TY2hlbWVHZW9tZXRyaWNOb3JtYWxQcmVkaWN0b3JCYXNlSWlOU18zN1ByZWRpY3Rpb25TY2hlbWVXcmFwRW5jb2RpbmdUcmFuc2Zvcm1JaWlFRU5TXzI0TWVzaFByZWRpY3Rpb25TY2hlbWVEYXRhSU5TXzI0TWVzaEF0dHJpYnV0ZUNvcm5lclRhYmxlRUVFRUUATjVkcmFjbzQyTWVzaFByZWRpY3Rpb25TY2hlbWVHZW9tZXRyaWNOb3JtYWxFbmNvZGVySWlOU18zN1ByZWRpY3Rpb25TY2hlbWVXcmFwRW5jb2RpbmdUcmFuc2Zvcm1JaWlFRU5TXzI0TWVzaFByZWRpY3Rpb25TY2hlbWVEYXRhSU5TXzI0TWVzaEF0dHJpYnV0ZUNvcm5lclRhYmxlRUVFRUUATjVkcmFjbzI3TWVzaFByZWRpY3Rpb25TY2hlbWVFbmNvZGVySWlOU18zN1ByZWRpY3Rpb25TY2hlbWVXcmFwRW5jb2RpbmdUcmFuc2Zvcm1JaWlFRU5TXzI0TWVzaFByZWRpY3Rpb25TY2hlbWVEYXRhSU5TXzI0TWVzaEF0dHJpYnV0ZUNvcm5lclRhYmxlRUVFRUUATjVkcmFjbzQ0TWVzaFByZWRpY3Rpb25TY2hlbWVUZXhDb29yZHNQb3J0YWJsZUVuY29kZXJJaU5TXzM3UHJlZGljdGlvblNjaGVtZVdyYXBFbmNvZGluZ1RyYW5zZm9ybUlpaUVFTlNfMjRNZXNoUHJlZGljdGlvblNjaGVtZURhdGFJTlNfMjRNZXNoQXR0cmlidXRlQ29ybmVyVGFibGVFRUVFRQBONWRyYWNvNTZNZXNoUHJlZGljdGlvblNjaGVtZUNvbnN0cmFpbmVkTXVsdGlQYXJhbGxlbG9ncmFtRW5jb2RlcklpTlNfMzdQcmVkaWN0aW9uU2NoZW1lV3JhcEVuY29kaW5nVHJhbnNmb3JtSWlpRUVOU18yNE1lc2hQcmVkaWN0aW9uU2NoZW1lRGF0YUlOU18yNE1lc2hBdHRyaWJ1dGVDb3JuZXJUYWJsZUVFRUVFAE41ZHJhY280ME1lc2hQcmVkaWN0aW9uU2NoZW1lUGFyYWxsZWxvZ3JhbUVuY29kZXJJaU5TXzM3UHJlZGljdGlvblNjaGVtZVdyYXBFbmNvZGluZ1RyYW5zZm9ybUlpaUVFTlNfMjRNZXNoUHJlZGljdGlvblNjaGVtZURhdGFJTlNfMjRNZXNoQXR0cmlidXRlQ29ybmVyVGFibGVFRUVFRQB1c2VfYnVpbHRfaW5fYXR0cmlidXRlX2NvbXByZXNzaW9uAE41ZHJhY28zM1NlcXVlbnRpYWxJbnRlZ2VyQXR0cmlidXRlRW5jb2RlckUATjVkcmFjbzI4UHJlZGljdGlvblNjaGVtZURlbHRhRW5jb2RlcklpTlNfNjJQcmVkaWN0aW9uU2NoZW1lTm9ybWFsT2N0YWhlZHJvbkNhbm9uaWNhbGl6ZWRFbmNvZGluZ1RyYW5zZm9ybUlpRUVFRQBONWRyYWNvMjNQcmVkaWN0aW9uU2NoZW1lRW5jb2RlcklpTlNfNjJQcmVkaWN0aW9uU2NoZW1lTm9ybWFsT2N0YWhlZHJvbkNhbm9uaWNhbGl6ZWRFbmNvZGluZ1RyYW5zZm9ybUlpRUVFRQBONWRyYWNvNDhNZXNoUHJlZGljdGlvblNjaGVtZUdlb21ldHJpY05vcm1hbFByZWRpY3RvckFyZWFJaU5TXzYyUHJlZGljdGlvblNjaGVtZU5vcm1hbE9jdGFoZWRyb25DYW5vbmljYWxpemVkRW5jb2RpbmdUcmFuc2Zvcm1JaUVFTlNfMjRNZXNoUHJlZGljdGlvblNjaGVtZURhdGFJTlNfMTFDb3JuZXJUYWJsZUVFRUVFAE41ZHJhY280OE1lc2hQcmVkaWN0aW9uU2NoZW1lR2VvbWV0cmljTm9ybWFsUHJlZGljdG9yQmFzZUlpTlNfNjJQcmVkaWN0aW9uU2NoZW1lTm9ybWFsT2N0YWhlZHJvbkNhbm9uaWNhbGl6ZWRFbmNvZGluZ1RyYW5zZm9ybUlpRUVOU18yNE1lc2hQcmVkaWN0aW9uU2NoZW1lRGF0YUlOU18xMUNvcm5lclRhYmxlRUVFRUUATjVkcmFjbzQyTWVzaFByZWRpY3Rpb25TY2hlbWVHZW9tZXRyaWNOb3JtYWxFbmNvZGVySWlOU182MlByZWRpY3Rpb25TY2hlbWVOb3JtYWxPY3RhaGVkcm9uQ2Fub25pY2FsaXplZEVuY29kaW5nVHJhbnNmb3JtSWlFRU5TXzI0TWVzaFByZWRpY3Rpb25TY2hlbWVEYXRhSU5TXzExQ29ybmVyVGFibGVFRUVFRQBONWRyYWNvMjdNZXNoUHJlZGljdGlvblNjaGVtZUVuY29kZXJJaU5TXzYyUHJlZGljdGlvblNjaGVtZU5vcm1hbE9jdGFoZWRyb25DYW5vbmljYWxpemVkRW5jb2RpbmdUcmFuc2Zvcm1JaUVFTlNfMjRNZXNoUHJlZGljdGlvblNjaGVtZURhdGFJTlNfMTFDb3JuZXJUYWJsZUVFRUVFAE41ZHJhY280NE1lc2hQcmVkaWN0aW9uU2NoZW1lVGV4Q29vcmRzUG9ydGFibGVFbmNvZGVySWlOU182MlByZWRpY3Rpb25TY2hlbWVOb3JtYWxPY3RhaGVkcm9uQ2Fub25pY2FsaXplZEVuY29kaW5nVHJhbnNmb3JtSWlFRU5TXzI0TWVzaFByZWRpY3Rpb25TY2hlbWVEYXRhSU5TXzExQ29ybmVyVGFibGVFRUVFRQBONWRyYWNvNTZNZXNoUHJlZGljdGlvblNjaGVtZUNvbnN0cmFpbmVkTXVsdGlQYXJhbGxlbG9ncmFtRW5jb2RlcklpTlNfNjJQcmVkaWN0aW9uU2NoZW1lTm9ybWFsT2N0YWhlZHJvbkNhbm9uaWNhbGl6ZWRFbmNvZGluZ1RyYW5zZm9ybUlpRUVOU18yNE1lc2hQcmVkaWN0aW9uU2NoZW1lRGF0YUlOU18xMUNvcm5lclRhYmxlRUVFRUUATjVkcmFjbzQwTWVzaFByZWRpY3Rpb25TY2hlbWVQYXJhbGxlbG9ncmFtRW5jb2RlcklpTlNfNjJQcmVkaWN0aW9uU2NoZW1lTm9ybWFsT2N0YWhlZHJvbkNhbm9uaWNhbGl6ZWRFbmNvZGluZ1RyYW5zZm9ybUlpRUVOU18yNE1lc2hQcmVkaWN0aW9uU2NoZW1lRGF0YUlOU18xMUNvcm5lclRhYmxlRUVFRUUATjVkcmFjbzQ4TWVzaFByZWRpY3Rpb25TY2hlbWVHZW9tZXRyaWNOb3JtYWxQcmVkaWN0b3JBcmVhSWlOU182MlByZWRpY3Rpb25TY2hlbWVOb3JtYWxPY3RhaGVkcm9uQ2Fub25pY2FsaXplZEVuY29kaW5nVHJhbnNmb3JtSWlFRU5TXzI0TWVzaFByZWRpY3Rpb25TY2hlbWVEYXRhSU5TXzI0TWVzaEF0dHJpYnV0ZUNvcm5lclRhYmxlRUVFRUUATjVkcmFjbzQ4TWVzaFByZWRpY3Rpb25TY2hlbWVHZW9tZXRyaWNOb3JtYWxQcmVkaWN0b3JCYXNlSWlOU182MlByZWRpY3Rpb25TY2hlbWVOb3JtYWxPY3RhaGVkcm9uQ2Fub25pY2FsaXplZEVuY29kaW5nVHJhbnNmb3JtSWlFRU5TXzI0TWVzaFByZWRpY3Rpb25TY2hlbWVEYXRhSU5TXzI0TWVzaEF0dHJpYnV0ZUNvcm5lclRhYmxlRUVFRUUATjVkcmFjbzQyTWVzaFByZWRpY3Rpb25TY2hlbWVHZW9tZXRyaWNOb3JtYWxFbmNvZGVySWlOU182MlByZWRpY3Rpb25TY2hlbWVOb3JtYWxPY3RhaGVkcm9uQ2Fub25pY2FsaXplZEVuY29kaW5nVHJhbnNmb3JtSWlFRU5TXzI0TWVzaFByZWRpY3Rpb25TY2hlbWVEYXRhSU5TXzI0TWVzaEF0dHJpYnV0ZUNvcm5lclRhYmxlRUVFRUUATjVkcmFjbzI3TWVzaFByZWRpY3Rpb25TY2hlbWVFbmNvZGVySWlOU182MlByZWRpY3Rpb25TY2hlbWVOb3JtYWxPY3RhaGVkcm9uQ2Fub25pY2FsaXplZEVuY29kaW5nVHJhbnNmb3JtSWlFRU5TXzI0TWVzaFByZWRpY3Rpb25TY2hlbWVEYXRhSU5TXzI0TWVzaEF0dHJpYnV0ZUNvcm5lclRhYmxlRUVFRUUATjVkcmFjbzQ0TWVzaFByZWRpY3Rpb25TY2hlbWVUZXhDb29yZHNQb3J0YWJsZUVuY29kZXJJaU5TXzYyUHJlZGljdGlvblNjaGVtZU5vcm1hbE9jdGFoZWRyb25DYW5vbmljYWxpemVkRW5jb2RpbmdUcmFuc2Zvcm1JaUVFTlNfMjRNZXNoUHJlZGljdGlvblNjaGVtZURhdGFJTlNfMjRNZXNoQXR0cmlidXRlQ29ybmVyVGFibGVFRUVFRQBONWRyYWNvNTZNZXNoUHJlZGljdGlvblNjaGVtZUNvbnN0cmFpbmVkTXVsdGlQYXJhbGxlbG9ncmFtRW5jb2RlcklpTlNfNjJQcmVkaWN0aW9uU2NoZW1lTm9ybWFsT2N0YWhlZHJvbkNhbm9uaWNhbGl6ZWRFbmNvZGluZ1RyYW5zZm9ybUlpRUVOU18yNE1lc2hQcmVkaWN0aW9uU2NoZW1lRGF0YUlOU18yNE1lc2hBdHRyaWJ1dGVDb3JuZXJUYWJsZUVFRUVFAE41ZHJhY280ME1lc2hQcmVkaWN0aW9uU2NoZW1lUGFyYWxsZWxvZ3JhbUVuY29kZXJJaU5TXzYyUHJlZGljdGlvblNjaGVtZU5vcm1hbE9jdGFoZWRyb25DYW5vbmljYWxpemVkRW5jb2RpbmdUcmFuc2Zvcm1JaUVFTlNfMjRNZXNoUHJlZGljdGlvblNjaGVtZURhdGFJTlNfMjRNZXNoQXR0cmlidXRlQ29ybmVyVGFibGVFRUVFRQBONWRyYWNvMzJTZXF1ZW50aWFsTm9ybWFsQXR0cmlidXRlRW5jb2RlckUATjVkcmFjbzM4U2VxdWVudGlhbFF1YW50aXphdGlvbkF0dHJpYnV0ZUVuY29kZXJFAHByZWRpY3Rpb25fc2NoZW1lAE41ZHJhY28xMUVuY29kZXJCYXNlSU5TXzE4RW5jb2Rlck9wdGlvbnNCYXNlSWlFRUVFAE41ZHJhY283RW5jb2RlckUAIABONWRyYWNvMTNFeHBlcnRFbmNvZGVyRQBlbmNvZGluZ19tZXRob2QAcXVhbnRpemF0aW9uX2JpdHMASW52YWxpZCBlbmNvZGluZyBtZXRob2QuAGVuY29kaW5nX3NwZWVkAGRlY29kaW5nX3NwZWVkAHF1YW50aXphdGlvbl9vcmlnaW4AcXVhbnRpemF0aW9uX3JhbmdlAHN5bWJvbF9lbmNvZGluZ19tZXRob2QAc3ltYm9sX2VuY29kaW5nX2NvbXByZXNzaW9uX2xldmVsAHN0YW5kYXJkX2VkZ2VicmVha2VyAHByZWRpY3RpdmVfZWRnZWJyZWFrZXIAZWRnZWJyZWFrZXJfbWV0aG9kAE41ZHJhY28yMk1lc2hFZGdlYnJlYWtlckVuY29kZXJFAEFsbCB0cmlhbmdsZXMgYXJlIGRlZ2VuZXJhdGUuAEZhaWxlZCB0byBwcm9jZXNzIG1lc2ggaG9sZXMuAEZhaWxlZCB0byBpbml0aWFsaXplIGF0dHJpYnV0ZSBkYXRhLgBGYWlsZWQgdG8gZW5jb2RlIG1lc2ggY29tcG9uZW50LgBGYWlsZWQgdG8gZW5jb2RlIHNwbGl0IGRhdGEuAE41ZHJhY28xM1RyYXZlcnNlckJhc2VJTlNfMjRNZXNoQXR0cmlidXRlQ29ybmVyVGFibGVFTlNfMzZNZXNoQXR0cmlidXRlSW5kaWNlc0VuY29kaW5nT2JzZXJ2ZXJJUzFfRUVFRQBONWRyYWNvMTlEZXB0aEZpcnN0VHJhdmVyc2VySU5TXzI0TWVzaEF0dHJpYnV0ZUNvcm5lclRhYmxlRU5TXzM2TWVzaEF0dHJpYnV0ZUluZGljZXNFbmNvZGluZ09ic2VydmVySVMxX0VFRUUATjVkcmFjbzIyTWVzaFRyYXZlcnNhbFNlcXVlbmNlcklOU18xOURlcHRoRmlyc3RUcmF2ZXJzZXJJTlNfMjRNZXNoQXR0cmlidXRlQ29ybmVyVGFibGVFTlNfMzZNZXNoQXR0cmlidXRlSW5kaWNlc0VuY29kaW5nT2JzZXJ2ZXJJUzJfRUVFRUVFAE41ZHJhY28xNVBvaW50c1NlcXVlbmNlckUATjVkcmFjbzEzVHJhdmVyc2VyQmFzZUlOU18xMUNvcm5lclRhYmxlRU5TXzM2TWVzaEF0dHJpYnV0ZUluZGljZXNFbmNvZGluZ09ic2VydmVySVMxX0VFRUUATjVkcmFjbzE5RGVwdGhGaXJzdFRyYXZlcnNlcklOU18xMUNvcm5lclRhYmxlRU5TXzM2TWVzaEF0dHJpYnV0ZUluZGljZXNFbmNvZGluZ09ic2VydmVySVMxX0VFRUUATjVkcmFjbzIyTWVzaFRyYXZlcnNhbFNlcXVlbmNlcklOU18xOURlcHRoRmlyc3RUcmF2ZXJzZXJJTlNfMTFDb3JuZXJUYWJsZUVOU18zNk1lc2hBdHRyaWJ1dGVJbmRpY2VzRW5jb2RpbmdPYnNlcnZlcklTMl9FRUVFRUUATjVkcmFjbzI4TWF4UHJlZGljdGlvbkRlZ3JlZVRyYXZlcnNlcklOU18xMUNvcm5lclRhYmxlRU5TXzM2TWVzaEF0dHJpYnV0ZUluZGljZXNFbmNvZGluZ09ic2VydmVySVMxX0VFRUUATjVkcmFjbzIyTWVzaFRyYXZlcnNhbFNlcXVlbmNlcklOU18yOE1heFByZWRpY3Rpb25EZWdyZWVUcmF2ZXJzZXJJTlNfMTFDb3JuZXJUYWJsZUVOU18zNk1lc2hBdHRyaWJ1dGVJbmRpY2VzRW5jb2RpbmdPYnNlcnZlcklTMl9FRUVFRUUAc3BsaXRfbWVzaF9vbl9zZWFtcwBONWRyYWNvMjZNZXNoRWRnZWJyZWFrZXJFbmNvZGVySW1wbElOU18zMU1lc2hFZGdlYnJlYWtlclRyYXZlcnNhbEVuY29kZXJFRUUATjVkcmFjbzM1TWVzaEVkZ2VicmVha2VyRW5jb2RlckltcGxJbnRlcmZhY2VFAE41ZHJhY28yNk1lc2hFZGdlYnJlYWtlckVuY29kZXJJbXBsSU5TXzM4TWVzaEVkZ2VicmVha2VyVHJhdmVyc2FsVmFsZW5jZUVuY29kZXJFRUUAc3RvcmVfbnVtYmVyX29mX2VuY29kZWRfZmFjZXMATjVkcmFjbzExTWVzaEVuY29kZXJFAGNvbXByZXNzX2Nvbm5lY3Rpdml0eQBONWRyYWNvMTVMaW5lYXJTZXF1ZW5jZXJFAE41ZHJhY28yMU1lc2hTZXF1ZW50aWFsRW5jb2RlckUATjVkcmFjbzE3UG9pbnRDbG91ZEVuY29kZXJFAEludmFsaWQgaW5wdXQgZ2VvbWV0cnkuAEZhaWxlZCB0byBpbml0aWFsaXplIGVuY29kZXIuAEZhaWxlZCB0byBlbmNvZGUgaW50ZXJuYWwgZGF0YS4ARmFpbGVkIHRvIGVuY29kZSBwb2ludCBhdHRyaWJ1dGVzLgBzdG9yZV9udW1iZXJfb2ZfZW5jb2RlZF9wb2ludHMARmFpbGVkIHRvIGVuY29kZSBtZXRhZGF0YS4ARFJBQ08ATjVkcmFjbzIzUG9pbnRDbG91ZEtkVHJlZUVuY29kZXJFAE41ZHJhY28yN1BvaW50Q2xvdWRTZXF1ZW50aWFsRW5jb2RlckUATjVkcmFjbzRNZXNoRQBhbGxvY2F0b3I8VD46OmFsbG9jYXRlKHNpemVfdCBuKSAnbicgZXhjZWVkcyBtYXhpbXVtIHN1cHBvcnRlZCBzaXplAE41ZHJhY28xMFBvaW50Q2xvdWRFABEACgAREREAAAAABQAAAAAAAAkAAAAACwAAAAAAAAAAEQAPChEREQMKBwABEwkLCwAACQYLAAALAAYRAAAAERERAAAAAAAAAAAAAAAAAAAAAAsAAAAAAAAAABEACgoREREACgAAAgAJCwAAAAkACwAACwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAMAAAAAAAAAAAAAAAMAAAAAAwAAAAACQwAAAAAAAwAAAwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADgAAAAAAAAAAAAAADQAAAAQNAAAAAAkOAAAAAAAOAAAOAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAAAAAAAAAAAAAAAA8AAAAADwAAAAAJEAAAAAAAEAAAEAAAEgAAABISEgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAASAAAAEhISAAAAAAAACQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACwAAAAAAAAAAAAAACgAAAAAKAAAAAAkLAAAAAAALAAALAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwAAAAAAAAAAAAAAAwAAAAADAAAAAAJDAAAAAAADAAADAAALSsgICAwWDB4AChudWxsKQAtMFgrMFggMFgtMHgrMHggMHgAaW5mAElORgBOQU4AMDEyMzQ1Njc4OUFCQ0RFRi4AVCEiGQ0BAgMRSxwMEAQLHRIeJ2hub3BxYiAFBg8TFBUaCBYHKCQXGAkKDhsfJSODgn0mKis8PT4/Q0dKTVhZWltcXV5fYGFjZGVmZ2lqa2xyc3R5ent8AElsbGVnYWwgYnl0ZSBzZXF1ZW5jZQBEb21haW4gZXJyb3IAUmVzdWx0IG5vdCByZXByZXNlbnRhYmxlAE5vdCBhIHR0eQBQZXJtaXNzaW9uIGRlbmllZABPcGVyYXRpb24gbm90IHBlcm1pdHRlZABObyBzdWNoIGZpbGUgb3IgZGlyZWN0b3J5AE5vIHN1Y2ggcHJvY2VzcwBGaWxlIGV4aXN0cwBWYWx1ZSB0b28gbGFyZ2UgZm9yIGRhdGEgdHlwZQBObyBzcGFjZSBsZWZ0IG9uIGRldmljZQBPdXQgb2YgbWVtb3J5AFJlc291cmNlIGJ1c3kASW50ZXJydXB0ZWQgc3lzdGVtIGNhbGwAUmVzb3VyY2UgdGVtcG9yYXJpbHkgdW5hdmFpbGFibGUASW52YWxpZCBzZWVrAENyb3NzLWRldmljZSBsaW5rAFJlYWQtb25seSBmaWxlIHN5c3RlbQBEaXJlY3Rvcnkgbm90IGVtcHR5AENvbm5lY3Rpb24gcmVzZXQgYnkgcGVlcgBPcGVyYXRpb24gdGltZWQgb3V0AENvbm5lY3Rpb24gcmVmdXNlZABIb3N0IGlzIGRvd24ASG9zdCBpcyB1bnJlYWNoYWJsZQBBZGRyZXNzIGluIHVzZQBCcm9rZW4gcGlwZQBJL08gZXJyb3IATm8gc3VjaCBkZXZpY2Ugb3IgYWRkcmVzcwBCbG9jayBkZXZpY2UgcmVxdWlyZWQATm8gc3VjaCBkZXZpY2UATm90IGEgZGlyZWN0b3J5AElzIGEgZGlyZWN0b3J5AFRleHQgZmlsZSBidXN5AEV4ZWMgZm9ybWF0IGVycm9yAEludmFsaWQgYXJndW1lbnQAQXJndW1lbnQgbGlzdCB0b28gbG9uZwBTeW1ib2xpYyBsaW5rIGxvb3AARmlsZW5hbWUgdG9vIGxvbmcAVG9vIG1hbnkgb3BlbiBmaWxlcyBpbiBzeXN0ZW0ATm8gZmlsZSBkZXNjcmlwdG9ycyBhdmFpbGFibGUAQmFkIGZpbGUgZGVzY3JpcHRvcgBObyBjaGlsZCBwcm9jZXNzAEJhZCBhZGRyZXNzAEZpbGUgdG9vIGxhcmdlAFRvbyBtYW55IGxpbmtzAE5vIGxvY2tzIGF2YWlsYWJsZQBSZXNvdXJjZSBkZWFkbG9jayB3b3VsZCBvY2N1cgBTdGF0ZSBub3QgcmVjb3ZlcmFibGUAUHJldmlvdXMgb3duZXIgZGllZABPcGVyYXRpb24gY2FuY2VsZWQARnVuY3Rpb24gbm90IGltcGxlbWVudGVkAE5vIG1lc3NhZ2Ugb2YgZGVzaXJlZCB0eXBlAElkZW50aWZpZXIgcmVtb3ZlZABEZXZpY2Ugbm90IGEgc3RyZWFtAE5vIGRhdGEgYXZhaWxhYmxlAERldmljZSB0aW1lb3V0AE91dCBvZiBzdHJlYW1zIHJlc291cmNlcwBMaW5rIGhhcyBiZWVuIHNldmVyZWQAUHJvdG9jb2wgZXJyb3IAQmFkIG1lc3NhZ2UARmlsZSBkZXNjcmlwdG9yIGluIGJhZCBzdGF0ZQBOb3QgYSBzb2NrZXQARGVzdGluYXRpb24gYWRkcmVzcyByZXF1aXJlZABNZXNzYWdlIHRvbyBsYXJnZQBQcm90b2NvbCB3cm9uZyB0eXBlIGZvciBzb2NrZXQAUHJvdG9jb2wgbm90IGF2YWlsYWJsZQBQcm90b2NvbCBub3Qgc3VwcG9ydGVkAFNvY2tldCB0eXBlIG5vdCBzdXBwb3J0ZWQATm90IHN1cHBvcnRlZABQcm90b2NvbCBmYW1pbHkgbm90IHN1cHBvcnRlZABBZGRyZXNzIGZhbWlseSBub3Qgc3VwcG9ydGVkIGJ5IHByb3RvY29sAEFkZHJlc3Mgbm90IGF2YWlsYWJsZQBOZXR3b3JrIGlzIGRvd24ATmV0d29yayB1bnJlYWNoYWJsZQBDb25uZWN0aW9uIHJlc2V0IGJ5IG5ldHdvcmsAQ29ubmVjdGlvbiBhYm9ydGVkAE5vIGJ1ZmZlciBzcGFjZSBhdmFpbGFibGUAU29ja2V0IGlzIGNvbm5lY3RlZABTb2NrZXQgbm90IGNvbm5lY3RlZABDYW5ub3Qgc2VuZCBhZnRlciBzb2NrZXQgc2h1dGRvd24AT3BlcmF0aW9uIGFscmVhZHkgaW4gcHJvZ3Jlc3MAT3BlcmF0aW9uIGluIHByb2dyZXNzAFN0YWxlIGZpbGUgaGFuZGxlAFJlbW90ZSBJL08gZXJyb3IAUXVvdGEgZXhjZWVkZWQATm8gbWVkaXVtIGZvdW5kAFdyb25nIG1lZGl1bSB0eXBlAE5vIGVycm9yIGluZm9ybWF0aW9uAABpbmZpbml0eQBuYW4AJWQAJWYAdGVybWluYXRpbmcgd2l0aCAlcyBleGNlcHRpb24gb2YgdHlwZSAlczogJXMAdGVybWluYXRpbmcgd2l0aCAlcyBleGNlcHRpb24gb2YgdHlwZSAlcwB0ZXJtaW5hdGluZyB3aXRoICVzIGZvcmVpZ24gZXhjZXB0aW9uAHRlcm1pbmF0aW5nAHVuY2F1Z2h0AFN0OWV4Y2VwdGlvbgBOMTBfX2N4eGFiaXYxMTZfX3NoaW1fdHlwZV9pbmZvRQBTdDl0eXBlX2luZm8ATjEwX19jeHhhYml2MTIwX19zaV9jbGFzc190eXBlX2luZm9FAE4xMF9fY3h4YWJpdjExN19fY2xhc3NfdHlwZV9pbmZvRQBwdGhyZWFkX29uY2UgZmFpbHVyZSBpbiBfX2N4YV9nZXRfZ2xvYmFsc19mYXN0KCkAY2Fubm90IGNyZWF0ZSBwdGhyZWFkIGtleSBmb3IgX19jeGFfZ2V0X2dsb2JhbHMoKQBjYW5ub3QgemVybyBvdXQgdGhyZWFkIHZhbHVlIGZvciBfX2N4YV9nZXRfZ2xvYmFscygpAHRlcm1pbmF0ZV9oYW5kbGVyIHVuZXhwZWN0ZWRseSByZXR1cm5lZABTdDExbG9naWNfZXJyb3IAU3QxMmxlbmd0aF9lcnJvcgBOMTBfX2N4eGFiaXYxMTlfX3BvaW50ZXJfdHlwZV9pbmZvRQBOMTBfX2N4eGFiaXYxMTdfX3BiYXNlX3R5cGVfaW5mb0U='
    var tempDoublePtr = STATICTOP
    STATICTOP += 16
    function ___cxa_allocate_exception(size) {
        return _malloc(size)
    }
    function __ZSt18uncaught_exceptionv() {
        return !!__ZSt18uncaught_exceptionv.uncaught_exception
    }
    var EXCEPTIONS = {
        last: 0,
        caught: [],
        infos: {},
        deAdjust: function (adjusted) {
            if (!adjusted || EXCEPTIONS.infos[adjusted]) return adjusted
            for (var ptr in EXCEPTIONS.infos) {
                var info = EXCEPTIONS.infos[ptr]
                if (info.adjusted === 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]
            assert(info.refcount > 0)
            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 ___cxa_begin_catch(ptr) {
        var info = EXCEPTIONS.infos[ptr]
        if (info && !info.caught) {
            info.caught = true
            __ZSt18uncaught_exceptionv.uncaught_exception--
        }
        if (info) info.rethrown = false
        EXCEPTIONS.caught.push(ptr)
        EXCEPTIONS.addRef(EXCEPTIONS.deAdjust(ptr))
        return ptr
    }
    function ___cxa_pure_virtual() {
        ABORT = true
        throw 'Pure virtual function called!'
    }
    function ___resumeException(ptr) {
        if (!EXCEPTIONS.last) {
            EXCEPTIONS.last = ptr
        }
        throw ptr + ' - Exception catching is disabled, this exception cannot be caught. Compile with -s DISABLE_EXCEPTION_CATCHING=0 or DISABLE_EXCEPTION_CATCHING=2 to catch.'
    }
    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 = thrown
                return (setTempRet0(typeArray[i]), thrown) | 0
            }
        }
        thrown = HEAP32[thrown >> 2]
        return (setTempRet0(throwntype), thrown) | 0
    }
    function ___cxa_throw(ptr, type, destructor) {
        EXCEPTIONS.infos[ptr] = { ptr: ptr, adjusted: ptr, type: type, destructor: destructor, refcount: 0, caught: false, rethrown: false }
        EXCEPTIONS.last = ptr
        if (!('uncaught_exception' in __ZSt18uncaught_exceptionv)) {
            __ZSt18uncaught_exceptionv.uncaught_exception = 1
        } else {
            __ZSt18uncaught_exceptionv.uncaught_exception++
        }
        throw ptr + ' - Exception catching is disabled, this exception cannot be caught. Compile with -s DISABLE_EXCEPTION_CATCHING=0 or DISABLE_EXCEPTION_CATCHING=2 to catch.'
    }
    var cttz_i8 = allocate(
        [
            8, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1,
            0, 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0,
            1, 0, 7, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2,
            0, 1, 0, 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0,
            2, 0, 1, 0,
        ],
        'i8',
        ALLOC_STATIC
    )
    function ___gxx_personality_v0() {}
    var SYSCALLS = {
        varargs: 0,
        get: function (varargs) {
            SYSCALLS.varargs += 4
            var ret = HEAP32[(SYSCALLS.varargs - 4) >> 2]
            return ret
        },
        getStr: function () {
            var ret = Pointer_stringify(SYSCALLS.get())
            return ret
        },
        get64: function () {
            var low = SYSCALLS.get(),
                high = SYSCALLS.get()
            if (low >= 0) assert(high === 0)
            else assert(high === -1)
            return low
        },
        getZero: function () {
            assert(SYSCALLS.get() === 0)
        },
    }
    function ___syscall140(which, varargs) {
        SYSCALLS.varargs = varargs
        try {
            var stream = SYSCALLS.getStreamFromFD(),
                offset_high = SYSCALLS.get(),
                offset_low = SYSCALLS.get(),
                result = SYSCALLS.get(),
                whence = SYSCALLS.get()
            var offset = offset_low
            FS.llseek(stream, offset, whence)
            HEAP32[result >> 2] = stream.position
            if (stream.getdents && offset === 0 && whence === 0) stream.getdents = null
            return 0
        } catch (e) {
            if (typeof FS === 'undefined' || !(e instanceof FS.ErrnoError)) abort(e)
            return -e.errno
        }
    }
    function flush_NO_FILESYSTEM() {
        var fflush = Module['_fflush']
        if (fflush) fflush(0)
        var printChar = ___syscall146.printChar
        if (!printChar) return
        var buffers = ___syscall146.buffers
        if (buffers[1].length) printChar(1, 10)
        if (buffers[2].length) printChar(2, 10)
    }
    function ___syscall146(which, varargs) {
        SYSCALLS.varargs = varargs
        try {
            var stream = SYSCALLS.get(),
                iov = SYSCALLS.get(),
                iovcnt = SYSCALLS.get()
            var ret = 0
            if (!___syscall146.buffers) {
                ___syscall146.buffers = [null, [], []]
                ___syscall146.printChar = function (stream, curr) {
                    var buffer = ___syscall146.buffers[stream]
                    assert(buffer)
                    if (curr === 0 || curr === 10) {
                        ;(stream === 1 ? Module['print'] : Module['printErr'])(UTF8ArrayToString(buffer, 0))
                        buffer.length = 0
                    } else {
                        buffer.push(curr)
                    }
                }
            }
            for (var i = 0; i < iovcnt; i++) {
                var ptr = HEAP32[(iov + i * 8) >> 2]
                var len = HEAP32[(iov + (i * 8 + 4)) >> 2]
                for (var j = 0; j < len; j++) {
                    ___syscall146.printChar(stream, HEAPU8[ptr + j])
                }
                ret += len
            }
            return ret
        } catch (e) {
            if (typeof FS === 'undefined' || !(e instanceof FS.ErrnoError)) abort(e)
            return -e.errno
        }
    }
    function ___syscall6(which, varargs) {
        SYSCALLS.varargs = varargs
        try {
            var stream = SYSCALLS.getStreamFromFD()
            FS.close(stream)
            return 0
        } catch (e) {
            if (typeof FS === 'undefined' || !(e instanceof FS.ErrnoError)) abort(e)
            return -e.errno
        }
    }
    function _abort() {
        Module['abort']()
    }
    var _llvm_ceil_f64 = Math_ceil
    var _llvm_fabs_f64 = Math_abs
    var _llvm_floor_f64 = Math_floor
    function _llvm_trap() {
        abort('trap!')
    }
    function _emscripten_memcpy_big(dest, src, num) {
        HEAPU8.set(HEAPU8.subarray(src, src + num), dest)
        return dest
    }
    var PTHREAD_SPECIFIC = {}
    function _pthread_getspecific(key) {
        return PTHREAD_SPECIFIC[key] || 0
    }
    var PTHREAD_SPECIFIC_NEXT_KEY = 1
    var ERRNO_CODES = {
        EPERM: 1,
        ENOENT: 2,
        ESRCH: 3,
        EINTR: 4,
        EIO: 5,
        ENXIO: 6,
        E2BIG: 7,
        ENOEXEC: 8,
        EBADF: 9,
        ECHILD: 10,
        EAGAIN: 11,
        EWOULDBLOCK: 11,
        ENOMEM: 12,
        EACCES: 13,
        EFAULT: 14,
        ENOTBLK: 15,
        EBUSY: 16,
        EEXIST: 17,
        EXDEV: 18,
        ENODEV: 19,
        ENOTDIR: 20,
        EISDIR: 21,
        EINVAL: 22,
        ENFILE: 23,
        EMFILE: 24,
        ENOTTY: 25,
        ETXTBSY: 26,
        EFBIG: 27,
        ENOSPC: 28,
        ESPIPE: 29,
        EROFS: 30,
        EMLINK: 31,
        EPIPE: 32,
        EDOM: 33,
        ERANGE: 34,
        ENOMSG: 42,
        EIDRM: 43,
        ECHRNG: 44,
        EL2NSYNC: 45,
        EL3HLT: 46,
        EL3RST: 47,
        ELNRNG: 48,
        EUNATCH: 49,
        ENOCSI: 50,
        EL2HLT: 51,
        EDEADLK: 35,
        ENOLCK: 37,
        EBADE: 52,
        EBADR: 53,
        EXFULL: 54,
        ENOANO: 55,
        EBADRQC: 56,
        EBADSLT: 57,
        EDEADLOCK: 35,
        EBFONT: 59,
        ENOSTR: 60,
        ENODATA: 61,
        ETIME: 62,
        ENOSR: 63,
        ENONET: 64,
        ENOPKG: 65,
        EREMOTE: 66,
        ENOLINK: 67,
        EADV: 68,
        ESRMNT: 69,
        ECOMM: 70,
        EPROTO: 71,
        EMULTIHOP: 72,
        EDOTDOT: 73,
        EBADMSG: 74,
        ENOTUNIQ: 76,
        EBADFD: 77,
        EREMCHG: 78,
        ELIBACC: 79,
        ELIBBAD: 80,
        ELIBSCN: 81,
        ELIBMAX: 82,
        ELIBEXEC: 83,
        ENOSYS: 38,
        ENOTEMPTY: 39,
        ENAMETOOLONG: 36,
        ELOOP: 40,
        EOPNOTSUPP: 95,
        EPFNOSUPPORT: 96,
        ECONNRESET: 104,
        ENOBUFS: 105,
        EAFNOSUPPORT: 97,
        EPROTOTYPE: 91,
        ENOTSOCK: 88,
        ENOPROTOOPT: 92,
        ESHUTDOWN: 108,
        ECONNREFUSED: 111,
        EADDRINUSE: 98,
        ECONNABORTED: 103,
        ENETUNREACH: 101,
        ENETDOWN: 100,
        ETIMEDOUT: 110,
        EHOSTDOWN: 112,
        EHOSTUNREACH: 113,
        EINPROGRESS: 115,
        EALREADY: 114,
        EDESTADDRREQ: 89,
        EMSGSIZE: 90,
        EPROTONOSUPPORT: 93,
        ESOCKTNOSUPPORT: 94,
        EADDRNOTAVAIL: 99,
        ENETRESET: 102,
        EISCONN: 106,
        ENOTCONN: 107,
        ETOOMANYREFS: 109,
        EUSERS: 87,
        EDQUOT: 122,
        ESTALE: 116,
        ENOTSUP: 95,
        ENOMEDIUM: 123,
        EILSEQ: 84,
        EOVERFLOW: 75,
        ECANCELED: 125,
        ENOTRECOVERABLE: 131,
        EOWNERDEAD: 130,
        ESTRPIPE: 86,
    }
    function _pthread_key_create(key, destructor) {
        if (key == 0) {
            return ERRNO_CODES.EINVAL
        }
        HEAP32[key >> 2] = PTHREAD_SPECIFIC_NEXT_KEY
        PTHREAD_SPECIFIC[PTHREAD_SPECIFIC_NEXT_KEY] = 0
        PTHREAD_SPECIFIC_NEXT_KEY++
        return 0
    }
    function _pthread_once(ptr, func) {
        if (!_pthread_once.seen) _pthread_once.seen = {}
        if (ptr in _pthread_once.seen) return
        Module['dynCall_v'](func)
        _pthread_once.seen[ptr] = 1
    }
    function _pthread_setspecific(key, value) {
        if (!(key in PTHREAD_SPECIFIC)) {
            return ERRNO_CODES.EINVAL
        }
        PTHREAD_SPECIFIC[key] = value
        return 0
    }
    function ___setErrNo(value) {
        if (Module['___errno_location']) HEAP32[Module['___errno_location']() >> 2] = value
        return value
    }
    DYNAMICTOP_PTR = staticAlloc(4)
    STACK_BASE = STACKTOP = alignMemory(STATICTOP)
    STACK_MAX = STACK_BASE + TOTAL_STACK
    DYNAMIC_BASE = alignMemory(STACK_MAX)
    HEAP32[DYNAMICTOP_PTR >> 2] = DYNAMIC_BASE
    staticSealed = true
    var ASSERTIONS = false
    function intArrayFromString(stringy, dontAddNull, length) {
        var len = length > 0 ? length : lengthBytesUTF8(stringy) + 1
        var u8array = new Array(len)
        var numBytesWritten = stringToUTF8Array(stringy, u8array, 0, u8array.length)
        if (dontAddNull) u8array.length = numBytesWritten
        return u8array
    }
    function intArrayToString(array) {
        var ret = []
        for (var i = 0; i < array.length; i++) {
            var chr = array[i]
            if (chr > 255) {
                if (ASSERTIONS) {
                    assert(false, 'Character code ' + chr + ' (' + String.fromCharCode(chr) + ')  at offset ' + i + ' not in 0x00-0xFF.')
                }
                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))
    }
    function invoke_ii(index, a1) {
        try {
            return Module['dynCall_ii'](index, a1)
        } catch (e) {
            if (typeof e !== 'number' && e !== 'longjmp') throw e
            Module['setThrew'](1, 0)
        }
    }
    function invoke_iii(index, a1, a2) {
        try {
            return Module['dynCall_iii'](index, a1, a2)
        } catch (e) {
            if (typeof e !== 'number' && e !== 'longjmp') throw e
            Module['setThrew'](1, 0)
        }
    }
    function invoke_iiii(index, a1, a2, a3) {
        try {
            return Module['dynCall_iiii'](index, a1, a2, a3)
        } catch (e) {
            if (typeof e !== 'number' && e !== 'longjmp') throw e
            Module['setThrew'](1, 0)
        }
    }
    function invoke_iiiiiii(index, a1, a2, a3, a4, a5, a6) {
        try {
            return Module['dynCall_iiiiiii'](index, a1, a2, a3, a4, a5, a6)
        } catch (e) {
            if (typeof e !== 'number' && e !== 'longjmp') throw e
            Module['setThrew'](1, 0)
        }
    }
    function invoke_v(index) {
        try {
            Module['dynCall_v'](index)
        } catch (e) {
            if (typeof e !== 'number' && e !== 'longjmp') throw e
            Module['setThrew'](1, 0)
        }
    }
    function invoke_vi(index, a1) {
        try {
            Module['dynCall_vi'](index, a1)
        } catch (e) {
            if (typeof e !== 'number' && e !== 'longjmp') throw e
            Module['setThrew'](1, 0)
        }
    }
    function invoke_vii(index, a1, a2) {
        try {
            Module['dynCall_vii'](index, a1, a2)
        } catch (e) {
            if (typeof e !== 'number' && e !== 'longjmp') throw e
            Module['setThrew'](1, 0)
        }
    }
    function invoke_viii(index, a1, a2, a3) {
        try {
            Module['dynCall_viii'](index, a1, a2, a3)
        } catch (e) {
            if (typeof e !== 'number' && e !== 'longjmp') throw e
            Module['setThrew'](1, 0)
        }
    }
    function invoke_viiii(index, a1, a2, a3, a4) {
        try {
            Module['dynCall_viiii'](index, a1, a2, a3, a4)
        } catch (e) {
            if (typeof e !== 'number' && e !== 'longjmp') throw e
            Module['setThrew'](1, 0)
        }
    }
    function invoke_viiiii(index, a1, a2, a3, a4, a5) {
        try {
            Module['dynCall_viiiii'](index, a1, a2, a3, a4, a5)
        } catch (e) {
            if (typeof e !== 'number' && e !== 'longjmp') throw e
            Module['setThrew'](1, 0)
        }
    }
    function invoke_viiiiii(index, a1, a2, a3, a4, a5, a6) {
        try {
            Module['dynCall_viiiiii'](index, a1, a2, a3, a4, a5, a6)
        } catch (e) {
            if (typeof e !== 'number' && e !== 'longjmp') throw e
            Module['setThrew'](1, 0)
        }
    }
    Module.asmGlobalArg = {
        Math: Math,
        Int8Array: Int8Array,
        Int16Array: Int16Array,
        Int32Array: Int32Array,
        Uint8Array: Uint8Array,
        Uint16Array: Uint16Array,
        Uint32Array: Uint32Array,
        Float32Array: Float32Array,
        Float64Array: Float64Array,
        NaN: NaN,
        Infinity: Infinity,
        byteLength: byteLength,
    }
    Module.asmLibraryArg = {
        abort: abort,
        assert: assert,
        enlargeMemory: enlargeMemory,
        getTotalMemory: getTotalMemory,
        abortOnCannotGrowMemory: abortOnCannotGrowMemory,
        invoke_ii: invoke_ii,
        invoke_iii: invoke_iii,
        invoke_iiii: invoke_iiii,
        invoke_iiiiiii: invoke_iiiiiii,
        invoke_v: invoke_v,
        invoke_vi: invoke_vi,
        invoke_vii: invoke_vii,
        invoke_viii: invoke_viii,
        invoke_viiii: invoke_viiii,
        invoke_viiiii: invoke_viiiii,
        invoke_viiiiii: invoke_viiiiii,
        __ZSt18uncaught_exceptionv: __ZSt18uncaught_exceptionv,
        ___cxa_allocate_exception: ___cxa_allocate_exception,
        ___cxa_begin_catch: ___cxa_begin_catch,
        ___cxa_find_matching_catch: ___cxa_find_matching_catch,
        ___cxa_pure_virtual: ___cxa_pure_virtual,
        ___cxa_throw: ___cxa_throw,
        ___gxx_personality_v0: ___gxx_personality_v0,
        ___resumeException: ___resumeException,
        ___setErrNo: ___setErrNo,
        ___syscall140: ___syscall140,
        ___syscall146: ___syscall146,
        ___syscall6: ___syscall6,
        _abort: _abort,
        _emscripten_memcpy_big: _emscripten_memcpy_big,
        _llvm_ceil_f64: _llvm_ceil_f64,
        _llvm_fabs_f64: _llvm_fabs_f64,
        _llvm_floor_f64: _llvm_floor_f64,
        _llvm_trap: _llvm_trap,
        _pthread_getspecific: _pthread_getspecific,
        _pthread_key_create: _pthread_key_create,
        _pthread_once: _pthread_once,
        _pthread_setspecific: _pthread_setspecific,
        flush_NO_FILESYSTEM: flush_NO_FILESYSTEM,
        DYNAMICTOP_PTR: DYNAMICTOP_PTR,
        tempDoublePtr: tempDoublePtr,
        ABORT: ABORT,
        STACKTOP: STACKTOP,
        STACK_MAX: STACK_MAX,
        cttz_i8: cttz_i8,
    } // EMSCRIPTEN_START_ASM
    var asm = /** @suppress {uselessCode} */ (function (global, env, buffer) {
        'almost asm'
        var a = global.Int8Array
        var b = new a(buffer)
        var c = global.Int16Array
        var d = new c(buffer)
        var e = global.Int32Array
        var f = new e(buffer)
        var g = global.Uint8Array
        var h = new g(buffer)
        var i = global.Uint16Array
        var j = new i(buffer)
        var k = global.Uint32Array
        var l = new k(buffer)
        var m = global.Float32Array
        var n = new m(buffer)
        var o = global.Float64Array
        var p = new o(buffer)
        var q = global.byteLength
        var r = env.DYNAMICTOP_PTR | 0
        var s = env.tempDoublePtr | 0
        var t = env.ABORT | 0
        var u = env.STACKTOP | 0
        var v = env.STACK_MAX | 0
        var w = env.cttz_i8 | 0
        var x = 0
        var y = 0
        var z = 0
        var A = 0
        var B = global.NaN,
            C = global.Infinity
        var D = 0,
            E = 0,
            F = 0,
            G = 0,
            H = 0.0
        var I = 0
        var J = global.Math.floor
        var K = global.Math.abs
        var L = global.Math.sqrt
        var M = global.Math.pow
        var N = global.Math.cos
        var O = global.Math.sin
        var P = global.Math.tan
        var Q = global.Math.acos
        var R = global.Math.asin
        var S = global.Math.atan
        var T = global.Math.atan2
        var U = global.Math.exp
        var V = global.Math.log
        var W = global.Math.ceil
        var X = global.Math.imul
        var Y = global.Math.min
        var Z = global.Math.max
        var _ = global.Math.clz32
        var $ = global.Math.fround
        var aa = env.abort
        var ba = env.assert
        var ca = env.enlargeMemory
        var da = env.getTotalMemory
        var ea = env.abortOnCannotGrowMemory
        var fa = env.invoke_ii
        var ga = env.invoke_iii
        var ha = env.invoke_iiii
        var ia = env.invoke_iiiiiii
        var ja = env.invoke_v
        var ka = env.invoke_vi
        var la = env.invoke_vii
        var ma = env.invoke_viii
        var na = env.invoke_viiii
        var oa = env.invoke_viiiii
        var pa = env.invoke_viiiiii
        var qa = env.__ZSt18uncaught_exceptionv
        var ra = env.___cxa_allocate_exception
        var sa = env.___cxa_begin_catch
        var ta = env.___cxa_find_matching_catch
        var ua = env.___cxa_pure_virtual
        var va = env.___cxa_throw
        var wa = env.___gxx_personality_v0
        var xa = env.___resumeException
        var ya = env.___setErrNo
        var za = env.___syscall140
        var Aa = env.___syscall146
        var Ba = env.___syscall6
        var Ca = env._abort
        var Da = env._emscripten_memcpy_big
        var Ea = env._llvm_ceil_f64
        var Fa = env._llvm_fabs_f64
        var Ga = env._llvm_floor_f64
        var Ha = env._llvm_trap
        var Ia = env._pthread_getspecific
        var Ja = env._pthread_key_create
        var Ka = env._pthread_once
        var La = env._pthread_setspecific
        var Ma = env.flush_NO_FILESYSTEM
        var Na = $(0)
        const Oa = $(0)
        function Pa(newBuffer) {
            if (q(newBuffer) & 16777215 || q(newBuffer) <= 16777215 || q(newBuffer) > 2147483648) return false
            b = new a(newBuffer)
            d = new c(newBuffer)
            f = new e(newBuffer)
            h = new g(newBuffer)
            j = new i(newBuffer)
            l = new k(newBuffer)
            n = new m(newBuffer)
            p = new o(newBuffer)
            buffer = newBuffer
            return true
        }
        // EMSCRIPTEN_START_FUNCS
        function wc(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0
            if (!a) return
            b = (a + -8) | 0
            c = f[4516] | 0
            d = f[(a + -4) >> 2] | 0
            a = d & -8
            e = (b + a) | 0
            do
                if (!(d & 1)) {
                    g = f[b >> 2] | 0
                    if (!(d & 3)) return
                    h = (b + (0 - g)) | 0
                    i = (g + a) | 0
                    if (h >>> 0 < c >>> 0) return
                    if ((f[4517] | 0) == (h | 0)) {
                        j = (e + 4) | 0
                        k = f[j >> 2] | 0
                        if (((k & 3) | 0) != 3) {
                            l = h
                            m = i
                            n = h
                            break
                        }
                        f[4514] = i
                        f[j >> 2] = k & -2
                        f[(h + 4) >> 2] = i | 1
                        f[(h + i) >> 2] = i
                        return
                    }
                    k = g >>> 3
                    if (g >>> 0 < 256) {
                        g = f[(h + 8) >> 2] | 0
                        j = f[(h + 12) >> 2] | 0
                        if ((j | 0) == (g | 0)) {
                            f[4512] = f[4512] & ~(1 << k)
                            l = h
                            m = i
                            n = h
                            break
                        } else {
                            f[(g + 12) >> 2] = j
                            f[(j + 8) >> 2] = g
                            l = h
                            m = i
                            n = h
                            break
                        }
                    }
                    g = f[(h + 24) >> 2] | 0
                    j = f[(h + 12) >> 2] | 0
                    do
                        if ((j | 0) == (h | 0)) {
                            k = (h + 16) | 0
                            o = (k + 4) | 0
                            p = f[o >> 2] | 0
                            if (!p) {
                                q = f[k >> 2] | 0
                                if (!q) {
                                    r = 0
                                    break
                                } else {
                                    s = q
                                    t = k
                                }
                            } else {
                                s = p
                                t = o
                            }
                            while (1) {
                                o = (s + 20) | 0
                                p = f[o >> 2] | 0
                                if (p | 0) {
                                    s = p
                                    t = o
                                    continue
                                }
                                o = (s + 16) | 0
                                p = f[o >> 2] | 0
                                if (!p) break
                                else {
                                    s = p
                                    t = o
                                }
                            }
                            f[t >> 2] = 0
                            r = s
                        } else {
                            o = f[(h + 8) >> 2] | 0
                            f[(o + 12) >> 2] = j
                            f[(j + 8) >> 2] = o
                            r = j
                        }
                    while (0)
                    if (g) {
                        j = f[(h + 28) >> 2] | 0
                        o = (18352 + (j << 2)) | 0
                        if ((f[o >> 2] | 0) == (h | 0)) {
                            f[o >> 2] = r
                            if (!r) {
                                f[4513] = f[4513] & ~(1 << j)
                                l = h
                                m = i
                                n = h
                                break
                            }
                        } else {
                            f[(g + 16 + ((((f[(g + 16) >> 2] | 0) != (h | 0)) & 1) << 2)) >> 2] = r
                            if (!r) {
                                l = h
                                m = i
                                n = h
                                break
                            }
                        }
                        f[(r + 24) >> 2] = g
                        j = (h + 16) | 0
                        o = f[j >> 2] | 0
                        if (o | 0) {
                            f[(r + 16) >> 2] = o
                            f[(o + 24) >> 2] = r
                        }
                        o = f[(j + 4) >> 2] | 0
                        if (o) {
                            f[(r + 20) >> 2] = o
                            f[(o + 24) >> 2] = r
                            l = h
                            m = i
                            n = h
                        } else {
                            l = h
                            m = i
                            n = h
                        }
                    } else {
                        l = h
                        m = i
                        n = h
                    }
                } else {
                    l = b
                    m = a
                    n = b
                }
            while (0)
            if (n >>> 0 >= e >>> 0) return
            b = (e + 4) | 0
            a = f[b >> 2] | 0
            if (!(a & 1)) return
            if (!(a & 2)) {
                if ((f[4518] | 0) == (e | 0)) {
                    r = ((f[4515] | 0) + m) | 0
                    f[4515] = r
                    f[4518] = l
                    f[(l + 4) >> 2] = r | 1
                    if ((l | 0) != (f[4517] | 0)) return
                    f[4517] = 0
                    f[4514] = 0
                    return
                }
                if ((f[4517] | 0) == (e | 0)) {
                    r = ((f[4514] | 0) + m) | 0
                    f[4514] = r
                    f[4517] = n
                    f[(l + 4) >> 2] = r | 1
                    f[(n + r) >> 2] = r
                    return
                }
                r = ((a & -8) + m) | 0
                s = a >>> 3
                do
                    if (a >>> 0 < 256) {
                        t = f[(e + 8) >> 2] | 0
                        c = f[(e + 12) >> 2] | 0
                        if ((c | 0) == (t | 0)) {
                            f[4512] = f[4512] & ~(1 << s)
                            break
                        } else {
                            f[(t + 12) >> 2] = c
                            f[(c + 8) >> 2] = t
                            break
                        }
                    } else {
                        t = f[(e + 24) >> 2] | 0
                        c = f[(e + 12) >> 2] | 0
                        do
                            if ((c | 0) == (e | 0)) {
                                d = (e + 16) | 0
                                o = (d + 4) | 0
                                j = f[o >> 2] | 0
                                if (!j) {
                                    p = f[d >> 2] | 0
                                    if (!p) {
                                        u = 0
                                        break
                                    } else {
                                        v = p
                                        w = d
                                    }
                                } else {
                                    v = j
                                    w = o
                                }
                                while (1) {
                                    o = (v + 20) | 0
                                    j = f[o >> 2] | 0
                                    if (j | 0) {
                                        v = j
                                        w = o
                                        continue
                                    }
                                    o = (v + 16) | 0
                                    j = f[o >> 2] | 0
                                    if (!j) break
                                    else {
                                        v = j
                                        w = o
                                    }
                                }
                                f[w >> 2] = 0
                                u = v
                            } else {
                                o = f[(e + 8) >> 2] | 0
                                f[(o + 12) >> 2] = c
                                f[(c + 8) >> 2] = o
                                u = c
                            }
                        while (0)
                        if (t | 0) {
                            c = f[(e + 28) >> 2] | 0
                            h = (18352 + (c << 2)) | 0
                            if ((f[h >> 2] | 0) == (e | 0)) {
                                f[h >> 2] = u
                                if (!u) {
                                    f[4513] = f[4513] & ~(1 << c)
                                    break
                                }
                            } else {
                                f[(t + 16 + ((((f[(t + 16) >> 2] | 0) != (e | 0)) & 1) << 2)) >> 2] = u
                                if (!u) break
                            }
                            f[(u + 24) >> 2] = t
                            c = (e + 16) | 0
                            h = f[c >> 2] | 0
                            if (h | 0) {
                                f[(u + 16) >> 2] = h
                                f[(h + 24) >> 2] = u
                            }
                            h = f[(c + 4) >> 2] | 0
                            if (h | 0) {
                                f[(u + 20) >> 2] = h
                                f[(h + 24) >> 2] = u
                            }
                        }
                    }
                while (0)
                f[(l + 4) >> 2] = r | 1
                f[(n + r) >> 2] = r
                if ((l | 0) == (f[4517] | 0)) {
                    f[4514] = r
                    return
                } else x = r
            } else {
                f[b >> 2] = a & -2
                f[(l + 4) >> 2] = m | 1
                f[(n + m) >> 2] = m
                x = m
            }
            m = x >>> 3
            if (x >>> 0 < 256) {
                n = (18088 + ((m << 1) << 2)) | 0
                a = f[4512] | 0
                b = 1 << m
                if (!(a & b)) {
                    f[4512] = a | b
                    y = n
                    z = (n + 8) | 0
                } else {
                    b = (n + 8) | 0
                    y = f[b >> 2] | 0
                    z = b
                }
                f[z >> 2] = l
                f[(y + 12) >> 2] = l
                f[(l + 8) >> 2] = y
                f[(l + 12) >> 2] = n
                return
            }
            n = x >>> 8
            if (n)
                if (x >>> 0 > 16777215) A = 31
                else {
                    y = (((n + 1048320) | 0) >>> 16) & 8
                    z = n << y
                    n = (((z + 520192) | 0) >>> 16) & 4
                    b = z << n
                    z = (((b + 245760) | 0) >>> 16) & 2
                    a = (14 - (n | y | z) + ((b << z) >>> 15)) | 0
                    A = ((x >>> ((a + 7) | 0)) & 1) | (a << 1)
                }
            else A = 0
            a = (18352 + (A << 2)) | 0
            f[(l + 28) >> 2] = A
            f[(l + 20) >> 2] = 0
            f[(l + 16) >> 2] = 0
            z = f[4513] | 0
            b = 1 << A
            do
                if (z & b) {
                    y = x << ((A | 0) == 31 ? 0 : (25 - (A >>> 1)) | 0)
                    n = f[a >> 2] | 0
                    while (1) {
                        if (((f[(n + 4) >> 2] & -8) | 0) == (x | 0)) {
                            B = 73
                            break
                        }
                        C = (n + 16 + ((y >>> 31) << 2)) | 0
                        m = f[C >> 2] | 0
                        if (!m) {
                            B = 72
                            break
                        } else {
                            y = y << 1
                            n = m
                        }
                    }
                    if ((B | 0) == 72) {
                        f[C >> 2] = l
                        f[(l + 24) >> 2] = n
                        f[(l + 12) >> 2] = l
                        f[(l + 8) >> 2] = l
                        break
                    } else if ((B | 0) == 73) {
                        y = (n + 8) | 0
                        t = f[y >> 2] | 0
                        f[(t + 12) >> 2] = l
                        f[y >> 2] = l
                        f[(l + 8) >> 2] = t
                        f[(l + 12) >> 2] = n
                        f[(l + 24) >> 2] = 0
                        break
                    }
                } else {
                    f[4513] = z | b
                    f[a >> 2] = l
                    f[(l + 24) >> 2] = a
                    f[(l + 12) >> 2] = l
                    f[(l + 8) >> 2] = l
                }
            while (0)
            l = ((f[4520] | 0) + -1) | 0
            f[4520] = l
            if (!l) D = 18504
            else return
            while (1) {
                l = f[D >> 2] | 0
                if (!l) break
                else D = (l + 8) | 0
            }
            f[4520] = -1
            return
        }
        function xc(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 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 = Oa,
                F = Oa,
                G = Oa,
                H = 0,
                I = 0,
                J = 0,
                K = 0
            d = b[(c + 11) >> 0] | 0
            e = (d << 24) >> 24 < 0
            g = e ? f[c >> 2] | 0 : c
            i = e ? f[(c + 4) >> 2] | 0 : d & 255
            if (i >>> 0 > 3) {
                d = g
                e = i
                j = i
                while (1) {
                    k = X(h[d >> 0] | (h[(d + 1) >> 0] << 8) | (h[(d + 2) >> 0] << 16) | (h[(d + 3) >> 0] << 24), 1540483477) | 0
                    e = (X((k >>> 24) ^ k, 1540483477) | 0) ^ (X(e, 1540483477) | 0)
                    j = (j + -4) | 0
                    if (j >>> 0 <= 3) break
                    else d = (d + 4) | 0
                }
                d = (i + -4) | 0
                j = d & -4
                l = (d - j) | 0
                m = (g + (j + 4)) | 0
                o = e
            } else {
                l = i
                m = g
                o = i
            }
            switch (l | 0) {
                case 3: {
                    p = (h[(m + 2) >> 0] << 16) ^ o
                    q = 6
                    break
                }
                case 2: {
                    p = o
                    q = 6
                    break
                }
                case 1: {
                    r = o
                    q = 7
                    break
                }
                default:
                    s = o
            }
            if ((q | 0) == 6) {
                r = (h[(m + 1) >> 0] << 8) ^ p
                q = 7
            }
            if ((q | 0) == 7) s = X(r ^ h[m >> 0], 1540483477) | 0
            m = X((s >>> 13) ^ s, 1540483477) | 0
            s = (m >>> 15) ^ m
            m = (a + 4) | 0
            r = f[m >> 2] | 0
            p = (r | 0) == 0
            a: do
                if (!p) {
                    o = (r + -1) | 0
                    l = ((o & r) | 0) == 0
                    if (!l)
                        if (s >>> 0 < r >>> 0) t = s
                        else t = (s >>> 0) % (r >>> 0) | 0
                    else t = s & o
                    e = f[((f[a >> 2] | 0) + (t << 2)) >> 2] | 0
                    if ((e | 0) != 0 ? ((j = f[e >> 2] | 0), (j | 0) != 0) : 0) {
                        e = (i | 0) == 0
                        if (l) {
                            if (e) {
                                l = j
                                while (1) {
                                    d = f[(l + 4) >> 2] | 0
                                    if (!(((d | 0) == (s | 0)) | (((d & o) | 0) == (t | 0)))) {
                                        u = t
                                        break a
                                    }
                                    d = b[(l + 8 + 11) >> 0] | 0
                                    if (!(((d << 24) >> 24 < 0 ? f[(l + 12) >> 2] | 0 : d & 255) | 0)) {
                                        v = l
                                        break
                                    }
                                    l = f[l >> 2] | 0
                                    if (!l) {
                                        u = t
                                        break a
                                    }
                                }
                                w = (v + 20) | 0
                                return w | 0
                            } else x = j
                            b: while (1) {
                                l = f[(x + 4) >> 2] | 0
                                if (!(((l | 0) == (s | 0)) | (((l & o) | 0) == (t | 0)))) {
                                    u = t
                                    break a
                                }
                                l = (x + 8) | 0
                                d = b[(l + 11) >> 0] | 0
                                k = (d << 24) >> 24 < 0
                                y = d & 255
                                do
                                    if (((k ? f[(x + 12) >> 2] | 0 : y) | 0) == (i | 0)) {
                                        d = f[l >> 2] | 0
                                        if (k)
                                            if (!(Pk(d, g, i) | 0)) {
                                                v = x
                                                q = 63
                                                break b
                                            } else break
                                        if ((b[g >> 0] | 0) == ((d & 255) << 24) >> 24) {
                                            d = l
                                            z = y
                                            A = g
                                            do {
                                                z = (z + -1) | 0
                                                d = (d + 1) | 0
                                                if (!z) {
                                                    v = x
                                                    q = 63
                                                    break b
                                                }
                                                A = (A + 1) | 0
                                            } while ((b[d >> 0] | 0) == (b[A >> 0] | 0))
                                        }
                                    }
                                while (0)
                                x = f[x >> 2] | 0
                                if (!x) {
                                    u = t
                                    break a
                                }
                            }
                            if ((q | 0) == 63) {
                                w = (v + 20) | 0
                                return w | 0
                            }
                        }
                        if (e) {
                            o = j
                            while (1) {
                                y = f[(o + 4) >> 2] | 0
                                if ((y | 0) != (s | 0)) {
                                    if (y >>> 0 < r >>> 0) B = y
                                    else B = (y >>> 0) % (r >>> 0) | 0
                                    if ((B | 0) != (t | 0)) {
                                        u = t
                                        break a
                                    }
                                }
                                y = b[(o + 8 + 11) >> 0] | 0
                                if (!(((y << 24) >> 24 < 0 ? f[(o + 12) >> 2] | 0 : y & 255) | 0)) {
                                    v = o
                                    break
                                }
                                o = f[o >> 2] | 0
                                if (!o) {
                                    u = t
                                    break a
                                }
                            }
                            w = (v + 20) | 0
                            return w | 0
                        } else C = j
                        c: while (1) {
                            o = f[(C + 4) >> 2] | 0
                            if ((o | 0) != (s | 0)) {
                                if (o >>> 0 < r >>> 0) D = o
                                else D = (o >>> 0) % (r >>> 0) | 0
                                if ((D | 0) != (t | 0)) {
                                    u = t
                                    break a
                                }
                            }
                            o = (C + 8) | 0
                            e = b[(o + 11) >> 0] | 0
                            y = (e << 24) >> 24 < 0
                            l = e & 255
                            do
                                if (((y ? f[(C + 12) >> 2] | 0 : l) | 0) == (i | 0)) {
                                    e = f[o >> 2] | 0
                                    if (y)
                                        if (!(Pk(e, g, i) | 0)) {
                                            v = C
                                            q = 63
                                            break c
                                        } else break
                                    if ((b[g >> 0] | 0) == ((e & 255) << 24) >> 24) {
                                        e = o
                                        k = l
                                        A = g
                                        do {
                                            k = (k + -1) | 0
                                            e = (e + 1) | 0
                                            if (!k) {
                                                v = C
                                                q = 63
                                                break c
                                            }
                                            A = (A + 1) | 0
                                        } while ((b[e >> 0] | 0) == (b[A >> 0] | 0))
                                    }
                                }
                            while (0)
                            C = f[C >> 2] | 0
                            if (!C) {
                                u = t
                                break a
                            }
                        }
                        if ((q | 0) == 63) {
                            w = (v + 20) | 0
                            return w | 0
                        }
                    } else u = t
                } else u = 0
            while (0)
            t = dn(24) | 0
            dj((t + 8) | 0, c)
            f[(t + 20) >> 2] = 0
            f[(t + 4) >> 2] = s
            f[t >> 2] = 0
            c = (a + 12) | 0
            E = $((((f[c >> 2] | 0) + 1) | 0) >>> 0)
            F = $(r >>> 0)
            G = $(n[(a + 16) >> 2])
            do
                if (p | ($(G * F) < E)) {
                    C = (r << 1) | (((r >>> 0 < 3) | ((((r + -1) & r) | 0) != 0)) & 1)
                    g = ~~$(W($(E / G))) >>> 0
                    Ph(a, C >>> 0 < g >>> 0 ? g : C)
                    C = f[m >> 2] | 0
                    g = (C + -1) | 0
                    if (!(g & C)) {
                        H = C
                        I = g & s
                        break
                    }
                    if (s >>> 0 < C >>> 0) {
                        H = C
                        I = s
                    } else {
                        H = C
                        I = (s >>> 0) % (C >>> 0) | 0
                    }
                } else {
                    H = r
                    I = u
                }
            while (0)
            u = ((f[a >> 2] | 0) + (I << 2)) | 0
            I = f[u >> 2] | 0
            if (!I) {
                r = (a + 8) | 0
                f[t >> 2] = f[r >> 2]
                f[r >> 2] = t
                f[u >> 2] = r
                r = f[t >> 2] | 0
                if (r | 0) {
                    u = f[(r + 4) >> 2] | 0
                    r = (H + -1) | 0
                    if (r & H)
                        if (u >>> 0 < H >>> 0) J = u
                        else J = (u >>> 0) % (H >>> 0) | 0
                    else J = u & r
                    K = ((f[a >> 2] | 0) + (J << 2)) | 0
                    q = 61
                }
            } else {
                f[t >> 2] = f[I >> 2]
                K = I
                q = 61
            }
            if ((q | 0) == 61) f[K >> 2] = t
            f[c >> 2] = (f[c >> 2] | 0) + 1
            v = t
            w = (v + 20) | 0
            return w | 0
        }
        function yc(a, b, c, d, e) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0.0,
                q = 0.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,
                F = 0.0,
                G = 0.0,
                H = 0,
                J = 0,
                K = 0,
                L = 0,
                M = 0,
                N = 0,
                O = 0.0,
                P = 0,
                Q = 0.0,
                R = 0.0,
                S = 0,
                T = 0.0,
                U = 0,
                V = 0,
                W = 0,
                X = 0.0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0.0,
                da = 0,
                ea = 0.0
            g = (a + 4) | 0
            i = f[g >> 2] | 0
            j = (a + 100) | 0
            if (i >>> 0 < (f[j >> 2] | 0) >>> 0) {
                f[g >> 2] = i + 1
                k = h[i >> 0] | 0
                l = 0
            } else {
                k = Di(a) | 0
                l = 0
            }
            a: while (1) {
                switch (k | 0) {
                    case 46: {
                        m = 8
                        break a
                        break
                    }
                    case 48:
                        break
                    default: {
                        n = 0
                        o = 0
                        p = 1.0
                        q = 0.0
                        r = 0
                        s = k
                        t = l
                        u = 0
                        v = 0
                        w = 0
                        x = 0
                        break a
                    }
                }
                i = f[g >> 2] | 0
                if (i >>> 0 < (f[j >> 2] | 0) >>> 0) {
                    f[g >> 2] = i + 1
                    k = h[i >> 0] | 0
                    l = 1
                    continue
                } else {
                    k = Di(a) | 0
                    l = 1
                    continue
                }
            }
            if ((m | 0) == 8) {
                k = f[g >> 2] | 0
                if (k >>> 0 < (f[j >> 2] | 0) >>> 0) {
                    f[g >> 2] = k + 1
                    y = h[k >> 0] | 0
                } else y = Di(a) | 0
                if ((y | 0) == 48) {
                    k = 0
                    i = 0
                    while (1) {
                        z = f[g >> 2] | 0
                        if (z >>> 0 < (f[j >> 2] | 0) >>> 0) {
                            f[g >> 2] = z + 1
                            A = h[z >> 0] | 0
                        } else A = Di(a) | 0
                        z = Tn(k | 0, i | 0, -1, -1) | 0
                        B = I
                        if ((A | 0) == 48) {
                            k = z
                            i = B
                        } else {
                            n = 1
                            o = 0
                            p = 1.0
                            q = 0.0
                            r = 0
                            s = A
                            t = 1
                            u = 0
                            v = 0
                            w = z
                            x = B
                            break
                        }
                    }
                } else {
                    n = 1
                    o = 0
                    p = 1.0
                    q = 0.0
                    r = 0
                    s = y
                    t = l
                    u = 0
                    v = 0
                    w = 0
                    x = 0
                }
            }
            while (1) {
                l = (s + -48) | 0
                y = s | 32
                if (l >>> 0 >= 10) {
                    A = (s | 0) == 46
                    if (!(A | (((y + -97) | 0) >>> 0 < 6))) {
                        C = s
                        break
                    }
                    if (A)
                        if (!n) {
                            D = 1
                            E = o
                            F = p
                            G = q
                            H = r
                            J = t
                            K = v
                            L = u
                            M = v
                            N = u
                        } else {
                            C = 46
                            break
                        }
                    else m = 20
                } else m = 20
                if ((m | 0) == 20) {
                    m = 0
                    A = (s | 0) > 57 ? (y + -87) | 0 : l
                    do
                        if (!(((u | 0) < 0) | (((u | 0) == 0) & (v >>> 0 < 8))))
                            if (((u | 0) < 0) | (((u | 0) == 0) & (v >>> 0 < 14))) {
                                O = p * 0.0625
                                P = o
                                Q = O
                                R = q + O * +(A | 0)
                                S = r
                                break
                            } else {
                                l = ((o | 0) != 0) | ((A | 0) == 0)
                                P = l ? o : 1
                                Q = p
                                R = l ? q : q + p * 0.5
                                S = r
                                break
                            }
                        else {
                            P = o
                            Q = p
                            R = q
                            S = (A + (r << 4)) | 0
                        }
                    while (0)
                    A = Tn(v | 0, u | 0, 1, 0) | 0
                    D = n
                    E = P
                    F = Q
                    G = R
                    H = S
                    J = 1
                    K = w
                    L = x
                    M = A
                    N = I
                }
                A = f[g >> 2] | 0
                if (A >>> 0 < (f[j >> 2] | 0) >>> 0) {
                    f[g >> 2] = A + 1
                    n = D
                    o = E
                    p = F
                    q = G
                    r = H
                    s = h[A >> 0] | 0
                    t = J
                    u = N
                    v = M
                    w = K
                    x = L
                    continue
                } else {
                    n = D
                    o = E
                    p = F
                    q = G
                    r = H
                    s = Di(a) | 0
                    t = J
                    u = N
                    v = M
                    w = K
                    x = L
                    continue
                }
            }
            do
                if (!t) {
                    L = (f[j >> 2] | 0) == 0
                    if (!L) f[g >> 2] = (f[g >> 2] | 0) + -1
                    if (e) {
                        if (!L) f[g >> 2] = (f[g >> 2] | 0) + -1
                        if (!(((n | 0) == 0) | L)) f[g >> 2] = (f[g >> 2] | 0) + -1
                    } else Rm(a, 0)
                    T = +(d | 0) * 0.0
                } else {
                    L = (n | 0) == 0
                    K = L ? v : w
                    M = L ? u : x
                    if (((u | 0) < 0) | (((u | 0) == 0) & (v >>> 0 < 8))) {
                        L = r
                        N = v
                        J = u
                        while (1) {
                            s = L << 4
                            H = N
                            N = Tn(N | 0, J | 0, 1, 0) | 0
                            if (!(((J | 0) < 0) | (((J | 0) == 0) & (H >>> 0 < 7)))) {
                                U = s
                                break
                            } else {
                                L = s
                                J = I
                            }
                        }
                    } else U = r
                    if ((C | 32 | 0) == 112) {
                        J = De(a, e) | 0
                        L = I
                        if (((J | 0) == 0) & ((L | 0) == -2147483648)) {
                            if (!e) {
                                Rm(a, 0)
                                T = 0.0
                                break
                            }
                            if (!(f[j >> 2] | 0)) {
                                V = 0
                                W = 0
                            } else {
                                f[g >> 2] = (f[g >> 2] | 0) + -1
                                V = 0
                                W = 0
                            }
                        } else {
                            V = J
                            W = L
                        }
                    } else if (!(f[j >> 2] | 0)) {
                        V = 0
                        W = 0
                    } else {
                        f[g >> 2] = (f[g >> 2] | 0) + -1
                        V = 0
                        W = 0
                    }
                    L = Rn(K | 0, M | 0, 2) | 0
                    J = Tn(L | 0, I | 0, -32, -1) | 0
                    L = Tn(J | 0, I | 0, V | 0, W | 0) | 0
                    J = I
                    if (!U) {
                        T = +(d | 0) * 0.0
                        break
                    }
                    N = (0 - c) | 0
                    s = (((N | 0) < 0) << 31) >> 31
                    if (((J | 0) > (s | 0)) | (((J | 0) == (s | 0)) & (L >>> 0 > N >>> 0))) {
                        N = ir() | 0
                        f[N >> 2] = 34
                        T = +(d | 0) * 1797693134862315708145274.0e284 * 1797693134862315708145274.0e284
                        break
                    }
                    N = (c + -106) | 0
                    s = (((N | 0) < 0) << 31) >> 31
                    if (((J | 0) < (s | 0)) | (((J | 0) == (s | 0)) & (L >>> 0 < N >>> 0))) {
                        N = ir() | 0
                        f[N >> 2] = 34
                        T = +(d | 0) * 2.2250738585072014e-308 * 2.2250738585072014e-308
                        break
                    }
                    if ((U | 0) > -1) {
                        G = q
                        N = U
                        s = L
                        H = J
                        while (1) {
                            E = !(G >= 0.5)
                            o = (N << 1) | ((E ^ 1) & 1)
                            F = G + (E ? G : G + -1.0)
                            E = Tn(s | 0, H | 0, -1, -1) | 0
                            D = I
                            if ((o | 0) > -1) {
                                G = F
                                N = o
                                s = E
                                H = D
                            } else {
                                X = F
                                Y = o
                                Z = E
                                _ = D
                                break
                            }
                        }
                    } else {
                        X = q
                        Y = U
                        Z = L
                        _ = J
                    }
                    H = (((b | 0) < 0) << 31) >> 31
                    s = Vn(32, 0, c | 0, ((((c | 0) < 0) << 31) >> 31) | 0) | 0
                    N = Tn(s | 0, I | 0, Z | 0, _ | 0) | 0
                    s = I
                    if (((s | 0) < (H | 0)) | (((s | 0) == (H | 0)) & (N >>> 0 < b >>> 0)))
                        if ((N | 0) > 0) {
                            $ = N
                            m = 59
                        } else {
                            aa = 0
                            ba = 84
                            m = 61
                        }
                    else {
                        $ = b
                        m = 59
                    }
                    if ((m | 0) == 59)
                        if (($ | 0) < 53) {
                            aa = $
                            ba = (84 - $) | 0
                            m = 61
                        } else {
                            ca = 0.0
                            da = $
                            ea = +(d | 0)
                        }
                    if ((m | 0) == 61) {
                        G = +(d | 0)
                        ca = +Gq(+Wj(1.0, ba), G)
                        da = aa
                        ea = G
                    }
                    N = (((Y & 1) | 0) == 0) & ((X != 0.0) & ((da | 0) < 32))
                    G = (N ? 0.0 : X) * ea + (ca + ea * +(((Y + (N & 1)) | 0) >>> 0)) - ca
                    if (!(G != 0.0)) {
                        N = ir() | 0
                        f[N >> 2] = 34
                    }
                    T = +Hq(G, Z)
                }
            while (0)
            return +T
        }
        function zc(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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
            g = u
            u = (u + 16) | 0
            h = (g + 4) | 0
            i = g
            if (!(oh(a, d) | 0)) {
                j = 0
                u = g
                return j | 0
            }
            d = (a + 84) | 0
            k = f[d >> 2] | 0
            l = (a + 88) | 0
            m = f[l >> 2] | 0
            if ((m | 0) != (k | 0)) f[l >> 2] = m + (~(((m + -4 - k) | 0) >>> 2) << 2)
            f[d >> 2] = 0
            f[l >> 2] = 0
            f[(a + 92) >> 2] = 0
            if (k | 0) br(k)
            k = (a + 72) | 0
            l = f[k >> 2] | 0
            d = (a + 76) | 0
            if ((f[d >> 2] | 0) != (l | 0)) f[d >> 2] = l
            f[k >> 2] = 0
            f[d >> 2] = 0
            f[(a + 80) >> 2] = 0
            if (l | 0) br(l)
            l = (a + 64) | 0
            d = f[l >> 2] | 0
            if ((f[(d + 4) >> 2] | 0) != (f[d >> 2] | 0)) {
                k = (a + 12) | 0
                m = (e + 84) | 0
                n = (e + 68) | 0
                o = (c + 96) | 0
                p = (a + 24) | 0
                q = 0
                r = d
                do {
                    f[i >> 2] = ((q >>> 0) / 3) | 0
                    f[h >> 2] = f[i >> 2]
                    d = Rj(r, h) | 0
                    r = f[l >> 2] | 0
                    do
                        if (!d) {
                            s = f[((f[(r + 12) >> 2] | 0) + (q << 2)) >> 2] | 0
                            if ((s | 0) == -1) {
                                t = ((f[a >> 2] | 0) + ((q >>> 5) << 2)) | 0
                                f[t >> 2] = f[t >> 2] | (1 << (q & 31))
                                t = (q + 1) | 0
                                v = ((t >>> 0) % 3 | 0 | 0) == 0 ? (q + -2) | 0 : t
                                if ((v | 0) == -1) w = -1
                                else w = f[((f[r >> 2] | 0) + (v << 2)) >> 2] | 0
                                v = ((f[k >> 2] | 0) + ((w >>> 5) << 2)) | 0
                                f[v >> 2] = f[v >> 2] | (1 << (w & 31))
                                v = ((((q >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + q) | 0
                                if ((v | 0) == -1) x = -1
                                else x = f[((f[r >> 2] | 0) + (v << 2)) >> 2] | 0
                                v = ((f[k >> 2] | 0) + ((x >>> 5) << 2)) | 0
                                f[v >> 2] = f[v >> 2] | (1 << (x & 31))
                                break
                            }
                            if (s >>> 0 >= q >>> 0) {
                                v = (q + 1) | 0
                                t = ((v >>> 0) % 3 | 0 | 0) == 0 ? (q + -2) | 0 : v
                                y = (s + (((s >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1)) | 0
                                z = (t | 0) == -1
                                if (!(b[m >> 0] | 0)) {
                                    if (z) A = -1
                                    else A = f[((f[o >> 2] | 0) + (((((t | 0) / 3) | 0) * 12) | 0) + (((t | 0) % 3 | 0) << 2)) >> 2] | 0
                                    B = (y | 0) == -1
                                    if (B) C = -1
                                    else C = f[((f[o >> 2] | 0) + (((((y | 0) / 3) | 0) * 12) | 0) + (((y | 0) % 3 | 0) << 2)) >> 2] | 0
                                    D = f[n >> 2] | 0
                                    if ((f[(D + (A << 2)) >> 2] | 0) == (f[(D + (C << 2)) >> 2] | 0)) {
                                        E = (t + 1) | 0
                                        if (z) F = -1
                                        else F = ((E >>> 0) % 3 | 0 | 0) == 0 ? (t + -2) | 0 : E
                                        do
                                            if (!B)
                                                if (!((y >>> 0) % 3 | 0)) {
                                                    G = (y + 2) | 0
                                                    break
                                                } else {
                                                    G = (y + -1) | 0
                                                    break
                                                }
                                            else G = -1
                                        while (0)
                                        if ((F | 0) == -1) H = -1
                                        else H = f[((f[o >> 2] | 0) + (((((F | 0) / 3) | 0) * 12) | 0) + (((F | 0) % 3 | 0) << 2)) >> 2] | 0
                                        if ((G | 0) == -1) I = -1
                                        else I = f[((f[o >> 2] | 0) + (((((G | 0) / 3) | 0) * 12) | 0) + (((G | 0) % 3 | 0) << 2)) >> 2] | 0
                                        if ((f[(D + (H << 2)) >> 2] | 0) == (f[(D + (I << 2)) >> 2] | 0)) break
                                    }
                                } else {
                                    if (z) J = -1
                                    else J = f[((f[o >> 2] | 0) + (((((t | 0) / 3) | 0) * 12) | 0) + (((t | 0) % 3 | 0) << 2)) >> 2] | 0
                                    B = (y | 0) == -1
                                    if (B) K = -1
                                    else K = f[((f[o >> 2] | 0) + (((((y | 0) / 3) | 0) * 12) | 0) + (((y | 0) % 3 | 0) << 2)) >> 2] | 0
                                    if ((J | 0) == (K | 0)) {
                                        E = (t + 1) | 0
                                        if (z) L = -1
                                        else L = ((E >>> 0) % 3 | 0 | 0) == 0 ? (t + -2) | 0 : E
                                        do
                                            if (!B)
                                                if (!((y >>> 0) % 3 | 0)) {
                                                    M = (y + 2) | 0
                                                    break
                                                } else {
                                                    M = (y + -1) | 0
                                                    break
                                                }
                                            else M = -1
                                        while (0)
                                        if ((L | 0) == -1) N = -1
                                        else N = f[((f[o >> 2] | 0) + (((((L | 0) / 3) | 0) * 12) | 0) + (((L | 0) % 3 | 0) << 2)) >> 2] | 0
                                        if ((M | 0) == -1) O = -1
                                        else O = f[((f[o >> 2] | 0) + (((((M | 0) / 3) | 0) * 12) | 0) + (((M | 0) % 3 | 0) << 2)) >> 2] | 0
                                        if ((N | 0) == (O | 0)) break
                                    }
                                }
                                b[p >> 0] = 0
                                y = f[a >> 2] | 0
                                B = (y + ((q >>> 5) << 2)) | 0
                                f[B >> 2] = f[B >> 2] | (1 << (q & 31))
                                B = (y + ((s >>> 5) << 2)) | 0
                                f[B >> 2] = f[B >> 2] | (1 << (s & 31))
                                B = ((v >>> 0) % 3 | 0 | 0) == 0 ? (q + -2) | 0 : v
                                if ((B | 0) == -1) P = -1
                                else P = f[((f[r >> 2] | 0) + (B << 2)) >> 2] | 0
                                B = ((f[k >> 2] | 0) + ((P >>> 5) << 2)) | 0
                                f[B >> 2] = f[B >> 2] | (1 << (P & 31))
                                B = ((((q >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + q) | 0
                                if ((B | 0) == -1) Q = -1
                                else Q = f[((f[r >> 2] | 0) + (B << 2)) >> 2] | 0
                                B = ((f[k >> 2] | 0) + ((Q >>> 5) << 2)) | 0
                                f[B >> 2] = f[B >> 2] | (1 << (Q & 31))
                                B = (s + 1) | 0
                                y = ((B >>> 0) % 3 | 0 | 0) == 0 ? (s + -2) | 0 : B
                                if ((y | 0) == -1) R = -1
                                else R = f[((f[r >> 2] | 0) + (y << 2)) >> 2] | 0
                                y = ((f[k >> 2] | 0) + ((R >>> 5) << 2)) | 0
                                f[y >> 2] = f[y >> 2] | (1 << (R & 31))
                                y = ((((s >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + s) | 0
                                if ((y | 0) == -1) S = -1
                                else S = f[((f[r >> 2] | 0) + (y << 2)) >> 2] | 0
                                y = ((f[k >> 2] | 0) + ((S >>> 5) << 2)) | 0
                                f[y >> 2] = f[y >> 2] | (1 << (S & 31))
                            }
                        }
                    while (0)
                    q = (q + 1) | 0
                } while (q >>> 0 < (((f[(r + 4) >> 2] | 0) - (f[r >> 2] | 0)) >> 2) >>> 0)
            }
            if (((c | 0) != 0) & ((e | 0) != 0)) {
                Kc(a, c, e)
                j = 1
                u = g
                return j | 0
            } else {
                gd(a, 0, 0)
                j = 1
                u = g
                return j | 0
            }
            return 0
        }
        function Ac(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                I = 0,
                J = 0,
                K = 0,
                L = 0,
                M = 0
            d = u
            u = (u + 32) | 0
            e = (d + 12) | 0
            g = (d + 8) | 0
            h = (d + 4) | 0
            i = d
            j = (a + 8) | 0
            a: do
                if (
                    f[j >> 2] | 0
                        ? ((k = f[a >> 2] | 0),
                          (l = (a + 4) | 0),
                          (f[a >> 2] = l),
                          (f[((f[l >> 2] | 0) + 8) >> 2] = 0),
                          (f[l >> 2] = 0),
                          (f[j >> 2] = 0),
                          (m = f[(k + 4) >> 2] | 0),
                          (n = (m | 0) == 0 ? k : m),
                          n | 0)
                        : 0
                ) {
                    m = (a + 4) | 0
                    k = n
                    n = f[b >> 2] | 0
                    while (1) {
                        if ((n | 0) == (f[c >> 2] | 0)) break
                        o = (k + 16) | 0
                        f[o >> 2] = f[(n + 16) >> 2]
                        if ((k | 0) != (n | 0)) {
                            f[h >> 2] = f[(n + 20) >> 2]
                            f[i >> 2] = n + 24
                            f[g >> 2] = f[h >> 2]
                            f[e >> 2] = f[i >> 2]
                            Hc((k + 20) | 0, g, e)
                        }
                        p = (k + 8) | 0
                        q = f[p >> 2] | 0
                        do
                            if (q) {
                                r = f[q >> 2] | 0
                                if ((r | 0) == (k | 0)) {
                                    f[q >> 2] = 0
                                    s = f[(q + 4) >> 2] | 0
                                    if (!s) {
                                        t = q
                                        break
                                    } else v = s
                                    while (1) {
                                        s = f[v >> 2] | 0
                                        if (s | 0) {
                                            v = s
                                            continue
                                        }
                                        s = f[(v + 4) >> 2] | 0
                                        if (!s) break
                                        else v = s
                                    }
                                    t = v
                                    break
                                } else {
                                    f[(q + 4) >> 2] = 0
                                    if (!r) {
                                        t = q
                                        break
                                    } else w = r
                                    while (1) {
                                        s = f[w >> 2] | 0
                                        if (s | 0) {
                                            w = s
                                            continue
                                        }
                                        s = f[(w + 4) >> 2] | 0
                                        if (!s) break
                                        else w = s
                                    }
                                    t = w
                                    break
                                }
                            } else t = 0
                        while (0)
                        q = f[l >> 2] | 0
                        do
                            if (q) {
                                r = f[o >> 2] | 0
                                s = q
                                while (1) {
                                    if ((r | 0) < (f[(s + 16) >> 2] | 0)) {
                                        x = f[s >> 2] | 0
                                        if (!x) {
                                            y = 22
                                            break
                                        } else z = x
                                    } else {
                                        A = (s + 4) | 0
                                        x = f[A >> 2] | 0
                                        if (!x) {
                                            y = 25
                                            break
                                        } else z = x
                                    }
                                    s = z
                                }
                                if ((y | 0) == 22) {
                                    y = 0
                                    B = s
                                    C = s
                                    break
                                } else if ((y | 0) == 25) {
                                    y = 0
                                    B = s
                                    C = A
                                    break
                                }
                            } else {
                                B = l
                                C = l
                            }
                        while (0)
                        f[k >> 2] = 0
                        f[(k + 4) >> 2] = 0
                        f[p >> 2] = B
                        f[C >> 2] = k
                        q = f[f[a >> 2] >> 2] | 0
                        if (!q) D = k
                        else {
                            f[a >> 2] = q
                            D = f[C >> 2] | 0
                        }
                        Ae(f[m >> 2] | 0, D)
                        f[j >> 2] = (f[j >> 2] | 0) + 1
                        q = f[(n + 4) >> 2] | 0
                        if (!q) {
                            o = (n + 8) | 0
                            r = f[o >> 2] | 0
                            if ((f[r >> 2] | 0) == (n | 0)) E = r
                            else {
                                r = o
                                do {
                                    o = f[r >> 2] | 0
                                    r = (o + 8) | 0
                                    x = f[r >> 2] | 0
                                } while ((f[x >> 2] | 0) != (o | 0))
                                E = x
                            }
                        } else {
                            r = q
                            while (1) {
                                p = f[r >> 2] | 0
                                if (!p) break
                                else r = p
                            }
                            E = r
                        }
                        f[b >> 2] = E
                        if (!t) break a
                        else {
                            k = t
                            n = E
                        }
                    }
                    n = f[(k + 8) >> 2] | 0
                    if (!n) F = k
                    else {
                        m = n
                        while (1) {
                            n = f[(m + 8) >> 2] | 0
                            if (!n) break
                            else m = n
                        }
                        F = m
                    }
                    Dj(a, F)
                }
            while (0)
            F = f[b >> 2] | 0
            E = f[c >> 2] | 0
            if ((F | 0) == (E | 0)) {
                u = d
                return
            }
            c = (a + 4) | 0
            t = (a + 4) | 0
            D = F
            while (1) {
                tg(e, a, (D + 16) | 0)
                F = f[c >> 2] | 0
                do
                    if (F) {
                        C = f[e >> 2] | 0
                        B = f[(C + 16) >> 2] | 0
                        A = F
                        while (1) {
                            if ((B | 0) < (f[(A + 16) >> 2] | 0)) {
                                z = f[A >> 2] | 0
                                if (!z) {
                                    y = 43
                                    break
                                } else G = z
                            } else {
                                H = (A + 4) | 0
                                z = f[H >> 2] | 0
                                if (!z) {
                                    y = 46
                                    break
                                } else G = z
                            }
                            A = G
                        }
                        if ((y | 0) == 43) {
                            y = 0
                            I = A
                            J = A
                            K = C
                            break
                        } else if ((y | 0) == 46) {
                            y = 0
                            I = A
                            J = H
                            K = C
                            break
                        }
                    } else {
                        I = c
                        J = c
                        K = f[e >> 2] | 0
                    }
                while (0)
                f[K >> 2] = 0
                f[(K + 4) >> 2] = 0
                f[(K + 8) >> 2] = I
                f[J >> 2] = K
                F = f[f[a >> 2] >> 2] | 0
                if (!F) L = K
                else {
                    f[a >> 2] = F
                    L = f[J >> 2] | 0
                }
                Ae(f[t >> 2] | 0, L)
                f[j >> 2] = (f[j >> 2] | 0) + 1
                F = f[(D + 4) >> 2] | 0
                if (!F) {
                    m = (D + 8) | 0
                    B = f[m >> 2] | 0
                    if ((f[B >> 2] | 0) == (D | 0)) M = B
                    else {
                        B = m
                        do {
                            m = f[B >> 2] | 0
                            B = (m + 8) | 0
                            r = f[B >> 2] | 0
                        } while ((f[r >> 2] | 0) != (m | 0))
                        M = r
                    }
                } else {
                    B = F
                    while (1) {
                        r = f[B >> 2] | 0
                        if (!r) break
                        else B = r
                    }
                    M = B
                }
                f[b >> 2] = M
                if ((M | 0) == (E | 0)) break
                else D = M
            }
            u = d
            return
        }
        function Bc(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                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
            g = (a + 8) | 0
            Ah(g, b, d, e)
            d = e >>> 0 > 1073741823 ? -1 : e << 2
            h = _q(d) | 0
            hj(h | 0, 0, d | 0) | 0
            d = f[(a + 48) >> 2] | 0
            i = f[(a + 56) >> 2] | 0
            j = f[i >> 2] | 0
            k = ((f[(i + 4) >> 2] | 0) - j) | 0
            l = k >> 2
            a: do
                if ((k | 0) > 4) {
                    m = f[(a + 52) >> 2] | 0
                    n = (a + 16) | 0
                    o = (a + 32) | 0
                    p = (a + 12) | 0
                    q = (a + 28) | 0
                    r = (a + 20) | 0
                    s = (a + 24) | 0
                    t = (d + 12) | 0
                    u = (e | 0) > 0
                    v = j
                    w = l
                    while (1) {
                        x = w
                        w = (w + -1) | 0
                        if (l >>> 0 <= w >>> 0) break
                        y = f[(v + (w << 2)) >> 2] | 0
                        z = X(w, e) | 0
                        if ((y | 0) != -1 ? ((A = f[((f[t >> 2] | 0) + (y << 2)) >> 2] | 0), (A | 0) != -1) : 0) {
                            y = f[d >> 2] | 0
                            B = f[m >> 2] | 0
                            C = f[(B + (f[(y + (A << 2)) >> 2] << 2)) >> 2] | 0
                            D = (A + 1) | 0
                            E = ((D >>> 0) % 3 | 0 | 0) == 0 ? (A + -2) | 0 : D
                            if ((E | 0) == -1) F = -1
                            else F = f[(y + (E << 2)) >> 2] | 0
                            E = f[(B + (F << 2)) >> 2] | 0
                            D = ((((A >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + A) | 0
                            if ((D | 0) == -1) G = -1
                            else G = f[(y + (D << 2)) >> 2] | 0
                            D = f[(B + (G << 2)) >> 2] | 0
                            if (((C | 0) < (w | 0)) & ((E | 0) < (w | 0)) & ((D | 0) < (w | 0))) {
                                B = X(C, e) | 0
                                C = X(E, e) | 0
                                E = X(D, e) | 0
                                if (u) {
                                    D = 0
                                    do {
                                        f[(h + (D << 2)) >> 2] = (f[(b + ((D + E) << 2)) >> 2] | 0) + (f[(b + ((D + C) << 2)) >> 2] | 0) - (f[(b + ((D + B) << 2)) >> 2] | 0)
                                        D = (D + 1) | 0
                                    } while ((D | 0) != (e | 0))
                                }
                                D = (b + (z << 2)) | 0
                                B = (c + (z << 2)) | 0
                                C = f[g >> 2] | 0
                                if ((C | 0) > 0) {
                                    E = 0
                                    y = h
                                    A = C
                                    while (1) {
                                        if ((A | 0) > 0) {
                                            C = 0
                                            do {
                                                H = f[(y + (C << 2)) >> 2] | 0
                                                I = f[n >> 2] | 0
                                                if ((H | 0) > (I | 0)) {
                                                    J = f[o >> 2] | 0
                                                    f[(J + (C << 2)) >> 2] = I
                                                    K = J
                                                } else {
                                                    J = f[p >> 2] | 0
                                                    I = f[o >> 2] | 0
                                                    f[(I + (C << 2)) >> 2] = (H | 0) < (J | 0) ? J : H
                                                    K = I
                                                }
                                                C = (C + 1) | 0
                                            } while ((C | 0) < (f[g >> 2] | 0))
                                            L = K
                                        } else L = f[o >> 2] | 0
                                        C = ((f[(D + (E << 2)) >> 2] | 0) - (f[(L + (E << 2)) >> 2] | 0)) | 0
                                        I = (B + (E << 2)) | 0
                                        f[I >> 2] = C
                                        if ((C | 0) >= (f[q >> 2] | 0)) {
                                            if ((C | 0) > (f[s >> 2] | 0)) {
                                                M = (C - (f[r >> 2] | 0)) | 0
                                                N = 42
                                            }
                                        } else {
                                            M = ((f[r >> 2] | 0) + C) | 0
                                            N = 42
                                        }
                                        if ((N | 0) == 42) {
                                            N = 0
                                            f[I >> 2] = M
                                        }
                                        E = (E + 1) | 0
                                        A = f[g >> 2] | 0
                                        if ((E | 0) >= (A | 0)) break
                                        else y = L
                                    }
                                }
                            } else N = 16
                        } else N = 16
                        if ((N | 0) == 16 ? ((N = 0), (y = (b + (z << 2)) | 0), (A = (c + (z << 2)) | 0), (E = f[g >> 2] | 0), (E | 0) > 0) : 0) {
                            B = 0
                            D = (b + ((X((x + -2) | 0, e) | 0) << 2)) | 0
                            I = E
                            while (1) {
                                if ((I | 0) > 0) {
                                    E = 0
                                    do {
                                        C = f[(D + (E << 2)) >> 2] | 0
                                        H = f[n >> 2] | 0
                                        if ((C | 0) > (H | 0)) {
                                            J = f[o >> 2] | 0
                                            f[(J + (E << 2)) >> 2] = H
                                            O = J
                                        } else {
                                            J = f[p >> 2] | 0
                                            H = f[o >> 2] | 0
                                            f[(H + (E << 2)) >> 2] = (C | 0) < (J | 0) ? J : C
                                            O = H
                                        }
                                        E = (E + 1) | 0
                                    } while ((E | 0) < (f[g >> 2] | 0))
                                    P = O
                                } else P = f[o >> 2] | 0
                                E = ((f[(y + (B << 2)) >> 2] | 0) - (f[(P + (B << 2)) >> 2] | 0)) | 0
                                H = (A + (B << 2)) | 0
                                f[H >> 2] = E
                                if ((E | 0) >= (f[q >> 2] | 0)) {
                                    if ((E | 0) > (f[s >> 2] | 0)) {
                                        Q = (E - (f[r >> 2] | 0)) | 0
                                        N = 29
                                    }
                                } else {
                                    Q = ((f[r >> 2] | 0) + E) | 0
                                    N = 29
                                }
                                if ((N | 0) == 29) {
                                    N = 0
                                    f[H >> 2] = Q
                                }
                                B = (B + 1) | 0
                                I = f[g >> 2] | 0
                                if ((B | 0) >= (I | 0)) break
                                else D = P
                            }
                        }
                        if ((x | 0) <= 2) break a
                    }
                    mq(i)
                }
            while (0)
            if ((e | 0) > 0) hj(h | 0, 0, (e << 2) | 0) | 0
            e = f[g >> 2] | 0
            if ((e | 0) <= 0) {
                $q(h)
                return 1
            }
            i = (a + 16) | 0
            P = (a + 32) | 0
            Q = (a + 12) | 0
            O = (a + 28) | 0
            L = (a + 20) | 0
            M = (a + 24) | 0
            a = 0
            K = h
            G = e
            while (1) {
                if ((G | 0) > 0) {
                    e = 0
                    do {
                        F = f[(K + (e << 2)) >> 2] | 0
                        d = f[i >> 2] | 0
                        if ((F | 0) > (d | 0)) {
                            l = f[P >> 2] | 0
                            f[(l + (e << 2)) >> 2] = d
                            R = l
                        } else {
                            l = f[Q >> 2] | 0
                            d = f[P >> 2] | 0
                            f[(d + (e << 2)) >> 2] = (F | 0) < (l | 0) ? l : F
                            R = d
                        }
                        e = (e + 1) | 0
                    } while ((e | 0) < (f[g >> 2] | 0))
                    S = R
                } else S = f[P >> 2] | 0
                e = ((f[(b + (a << 2)) >> 2] | 0) - (f[(S + (a << 2)) >> 2] | 0)) | 0
                d = (c + (a << 2)) | 0
                f[d >> 2] = e
                if ((e | 0) >= (f[O >> 2] | 0)) {
                    if ((e | 0) > (f[M >> 2] | 0)) {
                        T = (e - (f[L >> 2] | 0)) | 0
                        N = 56
                    }
                } else {
                    T = ((f[L >> 2] | 0) + e) | 0
                    N = 56
                }
                if ((N | 0) == 56) {
                    N = 0
                    f[d >> 2] = T
                }
                a = (a + 1) | 0
                G = f[g >> 2] | 0
                if ((a | 0) >= (G | 0)) break
                else K = S
            }
            $q(h)
            return 1
        }
        function Cc(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                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
            g = (a + 8) | 0
            Ah(g, b, d, e)
            d = e >>> 0 > 1073741823 ? -1 : e << 2
            h = _q(d) | 0
            hj(h | 0, 0, d | 0) | 0
            d = f[(a + 48) >> 2] | 0
            i = f[(a + 56) >> 2] | 0
            j = f[i >> 2] | 0
            k = ((f[(i + 4) >> 2] | 0) - j) | 0
            l = k >> 2
            a: do
                if ((k | 0) > 4) {
                    m = f[(a + 52) >> 2] | 0
                    n = (a + 16) | 0
                    o = (a + 32) | 0
                    p = (a + 12) | 0
                    q = (a + 28) | 0
                    r = (a + 20) | 0
                    s = (a + 24) | 0
                    t = (d + 64) | 0
                    u = (d + 28) | 0
                    v = (e | 0) > 0
                    w = j
                    x = l
                    while (1) {
                        y = x
                        x = (x + -1) | 0
                        if (l >>> 0 <= x >>> 0) break
                        z = f[(w + (x << 2)) >> 2] | 0
                        A = X(x, e) | 0
                        if (
                            (
                                ((z | 0) != -1 ? ((f[((f[d >> 2] | 0) + ((z >>> 5) << 2)) >> 2] & (1 << (z & 31))) | 0) == 0 : 0)
                                    ? ((B = f[((f[((f[t >> 2] | 0) + 12) >> 2] | 0) + (z << 2)) >> 2] | 0), (B | 0) != -1)
                                    : 0
                            )
                                ? ((z = f[u >> 2] | 0),
                                  (C = f[m >> 2] | 0),
                                  (D = f[(C + (f[(z + (B << 2)) >> 2] << 2)) >> 2] | 0),
                                  (E = (B + 1) | 0),
                                  (F = f[(C + (f[(z + ((((E >>> 0) % 3 | 0 | 0) == 0 ? (B + -2) | 0 : E) << 2)) >> 2] << 2)) >> 2] | 0),
                                  (E = f[(C + (f[(z + (((((B >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + B) << 2)) >> 2] << 2)) >> 2] | 0),
                                  ((D | 0) < (x | 0)) & ((F | 0) < (x | 0)) & ((E | 0) < (x | 0)))
                                : 0
                        ) {
                            B = X(D, e) | 0
                            D = X(F, e) | 0
                            F = X(E, e) | 0
                            if (v) {
                                E = 0
                                do {
                                    f[(h + (E << 2)) >> 2] = (f[(b + ((E + F) << 2)) >> 2] | 0) + (f[(b + ((E + D) << 2)) >> 2] | 0) - (f[(b + ((E + B) << 2)) >> 2] | 0)
                                    E = (E + 1) | 0
                                } while ((E | 0) != (e | 0))
                            }
                            E = (b + (A << 2)) | 0
                            B = (c + (A << 2)) | 0
                            D = f[g >> 2] | 0
                            if ((D | 0) > 0) {
                                F = 0
                                z = h
                                C = D
                                while (1) {
                                    if ((C | 0) > 0) {
                                        D = 0
                                        do {
                                            G = f[(z + (D << 2)) >> 2] | 0
                                            H = f[n >> 2] | 0
                                            if ((G | 0) > (H | 0)) {
                                                I = f[o >> 2] | 0
                                                f[(I + (D << 2)) >> 2] = H
                                                J = I
                                            } else {
                                                I = f[p >> 2] | 0
                                                H = f[o >> 2] | 0
                                                f[(H + (D << 2)) >> 2] = (G | 0) < (I | 0) ? I : G
                                                J = H
                                            }
                                            D = (D + 1) | 0
                                        } while ((D | 0) < (f[g >> 2] | 0))
                                        K = J
                                    } else K = f[o >> 2] | 0
                                    D = ((f[(E + (F << 2)) >> 2] | 0) - (f[(K + (F << 2)) >> 2] | 0)) | 0
                                    H = (B + (F << 2)) | 0
                                    f[H >> 2] = D
                                    if ((D | 0) >= (f[q >> 2] | 0)) {
                                        if ((D | 0) > (f[s >> 2] | 0)) {
                                            L = (D - (f[r >> 2] | 0)) | 0
                                            M = 39
                                        }
                                    } else {
                                        L = ((f[r >> 2] | 0) + D) | 0
                                        M = 39
                                    }
                                    if ((M | 0) == 39) {
                                        M = 0
                                        f[H >> 2] = L
                                    }
                                    F = (F + 1) | 0
                                    C = f[g >> 2] | 0
                                    if ((F | 0) >= (C | 0)) break
                                    else z = K
                                }
                            }
                        } else M = 13
                        if ((M | 0) == 13 ? ((M = 0), (z = (b + (A << 2)) | 0), (C = (c + (A << 2)) | 0), (F = f[g >> 2] | 0), (F | 0) > 0) : 0) {
                            B = 0
                            E = (b + ((X((y + -2) | 0, e) | 0) << 2)) | 0
                            H = F
                            while (1) {
                                if ((H | 0) > 0) {
                                    F = 0
                                    do {
                                        D = f[(E + (F << 2)) >> 2] | 0
                                        G = f[n >> 2] | 0
                                        if ((D | 0) > (G | 0)) {
                                            I = f[o >> 2] | 0
                                            f[(I + (F << 2)) >> 2] = G
                                            N = I
                                        } else {
                                            I = f[p >> 2] | 0
                                            G = f[o >> 2] | 0
                                            f[(G + (F << 2)) >> 2] = (D | 0) < (I | 0) ? I : D
                                            N = G
                                        }
                                        F = (F + 1) | 0
                                    } while ((F | 0) < (f[g >> 2] | 0))
                                    O = N
                                } else O = f[o >> 2] | 0
                                F = ((f[(z + (B << 2)) >> 2] | 0) - (f[(O + (B << 2)) >> 2] | 0)) | 0
                                G = (C + (B << 2)) | 0
                                f[G >> 2] = F
                                if ((F | 0) >= (f[q >> 2] | 0)) {
                                    if ((F | 0) > (f[s >> 2] | 0)) {
                                        P = (F - (f[r >> 2] | 0)) | 0
                                        M = 26
                                    }
                                } else {
                                    P = ((f[r >> 2] | 0) + F) | 0
                                    M = 26
                                }
                                if ((M | 0) == 26) {
                                    M = 0
                                    f[G >> 2] = P
                                }
                                B = (B + 1) | 0
                                H = f[g >> 2] | 0
                                if ((B | 0) >= (H | 0)) break
                                else E = O
                            }
                        }
                        if ((y | 0) <= 2) break a
                    }
                    mq(i)
                }
            while (0)
            if ((e | 0) > 0) hj(h | 0, 0, (e << 2) | 0) | 0
            e = f[g >> 2] | 0
            if ((e | 0) <= 0) {
                $q(h)
                return 1
            }
            i = (a + 16) | 0
            O = (a + 32) | 0
            P = (a + 12) | 0
            N = (a + 28) | 0
            K = (a + 20) | 0
            L = (a + 24) | 0
            a = 0
            J = h
            d = e
            while (1) {
                if ((d | 0) > 0) {
                    e = 0
                    do {
                        l = f[(J + (e << 2)) >> 2] | 0
                        j = f[i >> 2] | 0
                        if ((l | 0) > (j | 0)) {
                            k = f[O >> 2] | 0
                            f[(k + (e << 2)) >> 2] = j
                            Q = k
                        } else {
                            k = f[P >> 2] | 0
                            j = f[O >> 2] | 0
                            f[(j + (e << 2)) >> 2] = (l | 0) < (k | 0) ? k : l
                            Q = j
                        }
                        e = (e + 1) | 0
                    } while ((e | 0) < (f[g >> 2] | 0))
                    R = Q
                } else R = f[O >> 2] | 0
                e = ((f[(b + (a << 2)) >> 2] | 0) - (f[(R + (a << 2)) >> 2] | 0)) | 0
                j = (c + (a << 2)) | 0
                f[j >> 2] = e
                if ((e | 0) >= (f[N >> 2] | 0)) {
                    if ((e | 0) > (f[L >> 2] | 0)) {
                        S = (e - (f[K >> 2] | 0)) | 0
                        M = 53
                    }
                } else {
                    S = ((f[K >> 2] | 0) + e) | 0
                    M = 53
                }
                if ((M | 0) == 53) {
                    M = 0
                    f[j >> 2] = S
                }
                a = (a + 1) | 0
                d = f[g >> 2] | 0
                if ((a | 0) >= (d | 0)) break
                else J = R
            }
            $q(h)
            return 1
        }
        function Dc(a, c, d, e, g) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                J = 0
            h = u
            u = (u + 48) | 0
            i = (h + 28) | 0
            j = (h + 24) | 0
            k = h
            l = (h + 12) | 0
            m = (h + 40) | 0
            if ((c | 0) < 0) {
                n = 0
                u = h
                return n | 0
            }
            if (!c) {
                n = 1
                u = h
                return n | 0
            }
            o = (d | 0) > 1
            p = o ? d : 1
            f[k >> 2] = 0
            d = (k + 4) | 0
            f[d >> 2] = 0
            f[(k + 8) >> 2] = 0
            $j(k, c)
            q = (k + 8) | 0
            if (o) {
                o = 0
                r = 0
                while (1) {
                    s = 1
                    t = f[(a + (r << 2)) >> 2] | 0
                    do {
                        v = f[(a + ((s + r) << 2)) >> 2] | 0
                        t = t >>> 0 < v >>> 0 ? v : t
                        s = (s + 1) | 0
                    } while ((s | 0) != (p | 0))
                    s = (_(t | 0) | 0) ^ 31
                    v = t >>> 0 > o >>> 0 ? t : o
                    w = (t | 0) == 0 ? 1 : (s + 1) | 0
                    f[i >> 2] = w
                    s = f[d >> 2] | 0
                    if (s >>> 0 < (f[q >> 2] | 0) >>> 0) {
                        f[s >> 2] = w
                        f[d >> 2] = s + 4
                    } else Ci(k, i)
                    r = (r + p) | 0
                    if ((r | 0) >= (c | 0)) {
                        x = v
                        break
                    } else o = v
                }
            } else {
                o = 0
                r = 0
                while (1) {
                    v = f[(a + (o << 2)) >> 2] | 0
                    s = (_(v | 0) | 0) ^ 31
                    w = v >>> 0 > r >>> 0 ? v : r
                    y = (v | 0) == 0 ? 1 : (s + 1) | 0
                    f[i >> 2] = y
                    s = f[d >> 2] | 0
                    if (s >>> 0 < (f[q >> 2] | 0) >>> 0) {
                        f[s >> 2] = y
                        f[d >> 2] = s + 4
                    } else Ci(k, i)
                    o = (o + p) | 0
                    if ((o | 0) >= (c | 0)) {
                        x = w
                        break
                    } else r = w
                }
            }
            f[l >> 2] = 0
            r = (l + 4) | 0
            f[r >> 2] = 0
            f[(l + 8) >> 2] = 0
            o = f[k >> 2] | 0
            q = ((f[d >> 2] | 0) - o) | 0
            w = q >> 2
            if (w) {
                if (w >>> 0 > 1073741823) mq(l)
                s = dn(q) | 0
                f[r >> 2] = s
                f[l >> 2] = s
                f[(l + 8) >> 2] = s + (w << 2)
                w = s
                if ((q | 0) > 0) {
                    y = (s + ((q >>> 2) << 2)) | 0
                    Rg(s | 0, o | 0, q | 0) | 0
                    f[r >> 2] = y
                    q = (y - w) >> 2
                    if ((y | 0) == (s | 0)) {
                        z = q
                        A = s
                        B = 0
                        C = 0
                    } else {
                        y = 0
                        o = 0
                        v = 0
                        while (1) {
                            D = Tn(o | 0, v | 0, f[(s + (y << 2)) >> 2] | 0, 0) | 0
                            E = I
                            y = (y + 1) | 0
                            if (y >>> 0 >= q >>> 0) {
                                z = q
                                A = s
                                B = D
                                C = E
                                break
                            } else {
                                o = D
                                v = E
                            }
                        }
                    }
                } else {
                    F = w
                    G = 18
                }
            } else {
                F = 0
                G = 18
            }
            if ((G | 0) == 18) {
                z = 0
                A = F
                B = 0
                C = 0
            }
            F = rg(A, z, 32, i) | 0
            z = I
            A = f[i >> 2] << 3
            w = Rn(A | 0, ((((A | 0) < 0) << 31) >> 31) | 0, 1) | 0
            A = I
            v = on(B | 0, C | 0, p | 0, 0) | 0
            C = Tn(F | 0, z | 0, v | 0, I | 0) | 0
            v = Tn(C | 0, I | 0, w | 0, A | 0) | 0
            A = I
            w = f[l >> 2] | 0
            if (w | 0) {
                l = f[r >> 2] | 0
                if ((l | 0) != (w | 0)) f[r >> 2] = l + (~(((l + -4 - w) | 0) >>> 2) << 2)
                br(w)
            }
            w = rg(a, c, x, i) | 0
            l = f[i >> 2] | 0
            r = (((((x - l) | 0) / 64) | 0) + l) << 3
            C = l << 3
            z = Tn(w | 0, I | 0, C | 0, ((((C | 0) < 0) << 31) >> 31) | 0) | 0
            C = Tn(z | 0, I | 0, r | 0, ((((r | 0) < 0) << 31) >> 31) | 0) | 0
            r = I
            z = (_((x >>> 0 > 1 ? x : 1) | 0) | 0) ^ 30
            if (e) {
                f[i >> 2] = 0
                f[(i + 4) >> 2] = 0
                f[(i + 8) >> 2] = 0
                w = dn(32) | 0
                f[i >> 2] = w
                f[(i + 8) >> 2] = -2147483616
                f[(i + 4) >> 2] = 22
                F = w
                B = 13044
                o = (F + 22) | 0
                do {
                    b[F >> 0] = b[B >> 0] | 0
                    F = (F + 1) | 0
                    B = (B + 1) | 0
                } while ((F | 0) < (o | 0))
                b[(w + 22) >> 0] = 0
                w = (sh(e, i) | 0) == 0
                if ((b[(i + 11) >> 0] | 0) < 0) br(f[i >> 2] | 0)
                if (!w) {
                    f[i >> 2] = 0
                    f[(i + 4) >> 2] = 0
                    f[(i + 8) >> 2] = 0
                    w = dn(32) | 0
                    f[i >> 2] = w
                    f[(i + 8) >> 2] = -2147483616
                    f[(i + 4) >> 2] = 22
                    F = w
                    B = 13044
                    o = (F + 22) | 0
                    do {
                        b[F >> 0] = b[B >> 0] | 0
                        F = (F + 1) | 0
                        B = (B + 1) | 0
                    } while ((F | 0) < (o | 0))
                    b[(w + 22) >> 0] = 0
                    w = Ck(e, i) | 0
                    if ((b[(i + 11) >> 0] | 0) < 0) br(f[i >> 2] | 0)
                    H = w
                } else G = 32
            } else G = 32
            if ((G | 0) == 32) H = (z >>> 0 < 18) & (((A | 0) > (r | 0)) | (((A | 0) == (r | 0)) & (v >>> 0 >= C >>> 0))) & 1
            b[m >> 0] = H
            C = (g + 16) | 0
            v = f[(C + 4) >> 2] | 0
            if (!(((v | 0) > 0) | (((v | 0) == 0) & ((f[C >> 2] | 0) >>> 0 > 0)))) {
                f[j >> 2] = f[(g + 4) >> 2]
                f[i >> 2] = f[j >> 2]
                ye(g, i, m, (m + 1) | 0) | 0
            }
            switch (H | 0) {
                case 0: {
                    J = md(a, c, p, k, g) | 0
                    break
                }
                case 1: {
                    J = Nc(a, c, x, l, e, g) | 0
                    break
                }
                default:
                    J = 0
            }
            g = f[k >> 2] | 0
            if (g | 0) {
                k = f[d >> 2] | 0
                if ((k | 0) != (g | 0)) f[d >> 2] = k + (~(((k + -4 - g) | 0) >>> 2) << 2)
                br(g)
            }
            n = J
            u = h
            return n | 0
        }
        function Ec(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                u = 0,
                v = 0
            if ((b | 0) < 0) return
            c = (a + 12) | 0
            d = f[c >> 2] | 0
            e = f[(a + 8) >> 2] | 0
            g = e
            h = d
            if (((d - e) >> 2) >>> 0 <= b >>> 0) return
            e = (g + (b << 2)) | 0
            d = f[((f[e >> 2] | 0) + 56) >> 2] | 0
            i = f[((f[(g + (b << 2)) >> 2] | 0) + 60) >> 2] | 0
            g = (e + 4) | 0
            if ((g | 0) != (h | 0)) {
                j = g
                g = e
                do {
                    k = f[j >> 2] | 0
                    f[j >> 2] = 0
                    l = f[g >> 2] | 0
                    f[g >> 2] = k
                    if (l | 0) {
                        k = (l + 88) | 0
                        m = f[k >> 2] | 0
                        f[k >> 2] = 0
                        if (m | 0) {
                            k = f[(m + 8) >> 2] | 0
                            if (k | 0) {
                                n = (m + 12) | 0
                                if ((f[n >> 2] | 0) != (k | 0)) f[n >> 2] = k
                                br(k)
                            }
                            br(m)
                        }
                        m = f[(l + 68) >> 2] | 0
                        if (m | 0) {
                            k = (l + 72) | 0
                            n = f[k >> 2] | 0
                            if ((n | 0) != (m | 0)) f[k >> 2] = n + (~(((n + -4 - m) | 0) >>> 2) << 2)
                            br(m)
                        }
                        m = (l + 64) | 0
                        n = f[m >> 2] | 0
                        f[m >> 2] = 0
                        if (n | 0) {
                            m = f[n >> 2] | 0
                            if (m | 0) {
                                k = (n + 4) | 0
                                if ((f[k >> 2] | 0) != (m | 0)) f[k >> 2] = m
                                br(m)
                            }
                            br(n)
                        }
                        br(l)
                    }
                    j = (j + 4) | 0
                    g = (g + 4) | 0
                } while ((j | 0) != (h | 0))
                j = f[c >> 2] | 0
                if ((j | 0) != (g | 0)) {
                    o = g
                    p = j
                    q = 24
                }
            } else {
                o = e
                p = h
                q = 24
            }
            if ((q | 0) == 24) {
                q = p
                do {
                    p = (q + -4) | 0
                    f[c >> 2] = p
                    h = f[p >> 2] | 0
                    f[p >> 2] = 0
                    if (h | 0) {
                        p = (h + 88) | 0
                        e = f[p >> 2] | 0
                        f[p >> 2] = 0
                        if (e | 0) {
                            p = f[(e + 8) >> 2] | 0
                            if (p | 0) {
                                j = (e + 12) | 0
                                if ((f[j >> 2] | 0) != (p | 0)) f[j >> 2] = p
                                br(p)
                            }
                            br(e)
                        }
                        e = f[(h + 68) >> 2] | 0
                        if (e | 0) {
                            p = (h + 72) | 0
                            j = f[p >> 2] | 0
                            if ((j | 0) != (e | 0)) f[p >> 2] = j + (~(((j + -4 - e) | 0) >>> 2) << 2)
                            br(e)
                        }
                        e = (h + 64) | 0
                        j = f[e >> 2] | 0
                        f[e >> 2] = 0
                        if (j | 0) {
                            e = f[j >> 2] | 0
                            if (e | 0) {
                                p = (j + 4) | 0
                                if ((f[p >> 2] | 0) != (e | 0)) f[p >> 2] = e
                                br(e)
                            }
                            br(j)
                        }
                        br(h)
                    }
                    q = f[c >> 2] | 0
                } while ((q | 0) != (o | 0))
            }
            o = f[(a + 4) >> 2] | 0
            a: do
                if (o | 0) {
                    q = (o + 44) | 0
                    c = f[q >> 2] | 0
                    h = f[(o + 40) >> 2] | 0
                    while (1) {
                        if ((h | 0) == (c | 0)) break a
                        r = (h + 4) | 0
                        if ((f[((f[h >> 2] | 0) + 40) >> 2] | 0) == (i | 0)) break
                        else h = r
                    }
                    if ((r | 0) != (c | 0)) {
                        j = r
                        e = h
                        do {
                            p = f[j >> 2] | 0
                            f[j >> 2] = 0
                            g = f[e >> 2] | 0
                            f[e >> 2] = p
                            if (g | 0) {
                                Qi(g)
                                br(g)
                            }
                            j = (j + 4) | 0
                            e = (e + 4) | 0
                        } while ((j | 0) != (c | 0))
                        j = f[q >> 2] | 0
                        if ((j | 0) == (e | 0)) break
                        else {
                            s = e
                            t = j
                        }
                    } else {
                        s = h
                        t = c
                    }
                    j = t
                    do {
                        g = (j + -4) | 0
                        f[q >> 2] = g
                        p = f[g >> 2] | 0
                        f[g >> 2] = 0
                        if (p | 0) {
                            Qi(p)
                            br(p)
                        }
                        j = f[q >> 2] | 0
                    } while ((j | 0) != (s | 0))
                }
            while (0)
            b: do
                if ((d | 0) < 5) {
                    s = f[(a + 20 + ((d * 12) | 0)) >> 2] | 0
                    t = (a + 20 + ((d * 12) | 0) + 4) | 0
                    r = f[t >> 2] | 0
                    i = r
                    c: do
                        if ((s | 0) == (r | 0)) u = s
                        else {
                            o = s
                            while (1) {
                                if ((f[o >> 2] | 0) == (b | 0)) {
                                    u = o
                                    break c
                                }
                                o = (o + 4) | 0
                                if ((o | 0) == (r | 0)) break b
                            }
                        }
                    while (0)
                    if ((u | 0) != (r | 0)) {
                        s = (u + 4) | 0
                        o = (i - s) | 0
                        j = o >> 2
                        if (!j) v = r
                        else {
                            Xl(u | 0, s | 0, o | 0) | 0
                            v = f[t >> 2] | 0
                        }
                        o = (u + (j << 2)) | 0
                        if ((v | 0) != (o | 0)) f[t >> 2] = v + (~(((v + -4 - o) | 0) >>> 2) << 2)
                    }
                }
            while (0)
            v = f[(a + 24) >> 2] | 0
            u = f[(a + 20) >> 2] | 0
            d = u
            if ((v | 0) != (u | 0)) {
                o = (v - u) >> 2
                u = 0
                do {
                    v = (d + (u << 2)) | 0
                    j = f[v >> 2] | 0
                    if ((j | 0) > (b | 0)) f[v >> 2] = j + -1
                    u = (u + 1) | 0
                } while (u >>> 0 < o >>> 0)
            }
            o = f[(a + 36) >> 2] | 0
            u = f[(a + 32) >> 2] | 0
            d = u
            if ((o | 0) != (u | 0)) {
                j = (o - u) >> 2
                u = 0
                do {
                    o = (d + (u << 2)) | 0
                    v = f[o >> 2] | 0
                    if ((v | 0) > (b | 0)) f[o >> 2] = v + -1
                    u = (u + 1) | 0
                } while (u >>> 0 < j >>> 0)
            }
            j = f[(a + 48) >> 2] | 0
            u = f[(a + 44) >> 2] | 0
            d = u
            if ((j | 0) != (u | 0)) {
                v = (j - u) >> 2
                u = 0
                do {
                    j = (d + (u << 2)) | 0
                    o = f[j >> 2] | 0
                    if ((o | 0) > (b | 0)) f[j >> 2] = o + -1
                    u = (u + 1) | 0
                } while (u >>> 0 < v >>> 0)
            }
            v = f[(a + 60) >> 2] | 0
            u = f[(a + 56) >> 2] | 0
            d = u
            if ((v | 0) != (u | 0)) {
                o = (v - u) >> 2
                u = 0
                do {
                    v = (d + (u << 2)) | 0
                    j = f[v >> 2] | 0
                    if ((j | 0) > (b | 0)) f[v >> 2] = j + -1
                    u = (u + 1) | 0
                } while (u >>> 0 < o >>> 0)
            }
            o = f[(a + 72) >> 2] | 0
            u = f[(a + 68) >> 2] | 0
            a = u
            if ((o | 0) == (u | 0)) return
            d = (o - u) >> 2
            u = 0
            do {
                o = (a + (u << 2)) | 0
                j = f[o >> 2] | 0
                if ((j | 0) > (b | 0)) f[o >> 2] = j + -1
                u = (u + 1) | 0
            } while (u >>> 0 < d >>> 0)
            return
        }
        function Fc(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0
            d = u
            u = (u + 32) | 0
            e = (d + 16) | 0
            g = d
            h = (c + 4) | 0
            i = f[((f[h >> 2] | 0) + 48) >> 2] | 0
            j = (c + 12) | 0
            c = f[j >> 2] | 0
            k = dn(32) | 0
            f[e >> 2] = k
            f[(e + 8) >> 2] = -2147483616
            f[(e + 4) >> 2] = 17
            l = k
            m = 12932
            n = (l + 17) | 0
            do {
                b[l >> 0] = b[m >> 0] | 0
                l = (l + 1) | 0
                m = (m + 1) | 0
            } while ((l | 0) < (n | 0))
            b[(k + 17) >> 0] = 0
            k = (i + 16) | 0
            o = f[k >> 2] | 0
            if (o) {
                p = k
                q = o
                a: while (1) {
                    o = q
                    while (1) {
                        if ((f[(o + 16) >> 2] | 0) >= (c | 0)) break
                        r = f[(o + 4) >> 2] | 0
                        if (!r) {
                            s = p
                            break a
                        } else o = r
                    }
                    q = f[o >> 2] | 0
                    if (!q) {
                        s = o
                        break
                    } else p = o
                }
                if (((s | 0) != (k | 0) ? (c | 0) >= (f[(s + 16) >> 2] | 0) : 0) ? ((c = (s + 20) | 0), (sh(c, e) | 0) != 0) : 0) t = yk(c, e, -1) | 0
                else v = 10
            } else v = 10
            if ((v | 0) == 10) t = yk(i, e, -1) | 0
            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
            i = ((1 << t) + -1) | 0
            f[e >> 2] = -1
            f[(e + 4) >> 2] = -1
            f[(e + 8) >> 2] = -1
            f[(e + 12) >> 2] = -1
            if ((i & 1) | 0 ? ((t = (_(i | 0) | 0) ^ 31), ((t + -1) | 0) >>> 0 <= 28) : 0) {
                f[e >> 2] = t + 1
                i = 2 << t
                f[(e + 4) >> 2] = i + -1
                t = (i + -2) | 0
                f[(e + 8) >> 2] = t
                f[(e + 12) >> 2] = ((t | 0) / 2) | 0
            }
            t = Ki(f[j >> 2] | 0, f[h >> 2] | 0) | 0
            i = f[((f[h >> 2] | 0) + 48) >> 2] | 0
            c = f[j >> 2] | 0
            s = dn(32) | 0
            f[g >> 2] = s
            f[(g + 8) >> 2] = -2147483616
            f[(g + 4) >> 2] = 17
            l = s
            m = 12804
            n = (l + 17) | 0
            do {
                b[l >> 0] = b[m >> 0] | 0
                l = (l + 1) | 0
                m = (m + 1) | 0
            } while ((l | 0) < (n | 0))
            b[(s + 17) >> 0] = 0
            s = (i + 16) | 0
            m = f[s >> 2] | 0
            if (m) {
                l = s
                n = m
                b: while (1) {
                    m = n
                    while (1) {
                        if ((f[(m + 16) >> 2] | 0) >= (c | 0)) break
                        k = f[(m + 4) >> 2] | 0
                        if (!k) {
                            w = l
                            break b
                        } else m = k
                    }
                    n = f[m >> 2] | 0
                    if (!n) {
                        w = m
                        break
                    } else l = m
                }
                if (((w | 0) != (s | 0) ? (c | 0) >= (f[(w + 16) >> 2] | 0) : 0) ? ((c = (w + 20) | 0), (sh(c, g) | 0) != 0) : 0) x = yk(c, g, t) | 0
                else v = 25
            } else v = 25
            if ((v | 0) == 25) x = yk(i, g, t) | 0
            if ((b[(g + 11) >> 0] | 0) < 0) br(f[g >> 2] | 0)
            switch (x | 0) {
                case 6: {
                    x = f[j >> 2] | 0
                    t = f[h >> 2] | 0
                    i = f[((f[((f[(t + 4) >> 2] | 0) + 8) >> 2] | 0) + (x << 2)) >> 2] | 0
                    do
                        if ((Qa[f[((f[t >> 2] | 0) + 8) >> 2] & 127](t) | 0) == 1) {
                            rf(g, t, 6, x, e, 514)
                            c = f[g >> 2] | 0
                            if (!c) {
                                f[g >> 2] = 0
                                y = g
                                v = 34
                                break
                            } else {
                                z = g
                                A = c
                                break
                            }
                        } else {
                            y = g
                            v = 34
                        }
                    while (0)
                    if ((v | 0) == 34) {
                        x = dn(24) | 0
                        f[(x + 4) >> 2] = i
                        i = (x + 8) | 0
                        f[i >> 2] = f[e >> 2]
                        f[(i + 4) >> 2] = f[(e + 4) >> 2]
                        f[(i + 8) >> 2] = f[(e + 8) >> 2]
                        f[(i + 12) >> 2] = f[(e + 12) >> 2]
                        f[x >> 2] = 2320
                        i = x
                        f[g >> 2] = i
                        z = y
                        A = i
                    }
                    f[a >> 2] = A
                    f[z >> 2] = 0
                    u = d
                    return
                }
                case 0: {
                    z = f[j >> 2] | 0
                    j = f[h >> 2] | 0
                    h = f[((f[((f[(j + 4) >> 2] | 0) + 8) >> 2] | 0) + (z << 2)) >> 2] | 0
                    do
                        if ((Qa[f[((f[j >> 2] | 0) + 8) >> 2] & 127](j) | 0) == 1) {
                            rf(g, j, 0, z, e, 514)
                            A = f[g >> 2] | 0
                            if (!A) {
                                f[g >> 2] = 0
                                B = g
                                v = 41
                                break
                            } else {
                                C = g
                                D = A
                                break
                            }
                        } else {
                            B = g
                            v = 41
                        }
                    while (0)
                    if ((v | 0) == 41) {
                        v = dn(24) | 0
                        f[(v + 4) >> 2] = h
                        h = (v + 8) | 0
                        f[h >> 2] = f[e >> 2]
                        f[(h + 4) >> 2] = f[(e + 4) >> 2]
                        f[(h + 8) >> 2] = f[(e + 8) >> 2]
                        f[(h + 12) >> 2] = f[(e + 12) >> 2]
                        f[v >> 2] = 2320
                        e = v
                        f[g >> 2] = e
                        C = B
                        D = e
                    }
                    f[a >> 2] = D
                    f[C >> 2] = 0
                    u = d
                    return
                }
                default: {
                    f[a >> 2] = 0
                    u = d
                    return
                }
            }
        }
        function Gc(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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
            b = u
            u = (u + 32) | 0
            c = (b + 20) | 0
            d = (b + 8) | 0
            e = b
            g = (a + 4) | 0
            h = f[g >> 2] | 0
            i = f[a >> 2] | 0
            j = (h - i) | 0
            k = j >> 2
            f[c >> 2] = 0
            l = (c + 4) | 0
            f[l >> 2] = 0
            m = (c + 8) | 0
            f[m >> 2] = 0
            n = i
            if (k | 0) {
                if ((j | 0) < 0) mq(c)
                j = ((((k + -1) | 0) >>> 5) + 1) | 0
                o = dn(j << 2) | 0
                f[c >> 2] = o
                f[m >> 2] = j
                f[l >> 2] = k
                l = k >>> 5
                hj(o | 0, 0, (l << 2) | 0) | 0
                j = k & 31
                k = (o + (l << 2)) | 0
                if (j | 0) f[k >> 2] = f[k >> 2] & ~(-1 >>> ((32 - j) | 0))
            }
            f[d >> 2] = 0
            j = (d + 4) | 0
            f[j >> 2] = 0
            f[(d + 8) >> 2] = 0
            k = (a + 12) | 0
            l = (e + 4) | 0
            o = (d + 8) | 0
            m = n
            n = h
            h = i
            while (1) {
                if ((n | 0) == (h | 0)) break
                else {
                    p = 0
                    q = 0
                    r = h
                    s = m
                }
                while (1) {
                    i = f[c >> 2] | 0
                    do
                        if (!(f[(i + ((q >>> 5) << 2)) >> 2] & (1 << (q & 31)))) {
                            t = f[d >> 2] | 0
                            v = f[j >> 2] | 0
                            if ((v | 0) == (t | 0)) w = t
                            else {
                                x = (v + (~(((v + -8 - t) | 0) >>> 3) << 3)) | 0
                                f[j >> 2] = x
                                w = x
                            }
                            x = q
                            while (1) {
                                v = (x + 1) | 0
                                y = ((v >>> 0) % 3 | 0 | 0) == 0 ? (x + -2) | 0 : v
                                if ((y | 0) == -1) {
                                    z = x
                                    A = r
                                    B = i
                                    C = s
                                    D = t
                                    E = w
                                    break
                                }
                                v = f[((f[k >> 2] | 0) + (y << 2)) >> 2] | 0
                                y = (v + 1) | 0
                                if ((v | 0) == -1) {
                                    z = x
                                    A = r
                                    B = i
                                    C = s
                                    D = t
                                    E = w
                                    break
                                }
                                F = ((y >>> 0) % 3 | 0 | 0) == 0 ? (v + -2) | 0 : y
                                if (!(((F | 0) != (q | 0)) & ((F | 0) != -1))) {
                                    z = x
                                    A = r
                                    B = i
                                    C = s
                                    D = t
                                    E = w
                                    break
                                }
                                if (!(f[(i + ((F >>> 5) << 2)) >> 2] & (1 << (F & 31)))) x = F
                                else {
                                    z = x
                                    A = r
                                    B = i
                                    C = s
                                    D = t
                                    E = w
                                    break
                                }
                            }
                            a: while (1) {
                                t = (B + ((z >>> 5) << 2)) | 0
                                f[t >> 2] = f[t >> 2] | (1 << (z & 31))
                                t = (z + 1) | 0
                                F = ((t >>> 0) % 3 | 0 | 0) == 0 ? (z + -2) | 0 : t
                                t = f[(C + (F << 2)) >> 2] | 0
                                G = ((((z >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + z) | 0
                                if ((D | 0) != (E | 0))
                                    if ((G | 0) == -1) {
                                        y = D
                                        do {
                                            if ((f[y >> 2] | 0) == (t | 0) ? ((v = f[(y + 4) >> 2] | 0), (v | 0) != -1) : 0) {
                                                H = v
                                                I = -1
                                                J = -1
                                                K = 25
                                                break a
                                            }
                                            y = (y + 8) | 0
                                        } while ((y | 0) != (E | 0))
                                    } else {
                                        y = D
                                        do {
                                            if ((f[y >> 2] | 0) == (t | 0) ? ((L = f[(y + 4) >> 2] | 0), (M = f[((f[k >> 2] | 0) + (G << 2)) >> 2] | 0), (M | 0) != (L | 0)) : 0) {
                                                K = 24
                                                break a
                                            }
                                            y = (y + 8) | 0
                                        } while ((y | 0) != (E | 0))
                                    }
                                f[e >> 2] = 0
                                f[e >> 2] = f[(C + (G << 2)) >> 2]
                                f[l >> 2] = F
                                if ((E | 0) == (f[o >> 2] | 0)) ei(d, e)
                                else {
                                    y = e
                                    t = f[(y + 4) >> 2] | 0
                                    v = E
                                    f[v >> 2] = f[y >> 2]
                                    f[(v + 4) >> 2] = t
                                    f[j >> 2] = (f[j >> 2] | 0) + 8
                                }
                                if ((G | 0) == -1) {
                                    K = 38
                                    break
                                }
                                t = f[((f[k >> 2] | 0) + (G << 2)) >> 2] | 0
                                if ((t | 0) == -1) {
                                    K = 38
                                    break
                                }
                                v = (t + (((t >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1)) | 0
                                if (!(((v | 0) != (x | 0)) & ((v | 0) != -1))) {
                                    K = 40
                                    break
                                }
                                t = f[a >> 2] | 0
                                z = v
                                A = t
                                B = f[c >> 2] | 0
                                C = t
                                D = f[d >> 2] | 0
                                E = f[j >> 2] | 0
                            }
                            if ((K | 0) == 24) {
                                K = 0
                                if ((L | 0) == -1) {
                                    N = -1
                                    O = -1
                                    P = M
                                    Q = G
                                } else {
                                    H = L
                                    I = M
                                    J = G
                                    K = 25
                                }
                            } else if ((K | 0) == 38) {
                                K = 0
                                K = 40
                            }
                            if ((K | 0) == 25) {
                                K = 0
                                N = H
                                O = f[((f[k >> 2] | 0) + (H << 2)) >> 2] | 0
                                P = I
                                Q = J
                            } else if ((K | 0) == 40) {
                                K = 0
                                R = p
                                S = f[a >> 2] | 0
                                break
                            }
                            if ((P | 0) != -1) f[((f[k >> 2] | 0) + (P << 2)) >> 2] = -1
                            x = f[k >> 2] | 0
                            if ((O | 0) != -1) f[(x + (O << 2)) >> 2] = -1
                            f[(x + (Q << 2)) >> 2] = -1
                            f[(x + (N << 2)) >> 2] = -1
                            R = 1
                            S = A
                        } else {
                            R = p
                            S = r
                        }
                    while (0)
                    q = (q + 1) | 0
                    T = f[g >> 2] | 0
                    s = S
                    if (q >>> 0 >= ((T - S) >> 2) >>> 0) break
                    else {
                        p = R
                        r = S
                    }
                }
                if (R) {
                    m = s
                    n = T
                    h = S
                } else break
            }
            S = f[d >> 2] | 0
            if (S | 0) {
                d = f[j >> 2] | 0
                if ((d | 0) != (S | 0)) f[j >> 2] = d + (~(((d + -8 - S) | 0) >>> 3) << 3)
                br(S)
            }
            S = f[c >> 2] | 0
            if (!S) {
                u = b
                return 1
            }
            br(S)
            u = b
            return 1
        }
        function Hc(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0
            e = (a + 8) | 0
            a: do
                if (
                    f[e >> 2] | 0
                        ? ((g = f[a >> 2] | 0),
                          (h = (a + 4) | 0),
                          (f[a >> 2] = h),
                          (f[((f[h >> 2] | 0) + 8) >> 2] = 0),
                          (f[h >> 2] = 0),
                          (f[e >> 2] = 0),
                          (i = f[(g + 4) >> 2] | 0),
                          (j = (i | 0) == 0 ? g : i),
                          j | 0)
                        : 0
                ) {
                    i = (a + 4) | 0
                    g = j
                    j = f[c >> 2] | 0
                    while (1) {
                        if ((j | 0) == (f[d >> 2] | 0)) break
                        k = (g + 16) | 0
                        Ql(k, (j + 16) | 0) | 0
                        Ql((g + 28) | 0, (j + 28) | 0) | 0
                        l = (g + 8) | 0
                        m = f[l >> 2] | 0
                        do
                            if (m) {
                                n = f[m >> 2] | 0
                                if ((n | 0) == (g | 0)) {
                                    f[m >> 2] = 0
                                    o = f[(m + 4) >> 2] | 0
                                    if (!o) {
                                        p = m
                                        break
                                    } else q = o
                                    while (1) {
                                        o = f[q >> 2] | 0
                                        if (o | 0) {
                                            q = o
                                            continue
                                        }
                                        o = f[(q + 4) >> 2] | 0
                                        if (!o) break
                                        else q = o
                                    }
                                    p = q
                                    break
                                } else {
                                    f[(m + 4) >> 2] = 0
                                    if (!n) {
                                        p = m
                                        break
                                    } else r = n
                                    while (1) {
                                        o = f[r >> 2] | 0
                                        if (o | 0) {
                                            r = o
                                            continue
                                        }
                                        o = f[(r + 4) >> 2] | 0
                                        if (!o) break
                                        else r = o
                                    }
                                    p = r
                                    break
                                }
                            } else p = 0
                        while (0)
                        m = f[h >> 2] | 0
                        do
                            if (m) {
                                n = b[(k + 11) >> 0] | 0
                                o = (n << 24) >> 24 < 0
                                s = o ? f[(g + 20) >> 2] | 0 : n & 255
                                n = o ? f[k >> 2] | 0 : k
                                o = m
                                while (1) {
                                    t = (o + 16) | 0
                                    u = b[(t + 11) >> 0] | 0
                                    v = (u << 24) >> 24 < 0
                                    w = v ? f[(o + 20) >> 2] | 0 : u & 255
                                    u = w >>> 0 < s >>> 0 ? w : s
                                    if ((u | 0) != 0 ? ((x = Pk(n, v ? f[t >> 2] | 0 : t, u) | 0), (x | 0) != 0) : 0)
                                        if ((x | 0) < 0) y = 22
                                        else y = 24
                                    else if (s >>> 0 < w >>> 0) y = 22
                                    else y = 24
                                    if ((y | 0) == 22) {
                                        y = 0
                                        w = f[o >> 2] | 0
                                        if (!w) {
                                            y = 23
                                            break
                                        } else z = w
                                    } else if ((y | 0) == 24) {
                                        y = 0
                                        A = (o + 4) | 0
                                        w = f[A >> 2] | 0
                                        if (!w) {
                                            y = 26
                                            break
                                        } else z = w
                                    }
                                    o = z
                                }
                                if ((y | 0) == 23) {
                                    y = 0
                                    B = o
                                    C = o
                                    break
                                } else if ((y | 0) == 26) {
                                    y = 0
                                    B = A
                                    C = o
                                    break
                                }
                            } else {
                                B = h
                                C = h
                            }
                        while (0)
                        f[g >> 2] = 0
                        f[(g + 4) >> 2] = 0
                        f[l >> 2] = C
                        f[B >> 2] = g
                        m = f[f[a >> 2] >> 2] | 0
                        if (!m) D = g
                        else {
                            f[a >> 2] = m
                            D = f[B >> 2] | 0
                        }
                        Ae(f[i >> 2] | 0, D)
                        f[e >> 2] = (f[e >> 2] | 0) + 1
                        m = f[(j + 4) >> 2] | 0
                        if (!m) {
                            k = (j + 8) | 0
                            s = f[k >> 2] | 0
                            if ((f[s >> 2] | 0) == (j | 0)) E = s
                            else {
                                s = k
                                do {
                                    k = f[s >> 2] | 0
                                    s = (k + 8) | 0
                                    n = f[s >> 2] | 0
                                } while ((f[n >> 2] | 0) != (k | 0))
                                E = n
                            }
                        } else {
                            s = m
                            while (1) {
                                l = f[s >> 2] | 0
                                if (!l) break
                                else s = l
                            }
                            E = s
                        }
                        f[c >> 2] = E
                        if (!p) break a
                        else {
                            g = p
                            j = E
                        }
                    }
                    j = f[(g + 8) >> 2] | 0
                    if (!j) F = g
                    else {
                        i = j
                        while (1) {
                            j = f[(i + 8) >> 2] | 0
                            if (!j) break
                            else i = j
                        }
                        F = i
                    }
                    sj(a, F)
                }
            while (0)
            F = f[c >> 2] | 0
            E = f[d >> 2] | 0
            if ((F | 0) == (E | 0)) return
            else G = F
            while (1) {
                Qe(a, (G + 16) | 0) | 0
                F = f[(G + 4) >> 2] | 0
                if (!F) {
                    d = (G + 8) | 0
                    p = f[d >> 2] | 0
                    if ((f[p >> 2] | 0) == (G | 0)) H = p
                    else {
                        p = d
                        do {
                            d = f[p >> 2] | 0
                            p = (d + 8) | 0
                            e = f[p >> 2] | 0
                        } while ((f[e >> 2] | 0) != (d | 0))
                        H = e
                    }
                } else {
                    p = F
                    while (1) {
                        i = f[p >> 2] | 0
                        if (!i) break
                        else p = i
                    }
                    H = p
                }
                f[c >> 2] = H
                if ((H | 0) == (E | 0)) break
                else G = H
            }
            return
        }
        function Ic(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                I = 0,
                J = 0,
                K = 0
            g = u
            u = (u + 16) | 0
            h = g
            i = (c + 4) | 0
            f[h >> 2] = 0
            f[(h + 4) >> 2] = 0
            f[(h + 8) >> 2] = 0
            j = dn(16) | 0
            f[h >> 2] = j
            f[(h + 8) >> 2] = -2147483632
            f[(h + 4) >> 2] = 15
            k = j
            l = 12916
            m = (k + 15) | 0
            do {
                b[k >> 0] = b[l >> 0] | 0
                k = (k + 1) | 0
                l = (l + 1) | 0
            } while ((k | 0) < (m | 0))
            b[(j + 15) >> 0] = 0
            j = yk(i, h, -1) | 0
            if ((b[(h + 11) >> 0] | 0) < 0) br(f[h >> 2] | 0)
            switch (j | 0) {
                case 0: {
                    n = dn(56) | 0
                    k = n
                    m = (k + 56) | 0
                    do {
                        f[k >> 2] = 0
                        k = (k + 4) | 0
                    } while ((k | 0) < (m | 0))
                    zn(n)
                    o = 3728
                    p = n
                    break
                }
                case -1: {
                    if ((Yh(i) | 0) == 10) {
                        n = dn(56) | 0
                        k = n
                        m = (k + 56) | 0
                        do {
                            f[k >> 2] = 0
                            k = (k + 4) | 0
                        } while ((k | 0) < (m | 0))
                        zn(n)
                        o = 3728
                        p = n
                    } else q = 6
                    break
                }
                default:
                    q = 6
            }
            a: do
                if ((q | 0) == 6) {
                    n = (d + 8) | 0
                    r = (d + 12) | 0
                    s = f[r >> 2] | 0
                    t = f[n >> 2] | 0
                    b: do
                        if (((s - t) | 0) > 0) {
                            v = (h + 8) | 0
                            w = (h + 4) | 0
                            x = (c + 20) | 0
                            y = (h + 11) | 0
                            z = 0
                            A = t
                            B = s
                            c: while (1) {
                                C = f[((f[(A + (z << 2)) >> 2] | 0) + 28) >> 2] | 0
                                switch (C | 0) {
                                    case 9: {
                                        q = 12
                                        break
                                    }
                                    case 6:
                                    case 5:
                                    case 4:
                                    case 2: {
                                        D = A
                                        E = B
                                        break
                                    }
                                    default: {
                                        if ((C | 2 | 0) != 3) break c
                                        if ((C | 0) == 9) q = 12
                                        else {
                                            D = A
                                            E = B
                                        }
                                    }
                                }
                                if ((q | 0) == 12) {
                                    q = 0
                                    f[h >> 2] = 0
                                    f[(h + 4) >> 2] = 0
                                    f[(h + 8) >> 2] = 0
                                    C = dn(32) | 0
                                    f[h >> 2] = C
                                    f[v >> 2] = -2147483616
                                    f[w >> 2] = 17
                                    k = C
                                    l = 12932
                                    m = (k + 17) | 0
                                    do {
                                        b[k >> 0] = b[l >> 0] | 0
                                        k = (k + 1) | 0
                                        l = (l + 1) | 0
                                    } while ((k | 0) < (m | 0))
                                    b[(C + 17) >> 0] = 0
                                    F = f[x >> 2] | 0
                                    if (F) {
                                        G = x
                                        H = F
                                        d: while (1) {
                                            F = H
                                            while (1) {
                                                if ((f[(F + 16) >> 2] | 0) >= 0) break
                                                I = f[(F + 4) >> 2] | 0
                                                if (!I) {
                                                    J = G
                                                    break d
                                                } else F = I
                                            }
                                            H = f[F >> 2] | 0
                                            if (!H) {
                                                J = F
                                                break
                                            } else G = F
                                        }
                                        if (((J | 0) != (x | 0) ? (f[(J + 16) >> 2] | 0) <= 0 : 0) ? ((G = (J + 20) | 0), (sh(G, h) | 0) != 0) : 0) K = yk(G, h, -1) | 0
                                        else q = 21
                                    } else q = 21
                                    if ((q | 0) == 21) {
                                        q = 0
                                        K = yk(i, h, -1) | 0
                                    }
                                    if ((b[y >> 0] | 0) < 0) br(f[h >> 2] | 0)
                                    if ((K | 0) < 1) break
                                    D = f[n >> 2] | 0
                                    E = f[r >> 2] | 0
                                }
                                z = (z + 1) | 0
                                if ((z | 0) >= (((E - D) >> 2) | 0)) break b
                                else {
                                    A = D
                                    B = E
                                }
                            }
                            if ((j | 0) != 1) {
                                B = dn(56) | 0
                                k = B
                                m = (k + 56) | 0
                                do {
                                    f[k >> 2] = 0
                                    k = (k + 4) | 0
                                } while ((k | 0) < (m | 0))
                                zn(B)
                                o = 3728
                                p = B
                                break a
                            }
                            f[h >> 2] = 0
                            f[(h + 4) >> 2] = 0
                            f[(h + 8) >> 2] = 0
                            A = dn(32) | 0
                            f[h >> 2] = A
                            f[(h + 8) >> 2] = -2147483616
                            f[(h + 4) >> 2] = 24
                            k = A
                            l = 12950
                            m = (k + 24) | 0
                            do {
                                b[k >> 0] = b[l >> 0] | 0
                                k = (k + 1) | 0
                                l = (l + 1) | 0
                            } while ((k | 0) < (m | 0))
                            b[(A + 24) >> 0] = 0
                            f[a >> 2] = -1
                            dj((a + 4) | 0, h)
                            if ((b[(h + 11) >> 0] | 0) < 0) br(f[h >> 2] | 0)
                            u = g
                            return
                        }
                    while (0)
                    r = dn(56) | 0
                    k = r
                    m = (k + 56) | 0
                    do {
                        f[k >> 2] = 0
                        k = (k + 4) | 0
                    } while ((k | 0) < (m | 0))
                    zn(r)
                    o = 3668
                    p = r
                }
            while (0)
            f[p >> 2] = o
            tp(p, d)
            Ad(a, p, i, e)
            if (!(f[a >> 2] | 0)) {
                e = (a + 4) | 0
                if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
                f[(c + 40) >> 2] = f[(p + 52) >> 2]
                f[(c + 44) >> 2] = 0
                f[a >> 2] = 0
                f[(a + 4) >> 2] = 0
                f[(a + 8) >> 2] = 0
                f[(a + 12) >> 2] = 0
            }
            Va[f[((f[p >> 2] | 0) + 4) >> 2] & 127](p)
            u = g
            return
        }
        function Jc(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0
            b = u
            u = (u + 32) | 0
            c = (b + 4) | 0
            d = b
            e = (a + 16) | 0
            g = f[e >> 2] | 0
            if (g >>> 0 > 112) {
                f[e >> 2] = g + -113
                g = (a + 4) | 0
                e = f[g >> 2] | 0
                h = f[e >> 2] | 0
                i = (e + 4) | 0
                f[g >> 2] = i
                e = (a + 8) | 0
                j = f[e >> 2] | 0
                k = (a + 12) | 0
                l = f[k >> 2] | 0
                m = l
                do
                    if ((j | 0) == (l | 0)) {
                        n = f[a >> 2] | 0
                        o = n
                        if (i >>> 0 > n >>> 0) {
                            p = i
                            q = (((((p - o) >> 2) + 1) | 0) / -2) | 0
                            r = (i + (q << 2)) | 0
                            s = (j - p) | 0
                            p = s >> 2
                            if (!p) t = i
                            else {
                                Xl(r | 0, i | 0, s | 0) | 0
                                t = f[g >> 2] | 0
                            }
                            s = (r + (p << 2)) | 0
                            f[e >> 2] = s
                            f[g >> 2] = t + (q << 2)
                            v = s
                            break
                        }
                        s = (m - o) >> 1
                        o = (s | 0) == 0 ? 1 : s
                        if (o >>> 0 > 1073741823) {
                            s = ra(8) | 0
                            Wo(s, 14941)
                            f[s >> 2] = 6944
                            va(s | 0, 1080, 114)
                        }
                        s = dn(o << 2) | 0
                        q = s
                        p = (s + ((o >>> 2) << 2)) | 0
                        r = p
                        w = (s + (o << 2)) | 0
                        if ((i | 0) == (j | 0)) {
                            x = r
                            y = n
                        } else {
                            n = p
                            p = r
                            o = i
                            do {
                                f[n >> 2] = f[o >> 2]
                                n = (p + 4) | 0
                                p = n
                                o = (o + 4) | 0
                            } while ((o | 0) != (j | 0))
                            x = p
                            y = f[a >> 2] | 0
                        }
                        f[a >> 2] = q
                        f[g >> 2] = r
                        f[e >> 2] = x
                        f[k >> 2] = w
                        if (!y) v = x
                        else {
                            br(y)
                            v = f[e >> 2] | 0
                        }
                    } else v = j
                while (0)
                f[v >> 2] = h
                f[e >> 2] = (f[e >> 2] | 0) + 4
                u = b
                return
            }
            e = (a + 8) | 0
            h = f[e >> 2] | 0
            v = (a + 4) | 0
            j = (h - (f[v >> 2] | 0)) | 0
            y = (a + 12) | 0
            x = f[y >> 2] | 0
            k = (x - (f[a >> 2] | 0)) | 0
            if (j >>> 0 >= k >>> 0) {
                g = k >> 1
                k = (g | 0) == 0 ? 1 : g
                f[(c + 12) >> 2] = 0
                f[(c + 16) >> 2] = a + 12
                if (k >>> 0 > 1073741823) {
                    g = ra(8) | 0
                    Wo(g, 14941)
                    f[g >> 2] = 6944
                    va(g | 0, 1080, 114)
                }
                g = dn(k << 2) | 0
                f[c >> 2] = g
                i = (g + ((j >> 2) << 2)) | 0
                j = (c + 8) | 0
                f[j >> 2] = i
                m = (c + 4) | 0
                f[m >> 2] = i
                i = (c + 12) | 0
                f[i >> 2] = g + (k << 2)
                k = dn(4068) | 0
                f[d >> 2] = k
                kg(c, d)
                d = f[e >> 2] | 0
                while (1) {
                    z = f[v >> 2] | 0
                    if ((d | 0) == (z | 0)) break
                    k = (d + -4) | 0
                    dg(c, k)
                    d = k
                }
                k = z
                z = f[a >> 2] | 0
                f[a >> 2] = f[c >> 2]
                f[c >> 2] = z
                f[v >> 2] = f[m >> 2]
                f[m >> 2] = k
                m = f[e >> 2] | 0
                f[e >> 2] = f[j >> 2]
                f[j >> 2] = m
                g = f[y >> 2] | 0
                f[y >> 2] = f[i >> 2]
                f[i >> 2] = g
                g = m
                if ((d | 0) != (g | 0)) f[j >> 2] = g + (~(((g + -4 - k) | 0) >>> 2) << 2)
                if (z | 0) br(z)
                u = b
                return
            }
            if ((x | 0) != (h | 0)) {
                h = dn(4068) | 0
                f[c >> 2] = h
                kg(a, c)
                u = b
                return
            }
            h = dn(4068) | 0
            f[c >> 2] = h
            dg(a, c)
            c = f[v >> 2] | 0
            h = f[c >> 2] | 0
            x = (c + 4) | 0
            f[v >> 2] = x
            c = f[e >> 2] | 0
            z = f[y >> 2] | 0
            k = z
            do
                if ((c | 0) == (z | 0)) {
                    g = f[a >> 2] | 0
                    j = g
                    if (x >>> 0 > g >>> 0) {
                        d = x
                        m = (((((d - j) >> 2) + 1) | 0) / -2) | 0
                        i = (x + (m << 2)) | 0
                        t = (c - d) | 0
                        d = t >> 2
                        if (!d) A = x
                        else {
                            Xl(i | 0, x | 0, t | 0) | 0
                            A = f[v >> 2] | 0
                        }
                        t = (i + (d << 2)) | 0
                        f[e >> 2] = t
                        f[v >> 2] = A + (m << 2)
                        B = t
                        break
                    }
                    t = (k - j) >> 1
                    j = (t | 0) == 0 ? 1 : t
                    if (j >>> 0 > 1073741823) {
                        t = ra(8) | 0
                        Wo(t, 14941)
                        f[t >> 2] = 6944
                        va(t | 0, 1080, 114)
                    }
                    t = dn(j << 2) | 0
                    m = t
                    d = (t + ((j >>> 2) << 2)) | 0
                    i = d
                    l = (t + (j << 2)) | 0
                    if ((x | 0) == (c | 0)) {
                        C = i
                        D = g
                    } else {
                        g = d
                        d = i
                        j = x
                        do {
                            f[g >> 2] = f[j >> 2]
                            g = (d + 4) | 0
                            d = g
                            j = (j + 4) | 0
                        } while ((j | 0) != (c | 0))
                        C = d
                        D = f[a >> 2] | 0
                    }
                    f[a >> 2] = m
                    f[v >> 2] = i
                    f[e >> 2] = C
                    f[y >> 2] = l
                    if (!D) B = C
                    else {
                        br(D)
                        B = f[e >> 2] | 0
                    }
                } else B = c
            while (0)
            f[B >> 2] = h
            f[e >> 2] = (f[e >> 2] | 0) + 4
            u = b
            return
        }
        function Kc(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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
            e = u
            u = (u + 16) | 0
            g = (e + 8) | 0
            h = (e + 4) | 0
            i = e
            j = (a + 64) | 0
            k = f[j >> 2] | 0
            if ((f[(k + 28) >> 2] | 0) == (f[(k + 24) >> 2] | 0)) {
                u = e
                return
            }
            l = (c + 96) | 0
            c = (a + 52) | 0
            m = (d + 84) | 0
            n = (d + 68) | 0
            d = (a + 56) | 0
            o = (a + 60) | 0
            p = (a + 12) | 0
            q = (a + 28) | 0
            r = (a + 40) | 0
            s = (a + 44) | 0
            t = (a + 48) | 0
            v = 0
            w = 0
            x = k
            while (1) {
                k = f[((f[(x + 24) >> 2] | 0) + (w << 2)) >> 2] | 0
                if ((k | 0) == -1) {
                    y = v
                    z = x
                } else {
                    A = (v + 1) | 0
                    B = f[((f[l >> 2] | 0) + (((((k | 0) / 3) | 0) * 12) | 0) + (((k | 0) % 3 | 0) << 2)) >> 2] | 0
                    if (!(b[m >> 0] | 0)) C = f[((f[n >> 2] | 0) + (B << 2)) >> 2] | 0
                    else C = B
                    f[g >> 2] = C
                    B = f[d >> 2] | 0
                    if (B >>> 0 < (f[o >> 2] | 0) >>> 0) {
                        f[B >> 2] = C
                        f[d >> 2] = B + 4
                    } else Ci(c, g)
                    f[g >> 2] = k
                    f[h >> 2] = 0
                    a: do
                        if (!(f[((f[p >> 2] | 0) + ((w >>> 5) << 2)) >> 2] & (1 << (w & 31)))) D = k
                        else {
                            B = (k + 1) | 0
                            E = ((B >>> 0) % 3 | 0 | 0) == 0 ? (k + -2) | 0 : B
                            if (
                                ((E | 0) != -1 ? ((f[((f[a >> 2] | 0) + ((E >>> 5) << 2)) >> 2] & (1 << (E & 31))) | 0) == 0 : 0)
                                    ? ((B = f[((f[((f[j >> 2] | 0) + 12) >> 2] | 0) + (E << 2)) >> 2] | 0), (E = (B + 1) | 0), (B | 0) != -1)
                                    : 0
                            ) {
                                F = ((E >>> 0) % 3 | 0 | 0) == 0 ? (B + -2) | 0 : E
                                f[h >> 2] = F
                                if ((F | 0) == -1) {
                                    D = k
                                    break
                                } else G = F
                                while (1) {
                                    f[g >> 2] = G
                                    F = (G + 1) | 0
                                    E = ((F >>> 0) % 3 | 0 | 0) == 0 ? (G + -2) | 0 : F
                                    if ((E | 0) == -1) break
                                    if ((f[((f[a >> 2] | 0) + ((E >>> 5) << 2)) >> 2] & (1 << (E & 31))) | 0) break
                                    F = f[((f[((f[j >> 2] | 0) + 12) >> 2] | 0) + (E << 2)) >> 2] | 0
                                    E = (F + 1) | 0
                                    if ((F | 0) == -1) break
                                    B = ((E >>> 0) % 3 | 0 | 0) == 0 ? (F + -2) | 0 : E
                                    f[h >> 2] = B
                                    if ((B | 0) == -1) {
                                        D = G
                                        break a
                                    } else G = B
                                }
                                f[h >> 2] = -1
                                D = G
                                break
                            }
                            f[h >> 2] = -1
                            D = k
                        }
                    while (0)
                    f[((f[q >> 2] | 0) + (D << 2)) >> 2] = v
                    k = f[s >> 2] | 0
                    if ((k | 0) == (f[t >> 2] | 0)) Ci(r, g)
                    else {
                        f[k >> 2] = f[g >> 2]
                        f[s >> 2] = k + 4
                    }
                    k = f[j >> 2] | 0
                    B = f[g >> 2] | 0
                    b: do
                        if (
                            ((B | 0) != -1 ? ((E = ((((B >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + B) | 0), (E | 0) != -1) : 0) ? ((F = f[((f[(k + 12) >> 2] | 0) + (E << 2)) >> 2] | 0), (F | 0) != -1) : 0
                        ) {
                            E = (F + (((F >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1)) | 0
                            f[h >> 2] = E
                            if (((E | 0) != -1) & ((E | 0) != (B | 0))) {
                                F = A
                                H = v
                                I = E
                                while (1) {
                                    E = (I + 1) | 0
                                    J = ((E >>> 0) % 3 | 0 | 0) == 0 ? (I + -2) | 0 : E
                                    do
                                        if (f[((f[a >> 2] | 0) + ((J >>> 5) << 2)) >> 2] & (1 << (J & 31))) {
                                            E = (F + 1) | 0
                                            K = f[((f[l >> 2] | 0) + (((((I | 0) / 3) | 0) * 12) | 0) + (((I | 0) % 3 | 0) << 2)) >> 2] | 0
                                            if (!(b[m >> 0] | 0)) L = f[((f[n >> 2] | 0) + (K << 2)) >> 2] | 0
                                            else L = K
                                            f[i >> 2] = L
                                            K = f[d >> 2] | 0
                                            if (K >>> 0 < (f[o >> 2] | 0) >>> 0) {
                                                f[K >> 2] = L
                                                f[d >> 2] = K + 4
                                            } else Ci(c, i)
                                            K = f[s >> 2] | 0
                                            if ((K | 0) == (f[t >> 2] | 0)) {
                                                Ci(r, h)
                                                M = E
                                                N = F
                                                break
                                            } else {
                                                f[K >> 2] = f[h >> 2]
                                                f[s >> 2] = K + 4
                                                M = E
                                                N = F
                                                break
                                            }
                                        } else {
                                            M = F
                                            N = H
                                        }
                                    while (0)
                                    f[((f[q >> 2] | 0) + (f[h >> 2] << 2)) >> 2] = N
                                    O = f[j >> 2] | 0
                                    J = f[h >> 2] | 0
                                    if ((J | 0) == -1) break
                                    E = ((((J >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + J) | 0
                                    if ((E | 0) == -1) break
                                    J = f[((f[(O + 12) >> 2] | 0) + (E << 2)) >> 2] | 0
                                    if ((J | 0) == -1) break
                                    I = (J + (((J >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1)) | 0
                                    f[h >> 2] = I
                                    if (!((I | 0) != -1 ? (I | 0) != (f[g >> 2] | 0) : 0)) {
                                        P = M
                                        Q = O
                                        break b
                                    } else {
                                        F = M
                                        H = N
                                    }
                                }
                                f[h >> 2] = -1
                                P = M
                                Q = O
                            } else {
                                P = A
                                Q = k
                            }
                        } else R = 28
                    while (0)
                    if ((R | 0) == 28) {
                        R = 0
                        f[h >> 2] = -1
                        P = A
                        Q = k
                    }
                    y = P
                    z = Q
                }
                w = (w + 1) | 0
                if (w >>> 0 >= (((f[(z + 28) >> 2] | 0) - (f[(z + 24) >> 2] | 0)) >> 2) >>> 0) break
                else {
                    v = y
                    x = z
                }
            }
            u = e
            return
        }
        function Lc(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                i = 0,
                j = 0.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,
                D = 0,
                E = 0,
                F = 0
            switch (c | 0) {
                case 0: {
                    e = -149
                    g = 24
                    i = 4
                    break
                }
                case 1: {
                    e = -1074
                    g = 53
                    i = 4
                    break
                }
                case 2: {
                    e = -1074
                    g = 53
                    i = 4
                    break
                }
                default:
                    j = 0.0
            }
            a: do
                if ((i | 0) == 4) {
                    c = (a + 4) | 0
                    k = (a + 100) | 0
                    do {
                        l = f[c >> 2] | 0
                        if (l >>> 0 < (f[k >> 2] | 0) >>> 0) {
                            f[c >> 2] = l + 1
                            m = h[l >> 0] | 0
                        } else m = Di(a) | 0
                    } while ((tq(m) | 0) != 0)
                    b: do
                        switch (m | 0) {
                            case 43:
                            case 45: {
                                l = (1 - ((((m | 0) == 45) & 1) << 1)) | 0
                                n = f[c >> 2] | 0
                                if (n >>> 0 < (f[k >> 2] | 0) >>> 0) {
                                    f[c >> 2] = n + 1
                                    o = h[n >> 0] | 0
                                    p = l
                                    break b
                                } else {
                                    o = Di(a) | 0
                                    p = l
                                    break b
                                }
                                break
                            }
                            default: {
                                o = m
                                p = 1
                            }
                        }
                    while (0)
                    l = 0
                    n = o
                    while (1) {
                        if ((n | 32 | 0) != (b[(17452 + l) >> 0] | 0)) {
                            q = l
                            r = n
                            break
                        }
                        do
                            if (l >>> 0 < 7) {
                                s = f[c >> 2] | 0
                                if (s >>> 0 < (f[k >> 2] | 0) >>> 0) {
                                    f[c >> 2] = s + 1
                                    t = h[s >> 0] | 0
                                    break
                                } else {
                                    t = Di(a) | 0
                                    break
                                }
                            } else t = n
                        while (0)
                        s = (l + 1) | 0
                        if (s >>> 0 < 8) {
                            l = s
                            n = t
                        } else {
                            q = s
                            r = t
                            break
                        }
                    }
                    c: do
                        switch (q | 0) {
                            case 8:
                                break
                            case 3: {
                                i = 23
                                break
                            }
                            default: {
                                n = (d | 0) != 0
                                if (n & (q >>> 0 > 3))
                                    if ((q | 0) == 8) break c
                                    else {
                                        i = 23
                                        break c
                                    }
                                d: do
                                    if (!q) {
                                        l = 0
                                        s = r
                                        while (1) {
                                            if ((s | 32 | 0) != (b[(17461 + l) >> 0] | 0)) {
                                                u = l
                                                v = s
                                                break d
                                            }
                                            do
                                                if (l >>> 0 < 2) {
                                                    w = f[c >> 2] | 0
                                                    if (w >>> 0 < (f[k >> 2] | 0) >>> 0) {
                                                        f[c >> 2] = w + 1
                                                        x = h[w >> 0] | 0
                                                        break
                                                    } else {
                                                        x = Di(a) | 0
                                                        break
                                                    }
                                                } else x = s
                                            while (0)
                                            w = (l + 1) | 0
                                            if (w >>> 0 < 3) {
                                                l = w
                                                s = x
                                            } else {
                                                u = w
                                                v = x
                                                break
                                            }
                                        }
                                    } else {
                                        u = q
                                        v = r
                                    }
                                while (0)
                                switch (u | 0) {
                                    case 3: {
                                        s = f[c >> 2] | 0
                                        if (s >>> 0 < (f[k >> 2] | 0) >>> 0) {
                                            f[c >> 2] = s + 1
                                            y = h[s >> 0] | 0
                                        } else y = Di(a) | 0
                                        if ((y | 0) == 40) z = 1
                                        else {
                                            if (!(f[k >> 2] | 0)) {
                                                j = B
                                                break a
                                            }
                                            f[c >> 2] = (f[c >> 2] | 0) + -1
                                            j = B
                                            break a
                                        }
                                        while (1) {
                                            s = f[c >> 2] | 0
                                            if (s >>> 0 < (f[k >> 2] | 0) >>> 0) {
                                                f[c >> 2] = s + 1
                                                A = h[s >> 0] | 0
                                            } else A = Di(a) | 0
                                            if (!((((A + -48) | 0) >>> 0 < 10) | (((A + -65) | 0) >>> 0 < 26)) ? !(((A | 0) == 95) | (((A + -97) | 0) >>> 0 < 26)) : 0) break
                                            z = (z + 1) | 0
                                        }
                                        if ((A | 0) == 41) {
                                            j = B
                                            break a
                                        }
                                        s = (f[k >> 2] | 0) == 0
                                        if (!s) f[c >> 2] = (f[c >> 2] | 0) + -1
                                        if (!n) {
                                            l = ir() | 0
                                            f[l >> 2] = 22
                                            Rm(a, 0)
                                            j = 0.0
                                            break a
                                        }
                                        if (!z) {
                                            j = B
                                            break a
                                        } else D = z
                                        while (1) {
                                            D = (D + -1) | 0
                                            if (!s) f[c >> 2] = (f[c >> 2] | 0) + -1
                                            if (!D) {
                                                j = B
                                                break a
                                            }
                                        }
                                        break
                                    }
                                    case 0: {
                                        if ((v | 0) == 48) {
                                            s = f[c >> 2] | 0
                                            if (s >>> 0 < (f[k >> 2] | 0) >>> 0) {
                                                f[c >> 2] = s + 1
                                                E = h[s >> 0] | 0
                                            } else E = Di(a) | 0
                                            if ((E | 32 | 0) == 120) {
                                                j = +yc(a, g, e, p, d)
                                                break a
                                            }
                                            if (!(f[k >> 2] | 0)) F = 48
                                            else {
                                                f[c >> 2] = (f[c >> 2] | 0) + -1
                                                F = 48
                                            }
                                        } else F = v
                                        j = +ob(a, F, g, e, p, d)
                                        break a
                                        break
                                    }
                                    default: {
                                        if (f[k >> 2] | 0) f[c >> 2] = (f[c >> 2] | 0) + -1
                                        s = ir() | 0
                                        f[s >> 2] = 22
                                        Rm(a, 0)
                                        j = 0.0
                                        break a
                                    }
                                }
                            }
                        }
                    while (0)
                    if ((i | 0) == 23) {
                        s = (f[k >> 2] | 0) == 0
                        if (!s) f[c >> 2] = (f[c >> 2] | 0) + -1
                        if (((d | 0) != 0) & (q >>> 0 > 3)) {
                            n = q
                            do {
                                if (!s) f[c >> 2] = (f[c >> 2] | 0) + -1
                                n = (n + -1) | 0
                            } while (n >>> 0 > 3)
                        }
                    }
                    j = +$($(p | 0) * $(C))
                }
            while (0)
            return +j
        }
        function Mc(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                I = 0,
                J = 0,
                K = 0,
                L = 0,
                M = 0,
                N = 0
            b = u
            u = (u + 16) | 0
            c = (b + 4) | 0
            d = b
            e = f[(a + 64) >> 2] | 0
            if (!e) {
                u = b
                return
            }
            g = Qa[f[((f[e >> 2] | 0) + 32) >> 2] & 127](e) | 0
            if (!g) {
                u = b
                return
            }
            e = (g + 24) | 0
            h = (g + 28) | 0
            i = ((((f[h >> 2] | 0) - (f[e >> 2] | 0)) >> 2) - (f[(g + 44) >> 2] | 0)) | 0
            j = (a + 56) | 0
            k = f[j >> 2] | 0
            if ((((f[(k + 12) >> 2] | 0) - (f[(k + 8) >> 2] | 0)) | 0) > 4) {
                f[c >> 2] = 0
                l = (c + 4) | 0
                f[l >> 2] = 0
                f[(c + 8) >> 2] = 0
                m = (c + 8) | 0
                n = 0
                o = k
                while (1) {
                    if (!(f[((f[((f[(o + 8) >> 2] | 0) + (n << 2)) >> 2] | 0) + 56) >> 2] | 0)) p = o
                    else {
                        k = Ra[f[((f[a >> 2] | 0) + 56) >> 2] & 127](a, n) | 0
                        f[d >> 2] = k
                        q = k
                        do
                            if (k | 0) {
                                r = f[l >> 2] | 0
                                if ((r | 0) == (f[m >> 2] | 0)) {
                                    Ci(c, d)
                                    break
                                } else {
                                    f[r >> 2] = q
                                    f[l >> 2] = (f[l >> 2] | 0) + 4
                                    break
                                }
                            }
                        while (0)
                        p = f[j >> 2] | 0
                    }
                    n = (n + 1) | 0
                    if ((n | 0) >= ((((f[(p + 12) >> 2] | 0) - (f[(p + 8) >> 2] | 0)) >> 2) | 0)) break
                    else o = p
                }
                o = f[h >> 2] | 0
                h = f[e >> 2] | 0
                e = h
                if ((o | 0) == (h | 0)) {
                    s = i
                    t = f[c >> 2] | 0
                } else {
                    n = (o - h) >> 2
                    h = (g + 12) | 0
                    g = f[l >> 2] | 0
                    o = f[c >> 2] | 0
                    c = (g | 0) == (o | 0)
                    j = o
                    d = (g - o) >> 2
                    o = (p + 96) | 0
                    p = i
                    g = 0
                    while (1) {
                        m = f[(e + (g << 2)) >> 2] | 0
                        if ((m | 0) == -1) v = p
                        else {
                            q = f[o >> 2] | 0
                            k = f[(q + (((((m | 0) / 3) | 0) * 12) | 0) + (((m | 0) % 3 | 0) << 2)) >> 2] | 0
                            r = ((((m >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + m) | 0
                            a: do
                                if (
                                    ((r | 0) != -1 ? ((w = f[((f[h >> 2] | 0) + (r << 2)) >> 2] | 0), (w | 0) != -1) : 0) ? ((x = (w + (((w >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1)) | 0), (x | 0) != -1) : 0
                                ) {
                                    if (c) {
                                        w = 0
                                        y = x
                                        z = k
                                        while (1) {
                                            A = z
                                            z = f[(q + (((((y | 0) / 3) | 0) * 12) | 0) + (((y | 0) % 3 | 0) << 2)) >> 2] | 0
                                            B = (w + (((z | 0) != (A | 0)) & 1)) | 0
                                            if ((y | 0) == (m | 0)) {
                                                C = B
                                                break a
                                            }
                                            A = ((((y >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + y) | 0
                                            if ((A | 0) == -1) {
                                                C = B
                                                break a
                                            }
                                            D = f[((f[h >> 2] | 0) + (A << 2)) >> 2] | 0
                                            if ((D | 0) == -1) {
                                                C = B
                                                break a
                                            }
                                            y = (D + (((D >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1)) | 0
                                            if ((y | 0) == -1) {
                                                C = B
                                                break a
                                            } else w = B
                                        }
                                    } else {
                                        E = 0
                                        F = x
                                        G = m
                                        H = k
                                    }
                                    while (1) {
                                        w = f[(q + (((((F | 0) / 3) | 0) * 12) | 0) + (((F | 0) % 3 | 0) << 2)) >> 2] | 0
                                        b: do
                                            if ((w | 0) == (H | 0)) {
                                                y = 0
                                                while (1) {
                                                    z = f[((f[(j + (y << 2)) >> 2] | 0) + 28) >> 2] | 0
                                                    y = (y + 1) | 0
                                                    if ((f[(z + (F << 2)) >> 2] | 0) != (f[(z + (G << 2)) >> 2] | 0)) {
                                                        I = H
                                                        J = 28
                                                        break b
                                                    }
                                                    if (y >>> 0 >= d >>> 0) {
                                                        K = H
                                                        L = E
                                                        break
                                                    }
                                                }
                                            } else {
                                                I = w
                                                J = 28
                                            }
                                        while (0)
                                        if ((J | 0) == 28) {
                                            J = 0
                                            K = I
                                            L = (E + 1) | 0
                                        }
                                        if ((F | 0) == (m | 0)) {
                                            C = L
                                            break a
                                        }
                                        w = ((((F >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + F) | 0
                                        if ((w | 0) == -1) {
                                            C = L
                                            break a
                                        }
                                        y = f[((f[h >> 2] | 0) + (w << 2)) >> 2] | 0
                                        if ((y | 0) == -1) {
                                            C = L
                                            break a
                                        }
                                        w = (y + (((y >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1)) | 0
                                        if ((w | 0) == -1) {
                                            C = L
                                            break
                                        } else {
                                            y = F
                                            E = L
                                            F = w
                                            H = K
                                            G = y
                                        }
                                    }
                                } else C = 0
                            while (0)
                            m = f[(e + (g << 2)) >> 2] | 0
                            q = (m + 1) | 0
                            if (
                                ((m | 0) != -1 ? ((k = ((q >>> 0) % 3 | 0 | 0) == 0 ? (m + -2) | 0 : q), (k | 0) != -1) : 0)
                                    ? ((q = f[((f[h >> 2] | 0) + (k << 2)) >> 2] | 0), (k = (q + 1) | 0), (q | 0) != -1)
                                    : 0
                            )
                                M = ((((k >>> 0) % 3 | 0 | 0) == 0 ? (q + -2) | 0 : k) | 0) == -1
                            else M = 1
                            v = (C + p + (((((C | 0) != 0) & (M ^ 1)) << 31) >> 31)) | 0
                        }
                        g = (g + 1) | 0
                        if (g >>> 0 >= n >>> 0) {
                            s = v
                            t = j
                            break
                        } else p = v
                    }
                }
                if (t | 0) {
                    v = f[l >> 2] | 0
                    if ((v | 0) != (t | 0)) f[l >> 2] = v + (~(((v + -4 - t) | 0) >>> 2) << 2)
                    br(t)
                }
                N = s
            } else N = i
            f[(a + 52) >> 2] = N
            u = b
            return
        }
        function Nc(a, c, d, e, g, h) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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
            i = u
            u = (u + 32) | 0
            j = (i + 4) | 0
            k = i
            l = (i + 16) | 0
            m = (_(e | 0) | 0) ^ 31
            if ((e | 0) > 0)
                if (m >>> 0 > 17) {
                    n = 0
                    u = i
                    return n | 0
                } else o = (m + 1) | 0
            else o = 1
            do
                if (g) {
                    m = dn(48) | 0
                    f[j >> 2] = m
                    f[(j + 8) >> 2] = -2147483600
                    f[(j + 4) >> 2] = 33
                    e = m
                    p = 13067
                    q = (e + 33) | 0
                    do {
                        b[e >> 0] = b[p >> 0] | 0
                        e = (e + 1) | 0
                        p = (p + 1) | 0
                    } while ((e | 0) < (q | 0))
                    b[(m + 33) >> 0] = 0
                    r = (sh(g, j) | 0) == 0
                    if ((b[(j + 11) >> 0] | 0) < 0) br(f[j >> 2] | 0)
                    if (!r) {
                        r = dn(48) | 0
                        f[j >> 2] = r
                        f[(j + 8) >> 2] = -2147483600
                        f[(j + 4) >> 2] = 33
                        e = r
                        p = 13067
                        q = (e + 33) | 0
                        do {
                            b[e >> 0] = b[p >> 0] | 0
                            e = (e + 1) | 0
                            p = (p + 1) | 0
                        } while ((e | 0) < (q | 0))
                        b[(r + 33) >> 0] = 0
                        p = Ck(g, j) | 0
                        if ((b[(j + 11) >> 0] | 0) < 0) br(f[j >> 2] | 0)
                        if ((p | 0) < 4) {
                            s = (o + -2) | 0
                            break
                        }
                        if ((p | 0) < 6) {
                            s = (o + -1) | 0
                            break
                        }
                        if ((p | 0) > 9) {
                            s = (o + 2) | 0
                            break
                        } else {
                            s = (o + (((p | 0) > 7) & 1)) | 0
                            break
                        }
                    } else s = o
                } else s = o
            while (0)
            o = (s | 0) > 1 ? s : 1
            s = (o | 0) < 18 ? o : 18
            b[l >> 0] = s
            o = (h + 16) | 0
            g = f[(o + 4) >> 2] | 0
            if (!(((g | 0) > 0) | (((g | 0) == 0) & ((f[o >> 2] | 0) >>> 0 > 0)))) {
                f[k >> 2] = f[(h + 4) >> 2]
                f[j >> 2] = f[k >> 2]
                ye(h, j, l, (l + 1) | 0) | 0
            }
            do
                switch (s & 31) {
                    case 1:
                    case 0: {
                        n = je(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 2: {
                        n = ie(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 3: {
                        n = he(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 4: {
                        n = ge(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 5: {
                        n = fe(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 6: {
                        n = ee(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 7: {
                        n = de(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 8: {
                        n = ce(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 9: {
                        n = be(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 10: {
                        n = ae(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 11: {
                        n = $d(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 12: {
                        n = _d(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 13: {
                        n = Zd(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 14: {
                        n = Yd(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 15: {
                        n = Xd(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 16: {
                        n = Wd(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 17: {
                        n = Vd(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    case 18: {
                        n = Ud(a, c, d, h) | 0
                        u = i
                        return n | 0
                    }
                    default: {
                        n = 0
                        u = i
                        return n | 0
                    }
                }
            while (0)
            return 0
        }
        function Oc(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 1048576.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 1048576) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                wb(z, A, g)
                a: do
                    if ((x | 0) < 1048576) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 1048576 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 1048576
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -1048576) | 0
                        m = x
                        while (1) {
                            v = 1048576.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 1048576) {
                                    C = p
                                    D = 1048576
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 1048576) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 9.5367431640625e-7) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function Pc(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 1048576.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 1048576) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                xb(z, A, g)
                a: do
                    if ((x | 0) < 1048576) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 1048576 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 1048576
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -1048576) | 0
                        m = x
                        while (1) {
                            v = 1048576.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 1048576) {
                                    C = p
                                    D = 1048576
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 1048576) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 9.5367431640625e-7) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function Qc(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 1048576.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 1048576) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                yb(z, A, g)
                a: do
                    if ((x | 0) < 1048576) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 1048576 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 1048576
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -1048576) | 0
                        m = x
                        while (1) {
                            v = 1048576.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 1048576) {
                                    C = p
                                    D = 1048576
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 1048576) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 9.5367431640625e-7) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function Rc(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 1048576.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 1048576) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                zb(z, A, g)
                a: do
                    if ((x | 0) < 1048576) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 1048576 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 1048576
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -1048576) | 0
                        m = x
                        while (1) {
                            v = 1048576.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 1048576) {
                                    C = p
                                    D = 1048576
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 1048576) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 9.5367431640625e-7) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function Sc(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 1048576.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 1048576) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                Ab(z, A, g)
                a: do
                    if ((x | 0) < 1048576) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 1048576 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 1048576
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -1048576) | 0
                        m = x
                        while (1) {
                            v = 1048576.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 1048576) {
                                    C = p
                                    D = 1048576
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 1048576) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 9.5367431640625e-7) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function Tc(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 524288.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 524288) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                Eb(z, A, g)
                a: do
                    if ((x | 0) < 524288) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 524288 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 524288
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -524288) | 0
                        m = x
                        while (1) {
                            v = 524288.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 524288) {
                                    C = p
                                    D = 524288
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 524288) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 1.9073486328125e-6) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function Uc(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 262144.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 262144) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                Bb(z, A, g)
                a: do
                    if ((x | 0) < 262144) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 262144 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 262144
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -262144) | 0
                        m = x
                        while (1) {
                            v = 262144.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 262144) {
                                    C = p
                                    D = 262144
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 262144) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 3.814697265625e-6) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function Vc(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 65536.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 65536) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                Cb(z, A, g)
                a: do
                    if ((x | 0) < 65536) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 65536 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 65536
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -65536) | 0
                        m = x
                        while (1) {
                            v = 65536.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 65536) {
                                    C = p
                                    D = 65536
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 65536) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 0.0000152587890625) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function Wc(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 32768.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 32768) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                Db(z, A, g)
                a: do
                    if ((x | 0) < 32768) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 32768 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 32768
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -32768) | 0
                        m = x
                        while (1) {
                            v = 32768.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 32768) {
                                    C = p
                                    D = 32768
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 32768) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 0.000030517578125) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function Xc(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 8192.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 8192) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                Fb(z, A, g)
                a: do
                    if ((x | 0) < 8192) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 8192 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 8192
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -8192) | 0
                        m = x
                        while (1) {
                            v = 8192.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 8192) {
                                    C = p
                                    D = 8192
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 8192) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 0.0001220703125) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function Yc(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 4096.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 4096) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                Gb(z, A, g)
                a: do
                    if ((x | 0) < 4096) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 4096 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 4096
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -4096) | 0
                        m = x
                        while (1) {
                            v = 4096.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 4096) {
                                    C = p
                                    D = 4096
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 4096) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 0.000244140625) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function Zc(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 4096.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 4096) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                Hb(z, A, g)
                a: do
                    if ((x | 0) < 4096) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 4096 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 4096
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -4096) | 0
                        m = x
                        while (1) {
                            v = 4096.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 4096) {
                                    C = p
                                    D = 4096
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 4096) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 0.000244140625) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function _c(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 4096.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 4096) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                Ib(z, A, g)
                a: do
                    if ((x | 0) < 4096) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 4096 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 4096
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -4096) | 0
                        m = x
                        while (1) {
                            v = 4096.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 4096) {
                                    C = p
                                    D = 4096
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 4096) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 0.000244140625) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function $c(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 4096.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 4096) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                Jb(z, A, g)
                a: do
                    if ((x | 0) < 4096) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 4096 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 4096
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -4096) | 0
                        m = x
                        while (1) {
                            v = 4096.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 4096) {
                                    C = p
                                    D = 4096
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 4096) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 0.000244140625) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function ad(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 4096.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 4096) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                Kb(z, A, g)
                a: do
                    if ((x | 0) < 4096) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 4096 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 4096
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -4096) | 0
                        m = x
                        while (1) {
                            v = 4096.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 4096) {
                                    C = p
                                    D = 4096
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 4096) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 0.000244140625) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function bd(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 4096.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 4096) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                Lb(z, A, g)
                a: do
                    if ((x | 0) < 4096) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 4096 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 4096
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -4096) | 0
                        m = x
                        while (1) {
                            v = 4096.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 4096) {
                                    C = p
                                    D = 4096
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 4096) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 0.000244140625) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function cd(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 4096.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 4096) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                Mb(z, A, g)
                a: do
                    if ((x | 0) < 4096) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 4096 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 4096
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -4096) | 0
                        m = x
                        while (1) {
                            v = 4096.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 4096) {
                                    C = p
                                    D = 4096
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 4096) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 0.000244140625) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function dd(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0.0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0.0,
                F = 0.0,
                G = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            if ((c | 0) > 0) {
                i = 0
                j = 0
                k = 0
                l = 0
                while (1) {
                    m = (b + (j << 3)) | 0
                    n = f[m >> 2] | 0
                    o = f[(m + 4) >> 2] | 0
                    m = Tn(n | 0, o | 0, k | 0, l | 0) | 0
                    p = I
                    q = ((n | 0) == 0) & ((o | 0) == 0) ? i : j
                    j = (j + 1) | 0
                    if ((j | 0) == (c | 0)) {
                        r = q
                        s = p
                        t = m
                        break
                    } else {
                        i = q
                        k = m
                        l = p
                    }
                }
            } else {
                r = 0
                s = 0
                t = 0
            }
            l = (r + 1) | 0
            f[(a + 12) >> 2] = l
            k = (a + 4) | 0
            i = f[k >> 2] | 0
            c = f[a >> 2] | 0
            j = (i - c) >> 3
            p = c
            c = i
            if (l >>> 0 <= j >>> 0) {
                if (l >>> 0 < j >>> 0 ? ((i = (p + (l << 3)) | 0), (i | 0) != (c | 0)) : 0) f[k >> 2] = c + (~(((c + -8 - i) | 0) >>> 3) << 3)
            } else dh(a, (l - j) | 0)
            v = +(t >>> 0) + 4294967296.0 * +(s >>> 0)
            s = (r | 0) < 0
            if (!s) {
                t = f[a >> 2] | 0
                j = 0
                i = 0
                do {
                    c = (b + (i << 3)) | 0
                    k = f[c >> 2] | 0
                    p = f[(c + 4) >> 2] | 0
                    c = ~~(((+(k >>> 0) + 4294967296.0 * +(p >>> 0)) / v) * 4096.0 + 0.5) >>> 0
                    m = (((k | 0) != 0) | ((p | 0) != 0)) & ((c | 0) == 0) ? 1 : c
                    f[(t + (i << 3)) >> 2] = m
                    j = (m + j) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (l | 0))
                if ((j | 0) == 4096) {
                    if (s) {
                        w = 0
                        u = e
                        return w | 0
                    }
                } else {
                    x = j
                    y = 12
                }
            } else {
                x = 0
                y = 12
            }
            if ((y | 0) == 12) {
                f[h >> 2] = 0
                j = (h + 4) | 0
                f[j >> 2] = 0
                f[(h + 8) >> 2] = 0
                do
                    if (l)
                        if (l >>> 0 > 1073741823) mq(h)
                        else {
                            i = l << 2
                            t = dn(i) | 0
                            f[h >> 2] = t
                            m = (t + (l << 2)) | 0
                            f[(h + 8) >> 2] = m
                            hj(t | 0, 0, i | 0) | 0
                            f[j >> 2] = m
                            z = t
                            A = m
                            break
                        }
                    else {
                        z = 0
                        A = 0
                    }
                while (0)
                if (!s ? ((f[z >> 2] = 0), r | 0) : 0) {
                    m = 1
                    do {
                        f[(z + (m << 2)) >> 2] = m
                        m = (m + 1) | 0
                    } while ((m | 0) != (l | 0))
                }
                f[g >> 2] = a
                Nb(z, A, g)
                a: do
                    if ((x | 0) < 4096) {
                        g = ((f[a >> 2] | 0) + (f[((f[j >> 2] | 0) + -4) >> 2] << 3)) | 0
                        f[g >> 2] = 4096 - x + (f[g >> 2] | 0)
                        B = 0
                    } else {
                        g = f[h >> 2] | 0
                        if ((r | 0) <= 0) {
                            A = (x | 0) > 4096
                            while (1)
                                if (!A) {
                                    B = 0
                                    break a
                                }
                        }
                        A = f[a >> 2] | 0
                        z = (x + -4096) | 0
                        m = x
                        while (1) {
                            v = 4096.0 / +(m | 0)
                            t = r
                            i = z
                            c = m
                            while (1) {
                                p = (A + (f[(g + (t << 2)) >> 2] << 3)) | 0
                                k = f[p >> 2] | 0
                                if (k >>> 0 < 2) {
                                    y = 28
                                    break
                                }
                                q = (k - ~~+J(+(v * +(k >>> 0)))) | 0
                                o = (q | 0) == 0 ? 1 : q
                                q = (o | 0) < (k | 0) ? o : (k + -1) | 0
                                o = (q | 0) > (i | 0) ? i : q
                                f[p >> 2] = k - o
                                k = (c - o) | 0
                                p = (i - o) | 0
                                if ((k | 0) == 4096) {
                                    C = p
                                    D = 4096
                                    break
                                }
                                if ((t | 0) > 1) {
                                    t = (t + -1) | 0
                                    i = p
                                    c = k
                                } else {
                                    C = p
                                    D = k
                                    break
                                }
                            }
                            if ((y | 0) == 28) {
                                y = 0
                                if ((t | 0) == (r | 0)) {
                                    B = 1
                                    break a
                                } else {
                                    C = i
                                    D = c
                                }
                            }
                            if ((C | 0) > 0) {
                                z = C
                                m = D
                            } else {
                                B = 0
                                break
                            }
                        }
                    }
                while (0)
                D = f[h >> 2] | 0
                if (D | 0) {
                    h = f[j >> 2] | 0
                    if ((h | 0) != (D | 0)) f[j >> 2] = h + (~(((h + -4 - D) | 0) >>> 2) << 2)
                    br(D)
                }
                if (((B | 0) != 0) | s) {
                    w = 0
                    u = e
                    return w | 0
                }
            }
            B = f[a >> 2] | 0
            D = 0
            h = 0
            do {
                f[(B + (D << 3) + 4) >> 2] = h
                h = ((f[(B + (D << 3)) >> 2] | 0) + h) | 0
                D = (D + 1) | 0
            } while ((D | 0) != (l | 0))
            if ((h | 0) != 4096) {
                w = 0
                u = e
                return w | 0
            }
            if (s) E = 0.0
            else {
                s = f[a >> 2] | 0
                h = 0
                v = 0.0
                while (1) {
                    D = f[(s + (h << 3)) >> 2] | 0
                    if (!D) F = v
                    else {
                        B = (b + (h << 3)) | 0
                        G = +((f[B >> 2] | 0) >>> 0) + 4294967296.0 * +((f[(B + 4) >> 2] | 0) >>> 0)
                        F = v + +Fg(+(D >>> 0) * 0.000244140625) * G
                    }
                    h = (h + 1) | 0
                    if ((h | 0) == (l | 0)) {
                        E = F
                        break
                    } else v = F
                }
            }
            F = +W(+-E)
            l = +K(F) >= 1.0 ? (F > 0.0 ? ~~+Y(+J(F / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((F - +(~~F >>> 0)) / 4294967296.0) >>> 0) : 0
            h = (a + 16) | 0
            f[h >> 2] = ~~F >>> 0
            f[(h + 4) >> 2] = l
            w = xe(a, d) | 0
            u = e
            return w | 0
        }
        function ed(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0
            g = u
            u = (u + 32) | 0
            d = (g + 16) | 0
            h = (g + 8) | 0
            i = g
            j = e >>> 0 > 1073741823 ? -1 : e << 2
            k = _q(j) | 0
            hj(k | 0, 0, j | 0) | 0
            j = f[(a + 28) >> 2] | 0
            l = (a + 36) | 0
            m = f[l >> 2] | 0
            n = f[(m + 4) >> 2] | 0
            o = f[m >> 2] | 0
            p = (n - o) | 0
            a: do
                if ((p | 0) > 4) {
                    q = p >> 2
                    r = f[(a + 32) >> 2] | 0
                    s = (a + 8) | 0
                    t = (h + 4) | 0
                    v = (i + 4) | 0
                    w = (d + 4) | 0
                    x = (j + 12) | 0
                    y = (e | 0) > 0
                    z = (k + 4) | 0
                    A = (h + 4) | 0
                    B = (i + 4) | 0
                    C = (d + 4) | 0
                    D = (q + -1) | 0
                    if (((n - o) >> 2) >>> 0 > D >>> 0) {
                        E = q
                        F = D
                        G = o
                    } else {
                        H = m
                        mq(H)
                    }
                    while (1) {
                        D = f[(G + (F << 2)) >> 2] | 0
                        q = X(F, e) | 0
                        if ((D | 0) != -1 ? ((I = f[((f[x >> 2] | 0) + (D << 2)) >> 2] | 0), (I | 0) != -1) : 0) {
                            D = f[j >> 2] | 0
                            J = f[r >> 2] | 0
                            K = f[(J + (f[(D + (I << 2)) >> 2] << 2)) >> 2] | 0
                            L = (I + 1) | 0
                            M = ((L >>> 0) % 3 | 0 | 0) == 0 ? (I + -2) | 0 : L
                            if ((M | 0) == -1) N = -1
                            else N = f[(D + (M << 2)) >> 2] | 0
                            M = f[(J + (N << 2)) >> 2] | 0
                            L = ((((I >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + I) | 0
                            if ((L | 0) == -1) O = -1
                            else O = f[(D + (L << 2)) >> 2] | 0
                            L = f[(J + (O << 2)) >> 2] | 0
                            if (((K | 0) < (F | 0)) & ((M | 0) < (F | 0)) & ((L | 0) < (F | 0))) {
                                J = X(K, e) | 0
                                K = X(M, e) | 0
                                M = X(L, e) | 0
                                if (y) {
                                    L = 0
                                    do {
                                        f[(k + (L << 2)) >> 2] = (f[(b + ((L + M) << 2)) >> 2] | 0) + (f[(b + ((L + K) << 2)) >> 2] | 0) - (f[(b + ((L + J) << 2)) >> 2] | 0)
                                        L = (L + 1) | 0
                                    } while ((L | 0) != (e | 0))
                                }
                                L = (b + (q << 2)) | 0
                                J = (c + (q << 2)) | 0
                                K = f[(L + 4) >> 2] | 0
                                M = f[k >> 2] | 0
                                D = f[z >> 2] | 0
                                f[h >> 2] = f[L >> 2]
                                f[A >> 2] = K
                                f[i >> 2] = M
                                f[B >> 2] = D
                                Dd(d, s, h, i)
                                f[J >> 2] = f[d >> 2]
                                f[(J + 4) >> 2] = f[C >> 2]
                            } else P = 15
                        } else P = 15
                        if ((P | 0) == 15) {
                            P = 0
                            J = (b + (q << 2)) | 0
                            D = (b + ((X((E + -2) | 0, e) | 0) << 2)) | 0
                            M = (c + (q << 2)) | 0
                            K = f[(J + 4) >> 2] | 0
                            L = f[D >> 2] | 0
                            I = f[(D + 4) >> 2] | 0
                            f[h >> 2] = f[J >> 2]
                            f[t >> 2] = K
                            f[i >> 2] = L
                            f[v >> 2] = I
                            Dd(d, s, h, i)
                            f[M >> 2] = f[d >> 2]
                            f[(M + 4) >> 2] = f[w >> 2]
                        }
                        if ((E | 0) <= 2) break a
                        M = f[l >> 2] | 0
                        G = f[M >> 2] | 0
                        I = (F + -1) | 0
                        if ((((f[(M + 4) >> 2] | 0) - G) >> 2) >>> 0 <= I >>> 0) {
                            H = M
                            break
                        } else {
                            M = F
                            F = I
                            E = M
                        }
                    }
                    mq(H)
                }
            while (0)
            if ((e | 0) <= 0) {
                Q = (a + 8) | 0
                R = (b + 4) | 0
                S = f[b >> 2] | 0
                T = f[R >> 2] | 0
                U = (k + 4) | 0
                V = f[k >> 2] | 0
                W = f[U >> 2] | 0
                f[h >> 2] = S
                Y = (h + 4) | 0
                f[Y >> 2] = T
                f[i >> 2] = V
                Z = (i + 4) | 0
                f[Z >> 2] = W
                Dd(d, Q, h, i)
                _ = f[d >> 2] | 0
                f[c >> 2] = _
                $ = (d + 4) | 0
                aa = f[$ >> 2] | 0
                ba = (c + 4) | 0
                f[ba >> 2] = aa
                $q(k)
                u = g
                return 1
            }
            hj(k | 0, 0, (e << 2) | 0) | 0
            Q = (a + 8) | 0
            R = (b + 4) | 0
            S = f[b >> 2] | 0
            T = f[R >> 2] | 0
            U = (k + 4) | 0
            V = f[k >> 2] | 0
            W = f[U >> 2] | 0
            f[h >> 2] = S
            Y = (h + 4) | 0
            f[Y >> 2] = T
            f[i >> 2] = V
            Z = (i + 4) | 0
            f[Z >> 2] = W
            Dd(d, Q, h, i)
            _ = f[d >> 2] | 0
            f[c >> 2] = _
            $ = (d + 4) | 0
            aa = f[$ >> 2] | 0
            ba = (c + 4) | 0
            f[ba >> 2] = aa
            $q(k)
            u = g
            return 1
        }
        function fd(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                J = 0,
                K = 0,
                L = 0,
                M = 0
            d = u
            u = (u + 32) | 0
            e = d
            g = (d + 20) | 0
            h = (d + 24) | 0
            i = (d + 8) | 0
            j = f[a >> 2] | 0
            k = (j + 8) | 0
            l = j
            j = f[l >> 2] | 0
            m = f[(l + 4) >> 2] | 0
            l = Tn(j | 0, m | 0, f[k >> 2] | 0, f[(k + 4) >> 2] | 0) | 0
            k = I
            n = Tn(l | 0, k | 0, (((l | 0) == 0) & ((k | 0) == 0) & 1) | 0, 0) | 0
            k = ~~(((+(j >>> 0) + 4294967296.0 * +(m >>> 0)) / (+(n >>> 0) + 4294967296.0 * +(I >>> 0))) * 256.0 + 0.5) >>> 0
            n = k >>> 0 < 255 ? k : 255
            k = (n + (((n | 0) == 0) & 1)) & 255
            b[h >> 0] = k
            n = (a + 12) | 0
            m = (a + 16) | 0
            j = ((((f[m >> 2] | 0) - (f[n >> 2] | 0)) << 1) + 64) | 0
            f[i >> 2] = 0
            l = (i + 4) | 0
            f[l >> 2] = 0
            f[(i + 8) >> 2] = 0
            if (!j) o = 0
            else {
                if ((j | 0) < 0) mq(i)
                p = dn(j) | 0
                f[l >> 2] = p
                f[i >> 2] = p
                f[(i + 8) >> 2] = p + j
                q = j
                j = p
                do {
                    b[j >> 0] = 0
                    j = ((f[l >> 2] | 0) + 1) | 0
                    f[l >> 2] = j
                    q = (q + -1) | 0
                } while ((q | 0) != 0)
                o = f[i >> 2] | 0
            }
            q = (a + 28) | 0
            j = ((f[q >> 2] | 0) + -1) | 0
            a: do
                if ((j | 0) > -1) {
                    p = (a + 24) | 0
                    r = j
                    s = 0
                    t = 4096
                    v = k
                    while (1) {
                        w = ((f[p >> 2] & (1 << r)) | 0) != 0
                        x = (w ? (0 - (v & 255)) & 255 : v) & 255
                        if (t >>> 0 < (x << 12) >>> 0) {
                            y = s
                            z = t
                        } else {
                            b[(o + s) >> 0] = t
                            y = (s + 1) | 0
                            z = t >>> 8
                        }
                        on(f[(3780 + (x << 3)) >> 2] | 0, 0, z | 0, 0) | 0
                        A = (z + (w ? 0 : (0 - v) & 255) + (X(((z + I) | 0) >>> (f[(3780 + (x << 3) + 4) >> 2] | 0), (256 - x) | 0) | 0)) | 0
                        x = (r + -1) | 0
                        if ((x | 0) <= -1) {
                            B = y
                            C = A
                            break a
                        }
                        r = x
                        s = y
                        t = A
                        v = b[h >> 0] | 0
                    }
                } else {
                    B = 0
                    C = 4096
                }
            while (0)
            y = f[m >> 2] | 0
            if ((f[n >> 2] | 0) == (y | 0)) {
                D = B
                E = C
            } else {
                z = B
                B = C
                C = y
                while (1) {
                    C = (C + -4) | 0
                    y = f[C >> 2] | 0
                    k = 31
                    j = z
                    v = B
                    while (1) {
                        t = b[h >> 0] | 0
                        s = (((1 << k) & y) | 0) != 0
                        r = (s ? (0 - (t & 255)) & 255 : t) & 255
                        if (v >>> 0 < (r << 12) >>> 0) {
                            F = j
                            G = v
                        } else {
                            b[(o + j) >> 0] = v
                            F = (j + 1) | 0
                            G = v >>> 8
                        }
                        on(f[(3780 + (r << 3)) >> 2] | 0, 0, G | 0, 0) | 0
                        v = (G + (s ? 0 : (0 - t) & 255) + (X(((G + I) | 0) >>> (f[(3780 + (r << 3) + 4) >> 2] | 0), (256 - r) | 0) | 0)) | 0
                        if ((k | 0) <= 0) break
                        else {
                            k = (k + -1) | 0
                            j = F
                        }
                    }
                    if ((f[n >> 2] | 0) == (C | 0)) {
                        D = F
                        E = v
                        break
                    } else {
                        z = F
                        B = v
                    }
                }
            }
            B = (E + -4096) | 0
            do
                if (B >>> 0 >= 64) {
                    if (B >>> 0 < 16384) {
                        F = (o + D) | 0
                        z = (E + 12288) | 0
                        b[F >> 0] = z
                        H = 2
                        J = z >>> 8
                        K = (F + 1) | 0
                        L = 25
                        break
                    }
                    if (B >>> 0 < 4194304) {
                        F = (o + D) | 0
                        z = (E + 8384512) | 0
                        b[F >> 0] = z
                        b[(F + 1) >> 0] = z >>> 8
                        H = 3
                        J = z >>> 16
                        K = (F + 2) | 0
                        L = 25
                    } else M = D
                } else {
                    H = 1
                    J = B
                    K = (o + D) | 0
                    L = 25
                }
            while (0)
            if ((L | 0) == 25) {
                b[K >> 0] = J
                M = (H + D) | 0
            }
            D = (c + 16) | 0
            H = D
            J = f[(H + 4) >> 2] | 0
            if (!(((J | 0) > 0) | (((J | 0) == 0) & ((f[H >> 2] | 0) >>> 0 > 0)))) {
                f[g >> 2] = f[(c + 4) >> 2]
                f[e >> 2] = f[g >> 2]
                ye(c, e, h, (h + 1) | 0) | 0
            }
            Nh(M, c) | 0
            h = f[i >> 2] | 0
            H = D
            D = f[(H + 4) >> 2] | 0
            if (!(((D | 0) > 0) | (((D | 0) == 0) & ((f[H >> 2] | 0) >>> 0 > 0)))) {
                f[g >> 2] = f[(c + 4) >> 2]
                f[e >> 2] = f[g >> 2]
                ye(c, e, h, (h + M) | 0) | 0
            }
            M = e
            f[M >> 2] = 0
            f[(M + 4) >> 2] = 0
            cf(a, 2, e)
            e = f[(a + 12) >> 2] | 0
            M = f[m >> 2] | 0
            if ((M | 0) != (e | 0)) f[m >> 2] = M + (~(((M + -4 - e) | 0) >>> 2) << 2)
            f[(a + 24) >> 2] = 0
            f[q >> 2] = 0
            q = f[i >> 2] | 0
            if (!q) {
                u = d
                return
            }
            if ((f[l >> 2] | 0) != (q | 0)) f[l >> 2] = q
            br(q)
            u = d
            return
        }
        function gd(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                I = 0,
                J = 0
            c = u
            u = (u + 16) | 0
            b = (c + 8) | 0
            d = (c + 4) | 0
            e = c
            g = (a + 64) | 0
            h = f[g >> 2] | 0
            if ((f[(h + 28) >> 2] | 0) == (f[(h + 24) >> 2] | 0)) {
                u = c
                return
            }
            i = (a + 52) | 0
            j = (a + 56) | 0
            k = (a + 60) | 0
            l = (a + 12) | 0
            m = (a + 28) | 0
            n = (a + 40) | 0
            o = (a + 44) | 0
            p = (a + 48) | 0
            q = 0
            r = 0
            s = h
            while (1) {
                h = f[((f[(s + 24) >> 2] | 0) + (r << 2)) >> 2] | 0
                if ((h | 0) == -1) {
                    t = q
                    v = s
                } else {
                    w = (q + 1) | 0
                    f[b >> 2] = q
                    x = f[j >> 2] | 0
                    if ((x | 0) == (f[k >> 2] | 0)) Ci(i, b)
                    else {
                        f[x >> 2] = q
                        f[j >> 2] = x + 4
                    }
                    f[d >> 2] = h
                    f[e >> 2] = 0
                    a: do
                        if (!(f[((f[l >> 2] | 0) + ((r >>> 5) << 2)) >> 2] & (1 << (r & 31)))) y = h
                        else {
                            x = (h + 1) | 0
                            z = ((x >>> 0) % 3 | 0 | 0) == 0 ? (h + -2) | 0 : x
                            if (
                                ((z | 0) != -1 ? ((f[((f[a >> 2] | 0) + ((z >>> 5) << 2)) >> 2] & (1 << (z & 31))) | 0) == 0 : 0)
                                    ? ((x = f[((f[((f[g >> 2] | 0) + 12) >> 2] | 0) + (z << 2)) >> 2] | 0), (z = (x + 1) | 0), (x | 0) != -1)
                                    : 0
                            ) {
                                A = ((z >>> 0) % 3 | 0 | 0) == 0 ? (x + -2) | 0 : z
                                f[e >> 2] = A
                                if ((A | 0) == -1) {
                                    y = h
                                    break
                                } else B = A
                                while (1) {
                                    f[d >> 2] = B
                                    A = (B + 1) | 0
                                    z = ((A >>> 0) % 3 | 0 | 0) == 0 ? (B + -2) | 0 : A
                                    if ((z | 0) == -1) break
                                    if ((f[((f[a >> 2] | 0) + ((z >>> 5) << 2)) >> 2] & (1 << (z & 31))) | 0) break
                                    A = f[((f[((f[g >> 2] | 0) + 12) >> 2] | 0) + (z << 2)) >> 2] | 0
                                    z = (A + 1) | 0
                                    if ((A | 0) == -1) break
                                    x = ((z >>> 0) % 3 | 0 | 0) == 0 ? (A + -2) | 0 : z
                                    f[e >> 2] = x
                                    if ((x | 0) == -1) {
                                        y = B
                                        break a
                                    } else B = x
                                }
                                f[e >> 2] = -1
                                y = B
                                break
                            }
                            f[e >> 2] = -1
                            y = h
                        }
                    while (0)
                    f[((f[m >> 2] | 0) + (y << 2)) >> 2] = f[b >> 2]
                    h = f[o >> 2] | 0
                    if ((h | 0) == (f[p >> 2] | 0)) Ci(n, d)
                    else {
                        f[h >> 2] = f[d >> 2]
                        f[o >> 2] = h + 4
                    }
                    h = f[g >> 2] | 0
                    x = f[d >> 2] | 0
                    b: do
                        if (
                            ((x | 0) != -1 ? ((z = ((((x >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + x) | 0), (z | 0) != -1) : 0) ? ((A = f[((f[(h + 12) >> 2] | 0) + (z << 2)) >> 2] | 0), (A | 0) != -1) : 0
                        ) {
                            z = (A + (((A >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1)) | 0
                            f[e >> 2] = z
                            if (((z | 0) != -1) & ((z | 0) != (x | 0))) {
                                A = w
                                C = z
                                while (1) {
                                    z = (C + 1) | 0
                                    D = ((z >>> 0) % 3 | 0 | 0) == 0 ? (C + -2) | 0 : z
                                    do
                                        if (f[((f[a >> 2] | 0) + ((D >>> 5) << 2)) >> 2] & (1 << (D & 31))) {
                                            z = (A + 1) | 0
                                            f[b >> 2] = A
                                            E = f[j >> 2] | 0
                                            if ((E | 0) == (f[k >> 2] | 0)) Ci(i, b)
                                            else {
                                                f[E >> 2] = A
                                                f[j >> 2] = E + 4
                                            }
                                            E = f[o >> 2] | 0
                                            if ((E | 0) == (f[p >> 2] | 0)) {
                                                Ci(n, e)
                                                F = z
                                                break
                                            } else {
                                                f[E >> 2] = f[e >> 2]
                                                f[o >> 2] = E + 4
                                                F = z
                                                break
                                            }
                                        } else F = A
                                    while (0)
                                    f[((f[m >> 2] | 0) + (f[e >> 2] << 2)) >> 2] = f[b >> 2]
                                    G = f[g >> 2] | 0
                                    D = f[e >> 2] | 0
                                    if ((D | 0) == -1) break
                                    z = ((((D >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + D) | 0
                                    if ((z | 0) == -1) break
                                    D = f[((f[(G + 12) >> 2] | 0) + (z << 2)) >> 2] | 0
                                    if ((D | 0) == -1) break
                                    C = (D + (((D >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1)) | 0
                                    f[e >> 2] = C
                                    if (!((C | 0) != -1 ? (C | 0) != (f[d >> 2] | 0) : 0)) {
                                        H = F
                                        I = G
                                        break b
                                    } else A = F
                                }
                                f[e >> 2] = -1
                                H = F
                                I = G
                            } else {
                                H = w
                                I = h
                            }
                        } else J = 26
                    while (0)
                    if ((J | 0) == 26) {
                        J = 0
                        f[e >> 2] = -1
                        H = w
                        I = h
                    }
                    t = H
                    v = I
                }
                r = (r + 1) | 0
                if (r >>> 0 >= (((f[(v + 28) >> 2] | 0) - (f[(v + 24) >> 2] | 0)) >> 2) >>> 0) break
                else {
                    q = t
                    s = v
                }
            }
            u = c
            return
        }
        function hd(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0
            c = u
            u = (u + 16) | 0
            d = (c + 8) | 0
            e = (c + 4) | 0
            g = c
            h = (a + 124) | 0
            f[h >> 2] = (f[h >> 2] | 0) + 1
            h = (a + 88) | 0
            i = (a + 120) | 0
            j = f[i >> 2] | 0
            k = (j + 1) | 0
            do
                if ((j | 0) != -1) {
                    l = ((k >>> 0) % 3 | 0 | 0) == 0 ? (j + -2) | 0 : k
                    if (!((j >>> 0) % 3 | 0)) {
                        m = (j + 2) | 0
                        n = l
                        break
                    } else {
                        m = (j + -1) | 0
                        n = l
                        break
                    }
                } else {
                    m = -1
                    n = -1
                }
            while (0)
            k = (a + 104) | 0
            l = (a + 92) | 0
            o = f[l >> 2] | 0
            p = (o + (n << 2)) | 0
            q = f[k >> 2] | 0
            r = (q + (f[p >> 2] << 2)) | 0
            s = f[r >> 2] | 0
            switch (b | 0) {
                case 1:
                case 0: {
                    f[r >> 2] = s + -1
                    r = (q + (f[(o + (m << 2)) >> 2] << 2)) | 0
                    f[r >> 2] = (f[r >> 2] | 0) + -1
                    if ((b | 0) == 1) {
                        if ((m | 0) != -1 ? ((r = f[((f[((f[h >> 2] | 0) + 12) >> 2] | 0) + (m << 2)) >> 2] | 0), (r | 0) != -1) : 0) {
                            t = (a + 64) | 0
                            v = 1
                            w = r
                            while (1) {
                                r = f[t >> 2] | 0
                                x = f[((f[r >> 2] | 0) + 36) >> 2] | 0
                                f[e >> 2] = ((w >>> 0) / 3) | 0
                                f[d >> 2] = f[e >> 2]
                                if (Ra[x & 127](r, d) | 0) {
                                    y = v
                                    break
                                }
                                r = (w + 1) | 0
                                x = ((r >>> 0) % 3 | 0 | 0) == 0 ? (w + -2) | 0 : r
                                if ((x | 0) == -1) {
                                    z = 12
                                    break
                                }
                                w = f[((f[((f[h >> 2] | 0) + 12) >> 2] | 0) + (x << 2)) >> 2] | 0
                                x = (v + 1) | 0
                                if ((w | 0) == -1) {
                                    y = x
                                    break
                                } else v = x
                            }
                            if ((z | 0) == 12) y = (v + 1) | 0
                            A = y
                            B = f[k >> 2] | 0
                            C = f[l >> 2] | 0
                        } else {
                            A = 1
                            B = q
                            C = o
                        }
                        f[(B + (f[(C + (f[i >> 2] << 2)) >> 2] << 2)) >> 2] = A
                        A = (a + 108) | 0
                        i = f[A >> 2] | 0
                        C = (i - B) >> 2
                        B = i
                        if ((n | 0) != -1 ? ((i = f[((f[((f[h >> 2] | 0) + 12) >> 2] | 0) + (n << 2)) >> 2] | 0), (i | 0) != -1) : 0) {
                            n = (a + 64) | 0
                            y = 1
                            v = i
                            while (1) {
                                i = f[n >> 2] | 0
                                w = f[((f[i >> 2] | 0) + 36) >> 2] | 0
                                f[g >> 2] = ((v >>> 0) / 3) | 0
                                f[d >> 2] = f[g >> 2]
                                if (Ra[w & 127](i, d) | 0) {
                                    D = y
                                    break
                                }
                                i = (v + 1) | 0
                                f[((f[l >> 2] | 0) + ((((i >>> 0) % 3 | 0 | 0) == 0 ? (v + -2) | 0 : i) << 2)) >> 2] = C
                                i = ((((v >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + v) | 0
                                if ((i | 0) == -1) {
                                    z = 20
                                    break
                                }
                                v = f[((f[((f[h >> 2] | 0) + 12) >> 2] | 0) + (i << 2)) >> 2] | 0
                                i = (y + 1) | 0
                                if ((v | 0) == -1) {
                                    D = i
                                    break
                                } else y = i
                            }
                            if ((z | 0) == 20) D = (y + 1) | 0
                            E = D
                            F = f[A >> 2] | 0
                        } else {
                            E = 1
                            F = B
                        }
                        f[d >> 2] = E
                        if (F >>> 0 < (f[(a + 112) >> 2] | 0) >>> 0) {
                            f[F >> 2] = E
                            f[A >> 2] = F + 4
                        } else Ci(k, d)
                    }
                    break
                }
                case 5: {
                    k = (q + (f[(o + (j << 2)) >> 2] << 2)) | 0
                    f[k >> 2] = (f[k >> 2] | 0) + -1
                    k = (q + (f[p >> 2] << 2)) | 0
                    f[k >> 2] = (f[k >> 2] | 0) + -1
                    k = (q + (f[(o + (m << 2)) >> 2] << 2)) | 0
                    f[k >> 2] = (f[k >> 2] | 0) + -2
                    break
                }
                case 3: {
                    k = (q + (f[(o + (j << 2)) >> 2] << 2)) | 0
                    f[k >> 2] = (f[k >> 2] | 0) + -1
                    k = (q + (f[p >> 2] << 2)) | 0
                    f[k >> 2] = (f[k >> 2] | 0) + -2
                    k = (q + (f[(o + (m << 2)) >> 2] << 2)) | 0
                    f[k >> 2] = (f[k >> 2] | 0) + -1
                    break
                }
                case 7: {
                    k = (q + (f[(o + (j << 2)) >> 2] << 2)) | 0
                    f[k >> 2] = (f[k >> 2] | 0) + -2
                    k = (q + (f[p >> 2] << 2)) | 0
                    f[k >> 2] = (f[k >> 2] | 0) + -2
                    k = (q + (f[(o + (m << 2)) >> 2] << 2)) | 0
                    f[k >> 2] = (f[k >> 2] | 0) + -2
                    break
                }
                default: {
                }
            }
            k = (a + 116) | 0
            m = f[k >> 2] | 0
            if ((m | 0) == -1) {
                f[k >> 2] = b
                u = c
                return
            }
            o = f[(a + 128) >> 2] | 0
            if ((s | 0) < (o | 0)) G = o
            else {
                q = f[(a + 132) >> 2] | 0
                G = (s | 0) > (q | 0) ? q : s
            }
            s = (G - o) | 0
            o = f[(a + 136) >> 2] | 0
            a = f[(3384 + (m << 2)) >> 2] | 0
            f[d >> 2] = a
            m = (o + ((s * 12) | 0) + 4) | 0
            G = f[m >> 2] | 0
            if (G >>> 0 < (f[(o + ((s * 12) | 0) + 8) >> 2] | 0) >>> 0) {
                f[G >> 2] = a
                f[m >> 2] = G + 4
            } else Ci((o + ((s * 12) | 0)) | 0, d)
            f[k >> 2] = b
            u = c
            return
        }
        function id(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            g = u
            u = (u + 32) | 0
            d = (g + 16) | 0
            h = (g + 8) | 0
            i = g
            j = e >>> 0 > 1073741823 ? -1 : e << 2
            k = _q(j) | 0
            hj(k | 0, 0, j | 0) | 0
            j = f[(a + 28) >> 2] | 0
            l = (a + 36) | 0
            m = f[l >> 2] | 0
            n = f[(m + 4) >> 2] | 0
            o = f[m >> 2] | 0
            p = (n - o) | 0
            a: do
                if ((p | 0) > 4) {
                    q = p >> 2
                    r = f[(a + 32) >> 2] | 0
                    s = (a + 8) | 0
                    t = (h + 4) | 0
                    v = (i + 4) | 0
                    w = (d + 4) | 0
                    x = (j + 64) | 0
                    y = (j + 28) | 0
                    z = (e | 0) > 0
                    A = (k + 4) | 0
                    B = (h + 4) | 0
                    C = (i + 4) | 0
                    D = (d + 4) | 0
                    E = (q + -1) | 0
                    if (((n - o) >> 2) >>> 0 > E >>> 0) {
                        F = q
                        G = E
                        H = o
                    } else {
                        I = m
                        mq(I)
                    }
                    while (1) {
                        E = f[(H + (G << 2)) >> 2] | 0
                        q = X(G, e) | 0
                        if (
                            (
                                ((E | 0) != -1 ? ((f[((f[j >> 2] | 0) + ((E >>> 5) << 2)) >> 2] & (1 << (E & 31))) | 0) == 0 : 0)
                                    ? ((J = f[((f[((f[x >> 2] | 0) + 12) >> 2] | 0) + (E << 2)) >> 2] | 0), (J | 0) != -1)
                                    : 0
                            )
                                ? ((E = f[y >> 2] | 0),
                                  (K = f[r >> 2] | 0),
                                  (L = f[(K + (f[(E + (J << 2)) >> 2] << 2)) >> 2] | 0),
                                  (M = (J + 1) | 0),
                                  (N = f[(K + (f[(E + ((((M >>> 0) % 3 | 0 | 0) == 0 ? (J + -2) | 0 : M) << 2)) >> 2] << 2)) >> 2] | 0),
                                  (M = f[(K + (f[(E + (((((J >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + J) << 2)) >> 2] << 2)) >> 2] | 0),
                                  ((L | 0) < (G | 0)) & ((N | 0) < (G | 0)) & ((M | 0) < (G | 0)))
                                : 0
                        ) {
                            J = X(L, e) | 0
                            L = X(N, e) | 0
                            N = X(M, e) | 0
                            if (z) {
                                M = 0
                                do {
                                    f[(k + (M << 2)) >> 2] = (f[(b + ((M + N) << 2)) >> 2] | 0) + (f[(b + ((M + L) << 2)) >> 2] | 0) - (f[(b + ((M + J) << 2)) >> 2] | 0)
                                    M = (M + 1) | 0
                                } while ((M | 0) != (e | 0))
                            }
                            M = (b + (q << 2)) | 0
                            J = (c + (q << 2)) | 0
                            L = f[(M + 4) >> 2] | 0
                            N = f[k >> 2] | 0
                            E = f[A >> 2] | 0
                            f[h >> 2] = f[M >> 2]
                            f[B >> 2] = L
                            f[i >> 2] = N
                            f[C >> 2] = E
                            Dd(d, s, h, i)
                            f[J >> 2] = f[d >> 2]
                            f[(J + 4) >> 2] = f[D >> 2]
                        } else {
                            J = (b + (q << 2)) | 0
                            E = (b + ((X((F + -2) | 0, e) | 0) << 2)) | 0
                            N = (c + (q << 2)) | 0
                            L = f[(J + 4) >> 2] | 0
                            M = f[E >> 2] | 0
                            K = f[(E + 4) >> 2] | 0
                            f[h >> 2] = f[J >> 2]
                            f[t >> 2] = L
                            f[i >> 2] = M
                            f[v >> 2] = K
                            Dd(d, s, h, i)
                            f[N >> 2] = f[d >> 2]
                            f[(N + 4) >> 2] = f[w >> 2]
                        }
                        if ((F | 0) <= 2) break a
                        N = f[l >> 2] | 0
                        H = f[N >> 2] | 0
                        K = (G + -1) | 0
                        if ((((f[(N + 4) >> 2] | 0) - H) >> 2) >>> 0 <= K >>> 0) {
                            I = N
                            break
                        } else {
                            N = G
                            G = K
                            F = N
                        }
                    }
                    mq(I)
                }
            while (0)
            if ((e | 0) <= 0) {
                O = (a + 8) | 0
                P = (b + 4) | 0
                Q = f[b >> 2] | 0
                R = f[P >> 2] | 0
                S = (k + 4) | 0
                T = f[k >> 2] | 0
                U = f[S >> 2] | 0
                f[h >> 2] = Q
                V = (h + 4) | 0
                f[V >> 2] = R
                f[i >> 2] = T
                W = (i + 4) | 0
                f[W >> 2] = U
                Dd(d, O, h, i)
                Y = f[d >> 2] | 0
                f[c >> 2] = Y
                Z = (d + 4) | 0
                _ = f[Z >> 2] | 0
                $ = (c + 4) | 0
                f[$ >> 2] = _
                $q(k)
                u = g
                return 1
            }
            hj(k | 0, 0, (e << 2) | 0) | 0
            O = (a + 8) | 0
            P = (b + 4) | 0
            Q = f[b >> 2] | 0
            R = f[P >> 2] | 0
            S = (k + 4) | 0
            T = f[k >> 2] | 0
            U = f[S >> 2] | 0
            f[h >> 2] = Q
            V = (h + 4) | 0
            f[V >> 2] = R
            f[i >> 2] = T
            W = (i + 4) | 0
            f[W >> 2] = U
            Dd(d, O, h, i)
            Y = f[d >> 2] | 0
            f[c >> 2] = Y
            Z = (d + 4) | 0
            _ = f[Z >> 2] | 0
            $ = (c + 4) | 0
            f[$ >> 2] = _
            $q(k)
            u = g
            return 1
        }
        function jd(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0
            c = (a + 4) | 0
            if (!b) {
                e = f[a >> 2] | 0
                f[a >> 2] = 0
                if (e | 0) br(e)
                f[c >> 2] = 0
                return
            }
            if (b >>> 0 > 1073741823) {
                e = ra(8) | 0
                Wo(e, 14941)
                f[e >> 2] = 6944
                va(e | 0, 1080, 114)
            }
            e = dn(b << 2) | 0
            g = f[a >> 2] | 0
            f[a >> 2] = e
            if (g | 0) br(g)
            f[c >> 2] = b
            c = 0
            do {
                f[((f[a >> 2] | 0) + (c << 2)) >> 2] = 0
                c = (c + 1) | 0
            } while ((c | 0) != (b | 0))
            c = (a + 8) | 0
            g = f[c >> 2] | 0
            if (!g) return
            e = f[(g + 4) >> 2] | 0
            h = (b + -1) | 0
            i = ((h & b) | 0) == 0
            if (!i)
                if (e >>> 0 < b >>> 0) j = e
                else j = (e >>> 0) % (b >>> 0) | 0
            else j = e & h
            f[((f[a >> 2] | 0) + (j << 2)) >> 2] = c
            c = f[g >> 2] | 0
            if (!c) return
            else {
                k = j
                l = g
                m = c
                n = g
            }
            a: while (1) {
                g = l
                c = m
                j = n
                b: while (1) {
                    c: do
                        if (i) {
                            e = c
                            while (1) {
                                o = f[(e + 4) >> 2] & h
                                if ((o | 0) == (k | 0)) {
                                    p = e
                                    break c
                                }
                                q = ((f[a >> 2] | 0) + (o << 2)) | 0
                                if (!(f[q >> 2] | 0)) {
                                    r = e
                                    s = o
                                    t = q
                                    break b
                                }
                                q = (e + 8) | 0
                                u = (q + 2) | 0
                                v = (e + 12) | 0
                                w = (q + 6) | 0
                                x = f[e >> 2] | 0
                                d: do
                                    if (!x) y = e
                                    else {
                                        z = d[q >> 1] | 0
                                        A = e
                                        B = x
                                        while (1) {
                                            C = (B + 8) | 0
                                            if ((z << 16) >> 16 != (d[C >> 1] | 0)) {
                                                y = A
                                                break d
                                            }
                                            if ((d[u >> 1] | 0) != (d[(C + 2) >> 1] | 0)) {
                                                y = A
                                                break d
                                            }
                                            if ((d[v >> 1] | 0) != (d[(B + 12) >> 1] | 0)) {
                                                y = A
                                                break d
                                            }
                                            if ((d[w >> 1] | 0) != (d[(C + 6) >> 1] | 0)) {
                                                y = A
                                                break d
                                            }
                                            C = f[B >> 2] | 0
                                            if (!C) {
                                                y = B
                                                break
                                            } else {
                                                D = B
                                                B = C
                                                A = D
                                            }
                                        }
                                    }
                                while (0)
                                f[j >> 2] = f[y >> 2]
                                f[y >> 2] = f[f[((f[a >> 2] | 0) + (o << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (o << 2)) >> 2] >> 2] = e
                                e = f[g >> 2] | 0
                                if (!e) {
                                    E = 43
                                    break a
                                }
                            }
                        } else {
                            e = c
                            while (1) {
                                w = f[(e + 4) >> 2] | 0
                                if (w >>> 0 < b >>> 0) F = w
                                else F = (w >>> 0) % (b >>> 0) | 0
                                if ((F | 0) == (k | 0)) {
                                    p = e
                                    break c
                                }
                                w = ((f[a >> 2] | 0) + (F << 2)) | 0
                                if (!(f[w >> 2] | 0)) {
                                    r = e
                                    s = F
                                    t = w
                                    break b
                                }
                                w = (e + 8) | 0
                                v = (w + 2) | 0
                                u = (e + 12) | 0
                                x = (w + 6) | 0
                                q = f[e >> 2] | 0
                                e: do
                                    if (!q) G = e
                                    else {
                                        A = d[w >> 1] | 0
                                        B = e
                                        z = q
                                        while (1) {
                                            D = (z + 8) | 0
                                            if ((A << 16) >> 16 != (d[D >> 1] | 0)) {
                                                G = B
                                                break e
                                            }
                                            if ((d[v >> 1] | 0) != (d[(D + 2) >> 1] | 0)) {
                                                G = B
                                                break e
                                            }
                                            if ((d[u >> 1] | 0) != (d[(z + 12) >> 1] | 0)) {
                                                G = B
                                                break e
                                            }
                                            if ((d[x >> 1] | 0) != (d[(D + 6) >> 1] | 0)) {
                                                G = B
                                                break e
                                            }
                                            D = f[z >> 2] | 0
                                            if (!D) {
                                                G = z
                                                break
                                            } else {
                                                C = z
                                                z = D
                                                B = C
                                            }
                                        }
                                    }
                                while (0)
                                f[j >> 2] = f[G >> 2]
                                f[G >> 2] = f[f[((f[a >> 2] | 0) + (F << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (F << 2)) >> 2] >> 2] = e
                                e = f[g >> 2] | 0
                                if (!e) {
                                    E = 43
                                    break a
                                }
                            }
                        }
                    while (0)
                    c = f[p >> 2] | 0
                    if (!c) {
                        E = 43
                        break a
                    } else {
                        g = p
                        j = p
                    }
                }
                f[t >> 2] = j
                m = f[r >> 2] | 0
                if (!m) {
                    E = 43
                    break
                } else {
                    k = s
                    l = r
                    n = r
                }
            }
            if ((E | 0) == 43) return
        }
        function kd(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0
            d = (a + 4) | 0
            if (!c) {
                e = f[a >> 2] | 0
                f[a >> 2] = 0
                if (e | 0) br(e)
                f[d >> 2] = 0
                return
            }
            if (c >>> 0 > 1073741823) {
                e = ra(8) | 0
                Wo(e, 14941)
                f[e >> 2] = 6944
                va(e | 0, 1080, 114)
            }
            e = dn(c << 2) | 0
            g = f[a >> 2] | 0
            f[a >> 2] = e
            if (g | 0) br(g)
            f[d >> 2] = c
            d = 0
            do {
                f[((f[a >> 2] | 0) + (d << 2)) >> 2] = 0
                d = (d + 1) | 0
            } while ((d | 0) != (c | 0))
            d = (a + 8) | 0
            g = f[d >> 2] | 0
            if (!g) return
            e = f[(g + 4) >> 2] | 0
            h = (c + -1) | 0
            i = ((h & c) | 0) == 0
            if (!i)
                if (e >>> 0 < c >>> 0) j = e
                else j = (e >>> 0) % (c >>> 0) | 0
            else j = e & h
            f[((f[a >> 2] | 0) + (j << 2)) >> 2] = d
            d = f[g >> 2] | 0
            if (!d) return
            else {
                k = j
                l = g
                m = d
                n = g
            }
            a: while (1) {
                g = l
                d = m
                j = n
                b: while (1) {
                    c: do
                        if (i) {
                            e = d
                            while (1) {
                                o = f[(e + 4) >> 2] & h
                                if ((o | 0) == (k | 0)) {
                                    p = e
                                    break c
                                }
                                q = ((f[a >> 2] | 0) + (o << 2)) | 0
                                if (!(f[q >> 2] | 0)) {
                                    r = e
                                    s = o
                                    t = q
                                    break b
                                }
                                q = (e + 8) | 0
                                u = (q + 1) | 0
                                v = (q + 2) | 0
                                w = (q + 3) | 0
                                x = f[e >> 2] | 0
                                d: do
                                    if (!x) y = e
                                    else {
                                        z = b[q >> 0] | 0
                                        A = e
                                        B = x
                                        while (1) {
                                            C = (B + 8) | 0
                                            if ((z << 24) >> 24 != (b[C >> 0] | 0)) {
                                                y = A
                                                break d
                                            }
                                            if ((b[u >> 0] | 0) != (b[(C + 1) >> 0] | 0)) {
                                                y = A
                                                break d
                                            }
                                            if ((b[v >> 0] | 0) != (b[(C + 2) >> 0] | 0)) {
                                                y = A
                                                break d
                                            }
                                            if ((b[w >> 0] | 0) != (b[(C + 3) >> 0] | 0)) {
                                                y = A
                                                break d
                                            }
                                            C = f[B >> 2] | 0
                                            if (!C) {
                                                y = B
                                                break
                                            } else {
                                                D = B
                                                B = C
                                                A = D
                                            }
                                        }
                                    }
                                while (0)
                                f[j >> 2] = f[y >> 2]
                                f[y >> 2] = f[f[((f[a >> 2] | 0) + (o << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (o << 2)) >> 2] >> 2] = e
                                e = f[g >> 2] | 0
                                if (!e) {
                                    E = 43
                                    break a
                                }
                            }
                        } else {
                            e = d
                            while (1) {
                                w = f[(e + 4) >> 2] | 0
                                if (w >>> 0 < c >>> 0) F = w
                                else F = (w >>> 0) % (c >>> 0) | 0
                                if ((F | 0) == (k | 0)) {
                                    p = e
                                    break c
                                }
                                w = ((f[a >> 2] | 0) + (F << 2)) | 0
                                if (!(f[w >> 2] | 0)) {
                                    r = e
                                    s = F
                                    t = w
                                    break b
                                }
                                w = (e + 8) | 0
                                v = (w + 1) | 0
                                u = (w + 2) | 0
                                x = (w + 3) | 0
                                q = f[e >> 2] | 0
                                e: do
                                    if (!q) G = e
                                    else {
                                        A = b[w >> 0] | 0
                                        B = e
                                        z = q
                                        while (1) {
                                            D = (z + 8) | 0
                                            if ((A << 24) >> 24 != (b[D >> 0] | 0)) {
                                                G = B
                                                break e
                                            }
                                            if ((b[v >> 0] | 0) != (b[(D + 1) >> 0] | 0)) {
                                                G = B
                                                break e
                                            }
                                            if ((b[u >> 0] | 0) != (b[(D + 2) >> 0] | 0)) {
                                                G = B
                                                break e
                                            }
                                            if ((b[x >> 0] | 0) != (b[(D + 3) >> 0] | 0)) {
                                                G = B
                                                break e
                                            }
                                            D = f[z >> 2] | 0
                                            if (!D) {
                                                G = z
                                                break
                                            } else {
                                                C = z
                                                z = D
                                                B = C
                                            }
                                        }
                                    }
                                while (0)
                                f[j >> 2] = f[G >> 2]
                                f[G >> 2] = f[f[((f[a >> 2] | 0) + (F << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (F << 2)) >> 2] >> 2] = e
                                e = f[g >> 2] | 0
                                if (!e) {
                                    E = 43
                                    break a
                                }
                            }
                        }
                    while (0)
                    d = f[p >> 2] | 0
                    if (!d) {
                        E = 43
                        break a
                    } else {
                        g = p
                        j = p
                    }
                }
                f[t >> 2] = j
                m = f[r >> 2] | 0
                if (!m) {
                    E = 43
                    break
                } else {
                    k = s
                    l = r
                    n = r
                }
            }
            if ((E | 0) == 43) return
        }
        function ld(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0
            c = (a + 4) | 0
            if (!b) {
                d = f[a >> 2] | 0
                f[a >> 2] = 0
                if (d | 0) br(d)
                f[c >> 2] = 0
                return
            }
            if (b >>> 0 > 1073741823) {
                d = ra(8) | 0
                Wo(d, 14941)
                f[d >> 2] = 6944
                va(d | 0, 1080, 114)
            }
            d = dn(b << 2) | 0
            e = f[a >> 2] | 0
            f[a >> 2] = d
            if (e | 0) br(e)
            f[c >> 2] = b
            c = 0
            do {
                f[((f[a >> 2] | 0) + (c << 2)) >> 2] = 0
                c = (c + 1) | 0
            } while ((c | 0) != (b | 0))
            c = (a + 8) | 0
            e = f[c >> 2] | 0
            if (!e) return
            d = f[(e + 4) >> 2] | 0
            g = (b + -1) | 0
            h = ((g & b) | 0) == 0
            if (!h)
                if (d >>> 0 < b >>> 0) i = d
                else i = (d >>> 0) % (b >>> 0) | 0
            else i = d & g
            f[((f[a >> 2] | 0) + (i << 2)) >> 2] = c
            c = f[e >> 2] | 0
            if (!c) return
            else {
                j = i
                k = e
                l = c
                m = e
            }
            a: while (1) {
                e = k
                c = l
                i = m
                b: while (1) {
                    c: do
                        if (h) {
                            d = c
                            while (1) {
                                n = f[(d + 4) >> 2] & g
                                if ((n | 0) == (j | 0)) {
                                    o = d
                                    break c
                                }
                                p = ((f[a >> 2] | 0) + (n << 2)) | 0
                                if (!(f[p >> 2] | 0)) {
                                    q = d
                                    r = n
                                    s = p
                                    break b
                                }
                                p = (d + 12) | 0
                                t = (d + 16) | 0
                                u = (d + 20) | 0
                                v = f[d >> 2] | 0
                                d: do
                                    if (!v) w = d
                                    else {
                                        x = f[(d + 8) >> 2] | 0
                                        y = d
                                        z = v
                                        while (1) {
                                            if ((x | 0) != (f[(z + 8) >> 2] | 0)) {
                                                w = y
                                                break d
                                            }
                                            if ((f[p >> 2] | 0) != (f[(z + 12) >> 2] | 0)) {
                                                w = y
                                                break d
                                            }
                                            if ((f[t >> 2] | 0) != (f[(z + 16) >> 2] | 0)) {
                                                w = y
                                                break d
                                            }
                                            if ((f[u >> 2] | 0) != (f[(z + 20) >> 2] | 0)) {
                                                w = y
                                                break d
                                            }
                                            A = f[z >> 2] | 0
                                            if (!A) {
                                                w = z
                                                break
                                            } else {
                                                B = z
                                                z = A
                                                y = B
                                            }
                                        }
                                    }
                                while (0)
                                f[i >> 2] = f[w >> 2]
                                f[w >> 2] = f[f[((f[a >> 2] | 0) + (n << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (n << 2)) >> 2] >> 2] = d
                                d = f[e >> 2] | 0
                                if (!d) {
                                    C = 43
                                    break a
                                }
                            }
                        } else {
                            d = c
                            while (1) {
                                u = f[(d + 4) >> 2] | 0
                                if (u >>> 0 < b >>> 0) D = u
                                else D = (u >>> 0) % (b >>> 0) | 0
                                if ((D | 0) == (j | 0)) {
                                    o = d
                                    break c
                                }
                                u = ((f[a >> 2] | 0) + (D << 2)) | 0
                                if (!(f[u >> 2] | 0)) {
                                    q = d
                                    r = D
                                    s = u
                                    break b
                                }
                                u = (d + 12) | 0
                                t = (d + 16) | 0
                                p = (d + 20) | 0
                                v = f[d >> 2] | 0
                                e: do
                                    if (!v) E = d
                                    else {
                                        y = f[(d + 8) >> 2] | 0
                                        z = d
                                        x = v
                                        while (1) {
                                            if ((y | 0) != (f[(x + 8) >> 2] | 0)) {
                                                E = z
                                                break e
                                            }
                                            if ((f[u >> 2] | 0) != (f[(x + 12) >> 2] | 0)) {
                                                E = z
                                                break e
                                            }
                                            if ((f[t >> 2] | 0) != (f[(x + 16) >> 2] | 0)) {
                                                E = z
                                                break e
                                            }
                                            if ((f[p >> 2] | 0) != (f[(x + 20) >> 2] | 0)) {
                                                E = z
                                                break e
                                            }
                                            B = f[x >> 2] | 0
                                            if (!B) {
                                                E = x
                                                break
                                            } else {
                                                A = x
                                                x = B
                                                z = A
                                            }
                                        }
                                    }
                                while (0)
                                f[i >> 2] = f[E >> 2]
                                f[E >> 2] = f[f[((f[a >> 2] | 0) + (D << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (D << 2)) >> 2] >> 2] = d
                                d = f[e >> 2] | 0
                                if (!d) {
                                    C = 43
                                    break a
                                }
                            }
                        }
                    while (0)
                    c = f[o >> 2] | 0
                    if (!c) {
                        C = 43
                        break a
                    } else {
                        e = o
                        i = o
                    }
                }
                f[s >> 2] = i
                l = f[q >> 2] | 0
                if (!l) {
                    C = 43
                    break
                } else {
                    j = r
                    k = q
                    m = q
                }
            }
            if ((C | 0) == 43) return
        }
        function md(a, c, d, e, g) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                J = 0,
                K = 0,
                L = 0,
                M = 0,
                N = 0
            i = u
            u = (u + 352) | 0
            j = (i + 340) | 0
            k = (i + 336) | 0
            l = (i + 80) | 0
            m = (i + 48) | 0
            n = i
            hj(l | 0, 0, 256) | 0
            o = f[(e + 4) >> 2] | 0
            p = f[e >> 2] | 0
            q = p
            if ((o | 0) != (p | 0)) {
                r = (o - p) >> 2
                p = 0
                do {
                    o = (l + (f[(q + (p << 2)) >> 2] << 3)) | 0
                    s = o
                    t = Tn(f[s >> 2] | 0, f[(s + 4) >> 2] | 0, 1, 0) | 0
                    s = o
                    f[s >> 2] = t
                    f[(s + 4) >> 2] = I
                    p = (p + 1) | 0
                } while (p >>> 0 < r >>> 0)
            }
            Cn(m)
            r = Rn(c | 0, ((((c | 0) < 0) << 31) >> 31) | 0, 5) | 0
            p = I
            q = (n + 40) | 0
            s = q
            f[s >> 2] = 0
            f[(s + 4) >> 2] = 0
            s = n
            t = (s + 36) | 0
            do {
                f[s >> 2] = 0
                s = (s + 4) | 0
            } while ((s | 0) < (t | 0))
            $c(n, l, 32, g) | 0
            l = (n + 16) | 0
            s = Rn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1) | 0
            l = (g + 4) | 0
            t = ((f[l >> 2] | 0) - (f[g >> 2] | 0)) | 0
            o = q
            f[o >> 2] = t
            f[(o + 4) >> 2] = 0
            o = Tn(s | 0, I | 0, 39, 0) | 0
            s = Wn(o | 0, I | 0, 3) | 0
            o = Tn(s | 0, I | 0, 8, 0) | 0
            s = Tn(o | 0, I | 0, t | 0, 0) | 0
            vl(g, s, I)
            s = (n + 24) | 0
            f[s >> 2] = (f[g >> 2] | 0) + (f[q >> 2] | 0)
            q = (n + 28) | 0
            f[q >> 2] = 0
            t = (n + 32) | 0
            f[t >> 2] = 16384
            li(m, r, p, 0) | 0
            p = (c - d) | 0
            if ((p | 0) > -1) {
                c = (d | 0) > 0
                r = (m + 16) | 0
                o = (m + 12) | 0
                v = p
                do {
                    w = f[e >> 2] | 0
                    x = f[(w + ((((v | 0) / (d | 0)) | 0) << 2)) >> 2] | 0
                    y = f[n >> 2] | 0
                    z = f[(y + (x << 3)) >> 2] | 0
                    A = f[t >> 2] | 0
                    B = z << 10
                    if (A >>> 0 < B >>> 0) {
                        C = A
                        D = w
                    } else {
                        w = A
                        do {
                            A = f[s >> 2] | 0
                            E = f[q >> 2] | 0
                            f[q >> 2] = E + 1
                            b[(A + E) >> 0] = w
                            w = (f[t >> 2] | 0) >>> 8
                            f[t >> 2] = w
                        } while (w >>> 0 >= B >>> 0)
                        C = w
                        D = f[e >> 2] | 0
                    }
                    f[t >> 2] = ((((C >>> 0) / (z >>> 0)) | 0) << 12) + ((C >>> 0) % (z >>> 0) | 0) + (f[(y + (x << 3) + 4) >> 2] | 0)
                    B = (p - v) | 0
                    E = f[(D + ((((B | 0) / (d | 0)) | 0) << 2)) >> 2] | 0
                    if (c & ((E | 0) > 0)) {
                        A = 0
                        do {
                            F = f[(a + ((A + B) << 2)) >> 2] | 0
                            G = r
                            H = f[(G + 4) >> 2] | 0
                            if (((H | 0) > 0) | (((H | 0) == 0) & ((f[G >> 2] | 0) >>> 0 > 0))) {
                                G = f[o >> 2] | 0
                                H = (G + 4) | 0
                                J = 0
                                K = f[H >> 2] | 0
                                do {
                                    L = K >>> 3
                                    M = K & 7
                                    N = ((f[G >> 2] | 0) + L) | 0
                                    b[N >> 0] = ((1 << M) ^ 255) & (h[N >> 0] | 0)
                                    N = ((f[G >> 2] | 0) + L) | 0
                                    b[N >> 0] = (((F >>> J) & 1) << M) | (h[N >> 0] | 0)
                                    K = ((f[H >> 2] | 0) + 1) | 0
                                    f[H >> 2] = K
                                    J = (J + 1) | 0
                                } while ((J | 0) != (E | 0))
                            }
                            A = (A + 1) | 0
                        } while ((A | 0) != (d | 0))
                    }
                    v = (v - d) | 0
                } while ((v | 0) > -1)
            }
            Lf(n, g)
            Qf(m)
            v = f[m >> 2] | 0
            d = (m + 4) | 0
            o = (g + 16) | 0
            r = f[(o + 4) >> 2] | 0
            if (!(((r | 0) > 0) | (((r | 0) == 0) & ((f[o >> 2] | 0) >>> 0 > 0)))) {
                o = ((f[d >> 2] | 0) - v) | 0
                f[k >> 2] = f[l >> 2]
                f[j >> 2] = f[k >> 2]
                ye(g, j, v, (v + o) | 0) | 0
            }
            o = f[n >> 2] | 0
            if (o | 0) {
                v = (n + 4) | 0
                n = f[v >> 2] | 0
                if ((n | 0) != (o | 0)) f[v >> 2] = n + (~(((n + -8 - o) | 0) >>> 3) << 3)
                br(o)
            }
            o = (m + 12) | 0
            n = f[o >> 2] | 0
            f[o >> 2] = 0
            if (n | 0) br(n)
            n = f[m >> 2] | 0
            if (!n) {
                u = i
                return 1
            }
            if ((f[d >> 2] | 0) != (n | 0)) f[d >> 2] = n
            br(n)
            u = i
            return 1
        }
        function nd(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0
            c = (a + 4) | 0
            if (!b) {
                e = f[a >> 2] | 0
                f[a >> 2] = 0
                if (e | 0) br(e)
                f[c >> 2] = 0
                return
            }
            if (b >>> 0 > 1073741823) {
                e = ra(8) | 0
                Wo(e, 14941)
                f[e >> 2] = 6944
                va(e | 0, 1080, 114)
            }
            e = dn(b << 2) | 0
            g = f[a >> 2] | 0
            f[a >> 2] = e
            if (g | 0) br(g)
            f[c >> 2] = b
            c = 0
            do {
                f[((f[a >> 2] | 0) + (c << 2)) >> 2] = 0
                c = (c + 1) | 0
            } while ((c | 0) != (b | 0))
            c = (a + 8) | 0
            g = f[c >> 2] | 0
            if (!g) return
            e = f[(g + 4) >> 2] | 0
            h = (b + -1) | 0
            i = ((h & b) | 0) == 0
            if (!i)
                if (e >>> 0 < b >>> 0) j = e
                else j = (e >>> 0) % (b >>> 0) | 0
            else j = e & h
            f[((f[a >> 2] | 0) + (j << 2)) >> 2] = c
            c = f[g >> 2] | 0
            if (!c) return
            else {
                k = j
                l = g
                m = c
                n = g
            }
            a: while (1) {
                g = l
                c = m
                j = n
                b: while (1) {
                    c: do
                        if (i) {
                            e = c
                            while (1) {
                                o = f[(e + 4) >> 2] & h
                                if ((o | 0) == (k | 0)) {
                                    p = e
                                    break c
                                }
                                q = ((f[a >> 2] | 0) + (o << 2)) | 0
                                if (!(f[q >> 2] | 0)) {
                                    r = e
                                    s = o
                                    t = q
                                    break b
                                }
                                q = (e + 8) | 0
                                u = (e + 12) | 0
                                v = f[e >> 2] | 0
                                d: do
                                    if (!v) w = e
                                    else {
                                        x = d[q >> 1] | 0
                                        y = (q + 2) | 0
                                        z = e
                                        A = v
                                        while (1) {
                                            B = (A + 8) | 0
                                            if ((x << 16) >> 16 != (d[B >> 1] | 0)) {
                                                w = z
                                                break d
                                            }
                                            if ((d[y >> 1] | 0) != (d[(B + 2) >> 1] | 0)) {
                                                w = z
                                                break d
                                            }
                                            if ((d[u >> 1] | 0) != (d[(A + 12) >> 1] | 0)) {
                                                w = z
                                                break d
                                            }
                                            B = f[A >> 2] | 0
                                            if (!B) {
                                                w = A
                                                break
                                            } else {
                                                C = A
                                                A = B
                                                z = C
                                            }
                                        }
                                    }
                                while (0)
                                f[j >> 2] = f[w >> 2]
                                f[w >> 2] = f[f[((f[a >> 2] | 0) + (o << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (o << 2)) >> 2] >> 2] = e
                                e = f[g >> 2] | 0
                                if (!e) {
                                    D = 41
                                    break a
                                }
                            }
                        } else {
                            e = c
                            while (1) {
                                u = f[(e + 4) >> 2] | 0
                                if (u >>> 0 < b >>> 0) E = u
                                else E = (u >>> 0) % (b >>> 0) | 0
                                if ((E | 0) == (k | 0)) {
                                    p = e
                                    break c
                                }
                                u = ((f[a >> 2] | 0) + (E << 2)) | 0
                                if (!(f[u >> 2] | 0)) {
                                    r = e
                                    s = E
                                    t = u
                                    break b
                                }
                                u = (e + 8) | 0
                                v = (e + 12) | 0
                                q = f[e >> 2] | 0
                                e: do
                                    if (!q) F = e
                                    else {
                                        z = d[u >> 1] | 0
                                        A = (u + 2) | 0
                                        y = e
                                        x = q
                                        while (1) {
                                            C = (x + 8) | 0
                                            if ((z << 16) >> 16 != (d[C >> 1] | 0)) {
                                                F = y
                                                break e
                                            }
                                            if ((d[A >> 1] | 0) != (d[(C + 2) >> 1] | 0)) {
                                                F = y
                                                break e
                                            }
                                            if ((d[v >> 1] | 0) != (d[(x + 12) >> 1] | 0)) {
                                                F = y
                                                break e
                                            }
                                            C = f[x >> 2] | 0
                                            if (!C) {
                                                F = x
                                                break
                                            } else {
                                                B = x
                                                x = C
                                                y = B
                                            }
                                        }
                                    }
                                while (0)
                                f[j >> 2] = f[F >> 2]
                                f[F >> 2] = f[f[((f[a >> 2] | 0) + (E << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (E << 2)) >> 2] >> 2] = e
                                e = f[g >> 2] | 0
                                if (!e) {
                                    D = 41
                                    break a
                                }
                            }
                        }
                    while (0)
                    c = f[p >> 2] | 0
                    if (!c) {
                        D = 41
                        break a
                    } else {
                        g = p
                        j = p
                    }
                }
                f[t >> 2] = j
                m = f[r >> 2] | 0
                if (!m) {
                    D = 41
                    break
                } else {
                    k = s
                    l = r
                    n = r
                }
            }
            if ((D | 0) == 41) return
        }
        function od(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0
            d = (a + 4) | 0
            if (!c) {
                e = f[a >> 2] | 0
                f[a >> 2] = 0
                if (e | 0) br(e)
                f[d >> 2] = 0
                return
            }
            if (c >>> 0 > 1073741823) {
                e = ra(8) | 0
                Wo(e, 14941)
                f[e >> 2] = 6944
                va(e | 0, 1080, 114)
            }
            e = dn(c << 2) | 0
            g = f[a >> 2] | 0
            f[a >> 2] = e
            if (g | 0) br(g)
            f[d >> 2] = c
            d = 0
            do {
                f[((f[a >> 2] | 0) + (d << 2)) >> 2] = 0
                d = (d + 1) | 0
            } while ((d | 0) != (c | 0))
            d = (a + 8) | 0
            g = f[d >> 2] | 0
            if (!g) return
            e = f[(g + 4) >> 2] | 0
            h = (c + -1) | 0
            i = ((h & c) | 0) == 0
            if (!i)
                if (e >>> 0 < c >>> 0) j = e
                else j = (e >>> 0) % (c >>> 0) | 0
            else j = e & h
            f[((f[a >> 2] | 0) + (j << 2)) >> 2] = d
            d = f[g >> 2] | 0
            if (!d) return
            else {
                k = j
                l = g
                m = d
                n = g
            }
            a: while (1) {
                g = l
                d = m
                j = n
                b: while (1) {
                    c: do
                        if (i) {
                            e = d
                            while (1) {
                                o = f[(e + 4) >> 2] & h
                                if ((o | 0) == (k | 0)) {
                                    p = e
                                    break c
                                }
                                q = ((f[a >> 2] | 0) + (o << 2)) | 0
                                if (!(f[q >> 2] | 0)) {
                                    r = e
                                    s = o
                                    t = q
                                    break b
                                }
                                q = (e + 8) | 0
                                u = (q + 1) | 0
                                v = (q + 2) | 0
                                w = f[e >> 2] | 0
                                d: do
                                    if (!w) x = e
                                    else {
                                        y = b[q >> 0] | 0
                                        z = e
                                        A = w
                                        while (1) {
                                            B = (A + 8) | 0
                                            if ((y << 24) >> 24 != (b[B >> 0] | 0)) {
                                                x = z
                                                break d
                                            }
                                            if ((b[u >> 0] | 0) != (b[(B + 1) >> 0] | 0)) {
                                                x = z
                                                break d
                                            }
                                            if ((b[v >> 0] | 0) != (b[(B + 2) >> 0] | 0)) {
                                                x = z
                                                break d
                                            }
                                            B = f[A >> 2] | 0
                                            if (!B) {
                                                x = A
                                                break
                                            } else {
                                                C = A
                                                A = B
                                                z = C
                                            }
                                        }
                                    }
                                while (0)
                                f[j >> 2] = f[x >> 2]
                                f[x >> 2] = f[f[((f[a >> 2] | 0) + (o << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (o << 2)) >> 2] >> 2] = e
                                e = f[g >> 2] | 0
                                if (!e) {
                                    D = 41
                                    break a
                                }
                            }
                        } else {
                            e = d
                            while (1) {
                                v = f[(e + 4) >> 2] | 0
                                if (v >>> 0 < c >>> 0) E = v
                                else E = (v >>> 0) % (c >>> 0) | 0
                                if ((E | 0) == (k | 0)) {
                                    p = e
                                    break c
                                }
                                v = ((f[a >> 2] | 0) + (E << 2)) | 0
                                if (!(f[v >> 2] | 0)) {
                                    r = e
                                    s = E
                                    t = v
                                    break b
                                }
                                v = (e + 8) | 0
                                u = (v + 1) | 0
                                w = (v + 2) | 0
                                q = f[e >> 2] | 0
                                e: do
                                    if (!q) F = e
                                    else {
                                        z = b[v >> 0] | 0
                                        A = e
                                        y = q
                                        while (1) {
                                            C = (y + 8) | 0
                                            if ((z << 24) >> 24 != (b[C >> 0] | 0)) {
                                                F = A
                                                break e
                                            }
                                            if ((b[u >> 0] | 0) != (b[(C + 1) >> 0] | 0)) {
                                                F = A
                                                break e
                                            }
                                            if ((b[w >> 0] | 0) != (b[(C + 2) >> 0] | 0)) {
                                                F = A
                                                break e
                                            }
                                            C = f[y >> 2] | 0
                                            if (!C) {
                                                F = y
                                                break
                                            } else {
                                                B = y
                                                y = C
                                                A = B
                                            }
                                        }
                                    }
                                while (0)
                                f[j >> 2] = f[F >> 2]
                                f[F >> 2] = f[f[((f[a >> 2] | 0) + (E << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (E << 2)) >> 2] >> 2] = e
                                e = f[g >> 2] | 0
                                if (!e) {
                                    D = 41
                                    break a
                                }
                            }
                        }
                    while (0)
                    d = f[p >> 2] | 0
                    if (!d) {
                        D = 41
                        break a
                    } else {
                        g = p
                        j = p
                    }
                }
                f[t >> 2] = j
                m = f[r >> 2] | 0
                if (!m) {
                    D = 41
                    break
                } else {
                    k = s
                    l = r
                    n = r
                }
            }
            if ((D | 0) == 41) return
        }
        function pd(a, b) {
            a = +a
            b = +b
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                q = 0,
                r = 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,
                F = 0,
                G = 0,
                H = 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.0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0.0
            p[s >> 3] = a
            c = f[s >> 2] | 0
            d = f[(s + 4) >> 2] | 0
            p[s >> 3] = b
            e = f[s >> 2] | 0
            g = f[(s + 4) >> 2] | 0
            h = Wn(c | 0, d | 0, 52) | 0
            i = h & 2047
            h = Wn(e | 0, g | 0, 52) | 0
            j = h & 2047
            h = d & -2147483648
            k = Rn(e | 0, g | 0, 1) | 0
            l = I
            a: do
                if (!(((k | 0) == 0) & ((l | 0) == 0)) ? ((m = xo(b) | 0), (n = I & 2147483647), !(((i | 0) == 2047) | ((n >>> 0 > 2146435072) | (((n | 0) == 2146435072) & (m >>> 0 > 0))))) : 0) {
                    m = Rn(c | 0, d | 0, 1) | 0
                    n = I
                    if (!((n >>> 0 > l >>> 0) | (((n | 0) == (l | 0)) & (m >>> 0 > k >>> 0)))) return +(((m | 0) == (k | 0)) & ((n | 0) == (l | 0)) ? a * 0.0 : a)
                    if (!i) {
                        n = Rn(c | 0, d | 0, 12) | 0
                        m = I
                        if (((m | 0) > -1) | (((m | 0) == -1) & (n >>> 0 > 4294967295))) {
                            o = 0
                            q = n
                            n = m
                            while (1) {
                                m = (o + -1) | 0
                                q = Rn(q | 0, n | 0, 1) | 0
                                n = I
                                if (!(((n | 0) > -1) | (((n | 0) == -1) & (q >>> 0 > 4294967295)))) {
                                    r = m
                                    break
                                } else o = m
                            }
                        } else r = 0
                        o = Rn(c | 0, d | 0, (1 - r) | 0) | 0
                        t = r
                        u = o
                        v = I
                    } else {
                        t = i
                        u = c
                        v = (d & 1048575) | 1048576
                    }
                    if (!j) {
                        o = Rn(e | 0, g | 0, 12) | 0
                        q = I
                        if (((q | 0) > -1) | (((q | 0) == -1) & (o >>> 0 > 4294967295))) {
                            n = 0
                            m = o
                            o = q
                            while (1) {
                                q = (n + -1) | 0
                                m = Rn(m | 0, o | 0, 1) | 0
                                o = I
                                if (!(((o | 0) > -1) | (((o | 0) == -1) & (m >>> 0 > 4294967295)))) {
                                    w = q
                                    break
                                } else n = q
                            }
                        } else w = 0
                        n = Rn(e | 0, g | 0, (1 - w) | 0) | 0
                        x = w
                        y = n
                        z = I
                    } else {
                        x = j
                        y = e
                        z = (g & 1048575) | 1048576
                    }
                    n = Vn(u | 0, v | 0, y | 0, z | 0) | 0
                    m = I
                    o = ((m | 0) > -1) | (((m | 0) == -1) & (n >>> 0 > 4294967295))
                    b: do
                        if ((t | 0) > (x | 0)) {
                            q = t
                            A = m
                            B = o
                            C = u
                            D = v
                            E = n
                            while (1) {
                                if (B)
                                    if (((E | 0) == 0) & ((A | 0) == 0)) break
                                    else {
                                        F = E
                                        G = A
                                    }
                                else {
                                    F = C
                                    G = D
                                }
                                H = Rn(F | 0, G | 0, 1) | 0
                                J = I
                                K = (q + -1) | 0
                                L = Vn(H | 0, J | 0, y | 0, z | 0) | 0
                                M = I
                                N = ((M | 0) > -1) | (((M | 0) == -1) & (L >>> 0 > 4294967295))
                                if ((K | 0) > (x | 0)) {
                                    q = K
                                    A = M
                                    B = N
                                    C = H
                                    D = J
                                    E = L
                                } else {
                                    O = K
                                    P = N
                                    Q = L
                                    R = M
                                    S = H
                                    T = J
                                    break b
                                }
                            }
                            U = a * 0.0
                            break a
                        } else {
                            O = t
                            P = o
                            Q = n
                            R = m
                            S = u
                            T = v
                        }
                    while (0)
                    if (P)
                        if (((Q | 0) == 0) & ((R | 0) == 0)) {
                            U = a * 0.0
                            break
                        } else {
                            V = R
                            W = Q
                        }
                    else {
                        V = T
                        W = S
                    }
                    if ((V >>> 0 < 1048576) | (((V | 0) == 1048576) & (W >>> 0 < 0))) {
                        m = O
                        n = W
                        o = V
                        while (1) {
                            E = Rn(n | 0, o | 0, 1) | 0
                            D = I
                            C = (m + -1) | 0
                            if ((D >>> 0 < 1048576) | (((D | 0) == 1048576) & (E >>> 0 < 0))) {
                                m = C
                                n = E
                                o = D
                            } else {
                                X = C
                                Y = E
                                Z = D
                                break
                            }
                        }
                    } else {
                        X = O
                        Y = W
                        Z = V
                    }
                    if ((X | 0) > 0) {
                        o = Tn(Y | 0, Z | 0, 0, -1048576) | 0
                        n = I
                        m = Rn(X | 0, 0, 52) | 0
                        _ = n | I
                        $ = o | m
                    } else {
                        m = Wn(Y | 0, Z | 0, (1 - X) | 0) | 0
                        _ = I
                        $ = m
                    }
                    f[s >> 2] = $
                    f[(s + 4) >> 2] = _ | h
                    U = +p[s >> 3]
                } else aa = 3
            while (0)
            if ((aa | 0) == 3) {
                ba = a * b
                U = ba / ba
            }
            return +U
        }
        function qd(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0
            c = (a + 4) | 0
            if (!b) {
                d = f[a >> 2] | 0
                f[a >> 2] = 0
                if (d | 0) br(d)
                f[c >> 2] = 0
                return
            }
            if (b >>> 0 > 1073741823) {
                d = ra(8) | 0
                Wo(d, 14941)
                f[d >> 2] = 6944
                va(d | 0, 1080, 114)
            }
            d = dn(b << 2) | 0
            e = f[a >> 2] | 0
            f[a >> 2] = d
            if (e | 0) br(e)
            f[c >> 2] = b
            c = 0
            do {
                f[((f[a >> 2] | 0) + (c << 2)) >> 2] = 0
                c = (c + 1) | 0
            } while ((c | 0) != (b | 0))
            c = (a + 8) | 0
            e = f[c >> 2] | 0
            if (!e) return
            d = f[(e + 4) >> 2] | 0
            g = (b + -1) | 0
            h = ((g & b) | 0) == 0
            if (!h)
                if (d >>> 0 < b >>> 0) i = d
                else i = (d >>> 0) % (b >>> 0) | 0
            else i = d & g
            f[((f[a >> 2] | 0) + (i << 2)) >> 2] = c
            c = f[e >> 2] | 0
            if (!c) return
            else {
                j = i
                k = e
                l = c
                m = e
            }
            a: while (1) {
                e = k
                c = l
                i = m
                b: while (1) {
                    c: do
                        if (h) {
                            d = c
                            while (1) {
                                n = f[(d + 4) >> 2] & g
                                if ((n | 0) == (j | 0)) {
                                    o = d
                                    break c
                                }
                                p = ((f[a >> 2] | 0) + (n << 2)) | 0
                                if (!(f[p >> 2] | 0)) {
                                    q = d
                                    r = n
                                    s = p
                                    break b
                                }
                                p = (d + 12) | 0
                                t = (d + 16) | 0
                                u = f[d >> 2] | 0
                                d: do
                                    if (!u) v = d
                                    else {
                                        w = f[(d + 8) >> 2] | 0
                                        x = d
                                        y = u
                                        while (1) {
                                            if ((w | 0) != (f[(y + 8) >> 2] | 0)) {
                                                v = x
                                                break d
                                            }
                                            if ((f[p >> 2] | 0) != (f[(y + 12) >> 2] | 0)) {
                                                v = x
                                                break d
                                            }
                                            if ((f[t >> 2] | 0) != (f[(y + 16) >> 2] | 0)) {
                                                v = x
                                                break d
                                            }
                                            z = f[y >> 2] | 0
                                            if (!z) {
                                                v = y
                                                break
                                            } else {
                                                A = y
                                                y = z
                                                x = A
                                            }
                                        }
                                    }
                                while (0)
                                f[i >> 2] = f[v >> 2]
                                f[v >> 2] = f[f[((f[a >> 2] | 0) + (n << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (n << 2)) >> 2] >> 2] = d
                                d = f[e >> 2] | 0
                                if (!d) {
                                    B = 41
                                    break a
                                }
                            }
                        } else {
                            d = c
                            while (1) {
                                t = f[(d + 4) >> 2] | 0
                                if (t >>> 0 < b >>> 0) C = t
                                else C = (t >>> 0) % (b >>> 0) | 0
                                if ((C | 0) == (j | 0)) {
                                    o = d
                                    break c
                                }
                                t = ((f[a >> 2] | 0) + (C << 2)) | 0
                                if (!(f[t >> 2] | 0)) {
                                    q = d
                                    r = C
                                    s = t
                                    break b
                                }
                                t = (d + 12) | 0
                                p = (d + 16) | 0
                                u = f[d >> 2] | 0
                                e: do
                                    if (!u) D = d
                                    else {
                                        x = f[(d + 8) >> 2] | 0
                                        y = d
                                        w = u
                                        while (1) {
                                            if ((x | 0) != (f[(w + 8) >> 2] | 0)) {
                                                D = y
                                                break e
                                            }
                                            if ((f[t >> 2] | 0) != (f[(w + 12) >> 2] | 0)) {
                                                D = y
                                                break e
                                            }
                                            if ((f[p >> 2] | 0) != (f[(w + 16) >> 2] | 0)) {
                                                D = y
                                                break e
                                            }
                                            A = f[w >> 2] | 0
                                            if (!A) {
                                                D = w
                                                break
                                            } else {
                                                z = w
                                                w = A
                                                y = z
                                            }
                                        }
                                    }
                                while (0)
                                f[i >> 2] = f[D >> 2]
                                f[D >> 2] = f[f[((f[a >> 2] | 0) + (C << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (C << 2)) >> 2] >> 2] = d
                                d = f[e >> 2] | 0
                                if (!d) {
                                    B = 41
                                    break a
                                }
                            }
                        }
                    while (0)
                    c = f[o >> 2] | 0
                    if (!c) {
                        B = 41
                        break a
                    } else {
                        e = o
                        i = o
                    }
                }
                f[s >> 2] = i
                l = f[q >> 2] | 0
                if (!l) {
                    B = 41
                    break
                } else {
                    j = r
                    k = q
                    m = q
                }
            }
            if ((B | 0) == 41) return
        }
        function rd(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0
            d = (a + 4) | 0
            if (!c) {
                e = f[a >> 2] | 0
                f[a >> 2] = 0
                if (e | 0) br(e)
                f[d >> 2] = 0
                return
            }
            if (c >>> 0 > 1073741823) {
                e = ra(8) | 0
                Wo(e, 14941)
                f[e >> 2] = 6944
                va(e | 0, 1080, 114)
            }
            e = dn(c << 2) | 0
            g = f[a >> 2] | 0
            f[a >> 2] = e
            if (g | 0) br(g)
            f[d >> 2] = c
            d = 0
            do {
                f[((f[a >> 2] | 0) + (d << 2)) >> 2] = 0
                d = (d + 1) | 0
            } while ((d | 0) != (c | 0))
            d = (a + 8) | 0
            g = f[d >> 2] | 0
            if (!g) return
            e = f[(g + 4) >> 2] | 0
            h = (c + -1) | 0
            i = ((h & c) | 0) == 0
            if (!i)
                if (e >>> 0 < c >>> 0) j = e
                else j = (e >>> 0) % (c >>> 0) | 0
            else j = e & h
            f[((f[a >> 2] | 0) + (j << 2)) >> 2] = d
            d = f[g >> 2] | 0
            if (!d) return
            else {
                k = j
                l = g
                m = d
                n = g
            }
            a: while (1) {
                g = l
                d = m
                j = n
                b: while (1) {
                    o = d
                    while (1) {
                        e = f[(o + 4) >> 2] | 0
                        if (!i)
                            if (e >>> 0 < c >>> 0) p = e
                            else p = (e >>> 0) % (c >>> 0) | 0
                        else p = e & h
                        if ((p | 0) == (k | 0)) break
                        q = ((f[a >> 2] | 0) + (p << 2)) | 0
                        if (!(f[q >> 2] | 0)) break b
                        e = f[o >> 2] | 0
                        c: do
                            if (!e) r = o
                            else {
                                s = (o + 8) | 0
                                t = b[(s + 11) >> 0] | 0
                                u = (t << 24) >> 24 < 0
                                v = t & 255
                                t = u ? f[(o + 12) >> 2] | 0 : v
                                w = (t | 0) == 0
                                if (u) {
                                    u = o
                                    x = e
                                    while (1) {
                                        y = (x + 8) | 0
                                        z = b[(y + 11) >> 0] | 0
                                        A = (z << 24) >> 24 < 0
                                        if ((t | 0) != ((A ? f[(x + 12) >> 2] | 0 : z & 255) | 0)) {
                                            r = u
                                            break c
                                        }
                                        if (!w ? Pk(f[s >> 2] | 0, A ? f[y >> 2] | 0 : y, t) | 0 : 0) {
                                            r = u
                                            break c
                                        }
                                        y = f[x >> 2] | 0
                                        if (!y) {
                                            r = x
                                            break c
                                        } else {
                                            A = x
                                            x = y
                                            u = A
                                        }
                                    }
                                }
                                if (w) {
                                    u = o
                                    x = e
                                    while (1) {
                                        A = b[(x + 8 + 11) >> 0] | 0
                                        if (((A << 24) >> 24 < 0 ? f[(x + 12) >> 2] | 0 : A & 255) | 0) {
                                            r = u
                                            break c
                                        }
                                        A = f[x >> 2] | 0
                                        if (!A) {
                                            r = x
                                            break c
                                        } else {
                                            y = x
                                            x = A
                                            u = y
                                        }
                                    }
                                }
                                u = o
                                x = e
                                while (1) {
                                    w = (x + 8) | 0
                                    y = b[(w + 11) >> 0] | 0
                                    A = (y << 24) >> 24 < 0
                                    if ((t | 0) != ((A ? f[(x + 12) >> 2] | 0 : y & 255) | 0)) {
                                        r = u
                                        break c
                                    }
                                    y = A ? f[w >> 2] | 0 : w
                                    if ((b[y >> 0] | 0) == ((f[s >> 2] & 255) << 24) >> 24) {
                                        B = s
                                        C = v
                                        D = y
                                    } else {
                                        r = u
                                        break c
                                    }
                                    while (1) {
                                        C = (C + -1) | 0
                                        B = (B + 1) | 0
                                        if (!C) break
                                        D = (D + 1) | 0
                                        if ((b[B >> 0] | 0) != (b[D >> 0] | 0)) {
                                            r = u
                                            break c
                                        }
                                    }
                                    y = f[x >> 2] | 0
                                    if (!y) {
                                        r = x
                                        break
                                    } else {
                                        w = x
                                        x = y
                                        u = w
                                    }
                                }
                            }
                        while (0)
                        f[j >> 2] = f[r >> 2]
                        f[r >> 2] = f[f[((f[a >> 2] | 0) + (p << 2)) >> 2] >> 2]
                        f[f[((f[a >> 2] | 0) + (p << 2)) >> 2] >> 2] = o
                        e = f[g >> 2] | 0
                        if (!e) {
                            E = 43
                            break a
                        } else o = e
                    }
                    d = f[o >> 2] | 0
                    if (!d) {
                        E = 43
                        break a
                    } else {
                        g = o
                        j = o
                    }
                }
                f[q >> 2] = j
                m = f[o >> 2] | 0
                if (!m) {
                    E = 43
                    break
                } else {
                    k = p
                    l = o
                    n = o
                }
            }
            if ((E | 0) == 43) return
        }
        function sd(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            c = u
            u = (u + 48) | 0
            d = (c + 8) | 0
            e = (c + 4) | 0
            g = c
            h = (a + 44) | 0
            Nh(f[h >> 2] | 0, b) | 0
            if (f[h >> 2] | 0) {
                rn(d)
                lk(d)
                i = f[h >> 2] | 0
                if ((i | 0) > 0) {
                    h = (a + 40) | 0
                    j = i
                    do {
                        i = j
                        j = (j + -1) | 0
                        Vi(d, ((f[((f[h >> 2] | 0) + ((j >>> 5) << 2)) >> 2] & (1 << (j & 31))) | 0) != 0)
                    } while ((i | 0) > 1)
                }
                fd(d, b)
                tj(d)
            }
            j = (a + 56) | 0
            Nh(f[j >> 2] | 0, b) | 0
            if (f[j >> 2] | 0) {
                rn(d)
                lk(d)
                h = f[j >> 2] | 0
                if ((h | 0) > 1) {
                    j = (a + 52) | 0
                    i = h
                    do {
                        h = i
                        i = (i + -2) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((i >>> 5) << 2)) >> 2] & (1 << (i & 31))) | 0) != 0)
                        k = (h + -1) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((k >>> 5) << 2)) >> 2] & (1 << (k & 31))) | 0) != 0)
                    } while ((h | 0) > 3)
                }
                fd(d, b)
                tj(d)
            }
            j = (a + 68) | 0
            Nh(f[j >> 2] | 0, b) | 0
            if (f[j >> 2] | 0) {
                rn(d)
                lk(d)
                i = f[j >> 2] | 0
                if ((i | 0) > 2) {
                    j = (a + 64) | 0
                    h = i
                    do {
                        i = h
                        h = (h + -3) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((h >>> 5) << 2)) >> 2] & (1 << (h & 31))) | 0) != 0)
                        k = (i + -2) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((k >>> 5) << 2)) >> 2] & (1 << (k & 31))) | 0) != 0)
                        k = (i + -1) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((k >>> 5) << 2)) >> 2] & (1 << (k & 31))) | 0) != 0)
                    } while ((i | 0) > 5)
                }
                fd(d, b)
                tj(d)
            }
            j = (a + 80) | 0
            Nh(f[j >> 2] | 0, b) | 0
            if (f[j >> 2] | 0) {
                rn(d)
                lk(d)
                h = f[j >> 2] | 0
                if ((h | 0) > 3) {
                    j = (a + 76) | 0
                    i = h
                    do {
                        h = i
                        i = (i + -4) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((i >>> 5) << 2)) >> 2] & (1 << (i & 31))) | 0) != 0)
                        k = (h + -3) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((k >>> 5) << 2)) >> 2] & (1 << (k & 31))) | 0) != 0)
                        k = (h + -2) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((k >>> 5) << 2)) >> 2] & (1 << (k & 31))) | 0) != 0)
                        k = (h + -1) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((k >>> 5) << 2)) >> 2] & (1 << (k & 31))) | 0) != 0)
                    } while ((h | 0) > 7)
                }
                fd(d, b)
                tj(d)
            }
            f[g >> 2] = f[(a + 12) >> 2]
            j = (b + 16) | 0
            i = j
            h = f[i >> 2] | 0
            k = f[(i + 4) >> 2] | 0
            if (((k | 0) > 0) | (((k | 0) == 0) & (h >>> 0 > 0))) {
                l = k
                m = h
            } else {
                f[e >> 2] = f[(b + 4) >> 2]
                f[d >> 2] = f[e >> 2]
                ye(b, d, g, (g + 4) | 0) | 0
                h = j
                l = f[(h + 4) >> 2] | 0
                m = f[h >> 2] | 0
            }
            f[g >> 2] = f[(a + 20) >> 2]
            if (((l | 0) > 0) | (((l | 0) == 0) & (m >>> 0 > 0))) {
                u = c
                return 1
            }
            f[e >> 2] = f[(b + 4) >> 2]
            f[d >> 2] = f[e >> 2]
            ye(b, d, g, (g + 4) | 0) | 0
            u = c
            return 1
        }
        function td(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            c = u
            u = (u + 48) | 0
            d = (c + 8) | 0
            e = (c + 4) | 0
            g = c
            h = (a + 64) | 0
            Nh(f[h >> 2] | 0, b) | 0
            if (f[h >> 2] | 0) {
                rn(d)
                lk(d)
                i = f[h >> 2] | 0
                if ((i | 0) > 0) {
                    h = (a + 60) | 0
                    j = i
                    do {
                        i = j
                        j = (j + -1) | 0
                        Vi(d, ((f[((f[h >> 2] | 0) + ((j >>> 5) << 2)) >> 2] & (1 << (j & 31))) | 0) != 0)
                    } while ((i | 0) > 1)
                }
                fd(d, b)
                tj(d)
            }
            j = (a + 76) | 0
            Nh(f[j >> 2] | 0, b) | 0
            if (f[j >> 2] | 0) {
                rn(d)
                lk(d)
                h = f[j >> 2] | 0
                if ((h | 0) > 1) {
                    j = (a + 72) | 0
                    i = h
                    do {
                        h = i
                        i = (i + -2) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((i >>> 5) << 2)) >> 2] & (1 << (i & 31))) | 0) != 0)
                        k = (h + -1) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((k >>> 5) << 2)) >> 2] & (1 << (k & 31))) | 0) != 0)
                    } while ((h | 0) > 3)
                }
                fd(d, b)
                tj(d)
            }
            j = (a + 88) | 0
            Nh(f[j >> 2] | 0, b) | 0
            if (f[j >> 2] | 0) {
                rn(d)
                lk(d)
                i = f[j >> 2] | 0
                if ((i | 0) > 2) {
                    j = (a + 84) | 0
                    h = i
                    do {
                        i = h
                        h = (h + -3) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((h >>> 5) << 2)) >> 2] & (1 << (h & 31))) | 0) != 0)
                        k = (i + -2) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((k >>> 5) << 2)) >> 2] & (1 << (k & 31))) | 0) != 0)
                        k = (i + -1) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((k >>> 5) << 2)) >> 2] & (1 << (k & 31))) | 0) != 0)
                    } while ((i | 0) > 5)
                }
                fd(d, b)
                tj(d)
            }
            j = (a + 100) | 0
            Nh(f[j >> 2] | 0, b) | 0
            if (f[j >> 2] | 0) {
                rn(d)
                lk(d)
                h = f[j >> 2] | 0
                if ((h | 0) > 3) {
                    j = (a + 96) | 0
                    i = h
                    do {
                        h = i
                        i = (i + -4) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((i >>> 5) << 2)) >> 2] & (1 << (i & 31))) | 0) != 0)
                        k = (h + -3) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((k >>> 5) << 2)) >> 2] & (1 << (k & 31))) | 0) != 0)
                        k = (h + -2) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((k >>> 5) << 2)) >> 2] & (1 << (k & 31))) | 0) != 0)
                        k = (h + -1) | 0
                        Vi(d, ((f[((f[j >> 2] | 0) + ((k >>> 5) << 2)) >> 2] & (1 << (k & 31))) | 0) != 0)
                    } while ((h | 0) > 7)
                }
                fd(d, b)
                tj(d)
            }
            f[g >> 2] = f[(a + 12) >> 2]
            j = (b + 16) | 0
            i = j
            h = f[i >> 2] | 0
            k = f[(i + 4) >> 2] | 0
            if (((k | 0) > 0) | (((k | 0) == 0) & (h >>> 0 > 0))) {
                l = k
                m = h
            } else {
                f[e >> 2] = f[(b + 4) >> 2]
                f[d >> 2] = f[e >> 2]
                ye(b, d, g, (g + 4) | 0) | 0
                h = j
                l = f[(h + 4) >> 2] | 0
                m = f[h >> 2] | 0
            }
            f[g >> 2] = f[(a + 16) >> 2]
            if (((l | 0) > 0) | (((l | 0) == 0) & (m >>> 0 > 0))) {
                u = c
                return 1
            }
            f[e >> 2] = f[(b + 4) >> 2]
            f[d >> 2] = f[e >> 2]
            ye(b, d, g, (g + 4) | 0) | 0
            u = c
            return 1
        }
        function ud(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0
            c = (a + 4) | 0
            if (!b) {
                e = f[a >> 2] | 0
                f[a >> 2] = 0
                if (e | 0) br(e)
                f[c >> 2] = 0
                return
            }
            if (b >>> 0 > 1073741823) {
                e = ra(8) | 0
                Wo(e, 14941)
                f[e >> 2] = 6944
                va(e | 0, 1080, 114)
            }
            e = dn(b << 2) | 0
            g = f[a >> 2] | 0
            f[a >> 2] = e
            if (g | 0) br(g)
            f[c >> 2] = b
            c = 0
            do {
                f[((f[a >> 2] | 0) + (c << 2)) >> 2] = 0
                c = (c + 1) | 0
            } while ((c | 0) != (b | 0))
            c = (a + 8) | 0
            g = f[c >> 2] | 0
            if (!g) return
            e = f[(g + 4) >> 2] | 0
            h = (b + -1) | 0
            i = ((h & b) | 0) == 0
            if (!i)
                if (e >>> 0 < b >>> 0) j = e
                else j = (e >>> 0) % (b >>> 0) | 0
            else j = e & h
            f[((f[a >> 2] | 0) + (j << 2)) >> 2] = c
            c = f[g >> 2] | 0
            if (!c) return
            else {
                k = j
                l = g
                m = c
                n = g
            }
            a: while (1) {
                g = l
                c = m
                j = n
                b: while (1) {
                    c: do
                        if (i) {
                            e = c
                            while (1) {
                                o = f[(e + 4) >> 2] & h
                                if ((o | 0) == (k | 0)) {
                                    p = e
                                    break c
                                }
                                q = ((f[a >> 2] | 0) + (o << 2)) | 0
                                if (!(f[q >> 2] | 0)) {
                                    r = e
                                    s = o
                                    t = q
                                    break b
                                }
                                q = (e + 8) | 0
                                u = f[e >> 2] | 0
                                d: do
                                    if (!u) v = e
                                    else {
                                        w = d[q >> 1] | 0
                                        x = (q + 2) | 0
                                        y = e
                                        z = u
                                        while (1) {
                                            A = (z + 8) | 0
                                            if ((w << 16) >> 16 != (d[A >> 1] | 0)) {
                                                v = y
                                                break d
                                            }
                                            if ((d[x >> 1] | 0) != (d[(A + 2) >> 1] | 0)) {
                                                v = y
                                                break d
                                            }
                                            A = f[z >> 2] | 0
                                            if (!A) {
                                                v = z
                                                break
                                            } else {
                                                B = z
                                                z = A
                                                y = B
                                            }
                                        }
                                    }
                                while (0)
                                f[j >> 2] = f[v >> 2]
                                f[v >> 2] = f[f[((f[a >> 2] | 0) + (o << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (o << 2)) >> 2] >> 2] = e
                                e = f[g >> 2] | 0
                                if (!e) {
                                    C = 39
                                    break a
                                }
                            }
                        } else {
                            e = c
                            while (1) {
                                u = f[(e + 4) >> 2] | 0
                                if (u >>> 0 < b >>> 0) D = u
                                else D = (u >>> 0) % (b >>> 0) | 0
                                if ((D | 0) == (k | 0)) {
                                    p = e
                                    break c
                                }
                                u = ((f[a >> 2] | 0) + (D << 2)) | 0
                                if (!(f[u >> 2] | 0)) {
                                    r = e
                                    s = D
                                    t = u
                                    break b
                                }
                                u = (e + 8) | 0
                                q = f[e >> 2] | 0
                                e: do
                                    if (!q) E = e
                                    else {
                                        y = d[u >> 1] | 0
                                        z = (u + 2) | 0
                                        x = e
                                        w = q
                                        while (1) {
                                            B = (w + 8) | 0
                                            if ((y << 16) >> 16 != (d[B >> 1] | 0)) {
                                                E = x
                                                break e
                                            }
                                            if ((d[z >> 1] | 0) != (d[(B + 2) >> 1] | 0)) {
                                                E = x
                                                break e
                                            }
                                            B = f[w >> 2] | 0
                                            if (!B) {
                                                E = w
                                                break
                                            } else {
                                                A = w
                                                w = B
                                                x = A
                                            }
                                        }
                                    }
                                while (0)
                                f[j >> 2] = f[E >> 2]
                                f[E >> 2] = f[f[((f[a >> 2] | 0) + (D << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (D << 2)) >> 2] >> 2] = e
                                e = f[g >> 2] | 0
                                if (!e) {
                                    C = 39
                                    break a
                                }
                            }
                        }
                    while (0)
                    c = f[p >> 2] | 0
                    if (!c) {
                        C = 39
                        break a
                    } else {
                        g = p
                        j = p
                    }
                }
                f[t >> 2] = j
                m = f[r >> 2] | 0
                if (!m) {
                    C = 39
                    break
                } else {
                    k = s
                    l = r
                    n = r
                }
            }
            if ((C | 0) == 39) return
        }
        function vd(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0
            d = (a + 4) | 0
            if (!c) {
                e = f[a >> 2] | 0
                f[a >> 2] = 0
                if (e | 0) br(e)
                f[d >> 2] = 0
                return
            }
            if (c >>> 0 > 1073741823) {
                e = ra(8) | 0
                Wo(e, 14941)
                f[e >> 2] = 6944
                va(e | 0, 1080, 114)
            }
            e = dn(c << 2) | 0
            g = f[a >> 2] | 0
            f[a >> 2] = e
            if (g | 0) br(g)
            f[d >> 2] = c
            d = 0
            do {
                f[((f[a >> 2] | 0) + (d << 2)) >> 2] = 0
                d = (d + 1) | 0
            } while ((d | 0) != (c | 0))
            d = (a + 8) | 0
            g = f[d >> 2] | 0
            if (!g) return
            e = f[(g + 4) >> 2] | 0
            h = (c + -1) | 0
            i = ((h & c) | 0) == 0
            if (!i)
                if (e >>> 0 < c >>> 0) j = e
                else j = (e >>> 0) % (c >>> 0) | 0
            else j = e & h
            f[((f[a >> 2] | 0) + (j << 2)) >> 2] = d
            d = f[g >> 2] | 0
            if (!d) return
            else {
                k = j
                l = g
                m = d
                n = g
            }
            a: while (1) {
                g = l
                d = m
                j = n
                b: while (1) {
                    c: do
                        if (i) {
                            e = d
                            while (1) {
                                o = f[(e + 4) >> 2] & h
                                if ((o | 0) == (k | 0)) {
                                    p = e
                                    break c
                                }
                                q = ((f[a >> 2] | 0) + (o << 2)) | 0
                                if (!(f[q >> 2] | 0)) {
                                    r = e
                                    s = o
                                    t = q
                                    break b
                                }
                                q = (e + 8) | 0
                                u = f[e >> 2] | 0
                                d: do
                                    if (!u) v = e
                                    else {
                                        w = b[q >> 0] | 0
                                        x = (q + 1) | 0
                                        y = e
                                        z = u
                                        while (1) {
                                            A = (z + 8) | 0
                                            if ((w << 24) >> 24 != (b[A >> 0] | 0)) {
                                                v = y
                                                break d
                                            }
                                            if ((b[x >> 0] | 0) != (b[(A + 1) >> 0] | 0)) {
                                                v = y
                                                break d
                                            }
                                            A = f[z >> 2] | 0
                                            if (!A) {
                                                v = z
                                                break
                                            } else {
                                                B = z
                                                z = A
                                                y = B
                                            }
                                        }
                                    }
                                while (0)
                                f[j >> 2] = f[v >> 2]
                                f[v >> 2] = f[f[((f[a >> 2] | 0) + (o << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (o << 2)) >> 2] >> 2] = e
                                e = f[g >> 2] | 0
                                if (!e) {
                                    C = 39
                                    break a
                                }
                            }
                        } else {
                            e = d
                            while (1) {
                                u = f[(e + 4) >> 2] | 0
                                if (u >>> 0 < c >>> 0) D = u
                                else D = (u >>> 0) % (c >>> 0) | 0
                                if ((D | 0) == (k | 0)) {
                                    p = e
                                    break c
                                }
                                u = ((f[a >> 2] | 0) + (D << 2)) | 0
                                if (!(f[u >> 2] | 0)) {
                                    r = e
                                    s = D
                                    t = u
                                    break b
                                }
                                u = (e + 8) | 0
                                q = f[e >> 2] | 0
                                e: do
                                    if (!q) E = e
                                    else {
                                        y = b[u >> 0] | 0
                                        z = (u + 1) | 0
                                        x = e
                                        w = q
                                        while (1) {
                                            B = (w + 8) | 0
                                            if ((y << 24) >> 24 != (b[B >> 0] | 0)) {
                                                E = x
                                                break e
                                            }
                                            if ((b[z >> 0] | 0) != (b[(B + 1) >> 0] | 0)) {
                                                E = x
                                                break e
                                            }
                                            B = f[w >> 2] | 0
                                            if (!B) {
                                                E = w
                                                break
                                            } else {
                                                A = w
                                                w = B
                                                x = A
                                            }
                                        }
                                    }
                                while (0)
                                f[j >> 2] = f[E >> 2]
                                f[E >> 2] = f[f[((f[a >> 2] | 0) + (D << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (D << 2)) >> 2] >> 2] = e
                                e = f[g >> 2] | 0
                                if (!e) {
                                    C = 39
                                    break a
                                }
                            }
                        }
                    while (0)
                    d = f[p >> 2] | 0
                    if (!d) {
                        C = 39
                        break a
                    } else {
                        g = p
                        j = p
                    }
                }
                f[t >> 2] = j
                m = f[r >> 2] | 0
                if (!m) {
                    C = 39
                    break
                } else {
                    k = s
                    l = r
                    n = r
                }
            }
            if ((C | 0) == 39) return
        }
        function wd(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0
            c = u
            u = (u + 48) | 0
            d = (c + 32) | 0
            e = (c + 28) | 0
            g = (c + 16) | 0
            h = c
            i = (a + 16) | 0
            j = f[i >> 2] | 0
            if (j | 0) {
                k = f[b >> 2] | 0
                l = i
                m = j
                a: while (1) {
                    j = m
                    while (1) {
                        if ((f[(j + 16) >> 2] | 0) >= (k | 0)) break
                        n = f[(j + 4) >> 2] | 0
                        if (!n) {
                            o = l
                            break a
                        } else j = n
                    }
                    m = f[j >> 2] | 0
                    if (!m) {
                        o = j
                        break
                    } else l = j
                }
                if ((o | 0) != (i | 0) ? (k | 0) >= (f[(o + 16) >> 2] | 0) : 0) {
                    p = o
                    q = (p + 20) | 0
                    u = c
                    return q | 0
                }
            }
            wp(g)
            f[h >> 2] = f[b >> 2]
            b = (h + 4) | 0
            f[(h + 8) >> 2] = 0
            o = (h + 12) | 0
            f[o >> 2] = 0
            k = (h + 8) | 0
            f[b >> 2] = k
            l = f[g >> 2] | 0
            m = (g + 4) | 0
            if ((l | 0) != (m | 0)) {
                n = k
                r = l
                while (1) {
                    l = (r + 16) | 0
                    f[e >> 2] = n
                    f[d >> 2] = f[e >> 2]
                    Wg(b, d, l, l) | 0
                    l = f[(r + 4) >> 2] | 0
                    if (!l) {
                        s = (r + 8) | 0
                        t = f[s >> 2] | 0
                        if ((f[t >> 2] | 0) == (r | 0)) v = t
                        else {
                            t = s
                            do {
                                s = f[t >> 2] | 0
                                t = (s + 8) | 0
                                w = f[t >> 2] | 0
                            } while ((f[w >> 2] | 0) != (s | 0))
                            v = w
                        }
                    } else {
                        t = l
                        while (1) {
                            j = f[t >> 2] | 0
                            if (!j) break
                            else t = j
                        }
                        v = t
                    }
                    if ((v | 0) == (m | 0)) break
                    else r = v
                }
            }
            v = (a + 12) | 0
            r = f[i >> 2] | 0
            do
                if (r) {
                    d = f[h >> 2] | 0
                    e = (a + 16) | 0
                    n = r
                    while (1) {
                        l = f[(n + 16) >> 2] | 0
                        if ((d | 0) < (l | 0)) {
                            j = f[n >> 2] | 0
                            if (!j) {
                                x = 23
                                break
                            } else {
                                y = n
                                z = j
                            }
                        } else {
                            if ((l | 0) >= (d | 0)) {
                                x = 27
                                break
                            }
                            A = (n + 4) | 0
                            l = f[A >> 2] | 0
                            if (!l) {
                                x = 26
                                break
                            } else {
                                y = A
                                z = l
                            }
                        }
                        e = y
                        n = z
                    }
                    if ((x | 0) == 23) {
                        B = n
                        C = n
                        break
                    } else if ((x | 0) == 26) {
                        B = n
                        C = A
                        break
                    } else if ((x | 0) == 27) {
                        B = n
                        C = e
                        break
                    }
                } else {
                    B = i
                    C = i
                }
            while (0)
            i = f[C >> 2] | 0
            if (!i) {
                x = dn(32) | 0
                f[(x + 16) >> 2] = f[h >> 2]
                A = (x + 20) | 0
                f[A >> 2] = f[b >> 2]
                z = (x + 24) | 0
                y = f[(h + 8) >> 2] | 0
                f[z >> 2] = y
                r = f[o >> 2] | 0
                f[(x + 28) >> 2] = r
                if (!r) f[A >> 2] = z
                else {
                    f[(y + 8) >> 2] = z
                    f[b >> 2] = k
                    f[k >> 2] = 0
                    f[o >> 2] = 0
                }
                f[x >> 2] = 0
                f[(x + 4) >> 2] = 0
                f[(x + 8) >> 2] = B
                f[C >> 2] = x
                B = f[f[v >> 2] >> 2] | 0
                if (!B) D = x
                else {
                    f[v >> 2] = B
                    D = f[C >> 2] | 0
                }
                Ae(f[(a + 16) >> 2] | 0, D)
                D = (a + 20) | 0
                f[D >> 2] = (f[D >> 2] | 0) + 1
                E = x
            } else E = i
            sj((h + 4) | 0, f[k >> 2] | 0)
            sj(g, f[m >> 2] | 0)
            p = E
            q = (p + 20) | 0
            u = c
            return q | 0
        }
        function xd(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 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
            d = b[(c + 11) >> 0] | 0
            e = (d << 24) >> 24 < 0
            g = e ? f[c >> 2] | 0 : c
            i = e ? f[(c + 4) >> 2] | 0 : d & 255
            if (i >>> 0 > 3) {
                d = g
                c = i
                e = i
                while (1) {
                    j = X(h[d >> 0] | (h[(d + 1) >> 0] << 8) | (h[(d + 2) >> 0] << 16) | (h[(d + 3) >> 0] << 24), 1540483477) | 0
                    c = (X((j >>> 24) ^ j, 1540483477) | 0) ^ (X(c, 1540483477) | 0)
                    e = (e + -4) | 0
                    if (e >>> 0 <= 3) break
                    else d = (d + 4) | 0
                }
                d = (i + -4) | 0
                e = d & -4
                k = (d - e) | 0
                l = (g + (e + 4)) | 0
                m = c
            } else {
                k = i
                l = g
                m = i
            }
            switch (k | 0) {
                case 3: {
                    n = (h[(l + 2) >> 0] << 16) ^ m
                    o = 6
                    break
                }
                case 2: {
                    n = m
                    o = 6
                    break
                }
                case 1: {
                    p = m
                    o = 7
                    break
                }
                default:
                    q = m
            }
            if ((o | 0) == 6) {
                p = (h[(l + 1) >> 0] << 8) ^ n
                o = 7
            }
            if ((o | 0) == 7) q = X(p ^ h[l >> 0], 1540483477) | 0
            l = X((q >>> 13) ^ q, 1540483477) | 0
            q = (l >>> 15) ^ l
            l = f[(a + 4) >> 2] | 0
            if (!l) {
                r = 0
                return r | 0
            }
            p = (l + -1) | 0
            n = ((p & l) | 0) == 0
            if (!n)
                if (q >>> 0 < l >>> 0) s = q
                else s = (q >>> 0) % (l >>> 0) | 0
            else s = q & p
            m = f[((f[a >> 2] | 0) + (s << 2)) >> 2] | 0
            if (!m) {
                r = 0
                return r | 0
            }
            a = f[m >> 2] | 0
            if (!a) {
                r = 0
                return r | 0
            }
            m = (i | 0) == 0
            if (n) {
                n = a
                a: while (1) {
                    k = f[(n + 4) >> 2] | 0
                    c = (k | 0) == (q | 0)
                    if (!(c | (((k & p) | 0) == (s | 0)))) {
                        r = 0
                        o = 40
                        break
                    }
                    do
                        if (c ? ((k = (n + 8) | 0), (e = b[(k + 11) >> 0] | 0), (d = (e << 24) >> 24 < 0), (j = e & 255), ((d ? f[(n + 12) >> 2] | 0 : j) | 0) == (i | 0)) : 0) {
                            e = f[k >> 2] | 0
                            t = d ? e : k
                            if (d) {
                                if (m) {
                                    r = n
                                    o = 40
                                    break a
                                }
                                if (!(Pk(t, g, i) | 0)) {
                                    r = n
                                    o = 40
                                    break a
                                } else break
                            }
                            if (m) {
                                r = n
                                o = 40
                                break a
                            }
                            if ((b[g >> 0] | 0) == ((e & 255) << 24) >> 24) {
                                e = k
                                k = j
                                j = g
                                do {
                                    k = (k + -1) | 0
                                    e = (e + 1) | 0
                                    if (!k) {
                                        r = n
                                        o = 40
                                        break a
                                    }
                                    j = (j + 1) | 0
                                } while ((b[e >> 0] | 0) == (b[j >> 0] | 0))
                            }
                        }
                    while (0)
                    n = f[n >> 2] | 0
                    if (!n) {
                        r = 0
                        o = 40
                        break
                    }
                }
                if ((o | 0) == 40) return r | 0
            } else u = a
            b: while (1) {
                a = f[(u + 4) >> 2] | 0
                do
                    if ((a | 0) == (q | 0)) {
                        n = (u + 8) | 0
                        p = b[(n + 11) >> 0] | 0
                        c = (p << 24) >> 24 < 0
                        j = p & 255
                        if (((c ? f[(u + 12) >> 2] | 0 : j) | 0) == (i | 0)) {
                            p = f[n >> 2] | 0
                            e = c ? p : n
                            if (c) {
                                if (m) {
                                    r = u
                                    o = 40
                                    break b
                                }
                                if (!(Pk(e, g, i) | 0)) {
                                    r = u
                                    o = 40
                                    break b
                                } else break
                            }
                            if (m) {
                                r = u
                                o = 40
                                break b
                            }
                            if ((b[g >> 0] | 0) == ((p & 255) << 24) >> 24) {
                                p = n
                                n = j
                                j = g
                                do {
                                    n = (n + -1) | 0
                                    p = (p + 1) | 0
                                    if (!n) {
                                        r = u
                                        o = 40
                                        break b
                                    }
                                    j = (j + 1) | 0
                                } while ((b[p >> 0] | 0) == (b[j >> 0] | 0))
                            }
                        }
                    } else {
                        if (a >>> 0 < l >>> 0) v = a
                        else v = (a >>> 0) % (l >>> 0) | 0
                        if ((v | 0) != (s | 0)) {
                            r = 0
                            o = 40
                            break b
                        }
                    }
                while (0)
                u = f[u >> 2] | 0
                if (!u) {
                    r = 0
                    o = 40
                    break
                }
            }
            if ((o | 0) == 40) return r | 0
            return 0
        }
        function yd(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0
            c = (a + 4) | 0
            if (!b) {
                d = f[a >> 2] | 0
                f[a >> 2] = 0
                if (d | 0) br(d)
                f[c >> 2] = 0
                return
            }
            if (b >>> 0 > 1073741823) {
                d = ra(8) | 0
                Wo(d, 14941)
                f[d >> 2] = 6944
                va(d | 0, 1080, 114)
            }
            d = dn(b << 2) | 0
            e = f[a >> 2] | 0
            f[a >> 2] = d
            if (e | 0) br(e)
            f[c >> 2] = b
            c = 0
            do {
                f[((f[a >> 2] | 0) + (c << 2)) >> 2] = 0
                c = (c + 1) | 0
            } while ((c | 0) != (b | 0))
            c = (a + 8) | 0
            e = f[c >> 2] | 0
            if (!e) return
            d = f[(e + 4) >> 2] | 0
            g = (b + -1) | 0
            h = ((g & b) | 0) == 0
            if (!h)
                if (d >>> 0 < b >>> 0) i = d
                else i = (d >>> 0) % (b >>> 0) | 0
            else i = d & g
            f[((f[a >> 2] | 0) + (i << 2)) >> 2] = c
            c = f[e >> 2] | 0
            if (!c) return
            else {
                j = i
                k = e
                l = c
                m = e
            }
            a: while (1) {
                e = k
                c = l
                i = m
                b: while (1) {
                    c: do
                        if (h) {
                            d = c
                            while (1) {
                                n = f[(d + 4) >> 2] & g
                                if ((n | 0) == (j | 0)) {
                                    o = d
                                    break c
                                }
                                p = ((f[a >> 2] | 0) + (n << 2)) | 0
                                if (!(f[p >> 2] | 0)) {
                                    q = d
                                    r = n
                                    s = p
                                    break b
                                }
                                p = (d + 12) | 0
                                t = f[d >> 2] | 0
                                d: do
                                    if (!t) u = d
                                    else {
                                        v = f[(d + 8) >> 2] | 0
                                        w = d
                                        x = t
                                        while (1) {
                                            if ((v | 0) != (f[(x + 8) >> 2] | 0)) {
                                                u = w
                                                break d
                                            }
                                            if ((f[p >> 2] | 0) != (f[(x + 12) >> 2] | 0)) {
                                                u = w
                                                break d
                                            }
                                            y = f[x >> 2] | 0
                                            if (!y) {
                                                u = x
                                                break
                                            } else {
                                                z = x
                                                x = y
                                                w = z
                                            }
                                        }
                                    }
                                while (0)
                                f[i >> 2] = f[u >> 2]
                                f[u >> 2] = f[f[((f[a >> 2] | 0) + (n << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (n << 2)) >> 2] >> 2] = d
                                d = f[e >> 2] | 0
                                if (!d) {
                                    A = 39
                                    break a
                                }
                            }
                        } else {
                            d = c
                            while (1) {
                                p = f[(d + 4) >> 2] | 0
                                if (p >>> 0 < b >>> 0) B = p
                                else B = (p >>> 0) % (b >>> 0) | 0
                                if ((B | 0) == (j | 0)) {
                                    o = d
                                    break c
                                }
                                p = ((f[a >> 2] | 0) + (B << 2)) | 0
                                if (!(f[p >> 2] | 0)) {
                                    q = d
                                    r = B
                                    s = p
                                    break b
                                }
                                p = (d + 12) | 0
                                t = f[d >> 2] | 0
                                e: do
                                    if (!t) C = d
                                    else {
                                        w = f[(d + 8) >> 2] | 0
                                        x = d
                                        v = t
                                        while (1) {
                                            if ((w | 0) != (f[(v + 8) >> 2] | 0)) {
                                                C = x
                                                break e
                                            }
                                            if ((f[p >> 2] | 0) != (f[(v + 12) >> 2] | 0)) {
                                                C = x
                                                break e
                                            }
                                            z = f[v >> 2] | 0
                                            if (!z) {
                                                C = v
                                                break
                                            } else {
                                                y = v
                                                v = z
                                                x = y
                                            }
                                        }
                                    }
                                while (0)
                                f[i >> 2] = f[C >> 2]
                                f[C >> 2] = f[f[((f[a >> 2] | 0) + (B << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (B << 2)) >> 2] >> 2] = d
                                d = f[e >> 2] | 0
                                if (!d) {
                                    A = 39
                                    break a
                                }
                            }
                        }
                    while (0)
                    c = f[o >> 2] | 0
                    if (!c) {
                        A = 39
                        break a
                    } else {
                        e = o
                        i = o
                    }
                }
                f[s >> 2] = i
                l = f[q >> 2] | 0
                if (!l) {
                    A = 39
                    break
                } else {
                    j = r
                    k = q
                    m = q
                }
            }
            if ((A | 0) == 39) return
        }
        function zd(a, c, d, e, g) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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
            h = (a + 4) | 0
            i = f[c >> 2] | 0
            c = i
            do
                if ((i | 0) != (h | 0)) {
                    j = (i + 16) | 0
                    k = b[(j + 11) >> 0] | 0
                    l = (k << 24) >> 24 < 0
                    m = l ? f[(i + 20) >> 2] | 0 : k & 255
                    k = b[(g + 11) >> 0] | 0
                    n = (k << 24) >> 24 < 0
                    o = n ? f[(g + 4) >> 2] | 0 : k & 255
                    k = m >>> 0 < o >>> 0
                    p = k ? m : o
                    if ((p | 0) != 0 ? ((q = Pk(n ? f[g >> 2] | 0 : g, l ? f[j >> 2] | 0 : j, p) | 0), (q | 0) != 0) : 0) {
                        if ((q | 0) < 0) break
                    } else r = 4
                    if ((r | 0) == 4 ? o >>> 0 < m >>> 0 : 0) break
                    q = o >>> 0 < m >>> 0 ? o : m
                    if ((q | 0) != 0 ? ((m = Pk(l ? f[j >> 2] | 0 : j, n ? f[g >> 2] | 0 : g, q) | 0), (m | 0) != 0) : 0) {
                        if ((m | 0) >= 0) r = 37
                    } else r = 21
                    if ((r | 0) == 21 ? !k : 0) r = 37
                    if ((r | 0) == 37) {
                        f[d >> 2] = c
                        f[e >> 2] = c
                        s = e
                        return s | 0
                    }
                    k = f[(i + 4) >> 2] | 0
                    m = (k | 0) == 0
                    if (m) {
                        q = (i + 8) | 0
                        j = f[q >> 2] | 0
                        if ((f[j >> 2] | 0) == (i | 0)) t = j
                        else {
                            j = q
                            do {
                                q = f[j >> 2] | 0
                                j = (q + 8) | 0
                                l = f[j >> 2] | 0
                            } while ((f[l >> 2] | 0) != (q | 0))
                            t = l
                        }
                    } else {
                        j = k
                        while (1) {
                            l = f[j >> 2] | 0
                            if (!l) break
                            else j = l
                        }
                        t = j
                    }
                    do
                        if ((t | 0) != (h | 0)) {
                            k = (t + 16) | 0
                            l = b[(k + 11) >> 0] | 0
                            q = (l << 24) >> 24 < 0
                            p = q ? f[(t + 20) >> 2] | 0 : l & 255
                            l = p >>> 0 < o >>> 0 ? p : o
                            if ((l | 0) != 0 ? ((u = Pk(n ? f[g >> 2] | 0 : g, q ? f[k >> 2] | 0 : k, l) | 0), (u | 0) != 0) : 0) {
                                if ((u | 0) < 0) break
                            } else r = 31
                            if ((r | 0) == 31 ? o >>> 0 < p >>> 0 : 0) break
                            s = hg(a, d, g) | 0
                            return s | 0
                        }
                    while (0)
                    if (m) {
                        f[d >> 2] = c
                        s = (i + 4) | 0
                        return s | 0
                    } else {
                        f[d >> 2] = t
                        s = t
                        return s | 0
                    }
                }
            while (0)
            t = f[i >> 2] | 0
            do
                if ((f[a >> 2] | 0) == (i | 0)) v = c
                else {
                    if (!t) {
                        h = i
                        while (1) {
                            e = f[(h + 8) >> 2] | 0
                            if ((f[e >> 2] | 0) == (h | 0)) h = e
                            else {
                                w = e
                                break
                            }
                        }
                    } else {
                        h = t
                        while (1) {
                            m = f[(h + 4) >> 2] | 0
                            if (!m) {
                                w = h
                                break
                            } else h = m
                        }
                    }
                    h = w
                    m = (w + 16) | 0
                    e = b[(g + 11) >> 0] | 0
                    o = (e << 24) >> 24 < 0
                    n = o ? f[(g + 4) >> 2] | 0 : e & 255
                    e = b[(m + 11) >> 0] | 0
                    j = (e << 24) >> 24 < 0
                    p = j ? f[(w + 20) >> 2] | 0 : e & 255
                    e = n >>> 0 < p >>> 0 ? n : p
                    if ((e | 0) != 0 ? ((u = Pk(j ? f[m >> 2] | 0 : m, o ? f[g >> 2] | 0 : g, e) | 0), (u | 0) != 0) : 0) {
                        if ((u | 0) < 0) {
                            v = h
                            break
                        }
                    } else r = 13
                    if ((r | 0) == 13 ? p >>> 0 < n >>> 0 : 0) {
                        v = h
                        break
                    }
                    s = hg(a, d, g) | 0
                    return s | 0
                }
            while (0)
            if (!t) {
                f[d >> 2] = i
                s = i
                return s | 0
            } else {
                f[d >> 2] = v
                s = (v + 4) | 0
                return s | 0
            }
            return 0
        }
        function Ad(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            g = u
            u = (u + 16) | 0
            h = g
            f[(c + 48) >> 2] = d
            f[(c + 44) >> 2] = e
            e = f[(c + 8) >> 2] | 0
            i = (c + 12) | 0
            j = f[i >> 2] | 0
            if ((j | 0) != (e | 0)) {
                k = j
                do {
                    j = (k + -4) | 0
                    f[i >> 2] = j
                    l = f[j >> 2] | 0
                    f[j >> 2] = 0
                    if (l | 0) Va[f[((f[l >> 2] | 0) + 4) >> 2] & 127](l)
                    k = f[i >> 2] | 0
                } while ((k | 0) != (e | 0))
            }
            e = f[(c + 20) >> 2] | 0
            k = (c + 24) | 0
            i = f[k >> 2] | 0
            if ((i | 0) != (e | 0)) f[k >> 2] = i + (~(((i + -4 - e) | 0) >>> 2) << 2)
            e = f[(c + 32) >> 2] | 0
            i = (c + 36) | 0
            k = f[i >> 2] | 0
            if ((k | 0) != (e | 0)) f[i >> 2] = k + (~(((k + -4 - e) | 0) >>> 2) << 2)
            if (!(f[(c + 4) >> 2] | 0)) {
                e = dn(32) | 0
                f[h >> 2] = e
                f[(h + 8) >> 2] = -2147483616
                f[(h + 4) >> 2] = 23
                m = e
                n = 14670
                o = (m + 23) | 0
                do {
                    b[m >> 0] = b[n >> 0] | 0
                    m = (m + 1) | 0
                    n = (n + 1) | 0
                } while ((m | 0) < (o | 0))
                b[(e + 23) >> 0] = 0
                f[a >> 2] = -1
                dj((a + 4) | 0, h)
                if ((b[(h + 11) >> 0] | 0) < 0) br(f[h >> 2] | 0)
                u = g
                return
            }
            Jd(a, c)
            if (f[a >> 2] | 0) {
                u = g
                return
            }
            e = (a + 4) | 0
            k = (e + 11) | 0
            if ((b[k >> 0] | 0) < 0) br(f[e >> 2] | 0)
            Ji(a, c)
            if (f[a >> 2] | 0) {
                u = g
                return
            }
            if ((b[k >> 0] | 0) < 0) br(f[e >> 2] | 0)
            if (!(Qa[f[((f[c >> 2] | 0) + 16) >> 2] & 127](c) | 0)) {
                i = dn(32) | 0
                f[h >> 2] = i
                f[(h + 8) >> 2] = -2147483616
                f[(h + 4) >> 2] = 29
                m = i
                n = 14694
                o = (m + 29) | 0
                do {
                    b[m >> 0] = b[n >> 0] | 0
                    m = (m + 1) | 0
                    n = (n + 1) | 0
                } while ((m | 0) < (o | 0))
                b[(i + 29) >> 0] = 0
                f[a >> 2] = -1
                dj(e, h)
                if ((b[(h + 11) >> 0] | 0) < 0) br(f[h >> 2] | 0)
                u = g
                return
            }
            if (!(Qa[f[((f[c >> 2] | 0) + 20) >> 2] & 127](c) | 0)) {
                i = dn(32) | 0
                f[h >> 2] = i
                f[(h + 8) >> 2] = -2147483616
                f[(h + 4) >> 2] = 31
                m = i
                n = 14724
                o = (m + 31) | 0
                do {
                    b[m >> 0] = b[n >> 0] | 0
                    m = (m + 1) | 0
                    n = (n + 1) | 0
                } while ((m | 0) < (o | 0))
                b[(i + 31) >> 0] = 0
                f[a >> 2] = -1
                dj(e, h)
                if ((b[(h + 11) >> 0] | 0) < 0) br(f[h >> 2] | 0)
                u = g
                return
            }
            Wa[f[((f[c >> 2] | 0) + 24) >> 2] & 15](a, c)
            if (f[a >> 2] | 0) {
                u = g
                return
            }
            if ((b[k >> 0] | 0) < 0) br(f[e >> 2] | 0)
            if (!(Qa[f[((f[c >> 2] | 0) + 28) >> 2] & 127](c) | 0)) {
                k = dn(48) | 0
                f[h >> 2] = k
                f[(h + 8) >> 2] = -2147483600
                f[(h + 4) >> 2] = 34
                m = k
                n = 14756
                o = (m + 34) | 0
                do {
                    b[m >> 0] = b[n >> 0] | 0
                    m = (m + 1) | 0
                    n = (n + 1) | 0
                } while ((m | 0) < (o | 0))
                b[(k + 34) >> 0] = 0
                f[a >> 2] = -1
                dj(e, h)
                if ((b[(h + 11) >> 0] | 0) < 0) br(f[h >> 2] | 0)
                u = g
                return
            }
            e = dn(32) | 0
            f[h >> 2] = e
            f[(h + 8) >> 2] = -2147483616
            f[(h + 4) >> 2] = 30
            m = e
            n = 14791
            o = (m + 30) | 0
            do {
                b[m >> 0] = b[n >> 0] | 0
                m = (m + 1) | 0
                n = (n + 1) | 0
            } while ((m | 0) < (o | 0))
            b[(e + 30) >> 0] = 0
            e = Oj(d, h, 0) | 0
            if ((b[(h + 11) >> 0] | 0) < 0) br(f[h >> 2] | 0)
            if (e) Va[f[((f[c >> 2] | 0) + 48) >> 2] & 127](c)
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            f[(a + 12) >> 2] = 0
            u = g
            return
        }
        function Bd(a, b, c, d, e) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                E = 0,
                F = 0,
                G = 0
            g = a
            h = b
            i = h
            j = c
            k = d
            l = k
            if (!i) {
                m = (e | 0) != 0
                if (!l) {
                    if (m) {
                        f[e >> 2] = (g >>> 0) % (j >>> 0)
                        f[(e + 4) >> 2] = 0
                    }
                    n = 0
                    o = ((g >>> 0) / (j >>> 0)) >>> 0
                    return ((I = n), o) | 0
                } else {
                    if (!m) {
                        n = 0
                        o = 0
                        return ((I = n), o) | 0
                    }
                    f[e >> 2] = a | 0
                    f[(e + 4) >> 2] = b & 0
                    n = 0
                    o = 0
                    return ((I = n), o) | 0
                }
            }
            m = (l | 0) == 0
            do
                if (j) {
                    if (!m) {
                        p = ((_(l | 0) | 0) - (_(i | 0) | 0)) | 0
                        if (p >>> 0 <= 31) {
                            q = (p + 1) | 0
                            r = (31 - p) | 0
                            s = (p - 31) >> 31
                            t = q
                            u = ((g >>> (q >>> 0)) & s) | (i << r)
                            v = (i >>> (q >>> 0)) & s
                            w = 0
                            x = g << r
                            break
                        }
                        if (!e) {
                            n = 0
                            o = 0
                            return ((I = n), o) | 0
                        }
                        f[e >> 2] = a | 0
                        f[(e + 4) >> 2] = h | (b & 0)
                        n = 0
                        o = 0
                        return ((I = n), o) | 0
                    }
                    r = (j - 1) | 0
                    if ((r & j) | 0) {
                        s = ((_(j | 0) | 0) + 33 - (_(i | 0) | 0)) | 0
                        q = (64 - s) | 0
                        p = (32 - s) | 0
                        y = p >> 31
                        z = (s - 32) | 0
                        A = z >> 31
                        t = s
                        u = (((p - 1) >> 31) & (i >>> (z >>> 0))) | (((i << p) | (g >>> (s >>> 0))) & A)
                        v = A & (i >>> (s >>> 0))
                        w = (g << q) & y
                        x = (((i << q) | (g >>> (z >>> 0))) & y) | ((g << p) & ((s - 33) >> 31))
                        break
                    }
                    if (e | 0) {
                        f[e >> 2] = r & g
                        f[(e + 4) >> 2] = 0
                    }
                    if ((j | 0) == 1) {
                        n = h | (b & 0)
                        o = a | 0 | 0
                        return ((I = n), o) | 0
                    } else {
                        r = im(j | 0) | 0
                        n = (i >>> (r >>> 0)) | 0
                        o = (i << (32 - r)) | (g >>> (r >>> 0)) | 0
                        return ((I = n), o) | 0
                    }
                } else {
                    if (m) {
                        if (e | 0) {
                            f[e >> 2] = (i >>> 0) % (j >>> 0)
                            f[(e + 4) >> 2] = 0
                        }
                        n = 0
                        o = ((i >>> 0) / (j >>> 0)) >>> 0
                        return ((I = n), o) | 0
                    }
                    if (!g) {
                        if (e | 0) {
                            f[e >> 2] = 0
                            f[(e + 4) >> 2] = (i >>> 0) % (l >>> 0)
                        }
                        n = 0
                        o = ((i >>> 0) / (l >>> 0)) >>> 0
                        return ((I = n), o) | 0
                    }
                    r = (l - 1) | 0
                    if (!(r & l)) {
                        if (e | 0) {
                            f[e >> 2] = a | 0
                            f[(e + 4) >> 2] = (r & i) | (b & 0)
                        }
                        n = 0
                        o = i >>> ((im(l | 0) | 0) >>> 0)
                        return ((I = n), o) | 0
                    }
                    r = ((_(l | 0) | 0) - (_(i | 0) | 0)) | 0
                    if (r >>> 0 <= 30) {
                        s = (r + 1) | 0
                        p = (31 - r) | 0
                        t = s
                        u = (i << p) | (g >>> (s >>> 0))
                        v = i >>> (s >>> 0)
                        w = 0
                        x = g << p
                        break
                    }
                    if (!e) {
                        n = 0
                        o = 0
                        return ((I = n), o) | 0
                    }
                    f[e >> 2] = a | 0
                    f[(e + 4) >> 2] = h | (b & 0)
                    n = 0
                    o = 0
                    return ((I = n), o) | 0
                }
            while (0)
            if (!t) {
                B = x
                C = w
                D = v
                E = u
                F = 0
                G = 0
            } else {
                b = c | 0 | 0
                c = k | (d & 0)
                d = Tn(b | 0, c | 0, -1, -1) | 0
                k = I
                h = x
                x = w
                w = v
                v = u
                u = t
                t = 0
                do {
                    a = h
                    h = (x >>> 31) | (h << 1)
                    x = t | (x << 1)
                    g = (v << 1) | (a >>> 31) | 0
                    a = (v >>> 31) | (w << 1) | 0
                    Vn(d | 0, k | 0, g | 0, a | 0) | 0
                    i = I
                    l = (i >> 31) | (((i | 0) < 0 ? -1 : 0) << 1)
                    t = l & 1
                    v = Vn(g | 0, a | 0, (l & b) | 0, (((((i | 0) < 0 ? -1 : 0) >> 31) | (((i | 0) < 0 ? -1 : 0) << 1)) & c) | 0) | 0
                    w = I
                    u = (u - 1) | 0
                } while ((u | 0) != 0)
                B = h
                C = x
                D = w
                E = v
                F = 0
                G = t
            }
            t = C
            C = 0
            if (e | 0) {
                f[e >> 2] = E
                f[(e + 4) >> 2] = D
            }
            n = ((t | 0) >>> 31) | ((B | C) << 1) | (((C << 1) | (t >>> 31)) & 0) | F
            o = (((t << 1) | (0 >>> 31)) & -2) | G
            return ((I = n), o) | 0
        }
        function Cd(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 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
            c = u
            u = (u + 32) | 0
            d = (c + 4) | 0
            e = c
            g = (c + 16) | 0
            h = (a + 48) | 0
            i = f[h >> 2] | 0
            j = dn(32) | 0
            f[d >> 2] = j
            f[(d + 8) >> 2] = -2147483616
            f[(d + 4) >> 2] = 20
            k = j
            l = 13101
            m = (k + 20) | 0
            do {
                b[k >> 0] = b[l >> 0] | 0
                k = (k + 1) | 0
                l = (l + 1) | 0
            } while ((k | 0) < (m | 0))
            b[(j + 20) >> 0] = 0
            j = vk((i + 24) | 0, d) | 0
            if ((b[(d + 11) >> 0] | 0) < 0) br(f[d >> 2] | 0)
            i = f[h >> 2] | 0
            n = dn(32) | 0
            f[d >> 2] = n
            f[(d + 8) >> 2] = -2147483616
            f[(d + 4) >> 2] = 22
            k = n
            l = 13122
            m = (k + 22) | 0
            do {
                b[k >> 0] = b[l >> 0] | 0
                k = (k + 1) | 0
                l = (l + 1) | 0
            } while ((k | 0) < (m | 0))
            b[(n + 22) >> 0] = 0
            n = vk((i + 24) | 0, d) | 0
            if ((b[(d + 11) >> 0] | 0) < 0) br(f[d >> 2] | 0)
            i = (a + 64) | 0
            o = f[i >> 2] | 0
            f[i >> 2] = 0
            if (o | 0) Va[f[((f[o >> 2] | 0) + 4) >> 2] & 127](o)
            o = f[(a + 56) >> 2] | 0
            p = (((((f[(o + 100) >> 2] | 0) - (f[(o + 96) >> 2] | 0)) | 0) / 12) | 0) >>> 0 < 1e3
            o = f[h >> 2] | 0
            q = dn(32) | 0
            f[d >> 2] = q
            f[(d + 8) >> 2] = -2147483616
            f[(d + 4) >> 2] = 18
            k = q
            l = 13145
            m = (k + 18) | 0
            do {
                b[k >> 0] = b[l >> 0] | 0
                k = (k + 1) | 0
                l = (l + 1) | 0
            } while ((k | 0) < (m | 0))
            b[(q + 18) >> 0] = 0
            q = yk(o, d, -1) | 0
            if ((b[(d + 11) >> 0] | 0) < 0) br(f[d >> 2] | 0)
            switch (q | 0) {
                case -1: {
                    if (j ? p | (((Yh(f[h >> 2] | 0) | 0) > 4) | (n ^ 1)) : 0) r = 13
                    else r = 17
                    break
                }
                case 0: {
                    if (j) r = 13
                    else r = 21
                    break
                }
                case 2: {
                    r = 17
                    break
                }
                default:
                    r = 21
            }
            if ((r | 0) == 13) {
                j = f[(a + 44) >> 2] | 0
                b[g >> 0] = 0
                n = (j + 16) | 0
                h = f[(n + 4) >> 2] | 0
                if (!(((h | 0) > 0) | (((h | 0) == 0) & ((f[n >> 2] | 0) >>> 0 > 0)))) {
                    f[e >> 2] = f[(j + 4) >> 2]
                    f[d >> 2] = f[e >> 2]
                    ye(j, d, g, (g + 1) | 0) | 0
                }
                j = dn(296) | 0
                Ni(j)
                n = f[i >> 2] | 0
                f[i >> 2] = j
                if (!n) s = j
                else {
                    Va[f[((f[n >> 2] | 0) + 4) >> 2] & 127](n)
                    r = 21
                }
            } else if ((r | 0) == 17) {
                n = f[(a + 44) >> 2] | 0
                b[g >> 0] = 2
                j = (n + 16) | 0
                h = f[(j + 4) >> 2] | 0
                if (!(((h | 0) > 0) | (((h | 0) == 0) & ((f[j >> 2] | 0) >>> 0 > 0)))) {
                    f[e >> 2] = f[(n + 4) >> 2]
                    f[d >> 2] = f[e >> 2]
                    ye(n, d, g, (g + 1) | 0) | 0
                }
                g = dn(360) | 0
                ji(g)
                d = f[i >> 2] | 0
                f[i >> 2] = g
                if (!d) s = g
                else {
                    Va[f[((f[d >> 2] | 0) + 4) >> 2] & 127](d)
                    r = 21
                }
            }
            if ((r | 0) == 21) {
                r = f[i >> 2] | 0
                if (!r) {
                    t = 0
                    u = c
                    return t | 0
                } else s = r
            }
            t = Ra[f[((f[s >> 2] | 0) + 8) >> 2] & 127](s, a) | 0
            u = c
            return t | 0
        }
        function Dd(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0
            e = (b + 12) | 0
            g = f[e >> 2] | 0
            h = (c + 4) | 0
            i = ((f[h >> 2] | 0) - g) | 0
            j = c
            f[j >> 2] = (f[c >> 2] | 0) - g
            f[(j + 4) >> 2] = i
            i = ((f[d >> 2] | 0) - g) | 0
            j = (d + 4) | 0
            k = ((f[j >> 2] | 0) - g) | 0
            g = d
            f[g >> 2] = i
            f[(g + 4) >> 2] = k
            g = f[e >> 2] | 0
            if (((((k | 0) > -1 ? k : (0 - k) | 0) + ((i | 0) > -1 ? i : (0 - i) | 0)) | 0) > (g | 0)) {
                l = f[c >> 2] | 0
                m = f[h >> 2] | 0
                if ((l | 0) > -1)
                    if ((m | 0) <= -1)
                        if ((l | 0) < 1) {
                            n = -1
                            o = -1
                        } else p = 6
                    else {
                        n = 1
                        o = 1
                    }
                else if ((m | 0) < 1) {
                    n = -1
                    o = -1
                } else p = 6
                if ((p | 0) == 6) {
                    n = (l | 0) > 0 ? 1 : -1
                    o = (m | 0) > 0 ? 1 : -1
                }
                q = X(g, n) | 0
                r = X(g, o) | 0
                g = ((l << 1) - q) | 0
                f[c >> 2] = g
                l = ((m << 1) - r) | 0
                f[h >> 2] = l
                if ((X(n, o) | 0) > -1) {
                    o = (0 - l) | 0
                    f[c >> 2] = o
                    s = (0 - g) | 0
                    t = o
                } else {
                    f[c >> 2] = l
                    s = g
                    t = l
                }
                f[c >> 2] = (((t + q) | 0) / 2) | 0
                f[h >> 2] = (((s + r) | 0) / 2) | 0
                r = f[d >> 2] | 0
                s = f[j >> 2] | 0
                if ((r | 0) > -1)
                    if ((s | 0) <= -1)
                        if ((r | 0) < 1) {
                            u = -1
                            v = -1
                        } else p = 14
                    else {
                        u = 1
                        v = 1
                    }
                else if ((s | 0) < 1) {
                    u = -1
                    v = -1
                } else p = 14
                if ((p | 0) == 14) {
                    u = (r | 0) > 0 ? 1 : -1
                    v = (s | 0) > 0 ? 1 : -1
                }
                q = f[e >> 2] | 0
                e = X(q, u) | 0
                t = X(q, v) | 0
                q = ((r << 1) - e) | 0
                f[d >> 2] = q
                r = ((s << 1) - t) | 0
                f[j >> 2] = r
                if ((X(u, v) | 0) > -1) {
                    v = (0 - r) | 0
                    f[d >> 2] = v
                    w = (0 - q) | 0
                    x = v
                } else {
                    f[d >> 2] = r
                    w = q
                    x = r
                }
                r = (((x + e) | 0) / 2) | 0
                f[d >> 2] = r
                e = (((w + t) | 0) / 2) | 0
                f[j >> 2] = e
                y = r
                z = e
            } else {
                y = i
                z = k
            }
            if (!y)
                if (!z) {
                    A = y
                    B = z
                } else p = 22
            else if (((y | 0) < 0) & ((z | 0) < 1)) {
                A = y
                B = z
            } else p = 22
            if ((p | 0) == 22) {
                if (!y) C = (z | 0) == 0 ? 0 : (z | 0) > 0 ? 3 : 1
                else C = (y | 0) > 0 ? ((z >> 31) + 2) | 0 : (z | 0) < 1 ? 0 : 3
                z = f[c >> 2] | 0
                y = f[h >> 2] | 0
                switch (C | 0) {
                    case 1: {
                        C = c
                        f[C >> 2] = y
                        f[(C + 4) >> 2] = 0 - z
                        D = f[j >> 2] | 0
                        E = (0 - (f[d >> 2] | 0)) | 0
                        break
                    }
                    case 2: {
                        C = c
                        f[C >> 2] = 0 - z
                        f[(C + 4) >> 2] = 0 - y
                        D = (0 - (f[d >> 2] | 0)) | 0
                        E = (0 - (f[j >> 2] | 0)) | 0
                        break
                    }
                    case 3: {
                        C = c
                        f[C >> 2] = 0 - y
                        f[(C + 4) >> 2] = z
                        D = (0 - (f[j >> 2] | 0)) | 0
                        E = f[d >> 2] | 0
                        break
                    }
                    default: {
                        C = c
                        f[C >> 2] = z
                        f[(C + 4) >> 2] = y
                        D = f[d >> 2] | 0
                        E = f[j >> 2] | 0
                    }
                }
                j = d
                f[j >> 2] = D
                f[(j + 4) >> 2] = E
                A = D
                B = E
            }
            E = ((f[c >> 2] | 0) - A) | 0
            f[a >> 2] = E
            A = ((f[h >> 2] | 0) - B) | 0
            B = (a + 4) | 0
            f[B >> 2] = A
            if ((E | 0) < 0) F = ((f[(b + 4) >> 2] | 0) + E) | 0
            else F = E
            f[a >> 2] = F
            if ((A | 0) >= 0) {
                G = A
                f[B >> 2] = G
                return
            }
            G = ((f[(b + 4) >> 2] | 0) + A) | 0
            f[B >> 2] = G
            return
        }
        function Ed(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0
            c = (a + 4) | 0
            if (!b) {
                e = f[a >> 2] | 0
                f[a >> 2] = 0
                if (e | 0) br(e)
                f[c >> 2] = 0
                return
            }
            if (b >>> 0 > 1073741823) {
                e = ra(8) | 0
                Wo(e, 14941)
                f[e >> 2] = 6944
                va(e | 0, 1080, 114)
            }
            e = dn(b << 2) | 0
            g = f[a >> 2] | 0
            f[a >> 2] = e
            if (g | 0) br(g)
            f[c >> 2] = b
            c = 0
            do {
                f[((f[a >> 2] | 0) + (c << 2)) >> 2] = 0
                c = (c + 1) | 0
            } while ((c | 0) != (b | 0))
            c = (a + 8) | 0
            g = f[c >> 2] | 0
            if (!g) return
            e = f[(g + 4) >> 2] | 0
            h = (b + -1) | 0
            i = ((h & b) | 0) == 0
            if (!i)
                if (e >>> 0 < b >>> 0) j = e
                else j = (e >>> 0) % (b >>> 0) | 0
            else j = e & h
            f[((f[a >> 2] | 0) + (j << 2)) >> 2] = c
            c = f[g >> 2] | 0
            if (!c) return
            else {
                k = j
                l = g
                m = c
                n = g
            }
            a: while (1) {
                b: do
                    if (i) {
                        g = l
                        c = m
                        j = n
                        while (1) {
                            e = c
                            while (1) {
                                o = f[(e + 4) >> 2] & h
                                if ((o | 0) == (k | 0)) break
                                p = ((f[a >> 2] | 0) + (o << 2)) | 0
                                if (!(f[p >> 2] | 0)) {
                                    q = e
                                    r = j
                                    s = o
                                    t = p
                                    break b
                                }
                                p = (e + 8) | 0
                                u = e
                                while (1) {
                                    v = f[u >> 2] | 0
                                    if (!v) break
                                    if ((d[p >> 1] | 0) == (d[(v + 8) >> 1] | 0)) u = v
                                    else break
                                }
                                f[j >> 2] = v
                                f[u >> 2] = f[f[((f[a >> 2] | 0) + (o << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (o << 2)) >> 2] >> 2] = e
                                p = f[g >> 2] | 0
                                if (!p) {
                                    w = 37
                                    break a
                                } else e = p
                            }
                            c = f[e >> 2] | 0
                            if (!c) {
                                w = 37
                                break a
                            } else {
                                g = e
                                j = e
                            }
                        }
                    } else {
                        j = l
                        g = m
                        c = n
                        while (1) {
                            p = g
                            while (1) {
                                x = f[(p + 4) >> 2] | 0
                                if (x >>> 0 < b >>> 0) y = x
                                else y = (x >>> 0) % (b >>> 0) | 0
                                if ((y | 0) == (k | 0)) break
                                x = ((f[a >> 2] | 0) + (y << 2)) | 0
                                if (!(f[x >> 2] | 0)) {
                                    q = p
                                    r = c
                                    s = y
                                    t = x
                                    break b
                                }
                                x = (p + 8) | 0
                                z = p
                                while (1) {
                                    A = f[z >> 2] | 0
                                    if (!A) break
                                    if ((d[x >> 1] | 0) == (d[(A + 8) >> 1] | 0)) z = A
                                    else break
                                }
                                f[c >> 2] = A
                                f[z >> 2] = f[f[((f[a >> 2] | 0) + (y << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (y << 2)) >> 2] >> 2] = p
                                x = f[j >> 2] | 0
                                if (!x) {
                                    w = 37
                                    break a
                                } else p = x
                            }
                            g = f[p >> 2] | 0
                            if (!g) {
                                w = 37
                                break a
                            } else {
                                j = p
                                c = p
                            }
                        }
                    }
                while (0)
                f[t >> 2] = r
                m = f[q >> 2] | 0
                if (!m) {
                    w = 37
                    break
                } else {
                    k = s
                    l = q
                    n = q
                }
            }
            if ((w | 0) == 37) return
        }
        function Fd(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0
            d = (a + 4) | 0
            if (!c) {
                e = f[a >> 2] | 0
                f[a >> 2] = 0
                if (e | 0) br(e)
                f[d >> 2] = 0
                return
            }
            if (c >>> 0 > 1073741823) {
                e = ra(8) | 0
                Wo(e, 14941)
                f[e >> 2] = 6944
                va(e | 0, 1080, 114)
            }
            e = dn(c << 2) | 0
            g = f[a >> 2] | 0
            f[a >> 2] = e
            if (g | 0) br(g)
            f[d >> 2] = c
            d = 0
            do {
                f[((f[a >> 2] | 0) + (d << 2)) >> 2] = 0
                d = (d + 1) | 0
            } while ((d | 0) != (c | 0))
            d = (a + 8) | 0
            g = f[d >> 2] | 0
            if (!g) return
            e = f[(g + 4) >> 2] | 0
            h = (c + -1) | 0
            i = ((h & c) | 0) == 0
            if (!i)
                if (e >>> 0 < c >>> 0) j = e
                else j = (e >>> 0) % (c >>> 0) | 0
            else j = e & h
            f[((f[a >> 2] | 0) + (j << 2)) >> 2] = d
            d = f[g >> 2] | 0
            if (!d) return
            else {
                k = j
                l = g
                m = d
                n = g
            }
            a: while (1) {
                b: do
                    if (i) {
                        g = l
                        d = m
                        j = n
                        while (1) {
                            e = d
                            while (1) {
                                o = f[(e + 4) >> 2] & h
                                if ((o | 0) == (k | 0)) break
                                p = ((f[a >> 2] | 0) + (o << 2)) | 0
                                if (!(f[p >> 2] | 0)) {
                                    q = e
                                    r = j
                                    s = o
                                    t = p
                                    break b
                                }
                                p = (e + 8) | 0
                                u = e
                                while (1) {
                                    v = f[u >> 2] | 0
                                    if (!v) break
                                    if ((b[p >> 0] | 0) == (b[(v + 8) >> 0] | 0)) u = v
                                    else break
                                }
                                f[j >> 2] = v
                                f[u >> 2] = f[f[((f[a >> 2] | 0) + (o << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (o << 2)) >> 2] >> 2] = e
                                p = f[g >> 2] | 0
                                if (!p) {
                                    w = 37
                                    break a
                                } else e = p
                            }
                            d = f[e >> 2] | 0
                            if (!d) {
                                w = 37
                                break a
                            } else {
                                g = e
                                j = e
                            }
                        }
                    } else {
                        j = l
                        g = m
                        d = n
                        while (1) {
                            p = g
                            while (1) {
                                x = f[(p + 4) >> 2] | 0
                                if (x >>> 0 < c >>> 0) y = x
                                else y = (x >>> 0) % (c >>> 0) | 0
                                if ((y | 0) == (k | 0)) break
                                x = ((f[a >> 2] | 0) + (y << 2)) | 0
                                if (!(f[x >> 2] | 0)) {
                                    q = p
                                    r = d
                                    s = y
                                    t = x
                                    break b
                                }
                                x = (p + 8) | 0
                                z = p
                                while (1) {
                                    A = f[z >> 2] | 0
                                    if (!A) break
                                    if ((b[x >> 0] | 0) == (b[(A + 8) >> 0] | 0)) z = A
                                    else break
                                }
                                f[d >> 2] = A
                                f[z >> 2] = f[f[((f[a >> 2] | 0) + (y << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (y << 2)) >> 2] >> 2] = p
                                x = f[j >> 2] | 0
                                if (!x) {
                                    w = 37
                                    break a
                                } else p = x
                            }
                            g = f[p >> 2] | 0
                            if (!g) {
                                w = 37
                                break a
                            } else {
                                j = p
                                d = p
                            }
                        }
                    }
                while (0)
                f[t >> 2] = r
                m = f[q >> 2] | 0
                if (!m) {
                    w = 37
                    break
                } else {
                    k = s
                    l = q
                    n = q
                }
            }
            if ((w | 0) == 37) return
        }
        function Gd(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 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
            g = f[c >> 2] | 0
            c = f[b >> 2] | 0
            h = (g - c) | 0
            i = (a + 8) | 0
            j = f[i >> 2] | 0
            if (h >>> 0 < 64) {
                if (j >>> 0 <= 1) {
                    k = 0
                    return k | 0
                }
                l = f[e >> 2] | 0
                m = 0
                n = 1
                while (1) {
                    o = (f[(l + (m << 2)) >> 2] | 0) >>> 0 > (f[(l + (n << 2)) >> 2] | 0) >>> 0 ? n : m
                    n = (n + 1) | 0
                    if (n >>> 0 >= j >>> 0) {
                        k = o
                        break
                    } else m = o
                }
                return k | 0
            }
            if (j) {
                j = f[(a + 1128) >> 2] | 0
                m = f[e >> 2] | 0
                e = f[(a + 1140) >> 2] | 0
                n = f[d >> 2] | 0
                d = (b + 4) | 0
                l = (b + 8) | 0
                if ((g | 0) == (c | 0)) {
                    b = 0
                    do {
                        o = (j + (b << 2)) | 0
                        f[o >> 2] = 0
                        p = ((f[a >> 2] | 0) - (f[(m + (b << 2)) >> 2] | 0)) | 0
                        f[(e + (b << 2)) >> 2] = p
                        if (p | 0) {
                            p = f[o >> 2] | 0
                            q = (h - p) | 0
                            f[o >> 2] = q >>> 0 < p >>> 0 ? p : q
                        }
                        b = (b + 1) | 0
                        q = f[i >> 2] | 0
                    } while (b >>> 0 < q >>> 0)
                    r = q
                } else {
                    b = 0
                    do {
                        q = (j + (b << 2)) | 0
                        f[q >> 2] = 0
                        p = ((f[a >> 2] | 0) - (f[(m + (b << 2)) >> 2] | 0)) | 0
                        f[(e + (b << 2)) >> 2] = p
                        if (p | 0) {
                            o = ((f[(n + (b << 2)) >> 2] | 0) + (1 << (p + -1))) | 0
                            p = f[l >> 2] | 0
                            s = f[((f[d >> 2] | 0) + 24) >> 2] | 0
                            t = c
                            u = f[q >> 2] | 0
                            do {
                                v = (s + ((X(t, p) | 0) << 2) + (b << 2)) | 0
                                u = (u + (((f[v >> 2] | 0) >>> 0 < o >>> 0) & 1)) | 0
                                f[q >> 2] = u
                                t = (t + 1) | 0
                            } while ((t | 0) != (g | 0))
                            t = (h - u) | 0
                            f[q >> 2] = t >>> 0 < u >>> 0 ? u : t
                        }
                        b = (b + 1) | 0
                        t = f[i >> 2] | 0
                    } while (b >>> 0 < t >>> 0)
                    r = t
                }
                if (r) {
                    b = f[(a + 1140) >> 2] | 0
                    i = (a + 1128) | 0
                    h = 0
                    g = 0
                    c = 0
                    while (1) {
                        if (!(f[(b + (g << 2)) >> 2] | 0)) {
                            w = h
                            x = c
                        } else {
                            d = f[((f[i >> 2] | 0) + (g << 2)) >> 2] | 0
                            l = h >>> 0 < d >>> 0
                            w = l ? d : h
                            x = l ? g : c
                        }
                        g = (g + 1) | 0
                        if (g >>> 0 >= r >>> 0) {
                            y = x
                            break
                        } else {
                            h = w
                            c = x
                        }
                    }
                } else y = 0
            } else y = 0
            x = (a + 1088) | 0
            c = (a + 1104) | 0
            w = f[c >> 2] | 0
            h = (32 - w) | 0
            if ((h | 0) < 4) {
                r = y & 15
                g = (4 - h) | 0
                f[c >> 2] = g
                h = (a + 1100) | 0
                i = f[h >> 2] | (r >>> g)
                f[h >> 2] = i
                g = (a + 1092) | 0
                b = f[g >> 2] | 0
                if ((b | 0) == (f[(a + 1096) >> 2] | 0)) Ci(x, h)
                else {
                    f[b >> 2] = i
                    f[g >> 2] = b + 4
                }
                f[h >> 2] = r << (32 - (f[c >> 2] | 0))
                k = y
                return k | 0
            }
            r = (a + 1100) | 0
            h = f[r >> 2] | ((y << 28) >>> w)
            f[r >> 2] = h
            b = (w + 4) | 0
            f[c >> 2] = b
            if ((b | 0) != 32) {
                k = y
                return k | 0
            }
            b = (a + 1092) | 0
            w = f[b >> 2] | 0
            if ((w | 0) == (f[(a + 1096) >> 2] | 0)) Ci(x, r)
            else {
                f[w >> 2] = h
                f[b >> 2] = w + 4
            }
            f[r >> 2] = 0
            f[c >> 2] = 0
            k = y
            return k | 0
        }
        function Hd(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0
            c = (a + 4) | 0
            if (!b) {
                d = f[a >> 2] | 0
                f[a >> 2] = 0
                if (d | 0) br(d)
                f[c >> 2] = 0
                return
            }
            if (b >>> 0 > 1073741823) {
                d = ra(8) | 0
                Wo(d, 14941)
                f[d >> 2] = 6944
                va(d | 0, 1080, 114)
            }
            d = dn(b << 2) | 0
            e = f[a >> 2] | 0
            f[a >> 2] = d
            if (e | 0) br(e)
            f[c >> 2] = b
            c = 0
            do {
                f[((f[a >> 2] | 0) + (c << 2)) >> 2] = 0
                c = (c + 1) | 0
            } while ((c | 0) != (b | 0))
            c = (a + 8) | 0
            e = f[c >> 2] | 0
            if (!e) return
            d = f[(e + 4) >> 2] | 0
            g = (b + -1) | 0
            h = ((g & b) | 0) == 0
            if (!h)
                if (d >>> 0 < b >>> 0) i = d
                else i = (d >>> 0) % (b >>> 0) | 0
            else i = d & g
            f[((f[a >> 2] | 0) + (i << 2)) >> 2] = c
            c = f[e >> 2] | 0
            if (!c) return
            else {
                j = i
                k = e
                l = c
                m = e
            }
            a: while (1) {
                b: do
                    if (h) {
                        e = k
                        c = l
                        i = m
                        while (1) {
                            d = c
                            while (1) {
                                n = f[(d + 4) >> 2] & g
                                if ((n | 0) == (j | 0)) break
                                o = ((f[a >> 2] | 0) + (n << 2)) | 0
                                if (!(f[o >> 2] | 0)) {
                                    p = d
                                    q = i
                                    r = n
                                    s = o
                                    break b
                                }
                                o = (d + 8) | 0
                                t = d
                                while (1) {
                                    u = f[t >> 2] | 0
                                    if (!u) break
                                    if ((f[o >> 2] | 0) == (f[(u + 8) >> 2] | 0)) t = u
                                    else break
                                }
                                f[i >> 2] = u
                                f[t >> 2] = f[f[((f[a >> 2] | 0) + (n << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (n << 2)) >> 2] >> 2] = d
                                o = f[e >> 2] | 0
                                if (!o) {
                                    v = 37
                                    break a
                                } else d = o
                            }
                            c = f[d >> 2] | 0
                            if (!c) {
                                v = 37
                                break a
                            } else {
                                e = d
                                i = d
                            }
                        }
                    } else {
                        i = k
                        e = l
                        c = m
                        while (1) {
                            o = e
                            while (1) {
                                w = f[(o + 4) >> 2] | 0
                                if (w >>> 0 < b >>> 0) x = w
                                else x = (w >>> 0) % (b >>> 0) | 0
                                if ((x | 0) == (j | 0)) break
                                w = ((f[a >> 2] | 0) + (x << 2)) | 0
                                if (!(f[w >> 2] | 0)) {
                                    p = o
                                    q = c
                                    r = x
                                    s = w
                                    break b
                                }
                                w = (o + 8) | 0
                                y = o
                                while (1) {
                                    z = f[y >> 2] | 0
                                    if (!z) break
                                    if ((f[w >> 2] | 0) == (f[(z + 8) >> 2] | 0)) y = z
                                    else break
                                }
                                f[c >> 2] = z
                                f[y >> 2] = f[f[((f[a >> 2] | 0) + (x << 2)) >> 2] >> 2]
                                f[f[((f[a >> 2] | 0) + (x << 2)) >> 2] >> 2] = o
                                w = f[i >> 2] | 0
                                if (!w) {
                                    v = 37
                                    break a
                                } else o = w
                            }
                            e = f[o >> 2] | 0
                            if (!e) {
                                v = 37
                                break a
                            } else {
                                i = o
                                c = o
                            }
                        }
                    }
                while (0)
                f[s >> 2] = q
                l = f[p >> 2] | 0
                if (!l) {
                    v = 37
                    break
                } else {
                    j = r
                    k = p
                    m = p
                }
            }
            if ((v | 0) == 37) return
        }
        function Id(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0
            d = (a + 4) | 0
            if (!c) {
                e = f[a >> 2] | 0
                f[a >> 2] = 0
                if (e | 0) br(e)
                f[d >> 2] = 0
                return
            }
            if (c >>> 0 > 1073741823) {
                e = ra(8) | 0
                Wo(e, 14941)
                f[e >> 2] = 6944
                va(e | 0, 1080, 114)
            }
            e = dn(c << 2) | 0
            g = f[a >> 2] | 0
            f[a >> 2] = e
            if (g | 0) br(g)
            f[d >> 2] = c
            d = 0
            do {
                f[((f[a >> 2] | 0) + (d << 2)) >> 2] = 0
                d = (d + 1) | 0
            } while ((d | 0) != (c | 0))
            d = (a + 8) | 0
            g = f[d >> 2] | 0
            if (!g) return
            e = f[(g + 4) >> 2] | 0
            h = (c + -1) | 0
            i = ((h & c) | 0) == 0
            if (!i)
                if (e >>> 0 < c >>> 0) j = e
                else j = (e >>> 0) % (c >>> 0) | 0
            else j = e & h
            f[((f[a >> 2] | 0) + (j << 2)) >> 2] = d
            d = f[g >> 2] | 0
            if (!d) return
            e = (a + 24) | 0
            k = j
            j = g
            l = d
            d = g
            a: while (1) {
                g = j
                m = l
                n = d
                b: while (1) {
                    o = m
                    while (1) {
                        p = f[(o + 4) >> 2] | 0
                        if (!i)
                            if (p >>> 0 < c >>> 0) q = p
                            else q = (p >>> 0) % (c >>> 0) | 0
                        else q = p & h
                        if ((q | 0) == (k | 0)) break
                        r = ((f[a >> 2] | 0) + (q << 2)) | 0
                        if (!(f[r >> 2] | 0)) break b
                        p = f[o >> 2] | 0
                        c: do
                            if (!p) s = o
                            else {
                                t = f[(o + 8) >> 2] | 0
                                u = f[e >> 2] | 0
                                v = f[(u + 8) >> 2] | 0
                                w = ((f[(u + 12) >> 2] | 0) - v) | 0
                                u = v
                                v = w >>> 2
                                if ((w | 0) > 0) {
                                    x = o
                                    y = p
                                } else {
                                    w = p
                                    while (1) {
                                        z = f[w >> 2] | 0
                                        if (!z) {
                                            s = w
                                            break c
                                        } else w = z
                                    }
                                }
                                while (1) {
                                    w = f[(y + 8) >> 2] | 0
                                    z = 0
                                    do {
                                        A = f[(u + (z << 2)) >> 2] | 0
                                        if (!(b[(A + 84) >> 0] | 0)) {
                                            B = f[(A + 68) >> 2] | 0
                                            C = f[(B + (w << 2)) >> 2] | 0
                                            D = f[(B + (t << 2)) >> 2] | 0
                                        } else {
                                            C = w
                                            D = t
                                        }
                                        z = (z + 1) | 0
                                        if ((D | 0) != (C | 0)) {
                                            s = x
                                            break c
                                        }
                                    } while ((z | 0) < (v | 0))
                                    z = f[y >> 2] | 0
                                    if (!z) {
                                        s = y
                                        break
                                    } else {
                                        w = y
                                        y = z
                                        x = w
                                    }
                                }
                            }
                        while (0)
                        f[n >> 2] = f[s >> 2]
                        f[s >> 2] = f[f[((f[a >> 2] | 0) + (q << 2)) >> 2] >> 2]
                        f[f[((f[a >> 2] | 0) + (q << 2)) >> 2] >> 2] = o
                        p = f[g >> 2] | 0
                        if (!p) {
                            E = 38
                            break a
                        } else o = p
                    }
                    m = f[o >> 2] | 0
                    if (!m) {
                        E = 38
                        break a
                    } else {
                        g = o
                        n = o
                    }
                }
                f[r >> 2] = n
                l = f[o >> 2] | 0
                if (!l) {
                    E = 38
                    break
                } else {
                    k = q
                    j = o
                    d = o
                }
            }
            if ((E | 0) == 38) return
        }
        function Jd(a, c) {
            a = a | 0
            c = c | 0
            var e = 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,
                v = 0
            e = u
            u = (u + 16) | 0
            g = (e + 4) | 0
            h = e
            i = (e + 12) | 0
            j = (e + 11) | 0
            k = (e + 10) | 0
            l = (e + 8) | 0
            m = (c + 44) | 0
            n = f[m >> 2] | 0
            o = (n + 16) | 0
            p = f[(o + 4) >> 2] | 0
            if (!(((p | 0) > 0) | (((p | 0) == 0) & ((f[o >> 2] | 0) >>> 0 > 0)))) {
                f[h >> 2] = f[(n + 4) >> 2]
                f[g >> 2] = f[h >> 2]
                ye(n, g, 14849, 14854) | 0
            }
            n = Qa[f[((f[c >> 2] | 0) + 8) >> 2] & 127](c) | 0
            b[i >> 0] = n
            b[j >> 0] = 2
            b[k >> 0] = ((n & 255) | 0) == 0 ? 3 : 2
            n = f[m >> 2] | 0
            o = (n + 16) | 0
            p = f[(o + 4) >> 2] | 0
            if (!(((p | 0) > 0) | (((p | 0) == 0) & ((f[o >> 2] | 0) >>> 0 > 0)))) {
                f[h >> 2] = f[(n + 4) >> 2]
                f[g >> 2] = f[h >> 2]
                ye(n, g, j, (j + 1) | 0) | 0
                j = f[m >> 2] | 0
                o = (j + 16) | 0
                p = f[(o + 4) >> 2] | 0
                if (!(((p | 0) > 0) | (((p | 0) == 0) & ((f[o >> 2] | 0) >>> 0 > 0)))) {
                    f[h >> 2] = f[(j + 4) >> 2]
                    f[g >> 2] = f[h >> 2]
                    ye(j, g, k, (k + 1) | 0) | 0
                    k = f[m >> 2] | 0
                    o = (k + 16) | 0
                    p = f[(o + 4) >> 2] | 0
                    if (((p | 0) > 0) | (((p | 0) == 0) & ((f[o >> 2] | 0) >>> 0 > 0))) {
                        q = h
                        r = k
                    } else {
                        f[h >> 2] = f[(k + 4) >> 2]
                        f[g >> 2] = f[h >> 2]
                        ye(k, g, i, (i + 1) | 0) | 0
                        q = h
                        r = f[m >> 2] | 0
                    }
                } else {
                    s = h
                    t = j
                    v = 6
                }
            } else {
                s = h
                t = n
                v = 6
            }
            if ((v | 0) == 6) {
                q = h
                r = t
            }
            t = Qa[f[((f[c >> 2] | 0) + 12) >> 2] & 127](c) | 0
            b[l >> 0] = t
            t = (r + 16) | 0
            q = f[(t + 4) >> 2] | 0
            if (!(((q | 0) > 0) | (((q | 0) == 0) & ((f[t >> 2] | 0) >>> 0 > 0)))) {
                f[h >> 2] = f[(r + 4) >> 2]
                f[g >> 2] = f[h >> 2]
                ye(r, g, l, (l + 1) | 0) | 0
            }
            d[l >> 1] = (f[((f[(c + 4) >> 2] | 0) + 4) >> 2] | 0) == 0 ? 0 : -32768
            c = f[m >> 2] | 0
            m = (c + 16) | 0
            r = f[(m + 4) >> 2] | 0
            if (((r | 0) > 0) | (((r | 0) == 0) & ((f[m >> 2] | 0) >>> 0 > 0))) {
                f[a >> 2] = 0
                f[(a + 4) >> 2] = 0
                f[(a + 8) >> 2] = 0
                f[(a + 12) >> 2] = 0
                u = e
                return
            }
            f[h >> 2] = f[(c + 4) >> 2]
            f[g >> 2] = f[h >> 2]
            ye(c, g, l, (l + 2) | 0) | 0
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            f[(a + 12) >> 2] = 0
            u = e
            return
        }
        function Kd(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = Oa,
                x = 0,
                y = Oa,
                z = Oa,
                A = Oa,
                B = Oa
            e = u
            u = (u + 16) | 0
            g = e
            h = (a + 4) | 0
            if ((f[h >> 2] | 0) != -1) {
                i = 0
                u = e
                return i | 0
            }
            f[h >> 2] = d
            d = b[(c + 24) >> 0] | 0
            h = (d << 24) >> 24
            j = (a + 20) | 0
            n[j >> 2] = $(0.0)
            f[g >> 2] = 0
            k = (g + 4) | 0
            f[k >> 2] = 0
            f[(g + 8) >> 2] = 0
            do
                if ((d << 24) >> 24)
                    if ((d << 24) >> 24 < 0) mq(g)
                    else {
                        l = h << 2
                        m = dn(l) | 0
                        f[g >> 2] = m
                        o = (m + (h << 2)) | 0
                        f[(g + 8) >> 2] = o
                        hj(m | 0, 0, l | 0) | 0
                        l = (m + (h << 2)) | 0
                        f[k >> 2] = l
                        p = m
                        q = l
                        r = o
                        break
                    }
                else {
                    p = 0
                    q = 0
                    r = 0
                }
            while (0)
            k = (a + 8) | 0
            g = f[k >> 2] | 0
            o = (a + 12) | 0
            if (!g) s = (a + 16) | 0
            else {
                l = f[o >> 2] | 0
                if ((l | 0) != (g | 0)) f[o >> 2] = l + (~(((l + -4 - g) | 0) >>> 2) << 2)
                br(g)
                g = (a + 16) | 0
                f[g >> 2] = 0
                f[o >> 2] = 0
                f[k >> 2] = 0
                s = g
            }
            f[k >> 2] = p
            f[o >> 2] = q
            f[s >> 2] = r
            r = h >>> 0 > 1073741823 ? -1 : h << 2
            s = _q(r) | 0
            q = _q(r) | 0
            r = (c + 48) | 0
            o = f[r >> 2] | 0
            g = (c + 40) | 0
            a = f[g >> 2] | 0
            l = f[c >> 2] | 0
            Rg(q | 0, ((f[l >> 2] | 0) + o) | 0, a | 0) | 0
            Rg(p | 0, ((f[l >> 2] | 0) + o) | 0, a | 0) | 0
            a = r
            r = f[a >> 2] | 0
            o = f[(a + 4) >> 2] | 0
            a = g
            g = f[a >> 2] | 0
            l = f[(a + 4) >> 2] | 0
            a = f[c >> 2] | 0
            Rg(s | 0, ((f[a >> 2] | 0) + r) | 0, g | 0) | 0
            p = f[(c + 80) >> 2] | 0
            a: do
                if (p >>> 0 > 1) {
                    if ((d << 24) >> 24 <= 0) {
                        c = 1
                        while (1) {
                            m = on(g | 0, l | 0, c | 0, 0) | 0
                            t = Tn(m | 0, I | 0, r | 0, o | 0) | 0
                            Rg(q | 0, ((f[a >> 2] | 0) + t) | 0, g | 0) | 0
                            c = (c + 1) | 0
                            if (c >>> 0 >= p >>> 0) break a
                        }
                    }
                    c = f[k >> 2] | 0
                    t = 1
                    do {
                        m = on(g | 0, l | 0, t | 0, 0) | 0
                        v = Tn(m | 0, I | 0, r | 0, o | 0) | 0
                        Rg(q | 0, ((f[a >> 2] | 0) + v) | 0, g | 0) | 0
                        v = 0
                        do {
                            m = (c + (v << 2)) | 0
                            w = $(n[m >> 2])
                            x = (q + (v << 2)) | 0
                            y = $(n[x >> 2])
                            if (w > y) {
                                n[m >> 2] = y
                                z = $(n[x >> 2])
                            } else z = y
                            x = (s + (v << 2)) | 0
                            if ($(n[x >> 2]) < z) n[x >> 2] = z
                            v = (v + 1) | 0
                        } while ((v | 0) != (h | 0))
                        t = (t + 1) | 0
                    } while (t >>> 0 < p >>> 0)
                }
            while (0)
            if ((d << 24) >> 24 > 0) {
                d = f[k >> 2] | 0
                k = 0
                z = $(n[j >> 2])
                while (1) {
                    y = $(n[(s + (k << 2)) >> 2])
                    w = $(y - $(n[(d + (k << 2)) >> 2]))
                    if (w > z) {
                        n[j >> 2] = w
                        A = w
                    } else A = z
                    k = (k + 1) | 0
                    if ((k | 0) == (h | 0)) {
                        B = A
                        break
                    } else z = A
                }
            } else B = $(n[j >> 2])
            if (B == $(0.0)) n[j >> 2] = $(1.0)
            $q(q)
            $q(s)
            i = 1
            u = e
            return i | 0
        }
        function Ld(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                E = 0,
                F = 0,
                G = 0
            g = (a + 8) | 0
            Ah(g, b, d, e)
            h = (d - e) | 0
            if ((h | 0) > 0) {
                d = (0 - e) | 0
                i = (a + 16) | 0
                j = (a + 32) | 0
                k = (a + 12) | 0
                l = (a + 28) | 0
                m = (a + 20) | 0
                n = (a + 24) | 0
                o = h
                h = f[g >> 2] | 0
                while (1) {
                    p = (b + (o << 2)) | 0
                    q = (c + (o << 2)) | 0
                    if ((h | 0) > 0) {
                        r = 0
                        s = (p + (d << 2)) | 0
                        t = h
                        while (1) {
                            if ((t | 0) > 0) {
                                u = 0
                                do {
                                    v = f[(s + (u << 2)) >> 2] | 0
                                    w = f[i >> 2] | 0
                                    if ((v | 0) > (w | 0)) {
                                        x = f[j >> 2] | 0
                                        f[(x + (u << 2)) >> 2] = w
                                        y = x
                                    } else {
                                        x = f[k >> 2] | 0
                                        w = f[j >> 2] | 0
                                        f[(w + (u << 2)) >> 2] = (v | 0) < (x | 0) ? x : v
                                        y = w
                                    }
                                    u = (u + 1) | 0
                                } while ((u | 0) < (f[g >> 2] | 0))
                                z = y
                            } else z = f[j >> 2] | 0
                            u = ((f[(p + (r << 2)) >> 2] | 0) - (f[(z + (r << 2)) >> 2] | 0)) | 0
                            w = (q + (r << 2)) | 0
                            f[w >> 2] = u
                            if ((u | 0) >= (f[l >> 2] | 0)) {
                                if ((u | 0) > (f[n >> 2] | 0)) {
                                    A = (u - (f[m >> 2] | 0)) | 0
                                    B = 31
                                }
                            } else {
                                A = ((f[m >> 2] | 0) + u) | 0
                                B = 31
                            }
                            if ((B | 0) == 31) {
                                B = 0
                                f[w >> 2] = A
                            }
                            r = (r + 1) | 0
                            w = f[g >> 2] | 0
                            if ((r | 0) >= (w | 0)) {
                                C = w
                                break
                            } else {
                                s = z
                                t = w
                            }
                        }
                    } else C = h
                    o = (o - e) | 0
                    if ((o | 0) <= 0) {
                        D = C
                        break
                    } else h = C
                }
            } else D = f[g >> 2] | 0
            C = e >>> 0 > 1073741823 ? -1 : e << 2
            e = _q(C) | 0
            hj(e | 0, 0, C | 0) | 0
            if ((D | 0) <= 0) {
                $q(e)
                return 1
            }
            C = (a + 16) | 0
            h = (a + 32) | 0
            o = (a + 12) | 0
            z = (a + 28) | 0
            A = (a + 20) | 0
            m = (a + 24) | 0
            a = 0
            n = e
            l = D
            while (1) {
                if ((l | 0) > 0) {
                    D = 0
                    do {
                        j = f[(n + (D << 2)) >> 2] | 0
                        y = f[C >> 2] | 0
                        if ((j | 0) > (y | 0)) {
                            k = f[h >> 2] | 0
                            f[(k + (D << 2)) >> 2] = y
                            E = k
                        } else {
                            k = f[o >> 2] | 0
                            y = f[h >> 2] | 0
                            f[(y + (D << 2)) >> 2] = (j | 0) < (k | 0) ? k : j
                            E = y
                        }
                        D = (D + 1) | 0
                    } while ((D | 0) < (f[g >> 2] | 0))
                    F = E
                } else F = f[h >> 2] | 0
                D = ((f[(b + (a << 2)) >> 2] | 0) - (f[(F + (a << 2)) >> 2] | 0)) | 0
                y = (c + (a << 2)) | 0
                f[y >> 2] = D
                if ((D | 0) >= (f[z >> 2] | 0)) {
                    if ((D | 0) > (f[m >> 2] | 0)) {
                        G = (D - (f[A >> 2] | 0)) | 0
                        B = 16
                    }
                } else {
                    G = ((f[A >> 2] | 0) + D) | 0
                    B = 16
                }
                if ((B | 0) == 16) {
                    B = 0
                    f[y >> 2] = G
                }
                a = (a + 1) | 0
                l = f[g >> 2] | 0
                if ((a | 0) >= (l | 0)) break
                else n = F
            }
            $q(e)
            return 1
        }
        function Md(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0
            e = f[a >> 2] | 0
            g = e
            h = ((f[b >> 2] | 0) - g) | 0
            b = (e + ((h >> 2) << 2)) | 0
            i = f[c >> 2] | 0
            c = f[d >> 2] | 0
            d = (c - i) | 0
            j = d >> 2
            k = i
            l = c
            if ((d | 0) <= 0) {
                m = b
                return m | 0
            }
            d = (a + 8) | 0
            n = f[d >> 2] | 0
            o = (a + 4) | 0
            p = f[o >> 2] | 0
            q = p
            if ((j | 0) <= (((n - q) >> 2) | 0)) {
                r = b
                s = (q - r) | 0
                t = s >> 2
                if ((j | 0) > (t | 0)) {
                    u = (k + (t << 2)) | 0
                    t = u
                    if ((u | 0) == (l | 0)) v = p
                    else {
                        w = (l + -4 - t) | 0
                        x = u
                        u = p
                        while (1) {
                            f[u >> 2] = f[x >> 2]
                            x = (x + 4) | 0
                            if ((x | 0) == (l | 0)) break
                            else u = (u + 4) | 0
                        }
                        u = (p + (((w >>> 2) + 1) << 2)) | 0
                        f[o >> 2] = u
                        v = u
                    }
                    if ((s | 0) > 0) {
                        y = t
                        z = v
                    } else {
                        m = b
                        return m | 0
                    }
                } else {
                    y = c
                    z = p
                }
                c = (z - (b + (j << 2))) >> 2
                v = (b + (c << 2)) | 0
                if (v >>> 0 < p >>> 0) {
                    t = ((p + ((0 - c) << 2) + ~r) | 0) >>> 2
                    r = v
                    s = z
                    while (1) {
                        f[s >> 2] = f[r >> 2]
                        r = (r + 4) | 0
                        if (r >>> 0 >= p >>> 0) break
                        else s = (s + 4) | 0
                    }
                    f[o >> 2] = z + ((t + 1) << 2)
                }
                if (c | 0) {
                    c = v
                    v = z
                    do {
                        c = (c + -4) | 0
                        v = (v + -4) | 0
                        f[v >> 2] = f[c >> 2]
                    } while ((c | 0) != (b | 0))
                }
                c = y
                if ((k | 0) == (c | 0)) {
                    m = b
                    return m | 0
                } else {
                    A = b
                    B = k
                }
                while (1) {
                    f[A >> 2] = f[B >> 2]
                    B = (B + 4) | 0
                    if ((B | 0) == (c | 0)) {
                        m = b
                        break
                    } else A = (A + 4) | 0
                }
                return m | 0
            }
            A = (((q - g) >> 2) + j) | 0
            if (A >>> 0 > 1073741823) mq(a)
            j = (n - g) | 0
            g = j >> 1
            n = (j >> 2) >>> 0 < 536870911 ? (g >>> 0 < A >>> 0 ? A : g) : 1073741823
            g = b
            A = h >> 2
            do
                if (n)
                    if (n >>> 0 > 1073741823) {
                        j = ra(8) | 0
                        Wo(j, 14941)
                        f[j >> 2] = 6944
                        va(j | 0, 1080, 114)
                    } else {
                        j = dn(n << 2) | 0
                        C = j
                        D = j
                        break
                    }
                else {
                    C = 0
                    D = 0
                }
            while (0)
            j = (D + (A << 2)) | 0
            A = (D + (n << 2)) | 0
            if ((l | 0) == (k | 0)) E = j
            else {
                n = ((((l + -4 - i) | 0) >>> 2) + 1) | 0
                i = k
                k = j
                while (1) {
                    f[k >> 2] = f[i >> 2]
                    i = (i + 4) | 0
                    if ((i | 0) == (l | 0)) break
                    else k = (k + 4) | 0
                }
                E = (j + (n << 2)) | 0
            }
            if ((h | 0) > 0) Rg(C | 0, e | 0, h | 0) | 0
            h = (q - g) | 0
            if ((h | 0) > 0) {
                Rg(E | 0, b | 0, h | 0) | 0
                F = (E + ((h >>> 2) << 2)) | 0
            } else F = E
            f[a >> 2] = D
            f[o >> 2] = F
            f[d >> 2] = A
            if (!e) {
                m = j
                return m | 0
            }
            br(e)
            m = j
            return m | 0
        }
        function Nd(a, b, c, d, e, g, h) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            h = h | 0
            var i = 0
            switch (c | 0) {
                case 1: {
                    c = dn(60) | 0
                    f[c >> 2] = 1528
                    f[(c + 4) >> 2] = d
                    h = (c + 8) | 0
                    f[h >> 2] = f[e >> 2]
                    f[(h + 4) >> 2] = f[(e + 4) >> 2]
                    f[(h + 8) >> 2] = f[(e + 8) >> 2]
                    f[(h + 12) >> 2] = f[(e + 12) >> 2]
                    f[(h + 16) >> 2] = f[(e + 16) >> 2]
                    f[(h + 20) >> 2] = f[(e + 20) >> 2]
                    _j((c + 32) | 0, (e + 24) | 0)
                    h = (c + 44) | 0
                    f[h >> 2] = f[g >> 2]
                    f[(h + 4) >> 2] = f[(g + 4) >> 2]
                    f[(h + 8) >> 2] = f[(g + 8) >> 2]
                    f[(h + 12) >> 2] = f[(g + 12) >> 2]
                    f[c >> 2] = 1948
                    i = c
                    f[a >> 2] = i
                    return
                }
                case 4: {
                    c = dn(168) | 0
                    Ei(c, d, e, g)
                    i = c
                    f[a >> 2] = i
                    return
                }
                case 5: {
                    c = dn(104) | 0
                    f[c >> 2] = 1528
                    f[(c + 4) >> 2] = d
                    h = (c + 8) | 0
                    f[h >> 2] = f[e >> 2]
                    f[(h + 4) >> 2] = f[(e + 4) >> 2]
                    f[(h + 8) >> 2] = f[(e + 8) >> 2]
                    f[(h + 12) >> 2] = f[(e + 12) >> 2]
                    f[(h + 16) >> 2] = f[(e + 16) >> 2]
                    f[(h + 20) >> 2] = f[(e + 20) >> 2]
                    _j((c + 32) | 0, (e + 24) | 0)
                    h = (c + 44) | 0
                    f[h >> 2] = f[g >> 2]
                    f[(h + 4) >> 2] = f[(g + 4) >> 2]
                    f[(h + 8) >> 2] = f[(g + 8) >> 2]
                    f[(h + 12) >> 2] = f[(g + 12) >> 2]
                    f[c >> 2] = 2004
                    f[(c + 60) >> 2] = 0
                    f[(c + 64) >> 2] = 0
                    f[(c + 76) >> 2] = 0
                    f[(c + 80) >> 2] = 0
                    f[(c + 84) >> 2] = 0
                    h = (c + 88) | 0
                    f[h >> 2] = f[g >> 2]
                    f[(h + 4) >> 2] = f[(g + 4) >> 2]
                    f[(h + 8) >> 2] = f[(g + 8) >> 2]
                    f[(h + 12) >> 2] = f[(g + 12) >> 2]
                    i = c
                    f[a >> 2] = i
                    return
                }
                case 6: {
                    c = dn(140) | 0
                    f[c >> 2] = 1528
                    f[(c + 4) >> 2] = d
                    d = (c + 8) | 0
                    f[d >> 2] = f[e >> 2]
                    f[(d + 4) >> 2] = f[(e + 4) >> 2]
                    f[(d + 8) >> 2] = f[(e + 8) >> 2]
                    f[(d + 12) >> 2] = f[(e + 12) >> 2]
                    f[(d + 16) >> 2] = f[(e + 16) >> 2]
                    f[(d + 20) >> 2] = f[(e + 20) >> 2]
                    _j((c + 32) | 0, (e + 24) | 0)
                    e = (c + 44) | 0
                    f[e >> 2] = f[g >> 2]
                    f[(e + 4) >> 2] = f[(g + 4) >> 2]
                    f[(e + 8) >> 2] = f[(g + 8) >> 2]
                    f[(e + 12) >> 2] = f[(g + 12) >> 2]
                    f[c >> 2] = 2060
                    f[(c + 64) >> 2] = 0
                    f[(c + 68) >> 2] = 0
                    e = (c + 72) | 0
                    f[e >> 2] = f[g >> 2]
                    f[(e + 4) >> 2] = f[(g + 4) >> 2]
                    f[(e + 8) >> 2] = f[(g + 8) >> 2]
                    f[(e + 12) >> 2] = f[(g + 12) >> 2]
                    f[(c + 60) >> 2] = 2116
                    f[(c + 88) >> 2] = 1
                    g = (c + 92) | 0
                    f[g >> 2] = -1
                    f[(g + 4) >> 2] = -1
                    f[(g + 8) >> 2] = -1
                    f[(g + 12) >> 2] = -1
                    rn((c + 108) | 0)
                    i = c
                    f[a >> 2] = i
                    return
                }
                default: {
                    i = 0
                    f[a >> 2] = i
                    return
                }
            }
        }
        function Od(a, b, c, d, e, g, h) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            h = h | 0
            var i = 0
            switch (c | 0) {
                case 1: {
                    c = dn(60) | 0
                    f[c >> 2] = 1528
                    f[(c + 4) >> 2] = d
                    h = (c + 8) | 0
                    f[h >> 2] = f[e >> 2]
                    f[(h + 4) >> 2] = f[(e + 4) >> 2]
                    f[(h + 8) >> 2] = f[(e + 8) >> 2]
                    f[(h + 12) >> 2] = f[(e + 12) >> 2]
                    f[(h + 16) >> 2] = f[(e + 16) >> 2]
                    f[(h + 20) >> 2] = f[(e + 20) >> 2]
                    _j((c + 32) | 0, (e + 24) | 0)
                    h = (c + 44) | 0
                    f[h >> 2] = f[g >> 2]
                    f[(h + 4) >> 2] = f[(g + 4) >> 2]
                    f[(h + 8) >> 2] = f[(g + 8) >> 2]
                    f[(h + 12) >> 2] = f[(g + 12) >> 2]
                    f[c >> 2] = 1640
                    i = c
                    f[a >> 2] = i
                    return
                }
                case 4: {
                    c = dn(168) | 0
                    Hi(c, d, e, g)
                    i = c
                    f[a >> 2] = i
                    return
                }
                case 5: {
                    c = dn(104) | 0
                    f[c >> 2] = 1528
                    f[(c + 4) >> 2] = d
                    h = (c + 8) | 0
                    f[h >> 2] = f[e >> 2]
                    f[(h + 4) >> 2] = f[(e + 4) >> 2]
                    f[(h + 8) >> 2] = f[(e + 8) >> 2]
                    f[(h + 12) >> 2] = f[(e + 12) >> 2]
                    f[(h + 16) >> 2] = f[(e + 16) >> 2]
                    f[(h + 20) >> 2] = f[(e + 20) >> 2]
                    _j((c + 32) | 0, (e + 24) | 0)
                    h = (c + 44) | 0
                    f[h >> 2] = f[g >> 2]
                    f[(h + 4) >> 2] = f[(g + 4) >> 2]
                    f[(h + 8) >> 2] = f[(g + 8) >> 2]
                    f[(h + 12) >> 2] = f[(g + 12) >> 2]
                    f[c >> 2] = 1696
                    f[(c + 60) >> 2] = 0
                    f[(c + 64) >> 2] = 0
                    f[(c + 76) >> 2] = 0
                    f[(c + 80) >> 2] = 0
                    f[(c + 84) >> 2] = 0
                    h = (c + 88) | 0
                    f[h >> 2] = f[g >> 2]
                    f[(h + 4) >> 2] = f[(g + 4) >> 2]
                    f[(h + 8) >> 2] = f[(g + 8) >> 2]
                    f[(h + 12) >> 2] = f[(g + 12) >> 2]
                    i = c
                    f[a >> 2] = i
                    return
                }
                case 6: {
                    c = dn(140) | 0
                    f[c >> 2] = 1528
                    f[(c + 4) >> 2] = d
                    d = (c + 8) | 0
                    f[d >> 2] = f[e >> 2]
                    f[(d + 4) >> 2] = f[(e + 4) >> 2]
                    f[(d + 8) >> 2] = f[(e + 8) >> 2]
                    f[(d + 12) >> 2] = f[(e + 12) >> 2]
                    f[(d + 16) >> 2] = f[(e + 16) >> 2]
                    f[(d + 20) >> 2] = f[(e + 20) >> 2]
                    _j((c + 32) | 0, (e + 24) | 0)
                    e = (c + 44) | 0
                    f[e >> 2] = f[g >> 2]
                    f[(e + 4) >> 2] = f[(g + 4) >> 2]
                    f[(e + 8) >> 2] = f[(g + 8) >> 2]
                    f[(e + 12) >> 2] = f[(g + 12) >> 2]
                    f[c >> 2] = 1752
                    f[(c + 64) >> 2] = 0
                    f[(c + 68) >> 2] = 0
                    e = (c + 72) | 0
                    f[e >> 2] = f[g >> 2]
                    f[(e + 4) >> 2] = f[(g + 4) >> 2]
                    f[(e + 8) >> 2] = f[(g + 8) >> 2]
                    f[(e + 12) >> 2] = f[(g + 12) >> 2]
                    f[(c + 60) >> 2] = 1808
                    f[(c + 88) >> 2] = 1
                    g = (c + 92) | 0
                    f[g >> 2] = -1
                    f[(g + 4) >> 2] = -1
                    f[(g + 8) >> 2] = -1
                    f[(g + 12) >> 2] = -1
                    rn((c + 108) | 0)
                    i = c
                    f[a >> 2] = i
                    return
                }
                default: {
                    i = 0
                    f[a >> 2] = i
                    return
                }
            }
        }
        function Pd(a, b, c, d, e, g, h) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            h = h | 0
            var i = 0,
                j = 0
            switch (c | 0) {
                case 1: {
                    c = dn(40) | 0
                    f[(c + 4) >> 2] = d
                    h = (c + 8) | 0
                    f[h >> 2] = f[e >> 2]
                    f[(h + 4) >> 2] = f[(e + 4) >> 2]
                    f[(h + 8) >> 2] = f[(e + 8) >> 2]
                    f[(h + 12) >> 2] = f[(e + 12) >> 2]
                    h = (c + 24) | 0
                    f[h >> 2] = f[g >> 2]
                    f[(h + 4) >> 2] = f[(g + 4) >> 2]
                    f[(h + 8) >> 2] = f[(g + 8) >> 2]
                    f[(h + 12) >> 2] = f[(g + 12) >> 2]
                    f[c >> 2] = 2628
                    i = c
                    f[a >> 2] = i
                    return
                }
                case 4: {
                    c = dn(152) | 0
                    f[(c + 4) >> 2] = d
                    h = (c + 8) | 0
                    f[h >> 2] = f[e >> 2]
                    f[(h + 4) >> 2] = f[(e + 4) >> 2]
                    f[(h + 8) >> 2] = f[(e + 8) >> 2]
                    f[(h + 12) >> 2] = f[(e + 12) >> 2]
                    h = (c + 24) | 0
                    f[h >> 2] = f[g >> 2]
                    f[(h + 4) >> 2] = f[(g + 4) >> 2]
                    f[(h + 8) >> 2] = f[(g + 8) >> 2]
                    f[(h + 12) >> 2] = f[(g + 12) >> 2]
                    f[c >> 2] = 2684
                    h = (c + 96) | 0
                    b = (c + 40) | 0
                    j = (b + 52) | 0
                    do {
                        f[b >> 2] = 0
                        b = (b + 4) | 0
                    } while ((b | 0) < (j | 0))
                    Sm(h)
                    f[(c + 136) >> 2] = 0
                    f[(c + 140) >> 2] = 0
                    f[(c + 144) >> 2] = 0
                    i = c
                    f[a >> 2] = i
                    return
                }
                case 5: {
                    c = dn(84) | 0
                    f[(c + 4) >> 2] = d
                    h = (c + 8) | 0
                    f[h >> 2] = f[e >> 2]
                    f[(h + 4) >> 2] = f[(e + 4) >> 2]
                    f[(h + 8) >> 2] = f[(e + 8) >> 2]
                    f[(h + 12) >> 2] = f[(e + 12) >> 2]
                    h = (c + 24) | 0
                    f[h >> 2] = f[g >> 2]
                    f[(h + 4) >> 2] = f[(g + 4) >> 2]
                    f[(h + 8) >> 2] = f[(g + 8) >> 2]
                    f[(h + 12) >> 2] = f[(g + 12) >> 2]
                    f[c >> 2] = 2740
                    f[(c + 40) >> 2] = 0
                    f[(c + 44) >> 2] = 0
                    f[(c + 56) >> 2] = 0
                    f[(c + 60) >> 2] = 0
                    f[(c + 64) >> 2] = 0
                    h = (c + 68) | 0
                    f[h >> 2] = f[g >> 2]
                    f[(h + 4) >> 2] = f[(g + 4) >> 2]
                    f[(h + 8) >> 2] = f[(g + 8) >> 2]
                    f[(h + 12) >> 2] = f[(g + 12) >> 2]
                    i = c
                    f[a >> 2] = i
                    return
                }
                case 6: {
                    c = dn(120) | 0
                    f[(c + 4) >> 2] = d
                    d = (c + 8) | 0
                    f[d >> 2] = f[e >> 2]
                    f[(d + 4) >> 2] = f[(e + 4) >> 2]
                    f[(d + 8) >> 2] = f[(e + 8) >> 2]
                    f[(d + 12) >> 2] = f[(e + 12) >> 2]
                    e = (c + 24) | 0
                    f[e >> 2] = f[g >> 2]
                    f[(e + 4) >> 2] = f[(g + 4) >> 2]
                    f[(e + 8) >> 2] = f[(g + 8) >> 2]
                    f[(e + 12) >> 2] = f[(g + 12) >> 2]
                    f[c >> 2] = 2796
                    f[(c + 44) >> 2] = 0
                    f[(c + 48) >> 2] = 0
                    e = (c + 52) | 0
                    f[e >> 2] = f[g >> 2]
                    f[(e + 4) >> 2] = f[(g + 4) >> 2]
                    f[(e + 8) >> 2] = f[(g + 8) >> 2]
                    f[(e + 12) >> 2] = f[(g + 12) >> 2]
                    f[(c + 40) >> 2] = 2852
                    f[(c + 68) >> 2] = 1
                    g = (c + 72) | 0
                    f[g >> 2] = -1
                    f[(g + 4) >> 2] = -1
                    f[(g + 8) >> 2] = -1
                    f[(g + 12) >> 2] = -1
                    rn((c + 88) | 0)
                    i = c
                    f[a >> 2] = i
                    return
                }
                default: {
                    i = 0
                    f[a >> 2] = i
                    return
                }
            }
        }
        function Qd(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0
            switch (((b - a) >> 2) | 0) {
                case 2: {
                    d = (b + -4) | 0
                    e = f[d >> 2] | 0
                    g = f[a >> 2] | 0
                    h = f[c >> 2] | 0
                    i = f[h >> 2] | 0
                    j = ((f[(h + 4) >> 2] | 0) - i) >> 3
                    if (j >>> 0 <= e >>> 0) mq(h)
                    k = i
                    if (j >>> 0 <= g >>> 0) mq(h)
                    if ((f[(k + (e << 3)) >> 2] | 0) >>> 0 >= (f[(k + (g << 3)) >> 2] | 0) >>> 0) {
                        l = 1
                        return l | 0
                    }
                    f[a >> 2] = e
                    f[d >> 2] = g
                    l = 1
                    return l | 0
                }
                case 3: {
                    Cg(a, (a + 4) | 0, (b + -4) | 0, c) | 0
                    l = 1
                    return l | 0
                }
                case 4: {
                    Qg(a, (a + 4) | 0, (a + 8) | 0, (b + -4) | 0, c) | 0
                    l = 1
                    return l | 0
                }
                case 5: {
                    Tf(a, (a + 4) | 0, (a + 8) | 0, (a + 12) | 0, (b + -4) | 0, c) | 0
                    l = 1
                    return l | 0
                }
                case 1:
                case 0: {
                    l = 1
                    return l | 0
                }
                default: {
                    g = (a + 8) | 0
                    Cg(a, (a + 4) | 0, g, c) | 0
                    d = (a + 12) | 0
                    a: do
                        if ((d | 0) != (b | 0)) {
                            e = f[c >> 2] | 0
                            k = f[e >> 2] | 0
                            h = ((f[(e + 4) >> 2] | 0) - k) >> 3
                            j = k
                            k = d
                            i = 0
                            m = g
                            b: while (1) {
                                n = f[k >> 2] | 0
                                o = f[m >> 2] | 0
                                if (h >>> 0 <= n >>> 0) {
                                    p = 14
                                    break
                                }
                                if (h >>> 0 <= o >>> 0) {
                                    p = 16
                                    break
                                }
                                q = (j + (n << 3)) | 0
                                if ((f[q >> 2] | 0) >>> 0 < (f[(j + (o << 3)) >> 2] | 0) >>> 0) {
                                    r = m
                                    s = k
                                    t = o
                                    while (1) {
                                        f[s >> 2] = t
                                        if ((r | 0) == (a | 0)) {
                                            u = a
                                            break
                                        }
                                        o = (r + -4) | 0
                                        t = f[o >> 2] | 0
                                        if (h >>> 0 <= t >>> 0) {
                                            p = 20
                                            break b
                                        }
                                        if ((f[q >> 2] | 0) >>> 0 >= (f[(j + (t << 3)) >> 2] | 0) >>> 0) {
                                            u = r
                                            break
                                        } else {
                                            v = r
                                            r = o
                                            s = v
                                        }
                                    }
                                    f[u >> 2] = n
                                    s = (i + 1) | 0
                                    if ((s | 0) == 8) {
                                        w = 0
                                        x = ((k + 4) | 0) == (b | 0)
                                        break a
                                    } else y = s
                                } else y = i
                                s = (k + 4) | 0
                                if ((s | 0) == (b | 0)) {
                                    w = 1
                                    x = 0
                                    break a
                                } else {
                                    r = k
                                    k = s
                                    i = y
                                    m = r
                                }
                            }
                            if ((p | 0) == 14) mq(e)
                            else if ((p | 0) == 16) mq(e)
                            else if ((p | 0) == 20) mq(e)
                        } else {
                            w = 1
                            x = 0
                        }
                    while (0)
                    l = x | w
                    return l | 0
                }
            }
            return 0
        }
        function Rd(a, b, c, d, e, g, h) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            h = h | 0
            var i = 0,
                j = 0
            switch (c | 0) {
                case 1: {
                    c = dn(40) | 0
                    f[(c + 4) >> 2] = d
                    h = (c + 8) | 0
                    f[h >> 2] = f[e >> 2]
                    f[(h + 4) >> 2] = f[(e + 4) >> 2]
                    f[(h + 8) >> 2] = f[(e + 8) >> 2]
                    f[(h + 12) >> 2] = f[(e + 12) >> 2]
                    h = (c + 24) | 0
                    f[h >> 2] = f[g >> 2]
                    f[(h + 4) >> 2] = f[(g + 4) >> 2]
                    f[(h + 8) >> 2] = f[(g + 8) >> 2]
                    f[(h + 12) >> 2] = f[(g + 12) >> 2]
                    f[c >> 2] = 2376
                    i = c
                    f[a >> 2] = i
                    return
                }
                case 4: {
                    c = dn(152) | 0
                    f[(c + 4) >> 2] = d
                    h = (c + 8) | 0
                    f[h >> 2] = f[e >> 2]
                    f[(h + 4) >> 2] = f[(e + 4) >> 2]
                    f[(h + 8) >> 2] = f[(e + 8) >> 2]
                    f[(h + 12) >> 2] = f[(e + 12) >> 2]
                    h = (c + 24) | 0
                    f[h >> 2] = f[g >> 2]
                    f[(h + 4) >> 2] = f[(g + 4) >> 2]
                    f[(h + 8) >> 2] = f[(g + 8) >> 2]
                    f[(h + 12) >> 2] = f[(g + 12) >> 2]
                    f[c >> 2] = 2432
                    h = (c + 96) | 0
                    b = (c + 40) | 0
                    j = (b + 52) | 0
                    do {
                        f[b >> 2] = 0
                        b = (b + 4) | 0
                    } while ((b | 0) < (j | 0))
                    Sm(h)
                    f[(c + 136) >> 2] = 0
                    f[(c + 140) >> 2] = 0
                    f[(c + 144) >> 2] = 0
                    i = c
                    f[a >> 2] = i
                    return
                }
                case 5: {
                    c = dn(84) | 0
                    f[(c + 4) >> 2] = d
                    h = (c + 8) | 0
                    f[h >> 2] = f[e >> 2]
                    f[(h + 4) >> 2] = f[(e + 4) >> 2]
                    f[(h + 8) >> 2] = f[(e + 8) >> 2]
                    f[(h + 12) >> 2] = f[(e + 12) >> 2]
                    h = (c + 24) | 0
                    f[h >> 2] = f[g >> 2]
                    f[(h + 4) >> 2] = f[(g + 4) >> 2]
                    f[(h + 8) >> 2] = f[(g + 8) >> 2]
                    f[(h + 12) >> 2] = f[(g + 12) >> 2]
                    f[c >> 2] = 2488
                    f[(c + 40) >> 2] = 0
                    f[(c + 44) >> 2] = 0
                    f[(c + 56) >> 2] = 0
                    f[(c + 60) >> 2] = 0
                    f[(c + 64) >> 2] = 0
                    h = (c + 68) | 0
                    f[h >> 2] = f[g >> 2]
                    f[(h + 4) >> 2] = f[(g + 4) >> 2]
                    f[(h + 8) >> 2] = f[(g + 8) >> 2]
                    f[(h + 12) >> 2] = f[(g + 12) >> 2]
                    i = c
                    f[a >> 2] = i
                    return
                }
                case 6: {
                    c = dn(120) | 0
                    f[(c + 4) >> 2] = d
                    d = (c + 8) | 0
                    f[d >> 2] = f[e >> 2]
                    f[(d + 4) >> 2] = f[(e + 4) >> 2]
                    f[(d + 8) >> 2] = f[(e + 8) >> 2]
                    f[(d + 12) >> 2] = f[(e + 12) >> 2]
                    e = (c + 24) | 0
                    f[e >> 2] = f[g >> 2]
                    f[(e + 4) >> 2] = f[(g + 4) >> 2]
                    f[(e + 8) >> 2] = f[(g + 8) >> 2]
                    f[(e + 12) >> 2] = f[(g + 12) >> 2]
                    f[c >> 2] = 2544
                    f[(c + 44) >> 2] = 0
                    f[(c + 48) >> 2] = 0
                    e = (c + 52) | 0
                    f[e >> 2] = f[g >> 2]
                    f[(e + 4) >> 2] = f[(g + 4) >> 2]
                    f[(e + 8) >> 2] = f[(g + 8) >> 2]
                    f[(e + 12) >> 2] = f[(g + 12) >> 2]
                    f[(c + 40) >> 2] = 2600
                    f[(c + 68) >> 2] = 1
                    g = (c + 72) | 0
                    f[g >> 2] = -1
                    f[(g + 4) >> 2] = -1
                    f[(g + 8) >> 2] = -1
                    f[(g + 12) >> 2] = -1
                    rn((c + 88) | 0)
                    i = c
                    f[a >> 2] = i
                    return
                }
                default: {
                    i = 0
                    f[a >> 2] = i
                    return
                }
            }
        }
        function Sd(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = Oa,
                t = Oa,
                u = Oa,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0
            c = f[b >> 2] | 0
            b = (a + 4) | 0
            d = f[b >> 2] | 0
            e = (d | 0) == 0
            a: do
                if (!e) {
                    g = (d + -1) | 0
                    h = ((g & d) | 0) == 0
                    if (!h)
                        if (c >>> 0 < d >>> 0) i = c
                        else i = (c >>> 0) % (d >>> 0) | 0
                    else i = g & c
                    j = f[((f[a >> 2] | 0) + (i << 2)) >> 2] | 0
                    if (!j) k = i
                    else {
                        if (h) {
                            h = j
                            while (1) {
                                l = f[h >> 2] | 0
                                if (!l) {
                                    k = i
                                    break a
                                }
                                m = f[(l + 4) >> 2] | 0
                                if (!(((m | 0) == (c | 0)) | (((m & g) | 0) == (i | 0)))) {
                                    k = i
                                    break a
                                }
                                if ((f[(l + 8) >> 2] | 0) == (c | 0)) {
                                    o = l
                                    break
                                } else h = l
                            }
                            p = (o + 12) | 0
                            return p | 0
                        } else q = j
                        while (1) {
                            h = f[q >> 2] | 0
                            if (!h) {
                                k = i
                                break a
                            }
                            g = f[(h + 4) >> 2] | 0
                            if ((g | 0) != (c | 0)) {
                                if (g >>> 0 < d >>> 0) r = g
                                else r = (g >>> 0) % (d >>> 0) | 0
                                if ((r | 0) != (i | 0)) {
                                    k = i
                                    break a
                                }
                            }
                            if ((f[(h + 8) >> 2] | 0) == (c | 0)) {
                                o = h
                                break
                            } else q = h
                        }
                        p = (o + 12) | 0
                        return p | 0
                    }
                } else k = 0
            while (0)
            q = dn(16) | 0
            f[(q + 8) >> 2] = c
            f[(q + 12) >> 2] = 0
            f[(q + 4) >> 2] = c
            f[q >> 2] = 0
            i = (a + 12) | 0
            s = $((((f[i >> 2] | 0) + 1) | 0) >>> 0)
            t = $(d >>> 0)
            u = $(n[(a + 16) >> 2])
            do
                if (e | ($(u * t) < s)) {
                    r = (d << 1) | (((d >>> 0 < 3) | ((((d + -1) & d) | 0) != 0)) & 1)
                    j = ~~$(W($(s / u))) >>> 0
                    ti(a, r >>> 0 < j >>> 0 ? j : r)
                    r = f[b >> 2] | 0
                    j = (r + -1) | 0
                    if (!(j & r)) {
                        v = r
                        w = j & c
                        break
                    }
                    if (c >>> 0 < r >>> 0) {
                        v = r
                        w = c
                    } else {
                        v = r
                        w = (c >>> 0) % (r >>> 0) | 0
                    }
                } else {
                    v = d
                    w = k
                }
            while (0)
            k = ((f[a >> 2] | 0) + (w << 2)) | 0
            w = f[k >> 2] | 0
            if (!w) {
                d = (a + 8) | 0
                f[q >> 2] = f[d >> 2]
                f[d >> 2] = q
                f[k >> 2] = d
                d = f[q >> 2] | 0
                if (d | 0) {
                    k = f[(d + 4) >> 2] | 0
                    d = (v + -1) | 0
                    if (d & v)
                        if (k >>> 0 < v >>> 0) x = k
                        else x = (k >>> 0) % (v >>> 0) | 0
                    else x = k & d
                    y = ((f[a >> 2] | 0) + (x << 2)) | 0
                    z = 30
                }
            } else {
                f[q >> 2] = f[w >> 2]
                y = w
                z = 30
            }
            if ((z | 0) == 30) f[y >> 2] = q
            f[i >> 2] = (f[i >> 2] | 0) + 1
            o = q
            p = (o + 12) | 0
            return p | 0
        }
        function Td(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0
            c = u
            u = (u + 16) | 0
            d = (c + 4) | 0
            e = c
            f[(a + 64) >> 2] = b
            g = (a + 128) | 0
            f[g >> 2] = 2
            h = (a + 132) | 0
            f[h >> 2] = 7
            i = Qa[f[((f[b >> 2] | 0) + 32) >> 2] & 127](b) | 0
            b = (a + 88) | 0
            f[b >> 2] = i
            j = (a + 104) | 0
            k = ((f[(i + 28) >> 2] | 0) - (f[(i + 24) >> 2] | 0)) >> 2
            i = (a + 108) | 0
            l = f[i >> 2] | 0
            m = f[j >> 2] | 0
            n = (l - m) >> 2
            o = m
            p = l
            if (k >>> 0 <= n >>> 0)
                if (k >>> 0 < n >>> 0 ? ((q = (o + (k << 2)) | 0), (q | 0) != (p | 0)) : 0) {
                    o = (p + (~(((p + -4 - q) | 0) >>> 2) << 2)) | 0
                    f[i >> 2] = o
                    r = o
                    s = m
                } else {
                    r = l
                    s = m
                }
            else {
                oi(j, (k - n) | 0)
                r = f[i >> 2] | 0
                s = f[j >> 2] | 0
            }
            if ((r | 0) != (s | 0)) {
                s = 0
                do {
                    r = f[b >> 2] | 0
                    f[e >> 2] = s
                    f[d >> 2] = f[e >> 2]
                    n = Og(r, d) | 0
                    r = f[j >> 2] | 0
                    f[(r + (s << 2)) >> 2] = n
                    s = (s + 1) | 0
                } while (s >>> 0 < (((f[i >> 2] | 0) - r) >> 2) >>> 0)
            }
            i = (a + 92) | 0
            s = f[b >> 2] | 0
            j = f[s >> 2] | 0
            d = ((f[(s + 4) >> 2] | 0) - j) >> 2
            e = (a + 96) | 0
            r = f[e >> 2] | 0
            n = f[i >> 2] | 0
            k = (r - n) >> 2
            m = n
            n = r
            if (d >>> 0 <= k >>> 0)
                if (d >>> 0 < k >>> 0 ? ((r = (m + (d << 2)) | 0), (r | 0) != (n | 0)) : 0) {
                    f[e >> 2] = n + (~(((n + -4 - r) | 0) >>> 2) << 2)
                    t = s
                    v = j
                } else {
                    t = s
                    v = j
                }
            else {
                oi(i, (d - k) | 0)
                k = f[b >> 2] | 0
                t = k
                v = f[k >> 2] | 0
            }
            k = f[(t + 4) >> 2] | 0
            if ((k | 0) != (v | 0)) {
                v = f[i >> 2] | 0
                i = f[t >> 2] | 0
                t = (k - i) >> 2
                k = 0
                do {
                    f[(v + (k << 2)) >> 2] = f[(i + (k << 2)) >> 2]
                    k = (k + 1) | 0
                } while (k >>> 0 < t >>> 0)
            }
            t = ((f[h >> 2] | 0) - (f[g >> 2] | 0) + 1) | 0
            g = (a + 136) | 0
            h = (a + 140) | 0
            a = f[h >> 2] | 0
            k = f[g >> 2] | 0
            i = (((a - k) | 0) / 12) | 0
            v = a
            if (t >>> 0 > i >>> 0) {
                vf(g, (t - i) | 0)
                u = c
                return 1
            }
            if (t >>> 0 >= i >>> 0) {
                u = c
                return 1
            }
            i = (k + ((t * 12) | 0)) | 0
            if ((i | 0) == (v | 0)) {
                u = c
                return 1
            } else w = v
            while (1) {
                v = (w + -12) | 0
                f[h >> 2] = v
                t = f[v >> 2] | 0
                if (!t) x = v
                else {
                    v = (w + -8) | 0
                    k = f[v >> 2] | 0
                    if ((k | 0) != (t | 0)) f[v >> 2] = k + (~(((k + -4 - t) | 0) >>> 2) << 2)
                    br(t)
                    x = f[h >> 2] | 0
                }
                if ((x | 0) == (i | 0)) break
                else w = x
            }
            u = c
            return 1
        }
        function Ud(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            Oc(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 4194304
            if (d) {
                d = c
                c = 4194304
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 20) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            xf(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function Vd(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            Pc(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 4194304
            if (d) {
                d = c
                c = 4194304
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 20) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            xf(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function Wd(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            Qc(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 4194304
            if (d) {
                d = c
                c = 4194304
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 20) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            xf(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function Xd(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            Rc(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 4194304
            if (d) {
                d = c
                c = 4194304
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 20) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            xf(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function Yd(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            Sc(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 4194304
            if (d) {
                d = c
                c = 4194304
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 20) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            xf(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function Zd(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            Tc(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 2097152
            if (d) {
                d = c
                c = 2097152
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 19) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            yf(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function _d(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            Uc(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 1048576
            if (d) {
                d = c
                c = 1048576
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 18) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            zf(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function $d(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            Vc(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 262144
            if (d) {
                d = c
                c = 262144
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 16) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            Cf(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function ae(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            Wc(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 131072
            if (d) {
                d = c
                c = 131072
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 15) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            Df(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function be(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            Xc(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 32768
            if (d) {
                d = c
                c = 32768
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 13) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            Ef(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function ce(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            Yc(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 16384
            if (d) {
                d = c
                c = 16384
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 12) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            Lf(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function de(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            Zc(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 16384
            if (d) {
                d = c
                c = 16384
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 12) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            Lf(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function ee(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            _c(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 16384
            if (d) {
                d = c
                c = 16384
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 12) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            Lf(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function fe(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            $c(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 16384
            if (d) {
                d = c
                c = 16384
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 12) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            Lf(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function ge(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            ad(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 16384
            if (d) {
                d = c
                c = 16384
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 12) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            Lf(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function he(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            bd(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 16384
            if (d) {
                d = c
                c = 16384
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 12) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            Lf(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function ie(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            cd(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 16384
            if (d) {
                d = c
                c = 16384
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 12) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            Lf(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function je(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            g = u
            u = (u + 64) | 0
            h = (g + 48) | 0
            i = g
            j = (d + 1) | 0
            f[h >> 2] = 0
            k = (h + 4) | 0
            f[k >> 2] = 0
            f[(h + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 536870911) mq(h)
                    else {
                        l = dn(j << 3) | 0
                        f[h >> 2] = l
                        m = (l + (j << 3)) | 0
                        f[(h + 8) >> 2] = m
                        hj(l | 0, 0, ((d << 3) + 8) | 0) | 0
                        f[k >> 2] = m
                        n = l
                        o = m
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            d = (c | 0) > 0
            if (d) {
                j = 0
                do {
                    m = (n + (f[(a + (j << 2)) >> 2] << 3)) | 0
                    l = m
                    p = Tn(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, 1, 0) | 0
                    l = m
                    f[l >> 2] = p
                    f[(l + 4) >> 2] = I
                    j = (j + 1) | 0
                } while ((j | 0) != (c | 0))
            }
            j = (i + 40) | 0
            l = j
            f[l >> 2] = 0
            f[(l + 4) >> 2] = 0
            l = i
            p = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (p | 0))
            dd(i, n, (o - n) >> 3, e) | 0
            n = (i + 16) | 0
            o = Rn(f[n >> 2] | 0, f[(n + 4) >> 2] | 0, 1) | 0
            n = ((f[(e + 4) >> 2] | 0) - (f[e >> 2] | 0)) | 0
            l = j
            f[l >> 2] = n
            f[(l + 4) >> 2] = 0
            l = Tn(o | 0, I | 0, 39, 0) | 0
            o = Wn(l | 0, I | 0, 3) | 0
            l = Tn(o | 0, I | 0, 8, 0) | 0
            o = Tn(l | 0, I | 0, n | 0, 0) | 0
            vl(e, o, I)
            o = (i + 24) | 0
            f[o >> 2] = (f[e >> 2] | 0) + (f[j >> 2] | 0)
            j = (i + 28) | 0
            f[j >> 2] = 0
            n = (i + 32) | 0
            f[n >> 2] = 16384
            if (d) {
                d = c
                c = 16384
                do {
                    l = d
                    d = (d + -1) | 0
                    p = f[(a + (d << 2)) >> 2] | 0
                    m = f[i >> 2] | 0
                    q = f[(m + (p << 3)) >> 2] | 0
                    r = q << 10
                    if (c >>> 0 < r >>> 0) s = c
                    else {
                        t = c
                        while (1) {
                            v = f[o >> 2] | 0
                            w = f[j >> 2] | 0
                            f[j >> 2] = w + 1
                            b[(v + w) >> 0] = t
                            w = (f[n >> 2] | 0) >>> 8
                            f[n >> 2] = w
                            if (w >>> 0 < r >>> 0) {
                                s = w
                                break
                            } else t = w
                        }
                    }
                    c = (((((s >>> 0) / (q >>> 0)) | 0) << 12) + ((s >>> 0) % (q >>> 0) | 0) + (f[(m + (p << 3) + 4) >> 2] | 0)) | 0
                    f[n >> 2] = c
                } while ((l | 0) > 1)
            }
            Lf(i, e)
            e = f[i >> 2] | 0
            if (e | 0) {
                c = (i + 4) | 0
                i = f[c >> 2] | 0
                if ((i | 0) != (e | 0)) f[c >> 2] = i + (~(((i + -8 - e) | 0) >>> 3) << 3)
                br(e)
            }
            e = f[h >> 2] | 0
            if (!e) {
                u = g
                return 1
            }
            h = f[k >> 2] | 0
            if ((h | 0) != (e | 0)) f[k >> 2] = h + (~(((h + -8 - e) | 0) >>> 3) << 3)
            br(e)
            u = g
            return 1
        }
        function ke(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0
            e = f[b >> 2] | 0
            g = (b + 4) | 0
            h = f[g >> 2] | 0
            i = ((((f[c >> 2] | 0) - e) << 3) + (f[(c + 4) >> 2] | 0) - h) | 0
            c = e
            if ((i | 0) <= 0) {
                j = (d + 4) | 0
                k = f[d >> 2] | 0
                f[a >> 2] = k
                l = (a + 4) | 0
                m = f[j >> 2] | 0
                f[l >> 2] = m
                return
            }
            if (!h) {
                e = (d + 4) | 0
                n = i
                o = e
                p = c
                q = f[e >> 2] | 0
            } else {
                e = (32 - h) | 0
                r = (i | 0) < (e | 0) ? i : e
                s = (-1 >>> ((e - r) | 0)) & (-1 << h) & f[c >> 2]
                c = (d + 4) | 0
                h = f[c >> 2] | 0
                e = (32 - h) | 0
                t = e >>> 0 < r >>> 0 ? e : r
                u = f[d >> 2] | 0
                v = f[u >> 2] & ~((-1 >>> ((e - t) | 0)) & (-1 << h))
                f[u >> 2] = v
                h = f[c >> 2] | 0
                e = f[g >> 2] | 0
                f[u >> 2] = (h >>> 0 > e >>> 0 ? s << (h - e) : s >>> ((e - h) | 0)) | v
                v = ((f[c >> 2] | 0) + t) | 0
                h = (u + ((v >>> 5) << 2)) | 0
                f[d >> 2] = h
                u = v & 31
                f[c >> 2] = u
                v = (r - t) | 0
                if ((v | 0) > 0) {
                    e = f[h >> 2] & ~(-1 >>> ((32 - v) | 0))
                    f[h >> 2] = e
                    f[h >> 2] = e | (s >>> (((f[g >> 2] | 0) + t) | 0))
                    f[c >> 2] = v
                    w = v
                } else w = u
                u = ((f[b >> 2] | 0) + 4) | 0
                f[b >> 2] = u
                n = (i - r) | 0
                o = c
                p = u
                q = w
            }
            w = (32 - q) | 0
            u = -1 << q
            if ((n | 0) > 31) {
                q = ~u
                c = ~n
                r = (n + ((c | 0) > -64 ? c : -64) + 32) & -32
                c = n
                i = p
                while (1) {
                    v = f[i >> 2] | 0
                    t = f[d >> 2] | 0
                    g = f[t >> 2] & q
                    f[t >> 2] = g
                    f[t >> 2] = g | (v << f[o >> 2])
                    g = (t + 4) | 0
                    f[d >> 2] = g
                    f[g >> 2] = (f[g >> 2] & u) | (v >>> w)
                    i = ((f[b >> 2] | 0) + 4) | 0
                    f[b >> 2] = i
                    if ((c | 0) <= 63) break
                    else c = (c + -32) | 0
                }
                x = (n + -32 - r) | 0
                y = i
            } else {
                x = n
                y = p
            }
            if ((x | 0) <= 0) {
                j = o
                k = f[d >> 2] | 0
                f[a >> 2] = k
                l = (a + 4) | 0
                m = f[j >> 2] | 0
                f[l >> 2] = m
                return
            }
            p = f[y >> 2] & (-1 >>> ((32 - x) | 0))
            y = (w | 0) < (x | 0) ? w : x
            n = f[d >> 2] | 0
            i = f[n >> 2] & ~((-1 << f[o >> 2]) & (-1 >>> ((w - y) | 0)))
            f[n >> 2] = i
            f[n >> 2] = i | (p << f[o >> 2])
            i = ((f[o >> 2] | 0) + y) | 0
            w = (n + ((i >>> 5) << 2)) | 0
            f[d >> 2] = w
            f[o >> 2] = i & 31
            i = (x - y) | 0
            if ((i | 0) <= 0) {
                j = o
                k = f[d >> 2] | 0
                f[a >> 2] = k
                l = (a + 4) | 0
                m = f[j >> 2] | 0
                f[l >> 2] = m
                return
            }
            f[w >> 2] = (f[w >> 2] & ~(-1 >>> ((32 - i) | 0))) | (p >>> y)
            f[o >> 2] = i
            j = o
            k = f[d >> 2] | 0
            f[a >> 2] = k
            l = (a + 4) | 0
            m = f[j >> 2] | 0
            f[l >> 2] = m
            return
        }
        function le(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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
            d = u
            u = (u + 16) | 0
            e = (d + 4) | 0
            g = d
            h = (d + 9) | 0
            i = (d + 8) | 0
            j = f[((f[(a + 184) >> 2] | 0) + (c << 2)) >> 2] & 255
            b[h >> 0] = j
            c = (a + 4) | 0
            k = f[((f[c >> 2] | 0) + 44) >> 2] | 0
            l = (k + 16) | 0
            m = f[(l + 4) >> 2] | 0
            if (((m | 0) > 0) | (((m | 0) == 0) & ((f[l >> 2] | 0) >>> 0 > 0))) n = j
            else {
                f[g >> 2] = f[(k + 4) >> 2]
                f[e >> 2] = f[g >> 2]
                ye(k, e, h, (h + 1) | 0) | 0
                n = b[h >> 0] | 0
            }
            a: do
                if ((n << 24) >> 24 > -1) {
                    k = (a + 172) | 0
                    j = f[((f[k >> 2] | 0) + ((((n << 24) >> 24) * 136) | 0)) >> 2] | 0
                    l = ((Qa[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a) | 0) + 56) | 0
                    m = b[h >> 0] | 0
                    o = f[k >> 2] | 0
                    k = f[(o + ((m * 136) | 0) + 132) >> 2] | 0
                    switch (f[((f[((f[l >> 2] | 0) + 84) >> 2] | 0) + (j << 2)) >> 2] | 0) {
                        case 0: {
                            p = k
                            q = 7
                            break a
                            break
                        }
                        case 1: {
                            if (b[(o + ((m * 136) | 0) + 28) >> 0] | 0) {
                                p = k
                                q = 7
                                break a
                            }
                            break
                        }
                        default: {
                        }
                    }
                    m = f[((f[c >> 2] | 0) + 44) >> 2] | 0
                    b[i >> 0] = 1
                    o = (m + 16) | 0
                    j = f[(o + 4) >> 2] | 0
                    if (!(((j | 0) > 0) | (((j | 0) == 0) & ((f[o >> 2] | 0) >>> 0 > 0)))) {
                        f[g >> 2] = f[(m + 4) >> 2]
                        f[e >> 2] = f[g >> 2]
                        ye(m, e, i, (i + 1) | 0) | 0
                    }
                    r = k
                } else {
                    p = f[(a + 68) >> 2] | 0
                    q = 7
                }
            while (0)
            if ((q | 0) == 7) {
                q = f[((f[c >> 2] | 0) + 44) >> 2] | 0
                b[i >> 0] = 0
                a = (q + 16) | 0
                h = f[(a + 4) >> 2] | 0
                if (!(((h | 0) > 0) | (((h | 0) == 0) & ((f[a >> 2] | 0) >>> 0 > 0)))) {
                    f[g >> 2] = f[(q + 4) >> 2]
                    f[e >> 2] = f[g >> 2]
                    ye(q, e, i, (i + 1) | 0) | 0
                }
                r = p
            }
            p = f[((f[c >> 2] | 0) + 44) >> 2] | 0
            b[i >> 0] = r
            r = (p + 16) | 0
            c = f[(r + 4) >> 2] | 0
            if (((c | 0) > 0) | (((c | 0) == 0) & ((f[r >> 2] | 0) >>> 0 > 0))) {
                u = d
                return 1
            }
            f[g >> 2] = f[(p + 4) >> 2]
            f[e >> 2] = f[g >> 2]
            ye(p, e, i, (i + 1) | 0) | 0
            u = d
            return 1
        }
        function me(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0
            h = u
            u = (u + 16) | 0
            i = (h + 4) | 0
            j = h
            k = (a + 60) | 0
            f[(a + 64) >> 2] = g
            g = (a + 8) | 0
            Ah(g, b, d, e)
            d = (a + 56) | 0
            l = f[d >> 2] | 0
            m = f[(l + 4) >> 2] | 0
            n = f[l >> 2] | 0
            o = (m - n) | 0
            if ((o | 0) <= 0) {
                u = h
                return 1
            }
            p = ((o >>> 2) + -1) | 0
            o = (a + 68) | 0
            q = (a + 16) | 0
            r = (a + 32) | 0
            s = (a + 12) | 0
            t = (a + 28) | 0
            v = (a + 20) | 0
            w = (a + 24) | 0
            if (((m - n) >> 2) >>> 0 > p >>> 0) {
                x = p
                y = n
            } else {
                z = l
                mq(z)
            }
            while (1) {
                f[j >> 2] = f[(y + (x << 2)) >> 2]
                f[i >> 2] = f[j >> 2]
                tb(k, i, b, x) | 0
                l = X(x, e) | 0
                n = (b + (l << 2)) | 0
                p = (c + (l << 2)) | 0
                l = f[g >> 2] | 0
                if ((l | 0) > 0) {
                    m = 0
                    a = o
                    A = l
                    while (1) {
                        if ((A | 0) > 0) {
                            l = 0
                            do {
                                B = f[(a + (l << 2)) >> 2] | 0
                                C = f[q >> 2] | 0
                                if ((B | 0) > (C | 0)) {
                                    D = f[r >> 2] | 0
                                    f[(D + (l << 2)) >> 2] = C
                                    E = D
                                } else {
                                    D = f[s >> 2] | 0
                                    C = f[r >> 2] | 0
                                    f[(C + (l << 2)) >> 2] = (B | 0) < (D | 0) ? D : B
                                    E = C
                                }
                                l = (l + 1) | 0
                            } while ((l | 0) < (f[g >> 2] | 0))
                            F = E
                        } else F = f[r >> 2] | 0
                        l = ((f[(n + (m << 2)) >> 2] | 0) - (f[(F + (m << 2)) >> 2] | 0)) | 0
                        C = (p + (m << 2)) | 0
                        f[C >> 2] = l
                        if ((l | 0) >= (f[t >> 2] | 0)) {
                            if ((l | 0) > (f[w >> 2] | 0)) {
                                G = (l - (f[v >> 2] | 0)) | 0
                                H = 18
                            }
                        } else {
                            G = ((f[v >> 2] | 0) + l) | 0
                            H = 18
                        }
                        if ((H | 0) == 18) {
                            H = 0
                            f[C >> 2] = G
                        }
                        m = (m + 1) | 0
                        A = f[g >> 2] | 0
                        if ((m | 0) >= (A | 0)) break
                        else a = F
                    }
                }
                x = (x + -1) | 0
                if ((x | 0) <= -1) {
                    H = 3
                    break
                }
                a = f[d >> 2] | 0
                y = f[a >> 2] | 0
                if ((((f[(a + 4) >> 2] | 0) - y) >> 2) >>> 0 <= x >>> 0) {
                    z = a
                    H = 4
                    break
                }
            }
            if ((H | 0) == 3) {
                u = h
                return 1
            } else if ((H | 0) == 4) mq(z)
            return 0
        }
        function ne(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0
            h = u
            u = (u + 16) | 0
            i = (h + 4) | 0
            j = h
            k = (a + 60) | 0
            f[(a + 64) >> 2] = g
            g = (a + 8) | 0
            Ah(g, b, d, e)
            d = (a + 56) | 0
            l = f[d >> 2] | 0
            m = f[(l + 4) >> 2] | 0
            n = f[l >> 2] | 0
            o = (m - n) | 0
            if ((o | 0) <= 0) {
                u = h
                return 1
            }
            p = ((o >>> 2) + -1) | 0
            o = (a + 68) | 0
            q = (a + 16) | 0
            r = (a + 32) | 0
            s = (a + 12) | 0
            t = (a + 28) | 0
            v = (a + 20) | 0
            w = (a + 24) | 0
            if (((m - n) >> 2) >>> 0 > p >>> 0) {
                x = p
                y = n
            } else {
                z = l
                mq(z)
            }
            while (1) {
                f[j >> 2] = f[(y + (x << 2)) >> 2]
                f[i >> 2] = f[j >> 2]
                sb(k, i, b, x) | 0
                l = X(x, e) | 0
                n = (b + (l << 2)) | 0
                p = (c + (l << 2)) | 0
                l = f[g >> 2] | 0
                if ((l | 0) > 0) {
                    m = 0
                    a = o
                    A = l
                    while (1) {
                        if ((A | 0) > 0) {
                            l = 0
                            do {
                                B = f[(a + (l << 2)) >> 2] | 0
                                C = f[q >> 2] | 0
                                if ((B | 0) > (C | 0)) {
                                    D = f[r >> 2] | 0
                                    f[(D + (l << 2)) >> 2] = C
                                    E = D
                                } else {
                                    D = f[s >> 2] | 0
                                    C = f[r >> 2] | 0
                                    f[(C + (l << 2)) >> 2] = (B | 0) < (D | 0) ? D : B
                                    E = C
                                }
                                l = (l + 1) | 0
                            } while ((l | 0) < (f[g >> 2] | 0))
                            F = E
                        } else F = f[r >> 2] | 0
                        l = ((f[(n + (m << 2)) >> 2] | 0) - (f[(F + (m << 2)) >> 2] | 0)) | 0
                        C = (p + (m << 2)) | 0
                        f[C >> 2] = l
                        if ((l | 0) >= (f[t >> 2] | 0)) {
                            if ((l | 0) > (f[w >> 2] | 0)) {
                                G = (l - (f[v >> 2] | 0)) | 0
                                H = 18
                            }
                        } else {
                            G = ((f[v >> 2] | 0) + l) | 0
                            H = 18
                        }
                        if ((H | 0) == 18) {
                            H = 0
                            f[C >> 2] = G
                        }
                        m = (m + 1) | 0
                        A = f[g >> 2] | 0
                        if ((m | 0) >= (A | 0)) break
                        else a = F
                    }
                }
                x = (x + -1) | 0
                if ((x | 0) <= -1) {
                    H = 3
                    break
                }
                a = f[d >> 2] | 0
                y = f[a >> 2] | 0
                if ((((f[(a + 4) >> 2] | 0) - y) >> 2) >>> 0 <= x >>> 0) {
                    z = a
                    H = 4
                    break
                }
            }
            if ((H | 0) == 3) {
                u = h
                return 1
            } else if ((H | 0) == 4) mq(z)
            return 0
        }
        function oe(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0
            b = u
            u = (u + 16) | 0
            c = (b + 4) | 0
            d = b
            e = (a + 12) | 0
            g = f[e >> 2] | 0
            h = ((f[(g + 4) >> 2] | 0) - (f[g >> 2] | 0)) >> 2
            if (!h) {
                u = b
                return 1
            }
            i = (a + 152) | 0
            j = (a + 140) | 0
            k = (a + 144) | 0
            l = (a + 148) | 0
            a = 0
            m = g
            while (1) {
                f[d >> 2] = ((a >>> 0) / 3) | 0
                f[c >> 2] = f[d >> 2]
                if (!(Rj(m, c) | 0) ? ((g = f[e >> 2] | 0), (f[((f[(g + 12) >> 2] | 0) + (a << 2)) >> 2] | 0) == -1) : 0) {
                    n = (a + 1) | 0
                    o = ((n >>> 0) % 3 | 0 | 0) == 0 ? (a + -2) | 0 : n
                    if ((o | 0) == -1) p = -1
                    else p = f[((f[g >> 2] | 0) + (o << 2)) >> 2] | 0
                    o = f[i >> 2] | 0
                    if ((f[(o + (p << 2)) >> 2] | 0) == -1) {
                        g = f[k >> 2] | 0
                        n = f[l >> 2] | 0
                        if ((g | 0) == ((n << 5) | 0)) {
                            if (((g + 1) | 0) < 0) {
                                q = 11
                                break
                            }
                            r = n << 6
                            n = (g + 32) & -32
                            hi(j, g >>> 0 < 1073741823 ? (r >>> 0 < n >>> 0 ? n : r) : 2147483647)
                            s = f[k >> 2] | 0
                            t = f[i >> 2] | 0
                        } else {
                            s = g
                            t = o
                        }
                        f[k >> 2] = s + 1
                        o = ((f[j >> 2] | 0) + ((s >>> 5) << 2)) | 0
                        f[o >> 2] = f[o >> 2] & ~(1 << (s & 31))
                        o = (t + (p << 2)) | 0
                        if ((f[o >> 2] | 0) == -1) {
                            r = a
                            n = o
                            while (1) {
                                f[n >> 2] = g
                                o = (r + 1) | 0
                                a: do
                                    if ((r | 0) != -1 ? ((v = ((o >>> 0) % 3 | 0 | 0) == 0 ? (r + -2) | 0 : o), (v | 0) != -1) : 0) {
                                        w = f[e >> 2] | 0
                                        x = f[(w + 12) >> 2] | 0
                                        y = v
                                        while (1) {
                                            v = f[(x + (y << 2)) >> 2] | 0
                                            if ((v | 0) == -1) break
                                            z = (v + 1) | 0
                                            A = ((z >>> 0) % 3 | 0 | 0) == 0 ? (v + -2) | 0 : z
                                            if ((A | 0) == -1) {
                                                B = -1
                                                C = -1
                                                break a
                                            } else y = A
                                        }
                                        x = (y + 1) | 0
                                        A = ((x >>> 0) % 3 | 0 | 0) == 0 ? (y + -2) | 0 : x
                                        if ((A | 0) == -1) {
                                            B = y
                                            C = -1
                                        } else {
                                            B = y
                                            C = f[((f[w >> 2] | 0) + (A << 2)) >> 2] | 0
                                        }
                                    } else {
                                        B = -1
                                        C = -1
                                    }
                                while (0)
                                n = (t + (C << 2)) | 0
                                if ((f[n >> 2] | 0) != -1) break
                                else r = B
                            }
                        }
                    }
                }
                r = (a + 1) | 0
                if (r >>> 0 >= h >>> 0) {
                    q = 3
                    break
                }
                a = r
                m = f[e >> 2] | 0
            }
            if ((q | 0) == 3) {
                u = b
                return 1
            } else if ((q | 0) == 11) mq(j)
            return 0
        }
        function pe(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0
            d = u
            u = (u + 32) | 0
            e = (d + 8) | 0
            g = d
            h = (a + 4) | 0
            i = f[h >> 2] | 0
            if (i >>> 0 >= b >>> 0) {
                f[h >> 2] = b
                u = d
                return
            }
            j = (a + 8) | 0
            k = f[j >> 2] | 0
            l = k << 5
            m = (b - i) | 0
            if ((l >>> 0 < m >>> 0) | (i >>> 0 > ((l - m) | 0) >>> 0)) {
                f[e >> 2] = 0
                n = (e + 4) | 0
                f[n >> 2] = 0
                o = (e + 8) | 0
                f[o >> 2] = 0
                if ((b | 0) < 0) mq(a)
                p = k << 6
                k = (b + 31) & -32
                hi(e, l >>> 0 < 1073741823 ? (p >>> 0 < k >>> 0 ? k : p) : 2147483647)
                p = f[h >> 2] | 0
                f[n >> 2] = p + m
                k = f[a >> 2] | 0
                l = k
                q = f[e >> 2] | 0
                r = (((l + ((p >>> 5) << 2) - k) << 3) + (p & 31)) | 0
                if ((r | 0) > 0) {
                    p = r >>> 5
                    Xl(q | 0, k | 0, (p << 2) | 0) | 0
                    k = r & 31
                    r = (q + (p << 2)) | 0
                    s = r
                    if (!k) {
                        t = 0
                        v = s
                    } else {
                        w = -1 >>> ((32 - k) | 0)
                        f[r >> 2] = (f[r >> 2] & ~w) | (f[(l + (p << 2)) >> 2] & w)
                        t = k
                        v = s
                    }
                } else {
                    t = 0
                    v = q
                }
                f[g >> 2] = v
                f[(g + 4) >> 2] = t
                t = g
                g = f[t >> 2] | 0
                v = f[(t + 4) >> 2] | 0
                t = f[a >> 2] | 0
                f[a >> 2] = f[e >> 2]
                f[e >> 2] = t
                e = f[h >> 2] | 0
                f[h >> 2] = f[n >> 2]
                f[n >> 2] = e
                e = f[j >> 2] | 0
                f[j >> 2] = f[o >> 2]
                f[o >> 2] = e
                if (t | 0) br(t)
                x = g
                y = v
            } else {
                v = ((f[a >> 2] | 0) + ((i >>> 5) << 2)) | 0
                f[h >> 2] = b
                x = v
                y = i & 31
            }
            if (!m) {
                u = d
                return
            }
            i = (y | 0) == 0
            v = x
            if (c) {
                if (i) {
                    z = m
                    A = x
                    B = v
                } else {
                    c = (32 - y) | 0
                    b = c >>> 0 > m >>> 0 ? m : c
                    f[v >> 2] = f[v >> 2] | ((-1 >>> ((c - b) | 0)) & (-1 << y))
                    c = (v + 4) | 0
                    z = (m - b) | 0
                    A = c
                    B = c
                }
                c = z >>> 5
                hj(A | 0, -1, (c << 2) | 0) | 0
                A = z & 31
                z = (B + (c << 2)) | 0
                if (!A) {
                    u = d
                    return
                }
                f[z >> 2] = f[z >> 2] | (-1 >>> ((32 - A) | 0))
                u = d
                return
            } else {
                if (i) {
                    C = m
                    D = x
                    E = v
                } else {
                    x = (32 - y) | 0
                    i = x >>> 0 > m >>> 0 ? m : x
                    f[v >> 2] = f[v >> 2] & ~((-1 >>> ((x - i) | 0)) & (-1 << y))
                    y = (v + 4) | 0
                    C = (m - i) | 0
                    D = y
                    E = y
                }
                y = C >>> 5
                hj(D | 0, 0, (y << 2) | 0) | 0
                D = C & 31
                C = (E + (y << 2)) | 0
                if (!D) {
                    u = d
                    return
                }
                f[C >> 2] = f[C >> 2] & ~(-1 >>> ((32 - D) | 0))
                u = d
                return
            }
        }
        function qe(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0
            a = u
            u = (u + 48) | 0
            g = (a + 36) | 0
            h = (a + 24) | 0
            i = (a + 12) | 0
            j = a
            if (!c) {
                k = 0
                u = a
                return k | 0
            }
            f[g >> 2] = 0
            f[(g + 4) >> 2] = 0
            f[(g + 8) >> 2] = 0
            l = vj(d) | 0
            if (l >>> 0 > 4294967279) mq(g)
            if (l >>> 0 < 11) {
                b[(g + 11) >> 0] = l
                if (!l) m = g
                else {
                    n = g
                    o = 7
                }
            } else {
                p = (l + 16) & -16
                q = dn(p) | 0
                f[g >> 2] = q
                f[(g + 8) >> 2] = p | -2147483648
                f[(g + 4) >> 2] = l
                n = q
                o = 7
            }
            if ((o | 0) == 7) {
                Rg(n | 0, d | 0, l | 0) | 0
                m = n
            }
            b[(m + l) >> 0] = 0
            f[h >> 2] = 0
            f[(h + 4) >> 2] = 0
            f[(h + 8) >> 2] = 0
            l = vj(e) | 0
            if (l >>> 0 > 4294967279) mq(h)
            if (l >>> 0 < 11) {
                b[(h + 11) >> 0] = l
                if (!l) r = h
                else {
                    s = h
                    o = 13
                }
            } else {
                m = (l + 16) & -16
                n = dn(m) | 0
                f[h >> 2] = n
                f[(h + 8) >> 2] = m | -2147483648
                f[(h + 4) >> 2] = l
                s = n
                o = 13
            }
            if ((o | 0) == 13) {
                Rg(s | 0, e | 0, l | 0) | 0
                r = s
            }
            b[(r + l) >> 0] = 0
            f[i >> 2] = 0
            f[(i + 4) >> 2] = 0
            f[(i + 8) >> 2] = 0
            l = vj(d) | 0
            if (l >>> 0 > 4294967279) mq(i)
            if (l >>> 0 < 11) {
                b[(i + 11) >> 0] = l
                if (!l) t = i
                else {
                    v = i
                    o = 19
                }
            } else {
                r = (l + 16) & -16
                s = dn(r) | 0
                f[i >> 2] = s
                f[(i + 8) >> 2] = r | -2147483648
                f[(i + 4) >> 2] = l
                v = s
                o = 19
            }
            if ((o | 0) == 19) {
                Rg(v | 0, d | 0, l | 0) | 0
                t = v
            }
            b[(t + l) >> 0] = 0
            f[j >> 2] = 0
            f[(j + 4) >> 2] = 0
            f[(j + 8) >> 2] = 0
            l = vj(e) | 0
            if (l >>> 0 > 4294967279) mq(j)
            if (l >>> 0 < 11) {
                b[(j + 11) >> 0] = l
                if (!l) w = j
                else {
                    x = j
                    o = 25
                }
            } else {
                t = (l + 16) & -16
                v = dn(t) | 0
                f[j >> 2] = v
                f[(j + 8) >> 2] = t | -2147483648
                f[(j + 4) >> 2] = l
                x = v
                o = 25
            }
            if ((o | 0) == 25) {
                Rg(x | 0, e | 0, l | 0) | 0
                w = x
            }
            b[(w + l) >> 0] = 0
            en(c, i, j)
            if ((b[(j + 11) >> 0] | 0) < 0) br(f[j >> 2] | 0)
            if ((b[(i + 11) >> 0] | 0) < 0) br(f[i >> 2] | 0)
            if ((b[(h + 11) >> 0] | 0) < 0) br(f[h >> 2] | 0)
            if ((b[(g + 11) >> 0] | 0) < 0) br(f[g >> 2] | 0)
            k = 1
            u = a
            return k | 0
        }
        function re(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0
            f[a >> 2] = f[c >> 2]
            d = (c + 4) | 0
            f[(a + 4) >> 2] = f[d >> 2]
            e = (c + 8) | 0
            f[(a + 8) >> 2] = f[e >> 2]
            g = (c + 12) | 0
            f[(a + 12) >> 2] = f[g >> 2]
            f[d >> 2] = 0
            f[e >> 2] = 0
            f[g >> 2] = 0
            g = (c + 16) | 0
            f[(a + 16) >> 2] = f[g >> 2]
            e = (c + 20) | 0
            f[(a + 20) >> 2] = f[e >> 2]
            d = (c + 24) | 0
            f[(a + 24) >> 2] = f[d >> 2]
            f[g >> 2] = 0
            f[e >> 2] = 0
            f[d >> 2] = 0
            b[(a + 28) >> 0] = b[(c + 28) >> 0] | 0
            d = (a + 32) | 0
            e = (c + 32) | 0
            f[d >> 2] = 0
            g = (a + 36) | 0
            f[g >> 2] = 0
            f[(a + 40) >> 2] = 0
            f[d >> 2] = f[e >> 2]
            d = (c + 36) | 0
            f[g >> 2] = f[d >> 2]
            g = (c + 40) | 0
            f[(a + 40) >> 2] = f[g >> 2]
            f[g >> 2] = 0
            f[d >> 2] = 0
            f[e >> 2] = 0
            e = (a + 44) | 0
            d = (c + 44) | 0
            f[e >> 2] = 0
            g = (a + 48) | 0
            f[g >> 2] = 0
            f[(a + 52) >> 2] = 0
            f[e >> 2] = f[d >> 2]
            e = (c + 48) | 0
            f[g >> 2] = f[e >> 2]
            g = (c + 52) | 0
            f[(a + 52) >> 2] = f[g >> 2]
            f[g >> 2] = 0
            f[e >> 2] = 0
            f[d >> 2] = 0
            d = (a + 56) | 0
            e = (c + 56) | 0
            f[d >> 2] = 0
            g = (a + 60) | 0
            f[g >> 2] = 0
            f[(a + 64) >> 2] = 0
            f[d >> 2] = f[e >> 2]
            d = (c + 60) | 0
            f[g >> 2] = f[d >> 2]
            g = (c + 64) | 0
            f[(a + 64) >> 2] = f[g >> 2]
            f[g >> 2] = 0
            f[d >> 2] = 0
            f[e >> 2] = 0
            f[(a + 68) >> 2] = f[(c + 68) >> 2]
            f[(a + 72) >> 2] = f[(c + 72) >> 2]
            e = (a + 76) | 0
            d = (c + 76) | 0
            f[e >> 2] = 0
            g = (a + 80) | 0
            f[g >> 2] = 0
            f[(a + 84) >> 2] = 0
            f[e >> 2] = f[d >> 2]
            e = (c + 80) | 0
            f[g >> 2] = f[e >> 2]
            g = (c + 84) | 0
            f[(a + 84) >> 2] = f[g >> 2]
            f[g >> 2] = 0
            f[e >> 2] = 0
            f[d >> 2] = 0
            d = (a + 88) | 0
            e = (c + 88) | 0
            f[d >> 2] = 0
            g = (a + 92) | 0
            f[g >> 2] = 0
            f[(a + 96) >> 2] = 0
            f[d >> 2] = f[e >> 2]
            d = (c + 92) | 0
            f[g >> 2] = f[d >> 2]
            g = (c + 96) | 0
            f[(a + 96) >> 2] = f[g >> 2]
            f[g >> 2] = 0
            f[d >> 2] = 0
            f[e >> 2] = 0
            b[(a + 100) >> 0] = b[(c + 100) >> 0] | 0
            e = (a + 104) | 0
            d = (c + 104) | 0
            f[e >> 2] = 0
            g = (a + 108) | 0
            f[g >> 2] = 0
            f[(a + 112) >> 2] = 0
            f[e >> 2] = f[d >> 2]
            e = (c + 108) | 0
            f[g >> 2] = f[e >> 2]
            g = (c + 112) | 0
            f[(a + 112) >> 2] = f[g >> 2]
            f[g >> 2] = 0
            f[e >> 2] = 0
            f[d >> 2] = 0
            d = (a + 116) | 0
            e = (c + 116) | 0
            f[d >> 2] = 0
            g = (a + 120) | 0
            f[g >> 2] = 0
            f[(a + 124) >> 2] = 0
            f[d >> 2] = f[e >> 2]
            d = (c + 120) | 0
            f[g >> 2] = f[d >> 2]
            g = (c + 124) | 0
            f[(a + 124) >> 2] = f[g >> 2]
            f[g >> 2] = 0
            f[d >> 2] = 0
            f[e >> 2] = 0
            f[(a + 128) >> 2] = f[(c + 128) >> 2]
            f[(a + 132) >> 2] = f[(c + 132) >> 2]
            return
        }
        function se(a, c, d, e, g) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0
            h = u
            u = (u + 48) | 0
            i = (h + 36) | 0
            j = (h + 24) | 0
            k = (h + 8) | 0
            l = (h + 4) | 0
            m = h
            n = (e + 4) | 0
            Bh(i, c, ((f[n >> 2] | 0) - (f[e >> 2] | 0)) >> 2, 2, g, d, 1)
            g = f[i >> 2] | 0
            o = ((f[f[g >> 2] >> 2] | 0) + (f[(g + 48) >> 2] | 0)) | 0
            f[k >> 2] = -1
            f[(k + 4) >> 2] = -1
            f[(k + 8) >> 2] = -1
            f[(k + 12) >> 2] = -1
            p = f[(c + 4) >> 2] | 0
            if (((p + -2) | 0) >>> 0 <= 28) {
                f[k >> 2] = p
                c = 1 << p
                f[(k + 4) >> 2] = c + -1
                p = (c + -2) | 0
                f[(k + 8) >> 2] = p
                f[(k + 12) >> 2] = ((p | 0) / 2) | 0
                p = f[e >> 2] | 0
                if ((f[n >> 2] | 0) == (p | 0)) q = g
                else {
                    c = (d + 84) | 0
                    r = (d + 68) | 0
                    s = (d + 48) | 0
                    t = (d + 40) | 0
                    v = 0
                    w = 0
                    x = p
                    while (1) {
                        p = f[(x + (v << 2)) >> 2] | 0
                        if (!(b[c >> 0] | 0)) y = f[((f[r >> 2] | 0) + (p << 2)) >> 2] | 0
                        else y = p
                        p = s
                        z = f[p >> 2] | 0
                        A = f[(p + 4) >> 2] | 0
                        p = t
                        B = f[p >> 2] | 0
                        C = on(B | 0, f[(p + 4) >> 2] | 0, y | 0, 0) | 0
                        p = Tn(C | 0, I | 0, z | 0, A | 0) | 0
                        Rg(j | 0, ((f[f[d >> 2] >> 2] | 0) + p) | 0, B | 0) | 0
                        df(k, j, l, m)
                        f[(o + (w << 2)) >> 2] = f[l >> 2]
                        f[(o + ((w | 1) << 2)) >> 2] = f[m >> 2]
                        v = (v + 1) | 0
                        x = f[e >> 2] | 0
                        if (v >>> 0 >= (((f[n >> 2] | 0) - x) >> 2) >>> 0) break
                        else w = (w + 2) | 0
                    }
                    q = f[i >> 2] | 0
                }
                f[a >> 2] = q
                f[i >> 2] = 0
                u = h
                return
            }
            f[a >> 2] = 0
            f[i >> 2] = 0
            if (!g) {
                u = h
                return
            }
            i = (g + 88) | 0
            a = f[i >> 2] | 0
            f[i >> 2] = 0
            if (a | 0) {
                i = f[(a + 8) >> 2] | 0
                if (i | 0) {
                    q = (a + 12) | 0
                    if ((f[q >> 2] | 0) != (i | 0)) f[q >> 2] = i
                    br(i)
                }
                br(a)
            }
            a = f[(g + 68) >> 2] | 0
            if (a | 0) {
                i = (g + 72) | 0
                q = f[i >> 2] | 0
                if ((q | 0) != (a | 0)) f[i >> 2] = q + (~(((q + -4 - a) | 0) >>> 2) << 2)
                br(a)
            }
            a = (g + 64) | 0
            q = f[a >> 2] | 0
            f[a >> 2] = 0
            if (q | 0) {
                a = f[q >> 2] | 0
                if (a | 0) {
                    i = (q + 4) | 0
                    if ((f[i >> 2] | 0) != (a | 0)) f[i >> 2] = a
                    br(a)
                }
                br(q)
            }
            br(g)
            u = h
            return
        }
        function te(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            d = (a + 8) | 0
            e = f[d >> 2] | 0
            g = (a + 4) | 0
            h = f[g >> 2] | 0
            if (((((e - h) | 0) / 136) | 0) >>> 0 >= c >>> 0) {
                i = c
                j = h
                do {
                    f[j >> 2] = -1
                    Ek((j + 4) | 0)
                    b[(j + 100) >> 0] = 1
                    k = (j + 104) | 0
                    f[k >> 2] = 0
                    f[(k + 4) >> 2] = 0
                    f[(k + 8) >> 2] = 0
                    f[(k + 12) >> 2] = 0
                    f[(k + 16) >> 2] = 0
                    f[(k + 20) >> 2] = 0
                    f[(k + 24) >> 2] = 0
                    j = ((f[g >> 2] | 0) + 136) | 0
                    f[g >> 2] = j
                    i = (i + -1) | 0
                } while ((i | 0) != 0)
                return
            }
            i = f[a >> 2] | 0
            j = (((h - i) | 0) / 136) | 0
            h = (j + c) | 0
            if (h >>> 0 > 31580641) mq(a)
            k = (((e - i) | 0) / 136) | 0
            i = k << 1
            e = k >>> 0 < 15790320 ? (i >>> 0 < h >>> 0 ? h : i) : 31580641
            do
                if (e)
                    if (e >>> 0 > 31580641) {
                        i = ra(8) | 0
                        Wo(i, 14941)
                        f[i >> 2] = 6944
                        va(i | 0, 1080, 114)
                    } else {
                        l = dn((e * 136) | 0) | 0
                        break
                    }
                else l = 0
            while (0)
            i = (l + ((j * 136) | 0)) | 0
            j = i
            h = (l + ((e * 136) | 0)) | 0
            e = c
            c = j
            l = i
            do {
                f[l >> 2] = -1
                Ek((l + 4) | 0)
                b[(l + 100) >> 0] = 1
                k = (l + 104) | 0
                f[k >> 2] = 0
                f[(k + 4) >> 2] = 0
                f[(k + 8) >> 2] = 0
                f[(k + 12) >> 2] = 0
                f[(k + 16) >> 2] = 0
                f[(k + 20) >> 2] = 0
                f[(k + 24) >> 2] = 0
                l = (c + 136) | 0
                c = l
                e = (e + -1) | 0
            } while ((e | 0) != 0)
            e = f[a >> 2] | 0
            l = f[g >> 2] | 0
            if ((l | 0) == (e | 0)) {
                m = j
                n = e
                o = e
            } else {
                k = l
                l = j
                j = i
                do {
                    k = (k + -136) | 0
                    re((j + -136) | 0, k)
                    j = (l + -136) | 0
                    l = j
                } while ((k | 0) != (e | 0))
                m = l
                n = f[a >> 2] | 0
                o = f[g >> 2] | 0
            }
            f[a >> 2] = m
            f[g >> 2] = c
            f[d >> 2] = h
            h = n
            if ((o | 0) != (h | 0)) {
                d = o
                do {
                    o = f[(d + -20) >> 2] | 0
                    if (o | 0) {
                        c = (d + -16) | 0
                        g = f[c >> 2] | 0
                        if ((g | 0) != (o | 0)) f[c >> 2] = g + (~(((g + -4 - o) | 0) >>> 2) << 2)
                        br(o)
                    }
                    o = f[(d + -32) >> 2] | 0
                    if (o | 0) {
                        g = (d + -28) | 0
                        c = f[g >> 2] | 0
                        if ((c | 0) != (o | 0)) f[g >> 2] = c + (~(((c + -4 - o) | 0) >>> 2) << 2)
                        br(o)
                    }
                    yi((d + -132) | 0)
                    d = (d + -136) | 0
                } while ((d | 0) != (h | 0))
            }
            if (!n) return
            br(n)
            return
        }
        function ue(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            c = f[b >> 2] | 0
            b = (a + 12) | 0
            d = (c | 0) == -1
            e = (c + 1) | 0
            do
                if (!d) {
                    g = ((e >>> 0) % 3 | 0 | 0) == 0 ? (c + -2) | 0 : e
                    if (!((c >>> 0) % 3 | 0)) {
                        h = g
                        i = (c + 2) | 0
                        break
                    } else {
                        h = g
                        i = (c + -1) | 0
                        break
                    }
                } else {
                    h = -1
                    i = -1
                }
            while (0)
            e = d ? -1 : ((c >>> 0) / 3) | 0
            g = (a + 28) | 0
            j = ((f[g >> 2] | 0) + ((e >>> 5) << 2)) | 0
            f[j >> 2] = (1 << (e & 31)) | f[j >> 2]
            j = (a + 172) | 0
            e = (a + 176) | 0
            k = (a + 280) | 0
            if (
                (
                    (!d ? ((d = f[((f[((f[b >> 2] | 0) + 12) >> 2] | 0) + (c << 2)) >> 2] | 0), (d | 0) != -1) : 0)
                        ? ((a = ((d >>> 0) / 3) | 0), ((f[((f[g >> 2] | 0) + ((a >>> 5) << 2)) >> 2] & (1 << (a & 31))) | 0) == 0)
                        : 0
                )
                    ? ((a = f[j >> 2] | 0), (f[e >> 2] | 0) != (a | 0))
                    : 0
            ) {
                d = c >>> 5
                l = 1 << (c & 31)
                c = 0
                m = a
                do {
                    a = ((f[k >> 2] | 0) + (c << 5)) | 0
                    if (!(l & f[((f[(m + ((c * 136) | 0) + 4) >> 2] | 0) + (d << 2)) >> 2])) Vi(a, 0)
                    else Vi(a, 1)
                    c = (c + 1) | 0
                    m = f[j >> 2] | 0
                } while (c >>> 0 < (((((f[e >> 2] | 0) - m) | 0) / 136) | 0) >>> 0)
            }
            if (
                (
                    ((h | 0) != -1 ? ((m = f[((f[((f[b >> 2] | 0) + 12) >> 2] | 0) + (h << 2)) >> 2] | 0), (m | 0) != -1) : 0)
                        ? ((c = ((m >>> 0) / 3) | 0), ((f[((f[g >> 2] | 0) + ((c >>> 5) << 2)) >> 2] & (1 << (c & 31))) | 0) == 0)
                        : 0
                )
                    ? ((c = f[j >> 2] | 0), (f[e >> 2] | 0) != (c | 0))
                    : 0
            ) {
                m = h >>> 5
                d = 1 << (h & 31)
                h = 0
                l = c
                do {
                    c = ((f[k >> 2] | 0) + (h << 5)) | 0
                    if (!(d & f[((f[(l + ((h * 136) | 0) + 4) >> 2] | 0) + (m << 2)) >> 2])) Vi(c, 0)
                    else Vi(c, 1)
                    h = (h + 1) | 0
                    l = f[j >> 2] | 0
                } while (h >>> 0 < (((((f[e >> 2] | 0) - l) | 0) / 136) | 0) >>> 0)
            }
            if ((i | 0) == -1) return 1
            l = f[((f[((f[b >> 2] | 0) + 12) >> 2] | 0) + (i << 2)) >> 2] | 0
            if ((l | 0) == -1) return 1
            b = ((l >>> 0) / 3) | 0
            if ((f[((f[g >> 2] | 0) + ((b >>> 5) << 2)) >> 2] & (1 << (b & 31))) | 0) return 1
            b = f[j >> 2] | 0
            if ((f[e >> 2] | 0) == (b | 0)) return 1
            g = i >>> 5
            l = 1 << (i & 31)
            i = 0
            h = b
            do {
                b = ((f[k >> 2] | 0) + (i << 5)) | 0
                if (!(l & f[((f[(h + ((i * 136) | 0) + 4) >> 2] | 0) + (g << 2)) >> 2])) Vi(b, 0)
                else Vi(b, 1)
                i = (i + 1) | 0
                h = f[j >> 2] | 0
            } while (i >>> 0 < (((((f[e >> 2] | 0) - h) | 0) / 136) | 0) >>> 0)
            return 1
        }
        function ve(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0
            d = u
            u = (u + 16) | 0
            e = (d + 4) | 0
            g = d
            h = (d + 8) | 0
            i = (a + 4) | 0
            j = (a + 8) | 0
            Nh(((f[j >> 2] | 0) - (f[i >> 2] | 0)) >> 2, c) | 0
            k = f[i >> 2] | 0
            if ((f[j >> 2] | 0) == (k | 0)) {
                u = d
                return 1
            }
            l = (a + 32) | 0
            a = (c + 16) | 0
            m = (c + 4) | 0
            n = (h + 1) | 0
            o = (h + 1) | 0
            p = (h + 1) | 0
            q = (h + 1) | 0
            r = 0
            s = k
            do {
                k = f[((f[((f[l >> 2] | 0) + 8) >> 2] | 0) + (f[(s + (r << 2)) >> 2] << 2)) >> 2] | 0
                b[h >> 0] = f[(k + 56) >> 2]
                t = a
                v = f[t >> 2] | 0
                w = f[(t + 4) >> 2] | 0
                if (((w | 0) > 0) | (((w | 0) == 0) & (v >>> 0 > 0))) {
                    x = w
                    y = v
                } else {
                    f[g >> 2] = f[m >> 2]
                    f[e >> 2] = f[g >> 2]
                    ye(c, e, h, q) | 0
                    v = a
                    x = f[(v + 4) >> 2] | 0
                    y = f[v >> 2] | 0
                }
                b[h >> 0] = f[(k + 28) >> 2]
                if (((x | 0) > 0) | (((x | 0) == 0) & (y >>> 0 > 0))) {
                    z = x
                    A = y
                } else {
                    f[g >> 2] = f[m >> 2]
                    f[e >> 2] = f[g >> 2]
                    ye(c, e, h, p) | 0
                    v = a
                    z = f[(v + 4) >> 2] | 0
                    A = f[v >> 2] | 0
                }
                b[h >> 0] = b[(k + 24) >> 0] | 0
                if (((z | 0) > 0) | (((z | 0) == 0) & (A >>> 0 > 0))) {
                    B = z
                    C = A
                } else {
                    f[g >> 2] = f[m >> 2]
                    f[e >> 2] = f[g >> 2]
                    ye(c, e, h, o) | 0
                    v = a
                    B = f[(v + 4) >> 2] | 0
                    C = f[v >> 2] | 0
                }
                b[h >> 0] = b[(k + 32) >> 0] | 0
                if (!(((B | 0) > 0) | (((B | 0) == 0) & (C >>> 0 > 0)))) {
                    f[g >> 2] = f[m >> 2]
                    f[e >> 2] = f[g >> 2]
                    ye(c, e, h, n) | 0
                }
                Nh(f[(k + 60) >> 2] | 0, c) | 0
                r = (r + 1) | 0
                s = f[i >> 2] | 0
            } while (r >>> 0 < (((f[j >> 2] | 0) - s) >> 2) >>> 0)
            u = d
            return 1
        }
        function we(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0
            d = u
            u = (u + 32) | 0
            e = (d + 16) | 0
            g = (d + 12) | 0
            h = (d + 8) | 0
            i = (d + 4) | 0
            j = d
            wp(a)
            f[(a + 16) >> 2] = 0
            f[(a + 20) >> 2] = 0
            f[(a + 12) >> 2] = a + 16
            k = (a + 24) | 0
            wp(k)
            l = (b + 4) | 0
            if ((a | 0) != (l | 0)) {
                f[h >> 2] = f[l >> 2]
                f[i >> 2] = b + 8
                f[g >> 2] = f[h >> 2]
                f[e >> 2] = f[i >> 2]
                Hc(a, g, e)
            }
            l = (b + 28) | 0
            if ((k | 0) != (l | 0)) {
                f[h >> 2] = f[l >> 2]
                f[i >> 2] = b + 32
                f[g >> 2] = f[h >> 2]
                f[e >> 2] = f[i >> 2]
                Hc(k, g, e)
            }
            f[j >> 2] = 0
            k = (c + 8) | 0
            l = (c + 12) | 0
            c = f[l >> 2] | 0
            m = f[k >> 2] | 0
            if (((c - m) | 0) <= 0) {
                u = d
                return
            }
            n = (b + 20) | 0
            b = m
            m = c
            c = 0
            while (1) {
                o = f[((f[(b + (c << 2)) >> 2] | 0) + 56) >> 2] | 0
                p = f[n >> 2] | 0
                if (p) {
                    q = n
                    r = p
                    a: while (1) {
                        p = r
                        while (1) {
                            if ((f[(p + 16) >> 2] | 0) >= (o | 0)) break
                            s = f[(p + 4) >> 2] | 0
                            if (!s) {
                                t = q
                                break a
                            } else p = s
                        }
                        r = f[p >> 2] | 0
                        if (!r) {
                            t = p
                            break
                        } else q = p
                    }
                    if ((t | 0) != (n | 0) ? (o | 0) >= (f[(t + 16) >> 2] | 0) : 0) {
                        q = (t + 20) | 0
                        r = wd(a, j) | 0
                        if ((r | 0) != (q | 0)) {
                            f[h >> 2] = f[q >> 2]
                            f[i >> 2] = t + 24
                            f[g >> 2] = f[h >> 2]
                            f[e >> 2] = f[i >> 2]
                            Hc(r, g, e)
                        }
                        v = f[j >> 2] | 0
                        w = f[k >> 2] | 0
                        x = f[l >> 2] | 0
                    } else {
                        v = c
                        w = b
                        x = m
                    }
                } else {
                    v = c
                    w = b
                    x = m
                }
                c = (v + 1) | 0
                f[j >> 2] = c
                if ((c | 0) >= (((x - w) >> 2) | 0)) break
                else {
                    b = w
                    m = x
                }
            }
            u = d
            return
        }
        function xe(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0
            d = u
            u = (u + 16) | 0
            e = (d + 4) | 0
            g = d
            h = (d + 8) | 0
            i = (a + 12) | 0
            Nh(f[i >> 2] | 0, c) | 0
            if (!(f[i >> 2] | 0)) {
                j = 1
                u = d
                return j | 0
            }
            k = (c + 16) | 0
            l = (c + 4) | 0
            m = (h + 1) | 0
            n = (h + 1) | 0
            o = (h + 1) | 0
            p = 0
            while (1) {
                q = f[a >> 2] | 0
                r = f[(q + (p << 3)) >> 2] | 0
                if (r >>> 0 > 63)
                    if (r >>> 0 > 16383)
                        if (r >>> 0 > 4194303) {
                            j = 0
                            s = 20
                            break
                        } else {
                            t = 2
                            s = 13
                        }
                    else {
                        t = 1
                        s = 13
                    }
                else if (!r) {
                    v = (p + 1) | 0
                    w = 0
                    while (1) {
                        if (f[(q + ((v + w) << 3)) >> 2] | 0) {
                            x = w
                            break
                        }
                        y = (w + 1) | 0
                        if (y >>> 0 < 63) w = y
                        else {
                            x = y
                            break
                        }
                    }
                    b[h >> 0] = (x << 2) | 3
                    w = k
                    v = f[(w + 4) >> 2] | 0
                    if (!(((v | 0) > 0) | (((v | 0) == 0) & ((f[w >> 2] | 0) >>> 0 > 0)))) {
                        f[g >> 2] = f[l >> 2]
                        f[e >> 2] = f[g >> 2]
                        ye(c, e, h, o) | 0
                    }
                    z = (x + p) | 0
                } else {
                    t = 0
                    s = 13
                }
                if ((s | 0) == 13) {
                    s = 0
                    b[h >> 0] = t | (r << 2)
                    w = k
                    v = f[(w + 4) >> 2] | 0
                    if (!(((v | 0) > 0) | (((v | 0) == 0) & ((f[w >> 2] | 0) >>> 0 > 0)))) {
                        f[g >> 2] = f[l >> 2]
                        f[e >> 2] = f[g >> 2]
                        ye(c, e, h, n) | 0
                    }
                    if (!t) z = p
                    else {
                        w = 0
                        do {
                            w = (w + 1) | 0
                            b[h >> 0] = r >>> (((w << 3) + -2) | 0)
                            v = k
                            q = f[(v + 4) >> 2] | 0
                            if (!(((q | 0) > 0) | (((q | 0) == 0) & ((f[v >> 2] | 0) >>> 0 > 0)))) {
                                f[g >> 2] = f[l >> 2]
                                f[e >> 2] = f[g >> 2]
                                ye(c, e, h, m) | 0
                            }
                        } while ((w | 0) < (t | 0))
                        z = p
                    }
                }
                p = (z + 1) | 0
                if (p >>> 0 >= (f[i >> 2] | 0) >>> 0) {
                    j = 1
                    s = 20
                    break
                }
            }
            if ((s | 0) == 20) {
                u = d
                return j | 0
            }
            return 0
        }
        function ye(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                E = 0
            g = f[a >> 2] | 0
            h = g
            i = ((f[c >> 2] | 0) - h) | 0
            c = (g + i) | 0
            j = (e - d) | 0
            if ((j | 0) <= 0) {
                k = c
                return k | 0
            }
            l = (a + 8) | 0
            m = f[l >> 2] | 0
            n = (a + 4) | 0
            o = f[n >> 2] | 0
            p = o
            if ((j | 0) <= ((m - p) | 0)) {
                q = (p - c) | 0
                if ((j | 0) > (q | 0)) {
                    r = (d + q) | 0
                    if ((r | 0) == (e | 0)) s = o
                    else {
                        t = r
                        u = o
                        while (1) {
                            b[u >> 0] = b[t >> 0] | 0
                            t = (t + 1) | 0
                            v = ((f[n >> 2] | 0) + 1) | 0
                            f[n >> 2] = v
                            if ((t | 0) == (e | 0)) {
                                s = v
                                break
                            } else u = v
                        }
                    }
                    if ((q | 0) > 0) {
                        w = r
                        x = s
                    } else {
                        k = c
                        return k | 0
                    }
                } else {
                    w = e
                    x = o
                }
                s = (x - (c + j)) | 0
                r = (c + s) | 0
                if (r >>> 0 < o >>> 0) {
                    q = r
                    r = x
                    do {
                        b[r >> 0] = b[q >> 0] | 0
                        q = (q + 1) | 0
                        r = ((f[n >> 2] | 0) + 1) | 0
                        f[n >> 2] = r
                    } while ((q | 0) != (o | 0))
                }
                if (s | 0) Xl((x + (0 - s)) | 0, c | 0, s | 0) | 0
                if ((w | 0) == (d | 0)) {
                    k = c
                    return k | 0
                } else {
                    y = d
                    z = c
                }
                while (1) {
                    b[z >> 0] = b[y >> 0] | 0
                    y = (y + 1) | 0
                    if ((y | 0) == (w | 0)) {
                        k = c
                        break
                    } else z = (z + 1) | 0
                }
                return k | 0
            }
            z = (p - h + j) | 0
            if ((z | 0) < 0) mq(a)
            j = (m - h) | 0
            h = j << 1
            m = j >>> 0 < 1073741823 ? (h >>> 0 < z >>> 0 ? z : h) : 2147483647
            h = c
            if (!m) A = 0
            else A = dn(m) | 0
            z = (A + i) | 0
            i = z
            j = (A + m) | 0
            if ((d | 0) == (e | 0)) {
                B = i
                C = g
            } else {
                g = d
                d = i
                i = z
                do {
                    b[i >> 0] = b[g >> 0] | 0
                    i = (d + 1) | 0
                    d = i
                    g = (g + 1) | 0
                } while ((g | 0) != (e | 0))
                B = d
                C = f[a >> 2] | 0
            }
            d = (h - C) | 0
            e = (z + (0 - d)) | 0
            if ((d | 0) > 0) Rg(e | 0, C | 0, d | 0) | 0
            d = ((f[n >> 2] | 0) - h) | 0
            if ((d | 0) > 0) {
                h = B
                Rg(h | 0, c | 0, d | 0) | 0
                D = (h + d) | 0
                E = f[a >> 2] | 0
            } else {
                D = B
                E = C
            }
            f[a >> 2] = e
            f[n >> 2] = D
            f[l >> 2] = j
            if (!E) {
                k = z
                return k | 0
            }
            br(E)
            k = z
            return k | 0
        }
        function ze(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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
            e = u
            u = (u + 16) | 0
            g = e
            h = f[((f[(c + 4) >> 2] | 0) + (d << 2)) >> 2] | 0
            d = f[(c + 28) >> 2] | 0
            c = f[((f[((f[(d + 4) >> 2] | 0) + 8) >> 2] | 0) + (h << 2)) >> 2] | 0
            switch (f[(c + 28) >> 2] | 0) {
                case 5:
                case 6:
                case 3:
                case 4:
                case 1:
                case 2: {
                    i = dn(40) | 0
                    Ao(i)
                    j = i
                    k = j
                    f[a >> 2] = k
                    u = e
                    return
                }
                case 9: {
                    l = 3
                    break
                }
                default: {
                }
            }
            if ((l | 0) == 3) {
                i = f[(d + 48) >> 2] | 0
                d = dn(32) | 0
                f[g >> 2] = d
                f[(g + 8) >> 2] = -2147483616
                f[(g + 4) >> 2] = 17
                m = d
                n = 12932
                o = (m + 17) | 0
                do {
                    b[m >> 0] = b[n >> 0] | 0
                    m = (m + 1) | 0
                    n = (n + 1) | 0
                } while ((m | 0) < (o | 0))
                b[(d + 17) >> 0] = 0
                d = (i + 16) | 0
                n = f[d >> 2] | 0
                if (n) {
                    p = d
                    q = n
                    a: while (1) {
                        n = q
                        while (1) {
                            if ((f[(n + 16) >> 2] | 0) >= (h | 0)) break
                            r = f[(n + 4) >> 2] | 0
                            if (!r) {
                                s = p
                                break a
                            } else n = r
                        }
                        q = f[n >> 2] | 0
                        if (!q) {
                            s = n
                            break
                        } else p = n
                    }
                    if (((s | 0) != (d | 0) ? (h | 0) >= (f[(s + 16) >> 2] | 0) : 0) ? ((h = (s + 20) | 0), (sh(h, g) | 0) != 0) : 0) t = yk(h, g, -1) | 0
                    else l = 12
                } else l = 12
                if ((l | 0) == 12) t = yk(i, g, -1) | 0
                if ((b[(g + 11) >> 0] | 0) < 0) br(f[g >> 2] | 0)
                if ((t | 0) > 0)
                    if ((f[(c + 56) >> 2] | 0) == 1) {
                        c = dn(48) | 0
                        m = c
                        o = (m + 48) | 0
                        do {
                            f[m >> 2] = 0
                            m = (m + 4) | 0
                        } while ((m | 0) < (o | 0))
                        Ao(c)
                        f[c >> 2] = 2256
                        f[(c + 40) >> 2] = 1152
                        f[(c + 44) >> 2] = -1
                        j = c
                        k = j
                        f[a >> 2] = k
                        u = e
                        return
                    } else {
                        c = dn(64) | 0
                        mm(c)
                        j = c
                        k = j
                        f[a >> 2] = k
                        u = e
                        return
                    }
            }
            c = dn(36) | 0
            wm(c)
            j = c
            k = j
            f[a >> 2] = k
            u = e
            return
        }
        function Ae(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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
            d = (c | 0) == (a | 0)
            b[(c + 12) >> 0] = d & 1
            if (d) return
            else e = c
            while (1) {
                g = (e + 8) | 0
                h = f[g >> 2] | 0
                c = (h + 12) | 0
                if (b[c >> 0] | 0) {
                    i = 23
                    break
                }
                j = (h + 8) | 0
                k = f[j >> 2] | 0
                d = f[k >> 2] | 0
                if ((d | 0) == (h | 0)) {
                    l = f[(k + 4) >> 2] | 0
                    if (!l) {
                        i = 7
                        break
                    }
                    m = (l + 12) | 0
                    if (!(b[m >> 0] | 0)) n = m
                    else {
                        i = 7
                        break
                    }
                } else {
                    if (!d) {
                        i = 16
                        break
                    }
                    m = (d + 12) | 0
                    if (!(b[m >> 0] | 0)) n = m
                    else {
                        i = 16
                        break
                    }
                }
                b[c >> 0] = 1
                c = (k | 0) == (a | 0)
                b[(k + 12) >> 0] = c & 1
                b[n >> 0] = 1
                if (c) {
                    i = 23
                    break
                } else e = k
            }
            if ((i | 0) == 7) {
                if ((f[h >> 2] | 0) == (e | 0)) {
                    o = h
                    p = k
                } else {
                    n = (h + 4) | 0
                    a = f[n >> 2] | 0
                    c = f[a >> 2] | 0
                    f[n >> 2] = c
                    if (!c) q = k
                    else {
                        f[(c + 8) >> 2] = h
                        q = f[j >> 2] | 0
                    }
                    f[(a + 8) >> 2] = q
                    q = f[j >> 2] | 0
                    f[((f[q >> 2] | 0) == (h | 0) ? q : (q + 4) | 0) >> 2] = a
                    f[a >> 2] = h
                    f[j >> 2] = a
                    o = a
                    p = f[(a + 8) >> 2] | 0
                }
                b[(o + 12) >> 0] = 1
                b[(p + 12) >> 0] = 0
                o = f[p >> 2] | 0
                a = (o + 4) | 0
                q = f[a >> 2] | 0
                f[p >> 2] = q
                if (q | 0) f[(q + 8) >> 2] = p
                q = (p + 8) | 0
                f[(o + 8) >> 2] = f[q >> 2]
                c = f[q >> 2] | 0
                f[((f[c >> 2] | 0) == (p | 0) ? c : (c + 4) | 0) >> 2] = o
                f[a >> 2] = p
                f[q >> 2] = o
                return
            } else if ((i | 0) == 16) {
                if ((f[h >> 2] | 0) == (e | 0)) {
                    o = (e + 4) | 0
                    q = f[o >> 2] | 0
                    f[h >> 2] = q
                    if (!q) r = k
                    else {
                        f[(q + 8) >> 2] = h
                        r = f[j >> 2] | 0
                    }
                    f[g >> 2] = r
                    r = f[j >> 2] | 0
                    f[((f[r >> 2] | 0) == (h | 0) ? r : (r + 4) | 0) >> 2] = e
                    f[o >> 2] = h
                    f[j >> 2] = e
                    s = e
                    t = f[(e + 8) >> 2] | 0
                } else {
                    s = h
                    t = k
                }
                b[(s + 12) >> 0] = 1
                b[(t + 12) >> 0] = 0
                s = (t + 4) | 0
                k = f[s >> 2] | 0
                h = f[k >> 2] | 0
                f[s >> 2] = h
                if (h | 0) f[(h + 8) >> 2] = t
                h = (t + 8) | 0
                f[(k + 8) >> 2] = f[h >> 2]
                s = f[h >> 2] | 0
                f[((f[s >> 2] | 0) == (t | 0) ? s : (s + 4) | 0) >> 2] = k
                f[k >> 2] = t
                f[h >> 2] = k
                return
            } else if ((i | 0) == 23) return
        }
        function Be(a, c, d, e, g) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            var h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = Oa,
                C = Oa
            h = u
            u = (u + 16) | 0
            i = h
            j = (e + 4) | 0
            k = b[(d + 24) >> 0] | 0
            l = (k << 24) >> 24
            Bh(a, c, ((f[j >> 2] | 0) - (f[e >> 2] | 0)) >> 2, l, g, d, 1)
            g = f[a >> 2] | 0
            a = ((f[f[g >> 2] >> 2] | 0) + (f[(g + 48) >> 2] | 0)) | 0
            g = f[(c + 4) >> 2] | 0
            sq(i)
            yo(i, $(n[(c + 20) >> 2]), ((1 << g) + -1) | 0)
            g = _q(l >>> 0 > 1073741823 ? -1 : l << 2) | 0
            m = f[j >> 2] | 0
            j = f[e >> 2] | 0
            e = j
            if ((m | 0) == (j | 0)) {
                $q(g)
                u = h
                return
            }
            o = (d + 68) | 0
            p = (d + 48) | 0
            q = (d + 40) | 0
            r = (c + 8) | 0
            c = (b[(d + 84) >> 0] | 0) == 0
            s = (m - j) >> 2
            if ((k << 24) >> 24 > 0) {
                t = 0
                v = 0
            } else {
                k = 0
                do {
                    j = f[(e + (k << 2)) >> 2] | 0
                    if (c) w = f[((f[o >> 2] | 0) + (j << 2)) >> 2] | 0
                    else w = j
                    j = p
                    m = f[j >> 2] | 0
                    x = f[(j + 4) >> 2] | 0
                    j = q
                    y = f[j >> 2] | 0
                    z = on(y | 0, f[(j + 4) >> 2] | 0, w | 0, 0) | 0
                    j = Tn(z | 0, I | 0, m | 0, x | 0) | 0
                    Rg(g | 0, ((f[f[d >> 2] >> 2] | 0) + j) | 0, y | 0) | 0
                    k = (k + 1) | 0
                } while (k >>> 0 < s >>> 0)
                $q(g)
                u = h
                return
            }
            while (1) {
                k = f[(e + (t << 2)) >> 2] | 0
                if (c) A = f[((f[o >> 2] | 0) + (k << 2)) >> 2] | 0
                else A = k
                k = p
                w = f[k >> 2] | 0
                y = f[(k + 4) >> 2] | 0
                k = q
                j = f[k >> 2] | 0
                x = on(j | 0, f[(k + 4) >> 2] | 0, A | 0, 0) | 0
                k = Tn(x | 0, I | 0, w | 0, y | 0) | 0
                Rg(g | 0, ((f[f[d >> 2] >> 2] | 0) + k) | 0, j | 0) | 0
                j = f[r >> 2] | 0
                B = $(n[i >> 2])
                k = 0
                y = v
                while (1) {
                    C = $(n[(g + (k << 2)) >> 2])
                    w = ~~$(J($($(B * $(C - $(n[(j + (k << 2)) >> 2]))) + $(0.5))))
                    f[(a + (y << 2)) >> 2] = w
                    k = (k + 1) | 0
                    if ((k | 0) == (l | 0)) break
                    else y = (y + 1) | 0
                }
                t = (t + 1) | 0
                if (t >>> 0 >= s >>> 0) break
                else v = (v + l) | 0
            }
            $q(g)
            u = h
            return
        }
        function Ce(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0
            d = f[b >> 2] | 0
            b = (a + 12) | 0
            e = (d | 0) == -1
            do
                if (e) {
                    g = 1
                    h = -1
                    i = -1
                } else {
                    j = (d + (((d >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1)) | 0
                    if ((j | 0) != -1) {
                        k = f[((f[b >> 2] | 0) + 12) >> 2] | 0
                        l = j
                        while (1) {
                            j = f[(k + (l << 2)) >> 2] | 0
                            if ((j | 0) == -1) {
                                m = 0
                                n = l
                                break
                            }
                            o = (j + 1) | 0
                            l = ((o >>> 0) % 3 | 0 | 0) == 0 ? (j + -2) | 0 : o
                            if ((l | 0) == -1) {
                                m = 1
                                n = -1
                                break
                            }
                        }
                        if (e) {
                            g = m
                            h = -1
                            i = n
                            break
                        } else {
                            p = m
                            q = n
                        }
                    } else {
                        p = 1
                        q = -1
                    }
                    g = p
                    h = f[((f[f[b >> 2] >> 2] | 0) + (d << 2)) >> 2] | 0
                    i = q
                }
            while (0)
            if (c) {
                c = ((f[(a + 84) >> 2] | 0) + ((h >>> 5) << 2)) | 0
                f[c >> 2] = f[c >> 2] | (1 << (h & 31))
                r = 1
            } else r = 0
            c = f[((f[(a + 152) >> 2] | 0) + (h << 2)) >> 2] | 0
            q = ((f[(a + 140) >> 2] | 0) + ((c >>> 5) << 2)) | 0
            f[q >> 2] = f[q >> 2] | (1 << (c & 31))
            if (!g) {
                g = ((((i >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + i) | 0
                if ((g | 0) == -1) {
                    s = -1
                    t = i
                } else {
                    s = f[((f[f[b >> 2] >> 2] | 0) + (g << 2)) >> 2] | 0
                    t = i
                }
            } else {
                s = -1
                t = -1
            }
            if ((s | 0) == (h | 0)) {
                u = r
                return u | 0
            }
            i = f[(a + 84) >> 2] | 0
            a = r
            r = s
            s = t
            while (1) {
                t = (i + ((r >>> 5) << 2)) | 0
                f[t >> 2] = f[t >> 2] | (1 << (r & 31))
                t = (a + 1) | 0
                g = (s + 1) | 0
                a: do
                    if ((s | 0) != -1 ? ((c = ((g >>> 0) % 3 | 0 | 0) == 0 ? (s + -2) | 0 : g), (c | 0) != -1) : 0) {
                        q = f[b >> 2] | 0
                        d = f[(q + 12) >> 2] | 0
                        p = c
                        while (1) {
                            c = f[(d + (p << 2)) >> 2] | 0
                            if ((c | 0) == -1) break
                            n = (c + 1) | 0
                            m = ((n >>> 0) % 3 | 0 | 0) == 0 ? (c + -2) | 0 : n
                            if ((m | 0) == -1) {
                                v = -1
                                w = -1
                                break a
                            } else p = m
                        }
                        d = ((((p >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + p) | 0
                        if ((d | 0) == -1) {
                            v = -1
                            w = p
                        } else {
                            v = f[((f[q >> 2] | 0) + (d << 2)) >> 2] | 0
                            w = p
                        }
                    } else {
                        v = -1
                        w = -1
                    }
                while (0)
                if ((v | 0) == (h | 0)) {
                    u = t
                    break
                } else {
                    a = t
                    r = v
                    s = w
                }
            }
            return u | 0
        }
        function De(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 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
            c = (a + 4) | 0
            d = f[c >> 2] | 0
            e = (a + 100) | 0
            if (d >>> 0 < (f[e >> 2] | 0) >>> 0) {
                f[c >> 2] = d + 1
                g = h[d >> 0] | 0
            } else g = Di(a) | 0
            switch (g | 0) {
                case 43:
                case 45: {
                    d = ((g | 0) == 45) & 1
                    i = f[c >> 2] | 0
                    if (i >>> 0 < (f[e >> 2] | 0) >>> 0) {
                        f[c >> 2] = i + 1
                        j = h[i >> 0] | 0
                    } else j = Di(a) | 0
                    if (((b | 0) != 0) & (((j + -48) | 0) >>> 0 > 9) ? (f[e >> 2] | 0) != 0 : 0) {
                        f[c >> 2] = (f[c >> 2] | 0) + -1
                        k = d
                        l = j
                    } else {
                        k = d
                        l = j
                    }
                    break
                }
                default: {
                    k = 0
                    l = g
                }
            }
            if (((l + -48) | 0) >>> 0 > 9)
                if (!(f[e >> 2] | 0)) {
                    m = -2147483648
                    n = 0
                } else {
                    f[c >> 2] = (f[c >> 2] | 0) + -1
                    m = -2147483648
                    n = 0
                }
            else {
                g = 0
                j = l
                while (1) {
                    g = (j + -48 + ((g * 10) | 0)) | 0
                    l = f[c >> 2] | 0
                    if (l >>> 0 < (f[e >> 2] | 0) >>> 0) {
                        f[c >> 2] = l + 1
                        o = h[l >> 0] | 0
                    } else o = Di(a) | 0
                    if (!((((o + -48) | 0) >>> 0 < 10) & ((g | 0) < 214748364))) break
                    else j = o
                }
                j = (((g | 0) < 0) << 31) >> 31
                if (((o + -48) | 0) >>> 0 < 10) {
                    l = o
                    d = g
                    b = j
                    while (1) {
                        i = on(d | 0, b | 0, 10, 0) | 0
                        p = I
                        q = Tn(l | 0, ((((l | 0) < 0) << 31) >> 31) | 0, -48, -1) | 0
                        r = Tn(q | 0, I | 0, i | 0, p | 0) | 0
                        p = I
                        i = f[c >> 2] | 0
                        if (i >>> 0 < (f[e >> 2] | 0) >>> 0) {
                            f[c >> 2] = i + 1
                            s = h[i >> 0] | 0
                        } else s = Di(a) | 0
                        if ((((s + -48) | 0) >>> 0 < 10) & (((p | 0) < 21474836) | (((p | 0) == 21474836) & (r >>> 0 < 2061584302)))) {
                            l = s
                            d = r
                            b = p
                        } else {
                            t = s
                            u = r
                            v = p
                            break
                        }
                    }
                } else {
                    t = o
                    u = g
                    v = j
                }
                if (((t + -48) | 0) >>> 0 < 10)
                    do {
                        t = f[c >> 2] | 0
                        if (t >>> 0 < (f[e >> 2] | 0) >>> 0) {
                            f[c >> 2] = t + 1
                            w = h[t >> 0] | 0
                        } else w = Di(a) | 0
                    } while (((w + -48) | 0) >>> 0 < 10)
                if (f[e >> 2] | 0) f[c >> 2] = (f[c >> 2] | 0) + -1
                c = (k | 0) != 0
                k = Vn(0, 0, u | 0, v | 0) | 0
                m = c ? I : v
                n = c ? k : u
            }
            I = m
            return n | 0
        }
        function Ee(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 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
            b = (a + 1176) | 0
            c = f[b >> 2] | 0
            if (c | 0) {
                d = (a + 1180) | 0
                e = f[d >> 2] | 0
                if ((e | 0) == (c | 0)) g = c
                else {
                    h = e
                    while (1) {
                        e = (h + -12) | 0
                        f[d >> 2] = e
                        i = f[e >> 2] | 0
                        if (!i) j = e
                        else {
                            e = (h + -8) | 0
                            k = f[e >> 2] | 0
                            if ((k | 0) != (i | 0)) f[e >> 2] = k + (~(((k + -4 - i) | 0) >>> 2) << 2)
                            br(i)
                            j = f[d >> 2] | 0
                        }
                        if ((j | 0) == (c | 0)) break
                        else h = j
                    }
                    g = f[b >> 2] | 0
                }
                br(g)
            }
            g = (a + 1164) | 0
            b = f[g >> 2] | 0
            if (b | 0) {
                j = (a + 1168) | 0
                h = f[j >> 2] | 0
                if ((h | 0) == (b | 0)) l = b
                else {
                    c = h
                    while (1) {
                        h = (c + -12) | 0
                        f[j >> 2] = h
                        d = f[h >> 2] | 0
                        if (!d) m = h
                        else {
                            h = (c + -8) | 0
                            i = f[h >> 2] | 0
                            if ((i | 0) != (d | 0)) f[h >> 2] = i + (~(((i + -4 - d) | 0) >>> 2) << 2)
                            br(d)
                            m = f[j >> 2] | 0
                        }
                        if ((m | 0) == (b | 0)) break
                        else c = m
                    }
                    l = f[g >> 2] | 0
                }
                br(l)
            }
            l = f[(a + 1152) >> 2] | 0
            if (l | 0) {
                g = (a + 1156) | 0
                m = f[g >> 2] | 0
                if ((m | 0) != (l | 0)) f[g >> 2] = m + (~(((m + -4 - l) | 0) >>> 2) << 2)
                br(l)
            }
            l = f[(a + 1140) >> 2] | 0
            if (l | 0) {
                m = (a + 1144) | 0
                g = f[m >> 2] | 0
                if ((g | 0) != (l | 0)) f[m >> 2] = g + (~(((g + -4 - l) | 0) >>> 2) << 2)
                br(l)
            }
            l = f[(a + 1128) >> 2] | 0
            if (!l) {
                n = (a + 1108) | 0
                dl(n)
                o = (a + 1088) | 0
                dl(o)
                p = (a + 1068) | 0
                dl(p)
                q = (a + 1036) | 0
                tj(q)
                r = (a + 12) | 0
                xh(r)
                return
            }
            g = (a + 1132) | 0
            m = f[g >> 2] | 0
            if ((m | 0) != (l | 0)) f[g >> 2] = m + (~(((m + -4 - l) | 0) >>> 2) << 2)
            br(l)
            n = (a + 1108) | 0
            dl(n)
            o = (a + 1088) | 0
            dl(o)
            p = (a + 1068) | 0
            dl(p)
            q = (a + 1036) | 0
            tj(q)
            r = (a + 12) | 0
            xh(r)
            return
        }
        function Fe(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0
            d = u
            u = (u + 16) | 0
            e = d
            g = (a + 4) | 0
            h = f[g >> 2] | 0
            i = f[((f[a >> 2] | 0) + 52) >> 2] | 0
            if (!h) {
                if (!(Sa[i & 31](a, c, 0) | 0)) {
                    j = 0
                    u = d
                    return j | 0
                }
            } else if (!(Sa[i & 31](a, c, f[((f[(h + 4) >> 2] | 0) + 80) >> 2] | 0) | 0)) {
                j = 0
                u = d
                return j | 0
            }
            if (!(b[(a + 28) >> 0] | 0)) {
                j = 1
                u = d
                return j | 0
            }
            h = f[(a + 8) >> 2] | 0
            i = f[(a + 32) >> 2] | 0
            a = f[(h + 80) >> 2] | 0
            f[e >> 2] = 0
            k = (e + 4) | 0
            f[k >> 2] = 0
            f[(e + 8) >> 2] = 0
            do
                if (a)
                    if (a >>> 0 > 1073741823) mq(e)
                    else {
                        l = a << 2
                        m = dn(l) | 0
                        f[e >> 2] = m
                        n = (m + (a << 2)) | 0
                        f[(e + 8) >> 2] = n
                        hj(m | 0, 0, l | 0) | 0
                        f[k >> 2] = n
                        o = m
                        p = n
                        q = m
                        break
                    }
                else {
                    o = 0
                    p = 0
                    q = 0
                }
            while (0)
            e = f[(c + 4) >> 2] | 0
            a = f[c >> 2] | 0
            c = a
            a: do
                if ((e | 0) != (a | 0)) {
                    m = (e - a) >> 2
                    if (b[(h + 84) >> 0] | 0) {
                        n = 0
                        while (1) {
                            f[(o + (f[(c + (n << 2)) >> 2] << 2)) >> 2] = n
                            n = (n + 1) | 0
                            if (n >>> 0 >= m >>> 0) break a
                        }
                    }
                    n = f[(h + 68) >> 2] | 0
                    l = 0
                    do {
                        f[(o + (f[(n + (f[(c + (l << 2)) >> 2] << 2)) >> 2] << 2)) >> 2] = l
                        l = (l + 1) | 0
                    } while (l >>> 0 < m >>> 0)
                }
            while (0)
            c = f[((f[((f[g >> 2] | 0) + 4) >> 2] | 0) + 80) >> 2] | 0
            b: do
                if (c | 0) {
                    g = f[(i + 68) >> 2] | 0
                    if (b[(h + 84) >> 0] | 0) {
                        a = 0
                        while (1) {
                            f[(g + (a << 2)) >> 2] = f[(o + (a << 2)) >> 2]
                            a = (a + 1) | 0
                            if (a >>> 0 >= c >>> 0) break b
                        }
                    }
                    a = f[(h + 68) >> 2] | 0
                    e = 0
                    do {
                        f[(g + (e << 2)) >> 2] = f[(o + (f[(a + (e << 2)) >> 2] << 2)) >> 2]
                        e = (e + 1) | 0
                    } while (e >>> 0 < c >>> 0)
                }
            while (0)
            if (o | 0) {
                if ((p | 0) != (o | 0)) f[k >> 2] = p + (~(((p + -4 - o) | 0) >>> 2) << 2)
                br(q)
            }
            j = 1
            u = d
            return j | 0
        }
        function Ge(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            c = u
            u = (u + 16) | 0
            d = c
            f[a >> 2] = 0
            f[(a + 8) >> 2] = b
            yh((a + 12) | 0)
            rn((a + 1036) | 0)
            to((a + 1068) | 0)
            to((a + 1088) | 0)
            to((a + 1108) | 0)
            e = (a + 1128) | 0
            f[e >> 2] = 0
            g = (a + 1132) | 0
            f[g >> 2] = 0
            f[(a + 1136) >> 2] = 0
            h = (b | 0) == 0
            do
                if (!h)
                    if (b >>> 0 > 1073741823) mq(e)
                    else {
                        i = b << 2
                        j = dn(i) | 0
                        f[e >> 2] = j
                        k = (j + (b << 2)) | 0
                        f[(a + 1136) >> 2] = k
                        hj(j | 0, 0, i | 0) | 0
                        f[g >> 2] = k
                        break
                    }
            while (0)
            g = (a + 1140) | 0
            f[g >> 2] = 0
            e = (a + 1144) | 0
            f[e >> 2] = 0
            f[(a + 1148) >> 2] = 0
            if (!h) {
                k = b << 2
                i = dn(k) | 0
                f[g >> 2] = i
                g = (i + (b << 2)) | 0
                f[(a + 1148) >> 2] = g
                hj(i | 0, 0, k | 0) | 0
                f[e >> 2] = g
            }
            g = (a + 1152) | 0
            f[g >> 2] = 0
            e = (a + 1156) | 0
            f[e >> 2] = 0
            f[(a + 1160) >> 2] = 0
            if (!h) {
                k = b << 2
                i = dn(k) | 0
                f[g >> 2] = i
                g = (i + (b << 2)) | 0
                f[(a + 1160) >> 2] = g
                hj(i | 0, 0, k | 0) | 0
                f[e >> 2] = g
            }
            g = (b << 5) | 1
            f[d >> 2] = 0
            e = (d + 4) | 0
            f[e >> 2] = 0
            f[(d + 8) >> 2] = 0
            if (!h) {
                k = b << 2
                i = dn(k) | 0
                f[d >> 2] = i
                j = (i + (b << 2)) | 0
                f[(d + 8) >> 2] = j
                hj(i | 0, 0, k | 0) | 0
                f[e >> 2] = j
            }
            fk((a + 1164) | 0, g, d)
            j = f[d >> 2] | 0
            if (j | 0) {
                k = f[e >> 2] | 0
                if ((k | 0) != (j | 0)) f[e >> 2] = k + (~(((k + -4 - j) | 0) >>> 2) << 2)
                br(j)
            }
            f[d >> 2] = 0
            j = (d + 4) | 0
            f[j >> 2] = 0
            f[(d + 8) >> 2] = 0
            if (!h) {
                h = b << 2
                k = dn(h) | 0
                f[d >> 2] = k
                e = (k + (b << 2)) | 0
                f[(d + 8) >> 2] = e
                hj(k | 0, 0, h | 0) | 0
                f[j >> 2] = e
            }
            fk((a + 1176) | 0, g, d)
            g = f[d >> 2] | 0
            if (!g) {
                u = c
                return
            }
            d = f[j >> 2] | 0
            if ((d | 0) != (g | 0)) f[j >> 2] = d + (~(((d + -4 - g) | 0) >>> 2) << 2)
            br(g)
            u = c
            return
        }
        function He(a, b, c, d, e) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0.0,
                D = 0.0,
                E = 0.0
            g = u
            u = (u + 16) | 0
            h = g
            i = (b + 16) | 0
            f[a >> 2] = f[i >> 2]
            f[(a + 4) >> 2] = f[(i + 4) >> 2]
            f[(a + 8) >> 2] = f[(i + 8) >> 2]
            f[(a + 12) >> 2] = f[(i + 12) >> 2]
            f[(a + 16) >> 2] = f[(i + 16) >> 2]
            f[(a + 20) >> 2] = f[(i + 20) >> 2]
            j = (a + 8) | 0
            f[j >> 2] = (f[j >> 2] | 0) + d
            j = (d | 0) > 0
            if (j) {
                k = (b + 4) | 0
                l = (a + 16) | 0
                m = (a + 12) | 0
                n = f[b >> 2] | 0
                o = n
                q = 0
                r = o
                s = n
                n = o
                while (1) {
                    o = f[(c + (q << 2)) >> 2] | 0
                    t = f[k >> 2] | 0
                    if (((t - s) >> 2) >>> 0 > o >>> 0) {
                        v = r
                        w = n
                    } else {
                        x = (o + 1) | 0
                        f[h >> 2] = 0
                        y = (t - s) >> 2
                        z = s
                        A = t
                        if (x >>> 0 <= y >>> 0)
                            if (x >>> 0 < y >>> 0 ? ((t = (z + (x << 2)) | 0), (t | 0) != (A | 0)) : 0) {
                                f[k >> 2] = A + (~(((A + -4 - t) | 0) >>> 2) << 2)
                                B = r
                            } else B = r
                        else {
                            kh(b, (x - y) | 0, h)
                            B = f[b >> 2] | 0
                        }
                        v = B
                        w = B
                    }
                    y = (w + (o << 2)) | 0
                    x = f[y >> 2] | 0
                    s = w
                    if ((x | 0) <= 1)
                        if ((x | 0) == 0 ? ((f[l >> 2] = (f[l >> 2] | 0) + 1), o >>> 0 > (f[m >> 2] | 0) >>> 0) : 0) {
                            f[m >> 2] = o
                            C = 0.0
                        } else C = 0.0
                    else {
                        D = +(x | 0)
                        C = +Fg(D) * D
                    }
                    x = ((f[y >> 2] | 0) + 1) | 0
                    f[y >> 2] = x
                    D = +(x | 0)
                    E = +Fg(D) * D - C
                    p[a >> 3] = +p[a >> 3] + E
                    q = (q + 1) | 0
                    if ((q | 0) == (d | 0)) break
                    else {
                        r = v
                        n = w
                    }
                }
            }
            if (e) {
                f[i >> 2] = f[a >> 2]
                f[(i + 4) >> 2] = f[(a + 4) >> 2]
                f[(i + 8) >> 2] = f[(a + 8) >> 2]
                f[(i + 12) >> 2] = f[(a + 12) >> 2]
                f[(i + 16) >> 2] = f[(a + 16) >> 2]
                u = g
                return
            }
            if (!j) {
                u = g
                return
            }
            j = f[b >> 2] | 0
            b = 0
            do {
                a = (j + (f[(c + (b << 2)) >> 2] << 2)) | 0
                f[a >> 2] = (f[a >> 2] | 0) + -1
                b = (b + 1) | 0
            } while ((b | 0) != (d | 0))
            u = g
            return
        }
        function Ie(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0.0
            a: do
                if (b >>> 0 <= 20)
                    do
                        switch (b | 0) {
                            case 9: {
                                d = ((f[c >> 2] | 0) + (4 - 1)) & ~(4 - 1)
                                e = f[d >> 2] | 0
                                f[c >> 2] = d + 4
                                f[a >> 2] = e
                                break a
                                break
                            }
                            case 10: {
                                e = ((f[c >> 2] | 0) + (4 - 1)) & ~(4 - 1)
                                d = f[e >> 2] | 0
                                f[c >> 2] = e + 4
                                e = a
                                f[e >> 2] = d
                                f[(e + 4) >> 2] = (((d | 0) < 0) << 31) >> 31
                                break a
                                break
                            }
                            case 11: {
                                d = ((f[c >> 2] | 0) + (4 - 1)) & ~(4 - 1)
                                e = f[d >> 2] | 0
                                f[c >> 2] = d + 4
                                d = a
                                f[d >> 2] = e
                                f[(d + 4) >> 2] = 0
                                break a
                                break
                            }
                            case 12: {
                                d = ((f[c >> 2] | 0) + (8 - 1)) & ~(8 - 1)
                                e = d
                                g = f[e >> 2] | 0
                                h = f[(e + 4) >> 2] | 0
                                f[c >> 2] = d + 8
                                d = a
                                f[d >> 2] = g
                                f[(d + 4) >> 2] = h
                                break a
                                break
                            }
                            case 13: {
                                h = ((f[c >> 2] | 0) + (4 - 1)) & ~(4 - 1)
                                d = f[h >> 2] | 0
                                f[c >> 2] = h + 4
                                h = ((d & 65535) << 16) >> 16
                                d = a
                                f[d >> 2] = h
                                f[(d + 4) >> 2] = (((h | 0) < 0) << 31) >> 31
                                break a
                                break
                            }
                            case 14: {
                                h = ((f[c >> 2] | 0) + (4 - 1)) & ~(4 - 1)
                                d = f[h >> 2] | 0
                                f[c >> 2] = h + 4
                                h = a
                                f[h >> 2] = d & 65535
                                f[(h + 4) >> 2] = 0
                                break a
                                break
                            }
                            case 15: {
                                h = ((f[c >> 2] | 0) + (4 - 1)) & ~(4 - 1)
                                d = f[h >> 2] | 0
                                f[c >> 2] = h + 4
                                h = ((d & 255) << 24) >> 24
                                d = a
                                f[d >> 2] = h
                                f[(d + 4) >> 2] = (((h | 0) < 0) << 31) >> 31
                                break a
                                break
                            }
                            case 16: {
                                h = ((f[c >> 2] | 0) + (4 - 1)) & ~(4 - 1)
                                d = f[h >> 2] | 0
                                f[c >> 2] = h + 4
                                h = a
                                f[h >> 2] = d & 255
                                f[(h + 4) >> 2] = 0
                                break a
                                break
                            }
                            case 17: {
                                h = ((f[c >> 2] | 0) + (8 - 1)) & ~(8 - 1)
                                i = +p[h >> 3]
                                f[c >> 2] = h + 8
                                p[a >> 3] = i
                                break a
                                break
                            }
                            case 18: {
                                h = ((f[c >> 2] | 0) + (8 - 1)) & ~(8 - 1)
                                i = +p[h >> 3]
                                f[c >> 2] = h + 8
                                p[a >> 3] = i
                                break a
                                break
                            }
                            default:
                                break a
                        }
                    while (0)
            while (0)
            return
        }
        function Je(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 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
            c = u
            u = (u + 16) | 0
            d = (c + 4) | 0
            e = c
            g = (c + 8) | 0
            if (!(Qa[f[((f[a >> 2] | 0) + 32) >> 2] & 127](a) | 0)) {
                h = 0
                u = c
                return h | 0
            }
            i = (a + 44) | 0
            j = f[i >> 2] | 0
            k = (a + 8) | 0
            l = (a + 12) | 0
            m = f[l >> 2] | 0
            n = f[k >> 2] | 0
            b[g >> 0] = ((m - n) | 0) >>> 2
            o = (j + 16) | 0
            p = f[(o + 4) >> 2] | 0
            if (((p | 0) > 0) | (((p | 0) == 0) & ((f[o >> 2] | 0) >>> 0 > 0))) {
                q = k
                r = n
                s = m
            } else {
                f[e >> 2] = f[(j + 4) >> 2]
                f[d >> 2] = f[e >> 2]
                ye(j, d, g, (g + 1) | 0) | 0
                q = k
                r = f[k >> 2] | 0
                s = f[l >> 2] | 0
            }
            a: do
                if ((r | 0) != (s | 0)) {
                    l = (a + 4) | 0
                    k = r
                    while (1) {
                        g = f[k >> 2] | 0
                        k = (k + 4) | 0
                        if (!(Sa[f[((f[g >> 2] | 0) + 8) >> 2] & 31](g, a, f[l >> 2] | 0) | 0)) {
                            h = 0
                            break
                        }
                        if ((k | 0) == (s | 0)) break a
                    }
                    u = c
                    return h | 0
                }
            while (0)
            if (!(vc(a) | 0)) {
                h = 0
                u = c
                return h | 0
            }
            s = (a + 32) | 0
            r = f[s >> 2] | 0
            k = (a + 36) | 0
            l = f[k >> 2] | 0
            b: do
                if ((r | 0) != (l | 0)) {
                    g = r
                    do {
                        if (!(Ra[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a, f[g >> 2] | 0) | 0)) {
                            h = 0
                            t = 18
                            break
                        }
                        g = (g + 4) | 0
                    } while ((g | 0) != (l | 0))
                    if ((t | 0) == 18) {
                        u = c
                        return h | 0
                    }
                    g = f[s >> 2] | 0
                    d = f[k >> 2] | 0
                    if ((g | 0) != (d | 0)) {
                        j = g
                        while (1) {
                            g = f[((f[q >> 2] | 0) + (f[j >> 2] << 2)) >> 2] | 0
                            j = (j + 4) | 0
                            if (!(Ra[f[((f[g >> 2] | 0) + 12) >> 2] & 127](g, f[i >> 2] | 0) | 0)) {
                                h = 0
                                break
                            }
                            if ((j | 0) == (d | 0)) break b
                        }
                        u = c
                        return h | 0
                    }
                }
            while (0)
            h = Qa[f[((f[a >> 2] | 0) + 44) >> 2] & 127](a) | 0
            u = c
            return h | 0
        }
        function Ke(a, b) {
            a = a | 0
            b = b | 0
            fd(a, b)
            fd((a + 32) | 0, b)
            fd((a + 64) | 0, b)
            fd((a + 96) | 0, b)
            fd((a + 128) | 0, b)
            fd((a + 160) | 0, b)
            fd((a + 192) | 0, b)
            fd((a + 224) | 0, b)
            fd((a + 256) | 0, b)
            fd((a + 288) | 0, b)
            fd((a + 320) | 0, b)
            fd((a + 352) | 0, b)
            fd((a + 384) | 0, b)
            fd((a + 416) | 0, b)
            fd((a + 448) | 0, b)
            fd((a + 480) | 0, b)
            fd((a + 512) | 0, b)
            fd((a + 544) | 0, b)
            fd((a + 576) | 0, b)
            fd((a + 608) | 0, b)
            fd((a + 640) | 0, b)
            fd((a + 672) | 0, b)
            fd((a + 704) | 0, b)
            fd((a + 736) | 0, b)
            fd((a + 768) | 0, b)
            fd((a + 800) | 0, b)
            fd((a + 832) | 0, b)
            fd((a + 864) | 0, b)
            fd((a + 896) | 0, b)
            fd((a + 928) | 0, b)
            fd((a + 960) | 0, b)
            fd((a + 992) | 0, b)
            fd((a + 1024) | 0, b)
            return
        }
        function Le(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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
            e = u
            u = (u + 64) | 0
            g = (e + 60) | 0
            h = e
            i = dn(80) | 0
            j = f[(c + 8) >> 2] | 0
            f[(i + 4) >> 2] = 0
            f[i >> 2] = 3232
            k = (i + 8) | 0
            l = (i + 12) | 0
            m = (l + 44) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (m | 0))
            f[k >> 2] = 3256
            n = (i + 56) | 0
            f[n >> 2] = 0
            f[(i + 60) >> 2] = 0
            f[(i + 64) >> 2] = 0
            f[(i + 68) >> 2] = j
            f[(i + 72) >> 2] = d
            o = (i + 76) | 0
            f[o >> 2] = 0
            p = i
            q = f[(c + 12) >> 2] | 0
            r = (h + 4) | 0
            l = (r + 4) | 0
            m = (l + 40) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (m | 0))
            f[h >> 2] = 3256
            l = (h + 48) | 0
            f[l >> 2] = 0
            m = (h + 52) | 0
            f[m >> 2] = 0
            f[(h + 56) >> 2] = 0
            s = q
            f[r >> 2] = s
            t = (((((f[(s + 4) >> 2] | 0) - (f[q >> 2] | 0)) >> 2) >>> 0) / 3) | 0
            b[g >> 0] = 0
            Xg((h + 24) | 0, t, g)
            t = f[r >> 2] | 0
            r = ((f[(t + 28) >> 2] | 0) - (f[(t + 24) >> 2] | 0)) >> 2
            b[g >> 0] = 0
            Xg((h + 36) | 0, r, g)
            f[(h + 8) >> 2] = q
            f[(h + 12) >> 2] = d
            f[(h + 16) >> 2] = j
            f[(h + 20) >> 2] = i
            f[o >> 2] = c + 72
            ef(k, h) | 0
            Yf(n, f[l >> 2] | 0, f[m >> 2] | 0)
            f[a >> 2] = p
            f[h >> 2] = 3256
            p = f[l >> 2] | 0
            if (p | 0) {
                l = f[m >> 2] | 0
                if ((l | 0) != (p | 0)) f[m >> 2] = l + (~(((l + -4 - p) | 0) >>> 2) << 2)
                br(p)
            }
            f[h >> 2] = 3276
            p = f[(h + 36) >> 2] | 0
            if (p | 0) br(p)
            p = f[(h + 24) >> 2] | 0
            if (!p) {
                u = e
                return
            }
            br(p)
            u = e
            return
        }
        function Me(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0
            c = u
            u = (u + 32) | 0
            d = c
            e = (a + 4) | 0
            g = f[a >> 2] | 0
            h = ((f[e >> 2] | 0) - g) >> 2
            i = (h + 1) | 0
            if (i >>> 0 > 1073741823) mq(a)
            j = (a + 8) | 0
            k = ((f[j >> 2] | 0) - g) | 0
            g = k >> 1
            l = (k >> 2) >>> 0 < 536870911 ? (g >>> 0 < i >>> 0 ? i : g) : 1073741823
            f[(d + 12) >> 2] = 0
            f[(d + 16) >> 2] = a + 8
            do
                if (l)
                    if (l >>> 0 > 1073741823) {
                        g = ra(8) | 0
                        Wo(g, 14941)
                        f[g >> 2] = 6944
                        va(g | 0, 1080, 114)
                    } else {
                        m = dn(l << 2) | 0
                        break
                    }
                else m = 0
            while (0)
            f[d >> 2] = m
            g = (m + (h << 2)) | 0
            h = (d + 8) | 0
            i = (d + 4) | 0
            f[i >> 2] = g
            k = (m + (l << 2)) | 0
            l = (d + 12) | 0
            f[l >> 2] = k
            m = f[b >> 2] | 0
            f[b >> 2] = 0
            f[g >> 2] = m
            m = (g + 4) | 0
            f[h >> 2] = m
            b = f[a >> 2] | 0
            n = f[e >> 2] | 0
            if ((n | 0) == (b | 0)) {
                o = g
                p = l
                q = h
                r = b
                s = m
                t = n
                v = k
                w = o
                f[a >> 2] = w
                f[i >> 2] = r
                f[e >> 2] = s
                f[q >> 2] = t
                x = f[j >> 2] | 0
                f[j >> 2] = v
                f[p >> 2] = x
                f[d >> 2] = r
                Wh(d)
                u = c
                return
            } else {
                y = n
                z = g
            }
            do {
                y = (y + -4) | 0
                g = f[y >> 2] | 0
                f[y >> 2] = 0
                f[(z + -4) >> 2] = g
                z = ((f[i >> 2] | 0) + -4) | 0
                f[i >> 2] = z
            } while ((y | 0) != (b | 0))
            o = z
            p = l
            q = h
            r = f[a >> 2] | 0
            s = f[h >> 2] | 0
            t = f[e >> 2] | 0
            v = f[l >> 2] | 0
            w = o
            f[a >> 2] = w
            f[i >> 2] = r
            f[e >> 2] = s
            f[q >> 2] = t
            x = f[j >> 2] | 0
            f[j >> 2] = v
            f[p >> 2] = x
            f[d >> 2] = r
            Wh(d)
            u = c
            return
        }
        function Ne(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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
            d = u
            u = (u + 32) | 0
            e = (d + 12) | 0
            g = d
            h = hl(c, 0) | 0
            if (!h) {
                f[a >> 2] = 0
                u = d
                return
            }
            i = f[(c + 100) >> 2] | 0
            j = f[(c + 96) >> 2] | 0
            c = (i - j) | 0
            k = ((c | 0) / 12) | 0
            f[e >> 2] = 0
            l = (e + 4) | 0
            f[l >> 2] = 0
            f[(e + 8) >> 2] = 0
            m = j
            do
                if (c)
                    if (k >>> 0 > 357913941) mq(e)
                    else {
                        n = dn(c) | 0
                        f[e >> 2] = n
                        f[(e + 8) >> 2] = n + ((k * 12) | 0)
                        hj(n | 0, 0, c | 0) | 0
                        f[l >> 2] = n + c
                        o = n
                        break
                    }
                else o = 0
            while (0)
            f[g >> 2] = 0
            f[(g + 4) >> 2] = 0
            f[(g + 8) >> 2] = 0
            a: do
                if ((i | 0) != (j | 0)) {
                    c = (g + 4) | 0
                    n = (g + 8) | 0
                    if (b[(h + 84) >> 0] | 0) {
                        p = 0
                        while (1) {
                            q = (m + ((p * 12) | 0)) | 0
                            f[g >> 2] = f[q >> 2]
                            f[(g + 4) >> 2] = f[(q + 4) >> 2]
                            f[(g + 8) >> 2] = f[(q + 8) >> 2]
                            f[(o + ((p * 12) | 0)) >> 2] = f[g >> 2]
                            f[(o + ((p * 12) | 0) + 4) >> 2] = f[c >> 2]
                            f[(o + ((p * 12) | 0) + 8) >> 2] = f[n >> 2]
                            p = (p + 1) | 0
                            if (p >>> 0 >= k >>> 0) break a
                        }
                    }
                    p = f[(h + 68) >> 2] | 0
                    q = 0
                    do {
                        r = f[(p + (f[(m + ((q * 12) | 0)) >> 2] << 2)) >> 2] | 0
                        f[g >> 2] = r
                        s = f[(p + (f[(m + ((q * 12) | 0) + 4) >> 2] << 2)) >> 2] | 0
                        f[c >> 2] = s
                        t = f[(p + (f[(m + ((q * 12) | 0) + 8) >> 2] << 2)) >> 2] | 0
                        f[n >> 2] = t
                        f[(o + ((q * 12) | 0)) >> 2] = r
                        f[(o + ((q * 12) | 0) + 4) >> 2] = s
                        f[(o + ((q * 12) | 0) + 8) >> 2] = t
                        q = (q + 1) | 0
                    } while (q >>> 0 < k >>> 0)
                }
            while (0)
            Cj(a, e)
            a = f[e >> 2] | 0
            if (a | 0) {
                e = f[l >> 2] | 0
                if ((e | 0) != (a | 0)) f[l >> 2] = e + ((~(((((e + -12 - a) | 0) >>> 0) / 12) | 0) * 12) | 0)
                br(a)
            }
            u = d
            return
        }
        function Oe(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            c = u
            u = (u + 16) | 0
            d = c
            f[a >> 2] = 0
            f[(a + 8) >> 2] = b
            rn((a + 12) | 0)
            to((a + 44) | 0)
            to((a + 64) | 0)
            to((a + 84) | 0)
            e = (a + 104) | 0
            f[e >> 2] = 0
            g = (a + 108) | 0
            f[g >> 2] = 0
            f[(a + 112) >> 2] = 0
            h = (b | 0) == 0
            do
                if (!h)
                    if (b >>> 0 > 1073741823) mq(e)
                    else {
                        i = b << 2
                        j = dn(i) | 0
                        f[e >> 2] = j
                        k = (j + (b << 2)) | 0
                        f[(a + 112) >> 2] = k
                        hj(j | 0, 0, i | 0) | 0
                        f[g >> 2] = k
                        break
                    }
            while (0)
            g = (a + 116) | 0
            f[g >> 2] = 0
            e = (a + 120) | 0
            f[e >> 2] = 0
            f[(a + 124) >> 2] = 0
            if (!h) {
                k = b << 2
                i = dn(k) | 0
                f[g >> 2] = i
                g = (i + (b << 2)) | 0
                f[(a + 124) >> 2] = g
                hj(i | 0, 0, k | 0) | 0
                f[e >> 2] = g
            }
            g = (a + 128) | 0
            f[g >> 2] = 0
            e = (a + 132) | 0
            f[e >> 2] = 0
            f[(a + 136) >> 2] = 0
            if (!h) {
                k = b << 2
                i = dn(k) | 0
                f[g >> 2] = i
                g = (i + (b << 2)) | 0
                f[(a + 136) >> 2] = g
                hj(i | 0, 0, k | 0) | 0
                f[e >> 2] = g
            }
            g = (b << 5) | 1
            f[d >> 2] = 0
            e = (d + 4) | 0
            f[e >> 2] = 0
            f[(d + 8) >> 2] = 0
            if (!h) {
                k = b << 2
                i = dn(k) | 0
                f[d >> 2] = i
                j = (i + (b << 2)) | 0
                f[(d + 8) >> 2] = j
                hj(i | 0, 0, k | 0) | 0
                f[e >> 2] = j
            }
            fk((a + 140) | 0, g, d)
            j = f[d >> 2] | 0
            if (j | 0) {
                k = f[e >> 2] | 0
                if ((k | 0) != (j | 0)) f[e >> 2] = k + (~(((k + -4 - j) | 0) >>> 2) << 2)
                br(j)
            }
            f[d >> 2] = 0
            j = (d + 4) | 0
            f[j >> 2] = 0
            f[(d + 8) >> 2] = 0
            if (!h) {
                h = b << 2
                k = dn(h) | 0
                f[d >> 2] = k
                e = (k + (b << 2)) | 0
                f[(d + 8) >> 2] = e
                hj(k | 0, 0, h | 0) | 0
                f[j >> 2] = e
            }
            fk((a + 152) | 0, g, d)
            g = f[d >> 2] | 0
            if (!g) {
                u = c
                return
            }
            d = f[j >> 2] | 0
            if ((d | 0) != (g | 0)) f[j >> 2] = d + (~(((d + -4 - g) | 0) >>> 2) << 2)
            br(g)
            u = c
            return
        }
        function Pe(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            c = u
            u = (u + 16) | 0
            d = c
            f[a >> 2] = 0
            f[(a + 8) >> 2] = b
            to((a + 12) | 0)
            to((a + 32) | 0)
            to((a + 52) | 0)
            to((a + 72) | 0)
            e = (a + 92) | 0
            f[e >> 2] = 0
            g = (a + 96) | 0
            f[g >> 2] = 0
            f[(a + 100) >> 2] = 0
            h = (b | 0) == 0
            do
                if (!h)
                    if (b >>> 0 > 1073741823) mq(e)
                    else {
                        i = b << 2
                        j = dn(i) | 0
                        f[e >> 2] = j
                        k = (j + (b << 2)) | 0
                        f[(a + 100) >> 2] = k
                        hj(j | 0, 0, i | 0) | 0
                        f[g >> 2] = k
                        break
                    }
            while (0)
            g = (a + 104) | 0
            f[g >> 2] = 0
            e = (a + 108) | 0
            f[e >> 2] = 0
            f[(a + 112) >> 2] = 0
            if (!h) {
                k = b << 2
                i = dn(k) | 0
                f[g >> 2] = i
                g = (i + (b << 2)) | 0
                f[(a + 112) >> 2] = g
                hj(i | 0, 0, k | 0) | 0
                f[e >> 2] = g
            }
            g = (a + 116) | 0
            f[g >> 2] = 0
            e = (a + 120) | 0
            f[e >> 2] = 0
            f[(a + 124) >> 2] = 0
            if (!h) {
                k = b << 2
                i = dn(k) | 0
                f[g >> 2] = i
                g = (i + (b << 2)) | 0
                f[(a + 124) >> 2] = g
                hj(i | 0, 0, k | 0) | 0
                f[e >> 2] = g
            }
            g = (b << 5) | 1
            f[d >> 2] = 0
            e = (d + 4) | 0
            f[e >> 2] = 0
            f[(d + 8) >> 2] = 0
            if (!h) {
                k = b << 2
                i = dn(k) | 0
                f[d >> 2] = i
                j = (i + (b << 2)) | 0
                f[(d + 8) >> 2] = j
                hj(i | 0, 0, k | 0) | 0
                f[e >> 2] = j
            }
            fk((a + 128) | 0, g, d)
            j = f[d >> 2] | 0
            if (j | 0) {
                k = f[e >> 2] | 0
                if ((k | 0) != (j | 0)) f[e >> 2] = k + (~(((k + -4 - j) | 0) >>> 2) << 2)
                br(j)
            }
            f[d >> 2] = 0
            j = (d + 4) | 0
            f[j >> 2] = 0
            f[(d + 8) >> 2] = 0
            if (!h) {
                h = b << 2
                k = dn(h) | 0
                f[d >> 2] = k
                e = (k + (b << 2)) | 0
                f[(d + 8) >> 2] = e
                hj(k | 0, 0, h | 0) | 0
                f[j >> 2] = e
            }
            fk((a + 140) | 0, g, d)
            g = f[d >> 2] | 0
            if (!g) {
                u = c
                return
            }
            d = f[j >> 2] | 0
            if ((d | 0) != (g | 0)) f[j >> 2] = d + (~(((d + -4 - g) | 0) >>> 2) << 2)
            br(g)
            u = c
            return
        }
        function Qe(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0
            d = dn(40) | 0
            e = (d + 16) | 0
            dj(e, c)
            dj((d + 28) | 0, (c + 12) | 0)
            c = (a + 4) | 0
            g = f[c >> 2] | 0
            do
                if (g) {
                    h = b[(d + 27) >> 0] | 0
                    i = (h << 24) >> 24 < 0
                    j = i ? f[(d + 20) >> 2] | 0 : h & 255
                    h = i ? f[e >> 2] | 0 : e
                    i = g
                    while (1) {
                        k = (i + 16) | 0
                        l = b[(k + 11) >> 0] | 0
                        m = (l << 24) >> 24 < 0
                        n = m ? f[(i + 20) >> 2] | 0 : l & 255
                        l = n >>> 0 < j >>> 0 ? n : j
                        if ((l | 0) != 0 ? ((o = Pk(h, m ? f[k >> 2] | 0 : k, l) | 0), (o | 0) != 0) : 0)
                            if ((o | 0) < 0) p = 7
                            else p = 9
                        else if (j >>> 0 < n >>> 0) p = 7
                        else p = 9
                        if ((p | 0) == 7) {
                            p = 0
                            n = f[i >> 2] | 0
                            if (!n) {
                                p = 8
                                break
                            } else q = n
                        } else if ((p | 0) == 9) {
                            p = 0
                            r = (i + 4) | 0
                            n = f[r >> 2] | 0
                            if (!n) {
                                p = 11
                                break
                            } else q = n
                        }
                        i = q
                    }
                    if ((p | 0) == 8) {
                        s = i
                        t = i
                        break
                    } else if ((p | 0) == 11) {
                        s = i
                        t = r
                        break
                    }
                } else {
                    s = c
                    t = c
                }
            while (0)
            f[d >> 2] = 0
            f[(d + 4) >> 2] = 0
            f[(d + 8) >> 2] = s
            f[t >> 2] = d
            s = f[f[a >> 2] >> 2] | 0
            if (!s) {
                u = d
                v = (a + 4) | 0
                w = f[v >> 2] | 0
                Ae(w, u)
                x = (a + 8) | 0
                y = f[x >> 2] | 0
                z = (y + 1) | 0
                f[x >> 2] = z
                return d | 0
            }
            f[a >> 2] = s
            u = f[t >> 2] | 0
            v = (a + 4) | 0
            w = f[v >> 2] | 0
            Ae(w, u)
            x = (a + 8) | 0
            y = f[x >> 2] | 0
            z = (y + 1) | 0
            f[x >> 2] = z
            return d | 0
        }
        function Re(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = Oa,
                B = Oa
            g = u
            u = (u + 16) | 0
            h = g
            i = b[(d + 24) >> 0] | 0
            j = (i << 24) >> 24
            Bh(a, c, e, j, 0, d, 1)
            k = f[a >> 2] | 0
            a = ((f[f[k >> 2] >> 2] | 0) + (f[(k + 48) >> 2] | 0)) | 0
            k = f[(c + 4) >> 2] | 0
            sq(h)
            yo(h, $(n[(c + 20) >> 2]), ((1 << k) + -1) | 0)
            k = _q(j >>> 0 > 1073741823 ? -1 : j << 2) | 0
            if (!e) {
                $q(k)
                u = g
                return
            }
            l = (d + 68) | 0
            m = (d + 48) | 0
            o = (d + 40) | 0
            p = (c + 8) | 0
            c = (b[(d + 84) >> 0] | 0) == 0
            if ((i << 24) >> 24 > 0) {
                q = 0
                r = 0
            } else {
                i = 0
                do {
                    if (c) s = f[((f[l >> 2] | 0) + (i << 2)) >> 2] | 0
                    else s = i
                    t = m
                    v = f[t >> 2] | 0
                    w = f[(t + 4) >> 2] | 0
                    t = o
                    x = f[t >> 2] | 0
                    y = on(x | 0, f[(t + 4) >> 2] | 0, s | 0, 0) | 0
                    t = Tn(y | 0, I | 0, v | 0, w | 0) | 0
                    Rg(k | 0, ((f[f[d >> 2] >> 2] | 0) + t) | 0, x | 0) | 0
                    i = (i + 1) | 0
                } while ((i | 0) != (e | 0))
                $q(k)
                u = g
                return
            }
            while (1) {
                if (c) z = f[((f[l >> 2] | 0) + (r << 2)) >> 2] | 0
                else z = r
                i = m
                s = f[i >> 2] | 0
                x = f[(i + 4) >> 2] | 0
                i = o
                t = f[i >> 2] | 0
                w = on(t | 0, f[(i + 4) >> 2] | 0, z | 0, 0) | 0
                i = Tn(w | 0, I | 0, s | 0, x | 0) | 0
                Rg(k | 0, ((f[f[d >> 2] >> 2] | 0) + i) | 0, t | 0) | 0
                t = f[p >> 2] | 0
                A = $(n[h >> 2])
                i = 0
                x = q
                while (1) {
                    B = $(n[(k + (i << 2)) >> 2])
                    s = ~~$(J($($(A * $(B - $(n[(t + (i << 2)) >> 2]))) + $(0.5))))
                    f[(a + (x << 2)) >> 2] = s
                    i = (i + 1) | 0
                    if ((i | 0) == (j | 0)) break
                    else x = (x + 1) | 0
                }
                r = (r + 1) | 0
                if ((r | 0) == (e | 0)) break
                else q = (q + j) | 0
            }
            $q(k)
            u = g
            return
        }
        function Se(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 3340
            ii((a + 200) | 0)
            b = f[(a + 184) >> 2] | 0
            if (b | 0) {
                c = (a + 188) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            _i((a + 172) | 0)
            b = f[(a + 152) >> 2] | 0
            if (b | 0) {
                d = (a + 156) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 140) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 128) >> 2] | 0
            if (b | 0) {
                c = b
                do {
                    b = c
                    c = f[c >> 2] | 0
                    br(b)
                } while ((c | 0) != 0)
            }
            c = (a + 120) | 0
            b = f[c >> 2] | 0
            f[c >> 2] = 0
            if (b | 0) br(b)
            b = f[(a + 108) >> 2] | 0
            if (b | 0) {
                c = (a + 112) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + ((~(((((d + -12 - b) | 0) >>> 0) / 12) | 0) * 12) | 0)
                br(b)
            }
            b = f[(a + 96) >> 2] | 0
            if (b | 0) {
                d = (a + 100) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 84) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 72) >> 2] | 0
            if (b | 0) {
                c = (a + 76) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 52) >> 2] | 0
            if (b | 0) {
                d = (a + 56) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 40) >> 2] | 0
            if (b | 0) {
                c = (a + 44) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 28) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 16) >> 2] | 0
            if (b | 0) {
                d = (a + 20) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = (a + 12) | 0
            a = f[b >> 2] | 0
            f[b >> 2] = 0
            if (!a) return
            ui(a)
            br(a)
            return
        }
        function Te(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0
            b = (a + 140) | 0
            c = f[b >> 2] | 0
            if (c | 0) {
                d = (a + 144) | 0
                e = f[d >> 2] | 0
                if ((e | 0) == (c | 0)) g = c
                else {
                    h = e
                    while (1) {
                        e = (h + -12) | 0
                        f[d >> 2] = e
                        i = f[e >> 2] | 0
                        if (!i) j = e
                        else {
                            e = (h + -8) | 0
                            k = f[e >> 2] | 0
                            if ((k | 0) != (i | 0)) f[e >> 2] = k + (~(((k + -4 - i) | 0) >>> 2) << 2)
                            br(i)
                            j = f[d >> 2] | 0
                        }
                        if ((j | 0) == (c | 0)) break
                        else h = j
                    }
                    g = f[b >> 2] | 0
                }
                br(g)
            }
            g = (a + 128) | 0
            b = f[g >> 2] | 0
            if (b | 0) {
                j = (a + 132) | 0
                h = f[j >> 2] | 0
                if ((h | 0) == (b | 0)) l = b
                else {
                    c = h
                    while (1) {
                        h = (c + -12) | 0
                        f[j >> 2] = h
                        d = f[h >> 2] | 0
                        if (!d) m = h
                        else {
                            h = (c + -8) | 0
                            i = f[h >> 2] | 0
                            if ((i | 0) != (d | 0)) f[h >> 2] = i + (~(((i + -4 - d) | 0) >>> 2) << 2)
                            br(d)
                            m = f[j >> 2] | 0
                        }
                        if ((m | 0) == (b | 0)) break
                        else c = m
                    }
                    l = f[g >> 2] | 0
                }
                br(l)
            }
            l = f[(a + 116) >> 2] | 0
            if (l | 0) {
                g = (a + 120) | 0
                m = f[g >> 2] | 0
                if ((m | 0) != (l | 0)) f[g >> 2] = m + (~(((m + -4 - l) | 0) >>> 2) << 2)
                br(l)
            }
            l = f[(a + 104) >> 2] | 0
            if (l | 0) {
                m = (a + 108) | 0
                g = f[m >> 2] | 0
                if ((g | 0) != (l | 0)) f[m >> 2] = g + (~(((g + -4 - l) | 0) >>> 2) << 2)
                br(l)
            }
            l = f[(a + 92) >> 2] | 0
            if (!l) {
                n = (a + 72) | 0
                dl(n)
                o = (a + 52) | 0
                dl(o)
                p = (a + 32) | 0
                dl(p)
                q = (a + 12) | 0
                dl(q)
                return
            }
            g = (a + 96) | 0
            m = f[g >> 2] | 0
            if ((m | 0) != (l | 0)) f[g >> 2] = m + (~(((m + -4 - l) | 0) >>> 2) << 2)
            br(l)
            n = (a + 72) | 0
            dl(n)
            o = (a + 52) | 0
            dl(o)
            p = (a + 32) | 0
            dl(p)
            q = (a + 12) | 0
            dl(q)
            return
        }
        function Ue(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0
            b = (a + 152) | 0
            c = f[b >> 2] | 0
            if (c | 0) {
                d = (a + 156) | 0
                e = f[d >> 2] | 0
                if ((e | 0) == (c | 0)) g = c
                else {
                    h = e
                    while (1) {
                        e = (h + -12) | 0
                        f[d >> 2] = e
                        i = f[e >> 2] | 0
                        if (!i) j = e
                        else {
                            e = (h + -8) | 0
                            k = f[e >> 2] | 0
                            if ((k | 0) != (i | 0)) f[e >> 2] = k + (~(((k + -4 - i) | 0) >>> 2) << 2)
                            br(i)
                            j = f[d >> 2] | 0
                        }
                        if ((j | 0) == (c | 0)) break
                        else h = j
                    }
                    g = f[b >> 2] | 0
                }
                br(g)
            }
            g = (a + 140) | 0
            b = f[g >> 2] | 0
            if (b | 0) {
                j = (a + 144) | 0
                h = f[j >> 2] | 0
                if ((h | 0) == (b | 0)) l = b
                else {
                    c = h
                    while (1) {
                        h = (c + -12) | 0
                        f[j >> 2] = h
                        d = f[h >> 2] | 0
                        if (!d) m = h
                        else {
                            h = (c + -8) | 0
                            i = f[h >> 2] | 0
                            if ((i | 0) != (d | 0)) f[h >> 2] = i + (~(((i + -4 - d) | 0) >>> 2) << 2)
                            br(d)
                            m = f[j >> 2] | 0
                        }
                        if ((m | 0) == (b | 0)) break
                        else c = m
                    }
                    l = f[g >> 2] | 0
                }
                br(l)
            }
            l = f[(a + 128) >> 2] | 0
            if (l | 0) {
                g = (a + 132) | 0
                m = f[g >> 2] | 0
                if ((m | 0) != (l | 0)) f[g >> 2] = m + (~(((m + -4 - l) | 0) >>> 2) << 2)
                br(l)
            }
            l = f[(a + 116) >> 2] | 0
            if (l | 0) {
                m = (a + 120) | 0
                g = f[m >> 2] | 0
                if ((g | 0) != (l | 0)) f[m >> 2] = g + (~(((g + -4 - l) | 0) >>> 2) << 2)
                br(l)
            }
            l = f[(a + 104) >> 2] | 0
            if (!l) {
                n = (a + 84) | 0
                dl(n)
                o = (a + 64) | 0
                dl(o)
                p = (a + 44) | 0
                dl(p)
                q = (a + 12) | 0
                tj(q)
                return
            }
            g = (a + 108) | 0
            m = f[g >> 2] | 0
            if ((m | 0) != (l | 0)) f[g >> 2] = m + (~(((m + -4 - l) | 0) >>> 2) << 2)
            br(l)
            n = (a + 84) | 0
            dl(n)
            o = (a + 64) | 0
            dl(o)
            p = (a + 44) | 0
            dl(p)
            q = (a + 12) | 0
            tj(q)
            return
        }
        function Ve(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 3080
            jj((a + 200) | 0)
            b = f[(a + 184) >> 2] | 0
            if (b | 0) {
                c = (a + 188) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            _i((a + 172) | 0)
            b = f[(a + 152) >> 2] | 0
            if (b | 0) {
                d = (a + 156) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 140) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 128) >> 2] | 0
            if (b | 0) {
                c = b
                do {
                    b = c
                    c = f[c >> 2] | 0
                    br(b)
                } while ((c | 0) != 0)
            }
            c = (a + 120) | 0
            b = f[c >> 2] | 0
            f[c >> 2] = 0
            if (b | 0) br(b)
            b = f[(a + 108) >> 2] | 0
            if (b | 0) {
                c = (a + 112) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + ((~(((((d + -12 - b) | 0) >>> 0) / 12) | 0) * 12) | 0)
                br(b)
            }
            b = f[(a + 96) >> 2] | 0
            if (b | 0) {
                d = (a + 100) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 84) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 72) >> 2] | 0
            if (b | 0) {
                c = (a + 76) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 52) >> 2] | 0
            if (b | 0) {
                d = (a + 56) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 40) >> 2] | 0
            if (b | 0) {
                c = (a + 44) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 28) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 16) >> 2] | 0
            if (b | 0) {
                d = (a + 20) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = (a + 12) | 0
            a = f[b >> 2] | 0
            f[b >> 2] = 0
            if (!a) return
            ui(a)
            br(a)
            return
        }
        function We(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0
            c = u
            u = (u + 48) | 0
            d = (c + 44) | 0
            e = (c + 40) | 0
            g = (c + 36) | 0
            h = (c + 32) | 0
            i = c
            f[h >> 2] = f[(a + 60) >> 2]
            j = (b + 16) | 0
            k = j
            l = f[(k + 4) >> 2] | 0
            if (!(((l | 0) > 0) | (((l | 0) == 0) & ((f[k >> 2] | 0) >>> 0 > 0)))) {
                f[e >> 2] = f[(b + 4) >> 2]
                f[d >> 2] = f[e >> 2]
                ye(b, d, h, (h + 4) | 0) | 0
            }
            rn(i)
            lk(i)
            if ((f[h >> 2] | 0) > 0) {
                k = (a + 56) | 0
                l = 1
                m = 0
                do {
                    n = l
                    l = ((f[((f[k >> 2] | 0) + ((m >>> 5) << 2)) >> 2] & (1 << (m & 31))) | 0) != 0
                    Vi(i, n ^ l ^ 1)
                    m = (m + 1) | 0
                } while ((m | 0) < (f[h >> 2] | 0))
            }
            fd(i, b)
            f[g >> 2] = f[(a + 12) >> 2]
            h = j
            m = f[h >> 2] | 0
            l = f[(h + 4) >> 2] | 0
            if (((l | 0) > 0) | (((l | 0) == 0) & (m >>> 0 > 0))) {
                o = l
                p = m
            } else {
                f[e >> 2] = f[(b + 4) >> 2]
                f[d >> 2] = f[e >> 2]
                ye(b, d, g, (g + 4) | 0) | 0
                m = j
                o = f[(m + 4) >> 2] | 0
                p = f[m >> 2] | 0
            }
            f[g >> 2] = f[(a + 20) >> 2]
            if (((o | 0) > 0) | (((o | 0) == 0) & (p >>> 0 > 0))) {
                tj(i)
                u = c
                return 1
            }
            f[e >> 2] = f[(b + 4) >> 2]
            f[d >> 2] = f[e >> 2]
            ye(b, d, g, (g + 4) | 0) | 0
            tj(i)
            u = c
            return 1
        }
        function Xe(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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
            d = f[c >> 2] | 0
            c = f[d >> 2] | 0
            e = f[(a + 4) >> 2] | 0
            g = f[(d + 4) >> 2] | 0
            h = (e + -1) | 0
            i = ((h & e) | 0) == 0
            if (!i)
                if (g >>> 0 < e >>> 0) j = g
                else j = (g >>> 0) % (e >>> 0) | 0
            else j = h & g
            g = ((f[a >> 2] | 0) + (j << 2)) | 0
            k = f[g >> 2] | 0
            while (1) {
                l = f[k >> 2] | 0
                if ((l | 0) == (d | 0)) break
                else k = l
            }
            if ((k | 0) != ((a + 8) | 0)) {
                l = f[(k + 4) >> 2] | 0
                if (!i)
                    if (l >>> 0 < e >>> 0) m = l
                    else m = (l >>> 0) % (e >>> 0) | 0
                else m = l & h
                if ((m | 0) == (j | 0)) {
                    n = c
                    o = 21
                } else o = 13
            } else o = 13
            do
                if ((o | 0) == 13) {
                    if (c | 0) {
                        m = f[(c + 4) >> 2] | 0
                        if (!i)
                            if (m >>> 0 < e >>> 0) p = m
                            else p = (m >>> 0) % (e >>> 0) | 0
                        else p = m & h
                        if ((p | 0) == (j | 0)) {
                            q = c
                            r = c
                            o = 22
                            break
                        }
                    }
                    f[g >> 2] = 0
                    n = f[d >> 2] | 0
                    o = 21
                }
            while (0)
            if ((o | 0) == 21) {
                g = n
                if (!n) s = g
                else {
                    q = n
                    r = g
                    o = 22
                }
            }
            if ((o | 0) == 22) {
                o = f[(q + 4) >> 2] | 0
                if (!i)
                    if (o >>> 0 < e >>> 0) t = o
                    else t = (o >>> 0) % (e >>> 0) | 0
                else t = o & h
                if ((t | 0) == (j | 0)) s = r
                else {
                    f[((f[a >> 2] | 0) + (t << 2)) >> 2] = k
                    s = f[d >> 2] | 0
                }
            }
            f[k >> 2] = s
            f[d >> 2] = 0
            s = (a + 12) | 0
            f[s >> 2] = (f[s >> 2] | 0) + -1
            if (!d) return c | 0
            s = (d + 8) | 0
            a = f[(d + 20) >> 2] | 0
            if (a | 0) {
                k = (d + 24) | 0
                if ((f[k >> 2] | 0) != (a | 0)) f[k >> 2] = a
                br(a)
            }
            if ((b[(s + 11) >> 0] | 0) < 0) br(f[s >> 2] | 0)
            br(d)
            return c | 0
        }
        function Ye(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0
            b = u
            u = (u + 16) | 0
            c = (b + 4) | 0
            d = b
            f[c >> 2] = 0
            e = (c + 4) | 0
            f[e >> 2] = 0
            f[(c + 8) >> 2] = 0
            g = (a + 56) | 0
            h = f[g >> 2] | 0
            i = ((f[(h + 100) >> 2] | 0) - (f[(h + 96) >> 2] | 0)) | 0
            j = ((i | 0) / 12) | 0
            if (!i) {
                k = 0
                l = 0
            } else {
                i = (c + 8) | 0
                m = 0
                n = 0
                o = h
                h = 0
                p = 0
                while (1) {
                    q = f[(o + 96) >> 2] | 0
                    r = f[(q + ((n * 12) | 0)) >> 2] | 0
                    s = (r - m) | 0
                    t = (((s | 0) > -1 ? s : (0 - s) | 0) << 1) | (s >>> 31)
                    f[d >> 2] = t
                    if ((h | 0) == (p | 0)) {
                        Ci(c, d)
                        v = f[e >> 2] | 0
                        w = f[i >> 2] | 0
                    } else {
                        f[h >> 2] = t
                        t = (h + 4) | 0
                        f[e >> 2] = t
                        v = t
                        w = p
                    }
                    t = f[(q + ((n * 12) | 0) + 4) >> 2] | 0
                    s = (t - r) | 0
                    r = (((s | 0) > -1 ? s : (0 - s) | 0) << 1) | (s >>> 31)
                    f[d >> 2] = r
                    if ((v | 0) == (w | 0)) {
                        Ci(c, d)
                        x = f[e >> 2] | 0
                        y = f[i >> 2] | 0
                    } else {
                        f[v >> 2] = r
                        r = (v + 4) | 0
                        f[e >> 2] = r
                        x = r
                        y = w
                    }
                    r = f[(q + ((n * 12) | 0) + 8) >> 2] | 0
                    q = (r - t) | 0
                    t = (((q | 0) > -1 ? q : (0 - q) | 0) << 1) | (q >>> 31)
                    f[d >> 2] = t
                    if ((x | 0) == (y | 0)) Ci(c, d)
                    else {
                        f[x >> 2] = t
                        f[e >> 2] = x + 4
                    }
                    t = (n + 1) | 0
                    if (t >>> 0 >= j >>> 0) break
                    m = r
                    n = t
                    o = f[g >> 2] | 0
                    h = f[e >> 2] | 0
                    p = f[i >> 2] | 0
                }
                k = f[c >> 2] | 0
                l = f[e >> 2] | 0
            }
            Dc(k, (l - k) >> 2, 1, 0, f[(a + 44) >> 2] | 0) | 0
            a = f[c >> 2] | 0
            if (!a) {
                u = b
                return 1
            }
            c = f[e >> 2] | 0
            if ((c | 0) != (a | 0)) f[e >> 2] = c + (~(((c + -4 - a) | 0) >>> 2) << 2)
            br(a)
            u = b
            return 1
        }
        function Ze(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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
            d = f[(a + 12) >> 2] | 0
            e = (a + 108) | 0
            g = f[e >> 2] | 0
            h = f[(g + 80) >> 2] | 0
            b[(c + 84) >> 0] = 0
            i = (c + 68) | 0
            j = (c + 72) | 0
            k = f[j >> 2] | 0
            l = f[i >> 2] | 0
            m = (k - l) >> 2
            n = l
            l = k
            if (h >>> 0 <= m >>> 0)
                if (h >>> 0 < m >>> 0 ? ((k = (n + (h << 2)) | 0), (k | 0) != (l | 0)) : 0) {
                    f[j >> 2] = l + (~(((l + -4 - k) | 0) >>> 2) << 2)
                    o = g
                    p = h
                } else {
                    o = g
                    p = h
                }
            else {
                kh(i, (h - m) | 0, 3220)
                m = f[e >> 2] | 0
                o = m
                p = f[(m + 80) >> 2] | 0
            }
            m = ((f[(o + 100) >> 2] | 0) - (f[(o + 96) >> 2] | 0)) | 0
            e = ((m | 0) / 12) | 0
            if (!m) {
                q = 1
                return q | 0
            }
            m = (a + 112) | 0
            a = (c + 68) | 0
            c = f[(o + 96) >> 2] | 0
            o = 0
            while (1) {
                h = (o * 3) | 0
                if ((h | 0) == -1) {
                    q = 0
                    r = 12
                    break
                }
                i = f[d >> 2] | 0
                g = f[(i + (h << 2)) >> 2] | 0
                if ((g | 0) == -1) {
                    q = 0
                    r = 12
                    break
                }
                k = f[((f[m >> 2] | 0) + 12) >> 2] | 0
                l = f[(k + (g << 2)) >> 2] | 0
                if (l >>> 0 >= p >>> 0) {
                    q = 0
                    r = 12
                    break
                }
                g = f[a >> 2] | 0
                f[(g + (f[(c + ((o * 12) | 0)) >> 2] << 2)) >> 2] = l
                l = (h + 1) | 0
                if ((l | 0) == -1) {
                    q = 0
                    r = 12
                    break
                }
                j = f[(i + (l << 2)) >> 2] | 0
                if ((j | 0) == -1) {
                    q = 0
                    r = 12
                    break
                }
                l = f[(k + (j << 2)) >> 2] | 0
                if (l >>> 0 >= p >>> 0) {
                    q = 0
                    r = 12
                    break
                }
                f[(g + (f[(c + ((o * 12) | 0) + 4) >> 2] << 2)) >> 2] = l
                l = (h + 2) | 0
                if ((l | 0) == -1) {
                    q = 0
                    r = 12
                    break
                }
                h = f[(i + (l << 2)) >> 2] | 0
                if ((h | 0) == -1) {
                    q = 0
                    r = 12
                    break
                }
                l = f[(k + (h << 2)) >> 2] | 0
                if (l >>> 0 >= p >>> 0) {
                    q = 0
                    r = 12
                    break
                }
                f[(g + (f[(c + ((o * 12) | 0) + 8) >> 2] << 2)) >> 2] = l
                o = (o + 1) | 0
                if (o >>> 0 >= e >>> 0) {
                    q = 1
                    r = 12
                    break
                }
            }
            if ((r | 0) == 12) return q | 0
            return 0
        }
        function _e(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0
            c = u
            u = (u + 48) | 0
            d = (c + 44) | 0
            e = (c + 40) | 0
            g = (c + 36) | 0
            h = (c + 32) | 0
            i = c
            f[h >> 2] = f[(a + 80) >> 2]
            j = (b + 16) | 0
            k = j
            l = f[(k + 4) >> 2] | 0
            if (!(((l | 0) > 0) | (((l | 0) == 0) & ((f[k >> 2] | 0) >>> 0 > 0)))) {
                f[e >> 2] = f[(b + 4) >> 2]
                f[d >> 2] = f[e >> 2]
                ye(b, d, h, (h + 4) | 0) | 0
            }
            rn(i)
            lk(i)
            if ((f[h >> 2] | 0) > 0) {
                k = (a + 76) | 0
                l = 1
                m = 0
                do {
                    n = l
                    l = ((f[((f[k >> 2] | 0) + ((m >>> 5) << 2)) >> 2] & (1 << (m & 31))) | 0) != 0
                    Vi(i, n ^ l ^ 1)
                    m = (m + 1) | 0
                } while ((m | 0) < (f[h >> 2] | 0))
            }
            fd(i, b)
            f[g >> 2] = f[(a + 12) >> 2]
            h = j
            m = f[h >> 2] | 0
            l = f[(h + 4) >> 2] | 0
            if (((l | 0) > 0) | (((l | 0) == 0) & (m >>> 0 > 0))) {
                o = l
                p = m
            } else {
                f[e >> 2] = f[(b + 4) >> 2]
                f[d >> 2] = f[e >> 2]
                ye(b, d, g, (g + 4) | 0) | 0
                m = j
                o = f[(m + 4) >> 2] | 0
                p = f[m >> 2] | 0
            }
            f[g >> 2] = f[(a + 16) >> 2]
            if (((o | 0) > 0) | (((o | 0) == 0) & (p >>> 0 > 0))) {
                tj(i)
                u = c
                return 1
            }
            f[e >> 2] = f[(b + 4) >> 2]
            f[d >> 2] = f[e >> 2]
            ye(b, d, g, (g + 4) | 0) | 0
            tj(i)
            u = c
            return 1
        }
        function $e(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0
            b = u
            u = (u + 16) | 0
            c = (b + 4) | 0
            d = b
            e = (a + 8) | 0
            g = (a + 12) | 0
            h = f[g >> 2] | 0
            $j(f[(a + 4) >> 2] | 0, ((f[(h + 28) >> 2] | 0) - (f[(h + 24) >> 2] | 0)) >> 2)
            h = (a + 96) | 0
            i = f[g >> 2] | 0
            j = ((f[(i + 28) >> 2] | 0) - (f[(i + 24) >> 2] | 0)) >> 2
            f[c >> 2] = 0
            i = (a + 100) | 0
            k = f[i >> 2] | 0
            l = f[h >> 2] | 0
            m = (k - l) >> 2
            n = l
            l = k
            if (j >>> 0 <= m >>> 0) {
                if (j >>> 0 < m >>> 0 ? ((k = (n + (j << 2)) | 0), (k | 0) != (l | 0)) : 0) f[i >> 2] = l + (~(((l + -4 - k) | 0) >>> 2) << 2)
            } else kh(h, (j - m) | 0, c)
            m = (a + 116) | 0
            a = f[m >> 2] | 0
            if (!a) {
                j = f[g >> 2] | 0
                g = ((f[(j + 4) >> 2] | 0) - (f[j >> 2] | 0)) >> 2
                j = ((g >>> 0) / 3) | 0
                if (g >>> 0 <= 2) {
                    o = 1
                    u = b
                    return o | 0
                }
                g = 0
                while (1) {
                    f[d >> 2] = g * 3
                    f[c >> 2] = f[d >> 2]
                    g = (g + 1) | 0
                    if (!(vb(e, c) | 0)) {
                        o = 0
                        p = 15
                        break
                    }
                    if ((g | 0) >= (j | 0)) {
                        o = 1
                        p = 15
                        break
                    }
                }
                if ((p | 0) == 15) {
                    u = b
                    return o | 0
                }
            } else {
                j = f[a >> 2] | 0
                if ((f[(a + 4) >> 2] | 0) == (j | 0)) {
                    o = 1
                    u = b
                    return o | 0
                }
                a = 0
                g = j
                while (1) {
                    f[d >> 2] = f[(g + (a << 2)) >> 2]
                    f[c >> 2] = f[d >> 2]
                    a = (a + 1) | 0
                    if (!(vb(e, c) | 0)) {
                        o = 0
                        p = 15
                        break
                    }
                    j = f[m >> 2] | 0
                    g = f[j >> 2] | 0
                    if (a >>> 0 >= (((f[(j + 4) >> 2] | 0) - g) >> 2) >>> 0) {
                        o = 1
                        p = 15
                        break
                    }
                }
                if ((p | 0) == 15) {
                    u = b
                    return o | 0
                }
            }
            return 0
        }
        function af(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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
            d = f[(a + 12) >> 2] | 0
            e = (a + 68) | 0
            g = f[e >> 2] | 0
            h = f[(g + 80) >> 2] | 0
            b[(c + 84) >> 0] = 0
            i = (c + 68) | 0
            j = (c + 72) | 0
            k = f[j >> 2] | 0
            l = f[i >> 2] | 0
            m = (k - l) >> 2
            n = l
            l = k
            if (h >>> 0 <= m >>> 0)
                if (h >>> 0 < m >>> 0 ? ((k = (n + (h << 2)) | 0), (k | 0) != (l | 0)) : 0) {
                    f[j >> 2] = l + (~(((l + -4 - k) | 0) >>> 2) << 2)
                    o = g
                    p = h
                } else {
                    o = g
                    p = h
                }
            else {
                kh(i, (h - m) | 0, 3220)
                m = f[e >> 2] | 0
                o = m
                p = f[(m + 80) >> 2] | 0
            }
            m = ((f[(o + 100) >> 2] | 0) - (f[(o + 96) >> 2] | 0)) | 0
            e = ((m | 0) / 12) | 0
            if (!m) {
                q = 1
                return q | 0
            }
            m = (a + 72) | 0
            a = (c + 68) | 0
            c = f[(o + 96) >> 2] | 0
            o = 0
            while (1) {
                h = (o * 3) | 0
                if ((h | 0) == -1) {
                    q = 0
                    r = 12
                    break
                }
                i = f[d >> 2] | 0
                g = f[(i + (h << 2)) >> 2] | 0
                if ((g | 0) == -1) {
                    q = 0
                    r = 12
                    break
                }
                k = f[((f[m >> 2] | 0) + 12) >> 2] | 0
                l = f[(k + (g << 2)) >> 2] | 0
                if (l >>> 0 >= p >>> 0) {
                    q = 0
                    r = 12
                    break
                }
                g = f[a >> 2] | 0
                f[(g + (f[(c + ((o * 12) | 0)) >> 2] << 2)) >> 2] = l
                l = (h + 1) | 0
                if ((l | 0) == -1) {
                    q = 0
                    r = 12
                    break
                }
                j = f[(i + (l << 2)) >> 2] | 0
                if ((j | 0) == -1) {
                    q = 0
                    r = 12
                    break
                }
                l = f[(k + (j << 2)) >> 2] | 0
                if (l >>> 0 >= p >>> 0) {
                    q = 0
                    r = 12
                    break
                }
                f[(g + (f[(c + ((o * 12) | 0) + 4) >> 2] << 2)) >> 2] = l
                l = (h + 2) | 0
                if ((l | 0) == -1) {
                    q = 0
                    r = 12
                    break
                }
                h = f[(i + (l << 2)) >> 2] | 0
                if ((h | 0) == -1) {
                    q = 0
                    r = 12
                    break
                }
                l = f[(k + (h << 2)) >> 2] | 0
                if (l >>> 0 >= p >>> 0) {
                    q = 0
                    r = 12
                    break
                }
                f[(g + (f[(c + ((o * 12) | 0) + 8) >> 2] << 2)) >> 2] = l
                o = (o + 1) | 0
                if (o >>> 0 >= e >>> 0) {
                    q = 1
                    r = 12
                    break
                }
            }
            if ((r | 0) == 12) return q | 0
            return 0
        }
        function bf(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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
            c = u
            u = (u + 16) | 0
            d = (c + 12) | 0
            e = (c + 8) | 0
            g = (c + 4) | 0
            h = c
            if (!b) {
                i = dn(76) | 0
                j = dn(12) | 0
                k = f[((f[(a + 4) >> 2] | 0) + 80) >> 2] | 0
                f[(j + 4) >> 2] = 0
                f[j >> 2] = 3584
                f[(j + 8) >> 2] = k
                f[h >> 2] = j
                ml(i, h, 0)
                j = i
                f[g >> 2] = j
                i = (a + 12) | 0
                k = f[i >> 2] | 0
                if (k >>> 0 < (f[(a + 16) >> 2] | 0) >>> 0) {
                    f[g >> 2] = 0
                    f[k >> 2] = j
                    f[i >> 2] = k + 4
                    l = g
                } else {
                    yg((a + 8) | 0, g)
                    l = g
                }
                g = f[l >> 2] | 0
                f[l >> 2] = 0
                if (g | 0) Va[f[((f[g >> 2] | 0) + 4) >> 2] & 127](g)
                g = f[h >> 2] | 0
                f[h >> 2] = 0
                if (!g) {
                    u = c
                    return 1
                }
                Va[f[((f[g >> 2] | 0) + 4) >> 2] & 127](g)
                u = c
                return 1
            }
            g = f[f[(a + 8) >> 2] >> 2] | 0
            f[d >> 2] = b
            a = (g + 4) | 0
            h = (g + 8) | 0
            l = f[h >> 2] | 0
            if ((l | 0) == (f[(g + 12) >> 2] | 0)) Ci(a, d)
            else {
                f[l >> 2] = b
                f[h >> 2] = l + 4
            }
            l = f[d >> 2] | 0
            b = (g + 16) | 0
            k = (g + 20) | 0
            g = f[k >> 2] | 0
            i = f[b >> 2] | 0
            j = (g - i) >> 2
            m = i
            if ((l | 0) < (j | 0)) {
                n = m
                o = l
            } else {
                i = (l + 1) | 0
                f[e >> 2] = -1
                p = g
                if (i >>> 0 <= j >>> 0)
                    if (i >>> 0 < j >>> 0 ? ((g = (m + (i << 2)) | 0), (g | 0) != (p | 0)) : 0) {
                        f[k >> 2] = p + (~(((p + -4 - g) | 0) >>> 2) << 2)
                        q = l
                        r = m
                    } else {
                        q = l
                        r = m
                    }
                else {
                    kh(b, (i - j) | 0, e)
                    q = f[d >> 2] | 0
                    r = f[b >> 2] | 0
                }
                n = r
                o = q
            }
            f[(n + (o << 2)) >> 2] = (((f[h >> 2] | 0) - (f[a >> 2] | 0)) >> 2) + -1
            u = c
            return 1
        }
        function cf(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0
            d = (a + 8) | 0
            e = f[d >> 2] | 0
            g = f[a >> 2] | 0
            h = g
            do
                if (((e - g) >> 3) >>> 0 >= b >>> 0) {
                    i = (a + 4) | 0
                    j = f[i >> 2] | 0
                    k = (j - g) >> 3
                    l = k >>> 0 < b >>> 0
                    m = l ? k : b
                    n = j
                    if (m | 0) {
                        j = m
                        m = h
                        while (1) {
                            o = c
                            p = f[(o + 4) >> 2] | 0
                            q = m
                            f[q >> 2] = f[o >> 2]
                            f[(q + 4) >> 2] = p
                            j = (j + -1) | 0
                            if (!j) break
                            else m = (m + 8) | 0
                        }
                    }
                    if (!l) {
                        m = (h + (b << 3)) | 0
                        if ((m | 0) == (n | 0)) return
                        else {
                            r = i
                            s = (n + (~(((n + -8 - m) | 0) >>> 3) << 3)) | 0
                            break
                        }
                    } else {
                        m = (b - k) | 0
                        j = m
                        p = n
                        while (1) {
                            q = c
                            o = f[(q + 4) >> 2] | 0
                            t = p
                            f[t >> 2] = f[q >> 2]
                            f[(t + 4) >> 2] = o
                            j = (j + -1) | 0
                            if (!j) break
                            else p = (p + 8) | 0
                        }
                        r = i
                        s = (n + (m << 3)) | 0
                        break
                    }
                } else {
                    p = g
                    if (!g) u = e
                    else {
                        j = (a + 4) | 0
                        k = f[j >> 2] | 0
                        if ((k | 0) != (h | 0)) f[j >> 2] = k + (~(((k + -8 - g) | 0) >>> 3) << 3)
                        br(p)
                        f[d >> 2] = 0
                        f[j >> 2] = 0
                        f[a >> 2] = 0
                        u = 0
                    }
                    if (b >>> 0 > 536870911) mq(a)
                    j = u >> 2
                    p = (u >> 3) >>> 0 < 268435455 ? (j >>> 0 < b >>> 0 ? b : j) : 536870911
                    if (p >>> 0 > 536870911) mq(a)
                    j = dn(p << 3) | 0
                    k = (a + 4) | 0
                    f[k >> 2] = j
                    f[a >> 2] = j
                    f[d >> 2] = j + (p << 3)
                    p = b
                    l = j
                    while (1) {
                        o = c
                        t = f[(o + 4) >> 2] | 0
                        q = l
                        f[q >> 2] = f[o >> 2]
                        f[(q + 4) >> 2] = t
                        p = (p + -1) | 0
                        if (!p) break
                        else l = (l + 8) | 0
                    }
                    r = k
                    s = (j + (b << 3)) | 0
                }
            while (0)
            f[r >> 2] = s
            return
        }
        function df(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0.0,
                g = 0.0,
                h = 0.0,
                i = 0.0,
                j = 0.0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                u = 0,
                v = 0
            e = +$(n[b >> 2])
            g = +K(+e)
            h = +$(n[(b + 4) >> 2])
            i = g + +K(+h)
            g = +$(n[(b + 8) >> 2])
            j = i + +K(+g)
            b = j > 1.0e-6
            i = 1.0 / j
            k = f[(a + 12) >> 2] | 0
            j = +(k | 0)
            l = ~~+J(+((b ? i * e : 1.0) * j + 0.5))
            m = ~~+J(+((b ? i * h : 0.0) * j + 0.5))
            o = (l | 0) > -1
            p = (k - (o ? l : (0 - l) | 0) - ((m | 0) > -1 ? m : (0 - m) | 0)) | 0
            l = (p | 0) < 0
            q = ((l ? ((m | 0) > 0 ? p : (0 - p) | 0) : 0) + m) | 0
            m = l ? 0 : p
            p = (b ? i * g : 0.0) < 0.0 ? (0 - m) | 0 : m
            do
                if (!o) {
                    if ((q | 0) < 0) r = (p | 0) > -1 ? p : (0 - p) | 0
                    else r = ((f[(a + 8) >> 2] | 0) - ((p | 0) > -1 ? p : (0 - p) | 0)) | 0
                    if ((p | 0) < 0) {
                        s = (q | 0) > -1 ? q : (0 - q) | 0
                        t = r
                        break
                    } else {
                        s = ((f[(a + 8) >> 2] | 0) - ((q | 0) > -1 ? q : (0 - q) | 0)) | 0
                        t = r
                        break
                    }
                } else {
                    s = (k + p) | 0
                    t = (k + q) | 0
                }
            while (0)
            q = (t | 0) == 0
            p = (s | 0) == 0
            r = f[(a + 8) >> 2] | 0
            if (!(s | t)) {
                u = r
                v = r
                f[c >> 2] = u
                f[d >> 2] = v
                return
            }
            a = (r | 0) == (s | 0)
            if (q & a) {
                u = s
                v = s
                f[c >> 2] = u
                f[d >> 2] = v
                return
            }
            o = (r | 0) == (t | 0)
            if (p & o) {
                u = t
                v = t
                f[c >> 2] = u
                f[d >> 2] = v
                return
            }
            if (q & ((k | 0) < (s | 0))) {
                u = 0
                v = ((k << 1) - s) | 0
                f[c >> 2] = u
                f[d >> 2] = v
                return
            }
            if (o & ((k | 0) > (s | 0))) {
                u = t
                v = ((k << 1) - s) | 0
                f[c >> 2] = u
                f[d >> 2] = v
                return
            }
            if (a & ((k | 0) > (t | 0))) {
                u = ((k << 1) - t) | 0
                v = s
                f[c >> 2] = u
                f[d >> 2] = v
                return
            }
            if (!p) {
                u = t
                v = s
                f[c >> 2] = u
                f[d >> 2] = v
                return
            }
            u = (k | 0) < (t | 0) ? ((k << 1) - t) | 0 : t
            v = 0
            f[c >> 2] = u
            f[d >> 2] = v
            return
        }
        function ef(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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
            c = (a + 4) | 0
            d = (b + 4) | 0
            f[c >> 2] = f[d >> 2]
            f[(c + 4) >> 2] = f[(d + 4) >> 2]
            f[(c + 8) >> 2] = f[(d + 8) >> 2]
            f[(c + 12) >> 2] = f[(d + 12) >> 2]
            f[(c + 16) >> 2] = f[(d + 16) >> 2]
            d = (a + 24) | 0
            c = (b + 24) | 0
            if ((a | 0) == (b | 0)) return a | 0
            e = (b + 28) | 0
            g = f[e >> 2] | 0
            if (!g) h = 0
            else {
                i = (a + 32) | 0
                do
                    if (g >>> 0 > (f[i >> 2] << 5) >>> 0) {
                        j = f[d >> 2] | 0
                        if (!j) k = g
                        else {
                            br(j)
                            f[d >> 2] = 0
                            f[i >> 2] = 0
                            f[(a + 28) >> 2] = 0
                            k = f[e >> 2] | 0
                        }
                        if ((k | 0) < 0) mq(d)
                        else {
                            j = ((((k + -1) | 0) >>> 5) + 1) | 0
                            l = dn(j << 2) | 0
                            f[d >> 2] = l
                            f[(a + 28) >> 2] = 0
                            f[i >> 2] = j
                            m = f[e >> 2] | 0
                            n = l
                            break
                        }
                    } else {
                        m = g
                        n = f[d >> 2] | 0
                    }
                while (0)
                Xl(n | 0, f[c >> 2] | 0, (((((m + -1) | 0) >>> 5) << 2) + 4) | 0) | 0
                h = f[e >> 2] | 0
            }
            f[(a + 28) >> 2] = h
            h = (a + 36) | 0
            e = (b + 36) | 0
            m = (b + 40) | 0
            b = f[m >> 2] | 0
            if (!b) o = 0
            else {
                c = (a + 44) | 0
                do
                    if (b >>> 0 > (f[c >> 2] << 5) >>> 0) {
                        n = f[h >> 2] | 0
                        if (!n) p = b
                        else {
                            br(n)
                            f[h >> 2] = 0
                            f[c >> 2] = 0
                            f[(a + 40) >> 2] = 0
                            p = f[m >> 2] | 0
                        }
                        if ((p | 0) < 0) mq(h)
                        else {
                            n = ((((p + -1) | 0) >>> 5) + 1) | 0
                            d = dn(n << 2) | 0
                            f[h >> 2] = d
                            f[(a + 40) >> 2] = 0
                            f[c >> 2] = n
                            q = f[m >> 2] | 0
                            r = d
                            break
                        }
                    } else {
                        q = b
                        r = f[h >> 2] | 0
                    }
                while (0)
                Xl(r | 0, f[e >> 2] | 0, (((((q + -1) | 0) >>> 5) << 2) + 4) | 0) | 0
                o = f[m >> 2] | 0
            }
            f[(a + 40) >> 2] = o
            return a | 0
        }
        function ff(a, b, c, d, e) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            g = u
            u = (u + 32) | 0
            h = (g + 12) | 0
            i = g
            f[a >> 2] = f[d >> 2]
            d = (a + 4) | 0
            f[d >> 2] = (f[c >> 2] | 0) - (f[b >> 2] | 0)
            j = (e + 16) | 0
            k = j
            l = f[(k + 4) >> 2] | 0
            if (
                !(((l | 0) > 0) | (((l | 0) == 0) & ((f[k >> 2] | 0) >>> 0 > 0)))
                    ? ((k = (e + 4) | 0),
                      (f[i >> 2] = f[k >> 2]),
                      (f[h >> 2] = f[i >> 2]),
                      ye(e, h, a, (a + 4) | 0) | 0,
                      (l = j),
                      (j = f[(l + 4) >> 2] | 0),
                      !(((j | 0) > 0) | (((j | 0) == 0) & ((f[l >> 2] | 0) >>> 0 > 0))))
                    : 0
            ) {
                f[i >> 2] = f[k >> 2]
                f[h >> 2] = f[i >> 2]
                ye(e, h, d, (d + 4) | 0) | 0
                m = i
            } else m = i
            if (!(f[d >> 2] | 0)) {
                u = g
                return 1
            }
            d = (a + 12) | 0
            og(d)
            m = (a + 1068) | 0
            Cm(m)
            k = (a + 1088) | 0
            Cm(k)
            l = (a + 1108) | 0
            Cm(l)
            f[i >> 2] = f[b >> 2]
            f[(i + 4) >> 2] = f[(b + 4) >> 2]
            f[(i + 8) >> 2] = f[(b + 8) >> 2]
            f[h >> 2] = f[c >> 2]
            f[(h + 4) >> 2] = f[(c + 4) >> 2]
            f[(h + 8) >> 2] = f[(c + 8) >> 2]
            jb(a, i, h)
            Ke(d, e)
            mg(m, e)
            mg(k, e)
            mg(l, e)
            u = g
            return 1
        }
        function gf(a, b, c, d, e) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            g = u
            u = (u + 32) | 0
            h = (g + 12) | 0
            i = g
            f[a >> 2] = f[d >> 2]
            d = (a + 4) | 0
            f[d >> 2] = (f[c >> 2] | 0) - (f[b >> 2] | 0)
            j = (e + 16) | 0
            k = j
            l = f[(k + 4) >> 2] | 0
            if (
                !(((l | 0) > 0) | (((l | 0) == 0) & ((f[k >> 2] | 0) >>> 0 > 0)))
                    ? ((k = (e + 4) | 0),
                      (f[i >> 2] = f[k >> 2]),
                      (f[h >> 2] = f[i >> 2]),
                      ye(e, h, a, (a + 4) | 0) | 0,
                      (l = j),
                      (j = f[(l + 4) >> 2] | 0),
                      !(((j | 0) > 0) | (((j | 0) == 0) & ((f[l >> 2] | 0) >>> 0 > 0))))
                    : 0
            ) {
                f[i >> 2] = f[k >> 2]
                f[h >> 2] = f[i >> 2]
                ye(e, h, d, (d + 4) | 0) | 0
                m = i
            } else m = i
            if (!(f[d >> 2] | 0)) {
                u = g
                return 1
            }
            d = (a + 12) | 0
            og(d)
            m = (a + 1068) | 0
            Cm(m)
            k = (a + 1088) | 0
            Cm(k)
            l = (a + 1108) | 0
            Cm(l)
            f[i >> 2] = f[b >> 2]
            f[(i + 4) >> 2] = f[(b + 4) >> 2]
            f[(i + 8) >> 2] = f[(b + 8) >> 2]
            f[h >> 2] = f[c >> 2]
            f[(h + 4) >> 2] = f[(c + 4) >> 2]
            f[(h + 8) >> 2] = f[(c + 8) >> 2]
            mb(a, i, h)
            Ke(d, e)
            mg(m, e)
            mg(k, e)
            mg(l, e)
            u = g
            return 1
        }
        function hf(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0
            c = u
            u = (u + 32) | 0
            d = c
            e = (a + 8) | 0
            g = f[e >> 2] | 0
            h = (a + 4) | 0
            i = f[h >> 2] | 0
            j = i
            if (((g - i) >> 2) >>> 0 >= b >>> 0) {
                hj(i | 0, 0, (b << 2) | 0) | 0
                f[h >> 2] = i + (b << 2)
                u = c
                return
            }
            k = f[a >> 2] | 0
            l = (i - k) >> 2
            m = (l + b) | 0
            n = k
            if (m >>> 0 > 1073741823) mq(a)
            o = (g - k) | 0
            p = o >> 1
            q = (o >> 2) >>> 0 < 536870911 ? (p >>> 0 < m >>> 0 ? m : p) : 1073741823
            f[(d + 12) >> 2] = 0
            f[(d + 16) >> 2] = a + 8
            do
                if (q)
                    if (q >>> 0 > 1073741823) {
                        p = ra(8) | 0
                        Wo(p, 14941)
                        f[p >> 2] = 6944
                        va(p | 0, 1080, 114)
                    } else {
                        r = dn(q << 2) | 0
                        break
                    }
                else r = 0
            while (0)
            f[d >> 2] = r
            p = (r + (l << 2)) | 0
            l = (d + 8) | 0
            m = (d + 4) | 0
            f[m >> 2] = p
            o = (r + (q << 2)) | 0
            q = (d + 12) | 0
            f[q >> 2] = o
            r = (p + (b << 2)) | 0
            hj(p | 0, 0, (b << 2) | 0) | 0
            f[l >> 2] = r
            if ((j | 0) == (n | 0)) {
                s = p
                t = q
                v = l
                w = k
                x = r
                y = i
                z = o
                A = g
            } else {
                g = j
                j = p
                do {
                    g = (g + -4) | 0
                    p = f[g >> 2] | 0
                    f[g >> 2] = 0
                    f[(j + -4) >> 2] = p
                    j = ((f[m >> 2] | 0) + -4) | 0
                    f[m >> 2] = j
                } while ((g | 0) != (n | 0))
                s = j
                t = q
                v = l
                w = f[a >> 2] | 0
                x = f[l >> 2] | 0
                y = f[h >> 2] | 0
                z = f[q >> 2] | 0
                A = f[e >> 2] | 0
            }
            f[a >> 2] = s
            f[m >> 2] = w
            f[h >> 2] = x
            f[v >> 2] = y
            f[e >> 2] = z
            f[t >> 2] = A
            f[d >> 2] = w
            Wh(d)
            u = c
            return
        }
        function jf(a, c, d, e, g) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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
            d = u
            u = (u + 16) | 0
            h = d
            i = f[(a + 124) >> 2] | 0
            if (!i) {
                u = d
                return
            }
            j = (i + -1) | 0
            k = ((j & i) | 0) == 0
            if (!k)
                if (i >>> 0 > g >>> 0) l = g
                else l = (g >>> 0) % (i >>> 0) | 0
            else l = j & g
            m = f[((f[(a + 120) >> 2] | 0) + (l << 2)) >> 2] | 0
            if (!m) {
                u = d
                return
            }
            n = f[m >> 2] | 0
            if (!n) {
                u = d
                return
            }
            a: do
                if (k) {
                    m = n
                    while (1) {
                        o = f[(m + 4) >> 2] | 0
                        p = (o | 0) == (g | 0)
                        if (!(p | (((o & j) | 0) == (l | 0)))) {
                            q = 24
                            break
                        }
                        if (p ? (f[(m + 8) >> 2] | 0) == (g | 0) : 0) {
                            r = m
                            break a
                        }
                        m = f[m >> 2] | 0
                        if (!m) {
                            q = 24
                            break
                        }
                    }
                    if ((q | 0) == 24) {
                        u = d
                        return
                    }
                } else {
                    m = n
                    while (1) {
                        p = f[(m + 4) >> 2] | 0
                        if ((p | 0) == (g | 0)) {
                            if ((f[(m + 8) >> 2] | 0) == (g | 0)) {
                                r = m
                                break a
                            }
                        } else {
                            if (p >>> 0 < i >>> 0) s = p
                            else s = (p >>> 0) % (i >>> 0) | 0
                            if ((s | 0) != (l | 0)) {
                                q = 24
                                break
                            }
                        }
                        m = f[m >> 2] | 0
                        if (!m) {
                            q = 24
                            break
                        }
                    }
                    if ((q | 0) == 24) {
                        u = d
                        return
                    }
                }
            while (0)
            q = f[(r + 12) >> 2] | 0
            if ((q | 0) == -1) {
                u = d
                return
            }
            f[h >> 2] = q
            f[(h + 4) >> 2] = c
            b[(h + 8) >> 0] = e & 1
            e = (a + 112) | 0
            c = f[e >> 2] | 0
            if ((c | 0) == (f[(a + 116) >> 2] | 0)) ki((a + 108) | 0, h)
            else {
                f[c >> 2] = f[h >> 2]
                f[(c + 4) >> 2] = f[(h + 4) >> 2]
                f[(c + 8) >> 2] = f[(h + 8) >> 2]
                f[e >> 2] = (f[e >> 2] | 0) + 12
            }
            u = d
            return
        }
        function kf(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                e = 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
            c = d[b >> 1] | 0
            e = d[(b + 2) >> 1] | 0
            g = d[(b + 4) >> 1] | 0
            h = d[(b + 6) >> 1] | 0
            b = (((((((c ^ 318) & 65535) + 239) ^ (e & 65535)) + 239) ^ (g & 65535)) + 239) ^ (h & 65535)
            i = f[(a + 4) >> 2] | 0
            if (!i) {
                j = 0
                return j | 0
            }
            k = (i + -1) | 0
            l = ((k & i) | 0) == 0
            if (!l)
                if (b >>> 0 < i >>> 0) m = b
                else m = (b >>> 0) % (i >>> 0) | 0
            else m = b & k
            n = f[((f[a >> 2] | 0) + (m << 2)) >> 2] | 0
            if (!n) {
                j = 0
                return j | 0
            }
            a = f[n >> 2] | 0
            if (!a) {
                j = 0
                return j | 0
            }
            if (l) {
                l = a
                while (1) {
                    n = f[(l + 4) >> 2] | 0
                    o = (n | 0) == (b | 0)
                    if (!(o | (((n & k) | 0) == (m | 0)))) {
                        j = 0
                        p = 25
                        break
                    }
                    if (
                        (((o ? ((o = (l + 8) | 0), (d[o >> 1] | 0) == (c << 16) >> 16) : 0) ? (d[(o + 2) >> 1] | 0) == (e << 16) >> 16 : 0) ? (d[(l + 12) >> 1] | 0) == (g << 16) >> 16 : 0)
                            ? (d[(o + 6) >> 1] | 0) == (h << 16) >> 16
                            : 0
                    ) {
                        j = l
                        p = 25
                        break
                    }
                    l = f[l >> 2] | 0
                    if (!l) {
                        j = 0
                        p = 25
                        break
                    }
                }
                if ((p | 0) == 25) return j | 0
            } else q = a
            while (1) {
                a = f[(q + 4) >> 2] | 0
                if ((a | 0) == (b | 0)) {
                    l = (q + 8) | 0
                    if (
                        (((d[l >> 1] | 0) == (c << 16) >> 16 ? (d[(l + 2) >> 1] | 0) == (e << 16) >> 16 : 0) ? (d[(q + 12) >> 1] | 0) == (g << 16) >> 16 : 0)
                            ? (d[(l + 6) >> 1] | 0) == (h << 16) >> 16
                            : 0
                    ) {
                        j = q
                        p = 25
                        break
                    }
                } else {
                    if (a >>> 0 < i >>> 0) r = a
                    else r = (a >>> 0) % (i >>> 0) | 0
                    if ((r | 0) != (m | 0)) {
                        j = 0
                        p = 25
                        break
                    }
                }
                q = f[q >> 2] | 0
                if (!q) {
                    j = 0
                    p = 25
                    break
                }
            }
            if ((p | 0) == 25) return j | 0
            return 0
        }
        function lf(a, b, c, d, e) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            g = u
            u = (u + 32) | 0
            h = (g + 12) | 0
            i = g
            f[a >> 2] = f[d >> 2]
            d = (a + 4) | 0
            f[d >> 2] = (f[c >> 2] | 0) - (f[b >> 2] | 0)
            j = (e + 16) | 0
            k = j
            l = f[(k + 4) >> 2] | 0
            if (
                !(((l | 0) > 0) | (((l | 0) == 0) & ((f[k >> 2] | 0) >>> 0 > 0)))
                    ? ((k = (e + 4) | 0),
                      (f[i >> 2] = f[k >> 2]),
                      (f[h >> 2] = f[i >> 2]),
                      ye(e, h, a, (a + 4) | 0) | 0,
                      (l = j),
                      (j = f[(l + 4) >> 2] | 0),
                      !(((j | 0) > 0) | (((j | 0) == 0) & ((f[l >> 2] | 0) >>> 0 > 0))))
                    : 0
            ) {
                f[i >> 2] = f[k >> 2]
                f[h >> 2] = f[i >> 2]
                ye(e, h, d, (d + 4) | 0) | 0
                m = i
            } else m = i
            if (!(f[d >> 2] | 0)) {
                u = g
                return 1
            }
            d = (a + 12) | 0
            Cm(d)
            m = (a + 32) | 0
            Cm(m)
            k = (a + 52) | 0
            Cm(k)
            l = (a + 72) | 0
            Cm(l)
            f[i >> 2] = f[b >> 2]
            f[(i + 4) >> 2] = f[(b + 4) >> 2]
            f[(i + 8) >> 2] = f[(b + 8) >> 2]
            f[h >> 2] = f[c >> 2]
            f[(h + 4) >> 2] = f[(c + 4) >> 2]
            f[(h + 8) >> 2] = f[(c + 8) >> 2]
            hb(a, i, h)
            mg(d, e)
            mg(m, e)
            mg(k, e)
            mg(l, e)
            u = g
            return 1
        }
        function mf(a, b, c, d, e) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            g = u
            u = (u + 32) | 0
            h = (g + 12) | 0
            i = g
            f[a >> 2] = f[d >> 2]
            d = (a + 4) | 0
            f[d >> 2] = (f[c >> 2] | 0) - (f[b >> 2] | 0)
            j = (e + 16) | 0
            k = j
            l = f[(k + 4) >> 2] | 0
            if (
                !(((l | 0) > 0) | (((l | 0) == 0) & ((f[k >> 2] | 0) >>> 0 > 0)))
                    ? ((k = (e + 4) | 0),
                      (f[i >> 2] = f[k >> 2]),
                      (f[h >> 2] = f[i >> 2]),
                      ye(e, h, a, (a + 4) | 0) | 0,
                      (l = j),
                      (j = f[(l + 4) >> 2] | 0),
                      !(((j | 0) > 0) | (((j | 0) == 0) & ((f[l >> 2] | 0) >>> 0 > 0))))
                    : 0
            ) {
                f[i >> 2] = f[k >> 2]
                f[h >> 2] = f[i >> 2]
                ye(e, h, d, (d + 4) | 0) | 0
                m = i
            } else m = i
            if (!(f[d >> 2] | 0)) {
                u = g
                return 1
            }
            d = (a + 12) | 0
            lk(d)
            m = (a + 44) | 0
            Cm(m)
            k = (a + 64) | 0
            Cm(k)
            l = (a + 84) | 0
            Cm(l)
            f[i >> 2] = f[b >> 2]
            f[(i + 4) >> 2] = f[(b + 4) >> 2]
            f[(i + 8) >> 2] = f[(b + 8) >> 2]
            f[h >> 2] = f[c >> 2]
            f[(h + 4) >> 2] = f[(c + 4) >> 2]
            f[(h + 8) >> 2] = f[(c + 8) >> 2]
            nb(a, i, h)
            fd(d, e)
            mg(m, e)
            mg(k, e)
            mg(l, e)
            u = g
            return 1
        }
        function nf(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0
            a = u
            u = (u + 16) | 0
            e = (a + 4) | 0
            g = a
            h = (a + 8) | 0
            i = (d + 11) | 0
            j = b[i >> 0] | 0
            k = (j << 24) >> 24 < 0
            if (k) {
                l = f[(d + 4) >> 2] | 0
                if (l >>> 0 > 255) {
                    m = 0
                    u = a
                    return m | 0
                } else n = l
            } else n = j & 255
            if (!n) {
                b[h >> 0] = 0
                n = (c + 16) | 0
                l = f[(n + 4) >> 2] | 0
                if (!(((l | 0) > 0) | (((l | 0) == 0) & ((f[n >> 2] | 0) >>> 0 > 0)))) {
                    f[g >> 2] = f[(c + 4) >> 2]
                    f[e >> 2] = f[g >> 2]
                    ye(c, e, h, (h + 1) | 0) | 0
                }
                m = 1
                u = a
                return m | 0
            }
            n = (d + 4) | 0
            l = f[n >> 2] | 0
            b[h >> 0] = k ? l : j & 255
            k = (c + 16) | 0
            o = k
            p = f[o >> 2] | 0
            q = f[(o + 4) >> 2] | 0
            if (((q | 0) > 0) | (((q | 0) == 0) & (p >>> 0 > 0))) {
                r = j
                s = q
                t = p
                v = l
            } else {
                f[g >> 2] = f[(c + 4) >> 2]
                f[e >> 2] = f[g >> 2]
                ye(c, e, h, (h + 1) | 0) | 0
                h = k
                r = b[i >> 0] | 0
                s = f[(h + 4) >> 2] | 0
                t = f[h >> 2] | 0
                v = f[n >> 2] | 0
            }
            n = (r << 24) >> 24 < 0
            h = n ? f[d >> 2] | 0 : d
            if (!(((s | 0) > 0) | (((s | 0) == 0) & (t >>> 0 > 0)))) {
                f[g >> 2] = f[(c + 4) >> 2]
                f[e >> 2] = f[g >> 2]
                ye(c, e, h, (h + (n ? v : r & 255)) | 0) | 0
            }
            m = 1
            u = a
            return m | 0
        }
        function of(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0
            c = (a + 4) | 0
            d = f[a >> 2] | 0
            e = ((((f[c >> 2] | 0) - d) | 0) / 24) | 0
            g = (e + 1) | 0
            if (g >>> 0 > 178956970) mq(a)
            h = (a + 8) | 0
            i = ((((f[h >> 2] | 0) - d) | 0) / 24) | 0
            d = i << 1
            j = i >>> 0 < 89478485 ? (d >>> 0 < g >>> 0 ? g : d) : 178956970
            do
                if (j)
                    if (j >>> 0 > 178956970) {
                        d = ra(8) | 0
                        Wo(d, 14941)
                        f[d >> 2] = 6944
                        va(d | 0, 1080, 114)
                    } else {
                        k = dn((j * 24) | 0) | 0
                        break
                    }
                else k = 0
            while (0)
            d = (k + ((e * 24) | 0)) | 0
            g = d
            i = (k + ((j * 24) | 0)) | 0
            f[d >> 2] = 1180
            f[(k + ((e * 24) | 0) + 4) >> 2] = f[(b + 4) >> 2]
            _j((k + ((e * 24) | 0) + 8) | 0, (b + 8) | 0)
            f[(k + ((e * 24) | 0) + 20) >> 2] = f[(b + 20) >> 2]
            b = (d + 24) | 0
            e = f[a >> 2] | 0
            k = f[c >> 2] | 0
            if ((k | 0) == (e | 0)) {
                l = g
                m = e
                n = e
            } else {
                j = k
                k = g
                g = d
                do {
                    f[(g + -24) >> 2] = 1180
                    f[(g + -20) >> 2] = f[(j + -20) >> 2]
                    d = (g + -16) | 0
                    o = (j + -16) | 0
                    f[d >> 2] = 0
                    p = (g + -12) | 0
                    f[p >> 2] = 0
                    f[(g + -8) >> 2] = 0
                    f[d >> 2] = f[o >> 2]
                    d = (j + -12) | 0
                    f[p >> 2] = f[d >> 2]
                    p = (j + -8) | 0
                    f[(g + -8) >> 2] = f[p >> 2]
                    f[p >> 2] = 0
                    f[d >> 2] = 0
                    f[o >> 2] = 0
                    f[(g + -4) >> 2] = f[(j + -4) >> 2]
                    j = (j + -24) | 0
                    g = (k + -24) | 0
                    k = g
                } while ((j | 0) != (e | 0))
                l = k
                m = f[a >> 2] | 0
                n = f[c >> 2] | 0
            }
            f[a >> 2] = l
            f[c >> 2] = b
            f[h >> 2] = i
            i = m
            if ((n | 0) != (i | 0)) {
                h = n
                do {
                    h = (h + -24) | 0
                    Va[f[f[h >> 2] >> 2] & 127](h)
                } while ((h | 0) != (i | 0))
            }
            if (!m) return
            br(m)
            return
        }
        function pf(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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
            d = b[c >> 0] | 0
            e = b[(c + 1) >> 0] | 0
            g = b[(c + 2) >> 0] | 0
            h = b[(c + 3) >> 0] | 0
            c = (((((((d & 255) ^ 318) + 239) ^ (e & 255)) + 239) ^ (g & 255)) + 239) ^ (h & 255)
            i = f[(a + 4) >> 2] | 0
            if (!i) {
                j = 0
                return j | 0
            }
            k = (i + -1) | 0
            l = ((k & i) | 0) == 0
            if (!l)
                if (c >>> 0 < i >>> 0) m = c
                else m = (c >>> 0) % (i >>> 0) | 0
            else m = c & k
            n = f[((f[a >> 2] | 0) + (m << 2)) >> 2] | 0
            if (!n) {
                j = 0
                return j | 0
            }
            a = f[n >> 2] | 0
            if (!a) {
                j = 0
                return j | 0
            }
            if (l) {
                l = a
                while (1) {
                    n = f[(l + 4) >> 2] | 0
                    o = (n | 0) == (c | 0)
                    if (!(o | (((n & k) | 0) == (m | 0)))) {
                        j = 0
                        p = 25
                        break
                    }
                    if (
                        (((o ? ((o = (l + 8) | 0), (b[o >> 0] | 0) == (d << 24) >> 24) : 0) ? (b[(o + 1) >> 0] | 0) == (e << 24) >> 24 : 0) ? (b[(o + 2) >> 0] | 0) == (g << 24) >> 24 : 0)
                            ? (b[(o + 3) >> 0] | 0) == (h << 24) >> 24
                            : 0
                    ) {
                        j = l
                        p = 25
                        break
                    }
                    l = f[l >> 2] | 0
                    if (!l) {
                        j = 0
                        p = 25
                        break
                    }
                }
                if ((p | 0) == 25) return j | 0
            } else q = a
            while (1) {
                a = f[(q + 4) >> 2] | 0
                if ((a | 0) == (c | 0)) {
                    l = (q + 8) | 0
                    if (
                        (((b[l >> 0] | 0) == (d << 24) >> 24 ? (b[(l + 1) >> 0] | 0) == (e << 24) >> 24 : 0) ? (b[(l + 2) >> 0] | 0) == (g << 24) >> 24 : 0)
                            ? (b[(l + 3) >> 0] | 0) == (h << 24) >> 24
                            : 0
                    ) {
                        j = q
                        p = 25
                        break
                    }
                } else {
                    if (a >>> 0 < i >>> 0) r = a
                    else r = (a >>> 0) % (i >>> 0) | 0
                    if ((r | 0) != (m | 0)) {
                        j = 0
                        p = 25
                        break
                    }
                }
                q = f[q >> 2] | 0
                if (!q) {
                    j = 0
                    p = 25
                    break
                }
            }
            if ((p | 0) == 25) return j | 0
            return 0
        }
        function qf(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0
            d = u
            u = (u + 32) | 0
            h = (d + 24) | 0
            i = (d + 16) | 0
            j = d
            k = (d + 8) | 0
            l = (a + 40) | 0
            f[(a + 44) >> 2] = g
            g = (a + 36) | 0
            m = f[g >> 2] | 0
            n = f[(m + 4) >> 2] | 0
            o = f[m >> 2] | 0
            p = (n - o) | 0
            if ((p | 0) <= 0) {
                u = d
                return 1
            }
            q = ((p >>> 2) + -1) | 0
            p = (a + 8) | 0
            r = (a + 48) | 0
            s = (a + 52) | 0
            a = (i + 4) | 0
            t = (j + 4) | 0
            v = (h + 4) | 0
            if (((n - o) >> 2) >>> 0 > q >>> 0) {
                w = q
                x = o
            } else {
                y = m
                mq(y)
            }
            while (1) {
                f[k >> 2] = f[(x + (w << 2)) >> 2]
                f[h >> 2] = f[k >> 2]
                tb(l, h, b, w) | 0
                m = X(w, e) | 0
                o = (b + (m << 2)) | 0
                q = (c + (m << 2)) | 0
                m = f[(o + 4) >> 2] | 0
                n = f[r >> 2] | 0
                z = f[s >> 2] | 0
                f[i >> 2] = f[o >> 2]
                f[a >> 2] = m
                f[j >> 2] = n
                f[t >> 2] = z
                Dd(h, p, i, j)
                f[q >> 2] = f[h >> 2]
                f[(q + 4) >> 2] = f[v >> 2]
                w = (w + -1) | 0
                if ((w | 0) <= -1) {
                    A = 3
                    break
                }
                q = f[g >> 2] | 0
                x = f[q >> 2] | 0
                if ((((f[(q + 4) >> 2] | 0) - x) >> 2) >>> 0 <= w >>> 0) {
                    y = q
                    A = 4
                    break
                }
            }
            if ((A | 0) == 3) {
                u = d
                return 1
            } else if ((A | 0) == 4) mq(y)
            return 0
        }
        function rf(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            var h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            h = u
            u = (u + 32) | 0
            i = h
            j = (h + 16) | 0
            k = f[((f[((f[(b + 4) >> 2] | 0) + 8) >> 2] | 0) + (d << 2)) >> 2] | 0
            do
                if ((((c + -1) | 0) >>> 0 < 6) & ((Qa[f[((f[b >> 2] | 0) + 8) >> 2] & 127](b) | 0) == 1)) {
                    l = Qa[f[((f[b >> 2] | 0) + 52) >> 2] & 127](b) | 0
                    m = Ra[f[((f[b >> 2] | 0) + 60) >> 2] & 127](b, d) | 0
                    if (((l | 0) == 0) | ((m | 0) == 0)) {
                        f[a >> 2] = 0
                        u = h
                        return
                    }
                    n = Ra[f[((f[b >> 2] | 0) + 56) >> 2] & 127](b, d) | 0
                    if (!n) {
                        f[i >> 2] = f[(b + 56) >> 2]
                        f[(i + 4) >> 2] = l
                        f[(i + 12) >> 2] = m
                        f[(i + 8) >> 2] = m + 12
                        Rd(a, j, c, k, e, i, g)
                        if (!(f[a >> 2] | 0)) {
                            f[a >> 2] = 0
                            break
                        }
                        u = h
                        return
                    } else {
                        f[i >> 2] = f[(b + 56) >> 2]
                        f[(i + 4) >> 2] = n
                        f[(i + 12) >> 2] = m
                        f[(i + 8) >> 2] = m + 12
                        Pd(a, j, c, k, e, i, g)
                        if (!(f[a >> 2] | 0)) {
                            f[a >> 2] = 0
                            break
                        }
                        u = h
                        return
                    }
                }
            while (0)
            f[a >> 2] = 0
            u = h
            return
        }
        function sf(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0
            d = u
            u = (u + 32) | 0
            h = (d + 24) | 0
            i = (d + 16) | 0
            j = d
            k = (d + 8) | 0
            l = (a + 40) | 0
            f[(a + 44) >> 2] = g
            g = (a + 36) | 0
            m = f[g >> 2] | 0
            n = f[(m + 4) >> 2] | 0
            o = f[m >> 2] | 0
            p = (n - o) | 0
            if ((p | 0) <= 0) {
                u = d
                return 1
            }
            q = ((p >>> 2) + -1) | 0
            p = (a + 8) | 0
            r = (a + 48) | 0
            s = (a + 52) | 0
            a = (i + 4) | 0
            t = (j + 4) | 0
            v = (h + 4) | 0
            if (((n - o) >> 2) >>> 0 > q >>> 0) {
                w = q
                x = o
            } else {
                y = m
                mq(y)
            }
            while (1) {
                f[k >> 2] = f[(x + (w << 2)) >> 2]
                f[h >> 2] = f[k >> 2]
                sb(l, h, b, w) | 0
                m = X(w, e) | 0
                o = (b + (m << 2)) | 0
                q = (c + (m << 2)) | 0
                m = f[(o + 4) >> 2] | 0
                n = f[r >> 2] | 0
                z = f[s >> 2] | 0
                f[i >> 2] = f[o >> 2]
                f[a >> 2] = m
                f[j >> 2] = n
                f[t >> 2] = z
                Dd(h, p, i, j)
                f[q >> 2] = f[h >> 2]
                f[(q + 4) >> 2] = f[v >> 2]
                w = (w + -1) | 0
                if ((w | 0) <= -1) {
                    A = 3
                    break
                }
                q = f[g >> 2] | 0
                x = f[q >> 2] | 0
                if ((((f[(q + 4) >> 2] | 0) - x) >> 2) >>> 0 <= w >>> 0) {
                    y = q
                    A = 4
                    break
                }
            }
            if ((A | 0) == 3) {
                u = d
                return 1
            } else if ((A | 0) == 4) mq(y)
            return 0
        }
        function tf(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0
            d = f[b >> 2] | 0
            b = f[c >> 2] | 0
            e = (b - d) >> 2
            g = (a + 8) | 0
            h = f[g >> 2] | 0
            i = f[a >> 2] | 0
            j = i
            k = b
            if (e >>> 0 <= ((h - i) >> 2) >>> 0) {
                l = (a + 4) | 0
                m = ((f[l >> 2] | 0) - i) >> 2
                n = e >>> 0 > m >>> 0
                o = n ? (d + (m << 2)) | 0 : b
                b = (o - d) | 0
                m = b >> 2
                if (m | 0) Xl(i | 0, d | 0, b | 0) | 0
                b = (j + (m << 2)) | 0
                if (!n) {
                    n = f[l >> 2] | 0
                    if ((n | 0) == (b | 0)) return
                    f[l >> 2] = n + (~(((n + -4 - b) | 0) >>> 2) << 2)
                    return
                }
                b = f[c >> 2] | 0
                c = o
                if ((b | 0) == (c | 0)) return
                n = f[l >> 2] | 0
                m = (b + -4 - o) | 0
                o = c
                c = n
                while (1) {
                    f[c >> 2] = f[o >> 2]
                    o = (o + 4) | 0
                    if ((o | 0) == (b | 0)) break
                    else c = (c + 4) | 0
                }
                f[l >> 2] = n + (((m >>> 2) + 1) << 2)
                return
            }
            m = i
            if (!i) p = h
            else {
                h = (a + 4) | 0
                n = f[h >> 2] | 0
                if ((n | 0) != (j | 0)) f[h >> 2] = n + (~(((n + -4 - i) | 0) >>> 2) << 2)
                br(m)
                f[g >> 2] = 0
                f[h >> 2] = 0
                f[a >> 2] = 0
                p = 0
            }
            if (e >>> 0 > 1073741823) mq(a)
            h = p >> 1
            m = (p >> 2) >>> 0 < 536870911 ? (h >>> 0 < e >>> 0 ? e : h) : 1073741823
            if (m >>> 0 > 1073741823) mq(a)
            h = dn(m << 2) | 0
            e = (a + 4) | 0
            f[e >> 2] = h
            f[a >> 2] = h
            f[g >> 2] = h + (m << 2)
            m = d
            if ((k | 0) == (m | 0)) return
            g = (k + -4 - d) | 0
            d = m
            m = h
            while (1) {
                f[m >> 2] = f[d >> 2]
                d = (d + 4) | 0
                if ((d | 0) == (k | 0)) break
                else m = (m + 4) | 0
            }
            f[e >> 2] = h + (((g >>> 2) + 1) << 2)
            return
        }
        function uf(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0
            e = u
            u = (u + 112) | 0
            g = (e + 100) | 0
            h = e
            i = dn(120) | 0
            j = f[(c + 8) >> 2] | 0
            f[(i + 4) >> 2] = 0
            f[i >> 2] = 3296
            k = (i + 8) | 0
            l = (i + 12) | 0
            m = (l + 44) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (m | 0))
            f[k >> 2] = 3320
            l = (i + 56) | 0
            m = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (m | 0))
            f[(i + 96) >> 2] = 0
            f[(i + 100) >> 2] = 0
            f[(i + 104) >> 2] = 0
            f[(i + 108) >> 2] = j
            f[(i + 112) >> 2] = d
            k = (i + 116) | 0
            f[k >> 2] = 0
            n = i
            o = f[(c + 12) >> 2] | 0
            p = (h + 4) | 0
            l = (p + 4) | 0
            m = (l + 40) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (m | 0))
            f[h >> 2] = 3320
            l = (h + 48) | 0
            m = (l + 36) | 0
            do {
                f[l >> 2] = 0
                l = (l + 4) | 0
            } while ((l | 0) < (m | 0))
            f[(h + 88) >> 2] = 0
            f[(h + 92) >> 2] = 0
            f[(h + 96) >> 2] = 0
            l = o
            f[p >> 2] = l
            m = (((((f[(l + 4) >> 2] | 0) - (f[o >> 2] | 0)) >> 2) >>> 0) / 3) | 0
            b[g >> 0] = 0
            Xg((h + 24) | 0, m, g)
            m = f[p >> 2] | 0
            p = ((f[(m + 28) >> 2] | 0) - (f[(m + 24) >> 2] | 0)) >> 2
            b[g >> 0] = 0
            Xg((h + 36) | 0, p, g)
            f[(h + 8) >> 2] = o
            f[(h + 12) >> 2] = d
            f[(h + 16) >> 2] = j
            f[(h + 20) >> 2] = i
            f[k >> 2] = c + 72
            fh(i, h)
            f[a >> 2] = n
            Gi(h)
            u = e
            return
        }
        function vf(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0
            c = (a + 8) | 0
            d = f[c >> 2] | 0
            e = (a + 4) | 0
            g = f[e >> 2] | 0
            h = g
            if (((((d - g) | 0) / 12) | 0) >>> 0 >= b >>> 0) {
                hj(g | 0, 0, (b * 12) | 0) | 0
                f[e >> 2] = h + ((b * 12) | 0)
                return
            }
            i = f[a >> 2] | 0
            j = (((g - i) | 0) / 12) | 0
            g = (j + b) | 0
            k = i
            if (g >>> 0 > 357913941) mq(a)
            l = (((d - i) | 0) / 12) | 0
            d = l << 1
            m = l >>> 0 < 178956970 ? (d >>> 0 < g >>> 0 ? g : d) : 357913941
            do
                if (m)
                    if (m >>> 0 > 357913941) {
                        d = ra(8) | 0
                        Wo(d, 14941)
                        f[d >> 2] = 6944
                        va(d | 0, 1080, 114)
                    } else {
                        n = dn((m * 12) | 0) | 0
                        break
                    }
                else n = 0
            while (0)
            d = (n + ((j * 12) | 0)) | 0
            j = d
            g = (n + ((m * 12) | 0)) | 0
            hj(d | 0, 0, (b * 12) | 0) | 0
            m = (d + ((b * 12) | 0)) | 0
            if ((h | 0) == (k | 0)) {
                o = j
                p = i
                q = h
            } else {
                i = h
                h = j
                j = d
                do {
                    d = (j + -12) | 0
                    b = i
                    i = (i + -12) | 0
                    f[d >> 2] = 0
                    n = (j + -8) | 0
                    f[n >> 2] = 0
                    f[(j + -4) >> 2] = 0
                    f[d >> 2] = f[i >> 2]
                    d = (b + -8) | 0
                    f[n >> 2] = f[d >> 2]
                    n = (b + -4) | 0
                    f[(j + -4) >> 2] = f[n >> 2]
                    f[n >> 2] = 0
                    f[d >> 2] = 0
                    f[i >> 2] = 0
                    j = (h + -12) | 0
                    h = j
                } while ((i | 0) != (k | 0))
                o = h
                p = f[a >> 2] | 0
                q = f[e >> 2] | 0
            }
            f[a >> 2] = o
            f[e >> 2] = m
            f[c >> 2] = g
            g = p
            if ((q | 0) != (g | 0)) {
                c = q
                do {
                    q = c
                    c = (c + -12) | 0
                    m = f[c >> 2] | 0
                    if (m | 0) {
                        e = (q + -8) | 0
                        q = f[e >> 2] | 0
                        if ((q | 0) != (m | 0)) f[e >> 2] = q + (~(((q + -4 - m) | 0) >>> 2) << 2)
                        br(m)
                    }
                } while ((c | 0) != (g | 0))
            }
            if (!p) return
            br(p)
            return
        }
        function wf(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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
            d = f[(a + 12) >> 2] | 0
            e = (a + 68) | 0
            g = f[e >> 2] | 0
            h = f[(g + 80) >> 2] | 0
            b[(c + 84) >> 0] = 0
            i = (c + 68) | 0
            j = (c + 72) | 0
            k = f[j >> 2] | 0
            l = f[i >> 2] | 0
            m = (k - l) >> 2
            n = l
            l = k
            if (h >>> 0 <= m >>> 0)
                if (h >>> 0 < m >>> 0 ? ((k = (n + (h << 2)) | 0), (k | 0) != (l | 0)) : 0) {
                    f[j >> 2] = l + (~(((l + -4 - k) | 0) >>> 2) << 2)
                    o = g
                    p = h
                } else {
                    o = g
                    p = h
                }
            else {
                kh(i, (h - m) | 0, 3220)
                m = f[e >> 2] | 0
                o = m
                p = f[(m + 80) >> 2] | 0
            }
            m = ((f[(o + 100) >> 2] | 0) - (f[(o + 96) >> 2] | 0)) | 0
            e = ((m | 0) / 12) | 0
            if (!m) {
                q = 1
                return q | 0
            }
            m = (a + 72) | 0
            a = (c + 68) | 0
            c = f[(o + 96) >> 2] | 0
            o = f[(d + 28) >> 2] | 0
            d = 0
            while (1) {
                h = (d * 3) | 0
                i = f[(o + (h << 2)) >> 2] | 0
                if ((i | 0) == -1) {
                    q = 0
                    r = 11
                    break
                }
                g = f[((f[m >> 2] | 0) + 12) >> 2] | 0
                k = f[(g + (i << 2)) >> 2] | 0
                if (k >>> 0 >= p >>> 0) {
                    q = 0
                    r = 11
                    break
                }
                i = f[a >> 2] | 0
                f[(i + (f[(c + ((d * 12) | 0)) >> 2] << 2)) >> 2] = k
                k = f[(o + ((h + 1) << 2)) >> 2] | 0
                if ((k | 0) == -1) {
                    q = 0
                    r = 11
                    break
                }
                l = f[(g + (k << 2)) >> 2] | 0
                if (l >>> 0 >= p >>> 0) {
                    q = 0
                    r = 11
                    break
                }
                f[(i + (f[(c + ((d * 12) | 0) + 4) >> 2] << 2)) >> 2] = l
                l = f[(o + ((h + 2) << 2)) >> 2] | 0
                if ((l | 0) == -1) {
                    q = 0
                    r = 11
                    break
                }
                h = f[(g + (l << 2)) >> 2] | 0
                if (h >>> 0 >= p >>> 0) {
                    q = 0
                    r = 11
                    break
                }
                f[(i + (f[(c + ((d * 12) | 0) + 8) >> 2] << 2)) >> 2] = h
                d = (d + 1) | 0
                if (d >>> 0 >= e >>> 0) {
                    q = 1
                    r = 11
                    break
                }
            }
            if ((r | 0) == 11) return q | 0
            return 0
        }
        function xf(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            d = u
            u = (u + 32) | 0
            e = d
            g = (a + 40) | 0
            h = ((f[c >> 2] | 0) + (f[g >> 2] | 0)) | 0
            i = (a + 24) | 0
            j = f[(a + 32) >> 2] | 0
            k = (j + -4194304) | 0
            do
                if (k >>> 0 >= 64) {
                    if (k >>> 0 < 16384) {
                        l = (a + 28) | 0
                        m = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        n = (j + -4177920) | 0
                        b[m >> 0] = n
                        b[(m + 1) >> 0] = n >>> 8
                        o = ((f[l >> 2] | 0) + 2) | 0
                        break
                    }
                    if (k >>> 0 < 4194304) {
                        l = (a + 28) | 0
                        n = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        m = (j + 4194304) | 0
                        b[n >> 0] = m
                        b[(n + 1) >> 0] = m >>> 8
                        b[(n + 2) >> 0] = m >>> 16
                        o = ((f[l >> 2] | 0) + 3) | 0
                        break
                    }
                    if (k >>> 0 < 1073741824) {
                        l = (a + 28) | 0
                        m = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        n = (j + -1077936128) | 0
                        b[m >> 0] = n
                        b[(m + 1) >> 0] = n >>> 8
                        b[(m + 2) >> 0] = n >>> 16
                        b[(m + 3) >> 0] = n >>> 24
                        o = ((f[l >> 2] | 0) + 4) | 0
                        break
                    } else {
                        o = f[(a + 28) >> 2] | 0
                        break
                    }
                } else {
                    l = (a + 28) | 0
                    b[((f[i >> 2] | 0) + (f[l >> 2] | 0)) >> 0] = k
                    o = ((f[l >> 2] | 0) + 1) | 0
                }
            while (0)
            k = (((o | 0) < 0) << 31) >> 31
            Cn(e)
            eh(o, k, e) | 0
            i = (e + 4) | 0
            a = ((f[i >> 2] | 0) - (f[e >> 2] | 0)) | 0
            Xl((h + a) | 0, h | 0, o | 0) | 0
            Rg(h | 0, f[e >> 2] | 0, a | 0) | 0
            h = g
            g = f[h >> 2] | 0
            j = f[(h + 4) >> 2] | 0
            h = Tn(a | 0, 0, o | 0, k | 0) | 0
            k = Tn(h | 0, I | 0, g | 0, j | 0) | 0
            vl(c, k, I)
            k = (e + 12) | 0
            c = f[k >> 2] | 0
            f[k >> 2] = 0
            if (c | 0) br(c)
            c = f[e >> 2] | 0
            if (!c) {
                u = d
                return
            }
            if ((f[i >> 2] | 0) != (c | 0)) f[i >> 2] = c
            br(c)
            u = d
            return
        }
        function yf(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            d = u
            u = (u + 32) | 0
            e = d
            g = (a + 40) | 0
            h = ((f[c >> 2] | 0) + (f[g >> 2] | 0)) | 0
            i = (a + 24) | 0
            j = f[(a + 32) >> 2] | 0
            k = (j + -2097152) | 0
            do
                if (k >>> 0 >= 64) {
                    if (k >>> 0 < 16384) {
                        l = (a + 28) | 0
                        m = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        n = (j + -2080768) | 0
                        b[m >> 0] = n
                        b[(m + 1) >> 0] = n >>> 8
                        o = ((f[l >> 2] | 0) + 2) | 0
                        break
                    }
                    if (k >>> 0 < 4194304) {
                        l = (a + 28) | 0
                        n = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        m = (j + 6291456) | 0
                        b[n >> 0] = m
                        b[(n + 1) >> 0] = m >>> 8
                        b[(n + 2) >> 0] = m >>> 16
                        o = ((f[l >> 2] | 0) + 3) | 0
                        break
                    }
                    if (k >>> 0 < 1073741824) {
                        l = (a + 28) | 0
                        m = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        n = (j + -1075838976) | 0
                        b[m >> 0] = n
                        b[(m + 1) >> 0] = n >>> 8
                        b[(m + 2) >> 0] = n >>> 16
                        b[(m + 3) >> 0] = n >>> 24
                        o = ((f[l >> 2] | 0) + 4) | 0
                        break
                    } else {
                        o = f[(a + 28) >> 2] | 0
                        break
                    }
                } else {
                    l = (a + 28) | 0
                    b[((f[i >> 2] | 0) + (f[l >> 2] | 0)) >> 0] = k
                    o = ((f[l >> 2] | 0) + 1) | 0
                }
            while (0)
            k = (((o | 0) < 0) << 31) >> 31
            Cn(e)
            eh(o, k, e) | 0
            i = (e + 4) | 0
            a = ((f[i >> 2] | 0) - (f[e >> 2] | 0)) | 0
            Xl((h + a) | 0, h | 0, o | 0) | 0
            Rg(h | 0, f[e >> 2] | 0, a | 0) | 0
            h = g
            g = f[h >> 2] | 0
            j = f[(h + 4) >> 2] | 0
            h = Tn(a | 0, 0, o | 0, k | 0) | 0
            k = Tn(h | 0, I | 0, g | 0, j | 0) | 0
            vl(c, k, I)
            k = (e + 12) | 0
            c = f[k >> 2] | 0
            f[k >> 2] = 0
            if (c | 0) br(c)
            c = f[e >> 2] | 0
            if (!c) {
                u = d
                return
            }
            if ((f[i >> 2] | 0) != (c | 0)) f[i >> 2] = c
            br(c)
            u = d
            return
        }
        function zf(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            d = u
            u = (u + 32) | 0
            e = d
            g = (a + 40) | 0
            h = ((f[c >> 2] | 0) + (f[g >> 2] | 0)) | 0
            i = (a + 24) | 0
            j = f[(a + 32) >> 2] | 0
            k = (j + -1048576) | 0
            do
                if (k >>> 0 >= 64) {
                    if (k >>> 0 < 16384) {
                        l = (a + 28) | 0
                        m = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        n = (j + -1032192) | 0
                        b[m >> 0] = n
                        b[(m + 1) >> 0] = n >>> 8
                        o = ((f[l >> 2] | 0) + 2) | 0
                        break
                    }
                    if (k >>> 0 < 4194304) {
                        l = (a + 28) | 0
                        n = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        m = (j + 7340032) | 0
                        b[n >> 0] = m
                        b[(n + 1) >> 0] = m >>> 8
                        b[(n + 2) >> 0] = m >>> 16
                        o = ((f[l >> 2] | 0) + 3) | 0
                        break
                    }
                    if (k >>> 0 < 1073741824) {
                        l = (a + 28) | 0
                        m = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        n = (j + -1074790400) | 0
                        b[m >> 0] = n
                        b[(m + 1) >> 0] = n >>> 8
                        b[(m + 2) >> 0] = n >>> 16
                        b[(m + 3) >> 0] = n >>> 24
                        o = ((f[l >> 2] | 0) + 4) | 0
                        break
                    } else {
                        o = f[(a + 28) >> 2] | 0
                        break
                    }
                } else {
                    l = (a + 28) | 0
                    b[((f[i >> 2] | 0) + (f[l >> 2] | 0)) >> 0] = k
                    o = ((f[l >> 2] | 0) + 1) | 0
                }
            while (0)
            k = (((o | 0) < 0) << 31) >> 31
            Cn(e)
            eh(o, k, e) | 0
            i = (e + 4) | 0
            a = ((f[i >> 2] | 0) - (f[e >> 2] | 0)) | 0
            Xl((h + a) | 0, h | 0, o | 0) | 0
            Rg(h | 0, f[e >> 2] | 0, a | 0) | 0
            h = g
            g = f[h >> 2] | 0
            j = f[(h + 4) >> 2] | 0
            h = Tn(a | 0, 0, o | 0, k | 0) | 0
            k = Tn(h | 0, I | 0, g | 0, j | 0) | 0
            vl(c, k, I)
            k = (e + 12) | 0
            c = f[k >> 2] | 0
            f[k >> 2] = 0
            if (c | 0) br(c)
            c = f[e >> 2] | 0
            if (!c) {
                u = d
                return
            }
            if ((f[i >> 2] | 0) != (c | 0)) f[i >> 2] = c
            br(c)
            u = d
            return
        }
        function Af(a, c, d, e, g, h, i) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            a = u
            u = (u + 96) | 0
            j = a
            if (!c) {
                k = -1
                u = a
                return k | 0
            }
            Lm(j)
            yj(j, d, 0, g & 255, i, 0, g << 1, 0, 0, 0)
            i = uh(c, j, 1, e) | 0
            d = f[((f[(c + 8) >> 2] | 0) + (i << 2)) >> 2] | 0
            if (e | 0) {
                l = (d + 84) | 0
                m = (d + 68) | 0
                n = (d + 40) | 0
                o = (d + 64) | 0
                d = 0
                do {
                    if (!(b[l >> 0] | 0)) p = f[((f[m >> 2] | 0) + (d << 2)) >> 2] | 0
                    else p = d
                    q = (h + ((X(d, g) | 0) << 1)) | 0
                    r = n
                    s = f[r >> 2] | 0
                    t = on(s | 0, f[(r + 4) >> 2] | 0, p | 0, 0) | 0
                    Rg(((f[f[o >> 2] >> 2] | 0) + t) | 0, q | 0, s | 0) | 0
                    d = (d + 1) | 0
                } while ((d | 0) != (e | 0))
            }
            d = (c + 80) | 0
            c = f[d >> 2] | 0
            if (c)
                if ((c | 0) == (e | 0)) v = 10
                else w = -1
            else {
                f[d >> 2] = e
                v = 10
            }
            if ((v | 0) == 10) w = i
            i = (j + 88) | 0
            v = f[i >> 2] | 0
            f[i >> 2] = 0
            if (v | 0) {
                i = f[(v + 8) >> 2] | 0
                if (i | 0) {
                    e = (v + 12) | 0
                    if ((f[e >> 2] | 0) != (i | 0)) f[e >> 2] = i
                    br(i)
                }
                br(v)
            }
            v = f[(j + 68) >> 2] | 0
            if (v | 0) {
                i = (j + 72) | 0
                e = f[i >> 2] | 0
                if ((e | 0) != (v | 0)) f[i >> 2] = e + (~(((e + -4 - v) | 0) >>> 2) << 2)
                br(v)
            }
            v = (j + 64) | 0
            j = f[v >> 2] | 0
            f[v >> 2] = 0
            if (j | 0) {
                v = f[j >> 2] | 0
                if (v | 0) {
                    e = (j + 4) | 0
                    if ((f[e >> 2] | 0) != (v | 0)) f[e >> 2] = v
                    br(v)
                }
                br(j)
            }
            k = w
            u = a
            return k | 0
        }
        function Bf(a, c, d, e, g, h, i) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            a = u
            u = (u + 96) | 0
            j = a
            if (!c) {
                k = -1
                u = a
                return k | 0
            }
            Lm(j)
            yj(j, d, 0, g & 255, i, 0, g << 2, 0, 0, 0)
            i = uh(c, j, 1, e) | 0
            d = f[((f[(c + 8) >> 2] | 0) + (i << 2)) >> 2] | 0
            if (e | 0) {
                l = (d + 84) | 0
                m = (d + 68) | 0
                n = (d + 40) | 0
                o = (d + 64) | 0
                d = 0
                do {
                    if (!(b[l >> 0] | 0)) p = f[((f[m >> 2] | 0) + (d << 2)) >> 2] | 0
                    else p = d
                    q = (h + ((X(d, g) | 0) << 2)) | 0
                    r = n
                    s = f[r >> 2] | 0
                    t = on(s | 0, f[(r + 4) >> 2] | 0, p | 0, 0) | 0
                    Rg(((f[f[o >> 2] >> 2] | 0) + t) | 0, q | 0, s | 0) | 0
                    d = (d + 1) | 0
                } while ((d | 0) != (e | 0))
            }
            d = (c + 80) | 0
            c = f[d >> 2] | 0
            if (c)
                if ((c | 0) == (e | 0)) v = 10
                else w = -1
            else {
                f[d >> 2] = e
                v = 10
            }
            if ((v | 0) == 10) w = i
            i = (j + 88) | 0
            v = f[i >> 2] | 0
            f[i >> 2] = 0
            if (v | 0) {
                i = f[(v + 8) >> 2] | 0
                if (i | 0) {
                    e = (v + 12) | 0
                    if ((f[e >> 2] | 0) != (i | 0)) f[e >> 2] = i
                    br(i)
                }
                br(v)
            }
            v = f[(j + 68) >> 2] | 0
            if (v | 0) {
                i = (j + 72) | 0
                e = f[i >> 2] | 0
                if ((e | 0) != (v | 0)) f[i >> 2] = e + (~(((e + -4 - v) | 0) >>> 2) << 2)
                br(v)
            }
            v = (j + 64) | 0
            j = f[v >> 2] | 0
            f[v >> 2] = 0
            if (j | 0) {
                v = f[j >> 2] | 0
                if (v | 0) {
                    e = (j + 4) | 0
                    if ((f[e >> 2] | 0) != (v | 0)) f[e >> 2] = v
                    br(v)
                }
                br(j)
            }
            k = w
            u = a
            return k | 0
        }
        function Cf(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            d = u
            u = (u + 32) | 0
            e = d
            g = (a + 40) | 0
            h = ((f[c >> 2] | 0) + (f[g >> 2] | 0)) | 0
            i = (a + 24) | 0
            j = f[(a + 32) >> 2] | 0
            k = (j + -262144) | 0
            do
                if (k >>> 0 >= 64) {
                    if (k >>> 0 < 16384) {
                        l = (a + 28) | 0
                        m = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        n = (j + -245760) | 0
                        b[m >> 0] = n
                        b[(m + 1) >> 0] = n >>> 8
                        o = ((f[l >> 2] | 0) + 2) | 0
                        break
                    }
                    if (k >>> 0 < 4194304) {
                        l = (a + 28) | 0
                        n = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        m = (j + 8126464) | 0
                        b[n >> 0] = m
                        b[(n + 1) >> 0] = m >>> 8
                        b[(n + 2) >> 0] = m >>> 16
                        o = ((f[l >> 2] | 0) + 3) | 0
                        break
                    }
                    if (k >>> 0 < 1073741824) {
                        l = (a + 28) | 0
                        m = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        n = (j + -1074003968) | 0
                        b[m >> 0] = n
                        b[(m + 1) >> 0] = n >>> 8
                        b[(m + 2) >> 0] = n >>> 16
                        b[(m + 3) >> 0] = n >>> 24
                        o = ((f[l >> 2] | 0) + 4) | 0
                        break
                    } else {
                        o = f[(a + 28) >> 2] | 0
                        break
                    }
                } else {
                    l = (a + 28) | 0
                    b[((f[i >> 2] | 0) + (f[l >> 2] | 0)) >> 0] = k
                    o = ((f[l >> 2] | 0) + 1) | 0
                }
            while (0)
            k = (((o | 0) < 0) << 31) >> 31
            Cn(e)
            eh(o, k, e) | 0
            i = (e + 4) | 0
            a = ((f[i >> 2] | 0) - (f[e >> 2] | 0)) | 0
            Xl((h + a) | 0, h | 0, o | 0) | 0
            Rg(h | 0, f[e >> 2] | 0, a | 0) | 0
            h = g
            g = f[h >> 2] | 0
            j = f[(h + 4) >> 2] | 0
            h = Tn(a | 0, 0, o | 0, k | 0) | 0
            k = Tn(h | 0, I | 0, g | 0, j | 0) | 0
            vl(c, k, I)
            k = (e + 12) | 0
            c = f[k >> 2] | 0
            f[k >> 2] = 0
            if (c | 0) br(c)
            c = f[e >> 2] | 0
            if (!c) {
                u = d
                return
            }
            if ((f[i >> 2] | 0) != (c | 0)) f[i >> 2] = c
            br(c)
            u = d
            return
        }
        function Df(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            d = u
            u = (u + 32) | 0
            e = d
            g = (a + 40) | 0
            h = ((f[c >> 2] | 0) + (f[g >> 2] | 0)) | 0
            i = (a + 24) | 0
            j = f[(a + 32) >> 2] | 0
            k = (j + -131072) | 0
            do
                if (k >>> 0 >= 64) {
                    if (k >>> 0 < 16384) {
                        l = (a + 28) | 0
                        m = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        n = (j + -114688) | 0
                        b[m >> 0] = n
                        b[(m + 1) >> 0] = n >>> 8
                        o = ((f[l >> 2] | 0) + 2) | 0
                        break
                    }
                    if (k >>> 0 < 4194304) {
                        l = (a + 28) | 0
                        n = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        m = (j + 8257536) | 0
                        b[n >> 0] = m
                        b[(n + 1) >> 0] = m >>> 8
                        b[(n + 2) >> 0] = m >>> 16
                        o = ((f[l >> 2] | 0) + 3) | 0
                        break
                    }
                    if (k >>> 0 < 1073741824) {
                        l = (a + 28) | 0
                        m = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        n = (j + -1073872896) | 0
                        b[m >> 0] = n
                        b[(m + 1) >> 0] = n >>> 8
                        b[(m + 2) >> 0] = n >>> 16
                        b[(m + 3) >> 0] = n >>> 24
                        o = ((f[l >> 2] | 0) + 4) | 0
                        break
                    } else {
                        o = f[(a + 28) >> 2] | 0
                        break
                    }
                } else {
                    l = (a + 28) | 0
                    b[((f[i >> 2] | 0) + (f[l >> 2] | 0)) >> 0] = k
                    o = ((f[l >> 2] | 0) + 1) | 0
                }
            while (0)
            k = (((o | 0) < 0) << 31) >> 31
            Cn(e)
            eh(o, k, e) | 0
            i = (e + 4) | 0
            a = ((f[i >> 2] | 0) - (f[e >> 2] | 0)) | 0
            Xl((h + a) | 0, h | 0, o | 0) | 0
            Rg(h | 0, f[e >> 2] | 0, a | 0) | 0
            h = g
            g = f[h >> 2] | 0
            j = f[(h + 4) >> 2] | 0
            h = Tn(a | 0, 0, o | 0, k | 0) | 0
            k = Tn(h | 0, I | 0, g | 0, j | 0) | 0
            vl(c, k, I)
            k = (e + 12) | 0
            c = f[k >> 2] | 0
            f[k >> 2] = 0
            if (c | 0) br(c)
            c = f[e >> 2] | 0
            if (!c) {
                u = d
                return
            }
            if ((f[i >> 2] | 0) != (c | 0)) f[i >> 2] = c
            br(c)
            u = d
            return
        }
        function Ef(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            d = u
            u = (u + 32) | 0
            e = d
            g = (a + 40) | 0
            h = ((f[c >> 2] | 0) + (f[g >> 2] | 0)) | 0
            i = (a + 24) | 0
            j = f[(a + 32) >> 2] | 0
            k = (j + -32768) | 0
            do
                if (k >>> 0 >= 64) {
                    if (k >>> 0 < 16384) {
                        l = (a + 28) | 0
                        m = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        n = (j + -16384) | 0
                        b[m >> 0] = n
                        b[(m + 1) >> 0] = n >>> 8
                        o = ((f[l >> 2] | 0) + 2) | 0
                        break
                    }
                    if (k >>> 0 < 4194304) {
                        l = (a + 28) | 0
                        n = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        m = (j + 8355840) | 0
                        b[n >> 0] = m
                        b[(n + 1) >> 0] = m >>> 8
                        b[(n + 2) >> 0] = m >>> 16
                        o = ((f[l >> 2] | 0) + 3) | 0
                        break
                    }
                    if (k >>> 0 < 1073741824) {
                        l = (a + 28) | 0
                        m = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        n = (j + -1073774592) | 0
                        b[m >> 0] = n
                        b[(m + 1) >> 0] = n >>> 8
                        b[(m + 2) >> 0] = n >>> 16
                        b[(m + 3) >> 0] = n >>> 24
                        o = ((f[l >> 2] | 0) + 4) | 0
                        break
                    } else {
                        o = f[(a + 28) >> 2] | 0
                        break
                    }
                } else {
                    l = (a + 28) | 0
                    b[((f[i >> 2] | 0) + (f[l >> 2] | 0)) >> 0] = k
                    o = ((f[l >> 2] | 0) + 1) | 0
                }
            while (0)
            k = (((o | 0) < 0) << 31) >> 31
            Cn(e)
            eh(o, k, e) | 0
            i = (e + 4) | 0
            a = ((f[i >> 2] | 0) - (f[e >> 2] | 0)) | 0
            Xl((h + a) | 0, h | 0, o | 0) | 0
            Rg(h | 0, f[e >> 2] | 0, a | 0) | 0
            h = g
            g = f[h >> 2] | 0
            j = f[(h + 4) >> 2] | 0
            h = Tn(a | 0, 0, o | 0, k | 0) | 0
            k = Tn(h | 0, I | 0, g | 0, j | 0) | 0
            vl(c, k, I)
            k = (e + 12) | 0
            c = f[k >> 2] | 0
            f[k >> 2] = 0
            if (c | 0) br(c)
            c = f[e >> 2] | 0
            if (!c) {
                u = d
                return
            }
            if ((f[i >> 2] | 0) != (c | 0)) f[i >> 2] = c
            br(c)
            u = d
            return
        }
        function Ff(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0
            c = f[b >> 2] | 0
            d = f[(b + 4) >> 2] | 0
            e = f[(b + 8) >> 2] | 0
            g = f[(b + 12) >> 2] | 0
            b = ((((((c ^ 318) + 239) ^ d) + 239) ^ e) + 239) ^ g
            h = f[(a + 4) >> 2] | 0
            if (!h) {
                i = 0
                return i | 0
            }
            j = (h + -1) | 0
            k = ((j & h) | 0) == 0
            if (!k)
                if (b >>> 0 < h >>> 0) l = b
                else l = (b >>> 0) % (h >>> 0) | 0
            else l = b & j
            m = f[((f[a >> 2] | 0) + (l << 2)) >> 2] | 0
            if (!m) {
                i = 0
                return i | 0
            }
            a = f[m >> 2] | 0
            if (!a) {
                i = 0
                return i | 0
            }
            if (k) {
                k = a
                while (1) {
                    m = f[(k + 4) >> 2] | 0
                    n = (m | 0) == (b | 0)
                    if (!(n | (((m & j) | 0) == (l | 0)))) {
                        i = 0
                        o = 25
                        break
                    }
                    if ((((n ? (f[(k + 8) >> 2] | 0) == (c | 0) : 0) ? (f[(k + 12) >> 2] | 0) == (d | 0) : 0) ? (f[(k + 16) >> 2] | 0) == (e | 0) : 0) ? (f[(k + 20) >> 2] | 0) == (g | 0) : 0) {
                        i = k
                        o = 25
                        break
                    }
                    k = f[k >> 2] | 0
                    if (!k) {
                        i = 0
                        o = 25
                        break
                    }
                }
                if ((o | 0) == 25) return i | 0
            } else p = a
            while (1) {
                a = f[(p + 4) >> 2] | 0
                if ((a | 0) == (b | 0)) {
                    if ((((f[(p + 8) >> 2] | 0) == (c | 0) ? (f[(p + 12) >> 2] | 0) == (d | 0) : 0) ? (f[(p + 16) >> 2] | 0) == (e | 0) : 0) ? (f[(p + 20) >> 2] | 0) == (g | 0) : 0) {
                        i = p
                        o = 25
                        break
                    }
                } else {
                    if (a >>> 0 < h >>> 0) q = a
                    else q = (a >>> 0) % (h >>> 0) | 0
                    if ((q | 0) != (l | 0)) {
                        i = 0
                        o = 25
                        break
                    }
                }
                p = f[p >> 2] | 0
                if (!p) {
                    i = 0
                    o = 25
                    break
                }
            }
            if ((o | 0) == 25) return i | 0
            return 0
        }
        function Gf(a, c, d, e, g, h, i) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0
            a = u
            u = (u + 96) | 0
            j = a
            if (!c) {
                k = -1
                u = a
                return k | 0
            }
            Lm(j)
            yj(j, d, 0, g & 255, i, 0, g, 0, 0, 0)
            i = uh(c, j, 1, e) | 0
            d = f[((f[(c + 8) >> 2] | 0) + (i << 2)) >> 2] | 0
            if (e | 0) {
                l = (d + 84) | 0
                m = (d + 68) | 0
                n = (d + 40) | 0
                o = (d + 64) | 0
                d = 0
                do {
                    if (!(b[l >> 0] | 0)) p = f[((f[m >> 2] | 0) + (d << 2)) >> 2] | 0
                    else p = d
                    q = (h + (X(d, g) | 0)) | 0
                    r = n
                    s = f[r >> 2] | 0
                    t = on(s | 0, f[(r + 4) >> 2] | 0, p | 0, 0) | 0
                    Rg(((f[f[o >> 2] >> 2] | 0) + t) | 0, q | 0, s | 0) | 0
                    d = (d + 1) | 0
                } while ((d | 0) != (e | 0))
            }
            d = (c + 80) | 0
            c = f[d >> 2] | 0
            if (c)
                if ((c | 0) == (e | 0)) v = 10
                else w = -1
            else {
                f[d >> 2] = e
                v = 10
            }
            if ((v | 0) == 10) w = i
            i = (j + 88) | 0
            v = f[i >> 2] | 0
            f[i >> 2] = 0
            if (v | 0) {
                i = f[(v + 8) >> 2] | 0
                if (i | 0) {
                    e = (v + 12) | 0
                    if ((f[e >> 2] | 0) != (i | 0)) f[e >> 2] = i
                    br(i)
                }
                br(v)
            }
            v = f[(j + 68) >> 2] | 0
            if (v | 0) {
                i = (j + 72) | 0
                e = f[i >> 2] | 0
                if ((e | 0) != (v | 0)) f[i >> 2] = e + (~(((e + -4 - v) | 0) >>> 2) << 2)
                br(v)
            }
            v = (j + 64) | 0
            j = f[v >> 2] | 0
            f[v >> 2] = 0
            if (j | 0) {
                v = f[j >> 2] | 0
                if (v | 0) {
                    e = (j + 4) | 0
                    if ((f[e >> 2] | 0) != (v | 0)) f[e >> 2] = v
                    br(v)
                }
                br(j)
            }
            k = w
            u = a
            return k | 0
        }
        function Hf(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            var h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            h = u
            u = (u + 32) | 0
            i = h
            j = (h + 16) | 0
            k = f[((f[((f[(b + 4) >> 2] | 0) + 8) >> 2] | 0) + (d << 2)) >> 2] | 0
            do
                if ((((c + -1) | 0) >>> 0 < 6) & ((Qa[f[((f[b >> 2] | 0) + 8) >> 2] & 127](b) | 0) == 1)) {
                    l = Qa[f[((f[b >> 2] | 0) + 52) >> 2] & 127](b) | 0
                    m = Ra[f[((f[b >> 2] | 0) + 60) >> 2] & 127](b, d) | 0
                    if (((l | 0) == 0) | ((m | 0) == 0)) {
                        f[a >> 2] = 0
                        u = h
                        return
                    }
                    n = Ra[f[((f[b >> 2] | 0) + 56) >> 2] & 127](b, d) | 0
                    if (!n) {
                        f[i >> 2] = f[(b + 56) >> 2]
                        f[(i + 4) >> 2] = l
                        f[(i + 12) >> 2] = m
                        f[(i + 8) >> 2] = m + 12
                        Od(a, j, c, k, e, i, g)
                        if (!(f[a >> 2] | 0)) {
                            f[a >> 2] = 0
                            break
                        }
                        u = h
                        return
                    } else {
                        f[i >> 2] = f[(b + 56) >> 2]
                        f[(i + 4) >> 2] = n
                        f[(i + 12) >> 2] = m
                        f[(i + 8) >> 2] = m + 12
                        Nd(a, j, c, k, e, i, g)
                        if (!(f[a >> 2] | 0)) {
                            f[a >> 2] = 0
                            break
                        }
                        u = h
                        return
                    }
                }
            while (0)
            f[a >> 2] = 0
            u = h
            return
        }
        function If(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0
            e = f[d >> 2] | 0
            g = f[(d + 4) >> 2] | 0
            if ((e | 0) == (g | 0)) {
                h = 0
                i = (a + 12) | 0
                j = (a + 8) | 0
            } else {
                d = f[c >> 2] | 0
                c = (a + 8) | 0
                k = (a + 12) | 0
                a = 0
                l = e
                while (1) {
                    e = f[l >> 2] | 0
                    m = f[(d + (e << 2)) >> 2] | 0
                    if (m >>> 0 < a >>> 0) n = a
                    else {
                        o = f[c >> 2] | 0
                        p = ((f[k >> 2] | 0) - o) | 0
                        q = o
                        if ((p | 0) > 0) {
                            o = p >>> 2
                            p = 0
                            do {
                                r = f[(q + (p << 2)) >> 2] | 0
                                s = f[(r + 68) >> 2] | 0
                                if (!(b[(r + 84) >> 0] | 0)) t = f[(s + (e << 2)) >> 2] | 0
                                else t = e
                                f[(s + (m << 2)) >> 2] = t
                                p = (p + 1) | 0
                            } while ((p | 0) < (o | 0))
                        }
                        n = (m + 1) | 0
                    }
                    l = (l + 4) | 0
                    if ((l | 0) == (g | 0)) {
                        h = n
                        i = k
                        j = c
                        break
                    } else a = n
                }
            }
            n = f[i >> 2] | 0
            a = f[j >> 2] | 0
            if (((n - a) | 0) > 0) {
                u = 0
                v = a
                w = n
            } else return
            while (1) {
                n = f[(v + (u << 2)) >> 2] | 0
                b[(n + 84) >> 0] = 0
                a = (n + 68) | 0
                c = (n + 72) | 0
                n = f[c >> 2] | 0
                k = f[a >> 2] | 0
                g = (n - k) >> 2
                l = k
                k = n
                if (h >>> 0 <= g >>> 0)
                    if (h >>> 0 < g >>> 0 ? ((n = (l + (h << 2)) | 0), (n | 0) != (k | 0)) : 0) {
                        f[c >> 2] = k + (~(((k + -4 - n) | 0) >>> 2) << 2)
                        x = v
                        y = w
                    } else {
                        x = v
                        y = w
                    }
                else {
                    kh(a, (h - g) | 0, 5908)
                    x = f[j >> 2] | 0
                    y = f[i >> 2] | 0
                }
                u = (u + 1) | 0
                if ((u | 0) >= (((y - x) >> 2) | 0)) break
                else {
                    v = x
                    w = y
                }
            }
            return
        }
        function Jf(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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
            d = b
            e = (c - d) >> 2
            g = (a + 8) | 0
            h = f[g >> 2] | 0
            i = f[a >> 2] | 0
            j = i
            if (e >>> 0 <= ((h - i) >> 2) >>> 0) {
                k = (a + 4) | 0
                l = ((f[k >> 2] | 0) - i) >> 2
                m = e >>> 0 > l >>> 0
                n = (b + (l << 2)) | 0
                l = m ? n : c
                o = l
                p = (o - d) | 0
                q = p >> 2
                if (q | 0) Xl(i | 0, b | 0, p | 0) | 0
                p = (j + (q << 2)) | 0
                if (!m) {
                    m = f[k >> 2] | 0
                    if ((m | 0) == (p | 0)) return
                    f[k >> 2] = m + (~(((m + -4 - p) | 0) >>> 2) << 2)
                    return
                }
                if ((l | 0) == (c | 0)) return
                l = f[k >> 2] | 0
                p = ((((c + -4 - o) | 0) >>> 2) + 1) | 0
                o = n
                n = l
                while (1) {
                    f[n >> 2] = f[o >> 2]
                    o = (o + 4) | 0
                    if ((o | 0) == (c | 0)) break
                    else n = (n + 4) | 0
                }
                f[k >> 2] = l + (p << 2)
                return
            }
            p = i
            if (!i) r = h
            else {
                h = (a + 4) | 0
                l = f[h >> 2] | 0
                if ((l | 0) != (j | 0)) f[h >> 2] = l + (~(((l + -4 - i) | 0) >>> 2) << 2)
                br(p)
                f[g >> 2] = 0
                f[h >> 2] = 0
                f[a >> 2] = 0
                r = 0
            }
            if (e >>> 0 > 1073741823) mq(a)
            h = r >> 1
            p = (r >> 2) >>> 0 < 536870911 ? (h >>> 0 < e >>> 0 ? e : h) : 1073741823
            if (p >>> 0 > 1073741823) mq(a)
            h = dn(p << 2) | 0
            e = (a + 4) | 0
            f[e >> 2] = h
            f[a >> 2] = h
            f[g >> 2] = h + (p << 2)
            if ((b | 0) == (c | 0)) return
            p = ((((c + -4 - d) | 0) >>> 2) + 1) | 0
            d = b
            b = h
            while (1) {
                f[b >> 2] = f[d >> 2]
                d = (d + 4) | 0
                if ((d | 0) == (c | 0)) break
                else b = (b + 4) | 0
            }
            f[e >> 2] = h + (p << 2)
            return
        }
        function Kf(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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
            c = u
            u = (u + 16) | 0
            d = c
            e = (a + 76) | 0
            g = f[e >> 2] | 0
            h = (a + 80) | 0
            i = f[h >> 2] | 0
            if ((i | 0) != (g | 0)) f[h >> 2] = i + (~(((i + -4 - g) | 0) >>> 2) << 2)
            f[e >> 2] = 0
            f[h >> 2] = 0
            f[(a + 84) >> 2] = 0
            if (g | 0) br(g)
            g = (a + 64) | 0
            h = f[g >> 2] | 0
            e = (a + 68) | 0
            if ((f[e >> 2] | 0) != (h | 0)) f[e >> 2] = h
            f[g >> 2] = 0
            f[e >> 2] = 0
            f[(a + 72) >> 2] = 0
            if (h | 0) br(h)
            h = (b + 4) | 0
            e = f[h >> 2] | 0
            g = f[b >> 2] | 0
            i = (((((e - g) | 0) / 12) | 0) * 3) | 0
            j = (a + 4) | 0
            k = f[j >> 2] | 0
            l = f[a >> 2] | 0
            m = (k - l) >> 2
            n = l
            l = k
            k = g
            if (i >>> 0 <= m >>> 0)
                if (i >>> 0 < m >>> 0 ? ((o = (n + (i << 2)) | 0), (o | 0) != (l | 0)) : 0) {
                    f[j >> 2] = l + (~(((l + -4 - o) | 0) >>> 2) << 2)
                    p = e
                    q = g
                    r = k
                } else {
                    p = e
                    q = g
                    r = k
                }
            else {
                oi(a, (i - m) | 0)
                m = f[b >> 2] | 0
                p = f[h >> 2] | 0
                q = m
                r = m
            }
            if ((p | 0) != (q | 0)) {
                q = f[a >> 2] | 0
                m = (((p - r) | 0) / 12) | 0
                p = 0
                do {
                    h = (p * 3) | 0
                    f[(q + (h << 2)) >> 2] = f[(r + ((p * 12) | 0)) >> 2]
                    f[(q + ((h + 1) << 2)) >> 2] = f[(r + ((p * 12) | 0) + 4) >> 2]
                    f[(q + ((h + 2) << 2)) >> 2] = f[(r + ((p * 12) | 0) + 8) >> 2]
                    p = (p + 1) | 0
                } while (p >>> 0 < m >>> 0)
            }
            f[d >> 2] = -1
            if (!(oc(a, d) | 0)) {
                s = 0
                u = c
                return s | 0
            }
            Gc(a) | 0
            fb(a, f[d >> 2] | 0) | 0
            s = 1
            u = c
            return s | 0
        }
        function Lf(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            d = u
            u = (u + 32) | 0
            e = d
            g = (a + 40) | 0
            h = ((f[c >> 2] | 0) + (f[g >> 2] | 0)) | 0
            i = (a + 24) | 0
            j = f[(a + 32) >> 2] | 0
            k = (j + -16384) | 0
            do
                if (k >>> 0 >= 64) {
                    if (k >>> 0 < 16384) {
                        l = (a + 28) | 0
                        m = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        b[m >> 0] = j
                        b[(m + 1) >> 0] = j >>> 8
                        n = ((f[l >> 2] | 0) + 2) | 0
                        break
                    }
                    if (k >>> 0 < 4194304) {
                        l = (a + 28) | 0
                        m = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        o = (j + 8372224) | 0
                        b[m >> 0] = o
                        b[(m + 1) >> 0] = o >>> 8
                        b[(m + 2) >> 0] = o >>> 16
                        n = ((f[l >> 2] | 0) + 3) | 0
                        break
                    }
                    if (k >>> 0 < 1073741824) {
                        l = (a + 28) | 0
                        o = ((f[i >> 2] | 0) + (f[l >> 2] | 0)) | 0
                        m = (j + -1073758208) | 0
                        b[o >> 0] = m
                        b[(o + 1) >> 0] = m >>> 8
                        b[(o + 2) >> 0] = m >>> 16
                        b[(o + 3) >> 0] = m >>> 24
                        n = ((f[l >> 2] | 0) + 4) | 0
                        break
                    } else {
                        n = f[(a + 28) >> 2] | 0
                        break
                    }
                } else {
                    l = (a + 28) | 0
                    b[((f[i >> 2] | 0) + (f[l >> 2] | 0)) >> 0] = k
                    n = ((f[l >> 2] | 0) + 1) | 0
                }
            while (0)
            k = (((n | 0) < 0) << 31) >> 31
            Cn(e)
            eh(n, k, e) | 0
            i = (e + 4) | 0
            a = ((f[i >> 2] | 0) - (f[e >> 2] | 0)) | 0
            Xl((h + a) | 0, h | 0, n | 0) | 0
            Rg(h | 0, f[e >> 2] | 0, a | 0) | 0
            h = g
            g = f[h >> 2] | 0
            j = f[(h + 4) >> 2] | 0
            h = Tn(a | 0, 0, n | 0, k | 0) | 0
            k = Tn(h | 0, I | 0, g | 0, j | 0) | 0
            vl(c, k, I)
            k = (e + 12) | 0
            c = f[k >> 2] | 0
            f[k >> 2] = 0
            if (c | 0) br(c)
            c = f[e >> 2] | 0
            if (!c) {
                u = d
                return
            }
            if ((f[i >> 2] | 0) != (c | 0)) f[i >> 2] = c
            br(c)
            u = d
            return
        }
        function Mf(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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
            d = b
            e = (c - d) >> 2
            g = (a + 8) | 0
            h = f[g >> 2] | 0
            i = f[a >> 2] | 0
            j = i
            if (e >>> 0 <= ((h - i) >> 2) >>> 0) {
                k = (a + 4) | 0
                l = ((f[k >> 2] | 0) - i) >> 2
                m = e >>> 0 > l >>> 0
                n = (b + (l << 2)) | 0
                l = m ? n : c
                o = l
                p = (o - d) | 0
                q = p >> 2
                if (q | 0) Xl(i | 0, b | 0, p | 0) | 0
                p = (j + (q << 2)) | 0
                if (!m) {
                    m = f[k >> 2] | 0
                    if ((m | 0) == (p | 0)) return
                    f[k >> 2] = m + (~(((m + -4 - p) | 0) >>> 2) << 2)
                    return
                }
                if ((l | 0) == (c | 0)) return
                l = f[k >> 2] | 0
                p = (c + -4 - o) | 0
                o = n
                n = l
                while (1) {
                    f[n >> 2] = f[o >> 2]
                    o = (o + 4) | 0
                    if ((o | 0) == (c | 0)) break
                    else n = (n + 4) | 0
                }
                f[k >> 2] = l + (((p >>> 2) + 1) << 2)
                return
            }
            p = i
            if (!i) r = h
            else {
                h = (a + 4) | 0
                l = f[h >> 2] | 0
                if ((l | 0) != (j | 0)) f[h >> 2] = l + (~(((l + -4 - i) | 0) >>> 2) << 2)
                br(p)
                f[g >> 2] = 0
                f[h >> 2] = 0
                f[a >> 2] = 0
                r = 0
            }
            if (e >>> 0 > 1073741823) mq(a)
            h = r >> 1
            p = (r >> 2) >>> 0 < 536870911 ? (h >>> 0 < e >>> 0 ? e : h) : 1073741823
            if (p >>> 0 > 1073741823) mq(a)
            h = dn(p << 2) | 0
            e = (a + 4) | 0
            f[e >> 2] = h
            f[a >> 2] = h
            f[g >> 2] = h + (p << 2)
            if ((b | 0) == (c | 0)) return
            p = (c + -4 - d) | 0
            d = b
            b = h
            while (1) {
                f[b >> 2] = f[d >> 2]
                d = (d + 4) | 0
                if ((d | 0) == (c | 0)) break
                else b = (b + 4) | 0
            }
            f[e >> 2] = h + (((p >>> 2) + 1) << 2)
            return
        }
        function Nf(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            g = u
            u = (u + 80) | 0
            h = g
            i = (g + 64) | 0
            Al(h)
            j = f[((f[(a + 8) >> 2] | 0) + 56) >> 2] | 0
            k = X(Ll(5) | 0, d) | 0
            yj(h, j, 0, d & 255, 5, 0, k, (((k | 0) < 0) << 31) >> 31, 0, 0)
            k = dn(96) | 0
            nl(k, h)
            pj(k, c) | 0
            f[i >> 2] = k
            Wi(a, i)
            k = f[i >> 2] | 0
            f[i >> 2] = 0
            if (k | 0) {
                i = (k + 88) | 0
                c = f[i >> 2] | 0
                f[i >> 2] = 0
                if (c | 0) {
                    i = f[(c + 8) >> 2] | 0
                    if (i | 0) {
                        h = (c + 12) | 0
                        if ((f[h >> 2] | 0) != (i | 0)) f[h >> 2] = i
                        br(i)
                    }
                    br(c)
                }
                c = f[(k + 68) >> 2] | 0
                if (c | 0) {
                    i = (k + 72) | 0
                    h = f[i >> 2] | 0
                    if ((h | 0) != (c | 0)) f[i >> 2] = h + (~(((h + -4 - c) | 0) >>> 2) << 2)
                    br(c)
                }
                c = (k + 64) | 0
                h = f[c >> 2] | 0
                f[c >> 2] = 0
                if (h | 0) {
                    c = f[h >> 2] | 0
                    if (c | 0) {
                        i = (h + 4) | 0
                        if ((f[i >> 2] | 0) != (c | 0)) f[i >> 2] = c
                        br(c)
                    }
                    br(h)
                }
                br(k)
            }
            if (!e) {
                u = g
                return
            }
            k = f[(a + 32) >> 2] | 0
            b[(k + 84) >> 0] = 0
            a = (k + 68) | 0
            h = (k + 72) | 0
            k = f[h >> 2] | 0
            c = f[a >> 2] | 0
            i = (k - c) >> 2
            d = k
            if (i >>> 0 < e >>> 0) {
                kh(a, (e - i) | 0, 1516)
                u = g
                return
            }
            if (i >>> 0 <= e >>> 0) {
                u = g
                return
            }
            i = (c + (e << 2)) | 0
            if ((i | 0) == (d | 0)) {
                u = g
                return
            }
            f[h >> 2] = d + (~(((d + -4 - i) | 0) >>> 2) << 2)
            u = g
            return
        }
        function Of(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0
            c = u
            u = (u + 16) | 0
            d = (c + 4) | 0
            e = c
            g = (a + 4) | 0
            h = f[g >> 2] | 0
            i = (a + 8) | 0
            j = f[i >> 2] | 0
            if ((j | 0) == (h | 0)) k = h
            else {
                l = (j + (~(((j + -4 - h) | 0) >>> 2) << 2)) | 0
                f[i >> 2] = l
                k = l
            }
            l = (a + 16) | 0
            h = f[l >> 2] | 0
            j = (a + 20) | 0
            m = f[j >> 2] | 0
            n = h
            if ((m | 0) != (h | 0)) f[j >> 2] = m + (~(((m + -4 - n) | 0) >>> 2) << 2)
            m = f[b >> 2] | 0
            h = f[(b + 4) >> 2] | 0
            if ((m | 0) == (h | 0)) {
                u = c
                return
            }
            b = (a + 12) | 0
            a = m
            m = k
            k = n
            while (1) {
                n = f[a >> 2] | 0
                f[d >> 2] = n
                if ((m | 0) == (f[b >> 2] | 0)) {
                    Ci(g, d)
                    o = f[l >> 2] | 0
                } else {
                    f[m >> 2] = n
                    f[i >> 2] = m + 4
                    o = k
                }
                n = f[d >> 2] | 0
                p = f[j >> 2] | 0
                q = (p - o) >> 2
                r = o
                if ((n | 0) < (q | 0)) {
                    s = r
                    t = n
                    v = o
                } else {
                    w = (n + 1) | 0
                    f[e >> 2] = -1
                    x = p
                    if (w >>> 0 <= q >>> 0)
                        if (w >>> 0 < q >>> 0 ? ((p = (r + (w << 2)) | 0), (p | 0) != (x | 0)) : 0) {
                            f[j >> 2] = x + (~(((x + -4 - p) | 0) >>> 2) << 2)
                            y = n
                            z = r
                            A = o
                        } else {
                            y = n
                            z = r
                            A = o
                        }
                    else {
                        kh(l, (w - q) | 0, e)
                        q = f[l >> 2] | 0
                        y = f[d >> 2] | 0
                        z = q
                        A = q
                    }
                    s = z
                    t = y
                    v = A
                }
                m = f[i >> 2] | 0
                f[(s + (t << 2)) >> 2] = ((m - (f[g >> 2] | 0)) >> 2) + -1
                a = (a + 4) | 0
                if ((a | 0) == (h | 0)) break
                else k = v
            }
            u = c
            return
        }
        function Pf(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0
            c = d[b >> 1] | 0
            e = d[(b + 2) >> 1] | 0
            g = d[(b + 4) >> 1] | 0
            b = (((((c ^ 318) & 65535) + 239) ^ (e & 65535)) + 239) ^ (g & 65535)
            h = f[(a + 4) >> 2] | 0
            if (!h) {
                i = 0
                return i | 0
            }
            j = (h + -1) | 0
            k = ((j & h) | 0) == 0
            if (!k)
                if (b >>> 0 < h >>> 0) l = b
                else l = (b >>> 0) % (h >>> 0) | 0
            else l = b & j
            m = f[((f[a >> 2] | 0) + (l << 2)) >> 2] | 0
            if (!m) {
                i = 0
                return i | 0
            }
            a = f[m >> 2] | 0
            if (!a) {
                i = 0
                return i | 0
            }
            if (k) {
                k = a
                while (1) {
                    m = f[(k + 4) >> 2] | 0
                    n = (m | 0) == (b | 0)
                    if (!(n | (((m & j) | 0) == (l | 0)))) {
                        i = 0
                        o = 23
                        break
                    }
                    if (((n ? ((n = (k + 8) | 0), (d[n >> 1] | 0) == (c << 16) >> 16) : 0) ? (d[(n + 2) >> 1] | 0) == (e << 16) >> 16 : 0) ? (d[(k + 12) >> 1] | 0) == (g << 16) >> 16 : 0) {
                        i = k
                        o = 23
                        break
                    }
                    k = f[k >> 2] | 0
                    if (!k) {
                        i = 0
                        o = 23
                        break
                    }
                }
                if ((o | 0) == 23) return i | 0
            } else p = a
            while (1) {
                a = f[(p + 4) >> 2] | 0
                if ((a | 0) == (b | 0)) {
                    k = (p + 8) | 0
                    if (((d[k >> 1] | 0) == (c << 16) >> 16 ? (d[(k + 2) >> 1] | 0) == (e << 16) >> 16 : 0) ? (d[(p + 12) >> 1] | 0) == (g << 16) >> 16 : 0) {
                        i = p
                        o = 23
                        break
                    }
                } else {
                    if (a >>> 0 < h >>> 0) q = a
                    else q = (a >>> 0) % (h >>> 0) | 0
                    if ((q | 0) != (l | 0)) {
                        i = 0
                        o = 23
                        break
                    }
                }
                p = f[p >> 2] | 0
                if (!p) {
                    i = 0
                    o = 23
                    break
                }
            }
            if ((o | 0) == 23) return i | 0
            return 0
        }
        function Qf(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0
            c = u
            u = (u + 32) | 0
            d = c
            e = (a + 16) | 0
            g = e
            h = f[g >> 2] | 0
            i = f[(g + 4) >> 2] | 0
            if (!(((i | 0) > 0) | (((i | 0) == 0) & (h >>> 0 > 0)))) {
                u = c
                return
            }
            g = Tn(f[((f[(a + 12) >> 2] | 0) + 4) >> 2] | 0, 0, 7, 0) | 0
            j = Wn(g | 0, I | 0, 3) | 0
            g = I
            if (!(b[(a + 24) >> 0] | 0)) {
                k = (a + 4) | 0
                l = k
                m = k
                n = h
                o = i
            } else {
                k = f[a >> 2] | 0
                p = (a + 4) | 0
                q = (k + ((f[p >> 2] | 0) - k)) | 0
                k = Tn(h | 0, i | 0, 8, 0) | 0
                i = (q + (0 - k)) | 0
                f[d >> 2] = 0
                f[(d + 4) >> 2] = 0
                f[(d + 8) >> 2] = 0
                f[(d + 12) >> 2] = 0
                f[(d + 16) >> 2] = 0
                f[(d + 20) >> 2] = 0
                b[(d + 24) >> 0] = 0
                eh(j, g, d) | 0
                k = (d + 4) | 0
                q = ((f[k >> 2] | 0) - (f[d >> 2] | 0)) | 0
                Xl((i + q) | 0, (i + 8) | 0, j | 0) | 0
                Rg(i | 0, f[d >> 2] | 0, q | 0) | 0
                i = e
                h = Tn(f[i >> 2] | 0, f[(i + 4) >> 2] | 0, (8 - q) | 0, 0) | 0
                q = e
                f[q >> 2] = h
                f[(q + 4) >> 2] = I
                q = (d + 12) | 0
                h = f[q >> 2] | 0
                f[q >> 2] = 0
                if (h | 0) br(h)
                h = f[d >> 2] | 0
                if (h | 0) {
                    if ((f[k >> 2] | 0) != (h | 0)) f[k >> 2] = h
                    br(h)
                }
                h = e
                l = p
                m = p
                n = f[h >> 2] | 0
                o = f[(h + 4) >> 2] | 0
            }
            h = f[l >> 2] | 0
            l = f[a >> 2] | 0
            p = (h - l) | 0
            k = Vn(j | 0, g | 0, n | 0, o | 0) | 0
            o = Tn(k | 0, I | 0, p | 0, 0) | 0
            k = l
            l = h
            if (p >>> 0 >= o >>> 0) {
                if (p >>> 0 > o >>> 0 ? ((h = (k + o) | 0), (h | 0) != (l | 0)) : 0) f[m >> 2] = h
            } else ri(a, (o - p) | 0)
            p = e
            f[p >> 2] = 0
            f[(p + 4) >> 2] = 0
            u = c
            return
        }
        function Rf(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0
            f[c >> 2] = 1
            d = (a + 4) | 0
            e = (c + 8) | 0
            g = (c + 12) | 0
            c = f[e >> 2] | 0
            i = ((f[g >> 2] | 0) - c) | 0
            if (i >>> 0 < 4294967292) {
                Bk(e, (i + 4) | 0, 0)
                j = f[e >> 2] | 0
            } else j = c
            c = (j + i) | 0
            i = h[d >> 0] | (h[(d + 1) >> 0] << 8) | (h[(d + 2) >> 0] << 16) | (h[(d + 3) >> 0] << 24)
            b[c >> 0] = i
            b[(c + 1) >> 0] = i >> 8
            b[(c + 2) >> 0] = i >> 16
            b[(c + 3) >> 0] = i >> 24
            i = (a + 8) | 0
            c = (a + 12) | 0
            d = f[i >> 2] | 0
            if ((f[c >> 2] | 0) != (d | 0)) {
                j = 0
                k = d
                do {
                    d = (k + (j << 2)) | 0
                    l = f[e >> 2] | 0
                    m = ((f[g >> 2] | 0) - l) | 0
                    if (m >>> 0 < 4294967292) {
                        Bk(e, (m + 4) | 0, 0)
                        n = f[e >> 2] | 0
                    } else n = l
                    l = (n + m) | 0
                    m = h[d >> 0] | (h[(d + 1) >> 0] << 8) | (h[(d + 2) >> 0] << 16) | (h[(d + 3) >> 0] << 24)
                    b[l >> 0] = m
                    b[(l + 1) >> 0] = m >> 8
                    b[(l + 2) >> 0] = m >> 16
                    b[(l + 3) >> 0] = m >> 24
                    j = (j + 1) | 0
                    k = f[i >> 2] | 0
                } while (j >>> 0 < (((f[c >> 2] | 0) - k) >> 2) >>> 0)
            }
            k = (a + 20) | 0
            a = f[e >> 2] | 0
            c = ((f[g >> 2] | 0) - a) | 0
            if (c >>> 0 < 4294967292) {
                Bk(e, (c + 4) | 0, 0)
                o = f[e >> 2] | 0
                p = (o + c) | 0
                q = h[k >> 0] | (h[(k + 1) >> 0] << 8) | (h[(k + 2) >> 0] << 16) | (h[(k + 3) >> 0] << 24)
                b[p >> 0] = q
                b[(p + 1) >> 0] = q >> 8
                b[(p + 2) >> 0] = q >> 16
                b[(p + 3) >> 0] = q >> 24
                return
            } else {
                o = a
                p = (o + c) | 0
                q = h[k >> 0] | (h[(k + 1) >> 0] << 8) | (h[(k + 2) >> 0] << 16) | (h[(k + 3) >> 0] << 24)
                b[p >> 0] = q
                b[(p + 1) >> 0] = q >> 8
                b[(p + 2) >> 0] = q >> 16
                b[(p + 3) >> 0] = q >> 24
                return
            }
        }
        function Sf(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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
            d = (a + 8) | 0
            e = f[d >> 2] | 0
            g = f[a >> 2] | 0
            h = g
            do
                if (((e - g) >> 2) >>> 0 >= b >>> 0) {
                    i = (a + 4) | 0
                    j = f[i >> 2] | 0
                    k = (j - g) >> 2
                    l = k >>> 0 < b >>> 0
                    m = l ? k : b
                    n = j
                    if (m | 0) {
                        j = m
                        m = h
                        while (1) {
                            f[m >> 2] = f[c >> 2]
                            j = (j + -1) | 0
                            if (!j) break
                            else m = (m + 4) | 0
                        }
                    }
                    if (!l) {
                        m = (h + (b << 2)) | 0
                        if ((m | 0) == (n | 0)) return
                        else {
                            o = i
                            p = (n + (~(((n + -4 - m) | 0) >>> 2) << 2)) | 0
                            break
                        }
                    } else {
                        m = (b - k) | 0
                        j = m
                        q = n
                        while (1) {
                            f[q >> 2] = f[c >> 2]
                            j = (j + -1) | 0
                            if (!j) break
                            else q = (q + 4) | 0
                        }
                        o = i
                        p = (n + (m << 2)) | 0
                        break
                    }
                } else {
                    q = g
                    if (!g) r = e
                    else {
                        j = (a + 4) | 0
                        k = f[j >> 2] | 0
                        if ((k | 0) != (h | 0)) f[j >> 2] = k + (~(((k + -4 - g) | 0) >>> 2) << 2)
                        br(q)
                        f[d >> 2] = 0
                        f[j >> 2] = 0
                        f[a >> 2] = 0
                        r = 0
                    }
                    if (b >>> 0 > 1073741823) mq(a)
                    j = r >> 1
                    q = (r >> 2) >>> 0 < 536870911 ? (j >>> 0 < b >>> 0 ? b : j) : 1073741823
                    if (q >>> 0 > 1073741823) mq(a)
                    j = dn(q << 2) | 0
                    k = (a + 4) | 0
                    f[k >> 2] = j
                    f[a >> 2] = j
                    f[d >> 2] = j + (q << 2)
                    q = b
                    l = j
                    while (1) {
                        f[l >> 2] = f[c >> 2]
                        q = (q + -1) | 0
                        if (!q) break
                        else l = (l + 4) | 0
                    }
                    o = k
                    p = (j + (b << 2)) | 0
                }
            while (0)
            f[o >> 2] = p
            return
        }
        function Tf(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            var h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            h = Qg(a, b, c, d, g) | 0
            i = f[e >> 2] | 0
            j = f[d >> 2] | 0
            k = f[g >> 2] | 0
            g = f[k >> 2] | 0
            l = ((f[(k + 4) >> 2] | 0) - g) >> 3
            if (l >>> 0 <= i >>> 0) mq(k)
            m = g
            if (l >>> 0 <= j >>> 0) mq(k)
            if ((f[(m + (i << 3)) >> 2] | 0) >>> 0 >= (f[(m + (j << 3)) >> 2] | 0) >>> 0) {
                n = h
                return n | 0
            }
            f[d >> 2] = i
            f[e >> 2] = j
            j = f[d >> 2] | 0
            e = f[c >> 2] | 0
            if (l >>> 0 <= j >>> 0) mq(k)
            if (l >>> 0 <= e >>> 0) mq(k)
            if ((f[(m + (j << 3)) >> 2] | 0) >>> 0 >= (f[(m + (e << 3)) >> 2] | 0) >>> 0) {
                n = (h + 1) | 0
                return n | 0
            }
            f[c >> 2] = j
            f[d >> 2] = e
            e = f[c >> 2] | 0
            d = f[b >> 2] | 0
            if (l >>> 0 <= e >>> 0) mq(k)
            if (l >>> 0 <= d >>> 0) mq(k)
            if ((f[(m + (e << 3)) >> 2] | 0) >>> 0 >= (f[(m + (d << 3)) >> 2] | 0) >>> 0) {
                n = (h + 2) | 0
                return n | 0
            }
            f[b >> 2] = e
            f[c >> 2] = d
            d = f[b >> 2] | 0
            c = f[a >> 2] | 0
            if (l >>> 0 <= d >>> 0) mq(k)
            if (l >>> 0 <= c >>> 0) mq(k)
            if ((f[(m + (d << 3)) >> 2] | 0) >>> 0 >= (f[(m + (c << 3)) >> 2] | 0) >>> 0) {
                n = (h + 3) | 0
                return n | 0
            }
            f[a >> 2] = d
            f[b >> 2] = c
            n = (h + 4) | 0
            return n | 0
        }
        function Uf(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0
            d = b[c >> 0] | 0
            e = b[(c + 1) >> 0] | 0
            g = b[(c + 2) >> 0] | 0
            c = (((((d & 255) ^ 318) + 239) ^ (e & 255)) + 239) ^ (g & 255)
            h = f[(a + 4) >> 2] | 0
            if (!h) {
                i = 0
                return i | 0
            }
            j = (h + -1) | 0
            k = ((j & h) | 0) == 0
            if (!k)
                if (c >>> 0 < h >>> 0) l = c
                else l = (c >>> 0) % (h >>> 0) | 0
            else l = c & j
            m = f[((f[a >> 2] | 0) + (l << 2)) >> 2] | 0
            if (!m) {
                i = 0
                return i | 0
            }
            a = f[m >> 2] | 0
            if (!a) {
                i = 0
                return i | 0
            }
            if (k) {
                k = a
                while (1) {
                    m = f[(k + 4) >> 2] | 0
                    n = (m | 0) == (c | 0)
                    if (!(n | (((m & j) | 0) == (l | 0)))) {
                        i = 0
                        o = 23
                        break
                    }
                    if (((n ? ((n = (k + 8) | 0), (b[n >> 0] | 0) == (d << 24) >> 24) : 0) ? (b[(n + 1) >> 0] | 0) == (e << 24) >> 24 : 0) ? (b[(n + 2) >> 0] | 0) == (g << 24) >> 24 : 0) {
                        i = k
                        o = 23
                        break
                    }
                    k = f[k >> 2] | 0
                    if (!k) {
                        i = 0
                        o = 23
                        break
                    }
                }
                if ((o | 0) == 23) return i | 0
            } else p = a
            while (1) {
                a = f[(p + 4) >> 2] | 0
                if ((a | 0) == (c | 0)) {
                    k = (p + 8) | 0
                    if (((b[k >> 0] | 0) == (d << 24) >> 24 ? (b[(k + 1) >> 0] | 0) == (e << 24) >> 24 : 0) ? (b[(k + 2) >> 0] | 0) == (g << 24) >> 24 : 0) {
                        i = p
                        o = 23
                        break
                    }
                } else {
                    if (a >>> 0 < h >>> 0) q = a
                    else q = (a >>> 0) % (h >>> 0) | 0
                    if ((q | 0) != (l | 0)) {
                        i = 0
                        o = 23
                        break
                    }
                }
                p = f[p >> 2] | 0
                if (!p) {
                    i = 0
                    o = 23
                    break
                }
            }
            if ((o | 0) == 23) return i | 0
            return 0
        }
        function Vf(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0
            b = u
            u = (u + 16) | 0
            c = b
            d = (a + 36) | 0
            e = (a + 4) | 0
            g = (a + 8) | 0
            h = ((f[g >> 2] | 0) - (f[e >> 2] | 0)) >> 2
            i = (a + 40) | 0
            j = f[i >> 2] | 0
            k = f[d >> 2] | 0
            l = (j - k) >> 2
            m = k
            k = j
            if (h >>> 0 <= l >>> 0) {
                if (h >>> 0 < l >>> 0 ? ((j = (m + (h << 2)) | 0), (j | 0) != (k | 0)) : 0) {
                    m = k
                    do {
                        k = (m + -4) | 0
                        f[i >> 2] = k
                        n = f[k >> 2] | 0
                        f[k >> 2] = 0
                        if (n | 0) Va[f[((f[n >> 2] | 0) + 4) >> 2] & 127](n)
                        m = f[i >> 2] | 0
                    } while ((m | 0) != (j | 0))
                }
            } else ng(d, (h - l) | 0)
            if ((f[g >> 2] | 0) == (f[e >> 2] | 0)) {
                o = 1
                u = b
                return o | 0
            }
            l = (a + 52) | 0
            h = (a + 48) | 0
            j = 0
            while (1) {
                Xa[f[((f[a >> 2] | 0) + 56) >> 2] & 15](c, a, j)
                m = ((f[d >> 2] | 0) + (j << 2)) | 0
                i = f[c >> 2] | 0
                f[c >> 2] = 0
                n = f[m >> 2] | 0
                f[m >> 2] = i
                if (n | 0) Va[f[((f[n >> 2] | 0) + 4) >> 2] & 127](n)
                n = f[c >> 2] | 0
                f[c >> 2] = 0
                if (n | 0) Va[f[((f[n >> 2] | 0) + 4) >> 2] & 127](n)
                n = f[((f[d >> 2] | 0) + (j << 2)) >> 2] | 0
                if (!n) {
                    o = 0
                    p = 19
                    break
                }
                if (j >>> 0 < (f[l >> 2] | 0) >>> 0 ? (f[((f[h >> 2] | 0) + ((j >>> 5) << 2)) >> 2] & (1 << (j & 31))) | 0 : 0) Pp(n)
                j = (j + 1) | 0
                if (j >>> 0 >= (((f[g >> 2] | 0) - (f[e >> 2] | 0)) >> 2) >>> 0) {
                    o = 1
                    p = 19
                    break
                }
            }
            if ((p | 0) == 19) {
                u = b
                return o | 0
            }
            return 0
        }
        function Wf(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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
            d = u
            u = (u + 16) | 0
            e = (d + 4) | 0
            g = d
            Nh(f[(c + 12) >> 2] | 0, b) | 0
            h = f[(c + 8) >> 2] | 0
            a: do
                if (h | 0) {
                    i = (b + 16) | 0
                    j = (b + 4) | 0
                    k = h
                    while (1) {
                        l = k
                        if (!(nf(0, b, (l + 8) | 0) | 0)) {
                            m = 0
                            break
                        }
                        n = (l + 20) | 0
                        o = ((f[(l + 24) >> 2] | 0) - (f[n >> 2] | 0)) | 0
                        Nh(o, b) | 0
                        l = f[n >> 2] | 0
                        n = i
                        p = f[(n + 4) >> 2] | 0
                        if (!(((p | 0) > 0) | (((p | 0) == 0) & ((f[n >> 2] | 0) >>> 0 > 0)))) {
                            f[g >> 2] = f[j >> 2]
                            f[e >> 2] = f[g >> 2]
                            ye(b, e, l, (l + o) | 0) | 0
                        }
                        k = f[k >> 2] | 0
                        if (!k) break a
                    }
                    u = d
                    return m | 0
                }
            while (0)
            Nh(f[(c + 32) >> 2] | 0, b) | 0
            e = f[(c + 28) >> 2] | 0
            if (!e) {
                m = 1
                u = d
                return m | 0
            } else q = e
            while (1) {
                e = q
                if (!(nf(0, b, (e + 8) | 0) | 0)) {
                    m = 0
                    r = 10
                    break
                }
                Wf(a, b, f[(e + 20) >> 2] | 0) | 0
                q = f[q >> 2] | 0
                if (!q) {
                    m = 1
                    r = 10
                    break
                }
            }
            if ((r | 0) == 10) {
                u = d
                return m | 0
            }
            return 0
        }
        function Xf(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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
            c = u
            u = (u + 16) | 0
            d = (c + 8) | 0
            e = (c + 4) | 0
            g = c
            h = (a + 8) | 0
            i = (a + 12) | 0
            j = f[h >> 2] | 0
            if ((f[i >> 2] | 0) == (j | 0)) {
                k = dn(76) | 0
                pn(k, b)
                l = k
                f[g >> 2] = l
                k = f[i >> 2] | 0
                if (k >>> 0 < (f[(a + 16) >> 2] | 0) >>> 0) {
                    f[g >> 2] = 0
                    f[k >> 2] = l
                    f[i >> 2] = k + 4
                    m = g
                } else {
                    yg(h, g)
                    m = g
                }
                g = f[m >> 2] | 0
                f[m >> 2] = 0
                if (!g) {
                    u = c
                    return 1
                }
                Va[f[((f[g >> 2] | 0) + 4) >> 2] & 127](g)
                u = c
                return 1
            }
            g = f[j >> 2] | 0
            f[d >> 2] = b
            j = (g + 4) | 0
            m = (g + 8) | 0
            h = f[m >> 2] | 0
            if ((h | 0) == (f[(g + 12) >> 2] | 0)) Ci(j, d)
            else {
                f[h >> 2] = b
                f[m >> 2] = h + 4
            }
            h = f[d >> 2] | 0
            b = (g + 16) | 0
            k = (g + 20) | 0
            g = f[k >> 2] | 0
            i = f[b >> 2] | 0
            l = (g - i) >> 2
            a = i
            if ((h | 0) < (l | 0)) {
                n = a
                o = h
            } else {
                i = (h + 1) | 0
                f[e >> 2] = -1
                p = g
                if (i >>> 0 <= l >>> 0)
                    if (i >>> 0 < l >>> 0 ? ((g = (a + (i << 2)) | 0), (g | 0) != (p | 0)) : 0) {
                        f[k >> 2] = p + (~(((p + -4 - g) | 0) >>> 2) << 2)
                        q = h
                        r = a
                    } else {
                        q = h
                        r = a
                    }
                else {
                    kh(b, (i - l) | 0, e)
                    q = f[d >> 2] | 0
                    r = f[b >> 2] | 0
                }
                n = r
                o = q
            }
            f[(n + (o << 2)) >> 2] = (((f[m >> 2] | 0) - (f[j >> 2] | 0)) >> 2) + -1
            u = c
            return 1
        }
        function Yf(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0
            d = c
            e = b
            g = (d - e) | 0
            h = g >> 2
            i = (a + 8) | 0
            j = f[i >> 2] | 0
            k = f[a >> 2] | 0
            l = k
            if (h >>> 0 > ((j - k) >> 2) >>> 0) {
                m = k
                if (!k) n = j
                else {
                    j = (a + 4) | 0
                    o = f[j >> 2] | 0
                    if ((o | 0) != (l | 0)) f[j >> 2] = o + (~(((o + -4 - k) | 0) >>> 2) << 2)
                    br(m)
                    f[i >> 2] = 0
                    f[j >> 2] = 0
                    f[a >> 2] = 0
                    n = 0
                }
                if (h >>> 0 > 1073741823) mq(a)
                j = n >> 1
                m = (n >> 2) >>> 0 < 536870911 ? (j >>> 0 < h >>> 0 ? h : j) : 1073741823
                if (m >>> 0 > 1073741823) mq(a)
                j = dn(m << 2) | 0
                n = (a + 4) | 0
                f[n >> 2] = j
                f[a >> 2] = j
                f[i >> 2] = j + (m << 2)
                if ((g | 0) <= 0) return
                Rg(j | 0, b | 0, g | 0) | 0
                f[n >> 2] = j + ((g >>> 2) << 2)
                return
            }
            g = (a + 4) | 0
            a = f[g >> 2] | 0
            j = (a - k) >> 2
            k = h >>> 0 > j >>> 0
            h = k ? (b + (j << 2)) | 0 : c
            c = a
            j = a
            if ((h | 0) == (b | 0)) p = l
            else {
                a = (h + -4 - e) | 0
                e = b
                b = l
                while (1) {
                    f[b >> 2] = f[e >> 2]
                    e = (e + 4) | 0
                    if ((e | 0) == (h | 0)) break
                    else b = (b + 4) | 0
                }
                p = (l + (((a >>> 2) + 1) << 2)) | 0
            }
            if (k) {
                k = (d - h) | 0
                if ((k | 0) <= 0) return
                Rg(j | 0, h | 0, k | 0) | 0
                f[g >> 2] = (f[g >> 2] | 0) + ((k >>> 2) << 2)
                return
            } else {
                if ((p | 0) == (c | 0)) return
                f[g >> 2] = c + (~(((c + -4 - p) | 0) >>> 2) << 2)
                return
            }
        }
        function Zf(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0
            g = u
            u = (u + 96) | 0
            h = (g + 40) | 0
            i = g
            Gm(h, d)
            we(i, c, d)
            th(h, i)
            sj((i + 24) | 0, f[(i + 28) >> 2] | 0)
            Dj((i + 12) | 0, f[(i + 16) >> 2] | 0)
            sj(i, f[(i + 4) >> 2] | 0)
            Si(a, h, e)
            if (!(f[a >> 2] | 0)) {
                e = (a + 4) | 0
                if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
                f[(c + 40) >> 2] = f[(h + 40) >> 2]
                f[(c + 44) >> 2] = f[(h + 44) >> 2]
                f[a >> 2] = 0
                f[(a + 4) >> 2] = 0
                f[(a + 8) >> 2] = 0
                f[(a + 12) >> 2] = 0
            }
            f[h >> 2] = 2968
            sj((h + 28) | 0, f[(h + 32) >> 2] | 0)
            Dj((h + 16) | 0, f[(h + 20) >> 2] | 0)
            sj((h + 4) | 0, f[(h + 8) >> 2] | 0)
            u = g
            return
        }
        function _f(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0
            c = f[b >> 2] | 0
            d = f[(b + 4) >> 2] | 0
            e = f[(b + 8) >> 2] | 0
            b = ((((c ^ 318) + 239) ^ d) + 239) ^ e
            g = f[(a + 4) >> 2] | 0
            if (!g) {
                h = 0
                return h | 0
            }
            i = (g + -1) | 0
            j = ((i & g) | 0) == 0
            if (!j)
                if (b >>> 0 < g >>> 0) k = b
                else k = (b >>> 0) % (g >>> 0) | 0
            else k = b & i
            l = f[((f[a >> 2] | 0) + (k << 2)) >> 2] | 0
            if (!l) {
                h = 0
                return h | 0
            }
            a = f[l >> 2] | 0
            if (!a) {
                h = 0
                return h | 0
            }
            if (j) {
                j = a
                while (1) {
                    l = f[(j + 4) >> 2] | 0
                    m = (l | 0) == (b | 0)
                    if (!(m | (((l & i) | 0) == (k | 0)))) {
                        h = 0
                        n = 23
                        break
                    }
                    if (((m ? (f[(j + 8) >> 2] | 0) == (c | 0) : 0) ? (f[(j + 12) >> 2] | 0) == (d | 0) : 0) ? (f[(j + 16) >> 2] | 0) == (e | 0) : 0) {
                        h = j
                        n = 23
                        break
                    }
                    j = f[j >> 2] | 0
                    if (!j) {
                        h = 0
                        n = 23
                        break
                    }
                }
                if ((n | 0) == 23) return h | 0
            } else o = a
            while (1) {
                a = f[(o + 4) >> 2] | 0
                if ((a | 0) == (b | 0)) {
                    if (((f[(o + 8) >> 2] | 0) == (c | 0) ? (f[(o + 12) >> 2] | 0) == (d | 0) : 0) ? (f[(o + 16) >> 2] | 0) == (e | 0) : 0) {
                        h = o
                        n = 23
                        break
                    }
                } else {
                    if (a >>> 0 < g >>> 0) p = a
                    else p = (a >>> 0) % (g >>> 0) | 0
                    if ((p | 0) != (k | 0)) {
                        h = 0
                        n = 23
                        break
                    }
                }
                o = f[o >> 2] | 0
                if (!o) {
                    h = 0
                    n = 23
                    break
                }
            }
            if ((n | 0) == 23) return h | 0
            return 0
        }
        function $f(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0
            e = u
            u = (u + 16) | 0
            g = e
            if (!(ih(a, c, d) | 0)) {
                h = 0
                u = e
                return h | 0
            }
            if ((b[((f[(a + 8) >> 2] | 0) + 24) >> 0] | 0) != 3) {
                h = 0
                u = e
                return h | 0
            }
            i = f[(c + 48) >> 2] | 0
            c = dn(32) | 0
            f[g >> 2] = c
            f[(g + 8) >> 2] = -2147483616
            f[(g + 4) >> 2] = 17
            j = c
            k = 12932
            l = (j + 17) | 0
            do {
                b[j >> 0] = b[k >> 0] | 0
                j = (j + 1) | 0
                k = (k + 1) | 0
            } while ((j | 0) < (l | 0))
            b[(c + 17) >> 0] = 0
            c = (i + 16) | 0
            k = f[c >> 2] | 0
            if (k) {
                j = c
                l = k
                a: while (1) {
                    k = l
                    while (1) {
                        if ((f[(k + 16) >> 2] | 0) >= (d | 0)) break
                        m = f[(k + 4) >> 2] | 0
                        if (!m) {
                            n = j
                            break a
                        } else k = m
                    }
                    l = f[k >> 2] | 0
                    if (!l) {
                        n = k
                        break
                    } else j = k
                }
                if (((n | 0) != (c | 0) ? (f[(n + 16) >> 2] | 0) <= (d | 0) : 0) ? ((d = (n + 20) | 0), (sh(d, g) | 0) != 0) : 0) o = yk(d, g, -1) | 0
                else p = 12
            } else p = 12
            if ((p | 0) == 12) o = yk(i, g, -1) | 0
            if ((b[(g + 11) >> 0] | 0) < 0) br(f[g >> 2] | 0)
            if ((o | 0) < 1) {
                h = 0
                u = e
                return h | 0
            }
            tp((a + 40) | 0, o)
            h = 1
            u = e
            return h | 0
        }
        function ag(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0
            e = c
            g = (d - e) | 0
            h = (a + 8) | 0
            i = f[h >> 2] | 0
            j = f[a >> 2] | 0
            k = j
            if (g >>> 0 > ((i - j) | 0) >>> 0) {
                if (!j) l = i
                else {
                    i = (a + 4) | 0
                    if ((f[i >> 2] | 0) != (k | 0)) f[i >> 2] = k
                    br(k)
                    f[h >> 2] = 0
                    f[i >> 2] = 0
                    f[a >> 2] = 0
                    l = 0
                }
                if ((g | 0) < 0) mq(a)
                i = l << 1
                m = l >>> 0 < 1073741823 ? (i >>> 0 < g >>> 0 ? g : i) : 2147483647
                if ((m | 0) < 0) mq(a)
                i = dn(m) | 0
                l = (a + 4) | 0
                f[l >> 2] = i
                f[a >> 2] = i
                f[h >> 2] = i + m
                if ((c | 0) == (d | 0)) return
                else {
                    n = c
                    o = i
                }
                do {
                    b[o >> 0] = b[n >> 0] | 0
                    n = (n + 1) | 0
                    o = ((f[l >> 2] | 0) + 1) | 0
                    f[l >> 2] = o
                } while ((n | 0) != (d | 0))
                return
            }
            n = (a + 4) | 0
            a = ((f[n >> 2] | 0) - j) | 0
            j = g >>> 0 > a >>> 0
            g = (c + a) | 0
            a = j ? g : d
            if ((a | 0) == (c | 0)) p = k
            else {
                o = c
                c = k
                while (1) {
                    b[c >> 0] = b[o >> 0] | 0
                    o = (o + 1) | 0
                    if ((o | 0) == (a | 0)) break
                    else c = (c + 1) | 0
                }
                p = (k + (a - e)) | 0
            }
            if (!j) {
                if ((f[n >> 2] | 0) == (p | 0)) return
                f[n >> 2] = p
                return
            }
            if ((a | 0) == (d | 0)) return
            a = g
            g = f[n >> 2] | 0
            do {
                b[g >> 0] = b[a >> 0] | 0
                a = (a + 1) | 0
                g = ((f[n >> 2] | 0) + 1) | 0
                f[n >> 2] = g
            } while ((a | 0) != (d | 0))
            return
        }
        function bg(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            d = ((c >>> 1) & 1431655765) | ((c << 1) & -1431655766)
            c = ((d >>> 2) & 858993459) | ((d << 2) & -858993460)
            d = ((c >>> 4) & 252645135) | ((c << 4) & -252645136)
            c = ((d >>> 8) & 16711935) | ((d << 8) & -16711936)
            d = (32 - b) | 0
            e = ((c >>> 16) | (c << 16)) >>> d
            c = (e - ((e >>> 1) & 1431655765)) | 0
            g = (((c >>> 2) & 858993459) + (c & 858993459)) | 0
            c = (X(((g >>> 4) + g) & 252645135, 16843009) | 0) >>> 24
            g = (b - c) | 0
            h = f[a >> 2] | 0
            i = h
            j = Tn(f[i >> 2] | 0, f[(i + 4) >> 2] | 0, g | 0, ((((g | 0) < 0) << 31) >> 31) | 0) | 0
            g = h
            f[g >> 2] = j
            f[(g + 4) >> 2] = I
            g = (h + 8) | 0
            h = g
            j = Tn(f[h >> 2] | 0, f[(h + 4) >> 2] | 0, c | 0, 0) | 0
            c = g
            f[c >> 2] = j
            f[(c + 4) >> 2] = I
            c = (a + 28) | 0
            j = f[c >> 2] | 0
            g = (32 - j) | 0
            h = (a + 24) | 0
            do
                if ((g | 0) >= (b | 0)) {
                    i = (-1 >>> d) << j
                    k = (f[h >> 2] & ~i) | (i & (e << j))
                    f[h >> 2] = k
                    i = (j + b) | 0
                    f[c >> 2] = i
                    if ((i | 0) != 32) return
                    i = (a + 16) | 0
                    l = f[i >> 2] | 0
                    if ((l | 0) == (f[(a + 20) >> 2] | 0)) {
                        Ci((a + 12) | 0, h)
                        m = 0
                        n = 0
                        break
                    } else {
                        f[l >> 2] = k
                        f[i >> 2] = l + 4
                        m = 0
                        n = 0
                        break
                    }
                } else {
                    l = (-1 >>> j) << j
                    i = (f[h >> 2] & ~l) | (l & (e << j))
                    f[h >> 2] = i
                    l = (a + 16) | 0
                    k = f[l >> 2] | 0
                    if ((k | 0) == (f[(a + 20) >> 2] | 0)) Ci((a + 12) | 0, h)
                    else {
                        f[k >> 2] = i
                        f[l >> 2] = k + 4
                    }
                    k = (b - g) | 0
                    m = k
                    n = (-1 >>> ((32 - k) | 0)) & (e >>> g)
                }
            while (0)
            f[h >> 2] = n
            f[c >> 2] = m
            return
        }
        function cg(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0
            e = c & 255
            g = (d | 0) != 0
            a: do
                if (g & (((a & 3) | 0) != 0)) {
                    h = c & 255
                    i = a
                    j = d
                    while (1) {
                        if ((b[i >> 0] | 0) == (h << 24) >> 24) {
                            k = i
                            l = j
                            m = 6
                            break a
                        }
                        n = (i + 1) | 0
                        o = (j + -1) | 0
                        p = (o | 0) != 0
                        if (p & (((n & 3) | 0) != 0)) {
                            i = n
                            j = o
                        } else {
                            q = n
                            r = o
                            s = p
                            m = 5
                            break
                        }
                    }
                } else {
                    q = a
                    r = d
                    s = g
                    m = 5
                }
            while (0)
            if ((m | 0) == 5)
                if (s) {
                    k = q
                    l = r
                    m = 6
                } else {
                    t = q
                    u = 0
                }
            b: do
                if ((m | 0) == 6) {
                    q = c & 255
                    if ((b[k >> 0] | 0) == (q << 24) >> 24) {
                        t = k
                        u = l
                    } else {
                        r = X(e, 16843009) | 0
                        c: do
                            if (l >>> 0 > 3) {
                                s = k
                                g = l
                                while (1) {
                                    d = f[s >> 2] ^ r
                                    if ((((d & -2139062144) ^ -2139062144) & (d + -16843009)) | 0) break
                                    d = (s + 4) | 0
                                    a = (g + -4) | 0
                                    if (a >>> 0 > 3) {
                                        s = d
                                        g = a
                                    } else {
                                        v = d
                                        w = a
                                        m = 11
                                        break c
                                    }
                                }
                                x = s
                                y = g
                            } else {
                                v = k
                                w = l
                                m = 11
                            }
                        while (0)
                        if ((m | 0) == 11)
                            if (!w) {
                                t = v
                                u = 0
                                break
                            } else {
                                x = v
                                y = w
                            }
                        while (1) {
                            if ((b[x >> 0] | 0) == (q << 24) >> 24) {
                                t = x
                                u = y
                                break b
                            }
                            r = (x + 1) | 0
                            y = (y + -1) | 0
                            if (!y) {
                                t = r
                                u = 0
                                break
                            } else x = r
                        }
                    }
                }
            while (0)
            return (u | 0 ? t : 0) | 0
        }
        function dg(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                u = 0,
                v = 0
            c = (a + 4) | 0
            d = f[c >> 2] | 0
            e = f[a >> 2] | 0
            g = e
            do
                if ((d | 0) == (e | 0)) {
                    h = (a + 8) | 0
                    i = f[h >> 2] | 0
                    j = (a + 12) | 0
                    k = f[j >> 2] | 0
                    l = k
                    if (i >>> 0 < k >>> 0) {
                        k = i
                        m = (((((l - k) >> 2) + 1) | 0) / 2) | 0
                        n = (i + (m << 2)) | 0
                        o = (k - d) | 0
                        k = o >> 2
                        p = (n + ((0 - k) << 2)) | 0
                        if (!k) {
                            q = n
                            r = i
                        } else {
                            Xl(p | 0, d | 0, o | 0) | 0
                            q = p
                            r = f[h >> 2] | 0
                        }
                        f[c >> 2] = q
                        f[h >> 2] = r + (m << 2)
                        s = q
                        break
                    }
                    m = (l - g) >> 1
                    l = (m | 0) == 0 ? 1 : m
                    if (l >>> 0 > 1073741823) {
                        m = ra(8) | 0
                        Wo(m, 14941)
                        f[m >> 2] = 6944
                        va(m | 0, 1080, 114)
                    }
                    m = dn(l << 2) | 0
                    p = m
                    o = (m + ((((l + 3) | 0) >>> 2) << 2)) | 0
                    n = o
                    k = (m + (l << 2)) | 0
                    if ((d | 0) == (i | 0)) {
                        t = n
                        u = d
                    } else {
                        l = o
                        m = n
                        v = d
                        do {
                            f[l >> 2] = f[v >> 2]
                            l = (m + 4) | 0
                            m = l
                            v = (v + 4) | 0
                        } while ((v | 0) != (i | 0))
                        t = m
                        u = f[a >> 2] | 0
                    }
                    f[a >> 2] = p
                    f[c >> 2] = n
                    f[h >> 2] = t
                    f[j >> 2] = k
                    if (!u) s = o
                    else {
                        br(u)
                        s = f[c >> 2] | 0
                    }
                } else s = d
            while (0)
            f[(s + -4) >> 2] = f[b >> 2]
            f[c >> 2] = (f[c >> 2] | 0) + -4
            return
        }
        function eg(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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
            d = u
            u = (u + 16) | 0
            e = (d + 4) | 0
            g = d
            h = (d + 8) | 0
            i = (a + 4) | 0
            if ((f[i >> 2] | 0) == -1) {
                j = 0
                u = d
                return j | 0
            }
            k = f[(a + 8) >> 2] | 0
            l = (c + 16) | 0
            m = l
            n = f[m >> 2] | 0
            o = f[(m + 4) >> 2] | 0
            if (!(((o | 0) > 0) | (((o | 0) == 0) & (n >>> 0 > 0)))) {
                m = ((f[(a + 12) >> 2] | 0) - k) | 0
                p = (c + 4) | 0
                f[g >> 2] = f[p >> 2]
                f[e >> 2] = f[g >> 2]
                ye(c, e, k, (k + m) | 0) | 0
                m = l
                k = f[m >> 2] | 0
                q = f[(m + 4) >> 2] | 0
                m = (a + 20) | 0
                if (((q | 0) > 0) | (((q | 0) == 0) & (k >>> 0 > 0))) {
                    r = q
                    s = k
                    t = g
                } else {
                    f[g >> 2] = f[p >> 2]
                    f[e >> 2] = f[g >> 2]
                    ye(c, e, m, (m + 4) | 0) | 0
                    m = l
                    r = f[(m + 4) >> 2] | 0
                    s = f[m >> 2] | 0
                    t = g
                }
            } else {
                r = o
                s = n
                t = g
            }
            b[h >> 0] = f[i >> 2]
            if (!(((r | 0) > 0) | (((r | 0) == 0) & (s >>> 0 > 0)))) {
                f[g >> 2] = f[(c + 4) >> 2]
                f[e >> 2] = f[g >> 2]
                ye(c, e, h, (h + 1) | 0) | 0
            }
            j = 1
            u = d
            return j | 0
        }
        function fg(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0
            e = u
            u = (u + 16) | 0
            g = (e + 4) | 0
            h = e
            i = (a + 8) | 0
            a = f[i >> 2] | 0
            j = f[(a + 40) >> 2] | 0
            k = _q((j | 0) > -1 ? j : -1) | 0
            l = (c + 4) | 0
            m = f[l >> 2] | 0
            n = f[c >> 2] | 0
            if ((m | 0) == (n | 0)) {
                $q(k)
                u = e
                return 1
            }
            o = (d + 16) | 0
            p = (d + 4) | 0
            q = (k + j) | 0
            j = 0
            r = n
            n = a
            s = a
            a = m
            while (1) {
                m = f[(r + (j << 2)) >> 2] | 0
                if (!(b[(n + 84) >> 0] | 0)) t = f[((f[(n + 68) >> 2] | 0) + (m << 2)) >> 2] | 0
                else t = m
                m = (s + 48) | 0
                v = f[m >> 2] | 0
                w = f[(m + 4) >> 2] | 0
                m = (s + 40) | 0
                x = f[m >> 2] | 0
                y = on(x | 0, f[(m + 4) >> 2] | 0, t | 0, 0) | 0
                m = Tn(y | 0, I | 0, v | 0, w | 0) | 0
                Rg(k | 0, ((f[f[s >> 2] >> 2] | 0) + m) | 0, x | 0) | 0
                x = o
                m = f[(x + 4) >> 2] | 0
                if (((m | 0) > 0) | (((m | 0) == 0) & ((f[x >> 2] | 0) >>> 0 > 0))) {
                    z = r
                    A = a
                } else {
                    f[h >> 2] = f[p >> 2]
                    f[g >> 2] = f[h >> 2]
                    ye(d, g, k, q) | 0
                    z = f[c >> 2] | 0
                    A = f[l >> 2] | 0
                }
                x = (j + 1) | 0
                if (x >>> 0 >= ((A - z) >> 2) >>> 0) break
                m = f[i >> 2] | 0
                j = x
                r = z
                n = m
                s = m
                a = A
            }
            $q(k)
            u = e
            return 1
        }
        function gg(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0
            d = ((f[b >> 2] | 0) * 3) | 0
            if ((d | 0) == -1) {
                e = 0
                g = -1
                f[c >> 2] = g
                return e | 0
            }
            b = f[(a + 12) >> 2] | 0
            h = f[(b + 12) >> 2] | 0
            if ((f[(h + (d << 2)) >> 2] | 0) == -1) {
                e = 0
                g = d
                f[c >> 2] = g
                return e | 0
            }
            i = f[b >> 2] | 0
            b = f[(a + 152) >> 2] | 0
            if ((f[(b + (f[(i + (d << 2)) >> 2] << 2)) >> 2] | 0) == -1) {
                a = (d + 1) | 0
                j = ((a >>> 0) % 3 | 0 | 0) == 0 ? (d + -2) | 0 : a
                if ((j | 0) == -1) {
                    e = 0
                    g = -1
                    f[c >> 2] = g
                    return e | 0
                }
                if ((f[(h + (j << 2)) >> 2] | 0) == -1) {
                    e = 0
                    g = j
                    f[c >> 2] = g
                    return e | 0
                }
                if ((f[(b + (f[(i + (j << 2)) >> 2] << 2)) >> 2] | 0) == -1) {
                    a = (j + 1) | 0
                    k = ((a >>> 0) % 3 | 0 | 0) == 0 ? (j + -2) | 0 : a
                    if ((k | 0) == -1) {
                        e = 0
                        g = -1
                        f[c >> 2] = g
                        return e | 0
                    }
                    if ((f[(h + (k << 2)) >> 2] | 0) == -1) {
                        e = 0
                        g = k
                        f[c >> 2] = g
                        return e | 0
                    }
                    if ((f[(b + (f[(i + (k << 2)) >> 2] << 2)) >> 2] | 0) == -1) {
                        i = (k + 1) | 0
                        e = 1
                        g = ((i >>> 0) % 3 | 0 | 0) == 0 ? (k + -2) | 0 : i
                        f[c >> 2] = g
                        return e | 0
                    } else l = k
                } else l = j
            } else l = d
            while (1) {
                d = ((((l >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + l) | 0
                if ((d | 0) == -1) break
                j = f[(h + (d << 2)) >> 2] | 0
                if ((j | 0) == -1) break
                d = (j + (((j >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1)) | 0
                if ((d | 0) == -1) break
                else l = d
            }
            e = 0
            g = ((((l >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + l) | 0
            f[c >> 2] = g
            return e | 0
        }
        function hg(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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
            e = (a + 4) | 0
            g = f[e >> 2] | 0
            if (!g) {
                f[c >> 2] = e
                h = e
                return h | 0
            }
            e = b[(d + 11) >> 0] | 0
            i = (e << 24) >> 24 < 0
            j = i ? f[(d + 4) >> 2] | 0 : e & 255
            e = i ? f[d >> 2] | 0 : d
            d = (a + 4) | 0
            a = g
            while (1) {
                g = (a + 16) | 0
                i = b[(g + 11) >> 0] | 0
                k = (i << 24) >> 24 < 0
                l = k ? f[(a + 20) >> 2] | 0 : i & 255
                i = l >>> 0 < j >>> 0
                m = i ? l : j
                if ((m | 0) != 0 ? ((n = Pk(e, k ? f[g >> 2] | 0 : g, m) | 0), (n | 0) != 0) : 0)
                    if ((n | 0) < 0) o = 8
                    else o = 10
                else if (j >>> 0 < l >>> 0) o = 8
                else o = 10
                if ((o | 0) == 8) {
                    o = 0
                    n = f[a >> 2] | 0
                    if (!n) {
                        o = 9
                        break
                    } else {
                        p = a
                        q = n
                    }
                } else if ((o | 0) == 10) {
                    o = 0
                    n = j >>> 0 < l >>> 0 ? j : l
                    if ((n | 0) != 0 ? ((l = Pk(k ? f[g >> 2] | 0 : g, e, n) | 0), (l | 0) != 0) : 0) {
                        if ((l | 0) >= 0) {
                            o = 16
                            break
                        }
                    } else o = 12
                    if ((o | 0) == 12 ? ((o = 0), !i) : 0) {
                        o = 16
                        break
                    }
                    r = (a + 4) | 0
                    i = f[r >> 2] | 0
                    if (!i) {
                        o = 15
                        break
                    } else {
                        p = r
                        q = i
                    }
                }
                d = p
                a = q
            }
            if ((o | 0) == 9) {
                f[c >> 2] = a
                h = a
                return h | 0
            } else if ((o | 0) == 15) {
                f[c >> 2] = a
                h = r
                return h | 0
            } else if ((o | 0) == 16) {
                f[c >> 2] = a
                h = d
                return h | 0
            }
            return 0
        }
        function ig(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0
            d = u
            u = (u + 32) | 0
            e = (d + 24) | 0
            g = (d + 16) | 0
            h = (d + 8) | 0
            i = d
            j = (a + 4) | 0
            k = f[j >> 2] | 0
            l = f[b >> 2] | 0
            m = f[(b + 4) >> 2] | 0
            b = f[c >> 2] | 0
            n = f[(c + 4) >> 2] | 0
            c = (b - l) << 3
            f[j >> 2] = k - m + n + c
            j = ((f[a >> 2] | 0) + ((k >>> 5) << 2)) | 0
            a = k & 31
            k = j
            if ((m | 0) != (a | 0)) {
                f[e >> 2] = l
                f[(e + 4) >> 2] = m
                f[g >> 2] = b
                f[(g + 4) >> 2] = n
                f[h >> 2] = k
                f[(h + 4) >> 2] = a
                ke(i, e, g, h)
                u = d
                return
            }
            h = (n - m + c) | 0
            c = l
            if ((h | 0) > 0) {
                if (!m) {
                    o = h
                    p = j
                    q = 0
                    r = l
                    s = c
                } else {
                    l = (32 - m) | 0
                    n = (h | 0) < (l | 0) ? h : l
                    g = (-1 >>> ((l - n) | 0)) & (-1 << m)
                    f[j >> 2] = (f[j >> 2] & ~g) | (f[c >> 2] & g)
                    g = (n + m) | 0
                    l = (c + 4) | 0
                    o = (h - n) | 0
                    p = (j + ((g >>> 5) << 2)) | 0
                    q = g & 31
                    r = l
                    s = l
                }
                l = ((o | 0) / 32) | 0
                Xl(p | 0, r | 0, (l << 2) | 0) | 0
                r = (o - (l << 5)) | 0
                o = (p + (l << 2)) | 0
                p = o
                if ((r | 0) > 0) {
                    g = -1 >>> ((32 - r) | 0)
                    f[o >> 2] = (f[o >> 2] & ~g) | (f[(s + (l << 2)) >> 2] & g)
                    t = r
                    v = p
                } else {
                    t = q
                    v = p
                }
            } else {
                t = m
                v = k
            }
            f[i >> 2] = v
            f[(i + 4) >> 2] = t
            u = d
            return
        }
        function jg(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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
            g = u
            u = (u + 16) | 0
            h = g
            i = (c + 4) | 0
            f[h >> 2] = 0
            f[(h + 4) >> 2] = 0
            f[(h + 8) >> 2] = 0
            j = dn(16) | 0
            f[h >> 2] = j
            f[(h + 8) >> 2] = -2147483632
            f[(h + 4) >> 2] = 15
            k = j
            l = 12916
            m = (k + 15) | 0
            do {
                b[k >> 0] = b[l >> 0] | 0
                k = (k + 1) | 0
                l = (l + 1) | 0
            } while ((k | 0) < (m | 0))
            b[(j + 15) >> 0] = 0
            j = yk(i, h, -1) | 0
            if ((b[(h + 11) >> 0] | 0) < 0) br(f[h >> 2] | 0)
            switch (j | 0) {
                case -1: {
                    if ((Yh(i) | 0) == 10) n = 6
                    else n = 5
                    break
                }
                case 1: {
                    n = 5
                    break
                }
                default:
                    n = 6
            }
            if ((n | 0) == 5) {
                j = dn(68) | 0
                Xo(j)
                o = j
            } else if ((n | 0) == 6) {
                n = dn(64) | 0
                Gp(n)
                o = n
            }
            vo(o, d)
            Ad(a, o, i, e)
            if (f[a >> 2] | 0) {
                p = f[o >> 2] | 0
                q = (p + 4) | 0
                r = f[q >> 2] | 0
                Va[r & 127](o)
                u = g
                return
            }
            e = (a + 4) | 0
            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
            f[(c + 40) >> 2] = f[(o + 52) >> 2]
            f[(c + 44) >> 2] = f[(o + 60) >> 2]
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            f[(a + 12) >> 2] = 0
            p = f[o >> 2] | 0
            q = (p + 4) | 0
            r = f[q >> 2] | 0
            Va[r & 127](o)
            u = g
            return
        }
        function kg(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                u = 0
            c = (a + 8) | 0
            d = f[c >> 2] | 0
            e = (a + 12) | 0
            g = f[e >> 2] | 0
            h = g
            do
                if ((d | 0) == (g | 0)) {
                    i = (a + 4) | 0
                    j = f[i >> 2] | 0
                    k = f[a >> 2] | 0
                    l = k
                    if (j >>> 0 > k >>> 0) {
                        m = j
                        n = (((((m - l) >> 2) + 1) | 0) / -2) | 0
                        o = (j + (n << 2)) | 0
                        p = (d - m) | 0
                        m = p >> 2
                        if (!m) q = j
                        else {
                            Xl(o | 0, j | 0, p | 0) | 0
                            q = f[i >> 2] | 0
                        }
                        p = (o + (m << 2)) | 0
                        f[c >> 2] = p
                        f[i >> 2] = q + (n << 2)
                        r = p
                        break
                    }
                    p = (h - l) >> 1
                    l = (p | 0) == 0 ? 1 : p
                    if (l >>> 0 > 1073741823) {
                        p = ra(8) | 0
                        Wo(p, 14941)
                        f[p >> 2] = 6944
                        va(p | 0, 1080, 114)
                    }
                    p = dn(l << 2) | 0
                    n = p
                    m = (p + ((l >>> 2) << 2)) | 0
                    o = m
                    s = (p + (l << 2)) | 0
                    if ((j | 0) == (d | 0)) {
                        t = o
                        u = k
                    } else {
                        k = m
                        m = o
                        l = j
                        do {
                            f[k >> 2] = f[l >> 2]
                            k = (m + 4) | 0
                            m = k
                            l = (l + 4) | 0
                        } while ((l | 0) != (d | 0))
                        t = m
                        u = f[a >> 2] | 0
                    }
                    f[a >> 2] = n
                    f[i >> 2] = o
                    f[c >> 2] = t
                    f[e >> 2] = s
                    if (!u) r = t
                    else {
                        br(u)
                        r = f[c >> 2] | 0
                    }
                } else r = d
            while (0)
            f[r >> 2] = f[b >> 2]
            f[c >> 2] = (f[c >> 2] | 0) + 4
            return
        }
        function lg(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            b = u
            u = (u + 16) | 0
            c = (b + 4) | 0
            d = b
            e = (a + 8) | 0
            g = (a + 12) | 0
            h = f[g >> 2] | 0
            $j(f[(a + 4) >> 2] | 0, ((f[(h + 56) >> 2] | 0) - (f[(h + 52) >> 2] | 0)) >> 2)
            h = (a + 76) | 0
            a = f[h >> 2] | 0
            if (!a) {
                i = f[((f[g >> 2] | 0) + 64) >> 2] | 0
                g = ((f[(i + 4) >> 2] | 0) - (f[i >> 2] | 0)) >> 2
                i = ((g >>> 0) / 3) | 0
                if (g >>> 0 <= 2) {
                    j = 1
                    u = b
                    return j | 0
                }
                g = 0
                while (1) {
                    f[d >> 2] = g * 3
                    f[c >> 2] = f[d >> 2]
                    g = (g + 1) | 0
                    if (!(Tb(e, c) | 0)) {
                        j = 0
                        k = 10
                        break
                    }
                    if ((g | 0) >= (i | 0)) {
                        j = 1
                        k = 10
                        break
                    }
                }
                if ((k | 0) == 10) {
                    u = b
                    return j | 0
                }
            } else {
                i = f[a >> 2] | 0
                if ((f[(a + 4) >> 2] | 0) == (i | 0)) {
                    j = 1
                    u = b
                    return j | 0
                }
                a = 0
                g = i
                while (1) {
                    f[d >> 2] = f[(g + (a << 2)) >> 2]
                    f[c >> 2] = f[d >> 2]
                    a = (a + 1) | 0
                    if (!(Tb(e, c) | 0)) {
                        j = 0
                        k = 10
                        break
                    }
                    i = f[h >> 2] | 0
                    g = f[i >> 2] | 0
                    if (a >>> 0 >= (((f[(i + 4) >> 2] | 0) - g) >> 2) >>> 0) {
                        j = 1
                        k = 10
                        break
                    }
                }
                if ((k | 0) == 10) {
                    u = b
                    return j | 0
                }
            }
            return 0
        }
        function mg(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0
            c = u
            u = (u + 16) | 0
            d = (c + 8) | 0
            e = (c + 4) | 0
            g = c
            h = (a + 12) | 0
            i = (a + 4) | 0
            j = f[i >> 2] | 0
            if ((j | 0) == (f[(a + 8) >> 2] | 0)) {
                Ci(a, h)
                k = f[i >> 2] | 0
            } else {
                f[j >> 2] = f[h >> 2]
                l = (j + 4) | 0
                f[i >> 2] = l
                k = l
            }
            l = f[a >> 2] | 0
            f[g >> 2] = k - l
            k = (b + 16) | 0
            j = k
            m = f[(j + 4) >> 2] | 0
            if (!(((m | 0) > 0) | (((m | 0) == 0) & ((f[j >> 2] | 0) >>> 0 > 0)))) {
                f[e >> 2] = f[(b + 4) >> 2]
                f[d >> 2] = f[e >> 2]
                ye(b, d, g, (g + 4) | 0) | 0
                j = f[a >> 2] | 0
                m = f[g >> 2] | 0
                g = k
                k = f[(g + 4) >> 2] | 0
                if (((k | 0) > 0) | (((k | 0) == 0) & ((f[g >> 2] | 0) >>> 0 > 0))) {
                    n = j
                    o = e
                } else {
                    f[e >> 2] = f[(b + 4) >> 2]
                    f[d >> 2] = f[e >> 2]
                    ye(b, d, j, (j + m) | 0) | 0
                    n = f[a >> 2] | 0
                    o = e
                }
            } else {
                n = l
                o = e
            }
            e = f[i >> 2] | 0
            if ((e | 0) == (n | 0)) {
                f[h >> 2] = 0
                p = (a + 16) | 0
                f[p >> 2] = 0
                u = c
                return
            }
            f[i >> 2] = e + (~(((e + -4 - n) | 0) >>> 2) << 2)
            f[h >> 2] = 0
            p = (a + 16) | 0
            f[p >> 2] = 0
            u = c
            return
        }
        function ng(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0
            c = (a + 8) | 0
            d = f[c >> 2] | 0
            e = (a + 4) | 0
            g = f[e >> 2] | 0
            h = g
            if (((d - g) >> 2) >>> 0 >= b >>> 0) {
                hj(g | 0, 0, (b << 2) | 0) | 0
                f[e >> 2] = g + (b << 2)
                return
            }
            i = f[a >> 2] | 0
            j = (g - i) >> 2
            g = (j + b) | 0
            k = i
            if (g >>> 0 > 1073741823) mq(a)
            l = (d - i) | 0
            d = l >> 1
            m = (l >> 2) >>> 0 < 536870911 ? (d >>> 0 < g >>> 0 ? g : d) : 1073741823
            do
                if (m)
                    if (m >>> 0 > 1073741823) {
                        d = ra(8) | 0
                        Wo(d, 14941)
                        f[d >> 2] = 6944
                        va(d | 0, 1080, 114)
                    } else {
                        n = dn(m << 2) | 0
                        break
                    }
                else n = 0
            while (0)
            d = (n + (j << 2)) | 0
            hj(d | 0, 0, (b << 2) | 0) | 0
            b = d
            j = (n + (m << 2)) | 0
            m = (n + (g << 2)) | 0
            if ((h | 0) == (k | 0)) {
                o = b
                p = i
                q = h
            } else {
                i = h
                h = b
                b = d
                do {
                    i = (i + -4) | 0
                    d = f[i >> 2] | 0
                    f[i >> 2] = 0
                    f[(b + -4) >> 2] = d
                    b = (h + -4) | 0
                    h = b
                } while ((i | 0) != (k | 0))
                o = h
                p = f[a >> 2] | 0
                q = f[e >> 2] | 0
            }
            f[a >> 2] = o
            f[e >> 2] = m
            f[c >> 2] = j
            j = p
            if ((q | 0) != (j | 0)) {
                c = q
                do {
                    c = (c + -4) | 0
                    q = f[c >> 2] | 0
                    f[c >> 2] = 0
                    if (q | 0) Va[f[((f[q >> 2] | 0) + 4) >> 2] & 127](q)
                } while ((c | 0) != (j | 0))
            }
            if (!p) return
            br(p)
            return
        }
        function og(a) {
            a = a | 0
            lk(a)
            lk((a + 32) | 0)
            lk((a + 64) | 0)
            lk((a + 96) | 0)
            lk((a + 128) | 0)
            lk((a + 160) | 0)
            lk((a + 192) | 0)
            lk((a + 224) | 0)
            lk((a + 256) | 0)
            lk((a + 288) | 0)
            lk((a + 320) | 0)
            lk((a + 352) | 0)
            lk((a + 384) | 0)
            lk((a + 416) | 0)
            lk((a + 448) | 0)
            lk((a + 480) | 0)
            lk((a + 512) | 0)
            lk((a + 544) | 0)
            lk((a + 576) | 0)
            lk((a + 608) | 0)
            lk((a + 640) | 0)
            lk((a + 672) | 0)
            lk((a + 704) | 0)
            lk((a + 736) | 0)
            lk((a + 768) | 0)
            lk((a + 800) | 0)
            lk((a + 832) | 0)
            lk((a + 864) | 0)
            lk((a + 896) | 0)
            lk((a + 928) | 0)
            lk((a + 960) | 0)
            lk((a + 992) | 0)
            lk((a + 1024) | 0)
            return
        }
        function pg(a, c, d, e, g, h) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            h = $(h)
            var i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            i = u
            u = (u + 16) | 0
            j = i
            k = (i + 4) | 0
            f[j >> 2] = c
            c = (a + 4) | 0
            a = dn(32) | 0
            f[k >> 2] = a
            f[(k + 8) >> 2] = -2147483616
            f[(k + 4) >> 2] = 17
            l = a
            m = 12932
            n = (l + 17) | 0
            do {
                b[l >> 0] = b[m >> 0] | 0
                l = (l + 1) | 0
                m = (m + 1) | 0
            } while ((l | 0) < (n | 0))
            b[(a + 17) >> 0] = 0
            Nj(wd(c, j) | 0, k, d)
            if ((b[(k + 11) >> 0] | 0) < 0) br(f[k >> 2] | 0)
            d = dn(32) | 0
            f[k >> 2] = d
            f[(k + 8) >> 2] = -2147483616
            f[(k + 4) >> 2] = 19
            l = d
            m = 13005
            n = (l + 19) | 0
            do {
                b[l >> 0] = b[m >> 0] | 0
                l = (l + 1) | 0
                m = (m + 1) | 0
            } while ((l | 0) < (n | 0))
            b[(d + 19) >> 0] = 0
            ci(wd(c, j) | 0, k, g, e)
            if ((b[(k + 11) >> 0] | 0) < 0) br(f[k >> 2] | 0)
            e = dn(32) | 0
            f[k >> 2] = e
            f[(k + 8) >> 2] = -2147483616
            f[(k + 4) >> 2] = 18
            l = e
            m = 13025
            n = (l + 18) | 0
            do {
                b[l >> 0] = b[m >> 0] | 0
                l = (l + 1) | 0
                m = (m + 1) | 0
            } while ((l | 0) < (n | 0))
            b[(e + 18) >> 0] = 0
            Lj(wd(c, j) | 0, k, h)
            if ((b[(k + 11) >> 0] | 0) >= 0) {
                u = i
                return
            }
            br(f[k >> 2] | 0)
            u = i
            return
        }
        function qg(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0
            d = c
            e = b
            g = (d - e) | 0
            h = g >> 2
            i = (a + 8) | 0
            j = f[i >> 2] | 0
            k = f[a >> 2] | 0
            l = k
            if (h >>> 0 <= ((j - k) >> 2) >>> 0) {
                m = (a + 4) | 0
                n = ((f[m >> 2] | 0) - k) >> 2
                o = h >>> 0 > n >>> 0
                p = o ? (b + (n << 2)) | 0 : c
                c = p
                n = (c - e) | 0
                e = n >> 2
                if (e | 0) Xl(k | 0, b | 0, n | 0) | 0
                n = (l + (e << 2)) | 0
                if (o) {
                    o = (d - c) | 0
                    if ((o | 0) <= 0) return
                    Rg(f[m >> 2] | 0, p | 0, o | 0) | 0
                    f[m >> 2] = (f[m >> 2] | 0) + ((o >>> 2) << 2)
                    return
                } else {
                    o = f[m >> 2] | 0
                    if ((o | 0) == (n | 0)) return
                    f[m >> 2] = o + (~(((o + -4 - n) | 0) >>> 2) << 2)
                    return
                }
            }
            n = k
            if (!k) q = j
            else {
                j = (a + 4) | 0
                o = f[j >> 2] | 0
                if ((o | 0) != (l | 0)) f[j >> 2] = o + (~(((o + -4 - k) | 0) >>> 2) << 2)
                br(n)
                f[i >> 2] = 0
                f[j >> 2] = 0
                f[a >> 2] = 0
                q = 0
            }
            if (h >>> 0 > 1073741823) mq(a)
            j = q >> 1
            n = (q >> 2) >>> 0 < 536870911 ? (j >>> 0 < h >>> 0 ? h : j) : 1073741823
            if (n >>> 0 > 1073741823) mq(a)
            j = dn(n << 2) | 0
            h = (a + 4) | 0
            f[h >> 2] = j
            f[a >> 2] = j
            f[i >> 2] = j + (n << 2)
            if ((g | 0) <= 0) return
            Rg(j | 0, b | 0, g | 0) | 0
            f[h >> 2] = j + ((g >>> 2) << 2)
            return
        }
        function rg(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0.0,
                p = 0,
                q = 0.0,
                r = 0.0,
                s = 0.0,
                t = 0,
                v = 0.0
            e = u
            u = (u + 16) | 0
            g = e
            h = (c + 1) | 0
            f[g >> 2] = 0
            i = (g + 4) | 0
            f[i >> 2] = 0
            f[(g + 8) >> 2] = 0
            do
                if (h)
                    if (h >>> 0 > 1073741823) mq(g)
                    else {
                        j = dn(h << 2) | 0
                        f[g >> 2] = j
                        k = (j + (h << 2)) | 0
                        f[(g + 8) >> 2] = k
                        hj(j | 0, 0, ((c << 2) + 4) | 0) | 0
                        f[i >> 2] = k
                        l = j
                        m = k
                        n = j
                        break
                    }
                else {
                    l = 0
                    m = 0
                    n = 0
                }
            while (0)
            if ((b | 0) > 0) {
                g = 0
                do {
                    j = (l + (f[(a + (g << 2)) >> 2] << 2)) | 0
                    f[j >> 2] = (f[j >> 2] | 0) + 1
                    g = (g + 1) | 0
                } while ((g | 0) != (b | 0))
            }
            o = +(b | 0)
            if ((c | 0) < 0) {
                p = 0
                q = 0.0
            } else {
                c = 0
                r = 0.0
                b = 0
                while (1) {
                    g = f[(l + (b << 2)) >> 2] | 0
                    s = +(g | 0)
                    if ((g | 0) > 0) {
                        t = (c + 1) | 0
                        v = r + +Fg(s / o) * s
                    } else {
                        t = c
                        v = r
                    }
                    b = (b + 1) | 0
                    if ((b | 0) == (h | 0)) {
                        p = t
                        q = v
                        break
                    } else {
                        c = t
                        r = v
                    }
                }
            }
            if (d | 0) f[d >> 2] = p
            v = -q
            p = ~~v >>> 0
            d = +K(v) >= 1.0 ? (v > 0.0 ? ~~+Y(+J(v / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((v - +(~~v >>> 0)) / 4294967296.0) >>> 0) : 0
            if (!l) {
                I = d
                u = e
                return p | 0
            }
            if ((m | 0) != (l | 0)) f[i >> 2] = m + (~(((m + -4 - l) | 0) >>> 2) << 2)
            br(n)
            I = d
            u = e
            return p | 0
        }
        function sg(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            b = u
            u = (u + 16) | 0
            c = (b + 4) | 0
            d = b
            e = (a + 8) | 0
            g = (a + 12) | 0
            h = f[g >> 2] | 0
            $j(f[(a + 4) >> 2] | 0, ((f[(h + 28) >> 2] | 0) - (f[(h + 24) >> 2] | 0)) >> 2)
            h = (a + 76) | 0
            a = f[h >> 2] | 0
            if (!a) {
                i = f[g >> 2] | 0
                g = ((f[(i + 4) >> 2] | 0) - (f[i >> 2] | 0)) >> 2
                i = ((g >>> 0) / 3) | 0
                if (g >>> 0 <= 2) {
                    j = 1
                    u = b
                    return j | 0
                }
                g = 0
                while (1) {
                    f[d >> 2] = g * 3
                    f[c >> 2] = f[d >> 2]
                    g = (g + 1) | 0
                    if (!(Wb(e, c) | 0)) {
                        j = 0
                        k = 10
                        break
                    }
                    if ((g | 0) >= (i | 0)) {
                        j = 1
                        k = 10
                        break
                    }
                }
                if ((k | 0) == 10) {
                    u = b
                    return j | 0
                }
            } else {
                i = f[a >> 2] | 0
                if ((f[(a + 4) >> 2] | 0) == (i | 0)) {
                    j = 1
                    u = b
                    return j | 0
                }
                a = 0
                g = i
                while (1) {
                    f[d >> 2] = f[(g + (a << 2)) >> 2]
                    f[c >> 2] = f[d >> 2]
                    a = (a + 1) | 0
                    if (!(Wb(e, c) | 0)) {
                        j = 0
                        k = 10
                        break
                    }
                    i = f[h >> 2] | 0
                    g = f[i >> 2] | 0
                    if (a >>> 0 >= (((f[(i + 4) >> 2] | 0) - g) >> 2) >>> 0) {
                        j = 1
                        k = 10
                        break
                    }
                }
                if ((k | 0) == 10) {
                    u = b
                    return j | 0
                }
            }
            return 0
        }
        function tg(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            e = u
            u = (u + 16) | 0
            g = (e + 4) | 0
            h = e
            i = dn(32) | 0
            f[a >> 2] = i
            f[(a + 4) >> 2] = c + 4
            c = (a + 8) | 0
            b[c >> 0] = 0
            f[(i + 16) >> 2] = f[d >> 2]
            a = (i + 20) | 0
            f[(i + 24) >> 2] = 0
            f[(i + 28) >> 2] = 0
            j = (i + 24) | 0
            f[a >> 2] = j
            i = f[(d + 4) >> 2] | 0
            k = (d + 8) | 0
            if ((i | 0) == (k | 0)) {
                b[c >> 0] = 1
                u = e
                return
            }
            d = j
            j = i
            while (1) {
                i = (j + 16) | 0
                f[h >> 2] = d
                f[g >> 2] = f[h >> 2]
                Wg(a, g, i, i) | 0
                i = f[(j + 4) >> 2] | 0
                if (!i) {
                    l = (j + 8) | 0
                    m = f[l >> 2] | 0
                    if ((f[m >> 2] | 0) == (j | 0)) n = m
                    else {
                        m = l
                        do {
                            l = f[m >> 2] | 0
                            m = (l + 8) | 0
                            o = f[m >> 2] | 0
                        } while ((f[o >> 2] | 0) != (l | 0))
                        n = o
                    }
                } else {
                    m = i
                    while (1) {
                        o = f[m >> 2] | 0
                        if (!o) break
                        else m = o
                    }
                    n = m
                }
                if ((n | 0) == (k | 0)) break
                else j = n
            }
            b[c >> 0] = 1
            u = e
            return
        }
        function ug(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            d = u
            u = (u + 16) | 0
            e = d
            f[e >> 2] = b
            g = (a + 8) | 0
            if (((((f[(a + 12) >> 2] | 0) - (f[g >> 2] | 0)) >> 2) | 0) <= (b | 0)) jh(g, (b + 1) | 0)
            h = f[((f[c >> 2] | 0) + 56) >> 2] | 0
            do
                if ((h | 0) < 5) {
                    i = (a + 20 + ((h * 12) | 0) + 4) | 0
                    j = f[i >> 2] | 0
                    if ((j | 0) == (f[(a + 20 + ((h * 12) | 0) + 8) >> 2] | 0)) {
                        Ci((a + 20 + ((h * 12) | 0)) | 0, e)
                        break
                    } else {
                        f[j >> 2] = b
                        f[i >> 2] = j + 4
                        break
                    }
                }
            while (0)
            b = f[c >> 2] | 0
            h = f[e >> 2] | 0
            f[(b + 60) >> 2] = h
            e = ((f[g >> 2] | 0) + (h << 2)) | 0
            f[c >> 2] = 0
            c = f[e >> 2] | 0
            f[e >> 2] = b
            if (!c) {
                u = d
                return
            }
            b = (c + 88) | 0
            e = f[b >> 2] | 0
            f[b >> 2] = 0
            if (e | 0) {
                b = f[(e + 8) >> 2] | 0
                if (b | 0) {
                    h = (e + 12) | 0
                    if ((f[h >> 2] | 0) != (b | 0)) f[h >> 2] = b
                    br(b)
                }
                br(e)
            }
            e = f[(c + 68) >> 2] | 0
            if (e | 0) {
                b = (c + 72) | 0
                h = f[b >> 2] | 0
                if ((h | 0) != (e | 0)) f[b >> 2] = h + (~(((h + -4 - e) | 0) >>> 2) << 2)
                br(e)
            }
            e = (c + 64) | 0
            h = f[e >> 2] | 0
            f[e >> 2] = 0
            if (h | 0) {
                e = f[h >> 2] | 0
                if (e | 0) {
                    b = (h + 4) | 0
                    if ((f[b >> 2] | 0) != (e | 0)) f[b >> 2] = e
                    br(e)
                }
                br(h)
            }
            br(c)
            u = d
            return
        }
        function vg(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0
            d = u
            u = (u + 48) | 0
            e = (d + 16) | 0
            g = d
            h = (d + 32) | 0
            i = (a + 28) | 0
            j = f[i >> 2] | 0
            f[h >> 2] = j
            k = (a + 20) | 0
            l = ((f[k >> 2] | 0) - j) | 0
            f[(h + 4) >> 2] = l
            f[(h + 8) >> 2] = b
            f[(h + 12) >> 2] = c
            b = (l + c) | 0
            l = (a + 60) | 0
            f[g >> 2] = f[l >> 2]
            f[(g + 4) >> 2] = h
            f[(g + 8) >> 2] = 2
            j = ro(Aa(146, g | 0) | 0) | 0
            a: do
                if ((b | 0) != (j | 0)) {
                    g = 2
                    m = b
                    n = h
                    o = j
                    while (1) {
                        if ((o | 0) < 0) break
                        m = (m - o) | 0
                        p = f[(n + 4) >> 2] | 0
                        q = o >>> 0 > p >>> 0
                        r = q ? (n + 8) | 0 : n
                        s = (g + ((q << 31) >> 31)) | 0
                        t = (o - (q ? p : 0)) | 0
                        f[r >> 2] = (f[r >> 2] | 0) + t
                        p = (r + 4) | 0
                        f[p >> 2] = (f[p >> 2] | 0) - t
                        f[e >> 2] = f[l >> 2]
                        f[(e + 4) >> 2] = r
                        f[(e + 8) >> 2] = s
                        o = ro(Aa(146, e | 0) | 0) | 0
                        if ((m | 0) == (o | 0)) {
                            v = 3
                            break a
                        } else {
                            g = s
                            n = r
                        }
                    }
                    f[(a + 16) >> 2] = 0
                    f[i >> 2] = 0
                    f[k >> 2] = 0
                    f[a >> 2] = f[a >> 2] | 32
                    if ((g | 0) == 2) w = 0
                    else w = (c - (f[(n + 4) >> 2] | 0)) | 0
                } else v = 3
            while (0)
            if ((v | 0) == 3) {
                v = f[(a + 44) >> 2] | 0
                f[(a + 16) >> 2] = v + (f[(a + 48) >> 2] | 0)
                a = v
                f[i >> 2] = a
                f[k >> 2] = a
                w = c
            }
            u = d
            return w | 0
        }
        function wg(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0
            f[a >> 2] = 5880
            b = f[(a + 68) >> 2] | 0
            if (b | 0) {
                c = (a + 72) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 56) >> 2] | 0
            if (b | 0) {
                d = (a + 60) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 44) >> 2] | 0
            if (b | 0) {
                c = (a + 48) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 32) >> 2] | 0
            if (b | 0) {
                d = (a + 36) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 20) >> 2] | 0
            if (b | 0) {
                c = (a + 24) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            Sh((a + 8) | 0)
            b = (a + 4) | 0
            a = f[b >> 2] | 0
            f[b >> 2] = 0
            if (!a) return
            b = (a + 40) | 0
            d = f[b >> 2] | 0
            if (d | 0) {
                c = (a + 44) | 0
                e = f[c >> 2] | 0
                if ((e | 0) == (d | 0)) g = d
                else {
                    h = e
                    do {
                        e = (h + -4) | 0
                        f[c >> 2] = e
                        i = f[e >> 2] | 0
                        f[e >> 2] = 0
                        if (i | 0) {
                            Qi(i)
                            br(i)
                        }
                        h = f[c >> 2] | 0
                    } while ((h | 0) != (d | 0))
                    g = f[b >> 2] | 0
                }
                br(g)
            }
            Qi(a)
            br(a)
            return
        }
        function xg(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0
            c = (a + 12) | 0
            d = f[a >> 2] | 0
            e = (a + 8) | 0
            g = f[e >> 2] | 0
            h = (g | 0) == -1
            if (!(b[c >> 0] | 0)) {
                do
                    if (
                        ((!h ? ((i = ((((g >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + g) | 0), (i | 0) != -1) : 0) ? ((f[((f[d >> 2] | 0) + ((i >>> 5) << 2)) >> 2] & (1 << (i & 31))) | 0) == 0 : 0)
                            ? ((j = f[((f[((f[(d + 64) >> 2] | 0) + 12) >> 2] | 0) + (i << 2)) >> 2] | 0), (j | 0) != -1)
                            : 0
                    )
                        if (!((j >>> 0) % 3 | 0)) {
                            k = (j + 2) | 0
                            break
                        } else {
                            k = (j + -1) | 0
                            break
                        }
                    else k = -1
                while (0)
                f[e >> 2] = k
                return
            }
            k = (g + 1) | 0
            if (
                ((!h ? ((h = ((k >>> 0) % 3 | 0 | 0) == 0 ? (g + -2) | 0 : k), (h | 0) != -1) : 0) ? ((f[((f[d >> 2] | 0) + ((h >>> 5) << 2)) >> 2] & (1 << (h & 31))) | 0) == 0 : 0)
                    ? ((k = f[((f[((f[(d + 64) >> 2] | 0) + 12) >> 2] | 0) + (h << 2)) >> 2] | 0), (h = (k + 1) | 0), (k | 0) != -1)
                    : 0
            ) {
                g = ((h >>> 0) % 3 | 0 | 0) == 0 ? (k + -2) | 0 : h
                f[e >> 2] = g
                if ((g | 0) != -1) {
                    if ((g | 0) != (f[(a + 4) >> 2] | 0)) return
                    f[e >> 2] = -1
                    return
                }
            } else f[e >> 2] = -1
            g = f[(a + 4) >> 2] | 0
            do
                if (
                    (((g | 0) != -1 ? ((a = ((((g >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + g) | 0), (a | 0) != -1) : 0) ? ((f[((f[d >> 2] | 0) + ((a >>> 5) << 2)) >> 2] & (1 << (a & 31))) | 0) == 0 : 0)
                        ? ((h = f[((f[((f[(d + 64) >> 2] | 0) + 12) >> 2] | 0) + (a << 2)) >> 2] | 0), (h | 0) != -1)
                        : 0
                )
                    if (!((h >>> 0) % 3 | 0)) {
                        l = (h + 2) | 0
                        break
                    } else {
                        l = (h + -1) | 0
                        break
                    }
                else l = -1
            while (0)
            f[e >> 2] = l
            b[c >> 0] = 0
            return
        }
        function yg(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            c = (a + 4) | 0
            d = f[a >> 2] | 0
            e = ((f[c >> 2] | 0) - d) >> 2
            g = (e + 1) | 0
            if (g >>> 0 > 1073741823) mq(a)
            h = (a + 8) | 0
            i = ((f[h >> 2] | 0) - d) | 0
            d = i >> 1
            j = (i >> 2) >>> 0 < 536870911 ? (d >>> 0 < g >>> 0 ? g : d) : 1073741823
            do
                if (j)
                    if (j >>> 0 > 1073741823) {
                        d = ra(8) | 0
                        Wo(d, 14941)
                        f[d >> 2] = 6944
                        va(d | 0, 1080, 114)
                    } else {
                        k = dn(j << 2) | 0
                        break
                    }
                else k = 0
            while (0)
            d = (k + (e << 2)) | 0
            e = d
            g = (k + (j << 2)) | 0
            j = f[b >> 2] | 0
            f[b >> 2] = 0
            f[d >> 2] = j
            j = (d + 4) | 0
            b = f[a >> 2] | 0
            k = f[c >> 2] | 0
            if ((k | 0) == (b | 0)) {
                l = e
                m = b
                n = b
            } else {
                i = k
                k = e
                e = d
                do {
                    i = (i + -4) | 0
                    d = f[i >> 2] | 0
                    f[i >> 2] = 0
                    f[(e + -4) >> 2] = d
                    e = (k + -4) | 0
                    k = e
                } while ((i | 0) != (b | 0))
                l = k
                m = f[a >> 2] | 0
                n = f[c >> 2] | 0
            }
            f[a >> 2] = l
            f[c >> 2] = j
            f[h >> 2] = g
            g = m
            if ((n | 0) != (g | 0)) {
                h = n
                do {
                    h = (h + -4) | 0
                    n = f[h >> 2] | 0
                    f[h >> 2] = 0
                    if (n | 0) Va[f[((f[n >> 2] | 0) + 4) >> 2] & 127](n)
                } while ((h | 0) != (g | 0))
            }
            if (!m) return
            br(m)
            return
        }
        function zg(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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
            d = (a + 4) | 0
            a = f[d >> 2] | 0
            do
                if (a | 0) {
                    e = b[(c + 11) >> 0] | 0
                    g = (e << 24) >> 24 < 0
                    h = g ? f[(c + 4) >> 2] | 0 : e & 255
                    e = g ? f[c >> 2] | 0 : c
                    g = d
                    i = a
                    a: while (1) {
                        j = i
                        while (1) {
                            k = (j + 16) | 0
                            l = b[(k + 11) >> 0] | 0
                            m = (l << 24) >> 24 < 0
                            n = m ? f[(j + 20) >> 2] | 0 : l & 255
                            l = h >>> 0 < n >>> 0 ? h : n
                            if ((l | 0) != 0 ? ((o = Pk(m ? f[k >> 2] | 0 : k, e, l) | 0), (o | 0) != 0) : 0) {
                                if ((o | 0) >= 0) break
                            } else p = 6
                            if ((p | 0) == 6 ? ((p = 0), n >>> 0 >= h >>> 0) : 0) break
                            n = f[(j + 4) >> 2] | 0
                            if (!n) {
                                q = g
                                break a
                            } else j = n
                        }
                        i = f[j >> 2] | 0
                        if (!i) {
                            q = j
                            break
                        } else g = j
                    }
                    if ((q | 0) != (d | 0)) {
                        g = (q + 16) | 0
                        i = b[(g + 11) >> 0] | 0
                        n = (i << 24) >> 24 < 0
                        o = n ? f[(q + 20) >> 2] | 0 : i & 255
                        i = o >>> 0 < h >>> 0 ? o : h
                        if (i | 0 ? ((l = Pk(e, n ? f[g >> 2] | 0 : g, i) | 0), l | 0) : 0) {
                            if ((l | 0) < 0) break
                            else r = q
                            return r | 0
                        }
                        if (h >>> 0 >= o >>> 0) {
                            r = q
                            return r | 0
                        }
                    }
                }
            while (0)
            r = d
            return r | 0
        }
        function Ag(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0
            d = (a + 8) | 0
            e = f[d >> 2] | 0
            g = (a + 4) | 0
            h = f[g >> 2] | 0
            if (((((e - h) | 0) / 12) | 0) >>> 0 >= b >>> 0) {
                i = b
                j = h
                do {
                    f[j >> 2] = f[c >> 2]
                    f[(j + 4) >> 2] = f[(c + 4) >> 2]
                    f[(j + 8) >> 2] = f[(c + 8) >> 2]
                    j = ((f[g >> 2] | 0) + 12) | 0
                    f[g >> 2] = j
                    i = (i + -1) | 0
                } while ((i | 0) != 0)
                return
            }
            i = f[a >> 2] | 0
            j = (((h - i) | 0) / 12) | 0
            h = (j + b) | 0
            if (h >>> 0 > 357913941) mq(a)
            k = (((e - i) | 0) / 12) | 0
            i = k << 1
            e = k >>> 0 < 178956970 ? (i >>> 0 < h >>> 0 ? h : i) : 357913941
            do
                if (e)
                    if (e >>> 0 > 357913941) {
                        i = ra(8) | 0
                        Wo(i, 14941)
                        f[i >> 2] = 6944
                        va(i | 0, 1080, 114)
                    } else {
                        l = dn((e * 12) | 0) | 0
                        break
                    }
                else l = 0
            while (0)
            i = (l + ((j * 12) | 0)) | 0
            j = (l + ((e * 12) | 0)) | 0
            e = b
            b = i
            l = i
            do {
                f[b >> 2] = f[c >> 2]
                f[(b + 4) >> 2] = f[(c + 4) >> 2]
                f[(b + 8) >> 2] = f[(c + 8) >> 2]
                b = (l + 12) | 0
                l = b
                e = (e + -1) | 0
            } while ((e | 0) != 0)
            e = f[a >> 2] | 0
            b = ((f[g >> 2] | 0) - e) | 0
            c = (i + (((((b | 0) / -12) | 0) * 12) | 0)) | 0
            if ((b | 0) > 0) Rg(c | 0, e | 0, b | 0) | 0
            f[a >> 2] = c
            f[g >> 2] = l
            f[d >> 2] = j
            if (!e) return
            br(e)
            return
        }
        function Bg(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            c = (a + 4) | 0
            d = f[a >> 2] | 0
            e = ((f[c >> 2] | 0) - d) >> 2
            g = (e + 1) | 0
            if (g >>> 0 > 1073741823) mq(a)
            h = (a + 8) | 0
            i = ((f[h >> 2] | 0) - d) | 0
            d = i >> 1
            j = (i >> 2) >>> 0 < 536870911 ? (d >>> 0 < g >>> 0 ? g : d) : 1073741823
            do
                if (j)
                    if (j >>> 0 > 1073741823) {
                        d = ra(8) | 0
                        Wo(d, 14941)
                        f[d >> 2] = 6944
                        va(d | 0, 1080, 114)
                    } else {
                        k = dn(j << 2) | 0
                        break
                    }
                else k = 0
            while (0)
            d = (k + (e << 2)) | 0
            e = d
            g = (k + (j << 2)) | 0
            j = f[b >> 2] | 0
            f[b >> 2] = 0
            f[d >> 2] = j
            j = (d + 4) | 0
            b = f[a >> 2] | 0
            k = f[c >> 2] | 0
            if ((k | 0) == (b | 0)) {
                l = e
                m = b
                n = b
            } else {
                i = k
                k = e
                e = d
                do {
                    i = (i + -4) | 0
                    d = f[i >> 2] | 0
                    f[i >> 2] = 0
                    f[(e + -4) >> 2] = d
                    e = (k + -4) | 0
                    k = e
                } while ((i | 0) != (b | 0))
                l = k
                m = f[a >> 2] | 0
                n = f[c >> 2] | 0
            }
            f[a >> 2] = l
            f[c >> 2] = j
            f[h >> 2] = g
            g = m
            if ((n | 0) != (g | 0)) {
                h = n
                do {
                    h = (h + -4) | 0
                    n = f[h >> 2] | 0
                    f[h >> 2] = 0
                    if (n | 0) {
                        Qi(n)
                        br(n)
                    }
                } while ((h | 0) != (g | 0))
            }
            if (!m) return
            br(m)
            return
        }
        function Cg(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            e = f[b >> 2] | 0
            g = f[a >> 2] | 0
            h = f[d >> 2] | 0
            d = f[h >> 2] | 0
            i = ((f[(h + 4) >> 2] | 0) - d) >> 3
            if (i >>> 0 <= e >>> 0) mq(h)
            j = d
            if (i >>> 0 <= g >>> 0) mq(h)
            d = f[(j + (e << 3)) >> 2] | 0
            k = f[c >> 2] | 0
            if (i >>> 0 <= k >>> 0) mq(h)
            l = (j + (g << 3)) | 0
            m = (f[(j + (k << 3)) >> 2] | 0) >>> 0 < d >>> 0
            if (d >>> 0 < (f[l >> 2] | 0) >>> 0) {
                if (m) {
                    f[a >> 2] = k
                    f[c >> 2] = g
                    n = 1
                    return n | 0
                }
                f[a >> 2] = e
                f[b >> 2] = g
                d = f[c >> 2] | 0
                if (i >>> 0 <= d >>> 0) mq(h)
                if ((f[(j + (d << 3)) >> 2] | 0) >>> 0 >= (f[l >> 2] | 0) >>> 0) {
                    n = 1
                    return n | 0
                }
                f[b >> 2] = d
                f[c >> 2] = g
                n = 2
                return n | 0
            }
            if (!m) {
                n = 0
                return n | 0
            }
            f[b >> 2] = k
            f[c >> 2] = e
            e = f[b >> 2] | 0
            c = f[a >> 2] | 0
            if (i >>> 0 <= e >>> 0) mq(h)
            if (i >>> 0 <= c >>> 0) mq(h)
            if ((f[(j + (e << 3)) >> 2] | 0) >>> 0 >= (f[(j + (c << 3)) >> 2] | 0) >>> 0) {
                n = 1
                return n | 0
            }
            f[a >> 2] = e
            f[b >> 2] = c
            n = 2
            return n | 0
        }
        function Dg(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0
            e = u
            u = (u + 96) | 0
            g = (e + 40) | 0
            h = e
            Am(g, c)
            we(h, b, c)
            th(g, h)
            sj((h + 24) | 0, f[(h + 28) >> 2] | 0)
            Dj((h + 12) | 0, f[(h + 16) >> 2] | 0)
            sj(h, f[(h + 4) >> 2] | 0)
            Si(a, g, d)
            f[g >> 2] = 2968
            sj((g + 28) | 0, f[(g + 32) >> 2] | 0)
            Dj((g + 16) | 0, f[(g + 20) >> 2] | 0)
            sj((g + 4) | 0, f[(g + 8) >> 2] | 0)
            u = e
            return
        }
        function Eg(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0
            a = u
            u = (u + 16) | 0
            e = a
            if (!b) {
                g = 0
                u = a
                return g | 0
            }
            h = (b + 96) | 0
            i = (b + 100) | 0
            f[e >> 2] = 0
            f[(e + 4) >> 2] = 0
            f[(e + 8) >> 2] = 0
            b = f[i >> 2] | 0
            j = f[h >> 2] | 0
            k = (((b - j) | 0) / 12) | 0
            l = j
            j = b
            if (k >>> 0 >= c >>> 0) {
                if (k >>> 0 > c >>> 0 ? ((b = (l + ((c * 12) | 0)) | 0), (b | 0) != (j | 0)) : 0) f[i >> 2] = j + ((~(((((j + -12 - b) | 0) >>> 0) / 12) | 0) * 12) | 0)
                if (!c) {
                    g = 1
                    u = a
                    return g | 0
                }
            } else Ag(h, (c - k) | 0, e)
            k = 0
            b = f[h >> 2] | 0
            while (1) {
                j = (k * 3) | 0
                l = f[(d + (j << 2)) >> 2] | 0
                m = f[(d + ((j + 1) << 2)) >> 2] | 0
                n = f[(d + ((j + 2) << 2)) >> 2] | 0
                j = ((((f[i >> 2] | 0) - b) | 0) / 12) | 0
                o = k
                k = (k + 1) | 0
                if (o >>> 0 < j >>> 0) {
                    p = b
                    q = b
                } else {
                    f[e >> 2] = 0
                    f[(e + 4) >> 2] = 0
                    f[(e + 8) >> 2] = 0
                    Ag(h, (k - j) | 0, e)
                    j = f[h >> 2] | 0
                    p = j
                    q = j
                }
                f[(p + ((o * 12) | 0)) >> 2] = l
                f[(p + ((o * 12) | 0) + 4) >> 2] = m
                f[(p + ((o * 12) | 0) + 8) >> 2] = n
                if ((k | 0) == (c | 0)) {
                    g = 1
                    break
                } else b = q
            }
            u = a
            return g | 0
        }
        function Fg(a) {
            a = +a
            var b = 0,
                c = 0,
                d = 0,
                e = 0.0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0.0,
                n = 0.0,
                o = 0.0,
                q = 0.0,
                r = 0.0,
                t = 0.0
            p[s >> 3] = a
            b = f[s >> 2] | 0
            c = f[(s + 4) >> 2] | 0
            d = (c | 0) < 0
            do
                if (d | (c >>> 0 < 1048576)) {
                    if (((b | 0) == 0) & (((c & 2147483647) | 0) == 0)) {
                        e = -1.0 / (a * a)
                        break
                    }
                    if (d) {
                        e = (a - a) / 0.0
                        break
                    } else {
                        p[s >> 3] = a * 18014398509481984.0
                        g = f[(s + 4) >> 2] | 0
                        h = -1077
                        i = g
                        j = f[s >> 2] | 0
                        k = g
                        l = 9
                        break
                    }
                } else if (c >>> 0 <= 2146435071)
                    if (((b | 0) == 0) & (0 == 0) & ((c | 0) == 1072693248)) e = 0.0
                    else {
                        h = -1023
                        i = c
                        j = b
                        k = c
                        l = 9
                    }
                else e = a
            while (0)
            if ((l | 0) == 9) {
                l = (i + 614242) | 0
                f[s >> 2] = j
                f[(s + 4) >> 2] = (l & 1048575) + 1072079006
                a = +p[s >> 3] + -1.0
                m = a * a * 0.5
                n = a / (a + 2.0)
                o = n * n
                q = o * o
                p[s >> 3] = a - m
                j = f[(s + 4) >> 2] | 0
                f[s >> 2] = 0
                f[(s + 4) >> 2] = j
                r = +p[s >> 3]
                t =
                    a -
                    r -
                    m +
                    n *
                        (m +
                            (q * (q * (q * 0.15313837699209373 + 0.22222198432149784) + 0.3999999999940942) +
                                o * (q * (q * (q * 0.14798198605116586 + 0.1818357216161805) + 0.2857142874366239) + 0.6666666666666735)))
                q = r * 1.4426950407214463
                o = +((h + (l >>> 20)) | 0)
                m = q + o
                e = m + (q + (o - m) + (t * 1.4426950407214463 + (t + r) * 1.6751713164886512e-10))
            }
            return +e
        }
        function Gg(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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
            d = u
            u = (u + 16) | 0
            e = d
            g = dn(32) | 0
            f[e >> 2] = g
            f[(e + 8) >> 2] = -2147483616
            f[(e + 4) >> 2] = 17
            h = g
            i = 12804
            j = (h + 17) | 0
            do {
                b[h >> 0] = b[i >> 0] | 0
                h = (h + 1) | 0
                i = (i + 1) | 0
            } while ((h | 0) < (j | 0))
            b[(g + 17) >> 0] = 0
            g = (c + 16) | 0
            i = f[g >> 2] | 0
            if (i) {
                h = g
                j = i
                a: while (1) {
                    i = j
                    while (1) {
                        if ((f[(i + 16) >> 2] | 0) >= (a | 0)) break
                        k = f[(i + 4) >> 2] | 0
                        if (!k) {
                            l = h
                            break a
                        } else i = k
                    }
                    j = f[i >> 2] | 0
                    if (!j) {
                        l = i
                        break
                    } else h = i
                }
                if (((l | 0) != (g | 0) ? (f[(l + 16) >> 2] | 0) <= (a | 0) : 0) ? ((a = (l + 20) | 0), (sh(a, e) | 0) != 0) : 0) m = a
                else n = 10
            } else n = 10
            if ((n | 0) == 10) m = c
            c = yk(m, e, -1) | 0
            if ((b[(e + 11) >> 0] | 0) >= 0) {
                o = (c | 0) == -1
                p = c >>> 0 > 6
                q = p ? -2 : c
                r = o ? -1 : q
                u = d
                return r | 0
            }
            br(f[e >> 2] | 0)
            o = (c | 0) == -1
            p = c >>> 0 > 6
            q = p ? -2 : c
            r = o ? -1 : q
            u = d
            return r | 0
        }
        function Hg(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0
            d = u
            u = (u + 16) | 0
            e = d
            g = f[c >> 2] | 0
            f[c >> 2] = 0
            f[e >> 2] = g
            ug(a, b, e)
            g = f[e >> 2] | 0
            f[e >> 2] = 0
            if (g | 0) {
                e = (g + 88) | 0
                c = f[e >> 2] | 0
                f[e >> 2] = 0
                if (c | 0) {
                    e = f[(c + 8) >> 2] | 0
                    if (e | 0) {
                        h = (c + 12) | 0
                        if ((f[h >> 2] | 0) != (e | 0)) f[h >> 2] = e
                        br(e)
                    }
                    br(c)
                }
                c = f[(g + 68) >> 2] | 0
                if (c | 0) {
                    e = (g + 72) | 0
                    h = f[e >> 2] | 0
                    if ((h | 0) != (c | 0)) f[e >> 2] = h + (~(((h + -4 - c) | 0) >>> 2) << 2)
                    br(c)
                }
                c = (g + 64) | 0
                h = f[c >> 2] | 0
                f[c >> 2] = 0
                if (h | 0) {
                    c = f[h >> 2] | 0
                    if (c | 0) {
                        e = (h + 4) | 0
                        if ((f[e >> 2] | 0) != (c | 0)) f[e >> 2] = c
                        br(c)
                    }
                    br(h)
                }
                br(g)
            }
            g = (a + 84) | 0
            h = (a + 88) | 0
            a = f[h >> 2] | 0
            c = f[g >> 2] | 0
            e = (a - c) >> 2
            if ((e | 0) > (b | 0)) {
                u = d
                return
            }
            i = (b + 1) | 0
            b = a
            if (i >>> 0 > e >>> 0) {
                nh(g, (i - e) | 0)
                u = d
                return
            }
            if (i >>> 0 >= e >>> 0) {
                u = d
                return
            }
            e = (c + (i << 2)) | 0
            if ((e | 0) == (b | 0)) {
                u = d
                return
            }
            f[h >> 2] = b + (~(((b + -4 - e) | 0) >>> 2) << 2)
            u = d
            return
        }
        function Ig(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            d = u
            u = (u + 16) | 0
            e = d
            g = (a + 4) | 0
            f[g >> 2] = c
            f[(a + 8) >> 2] = f[(c + 56) >> 2]
            h = f[(a + 184) >> 2] | 0
            i = (a + 188) | 0
            j = f[i >> 2] | 0
            if ((j | 0) != (h | 0)) f[i >> 2] = j + (~(((j + -4 - h) | 0) >>> 2) << 2)
            h = f[(c + 48) >> 2] | 0
            c = dn(32) | 0
            f[e >> 2] = c
            f[(e + 8) >> 2] = -2147483616
            f[(e + 4) >> 2] = 19
            j = c
            i = 14285
            k = (j + 19) | 0
            do {
                b[j >> 0] = b[i >> 0] | 0
                j = (j + 1) | 0
                i = (i + 1) | 0
            } while ((j | 0) < (k | 0))
            b[(c + 19) >> 0] = 0
            c = (sh(h, e) | 0) == 0
            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
            h = f[((f[g >> 2] | 0) + 48) >> 2] | 0
            if (c) {
                c = ((Yh(h) | 0) > 5) & 1
                b[(a + 352) >> 0] = c
                u = d
                return 1
            }
            c = dn(32) | 0
            f[e >> 2] = c
            f[(e + 8) >> 2] = -2147483616
            f[(e + 4) >> 2] = 19
            j = c
            i = 14285
            k = (j + 19) | 0
            do {
                b[j >> 0] = b[i >> 0] | 0
                j = (j + 1) | 0
                i = (i + 1) | 0
            } while ((j | 0) < (k | 0))
            b[(c + 19) >> 0] = 0
            c = (Oj(h, e, 0) | 0) & 1
            b[(a + 352) >> 0] = c
            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
            u = d
            return 1
        }
        function Jg(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            c = (a + 108) | 0
            d = ((f[(a + 112) >> 2] | 0) - (f[c >> 2] | 0)) | 0
            e = ((d | 0) / 12) | 0
            g = (a + 4) | 0
            Nh(e, f[((f[g >> 2] | 0) + 44) >> 2] | 0) | 0
            if (!d) return 1
            d = 0
            a = 0
            while (1) {
                i = f[c >> 2] | 0
                j = (i + ((d * 12) | 0) + 4) | 0
                Nh(((f[j >> 2] | 0) - a) | 0, f[((f[g >> 2] | 0) + 44) >> 2] | 0) | 0
                Nh(((f[j >> 2] | 0) - (f[(i + ((d * 12) | 0)) >> 2] | 0)) | 0, f[((f[g >> 2] | 0) + 44) >> 2] | 0) | 0
                d = (d + 1) | 0
                if (d >>> 0 >= e >>> 0) break
                else a = f[j >> 2] | 0
            }
            li(f[((f[g >> 2] | 0) + 44) >> 2] | 0, e, 0, 0) | 0
            a = 0
            do {
                d = f[((f[g >> 2] | 0) + 44) >> 2] | 0
                j = (d + 16) | 0
                i = f[(j + 4) >> 2] | 0
                if (((i | 0) > 0) | (((i | 0) == 0) & ((f[j >> 2] | 0) >>> 0 > 0))) {
                    j = f[(d + 12) >> 2] | 0
                    d = (j + 4) | 0
                    i = f[d >> 2] | 0
                    k = b[((f[c >> 2] | 0) + ((a * 12) | 0) + 8) >> 0] & 1
                    l = i >>> 3
                    m = i & 7
                    i = ((f[j >> 2] | 0) + l) | 0
                    b[i >> 0] = ((1 << m) ^ 255) & (h[i >> 0] | 0)
                    i = ((f[j >> 2] | 0) + l) | 0
                    b[i >> 0] = (k << m) | (h[i >> 0] | 0)
                    f[d >> 2] = (f[d >> 2] | 0) + 1
                }
                a = (a + 1) | 0
            } while (a >>> 0 < e >>> 0)
            Qf(f[((f[g >> 2] | 0) + 44) >> 2] | 0)
            return 1
        }
        function Kg(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            d = u
            u = (u + 16) | 0
            e = d
            g = (a + 4) | 0
            f[g >> 2] = c
            f[(a + 8) >> 2] = f[(c + 56) >> 2]
            h = f[(a + 184) >> 2] | 0
            i = (a + 188) | 0
            j = f[i >> 2] | 0
            if ((j | 0) != (h | 0)) f[i >> 2] = j + (~(((j + -4 - h) | 0) >>> 2) << 2)
            h = f[(c + 48) >> 2] | 0
            c = dn(32) | 0
            f[e >> 2] = c
            f[(e + 8) >> 2] = -2147483616
            f[(e + 4) >> 2] = 19
            j = c
            i = 14285
            k = (j + 19) | 0
            do {
                b[j >> 0] = b[i >> 0] | 0
                j = (j + 1) | 0
                i = (i + 1) | 0
            } while ((j | 0) < (k | 0))
            b[(c + 19) >> 0] = 0
            c = (sh(h, e) | 0) == 0
            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
            h = f[((f[g >> 2] | 0) + 48) >> 2] | 0
            if (c) {
                c = ((Yh(h) | 0) > 5) & 1
                b[(a + 288) >> 0] = c
                u = d
                return 1
            }
            c = dn(32) | 0
            f[e >> 2] = c
            f[(e + 8) >> 2] = -2147483616
            f[(e + 4) >> 2] = 19
            j = c
            i = 14285
            k = (j + 19) | 0
            do {
                b[j >> 0] = b[i >> 0] | 0
                j = (j + 1) | 0
                i = (i + 1) | 0
            } while ((j | 0) < (k | 0))
            b[(c + 19) >> 0] = 0
            c = (Oj(h, e, 0) | 0) & 1
            b[(a + 288) >> 0] = c
            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
            u = d
            return 1
        }
        function Lg(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 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
            g = u
            u = (u + 32) | 0
            h = (g + 16) | 0
            i = (g + 8) | 0
            j = g
            k = (d - e) | 0
            d = (a + 8) | 0
            if ((k | 0) > 0) {
                a = (0 - e) | 0
                l = (i + 4) | 0
                m = (j + 4) | 0
                n = (h + 4) | 0
                o = k
                do {
                    k = (b + (o << 2)) | 0
                    p = (k + (a << 2)) | 0
                    q = (c + (o << 2)) | 0
                    r = f[(k + 4) >> 2] | 0
                    s = f[p >> 2] | 0
                    t = f[(p + 4) >> 2] | 0
                    f[i >> 2] = f[k >> 2]
                    f[l >> 2] = r
                    f[j >> 2] = s
                    f[m >> 2] = t
                    Dd(h, d, i, j)
                    f[q >> 2] = f[h >> 2]
                    f[(q + 4) >> 2] = f[n >> 2]
                    o = (o - e) | 0
                } while ((o | 0) > 0)
            }
            o = e >>> 0 > 1073741823 ? -1 : e << 2
            e = _q(o) | 0
            hj(e | 0, 0, o | 0) | 0
            o = f[(b + 4) >> 2] | 0
            n = f[e >> 2] | 0
            m = f[(e + 4) >> 2] | 0
            f[i >> 2] = f[b >> 2]
            f[(i + 4) >> 2] = o
            f[j >> 2] = n
            f[(j + 4) >> 2] = m
            Dd(h, d, i, j)
            f[c >> 2] = f[h >> 2]
            f[(c + 4) >> 2] = f[(h + 4) >> 2]
            $q(e)
            u = g
            return 1
        }
        function Mg(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            c = u
            u = (u + 32) | 0
            d = (c + 12) | 0
            e = c
            g = f[(b + 100) >> 2] | 0
            h = f[(b + 96) >> 2] | 0
            b = (g - h) | 0
            i = ((b | 0) / 12) | 0
            f[d >> 2] = 0
            j = (d + 4) | 0
            f[j >> 2] = 0
            f[(d + 8) >> 2] = 0
            k = h
            do
                if (b)
                    if (i >>> 0 > 357913941) mq(d)
                    else {
                        l = dn(b) | 0
                        f[d >> 2] = l
                        f[(d + 8) >> 2] = l + ((i * 12) | 0)
                        hj(l | 0, 0, b | 0) | 0
                        f[j >> 2] = l + b
                        m = l
                        break
                    }
                else m = 0
            while (0)
            f[e >> 2] = 0
            f[(e + 4) >> 2] = 0
            f[(e + 8) >> 2] = 0
            if ((g | 0) != (h | 0)) {
                h = (e + 4) | 0
                g = (e + 8) | 0
                b = 0
                do {
                    l = (k + ((b * 12) | 0)) | 0
                    f[e >> 2] = f[l >> 2]
                    f[(e + 4) >> 2] = f[(l + 4) >> 2]
                    f[(e + 8) >> 2] = f[(l + 8) >> 2]
                    f[(m + ((b * 12) | 0)) >> 2] = f[e >> 2]
                    f[(m + ((b * 12) | 0) + 4) >> 2] = f[h >> 2]
                    f[(m + ((b * 12) | 0) + 8) >> 2] = f[g >> 2]
                    b = (b + 1) | 0
                } while (b >>> 0 < i >>> 0)
            }
            Cj(a, d)
            a = f[d >> 2] | 0
            if (!a) {
                u = c
                return
            }
            d = f[j >> 2] | 0
            if ((d | 0) != (a | 0)) f[j >> 2] = d + ((~(((((d + -12 - a) | 0) >>> 0) / 12) | 0) * 12) | 0)
            br(a)
            u = c
            return
        }
        function Ng(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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
            if (c >>> 0 > 4294967279) mq(a)
            d = (a + 11) | 0
            e = b[d >> 0] | 0
            g = (e << 24) >> 24 < 0
            if (g) {
                h = f[(a + 4) >> 2] | 0
                i = ((f[(a + 8) >> 2] & 2147483647) + -1) | 0
            } else {
                h = e & 255
                i = 10
            }
            j = h >>> 0 > c >>> 0 ? h : c
            c = j >>> 0 < 11
            k = c ? 10 : (((j + 16) & -16) + -1) | 0
            do
                if ((k | 0) != (i | 0)) {
                    do
                        if (c) {
                            j = f[a >> 2] | 0
                            if (g) {
                                l = 0
                                m = j
                                n = a
                                o = 13
                            } else {
                                Lo(a, j, ((e & 255) + 1) | 0) | 0
                                br(j)
                                o = 16
                            }
                        } else {
                            j = (k + 1) | 0
                            p = dn(j) | 0
                            if (g) {
                                l = 1
                                m = f[a >> 2] | 0
                                n = p
                                o = 13
                                break
                            } else {
                                Lo(p, a, ((e & 255) + 1) | 0) | 0
                                q = p
                                r = j
                                s = (a + 4) | 0
                                o = 15
                                break
                            }
                        }
                    while (0)
                    if ((o | 0) == 13) {
                        j = (a + 4) | 0
                        Lo(n, m, ((f[j >> 2] | 0) + 1) | 0) | 0
                        br(m)
                        if (l) {
                            q = n
                            r = (k + 1) | 0
                            s = j
                            o = 15
                        } else o = 16
                    }
                    if ((o | 0) == 15) {
                        f[(a + 8) >> 2] = r | -2147483648
                        f[s >> 2] = h
                        f[a >> 2] = q
                        break
                    } else if ((o | 0) == 16) {
                        b[d >> 0] = h
                        break
                    }
                }
            while (0)
            return
        }
        function Og(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            c = f[b >> 2] | 0
            if ((c | 0) == -1) {
                d = -1
                return d | 0
            }
            b = f[((f[(a + 24) >> 2] | 0) + (c << 2)) >> 2] | 0
            if ((b | 0) == -1) {
                d = 0
                return d | 0
            }
            c = (a + 12) | 0
            a = 0
            e = 0
            g = b
            a: while (1) {
                b: do
                    if (e) {
                        h = (a + 1) | 0
                        i = ((((g >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + g) | 0
                        if ((i | 0) == -1) {
                            d = h
                            j = 15
                            break a
                        }
                        k = f[((f[c >> 2] | 0) + (i << 2)) >> 2] | 0
                        if ((k | 0) == -1) {
                            d = h
                            j = 15
                            break a
                        }
                        if (!((k >>> 0) % 3 | 0)) {
                            l = (k + 2) | 0
                            m = h
                            break
                        } else {
                            l = (k + -1) | 0
                            m = h
                            break
                        }
                    } else {
                        h = a
                        k = g
                        while (1) {
                            i = (h + 1) | 0
                            n = (k + 1) | 0
                            o = ((n >>> 0) % 3 | 0 | 0) == 0 ? (k + -2) | 0 : n
                            if ((o | 0) == -1) {
                                l = b
                                m = i
                                break b
                            }
                            n = f[((f[c >> 2] | 0) + (o << 2)) >> 2] | 0
                            o = (n + 1) | 0
                            if ((n | 0) == -1) {
                                l = b
                                m = i
                                break b
                            }
                            k = ((o >>> 0) % 3 | 0 | 0) == 0 ? (n + -2) | 0 : o
                            if ((k | 0) == -1) {
                                l = b
                                m = i
                                break b
                            }
                            if ((k | 0) == (b | 0)) {
                                d = i
                                j = 15
                                break a
                            } else h = i
                        }
                    }
                while (0)
                if ((l | 0) == -1) {
                    d = m
                    j = 15
                    break
                } else {
                    a = m
                    e = 1
                    g = l
                }
            }
            if ((j | 0) == 15) return d | 0
            return 0
        }
        function Pg(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0
            d = (a + 8) | 0
            Cg(a, (a + 4) | 0, d, c) | 0
            e = (a + 12) | 0
            if ((e | 0) == (b | 0)) return
            g = f[c >> 2] | 0
            c = f[g >> 2] | 0
            h = ((f[(g + 4) >> 2] | 0) - c) >> 3
            i = c
            c = e
            e = d
            a: while (1) {
                d = f[c >> 2] | 0
                j = f[e >> 2] | 0
                if (h >>> 0 <= d >>> 0) {
                    k = 5
                    break
                }
                if (h >>> 0 <= j >>> 0) {
                    k = 7
                    break
                }
                l = (i + (d << 3)) | 0
                if ((f[l >> 2] | 0) >>> 0 < (f[(i + (j << 3)) >> 2] | 0) >>> 0) {
                    m = e
                    n = c
                    o = j
                    while (1) {
                        f[n >> 2] = o
                        if ((m | 0) == (a | 0)) {
                            p = a
                            break
                        }
                        j = (m + -4) | 0
                        o = f[j >> 2] | 0
                        if (h >>> 0 <= o >>> 0) {
                            k = 11
                            break a
                        }
                        if ((f[l >> 2] | 0) >>> 0 >= (f[(i + (o << 3)) >> 2] | 0) >>> 0) {
                            p = m
                            break
                        } else {
                            q = m
                            m = j
                            n = q
                        }
                    }
                    f[p >> 2] = d
                }
                n = (c + 4) | 0
                if ((n | 0) == (b | 0)) {
                    k = 3
                    break
                } else {
                    m = c
                    c = n
                    e = m
                }
            }
            if ((k | 0) == 3) return
            else if ((k | 0) == 5) mq(g)
            else if ((k | 0) == 7) mq(g)
            else if ((k | 0) == 11) mq(g)
        }
        function Qg(a, b, c, d, e) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            g = Cg(a, b, c, e) | 0
            h = f[d >> 2] | 0
            i = f[c >> 2] | 0
            j = f[e >> 2] | 0
            e = f[j >> 2] | 0
            k = ((f[(j + 4) >> 2] | 0) - e) >> 3
            if (k >>> 0 <= h >>> 0) mq(j)
            l = e
            if (k >>> 0 <= i >>> 0) mq(j)
            if ((f[(l + (h << 3)) >> 2] | 0) >>> 0 >= (f[(l + (i << 3)) >> 2] | 0) >>> 0) {
                m = g
                return m | 0
            }
            f[c >> 2] = h
            f[d >> 2] = i
            i = f[c >> 2] | 0
            d = f[b >> 2] | 0
            if (k >>> 0 <= i >>> 0) mq(j)
            if (k >>> 0 <= d >>> 0) mq(j)
            if ((f[(l + (i << 3)) >> 2] | 0) >>> 0 >= (f[(l + (d << 3)) >> 2] | 0) >>> 0) {
                m = (g + 1) | 0
                return m | 0
            }
            f[b >> 2] = i
            f[c >> 2] = d
            d = f[b >> 2] | 0
            c = f[a >> 2] | 0
            if (k >>> 0 <= d >>> 0) mq(j)
            if (k >>> 0 <= c >>> 0) mq(j)
            if ((f[(l + (d << 3)) >> 2] | 0) >>> 0 >= (f[(l + (c << 3)) >> 2] | 0) >>> 0) {
                m = (g + 2) | 0
                return m | 0
            }
            f[a >> 2] = d
            f[b >> 2] = c
            m = (g + 3) | 0
            return m | 0
        }
        function Rg(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0
            if ((d | 0) >= 8192) return Da(a | 0, c | 0, d | 0) | 0
            e = a | 0
            g = (a + d) | 0
            if ((a & 3) == (c & 3)) {
                while (a & 3) {
                    if (!d) return e | 0
                    b[a >> 0] = b[c >> 0] | 0
                    a = (a + 1) | 0
                    c = (c + 1) | 0
                    d = (d - 1) | 0
                }
                h = (g & -4) | 0
                d = (h - 64) | 0
                while ((a | 0) <= (d | 0)) {
                    f[a >> 2] = f[c >> 2]
                    f[(a + 4) >> 2] = f[(c + 4) >> 2]
                    f[(a + 8) >> 2] = f[(c + 8) >> 2]
                    f[(a + 12) >> 2] = f[(c + 12) >> 2]
                    f[(a + 16) >> 2] = f[(c + 16) >> 2]
                    f[(a + 20) >> 2] = f[(c + 20) >> 2]
                    f[(a + 24) >> 2] = f[(c + 24) >> 2]
                    f[(a + 28) >> 2] = f[(c + 28) >> 2]
                    f[(a + 32) >> 2] = f[(c + 32) >> 2]
                    f[(a + 36) >> 2] = f[(c + 36) >> 2]
                    f[(a + 40) >> 2] = f[(c + 40) >> 2]
                    f[(a + 44) >> 2] = f[(c + 44) >> 2]
                    f[(a + 48) >> 2] = f[(c + 48) >> 2]
                    f[(a + 52) >> 2] = f[(c + 52) >> 2]
                    f[(a + 56) >> 2] = f[(c + 56) >> 2]
                    f[(a + 60) >> 2] = f[(c + 60) >> 2]
                    a = (a + 64) | 0
                    c = (c + 64) | 0
                }
                while ((a | 0) < (h | 0)) {
                    f[a >> 2] = f[c >> 2]
                    a = (a + 4) | 0
                    c = (c + 4) | 0
                }
            } else {
                h = (g - 4) | 0
                while ((a | 0) < (h | 0)) {
                    b[a >> 0] = b[c >> 0] | 0
                    b[(a + 1) >> 0] = b[(c + 1) >> 0] | 0
                    b[(a + 2) >> 0] = b[(c + 2) >> 0] | 0
                    b[(a + 3) >> 0] = b[(c + 3) >> 0] | 0
                    a = (a + 4) | 0
                    c = (c + 4) | 0
                }
            }
            while ((a | 0) < (g | 0)) {
                b[a >> 0] = b[c >> 0] | 0
                a = (a + 1) | 0
                c = (c + 1) | 0
            }
            return e | 0
        }
        function Sg(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0
            c = u
            u = (u + 16) | 0
            d = (c + 4) | 0
            e = c
            f[a >> 2] = 1216
            g = (a + 4) | 0
            f[g >> 2] = 0
            f[(g + 4) >> 2] = 0
            f[(g + 8) >> 2] = 0
            f[(g + 12) >> 2] = 0
            f[(g + 16) >> 2] = 0
            f[(g + 20) >> 2] = 0
            f[(g + 24) >> 2] = 0
            f[(g + 28) >> 2] = 0
            f[d >> 2] = b
            b = (a + 4) | 0
            g = (a + 8) | 0
            Ci(b, d)
            h = f[d >> 2] | 0
            i = (a + 20) | 0
            j = f[i >> 2] | 0
            k = (a + 16) | 0
            a = f[k >> 2] | 0
            l = (j - a) >> 2
            m = a
            if ((h | 0) < (l | 0)) {
                n = m
                o = h
                p = f[g >> 2] | 0
                q = f[b >> 2] | 0
                r = (p - q) | 0
                s = r >> 2
                t = (s + -1) | 0
                v = (n + (o << 2)) | 0
                f[v >> 2] = t
                u = c
                return
            }
            a = (h + 1) | 0
            f[e >> 2] = -1
            w = j
            if (a >>> 0 <= l >>> 0)
                if (a >>> 0 < l >>> 0 ? ((j = (m + (a << 2)) | 0), (j | 0) != (w | 0)) : 0) {
                    f[i >> 2] = w + (~(((w + -4 - j) | 0) >>> 2) << 2)
                    x = h
                    y = m
                } else {
                    x = h
                    y = m
                }
            else {
                kh(k, (a - l) | 0, e)
                x = f[d >> 2] | 0
                y = f[k >> 2] | 0
            }
            n = y
            o = x
            p = f[g >> 2] | 0
            q = f[b >> 2] | 0
            r = (p - q) | 0
            s = r >> 2
            t = (s + -1) | 0
            v = (n + (o << 2)) | 0
            f[v >> 2] = t
            u = c
            return
        }
        function Tg(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            b = (a + 4) | 0
            c = f[b >> 2] | 0
            d = ((f[(c + 12) >> 2] | 0) - (f[(c + 8) >> 2] | 0)) | 0
            c = d >> 2
            a: do
                if ((d | 0) > 0) {
                    e = 0
                    while (1) {
                        if (!(Ra[f[((f[a >> 2] | 0) + 36) >> 2] & 127](a, e) | 0)) {
                            g = 0
                            break
                        }
                        e = (e + 1) | 0
                        h = f[b >> 2] | 0
                        i = ((f[(h + 12) >> 2] | 0) - (f[(h + 8) >> 2] | 0)) >> 2
                        if ((e | 0) >= (i | 0)) {
                            j = i
                            break a
                        }
                    }
                    return g | 0
                } else j = c
            while (0)
            c = (a + 20) | 0
            b = (a + 24) | 0
            d = f[b >> 2] | 0
            e = f[c >> 2] | 0
            i = (d - e) >> 2
            h = e
            e = d
            if (j >>> 0 <= i >>> 0) {
                if (j >>> 0 < i >>> 0 ? ((d = (h + (j << 2)) | 0), (d | 0) != (e | 0)) : 0) f[b >> 2] = e + (~(((e + -4 - d) | 0) >>> 2) << 2)
            } else oi(c, (j - i) | 0)
            i = f[(a + 12) >> 2] | 0
            j = f[(a + 8) >> 2] | 0
            a = j
            if ((i | 0) == (j | 0)) {
                g = 1
                return g | 0
            }
            d = (i - j) >> 2
            j = 0
            do {
                i = f[(a + (j << 2)) >> 2] | 0
                e = f[(i + 8) >> 2] | 0
                b = f[(i + 4) >> 2] | 0
                i = b
                if ((e | 0) != (b | 0) ? ((h = f[c >> 2] | 0), (k = (e - b) >> 2), (f[(h + (f[i >> 2] << 2)) >> 2] = j), k >>> 0 > 1) : 0) {
                    b = 1
                    do {
                        f[(h + (f[(i + (b << 2)) >> 2] << 2)) >> 2] = j
                        b = (b + 1) | 0
                    } while (b >>> 0 < k >>> 0)
                }
                j = (j + 1) | 0
            } while (j >>> 0 < d >>> 0)
            g = 1
            return g | 0
        }
        function Ug(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0
            d = f[(c + 88) >> 2] | 0
            if (!d) {
                e = 0
                return e | 0
            }
            if ((f[d >> 2] | 0) != 1) {
                e = 0
                return e | 0
            }
            g = (d + 8) | 0
            d = f[g >> 2] | 0
            f[(a + 4) >> 2] = h[d >> 0] | (h[(d + 1) >> 0] << 8) | (h[(d + 2) >> 0] << 16) | (h[(d + 3) >> 0] << 24)
            i = (a + 8) | 0
            j = (c + 24) | 0
            c = b[j >> 0] | 0
            k = (c << 24) >> 24
            l = (a + 12) | 0
            m = f[l >> 2] | 0
            n = f[i >> 2] | 0
            o = (m - n) >> 2
            p = n
            n = m
            if (o >>> 0 >= k >>> 0)
                if (o >>> 0 > k >>> 0 ? ((m = (p + (k << 2)) | 0), (m | 0) != (n | 0)) : 0) {
                    f[l >> 2] = n + (~(((n + -4 - m) | 0) >>> 2) << 2)
                    q = c
                    r = d
                } else {
                    q = c
                    r = d
                }
            else {
                oi(i, (k - o) | 0)
                q = b[j >> 0] | 0
                r = f[g >> 2] | 0
            }
            g = (r + 4) | 0
            j = h[g >> 0] | (h[(g + 1) >> 0] << 8) | (h[(g + 2) >> 0] << 16) | (h[(g + 3) >> 0] << 24)
            if ((q << 24) >> 24 > 0) {
                g = f[i >> 2] | 0
                i = (q << 24) >> 24
                q = j
                o = 4
                k = 0
                while (1) {
                    f[(g + (k << 2)) >> 2] = q
                    o = (o + 4) | 0
                    k = (k + 1) | 0
                    d = (r + o) | 0
                    c = h[d >> 0] | (h[(d + 1) >> 0] << 8) | (h[(d + 2) >> 0] << 16) | (h[(d + 3) >> 0] << 24)
                    if ((k | 0) >= (i | 0)) {
                        s = c
                        break
                    } else q = c
                }
            } else s = j
            f[(a + 20) >> 2] = s
            e = 1
            return e | 0
        }
        function Vg(a, c, d, e, g) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            var h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            do
                if (!(qp(a, f[(c + 8) >> 2] | 0, g) | 0)) {
                    if (!(qp(a, f[c >> 2] | 0, g) | 0)) {
                        h = f[(a + 8) >> 2] | 0
                        Za[f[((f[h >> 2] | 0) + 24) >> 2] & 3](h, c, d, e, g)
                        break
                    }
                    if ((f[(c + 16) >> 2] | 0) != (d | 0) ? ((h = (c + 20) | 0), (f[h >> 2] | 0) != (d | 0)) : 0) {
                        f[(c + 32) >> 2] = e
                        i = (c + 44) | 0
                        if ((f[i >> 2] | 0) == 4) break
                        j = (c + 52) | 0
                        b[j >> 0] = 0
                        k = (c + 53) | 0
                        b[k >> 0] = 0
                        l = f[(a + 8) >> 2] | 0
                        _a[f[((f[l >> 2] | 0) + 20) >> 2] & 3](l, c, d, d, 1, g)
                        if (b[k >> 0] | 0)
                            if (!(b[j >> 0] | 0)) {
                                m = 3
                                n = 11
                            } else o = 3
                        else {
                            m = 4
                            n = 11
                        }
                        if ((n | 0) == 11) {
                            f[h >> 2] = d
                            h = (c + 40) | 0
                            f[h >> 2] = (f[h >> 2] | 0) + 1
                            if ((f[(c + 36) >> 2] | 0) == 1 ? (f[(c + 24) >> 2] | 0) == 2 : 0) {
                                b[(c + 54) >> 0] = 1
                                o = m
                            } else o = m
                        }
                        f[i >> 2] = o
                        break
                    }
                    if ((e | 0) == 1) f[(c + 32) >> 2] = 1
                } else Om(0, c, d, e)
            while (0)
            return
        }
        function Wg(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            e = u
            u = (u + 16) | 0
            g = (e + 12) | 0
            h = (e + 8) | 0
            i = e
            f[i >> 2] = f[b >> 2]
            f[g >> 2] = f[i >> 2]
            i = zd(a, g, h, (e + 4) | 0, c) | 0
            c = f[i >> 2] | 0
            if (c | 0) {
                j = c
                u = e
                return j | 0
            }
            c = dn(40) | 0
            dj((c + 16) | 0, d)
            dj((c + 28) | 0, (d + 12) | 0)
            d = f[h >> 2] | 0
            f[c >> 2] = 0
            f[(c + 4) >> 2] = 0
            f[(c + 8) >> 2] = d
            f[i >> 2] = c
            d = f[f[a >> 2] >> 2] | 0
            if (!d) k = c
            else {
                f[a >> 2] = d
                k = f[i >> 2] | 0
            }
            Ae(f[(a + 4) >> 2] | 0, k)
            k = (a + 8) | 0
            f[k >> 2] = (f[k >> 2] | 0) + 1
            j = c
            u = e
            return j | 0
        }
        function Xg(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            e = u
            u = (u + 16) | 0
            g = e
            h = (a + 4) | 0
            f[h >> 2] = 0
            if (!c) {
                u = e
                return
            }
            i = (a + 8) | 0
            j = f[i >> 2] | 0
            k = j << 5
            if (k >>> 0 < c >>> 0) {
                f[g >> 2] = 0
                l = (g + 4) | 0
                f[l >> 2] = 0
                m = (g + 8) | 0
                f[m >> 2] = 0
                if ((c | 0) < 0) mq(a)
                n = j << 6
                j = (c + 31) & -32
                hi(g, k >>> 0 < 1073741823 ? (n >>> 0 < j >>> 0 ? j : n) : 2147483647)
                n = f[a >> 2] | 0
                f[a >> 2] = f[g >> 2]
                f[g >> 2] = n
                g = f[h >> 2] | 0
                f[h >> 2] = c
                f[l >> 2] = g
                g = f[i >> 2] | 0
                f[i >> 2] = f[m >> 2]
                f[m >> 2] = g
                if (n | 0) br(n)
                o = a
            } else {
                f[h >> 2] = c
                o = a
            }
            a = f[o >> 2] | 0
            o = a
            h = a
            a = c >>> 5
            n = a << 2
            if (!(b[d >> 0] | 0)) {
                hj(h | 0, 0, n | 0) | 0
                d = c & 31
                g = (o + (a << 2)) | 0
                if (!d) {
                    u = e
                    return
                }
                f[g >> 2] = f[g >> 2] & ~(-1 >>> ((32 - d) | 0))
                u = e
                return
            } else {
                hj(h | 0, -1, n | 0) | 0
                n = c & 31
                c = (o + (a << 2)) | 0
                if (!n) {
                    u = e
                    return
                }
                f[c >> 2] = f[c >> 2] | (-1 >>> ((32 - n) | 0))
                u = e
                return
            }
        }
        function Yg(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            c = u
            u = (u + 16) | 0
            d = (c + 8) | 0
            e = (c + 4) | 0
            g = c
            f[g >> 2] = f[(a + 12) >> 2]
            h = (b + 16) | 0
            i = h
            j = f[i >> 2] | 0
            k = f[(i + 4) >> 2] | 0
            if (((k | 0) > 0) | (((k | 0) == 0) & (j >>> 0 > 0))) {
                l = k
                m = j
            } else {
                f[e >> 2] = f[(b + 4) >> 2]
                f[d >> 2] = f[e >> 2]
                ye(b, d, g, (g + 4) | 0) | 0
                j = h
                l = f[(j + 4) >> 2] | 0
                m = f[j >> 2] | 0
            }
            f[g >> 2] = f[(a + 20) >> 2]
            if (((l | 0) > 0) | (((l | 0) == 0) & (m >>> 0 > 0))) {
                n = (a + 88) | 0
                fd(n, b)
                u = c
                return 1
            }
            f[e >> 2] = f[(b + 4) >> 2]
            f[d >> 2] = f[e >> 2]
            ye(b, d, g, (g + 4) | 0) | 0
            n = (a + 88) | 0
            fd(n, b)
            u = c
            return 1
        }
        function Zg(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            c = u
            u = (u + 16) | 0
            d = (c + 8) | 0
            e = (c + 4) | 0
            g = c
            f[g >> 2] = f[(a + 12) >> 2]
            h = (b + 16) | 0
            i = h
            j = f[i >> 2] | 0
            k = f[(i + 4) >> 2] | 0
            if (((k | 0) > 0) | (((k | 0) == 0) & (j >>> 0 > 0))) {
                l = k
                m = j
            } else {
                f[e >> 2] = f[(b + 4) >> 2]
                f[d >> 2] = f[e >> 2]
                ye(b, d, g, (g + 4) | 0) | 0
                j = h
                l = f[(j + 4) >> 2] | 0
                m = f[j >> 2] | 0
            }
            f[g >> 2] = f[(a + 16) >> 2]
            if (((l | 0) > 0) | (((l | 0) == 0) & (m >>> 0 > 0))) {
                n = (a + 108) | 0
                fd(n, b)
                u = c
                return 1
            }
            f[e >> 2] = f[(b + 4) >> 2]
            f[d >> 2] = f[e >> 2]
            ye(b, d, g, (g + 4) | 0) | 0
            n = (a + 108) | 0
            fd(n, b)
            u = c
            return 1
        }
        function _g(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0
            c = (a + 32) | 0
            d = f[(a + 64) >> 2] | 0
            e = ((Qa[f[((f[d >> 2] | 0) + 40) >> 2] & 127](d) | 0) + 56) | 0
            d = f[e >> 2] | 0
            li(c, ((((((f[(d + 100) >> 2] | 0) - (f[(d + 96) >> 2] | 0)) | 0) / 12) | 0) * 3) | 0, 0, 1) | 0
            d = (a + 68) | 0
            e = f[d >> 2] | 0
            g = ((f[(a + 72) >> 2] | 0) - e) | 0
            if ((g | 0) <= 0) {
                Qf(c)
                return
            }
            i = (a + 48) | 0
            j = (a + 44) | 0
            a = ((g >>> 2) + -1) | 0
            g = e
            while (1) {
                e = f[(g + (a << 2)) >> 2] | 0
                k = f[(3124 + (e << 2)) >> 2] | 0
                l = i
                m = f[(l + 4) >> 2] | 0
                if (((m | 0) > 0) | (((m | 0) == 0) & ((f[l >> 2] | 0) >>> 0 > 0)) ? ((l = f[j >> 2] | 0), ((171 >>> e) & 1) | 0) : 0) {
                    m = (l + 4) | 0
                    n = 0
                    o = f[m >> 2] | 0
                    do {
                        p = o >>> 3
                        q = o & 7
                        r = ((f[l >> 2] | 0) + p) | 0
                        b[r >> 0] = ((1 << q) ^ 255) & (h[r >> 0] | 0)
                        r = ((f[l >> 2] | 0) + p) | 0
                        b[r >> 0] = (((e >>> n) & 1) << q) | (h[r >> 0] | 0)
                        o = ((f[m >> 2] | 0) + 1) | 0
                        f[m >> 2] = o
                        n = (n + 1) | 0
                    } while ((n | 0) != (k | 0))
                }
                k = (a + -1) | 0
                if ((k | 0) <= -1) break
                a = k
                g = f[d >> 2] | 0
            }
            Qf(c)
            return
        }
        function $g(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            g = u
            u = (u + 48) | 0
            h = g
            i = (g + 32) | 0
            if (!c) {
                j = 0
                u = g
                return j | 0
            }
            Cn(h)
            do
                if ((Tl(c, 0) | 0) != -1) {
                    if (d) {
                        if (!(Qa[f[((f[c >> 2] | 0) + 16) >> 2] & 127](c) | 0)) {
                            k = 0
                            break
                        }
                        Va[f[((f[c >> 2] | 0) + 20) >> 2] & 127](c)
                    }
                    Dg(i, a, c, h)
                    l = (f[i >> 2] | 0) == 0
                    m = (i + 4) | 0
                    if ((b[(m + 11) >> 0] | 0) < 0) br(f[m >> 2] | 0)
                    if (l) {
                        l = f[h >> 2] | 0
                        m = (h + 4) | 0
                        ag(e, l, (l + ((f[m >> 2] | 0) - l)) | 0)
                        k = ((f[m >> 2] | 0) - (f[h >> 2] | 0)) | 0
                    } else k = 0
                } else k = 0
            while (0)
            e = (h + 12) | 0
            i = f[e >> 2] | 0
            f[e >> 2] = 0
            if (i | 0) br(i)
            i = f[h >> 2] | 0
            if (i | 0) {
                e = (h + 4) | 0
                if ((f[e >> 2] | 0) != (i | 0)) f[e >> 2] = i
                br(i)
            }
            j = k
            u = g
            return j | 0
        }
        function ah(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            c = u
            u = (u + 16) | 0
            d = c
            e = f[((f[a >> 2] | 0) + 8) >> 2] | 0
            g = (a + 8) | 0
            h = (a + 12) | 0
            i = ((f[h >> 2] | 0) - (f[g >> 2] | 0)) >> 2
            j = f[b >> 2] | 0
            f[b >> 2] = 0
            f[d >> 2] = j
            Xa[e & 15](a, i, d)
            i = f[d >> 2] | 0
            f[d >> 2] = 0
            if (!i) {
                k = f[h >> 2] | 0
                l = f[g >> 2] | 0
                m = (k - l) | 0
                n = m >> 2
                o = (n + -1) | 0
                u = c
                return o | 0
            }
            d = (i + 88) | 0
            a = f[d >> 2] | 0
            f[d >> 2] = 0
            if (a | 0) {
                d = f[(a + 8) >> 2] | 0
                if (d | 0) {
                    e = (a + 12) | 0
                    if ((f[e >> 2] | 0) != (d | 0)) f[e >> 2] = d
                    br(d)
                }
                br(a)
            }
            a = f[(i + 68) >> 2] | 0
            if (a | 0) {
                d = (i + 72) | 0
                e = f[d >> 2] | 0
                if ((e | 0) != (a | 0)) f[d >> 2] = e + (~(((e + -4 - a) | 0) >>> 2) << 2)
                br(a)
            }
            a = (i + 64) | 0
            e = f[a >> 2] | 0
            f[a >> 2] = 0
            if (e | 0) {
                a = f[e >> 2] | 0
                if (a | 0) {
                    d = (e + 4) | 0
                    if ((f[d >> 2] | 0) != (a | 0)) f[d >> 2] = a
                    br(a)
                }
                br(e)
            }
            br(i)
            k = f[h >> 2] | 0
            l = f[g >> 2] | 0
            m = (k - l) | 0
            n = m >> 2
            o = (n + -1) | 0
            u = c
            return o | 0
        }
        function bh(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            if (b[(a + 352) >> 0] | 0) return 1
            c = (a + 8) | 0
            d = f[c >> 2] | 0
            e = ((f[(d + 12) >> 2] | 0) - (f[(d + 8) >> 2] | 0)) | 0
            d = e >> 2
            g = (a + 172) | 0
            si(g, (d + -1) | 0)
            if (!(((d | 0) != 1) & ((e | 0) > 0))) return 1
            e = (a + 12) | 0
            a = 0
            h = 0
            while (1) {
                i = f[((f[((f[c >> 2] | 0) + 8) >> 2] | 0) + (a << 2)) >> 2] | 0
                if (!(f[(i + 56) >> 2] | 0)) j = h
                else {
                    k = f[g >> 2] | 0
                    f[(k + ((h * 136) | 0)) >> 2] = a
                    l = f[(k + ((h * 136) | 0) + 104) >> 2] | 0
                    m = (k + ((h * 136) | 0) + 108) | 0
                    n = f[m >> 2] | 0
                    if ((n | 0) != (l | 0)) f[m >> 2] = n + (~(((n + -4 - l) | 0) >>> 2) << 2)
                    l = f[e >> 2] | 0
                    $j((k + ((h * 136) | 0) + 104) | 0, ((f[(l + 4) >> 2] | 0) - (f[l >> 2] | 0)) >> 2)
                    l = f[g >> 2] | 0
                    f[(l + ((h * 136) | 0) + 128) >> 2] = 0
                    zc((l + ((h * 136) | 0) + 4) | 0, f[c >> 2] | 0, f[e >> 2] | 0, i) | 0
                    j = (h + 1) | 0
                }
                a = (a + 1) | 0
                if ((a | 0) >= (d | 0)) break
                else h = j
            }
            return 1
        }
        function ch(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            if (b[(a + 288) >> 0] | 0) return 1
            c = (a + 8) | 0
            d = f[c >> 2] | 0
            e = ((f[(d + 12) >> 2] | 0) - (f[(d + 8) >> 2] | 0)) | 0
            d = e >> 2
            g = (a + 172) | 0
            si(g, (d + -1) | 0)
            if (!(((d | 0) != 1) & ((e | 0) > 0))) return 1
            e = (a + 12) | 0
            a = 0
            h = 0
            while (1) {
                i = f[((f[((f[c >> 2] | 0) + 8) >> 2] | 0) + (a << 2)) >> 2] | 0
                if (!(f[(i + 56) >> 2] | 0)) j = h
                else {
                    k = f[g >> 2] | 0
                    f[(k + ((h * 136) | 0)) >> 2] = a
                    l = f[(k + ((h * 136) | 0) + 104) >> 2] | 0
                    m = (k + ((h * 136) | 0) + 108) | 0
                    n = f[m >> 2] | 0
                    if ((n | 0) != (l | 0)) f[m >> 2] = n + (~(((n + -4 - l) | 0) >>> 2) << 2)
                    l = f[e >> 2] | 0
                    $j((k + ((h * 136) | 0) + 104) | 0, ((f[(l + 4) >> 2] | 0) - (f[l >> 2] | 0)) >> 2)
                    l = f[g >> 2] | 0
                    f[(l + ((h * 136) | 0) + 128) >> 2] = 0
                    zc((l + ((h * 136) | 0) + 4) | 0, f[c >> 2] | 0, f[e >> 2] | 0, i) | 0
                    j = (h + 1) | 0
                }
                a = (a + 1) | 0
                if ((a | 0) >= (d | 0)) break
                else h = j
            }
            return 1
        }
        function dh(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            c = (a + 8) | 0
            d = f[c >> 2] | 0
            e = (a + 4) | 0
            g = f[e >> 2] | 0
            if (((d - g) >> 3) >>> 0 >= b >>> 0) {
                h = b
                i = g
                do {
                    j = i
                    f[j >> 2] = 0
                    f[(j + 4) >> 2] = 0
                    i = ((f[e >> 2] | 0) + 8) | 0
                    f[e >> 2] = i
                    h = (h + -1) | 0
                } while ((h | 0) != 0)
                return
            }
            h = f[a >> 2] | 0
            i = (g - h) >> 3
            g = (i + b) | 0
            if (g >>> 0 > 536870911) mq(a)
            j = (d - h) | 0
            h = j >> 2
            d = (j >> 3) >>> 0 < 268435455 ? (h >>> 0 < g >>> 0 ? g : h) : 536870911
            do
                if (d)
                    if (d >>> 0 > 536870911) {
                        h = ra(8) | 0
                        Wo(h, 14941)
                        f[h >> 2] = 6944
                        va(h | 0, 1080, 114)
                    } else {
                        k = dn(d << 3) | 0
                        break
                    }
                else k = 0
            while (0)
            h = (k + (i << 3)) | 0
            i = (k + (d << 3)) | 0
            d = b
            b = h
            k = h
            do {
                g = b
                f[g >> 2] = 0
                f[(g + 4) >> 2] = 0
                b = (k + 8) | 0
                k = b
                d = (d + -1) | 0
            } while ((d | 0) != 0)
            d = f[a >> 2] | 0
            b = ((f[e >> 2] | 0) - d) | 0
            g = (h + ((0 - (b >> 3)) << 3)) | 0
            if ((b | 0) > 0) Rg(g | 0, d | 0, b | 0) | 0
            f[a >> 2] = g
            f[e >> 2] = k
            f[c >> 2] = i
            if (!d) return
            br(d)
            return
        }
        function eh(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            e = u
            u = (u + 16) | 0
            g = (e + 4) | 0
            h = e
            i = (e + 8) | 0
            j = a & 255
            b[i >> 0] = j & 127
            do
                if ((c >>> 0 > 0) | (((c | 0) == 0) & (a >>> 0 > 127))) {
                    b[i >> 0] = j | -128
                    k = (d + 16) | 0
                    l = f[(k + 4) >> 2] | 0
                    if (((l | 0) > 0) | (((l | 0) == 0) & ((f[k >> 2] | 0) >>> 0 > 0))) {
                        m = 0
                        break
                    } else {
                        f[h >> 2] = f[(d + 4) >> 2]
                        f[g >> 2] = f[h >> 2]
                        ye(d, g, i, (i + 1) | 0) | 0
                        k = Wn(a | 0, c | 0, 7) | 0
                        m = eh(k, I, d) | 0
                        break
                    }
                } else {
                    k = (d + 16) | 0
                    l = f[(k + 4) >> 2] | 0
                    if (((l | 0) > 0) | (((l | 0) == 0) & ((f[k >> 2] | 0) >>> 0 > 0))) {
                        m = 0
                        break
                    }
                    f[h >> 2] = f[(d + 4) >> 2]
                    f[g >> 2] = f[h >> 2]
                    ye(d, g, i, (i + 1) | 0) | 0
                    n = 1
                    u = e
                    return n | 0
                }
            while (0)
            n = m
            u = e
            return n | 0
        }
        function fh(a, b) {
            a = a | 0
            b = b | 0
            var c = 0
            c = (a + 8) | 0
            ef(c, b) | 0
            if ((c | 0) == (b | 0)) {
                f[(a + 92) >> 2] = f[(b + 84) >> 2]
                return
            } else {
                Yf((a + 56) | 0, f[(b + 48) >> 2] | 0, f[(b + 52) >> 2] | 0)
                Yf((a + 68) | 0, f[(b + 60) >> 2] | 0, f[(b + 64) >> 2] | 0)
                Yf((a + 80) | 0, f[(b + 72) >> 2] | 0, f[(b + 76) >> 2] | 0)
                f[(a + 92) >> 2] = f[(b + 84) >> 2]
                qg((a + 96) | 0, f[(b + 88) >> 2] | 0, f[(b + 92) >> 2] | 0)
                return
            }
        }
        function gh(a, b, c, d, e) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0
            g = f[((f[((f[(d + 4) >> 2] | 0) + 8) >> 2] | 0) + (c << 2)) >> 2] | 0
            if ((b | 0) == -1) h = Ki(c, d) | 0
            else h = b
            if ((h | 0) == -2) i = 0
            else {
                do
                    if ((Qa[f[((f[d >> 2] | 0) + 8) >> 2] & 127](d) | 0) == 1) {
                        Hf(a, d, h, c, e, 514)
                        if (!(f[a >> 2] | 0)) {
                            f[a >> 2] = 0
                            break
                        } else return
                    }
                while (0)
                c = dn(44) | 0
                f[c >> 2] = 1528
                f[(c + 4) >> 2] = g
                g = (c + 8) | 0
                f[g >> 2] = f[e >> 2]
                f[(g + 4) >> 2] = f[(e + 4) >> 2]
                f[(g + 8) >> 2] = f[(e + 8) >> 2]
                f[(g + 12) >> 2] = f[(e + 12) >> 2]
                f[(g + 16) >> 2] = f[(e + 16) >> 2]
                f[(g + 20) >> 2] = f[(e + 20) >> 2]
                _j((c + 32) | 0, (e + 24) | 0)
                f[c >> 2] = 1584
                i = c
            }
            f[a >> 2] = i
            return
        }
        function hh(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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
            e = u
            u = (u + 224) | 0
            g = (e + 120) | 0
            h = (e + 80) | 0
            i = e
            j = (e + 136) | 0
            k = h
            l = (k + 40) | 0
            do {
                f[k >> 2] = 0
                k = (k + 4) | 0
            } while ((k | 0) < (l | 0))
            f[g >> 2] = f[d >> 2]
            if ((qb(0, c, g, i, h) | 0) < 0) m = -1
            else {
                if ((f[(a + 76) >> 2] | 0) > -1) n = gr(a) | 0
                else n = 0
                d = f[a >> 2] | 0
                k = d & 32
                if ((b[(a + 74) >> 0] | 0) < 1) f[a >> 2] = d & -33
                d = (a + 48) | 0
                if (!(f[d >> 2] | 0)) {
                    l = (a + 44) | 0
                    o = f[l >> 2] | 0
                    f[l >> 2] = j
                    p = (a + 28) | 0
                    f[p >> 2] = j
                    q = (a + 20) | 0
                    f[q >> 2] = j
                    f[d >> 2] = 80
                    r = (a + 16) | 0
                    f[r >> 2] = j + 80
                    j = qb(a, c, g, i, h) | 0
                    if (!o) s = j
                    else {
                        Sa[f[(a + 36) >> 2] & 31](a, 0, 0) | 0
                        t = (f[q >> 2] | 0) == 0 ? -1 : j
                        f[l >> 2] = o
                        f[d >> 2] = 0
                        f[r >> 2] = 0
                        f[p >> 2] = 0
                        f[q >> 2] = 0
                        s = t
                    }
                } else s = qb(a, c, g, i, h) | 0
                h = f[a >> 2] | 0
                f[a >> 2] = h | k
                if (n | 0) fr(a)
                m = ((h & 32) | 0) == 0 ? s : -1
            }
            u = e
            return m | 0
        }
        function ih(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0
            d = u
            u = (u + 16) | 0
            e = d
            if (!(fn(a, b, c) | 0)) {
                g = 0
                u = d
                return g | 0
            }
            if (((Qa[f[((f[a >> 2] | 0) + 32) >> 2] & 127](a) | 0) << 24) >> 24 == 1 ? (((f[((f[(a + 8) >> 2] | 0) + 28) >> 2] | 0) + -1) | 0) >>> 0 >= 6 : 0) {
                g = 0
                u = d
                return g | 0
            }
            h = Gg(c, f[(b + 48) >> 2] | 0) | 0
            Xa[f[((f[a >> 2] | 0) + 48) >> 2] & 15](e, a, h)
            h = (a + 36) | 0
            b = f[e >> 2] | 0
            f[e >> 2] = 0
            c = f[h >> 2] | 0
            f[h >> 2] = b
            if (!c) {
                f[e >> 2] = 0
                i = b
            } else {
                Va[f[((f[c >> 2] | 0) + 4) >> 2] & 127](c)
                c = f[e >> 2] | 0
                f[e >> 2] = 0
                if (c | 0) Va[f[((f[c >> 2] | 0) + 4) >> 2] & 127](c)
                i = f[h >> 2] | 0
            }
            if (!i) {
                g = 1
                u = d
                return g | 0
            }
            if (Ra[f[((f[a >> 2] | 0) + 36) >> 2] & 127](a, i) | 0) {
                g = 1
                u = d
                return g | 0
            }
            i = f[h >> 2] | 0
            f[h >> 2] = 0
            if (!i) {
                g = 1
                u = d
                return g | 0
            }
            Va[f[((f[i >> 2] | 0) + 4) >> 2] & 127](i)
            g = 1
            u = d
            return g | 0
        }
        function jh(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0
            c = (a + 4) | 0
            d = f[c >> 2] | 0
            e = f[a >> 2] | 0
            g = (d - e) >> 2
            h = d
            if (g >>> 0 < b >>> 0) {
                hf(a, (b - g) | 0)
                return
            }
            if (g >>> 0 <= b >>> 0) return
            g = (e + (b << 2)) | 0
            if ((g | 0) == (h | 0)) return
            else i = h
            do {
                h = (i + -4) | 0
                f[c >> 2] = h
                b = f[h >> 2] | 0
                f[h >> 2] = 0
                if (b | 0) {
                    h = (b + 88) | 0
                    e = f[h >> 2] | 0
                    f[h >> 2] = 0
                    if (e | 0) {
                        h = f[(e + 8) >> 2] | 0
                        if (h | 0) {
                            a = (e + 12) | 0
                            if ((f[a >> 2] | 0) != (h | 0)) f[a >> 2] = h
                            br(h)
                        }
                        br(e)
                    }
                    e = f[(b + 68) >> 2] | 0
                    if (e | 0) {
                        h = (b + 72) | 0
                        a = f[h >> 2] | 0
                        if ((a | 0) != (e | 0)) f[h >> 2] = a + (~(((a + -4 - e) | 0) >>> 2) << 2)
                        br(e)
                    }
                    e = (b + 64) | 0
                    a = f[e >> 2] | 0
                    f[e >> 2] = 0
                    if (a | 0) {
                        e = f[a >> 2] | 0
                        if (e | 0) {
                            h = (a + 4) | 0
                            if ((f[h >> 2] | 0) != (e | 0)) f[h >> 2] = e
                            br(e)
                        }
                        br(a)
                    }
                    br(b)
                }
                i = f[c >> 2] | 0
            } while ((i | 0) != (g | 0))
            return
        }
        function kh(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            d = (a + 8) | 0
            e = f[d >> 2] | 0
            g = (a + 4) | 0
            h = f[g >> 2] | 0
            i = h
            if (((e - h) >> 2) >>> 0 >= b >>> 0) {
                j = b
                k = i
                while (1) {
                    f[k >> 2] = f[c >> 2]
                    j = (j + -1) | 0
                    if (!j) break
                    else k = (k + 4) | 0
                }
                f[g >> 2] = i + (b << 2)
                return
            }
            i = f[a >> 2] | 0
            k = (h - i) | 0
            h = k >> 2
            j = (h + b) | 0
            if (j >>> 0 > 1073741823) mq(a)
            l = (e - i) | 0
            e = l >> 1
            m = (l >> 2) >>> 0 < 536870911 ? (e >>> 0 < j >>> 0 ? j : e) : 1073741823
            do
                if (m)
                    if (m >>> 0 > 1073741823) {
                        e = ra(8) | 0
                        Wo(e, 14941)
                        f[e >> 2] = 6944
                        va(e | 0, 1080, 114)
                    } else {
                        e = dn(m << 2) | 0
                        n = e
                        o = e
                        break
                    }
                else {
                    n = 0
                    o = 0
                }
            while (0)
            e = (n + (h << 2)) | 0
            h = (n + (m << 2)) | 0
            m = b
            j = e
            while (1) {
                f[j >> 2] = f[c >> 2]
                m = (m + -1) | 0
                if (!m) break
                else j = (j + 4) | 0
            }
            if ((k | 0) > 0) Rg(o | 0, i | 0, k | 0) | 0
            f[a >> 2] = n
            f[g >> 2] = e + (b << 2)
            f[d >> 2] = h
            if (!i) return
            br(i)
            return
        }
        function lh(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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
            e = ((f[a >> 2] | 0) + 1794895138) | 0
            g = rp(f[(a + 8) >> 2] | 0, e) | 0
            h = rp(f[(a + 12) >> 2] | 0, e) | 0
            i = rp(f[(a + 16) >> 2] | 0, e) | 0
            a: do
                if ((g >>> 0 < (c >>> 2) >>> 0 ? ((j = (c - (g << 2)) | 0), (h >>> 0 < j >>> 0) & (i >>> 0 < j >>> 0)) : 0) ? (((i | h) & 3) | 0) == 0 : 0) {
                    j = h >>> 2
                    k = i >>> 2
                    l = 0
                    m = g
                    while (1) {
                        n = m >>> 1
                        o = (l + n) | 0
                        p = o << 1
                        q = (p + j) | 0
                        r = rp(f[(a + (q << 2)) >> 2] | 0, e) | 0
                        s = rp(f[(a + ((q + 1) << 2)) >> 2] | 0, e) | 0
                        if (!((s >>> 0 < c >>> 0) & (r >>> 0 < ((c - s) | 0) >>> 0))) {
                            t = 0
                            break a
                        }
                        if (b[(a + (s + r)) >> 0] | 0) {
                            t = 0
                            break a
                        }
                        r = bl(d, (a + s) | 0) | 0
                        if (!r) break
                        s = (r | 0) < 0
                        if ((m | 0) == 1) {
                            t = 0
                            break a
                        } else {
                            l = s ? l : o
                            m = s ? n : (m - n) | 0
                        }
                    }
                    m = (p + k) | 0
                    l = rp(f[(a + (m << 2)) >> 2] | 0, e) | 0
                    j = rp(f[(a + ((m + 1) << 2)) >> 2] | 0, e) | 0
                    if ((j >>> 0 < c >>> 0) & (l >>> 0 < ((c - j) | 0) >>> 0)) t = (b[(a + (j + l)) >> 0] | 0) == 0 ? (a + j) | 0 : 0
                    else t = 0
                } else t = 0
            while (0)
            return t | 0
        }
        function mh(a, c, e, g) {
            a = a | 0
            c = c | 0
            e = e | 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
            h = u
            u = (u + 64) | 0
            i = h
            j = f[a >> 2] | 0
            k = (a + (f[(j + -8) >> 2] | 0)) | 0
            l = f[(j + -4) >> 2] | 0
            f[i >> 2] = e
            f[(i + 4) >> 2] = a
            f[(i + 8) >> 2] = c
            f[(i + 12) >> 2] = g
            g = (i + 16) | 0
            c = (i + 20) | 0
            a = (i + 24) | 0
            j = (i + 28) | 0
            m = (i + 32) | 0
            n = (i + 40) | 0
            o = g
            p = (o + 36) | 0
            do {
                f[o >> 2] = 0
                o = (o + 4) | 0
            } while ((o | 0) < (p | 0))
            d[(g + 36) >> 1] = 0
            b[(g + 38) >> 0] = 0
            a: do
                if (qp(l, e, 0) | 0) {
                    f[(i + 48) >> 2] = 1
                    _a[f[((f[l >> 2] | 0) + 20) >> 2] & 3](l, i, k, k, 1, 0)
                    q = (f[a >> 2] | 0) == 1 ? k : 0
                } else {
                    Za[f[((f[l >> 2] | 0) + 24) >> 2] & 3](l, i, k, 1, 0)
                    switch (f[(i + 36) >> 2] | 0) {
                        case 0: {
                            q = ((f[n >> 2] | 0) == 1) & ((f[j >> 2] | 0) == 1) & ((f[m >> 2] | 0) == 1) ? f[c >> 2] | 0 : 0
                            break a
                            break
                        }
                        case 1:
                            break
                        default: {
                            q = 0
                            break a
                        }
                    }
                    if ((f[a >> 2] | 0) != 1 ? !(((f[n >> 2] | 0) == 0) & ((f[j >> 2] | 0) == 1) & ((f[m >> 2] | 0) == 1)) : 0) {
                        q = 0
                        break
                    }
                    q = f[g >> 2] | 0
                }
            while (0)
            u = h
            return q | 0
        }
        function nh(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            c = (a + 8) | 0
            d = f[c >> 2] | 0
            e = (a + 4) | 0
            g = f[e >> 2] | 0
            h = g
            if (((d - g) >> 2) >>> 0 >= b >>> 0) {
                i = b
                j = h
                while (1) {
                    f[j >> 2] = 1
                    i = (i + -1) | 0
                    if (!i) break
                    else j = (j + 4) | 0
                }
                f[e >> 2] = h + (b << 2)
                return
            }
            h = f[a >> 2] | 0
            j = (g - h) | 0
            g = j >> 2
            i = (g + b) | 0
            if (i >>> 0 > 1073741823) mq(a)
            k = (d - h) | 0
            d = k >> 1
            l = (k >> 2) >>> 0 < 536870911 ? (d >>> 0 < i >>> 0 ? i : d) : 1073741823
            do
                if (l)
                    if (l >>> 0 > 1073741823) {
                        d = ra(8) | 0
                        Wo(d, 14941)
                        f[d >> 2] = 6944
                        va(d | 0, 1080, 114)
                    } else {
                        d = dn(l << 2) | 0
                        m = d
                        n = d
                        break
                    }
                else {
                    m = 0
                    n = 0
                }
            while (0)
            d = (m + (g << 2)) | 0
            g = (m + (l << 2)) | 0
            l = b
            i = d
            while (1) {
                f[i >> 2] = 1
                l = (l + -1) | 0
                if (!l) break
                else i = (i + 4) | 0
            }
            if ((j | 0) > 0) Rg(n | 0, h | 0, j | 0) | 0
            f[a >> 2] = m
            f[e >> 2] = d + (b << 2)
            f[c >> 2] = g
            if (!h) return
            br(h)
            return
        }
        function oh(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            d = u
            u = (u + 16) | 0
            e = d
            if (!c) {
                g = 0
                u = d
                return g | 0
            }
            h = (a + 84) | 0
            i = f[h >> 2] | 0
            j = (a + 88) | 0
            k = f[j >> 2] | 0
            if ((k | 0) != (i | 0)) f[j >> 2] = k + (~(((k + -4 - i) | 0) >>> 2) << 2)
            f[h >> 2] = 0
            f[j >> 2] = 0
            f[(a + 92) >> 2] = 0
            if (i | 0) br(i)
            i = (a + 72) | 0
            j = f[i >> 2] | 0
            h = (a + 76) | 0
            if ((f[h >> 2] | 0) != (j | 0)) f[h >> 2] = j
            f[i >> 2] = 0
            f[h >> 2] = 0
            f[(a + 80) >> 2] = 0
            if (j | 0) br(j)
            j = (c + 4) | 0
            h = ((f[j >> 2] | 0) - (f[c >> 2] | 0)) >> 2
            b[e >> 0] = 0
            Xg(a, h, e)
            h = (c + 24) | 0
            i = (c + 28) | 0
            k = ((f[i >> 2] | 0) - (f[h >> 2] | 0)) >> 2
            b[e >> 0] = 0
            Xg((a + 12) | 0, k, e)
            Sf((a + 28) | 0, ((f[j >> 2] | 0) - (f[c >> 2] | 0)) >> 2, 5868)
            $j((a + 52) | 0, ((f[i >> 2] | 0) - (f[h >> 2] | 0)) >> 2)
            $j((a + 40) | 0, ((f[i >> 2] | 0) - (f[h >> 2] | 0)) >> 2)
            f[(a + 64) >> 2] = c
            b[(a + 24) >> 0] = 1
            g = 1
            u = d
            return g | 0
        }
        function ph(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0
            c = (a + 12) | 0
            d = f[a >> 2] | 0
            e = (a + 8) | 0
            g = f[e >> 2] | 0
            h = (g | 0) == -1
            if (!(b[c >> 0] | 0)) {
                do
                    if ((!h ? ((i = ((((g >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + g) | 0), (i | 0) != -1) : 0) ? ((j = f[((f[(d + 12) >> 2] | 0) + (i << 2)) >> 2] | 0), (j | 0) != -1) : 0)
                        if (!((j >>> 0) % 3 | 0)) {
                            k = (j + 2) | 0
                            break
                        } else {
                            k = (j + -1) | 0
                            break
                        }
                    else k = -1
                while (0)
                f[e >> 2] = k
                return
            }
            k = (g + 1) | 0
            if ((!h ? ((h = ((k >>> 0) % 3 | 0 | 0) == 0 ? (g + -2) | 0 : k), (h | 0) != -1) : 0) ? ((k = f[((f[(d + 12) >> 2] | 0) + (h << 2)) >> 2] | 0), (h = (k + 1) | 0), (k | 0) != -1) : 0) {
                g = ((h >>> 0) % 3 | 0 | 0) == 0 ? (k + -2) | 0 : h
                f[e >> 2] = g
                if ((g | 0) != -1) {
                    if ((g | 0) != (f[(a + 4) >> 2] | 0)) return
                    f[e >> 2] = -1
                    return
                }
            } else f[e >> 2] = -1
            g = f[(a + 4) >> 2] | 0
            do
                if (((g | 0) != -1 ? ((a = ((((g >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + g) | 0), (a | 0) != -1) : 0) ? ((h = f[((f[(d + 12) >> 2] | 0) + (a << 2)) >> 2] | 0), (h | 0) != -1) : 0)
                    if (!((h >>> 0) % 3 | 0)) {
                        l = (h + 2) | 0
                        break
                    } else {
                        l = (h + -1) | 0
                        break
                    }
                else l = -1
            while (0)
            f[e >> 2] = l
            b[c >> 0] = 0
            return
        }
        function qh(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = Oa,
                e = 0,
                g = 0
            if ((b | 0) != 1)
                if (!((b + -1) & b)) c = b
                else c = cb(b) | 0
            else c = 2
            b = f[(a + 4) >> 2] | 0
            if (c >>> 0 > b >>> 0) {
                Id(a, c)
                return
            }
            if (c >>> 0 >= b >>> 0) return
            d = $((f[(a + 12) >> 2] | 0) >>> 0)
            e = ~~$(W($(d / $(n[(a + 20) >> 2])))) >>> 0
            if ((b >>> 0 > 2) & ((((b + -1) & b) | 0) == 0)) g = 1 << (32 - (_((e + -1) | 0) | 0))
            else g = cb(e) | 0
            e = c >>> 0 < g >>> 0 ? g : c
            if (e >>> 0 >= b >>> 0) return
            Id(a, e)
            return
        }
        function rh(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            e = u
            u = (u + 48) | 0
            g = e
            h = (e + 32) | 0
            i = (a + 4) | 0
            j = f[i >> 2] | 0
            if (!j) {
                k = 0
                u = e
                return k | 0
            }
            do
                if (c)
                    if (Qa[f[((f[j >> 2] | 0) + 16) >> 2] & 127](j) | 0) {
                        l = f[i >> 2] | 0
                        Va[f[((f[l >> 2] | 0) + 20) >> 2] & 127](l)
                        break
                    } else {
                        k = 0
                        u = e
                        return k | 0
                    }
            while (0)
            Cn(g)
            Si(h, f[a >> 2] | 0, g)
            a = (f[h >> 2] | 0) == 0
            i = (h + 4) | 0
            if ((b[(i + 11) >> 0] | 0) < 0) br(f[i >> 2] | 0)
            if (a) {
                a = f[g >> 2] | 0
                i = (g + 4) | 0
                ag(d, a, (a + ((f[i >> 2] | 0) - a)) | 0)
                m = ((f[i >> 2] | 0) - (f[g >> 2] | 0)) | 0
            } else m = 0
            i = (g + 12) | 0
            a = f[i >> 2] | 0
            f[i >> 2] = 0
            if (a | 0) br(a)
            a = f[g >> 2] | 0
            if (a | 0) {
                i = (g + 4) | 0
                if ((f[i >> 2] | 0) != (a | 0)) f[i >> 2] = a
                br(a)
            }
            k = m
            u = e
            return k | 0
        }
        function sh(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            d = f[(a + 4) >> 2] | 0
            if (!d) {
                e = 0
                return e | 0
            }
            a = b[(c + 11) >> 0] | 0
            g = (a << 24) >> 24 < 0
            h = g ? f[(c + 4) >> 2] | 0 : a & 255
            a = g ? f[c >> 2] | 0 : c
            c = d
            while (1) {
                d = (c + 16) | 0
                g = b[(d + 11) >> 0] | 0
                i = (g << 24) >> 24 < 0
                j = i ? f[(c + 20) >> 2] | 0 : g & 255
                g = j >>> 0 < h >>> 0
                k = g ? j : h
                if ((k | 0) != 0 ? ((l = Pk(a, i ? f[d >> 2] | 0 : d, k) | 0), (l | 0) != 0) : 0)
                    if ((l | 0) < 0) m = 7
                    else m = 8
                else if (h >>> 0 < j >>> 0) m = 7
                else m = 8
                if ((m | 0) == 7) {
                    m = 0
                    n = c
                } else if ((m | 0) == 8) {
                    m = 0
                    l = h >>> 0 < j >>> 0 ? h : j
                    if ((l | 0) != 0 ? ((j = Pk(i ? f[d >> 2] | 0 : d, a, l) | 0), (j | 0) != 0) : 0) {
                        if ((j | 0) >= 0) {
                            e = 1
                            m = 14
                            break
                        }
                    } else m = 10
                    if ((m | 0) == 10 ? ((m = 0), !g) : 0) {
                        e = 1
                        m = 14
                        break
                    }
                    n = (c + 4) | 0
                }
                c = f[n >> 2] | 0
                if (!c) {
                    e = 0
                    m = 14
                    break
                }
            }
            if ((m | 0) == 14) return e | 0
            return 0
        }
        function th(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            c = u
            u = (u + 16) | 0
            d = (c + 12) | 0
            e = (c + 8) | 0
            g = (c + 4) | 0
            h = c
            i = (a + 4) | 0
            j = (i | 0) == (b | 0)
            if (!j) {
                f[g >> 2] = f[b >> 2]
                f[h >> 2] = b + 4
                f[e >> 2] = f[g >> 2]
                f[d >> 2] = f[h >> 2]
                Hc(i, e, d)
            }
            if (!j) {
                f[g >> 2] = f[(b + 12) >> 2]
                f[h >> 2] = b + 16
                f[e >> 2] = f[g >> 2]
                f[d >> 2] = f[h >> 2]
                Ac((a + 16) | 0, e, d)
            }
            if (j) {
                u = c
                return
            }
            f[g >> 2] = f[(b + 24) >> 2]
            f[h >> 2] = b + 28
            f[e >> 2] = f[g >> 2]
            f[d >> 2] = f[h >> 2]
            Hc((a + 28) | 0, e, d)
            u = c
            return
        }
        function uh(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0
            e = u
            u = (u + 16) | 0
            g = (e + 4) | 0
            h = e
            di(g, a, b, c, d)
            d = f[g >> 2] | 0
            if (!d) {
                i = -1
                f[g >> 2] = 0
                u = e
                return i | 0
            }
            f[g >> 2] = 0
            f[h >> 2] = d
            d = ah(a, h) | 0
            a = f[h >> 2] | 0
            f[h >> 2] = 0
            if (!a) {
                i = d
                f[g >> 2] = 0
                u = e
                return i | 0
            }
            h = (a + 88) | 0
            c = f[h >> 2] | 0
            f[h >> 2] = 0
            if (c | 0) {
                h = f[(c + 8) >> 2] | 0
                if (h | 0) {
                    b = (c + 12) | 0
                    if ((f[b >> 2] | 0) != (h | 0)) f[b >> 2] = h
                    br(h)
                }
                br(c)
            }
            c = f[(a + 68) >> 2] | 0
            if (c | 0) {
                h = (a + 72) | 0
                b = f[h >> 2] | 0
                if ((b | 0) != (c | 0)) f[h >> 2] = b + (~(((b + -4 - c) | 0) >>> 2) << 2)
                br(c)
            }
            c = (a + 64) | 0
            b = f[c >> 2] | 0
            f[c >> 2] = 0
            if (b | 0) {
                c = f[b >> 2] | 0
                if (c | 0) {
                    h = (b + 4) | 0
                    if ((f[h >> 2] | 0) != (c | 0)) f[h >> 2] = c
                    br(c)
                }
                br(b)
            }
            br(a)
            i = d
            f[g >> 2] = 0
            u = e
            return i | 0
        }
        function vh(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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
            e = u
            u = (u + 16) | 0
            g = (e + 4) | 0
            h = e
            i = f[(a + 8) >> 2] | 0
            j = (i + 24) | 0
            k = b[j >> 0] | 0
            l = (c + 4) | 0
            Nf(a, ((f[l >> 2] | 0) - (f[c >> 2] | 0)) >> 2, k, d)
            d = f[(a + 32) >> 2] | 0
            a = ((f[f[d >> 2] >> 2] | 0) + (f[(d + 48) >> 2] | 0)) | 0
            d = f[c >> 2] | 0
            c = f[l >> 2] | 0
            if ((d | 0) == (c | 0)) {
                m = 1
                u = e
                return m | 0
            }
            l = (i + 84) | 0
            n = (i + 68) | 0
            o = 0
            p = d
            while (1) {
                d = f[p >> 2] | 0
                if (!(b[l >> 0] | 0)) q = f[((f[n >> 2] | 0) + (d << 2)) >> 2] | 0
                else q = d
                f[h >> 2] = q
                d = b[j >> 0] | 0
                f[g >> 2] = f[h >> 2]
                if (!(Pb(i, g, d, (a + (o << 2)) | 0) | 0)) {
                    m = 0
                    r = 7
                    break
                }
                p = (p + 4) | 0
                if ((p | 0) == (c | 0)) {
                    m = 1
                    r = 7
                    break
                } else o = (o + k) | 0
            }
            if ((r | 0) == 7) {
                u = e
                return m | 0
            }
            return 0
        }
        function wh(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0
            f[a >> 2] = 1392
            b = (a + 72) | 0
            c = f[b >> 2] | 0
            f[b >> 2] = 0
            if (c | 0) Va[f[((f[c >> 2] | 0) + 4) >> 2] & 127](c)
            c = f[(a + 60) >> 2] | 0
            if (c | 0) {
                b = (a + 64) | 0
                d = f[b >> 2] | 0
                if ((d | 0) != (c | 0)) f[b >> 2] = d + (~(((d + -4 - c) | 0) >>> 2) << 2)
                br(c)
            }
            c = f[(a + 48) >> 2] | 0
            if (c | 0) br(c)
            c = (a + 36) | 0
            d = f[c >> 2] | 0
            if (d | 0) {
                b = (a + 40) | 0
                e = f[b >> 2] | 0
                if ((e | 0) == (d | 0)) g = d
                else {
                    h = e
                    do {
                        e = (h + -4) | 0
                        f[b >> 2] = e
                        i = f[e >> 2] | 0
                        f[e >> 2] = 0
                        if (i | 0) Va[f[((f[i >> 2] | 0) + 4) >> 2] & 127](i)
                        h = f[b >> 2] | 0
                    } while ((h | 0) != (d | 0))
                    g = f[c >> 2] | 0
                }
                br(g)
            }
            f[a >> 2] = 1216
            g = f[(a + 16) >> 2] | 0
            if (g | 0) {
                c = (a + 20) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (g | 0)) f[c >> 2] = d + (~(((d + -4 - g) | 0) >>> 2) << 2)
                br(g)
            }
            g = f[(a + 4) >> 2] | 0
            if (!g) return
            d = (a + 8) | 0
            a = f[d >> 2] | 0
            if ((a | 0) != (g | 0)) f[d >> 2] = a + (~(((a + -4 - g) | 0) >>> 2) << 2)
            br(g)
            return
        }
        function xh(a) {
            a = a | 0
            tj((a + 992) | 0)
            tj((a + 960) | 0)
            tj((a + 928) | 0)
            tj((a + 896) | 0)
            tj((a + 864) | 0)
            tj((a + 832) | 0)
            tj((a + 800) | 0)
            tj((a + 768) | 0)
            tj((a + 736) | 0)
            tj((a + 704) | 0)
            tj((a + 672) | 0)
            tj((a + 640) | 0)
            tj((a + 608) | 0)
            tj((a + 576) | 0)
            tj((a + 544) | 0)
            tj((a + 512) | 0)
            tj((a + 480) | 0)
            tj((a + 448) | 0)
            tj((a + 416) | 0)
            tj((a + 384) | 0)
            tj((a + 352) | 0)
            tj((a + 320) | 0)
            tj((a + 288) | 0)
            tj((a + 256) | 0)
            tj((a + 224) | 0)
            tj((a + 192) | 0)
            tj((a + 160) | 0)
            tj((a + 128) | 0)
            tj((a + 96) | 0)
            tj((a + 64) | 0)
            tj((a + 32) | 0)
            tj(a)
            return
        }
        function yh(a) {
            a = a | 0
            rn(a)
            rn((a + 32) | 0)
            rn((a + 64) | 0)
            rn((a + 96) | 0)
            rn((a + 128) | 0)
            rn((a + 160) | 0)
            rn((a + 192) | 0)
            rn((a + 224) | 0)
            rn((a + 256) | 0)
            rn((a + 288) | 0)
            rn((a + 320) | 0)
            rn((a + 352) | 0)
            rn((a + 384) | 0)
            rn((a + 416) | 0)
            rn((a + 448) | 0)
            rn((a + 480) | 0)
            rn((a + 512) | 0)
            rn((a + 544) | 0)
            rn((a + 576) | 0)
            rn((a + 608) | 0)
            rn((a + 640) | 0)
            rn((a + 672) | 0)
            rn((a + 704) | 0)
            rn((a + 736) | 0)
            rn((a + 768) | 0)
            rn((a + 800) | 0)
            rn((a + 832) | 0)
            rn((a + 864) | 0)
            rn((a + 896) | 0)
            rn((a + 928) | 0)
            rn((a + 960) | 0)
            rn((a + 992) | 0)
            return
        }
        function zh(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            a = u
            u = (u + 16) | 0
            e = a
            if (((c | 0) < 0) | (((b | 0) == 0) | ((d | 0) == 0))) {
                g = 0
                u = a
                return g | 0
            }
            h = f[(b + 8) >> 2] | 0
            if (((((f[(b + 12) >> 2] | 0) - h) >> 2) | 0) <= (c | 0)) {
                g = 0
                u = a
                return g | 0
            }
            i = (b + 4) | 0
            if (!(f[i >> 2] | 0)) {
                j = dn(52) | 0
                f[j >> 2] = 0
                f[(j + 4) >> 2] = 0
                f[(j + 8) >> 2] = 0
                f[(j + 12) >> 2] = 0
                n[(j + 16) >> 2] = $(1.0)
                k = (j + 20) | 0
                f[k >> 2] = 0
                f[(k + 4) >> 2] = 0
                f[(k + 8) >> 2] = 0
                f[(k + 12) >> 2] = 0
                n[(j + 36) >> 2] = $(1.0)
                f[(j + 40) >> 2] = 0
                f[(j + 44) >> 2] = 0
                f[(j + 48) >> 2] = 0
                f[(b + 4) >> 2] = j
            }
            j = f[((f[(h + (c << 2)) >> 2] | 0) + 60) >> 2] | 0
            c = dn(44) | 0
            Ub(c, d)
            f[(c + 40) >> 2] = j
            j = f[i >> 2] | 0
            f[e >> 2] = c
            gk(j, e) | 0
            j = f[e >> 2] | 0
            f[e >> 2] = 0
            if (!j) {
                g = 1
                u = a
                return g | 0
            }
            Qi(j)
            br(j)
            g = 1
            u = a
            return g | 0
        }
        function Ah(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            f[a >> 2] = d
            e = (a + 24) | 0
            g = (a + 28) | 0
            h = f[g >> 2] | 0
            i = f[e >> 2] | 0
            j = (h - i) >> 2
            k = i
            i = h
            if (j >>> 0 >= d >>> 0) {
                if (j >>> 0 > d >>> 0 ? ((h = (k + (d << 2)) | 0), (h | 0) != (i | 0)) : 0) f[g >> 2] = i + (~(((i + -4 - h) | 0) >>> 2) << 2)
            } else oi(e, (d - j) | 0)
            if (!c) return
            j = f[b >> 2] | 0
            if ((c | 0) > 1) {
                d = j
                e = j
                h = 1
                while (1) {
                    i = f[(b + (h << 2)) >> 2] | 0
                    g = (i | 0) < (e | 0)
                    k = g ? i : e
                    l = g ? d : (i | 0) > (d | 0) ? i : d
                    h = (h + 1) | 0
                    if ((h | 0) == (c | 0)) {
                        m = l
                        n = k
                        break
                    } else {
                        d = l
                        e = k
                    }
                }
            } else {
                m = j
                n = j
            }
            f[(a + 4) >> 2] = n
            f[(a + 8) >> 2] = m
            j = Vn(m | 0, ((((m | 0) < 0) << 31) >> 31) | 0, n | 0, ((((n | 0) < 0) << 31) >> 31) | 0) | 0
            n = I
            if (!((n >>> 0 < 0) | (((n | 0) == 0) & (j >>> 0 < 2147483647)))) return
            n = (j + 1) | 0
            f[(a + 12) >> 2] = n
            j = ((n | 0) / 2) | 0
            m = (a + 16) | 0
            f[m >> 2] = j
            f[(a + 20) >> 2] = 0 - j
            if ((n & 1) | 0) return
            f[m >> 2] = j + -1
            return
        }
        function Bh(a, c, d, e, g, h, i) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            h = h | 0
            i = i | 0
            var j = 0,
                k = 0
            c = u
            u = (u + 64) | 0
            j = c
            k = i ? 6 : 5
            Al(j)
            i = f[(h + 56) >> 2] | 0
            h = X(Ll(k) | 0, e) | 0
            yj(j, i, 0, e & 255, k, 0, h, (((h | 0) < 0) << 31) >> 31, 0, 0)
            h = dn(96) | 0
            nl(h, j)
            f[a >> 2] = h
            pj(h, d) | 0
            d = (h + 84) | 0
            if (!g) {
                b[d >> 0] = 1
                a = f[(h + 68) >> 2] | 0
                j = (h + 72) | 0
                k = f[j >> 2] | 0
                if ((k | 0) == (a | 0)) {
                    u = c
                    return
                }
                f[j >> 2] = k + (~(((k + -4 - a) | 0) >>> 2) << 2)
                u = c
                return
            }
            b[d >> 0] = 0
            d = (h + 68) | 0
            a = (h + 72) | 0
            h = f[a >> 2] | 0
            k = f[d >> 2] | 0
            j = (h - k) >> 2
            e = h
            if (j >>> 0 < g >>> 0) {
                kh(d, (g - j) | 0, 1200)
                u = c
                return
            }
            if (j >>> 0 <= g >>> 0) {
                u = c
                return
            }
            j = (k + (g << 2)) | 0
            if ((j | 0) == (e | 0)) {
                u = c
                return
            }
            f[a >> 2] = e + (~(((e + -4 - j) | 0) >>> 2) << 2)
            u = c
            return
        }
        function Ch(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = Oa,
                e = 0,
                g = 0
            if ((b | 0) != 1)
                if (!((b + -1) & b)) c = b
                else c = cb(b) | 0
            else c = 2
            b = f[(a + 4) >> 2] | 0
            if (c >>> 0 > b >>> 0) {
                jd(a, c)
                return
            }
            if (c >>> 0 >= b >>> 0) return
            d = $((f[(a + 12) >> 2] | 0) >>> 0)
            e = ~~$(W($(d / $(n[(a + 16) >> 2])))) >>> 0
            if ((b >>> 0 > 2) & ((((b + -1) & b) | 0) == 0)) g = 1 << (32 - (_((e + -1) | 0) | 0))
            else g = cb(e) | 0
            e = c >>> 0 < g >>> 0 ? g : c
            if (e >>> 0 >= b >>> 0) return
            jd(a, e)
            return
        }
        function Dh(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = Oa,
                e = 0,
                g = 0
            if ((b | 0) != 1)
                if (!((b + -1) & b)) c = b
                else c = cb(b) | 0
            else c = 2
            b = f[(a + 4) >> 2] | 0
            if (c >>> 0 > b >>> 0) {
                nd(a, c)
                return
            }
            if (c >>> 0 >= b >>> 0) return
            d = $((f[(a + 12) >> 2] | 0) >>> 0)
            e = ~~$(W($(d / $(n[(a + 16) >> 2])))) >>> 0
            if ((b >>> 0 > 2) & ((((b + -1) & b) | 0) == 0)) g = 1 << (32 - (_((e + -1) | 0) | 0))
            else g = cb(e) | 0
            e = c >>> 0 < g >>> 0 ? g : c
            if (e >>> 0 >= b >>> 0) return
            nd(a, e)
            return
        }
        function Eh(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = Oa,
                e = 0,
                g = 0
            if ((b | 0) != 1)
                if (!((b + -1) & b)) c = b
                else c = cb(b) | 0
            else c = 2
            b = f[(a + 4) >> 2] | 0
            if (c >>> 0 > b >>> 0) {
                ud(a, c)
                return
            }
            if (c >>> 0 >= b >>> 0) return
            d = $((f[(a + 12) >> 2] | 0) >>> 0)
            e = ~~$(W($(d / $(n[(a + 16) >> 2])))) >>> 0
            if ((b >>> 0 > 2) & ((((b + -1) & b) | 0) == 0)) g = 1 << (32 - (_((e + -1) | 0) | 0))
            else g = cb(e) | 0
            e = c >>> 0 < g >>> 0 ? g : c
            if (e >>> 0 >= b >>> 0) return
            ud(a, e)
            return
        }
        function Fh(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = Oa,
                e = 0,
                g = 0
            if ((b | 0) != 1)
                if (!((b + -1) & b)) c = b
                else c = cb(b) | 0
            else c = 2
            b = f[(a + 4) >> 2] | 0
            if (c >>> 0 > b >>> 0) {
                Ed(a, c)
                return
            }
            if (c >>> 0 >= b >>> 0) return
            d = $((f[(a + 12) >> 2] | 0) >>> 0)
            e = ~~$(W($(d / $(n[(a + 16) >> 2])))) >>> 0
            if ((b >>> 0 > 2) & ((((b + -1) & b) | 0) == 0)) g = 1 << (32 - (_((e + -1) | 0) | 0))
            else g = cb(e) | 0
            e = c >>> 0 < g >>> 0 ? g : c
            if (e >>> 0 >= b >>> 0) return
            Ed(a, e)
            return
        }
        function Gh(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = Oa,
                e = 0,
                g = 0
            if ((b | 0) != 1)
                if (!((b + -1) & b)) c = b
                else c = cb(b) | 0
            else c = 2
            b = f[(a + 4) >> 2] | 0
            if (c >>> 0 > b >>> 0) {
                ld(a, c)
                return
            }
            if (c >>> 0 >= b >>> 0) return
            d = $((f[(a + 12) >> 2] | 0) >>> 0)
            e = ~~$(W($(d / $(n[(a + 16) >> 2])))) >>> 0
            if ((b >>> 0 > 2) & ((((b + -1) & b) | 0) == 0)) g = 1 << (32 - (_((e + -1) | 0) | 0))
            else g = cb(e) | 0
            e = c >>> 0 < g >>> 0 ? g : c
            if (e >>> 0 >= b >>> 0) return
            ld(a, e)
            return
        }
        function Hh(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = Oa,
                e = 0,
                g = 0
            if ((b | 0) != 1)
                if (!((b + -1) & b)) c = b
                else c = cb(b) | 0
            else c = 2
            b = f[(a + 4) >> 2] | 0
            if (c >>> 0 > b >>> 0) {
                qd(a, c)
                return
            }
            if (c >>> 0 >= b >>> 0) return
            d = $((f[(a + 12) >> 2] | 0) >>> 0)
            e = ~~$(W($(d / $(n[(a + 16) >> 2])))) >>> 0
            if ((b >>> 0 > 2) & ((((b + -1) & b) | 0) == 0)) g = 1 << (32 - (_((e + -1) | 0) | 0))
            else g = cb(e) | 0
            e = c >>> 0 < g >>> 0 ? g : c
            if (e >>> 0 >= b >>> 0) return
            qd(a, e)
            return
        }
        function Ih(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = Oa,
                e = 0,
                g = 0
            if ((b | 0) != 1)
                if (!((b + -1) & b)) c = b
                else c = cb(b) | 0
            else c = 2
            b = f[(a + 4) >> 2] | 0
            if (c >>> 0 > b >>> 0) {
                yd(a, c)
                return
            }
            if (c >>> 0 >= b >>> 0) return
            d = $((f[(a + 12) >> 2] | 0) >>> 0)
            e = ~~$(W($(d / $(n[(a + 16) >> 2])))) >>> 0
            if ((b >>> 0 > 2) & ((((b + -1) & b) | 0) == 0)) g = 1 << (32 - (_((e + -1) | 0) | 0))
            else g = cb(e) | 0
            e = c >>> 0 < g >>> 0 ? g : c
            if (e >>> 0 >= b >>> 0) return
            yd(a, e)
            return
        }
        function Jh(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = Oa,
                e = 0,
                g = 0
            if ((b | 0) != 1)
                if (!((b + -1) & b)) c = b
                else c = cb(b) | 0
            else c = 2
            b = f[(a + 4) >> 2] | 0
            if (c >>> 0 > b >>> 0) {
                kd(a, c)
                return
            }
            if (c >>> 0 >= b >>> 0) return
            d = $((f[(a + 12) >> 2] | 0) >>> 0)
            e = ~~$(W($(d / $(n[(a + 16) >> 2])))) >>> 0
            if ((b >>> 0 > 2) & ((((b + -1) & b) | 0) == 0)) g = 1 << (32 - (_((e + -1) | 0) | 0))
            else g = cb(e) | 0
            e = c >>> 0 < g >>> 0 ? g : c
            if (e >>> 0 >= b >>> 0) return
            kd(a, e)
            return
        }
        function Kh(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = Oa,
                e = 0,
                g = 0
            if ((b | 0) != 1)
                if (!((b + -1) & b)) c = b
                else c = cb(b) | 0
            else c = 2
            b = f[(a + 4) >> 2] | 0
            if (c >>> 0 > b >>> 0) {
                od(a, c)
                return
            }
            if (c >>> 0 >= b >>> 0) return
            d = $((f[(a + 12) >> 2] | 0) >>> 0)
            e = ~~$(W($(d / $(n[(a + 16) >> 2])))) >>> 0
            if ((b >>> 0 > 2) & ((((b + -1) & b) | 0) == 0)) g = 1 << (32 - (_((e + -1) | 0) | 0))
            else g = cb(e) | 0
            e = c >>> 0 < g >>> 0 ? g : c
            if (e >>> 0 >= b >>> 0) return
            od(a, e)
            return
        }
        function Lh(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = Oa,
                e = 0,
                g = 0
            if ((b | 0) != 1)
                if (!((b + -1) & b)) c = b
                else c = cb(b) | 0
            else c = 2
            b = f[(a + 4) >> 2] | 0
            if (c >>> 0 > b >>> 0) {
                vd(a, c)
                return
            }
            if (c >>> 0 >= b >>> 0) return
            d = $((f[(a + 12) >> 2] | 0) >>> 0)
            e = ~~$(W($(d / $(n[(a + 16) >> 2])))) >>> 0
            if ((b >>> 0 > 2) & ((((b + -1) & b) | 0) == 0)) g = 1 << (32 - (_((e + -1) | 0) | 0))
            else g = cb(e) | 0
            e = c >>> 0 < g >>> 0 ? g : c
            if (e >>> 0 >= b >>> 0) return
            vd(a, e)
            return
        }
        function Mh(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = Oa,
                e = 0,
                g = 0
            if ((b | 0) != 1)
                if (!((b + -1) & b)) c = b
                else c = cb(b) | 0
            else c = 2
            b = f[(a + 4) >> 2] | 0
            if (c >>> 0 > b >>> 0) {
                Fd(a, c)
                return
            }
            if (c >>> 0 >= b >>> 0) return
            d = $((f[(a + 12) >> 2] | 0) >>> 0)
            e = ~~$(W($(d / $(n[(a + 16) >> 2])))) >>> 0
            if ((b >>> 0 > 2) & ((((b + -1) & b) | 0) == 0)) g = 1 << (32 - (_((e + -1) | 0) | 0))
            else g = cb(e) | 0
            e = c >>> 0 < g >>> 0 ? g : c
            if (e >>> 0 >= b >>> 0) return
            Fd(a, e)
            return
        }
        function Nh(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0
            d = u
            u = (u + 16) | 0
            e = (d + 4) | 0
            g = d
            h = (d + 8) | 0
            b[h >> 0] = a & 127
            do
                if (a >>> 0 > 127) {
                    b[h >> 0] = a | 128
                    i = (c + 16) | 0
                    j = f[(i + 4) >> 2] | 0
                    if (((j | 0) > 0) | (((j | 0) == 0) & ((f[i >> 2] | 0) >>> 0 > 0))) {
                        k = 0
                        break
                    } else {
                        f[g >> 2] = f[(c + 4) >> 2]
                        f[e >> 2] = f[g >> 2]
                        ye(c, e, h, (h + 1) | 0) | 0
                        k = Nh(a >>> 7, c) | 0
                        break
                    }
                } else {
                    i = (c + 16) | 0
                    j = f[(i + 4) >> 2] | 0
                    if (((j | 0) > 0) | (((j | 0) == 0) & ((f[i >> 2] | 0) >>> 0 > 0))) {
                        k = 0
                        break
                    }
                    f[g >> 2] = f[(c + 4) >> 2]
                    f[e >> 2] = f[g >> 2]
                    ye(c, e, h, (h + 1) | 0) | 0
                    l = 1
                    u = d
                    return l | 0
                }
            while (0)
            l = k
            u = d
            return l | 0
        }
        function Oh(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0
            d = u
            u = (u + 16) | 0
            e = d
            Be(e, (a + 40) | 0, f[(a + 8) >> 2] | 0, b, c)
            Wi(a, e)
            a = f[e >> 2] | 0
            f[e >> 2] = 0
            if (!a) {
                u = d
                return 1
            }
            e = (a + 88) | 0
            c = f[e >> 2] | 0
            f[e >> 2] = 0
            if (c | 0) {
                e = f[(c + 8) >> 2] | 0
                if (e | 0) {
                    b = (c + 12) | 0
                    if ((f[b >> 2] | 0) != (e | 0)) f[b >> 2] = e
                    br(e)
                }
                br(c)
            }
            c = f[(a + 68) >> 2] | 0
            if (c | 0) {
                e = (a + 72) | 0
                b = f[e >> 2] | 0
                if ((b | 0) != (c | 0)) f[e >> 2] = b + (~(((b + -4 - c) | 0) >>> 2) << 2)
                br(c)
            }
            c = (a + 64) | 0
            b = f[c >> 2] | 0
            f[c >> 2] = 0
            if (b | 0) {
                c = f[b >> 2] | 0
                if (c | 0) {
                    e = (b + 4) | 0
                    if ((f[e >> 2] | 0) != (c | 0)) f[e >> 2] = c
                    br(c)
                }
                br(b)
            }
            br(a)
            u = d
            return 1
        }
        function Ph(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = Oa,
                e = 0,
                g = 0
            if ((b | 0) != 1)
                if (!((b + -1) & b)) c = b
                else c = cb(b) | 0
            else c = 2
            b = f[(a + 4) >> 2] | 0
            if (c >>> 0 > b >>> 0) {
                rd(a, c)
                return
            }
            if (c >>> 0 >= b >>> 0) return
            d = $((f[(a + 12) >> 2] | 0) >>> 0)
            e = ~~$(W($(d / $(n[(a + 16) >> 2])))) >>> 0
            if ((b >>> 0 > 2) & ((((b + -1) & b) | 0) == 0)) g = 1 << (32 - (_((e + -1) | 0) | 0))
            else g = cb(e) | 0
            e = c >>> 0 < g >>> 0 ? g : c
            if (e >>> 0 >= b >>> 0) return
            rd(a, e)
            return
        }
        function Qh(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            e = u
            u = (u + 48) | 0
            g = e
            h = (e + 32) | 0
            if (!c) {
                i = 0
                u = e
                return i | 0
            }
            Cn(g)
            if ((Tl(c, 0) | 0) != -1 ? Qa[f[((f[c >> 2] | 0) + 16) >> 2] & 127](c) | 0 : 0) {
                Va[f[((f[c >> 2] | 0) + 20) >> 2] & 127](c)
                Zf(h, a, c, g)
                c = (f[h >> 2] | 0) == 0
                a = (h + 4) | 0
                if ((b[(a + 11) >> 0] | 0) < 0) br(f[a >> 2] | 0)
                if (c) {
                    c = f[g >> 2] | 0
                    a = (g + 4) | 0
                    ag(d, c, (c + ((f[a >> 2] | 0) - c)) | 0)
                    j = ((f[a >> 2] | 0) - (f[g >> 2] | 0)) | 0
                } else j = 0
            } else j = 0
            a = (g + 12) | 0
            c = f[a >> 2] | 0
            f[a >> 2] = 0
            if (c | 0) br(c)
            c = f[g >> 2] | 0
            if (c | 0) {
                a = (g + 4) | 0
                if ((f[a >> 2] | 0) != (c | 0)) f[a >> 2] = c
                br(c)
            }
            i = j
            u = e
            return i | 0
        }
        function Rh(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0
            d = u
            u = (u + 16) | 0
            e = d
            se(e, (a + 40) | 0, f[(a + 8) >> 2] | 0, b, c)
            Wi(a, e)
            a = f[e >> 2] | 0
            f[e >> 2] = 0
            if (!a) {
                u = d
                return 1
            }
            e = (a + 88) | 0
            c = f[e >> 2] | 0
            f[e >> 2] = 0
            if (c | 0) {
                e = f[(c + 8) >> 2] | 0
                if (e | 0) {
                    b = (c + 12) | 0
                    if ((f[b >> 2] | 0) != (e | 0)) f[b >> 2] = e
                    br(e)
                }
                br(c)
            }
            c = f[(a + 68) >> 2] | 0
            if (c | 0) {
                e = (a + 72) | 0
                b = f[e >> 2] | 0
                if ((b | 0) != (c | 0)) f[e >> 2] = b + (~(((b + -4 - c) | 0) >>> 2) << 2)
                br(c)
            }
            c = (a + 64) | 0
            b = f[c >> 2] | 0
            f[c >> 2] = 0
            if (b | 0) {
                c = f[b >> 2] | 0
                if (c | 0) {
                    e = (b + 4) | 0
                    if ((f[e >> 2] | 0) != (c | 0)) f[e >> 2] = c
                    br(c)
                }
                br(b)
            }
            br(a)
            u = d
            return 1
        }
        function Sh(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            b = f[a >> 2] | 0
            if (!b) return
            c = (a + 4) | 0
            d = f[c >> 2] | 0
            if ((d | 0) == (b | 0)) e = b
            else {
                g = d
                do {
                    d = (g + -4) | 0
                    f[c >> 2] = d
                    h = f[d >> 2] | 0
                    f[d >> 2] = 0
                    if (h | 0) {
                        d = (h + 88) | 0
                        i = f[d >> 2] | 0
                        f[d >> 2] = 0
                        if (i | 0) {
                            d = f[(i + 8) >> 2] | 0
                            if (d | 0) {
                                j = (i + 12) | 0
                                if ((f[j >> 2] | 0) != (d | 0)) f[j >> 2] = d
                                br(d)
                            }
                            br(i)
                        }
                        i = f[(h + 68) >> 2] | 0
                        if (i | 0) {
                            d = (h + 72) | 0
                            j = f[d >> 2] | 0
                            if ((j | 0) != (i | 0)) f[d >> 2] = j + (~(((j + -4 - i) | 0) >>> 2) << 2)
                            br(i)
                        }
                        i = (h + 64) | 0
                        j = f[i >> 2] | 0
                        f[i >> 2] = 0
                        if (j | 0) {
                            i = f[j >> 2] | 0
                            if (i | 0) {
                                d = (j + 4) | 0
                                if ((f[d >> 2] | 0) != (i | 0)) f[d >> 2] = i
                                br(i)
                            }
                            br(j)
                        }
                        br(h)
                    }
                    g = f[c >> 2] | 0
                } while ((g | 0) != (b | 0))
                e = f[a >> 2] | 0
            }
            br(e)
            return
        }
        function Th(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            e = (d | 0) < 0
            do
                if (!b) {
                    if (e) {
                        g = 0
                        return g | 0
                    }
                    h = (a + 4) | 0
                    i = f[h >> 2] | 0
                    j = f[a >> 2] | 0
                    k = (i - j) | 0
                    if (k >>> 0 < c >>> 0) {
                        ri(a, (c - k) | 0)
                        break
                    }
                    if (k >>> 0 > c >>> 0 ? ((k = (j + c) | 0), (k | 0) != (i | 0)) : 0) f[h >> 2] = k
                } else {
                    if (e) {
                        g = 0
                        return g | 0
                    }
                    k = (a + 4) | 0
                    h = f[k >> 2] | 0
                    i = f[a >> 2] | 0
                    j = (h - i) | 0
                    do
                        if ((0 < (d | 0)) | ((0 == (d | 0)) & (j >>> 0 < c >>> 0))) {
                            if (j >>> 0 < c >>> 0) {
                                ri(a, (c - j) | 0)
                                break
                            }
                            if (j >>> 0 > c >>> 0 ? ((l = (i + c) | 0), (l | 0) != (h | 0)) : 0) {
                                f[k >> 2] = l
                                m = 15
                            } else m = 15
                        } else m = 15
                    while (0)
                    if ((m | 0) == 15 ? (c | 0) == 0 : 0) break
                    Xl(f[a >> 2] | 0, b | 0, c | 0) | 0
                }
            while (0)
            c = (a + 24) | 0
            a = c
            b = Tn(f[a >> 2] | 0, f[(a + 4) >> 2] | 0, 1, 0) | 0
            a = c
            f[a >> 2] = b
            f[(a + 4) >> 2] = I
            g = 1
            return g | 0
        }
        function Uh(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0
            d = u
            u = (u + 16) | 0
            e = (d + 4) | 0
            g = d
            h = (d + 8) | 0
            if (!(ve(a, c) | 0)) {
                i = 0
                u = d
                return i | 0
            }
            j = (a + 36) | 0
            k = (a + 40) | 0
            a = f[j >> 2] | 0
            if ((f[k >> 2] | 0) == (a | 0)) {
                i = 1
                u = d
                return i | 0
            }
            l = (c + 16) | 0
            m = (c + 4) | 0
            n = (h + 1) | 0
            o = 0
            p = a
            do {
                a = f[(p + (o << 2)) >> 2] | 0
                q = Qa[f[((f[a >> 2] | 0) + 32) >> 2] & 127](a) | 0
                b[h >> 0] = q
                q = l
                a = f[(q + 4) >> 2] | 0
                if (!(((a | 0) > 0) | (((a | 0) == 0) & ((f[q >> 2] | 0) >>> 0 > 0)))) {
                    f[g >> 2] = f[m >> 2]
                    f[e >> 2] = f[g >> 2]
                    ye(c, e, h, n) | 0
                }
                o = (o + 1) | 0
                p = f[j >> 2] | 0
            } while (o >>> 0 < (((f[k >> 2] | 0) - p) >> 2) >>> 0)
            i = 1
            u = d
            return i | 0
        }
        function Vh(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0
            c = u
            u = (u + 16) | 0
            d = c
            wp(a)
            f[(a + 16) >> 2] = 0
            f[(a + 20) >> 2] = 0
            f[(a + 12) >> 2] = a + 16
            e = (a + 24) | 0
            wp(e)
            f[d >> 2] = 0
            f[(d + 4) >> 2] = 0
            f[(d + 8) >> 2] = 0
            a = dn(32) | 0
            f[d >> 2] = a
            f[(d + 8) >> 2] = -2147483616
            f[(d + 4) >> 2] = 20
            g = a
            h = 13101
            i = (g + 20) | 0
            do {
                b[g >> 0] = b[h >> 0] | 0
                g = (g + 1) | 0
                h = (h + 1) | 0
            } while ((g | 0) < (i | 0))
            b[(a + 20) >> 0] = 0
            Mj(e, d, 1)
            if ((b[(d + 11) >> 0] | 0) < 0) br(f[d >> 2] | 0)
            f[d >> 2] = 0
            f[(d + 4) >> 2] = 0
            f[(d + 8) >> 2] = 0
            a = dn(32) | 0
            f[d >> 2] = a
            f[(d + 8) >> 2] = -2147483616
            f[(d + 4) >> 2] = 22
            g = a
            h = 13122
            i = (g + 22) | 0
            do {
                b[g >> 0] = b[h >> 0] | 0
                g = (g + 1) | 0
                h = (h + 1) | 0
            } while ((g | 0) < (i | 0))
            b[(a + 22) >> 0] = 0
            Mj(e, d, 1)
            if ((b[(d + 11) >> 0] | 0) >= 0) {
                u = c
                return
            }
            br(f[d >> 2] | 0)
            u = c
            return
        }
        function Wh(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0
            b = f[(a + 4) >> 2] | 0
            c = (a + 8) | 0
            d = f[c >> 2] | 0
            if ((d | 0) != (b | 0)) {
                e = d
                do {
                    d = (e + -4) | 0
                    f[c >> 2] = d
                    g = f[d >> 2] | 0
                    f[d >> 2] = 0
                    if (g | 0) {
                        d = (g + 88) | 0
                        h = f[d >> 2] | 0
                        f[d >> 2] = 0
                        if (h | 0) {
                            d = f[(h + 8) >> 2] | 0
                            if (d | 0) {
                                i = (h + 12) | 0
                                if ((f[i >> 2] | 0) != (d | 0)) f[i >> 2] = d
                                br(d)
                            }
                            br(h)
                        }
                        h = f[(g + 68) >> 2] | 0
                        if (h | 0) {
                            d = (g + 72) | 0
                            i = f[d >> 2] | 0
                            if ((i | 0) != (h | 0)) f[d >> 2] = i + (~(((i + -4 - h) | 0) >>> 2) << 2)
                            br(h)
                        }
                        h = (g + 64) | 0
                        i = f[h >> 2] | 0
                        f[h >> 2] = 0
                        if (i | 0) {
                            h = f[i >> 2] | 0
                            if (h | 0) {
                                d = (i + 4) | 0
                                if ((f[d >> 2] | 0) != (h | 0)) f[d >> 2] = h
                                br(h)
                            }
                            br(i)
                        }
                        br(g)
                    }
                    e = f[c >> 2] | 0
                } while ((e | 0) != (b | 0))
            }
            b = f[a >> 2] | 0
            if (!b) return
            br(b)
            return
        }
        function Xh(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            c = u
            u = (u + 16) | 0
            d = (c + 8) | 0
            e = (c + 4) | 0
            g = c
            f[g >> 2] = f[(a + 12) >> 2]
            h = (b + 16) | 0
            i = h
            j = f[i >> 2] | 0
            k = f[(i + 4) >> 2] | 0
            if (((k | 0) > 0) | (((k | 0) == 0) & (j >>> 0 > 0))) {
                l = k
                m = j
            } else {
                f[e >> 2] = f[(b + 4) >> 2]
                f[d >> 2] = f[e >> 2]
                ye(b, d, g, (g + 4) | 0) | 0
                j = h
                l = f[(j + 4) >> 2] | 0
                m = f[j >> 2] | 0
            }
            f[g >> 2] = f[(a + 20) >> 2]
            if (((l | 0) > 0) | (((l | 0) == 0) & (m >>> 0 > 0))) {
                u = c
                return 1
            }
            f[e >> 2] = f[(b + 4) >> 2]
            f[d >> 2] = f[e >> 2]
            ye(b, d, g, (g + 4) | 0) | 0
            u = c
            return 1
        }
        function Yh(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            c = u
            u = (u + 16) | 0
            d = c
            e = dn(16) | 0
            f[d >> 2] = e
            f[(d + 8) >> 2] = -2147483632
            f[(d + 4) >> 2] = 14
            g = e
            h = 12975
            i = (g + 14) | 0
            do {
                b[g >> 0] = b[h >> 0] | 0
                g = (g + 1) | 0
                h = (h + 1) | 0
            } while ((g | 0) < (i | 0))
            b[(e + 14) >> 0] = 0
            e = yk(a, d, -1) | 0
            if ((b[(d + 11) >> 0] | 0) < 0) br(f[d >> 2] | 0)
            j = dn(16) | 0
            f[d >> 2] = j
            f[(d + 8) >> 2] = -2147483632
            f[(d + 4) >> 2] = 14
            g = j
            h = 12990
            i = (g + 14) | 0
            do {
                b[g >> 0] = b[h >> 0] | 0
                g = (g + 1) | 0
                h = (h + 1) | 0
            } while ((g | 0) < (i | 0))
            b[(j + 14) >> 0] = 0
            j = yk(a, d, -1) | 0
            if ((b[(d + 11) >> 0] | 0) >= 0) {
                k = (e | 0) < (j | 0)
                l = k ? j : e
                m = (l | 0) == -1
                n = m ? 5 : l
                u = c
                return n | 0
            }
            br(f[d >> 2] | 0)
            k = (e | 0) < (j | 0)
            l = k ? j : e
            m = (l | 0) == -1
            n = m ? 5 : l
            u = c
            return n | 0
        }
        function Zh(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            c = u
            u = (u + 16) | 0
            d = (c + 8) | 0
            e = (c + 4) | 0
            g = c
            f[g >> 2] = f[(a + 12) >> 2]
            h = (b + 16) | 0
            i = h
            j = f[i >> 2] | 0
            k = f[(i + 4) >> 2] | 0
            if (((k | 0) > 0) | (((k | 0) == 0) & (j >>> 0 > 0))) {
                l = k
                m = j
            } else {
                f[e >> 2] = f[(b + 4) >> 2]
                f[d >> 2] = f[e >> 2]
                ye(b, d, g, (g + 4) | 0) | 0
                j = h
                l = f[(j + 4) >> 2] | 0
                m = f[j >> 2] | 0
            }
            f[g >> 2] = f[(a + 16) >> 2]
            if (((l | 0) > 0) | (((l | 0) == 0) & (m >>> 0 > 0))) {
                u = c
                return 1
            }
            f[e >> 2] = f[(b + 4) >> 2]
            f[d >> 2] = f[e >> 2]
            ye(b, d, g, (g + 4) | 0) | 0
            u = c
            return 1
        }
        function _h(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            g = dn(32) | 0
            f[a >> 2] = g
            f[(a + 4) >> 2] = c + 8
            c = (a + 8) | 0
            b[c >> 0] = 0
            h = (g + 8) | 0
            f[h >> 2] = f[e >> 2]
            f[(h + 4) >> 2] = f[(e + 4) >> 2]
            f[(h + 8) >> 2] = f[(e + 8) >> 2]
            f[e >> 2] = 0
            f[(e + 4) >> 2] = 0
            f[(e + 8) >> 2] = 0
            h = (g + 20) | 0
            i = (e + 12) | 0
            f[h >> 2] = 0
            f[(g + 24) >> 2] = 0
            f[(g + 28) >> 2] = 0
            g = (e + 16) | 0
            e = f[g >> 2] | 0
            j = f[i >> 2] | 0
            k = (e - j) | 0
            if (!k) {
                l = j
                m = e
                n = 0
            } else {
                ri(h, k)
                l = f[i >> 2] | 0
                m = f[g >> 2] | 0
                n = f[h >> 2] | 0
            }
            Rg(n | 0, l | 0, (m - l) | 0) | 0
            b[c >> 0] = 1
            c = f[a >> 2] | 0
            f[(c + 4) >> 2] = d
            f[c >> 2] = 0
            return
        }
        function $h(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            b = (a + 32) | 0
            fd(a, b)
            c = (a + 80) | 0
            d = f[c >> 2] | 0
            if ((d | 0 ? ((e = (a + 84) | 0), (f[e >> 2] | 0) > 0) : 0) ? (fd(d, b), (f[e >> 2] | 0) > 1) : 0) {
                d = 1
                do {
                    fd(((f[c >> 2] | 0) + (d << 5)) | 0, b)
                    d = (d + 1) | 0
                } while ((d | 0) < (f[e >> 2] | 0))
            }
            e = (a + 136) | 0
            d = (a + 140) | 0
            a = f[e >> 2] | 0
            if ((f[d >> 2] | 0) == (a | 0)) return
            c = 0
            g = a
            while (1) {
                a = g
                Nh(((f[(a + ((c * 12) | 0) + 4) >> 2] | 0) - (f[(a + ((c * 12) | 0)) >> 2] | 0)) >> 2, b) | 0
                a = f[e >> 2] | 0
                h = f[(a + ((c * 12) | 0)) >> 2] | 0
                i = ((f[(a + ((c * 12) | 0) + 4) >> 2] | 0) - h) >> 2
                if (!i) j = a
                else {
                    Dc(h, i, 1, 0, b) | 0
                    j = f[e >> 2] | 0
                }
                c = (c + 1) | 0
                if (c >>> 0 >= (((((f[d >> 2] | 0) - j) | 0) / 12) | 0) >>> 0) break
                else g = j
            }
            return
        }
        function ai(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0
            e = (d + 16) | 0
            g = f[e >> 2] | 0
            if (!g)
                if (!(pl(d) | 0)) {
                    h = f[e >> 2] | 0
                    i = 5
                } else j = 0
            else {
                h = g
                i = 5
            }
            a: do
                if ((i | 0) == 5) {
                    g = (d + 20) | 0
                    e = f[g >> 2] | 0
                    k = e
                    if (((h - e) | 0) >>> 0 < c >>> 0) {
                        j = Sa[f[(d + 36) >> 2] & 31](d, a, c) | 0
                        break
                    }
                    b: do
                        if ((b[(d + 75) >> 0] | 0) > -1) {
                            e = c
                            while (1) {
                                if (!e) {
                                    l = 0
                                    m = a
                                    n = c
                                    o = k
                                    break b
                                }
                                p = (e + -1) | 0
                                if ((b[(a + p) >> 0] | 0) == 10) break
                                else e = p
                            }
                            p = Sa[f[(d + 36) >> 2] & 31](d, a, e) | 0
                            if (p >>> 0 < e >>> 0) {
                                j = p
                                break a
                            }
                            l = e
                            m = (a + e) | 0
                            n = (c - e) | 0
                            o = f[g >> 2] | 0
                        } else {
                            l = 0
                            m = a
                            n = c
                            o = k
                        }
                    while (0)
                    Rg(o | 0, m | 0, n | 0) | 0
                    f[g >> 2] = (f[g >> 2] | 0) + n
                    j = (l + n) | 0
                }
            while (0)
            return j | 0
        }
        function bi(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0
            c = (a + 12) | 0
            d = f[c >> 2] | 0
            f[c >> 2] = 0
            if (d | 0) {
                c = f[(d + 28) >> 2] | 0
                if (c | 0) {
                    e = c
                    do {
                        c = e
                        e = f[e >> 2] | 0
                        bi((c + 8) | 0)
                        br(c)
                    } while ((e | 0) != 0)
                }
                e = (d + 20) | 0
                c = f[e >> 2] | 0
                f[e >> 2] = 0
                if (c | 0) br(c)
                c = f[(d + 8) >> 2] | 0
                if (c | 0) {
                    e = c
                    do {
                        c = e
                        e = f[e >> 2] | 0
                        g = (c + 8) | 0
                        h = f[(c + 20) >> 2] | 0
                        if (h | 0) {
                            i = (c + 24) | 0
                            if ((f[i >> 2] | 0) != (h | 0)) f[i >> 2] = h
                            br(h)
                        }
                        if ((b[(g + 11) >> 0] | 0) < 0) br(f[g >> 2] | 0)
                        br(c)
                    } while ((e | 0) != 0)
                }
                e = f[d >> 2] | 0
                f[d >> 2] = 0
                if (e | 0) br(e)
                br(d)
            }
            if ((b[(a + 11) >> 0] | 0) >= 0) return
            br(f[a >> 2] | 0)
            return
        }
        function ci(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0
            g = u
            u = (u + 32) | 0
            h = (g + 12) | 0
            i = g
            f[h >> 2] = 0
            f[(h + 4) >> 2] = 0
            f[(h + 8) >> 2] = 0
            if ((e | 0) > 0) {
                j = (i + 11) | 0
                k = (i + 4) | 0
                l = 0
                do {
                    if ((l | 0) > 0) vn(h, 12890) | 0
                    cl(i, $(n[(d + (l << 2)) >> 2]))
                    m = b[j >> 0] | 0
                    o = (m << 24) >> 24 < 0
                    $i(h, o ? f[i >> 2] | 0 : i, o ? f[k >> 2] | 0 : m & 255) | 0
                    if ((b[j >> 0] | 0) < 0) br(f[i >> 2] | 0)
                    l = (l + 1) | 0
                } while ((l | 0) < (e | 0))
            }
            Ql(mi(a, c) | 0, h) | 0
            if ((b[(h + 11) >> 0] | 0) >= 0) {
                u = g
                return
            }
            br(f[h >> 2] | 0)
            u = g
            return
        }
        function di(a, c, d, e, g) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            var h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0
            if ((f[(d + 56) >> 2] | 0) == -1) {
                h = 0
                f[a >> 2] = h
                return
            }
            i = dn(96) | 0
            nl(i, d)
            d = i
            do
                if (!e) {
                    j = f[(c + 80) >> 2] | 0
                    b[(i + 84) >> 0] = 0
                    k = (i + 68) | 0
                    l = (i + 72) | 0
                    m = f[l >> 2] | 0
                    n = f[k >> 2] | 0
                    o = (m - n) >> 2
                    p = m
                    if (j >>> 0 > o >>> 0) {
                        kh(k, (j - o) | 0, 5908)
                        break
                    }
                    if (j >>> 0 < o >>> 0 ? ((o = (n + (j << 2)) | 0), (o | 0) != (p | 0)) : 0) f[l >> 2] = p + (~(((p + -4 - o) | 0) >>> 2) << 2)
                } else {
                    b[(i + 84) >> 0] = 1
                    o = f[(i + 68) >> 2] | 0
                    p = (i + 72) | 0
                    l = f[p >> 2] | 0
                    if ((l | 0) != (o | 0)) f[p >> 2] = l + (~(((l + -4 - o) | 0) >>> 2) << 2)
                    f[(i + 80) >> 2] = f[(c + 80) >> 2]
                }
            while (0)
            if (!g) {
                h = d
                f[a >> 2] = h
                return
            }
            pj(i, g) | 0
            h = d
            f[a >> 2] = h
            return
        }
        function ei(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            c = (a + 4) | 0
            d = f[a >> 2] | 0
            e = ((f[c >> 2] | 0) - d) | 0
            g = e >> 3
            h = (g + 1) | 0
            if (h >>> 0 > 536870911) mq(a)
            i = (a + 8) | 0
            j = ((f[i >> 2] | 0) - d) | 0
            k = j >> 2
            l = (j >> 3) >>> 0 < 268435455 ? (k >>> 0 < h >>> 0 ? h : k) : 536870911
            do
                if (l)
                    if (l >>> 0 > 536870911) {
                        k = ra(8) | 0
                        Wo(k, 14941)
                        f[k >> 2] = 6944
                        va(k | 0, 1080, 114)
                    } else {
                        k = dn(l << 3) | 0
                        m = k
                        n = k
                        break
                    }
                else {
                    m = 0
                    n = 0
                }
            while (0)
            k = (m + (g << 3)) | 0
            g = b
            b = f[(g + 4) >> 2] | 0
            h = k
            f[h >> 2] = f[g >> 2]
            f[(h + 4) >> 2] = b
            if ((e | 0) > 0) Rg(n | 0, d | 0, e | 0) | 0
            f[a >> 2] = m
            f[c >> 2] = k + 8
            f[i >> 2] = m + (l << 3)
            if (!d) return
            br(d)
            return
        }
        function fi(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            c = u
            u = (u + 16) | 0
            d = c
            if ((Qa[f[((f[b >> 2] | 0) + 20) >> 2] & 127](b) | 0) <= 0) {
                e = 1
                u = c
                return e | 0
            }
            g = (a + 4) | 0
            h = (a + 20) | 0
            i = (a + 24) | 0
            j = (a + 16) | 0
            a = 0
            while (1) {
                k = f[((f[g >> 2] | 0) + 4) >> 2] | 0
                l = Tl(k, Ra[f[((f[b >> 2] | 0) + 24) >> 2] & 127](b, a) | 0) | 0
                f[d >> 2] = l
                if ((l | 0) == -1) break
                k = f[h >> 2] | 0
                if ((k | 0) == (f[i >> 2] | 0)) Ci(j, d)
                else {
                    f[k >> 2] = l
                    f[h >> 2] = k + 4
                }
                al(f[g >> 2] | 0, f[d >> 2] | 0) | 0
                a = (a + 1) | 0
                if ((a | 0) >= (Qa[f[((f[b >> 2] | 0) + 20) >> 2] & 127](b) | 0)) {
                    e = 1
                    m = 9
                    break
                }
            }
            if ((m | 0) == 9) {
                u = c
                return e | 0
            }
            e = 0
            u = c
            return e | 0
        }
        function gi(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0
            f[a >> 2] = 1276
            Sh((a + 60) | 0)
            b = f[(a + 48) >> 2] | 0
            if (b | 0) {
                c = (a + 52) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = (a + 36) | 0
            d = f[b >> 2] | 0
            if (d | 0) {
                c = (a + 40) | 0
                e = f[c >> 2] | 0
                if ((e | 0) == (d | 0)) g = d
                else {
                    h = e
                    do {
                        e = (h + -24) | 0
                        f[c >> 2] = e
                        Va[f[f[e >> 2] >> 2] & 127](e)
                        h = f[c >> 2] | 0
                    } while ((h | 0) != (d | 0))
                    g = f[b >> 2] | 0
                }
                br(g)
            }
            f[a >> 2] = 1216
            g = f[(a + 16) >> 2] | 0
            if (g | 0) {
                b = (a + 20) | 0
                d = f[b >> 2] | 0
                if ((d | 0) != (g | 0)) f[b >> 2] = d + (~(((d + -4 - g) | 0) >>> 2) << 2)
                br(g)
            }
            g = f[(a + 4) >> 2] | 0
            if (!g) return
            d = (a + 8) | 0
            a = f[d >> 2] | 0
            if ((a | 0) != (g | 0)) f[d >> 2] = a + (~(((a + -4 - g) | 0) >>> 2) << 2)
            br(g)
            return
        }
        function hi(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0
            c = u
            u = (u + 32) | 0
            d = (c + 16) | 0
            e = (c + 8) | 0
            g = c
            h = (a + 8) | 0
            if ((f[h >> 2] << 5) >>> 0 >= b >>> 0) {
                u = c
                return
            }
            f[d >> 2] = 0
            i = (d + 4) | 0
            f[i >> 2] = 0
            j = (d + 8) | 0
            f[j >> 2] = 0
            if ((b | 0) < 0) mq(d)
            k = ((((b + -1) | 0) >>> 5) + 1) | 0
            b = dn(k << 2) | 0
            f[d >> 2] = b
            f[i >> 2] = 0
            f[j >> 2] = k
            k = f[a >> 2] | 0
            f[e >> 2] = k
            f[(e + 4) >> 2] = 0
            b = (a + 4) | 0
            l = f[b >> 2] | 0
            f[g >> 2] = k + ((l >>> 5) << 2)
            f[(g + 4) >> 2] = l & 31
            ig(d, e, g)
            g = f[a >> 2] | 0
            f[a >> 2] = f[d >> 2]
            f[d >> 2] = g
            d = f[b >> 2] | 0
            f[b >> 2] = f[i >> 2]
            f[i >> 2] = d
            d = f[h >> 2] | 0
            f[h >> 2] = f[j >> 2]
            f[j >> 2] = d
            if (g | 0) br(g)
            u = c
            return
        }
        function ii(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            b = (a + 136) | 0
            c = f[b >> 2] | 0
            if (c | 0) {
                d = (a + 140) | 0
                e = f[d >> 2] | 0
                if ((e | 0) == (c | 0)) g = c
                else {
                    h = e
                    while (1) {
                        e = (h + -12) | 0
                        f[d >> 2] = e
                        i = f[e >> 2] | 0
                        if (!i) j = e
                        else {
                            e = (h + -8) | 0
                            k = f[e >> 2] | 0
                            if ((k | 0) != (i | 0)) f[e >> 2] = k + (~(((k + -4 - i) | 0) >>> 2) << 2)
                            br(i)
                            j = f[d >> 2] | 0
                        }
                        if ((j | 0) == (c | 0)) break
                        else h = j
                    }
                    g = f[b >> 2] | 0
                }
                br(g)
            }
            g = f[(a + 104) >> 2] | 0
            if (g | 0) {
                b = (a + 108) | 0
                j = f[b >> 2] | 0
                if ((j | 0) != (g | 0)) f[b >> 2] = j + (~(((j + -4 - g) | 0) >>> 2) << 2)
                br(g)
            }
            g = f[(a + 92) >> 2] | 0
            if (!g) {
                jj(a)
                return
            }
            j = (a + 96) | 0
            b = f[j >> 2] | 0
            if ((b | 0) != (g | 0)) f[j >> 2] = b + (~(((b + -4 - g) | 0) >>> 2) << 2)
            br(g)
            jj(a)
            return
        }
        function ji(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0
            f[a >> 2] = 3340
            c = (a + 72) | 0
            d = (a + 136) | 0
            e = (a + 4) | 0
            g = (e + 64) | 0
            do {
                f[e >> 2] = 0
                e = (e + 4) | 0
            } while ((e | 0) < (g | 0))
            e = c
            g = (e + 64) | 0
            do {
                f[e >> 2] = 0
                e = (e + 4) | 0
            } while ((e | 0) < (g | 0))
            n[d >> 2] = $(1.0)
            d = (a + 140) | 0
            f[d >> 2] = 0
            f[(d + 4) >> 2] = 0
            f[(d + 8) >> 2] = 0
            f[(d + 12) >> 2] = 0
            f[(d + 16) >> 2] = 0
            f[(d + 20) >> 2] = 0
            f[(a + 164) >> 2] = -1
            d = (a + 168) | 0
            f[d >> 2] = 0
            f[(d + 4) >> 2] = 0
            f[(d + 8) >> 2] = 0
            f[(d + 12) >> 2] = 0
            f[(d + 16) >> 2] = 0
            f[(d + 20) >> 2] = 0
            f[(d + 24) >> 2] = 0
            rn((a + 200) | 0)
            Cn((a + 232) | 0)
            d = (a + 316) | 0
            e = (a + 264) | 0
            g = (e + 52) | 0
            do {
                f[e >> 2] = 0
                e = (e + 4) | 0
            } while ((e | 0) < (g | 0))
            f[d >> 2] = -1
            f[(a + 320) >> 2] = -1
            f[(a + 324) >> 2] = 0
            f[(a + 328) >> 2] = 2
            f[(a + 332) >> 2] = 7
            f[(a + 336) >> 2] = 0
            f[(a + 340) >> 2] = 0
            f[(a + 344) >> 2] = 0
            b[(a + 352) >> 0] = 0
            return
        }
        function ki(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            c = (a + 4) | 0
            d = f[a >> 2] | 0
            e = ((f[c >> 2] | 0) - d) | 0
            g = ((e | 0) / 12) | 0
            h = (g + 1) | 0
            if (h >>> 0 > 357913941) mq(a)
            i = (a + 8) | 0
            j = ((((f[i >> 2] | 0) - d) | 0) / 12) | 0
            k = j << 1
            l = j >>> 0 < 178956970 ? (k >>> 0 < h >>> 0 ? h : k) : 357913941
            do
                if (l)
                    if (l >>> 0 > 357913941) {
                        k = ra(8) | 0
                        Wo(k, 14941)
                        f[k >> 2] = 6944
                        va(k | 0, 1080, 114)
                    } else {
                        m = dn((l * 12) | 0) | 0
                        break
                    }
                else m = 0
            while (0)
            k = (m + ((g * 12) | 0)) | 0
            f[k >> 2] = f[b >> 2]
            f[(k + 4) >> 2] = f[(b + 4) >> 2]
            f[(k + 8) >> 2] = f[(b + 8) >> 2]
            b = (k + (((((e | 0) / -12) | 0) * 12) | 0)) | 0
            if ((e | 0) > 0) Rg(b | 0, d | 0, e | 0) | 0
            f[a >> 2] = b
            f[c >> 2] = k + 12
            f[i >> 2] = m + ((l * 12) | 0)
            if (!d) return
            br(d)
            return
        }
        function li(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            g = (a + 16) | 0
            h = g
            i = f[(h + 4) >> 2] | 0
            if (((d | 0) < 0) | (((d | 0) == 0) & (c >>> 0 < 1)) | (((i | 0) > 0) | (((i | 0) == 0) & ((f[h >> 2] | 0) >>> 0 > 0)))) {
                j = 0
                return j | 0
            }
            b[(a + 24) >> 0] = e & 1
            h = Tn(c | 0, d | 0, 7, 0) | 0
            d = zk(h | 0, I | 0, 8, 0) | 0
            h = I
            c = g
            f[c >> 2] = d
            f[(c + 4) >> 2] = h
            c = (a + 4) | 0
            g = f[c >> 2] | 0
            i = f[a >> 2] | 0
            k = (g - i) | 0
            l = Tn(k | 0, 0, 8, 0) | 0
            m = e ? l : k
            l = Tn(m | 0, (e ? I : 0) | 0, d | 0, h | 0) | 0
            h = i
            i = g
            if (k >>> 0 >= l >>> 0)
                if (k >>> 0 > l >>> 0 ? ((g = (h + l) | 0), (g | 0) != (i | 0)) : 0) {
                    f[c >> 2] = g
                    n = h
                } else n = h
            else {
                ri(a, (l - k) | 0)
                n = f[a >> 2] | 0
            }
            k = dn(8) | 0
            f[k >> 2] = n + m
            f[(k + 4) >> 2] = 0
            m = (a + 12) | 0
            a = f[m >> 2] | 0
            f[m >> 2] = k
            if (!a) {
                j = 1
                return j | 0
            }
            br(a)
            j = 1
            return j | 0
        }
        function mi(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            c = u
            u = (u + 16) | 0
            d = c
            e = hg(a, d, b) | 0
            g = f[e >> 2] | 0
            if (g | 0) {
                h = g
                i = (h + 28) | 0
                u = c
                return i | 0
            }
            g = dn(40) | 0
            dj((g + 16) | 0, b)
            b = (g + 28) | 0
            f[b >> 2] = 0
            f[(b + 4) >> 2] = 0
            f[(b + 8) >> 2] = 0
            b = f[d >> 2] | 0
            f[g >> 2] = 0
            f[(g + 4) >> 2] = 0
            f[(g + 8) >> 2] = b
            f[e >> 2] = g
            b = f[f[a >> 2] >> 2] | 0
            if (!b) j = g
            else {
                f[a >> 2] = b
                j = f[e >> 2] | 0
            }
            Ae(f[(a + 4) >> 2] | 0, j)
            j = (a + 8) | 0
            f[j >> 2] = (f[j >> 2] | 0) + 1
            h = g
            i = (h + 28) | 0
            u = c
            return i | 0
        }
        function ni(a, c, d, e, g, h, i, j) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            h = h | 0
            i = i | 0
            j = j | 0
            var k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0
            k = u
            u = (u + 16) | 0
            l = k
            if (((-18 - c) | 0) >>> 0 < d >>> 0) mq(a)
            if ((b[(a + 11) >> 0] | 0) < 0) m = f[a >> 2] | 0
            else m = a
            if (c >>> 0 < 2147483623) {
                n = (d + c) | 0
                d = c << 1
                o = n >>> 0 < d >>> 0 ? d : n
                p = o >>> 0 < 11 ? 11 : (o + 16) & -16
            } else p = -17
            o = dn(p) | 0
            if (g | 0) Lo(o, m, g) | 0
            if (i | 0) Lo((o + g) | 0, j, i) | 0
            j = (e - h) | 0
            e = (j - g) | 0
            if (e | 0) Lo((o + g + i) | 0, (m + g + h) | 0, e) | 0
            if ((c | 0) != 10) br(m)
            f[a >> 2] = o
            f[(a + 8) >> 2] = p | -2147483648
            p = (j + i) | 0
            f[(a + 4) >> 2] = p
            b[l >> 0] = 0
            Hp((o + p) | 0, l)
            u = k
            return
        }
        function oi(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            c = (a + 8) | 0
            d = f[c >> 2] | 0
            e = (a + 4) | 0
            g = f[e >> 2] | 0
            if (((d - g) >> 2) >>> 0 >= b >>> 0) {
                hj(g | 0, 0, (b << 2) | 0) | 0
                f[e >> 2] = g + (b << 2)
                return
            }
            h = f[a >> 2] | 0
            i = (g - h) | 0
            g = i >> 2
            j = (g + b) | 0
            if (j >>> 0 > 1073741823) mq(a)
            k = (d - h) | 0
            d = k >> 1
            l = (k >> 2) >>> 0 < 536870911 ? (d >>> 0 < j >>> 0 ? j : d) : 1073741823
            do
                if (l)
                    if (l >>> 0 > 1073741823) {
                        d = ra(8) | 0
                        Wo(d, 14941)
                        f[d >> 2] = 6944
                        va(d | 0, 1080, 114)
                    } else {
                        d = dn(l << 2) | 0
                        m = d
                        n = d
                        break
                    }
                else {
                    m = 0
                    n = 0
                }
            while (0)
            d = (m + (g << 2)) | 0
            hj(d | 0, 0, (b << 2) | 0) | 0
            if ((i | 0) > 0) Rg(n | 0, h | 0, i | 0) | 0
            f[a >> 2] = m
            f[e >> 2] = d + (b << 2)
            f[c >> 2] = m + (l << 2)
            if (!h) return
            br(h)
            return
        }
        function pi(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            g = dn(32) | 0
            f[a >> 2] = g
            f[(a + 4) >> 2] = c + 8
            c = (a + 8) | 0
            b[c >> 0] = 0
            dj((g + 8) | 0, e)
            h = (g + 20) | 0
            i = (e + 12) | 0
            f[h >> 2] = 0
            f[(g + 24) >> 2] = 0
            f[(g + 28) >> 2] = 0
            g = (e + 16) | 0
            e = f[g >> 2] | 0
            j = f[i >> 2] | 0
            k = (e - j) | 0
            if (!k) {
                l = j
                m = e
                n = 0
            } else {
                ri(h, k)
                l = f[i >> 2] | 0
                m = f[g >> 2] | 0
                n = f[h >> 2] | 0
            }
            Rg(n | 0, l | 0, (m - l) | 0) | 0
            b[c >> 0] = 1
            c = f[a >> 2] | 0
            f[(c + 4) >> 2] = d
            f[c >> 2] = 0
            return
        }
        function qi(a, c, d) {
            a = a | 0
            c = c | 0
            d = $(d)
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0.0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            e = u
            u = (u + 16) | 0
            g = e
            h = (c + 11) | 0
            i = b[h >> 0] | 0
            if ((i << 24) >> 24 < 0) j = f[(c + 4) >> 2] | 0
            else j = i & 255
            k = +d
            l = j
            j = i
            while (1) {
                if ((j << 24) >> 24 < 0) m = f[c >> 2] | 0
                else m = c
                p[g >> 3] = k
                n = wn(m, (l + 1) | 0, 17468, g) | 0
                if ((n | 0) > -1)
                    if (n >>> 0 > l >>> 0) o = n
                    else break
                else o = (l << 1) | 1
                wj(c, o, 0)
                l = o
                j = b[h >> 0] | 0
            }
            wj(c, n, 0)
            f[a >> 2] = f[c >> 2]
            f[(a + 4) >> 2] = f[(c + 4) >> 2]
            f[(a + 8) >> 2] = f[(c + 8) >> 2]
            a = 0
            while (1) {
                if ((a | 0) == 3) break
                f[(c + (a << 2)) >> 2] = 0
                a = (a + 1) | 0
            }
            u = e
            return
        }
        function ri(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0
            d = (a + 8) | 0
            e = f[d >> 2] | 0
            g = (a + 4) | 0
            h = f[g >> 2] | 0
            if (((e - h) | 0) >>> 0 >= c >>> 0) {
                i = c
                j = h
                do {
                    b[j >> 0] = 0
                    j = ((f[g >> 2] | 0) + 1) | 0
                    f[g >> 2] = j
                    i = (i + -1) | 0
                } while ((i | 0) != 0)
                return
            }
            i = f[a >> 2] | 0
            j = (h - i) | 0
            h = (j + c) | 0
            if ((h | 0) < 0) mq(a)
            k = (e - i) | 0
            i = k << 1
            e = k >>> 0 < 1073741823 ? (i >>> 0 < h >>> 0 ? h : i) : 2147483647
            if (!e) l = 0
            else l = dn(e) | 0
            i = (l + j) | 0
            j = (l + e) | 0
            e = c
            c = i
            l = i
            do {
                b[l >> 0] = 0
                l = (c + 1) | 0
                c = l
                e = (e + -1) | 0
            } while ((e | 0) != 0)
            e = f[a >> 2] | 0
            l = ((f[g >> 2] | 0) - e) | 0
            h = (i + (0 - l)) | 0
            if ((l | 0) > 0) Rg(h | 0, e | 0, l | 0) | 0
            f[a >> 2] = h
            f[g >> 2] = c
            f[d >> 2] = j
            if (!e) return
            br(e)
            return
        }
        function si(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0
            c = (a + 4) | 0
            d = f[c >> 2] | 0
            e = f[a >> 2] | 0
            g = (((d - e) | 0) / 136) | 0
            h = d
            if (g >>> 0 < b >>> 0) {
                te(a, (b - g) | 0)
                return
            }
            if (g >>> 0 <= b >>> 0) return
            g = (e + ((b * 136) | 0)) | 0
            if ((g | 0) == (h | 0)) return
            else i = h
            do {
                f[c >> 2] = i + -136
                h = f[(i + -20) >> 2] | 0
                if (h | 0) {
                    b = (i + -16) | 0
                    e = f[b >> 2] | 0
                    if ((e | 0) != (h | 0)) f[b >> 2] = e + (~(((e + -4 - h) | 0) >>> 2) << 2)
                    br(h)
                }
                h = f[(i + -32) >> 2] | 0
                if (h | 0) {
                    e = (i + -28) | 0
                    b = f[e >> 2] | 0
                    if ((b | 0) != (h | 0)) f[e >> 2] = b + (~(((b + -4 - h) | 0) >>> 2) << 2)
                    br(h)
                }
                yi((i + -132) | 0)
                i = f[c >> 2] | 0
            } while ((i | 0) != (g | 0))
            return
        }
        function ti(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = Oa,
                e = 0,
                g = 0
            if ((b | 0) != 1)
                if (!((b + -1) & b)) c = b
                else c = cb(b) | 0
            else c = 2
            b = f[(a + 4) >> 2] | 0
            if (c >>> 0 > b >>> 0) {
                Hd(a, c)
                return
            }
            if (c >>> 0 >= b >>> 0) return
            d = $((f[(a + 12) >> 2] | 0) >>> 0)
            e = ~~$(W($(d / $(n[(a + 16) >> 2])))) >>> 0
            if ((b >>> 0 > 2) & ((((b + -1) & b) | 0) == 0)) g = 1 << (32 - (_((e + -1) | 0) | 0))
            else g = cb(e) | 0
            e = c >>> 0 < g >>> 0 ? g : c
            if (e >>> 0 >= b >>> 0) return
            Hd(a, e)
            return
        }
        function ui(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            b = f[(a + 76) >> 2] | 0
            if (b | 0) {
                c = (a + 80) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 64) >> 2] | 0
            if (b | 0) {
                d = (a + 68) | 0
                if ((f[d >> 2] | 0) != (b | 0)) f[d >> 2] = b
                br(b)
            }
            b = f[(a + 48) >> 2] | 0
            if (b | 0) {
                d = (a + 52) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 24) >> 2] | 0
            if (b | 0) {
                c = (a + 28) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 12) >> 2] | 0
            if (b | 0) {
                d = (a + 16) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[a >> 2] | 0
            if (!b) return
            c = (a + 4) | 0
            a = f[c >> 2] | 0
            if ((a | 0) != (b | 0)) f[c >> 2] = a + (~(((a + -4 - b) | 0) >>> 2) << 2)
            br(b)
            return
        }
        function vi(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            e = u
            u = (u + 16) | 0
            g = e
            h = (c + 11) | 0
            i = b[h >> 0] | 0
            if ((i << 24) >> 24 < 0) j = f[(c + 4) >> 2] | 0
            else j = i & 255
            k = j
            j = i
            while (1) {
                if ((j << 24) >> 24 < 0) l = f[c >> 2] | 0
                else l = c
                f[g >> 2] = d
                m = wn(l, (k + 1) | 0, 17465, g) | 0
                if ((m | 0) > -1)
                    if (m >>> 0 > k >>> 0) n = m
                    else break
                else n = (k << 1) | 1
                wj(c, n, 0)
                k = n
                j = b[h >> 0] | 0
            }
            wj(c, m, 0)
            f[a >> 2] = f[c >> 2]
            f[(a + 4) >> 2] = f[(c + 4) >> 2]
            f[(a + 8) >> 2] = f[(c + 8) >> 2]
            a = 0
            while (1) {
                if ((a | 0) == 3) break
                f[(c + (a << 2)) >> 2] = 0
                a = (a + 1) | 0
            }
            u = e
            return
        }
        function wi(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            b = (a + 8) | 0
            c = f[b >> 2] | 0
            if ((c | 0) < 0) {
                d = 0
                return d | 0
            }
            e = (a + 4) | 0
            a = f[e >> 2] | 0
            g = (a + 4) | 0
            h = f[g >> 2] | 0
            i = f[a >> 2] | 0
            j = (h - i) >> 2
            k = i
            i = h
            if (c >>> 0 <= j >>> 0)
                if (c >>> 0 < j >>> 0 ? ((h = (k + (c << 2)) | 0), (h | 0) != (i | 0)) : 0) {
                    f[g >> 2] = i + (~(((i + -4 - h) | 0) >>> 2) << 2)
                    l = c
                } else l = c
            else {
                oi(a, (c - j) | 0)
                l = f[b >> 2] | 0
            }
            if ((l | 0) <= 0) {
                d = 1
                return d | 0
            }
            b = f[e >> 2] | 0
            e = f[b >> 2] | 0
            j = ((f[(b + 4) >> 2] | 0) - e) >> 2
            c = e
            e = 0
            while (1) {
                if (j >>> 0 <= e >>> 0) {
                    m = 10
                    break
                }
                f[(c + (e << 2)) >> 2] = e
                e = (e + 1) | 0
                if ((e | 0) >= (l | 0)) {
                    d = 1
                    m = 12
                    break
                }
            }
            if ((m | 0) == 10) mq(b)
            else if ((m | 0) == 12) return d | 0
            return 0
        }
        function xi(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            d = u
            u = (u + 16) | 0
            e = d
            g = dn(32) | 0
            f[e >> 2] = g
            f[(e + 8) >> 2] = -2147483616
            f[(e + 4) >> 2] = 30
            h = g
            i = 14791
            j = (h + 30) | 0
            do {
                b[h >> 0] = b[i >> 0] | 0
                h = (h + 1) | 0
                i = (i + 1) | 0
            } while ((h | 0) < (j | 0))
            b[(g + 30) >> 0] = 0
            g = (a + 4) | 0
            Mj(g, e, c)
            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
            a = dn(32) | 0
            f[e >> 2] = a
            f[(e + 8) >> 2] = -2147483616
            f[(e + 4) >> 2] = 29
            h = a
            i = 14510
            j = (h + 29) | 0
            do {
                b[h >> 0] = b[i >> 0] | 0
                h = (h + 1) | 0
                i = (i + 1) | 0
            } while ((h | 0) < (j | 0))
            b[(a + 29) >> 0] = 0
            Mj(g, e, c)
            if ((b[(e + 11) >> 0] | 0) >= 0) {
                u = d
                return
            }
            br(f[e >> 2] | 0)
            u = d
            return
        }
        function yi(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            b = f[(a + 84) >> 2] | 0
            if (b | 0) {
                c = (a + 88) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 72) >> 2] | 0
            if (b | 0) {
                d = (a + 76) | 0
                if ((f[d >> 2] | 0) != (b | 0)) f[d >> 2] = b
                br(b)
            }
            b = f[(a + 52) >> 2] | 0
            if (b | 0) {
                d = (a + 56) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 40) >> 2] | 0
            if (b | 0) {
                c = (a + 44) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 28) >> 2] | 0
            if (b | 0) {
                d = (a + 32) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 12) >> 2] | 0
            if (b | 0) br(b)
            b = f[a >> 2] | 0
            if (!b) return
            br(b)
            return
        }
        function zi(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0
            f[a >> 2] = 1336
            b = (a + 32) | 0
            c = f[b >> 2] | 0
            f[b >> 2] = 0
            if (c | 0) {
                b = (c + 88) | 0
                d = f[b >> 2] | 0
                f[b >> 2] = 0
                if (d | 0) {
                    b = f[(d + 8) >> 2] | 0
                    if (b | 0) {
                        e = (d + 12) | 0
                        if ((f[e >> 2] | 0) != (b | 0)) f[e >> 2] = b
                        br(b)
                    }
                    br(d)
                }
                d = f[(c + 68) >> 2] | 0
                if (d | 0) {
                    b = (c + 72) | 0
                    e = f[b >> 2] | 0
                    if ((e | 0) != (d | 0)) f[b >> 2] = e + (~(((e + -4 - d) | 0) >>> 2) << 2)
                    br(d)
                }
                d = (c + 64) | 0
                e = f[d >> 2] | 0
                f[d >> 2] = 0
                if (e | 0) {
                    d = f[e >> 2] | 0
                    if (d | 0) {
                        b = (e + 4) | 0
                        if ((f[b >> 2] | 0) != (d | 0)) f[b >> 2] = d
                        br(d)
                    }
                    br(e)
                }
                br(c)
            }
            c = f[(a + 16) >> 2] | 0
            if (!c) return
            e = (a + 20) | 0
            a = f[e >> 2] | 0
            if ((a | 0) != (c | 0)) f[e >> 2] = a + (~(((a + -4 - c) | 0) >>> 2) << 2)
            br(c)
            return
        }
        function Ai() {
            var a = 0,
                b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            a = u
            u = (u + 48) | 0
            b = (a + 32) | 0
            c = (a + 24) | 0
            d = (a + 16) | 0
            e = a
            g = (a + 36) | 0
            a = mn() | 0
            if (a | 0 ? ((h = f[a >> 2] | 0), h | 0) : 0) {
                a = (h + 48) | 0
                i = f[a >> 2] | 0
                j = f[(a + 4) >> 2] | 0
                if (!((((i & -256) | 0) == 1126902528) & ((j | 0) == 1129074247))) {
                    f[c >> 2] = 17607
                    Dn(17557, c)
                }
                if (((i | 0) == 1126902529) & ((j | 0) == 1129074247)) k = f[(h + 44) >> 2] | 0
                else k = (h + 80) | 0
                f[g >> 2] = k
                k = f[h >> 2] | 0
                h = f[(k + 4) >> 2] | 0
                if (Sa[f[((f[250] | 0) + 16) >> 2] & 31](1e3, k, g) | 0) {
                    k = f[g >> 2] | 0
                    g = Qa[f[((f[k >> 2] | 0) + 8) >> 2] & 127](k) | 0
                    f[e >> 2] = 17607
                    f[(e + 4) >> 2] = h
                    f[(e + 8) >> 2] = g
                    Dn(17471, e)
                } else {
                    f[d >> 2] = 17607
                    f[(d + 4) >> 2] = h
                    Dn(17516, d)
                }
            }
            Dn(17595, b)
        }
        function Bi(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0
            do
                if (a) {
                    if (c >>> 0 < 128) {
                        b[a >> 0] = c
                        e = 1
                        break
                    }
                    d = ((Yq() | 0) + 188) | 0
                    if (!(f[f[d >> 2] >> 2] | 0))
                        if (((c & -128) | 0) == 57216) {
                            b[a >> 0] = c
                            e = 1
                            break
                        } else {
                            d = ir() | 0
                            f[d >> 2] = 84
                            e = -1
                            break
                        }
                    if (c >>> 0 < 2048) {
                        b[a >> 0] = (c >>> 6) | 192
                        b[(a + 1) >> 0] = (c & 63) | 128
                        e = 2
                        break
                    }
                    if ((c >>> 0 < 55296) | (((c & -8192) | 0) == 57344)) {
                        b[a >> 0] = (c >>> 12) | 224
                        b[(a + 1) >> 0] = ((c >>> 6) & 63) | 128
                        b[(a + 2) >> 0] = (c & 63) | 128
                        e = 3
                        break
                    }
                    if (((c + -65536) | 0) >>> 0 < 1048576) {
                        b[a >> 0] = (c >>> 18) | 240
                        b[(a + 1) >> 0] = ((c >>> 12) & 63) | 128
                        b[(a + 2) >> 0] = ((c >>> 6) & 63) | 128
                        b[(a + 3) >> 0] = (c & 63) | 128
                        e = 4
                        break
                    } else {
                        d = ir() | 0
                        f[d >> 2] = 84
                        e = -1
                        break
                    }
                } else e = 1
            while (0)
            return e | 0
        }
        function Ci(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            c = (a + 4) | 0
            d = f[a >> 2] | 0
            e = ((f[c >> 2] | 0) - d) | 0
            g = e >> 2
            h = (g + 1) | 0
            if (h >>> 0 > 1073741823) mq(a)
            i = (a + 8) | 0
            j = ((f[i >> 2] | 0) - d) | 0
            k = j >> 1
            l = (j >> 2) >>> 0 < 536870911 ? (k >>> 0 < h >>> 0 ? h : k) : 1073741823
            do
                if (l)
                    if (l >>> 0 > 1073741823) {
                        k = ra(8) | 0
                        Wo(k, 14941)
                        f[k >> 2] = 6944
                        va(k | 0, 1080, 114)
                    } else {
                        k = dn(l << 2) | 0
                        m = k
                        n = k
                        break
                    }
                else {
                    m = 0
                    n = 0
                }
            while (0)
            k = (m + (g << 2)) | 0
            f[k >> 2] = f[b >> 2]
            if ((e | 0) > 0) Rg(n | 0, d | 0, e | 0) | 0
            f[a >> 2] = m
            f[c >> 2] = k + 4
            f[i >> 2] = m + (l << 2)
            if (!d) return
            br(d)
            return
        }
        function Di(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0
            c = (a + 104) | 0
            d = f[c >> 2] | 0
            if ((d | 0) != 0 ? (f[(a + 108) >> 2] | 0) >= (d | 0) : 0) e = 4
            else {
                d = Qm(a) | 0
                if ((d | 0) >= 0) {
                    g = f[c >> 2] | 0
                    c = (a + 8) | 0
                    if (g) {
                        i = f[c >> 2] | 0
                        j = f[(a + 4) >> 2] | 0
                        k = (g - (f[(a + 108) >> 2] | 0)) | 0
                        g = i
                        if (((i - j) | 0) < (k | 0)) {
                            l = g
                            m = g
                        } else {
                            l = (j + (k + -1)) | 0
                            m = g
                        }
                    } else {
                        g = f[c >> 2] | 0
                        l = g
                        m = g
                    }
                    f[(a + 100) >> 2] = l
                    l = (a + 4) | 0
                    if (!m) n = f[l >> 2] | 0
                    else {
                        g = f[l >> 2] | 0
                        l = (a + 108) | 0
                        f[l >> 2] = m + 1 - g + (f[l >> 2] | 0)
                        n = g
                    }
                    g = (n + -1) | 0
                    if ((d | 0) == (h[g >> 0] | 0 | 0)) o = d
                    else {
                        b[g >> 0] = d
                        o = d
                    }
                } else e = 4
            }
            if ((e | 0) == 4) {
                f[(a + 100) >> 2] = 0
                o = -1
            }
            return o | 0
        }
        function Ei(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            f[a >> 2] = 1528
            f[(a + 4) >> 2] = b
            b = (a + 8) | 0
            f[b >> 2] = f[c >> 2]
            f[(b + 4) >> 2] = f[(c + 4) >> 2]
            f[(b + 8) >> 2] = f[(c + 8) >> 2]
            f[(b + 12) >> 2] = f[(c + 12) >> 2]
            f[(b + 16) >> 2] = f[(c + 16) >> 2]
            f[(b + 20) >> 2] = f[(c + 20) >> 2]
            _j((a + 32) | 0, (c + 24) | 0)
            f[a >> 2] = 2144
            c = (a + 44) | 0
            f[c >> 2] = f[d >> 2]
            f[(c + 4) >> 2] = f[(d + 4) >> 2]
            f[(c + 8) >> 2] = f[(d + 8) >> 2]
            f[(c + 12) >> 2] = f[(d + 12) >> 2]
            f[a >> 2] = 2200
            d = (a + 112) | 0
            c = (a + 60) | 0
            b = (c + 52) | 0
            do {
                f[c >> 2] = 0
                c = (c + 4) | 0
            } while ((c | 0) < (b | 0))
            Sm(d)
            f[(a + 152) >> 2] = 0
            f[(a + 156) >> 2] = 0
            f[(a + 160) >> 2] = 0
            return
        }
        function Fi(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            e = u
            u = (u + 16) | 0
            g = e
            h = dn(16) | 0
            f[g >> 2] = h
            f[(g + 8) >> 2] = -2147483632
            f[(g + 4) >> 2] = 14
            i = h
            j = 12975
            k = (i + 14) | 0
            do {
                b[i >> 0] = b[j >> 0] | 0
                i = (i + 1) | 0
                j = (j + 1) | 0
            } while ((i | 0) < (k | 0))
            b[(h + 14) >> 0] = 0
            Nj(a, g, c)
            if ((b[(g + 11) >> 0] | 0) < 0) br(f[g >> 2] | 0)
            c = dn(16) | 0
            f[g >> 2] = c
            f[(g + 8) >> 2] = -2147483632
            f[(g + 4) >> 2] = 14
            i = c
            j = 12990
            k = (i + 14) | 0
            do {
                b[i >> 0] = b[j >> 0] | 0
                i = (i + 1) | 0
                j = (j + 1) | 0
            } while ((i | 0) < (k | 0))
            b[(c + 14) >> 0] = 0
            Nj(a, g, d)
            if ((b[(g + 11) >> 0] | 0) >= 0) {
                u = e
                return
            }
            br(f[g >> 2] | 0)
            u = e
            return
        }
        function Gi(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 3320
            b = f[(a + 88) >> 2] | 0
            if (b | 0) {
                c = (a + 92) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 72) >> 2] | 0
            if (b | 0) {
                d = (a + 76) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 60) >> 2] | 0
            if (b | 0) {
                c = (a + 64) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 48) >> 2] | 0
            if (b | 0) {
                d = (a + 52) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            f[a >> 2] = 3276
            b = f[(a + 36) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 24) >> 2] | 0
            if (!b) return
            br(b)
            return
        }
        function Hi(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            f[a >> 2] = 1528
            f[(a + 4) >> 2] = b
            b = (a + 8) | 0
            f[b >> 2] = f[c >> 2]
            f[(b + 4) >> 2] = f[(c + 4) >> 2]
            f[(b + 8) >> 2] = f[(c + 8) >> 2]
            f[(b + 12) >> 2] = f[(c + 12) >> 2]
            f[(b + 16) >> 2] = f[(c + 16) >> 2]
            f[(b + 20) >> 2] = f[(c + 20) >> 2]
            _j((a + 32) | 0, (c + 24) | 0)
            f[a >> 2] = 1836
            c = (a + 44) | 0
            f[c >> 2] = f[d >> 2]
            f[(c + 4) >> 2] = f[(d + 4) >> 2]
            f[(c + 8) >> 2] = f[(d + 8) >> 2]
            f[(c + 12) >> 2] = f[(d + 12) >> 2]
            f[a >> 2] = 1892
            d = (a + 112) | 0
            c = (a + 60) | 0
            b = (c + 52) | 0
            do {
                f[c >> 2] = 0
                c = (c + 4) | 0
            } while ((c | 0) < (b | 0))
            Sm(d)
            f[(a + 152) >> 2] = 0
            f[(a + 156) >> 2] = 0
            f[(a + 160) >> 2] = 0
            return
        }
        function Ii(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 2200
            b = f[(a + 152) >> 2] | 0
            if (b | 0) {
                c = (a + 156) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 112) >> 2] | 0
            if (b | 0) {
                d = (a + 116) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 96) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 84) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 72) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 60) >> 2] | 0
            if (b | 0) br(b)
            f[a >> 2] = 1528
            b = f[(a + 32) >> 2] | 0
            if (!b) return
            c = (a + 36) | 0
            a = f[c >> 2] | 0
            if ((a | 0) != (b | 0)) f[c >> 2] = a + (~(((a + -4 - b) | 0) >>> 2) << 2)
            br(b)
            return
        }
        function Ji(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0
            d = u
            u = (u + 16) | 0
            e = d
            g = f[((f[(c + 4) >> 2] | 0) + 4) >> 2] | 0
            if (!g) {
                f[a >> 2] = 0
                f[(a + 4) >> 2] = 0
                f[(a + 8) >> 2] = 0
                f[(a + 12) >> 2] = 0
                u = d
                return
            }
            if (!(rj((d + 12) | 0, f[(c + 44) >> 2] | 0, g) | 0)) {
                g = dn(32) | 0
                f[e >> 2] = g
                f[(e + 8) >> 2] = -2147483616
                f[(e + 4) >> 2] = 26
                c = g
                h = 14822
                i = (c + 26) | 0
                do {
                    b[c >> 0] = b[h >> 0] | 0
                    c = (c + 1) | 0
                    h = (h + 1) | 0
                } while ((c | 0) < (i | 0))
                b[(g + 26) >> 0] = 0
                f[a >> 2] = -1
                dj((a + 4) | 0, e)
                if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
            } else {
                f[a >> 2] = 0
                f[(a + 4) >> 2] = 0
                f[(a + 8) >> 2] = 0
                f[(a + 12) >> 2] = 0
            }
            u = d
            return
        }
        function Ki(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0
            c = (b + 48) | 0
            if ((Yh(f[c >> 2] | 0) | 0) > 9) {
                d = 0
                return d | 0
            }
            if ((Qa[f[((f[b >> 2] | 0) + 8) >> 2] & 127](b) | 0) != 1) {
                d = 0
                return d | 0
            }
            e = (b + 4) | 0
            b = ((f[((f[((f[e >> 2] | 0) + 8) >> 2] | 0) + (a << 2)) >> 2] | 0) + 56) | 0
            a = f[b >> 2] | 0
            do
                if ((a | 0) == 3)
                    if ((Yh(f[c >> 2] | 0) | 0) < 4) {
                        d = 5
                        return d | 0
                    } else {
                        g = f[b >> 2] | 0
                        break
                    }
                else g = a
            while (0)
            a = Yh(f[c >> 2] | 0) | 0
            if ((g | 0) == 1) {
                d = (a | 0) < 4 ? 6 : 0
                return d | 0
            }
            if ((a | 0) > 7) {
                d = 0
                return d | 0
            }
            if ((Yh(f[c >> 2] | 0) | 0) > 1) {
                d = 1
                return d | 0
            } else return ((f[((f[e >> 2] | 0) + 80) >> 2] | 0) >>> 0 < 40 ? 1 : 4) | 0
            return 0
        }
        function Li(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 1892
            b = f[(a + 152) >> 2] | 0
            if (b | 0) {
                c = (a + 156) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 112) >> 2] | 0
            if (b | 0) {
                d = (a + 116) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 96) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 84) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 72) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 60) >> 2] | 0
            if (b | 0) br(b)
            f[a >> 2] = 1528
            b = f[(a + 32) >> 2] | 0
            if (!b) return
            c = (a + 36) | 0
            a = f[c >> 2] | 0
            if ((a | 0) != (b | 0)) f[c >> 2] = a + (~(((a + -4 - b) | 0) >>> 2) << 2)
            br(b)
            return
        }
        function Mi(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0
            g = u
            u = (u + 128) | 0
            h = (g + 124) | 0
            i = g
            j = i
            k = 6284
            l = (j + 124) | 0
            do {
                f[j >> 2] = f[k >> 2]
                j = (j + 4) | 0
                k = (k + 4) | 0
            } while ((j | 0) < (l | 0))
            if (((c + -1) | 0) >>> 0 > 2147483646)
                if (!c) {
                    m = h
                    n = 1
                    o = 4
                } else {
                    h = ir() | 0
                    f[h >> 2] = 75
                    p = -1
                }
            else {
                m = a
                n = c
                o = 4
            }
            if ((o | 0) == 4) {
                o = (-2 - m) | 0
                c = n >>> 0 > o >>> 0 ? o : n
                f[(i + 48) >> 2] = c
                n = (i + 20) | 0
                f[n >> 2] = m
                f[(i + 44) >> 2] = m
                o = (m + c) | 0
                m = (i + 16) | 0
                f[m >> 2] = o
                f[(i + 28) >> 2] = o
                o = hh(i, d, e) | 0
                if (!c) p = o
                else {
                    c = f[n >> 2] | 0
                    b[(c + ((((c | 0) == (f[m >> 2] | 0)) << 31) >> 31)) >> 0] = 0
                    p = o
                }
            }
            u = g
            return p | 0
        }
        function Ni(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0
            f[a >> 2] = 3080
            c = (a + 72) | 0
            d = (a + 136) | 0
            e = (a + 4) | 0
            g = (e + 64) | 0
            do {
                f[e >> 2] = 0
                e = (e + 4) | 0
            } while ((e | 0) < (g | 0))
            e = c
            g = (e + 64) | 0
            do {
                f[e >> 2] = 0
                e = (e + 4) | 0
            } while ((e | 0) < (g | 0))
            n[d >> 2] = $(1.0)
            d = (a + 140) | 0
            f[d >> 2] = 0
            f[(d + 4) >> 2] = 0
            f[(d + 8) >> 2] = 0
            f[(d + 12) >> 2] = 0
            f[(d + 16) >> 2] = 0
            f[(d + 20) >> 2] = 0
            f[(a + 164) >> 2] = -1
            d = (a + 168) | 0
            f[d >> 2] = 0
            f[(d + 4) >> 2] = 0
            f[(d + 8) >> 2] = 0
            f[(d + 12) >> 2] = 0
            f[(d + 16) >> 2] = 0
            f[(d + 20) >> 2] = 0
            f[(d + 24) >> 2] = 0
            rn((a + 200) | 0)
            Cn((a + 232) | 0)
            d = (a + 264) | 0
            f[d >> 2] = 0
            f[(d + 4) >> 2] = 0
            f[(d + 8) >> 2] = 0
            f[(d + 12) >> 2] = 0
            f[(d + 16) >> 2] = 0
            f[(d + 20) >> 2] = 0
            b[(d + 24) >> 0] = 0
            return
        }
        function Oi(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = +e
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            a = u
            u = (u + 16) | 0
            g = a
            if (!c) {
                h = 0
                u = a
                return h | 0
            }
            f[g >> 2] = 0
            f[(g + 4) >> 2] = 0
            f[(g + 8) >> 2] = 0
            i = vj(d) | 0
            if (i >>> 0 > 4294967279) mq(g)
            if (i >>> 0 < 11) {
                b[(g + 11) >> 0] = i
                if (!i) j = g
                else {
                    k = g
                    l = 7
                }
            } else {
                m = (i + 16) & -16
                n = dn(m) | 0
                f[g >> 2] = n
                f[(g + 8) >> 2] = m | -2147483648
                f[(g + 4) >> 2] = i
                k = n
                l = 7
            }
            if ((l | 0) == 7) {
                Rg(k | 0, d | 0, i | 0) | 0
                j = k
            }
            b[(j + i) >> 0] = 0
            Ol(c, g, e)
            if ((b[(g + 11) >> 0] | 0) < 0) br(f[g >> 2] | 0)
            h = 1
            u = a
            return h | 0
        }
        function Pi(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            a = u
            u = (u + 16) | 0
            g = a
            if (!c) {
                h = 0
                u = a
                return h | 0
            }
            f[g >> 2] = 0
            f[(g + 4) >> 2] = 0
            f[(g + 8) >> 2] = 0
            i = vj(d) | 0
            if (i >>> 0 > 4294967279) mq(g)
            if (i >>> 0 < 11) {
                b[(g + 11) >> 0] = i
                if (!i) j = g
                else {
                    k = g
                    l = 7
                }
            } else {
                m = (i + 16) & -16
                n = dn(m) | 0
                f[g >> 2] = n
                f[(g + 8) >> 2] = m | -2147483648
                f[(g + 4) >> 2] = i
                k = n
                l = 7
            }
            if ((l | 0) == 7) {
                Rg(k | 0, d | 0, i | 0) | 0
                j = k
            }
            b[(j + i) >> 0] = 0
            Pl(c, g, e)
            if ((b[(g + 11) >> 0] | 0) < 0) br(f[g >> 2] | 0)
            h = 1
            u = a
            return h | 0
        }
        function Qi(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0
            c = f[(a + 28) >> 2] | 0
            if (c | 0) {
                d = c
                do {
                    c = d
                    d = f[d >> 2] | 0
                    e = (c + 8) | 0
                    g = (c + 20) | 0
                    h = f[g >> 2] | 0
                    f[g >> 2] = 0
                    if (h | 0) {
                        Qi(h)
                        br(h)
                    }
                    if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
                    br(c)
                } while ((d | 0) != 0)
            }
            d = (a + 20) | 0
            c = f[d >> 2] | 0
            f[d >> 2] = 0
            if (c | 0) br(c)
            c = f[(a + 8) >> 2] | 0
            if (c | 0) {
                d = c
                do {
                    c = d
                    d = f[d >> 2] | 0
                    e = (c + 8) | 0
                    h = f[(c + 20) >> 2] | 0
                    if (h | 0) {
                        g = (c + 24) | 0
                        if ((f[g >> 2] | 0) != (h | 0)) f[g >> 2] = h
                        br(h)
                    }
                    if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
                    br(c)
                } while ((d | 0) != 0)
            }
            d = f[a >> 2] | 0
            f[a >> 2] = 0
            if (!d) return
            br(d)
            return
        }
        function Ri(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            d = u
            u = (u + 16) | 0
            e = d
            Wa[f[((f[c >> 2] | 0) + 64) >> 2] & 15](a, c)
            if (f[a >> 2] | 0) {
                u = d
                return
            }
            g = (a + 4) | 0
            if ((b[(g + 11) >> 0] | 0) < 0) br(f[g >> 2] | 0)
            g = f[(c + 48) >> 2] | 0
            h = dn(32) | 0
            f[e >> 2] = h
            f[(e + 8) >> 2] = -2147483616
            f[(e + 4) >> 2] = 29
            i = h
            j = 14510
            k = (i + 29) | 0
            do {
                b[i >> 0] = b[j >> 0] | 0
                i = (i + 1) | 0
                j = (j + 1) | 0
            } while ((i | 0) < (k | 0))
            b[(h + 29) >> 0] = 0
            h = Oj(g, e, 0) | 0
            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
            if (h) Va[f[((f[c >> 2] | 0) + 68) >> 2] & 127](c)
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            f[(a + 12) >> 2] = 0
            u = d
            return
        }
        function Si(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0
            e = u
            u = (u + 16) | 0
            g = e
            h = f[(c + 48) >> 2] | 0
            if (!h) {
                i = dn(32) | 0
                f[g >> 2] = i
                f[(g + 8) >> 2] = -2147483616
                f[(g + 4) >> 2] = 23
                j = i
                k = 14670
                l = (j + 23) | 0
                do {
                    b[j >> 0] = b[k >> 0] | 0
                    j = (j + 1) | 0
                    k = (k + 1) | 0
                } while ((j | 0) < (l | 0))
                b[(i + 23) >> 0] = 0
                f[a >> 2] = -1
                dj((a + 4) | 0, g)
                if ((b[(g + 11) >> 0] | 0) < 0) br(f[g >> 2] | 0)
                u = e
                return
            }
            g = f[(c + 52) >> 2] | 0
            if (!g) {
                Ic(a, c, h, d)
                u = e
                return
            } else {
                jg(a, c, g, d)
                u = e
                return
            }
        }
        function Ti(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0
            lk(a)
            b = (a + 84) | 0
            c = f[b >> 2] | 0
            if ((c | 0) <= 0) return
            d = c << 5
            e = _q((c >>> 0 > 134217727) | (d >>> 0 > 4294967291) ? -1 : (d + 4) | 0) | 0
            f[e >> 2] = c
            d = (e + 4) | 0
            e = (d + (c << 5)) | 0
            c = d
            do {
                rn(c)
                c = (c + 32) | 0
            } while ((c | 0) != (e | 0))
            e = (a + 80) | 0
            a = f[e >> 2] | 0
            f[e >> 2] = d
            if (a | 0) {
                d = (a + -4) | 0
                c = f[d >> 2] | 0
                if (c | 0) {
                    g = (a + (c << 5)) | 0
                    do {
                        g = (g + -32) | 0
                        tj(g)
                    } while ((g | 0) != (a | 0))
                }
                $q(d)
            }
            if ((f[b >> 2] | 0) > 0) h = 0
            else return
            do {
                lk(((f[e >> 2] | 0) + (h << 5)) | 0)
                h = (h + 1) | 0
            } while ((h | 0) < (f[b >> 2] | 0))
            return
        }
        function Ui(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            if (!b) {
                d = 0
                return d | 0
            }
            if (f[(b + 4) >> 2] | 0) {
                d = 0
                return d | 0
            }
            a = dn(52) | 0
            Ub(a, c)
            f[(a + 40) >> 2] = 0
            f[(a + 44) >> 2] = 0
            f[(a + 48) >> 2] = 0
            c = (b + 4) | 0
            b = f[c >> 2] | 0
            f[c >> 2] = a
            if (!b) {
                d = 1
                return d | 0
            }
            a = (b + 40) | 0
            c = f[a >> 2] | 0
            if (c | 0) {
                e = (b + 44) | 0
                g = f[e >> 2] | 0
                if ((g | 0) == (c | 0)) h = c
                else {
                    i = g
                    do {
                        g = (i + -4) | 0
                        f[e >> 2] = g
                        j = f[g >> 2] | 0
                        f[g >> 2] = 0
                        if (j | 0) {
                            Qi(j)
                            br(j)
                        }
                        i = f[e >> 2] | 0
                    } while ((i | 0) != (c | 0))
                    h = f[a >> 2] | 0
                }
                br(h)
            }
            Qi(b)
            br(b)
            d = 1
            return d | 0
        }
        function Vi(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0
            c = f[a >> 2] | 0
            if (b) {
                b = (c + 8) | 0
                d = b
                e = Tn(f[d >> 2] | 0, f[(d + 4) >> 2] | 0, 1, 0) | 0
                d = b
                f[d >> 2] = e
                f[(d + 4) >> 2] = I
                d = (a + 28) | 0
                e = f[d >> 2] | 0
                b = (a + 24) | 0
                f[b >> 2] = f[b >> 2] | (1 << e)
                g = d
                h = e
            } else {
                e = c
                d = Tn(f[e >> 2] | 0, f[(e + 4) >> 2] | 0, 1, 0) | 0
                e = c
                f[e >> 2] = d
                f[(e + 4) >> 2] = I
                e = (a + 28) | 0
                g = e
                h = f[e >> 2] | 0
            }
            e = (h + 1) | 0
            f[g >> 2] = e
            if ((e | 0) != 32) return
            e = (a + 24) | 0
            h = (a + 16) | 0
            d = f[h >> 2] | 0
            if ((d | 0) == (f[(a + 20) >> 2] | 0)) Ci((a + 12) | 0, e)
            else {
                f[d >> 2] = f[e >> 2]
                f[h >> 2] = d + 4
            }
            f[g >> 2] = 0
            f[e >> 2] = 0
            return
        }
        function Wi(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0
            c = (a + 32) | 0
            a = f[b >> 2] | 0
            f[b >> 2] = 0
            b = f[c >> 2] | 0
            f[c >> 2] = a
            if (!b) return
            a = (b + 88) | 0
            c = f[a >> 2] | 0
            f[a >> 2] = 0
            if (c | 0) {
                a = f[(c + 8) >> 2] | 0
                if (a | 0) {
                    d = (c + 12) | 0
                    if ((f[d >> 2] | 0) != (a | 0)) f[d >> 2] = a
                    br(a)
                }
                br(c)
            }
            c = f[(b + 68) >> 2] | 0
            if (c | 0) {
                a = (b + 72) | 0
                d = f[a >> 2] | 0
                if ((d | 0) != (c | 0)) f[a >> 2] = d + (~(((d + -4 - c) | 0) >>> 2) << 2)
                br(c)
            }
            c = (b + 64) | 0
            d = f[c >> 2] | 0
            f[c >> 2] = 0
            if (d | 0) {
                c = f[d >> 2] | 0
                if (c | 0) {
                    a = (d + 4) | 0
                    if ((f[a >> 2] | 0) != (c | 0)) f[a >> 2] = c
                    br(c)
                }
                br(d)
            }
            br(b)
            return
        }
        function Xi(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            e = u
            u = (u + 16) | 0
            g = e
            if (c | 0) {
                h = (a + 11) | 0
                i = b[h >> 0] | 0
                if ((i << 24) >> 24 < 0) {
                    j = f[(a + 4) >> 2] | 0
                    k = ((f[(a + 8) >> 2] & 2147483647) + -1) | 0
                } else {
                    j = i & 255
                    k = 10
                }
                if (((k - j) | 0) >>> 0 < c >>> 0) {
                    lj(a, k, (c - k + j) | 0, j, j, 0, 0)
                    l = b[h >> 0] | 0
                } else l = i
                if ((l << 24) >> 24 < 0) m = f[a >> 2] | 0
                else m = a
                On((m + j) | 0, c, d) | 0
                d = (j + c) | 0
                if ((b[h >> 0] | 0) < 0) f[(a + 4) >> 2] = d
                else b[h >> 0] = d
                b[g >> 0] = 0
                Hp((m + d) | 0, g)
            }
            u = e
            return a | 0
        }
        function Yi(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            d = u
            u = (u + 48) | 0
            e = (d + 4) | 0
            g = d
            h = f[(b + 12) >> 2] | 0
            i = f[(b + 4) >> 2] | 0
            b = e
            j = (b + 36) | 0
            do {
                f[b >> 2] = 0
                b = (b + 4) | 0
            } while ((b | 0) < (j | 0))
            gh(g, c, h, i, e)
            i = f[(e + 24) >> 2] | 0
            if (!i) {
                k = f[g >> 2] | 0
                f[a >> 2] = k
                u = d
                return
            }
            h = (e + 28) | 0
            e = f[h >> 2] | 0
            if ((e | 0) != (i | 0)) f[h >> 2] = e + (~(((e + -4 - i) | 0) >>> 2) << 2)
            br(i)
            k = f[g >> 2] | 0
            f[a >> 2] = k
            u = d
            return
        }
        function Zi(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            e = u
            u = (u + 16) | 0
            g = e
            h = (a + 11) | 0
            i = b[h >> 0] | 0
            j = (i << 24) >> 24 < 0
            if (j) k = ((f[(a + 8) >> 2] & 2147483647) + -1) | 0
            else k = 10
            do
                if (k >>> 0 >= d >>> 0) {
                    if (j) l = f[a >> 2] | 0
                    else l = a
                    Jo(l, c, d) | 0
                    b[g >> 0] = 0
                    Hp((l + d) | 0, g)
                    if ((b[h >> 0] | 0) < 0) {
                        f[(a + 4) >> 2] = d
                        break
                    } else {
                        b[h >> 0] = d
                        break
                    }
                } else {
                    if (j) m = f[(a + 4) >> 2] | 0
                    else m = i & 255
                    ni(a, k, (d - k) | 0, m, 0, m, d, c)
                }
            while (0)
            u = e
            return a | 0
        }
        function _i(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0
            b = f[a >> 2] | 0
            if (!b) return
            c = (a + 4) | 0
            d = f[c >> 2] | 0
            if ((d | 0) == (b | 0)) e = b
            else {
                g = d
                do {
                    f[c >> 2] = g + -136
                    d = f[(g + -20) >> 2] | 0
                    if (d | 0) {
                        h = (g + -16) | 0
                        i = f[h >> 2] | 0
                        if ((i | 0) != (d | 0)) f[h >> 2] = i + (~(((i + -4 - d) | 0) >>> 2) << 2)
                        br(d)
                    }
                    d = f[(g + -32) >> 2] | 0
                    if (d | 0) {
                        i = (g + -28) | 0
                        h = f[i >> 2] | 0
                        if ((h | 0) != (d | 0)) f[i >> 2] = h + (~(((h + -4 - d) | 0) >>> 2) << 2)
                        br(d)
                    }
                    yi((g + -132) | 0)
                    g = f[c >> 2] | 0
                } while ((g | 0) != (b | 0))
                e = f[a >> 2] | 0
            }
            br(e)
            return
        }
        function $i(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0
            e = u
            u = (u + 16) | 0
            g = e
            h = (a + 11) | 0
            i = b[h >> 0] | 0
            j = (i << 24) >> 24 < 0
            if (j) {
                k = f[(a + 4) >> 2] | 0
                l = ((f[(a + 8) >> 2] & 2147483647) + -1) | 0
            } else {
                k = i & 255
                l = 10
            }
            if (((l - k) | 0) >>> 0 >= d >>> 0) {
                if (d | 0) {
                    if (j) m = f[a >> 2] | 0
                    else m = a
                    Lo((m + k) | 0, c, d) | 0
                    j = (k + d) | 0
                    if ((b[h >> 0] | 0) < 0) f[(a + 4) >> 2] = j
                    else b[h >> 0] = j
                    b[g >> 0] = 0
                    Hp((m + j) | 0, g)
                }
            } else ni(a, l, (d - l + k) | 0, k, k, 0, d, c)
            u = e
            return a | 0
        }
        function aj(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0
            f[a >> 2] = 3608
            b = f[(a + 32) >> 2] | 0
            if (b | 0) {
                c = (a + 36) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 20) >> 2] | 0
            if (b | 0) {
                d = (a + 24) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = (a + 8) | 0
            c = f[b >> 2] | 0
            if (!c) return
            d = (a + 12) | 0
            a = f[d >> 2] | 0
            if ((a | 0) == (c | 0)) e = c
            else {
                g = a
                do {
                    a = (g + -4) | 0
                    f[d >> 2] = a
                    h = f[a >> 2] | 0
                    f[a >> 2] = 0
                    if (h | 0) Va[f[((f[h >> 2] | 0) + 4) >> 2] & 127](h)
                    g = f[d >> 2] | 0
                } while ((g | 0) != (c | 0))
                e = f[b >> 2] | 0
            }
            br(e)
            return
        }
        function bj(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0
            c = (a + 4) | 0
            if ((Qa[f[((f[b >> 2] | 0) + 20) >> 2] & 127](b) | 0) <= 0) {
                d = 1
                return d | 0
            }
            a = 0
            while (1) {
                e = f[((f[c >> 2] | 0) + 4) >> 2] | 0
                g = Tl(e, Ra[f[((f[b >> 2] | 0) + 24) >> 2] & 127](b, a) | 0) | 0
                if ((g | 0) == -1) {
                    d = 0
                    h = 6
                    break
                }
                e = f[((f[b >> 2] | 0) + 28) >> 2] | 0
                i = $k(f[c >> 2] | 0, g) | 0
                a = (a + 1) | 0
                if (!(Ra[e & 127](b, i) | 0)) {
                    d = 0
                    h = 6
                    break
                }
                if ((a | 0) >= (Qa[f[((f[b >> 2] | 0) + 20) >> 2] & 127](b) | 0)) {
                    d = 1
                    h = 6
                    break
                }
            }
            if ((h | 0) == 6) return d | 0
            return 0
        }
        function cj(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            if (!(lo(a, b, c) | 0)) {
                d = 0
                return d | 0
            }
            if (!(Qa[f[((f[a >> 2] | 0) + 52) >> 2] & 127](a) | 0)) {
                d = 0
                return d | 0
            }
            c = (a + 4) | 0
            e = (a + 8) | 0
            g = f[c >> 2] | 0
            if ((f[e >> 2] | 0) == (g | 0)) {
                d = 1
                return d | 0
            }
            h = (a + 36) | 0
            a = 0
            i = g
            while (1) {
                g = f[((f[h >> 2] | 0) + (a << 2)) >> 2] | 0
                if (!(Sa[f[((f[g >> 2] | 0) + 8) >> 2] & 31](g, b, f[(i + (a << 2)) >> 2] | 0) | 0)) {
                    d = 0
                    j = 7
                    break
                }
                a = (a + 1) | 0
                i = f[c >> 2] | 0
                if (a >>> 0 >= (((f[e >> 2] | 0) - i) >> 2) >>> 0) {
                    d = 1
                    j = 7
                    break
                }
            }
            if ((j | 0) == 7) return d | 0
            return 0
        }
        function dj(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            d = u
            u = (u + 16) | 0
            e = d
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            if ((b[(c + 11) >> 0] | 0) < 0) {
                g = f[c >> 2] | 0
                h = f[(c + 4) >> 2] | 0
                if (h >>> 0 > 4294967279) mq(a)
                if (h >>> 0 < 11) {
                    b[(a + 11) >> 0] = h
                    i = a
                } else {
                    j = (h + 16) & -16
                    k = dn(j) | 0
                    f[a >> 2] = k
                    f[(a + 8) >> 2] = j | -2147483648
                    f[(a + 4) >> 2] = h
                    i = k
                }
                Lo(i, g, h) | 0
                b[e >> 0] = 0
                Hp((i + h) | 0, e)
            } else {
                f[a >> 2] = f[c >> 2]
                f[(a + 4) >> 2] = f[(c + 4) >> 2]
                f[(a + 8) >> 2] = f[(c + 8) >> 2]
            }
            u = d
            return
        }
        function ej(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0
            c = u
            u = (u + 16) | 0
            d = (c + 8) | 0
            e = (c + 4) | 0
            g = c
            f[g >> 2] = f[((f[(b + 4) >> 2] | 0) + 80) >> 2]
            h = f[(b + 44) >> 2] | 0
            b = (h + 16) | 0
            i = f[(b + 4) >> 2] | 0
            if (((i | 0) > 0) | (((i | 0) == 0) & ((f[b >> 2] | 0) >>> 0 > 0))) {
                f[a >> 2] = 0
                f[(a + 4) >> 2] = 0
                f[(a + 8) >> 2] = 0
                f[(a + 12) >> 2] = 0
                u = c
                return
            }
            f[e >> 2] = f[(h + 4) >> 2]
            f[d >> 2] = f[e >> 2]
            ye(h, d, g, (g + 4) | 0) | 0
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            f[(a + 12) >> 2] = 0
            u = c
            return
        }
        function fj(a, c, d, e, g) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            var h = 0,
                i = 0
            b[(c + 53) >> 0] = 1
            do
                if ((f[(c + 4) >> 2] | 0) == (e | 0)) {
                    b[(c + 52) >> 0] = 1
                    a = (c + 16) | 0
                    h = f[a >> 2] | 0
                    if (!h) {
                        f[a >> 2] = d
                        f[(c + 24) >> 2] = g
                        f[(c + 36) >> 2] = 1
                        if (!((g | 0) == 1 ? (f[(c + 48) >> 2] | 0) == 1 : 0)) break
                        b[(c + 54) >> 0] = 1
                        break
                    }
                    if ((h | 0) != (d | 0)) {
                        h = (c + 36) | 0
                        f[h >> 2] = (f[h >> 2] | 0) + 1
                        b[(c + 54) >> 0] = 1
                        break
                    }
                    h = (c + 24) | 0
                    a = f[h >> 2] | 0
                    if ((a | 0) == 2) {
                        f[h >> 2] = g
                        i = g
                    } else i = a
                    if ((i | 0) == 1 ? (f[(c + 48) >> 2] | 0) == 1 : 0) b[(c + 54) >> 0] = 1
                }
            while (0)
            return
        }
        function gj(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            c = (a + 36) | 0
            d = (a + 40) | 0
            e = f[c >> 2] | 0
            if ((f[d >> 2] | 0) != (e | 0)) {
                g = 0
                h = e
                do {
                    eg((h + ((g * 24) | 0)) | 0, b) | 0
                    g = (g + 1) | 0
                    h = f[c >> 2] | 0
                } while (g >>> 0 < (((((f[d >> 2] | 0) - h) | 0) / 24) | 0) >>> 0)
            }
            h = (a + 48) | 0
            d = (a + 52) | 0
            a = f[h >> 2] | 0
            if ((f[d >> 2] | 0) == (a | 0)) return 1
            else {
                i = 0
                j = a
            }
            do {
                a = f[(j + (i << 2)) >> 2] | 0
                Nh((a << 1) ^ (a >> 31), b) | 0
                i = (i + 1) | 0
                j = f[h >> 2] | 0
            } while (i >>> 0 < (((f[d >> 2] | 0) - j) >> 2) >>> 0)
            return 1
        }
        function hj(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0
            e = (a + d) | 0
            c = c & 255
            if ((d | 0) >= 67) {
                while (a & 3) {
                    b[a >> 0] = c
                    a = (a + 1) | 0
                }
                g = (e & -4) | 0
                h = (g - 64) | 0
                i = c | (c << 8) | (c << 16) | (c << 24)
                while ((a | 0) <= (h | 0)) {
                    f[a >> 2] = i
                    f[(a + 4) >> 2] = i
                    f[(a + 8) >> 2] = i
                    f[(a + 12) >> 2] = i
                    f[(a + 16) >> 2] = i
                    f[(a + 20) >> 2] = i
                    f[(a + 24) >> 2] = i
                    f[(a + 28) >> 2] = i
                    f[(a + 32) >> 2] = i
                    f[(a + 36) >> 2] = i
                    f[(a + 40) >> 2] = i
                    f[(a + 44) >> 2] = i
                    f[(a + 48) >> 2] = i
                    f[(a + 52) >> 2] = i
                    f[(a + 56) >> 2] = i
                    f[(a + 60) >> 2] = i
                    a = (a + 64) | 0
                }
                while ((a | 0) < (g | 0)) {
                    f[a >> 2] = i
                    a = (a + 4) | 0
                }
            }
            while ((a | 0) < (e | 0)) {
                b[a >> 0] = c
                a = (a + 1) | 0
            }
            return (e - d) | 0
        }
        function ij(a, c, d, e, g) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            var h = 0
            do
                if (!(qp(a, f[(c + 8) >> 2] | 0, g) | 0)) {
                    if (qp(a, f[c >> 2] | 0, g) | 0) {
                        if ((f[(c + 16) >> 2] | 0) != (d | 0) ? ((h = (c + 20) | 0), (f[h >> 2] | 0) != (d | 0)) : 0) {
                            f[(c + 32) >> 2] = e
                            f[h >> 2] = d
                            h = (c + 40) | 0
                            f[h >> 2] = (f[h >> 2] | 0) + 1
                            if ((f[(c + 36) >> 2] | 0) == 1 ? (f[(c + 24) >> 2] | 0) == 2 : 0) b[(c + 54) >> 0] = 1
                            f[(c + 44) >> 2] = 4
                            break
                        }
                        if ((e | 0) == 1) f[(c + 32) >> 2] = 1
                    }
                } else Om(0, c, d, e)
            while (0)
            return
        }
        function jj(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0
            b = (a + 80) | 0
            c = f[b >> 2] | 0
            f[b >> 2] = 0
            if (c | 0) {
                b = (c + -4) | 0
                d = f[b >> 2] | 0
                if (d | 0) {
                    e = (c + (d << 5)) | 0
                    do {
                        e = (e + -32) | 0
                        tj(e)
                    } while ((e | 0) != (c | 0))
                }
                $q(b)
            }
            b = f[(a + 68) >> 2] | 0
            if (b | 0) {
                c = (a + 72) | 0
                e = f[c >> 2] | 0
                if ((e | 0) != (b | 0)) f[c >> 2] = e + (~(((e + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = (a + 44) | 0
            e = f[b >> 2] | 0
            f[b >> 2] = 0
            if (e | 0) br(e)
            e = f[(a + 32) >> 2] | 0
            if (!e) {
                tj(a)
                return
            }
            b = (a + 36) | 0
            if ((f[b >> 2] | 0) != (e | 0)) f[b >> 2] = e
            br(e)
            tj(a)
            return
        }
        function kj(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 2684
            b = f[(a + 136) >> 2] | 0
            if (b | 0) {
                c = (a + 140) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 96) >> 2] | 0
            if (b | 0) {
                d = (a + 100) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 76) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 64) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 52) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 40) >> 2] | 0
            if (!b) return
            br(b)
            return
        }
        function lj(a, c, d, e, g, h, i) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            h = h | 0
            i = i | 0
            var j = 0,
                k = 0,
                l = 0,
                m = 0
            if (((-17 - c) | 0) >>> 0 < d >>> 0) mq(a)
            if ((b[(a + 11) >> 0] | 0) < 0) j = f[a >> 2] | 0
            else j = a
            if (c >>> 0 < 2147483623) {
                k = (d + c) | 0
                d = c << 1
                l = k >>> 0 < d >>> 0 ? d : k
                m = l >>> 0 < 11 ? 11 : (l + 16) & -16
            } else m = -17
            l = dn(m) | 0
            if (g | 0) Lo(l, j, g) | 0
            k = (e - h - g) | 0
            if (k | 0) Lo((l + g + i) | 0, (j + g + h) | 0, k) | 0
            if ((c | 0) != 10) br(j)
            f[a >> 2] = l
            f[(a + 8) >> 2] = m | -2147483648
            return
        }
        function mj(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 2432
            b = f[(a + 136) >> 2] | 0
            if (b | 0) {
                c = (a + 140) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 96) >> 2] | 0
            if (b | 0) {
                d = (a + 100) | 0
                c = f[d >> 2] | 0
                if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 76) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 64) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 52) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 40) >> 2] | 0
            if (!b) return
            br(b)
            return
        }
        function nj(a, b) {
            a = a | 0
            b = b | 0
            if (!b) return
            else {
                nj(a, f[b >> 2] | 0)
                nj(a, f[(b + 4) >> 2] | 0)
                sj((b + 20) | 0, f[(b + 24) >> 2] | 0)
                br(b)
                return
            }
        }
        function oj(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0
            If(a, b, c)
            c = f[(a + 100) >> 2] | 0
            d = f[(a + 96) >> 2] | 0
            a = d
            if ((c | 0) == (d | 0)) return
            e = f[b >> 2] | 0
            b = (((c - d) | 0) / 12) | 0
            d = 0
            do {
                c = (a + ((d * 12) | 0)) | 0
                f[c >> 2] = f[(e + (f[c >> 2] << 2)) >> 2]
                c = (a + ((d * 12) | 0) + 4) | 0
                f[c >> 2] = f[(e + (f[c >> 2] << 2)) >> 2]
                c = (a + ((d * 12) | 0) + 8) | 0
                f[c >> 2] = f[(e + (f[c >> 2] << 2)) >> 2]
                d = (d + 1) | 0
            } while (d >>> 0 < b >>> 0)
            return
        }
        function pj(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            d = (a + 64) | 0
            if ((f[d >> 2] | 0) == 0 ? ((e = dn(32) | 0), tn(e), (g = f[d >> 2] | 0), (f[d >> 2] = e), g | 0) : 0) {
                e = f[g >> 2] | 0
                if (e | 0) {
                    h = (g + 4) | 0
                    if ((f[h >> 2] | 0) != (e | 0)) f[h >> 2] = e
                    br(e)
                }
                br(g)
            }
            g = Ll(f[(a + 28) >> 2] | 0) | 0
            e = X(g, b[(a + 24) >> 0] | 0) | 0
            g = (((e | 0) < 0) << 31) >> 31
            h = f[d >> 2] | 0
            i = on(e | 0, g | 0, c | 0, 0) | 0
            if (!(Th(h, 0, i, I) | 0)) {
                j = 0
                return j | 0
            }
            Ak(a, f[d >> 2] | 0, e, g, 0, 0)
            f[(a + 80) >> 2] = c
            j = 1
            return j | 0
        }
        function qj(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            d = u
            u = (u + 64) | 0
            e = d
            if (!(qp(a, b, 0) | 0))
                if ((b | 0) != 0 ? ((g = mh(b, 1024, 1008, 0) | 0), (g | 0) != 0) : 0) {
                    b = (e + 4) | 0
                    h = (b + 52) | 0
                    do {
                        f[b >> 2] = 0
                        b = (b + 4) | 0
                    } while ((b | 0) < (h | 0))
                    f[e >> 2] = g
                    f[(e + 8) >> 2] = a
                    f[(e + 12) >> 2] = -1
                    f[(e + 48) >> 2] = 1
                    Ya[f[((f[g >> 2] | 0) + 28) >> 2] & 7](g, e, f[c >> 2] | 0, 1)
                    if ((f[(e + 24) >> 2] | 0) == 1) {
                        f[c >> 2] = f[(e + 16) >> 2]
                        i = 1
                    } else i = 0
                    j = i
                } else j = 0
            else j = 1
            u = d
            return j | 0
        }
        function rj(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0
            if (!c) {
                d = 0
                return d | 0
            }
            e = (c + 40) | 0
            g = (c + 44) | 0
            Nh(((f[g >> 2] | 0) - (f[e >> 2] | 0)) >> 2, b) | 0
            h = f[e >> 2] | 0
            e = f[g >> 2] | 0
            if ((h | 0) != (e | 0)) {
                g = h
                do {
                    h = f[g >> 2] | 0
                    if (h | 0) {
                        Nh(f[(h + 40) >> 2] | 0, b) | 0
                        Wf(a, b, h) | 0
                    }
                    g = (g + 4) | 0
                } while ((g | 0) != (e | 0))
            }
            Wf(a, b, c) | 0
            d = 1
            return d | 0
        }
        function sj(a, c) {
            a = a | 0
            c = c | 0
            var d = 0
            if (!c) return
            sj(a, f[c >> 2] | 0)
            sj(a, f[(c + 4) >> 2] | 0)
            a = (c + 16) | 0
            d = (c + 28) | 0
            if ((b[(d + 11) >> 0] | 0) < 0) br(f[d >> 2] | 0)
            if ((b[(a + 11) >> 0] | 0) < 0) br(f[a >> 2] | 0)
            br(c)
            return
        }
        function tj(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0
            b = u
            u = (u + 16) | 0
            c = b
            d = c
            f[d >> 2] = 0
            f[(d + 4) >> 2] = 0
            cf(a, 2, c)
            c = f[(a + 12) >> 2] | 0
            d = (a + 16) | 0
            e = f[d >> 2] | 0
            if ((e | 0) == (c | 0)) g = c
            else {
                h = (e + (~(((e + -4 - c) | 0) >>> 2) << 2)) | 0
                f[d >> 2] = h
                g = h
            }
            f[(a + 24) >> 2] = 0
            f[(a + 28) >> 2] = 0
            if (c | 0) {
                if ((g | 0) != (c | 0)) f[d >> 2] = g + (~(((g + -4 - c) | 0) >>> 2) << 2)
                br(c)
            }
            c = f[a >> 2] | 0
            if (!c) {
                u = b
                return
            }
            g = (a + 4) | 0
            a = f[g >> 2] | 0
            if ((a | 0) != (c | 0)) f[g >> 2] = a + (~(((a + -8 - c) | 0) >>> 3) << 3)
            br(c)
            u = b
            return
        }
        function $a(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0,
                xa = 0,
                ya = 0,
                za = 0
            b = u
            u = (u + 16) | 0
            c = b
            do
                if (a >>> 0 < 245) {
                    d = a >>> 0 < 11 ? 16 : (a + 11) & -8
                    e = d >>> 3
                    g = f[4512] | 0
                    h = g >>> e
                    if ((h & 3) | 0) {
                        i = (((h & 1) ^ 1) + e) | 0
                        j = (18088 + ((i << 1) << 2)) | 0
                        k = (j + 8) | 0
                        l = f[k >> 2] | 0
                        m = (l + 8) | 0
                        n = f[m >> 2] | 0
                        if ((n | 0) == (j | 0)) f[4512] = g & ~(1 << i)
                        else {
                            f[(n + 12) >> 2] = j
                            f[k >> 2] = n
                        }
                        n = i << 3
                        f[(l + 4) >> 2] = n | 3
                        i = (l + n + 4) | 0
                        f[i >> 2] = f[i >> 2] | 1
                        o = m
                        u = b
                        return o | 0
                    }
                    m = f[4514] | 0
                    if (d >>> 0 > m >>> 0) {
                        if (h | 0) {
                            i = 2 << e
                            n = (h << e) & (i | (0 - i))
                            i = ((n & (0 - n)) + -1) | 0
                            n = (i >>> 12) & 16
                            e = i >>> n
                            i = (e >>> 5) & 8
                            h = e >>> i
                            e = (h >>> 2) & 4
                            l = h >>> e
                            h = (l >>> 1) & 2
                            k = l >>> h
                            l = (k >>> 1) & 1
                            j = ((i | n | e | h | l) + (k >>> l)) | 0
                            l = (18088 + ((j << 1) << 2)) | 0
                            k = (l + 8) | 0
                            h = f[k >> 2] | 0
                            e = (h + 8) | 0
                            n = f[e >> 2] | 0
                            if ((n | 0) == (l | 0)) {
                                i = g & ~(1 << j)
                                f[4512] = i
                                p = i
                            } else {
                                f[(n + 12) >> 2] = l
                                f[k >> 2] = n
                                p = g
                            }
                            n = j << 3
                            j = (n - d) | 0
                            f[(h + 4) >> 2] = d | 3
                            k = (h + d) | 0
                            f[(k + 4) >> 2] = j | 1
                            f[(h + n) >> 2] = j
                            if (m | 0) {
                                n = f[4517] | 0
                                h = m >>> 3
                                l = (18088 + ((h << 1) << 2)) | 0
                                i = 1 << h
                                if (!(p & i)) {
                                    f[4512] = p | i
                                    q = l
                                    r = (l + 8) | 0
                                } else {
                                    i = (l + 8) | 0
                                    q = f[i >> 2] | 0
                                    r = i
                                }
                                f[r >> 2] = n
                                f[(q + 12) >> 2] = n
                                f[(n + 8) >> 2] = q
                                f[(n + 12) >> 2] = l
                            }
                            f[4514] = j
                            f[4517] = k
                            o = e
                            u = b
                            return o | 0
                        }
                        e = f[4513] | 0
                        if (e) {
                            k = ((e & (0 - e)) + -1) | 0
                            j = (k >>> 12) & 16
                            l = k >>> j
                            k = (l >>> 5) & 8
                            n = l >>> k
                            l = (n >>> 2) & 4
                            i = n >>> l
                            n = (i >>> 1) & 2
                            h = i >>> n
                            i = (h >>> 1) & 1
                            s = f[(18352 + (((k | j | l | n | i) + (h >>> i)) << 2)) >> 2] | 0
                            i = ((f[(s + 4) >> 2] & -8) - d) | 0
                            h = f[(s + 16 + ((((f[(s + 16) >> 2] | 0) == 0) & 1) << 2)) >> 2] | 0
                            if (!h) {
                                t = s
                                v = i
                            } else {
                                n = s
                                s = i
                                i = h
                                while (1) {
                                    h = ((f[(i + 4) >> 2] & -8) - d) | 0
                                    l = h >>> 0 < s >>> 0
                                    j = l ? h : s
                                    h = l ? i : n
                                    i = f[(i + 16 + ((((f[(i + 16) >> 2] | 0) == 0) & 1) << 2)) >> 2] | 0
                                    if (!i) {
                                        t = h
                                        v = j
                                        break
                                    } else {
                                        n = h
                                        s = j
                                    }
                                }
                            }
                            s = (t + d) | 0
                            if (s >>> 0 > t >>> 0) {
                                n = f[(t + 24) >> 2] | 0
                                i = f[(t + 12) >> 2] | 0
                                do
                                    if ((i | 0) == (t | 0)) {
                                        j = (t + 20) | 0
                                        h = f[j >> 2] | 0
                                        if (!h) {
                                            l = (t + 16) | 0
                                            k = f[l >> 2] | 0
                                            if (!k) {
                                                w = 0
                                                break
                                            } else {
                                                x = k
                                                y = l
                                            }
                                        } else {
                                            x = h
                                            y = j
                                        }
                                        while (1) {
                                            j = (x + 20) | 0
                                            h = f[j >> 2] | 0
                                            if (h | 0) {
                                                x = h
                                                y = j
                                                continue
                                            }
                                            j = (x + 16) | 0
                                            h = f[j >> 2] | 0
                                            if (!h) break
                                            else {
                                                x = h
                                                y = j
                                            }
                                        }
                                        f[y >> 2] = 0
                                        w = x
                                    } else {
                                        j = f[(t + 8) >> 2] | 0
                                        f[(j + 12) >> 2] = i
                                        f[(i + 8) >> 2] = j
                                        w = i
                                    }
                                while (0)
                                do
                                    if (n | 0) {
                                        i = f[(t + 28) >> 2] | 0
                                        j = (18352 + (i << 2)) | 0
                                        if ((t | 0) == (f[j >> 2] | 0)) {
                                            f[j >> 2] = w
                                            if (!w) {
                                                f[4513] = e & ~(1 << i)
                                                break
                                            }
                                        } else {
                                            f[(n + 16 + ((((f[(n + 16) >> 2] | 0) != (t | 0)) & 1) << 2)) >> 2] = w
                                            if (!w) break
                                        }
                                        f[(w + 24) >> 2] = n
                                        i = f[(t + 16) >> 2] | 0
                                        if (i | 0) {
                                            f[(w + 16) >> 2] = i
                                            f[(i + 24) >> 2] = w
                                        }
                                        i = f[(t + 20) >> 2] | 0
                                        if (i | 0) {
                                            f[(w + 20) >> 2] = i
                                            f[(i + 24) >> 2] = w
                                        }
                                    }
                                while (0)
                                if (v >>> 0 < 16) {
                                    n = (v + d) | 0
                                    f[(t + 4) >> 2] = n | 3
                                    e = (t + n + 4) | 0
                                    f[e >> 2] = f[e >> 2] | 1
                                } else {
                                    f[(t + 4) >> 2] = d | 3
                                    f[(s + 4) >> 2] = v | 1
                                    f[(s + v) >> 2] = v
                                    if (m | 0) {
                                        e = f[4517] | 0
                                        n = m >>> 3
                                        i = (18088 + ((n << 1) << 2)) | 0
                                        j = 1 << n
                                        if (!(g & j)) {
                                            f[4512] = g | j
                                            z = i
                                            A = (i + 8) | 0
                                        } else {
                                            j = (i + 8) | 0
                                            z = f[j >> 2] | 0
                                            A = j
                                        }
                                        f[A >> 2] = e
                                        f[(z + 12) >> 2] = e
                                        f[(e + 8) >> 2] = z
                                        f[(e + 12) >> 2] = i
                                    }
                                    f[4514] = v
                                    f[4517] = s
                                }
                                o = (t + 8) | 0
                                u = b
                                return o | 0
                            } else B = d
                        } else B = d
                    } else B = d
                } else if (a >>> 0 <= 4294967231) {
                    i = (a + 11) | 0
                    e = i & -8
                    j = f[4513] | 0
                    if (j) {
                        n = (0 - e) | 0
                        h = i >>> 8
                        if (h)
                            if (e >>> 0 > 16777215) C = 31
                            else {
                                i = (((h + 1048320) | 0) >>> 16) & 8
                                l = h << i
                                h = (((l + 520192) | 0) >>> 16) & 4
                                k = l << h
                                l = (((k + 245760) | 0) >>> 16) & 2
                                D = (14 - (h | i | l) + ((k << l) >>> 15)) | 0
                                C = ((e >>> ((D + 7) | 0)) & 1) | (D << 1)
                            }
                        else C = 0
                        D = f[(18352 + (C << 2)) >> 2] | 0
                        a: do
                            if (!D) {
                                E = 0
                                F = 0
                                G = n
                                H = 57
                            } else {
                                l = 0
                                k = n
                                i = D
                                h = e << ((C | 0) == 31 ? 0 : (25 - (C >>> 1)) | 0)
                                I = 0
                                while (1) {
                                    J = ((f[(i + 4) >> 2] & -8) - e) | 0
                                    if (J >>> 0 < k >>> 0)
                                        if (!J) {
                                            K = 0
                                            L = i
                                            M = i
                                            H = 61
                                            break a
                                        } else {
                                            N = i
                                            O = J
                                        }
                                    else {
                                        N = l
                                        O = k
                                    }
                                    J = f[(i + 20) >> 2] | 0
                                    i = f[(i + 16 + ((h >>> 31) << 2)) >> 2] | 0
                                    P = ((J | 0) == 0) | ((J | 0) == (i | 0)) ? I : J
                                    J = (i | 0) == 0
                                    if (J) {
                                        E = P
                                        F = N
                                        G = O
                                        H = 57
                                        break
                                    } else {
                                        l = N
                                        k = O
                                        h = h << ((J ^ 1) & 1)
                                        I = P
                                    }
                                }
                            }
                        while (0)
                        if ((H | 0) == 57) {
                            if (((E | 0) == 0) & ((F | 0) == 0)) {
                                D = 2 << C
                                n = j & (D | (0 - D))
                                if (!n) {
                                    B = e
                                    break
                                }
                                D = ((n & (0 - n)) + -1) | 0
                                n = (D >>> 12) & 16
                                d = D >>> n
                                D = (d >>> 5) & 8
                                s = d >>> D
                                d = (s >>> 2) & 4
                                g = s >>> d
                                s = (g >>> 1) & 2
                                m = g >>> s
                                g = (m >>> 1) & 1
                                Q = 0
                                R = f[(18352 + (((D | n | d | s | g) + (m >>> g)) << 2)) >> 2] | 0
                            } else {
                                Q = F
                                R = E
                            }
                            if (!R) {
                                S = Q
                                T = G
                            } else {
                                K = G
                                L = R
                                M = Q
                                H = 61
                            }
                        }
                        if ((H | 0) == 61)
                            while (1) {
                                H = 0
                                g = ((f[(L + 4) >> 2] & -8) - e) | 0
                                m = g >>> 0 < K >>> 0
                                s = m ? g : K
                                g = m ? L : M
                                L = f[(L + 16 + ((((f[(L + 16) >> 2] | 0) == 0) & 1) << 2)) >> 2] | 0
                                if (!L) {
                                    S = g
                                    T = s
                                    break
                                } else {
                                    K = s
                                    M = g
                                    H = 61
                                }
                            }
                        if ((S | 0) != 0 ? T >>> 0 < (((f[4514] | 0) - e) | 0) >>> 0 : 0) {
                            g = (S + e) | 0
                            if (g >>> 0 <= S >>> 0) {
                                o = 0
                                u = b
                                return o | 0
                            }
                            s = f[(S + 24) >> 2] | 0
                            m = f[(S + 12) >> 2] | 0
                            do
                                if ((m | 0) == (S | 0)) {
                                    d = (S + 20) | 0
                                    n = f[d >> 2] | 0
                                    if (!n) {
                                        D = (S + 16) | 0
                                        I = f[D >> 2] | 0
                                        if (!I) {
                                            U = 0
                                            break
                                        } else {
                                            V = I
                                            W = D
                                        }
                                    } else {
                                        V = n
                                        W = d
                                    }
                                    while (1) {
                                        d = (V + 20) | 0
                                        n = f[d >> 2] | 0
                                        if (n | 0) {
                                            V = n
                                            W = d
                                            continue
                                        }
                                        d = (V + 16) | 0
                                        n = f[d >> 2] | 0
                                        if (!n) break
                                        else {
                                            V = n
                                            W = d
                                        }
                                    }
                                    f[W >> 2] = 0
                                    U = V
                                } else {
                                    d = f[(S + 8) >> 2] | 0
                                    f[(d + 12) >> 2] = m
                                    f[(m + 8) >> 2] = d
                                    U = m
                                }
                            while (0)
                            do
                                if (s) {
                                    m = f[(S + 28) >> 2] | 0
                                    d = (18352 + (m << 2)) | 0
                                    if ((S | 0) == (f[d >> 2] | 0)) {
                                        f[d >> 2] = U
                                        if (!U) {
                                            d = j & ~(1 << m)
                                            f[4513] = d
                                            X = d
                                            break
                                        }
                                    } else {
                                        f[(s + 16 + ((((f[(s + 16) >> 2] | 0) != (S | 0)) & 1) << 2)) >> 2] = U
                                        if (!U) {
                                            X = j
                                            break
                                        }
                                    }
                                    f[(U + 24) >> 2] = s
                                    d = f[(S + 16) >> 2] | 0
                                    if (d | 0) {
                                        f[(U + 16) >> 2] = d
                                        f[(d + 24) >> 2] = U
                                    }
                                    d = f[(S + 20) >> 2] | 0
                                    if (d) {
                                        f[(U + 20) >> 2] = d
                                        f[(d + 24) >> 2] = U
                                        X = j
                                    } else X = j
                                } else X = j
                            while (0)
                            do
                                if (T >>> 0 >= 16) {
                                    f[(S + 4) >> 2] = e | 3
                                    f[(g + 4) >> 2] = T | 1
                                    f[(g + T) >> 2] = T
                                    j = T >>> 3
                                    if (T >>> 0 < 256) {
                                        s = (18088 + ((j << 1) << 2)) | 0
                                        d = f[4512] | 0
                                        m = 1 << j
                                        if (!(d & m)) {
                                            f[4512] = d | m
                                            Y = s
                                            Z = (s + 8) | 0
                                        } else {
                                            m = (s + 8) | 0
                                            Y = f[m >> 2] | 0
                                            Z = m
                                        }
                                        f[Z >> 2] = g
                                        f[(Y + 12) >> 2] = g
                                        f[(g + 8) >> 2] = Y
                                        f[(g + 12) >> 2] = s
                                        break
                                    }
                                    s = T >>> 8
                                    if (s)
                                        if (T >>> 0 > 16777215) _ = 31
                                        else {
                                            m = (((s + 1048320) | 0) >>> 16) & 8
                                            d = s << m
                                            s = (((d + 520192) | 0) >>> 16) & 4
                                            j = d << s
                                            d = (((j + 245760) | 0) >>> 16) & 2
                                            n = (14 - (s | m | d) + ((j << d) >>> 15)) | 0
                                            _ = ((T >>> ((n + 7) | 0)) & 1) | (n << 1)
                                        }
                                    else _ = 0
                                    n = (18352 + (_ << 2)) | 0
                                    f[(g + 28) >> 2] = _
                                    d = (g + 16) | 0
                                    f[(d + 4) >> 2] = 0
                                    f[d >> 2] = 0
                                    d = 1 << _
                                    if (!(X & d)) {
                                        f[4513] = X | d
                                        f[n >> 2] = g
                                        f[(g + 24) >> 2] = n
                                        f[(g + 12) >> 2] = g
                                        f[(g + 8) >> 2] = g
                                        break
                                    }
                                    d = T << ((_ | 0) == 31 ? 0 : (25 - (_ >>> 1)) | 0)
                                    j = f[n >> 2] | 0
                                    while (1) {
                                        if (((f[(j + 4) >> 2] & -8) | 0) == (T | 0)) {
                                            H = 97
                                            break
                                        }
                                        $ = (j + 16 + ((d >>> 31) << 2)) | 0
                                        n = f[$ >> 2] | 0
                                        if (!n) {
                                            H = 96
                                            break
                                        } else {
                                            d = d << 1
                                            j = n
                                        }
                                    }
                                    if ((H | 0) == 96) {
                                        f[$ >> 2] = g
                                        f[(g + 24) >> 2] = j
                                        f[(g + 12) >> 2] = g
                                        f[(g + 8) >> 2] = g
                                        break
                                    } else if ((H | 0) == 97) {
                                        d = (j + 8) | 0
                                        n = f[d >> 2] | 0
                                        f[(n + 12) >> 2] = g
                                        f[d >> 2] = g
                                        f[(g + 8) >> 2] = n
                                        f[(g + 12) >> 2] = j
                                        f[(g + 24) >> 2] = 0
                                        break
                                    }
                                } else {
                                    n = (T + e) | 0
                                    f[(S + 4) >> 2] = n | 3
                                    d = (S + n + 4) | 0
                                    f[d >> 2] = f[d >> 2] | 1
                                }
                            while (0)
                            o = (S + 8) | 0
                            u = b
                            return o | 0
                        } else B = e
                    } else B = e
                } else B = -1
            while (0)
            S = f[4514] | 0
            if (S >>> 0 >= B >>> 0) {
                T = (S - B) | 0
                $ = f[4517] | 0
                if (T >>> 0 > 15) {
                    _ = ($ + B) | 0
                    f[4517] = _
                    f[4514] = T
                    f[(_ + 4) >> 2] = T | 1
                    f[($ + S) >> 2] = T
                    f[($ + 4) >> 2] = B | 3
                } else {
                    f[4514] = 0
                    f[4517] = 0
                    f[($ + 4) >> 2] = S | 3
                    T = ($ + S + 4) | 0
                    f[T >> 2] = f[T >> 2] | 1
                }
                o = ($ + 8) | 0
                u = b
                return o | 0
            }
            $ = f[4515] | 0
            if ($ >>> 0 > B >>> 0) {
                T = ($ - B) | 0
                f[4515] = T
                S = f[4518] | 0
                _ = (S + B) | 0
                f[4518] = _
                f[(_ + 4) >> 2] = T | 1
                f[(S + 4) >> 2] = B | 3
                o = (S + 8) | 0
                u = b
                return o | 0
            }
            if (!(f[4630] | 0)) {
                f[4632] = 4096
                f[4631] = 4096
                f[4633] = -1
                f[4634] = -1
                f[4635] = 0
                f[4623] = 0
                f[4630] = (c & -16) ^ 1431655768
                aa = 4096
            } else aa = f[4632] | 0
            c = (B + 48) | 0
            S = (B + 47) | 0
            T = (aa + S) | 0
            _ = (0 - aa) | 0
            aa = T & _
            if (aa >>> 0 <= B >>> 0) {
                o = 0
                u = b
                return o | 0
            }
            X = f[4622] | 0
            if (X | 0 ? ((Y = f[4620] | 0), (Z = (Y + aa) | 0), (Z >>> 0 <= Y >>> 0) | (Z >>> 0 > X >>> 0)) : 0) {
                o = 0
                u = b
                return o | 0
            }
            b: do
                if (!(f[4623] & 4)) {
                    X = f[4518] | 0
                    c: do
                        if (X) {
                            Z = 18496
                            while (1) {
                                Y = f[Z >> 2] | 0
                                if (Y >>> 0 <= X >>> 0 ? ((ba = (Z + 4) | 0), ((Y + (f[ba >> 2] | 0)) | 0) >>> 0 > X >>> 0) : 0) break
                                Y = f[(Z + 8) >> 2] | 0
                                if (!Y) {
                                    H = 118
                                    break c
                                } else Z = Y
                            }
                            j = (T - $) & _
                            if (j >>> 0 < 2147483647) {
                                Y = Fl(j | 0) | 0
                                if ((Y | 0) == (((f[Z >> 2] | 0) + (f[ba >> 2] | 0)) | 0))
                                    if ((Y | 0) == (-1 | 0)) ca = j
                                    else {
                                        da = j
                                        ea = Y
                                        H = 135
                                        break b
                                    }
                                else {
                                    fa = Y
                                    ga = j
                                    H = 126
                                }
                            } else ca = 0
                        } else H = 118
                    while (0)
                    do
                        if ((H | 0) == 118) {
                            X = Fl(0) | 0
                            if (
                                (X | 0) != (-1 | 0)
                                    ? ((e = X),
                                      (j = f[4631] | 0),
                                      (Y = (j + -1) | 0),
                                      (U = ((((Y & e) | 0) == 0 ? 0 : (((Y + e) & (0 - j)) - e) | 0) + aa) | 0),
                                      (e = f[4620] | 0),
                                      (j = (U + e) | 0),
                                      (U >>> 0 > B >>> 0) & (U >>> 0 < 2147483647))
                                    : 0
                            ) {
                                Y = f[4622] | 0
                                if (Y | 0 ? (j >>> 0 <= e >>> 0) | (j >>> 0 > Y >>> 0) : 0) {
                                    ca = 0
                                    break
                                }
                                Y = Fl(U | 0) | 0
                                if ((Y | 0) == (X | 0)) {
                                    da = U
                                    ea = X
                                    H = 135
                                    break b
                                } else {
                                    fa = Y
                                    ga = U
                                    H = 126
                                }
                            } else ca = 0
                        }
                    while (0)
                    do
                        if ((H | 0) == 126) {
                            U = (0 - ga) | 0
                            if (!((c >>> 0 > ga >>> 0) & ((ga >>> 0 < 2147483647) & ((fa | 0) != (-1 | 0)))))
                                if ((fa | 0) == (-1 | 0)) {
                                    ca = 0
                                    break
                                } else {
                                    da = ga
                                    ea = fa
                                    H = 135
                                    break b
                                }
                            Y = f[4632] | 0
                            X = (S - ga + Y) & (0 - Y)
                            if (X >>> 0 >= 2147483647) {
                                da = ga
                                ea = fa
                                H = 135
                                break b
                            }
                            if ((Fl(X | 0) | 0) == (-1 | 0)) {
                                Fl(U | 0) | 0
                                ca = 0
                                break
                            } else {
                                da = (X + ga) | 0
                                ea = fa
                                H = 135
                                break b
                            }
                        }
                    while (0)
                    f[4623] = f[4623] | 4
                    ha = ca
                    H = 133
                } else {
                    ha = 0
                    H = 133
                }
            while (0)
            if (
                ((H | 0) == 133 ? aa >>> 0 < 2147483647 : 0)
                    ? ((ca = Fl(aa | 0) | 0),
                      (aa = Fl(0) | 0),
                      (fa = (aa - ca) | 0),
                      (ga = fa >>> 0 > ((B + 40) | 0) >>> 0),
                      !(((ca | 0) == (-1 | 0)) | (ga ^ 1) | (((ca >>> 0 < aa >>> 0) & (((ca | 0) != (-1 | 0)) & ((aa | 0) != (-1 | 0)))) ^ 1)))
                    : 0
            ) {
                da = ga ? fa : ha
                ea = ca
                H = 135
            }
            if ((H | 0) == 135) {
                ca = ((f[4620] | 0) + da) | 0
                f[4620] = ca
                if (ca >>> 0 > (f[4621] | 0) >>> 0) f[4621] = ca
                ca = f[4518] | 0
                do
                    if (ca) {
                        ha = 18496
                        while (1) {
                            ia = f[ha >> 2] | 0
                            ja = (ha + 4) | 0
                            ka = f[ja >> 2] | 0
                            if ((ea | 0) == ((ia + ka) | 0)) {
                                H = 143
                                break
                            }
                            fa = f[(ha + 8) >> 2] | 0
                            if (!fa) break
                            else ha = fa
                        }
                        if (((H | 0) == 143 ? ((f[(ha + 12) >> 2] & 8) | 0) == 0 : 0) ? (ea >>> 0 > ca >>> 0) & (ia >>> 0 <= ca >>> 0) : 0) {
                            f[ja >> 2] = ka + da
                            fa = ((f[4515] | 0) + da) | 0
                            ga = (ca + 8) | 0
                            aa = ((ga & 7) | 0) == 0 ? 0 : (0 - ga) & 7
                            ga = (ca + aa) | 0
                            S = (fa - aa) | 0
                            f[4518] = ga
                            f[4515] = S
                            f[(ga + 4) >> 2] = S | 1
                            f[(ca + fa + 4) >> 2] = 40
                            f[4519] = f[4634]
                            break
                        }
                        if (ea >>> 0 < (f[4516] | 0) >>> 0) f[4516] = ea
                        fa = (ea + da) | 0
                        S = 18496
                        while (1) {
                            if ((f[S >> 2] | 0) == (fa | 0)) {
                                H = 151
                                break
                            }
                            ga = f[(S + 8) >> 2] | 0
                            if (!ga) {
                                la = 18496
                                break
                            } else S = ga
                        }
                        if ((H | 0) == 151)
                            if (!(f[(S + 12) >> 2] & 8)) {
                                f[S >> 2] = ea
                                ha = (S + 4) | 0
                                f[ha >> 2] = (f[ha >> 2] | 0) + da
                                ha = (ea + 8) | 0
                                ga = (ea + (((ha & 7) | 0) == 0 ? 0 : (0 - ha) & 7)) | 0
                                ha = (fa + 8) | 0
                                aa = (fa + (((ha & 7) | 0) == 0 ? 0 : (0 - ha) & 7)) | 0
                                ha = (ga + B) | 0
                                c = (aa - ga - B) | 0
                                f[(ga + 4) >> 2] = B | 3
                                do
                                    if ((ca | 0) != (aa | 0)) {
                                        if ((f[4517] | 0) == (aa | 0)) {
                                            ba = ((f[4514] | 0) + c) | 0
                                            f[4514] = ba
                                            f[4517] = ha
                                            f[(ha + 4) >> 2] = ba | 1
                                            f[(ha + ba) >> 2] = ba
                                            break
                                        }
                                        ba = f[(aa + 4) >> 2] | 0
                                        if (((ba & 3) | 0) == 1) {
                                            _ = ba & -8
                                            $ = ba >>> 3
                                            d: do
                                                if (ba >>> 0 < 256) {
                                                    T = f[(aa + 8) >> 2] | 0
                                                    X = f[(aa + 12) >> 2] | 0
                                                    if ((X | 0) == (T | 0)) {
                                                        f[4512] = f[4512] & ~(1 << $)
                                                        break
                                                    } else {
                                                        f[(T + 12) >> 2] = X
                                                        f[(X + 8) >> 2] = T
                                                        break
                                                    }
                                                } else {
                                                    T = f[(aa + 24) >> 2] | 0
                                                    X = f[(aa + 12) >> 2] | 0
                                                    do
                                                        if ((X | 0) == (aa | 0)) {
                                                            U = (aa + 16) | 0
                                                            Y = (U + 4) | 0
                                                            j = f[Y >> 2] | 0
                                                            if (!j) {
                                                                e = f[U >> 2] | 0
                                                                if (!e) {
                                                                    ma = 0
                                                                    break
                                                                } else {
                                                                    na = e
                                                                    oa = U
                                                                }
                                                            } else {
                                                                na = j
                                                                oa = Y
                                                            }
                                                            while (1) {
                                                                Y = (na + 20) | 0
                                                                j = f[Y >> 2] | 0
                                                                if (j | 0) {
                                                                    na = j
                                                                    oa = Y
                                                                    continue
                                                                }
                                                                Y = (na + 16) | 0
                                                                j = f[Y >> 2] | 0
                                                                if (!j) break
                                                                else {
                                                                    na = j
                                                                    oa = Y
                                                                }
                                                            }
                                                            f[oa >> 2] = 0
                                                            ma = na
                                                        } else {
                                                            Y = f[(aa + 8) >> 2] | 0
                                                            f[(Y + 12) >> 2] = X
                                                            f[(X + 8) >> 2] = Y
                                                            ma = X
                                                        }
                                                    while (0)
                                                    if (!T) break
                                                    X = f[(aa + 28) >> 2] | 0
                                                    Y = (18352 + (X << 2)) | 0
                                                    do
                                                        if ((f[Y >> 2] | 0) != (aa | 0)) {
                                                            f[(T + 16 + ((((f[(T + 16) >> 2] | 0) != (aa | 0)) & 1) << 2)) >> 2] = ma
                                                            if (!ma) break d
                                                        } else {
                                                            f[Y >> 2] = ma
                                                            if (ma | 0) break
                                                            f[4513] = f[4513] & ~(1 << X)
                                                            break d
                                                        }
                                                    while (0)
                                                    f[(ma + 24) >> 2] = T
                                                    X = (aa + 16) | 0
                                                    Y = f[X >> 2] | 0
                                                    if (Y | 0) {
                                                        f[(ma + 16) >> 2] = Y
                                                        f[(Y + 24) >> 2] = ma
                                                    }
                                                    Y = f[(X + 4) >> 2] | 0
                                                    if (!Y) break
                                                    f[(ma + 20) >> 2] = Y
                                                    f[(Y + 24) >> 2] = ma
                                                }
                                            while (0)
                                            pa = (aa + _) | 0
                                            qa = (_ + c) | 0
                                        } else {
                                            pa = aa
                                            qa = c
                                        }
                                        $ = (pa + 4) | 0
                                        f[$ >> 2] = f[$ >> 2] & -2
                                        f[(ha + 4) >> 2] = qa | 1
                                        f[(ha + qa) >> 2] = qa
                                        $ = qa >>> 3
                                        if (qa >>> 0 < 256) {
                                            ba = (18088 + (($ << 1) << 2)) | 0
                                            Z = f[4512] | 0
                                            Y = 1 << $
                                            if (!(Z & Y)) {
                                                f[4512] = Z | Y
                                                ra = ba
                                                sa = (ba + 8) | 0
                                            } else {
                                                Y = (ba + 8) | 0
                                                ra = f[Y >> 2] | 0
                                                sa = Y
                                            }
                                            f[sa >> 2] = ha
                                            f[(ra + 12) >> 2] = ha
                                            f[(ha + 8) >> 2] = ra
                                            f[(ha + 12) >> 2] = ba
                                            break
                                        }
                                        ba = qa >>> 8
                                        do
                                            if (!ba) ta = 0
                                            else {
                                                if (qa >>> 0 > 16777215) {
                                                    ta = 31
                                                    break
                                                }
                                                Y = (((ba + 1048320) | 0) >>> 16) & 8
                                                Z = ba << Y
                                                $ = (((Z + 520192) | 0) >>> 16) & 4
                                                X = Z << $
                                                Z = (((X + 245760) | 0) >>> 16) & 2
                                                j = (14 - ($ | Y | Z) + ((X << Z) >>> 15)) | 0
                                                ta = ((qa >>> ((j + 7) | 0)) & 1) | (j << 1)
                                            }
                                        while (0)
                                        ba = (18352 + (ta << 2)) | 0
                                        f[(ha + 28) >> 2] = ta
                                        _ = (ha + 16) | 0
                                        f[(_ + 4) >> 2] = 0
                                        f[_ >> 2] = 0
                                        _ = f[4513] | 0
                                        j = 1 << ta
                                        if (!(_ & j)) {
                                            f[4513] = _ | j
                                            f[ba >> 2] = ha
                                            f[(ha + 24) >> 2] = ba
                                            f[(ha + 12) >> 2] = ha
                                            f[(ha + 8) >> 2] = ha
                                            break
                                        }
                                        j = qa << ((ta | 0) == 31 ? 0 : (25 - (ta >>> 1)) | 0)
                                        _ = f[ba >> 2] | 0
                                        while (1) {
                                            if (((f[(_ + 4) >> 2] & -8) | 0) == (qa | 0)) {
                                                H = 192
                                                break
                                            }
                                            ua = (_ + 16 + ((j >>> 31) << 2)) | 0
                                            ba = f[ua >> 2] | 0
                                            if (!ba) {
                                                H = 191
                                                break
                                            } else {
                                                j = j << 1
                                                _ = ba
                                            }
                                        }
                                        if ((H | 0) == 191) {
                                            f[ua >> 2] = ha
                                            f[(ha + 24) >> 2] = _
                                            f[(ha + 12) >> 2] = ha
                                            f[(ha + 8) >> 2] = ha
                                            break
                                        } else if ((H | 0) == 192) {
                                            j = (_ + 8) | 0
                                            ba = f[j >> 2] | 0
                                            f[(ba + 12) >> 2] = ha
                                            f[j >> 2] = ha
                                            f[(ha + 8) >> 2] = ba
                                            f[(ha + 12) >> 2] = _
                                            f[(ha + 24) >> 2] = 0
                                            break
                                        }
                                    } else {
                                        ba = ((f[4515] | 0) + c) | 0
                                        f[4515] = ba
                                        f[4518] = ha
                                        f[(ha + 4) >> 2] = ba | 1
                                    }
                                while (0)
                                o = (ga + 8) | 0
                                u = b
                                return o | 0
                            } else la = 18496
                        while (1) {
                            ha = f[la >> 2] | 0
                            if (ha >>> 0 <= ca >>> 0 ? ((va = (ha + (f[(la + 4) >> 2] | 0)) | 0), va >>> 0 > ca >>> 0) : 0) break
                            la = f[(la + 8) >> 2] | 0
                        }
                        ga = (va + -47) | 0
                        ha = (ga + 8) | 0
                        c = (ga + (((ha & 7) | 0) == 0 ? 0 : (0 - ha) & 7)) | 0
                        ha = (ca + 16) | 0
                        ga = c >>> 0 < ha >>> 0 ? ca : c
                        c = (ga + 8) | 0
                        aa = (da + -40) | 0
                        fa = (ea + 8) | 0
                        S = ((fa & 7) | 0) == 0 ? 0 : (0 - fa) & 7
                        fa = (ea + S) | 0
                        ba = (aa - S) | 0
                        f[4518] = fa
                        f[4515] = ba
                        f[(fa + 4) >> 2] = ba | 1
                        f[(ea + aa + 4) >> 2] = 40
                        f[4519] = f[4634]
                        aa = (ga + 4) | 0
                        f[aa >> 2] = 27
                        f[c >> 2] = f[4624]
                        f[(c + 4) >> 2] = f[4625]
                        f[(c + 8) >> 2] = f[4626]
                        f[(c + 12) >> 2] = f[4627]
                        f[4624] = ea
                        f[4625] = da
                        f[4627] = 0
                        f[4626] = c
                        c = (ga + 24) | 0
                        do {
                            ba = c
                            c = (c + 4) | 0
                            f[c >> 2] = 7
                        } while (((ba + 8) | 0) >>> 0 < va >>> 0)
                        if ((ga | 0) != (ca | 0)) {
                            c = (ga - ca) | 0
                            f[aa >> 2] = f[aa >> 2] & -2
                            f[(ca + 4) >> 2] = c | 1
                            f[ga >> 2] = c
                            ba = c >>> 3
                            if (c >>> 0 < 256) {
                                fa = (18088 + ((ba << 1) << 2)) | 0
                                S = f[4512] | 0
                                j = 1 << ba
                                if (!(S & j)) {
                                    f[4512] = S | j
                                    wa = fa
                                    xa = (fa + 8) | 0
                                } else {
                                    j = (fa + 8) | 0
                                    wa = f[j >> 2] | 0
                                    xa = j
                                }
                                f[xa >> 2] = ca
                                f[(wa + 12) >> 2] = ca
                                f[(ca + 8) >> 2] = wa
                                f[(ca + 12) >> 2] = fa
                                break
                            }
                            fa = c >>> 8
                            if (fa)
                                if (c >>> 0 > 16777215) ya = 31
                                else {
                                    j = (((fa + 1048320) | 0) >>> 16) & 8
                                    S = fa << j
                                    fa = (((S + 520192) | 0) >>> 16) & 4
                                    ba = S << fa
                                    S = (((ba + 245760) | 0) >>> 16) & 2
                                    Z = (14 - (fa | j | S) + ((ba << S) >>> 15)) | 0
                                    ya = ((c >>> ((Z + 7) | 0)) & 1) | (Z << 1)
                                }
                            else ya = 0
                            Z = (18352 + (ya << 2)) | 0
                            f[(ca + 28) >> 2] = ya
                            f[(ca + 20) >> 2] = 0
                            f[ha >> 2] = 0
                            S = f[4513] | 0
                            ba = 1 << ya
                            if (!(S & ba)) {
                                f[4513] = S | ba
                                f[Z >> 2] = ca
                                f[(ca + 24) >> 2] = Z
                                f[(ca + 12) >> 2] = ca
                                f[(ca + 8) >> 2] = ca
                                break
                            }
                            ba = c << ((ya | 0) == 31 ? 0 : (25 - (ya >>> 1)) | 0)
                            S = f[Z >> 2] | 0
                            while (1) {
                                if (((f[(S + 4) >> 2] & -8) | 0) == (c | 0)) {
                                    H = 213
                                    break
                                }
                                za = (S + 16 + ((ba >>> 31) << 2)) | 0
                                Z = f[za >> 2] | 0
                                if (!Z) {
                                    H = 212
                                    break
                                } else {
                                    ba = ba << 1
                                    S = Z
                                }
                            }
                            if ((H | 0) == 212) {
                                f[za >> 2] = ca
                                f[(ca + 24) >> 2] = S
                                f[(ca + 12) >> 2] = ca
                                f[(ca + 8) >> 2] = ca
                                break
                            } else if ((H | 0) == 213) {
                                ba = (S + 8) | 0
                                c = f[ba >> 2] | 0
                                f[(c + 12) >> 2] = ca
                                f[ba >> 2] = ca
                                f[(ca + 8) >> 2] = c
                                f[(ca + 12) >> 2] = S
                                f[(ca + 24) >> 2] = 0
                                break
                            }
                        }
                    } else {
                        c = f[4516] | 0
                        if (((c | 0) == 0) | (ea >>> 0 < c >>> 0)) f[4516] = ea
                        f[4624] = ea
                        f[4625] = da
                        f[4627] = 0
                        f[4521] = f[4630]
                        f[4520] = -1
                        f[4525] = 18088
                        f[4524] = 18088
                        f[4527] = 18096
                        f[4526] = 18096
                        f[4529] = 18104
                        f[4528] = 18104
                        f[4531] = 18112
                        f[4530] = 18112
                        f[4533] = 18120
                        f[4532] = 18120
                        f[4535] = 18128
                        f[4534] = 18128
                        f[4537] = 18136
                        f[4536] = 18136
                        f[4539] = 18144
                        f[4538] = 18144
                        f[4541] = 18152
                        f[4540] = 18152
                        f[4543] = 18160
                        f[4542] = 18160
                        f[4545] = 18168
                        f[4544] = 18168
                        f[4547] = 18176
                        f[4546] = 18176
                        f[4549] = 18184
                        f[4548] = 18184
                        f[4551] = 18192
                        f[4550] = 18192
                        f[4553] = 18200
                        f[4552] = 18200
                        f[4555] = 18208
                        f[4554] = 18208
                        f[4557] = 18216
                        f[4556] = 18216
                        f[4559] = 18224
                        f[4558] = 18224
                        f[4561] = 18232
                        f[4560] = 18232
                        f[4563] = 18240
                        f[4562] = 18240
                        f[4565] = 18248
                        f[4564] = 18248
                        f[4567] = 18256
                        f[4566] = 18256
                        f[4569] = 18264
                        f[4568] = 18264
                        f[4571] = 18272
                        f[4570] = 18272
                        f[4573] = 18280
                        f[4572] = 18280
                        f[4575] = 18288
                        f[4574] = 18288
                        f[4577] = 18296
                        f[4576] = 18296
                        f[4579] = 18304
                        f[4578] = 18304
                        f[4581] = 18312
                        f[4580] = 18312
                        f[4583] = 18320
                        f[4582] = 18320
                        f[4585] = 18328
                        f[4584] = 18328
                        f[4587] = 18336
                        f[4586] = 18336
                        c = (da + -40) | 0
                        ba = (ea + 8) | 0
                        ha = ((ba & 7) | 0) == 0 ? 0 : (0 - ba) & 7
                        ba = (ea + ha) | 0
                        ga = (c - ha) | 0
                        f[4518] = ba
                        f[4515] = ga
                        f[(ba + 4) >> 2] = ga | 1
                        f[(ea + c + 4) >> 2] = 40
                        f[4519] = f[4634]
                    }
                while (0)
                ea = f[4515] | 0
                if (ea >>> 0 > B >>> 0) {
                    da = (ea - B) | 0
                    f[4515] = da
                    ea = f[4518] | 0
                    ca = (ea + B) | 0
                    f[4518] = ca
                    f[(ca + 4) >> 2] = da | 1
                    f[(ea + 4) >> 2] = B | 3
                    o = (ea + 8) | 0
                    u = b
                    return o | 0
                }
            }
            ea = ir() | 0
            f[ea >> 2] = 12
            o = 0
            u = b
            return o | 0
        }
        function ab(a, c, d, e, g, i) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                L = 0,
                M = 0,
                N = 0,
                O = 0,
                P = 0,
                Q = 0,
                R = 0,
                S = 0,
                T = 0,
                U = 0,
                V = 0,
                Z = 0,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0,
                xa = 0,
                ya = 0,
                za = 0,
                Aa = 0,
                Ba = 0,
                Ca = 0,
                Da = 0,
                Ea = 0,
                Fa = 0,
                Ga = 0,
                Ha = 0,
                Ia = 0,
                Ja = 0,
                Ka = 0,
                La = 0,
                Ma = 0,
                Na = 0,
                Oa = 0,
                Pa = 0,
                Qa = 0,
                Ra = 0,
                Sa = 0,
                Ta = 0,
                Ua = 0,
                Va = 0.0,
                Wa = 0,
                Xa = 0,
                Ya = 0,
                Za = 0,
                _a = 0,
                $a = 0,
                ab = 0,
                bb = 0,
                cb = 0,
                db = 0,
                eb = 0,
                fb = 0,
                gb = 0,
                hb = 0,
                ib = 0,
                jb = 0,
                kb = 0,
                lb = 0,
                mb = 0,
                nb = 0,
                ob = 0,
                pb = 0,
                qb = 0,
                rb = 0,
                sb = 0,
                tb = 0,
                ub = 0,
                vb = 0,
                wb = 0,
                xb = 0,
                yb = 0,
                zb = 0,
                Ab = 0,
                Bb = 0,
                Cb = 0,
                Db = 0,
                Eb = 0,
                Fb = 0,
                Gb = 0,
                Hb = 0,
                Ib = 0,
                Jb = 0,
                Kb = 0
            i = u
            u = (u + 240) | 0
            j = (i + 104) | 0
            k = (i + 224) | 0
            l = (i + 176) | 0
            m = (i + 160) | 0
            n = (i + 228) | 0
            o = (i + 72) | 0
            p = (i + 40) | 0
            q = (i + 132) | 0
            r = i
            s = (i + 172) | 0
            t = (i + 156) | 0
            v = (i + 152) | 0
            w = (i + 148) | 0
            x = (i + 144) | 0
            y = (i + 128) | 0
            z = (a + 8) | 0
            Ah(z, c, e, g)
            e = f[(a + 48) >> 2] | 0
            A = f[(a + 52) >> 2] | 0
            B = l
            C = (B + 48) | 0
            do {
                f[B >> 2] = 0
                B = (B + 4) | 0
            } while ((B | 0) < (C | 0))
            if (!g) {
                D = 0
                E = 0
            } else {
                oi(l, g)
                D = f[(l + 12) >> 2] | 0
                E = f[(l + 16) >> 2] | 0
            }
            B = (l + 16) | 0
            C = (E - D) >> 2
            F = D
            D = E
            if (C >>> 0 >= g >>> 0) {
                if (C >>> 0 > g >>> 0 ? ((E = (F + (g << 2)) | 0), (E | 0) != (D | 0)) : 0) f[B >> 2] = D + (~(((D + -4 - E) | 0) >>> 2) << 2)
            } else oi((l + 12) | 0, (g - C) | 0)
            C = (l + 24) | 0
            E = (l + 28) | 0
            D = f[E >> 2] | 0
            B = f[C >> 2] | 0
            F = (D - B) >> 2
            G = B
            B = D
            if (F >>> 0 >= g >>> 0) {
                if (F >>> 0 > g >>> 0 ? ((D = (G + (g << 2)) | 0), (D | 0) != (B | 0)) : 0) f[E >> 2] = B + (~(((B + -4 - D) | 0) >>> 2) << 2)
            } else oi(C, (g - F) | 0)
            F = (l + 36) | 0
            C = (l + 40) | 0
            D = f[C >> 2] | 0
            B = f[F >> 2] | 0
            E = (D - B) >> 2
            G = B
            B = D
            if (E >>> 0 >= g >>> 0) {
                if (E >>> 0 > g >>> 0 ? ((D = (G + (g << 2)) | 0), (D | 0) != (B | 0)) : 0) f[C >> 2] = B + (~(((B + -4 - D) | 0) >>> 2) << 2)
            } else oi(F, (g - E) | 0)
            f[m >> 2] = 0
            E = (m + 4) | 0
            f[E >> 2] = 0
            f[(m + 8) >> 2] = 0
            F = (g | 0) == 0
            do
                if (!F)
                    if (g >>> 0 > 1073741823) mq(m)
                    else {
                        D = g << 2
                        B = dn(D) | 0
                        f[m >> 2] = B
                        C = (B + (g << 2)) | 0
                        f[(m + 8) >> 2] = C
                        hj(B | 0, 0, D | 0) | 0
                        f[E >> 2] = C
                        break
                    }
            while (0)
            C = (a + 152) | 0
            D = (a + 156) | 0
            B = f[D >> 2] | 0
            G = f[C >> 2] | 0
            H = (B - G) >> 2
            L = G
            G = B
            if (H >>> 0 >= g >>> 0) {
                if (H >>> 0 > g >>> 0 ? ((B = (L + (g << 2)) | 0), (B | 0) != (G | 0)) : 0) f[D >> 2] = G + (~(((G + -4 - B) | 0) >>> 2) << 2)
            } else oi(C, (g - H) | 0)
            f[o >> 2] = 0
            f[(o + 4) >> 2] = 0
            f[(o + 8) >> 2] = 0
            f[(o + 12) >> 2] = 0
            f[(o + 16) >> 2] = 0
            f[(o + 20) >> 2] = 0
            f[(o + 24) >> 2] = 0
            f[(o + 28) >> 2] = 0
            f[p >> 2] = 0
            f[(p + 4) >> 2] = 0
            f[(p + 8) >> 2] = 0
            f[(p + 12) >> 2] = 0
            f[(p + 16) >> 2] = 0
            f[(p + 20) >> 2] = 0
            f[(p + 24) >> 2] = 0
            f[(p + 28) >> 2] = 0
            f[q >> 2] = 0
            H = (q + 4) | 0
            f[H >> 2] = 0
            f[(q + 8) >> 2] = 0
            if (F) {
                M = 0
                N = 0
                O = 0
                P = 0
            } else {
                F = g << 2
                B = dn(F) | 0
                f[q >> 2] = B
                G = (B + (g << 2)) | 0
                f[(q + 8) >> 2] = G
                hj(B | 0, 0, F | 0) | 0
                f[H >> 2] = G
                M = B
                N = G
                O = G
                P = B
            }
            B = (a + 56) | 0
            G = f[B >> 2] | 0
            F = f[(G + 4) >> 2] | 0
            D = f[G >> 2] | 0
            L = (F - D) | 0
            a: do
                if ((L | 0) > 4) {
                    Q = L >>> 2
                    R = (e + 64) | 0
                    S = (e + 28) | 0
                    T = (g | 0) > 0
                    U = (r + 4) | 0
                    V = (r + 8) | 0
                    Z = (r + 12) | 0
                    _ = (a + 152) | 0
                    $ = (a + 112) | 0
                    aa = (r + 16) | 0
                    ba = (r + 28) | 0
                    ca = (a + 16) | 0
                    da = (a + 32) | 0
                    ea = (a + 12) | 0
                    fa = (a + 28) | 0
                    ga = (a + 20) | 0
                    ha = (a + 24) | 0
                    ia = (r + 28) | 0
                    ja = (r + 16) | 0
                    ka = (r + 20) | 0
                    la = (r + 32) | 0
                    ma = (n + 1) | 0
                    na = g << 2
                    oa = (g | 0) == 1
                    pa = (Q + -1) | 0
                    if (((F - D) >> 2) >>> 0 > pa >>> 0) {
                        qa = Q
                        ra = pa
                        sa = D
                        ta = M
                        ua = P
                        va = O
                        wa = M
                        xa = N
                        ya = M
                        za = N
                    } else {
                        Aa = G
                        mq(Aa)
                    }
                    b: while (1) {
                        pa = f[(sa + (ra << 2)) >> 2] | 0
                        Q = ((((pa >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + pa) | 0
                        Ba = Q >>> 5
                        Ca = 1 << (Q & 31)
                        Da = ((pa | 0) == -1) | ((Q | 0) == -1)
                        Ea = 1
                        Fa = 0
                        Ga = pa
                        c: while (1) {
                            Ha = Ea ^ 1
                            Ia = Fa
                            Ja = Ga
                            while (1) {
                                if ((Ja | 0) == -1) {
                                    Ka = Ia
                                    break c
                                }
                                La = f[(l + ((Ia * 12) | 0)) >> 2] | 0
                                if (
                                    (
                                        ((f[((f[e >> 2] | 0) + ((Ja >>> 5) << 2)) >> 2] & (1 << (Ja & 31))) | 0) == 0
                                            ? ((Ma = f[((f[((f[R >> 2] | 0) + 12) >> 2] | 0) + (Ja << 2)) >> 2] | 0), (Ma | 0) != -1)
                                            : 0
                                    )
                                        ? ((Na = f[S >> 2] | 0),
                                          (Oa = f[A >> 2] | 0),
                                          (Pa = f[(Oa + (f[(Na + (Ma << 2)) >> 2] << 2)) >> 2] | 0),
                                          (Qa = (Ma + 1) | 0),
                                          (Ra = f[(Oa + (f[(Na + ((((Qa >>> 0) % 3 | 0 | 0) == 0 ? (Ma + -2) | 0 : Qa) << 2)) >> 2] << 2)) >> 2] | 0),
                                          (Qa = f[(Oa + (f[(Na + (((((Ma >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + Ma) << 2)) >> 2] << 2)) >> 2] | 0),
                                          ((Pa | 0) < (ra | 0)) & ((Ra | 0) < (ra | 0)) & ((Qa | 0) < (ra | 0)))
                                        : 0
                                ) {
                                    Ma = X(Pa, g) | 0
                                    Pa = X(Ra, g) | 0
                                    Ra = X(Qa, g) | 0
                                    if (T) {
                                        Qa = 0
                                        do {
                                            f[(La + (Qa << 2)) >> 2] = (f[(c + ((Qa + Ra) << 2)) >> 2] | 0) + (f[(c + ((Qa + Pa) << 2)) >> 2] | 0) - (f[(c + ((Qa + Ma) << 2)) >> 2] | 0)
                                            Qa = (Qa + 1) | 0
                                        } while ((Qa | 0) != (g | 0))
                                    }
                                    Qa = (Ia + 1) | 0
                                    if ((Qa | 0) == 4) {
                                        Ka = 4
                                        break c
                                    } else Sa = Qa
                                } else Sa = Ia
                                do
                                    if (Ea) {
                                        Qa = (Ja + 1) | 0
                                        Ma = ((Qa >>> 0) % 3 | 0 | 0) == 0 ? (Ja + -2) | 0 : Qa
                                        if (
                                            ((Ma | 0) != -1 ? ((f[((f[e >> 2] | 0) + ((Ma >>> 5) << 2)) >> 2] & (1 << (Ma & 31))) | 0) == 0 : 0)
                                                ? ((Qa = f[((f[((f[R >> 2] | 0) + 12) >> 2] | 0) + (Ma << 2)) >> 2] | 0), (Ma = (Qa + 1) | 0), (Qa | 0) != -1)
                                                : 0
                                        )
                                            Ta = ((Ma >>> 0) % 3 | 0 | 0) == 0 ? (Qa + -2) | 0 : Ma
                                        else Ta = -1
                                    } else {
                                        Ma = ((((Ja >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + Ja) | 0
                                        if (
                                            ((Ma | 0) != -1 ? ((f[((f[e >> 2] | 0) + ((Ma >>> 5) << 2)) >> 2] & (1 << (Ma & 31))) | 0) == 0 : 0)
                                                ? ((Qa = f[((f[((f[R >> 2] | 0) + 12) >> 2] | 0) + (Ma << 2)) >> 2] | 0), (Qa | 0) != -1)
                                                : 0
                                        )
                                            if (!((Qa >>> 0) % 3 | 0)) {
                                                Ta = (Qa + 2) | 0
                                                break
                                            } else {
                                                Ta = (Qa + -1) | 0
                                                break
                                            }
                                        else Ta = -1
                                    }
                                while (0)
                                if ((Ta | 0) == (pa | 0)) {
                                    Ka = Sa
                                    break c
                                }
                                if (((Ta | 0) != -1) | Ha) {
                                    Ia = Sa
                                    Ja = Ta
                                } else break
                            }
                            if (Da) {
                                Ea = 0
                                Fa = Sa
                                Ga = -1
                                continue
                            }
                            if ((f[((f[e >> 2] | 0) + (Ba << 2)) >> 2] & Ca) | 0) {
                                Ea = 0
                                Fa = Sa
                                Ga = -1
                                continue
                            }
                            Ja = f[((f[((f[R >> 2] | 0) + 12) >> 2] | 0) + (Q << 2)) >> 2] | 0
                            if ((Ja | 0) == -1) {
                                Ea = 0
                                Fa = Sa
                                Ga = -1
                                continue
                            }
                            if (!((Ja >>> 0) % 3 | 0)) {
                                Ea = 0
                                Fa = Sa
                                Ga = (Ja + 2) | 0
                                continue
                            } else {
                                Ea = 0
                                Fa = Sa
                                Ga = (Ja + -1) | 0
                                continue
                            }
                        }
                        Ga = X(ra, g) | 0
                        f[r >> 2] = 0
                        f[U >> 2] = 0
                        b[V >> 0] = 0
                        f[Z >> 2] = 0
                        f[(Z + 4) >> 2] = 0
                        f[(Z + 8) >> 2] = 0
                        f[(Z + 12) >> 2] = 0
                        f[(Z + 16) >> 2] = 0
                        f[(Z + 20) >> 2] = 0
                        f[(Z + 24) >> 2] = 0
                        Fa = (c + ((X((qa + -2) | 0, g) | 0) << 2)) | 0
                        Ea = (c + (Ga << 2)) | 0
                        Q = f[_ >> 2] | 0
                        if (T) {
                            Ca = 0
                            Ba = 0
                            while (1) {
                                Da = ((f[(Fa + (Ca << 2)) >> 2] | 0) - (f[(Ea + (Ca << 2)) >> 2] | 0)) | 0
                                pa = (((Da | 0) > -1 ? Da : (0 - Da) | 0) + Ba) | 0
                                f[(ta + (Ca << 2)) >> 2] = Da
                                f[(Q + (Ca << 2)) >> 2] = (Da << 1) ^ (Da >> 31)
                                Ca = (Ca + 1) | 0
                                if ((Ca | 0) == (g | 0)) {
                                    Ua = pa
                                    break
                                } else Ba = pa
                            }
                        } else Ua = 0
                        ho(j, $, Q, g)
                        Ba = Tk(j) | 0
                        Ca = I
                        pa = om(j) | 0
                        Da = Tn(pa | 0, I | 0, Ba | 0, Ca | 0) | 0
                        Ca = I
                        Ba = (Ka | 0) > 0
                        if (Ba) {
                            pa = (Ka + -1) | 0
                            Ja = (p + (pa << 3)) | 0
                            Ia = Ja
                            Ha = Tn(f[Ia >> 2] | 0, f[(Ia + 4) >> 2] | 0, Ka | 0, ((((Ka | 0) < 0) << 31) >> 31) | 0) | 0
                            Ia = I
                            Qa = Ja
                            f[Qa >> 2] = Ha
                            f[(Qa + 4) >> 2] = Ia
                            Va = +W(+(+jm(Ha, f[(o + (pa << 3)) >> 2] | 0) * (+(Ha >>> 0) + 4294967296.0 * +(Ia | 0))))
                            Ia =
                                Tn(
                                    Da | 0,
                                    Ca | 0,
                                    (~~Va >>> 0) | 0,
                                    (+K(Va) >= 1.0 ? (Va > 0.0 ? ~~+Y(+J(Va / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((Va - +(~~Va >>> 0)) / 4294967296.0) >>> 0) : 0) | 0
                                ) | 0
                            Wa = Ia
                        } else Wa = Da
                        Da = r
                        f[Da >> 2] = Wa
                        f[(Da + 4) >> 2] = Ua
                        b[V >> 0] = 0
                        f[Z >> 2] = 0
                        Mf(aa, Fa, (Fa + (g << 2)) | 0)
                        f[s >> 2] = ua
                        f[t >> 2] = va
                        f[k >> 2] = f[s >> 2]
                        f[j >> 2] = f[t >> 2]
                        tf(ba, k, j)
                        if ((Ka | 0) < 1) {
                            Xa = za
                            Ya = ya
                            Za = xa
                            _a = wa
                            $a = va
                            ab = ua
                            bb = ua
                        } else {
                            Da = (n + Ka) | 0
                            Ia = f[q >> 2] | 0
                            Ca = (Ka + -1) | 0
                            Ha = (o + (Ca << 3)) | 0
                            pa = (p + (Ca << 3)) | 0
                            Ca = Ia
                            Qa = f[H >> 2] | 0
                            Ja = (Da + -1) | 0
                            Ma = (Ja | 0) == (n | 0)
                            Pa = (Da + -2) | 0
                            Ra = ma >>> 0 < Pa >>> 0
                            La = ~Ka
                            Na = (Ka + 2 + ((La | 0) > -2 ? La : -2)) | 0
                            La = Qa
                            Oa = Ja >>> 0 > n >>> 0
                            cb = 0
                            db = 1
                            while (1) {
                                cb = (cb + 1) | 0
                                hj(n | 0, 1, Na | 0) | 0
                                hj(n | 0, 0, cb | 0) | 0
                                d: while (1) {
                                    if (T) {
                                        hj(f[m >> 2] | 0, 0, na | 0) | 0
                                        eb = f[m >> 2] | 0
                                        fb = 0
                                        gb = 0
                                        while (1) {
                                            if (!(b[(n + fb) >> 0] | 0)) {
                                                hb = f[(l + ((fb * 12) | 0)) >> 2] | 0
                                                ib = 0
                                                do {
                                                    jb = (eb + (ib << 2)) | 0
                                                    f[jb >> 2] = (f[jb >> 2] | 0) + (f[(hb + (ib << 2)) >> 2] | 0)
                                                    ib = (ib + 1) | 0
                                                } while ((ib | 0) != (g | 0))
                                                kb = ((1 << fb) | (gb & 255)) & 255
                                            } else kb = gb
                                            fb = (fb + 1) | 0
                                            if ((fb | 0) == (Ka | 0)) {
                                                lb = kb
                                                break
                                            } else gb = kb
                                        }
                                    } else {
                                        gb = 0
                                        fb = 0
                                        while (1) {
                                            if (!(b[(n + gb) >> 0] | 0)) mb = ((1 << gb) | (fb & 255)) & 255
                                            else mb = fb
                                            gb = (gb + 1) | 0
                                            if ((gb | 0) == (Ka | 0)) {
                                                lb = mb
                                                break
                                            } else fb = mb
                                        }
                                    }
                                    fb = f[m >> 2] | 0
                                    do
                                        if (T) {
                                            f[fb >> 2] = ((f[fb >> 2] | 0) / (db | 0)) | 0
                                            if (!oa) {
                                                gb = 1
                                                do {
                                                    eb = (fb + (gb << 2)) | 0
                                                    f[eb >> 2] = ((f[eb >> 2] | 0) / (db | 0)) | 0
                                                    gb = (gb + 1) | 0
                                                } while ((gb | 0) != (g | 0))
                                                gb = f[_ >> 2] | 0
                                                if (T) nb = gb
                                                else {
                                                    ob = 0
                                                    pb = gb
                                                    break
                                                }
                                            } else nb = f[_ >> 2] | 0
                                            gb = 0
                                            eb = 0
                                            while (1) {
                                                ib = ((f[(fb + (gb << 2)) >> 2] | 0) - (f[(Ea + (gb << 2)) >> 2] | 0)) | 0
                                                hb = (((ib | 0) > -1 ? ib : (0 - ib) | 0) + eb) | 0
                                                f[(Ia + (gb << 2)) >> 2] = ib
                                                f[(nb + (gb << 2)) >> 2] = (ib << 1) ^ (ib >> 31)
                                                gb = (gb + 1) | 0
                                                if ((gb | 0) == (g | 0)) {
                                                    ob = hb
                                                    pb = nb
                                                    break
                                                } else eb = hb
                                            }
                                        } else {
                                            ob = 0
                                            pb = f[_ >> 2] | 0
                                        }
                                    while (0)
                                    ho(j, $, pb, g)
                                    fb = Tk(j) | 0
                                    eb = I
                                    gb = om(j) | 0
                                    hb = Tn(gb | 0, I | 0, fb | 0, eb | 0) | 0
                                    eb = I
                                    if (Ba) {
                                        fb = Ha
                                        gb = Tn(f[fb >> 2] | 0, f[(fb + 4) >> 2] | 0, db | 0, 0) | 0
                                        fb = pa
                                        ib = f[fb >> 2] | 0
                                        jb = f[(fb + 4) >> 2] | 0
                                        Va = +W(+(+jm(ib, gb) * (+(ib >>> 0) + 4294967296.0 * +(jb | 0))))
                                        jb =
                                            Tn(
                                                hb | 0,
                                                eb | 0,
                                                (~~Va >>> 0) | 0,
                                                (+K(Va) >= 1.0 ? (Va > 0.0 ? ~~+Y(+J(Va / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((Va - +(~~Va >>> 0)) / 4294967296.0) >>> 0) : 0) | 0
                                            ) | 0
                                        qb = jb
                                    } else qb = hb
                                    hb = f[r >> 2] | 0
                                    if (!((qb | 0) >= (hb | 0) ? !((qb | 0) <= (hb | 0) ? (ob | 0) < (f[U >> 2] | 0) : 0) : 0)) {
                                        hb = r
                                        f[hb >> 2] = qb
                                        f[(hb + 4) >> 2] = ob
                                        b[V >> 0] = lb
                                        f[Z >> 2] = db
                                        f[v >> 2] = f[m >> 2]
                                        f[w >> 2] = f[E >> 2]
                                        f[k >> 2] = f[v >> 2]
                                        f[j >> 2] = f[w >> 2]
                                        tf(aa, k, j)
                                        f[x >> 2] = Ca
                                        f[y >> 2] = Qa
                                        f[k >> 2] = f[x >> 2]
                                        f[j >> 2] = f[y >> 2]
                                        tf(ba, k, j)
                                    }
                                    if (Ma) break
                                    rb = b[Ja >> 0] | 0
                                    hb = -1
                                    jb = rb
                                    while (1) {
                                        eb = (hb + -1) | 0
                                        sb = (Da + eb) | 0
                                        ib = jb
                                        jb = b[sb >> 0] | 0
                                        if ((jb & 255) < (ib & 255)) break
                                        if ((sb | 0) == (n | 0)) {
                                            tb = 86
                                            break d
                                        } else hb = eb
                                    }
                                    eb = (Da + hb) | 0
                                    if ((jb & 255) < (rb & 255)) {
                                        ub = Ja
                                        vb = rb
                                    } else {
                                        ib = Da
                                        gb = Ja
                                        while (1) {
                                            fb = (gb + -1) | 0
                                            if ((jb & 255) < (h[(ib + -2) >> 0] | 0)) {
                                                ub = fb
                                                vb = 1
                                                break
                                            } else {
                                                wb = gb
                                                gb = fb
                                                ib = wb
                                            }
                                        }
                                    }
                                    b[sb >> 0] = vb
                                    b[ub >> 0] = jb
                                    if ((hb | 0) < -1) {
                                        xb = eb
                                        yb = Ja
                                    } else continue
                                    while (1) {
                                        ib = b[xb >> 0] | 0
                                        b[xb >> 0] = b[yb >> 0] | 0
                                        b[yb >> 0] = ib
                                        ib = (xb + 1) | 0
                                        gb = (yb + -1) | 0
                                        if (ib >>> 0 < gb >>> 0) {
                                            xb = ib
                                            yb = gb
                                        } else continue d
                                    }
                                }
                                if (((tb | 0) == 86 ? ((tb = 0), Oa) : 0) ? ((eb = b[n >> 0] | 0), (b[n >> 0] = rb), (b[Ja >> 0] = eb), Ra) : 0) {
                                    eb = Pa
                                    hb = ma
                                    do {
                                        jb = b[hb >> 0] | 0
                                        b[hb >> 0] = b[eb >> 0] | 0
                                        b[eb >> 0] = jb
                                        hb = (hb + 1) | 0
                                        eb = (eb + -1) | 0
                                    } while (hb >>> 0 < eb >>> 0)
                                }
                                if ((db | 0) >= (Ka | 0)) {
                                    Xa = La
                                    Ya = Ia
                                    Za = La
                                    _a = Ia
                                    $a = Qa
                                    ab = Ca
                                    bb = Ia
                                    break
                                } else db = (db + 1) | 0
                            }
                        }
                        if (Ba) {
                            db = f[Z >> 2] | 0
                            Ia = (o + ((Ka + -1) << 3)) | 0
                            Ca = Ia
                            Qa = Tn(f[Ca >> 2] | 0, f[(Ca + 4) >> 2] | 0, db | 0, ((((db | 0) < 0) << 31) >> 31) | 0) | 0
                            db = Ia
                            f[db >> 2] = Qa
                            f[(db + 4) >> 2] = I
                        }
                        if (T) {
                            db = f[ba >> 2] | 0
                            Qa = f[C >> 2] | 0
                            Ia = 0
                            do {
                                Ca = f[(db + (Ia << 2)) >> 2] | 0
                                f[(Qa + (Ia << 2)) >> 2] = (Ca << 1) ^ (Ca >> 31)
                                Ia = (Ia + 1) | 0
                            } while ((Ia | 0) != (g | 0))
                            zb = Qa
                        } else zb = f[C >> 2] | 0
                        go(j, $, zb, g)
                        if (Ba) {
                            Qa = (Ka + -1) | 0
                            Ab = (a + 60 + ((Qa * 12) | 0)) | 0
                            Ia = (a + 60 + ((Qa * 12) | 0) + 4) | 0
                            db = (a + 60 + ((Qa * 12) | 0) + 8) | 0
                            Qa = 0
                            do {
                                Ca = f[Ia >> 2] | 0
                                La = f[db >> 2] | 0
                                Pa = (Ca | 0) == ((La << 5) | 0)
                                if (!((1 << Qa) & h[V >> 0])) {
                                    if (Pa) {
                                        if (((Ca + 1) | 0) < 0) {
                                            tb = 114
                                            break b
                                        }
                                        Ra = La << 6
                                        Ja = (Ca + 32) & -32
                                        hi(Ab, Ca >>> 0 < 1073741823 ? (Ra >>> 0 < Ja >>> 0 ? Ja : Ra) : 2147483647)
                                        Bb = f[Ia >> 2] | 0
                                    } else Bb = Ca
                                    f[Ia >> 2] = Bb + 1
                                    Ra = ((f[Ab >> 2] | 0) + ((Bb >>> 5) << 2)) | 0
                                    f[Ra >> 2] = f[Ra >> 2] | (1 << (Bb & 31))
                                } else {
                                    if (Pa) {
                                        if (((Ca + 1) | 0) < 0) {
                                            tb = 119
                                            break b
                                        }
                                        Pa = La << 6
                                        La = (Ca + 32) & -32
                                        hi(Ab, Ca >>> 0 < 1073741823 ? (Pa >>> 0 < La >>> 0 ? La : Pa) : 2147483647)
                                        Cb = f[Ia >> 2] | 0
                                    } else Cb = Ca
                                    f[Ia >> 2] = Cb + 1
                                    Ca = ((f[Ab >> 2] | 0) + ((Cb >>> 5) << 2)) | 0
                                    f[Ca >> 2] = f[Ca >> 2] & ~(1 << (Cb & 31))
                                }
                                Qa = (Qa + 1) | 0
                            } while ((Qa | 0) < (Ka | 0))
                        }
                        Qa = (d + (Ga << 2)) | 0
                        Ia = f[z >> 2] | 0
                        if ((Ia | 0) > 0) {
                            db = 0
                            Ba = f[aa >> 2] | 0
                            Ca = Ia
                            while (1) {
                                if ((Ca | 0) > 0) {
                                    Ia = 0
                                    do {
                                        Pa = f[(Ba + (Ia << 2)) >> 2] | 0
                                        La = f[ca >> 2] | 0
                                        if ((Pa | 0) > (La | 0)) {
                                            Ra = f[da >> 2] | 0
                                            f[(Ra + (Ia << 2)) >> 2] = La
                                            Db = Ra
                                        } else {
                                            Ra = f[ea >> 2] | 0
                                            La = f[da >> 2] | 0
                                            f[(La + (Ia << 2)) >> 2] = (Pa | 0) < (Ra | 0) ? Ra : Pa
                                            Db = La
                                        }
                                        Ia = (Ia + 1) | 0
                                    } while ((Ia | 0) < (f[z >> 2] | 0))
                                    Eb = Db
                                } else Eb = f[da >> 2] | 0
                                Ia = ((f[(Ea + (db << 2)) >> 2] | 0) - (f[(Eb + (db << 2)) >> 2] | 0)) | 0
                                La = (Qa + (db << 2)) | 0
                                f[La >> 2] = Ia
                                do
                                    if ((Ia | 0) < (f[fa >> 2] | 0)) {
                                        Fb = ((f[ga >> 2] | 0) + Ia) | 0
                                        tb = 109
                                    } else {
                                        if ((Ia | 0) <= (f[ha >> 2] | 0)) break
                                        Fb = (Ia - (f[ga >> 2] | 0)) | 0
                                        tb = 109
                                    }
                                while (0)
                                if ((tb | 0) == 109) {
                                    tb = 0
                                    f[La >> 2] = Fb
                                }
                                db = (db + 1) | 0
                                Ca = f[z >> 2] | 0
                                if ((db | 0) >= (Ca | 0)) break
                                else Ba = Eb
                            }
                        }
                        Ba = f[ia >> 2] | 0
                        if (Ba | 0) {
                            Ca = f[la >> 2] | 0
                            if ((Ca | 0) != (Ba | 0)) f[la >> 2] = Ca + (~(((Ca + -4 - Ba) | 0) >>> 2) << 2)
                            br(Ba)
                        }
                        Ba = f[ja >> 2] | 0
                        if (Ba | 0) {
                            Ca = f[ka >> 2] | 0
                            if ((Ca | 0) != (Ba | 0)) f[ka >> 2] = Ca + (~(((Ca + -4 - Ba) | 0) >>> 2) << 2)
                            br(Ba)
                        }
                        if ((qa | 0) <= 2) {
                            Gb = _a
                            Hb = Za
                            break a
                        }
                        Ba = f[B >> 2] | 0
                        sa = f[Ba >> 2] | 0
                        Ca = (ra + -1) | 0
                        if ((((f[(Ba + 4) >> 2] | 0) - sa) >> 2) >>> 0 <= Ca >>> 0) {
                            Aa = Ba
                            tb = 18
                            break
                        } else {
                            Ba = ra
                            ra = Ca
                            ta = bb
                            ua = ab
                            va = $a
                            wa = _a
                            xa = Za
                            ya = Ya
                            za = Xa
                            qa = Ba
                        }
                    }
                    if ((tb | 0) == 18) mq(Aa)
                    else if ((tb | 0) == 114) mq(Ab)
                    else if ((tb | 0) == 119) mq(Ab)
                } else {
                    Gb = M
                    Hb = N
                }
            while (0)
            N = f[l >> 2] | 0
            if ((g | 0) > 0 ? ((f[N >> 2] = 0), (g | 0) != 1) : 0) {
                M = 1
                do {
                    f[(N + (M << 2)) >> 2] = 0
                    M = (M + 1) | 0
                } while ((M | 0) != (g | 0))
            }
            g = f[z >> 2] | 0
            if ((g | 0) > 0) {
                M = (a + 16) | 0
                Ab = (a + 32) | 0
                Aa = (a + 12) | 0
                qa = (a + 28) | 0
                Xa = (a + 20) | 0
                za = (a + 24) | 0
                a = 0
                Ya = N
                N = g
                while (1) {
                    if ((N | 0) > 0) {
                        g = 0
                        do {
                            ya = f[(Ya + (g << 2)) >> 2] | 0
                            Za = f[M >> 2] | 0
                            if ((ya | 0) > (Za | 0)) {
                                xa = f[Ab >> 2] | 0
                                f[(xa + (g << 2)) >> 2] = Za
                                Ib = xa
                            } else {
                                xa = f[Aa >> 2] | 0
                                Za = f[Ab >> 2] | 0
                                f[(Za + (g << 2)) >> 2] = (ya | 0) < (xa | 0) ? xa : ya
                                Ib = Za
                            }
                            g = (g + 1) | 0
                        } while ((g | 0) < (f[z >> 2] | 0))
                        Jb = Ib
                    } else Jb = f[Ab >> 2] | 0
                    g = ((f[(c + (a << 2)) >> 2] | 0) - (f[(Jb + (a << 2)) >> 2] | 0)) | 0
                    Za = (d + (a << 2)) | 0
                    f[Za >> 2] = g
                    if ((g | 0) >= (f[qa >> 2] | 0)) {
                        if ((g | 0) > (f[za >> 2] | 0)) {
                            Kb = (g - (f[Xa >> 2] | 0)) | 0
                            tb = 145
                        }
                    } else {
                        Kb = ((f[Xa >> 2] | 0) + g) | 0
                        tb = 145
                    }
                    if ((tb | 0) == 145) {
                        tb = 0
                        f[Za >> 2] = Kb
                    }
                    a = (a + 1) | 0
                    N = f[z >> 2] | 0
                    if ((a | 0) >= (N | 0)) break
                    else Ya = Jb
                }
            }
            if (Gb | 0) {
                if ((Hb | 0) != (Gb | 0)) f[H >> 2] = Hb + (~(((Hb + -4 - Gb) | 0) >>> 2) << 2)
                br(Gb)
            }
            Gb = f[m >> 2] | 0
            if (Gb | 0) {
                m = f[E >> 2] | 0
                if ((m | 0) != (Gb | 0)) f[E >> 2] = m + (~(((m + -4 - Gb) | 0) >>> 2) << 2)
                br(Gb)
            }
            Gb = f[(l + 36) >> 2] | 0
            if (Gb | 0) {
                m = (l + 40) | 0
                E = f[m >> 2] | 0
                if ((E | 0) != (Gb | 0)) f[m >> 2] = E + (~(((E + -4 - Gb) | 0) >>> 2) << 2)
                br(Gb)
            }
            Gb = f[(l + 24) >> 2] | 0
            if (Gb | 0) {
                E = (l + 28) | 0
                m = f[E >> 2] | 0
                if ((m | 0) != (Gb | 0)) f[E >> 2] = m + (~(((m + -4 - Gb) | 0) >>> 2) << 2)
                br(Gb)
            }
            Gb = f[(l + 12) >> 2] | 0
            if (Gb | 0) {
                m = (l + 16) | 0
                E = f[m >> 2] | 0
                if ((E | 0) != (Gb | 0)) f[m >> 2] = E + (~(((E + -4 - Gb) | 0) >>> 2) << 2)
                br(Gb)
            }
            Gb = f[l >> 2] | 0
            if (!Gb) {
                u = i
                return 1
            }
            E = (l + 4) | 0
            l = f[E >> 2] | 0
            if ((l | 0) != (Gb | 0)) f[E >> 2] = l + (~(((l + -4 - Gb) | 0) >>> 2) << 2)
            br(Gb)
            u = i
            return 1
        }
        function bb(a, c, d, e, g, i) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                L = 0,
                M = 0,
                N = 0,
                O = 0,
                P = 0,
                Q = 0,
                R = 0,
                S = 0,
                T = 0,
                U = 0,
                V = 0,
                Z = 0,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0,
                xa = 0,
                ya = 0,
                za = 0,
                Aa = 0,
                Ba = 0,
                Ca = 0,
                Da = 0,
                Ea = 0,
                Fa = 0,
                Ga = 0,
                Ha = 0,
                Ia = 0,
                Ja = 0,
                Ka = 0,
                La = 0,
                Ma = 0,
                Na = 0,
                Oa = 0,
                Pa = 0,
                Qa = 0,
                Ra = 0,
                Sa = 0,
                Ta = 0,
                Ua = 0,
                Va = 0.0,
                Wa = 0,
                Xa = 0,
                Ya = 0,
                Za = 0,
                _a = 0,
                $a = 0,
                ab = 0,
                bb = 0,
                cb = 0,
                db = 0,
                eb = 0,
                fb = 0,
                gb = 0,
                hb = 0,
                ib = 0,
                jb = 0,
                kb = 0,
                lb = 0,
                mb = 0,
                nb = 0,
                ob = 0,
                pb = 0,
                qb = 0,
                rb = 0,
                sb = 0,
                tb = 0,
                ub = 0,
                vb = 0,
                wb = 0,
                xb = 0,
                yb = 0,
                zb = 0,
                Ab = 0,
                Bb = 0,
                Cb = 0,
                Db = 0,
                Eb = 0,
                Fb = 0,
                Gb = 0,
                Hb = 0,
                Ib = 0,
                Jb = 0,
                Kb = 0,
                Lb = 0,
                Mb = 0
            i = u
            u = (u + 240) | 0
            j = (i + 104) | 0
            k = (i + 224) | 0
            l = (i + 176) | 0
            m = (i + 160) | 0
            n = (i + 228) | 0
            o = (i + 72) | 0
            p = (i + 40) | 0
            q = (i + 132) | 0
            r = i
            s = (i + 172) | 0
            t = (i + 156) | 0
            v = (i + 152) | 0
            w = (i + 148) | 0
            x = (i + 144) | 0
            y = (i + 128) | 0
            z = (a + 8) | 0
            Ah(z, c, e, g)
            e = f[(a + 48) >> 2] | 0
            A = f[(a + 52) >> 2] | 0
            B = l
            C = (B + 48) | 0
            do {
                f[B >> 2] = 0
                B = (B + 4) | 0
            } while ((B | 0) < (C | 0))
            if (!g) {
                D = 0
                E = 0
            } else {
                oi(l, g)
                D = f[(l + 12) >> 2] | 0
                E = f[(l + 16) >> 2] | 0
            }
            B = (l + 16) | 0
            C = (E - D) >> 2
            F = D
            D = E
            if (C >>> 0 >= g >>> 0) {
                if (C >>> 0 > g >>> 0 ? ((E = (F + (g << 2)) | 0), (E | 0) != (D | 0)) : 0) f[B >> 2] = D + (~(((D + -4 - E) | 0) >>> 2) << 2)
            } else oi((l + 12) | 0, (g - C) | 0)
            C = (l + 24) | 0
            E = (l + 28) | 0
            D = f[E >> 2] | 0
            B = f[C >> 2] | 0
            F = (D - B) >> 2
            G = B
            B = D
            if (F >>> 0 >= g >>> 0) {
                if (F >>> 0 > g >>> 0 ? ((D = (G + (g << 2)) | 0), (D | 0) != (B | 0)) : 0) f[E >> 2] = B + (~(((B + -4 - D) | 0) >>> 2) << 2)
            } else oi(C, (g - F) | 0)
            F = (l + 36) | 0
            C = (l + 40) | 0
            D = f[C >> 2] | 0
            B = f[F >> 2] | 0
            E = (D - B) >> 2
            G = B
            B = D
            if (E >>> 0 >= g >>> 0) {
                if (E >>> 0 > g >>> 0 ? ((D = (G + (g << 2)) | 0), (D | 0) != (B | 0)) : 0) f[C >> 2] = B + (~(((B + -4 - D) | 0) >>> 2) << 2)
            } else oi(F, (g - E) | 0)
            f[m >> 2] = 0
            E = (m + 4) | 0
            f[E >> 2] = 0
            f[(m + 8) >> 2] = 0
            F = (g | 0) == 0
            do
                if (!F)
                    if (g >>> 0 > 1073741823) mq(m)
                    else {
                        D = g << 2
                        B = dn(D) | 0
                        f[m >> 2] = B
                        C = (B + (g << 2)) | 0
                        f[(m + 8) >> 2] = C
                        hj(B | 0, 0, D | 0) | 0
                        f[E >> 2] = C
                        break
                    }
            while (0)
            C = (a + 152) | 0
            D = (a + 156) | 0
            B = f[D >> 2] | 0
            G = f[C >> 2] | 0
            H = (B - G) >> 2
            L = G
            G = B
            if (H >>> 0 >= g >>> 0) {
                if (H >>> 0 > g >>> 0 ? ((B = (L + (g << 2)) | 0), (B | 0) != (G | 0)) : 0) f[D >> 2] = G + (~(((G + -4 - B) | 0) >>> 2) << 2)
            } else oi(C, (g - H) | 0)
            f[o >> 2] = 0
            f[(o + 4) >> 2] = 0
            f[(o + 8) >> 2] = 0
            f[(o + 12) >> 2] = 0
            f[(o + 16) >> 2] = 0
            f[(o + 20) >> 2] = 0
            f[(o + 24) >> 2] = 0
            f[(o + 28) >> 2] = 0
            f[p >> 2] = 0
            f[(p + 4) >> 2] = 0
            f[(p + 8) >> 2] = 0
            f[(p + 12) >> 2] = 0
            f[(p + 16) >> 2] = 0
            f[(p + 20) >> 2] = 0
            f[(p + 24) >> 2] = 0
            f[(p + 28) >> 2] = 0
            f[q >> 2] = 0
            H = (q + 4) | 0
            f[H >> 2] = 0
            f[(q + 8) >> 2] = 0
            if (F) {
                M = 0
                N = 0
                O = 0
                P = 0
            } else {
                F = g << 2
                B = dn(F) | 0
                f[q >> 2] = B
                G = (B + (g << 2)) | 0
                f[(q + 8) >> 2] = G
                hj(B | 0, 0, F | 0) | 0
                f[H >> 2] = G
                M = B
                N = G
                O = G
                P = B
            }
            B = (a + 56) | 0
            G = f[B >> 2] | 0
            F = f[(G + 4) >> 2] | 0
            D = f[G >> 2] | 0
            L = (F - D) | 0
            a: do
                if ((L | 0) > 4) {
                    Q = L >>> 2
                    R = (e + 12) | 0
                    S = (g | 0) > 0
                    T = (r + 4) | 0
                    U = (r + 8) | 0
                    V = (r + 12) | 0
                    Z = (a + 152) | 0
                    _ = (a + 112) | 0
                    $ = (r + 16) | 0
                    aa = (r + 28) | 0
                    ba = (a + 16) | 0
                    ca = (a + 32) | 0
                    da = (a + 12) | 0
                    ea = (a + 28) | 0
                    fa = (a + 20) | 0
                    ga = (a + 24) | 0
                    ha = (r + 28) | 0
                    ia = (r + 16) | 0
                    ja = (r + 20) | 0
                    ka = (r + 32) | 0
                    la = (n + 1) | 0
                    ma = g << 2
                    na = (g | 0) == 1
                    oa = (Q + -1) | 0
                    if (((F - D) >> 2) >>> 0 > oa >>> 0) {
                        pa = Q
                        qa = oa
                        ra = D
                        sa = M
                        ta = P
                        ua = O
                        va = M
                        wa = N
                        xa = M
                        ya = N
                    } else {
                        za = G
                        mq(za)
                    }
                    b: while (1) {
                        oa = f[(ra + (qa << 2)) >> 2] | 0
                        Q = ((((oa >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + oa) | 0
                        Aa = ((oa | 0) == -1) | ((Q | 0) == -1)
                        Ba = 1
                        Ca = 0
                        Da = oa
                        c: while (1) {
                            Ea = Ba ^ 1
                            Fa = Ca
                            Ga = Da
                            while (1) {
                                if ((Ga | 0) == -1) {
                                    Ha = Fa
                                    break c
                                }
                                Ia = f[(l + ((Fa * 12) | 0)) >> 2] | 0
                                Ja = f[R >> 2] | 0
                                Ka = f[(Ja + (Ga << 2)) >> 2] | 0
                                if ((Ka | 0) != -1) {
                                    La = f[e >> 2] | 0
                                    Ma = f[A >> 2] | 0
                                    Na = f[(Ma + (f[(La + (Ka << 2)) >> 2] << 2)) >> 2] | 0
                                    Oa = (Ka + 1) | 0
                                    Pa = ((Oa >>> 0) % 3 | 0 | 0) == 0 ? (Ka + -2) | 0 : Oa
                                    if ((Pa | 0) == -1) Qa = -1
                                    else Qa = f[(La + (Pa << 2)) >> 2] | 0
                                    Pa = f[(Ma + (Qa << 2)) >> 2] | 0
                                    Oa = ((((Ka >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + Ka) | 0
                                    if ((Oa | 0) == -1) Ra = -1
                                    else Ra = f[(La + (Oa << 2)) >> 2] | 0
                                    Oa = f[(Ma + (Ra << 2)) >> 2] | 0
                                    if (((Na | 0) < (qa | 0)) & ((Pa | 0) < (qa | 0)) & ((Oa | 0) < (qa | 0))) {
                                        Ma = X(Na, g) | 0
                                        Na = X(Pa, g) | 0
                                        Pa = X(Oa, g) | 0
                                        if (S) {
                                            Oa = 0
                                            do {
                                                f[(Ia + (Oa << 2)) >> 2] = (f[(c + ((Oa + Pa) << 2)) >> 2] | 0) + (f[(c + ((Oa + Na) << 2)) >> 2] | 0) - (f[(c + ((Oa + Ma) << 2)) >> 2] | 0)
                                                Oa = (Oa + 1) | 0
                                            } while ((Oa | 0) != (g | 0))
                                        }
                                        Oa = (Fa + 1) | 0
                                        if ((Oa | 0) == 4) {
                                            Ha = 4
                                            break c
                                        } else Sa = Oa
                                    } else Sa = Fa
                                } else Sa = Fa
                                do
                                    if (Ba) {
                                        Oa = (Ga + 1) | 0
                                        Ma = ((Oa >>> 0) % 3 | 0 | 0) == 0 ? (Ga + -2) | 0 : Oa
                                        if ((Ma | 0) != -1 ? ((Oa = f[(Ja + (Ma << 2)) >> 2] | 0), (Ma = (Oa + 1) | 0), (Oa | 0) != -1) : 0) Ta = ((Ma >>> 0) % 3 | 0 | 0) == 0 ? (Oa + -2) | 0 : Ma
                                        else Ta = -1
                                    } else {
                                        Ma = ((((Ga >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + Ga) | 0
                                        if ((Ma | 0) != -1 ? ((Oa = f[(Ja + (Ma << 2)) >> 2] | 0), (Oa | 0) != -1) : 0)
                                            if (!((Oa >>> 0) % 3 | 0)) {
                                                Ta = (Oa + 2) | 0
                                                break
                                            } else {
                                                Ta = (Oa + -1) | 0
                                                break
                                            }
                                        else Ta = -1
                                    }
                                while (0)
                                if ((Ta | 0) == (oa | 0)) {
                                    Ha = Sa
                                    break c
                                }
                                if (((Ta | 0) != -1) | Ea) {
                                    Fa = Sa
                                    Ga = Ta
                                } else break
                            }
                            if (Aa) {
                                Ba = 0
                                Ca = Sa
                                Da = -1
                                continue
                            }
                            Ga = f[(Ja + (Q << 2)) >> 2] | 0
                            if ((Ga | 0) == -1) {
                                Ba = 0
                                Ca = Sa
                                Da = -1
                                continue
                            }
                            if (!((Ga >>> 0) % 3 | 0)) {
                                Ba = 0
                                Ca = Sa
                                Da = (Ga + 2) | 0
                                continue
                            } else {
                                Ba = 0
                                Ca = Sa
                                Da = (Ga + -1) | 0
                                continue
                            }
                        }
                        Da = X(qa, g) | 0
                        f[r >> 2] = 0
                        f[T >> 2] = 0
                        b[U >> 0] = 0
                        f[V >> 2] = 0
                        f[(V + 4) >> 2] = 0
                        f[(V + 8) >> 2] = 0
                        f[(V + 12) >> 2] = 0
                        f[(V + 16) >> 2] = 0
                        f[(V + 20) >> 2] = 0
                        f[(V + 24) >> 2] = 0
                        Ca = (c + ((X((pa + -2) | 0, g) | 0) << 2)) | 0
                        Ba = (c + (Da << 2)) | 0
                        Q = f[Z >> 2] | 0
                        if (S) {
                            Aa = 0
                            oa = 0
                            while (1) {
                                Ga = ((f[(Ca + (Aa << 2)) >> 2] | 0) - (f[(Ba + (Aa << 2)) >> 2] | 0)) | 0
                                Fa = (((Ga | 0) > -1 ? Ga : (0 - Ga) | 0) + oa) | 0
                                f[(sa + (Aa << 2)) >> 2] = Ga
                                f[(Q + (Aa << 2)) >> 2] = (Ga << 1) ^ (Ga >> 31)
                                Aa = (Aa + 1) | 0
                                if ((Aa | 0) == (g | 0)) {
                                    Ua = Fa
                                    break
                                } else oa = Fa
                            }
                        } else Ua = 0
                        ho(j, _, Q, g)
                        oa = Tk(j) | 0
                        Aa = I
                        Fa = om(j) | 0
                        Ga = Tn(Fa | 0, I | 0, oa | 0, Aa | 0) | 0
                        Aa = I
                        oa = (Ha | 0) > 0
                        if (oa) {
                            Fa = (Ha + -1) | 0
                            Ea = (p + (Fa << 3)) | 0
                            Oa = Ea
                            Ma = Tn(f[Oa >> 2] | 0, f[(Oa + 4) >> 2] | 0, Ha | 0, ((((Ha | 0) < 0) << 31) >> 31) | 0) | 0
                            Oa = I
                            Na = Ea
                            f[Na >> 2] = Ma
                            f[(Na + 4) >> 2] = Oa
                            Va = +W(+(+jm(Ma, f[(o + (Fa << 3)) >> 2] | 0) * (+(Ma >>> 0) + 4294967296.0 * +(Oa | 0))))
                            Oa =
                                Tn(
                                    Ga | 0,
                                    Aa | 0,
                                    (~~Va >>> 0) | 0,
                                    (+K(Va) >= 1.0 ? (Va > 0.0 ? ~~+Y(+J(Va / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((Va - +(~~Va >>> 0)) / 4294967296.0) >>> 0) : 0) | 0
                                ) | 0
                            Wa = Oa
                        } else Wa = Ga
                        Ga = r
                        f[Ga >> 2] = Wa
                        f[(Ga + 4) >> 2] = Ua
                        b[U >> 0] = 0
                        f[V >> 2] = 0
                        Mf($, Ca, (Ca + (g << 2)) | 0)
                        f[s >> 2] = ta
                        f[t >> 2] = ua
                        f[k >> 2] = f[s >> 2]
                        f[j >> 2] = f[t >> 2]
                        tf(aa, k, j)
                        if ((Ha | 0) < 1) {
                            Xa = ya
                            Ya = xa
                            Za = wa
                            _a = va
                            $a = ua
                            ab = ta
                            bb = ta
                        } else {
                            Ga = (n + Ha) | 0
                            Oa = f[q >> 2] | 0
                            Aa = (Ha + -1) | 0
                            Ma = (o + (Aa << 3)) | 0
                            Fa = (p + (Aa << 3)) | 0
                            Aa = Oa
                            Na = f[H >> 2] | 0
                            Ea = (Ga + -1) | 0
                            Pa = (Ea | 0) == (n | 0)
                            Ia = (Ga + -2) | 0
                            La = la >>> 0 < Ia >>> 0
                            Ka = ~Ha
                            cb = (Ha + 2 + ((Ka | 0) > -2 ? Ka : -2)) | 0
                            Ka = Na
                            db = Ea >>> 0 > n >>> 0
                            eb = 0
                            fb = 1
                            while (1) {
                                eb = (eb + 1) | 0
                                hj(n | 0, 1, cb | 0) | 0
                                hj(n | 0, 0, eb | 0) | 0
                                d: while (1) {
                                    if (S) {
                                        hj(f[m >> 2] | 0, 0, ma | 0) | 0
                                        gb = f[m >> 2] | 0
                                        hb = 0
                                        ib = 0
                                        while (1) {
                                            if (!(b[(n + hb) >> 0] | 0)) {
                                                jb = f[(l + ((hb * 12) | 0)) >> 2] | 0
                                                kb = 0
                                                do {
                                                    lb = (gb + (kb << 2)) | 0
                                                    f[lb >> 2] = (f[lb >> 2] | 0) + (f[(jb + (kb << 2)) >> 2] | 0)
                                                    kb = (kb + 1) | 0
                                                } while ((kb | 0) != (g | 0))
                                                mb = ((1 << hb) | (ib & 255)) & 255
                                            } else mb = ib
                                            hb = (hb + 1) | 0
                                            if ((hb | 0) == (Ha | 0)) {
                                                nb = mb
                                                break
                                            } else ib = mb
                                        }
                                    } else {
                                        ib = 0
                                        hb = 0
                                        while (1) {
                                            if (!(b[(n + ib) >> 0] | 0)) ob = ((1 << ib) | (hb & 255)) & 255
                                            else ob = hb
                                            ib = (ib + 1) | 0
                                            if ((ib | 0) == (Ha | 0)) {
                                                nb = ob
                                                break
                                            } else hb = ob
                                        }
                                    }
                                    hb = f[m >> 2] | 0
                                    do
                                        if (S) {
                                            f[hb >> 2] = ((f[hb >> 2] | 0) / (fb | 0)) | 0
                                            if (!na) {
                                                ib = 1
                                                do {
                                                    gb = (hb + (ib << 2)) | 0
                                                    f[gb >> 2] = ((f[gb >> 2] | 0) / (fb | 0)) | 0
                                                    ib = (ib + 1) | 0
                                                } while ((ib | 0) != (g | 0))
                                                ib = f[Z >> 2] | 0
                                                if (S) pb = ib
                                                else {
                                                    qb = 0
                                                    rb = ib
                                                    break
                                                }
                                            } else pb = f[Z >> 2] | 0
                                            ib = 0
                                            gb = 0
                                            while (1) {
                                                kb = ((f[(hb + (ib << 2)) >> 2] | 0) - (f[(Ba + (ib << 2)) >> 2] | 0)) | 0
                                                jb = (((kb | 0) > -1 ? kb : (0 - kb) | 0) + gb) | 0
                                                f[(Oa + (ib << 2)) >> 2] = kb
                                                f[(pb + (ib << 2)) >> 2] = (kb << 1) ^ (kb >> 31)
                                                ib = (ib + 1) | 0
                                                if ((ib | 0) == (g | 0)) {
                                                    qb = jb
                                                    rb = pb
                                                    break
                                                } else gb = jb
                                            }
                                        } else {
                                            qb = 0
                                            rb = f[Z >> 2] | 0
                                        }
                                    while (0)
                                    ho(j, _, rb, g)
                                    hb = Tk(j) | 0
                                    gb = I
                                    ib = om(j) | 0
                                    jb = Tn(ib | 0, I | 0, hb | 0, gb | 0) | 0
                                    gb = I
                                    if (oa) {
                                        hb = Ma
                                        ib = Tn(f[hb >> 2] | 0, f[(hb + 4) >> 2] | 0, fb | 0, 0) | 0
                                        hb = Fa
                                        kb = f[hb >> 2] | 0
                                        lb = f[(hb + 4) >> 2] | 0
                                        Va = +W(+(+jm(kb, ib) * (+(kb >>> 0) + 4294967296.0 * +(lb | 0))))
                                        lb =
                                            Tn(
                                                jb | 0,
                                                gb | 0,
                                                (~~Va >>> 0) | 0,
                                                (+K(Va) >= 1.0 ? (Va > 0.0 ? ~~+Y(+J(Va / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((Va - +(~~Va >>> 0)) / 4294967296.0) >>> 0) : 0) | 0
                                            ) | 0
                                        sb = lb
                                    } else sb = jb
                                    jb = f[r >> 2] | 0
                                    if (!((sb | 0) >= (jb | 0) ? !((sb | 0) <= (jb | 0) ? (qb | 0) < (f[T >> 2] | 0) : 0) : 0)) {
                                        jb = r
                                        f[jb >> 2] = sb
                                        f[(jb + 4) >> 2] = qb
                                        b[U >> 0] = nb
                                        f[V >> 2] = fb
                                        f[v >> 2] = f[m >> 2]
                                        f[w >> 2] = f[E >> 2]
                                        f[k >> 2] = f[v >> 2]
                                        f[j >> 2] = f[w >> 2]
                                        tf($, k, j)
                                        f[x >> 2] = Aa
                                        f[y >> 2] = Na
                                        f[k >> 2] = f[x >> 2]
                                        f[j >> 2] = f[y >> 2]
                                        tf(aa, k, j)
                                    }
                                    if (Pa) break
                                    tb = b[Ea >> 0] | 0
                                    jb = -1
                                    lb = tb
                                    while (1) {
                                        gb = (jb + -1) | 0
                                        ub = (Ga + gb) | 0
                                        kb = lb
                                        lb = b[ub >> 0] | 0
                                        if ((lb & 255) < (kb & 255)) break
                                        if ((ub | 0) == (n | 0)) {
                                            vb = 86
                                            break d
                                        } else jb = gb
                                    }
                                    gb = (Ga + jb) | 0
                                    if ((lb & 255) < (tb & 255)) {
                                        wb = Ea
                                        xb = tb
                                    } else {
                                        kb = Ga
                                        ib = Ea
                                        while (1) {
                                            hb = (ib + -1) | 0
                                            if ((lb & 255) < (h[(kb + -2) >> 0] | 0)) {
                                                wb = hb
                                                xb = 1
                                                break
                                            } else {
                                                yb = ib
                                                ib = hb
                                                kb = yb
                                            }
                                        }
                                    }
                                    b[ub >> 0] = xb
                                    b[wb >> 0] = lb
                                    if ((jb | 0) < -1) {
                                        zb = gb
                                        Ab = Ea
                                    } else continue
                                    while (1) {
                                        kb = b[zb >> 0] | 0
                                        b[zb >> 0] = b[Ab >> 0] | 0
                                        b[Ab >> 0] = kb
                                        kb = (zb + 1) | 0
                                        ib = (Ab + -1) | 0
                                        if (kb >>> 0 < ib >>> 0) {
                                            zb = kb
                                            Ab = ib
                                        } else continue d
                                    }
                                }
                                if (((vb | 0) == 86 ? ((vb = 0), db) : 0) ? ((gb = b[n >> 0] | 0), (b[n >> 0] = tb), (b[Ea >> 0] = gb), La) : 0) {
                                    gb = Ia
                                    jb = la
                                    do {
                                        lb = b[jb >> 0] | 0
                                        b[jb >> 0] = b[gb >> 0] | 0
                                        b[gb >> 0] = lb
                                        jb = (jb + 1) | 0
                                        gb = (gb + -1) | 0
                                    } while (jb >>> 0 < gb >>> 0)
                                }
                                if ((fb | 0) >= (Ha | 0)) {
                                    Xa = Ka
                                    Ya = Oa
                                    Za = Ka
                                    _a = Oa
                                    $a = Na
                                    ab = Aa
                                    bb = Oa
                                    break
                                } else fb = (fb + 1) | 0
                            }
                        }
                        if (oa) {
                            fb = f[V >> 2] | 0
                            Oa = (o + ((Ha + -1) << 3)) | 0
                            Aa = Oa
                            Na = Tn(f[Aa >> 2] | 0, f[(Aa + 4) >> 2] | 0, fb | 0, ((((fb | 0) < 0) << 31) >> 31) | 0) | 0
                            fb = Oa
                            f[fb >> 2] = Na
                            f[(fb + 4) >> 2] = I
                        }
                        if (S) {
                            fb = f[aa >> 2] | 0
                            Na = f[C >> 2] | 0
                            Oa = 0
                            do {
                                Aa = f[(fb + (Oa << 2)) >> 2] | 0
                                f[(Na + (Oa << 2)) >> 2] = (Aa << 1) ^ (Aa >> 31)
                                Oa = (Oa + 1) | 0
                            } while ((Oa | 0) != (g | 0))
                            Bb = Na
                        } else Bb = f[C >> 2] | 0
                        go(j, _, Bb, g)
                        if (oa) {
                            Na = (Ha + -1) | 0
                            Cb = (a + 60 + ((Na * 12) | 0)) | 0
                            Oa = (a + 60 + ((Na * 12) | 0) + 4) | 0
                            fb = (a + 60 + ((Na * 12) | 0) + 8) | 0
                            Na = 0
                            do {
                                Aa = f[Oa >> 2] | 0
                                Ka = f[fb >> 2] | 0
                                Ia = (Aa | 0) == ((Ka << 5) | 0)
                                if (!((1 << Na) & h[U >> 0])) {
                                    if (Ia) {
                                        if (((Aa + 1) | 0) < 0) {
                                            vb = 114
                                            break b
                                        }
                                        La = Ka << 6
                                        Ea = (Aa + 32) & -32
                                        hi(Cb, Aa >>> 0 < 1073741823 ? (La >>> 0 < Ea >>> 0 ? Ea : La) : 2147483647)
                                        Db = f[Oa >> 2] | 0
                                    } else Db = Aa
                                    f[Oa >> 2] = Db + 1
                                    La = ((f[Cb >> 2] | 0) + ((Db >>> 5) << 2)) | 0
                                    f[La >> 2] = f[La >> 2] | (1 << (Db & 31))
                                } else {
                                    if (Ia) {
                                        if (((Aa + 1) | 0) < 0) {
                                            vb = 119
                                            break b
                                        }
                                        Ia = Ka << 6
                                        Ka = (Aa + 32) & -32
                                        hi(Cb, Aa >>> 0 < 1073741823 ? (Ia >>> 0 < Ka >>> 0 ? Ka : Ia) : 2147483647)
                                        Eb = f[Oa >> 2] | 0
                                    } else Eb = Aa
                                    f[Oa >> 2] = Eb + 1
                                    Aa = ((f[Cb >> 2] | 0) + ((Eb >>> 5) << 2)) | 0
                                    f[Aa >> 2] = f[Aa >> 2] & ~(1 << (Eb & 31))
                                }
                                Na = (Na + 1) | 0
                            } while ((Na | 0) < (Ha | 0))
                        }
                        Na = (d + (Da << 2)) | 0
                        Oa = f[z >> 2] | 0
                        if ((Oa | 0) > 0) {
                            fb = 0
                            oa = f[$ >> 2] | 0
                            Aa = Oa
                            while (1) {
                                if ((Aa | 0) > 0) {
                                    Oa = 0
                                    do {
                                        Ia = f[(oa + (Oa << 2)) >> 2] | 0
                                        Ka = f[ba >> 2] | 0
                                        if ((Ia | 0) > (Ka | 0)) {
                                            La = f[ca >> 2] | 0
                                            f[(La + (Oa << 2)) >> 2] = Ka
                                            Fb = La
                                        } else {
                                            La = f[da >> 2] | 0
                                            Ka = f[ca >> 2] | 0
                                            f[(Ka + (Oa << 2)) >> 2] = (Ia | 0) < (La | 0) ? La : Ia
                                            Fb = Ka
                                        }
                                        Oa = (Oa + 1) | 0
                                    } while ((Oa | 0) < (f[z >> 2] | 0))
                                    Gb = Fb
                                } else Gb = f[ca >> 2] | 0
                                Oa = ((f[(Ba + (fb << 2)) >> 2] | 0) - (f[(Gb + (fb << 2)) >> 2] | 0)) | 0
                                Ka = (Na + (fb << 2)) | 0
                                f[Ka >> 2] = Oa
                                do
                                    if ((Oa | 0) < (f[ea >> 2] | 0)) {
                                        Hb = ((f[fa >> 2] | 0) + Oa) | 0
                                        vb = 109
                                    } else {
                                        if ((Oa | 0) <= (f[ga >> 2] | 0)) break
                                        Hb = (Oa - (f[fa >> 2] | 0)) | 0
                                        vb = 109
                                    }
                                while (0)
                                if ((vb | 0) == 109) {
                                    vb = 0
                                    f[Ka >> 2] = Hb
                                }
                                fb = (fb + 1) | 0
                                Aa = f[z >> 2] | 0
                                if ((fb | 0) >= (Aa | 0)) break
                                else oa = Gb
                            }
                        }
                        oa = f[ha >> 2] | 0
                        if (oa | 0) {
                            Aa = f[ka >> 2] | 0
                            if ((Aa | 0) != (oa | 0)) f[ka >> 2] = Aa + (~(((Aa + -4 - oa) | 0) >>> 2) << 2)
                            br(oa)
                        }
                        oa = f[ia >> 2] | 0
                        if (oa | 0) {
                            Aa = f[ja >> 2] | 0
                            if ((Aa | 0) != (oa | 0)) f[ja >> 2] = Aa + (~(((Aa + -4 - oa) | 0) >>> 2) << 2)
                            br(oa)
                        }
                        if ((pa | 0) <= 2) {
                            Ib = _a
                            Jb = Za
                            break a
                        }
                        oa = f[B >> 2] | 0
                        ra = f[oa >> 2] | 0
                        Aa = (qa + -1) | 0
                        if ((((f[(oa + 4) >> 2] | 0) - ra) >> 2) >>> 0 <= Aa >>> 0) {
                            za = oa
                            vb = 18
                            break
                        } else {
                            oa = qa
                            qa = Aa
                            sa = bb
                            ta = ab
                            ua = $a
                            va = _a
                            wa = Za
                            xa = Ya
                            ya = Xa
                            pa = oa
                        }
                    }
                    if ((vb | 0) == 18) mq(za)
                    else if ((vb | 0) == 114) mq(Cb)
                    else if ((vb | 0) == 119) mq(Cb)
                } else {
                    Ib = M
                    Jb = N
                }
            while (0)
            N = f[l >> 2] | 0
            if ((g | 0) > 0 ? ((f[N >> 2] = 0), (g | 0) != 1) : 0) {
                M = 1
                do {
                    f[(N + (M << 2)) >> 2] = 0
                    M = (M + 1) | 0
                } while ((M | 0) != (g | 0))
            }
            g = f[z >> 2] | 0
            if ((g | 0) > 0) {
                M = (a + 16) | 0
                Cb = (a + 32) | 0
                za = (a + 12) | 0
                pa = (a + 28) | 0
                Xa = (a + 20) | 0
                ya = (a + 24) | 0
                a = 0
                Ya = N
                N = g
                while (1) {
                    if ((N | 0) > 0) {
                        g = 0
                        do {
                            xa = f[(Ya + (g << 2)) >> 2] | 0
                            Za = f[M >> 2] | 0
                            if ((xa | 0) > (Za | 0)) {
                                wa = f[Cb >> 2] | 0
                                f[(wa + (g << 2)) >> 2] = Za
                                Kb = wa
                            } else {
                                wa = f[za >> 2] | 0
                                Za = f[Cb >> 2] | 0
                                f[(Za + (g << 2)) >> 2] = (xa | 0) < (wa | 0) ? wa : xa
                                Kb = Za
                            }
                            g = (g + 1) | 0
                        } while ((g | 0) < (f[z >> 2] | 0))
                        Lb = Kb
                    } else Lb = f[Cb >> 2] | 0
                    g = ((f[(c + (a << 2)) >> 2] | 0) - (f[(Lb + (a << 2)) >> 2] | 0)) | 0
                    Za = (d + (a << 2)) | 0
                    f[Za >> 2] = g
                    if ((g | 0) >= (f[pa >> 2] | 0)) {
                        if ((g | 0) > (f[ya >> 2] | 0)) {
                            Mb = (g - (f[Xa >> 2] | 0)) | 0
                            vb = 145
                        }
                    } else {
                        Mb = ((f[Xa >> 2] | 0) + g) | 0
                        vb = 145
                    }
                    if ((vb | 0) == 145) {
                        vb = 0
                        f[Za >> 2] = Mb
                    }
                    a = (a + 1) | 0
                    N = f[z >> 2] | 0
                    if ((a | 0) >= (N | 0)) break
                    else Ya = Lb
                }
            }
            if (Ib | 0) {
                if ((Jb | 0) != (Ib | 0)) f[H >> 2] = Jb + (~(((Jb + -4 - Ib) | 0) >>> 2) << 2)
                br(Ib)
            }
            Ib = f[m >> 2] | 0
            if (Ib | 0) {
                m = f[E >> 2] | 0
                if ((m | 0) != (Ib | 0)) f[E >> 2] = m + (~(((m + -4 - Ib) | 0) >>> 2) << 2)
                br(Ib)
            }
            Ib = f[(l + 36) >> 2] | 0
            if (Ib | 0) {
                m = (l + 40) | 0
                E = f[m >> 2] | 0
                if ((E | 0) != (Ib | 0)) f[m >> 2] = E + (~(((E + -4 - Ib) | 0) >>> 2) << 2)
                br(Ib)
            }
            Ib = f[(l + 24) >> 2] | 0
            if (Ib | 0) {
                E = (l + 28) | 0
                m = f[E >> 2] | 0
                if ((m | 0) != (Ib | 0)) f[E >> 2] = m + (~(((m + -4 - Ib) | 0) >>> 2) << 2)
                br(Ib)
            }
            Ib = f[(l + 12) >> 2] | 0
            if (Ib | 0) {
                m = (l + 16) | 0
                E = f[m >> 2] | 0
                if ((E | 0) != (Ib | 0)) f[m >> 2] = E + (~(((E + -4 - Ib) | 0) >>> 2) << 2)
                br(Ib)
            }
            Ib = f[l >> 2] | 0
            if (!Ib) {
                u = i
                return 1
            }
            E = (l + 4) | 0
            l = f[E >> 2] | 0
            if ((l | 0) != (Ib | 0)) f[E >> 2] = l + (~(((l + -4 - Ib) | 0) >>> 2) << 2)
            br(Ib)
            u = i
            return 1
        }
        function cb(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0
            b = u
            u = (u + 16) | 0
            c = b
            d = (b + 8) | 0
            e = (b + 4) | 0
            f[d >> 2] = a
            do
                if (a >>> 0 >= 212) {
                    g = ((a >>> 0) / 210) | 0
                    h = (g * 210) | 0
                    f[e >> 2] = a - h
                    i = 0
                    j = g
                    g = ((zl(6640, 6832, e, c) | 0) - 6640) >> 2
                    k = h
                    a: while (1) {
                        l = ((f[(6640 + (g << 2)) >> 2] | 0) + k) | 0
                        h = 5
                        while (1) {
                            if (h >>> 0 >= 47) {
                                m = 211
                                n = i
                                o = 8
                                break
                            }
                            p = f[(6448 + (h << 2)) >> 2] | 0
                            q = ((l >>> 0) / (p >>> 0)) | 0
                            if (q >>> 0 < p >>> 0) {
                                o = 106
                                break a
                            }
                            if ((l | 0) == (X(q, p) | 0)) {
                                r = i
                                break
                            } else h = (h + 1) | 0
                        }
                        b: do
                            if ((o | 0) == 8) {
                                c: while (1) {
                                    o = 0
                                    h = ((l >>> 0) / (m >>> 0)) | 0
                                    do
                                        if (h >>> 0 >= m >>> 0)
                                            if ((l | 0) != (X(h, m) | 0)) {
                                                p = (m + 10) | 0
                                                q = ((l >>> 0) / (p >>> 0)) | 0
                                                if (q >>> 0 >= p >>> 0)
                                                    if ((l | 0) != (X(q, p) | 0)) {
                                                        q = (m + 12) | 0
                                                        s = ((l >>> 0) / (q >>> 0)) | 0
                                                        if (s >>> 0 >= q >>> 0)
                                                            if ((l | 0) != (X(s, q) | 0)) {
                                                                s = (m + 16) | 0
                                                                t = ((l >>> 0) / (s >>> 0)) | 0
                                                                if (t >>> 0 >= s >>> 0)
                                                                    if ((l | 0) != (X(t, s) | 0)) {
                                                                        t = (m + 18) | 0
                                                                        v = ((l >>> 0) / (t >>> 0)) | 0
                                                                        if (v >>> 0 >= t >>> 0)
                                                                            if ((l | 0) != (X(v, t) | 0)) {
                                                                                v = (m + 22) | 0
                                                                                w = ((l >>> 0) / (v >>> 0)) | 0
                                                                                if (w >>> 0 >= v >>> 0)
                                                                                    if ((l | 0) != (X(w, v) | 0)) {
                                                                                        w = (m + 28) | 0
                                                                                        x = ((l >>> 0) / (w >>> 0)) | 0
                                                                                        if (x >>> 0 >= w >>> 0)
                                                                                            if ((l | 0) == (X(x, w) | 0)) {
                                                                                                y = w
                                                                                                z = 9
                                                                                                A = n
                                                                                            } else {
                                                                                                x = (m + 30) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 36) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 40) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 42) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 46) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 52) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 58) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 60) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 66) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 70) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 72) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 78) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 82) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 88) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 96) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 100) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 102) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 106) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 108) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 112) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 120) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 126) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 130) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 136) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 138) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 142) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 148) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 150) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 156) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 162) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 166) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 168) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 172) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 178) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 180) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 186) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 190) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 192) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 196) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 198) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                if (B >>> 0 < x >>> 0) {
                                                                                                    y = x
                                                                                                    z = 1
                                                                                                    A = l
                                                                                                    break
                                                                                                }
                                                                                                if ((l | 0) == (X(B, x) | 0)) {
                                                                                                    y = x
                                                                                                    z = 9
                                                                                                    A = n
                                                                                                    break
                                                                                                }
                                                                                                x = (m + 208) | 0
                                                                                                B = ((l >>> 0) / (x >>> 0)) | 0
                                                                                                C = B >>> 0 < x >>> 0
                                                                                                D = (l | 0) == (X(B, x) | 0)
                                                                                                y = C | D ? x : (m + 210) | 0
                                                                                                z = C ? 1 : D ? 9 : 0
                                                                                                A = C ? l : n
                                                                                            }
                                                                                        else {
                                                                                            y = w
                                                                                            z = 1
                                                                                            A = l
                                                                                        }
                                                                                    } else {
                                                                                        y = v
                                                                                        z = 9
                                                                                        A = n
                                                                                    }
                                                                                else {
                                                                                    y = v
                                                                                    z = 1
                                                                                    A = l
                                                                                }
                                                                            } else {
                                                                                y = t
                                                                                z = 9
                                                                                A = n
                                                                            }
                                                                        else {
                                                                            y = t
                                                                            z = 1
                                                                            A = l
                                                                        }
                                                                    } else {
                                                                        y = s
                                                                        z = 9
                                                                        A = n
                                                                    }
                                                                else {
                                                                    y = s
                                                                    z = 1
                                                                    A = l
                                                                }
                                                            } else {
                                                                y = q
                                                                z = 9
                                                                A = n
                                                            }
                                                        else {
                                                            y = q
                                                            z = 1
                                                            A = l
                                                        }
                                                    } else {
                                                        y = p
                                                        z = 9
                                                        A = n
                                                    }
                                                else {
                                                    y = p
                                                    z = 1
                                                    A = l
                                                }
                                            } else {
                                                y = m
                                                z = 9
                                                A = n
                                            }
                                        else {
                                            y = m
                                            z = 1
                                            A = l
                                        }
                                    while (0)
                                    switch (z & 15) {
                                        case 9: {
                                            r = A
                                            break b
                                            break
                                        }
                                        case 0: {
                                            m = y
                                            n = A
                                            o = 8
                                            break
                                        }
                                        default:
                                            break c
                                    }
                                }
                                if (!z) r = A
                                else {
                                    o = 107
                                    break a
                                }
                            }
                        while (0)
                        h = (g + 1) | 0
                        p = (h | 0) == 48
                        q = (j + (p & 1)) | 0
                        i = r
                        j = q
                        g = p ? 0 : h
                        k = (q * 210) | 0
                    }
                    if ((o | 0) == 106) {
                        f[d >> 2] = l
                        E = l
                        break
                    } else if ((o | 0) == 107) {
                        f[d >> 2] = l
                        E = A
                        break
                    }
                } else {
                    k = zl(6448, 6640, d, c) | 0
                    E = f[k >> 2] | 0
                }
            while (0)
            u = b
            return E | 0
        }
        function db(a, c, d, e, g, i) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                L = 0,
                M = 0,
                N = 0,
                O = 0,
                P = 0,
                Q = 0,
                R = 0,
                S = 0,
                T = 0,
                U = 0,
                V = 0,
                Z = 0,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0,
                xa = 0,
                ya = 0,
                za = 0,
                Aa = 0,
                Ba = 0,
                Ca = 0,
                Da = 0,
                Ea = 0,
                Fa = 0,
                Ga = 0,
                Ha = 0,
                Ia = 0,
                Ja = 0,
                Ka = 0,
                La = 0,
                Ma = 0,
                Na = 0,
                Oa = 0,
                Pa = 0,
                Qa = 0,
                Ra = 0,
                Sa = 0,
                Ta = 0.0,
                Ua = 0,
                Va = 0,
                Wa = 0,
                Xa = 0,
                Ya = 0,
                Za = 0,
                _a = 0,
                $a = 0,
                ab = 0,
                bb = 0,
                cb = 0,
                db = 0,
                eb = 0,
                fb = 0,
                gb = 0,
                hb = 0,
                ib = 0,
                jb = 0,
                kb = 0,
                lb = 0,
                mb = 0,
                nb = 0,
                ob = 0,
                pb = 0,
                qb = 0,
                rb = 0,
                sb = 0,
                tb = 0,
                ub = 0,
                vb = 0,
                wb = 0,
                xb = 0,
                yb = 0,
                zb = 0,
                Ab = 0,
                Bb = 0,
                Cb = 0
            i = u
            u = (u + 256) | 0
            e = (i + 104) | 0
            j = (i + 240) | 0
            k = (i + 224) | 0
            l = (i + 160) | 0
            m = (i + 140) | 0
            n = (i + 248) | 0
            o = (i + 72) | 0
            p = (i + 40) | 0
            q = (i + 128) | 0
            r = i
            s = (i + 232) | 0
            t = (i + 220) | 0
            v = (i + 216) | 0
            w = (i + 212) | 0
            x = (i + 208) | 0
            y = (i + 152) | 0
            z = f[(a + 28) >> 2] | 0
            A = f[(a + 32) >> 2] | 0
            B = l
            C = (B + 48) | 0
            do {
                f[B >> 2] = 0
                B = (B + 4) | 0
            } while ((B | 0) < (C | 0))
            if (!g) {
                D = 0
                E = 0
            } else {
                oi(l, g)
                D = f[(l + 12) >> 2] | 0
                E = f[(l + 16) >> 2] | 0
            }
            B = (l + 16) | 0
            C = (E - D) >> 2
            F = D
            D = E
            if (C >>> 0 >= g >>> 0) {
                if (C >>> 0 > g >>> 0 ? ((E = (F + (g << 2)) | 0), (E | 0) != (D | 0)) : 0) f[B >> 2] = D + (~(((D + -4 - E) | 0) >>> 2) << 2)
            } else oi((l + 12) | 0, (g - C) | 0)
            C = (l + 24) | 0
            E = (l + 28) | 0
            D = f[E >> 2] | 0
            B = f[C >> 2] | 0
            F = (D - B) >> 2
            G = B
            B = D
            if (F >>> 0 >= g >>> 0) {
                if (F >>> 0 > g >>> 0 ? ((D = (G + (g << 2)) | 0), (D | 0) != (B | 0)) : 0) f[E >> 2] = B + (~(((B + -4 - D) | 0) >>> 2) << 2)
            } else oi(C, (g - F) | 0)
            F = (l + 36) | 0
            C = (l + 40) | 0
            D = f[C >> 2] | 0
            B = f[F >> 2] | 0
            E = (D - B) >> 2
            G = B
            B = D
            if (E >>> 0 >= g >>> 0) {
                if (E >>> 0 > g >>> 0 ? ((D = (G + (g << 2)) | 0), (D | 0) != (B | 0)) : 0) f[C >> 2] = B + (~(((B + -4 - D) | 0) >>> 2) << 2)
            } else oi(F, (g - E) | 0)
            f[m >> 2] = 0
            E = (m + 4) | 0
            f[E >> 2] = 0
            f[(m + 8) >> 2] = 0
            F = (g | 0) == 0
            do
                if (!F)
                    if (g >>> 0 > 1073741823) mq(m)
                    else {
                        D = g << 2
                        B = dn(D) | 0
                        f[m >> 2] = B
                        C = (B + (g << 2)) | 0
                        f[(m + 8) >> 2] = C
                        hj(B | 0, 0, D | 0) | 0
                        f[E >> 2] = C
                        break
                    }
            while (0)
            C = (a + 136) | 0
            D = (a + 140) | 0
            B = f[D >> 2] | 0
            G = f[C >> 2] | 0
            H = (B - G) >> 2
            L = G
            G = B
            if (H >>> 0 >= g >>> 0) {
                if (H >>> 0 > g >>> 0 ? ((B = (L + (g << 2)) | 0), (B | 0) != (G | 0)) : 0) f[D >> 2] = G + (~(((G + -4 - B) | 0) >>> 2) << 2)
            } else oi(C, (g - H) | 0)
            f[o >> 2] = 0
            f[(o + 4) >> 2] = 0
            f[(o + 8) >> 2] = 0
            f[(o + 12) >> 2] = 0
            f[(o + 16) >> 2] = 0
            f[(o + 20) >> 2] = 0
            f[(o + 24) >> 2] = 0
            f[(o + 28) >> 2] = 0
            f[p >> 2] = 0
            f[(p + 4) >> 2] = 0
            f[(p + 8) >> 2] = 0
            f[(p + 12) >> 2] = 0
            f[(p + 16) >> 2] = 0
            f[(p + 20) >> 2] = 0
            f[(p + 24) >> 2] = 0
            f[(p + 28) >> 2] = 0
            f[q >> 2] = 0
            H = (q + 4) | 0
            f[H >> 2] = 0
            f[(q + 8) >> 2] = 0
            if (F) {
                M = 0
                N = 0
                O = 0
                P = 0
            } else {
                F = g << 2
                B = dn(F) | 0
                f[q >> 2] = B
                G = (B + (g << 2)) | 0
                f[(q + 8) >> 2] = G
                hj(B | 0, 0, F | 0) | 0
                f[H >> 2] = G
                M = B
                N = G
                O = G
                P = B
            }
            B = (a + 36) | 0
            G = f[B >> 2] | 0
            F = f[(G + 4) >> 2] | 0
            D = f[G >> 2] | 0
            L = (F - D) | 0
            a: do
                if ((L | 0) > 4) {
                    Q = L >>> 2
                    R = (z + 64) | 0
                    S = (z + 28) | 0
                    T = (g | 0) > 0
                    U = (r + 4) | 0
                    V = (r + 8) | 0
                    Z = (r + 12) | 0
                    _ = (a + 136) | 0
                    $ = (a + 96) | 0
                    aa = (r + 16) | 0
                    ba = (r + 28) | 0
                    ca = (a + 8) | 0
                    da = (j + 4) | 0
                    ea = (k + 4) | 0
                    fa = (e + 4) | 0
                    ga = (r + 28) | 0
                    ha = (r + 16) | 0
                    ia = (r + 20) | 0
                    ja = (r + 32) | 0
                    ka = (n + 1) | 0
                    la = g << 2
                    ma = (g | 0) == 1
                    na = (Q + -1) | 0
                    if (((F - D) >> 2) >>> 0 > na >>> 0) {
                        oa = Q
                        pa = na
                        qa = D
                        ra = M
                        sa = P
                        ta = O
                        ua = M
                        va = N
                        wa = M
                        xa = N
                    } else {
                        ya = G
                        mq(ya)
                    }
                    b: while (1) {
                        na = f[(qa + (pa << 2)) >> 2] | 0
                        Q = ((((na >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + na) | 0
                        za = Q >>> 5
                        Aa = 1 << (Q & 31)
                        Ba = ((na | 0) == -1) | ((Q | 0) == -1)
                        Ca = 1
                        Da = 0
                        Ea = na
                        c: while (1) {
                            Fa = Ca ^ 1
                            Ga = Da
                            Ha = Ea
                            while (1) {
                                if ((Ha | 0) == -1) {
                                    Ia = Ga
                                    break c
                                }
                                Ja = f[(l + ((Ga * 12) | 0)) >> 2] | 0
                                if (
                                    (
                                        ((f[((f[z >> 2] | 0) + ((Ha >>> 5) << 2)) >> 2] & (1 << (Ha & 31))) | 0) == 0
                                            ? ((Ka = f[((f[((f[R >> 2] | 0) + 12) >> 2] | 0) + (Ha << 2)) >> 2] | 0), (Ka | 0) != -1)
                                            : 0
                                    )
                                        ? ((La = f[S >> 2] | 0),
                                          (Ma = f[A >> 2] | 0),
                                          (Na = f[(Ma + (f[(La + (Ka << 2)) >> 2] << 2)) >> 2] | 0),
                                          (Oa = (Ka + 1) | 0),
                                          (Pa = f[(Ma + (f[(La + ((((Oa >>> 0) % 3 | 0 | 0) == 0 ? (Ka + -2) | 0 : Oa) << 2)) >> 2] << 2)) >> 2] | 0),
                                          (Oa = f[(Ma + (f[(La + (((((Ka >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + Ka) << 2)) >> 2] << 2)) >> 2] | 0),
                                          ((Na | 0) < (pa | 0)) & ((Pa | 0) < (pa | 0)) & ((Oa | 0) < (pa | 0)))
                                        : 0
                                ) {
                                    Ka = X(Na, g) | 0
                                    Na = X(Pa, g) | 0
                                    Pa = X(Oa, g) | 0
                                    if (T) {
                                        Oa = 0
                                        do {
                                            f[(Ja + (Oa << 2)) >> 2] = (f[(c + ((Oa + Pa) << 2)) >> 2] | 0) + (f[(c + ((Oa + Na) << 2)) >> 2] | 0) - (f[(c + ((Oa + Ka) << 2)) >> 2] | 0)
                                            Oa = (Oa + 1) | 0
                                        } while ((Oa | 0) != (g | 0))
                                    }
                                    Oa = (Ga + 1) | 0
                                    if ((Oa | 0) == 4) {
                                        Ia = 4
                                        break c
                                    } else Qa = Oa
                                } else Qa = Ga
                                do
                                    if (Ca) {
                                        Oa = (Ha + 1) | 0
                                        Ka = ((Oa >>> 0) % 3 | 0 | 0) == 0 ? (Ha + -2) | 0 : Oa
                                        if (
                                            ((Ka | 0) != -1 ? ((f[((f[z >> 2] | 0) + ((Ka >>> 5) << 2)) >> 2] & (1 << (Ka & 31))) | 0) == 0 : 0)
                                                ? ((Oa = f[((f[((f[R >> 2] | 0) + 12) >> 2] | 0) + (Ka << 2)) >> 2] | 0), (Ka = (Oa + 1) | 0), (Oa | 0) != -1)
                                                : 0
                                        )
                                            Ra = ((Ka >>> 0) % 3 | 0 | 0) == 0 ? (Oa + -2) | 0 : Ka
                                        else Ra = -1
                                    } else {
                                        Ka = ((((Ha >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + Ha) | 0
                                        if (
                                            ((Ka | 0) != -1 ? ((f[((f[z >> 2] | 0) + ((Ka >>> 5) << 2)) >> 2] & (1 << (Ka & 31))) | 0) == 0 : 0)
                                                ? ((Oa = f[((f[((f[R >> 2] | 0) + 12) >> 2] | 0) + (Ka << 2)) >> 2] | 0), (Oa | 0) != -1)
                                                : 0
                                        )
                                            if (!((Oa >>> 0) % 3 | 0)) {
                                                Ra = (Oa + 2) | 0
                                                break
                                            } else {
                                                Ra = (Oa + -1) | 0
                                                break
                                            }
                                        else Ra = -1
                                    }
                                while (0)
                                if ((Ra | 0) == (na | 0)) {
                                    Ia = Qa
                                    break c
                                }
                                if (((Ra | 0) != -1) | Fa) {
                                    Ga = Qa
                                    Ha = Ra
                                } else break
                            }
                            if (Ba) {
                                Ca = 0
                                Da = Qa
                                Ea = -1
                                continue
                            }
                            if ((f[((f[z >> 2] | 0) + (za << 2)) >> 2] & Aa) | 0) {
                                Ca = 0
                                Da = Qa
                                Ea = -1
                                continue
                            }
                            Ha = f[((f[((f[R >> 2] | 0) + 12) >> 2] | 0) + (Q << 2)) >> 2] | 0
                            if ((Ha | 0) == -1) {
                                Ca = 0
                                Da = Qa
                                Ea = -1
                                continue
                            }
                            if (!((Ha >>> 0) % 3 | 0)) {
                                Ca = 0
                                Da = Qa
                                Ea = (Ha + 2) | 0
                                continue
                            } else {
                                Ca = 0
                                Da = Qa
                                Ea = (Ha + -1) | 0
                                continue
                            }
                        }
                        Ea = X(pa, g) | 0
                        f[r >> 2] = 0
                        f[U >> 2] = 0
                        b[V >> 0] = 0
                        f[Z >> 2] = 0
                        f[(Z + 4) >> 2] = 0
                        f[(Z + 8) >> 2] = 0
                        f[(Z + 12) >> 2] = 0
                        f[(Z + 16) >> 2] = 0
                        f[(Z + 20) >> 2] = 0
                        f[(Z + 24) >> 2] = 0
                        Da = (c + ((X((oa + -2) | 0, g) | 0) << 2)) | 0
                        Ca = (c + (Ea << 2)) | 0
                        Q = f[_ >> 2] | 0
                        if (T) {
                            Aa = 0
                            za = 0
                            while (1) {
                                Ba = ((f[(Da + (Aa << 2)) >> 2] | 0) - (f[(Ca + (Aa << 2)) >> 2] | 0)) | 0
                                na = (((Ba | 0) > -1 ? Ba : (0 - Ba) | 0) + za) | 0
                                f[(ra + (Aa << 2)) >> 2] = Ba
                                f[(Q + (Aa << 2)) >> 2] = (Ba << 1) ^ (Ba >> 31)
                                Aa = (Aa + 1) | 0
                                if ((Aa | 0) == (g | 0)) {
                                    Sa = na
                                    break
                                } else za = na
                            }
                        } else Sa = 0
                        ho(e, $, Q, g)
                        za = Tk(e) | 0
                        Aa = I
                        na = om(e) | 0
                        Ba = Tn(na | 0, I | 0, za | 0, Aa | 0) | 0
                        Aa = I
                        za = (Ia | 0) > 0
                        if (za) {
                            na = (Ia + -1) | 0
                            Ha = (p + (na << 3)) | 0
                            Ga = Ha
                            Fa = Tn(f[Ga >> 2] | 0, f[(Ga + 4) >> 2] | 0, Ia | 0, ((((Ia | 0) < 0) << 31) >> 31) | 0) | 0
                            Ga = I
                            Oa = Ha
                            f[Oa >> 2] = Fa
                            f[(Oa + 4) >> 2] = Ga
                            Ta = +W(+(+jm(Fa, f[(o + (na << 3)) >> 2] | 0) * (+(Fa >>> 0) + 4294967296.0 * +(Ga | 0))))
                            Ga =
                                Tn(
                                    Ba | 0,
                                    Aa | 0,
                                    (~~Ta >>> 0) | 0,
                                    (+K(Ta) >= 1.0 ? (Ta > 0.0 ? ~~+Y(+J(Ta / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((Ta - +(~~Ta >>> 0)) / 4294967296.0) >>> 0) : 0) | 0
                                ) | 0
                            Ua = Ga
                        } else Ua = Ba
                        Ba = r
                        f[Ba >> 2] = Ua
                        f[(Ba + 4) >> 2] = Sa
                        b[V >> 0] = 0
                        f[Z >> 2] = 0
                        Mf(aa, Da, (Da + (g << 2)) | 0)
                        f[s >> 2] = sa
                        f[t >> 2] = ta
                        f[j >> 2] = f[s >> 2]
                        f[e >> 2] = f[t >> 2]
                        tf(ba, j, e)
                        if ((Ia | 0) < 1) {
                            Va = xa
                            Wa = wa
                            Xa = va
                            Ya = ua
                            Za = ta
                            _a = sa
                            $a = sa
                        } else {
                            Ba = (n + Ia) | 0
                            Ga = f[q >> 2] | 0
                            Aa = (Ia + -1) | 0
                            Fa = (o + (Aa << 3)) | 0
                            na = (p + (Aa << 3)) | 0
                            Aa = Ga
                            Oa = f[H >> 2] | 0
                            Ha = (Ba + -1) | 0
                            Ka = (Ha | 0) == (n | 0)
                            Na = (Ba + -2) | 0
                            Pa = ka >>> 0 < Na >>> 0
                            Ja = ~Ia
                            La = (Ia + 2 + ((Ja | 0) > -2 ? Ja : -2)) | 0
                            Ja = Oa
                            Ma = Ha >>> 0 > n >>> 0
                            ab = 0
                            bb = 1
                            while (1) {
                                ab = (ab + 1) | 0
                                hj(n | 0, 1, La | 0) | 0
                                hj(n | 0, 0, ab | 0) | 0
                                d: while (1) {
                                    if (T) {
                                        hj(f[m >> 2] | 0, 0, la | 0) | 0
                                        cb = f[m >> 2] | 0
                                        db = 0
                                        eb = 0
                                        while (1) {
                                            if (!(b[(n + db) >> 0] | 0)) {
                                                fb = f[(l + ((db * 12) | 0)) >> 2] | 0
                                                gb = 0
                                                do {
                                                    hb = (cb + (gb << 2)) | 0
                                                    f[hb >> 2] = (f[hb >> 2] | 0) + (f[(fb + (gb << 2)) >> 2] | 0)
                                                    gb = (gb + 1) | 0
                                                } while ((gb | 0) != (g | 0))
                                                ib = ((1 << db) | (eb & 255)) & 255
                                            } else ib = eb
                                            db = (db + 1) | 0
                                            if ((db | 0) == (Ia | 0)) {
                                                jb = ib
                                                break
                                            } else eb = ib
                                        }
                                    } else {
                                        eb = 0
                                        db = 0
                                        while (1) {
                                            if (!(b[(n + eb) >> 0] | 0)) kb = ((1 << eb) | (db & 255)) & 255
                                            else kb = db
                                            eb = (eb + 1) | 0
                                            if ((eb | 0) == (Ia | 0)) {
                                                jb = kb
                                                break
                                            } else db = kb
                                        }
                                    }
                                    db = f[m >> 2] | 0
                                    do
                                        if (T) {
                                            f[db >> 2] = ((f[db >> 2] | 0) / (bb | 0)) | 0
                                            if (!ma) {
                                                eb = 1
                                                do {
                                                    cb = (db + (eb << 2)) | 0
                                                    f[cb >> 2] = ((f[cb >> 2] | 0) / (bb | 0)) | 0
                                                    eb = (eb + 1) | 0
                                                } while ((eb | 0) != (g | 0))
                                                eb = f[_ >> 2] | 0
                                                if (T) lb = eb
                                                else {
                                                    mb = 0
                                                    nb = eb
                                                    break
                                                }
                                            } else lb = f[_ >> 2] | 0
                                            eb = 0
                                            cb = 0
                                            while (1) {
                                                gb = ((f[(db + (eb << 2)) >> 2] | 0) - (f[(Ca + (eb << 2)) >> 2] | 0)) | 0
                                                fb = (((gb | 0) > -1 ? gb : (0 - gb) | 0) + cb) | 0
                                                f[(Ga + (eb << 2)) >> 2] = gb
                                                f[(lb + (eb << 2)) >> 2] = (gb << 1) ^ (gb >> 31)
                                                eb = (eb + 1) | 0
                                                if ((eb | 0) == (g | 0)) {
                                                    mb = fb
                                                    nb = lb
                                                    break
                                                } else cb = fb
                                            }
                                        } else {
                                            mb = 0
                                            nb = f[_ >> 2] | 0
                                        }
                                    while (0)
                                    ho(e, $, nb, g)
                                    db = Tk(e) | 0
                                    cb = I
                                    eb = om(e) | 0
                                    fb = Tn(eb | 0, I | 0, db | 0, cb | 0) | 0
                                    cb = I
                                    if (za) {
                                        db = Fa
                                        eb = Tn(f[db >> 2] | 0, f[(db + 4) >> 2] | 0, bb | 0, 0) | 0
                                        db = na
                                        gb = f[db >> 2] | 0
                                        hb = f[(db + 4) >> 2] | 0
                                        Ta = +W(+(+jm(gb, eb) * (+(gb >>> 0) + 4294967296.0 * +(hb | 0))))
                                        hb =
                                            Tn(
                                                fb | 0,
                                                cb | 0,
                                                (~~Ta >>> 0) | 0,
                                                (+K(Ta) >= 1.0 ? (Ta > 0.0 ? ~~+Y(+J(Ta / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((Ta - +(~~Ta >>> 0)) / 4294967296.0) >>> 0) : 0) | 0
                                            ) | 0
                                        ob = hb
                                    } else ob = fb
                                    fb = f[r >> 2] | 0
                                    if (!((ob | 0) >= (fb | 0) ? !((ob | 0) <= (fb | 0) ? (mb | 0) < (f[U >> 2] | 0) : 0) : 0)) {
                                        fb = r
                                        f[fb >> 2] = ob
                                        f[(fb + 4) >> 2] = mb
                                        b[V >> 0] = jb
                                        f[Z >> 2] = bb
                                        f[v >> 2] = f[m >> 2]
                                        f[w >> 2] = f[E >> 2]
                                        f[j >> 2] = f[v >> 2]
                                        f[e >> 2] = f[w >> 2]
                                        tf(aa, j, e)
                                        f[x >> 2] = Aa
                                        f[y >> 2] = Oa
                                        f[j >> 2] = f[x >> 2]
                                        f[e >> 2] = f[y >> 2]
                                        tf(ba, j, e)
                                    }
                                    if (Ka) break
                                    pb = b[Ha >> 0] | 0
                                    fb = -1
                                    hb = pb
                                    while (1) {
                                        cb = (fb + -1) | 0
                                        qb = (Ba + cb) | 0
                                        gb = hb
                                        hb = b[qb >> 0] | 0
                                        if ((hb & 255) < (gb & 255)) break
                                        if ((qb | 0) == (n | 0)) {
                                            rb = 86
                                            break d
                                        } else fb = cb
                                    }
                                    cb = (Ba + fb) | 0
                                    if ((hb & 255) < (pb & 255)) {
                                        sb = Ha
                                        tb = pb
                                    } else {
                                        gb = Ba
                                        eb = Ha
                                        while (1) {
                                            db = (eb + -1) | 0
                                            if ((hb & 255) < (h[(gb + -2) >> 0] | 0)) {
                                                sb = db
                                                tb = 1
                                                break
                                            } else {
                                                ub = eb
                                                eb = db
                                                gb = ub
                                            }
                                        }
                                    }
                                    b[qb >> 0] = tb
                                    b[sb >> 0] = hb
                                    if ((fb | 0) < -1) {
                                        vb = cb
                                        wb = Ha
                                    } else continue
                                    while (1) {
                                        gb = b[vb >> 0] | 0
                                        b[vb >> 0] = b[wb >> 0] | 0
                                        b[wb >> 0] = gb
                                        gb = (vb + 1) | 0
                                        eb = (wb + -1) | 0
                                        if (gb >>> 0 < eb >>> 0) {
                                            vb = gb
                                            wb = eb
                                        } else continue d
                                    }
                                }
                                if (((rb | 0) == 86 ? ((rb = 0), Ma) : 0) ? ((cb = b[n >> 0] | 0), (b[n >> 0] = pb), (b[Ha >> 0] = cb), Pa) : 0) {
                                    cb = Na
                                    fb = ka
                                    do {
                                        hb = b[fb >> 0] | 0
                                        b[fb >> 0] = b[cb >> 0] | 0
                                        b[cb >> 0] = hb
                                        fb = (fb + 1) | 0
                                        cb = (cb + -1) | 0
                                    } while (fb >>> 0 < cb >>> 0)
                                }
                                if ((bb | 0) >= (Ia | 0)) {
                                    Va = Ja
                                    Wa = Ga
                                    Xa = Ja
                                    Ya = Ga
                                    Za = Oa
                                    _a = Aa
                                    $a = Ga
                                    break
                                } else bb = (bb + 1) | 0
                            }
                        }
                        if (za) {
                            bb = f[Z >> 2] | 0
                            Ga = (o + ((Ia + -1) << 3)) | 0
                            Aa = Ga
                            Oa = Tn(f[Aa >> 2] | 0, f[(Aa + 4) >> 2] | 0, bb | 0, ((((bb | 0) < 0) << 31) >> 31) | 0) | 0
                            bb = Ga
                            f[bb >> 2] = Oa
                            f[(bb + 4) >> 2] = I
                        }
                        if (T) {
                            bb = f[ba >> 2] | 0
                            Oa = f[C >> 2] | 0
                            Ga = 0
                            do {
                                Aa = f[(bb + (Ga << 2)) >> 2] | 0
                                f[(Oa + (Ga << 2)) >> 2] = (Aa << 1) ^ (Aa >> 31)
                                Ga = (Ga + 1) | 0
                            } while ((Ga | 0) != (g | 0))
                            xb = Oa
                        } else xb = f[C >> 2] | 0
                        go(e, $, xb, g)
                        if (za) {
                            Oa = (Ia + -1) | 0
                            yb = (a + 40 + ((Oa * 12) | 0)) | 0
                            Ga = (a + 40 + ((Oa * 12) | 0) + 4) | 0
                            bb = (a + 40 + ((Oa * 12) | 0) + 8) | 0
                            Oa = 0
                            do {
                                Aa = f[Ga >> 2] | 0
                                Ja = f[bb >> 2] | 0
                                Na = (Aa | 0) == ((Ja << 5) | 0)
                                if (!((1 << Oa) & h[V >> 0])) {
                                    if (Na) {
                                        if (((Aa + 1) | 0) < 0) {
                                            rb = 101
                                            break b
                                        }
                                        Pa = Ja << 6
                                        Ha = (Aa + 32) & -32
                                        hi(yb, Aa >>> 0 < 1073741823 ? (Pa >>> 0 < Ha >>> 0 ? Ha : Pa) : 2147483647)
                                        zb = f[Ga >> 2] | 0
                                    } else zb = Aa
                                    f[Ga >> 2] = zb + 1
                                    Pa = ((f[yb >> 2] | 0) + ((zb >>> 5) << 2)) | 0
                                    f[Pa >> 2] = f[Pa >> 2] | (1 << (zb & 31))
                                } else {
                                    if (Na) {
                                        if (((Aa + 1) | 0) < 0) {
                                            rb = 106
                                            break b
                                        }
                                        Na = Ja << 6
                                        Ja = (Aa + 32) & -32
                                        hi(yb, Aa >>> 0 < 1073741823 ? (Na >>> 0 < Ja >>> 0 ? Ja : Na) : 2147483647)
                                        Ab = f[Ga >> 2] | 0
                                    } else Ab = Aa
                                    f[Ga >> 2] = Ab + 1
                                    Aa = ((f[yb >> 2] | 0) + ((Ab >>> 5) << 2)) | 0
                                    f[Aa >> 2] = f[Aa >> 2] & ~(1 << (Ab & 31))
                                }
                                Oa = (Oa + 1) | 0
                            } while ((Oa | 0) < (Ia | 0))
                        }
                        Oa = f[aa >> 2] | 0
                        Ga = (d + (Ea << 2)) | 0
                        bb = f[(Ca + 4) >> 2] | 0
                        za = f[Oa >> 2] | 0
                        Aa = f[(Oa + 4) >> 2] | 0
                        f[j >> 2] = f[Ca >> 2]
                        f[da >> 2] = bb
                        f[k >> 2] = za
                        f[ea >> 2] = Aa
                        Dd(e, ca, j, k)
                        f[Ga >> 2] = f[e >> 2]
                        f[(Ga + 4) >> 2] = f[fa >> 2]
                        Ga = f[ga >> 2] | 0
                        if (Ga | 0) {
                            Aa = f[ja >> 2] | 0
                            if ((Aa | 0) != (Ga | 0)) f[ja >> 2] = Aa + (~(((Aa + -4 - Ga) | 0) >>> 2) << 2)
                            br(Ga)
                        }
                        Ga = f[ha >> 2] | 0
                        if (Ga | 0) {
                            Aa = f[ia >> 2] | 0
                            if ((Aa | 0) != (Ga | 0)) f[ia >> 2] = Aa + (~(((Aa + -4 - Ga) | 0) >>> 2) << 2)
                            br(Ga)
                        }
                        if ((oa | 0) <= 2) {
                            Bb = Ya
                            Cb = Xa
                            break a
                        }
                        Ga = f[B >> 2] | 0
                        qa = f[Ga >> 2] | 0
                        Aa = (pa + -1) | 0
                        if ((((f[(Ga + 4) >> 2] | 0) - qa) >> 2) >>> 0 <= Aa >>> 0) {
                            ya = Ga
                            rb = 18
                            break
                        } else {
                            Ga = pa
                            pa = Aa
                            ra = $a
                            sa = _a
                            ta = Za
                            ua = Ya
                            va = Xa
                            wa = Wa
                            xa = Va
                            oa = Ga
                        }
                    }
                    if ((rb | 0) == 18) mq(ya)
                    else if ((rb | 0) == 101) mq(yb)
                    else if ((rb | 0) == 106) mq(yb)
                } else {
                    Bb = M
                    Cb = N
                }
            while (0)
            if ((g | 0) > 0) hj(f[l >> 2] | 0, 0, (g << 2) | 0) | 0
            g = f[l >> 2] | 0
            N = f[(c + 4) >> 2] | 0
            M = f[g >> 2] | 0
            yb = f[(g + 4) >> 2] | 0
            f[j >> 2] = f[c >> 2]
            f[(j + 4) >> 2] = N
            f[k >> 2] = M
            f[(k + 4) >> 2] = yb
            Dd(e, (a + 8) | 0, j, k)
            f[d >> 2] = f[e >> 2]
            f[(d + 4) >> 2] = f[(e + 4) >> 2]
            if (Bb | 0) {
                if ((Cb | 0) != (Bb | 0)) f[H >> 2] = Cb + (~(((Cb + -4 - Bb) | 0) >>> 2) << 2)
                br(Bb)
            }
            Bb = f[m >> 2] | 0
            if (Bb | 0) {
                m = f[E >> 2] | 0
                if ((m | 0) != (Bb | 0)) f[E >> 2] = m + (~(((m + -4 - Bb) | 0) >>> 2) << 2)
                br(Bb)
            }
            Bb = f[(l + 36) >> 2] | 0
            if (Bb | 0) {
                m = (l + 40) | 0
                E = f[m >> 2] | 0
                if ((E | 0) != (Bb | 0)) f[m >> 2] = E + (~(((E + -4 - Bb) | 0) >>> 2) << 2)
                br(Bb)
            }
            Bb = f[(l + 24) >> 2] | 0
            if (Bb | 0) {
                E = (l + 28) | 0
                m = f[E >> 2] | 0
                if ((m | 0) != (Bb | 0)) f[E >> 2] = m + (~(((m + -4 - Bb) | 0) >>> 2) << 2)
                br(Bb)
            }
            Bb = f[(l + 12) >> 2] | 0
            if (Bb | 0) {
                m = (l + 16) | 0
                E = f[m >> 2] | 0
                if ((E | 0) != (Bb | 0)) f[m >> 2] = E + (~(((E + -4 - Bb) | 0) >>> 2) << 2)
                br(Bb)
            }
            Bb = f[l >> 2] | 0
            if (!Bb) {
                u = i
                return 1
            }
            E = (l + 4) | 0
            l = f[E >> 2] | 0
            if ((l | 0) != (Bb | 0)) f[E >> 2] = l + (~(((l + -4 - Bb) | 0) >>> 2) << 2)
            br(Bb)
            u = i
            return 1
        }
        function eb(a, c, d, e, g, i) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                L = 0,
                M = 0,
                N = 0,
                O = 0,
                P = 0,
                Q = 0,
                R = 0,
                S = 0,
                T = 0,
                U = 0,
                V = 0,
                Z = 0,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0,
                xa = 0,
                ya = 0,
                za = 0,
                Aa = 0,
                Ba = 0,
                Ca = 0,
                Da = 0,
                Ea = 0,
                Fa = 0,
                Ga = 0,
                Ha = 0,
                Ia = 0,
                Ja = 0,
                Ka = 0,
                La = 0,
                Ma = 0,
                Na = 0,
                Oa = 0,
                Pa = 0,
                Qa = 0,
                Ra = 0,
                Sa = 0,
                Ta = 0.0,
                Ua = 0,
                Va = 0,
                Wa = 0,
                Xa = 0,
                Ya = 0,
                Za = 0,
                _a = 0,
                $a = 0,
                ab = 0,
                bb = 0,
                cb = 0,
                db = 0,
                eb = 0,
                fb = 0,
                gb = 0,
                hb = 0,
                ib = 0,
                jb = 0,
                kb = 0,
                lb = 0,
                mb = 0,
                nb = 0,
                ob = 0,
                pb = 0,
                qb = 0,
                rb = 0,
                sb = 0,
                tb = 0,
                ub = 0,
                vb = 0,
                wb = 0,
                xb = 0,
                yb = 0,
                zb = 0,
                Ab = 0,
                Bb = 0,
                Cb = 0,
                Db = 0,
                Eb = 0
            i = u
            u = (u + 256) | 0
            e = (i + 104) | 0
            j = (i + 240) | 0
            k = (i + 224) | 0
            l = (i + 160) | 0
            m = (i + 140) | 0
            n = (i + 248) | 0
            o = (i + 72) | 0
            p = (i + 40) | 0
            q = (i + 128) | 0
            r = i
            s = (i + 232) | 0
            t = (i + 220) | 0
            v = (i + 216) | 0
            w = (i + 212) | 0
            x = (i + 208) | 0
            y = (i + 152) | 0
            z = f[(a + 28) >> 2] | 0
            A = f[(a + 32) >> 2] | 0
            B = l
            C = (B + 48) | 0
            do {
                f[B >> 2] = 0
                B = (B + 4) | 0
            } while ((B | 0) < (C | 0))
            if (!g) {
                D = 0
                E = 0
            } else {
                oi(l, g)
                D = f[(l + 12) >> 2] | 0
                E = f[(l + 16) >> 2] | 0
            }
            B = (l + 16) | 0
            C = (E - D) >> 2
            F = D
            D = E
            if (C >>> 0 >= g >>> 0) {
                if (C >>> 0 > g >>> 0 ? ((E = (F + (g << 2)) | 0), (E | 0) != (D | 0)) : 0) f[B >> 2] = D + (~(((D + -4 - E) | 0) >>> 2) << 2)
            } else oi((l + 12) | 0, (g - C) | 0)
            C = (l + 24) | 0
            E = (l + 28) | 0
            D = f[E >> 2] | 0
            B = f[C >> 2] | 0
            F = (D - B) >> 2
            G = B
            B = D
            if (F >>> 0 >= g >>> 0) {
                if (F >>> 0 > g >>> 0 ? ((D = (G + (g << 2)) | 0), (D | 0) != (B | 0)) : 0) f[E >> 2] = B + (~(((B + -4 - D) | 0) >>> 2) << 2)
            } else oi(C, (g - F) | 0)
            F = (l + 36) | 0
            C = (l + 40) | 0
            D = f[C >> 2] | 0
            B = f[F >> 2] | 0
            E = (D - B) >> 2
            G = B
            B = D
            if (E >>> 0 >= g >>> 0) {
                if (E >>> 0 > g >>> 0 ? ((D = (G + (g << 2)) | 0), (D | 0) != (B | 0)) : 0) f[C >> 2] = B + (~(((B + -4 - D) | 0) >>> 2) << 2)
            } else oi(F, (g - E) | 0)
            f[m >> 2] = 0
            E = (m + 4) | 0
            f[E >> 2] = 0
            f[(m + 8) >> 2] = 0
            F = (g | 0) == 0
            do
                if (!F)
                    if (g >>> 0 > 1073741823) mq(m)
                    else {
                        D = g << 2
                        B = dn(D) | 0
                        f[m >> 2] = B
                        C = (B + (g << 2)) | 0
                        f[(m + 8) >> 2] = C
                        hj(B | 0, 0, D | 0) | 0
                        f[E >> 2] = C
                        break
                    }
            while (0)
            C = (a + 136) | 0
            D = (a + 140) | 0
            B = f[D >> 2] | 0
            G = f[C >> 2] | 0
            H = (B - G) >> 2
            L = G
            G = B
            if (H >>> 0 >= g >>> 0) {
                if (H >>> 0 > g >>> 0 ? ((B = (L + (g << 2)) | 0), (B | 0) != (G | 0)) : 0) f[D >> 2] = G + (~(((G + -4 - B) | 0) >>> 2) << 2)
            } else oi(C, (g - H) | 0)
            f[o >> 2] = 0
            f[(o + 4) >> 2] = 0
            f[(o + 8) >> 2] = 0
            f[(o + 12) >> 2] = 0
            f[(o + 16) >> 2] = 0
            f[(o + 20) >> 2] = 0
            f[(o + 24) >> 2] = 0
            f[(o + 28) >> 2] = 0
            f[p >> 2] = 0
            f[(p + 4) >> 2] = 0
            f[(p + 8) >> 2] = 0
            f[(p + 12) >> 2] = 0
            f[(p + 16) >> 2] = 0
            f[(p + 20) >> 2] = 0
            f[(p + 24) >> 2] = 0
            f[(p + 28) >> 2] = 0
            f[q >> 2] = 0
            H = (q + 4) | 0
            f[H >> 2] = 0
            f[(q + 8) >> 2] = 0
            if (F) {
                M = 0
                N = 0
                O = 0
                P = 0
            } else {
                F = g << 2
                B = dn(F) | 0
                f[q >> 2] = B
                G = (B + (g << 2)) | 0
                f[(q + 8) >> 2] = G
                hj(B | 0, 0, F | 0) | 0
                f[H >> 2] = G
                M = B
                N = G
                O = G
                P = B
            }
            B = (a + 36) | 0
            G = f[B >> 2] | 0
            F = f[(G + 4) >> 2] | 0
            D = f[G >> 2] | 0
            L = (F - D) | 0
            a: do
                if ((L | 0) > 4) {
                    Q = L >>> 2
                    R = (z + 12) | 0
                    S = (g | 0) > 0
                    T = (r + 4) | 0
                    U = (r + 8) | 0
                    V = (r + 12) | 0
                    Z = (a + 136) | 0
                    _ = (a + 96) | 0
                    $ = (r + 16) | 0
                    aa = (r + 28) | 0
                    ba = (a + 8) | 0
                    ca = (j + 4) | 0
                    da = (k + 4) | 0
                    ea = (e + 4) | 0
                    fa = (r + 28) | 0
                    ga = (r + 16) | 0
                    ha = (r + 20) | 0
                    ia = (r + 32) | 0
                    ja = (n + 1) | 0
                    ka = g << 2
                    la = (g | 0) == 1
                    ma = (Q + -1) | 0
                    if (((F - D) >> 2) >>> 0 > ma >>> 0) {
                        na = Q
                        oa = ma
                        pa = M
                        qa = P
                        ra = O
                        sa = M
                        ta = N
                        ua = M
                        va = N
                        wa = D
                    } else {
                        xa = G
                        mq(xa)
                    }
                    b: while (1) {
                        ma = f[(wa + (oa << 2)) >> 2] | 0
                        Q = ((((ma >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + ma) | 0
                        ya = ((ma | 0) == -1) | ((Q | 0) == -1)
                        za = 1
                        Aa = 0
                        Ba = ma
                        c: while (1) {
                            Ca = za ^ 1
                            Da = Aa
                            Ea = Ba
                            while (1) {
                                if ((Ea | 0) == -1) {
                                    Fa = Da
                                    break c
                                }
                                Ga = f[(l + ((Da * 12) | 0)) >> 2] | 0
                                Ha = f[R >> 2] | 0
                                Ia = f[(Ha + (Ea << 2)) >> 2] | 0
                                if ((Ia | 0) != -1) {
                                    Ja = f[z >> 2] | 0
                                    Ka = f[A >> 2] | 0
                                    La = f[(Ka + (f[(Ja + (Ia << 2)) >> 2] << 2)) >> 2] | 0
                                    Ma = (Ia + 1) | 0
                                    Na = ((Ma >>> 0) % 3 | 0 | 0) == 0 ? (Ia + -2) | 0 : Ma
                                    if ((Na | 0) == -1) Oa = -1
                                    else Oa = f[(Ja + (Na << 2)) >> 2] | 0
                                    Na = f[(Ka + (Oa << 2)) >> 2] | 0
                                    Ma = ((((Ia >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + Ia) | 0
                                    if ((Ma | 0) == -1) Pa = -1
                                    else Pa = f[(Ja + (Ma << 2)) >> 2] | 0
                                    Ma = f[(Ka + (Pa << 2)) >> 2] | 0
                                    if (((La | 0) < (oa | 0)) & ((Na | 0) < (oa | 0)) & ((Ma | 0) < (oa | 0))) {
                                        Ka = X(La, g) | 0
                                        La = X(Na, g) | 0
                                        Na = X(Ma, g) | 0
                                        if (S) {
                                            Ma = 0
                                            do {
                                                f[(Ga + (Ma << 2)) >> 2] = (f[(c + ((Ma + Na) << 2)) >> 2] | 0) + (f[(c + ((Ma + La) << 2)) >> 2] | 0) - (f[(c + ((Ma + Ka) << 2)) >> 2] | 0)
                                                Ma = (Ma + 1) | 0
                                            } while ((Ma | 0) != (g | 0))
                                        }
                                        Ma = (Da + 1) | 0
                                        if ((Ma | 0) == 4) {
                                            Fa = 4
                                            break c
                                        } else Qa = Ma
                                    } else Qa = Da
                                } else Qa = Da
                                do
                                    if (za) {
                                        Ma = (Ea + 1) | 0
                                        Ka = ((Ma >>> 0) % 3 | 0 | 0) == 0 ? (Ea + -2) | 0 : Ma
                                        if ((Ka | 0) != -1 ? ((Ma = f[(Ha + (Ka << 2)) >> 2] | 0), (Ka = (Ma + 1) | 0), (Ma | 0) != -1) : 0) Ra = ((Ka >>> 0) % 3 | 0 | 0) == 0 ? (Ma + -2) | 0 : Ka
                                        else Ra = -1
                                    } else {
                                        Ka = ((((Ea >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + Ea) | 0
                                        if ((Ka | 0) != -1 ? ((Ma = f[(Ha + (Ka << 2)) >> 2] | 0), (Ma | 0) != -1) : 0)
                                            if (!((Ma >>> 0) % 3 | 0)) {
                                                Ra = (Ma + 2) | 0
                                                break
                                            } else {
                                                Ra = (Ma + -1) | 0
                                                break
                                            }
                                        else Ra = -1
                                    }
                                while (0)
                                if ((Ra | 0) == (ma | 0)) {
                                    Fa = Qa
                                    break c
                                }
                                if (((Ra | 0) != -1) | Ca) {
                                    Da = Qa
                                    Ea = Ra
                                } else break
                            }
                            if (ya) {
                                za = 0
                                Aa = Qa
                                Ba = -1
                                continue
                            }
                            Ea = f[(Ha + (Q << 2)) >> 2] | 0
                            if ((Ea | 0) == -1) {
                                za = 0
                                Aa = Qa
                                Ba = -1
                                continue
                            }
                            if (!((Ea >>> 0) % 3 | 0)) {
                                za = 0
                                Aa = Qa
                                Ba = (Ea + 2) | 0
                                continue
                            } else {
                                za = 0
                                Aa = Qa
                                Ba = (Ea + -1) | 0
                                continue
                            }
                        }
                        Ba = X(oa, g) | 0
                        f[r >> 2] = 0
                        f[T >> 2] = 0
                        b[U >> 0] = 0
                        f[V >> 2] = 0
                        f[(V + 4) >> 2] = 0
                        f[(V + 8) >> 2] = 0
                        f[(V + 12) >> 2] = 0
                        f[(V + 16) >> 2] = 0
                        f[(V + 20) >> 2] = 0
                        f[(V + 24) >> 2] = 0
                        Aa = (c + ((X((na + -2) | 0, g) | 0) << 2)) | 0
                        za = (c + (Ba << 2)) | 0
                        Q = f[Z >> 2] | 0
                        if (S) {
                            ya = 0
                            ma = 0
                            while (1) {
                                Ea = ((f[(Aa + (ya << 2)) >> 2] | 0) - (f[(za + (ya << 2)) >> 2] | 0)) | 0
                                Da = (((Ea | 0) > -1 ? Ea : (0 - Ea) | 0) + ma) | 0
                                f[(pa + (ya << 2)) >> 2] = Ea
                                f[(Q + (ya << 2)) >> 2] = (Ea << 1) ^ (Ea >> 31)
                                ya = (ya + 1) | 0
                                if ((ya | 0) == (g | 0)) {
                                    Sa = Da
                                    break
                                } else ma = Da
                            }
                        } else Sa = 0
                        ho(e, _, Q, g)
                        ma = Tk(e) | 0
                        ya = I
                        Da = om(e) | 0
                        Ea = Tn(Da | 0, I | 0, ma | 0, ya | 0) | 0
                        ya = I
                        ma = (Fa | 0) > 0
                        if (ma) {
                            Da = (Fa + -1) | 0
                            Ca = (p + (Da << 3)) | 0
                            Ma = Ca
                            Ka = Tn(f[Ma >> 2] | 0, f[(Ma + 4) >> 2] | 0, Fa | 0, ((((Fa | 0) < 0) << 31) >> 31) | 0) | 0
                            Ma = I
                            La = Ca
                            f[La >> 2] = Ka
                            f[(La + 4) >> 2] = Ma
                            Ta = +W(+(+jm(Ka, f[(o + (Da << 3)) >> 2] | 0) * (+(Ka >>> 0) + 4294967296.0 * +(Ma | 0))))
                            Ma =
                                Tn(
                                    Ea | 0,
                                    ya | 0,
                                    (~~Ta >>> 0) | 0,
                                    (+K(Ta) >= 1.0 ? (Ta > 0.0 ? ~~+Y(+J(Ta / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((Ta - +(~~Ta >>> 0)) / 4294967296.0) >>> 0) : 0) | 0
                                ) | 0
                            Ua = Ma
                        } else Ua = Ea
                        Ea = r
                        f[Ea >> 2] = Ua
                        f[(Ea + 4) >> 2] = Sa
                        b[U >> 0] = 0
                        f[V >> 2] = 0
                        Mf($, Aa, (Aa + (g << 2)) | 0)
                        f[s >> 2] = qa
                        f[t >> 2] = ra
                        f[j >> 2] = f[s >> 2]
                        f[e >> 2] = f[t >> 2]
                        tf(aa, j, e)
                        if ((Fa | 0) < 1) {
                            Va = va
                            Wa = ua
                            Xa = ta
                            Ya = sa
                            Za = ra
                            _a = qa
                            $a = qa
                        } else {
                            Ea = (n + Fa) | 0
                            Ma = f[q >> 2] | 0
                            ya = (Fa + -1) | 0
                            Ka = (o + (ya << 3)) | 0
                            Da = (p + (ya << 3)) | 0
                            ya = Ma
                            La = f[H >> 2] | 0
                            Ca = (Ea + -1) | 0
                            Na = (Ca | 0) == (n | 0)
                            Ga = (Ea + -2) | 0
                            Ja = ja >>> 0 < Ga >>> 0
                            Ia = ~Fa
                            ab = (Fa + 2 + ((Ia | 0) > -2 ? Ia : -2)) | 0
                            Ia = La
                            bb = Ca >>> 0 > n >>> 0
                            cb = 0
                            db = 1
                            while (1) {
                                cb = (cb + 1) | 0
                                hj(n | 0, 1, ab | 0) | 0
                                hj(n | 0, 0, cb | 0) | 0
                                d: while (1) {
                                    if (S) {
                                        hj(f[m >> 2] | 0, 0, ka | 0) | 0
                                        eb = f[m >> 2] | 0
                                        fb = 0
                                        gb = 0
                                        while (1) {
                                            if (!(b[(n + fb) >> 0] | 0)) {
                                                hb = f[(l + ((fb * 12) | 0)) >> 2] | 0
                                                ib = 0
                                                do {
                                                    jb = (eb + (ib << 2)) | 0
                                                    f[jb >> 2] = (f[jb >> 2] | 0) + (f[(hb + (ib << 2)) >> 2] | 0)
                                                    ib = (ib + 1) | 0
                                                } while ((ib | 0) != (g | 0))
                                                kb = ((1 << fb) | (gb & 255)) & 255
                                            } else kb = gb
                                            fb = (fb + 1) | 0
                                            if ((fb | 0) == (Fa | 0)) {
                                                lb = kb
                                                break
                                            } else gb = kb
                                        }
                                    } else {
                                        gb = 0
                                        fb = 0
                                        while (1) {
                                            if (!(b[(n + gb) >> 0] | 0)) mb = ((1 << gb) | (fb & 255)) & 255
                                            else mb = fb
                                            gb = (gb + 1) | 0
                                            if ((gb | 0) == (Fa | 0)) {
                                                lb = mb
                                                break
                                            } else fb = mb
                                        }
                                    }
                                    fb = f[m >> 2] | 0
                                    do
                                        if (S) {
                                            f[fb >> 2] = ((f[fb >> 2] | 0) / (db | 0)) | 0
                                            if (!la) {
                                                gb = 1
                                                do {
                                                    eb = (fb + (gb << 2)) | 0
                                                    f[eb >> 2] = ((f[eb >> 2] | 0) / (db | 0)) | 0
                                                    gb = (gb + 1) | 0
                                                } while ((gb | 0) != (g | 0))
                                                gb = f[Z >> 2] | 0
                                                if (S) nb = gb
                                                else {
                                                    ob = 0
                                                    pb = gb
                                                    break
                                                }
                                            } else nb = f[Z >> 2] | 0
                                            gb = 0
                                            eb = 0
                                            while (1) {
                                                ib = ((f[(fb + (gb << 2)) >> 2] | 0) - (f[(za + (gb << 2)) >> 2] | 0)) | 0
                                                hb = (((ib | 0) > -1 ? ib : (0 - ib) | 0) + eb) | 0
                                                f[(Ma + (gb << 2)) >> 2] = ib
                                                f[(nb + (gb << 2)) >> 2] = (ib << 1) ^ (ib >> 31)
                                                gb = (gb + 1) | 0
                                                if ((gb | 0) == (g | 0)) {
                                                    ob = hb
                                                    pb = nb
                                                    break
                                                } else eb = hb
                                            }
                                        } else {
                                            ob = 0
                                            pb = f[Z >> 2] | 0
                                        }
                                    while (0)
                                    ho(e, _, pb, g)
                                    fb = Tk(e) | 0
                                    eb = I
                                    gb = om(e) | 0
                                    hb = Tn(gb | 0, I | 0, fb | 0, eb | 0) | 0
                                    eb = I
                                    if (ma) {
                                        fb = Ka
                                        gb = Tn(f[fb >> 2] | 0, f[(fb + 4) >> 2] | 0, db | 0, 0) | 0
                                        fb = Da
                                        ib = f[fb >> 2] | 0
                                        jb = f[(fb + 4) >> 2] | 0
                                        Ta = +W(+(+jm(ib, gb) * (+(ib >>> 0) + 4294967296.0 * +(jb | 0))))
                                        jb =
                                            Tn(
                                                hb | 0,
                                                eb | 0,
                                                (~~Ta >>> 0) | 0,
                                                (+K(Ta) >= 1.0 ? (Ta > 0.0 ? ~~+Y(+J(Ta / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((Ta - +(~~Ta >>> 0)) / 4294967296.0) >>> 0) : 0) | 0
                                            ) | 0
                                        qb = jb
                                    } else qb = hb
                                    hb = f[r >> 2] | 0
                                    if (!((qb | 0) >= (hb | 0) ? !((qb | 0) <= (hb | 0) ? (ob | 0) < (f[T >> 2] | 0) : 0) : 0)) {
                                        hb = r
                                        f[hb >> 2] = qb
                                        f[(hb + 4) >> 2] = ob
                                        b[U >> 0] = lb
                                        f[V >> 2] = db
                                        f[v >> 2] = f[m >> 2]
                                        f[w >> 2] = f[E >> 2]
                                        f[j >> 2] = f[v >> 2]
                                        f[e >> 2] = f[w >> 2]
                                        tf($, j, e)
                                        f[x >> 2] = ya
                                        f[y >> 2] = La
                                        f[j >> 2] = f[x >> 2]
                                        f[e >> 2] = f[y >> 2]
                                        tf(aa, j, e)
                                    }
                                    if (Na) break
                                    rb = b[Ca >> 0] | 0
                                    hb = -1
                                    jb = rb
                                    while (1) {
                                        eb = (hb + -1) | 0
                                        sb = (Ea + eb) | 0
                                        ib = jb
                                        jb = b[sb >> 0] | 0
                                        if ((jb & 255) < (ib & 255)) break
                                        if ((sb | 0) == (n | 0)) {
                                            tb = 86
                                            break d
                                        } else hb = eb
                                    }
                                    eb = (Ea + hb) | 0
                                    if ((jb & 255) < (rb & 255)) {
                                        ub = Ca
                                        vb = rb
                                    } else {
                                        ib = Ea
                                        gb = Ca
                                        while (1) {
                                            fb = (gb + -1) | 0
                                            if ((jb & 255) < (h[(ib + -2) >> 0] | 0)) {
                                                ub = fb
                                                vb = 1
                                                break
                                            } else {
                                                wb = gb
                                                gb = fb
                                                ib = wb
                                            }
                                        }
                                    }
                                    b[sb >> 0] = vb
                                    b[ub >> 0] = jb
                                    if ((hb | 0) < -1) {
                                        xb = eb
                                        yb = Ca
                                    } else continue
                                    while (1) {
                                        ib = b[xb >> 0] | 0
                                        b[xb >> 0] = b[yb >> 0] | 0
                                        b[yb >> 0] = ib
                                        ib = (xb + 1) | 0
                                        gb = (yb + -1) | 0
                                        if (ib >>> 0 < gb >>> 0) {
                                            xb = ib
                                            yb = gb
                                        } else continue d
                                    }
                                }
                                if (((tb | 0) == 86 ? ((tb = 0), bb) : 0) ? ((eb = b[n >> 0] | 0), (b[n >> 0] = rb), (b[Ca >> 0] = eb), Ja) : 0) {
                                    eb = Ga
                                    hb = ja
                                    do {
                                        jb = b[hb >> 0] | 0
                                        b[hb >> 0] = b[eb >> 0] | 0
                                        b[eb >> 0] = jb
                                        hb = (hb + 1) | 0
                                        eb = (eb + -1) | 0
                                    } while (hb >>> 0 < eb >>> 0)
                                }
                                if ((db | 0) >= (Fa | 0)) {
                                    Va = Ia
                                    Wa = Ma
                                    Xa = Ia
                                    Ya = Ma
                                    Za = La
                                    _a = ya
                                    $a = Ma
                                    break
                                } else db = (db + 1) | 0
                            }
                        }
                        if (ma) {
                            db = f[V >> 2] | 0
                            Ma = (o + ((Fa + -1) << 3)) | 0
                            ya = Ma
                            La = Tn(f[ya >> 2] | 0, f[(ya + 4) >> 2] | 0, db | 0, ((((db | 0) < 0) << 31) >> 31) | 0) | 0
                            db = Ma
                            f[db >> 2] = La
                            f[(db + 4) >> 2] = I
                        }
                        if (S) {
                            db = f[aa >> 2] | 0
                            La = f[C >> 2] | 0
                            Ma = 0
                            do {
                                ya = f[(db + (Ma << 2)) >> 2] | 0
                                f[(La + (Ma << 2)) >> 2] = (ya << 1) ^ (ya >> 31)
                                Ma = (Ma + 1) | 0
                            } while ((Ma | 0) != (g | 0))
                            zb = La
                        } else zb = f[C >> 2] | 0
                        go(e, _, zb, g)
                        if (ma) {
                            La = (Fa + -1) | 0
                            Ab = (a + 40 + ((La * 12) | 0)) | 0
                            Ma = (a + 40 + ((La * 12) | 0) + 4) | 0
                            db = (a + 40 + ((La * 12) | 0) + 8) | 0
                            La = 0
                            do {
                                ya = f[Ma >> 2] | 0
                                Ia = f[db >> 2] | 0
                                Ga = (ya | 0) == ((Ia << 5) | 0)
                                if (!((1 << La) & h[U >> 0])) {
                                    if (Ga) {
                                        if (((ya + 1) | 0) < 0) {
                                            tb = 101
                                            break b
                                        }
                                        Ja = Ia << 6
                                        Ca = (ya + 32) & -32
                                        hi(Ab, ya >>> 0 < 1073741823 ? (Ja >>> 0 < Ca >>> 0 ? Ca : Ja) : 2147483647)
                                        Bb = f[Ma >> 2] | 0
                                    } else Bb = ya
                                    f[Ma >> 2] = Bb + 1
                                    Ja = ((f[Ab >> 2] | 0) + ((Bb >>> 5) << 2)) | 0
                                    f[Ja >> 2] = f[Ja >> 2] | (1 << (Bb & 31))
                                } else {
                                    if (Ga) {
                                        if (((ya + 1) | 0) < 0) {
                                            tb = 106
                                            break b
                                        }
                                        Ga = Ia << 6
                                        Ia = (ya + 32) & -32
                                        hi(Ab, ya >>> 0 < 1073741823 ? (Ga >>> 0 < Ia >>> 0 ? Ia : Ga) : 2147483647)
                                        Cb = f[Ma >> 2] | 0
                                    } else Cb = ya
                                    f[Ma >> 2] = Cb + 1
                                    ya = ((f[Ab >> 2] | 0) + ((Cb >>> 5) << 2)) | 0
                                    f[ya >> 2] = f[ya >> 2] & ~(1 << (Cb & 31))
                                }
                                La = (La + 1) | 0
                            } while ((La | 0) < (Fa | 0))
                        }
                        La = f[$ >> 2] | 0
                        Ma = (d + (Ba << 2)) | 0
                        db = f[(za + 4) >> 2] | 0
                        ma = f[La >> 2] | 0
                        ya = f[(La + 4) >> 2] | 0
                        f[j >> 2] = f[za >> 2]
                        f[ca >> 2] = db
                        f[k >> 2] = ma
                        f[da >> 2] = ya
                        Dd(e, ba, j, k)
                        f[Ma >> 2] = f[e >> 2]
                        f[(Ma + 4) >> 2] = f[ea >> 2]
                        Ma = f[fa >> 2] | 0
                        if (Ma | 0) {
                            ya = f[ia >> 2] | 0
                            if ((ya | 0) != (Ma | 0)) f[ia >> 2] = ya + (~(((ya + -4 - Ma) | 0) >>> 2) << 2)
                            br(Ma)
                        }
                        Ma = f[ga >> 2] | 0
                        if (Ma | 0) {
                            ya = f[ha >> 2] | 0
                            if ((ya | 0) != (Ma | 0)) f[ha >> 2] = ya + (~(((ya + -4 - Ma) | 0) >>> 2) << 2)
                            br(Ma)
                        }
                        if ((na | 0) <= 2) {
                            Db = Ya
                            Eb = Xa
                            break a
                        }
                        Ma = f[B >> 2] | 0
                        wa = f[Ma >> 2] | 0
                        ya = (oa + -1) | 0
                        if ((((f[(Ma + 4) >> 2] | 0) - wa) >> 2) >>> 0 <= ya >>> 0) {
                            xa = Ma
                            tb = 18
                            break
                        } else {
                            Ma = oa
                            oa = ya
                            pa = $a
                            qa = _a
                            ra = Za
                            sa = Ya
                            ta = Xa
                            ua = Wa
                            va = Va
                            na = Ma
                        }
                    }
                    if ((tb | 0) == 18) mq(xa)
                    else if ((tb | 0) == 101) mq(Ab)
                    else if ((tb | 0) == 106) mq(Ab)
                } else {
                    Db = M
                    Eb = N
                }
            while (0)
            if ((g | 0) > 0) hj(f[l >> 2] | 0, 0, (g << 2) | 0) | 0
            g = f[l >> 2] | 0
            N = f[(c + 4) >> 2] | 0
            M = f[g >> 2] | 0
            Ab = f[(g + 4) >> 2] | 0
            f[j >> 2] = f[c >> 2]
            f[(j + 4) >> 2] = N
            f[k >> 2] = M
            f[(k + 4) >> 2] = Ab
            Dd(e, (a + 8) | 0, j, k)
            f[d >> 2] = f[e >> 2]
            f[(d + 4) >> 2] = f[(e + 4) >> 2]
            if (Db | 0) {
                if ((Eb | 0) != (Db | 0)) f[H >> 2] = Eb + (~(((Eb + -4 - Db) | 0) >>> 2) << 2)
                br(Db)
            }
            Db = f[m >> 2] | 0
            if (Db | 0) {
                m = f[E >> 2] | 0
                if ((m | 0) != (Db | 0)) f[E >> 2] = m + (~(((m + -4 - Db) | 0) >>> 2) << 2)
                br(Db)
            }
            Db = f[(l + 36) >> 2] | 0
            if (Db | 0) {
                m = (l + 40) | 0
                E = f[m >> 2] | 0
                if ((E | 0) != (Db | 0)) f[m >> 2] = E + (~(((E + -4 - Db) | 0) >>> 2) << 2)
                br(Db)
            }
            Db = f[(l + 24) >> 2] | 0
            if (Db | 0) {
                E = (l + 28) | 0
                m = f[E >> 2] | 0
                if ((m | 0) != (Db | 0)) f[E >> 2] = m + (~(((m + -4 - Db) | 0) >>> 2) << 2)
                br(Db)
            }
            Db = f[(l + 12) >> 2] | 0
            if (Db | 0) {
                m = (l + 16) | 0
                E = f[m >> 2] | 0
                if ((E | 0) != (Db | 0)) f[m >> 2] = E + (~(((E + -4 - Db) | 0) >>> 2) << 2)
                br(Db)
            }
            Db = f[l >> 2] | 0
            if (!Db) {
                u = i
                return 1
            }
            E = (l + 4) | 0
            l = f[E >> 2] | 0
            if ((l | 0) != (Db | 0)) f[E >> 2] = l + (~(((l + -4 - Db) | 0) >>> 2) << 2)
            br(Db)
            u = i
            return 1
        }
        function fb(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0,
                xa = 0,
                ya = 0,
                za = 0,
                Aa = 0,
                Ba = 0,
                Ca = 0,
                Da = 0,
                Ea = 0,
                Fa = 0,
                Ga = 0,
                Ha = 0,
                Ia = 0,
                Ja = 0,
                Ka = 0,
                La = 0,
                Ma = 0,
                Na = 0,
                Oa = 0,
                Pa = 0,
                Qa = 0,
                Ra = 0,
                Sa = 0,
                Ta = 0,
                Ua = 0,
                Va = 0,
                Wa = 0,
                Xa = 0,
                Ya = 0,
                Za = 0,
                _a = 0,
                $a = 0,
                ab = 0,
                bb = 0,
                cb = 0,
                db = 0,
                eb = 0,
                fb = 0,
                gb = 0,
                hb = 0,
                ib = 0,
                jb = 0,
                kb = 0,
                lb = 0,
                mb = 0,
                nb = 0,
                ob = 0,
                pb = 0,
                qb = 0,
                rb = 0,
                sb = 0,
                tb = 0,
                ub = 0,
                vb = 0,
                wb = 0,
                xb = 0,
                yb = 0,
                zb = 0,
                Ab = 0,
                Bb = 0,
                Cb = 0,
                Db = 0,
                Eb = 0,
                Fb = 0,
                Gb = 0,
                Hb = 0,
                Ib = 0,
                Jb = 0,
                Kb = 0,
                Lb = 0,
                Mb = 0,
                Nb = 0,
                Ob = 0,
                Pb = 0,
                Qb = 0,
                Rb = 0,
                Sb = 0,
                Tb = 0,
                Ub = 0,
                Vb = 0,
                Wb = 0,
                Xb = 0,
                Yb = 0,
                Zb = 0,
                _b = 0
            c = u
            u = (u + 32) | 0
            d = (c + 16) | 0
            e = (c + 4) | 0
            g = c
            f[(a + 36) >> 2] = b
            h = (a + 24) | 0
            i = (a + 28) | 0
            j = f[i >> 2] | 0
            k = f[h >> 2] | 0
            l = (j - k) >> 2
            m = k
            k = j
            if (l >>> 0 >= b >>> 0) {
                if (l >>> 0 > b >>> 0 ? ((j = (m + (b << 2)) | 0), (j | 0) != (k | 0)) : 0) f[i >> 2] = k + (~(((k + -4 - j) | 0) >>> 2) << 2)
            } else kh(h, (b - l) | 0, 5828)
            f[d >> 2] = 0
            l = (d + 4) | 0
            f[l >> 2] = 0
            j = (d + 8) | 0
            f[j >> 2] = 0
            if (b) {
                if ((b | 0) < 0) mq(d)
                k = ((((b + -1) | 0) >>> 5) + 1) | 0
                m = dn(k << 2) | 0
                f[d >> 2] = m
                f[j >> 2] = k
                f[l >> 2] = b
                k = b >>> 5
                hj(m | 0, 0, (k << 2) | 0) | 0
                n = b & 31
                o = (m + (k << 2)) | 0
                k = m
                if (!n) {
                    p = b
                    q = k
                    r = m
                } else {
                    f[o >> 2] = f[o >> 2] & ~(-1 >>> ((32 - n) | 0))
                    p = b
                    q = k
                    r = m
                }
            } else {
                p = 0
                q = 0
                r = 0
            }
            m = (a + 4) | 0
            k = f[a >> 2] | 0
            n = ((f[m >> 2] | 0) - k) | 0
            o = n >> 2
            f[e >> 2] = 0
            s = (e + 4) | 0
            f[s >> 2] = 0
            t = (e + 8) | 0
            f[t >> 2] = 0
            do
                if (o) {
                    if ((n | 0) < 0) mq(e)
                    v = ((((o + -1) | 0) >>> 5) + 1) | 0
                    w = dn(v << 2) | 0
                    f[e >> 2] = w
                    f[t >> 2] = v
                    f[s >> 2] = o
                    v = o >>> 5
                    hj(w | 0, 0, (v << 2) | 0) | 0
                    x = o & 31
                    y = (w + (v << 2)) | 0
                    if (x | 0) f[y >> 2] = f[y >> 2] & ~(-1 >>> ((32 - x) | 0))
                    if (o >>> 0 > 2) {
                        x = (a + 12) | 0
                        y = (a + 32) | 0
                        v = (a + 52) | 0
                        w = (a + 56) | 0
                        z = (a + 48) | 0
                        A = b
                        B = k
                        C = 0
                        D = q
                        E = r
                        a: while (1) {
                            F = B
                            G = (C * 3) | 0
                            if ((G | 0) != -1) {
                                H = f[(F + (G << 2)) >> 2] | 0
                                I = (G + 1) | 0
                                J = ((I >>> 0) % 3 | 0 | 0) == 0 ? (G + -2) | 0 : I
                                if ((J | 0) == -1) K = -1
                                else K = f[(F + (J << 2)) >> 2] | 0
                                J = ((((G >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + G) | 0
                                if ((J | 0) == -1) L = -1
                                else L = f[(F + (J << 2)) >> 2] | 0
                                if ((H | 0) != (K | 0) ? !(((H | 0) == (L | 0)) | ((K | 0) == (L | 0))) : 0) {
                                    H = 0
                                    J = A
                                    F = E
                                    I = D
                                    while (1) {
                                        M = (H + G) | 0
                                        if (!(f[((f[e >> 2] | 0) + ((M >>> 5) << 2)) >> 2] & (1 << (M & 31)))) {
                                            N = f[((f[a >> 2] | 0) + (M << 2)) >> 2] | 0
                                            f[g >> 2] = N
                                            if (!(f[(F + ((N >>> 5) << 2)) >> 2] & (1 << (N & 31)))) {
                                                O = 0
                                                P = J
                                                Q = N
                                            } else {
                                                N = f[i >> 2] | 0
                                                if ((N | 0) == (f[y >> 2] | 0)) Ci(h, 5828)
                                                else {
                                                    f[N >> 2] = -1
                                                    f[i >> 2] = N + 4
                                                }
                                                N = f[v >> 2] | 0
                                                if ((N | 0) == (f[w >> 2] | 0)) Ci(z, g)
                                                else {
                                                    f[N >> 2] = f[g >> 2]
                                                    f[v >> 2] = N + 4
                                                }
                                                N = f[l >> 2] | 0
                                                R = f[j >> 2] | 0
                                                if ((N | 0) == ((R << 5) | 0)) {
                                                    if (((N + 1) | 0) < 0) {
                                                        S = 50
                                                        break a
                                                    }
                                                    T = R << 6
                                                    R = (N + 32) & -32
                                                    hi(d, N >>> 0 < 1073741823 ? (T >>> 0 < R >>> 0 ? R : T) : 2147483647)
                                                    U = f[l >> 2] | 0
                                                } else U = N
                                                f[l >> 2] = U + 1
                                                N = ((f[d >> 2] | 0) + ((U >>> 5) << 2)) | 0
                                                f[N >> 2] = f[N >> 2] & ~(1 << (U & 31))
                                                f[g >> 2] = J
                                                O = 1
                                                P = (J + 1) | 0
                                                Q = J
                                            }
                                            N = f[d >> 2] | 0
                                            T = (N + ((Q >>> 5) << 2)) | 0
                                            f[T >> 2] = f[T >> 2] | (1 << (Q & 31))
                                            T = N
                                            b: do
                                                if (O) {
                                                    R = M
                                                    while (1) {
                                                        if ((R | 0) == -1) {
                                                            S = 64
                                                            break b
                                                        }
                                                        V = ((f[e >> 2] | 0) + ((R >>> 5) << 2)) | 0
                                                        f[V >> 2] = f[V >> 2] | (1 << (R & 31))
                                                        V = f[g >> 2] | 0
                                                        f[((f[h >> 2] | 0) + (V << 2)) >> 2] = R
                                                        f[((f[a >> 2] | 0) + (R << 2)) >> 2] = V
                                                        V = (R + 1) | 0
                                                        W = ((V >>> 0) % 3 | 0 | 0) == 0 ? (R + -2) | 0 : V
                                                        do
                                                            if ((W | 0) == -1) X = -1
                                                            else {
                                                                V = f[((f[x >> 2] | 0) + (W << 2)) >> 2] | 0
                                                                Y = (V + 1) | 0
                                                                if ((V | 0) == -1) {
                                                                    X = -1
                                                                    break
                                                                }
                                                                X = ((Y >>> 0) % 3 | 0 | 0) == 0 ? (V + -2) | 0 : Y
                                                            }
                                                        while (0)
                                                        if ((X | 0) == (M | 0)) break
                                                        else R = X
                                                    }
                                                } else {
                                                    R = M
                                                    while (1) {
                                                        if ((R | 0) == -1) {
                                                            S = 64
                                                            break b
                                                        }
                                                        W = ((f[e >> 2] | 0) + ((R >>> 5) << 2)) | 0
                                                        f[W >> 2] = f[W >> 2] | (1 << (R & 31))
                                                        f[((f[h >> 2] | 0) + (f[g >> 2] << 2)) >> 2] = R
                                                        W = (R + 1) | 0
                                                        Y = ((W >>> 0) % 3 | 0 | 0) == 0 ? (R + -2) | 0 : W
                                                        do
                                                            if ((Y | 0) == -1) Z = -1
                                                            else {
                                                                W = f[((f[x >> 2] | 0) + (Y << 2)) >> 2] | 0
                                                                V = (W + 1) | 0
                                                                if ((W | 0) == -1) {
                                                                    Z = -1
                                                                    break
                                                                }
                                                                Z = ((V >>> 0) % 3 | 0 | 0) == 0 ? (W + -2) | 0 : V
                                                            }
                                                        while (0)
                                                        if ((Z | 0) == (M | 0)) break
                                                        else R = Z
                                                    }
                                                }
                                            while (0)
                                            c: do
                                                if ((S | 0) == 64) {
                                                    S = 0
                                                    if ((M | 0) == -1) break
                                                    R = ((((M >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + M) | 0
                                                    if ((R | 0) == -1) break
                                                    Y = f[((f[x >> 2] | 0) + (R << 2)) >> 2] | 0
                                                    if ((Y | 0) == -1) break
                                                    R = (Y + (((Y >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1)) | 0
                                                    if ((R | 0) == -1) break
                                                    if (!O) {
                                                        Y = R
                                                        while (1) {
                                                            V = ((f[e >> 2] | 0) + ((Y >>> 5) << 2)) | 0
                                                            f[V >> 2] = f[V >> 2] | (1 << (Y & 31))
                                                            V = ((((Y >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + Y) | 0
                                                            if ((V | 0) == -1) break c
                                                            W = f[((f[x >> 2] | 0) + (V << 2)) >> 2] | 0
                                                            if ((W | 0) == -1) break c
                                                            Y = (W + (((W >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1)) | 0
                                                            if ((Y | 0) == -1) break c
                                                        }
                                                    }
                                                    Y = f[a >> 2] | 0
                                                    W = R
                                                    do {
                                                        V = ((f[e >> 2] | 0) + ((W >>> 5) << 2)) | 0
                                                        f[V >> 2] = f[V >> 2] | (1 << (W & 31))
                                                        f[(Y + (W << 2)) >> 2] = f[g >> 2]
                                                        V = ((((W >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + W) | 0
                                                        if ((V | 0) == -1) break c
                                                        _ = f[((f[x >> 2] | 0) + (V << 2)) >> 2] | 0
                                                        if ((_ | 0) == -1) break c
                                                        W = (_ + (((_ >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1)) | 0
                                                    } while ((W | 0) != -1)
                                                }
                                            while (0)
                                            $ = P
                                            aa = T
                                            ba = N
                                        } else {
                                            $ = J
                                            aa = I
                                            ba = F
                                        }
                                        if ((H | 0) < 2) {
                                            H = (H + 1) | 0
                                            J = $
                                            F = ba
                                            I = aa
                                        } else {
                                            ca = $
                                            da = aa
                                            ea = ba
                                            break
                                        }
                                    }
                                } else {
                                    ca = A
                                    da = D
                                    ea = E
                                }
                            } else {
                                ca = A
                                da = D
                                ea = E
                            }
                            C = (C + 1) | 0
                            B = f[a >> 2] | 0
                            if (C >>> 0 >= ((((((f[m >> 2] | 0) - B) >> 2) >>> 0) / 3) | 0) >>> 0) {
                                S = 18
                                break
                            } else {
                                A = ca
                                D = da
                                E = ea
                            }
                        }
                        if ((S | 0) == 18) {
                            fa = da
                            ga = f[l >> 2] | 0
                            break
                        } else if ((S | 0) == 50) mq(d)
                    } else {
                        fa = q
                        ga = p
                    }
                } else {
                    fa = q
                    ga = p
                }
            while (0)
            p = (a + 44) | 0
            f[p >> 2] = 0
            a = fa
            fa = ga >>> 5
            q = (a + (fa << 2)) | 0
            S = ga & 31
            ga = (fa | 0) != 0
            d: do
                if (fa | S | 0)
                    if (!S) {
                        l = a
                        da = 0
                        ea = ga
                        while (1) {
                            e: do
                                if (ea) {
                                    if (!(f[l >> 2] & 1)) {
                                        ca = (da + 1) | 0
                                        f[p >> 2] = ca
                                        ha = ca
                                    } else ha = da
                                    if (!(f[l >> 2] & 2)) {
                                        ca = (ha + 1) | 0
                                        f[p >> 2] = ca
                                        ia = ca
                                    } else ia = ha
                                    if (!(f[l >> 2] & 4)) {
                                        ca = (ia + 1) | 0
                                        f[p >> 2] = ca
                                        ja = ca
                                    } else ja = ia
                                    if (!(f[l >> 2] & 8)) {
                                        ca = (ja + 1) | 0
                                        f[p >> 2] = ca
                                        ka = ca
                                    } else ka = ja
                                    if (!(f[l >> 2] & 16)) {
                                        ca = (ka + 1) | 0
                                        f[p >> 2] = ca
                                        la = ca
                                    } else la = ka
                                    if (!(f[l >> 2] & 32)) {
                                        ca = (la + 1) | 0
                                        f[p >> 2] = ca
                                        ma = ca
                                    } else ma = la
                                    if (!(f[l >> 2] & 64)) {
                                        ca = (ma + 1) | 0
                                        f[p >> 2] = ca
                                        na = ca
                                    } else na = ma
                                    if (!(f[l >> 2] & 128)) {
                                        ca = (na + 1) | 0
                                        f[p >> 2] = ca
                                        oa = ca
                                    } else oa = na
                                    if (!(f[l >> 2] & 256)) {
                                        ca = (oa + 1) | 0
                                        f[p >> 2] = ca
                                        pa = ca
                                    } else pa = oa
                                    if (!(f[l >> 2] & 512)) {
                                        ca = (pa + 1) | 0
                                        f[p >> 2] = ca
                                        qa = ca
                                    } else qa = pa
                                    if (!(f[l >> 2] & 1024)) {
                                        ca = (qa + 1) | 0
                                        f[p >> 2] = ca
                                        ra = ca
                                    } else ra = qa
                                    if (!(f[l >> 2] & 2048)) {
                                        ca = (ra + 1) | 0
                                        f[p >> 2] = ca
                                        sa = ca
                                    } else sa = ra
                                    if (!(f[l >> 2] & 4096)) {
                                        ca = (sa + 1) | 0
                                        f[p >> 2] = ca
                                        ta = ca
                                    } else ta = sa
                                    if (!(f[l >> 2] & 8192)) {
                                        ca = (ta + 1) | 0
                                        f[p >> 2] = ca
                                        ua = ca
                                    } else ua = ta
                                    if (!(f[l >> 2] & 16384)) {
                                        ca = (ua + 1) | 0
                                        f[p >> 2] = ca
                                        va = ca
                                    } else va = ua
                                    if (!(f[l >> 2] & 32768)) {
                                        ca = (va + 1) | 0
                                        f[p >> 2] = ca
                                        wa = ca
                                    } else wa = va
                                    if (!(f[l >> 2] & 65536)) {
                                        ca = (wa + 1) | 0
                                        f[p >> 2] = ca
                                        xa = ca
                                    } else xa = wa
                                    if (!(f[l >> 2] & 131072)) {
                                        ca = (xa + 1) | 0
                                        f[p >> 2] = ca
                                        ya = ca
                                    } else ya = xa
                                    if (!(f[l >> 2] & 262144)) {
                                        ca = (ya + 1) | 0
                                        f[p >> 2] = ca
                                        za = ca
                                    } else za = ya
                                    if (!(f[l >> 2] & 524288)) {
                                        ca = (za + 1) | 0
                                        f[p >> 2] = ca
                                        Aa = ca
                                    } else Aa = za
                                    if (!(f[l >> 2] & 1048576)) {
                                        ca = (Aa + 1) | 0
                                        f[p >> 2] = ca
                                        Ba = ca
                                    } else Ba = Aa
                                    if (!(f[l >> 2] & 2097152)) {
                                        ca = (Ba + 1) | 0
                                        f[p >> 2] = ca
                                        Ca = ca
                                    } else Ca = Ba
                                    if (!(f[l >> 2] & 4194304)) {
                                        ca = (Ca + 1) | 0
                                        f[p >> 2] = ca
                                        Da = ca
                                    } else Da = Ca
                                    if (!(f[l >> 2] & 8388608)) {
                                        ca = (Da + 1) | 0
                                        f[p >> 2] = ca
                                        Ea = ca
                                    } else Ea = Da
                                    if (!(f[l >> 2] & 16777216)) {
                                        ca = (Ea + 1) | 0
                                        f[p >> 2] = ca
                                        Fa = ca
                                    } else Fa = Ea
                                    if (!(f[l >> 2] & 33554432)) {
                                        ca = (Fa + 1) | 0
                                        f[p >> 2] = ca
                                        Ga = ca
                                    } else Ga = Fa
                                    if (!(f[l >> 2] & 67108864)) {
                                        ca = (Ga + 1) | 0
                                        f[p >> 2] = ca
                                        Ha = ca
                                    } else Ha = Ga
                                    if (!(f[l >> 2] & 134217728)) {
                                        ca = (Ha + 1) | 0
                                        f[p >> 2] = ca
                                        Ia = ca
                                    } else Ia = Ha
                                    if (!(f[l >> 2] & 268435456)) {
                                        ca = (Ia + 1) | 0
                                        f[p >> 2] = ca
                                        Ja = ca
                                    } else Ja = Ia
                                    if (!(f[l >> 2] & 536870912)) {
                                        ca = (Ja + 1) | 0
                                        f[p >> 2] = ca
                                        Ka = ca
                                    } else Ka = Ja
                                    if (!(f[l >> 2] & 1073741824)) {
                                        ca = (Ka + 1) | 0
                                        f[p >> 2] = ca
                                        La = ca
                                    } else La = Ka
                                    if ((f[l >> 2] | 0) <= -1) {
                                        Ma = La
                                        break
                                    }
                                    ca = (La + 1) | 0
                                    f[p >> 2] = ca
                                    Ma = ca
                                } else {
                                    ca = 0
                                    m = da
                                    while (1) {
                                        if (!(f[l >> 2] & (1 << ca))) {
                                            ba = (m + 1) | 0
                                            f[p >> 2] = ba
                                            Na = ba
                                        } else Na = m
                                        if ((ca | 0) == 31) {
                                            Ma = Na
                                            break e
                                        }
                                        ca = (ca + 1) | 0
                                        if (!ca) break d
                                        else m = Na
                                    }
                                }
                            while (0)
                            l = (l + 4) | 0
                            if ((q | 0) == (l | 0)) break
                            else {
                                da = Ma
                                ea = 1
                            }
                        }
                    } else {
                        if (ga) {
                            ea = 0
                            da = a
                            l = 0
                            while (1) {
                                if (!(f[da >> 2] & 1)) {
                                    m = (l + 1) | 0
                                    f[p >> 2] = m
                                    Oa = m
                                    Pa = m
                                } else {
                                    Oa = l
                                    Pa = ea
                                }
                                if (!(f[da >> 2] & 2)) {
                                    m = (Oa + 1) | 0
                                    f[p >> 2] = m
                                    Qa = m
                                    Ra = m
                                } else {
                                    Qa = Oa
                                    Ra = Pa
                                }
                                if (!(f[da >> 2] & 4)) {
                                    m = (Qa + 1) | 0
                                    f[p >> 2] = m
                                    Sa = m
                                    Ta = m
                                } else {
                                    Sa = Qa
                                    Ta = Ra
                                }
                                if (!(f[da >> 2] & 8)) {
                                    m = (Sa + 1) | 0
                                    f[p >> 2] = m
                                    Ua = m
                                    Va = m
                                } else {
                                    Ua = Sa
                                    Va = Ta
                                }
                                if (!(f[da >> 2] & 16)) {
                                    m = (Ua + 1) | 0
                                    f[p >> 2] = m
                                    Wa = m
                                    Xa = m
                                } else {
                                    Wa = Ua
                                    Xa = Va
                                }
                                if (!(f[da >> 2] & 32)) {
                                    m = (Wa + 1) | 0
                                    f[p >> 2] = m
                                    Ya = m
                                    Za = m
                                } else {
                                    Ya = Wa
                                    Za = Xa
                                }
                                if (!(f[da >> 2] & 64)) {
                                    m = (Ya + 1) | 0
                                    f[p >> 2] = m
                                    _a = m
                                    $a = m
                                } else {
                                    _a = Ya
                                    $a = Za
                                }
                                if (!(f[da >> 2] & 128)) {
                                    m = (_a + 1) | 0
                                    f[p >> 2] = m
                                    ab = m
                                    bb = m
                                } else {
                                    ab = _a
                                    bb = $a
                                }
                                if (!(f[da >> 2] & 256)) {
                                    m = (ab + 1) | 0
                                    f[p >> 2] = m
                                    cb = m
                                    db = m
                                } else {
                                    cb = ab
                                    db = bb
                                }
                                if (!(f[da >> 2] & 512)) {
                                    m = (cb + 1) | 0
                                    f[p >> 2] = m
                                    eb = m
                                    fb = m
                                } else {
                                    eb = cb
                                    fb = db
                                }
                                if (!(f[da >> 2] & 1024)) {
                                    m = (eb + 1) | 0
                                    f[p >> 2] = m
                                    gb = m
                                    hb = m
                                } else {
                                    gb = eb
                                    hb = fb
                                }
                                if (!(f[da >> 2] & 2048)) {
                                    m = (gb + 1) | 0
                                    f[p >> 2] = m
                                    ib = m
                                    jb = m
                                } else {
                                    ib = gb
                                    jb = hb
                                }
                                if (!(f[da >> 2] & 4096)) {
                                    m = (ib + 1) | 0
                                    f[p >> 2] = m
                                    kb = m
                                    lb = m
                                } else {
                                    kb = ib
                                    lb = jb
                                }
                                if (!(f[da >> 2] & 8192)) {
                                    m = (kb + 1) | 0
                                    f[p >> 2] = m
                                    mb = m
                                    nb = m
                                } else {
                                    mb = kb
                                    nb = lb
                                }
                                if (!(f[da >> 2] & 16384)) {
                                    m = (mb + 1) | 0
                                    f[p >> 2] = m
                                    ob = m
                                    pb = m
                                } else {
                                    ob = mb
                                    pb = nb
                                }
                                if (!(f[da >> 2] & 32768)) {
                                    m = (ob + 1) | 0
                                    f[p >> 2] = m
                                    qb = m
                                    rb = m
                                } else {
                                    qb = ob
                                    rb = pb
                                }
                                if (!(f[da >> 2] & 65536)) {
                                    m = (qb + 1) | 0
                                    f[p >> 2] = m
                                    sb = m
                                    tb = m
                                } else {
                                    sb = qb
                                    tb = rb
                                }
                                if (!(f[da >> 2] & 131072)) {
                                    m = (sb + 1) | 0
                                    f[p >> 2] = m
                                    ub = m
                                    vb = m
                                } else {
                                    ub = sb
                                    vb = tb
                                }
                                if (!(f[da >> 2] & 262144)) {
                                    m = (ub + 1) | 0
                                    f[p >> 2] = m
                                    wb = m
                                    xb = m
                                } else {
                                    wb = ub
                                    xb = vb
                                }
                                if (!(f[da >> 2] & 524288)) {
                                    m = (wb + 1) | 0
                                    f[p >> 2] = m
                                    yb = m
                                    zb = m
                                } else {
                                    yb = wb
                                    zb = xb
                                }
                                if (!(f[da >> 2] & 1048576)) {
                                    m = (yb + 1) | 0
                                    f[p >> 2] = m
                                    Ab = m
                                    Bb = m
                                } else {
                                    Ab = yb
                                    Bb = zb
                                }
                                if (!(f[da >> 2] & 2097152)) {
                                    m = (Ab + 1) | 0
                                    f[p >> 2] = m
                                    Cb = m
                                    Db = m
                                } else {
                                    Cb = Ab
                                    Db = Bb
                                }
                                if (!(f[da >> 2] & 4194304)) {
                                    m = (Cb + 1) | 0
                                    f[p >> 2] = m
                                    Eb = m
                                    Fb = m
                                } else {
                                    Eb = Cb
                                    Fb = Db
                                }
                                if (!(f[da >> 2] & 8388608)) {
                                    m = (Eb + 1) | 0
                                    f[p >> 2] = m
                                    Gb = m
                                    Hb = m
                                } else {
                                    Gb = Eb
                                    Hb = Fb
                                }
                                if (!(f[da >> 2] & 16777216)) {
                                    m = (Gb + 1) | 0
                                    f[p >> 2] = m
                                    Ib = m
                                    Jb = m
                                } else {
                                    Ib = Gb
                                    Jb = Hb
                                }
                                if (!(f[da >> 2] & 33554432)) {
                                    m = (Ib + 1) | 0
                                    f[p >> 2] = m
                                    Kb = m
                                    Lb = m
                                } else {
                                    Kb = Ib
                                    Lb = Jb
                                }
                                if (!(f[da >> 2] & 67108864)) {
                                    m = (Kb + 1) | 0
                                    f[p >> 2] = m
                                    Mb = m
                                    Nb = m
                                } else {
                                    Mb = Kb
                                    Nb = Lb
                                }
                                if (!(f[da >> 2] & 134217728)) {
                                    m = (Mb + 1) | 0
                                    f[p >> 2] = m
                                    Ob = m
                                    Pb = m
                                } else {
                                    Ob = Mb
                                    Pb = Nb
                                }
                                if (!(f[da >> 2] & 268435456)) {
                                    m = (Ob + 1) | 0
                                    f[p >> 2] = m
                                    Qb = m
                                    Rb = m
                                } else {
                                    Qb = Ob
                                    Rb = Pb
                                }
                                if (!(f[da >> 2] & 536870912)) {
                                    m = (Qb + 1) | 0
                                    f[p >> 2] = m
                                    Sb = m
                                    Tb = m
                                } else {
                                    Sb = Qb
                                    Tb = Rb
                                }
                                if (!(f[da >> 2] & 1073741824)) {
                                    m = (Sb + 1) | 0
                                    f[p >> 2] = m
                                    Ub = m
                                    Vb = m
                                } else {
                                    Ub = Sb
                                    Vb = Tb
                                }
                                if ((f[da >> 2] | 0) > -1) {
                                    m = (Ub + 1) | 0
                                    f[p >> 2] = m
                                    Wb = m
                                    Xb = m
                                } else {
                                    Wb = Ub
                                    Xb = Vb
                                }
                                m = (da + 4) | 0
                                if ((q | 0) == (m | 0)) {
                                    Yb = m
                                    Zb = Xb
                                    break
                                } else {
                                    ea = Xb
                                    da = m
                                    l = Wb
                                }
                            }
                        } else {
                            Yb = a
                            Zb = 0
                        }
                        l = 0
                        da = Zb
                        while (1) {
                            if (!(f[Yb >> 2] & (1 << l))) {
                                ea = (da + 1) | 0
                                f[p >> 2] = ea
                                _b = ea
                            } else _b = da
                            l = (l + 1) | 0
                            if ((l | 0) == (S | 0)) break
                            else da = _b
                        }
                    }
            while (0)
            _b = f[e >> 2] | 0
            if (_b | 0) br(_b)
            _b = f[d >> 2] | 0
            if (!_b) {
                u = c
                return 1
            }
            br(_b)
            u = c
            return 1
        }
        function gb(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0,
                xa = 0,
                ya = 0,
                za = 0,
                Aa = 0,
                Ba = 0,
                Ca = 0,
                Da = 0,
                Ea = 0,
                Fa = 0,
                Ga = 0,
                Ha = 0,
                Ia = 0,
                Ja = 0,
                Ka = Oa,
                La = 0,
                Ma = 0,
                Na = 0,
                Pa = 0,
                Qa = Oa,
                Ra = 0,
                Sa = 0,
                Ta = 0,
                Ua = 0,
                Va = 0
            c = u
            u = (u + 80) | 0
            d = (c + 60) | 0
            e = (c + 48) | 0
            g = (c + 24) | 0
            h = (c + 12) | 0
            i = c
            j = (a + 28) | 0
            k = f[j >> 2] | 0
            l = f[(k + 4) >> 2] | 0
            m = f[(l + 80) >> 2] | 0
            o = (a + 4) | 0
            p = (a + 8) | 0
            q = f[p >> 2] | 0
            r = f[o >> 2] | 0
            s = (q | 0) == (r | 0)
            t = r
            if (s) {
                f[(a + 72) >> 2] = 0
                v = 1
                u = c
                return v | 0
            }
            w = f[(l + 8) >> 2] | 0
            x = (q - r) >> 2
            r = 0
            q = 0
            do {
                r = (r + (b[((f[(w + (f[(t + (q << 2)) >> 2] << 2)) >> 2] | 0) + 24) >> 0] | 0)) | 0
                q = (q + 1) | 0
            } while (q >>> 0 < x >>> 0)
            f[(a + 72) >> 2] = r
            if (s) {
                v = 1
                u = c
                return v | 0
            }
            s = (g + 4) | 0
            r = (g + 8) | 0
            x = (d + 8) | 0
            q = (d + 4) | 0
            w = (d + 11) | 0
            y = (g + 12) | 0
            z = (d + 8) | 0
            A = (d + 4) | 0
            B = (d + 11) | 0
            C = (h + 4) | 0
            D = (h + 8) | 0
            E = (i + 8) | 0
            F = (i + 4) | 0
            G = (d + 11) | 0
            H = (d + 4) | 0
            I = (i + 11) | 0
            J = (d + 8) | 0
            K = (d + 4) | 0
            L = (d + 11) | 0
            M = (d + 11) | 0
            N = (d + 4) | 0
            O = (h + 8) | 0
            P = (a + 40) | 0
            Q = (a + 44) | 0
            R = (a + 36) | 0
            S = (a + 64) | 0
            T = (a + 68) | 0
            U = (a + 60) | 0
            V = (g + 8) | 0
            W = (g + 20) | 0
            X = (e + 8) | 0
            Y = (e + 4) | 0
            Z = (e + 11) | 0
            _ = (g + 4) | 0
            aa = (g + 8) | 0
            ba = (h + 4) | 0
            ca = (h + 8) | 0
            da = (h + 8) | 0
            ea = (a + 52) | 0
            fa = (a + 56) | 0
            ga = (a + 48) | 0
            a = (g + 8) | 0
            ha = 0
            ia = t
            t = l
            l = k
            a: while (1) {
                k = f[(ia + (ha << 2)) >> 2] | 0
                ja = f[((f[(t + 8) >> 2] | 0) + (k << 2)) >> 2] | 0
                switch (f[(ja + 28) >> 2] | 0) {
                    case 9: {
                        f[g >> 2] = 1180
                        f[s >> 2] = -1
                        f[r >> 2] = 0
                        f[(r + 4) >> 2] = 0
                        f[(r + 8) >> 2] = 0
                        f[(r + 12) >> 2] = 0
                        ka = f[(l + 48) >> 2] | 0
                        f[d >> 2] = 0
                        f[(d + 4) >> 2] = 0
                        f[(d + 8) >> 2] = 0
                        la = dn(32) | 0
                        f[d >> 2] = la
                        f[x >> 2] = -2147483616
                        f[q >> 2] = 17
                        ma = la
                        na = 12932
                        oa = (ma + 17) | 0
                        do {
                            b[ma >> 0] = b[na >> 0] | 0
                            ma = (ma + 1) | 0
                            na = (na + 1) | 0
                        } while ((ma | 0) < (oa | 0))
                        b[(la + 17) >> 0] = 0
                        pa = (ka + 16) | 0
                        qa = f[pa >> 2] | 0
                        if (qa) {
                            ra = pa
                            sa = qa
                            b: while (1) {
                                qa = sa
                                while (1) {
                                    if ((f[(qa + 16) >> 2] | 0) >= (k | 0)) break
                                    ta = f[(qa + 4) >> 2] | 0
                                    if (!ta) {
                                        ua = ra
                                        break b
                                    } else qa = ta
                                }
                                sa = f[qa >> 2] | 0
                                if (!sa) {
                                    ua = qa
                                    break
                                } else ra = qa
                            }
                            if (((ua | 0) != (pa | 0) ? (k | 0) >= (f[(ua + 16) >> 2] | 0) : 0) ? ((ra = (ua + 20) | 0), (sh(ra, d) | 0) != 0) : 0) va = yk(ra, d, -1) | 0
                            else wa = 17
                        } else wa = 17
                        if ((wa | 0) == 17) {
                            wa = 0
                            va = yk(ka, d, -1) | 0
                        }
                        if ((b[w >> 0] | 0) < 0) br(f[d >> 2] | 0)
                        if ((va | 0) < 1) xa = 1
                        else {
                            ra = f[((f[j >> 2] | 0) + 48) >> 2] | 0
                            f[d >> 2] = 0
                            f[(d + 4) >> 2] = 0
                            f[(d + 8) >> 2] = 0
                            sa = dn(32) | 0
                            f[d >> 2] = sa
                            f[z >> 2] = -2147483616
                            f[A >> 2] = 19
                            ma = sa
                            na = 13005
                            oa = (ma + 19) | 0
                            do {
                                b[ma >> 0] = b[na >> 0] | 0
                                ma = (ma + 1) | 0
                                na = (na + 1) | 0
                            } while ((ma | 0) < (oa | 0))
                            b[(sa + 19) >> 0] = 0
                            ka = (ra + 16) | 0
                            pa = f[ka >> 2] | 0
                            if (pa) {
                                la = ka
                                ta = pa
                                c: while (1) {
                                    pa = ta
                                    while (1) {
                                        if ((f[(pa + 16) >> 2] | 0) >= (k | 0)) break
                                        ya = f[(pa + 4) >> 2] | 0
                                        if (!ya) {
                                            za = la
                                            break c
                                        } else pa = ya
                                    }
                                    ta = f[pa >> 2] | 0
                                    if (!ta) {
                                        za = pa
                                        break
                                    } else la = pa
                                }
                                if ((za | 0) != (ka | 0) ? (k | 0) >= (f[(za + 16) >> 2] | 0) : 0) Aa = (za + 20) | 0
                                else wa = 29
                            } else wa = 29
                            if ((wa | 0) == 29) {
                                wa = 0
                                Aa = ra
                            }
                            if (!(sh(Aa, d) | 0)) Ba = 0
                            else {
                                la = f[((f[j >> 2] | 0) + 48) >> 2] | 0
                                f[e >> 2] = 0
                                f[(e + 4) >> 2] = 0
                                f[(e + 8) >> 2] = 0
                                ta = dn(32) | 0
                                f[e >> 2] = ta
                                f[X >> 2] = -2147483616
                                f[Y >> 2] = 18
                                ma = ta
                                na = 13025
                                oa = (ma + 18) | 0
                                do {
                                    b[ma >> 0] = b[na >> 0] | 0
                                    ma = (ma + 1) | 0
                                    na = (na + 1) | 0
                                } while ((ma | 0) < (oa | 0))
                                b[(ta + 18) >> 0] = 0
                                ra = (la + 16) | 0
                                ka = f[ra >> 2] | 0
                                if (ka) {
                                    sa = ra
                                    qa = ka
                                    d: while (1) {
                                        ka = qa
                                        while (1) {
                                            if ((f[(ka + 16) >> 2] | 0) >= (k | 0)) break
                                            ya = f[(ka + 4) >> 2] | 0
                                            if (!ya) {
                                                Ca = sa
                                                break d
                                            } else ka = ya
                                        }
                                        qa = f[ka >> 2] | 0
                                        if (!qa) {
                                            Ca = ka
                                            break
                                        } else sa = ka
                                    }
                                    if ((Ca | 0) != (ra | 0) ? (k | 0) >= (f[(Ca + 16) >> 2] | 0) : 0) Da = (Ca + 20) | 0
                                    else wa = 39
                                } else wa = 39
                                if ((wa | 0) == 39) {
                                    wa = 0
                                    Da = la
                                }
                                sa = (sh(Da, e) | 0) != 0
                                if ((b[Z >> 0] | 0) < 0) br(f[e >> 2] | 0)
                                Ba = sa
                            }
                            if ((b[B >> 0] | 0) < 0) br(f[d >> 2] | 0)
                            if (Ba) {
                                sa = (ja + 24) | 0
                                qa = b[sa >> 0] | 0
                                ta = (qa << 24) >> 24
                                f[h >> 2] = 0
                                f[C >> 2] = 0
                                f[D >> 2] = 0
                                if (!((qa << 24) >> 24)) Ea = 0
                                else {
                                    if ((qa << 24) >> 24 < 0) {
                                        wa = 48
                                        break a
                                    }
                                    qa = ta << 2
                                    pa = dn(qa) | 0
                                    f[h >> 2] = pa
                                    ya = (pa + (ta << 2)) | 0
                                    f[O >> 2] = ya
                                    hj(pa | 0, 0, qa | 0) | 0
                                    f[C >> 2] = ya
                                    Ea = pa
                                }
                                pa = f[((f[j >> 2] | 0) + 48) >> 2] | 0
                                f[i >> 2] = 0
                                f[(i + 4) >> 2] = 0
                                f[(i + 8) >> 2] = 0
                                ya = dn(32) | 0
                                f[i >> 2] = ya
                                f[E >> 2] = -2147483616
                                f[F >> 2] = 19
                                ma = ya
                                na = 13005
                                oa = (ma + 19) | 0
                                do {
                                    b[ma >> 0] = b[na >> 0] | 0
                                    ma = (ma + 1) | 0
                                    na = (na + 1) | 0
                                } while ((ma | 0) < (oa | 0))
                                b[(ya + 19) >> 0] = 0
                                la = b[sa >> 0] | 0
                                ra = (la << 24) >> 24
                                qa = (pa + 16) | 0
                                ta = f[qa >> 2] | 0
                                if (ta) {
                                    Fa = qa
                                    Ga = ta
                                    e: while (1) {
                                        ta = Ga
                                        while (1) {
                                            if ((f[(ta + 16) >> 2] | 0) >= (k | 0)) break
                                            Ha = f[(ta + 4) >> 2] | 0
                                            if (!Ha) {
                                                Ia = Fa
                                                break e
                                            } else ta = Ha
                                        }
                                        Ga = f[ta >> 2] | 0
                                        if (!Ga) {
                                            Ia = ta
                                            break
                                        } else Fa = ta
                                    }
                                    if (((Ia | 0) != (qa | 0) ? (k | 0) >= (f[(Ia + 16) >> 2] | 0) : 0) ? ((Fa = (Ia + 20) | 0), (sh(Fa, i) | 0) != 0) : 0) {
                                        Ga = zg(Fa, i) | 0
                                        if ((Ga | 0) != ((Ia + 24) | 0)) {
                                            dj(d, (Ga + 28) | 0)
                                            Ga = b[M >> 0] | 0
                                            Fa = (Ga << 24) >> 24 < 0
                                            if (!((Fa ? f[N >> 2] | 0 : Ga & 255) | 0)) Ja = Ga
                                            else {
                                                if ((la << 24) >> 24 > 0) {
                                                    ya = Fa ? f[d >> 2] | 0 : d
                                                    Fa = 0
                                                    do {
                                                        Ka = $(pq(ya, e))
                                                        ka = ya
                                                        ya = f[e >> 2] | 0
                                                        if ((ka | 0) == (ya | 0)) break
                                                        n[(Ea + (Fa << 2)) >> 2] = Ka
                                                        Fa = (Fa + 1) | 0
                                                    } while ((Fa | 0) < (ra | 0))
                                                    La = b[M >> 0] | 0
                                                } else La = Ga
                                                Ja = La
                                            }
                                            if ((Ja << 24) >> 24 < 0) br(f[d >> 2] | 0)
                                        }
                                    } else wa = 69
                                } else wa = 69
                                if ((wa | 0) == 69 ? ((wa = 0), (Fa = zg(pa, i) | 0), (Fa | 0) != ((pa + 4) | 0)) : 0) {
                                    dj(d, (Fa + 28) | 0)
                                    Fa = b[G >> 0] | 0
                                    ya = (Fa << 24) >> 24 < 0
                                    if (!((ya ? f[H >> 2] | 0 : Fa & 255) | 0)) Ma = Fa
                                    else {
                                        if ((la << 24) >> 24 > 0) {
                                            qa = ya ? f[d >> 2] | 0 : d
                                            ya = 0
                                            do {
                                                Ka = $(pq(qa, e))
                                                ka = qa
                                                qa = f[e >> 2] | 0
                                                if ((ka | 0) == (qa | 0)) break
                                                n[(Ea + (ya << 2)) >> 2] = Ka
                                                ya = (ya + 1) | 0
                                            } while ((ya | 0) < (ra | 0))
                                            Na = b[G >> 0] | 0
                                        } else Na = Fa
                                        Ma = Na
                                    }
                                    if ((Ma << 24) >> 24 < 0) br(f[d >> 2] | 0)
                                }
                                if ((b[I >> 0] | 0) < 0) br(f[i >> 2] | 0)
                                ra = f[((f[j >> 2] | 0) + 48) >> 2] | 0
                                f[d >> 2] = 0
                                f[(d + 4) >> 2] = 0
                                f[(d + 8) >> 2] = 0
                                ya = dn(32) | 0
                                f[d >> 2] = ya
                                f[J >> 2] = -2147483616
                                f[K >> 2] = 18
                                ma = ya
                                na = 13025
                                oa = (ma + 18) | 0
                                do {
                                    b[ma >> 0] = b[na >> 0] | 0
                                    ma = (ma + 1) | 0
                                    na = (na + 1) | 0
                                } while ((ma | 0) < (oa | 0))
                                b[(ya + 18) >> 0] = 0
                                na = (ra + 16) | 0
                                ma = f[na >> 2] | 0
                                do
                                    if (ma) {
                                        oa = na
                                        Fa = ma
                                        f: while (1) {
                                            qa = Fa
                                            while (1) {
                                                if ((f[(qa + 16) >> 2] | 0) >= (k | 0)) break
                                                la = f[(qa + 4) >> 2] | 0
                                                if (!la) {
                                                    Pa = oa
                                                    break f
                                                } else qa = la
                                            }
                                            Fa = f[qa >> 2] | 0
                                            if (!Fa) {
                                                Pa = qa
                                                break
                                            } else oa = qa
                                        }
                                        if ((Pa | 0) != (na | 0) ? (k | 0) >= (f[(Pa + 16) >> 2] | 0) : 0) {
                                            oa = (Pa + 20) | 0
                                            if (!(sh(oa, d) | 0)) {
                                                wa = 91
                                                break
                                            }
                                            Qa = $(kk(oa, d, $(1.0)))
                                        } else wa = 91
                                    } else wa = 91
                                while (0)
                                if ((wa | 0) == 91) {
                                    wa = 0
                                    Qa = $(kk(ra, d, $(1.0)))
                                }
                                if ((b[L >> 0] | 0) < 0) br(f[d >> 2] | 0)
                                wl(g, va, f[h >> 2] | 0, b[sa >> 0] | 0, Qa)
                                k = f[h >> 2] | 0
                                if (k | 0) {
                                    na = f[C >> 2] | 0
                                    if ((na | 0) != (k | 0)) f[C >> 2] = na + (~(((na + -4 - k) | 0) >>> 2) << 2)
                                    br(k)
                                }
                            } else Kd(g, ja, va) | 0
                            k = f[P >> 2] | 0
                            if ((k | 0) == (f[Q >> 2] | 0)) of(R, g)
                            else {
                                f[k >> 2] = 1180
                                f[(k + 4) >> 2] = f[s >> 2]
                                Ra = (k + 8) | 0
                                f[Ra >> 2] = 0
                                na = (k + 12) | 0
                                f[na >> 2] = 0
                                f[(k + 16) >> 2] = 0
                                ma = ((f[y >> 2] | 0) - (f[V >> 2] | 0)) | 0
                                ya = ma >> 2
                                if (ya | 0) {
                                    if (ya >>> 0 > 1073741823) {
                                        wa = 103
                                        break a
                                    }
                                    oa = dn(ma) | 0
                                    f[na >> 2] = oa
                                    f[Ra >> 2] = oa
                                    f[(k + 16) >> 2] = oa + (ya << 2)
                                    ya = f[V >> 2] | 0
                                    ma = ((f[y >> 2] | 0) - ya) | 0
                                    if ((ma | 0) > 0) {
                                        Rg(oa | 0, ya | 0, ma | 0) | 0
                                        f[na >> 2] = oa + ((ma >>> 2) << 2)
                                    }
                                }
                                f[(k + 20) >> 2] = f[W >> 2]
                                f[P >> 2] = (f[P >> 2] | 0) + 24
                            }
                            Re(d, g, ja, m)
                            k = f[S >> 2] | 0
                            if (k >>> 0 < (f[T >> 2] | 0) >>> 0) {
                                ma = f[d >> 2] | 0
                                f[d >> 2] = 0
                                f[k >> 2] = ma
                                f[S >> 2] = k + 4
                            } else Me(U, d)
                            k = f[d >> 2] | 0
                            f[d >> 2] = 0
                            if (k | 0) {
                                ma = (k + 88) | 0
                                oa = f[ma >> 2] | 0
                                f[ma >> 2] = 0
                                if (oa | 0) {
                                    ma = f[(oa + 8) >> 2] | 0
                                    if (ma | 0) {
                                        na = (oa + 12) | 0
                                        if ((f[na >> 2] | 0) != (ma | 0)) f[na >> 2] = ma
                                        br(ma)
                                    }
                                    br(oa)
                                }
                                oa = f[(k + 68) >> 2] | 0
                                if (oa | 0) {
                                    ma = (k + 72) | 0
                                    na = f[ma >> 2] | 0
                                    if ((na | 0) != (oa | 0)) f[ma >> 2] = na + (~(((na + -4 - oa) | 0) >>> 2) << 2)
                                    br(oa)
                                }
                                oa = (k + 64) | 0
                                na = f[oa >> 2] | 0
                                f[oa >> 2] = 0
                                if (na | 0) {
                                    oa = f[na >> 2] | 0
                                    if (oa | 0) {
                                        ma = (na + 4) | 0
                                        if ((f[ma >> 2] | 0) != (oa | 0)) f[ma >> 2] = oa
                                        br(oa)
                                    }
                                    br(na)
                                }
                                br(k)
                            }
                            xa = 0
                        }
                        f[g >> 2] = 1180
                        k = f[r >> 2] | 0
                        if (k | 0) {
                            na = f[y >> 2] | 0
                            if ((na | 0) != (k | 0)) f[y >> 2] = na + (~(((na + -4 - k) | 0) >>> 2) << 2)
                            br(k)
                        }
                        if (xa | 0) {
                            v = 0
                            wa = 169
                            break a
                        }
                        break
                    }
                    case 1:
                    case 3:
                    case 5: {
                        k = (ja + 24) | 0
                        na = b[k >> 0] | 0
                        oa = (na << 24) >> 24
                        f[g >> 2] = 0
                        f[_ >> 2] = 0
                        f[aa >> 2] = 0
                        if (!((na << 24) >> 24)) Sa = 0
                        else {
                            if ((na << 24) >> 24 < 0) {
                                wa = 137
                                break a
                            }
                            na = dn(oa << 2) | 0
                            f[_ >> 2] = na
                            f[g >> 2] = na
                            ma = (na + (oa << 2)) | 0
                            f[a >> 2] = ma
                            ya = oa
                            oa = na
                            while (1) {
                                f[oa >> 2] = 2147483647
                                ya = (ya + -1) | 0
                                if (!ya) break
                                else oa = (oa + 4) | 0
                            }
                            f[_ >> 2] = ma
                            Sa = b[k >> 0] | 0
                        }
                        oa = (Sa << 24) >> 24
                        f[h >> 2] = 0
                        f[ba >> 2] = 0
                        f[ca >> 2] = 0
                        if (!((Sa << 24) >> 24)) Ta = 0
                        else {
                            if ((Sa << 24) >> 24 < 0) {
                                wa = 144
                                break a
                            }
                            ya = oa << 2
                            sa = dn(ya) | 0
                            f[h >> 2] = sa
                            ra = (sa + (oa << 2)) | 0
                            f[da >> 2] = ra
                            hj(sa | 0, 0, ya | 0) | 0
                            f[ba >> 2] = ra
                            Ta = sa
                        }
                        sa = (ja + 80) | 0
                        ra = b[k >> 0] | 0
                        g: do
                            if (!(f[sa >> 2] | 0)) Ua = ra
                            else {
                                ya = 0
                                oa = ra
                                na = Ta
                                while (1) {
                                    f[e >> 2] = ya
                                    f[d >> 2] = f[e >> 2]
                                    Pb(ja, d, oa, na) | 0
                                    Fa = b[k >> 0] | 0
                                    if ((Fa << 24) >> 24 > 0) {
                                        ta = f[g >> 2] | 0
                                        la = f[h >> 2] | 0
                                        pa = (Fa << 24) >> 24
                                        Ga = 0
                                        do {
                                            ka = (ta + (Ga << 2)) | 0
                                            Ha = f[(la + (Ga << 2)) >> 2] | 0
                                            if ((f[ka >> 2] | 0) > (Ha | 0)) f[ka >> 2] = Ha
                                            Ga = (Ga + 1) | 0
                                        } while ((Ga | 0) < (pa | 0))
                                    }
                                    pa = (ya + 1) | 0
                                    if (pa >>> 0 >= (f[sa >> 2] | 0) >>> 0) {
                                        Ua = Fa
                                        break g
                                    }
                                    ya = pa
                                    oa = Fa
                                    na = f[h >> 2] | 0
                                }
                            }
                        while (0)
                        if ((Ua << 24) >> 24 > 0) {
                            sa = 0
                            ja = Ua
                            while (1) {
                                ra = ((f[g >> 2] | 0) + (sa << 2)) | 0
                                ma = f[ea >> 2] | 0
                                if ((ma | 0) == (f[fa >> 2] | 0)) {
                                    Ci(ga, ra)
                                    Va = b[k >> 0] | 0
                                } else {
                                    f[ma >> 2] = f[ra >> 2]
                                    f[ea >> 2] = ma + 4
                                    Va = ja
                                }
                                sa = (sa + 1) | 0
                                if ((sa | 0) >= (((Va << 24) >> 24) | 0)) break
                                else ja = Va
                            }
                        }
                        ja = f[h >> 2] | 0
                        if (ja | 0) {
                            sa = f[ba >> 2] | 0
                            if ((sa | 0) != (ja | 0)) f[ba >> 2] = sa + (~(((sa + -4 - ja) | 0) >>> 2) << 2)
                            br(ja)
                        }
                        ja = f[g >> 2] | 0
                        if (ja | 0) {
                            sa = f[_ >> 2] | 0
                            if ((sa | 0) != (ja | 0)) f[_ >> 2] = sa + (~(((sa + -4 - ja) | 0) >>> 2) << 2)
                            br(ja)
                        }
                        break
                    }
                    default: {
                    }
                }
                ja = (ha + 1) | 0
                sa = f[o >> 2] | 0
                if (ja >>> 0 >= (((f[p >> 2] | 0) - sa) >> 2) >>> 0) {
                    v = 1
                    wa = 169
                    break
                }
                k = f[j >> 2] | 0
                ha = ja
                ia = sa
                t = f[(k + 4) >> 2] | 0
                l = k
            }
            if ((wa | 0) == 48) mq(h)
            else if ((wa | 0) == 103) mq(Ra)
            else if ((wa | 0) == 137) mq(g)
            else if ((wa | 0) == 144) mq(h)
            else if ((wa | 0) == 169) {
                u = c
                return v | 0
            }
            return 0
        }
        function hb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                Y = 0,
                Z = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0,
                xa = 0,
                ya = 0,
                za = 0,
                Aa = 0,
                Ba = 0,
                Ca = 0,
                Da = 0,
                Ea = 0,
                Fa = 0,
                Ga = 0,
                Ha = 0,
                Ia = 0,
                Ja = 0,
                Ka = 0,
                La = 0,
                Ma = 0,
                Na = 0,
                Oa = 0,
                Pa = 0,
                Qa = 0,
                Ra = 0
            d = u
            u = (u + 32) | 0
            e = d
            g = (a + 8) | 0
            h = f[g >> 2] | 0
            f[e >> 2] = 0
            i = (e + 4) | 0
            f[i >> 2] = 0
            f[(e + 8) >> 2] = 0
            do
                if (h)
                    if (h >>> 0 > 1073741823) mq(e)
                    else {
                        j = h << 2
                        k = dn(j) | 0
                        f[e >> 2] = k
                        l = (k + (h << 2)) | 0
                        f[(e + 8) >> 2] = l
                        hj(k | 0, 0, j | 0) | 0
                        f[i >> 2] = l
                        m = l
                        n = k
                        break
                    }
                else {
                    m = 0
                    n = 0
                }
            while (0)
            k = (a + 128) | 0
            l = f[k >> 2] | 0
            j = f[l >> 2] | 0
            o = (l + 4) | 0
            if (!j) {
                p = (l + 8) | 0
                q = n
                r = m
                s = h
            } else {
                h = f[o >> 2] | 0
                if ((h | 0) != (j | 0)) f[o >> 2] = h + (~(((h + -4 - j) | 0) >>> 2) << 2)
                br(j)
                j = (l + 8) | 0
                f[j >> 2] = 0
                f[o >> 2] = 0
                f[l >> 2] = 0
                p = j
                q = f[e >> 2] | 0
                r = f[i >> 2] | 0
                s = f[g >> 2] | 0
            }
            f[l >> 2] = q
            f[o >> 2] = r
            f[p >> 2] = f[(e + 8) >> 2]
            f[e >> 2] = 0
            p = (e + 4) | 0
            f[p >> 2] = 0
            f[(e + 8) >> 2] = 0
            do
                if (s)
                    if (s >>> 0 > 1073741823) mq(e)
                    else {
                        r = s << 2
                        o = dn(r) | 0
                        f[e >> 2] = o
                        q = (o + (s << 2)) | 0
                        f[(e + 8) >> 2] = q
                        hj(o | 0, 0, r | 0) | 0
                        f[p >> 2] = q
                        t = q
                        v = o
                        break
                    }
                else {
                    t = 0
                    v = 0
                }
            while (0)
            s = (a + 140) | 0
            o = f[s >> 2] | 0
            q = f[o >> 2] | 0
            r = (o + 4) | 0
            if (!q) {
                w = (o + 8) | 0
                x = v
                y = t
            } else {
                t = f[r >> 2] | 0
                if ((t | 0) != (q | 0)) f[r >> 2] = t + (~(((t + -4 - q) | 0) >>> 2) << 2)
                br(q)
                q = (o + 8) | 0
                f[q >> 2] = 0
                f[r >> 2] = 0
                f[o >> 2] = 0
                w = q
                x = f[e >> 2] | 0
                y = f[p >> 2] | 0
            }
            f[o >> 2] = x
            f[r >> 2] = y
            f[w >> 2] = f[(e + 8) >> 2]
            w = f[b >> 2] | 0
            y = (b + 4) | 0
            r = f[y >> 2] | 0
            x = f[(y + 4) >> 2] | 0
            y = f[c >> 2] | 0
            o = (c + 4) | 0
            p = f[o >> 2] | 0
            q = f[(o + 4) >> 2] | 0
            f[e >> 2] = 0
            f[(e + 4) >> 2] = 0
            f[(e + 8) >> 2] = 0
            f[(e + 12) >> 2] = 0
            f[(e + 16) >> 2] = 0
            f[(e + 20) >> 2] = 0
            o = (e + 8) | 0
            t = (e + 4) | 0
            v = (e + 16) | 0
            l = (e + 20) | 0
            i = r
            Jc(e)
            j = f[t >> 2] | 0
            h = ((f[l >> 2] | 0) + (f[v >> 2] | 0)) | 0
            if ((f[o >> 2] | 0) == (j | 0)) z = 0
            else z = ((f[(j + ((((h >>> 0) / 113) | 0) << 2)) >> 2] | 0) + ((((h >>> 0) % 113 | 0) * 36) | 0)) | 0
            f[z >> 2] = w
            h = (z + 4) | 0
            f[h >> 2] = r
            f[(h + 4) >> 2] = x
            f[(z + 12) >> 2] = y
            h = (z + 16) | 0
            f[h >> 2] = p
            f[(h + 4) >> 2] = q
            f[(z + 24) >> 2] = 0
            f[(z + 28) >> 2] = y - w
            f[(z + 32) >> 2] = 0
            z = ((f[l >> 2] | 0) + 1) | 0
            f[l >> 2] = z
            if (z | 0) {
                w = (a + 116) | 0
                y = (a + 48) | 0
                h = (a + 44) | 0
                j = (a + 36) | 0
                m = (a + 40) | 0
                n = (a + 32) | 0
                A = (b + 8) | 0
                B = (c + 8) | 0
                C = (a + 28) | 0
                D = (a + 24) | 0
                E = (a + 16) | 0
                F = (a + 20) | 0
                G = (a + 12) | 0
                H = (a + 88) | 0
                I = (a + 84) | 0
                J = (a + 76) | 0
                K = (a + 80) | 0
                L = (a + 72) | 0
                M = (i + 4) | 0
                N = (i + 24) | 0
                O = (i + 24) | 0
                P = (p + 24) | 0
                Q = z
                while (1) {
                    z = f[v >> 2] | 0
                    R = (Q + -1) | 0
                    S = (R + z) | 0
                    T = f[t >> 2] | 0
                    U = f[(T + ((((S >>> 0) / 113) | 0) << 2)) >> 2] | 0
                    V = (S >>> 0) % 113 | 0
                    S = f[(U + ((V * 36) | 0)) >> 2] | 0
                    W = f[(U + ((V * 36) | 0) + 12) >> 2] | 0
                    Y = f[(U + ((V * 36) | 0) + 24) >> 2] | 0
                    Z = f[(U + ((V * 36) | 0) + 32) >> 2] | 0
                    f[l >> 2] = R
                    R = f[o >> 2] | 0
                    V = (R - T) >> 2
                    if (((1 - Q - z + ((V | 0) == 0 ? 0 : (((V * 113) | 0) + -1) | 0)) | 0) >>> 0 > 225) {
                        br(f[(R + -4) >> 2] | 0)
                        f[o >> 2] = (f[o >> 2] | 0) + -4
                    }
                    f[b >> 2] = S
                    f[c >> 2] = W
                    R = f[k >> 2] | 0
                    V = (((f[g >> 2] | 0) + -1) | 0) == (Y | 0) ? 0 : (Y + 1) | 0
                    Y = ((f[s >> 2] | 0) + ((Z * 12) | 0)) | 0
                    z = (W - S) | 0
                    T = ((f[a >> 2] | 0) - (f[((f[Y >> 2] | 0) + (V << 2)) >> 2] | 0)) | 0
                    a: do
                        if (T) {
                            if (z >>> 0 < 3) {
                                U = f[w >> 2] | 0
                                f[U >> 2] = V
                                $ = f[g >> 2] | 0
                                if ($ >>> 0 > 1) {
                                    aa = 1
                                    ba = $
                                    ca = V
                                    while (1) {
                                        ca = (ca | 0) == ((ba + -1) | 0) ? 0 : (ca + 1) | 0
                                        f[(U + (aa << 2)) >> 2] = ca
                                        aa = (aa + 1) | 0
                                        da = f[g >> 2] | 0
                                        if (aa >>> 0 >= da >>> 0) {
                                            ea = da
                                            break
                                        } else ba = da
                                    }
                                } else ea = $
                                if (!z) {
                                    fa = 99
                                    break
                                } else {
                                    ga = 0
                                    ha = ea
                                }
                                while (1) {
                                    ba = ((f[N >> 2] | 0) + ((X(f[M >> 2] | 0, (S + ga) | 0) | 0) << 2)) | 0
                                    if (!ha) ia = 0
                                    else {
                                        aa = 0
                                        do {
                                            ca = f[((f[w >> 2] | 0) + (aa << 2)) >> 2] | 0
                                            U = ((f[a >> 2] | 0) - (f[((f[Y >> 2] | 0) + (ca << 2)) >> 2] | 0)) | 0
                                            do
                                                if (U | 0) {
                                                    da = f[y >> 2] | 0
                                                    ja = (32 - da) | 0
                                                    ka = (32 - U) | 0
                                                    la = f[(ba + (ca << 2)) >> 2] << ka
                                                    if ((U | 0) > (ja | 0)) {
                                                        ma = la >>> ka
                                                        ka = (U - ja) | 0
                                                        f[y >> 2] = ka
                                                        ja = f[h >> 2] | (ma >>> ka)
                                                        f[h >> 2] = ja
                                                        ka = f[j >> 2] | 0
                                                        if ((ka | 0) == (f[m >> 2] | 0)) Ci(n, h)
                                                        else {
                                                            f[ka >> 2] = ja
                                                            f[j >> 2] = ka + 4
                                                        }
                                                        f[h >> 2] = ma << (32 - (f[y >> 2] | 0))
                                                        break
                                                    }
                                                    ma = f[h >> 2] | (la >>> da)
                                                    f[h >> 2] = ma
                                                    la = (da + U) | 0
                                                    f[y >> 2] = la
                                                    if ((la | 0) != 32) break
                                                    la = f[j >> 2] | 0
                                                    if ((la | 0) == (f[m >> 2] | 0)) Ci(n, h)
                                                    else {
                                                        f[la >> 2] = ma
                                                        f[j >> 2] = la + 4
                                                    }
                                                    f[h >> 2] = 0
                                                    f[y >> 2] = 0
                                                }
                                            while (0)
                                            aa = (aa + 1) | 0
                                            U = f[g >> 2] | 0
                                        } while (aa >>> 0 < U >>> 0)
                                        ia = U
                                    }
                                    ga = (ga + 1) | 0
                                    if (ga >>> 0 >= z >>> 0) {
                                        fa = 99
                                        break a
                                    } else ha = ia
                                }
                            }
                            $ = (Z + 1) | 0
                            qg((R + (($ * 12) | 0)) | 0, f[(R + ((Z * 12) | 0)) >> 2] | 0, f[(R + ((Z * 12) | 0) + 4) >> 2] | 0)
                            aa = ((f[((f[k >> 2] | 0) + (($ * 12) | 0)) >> 2] | 0) + (V << 2)) | 0
                            ba = ((f[aa >> 2] | 0) + (1 << (T + -1))) | 0
                            f[aa >> 2] = ba
                            aa = f[A >> 2] | 0
                            U = f[B >> 2] | 0
                            b: do
                                if ((W | 0) == (S | 0)) na = S
                                else {
                                    ca = f[O >> 2] | 0
                                    if (!aa) {
                                        if ((f[(ca + (V << 2)) >> 2] | 0) >>> 0 < ba >>> 0) {
                                            na = W
                                            break
                                        } else {
                                            oa = W
                                            pa = S
                                        }
                                        while (1) {
                                            la = oa
                                            do {
                                                la = (la + -1) | 0
                                                if ((pa | 0) == (la | 0)) {
                                                    na = pa
                                                    break b
                                                }
                                                ma = ((f[P >> 2] | 0) + ((X(la, U) | 0) << 2) + (V << 2)) | 0
                                            } while ((f[ma >> 2] | 0) >>> 0 >= ba >>> 0)
                                            pa = (pa + 1) | 0
                                            if ((pa | 0) == (la | 0)) {
                                                na = la
                                                break b
                                            } else oa = la
                                        }
                                    } else {
                                        qa = W
                                        ra = S
                                    }
                                    while (1) {
                                        ma = ra
                                        while (1) {
                                            sa = (ca + ((X(ma, aa) | 0) << 2)) | 0
                                            if ((f[(sa + (V << 2)) >> 2] | 0) >>> 0 >= ba >>> 0) {
                                                ta = qa
                                                break
                                            }
                                            da = (ma + 1) | 0
                                            if ((da | 0) == (qa | 0)) {
                                                na = qa
                                                break b
                                            } else ma = da
                                        }
                                        while (1) {
                                            ta = (ta + -1) | 0
                                            if ((ma | 0) == (ta | 0)) {
                                                na = ma
                                                break b
                                            }
                                            ua = ((f[P >> 2] | 0) + ((X(ta, U) | 0) << 2)) | 0
                                            if ((f[(ua + (V << 2)) >> 2] | 0) >>> 0 < ba >>> 0) {
                                                va = 0
                                                break
                                            }
                                        }
                                        do {
                                            la = (sa + (va << 2)) | 0
                                            da = (ua + (va << 2)) | 0
                                            ka = f[la >> 2] | 0
                                            f[la >> 2] = f[da >> 2]
                                            f[da >> 2] = ka
                                            va = (va + 1) | 0
                                        } while ((va | 0) != (aa | 0))
                                        ra = (ma + 1) | 0
                                        if ((ra | 0) == (ta | 0)) {
                                            na = ta
                                            break
                                        } else qa = ta
                                    }
                                }
                            while (0)
                            ba = (_(z | 0) | 0) ^ 31
                            U = (na - S) | 0
                            ca = (W - na) | 0
                            ka = U >>> 0 < ca >>> 0
                            if ((U | 0) != (ca | 0)) {
                                da = f[H >> 2] | 0
                                if (ka) f[I >> 2] = f[I >> 2] | (1 << (31 - da))
                                la = (da + 1) | 0
                                f[H >> 2] = la
                                if ((la | 0) == 32) {
                                    la = f[J >> 2] | 0
                                    if ((la | 0) == (f[K >> 2] | 0)) Ci(L, I)
                                    else {
                                        f[la >> 2] = f[I >> 2]
                                        f[J >> 2] = la + 4
                                    }
                                    f[H >> 2] = 0
                                    f[I >> 2] = 0
                                }
                            }
                            la = z >>> 1
                            do
                                if (ka) {
                                    da = f[C >> 2] | 0
                                    ja = (32 - da) | 0
                                    wa = (32 - ba) | 0
                                    xa = (la - U) << wa
                                    if ((ba | 0) > (ja | 0)) {
                                        ya = xa >>> wa
                                        wa = (ba - ja) | 0
                                        f[C >> 2] = wa
                                        ja = f[D >> 2] | (ya >>> wa)
                                        f[D >> 2] = ja
                                        wa = f[E >> 2] | 0
                                        if ((wa | 0) == (f[F >> 2] | 0)) Ci(G, D)
                                        else {
                                            f[wa >> 2] = ja
                                            f[E >> 2] = wa + 4
                                        }
                                        f[D >> 2] = ya << (32 - (f[C >> 2] | 0))
                                        break
                                    }
                                    ya = f[D >> 2] | (xa >>> da)
                                    f[D >> 2] = ya
                                    xa = (da + ba) | 0
                                    f[C >> 2] = xa
                                    if ((xa | 0) == 32) {
                                        xa = f[E >> 2] | 0
                                        if ((xa | 0) == (f[F >> 2] | 0)) Ci(G, D)
                                        else {
                                            f[xa >> 2] = ya
                                            f[E >> 2] = xa + 4
                                        }
                                        f[D >> 2] = 0
                                        f[C >> 2] = 0
                                    }
                                } else {
                                    xa = f[C >> 2] | 0
                                    ya = (32 - xa) | 0
                                    da = (32 - ba) | 0
                                    wa = (la - ca) << da
                                    if ((ba | 0) > (ya | 0)) {
                                        ja = wa >>> da
                                        da = (ba - ya) | 0
                                        f[C >> 2] = da
                                        ya = f[D >> 2] | (ja >>> da)
                                        f[D >> 2] = ya
                                        da = f[E >> 2] | 0
                                        if ((da | 0) == (f[F >> 2] | 0)) Ci(G, D)
                                        else {
                                            f[da >> 2] = ya
                                            f[E >> 2] = da + 4
                                        }
                                        f[D >> 2] = ja << (32 - (f[C >> 2] | 0))
                                        break
                                    }
                                    ja = f[D >> 2] | (wa >>> xa)
                                    f[D >> 2] = ja
                                    wa = (xa + ba) | 0
                                    f[C >> 2] = wa
                                    if ((wa | 0) == 32) {
                                        wa = f[E >> 2] | 0
                                        if ((wa | 0) == (f[F >> 2] | 0)) Ci(G, D)
                                        else {
                                            f[wa >> 2] = ja
                                            f[E >> 2] = wa + 4
                                        }
                                        f[D >> 2] = 0
                                        f[C >> 2] = 0
                                    }
                                }
                            while (0)
                            ba = f[s >> 2] | 0
                            la = f[(ba + ((Z * 12) | 0)) >> 2] | 0
                            ka = (la + (V << 2)) | 0
                            f[ka >> 2] = (f[ka >> 2] | 0) + 1
                            qg((ba + (($ * 12) | 0)) | 0, la, f[(ba + ((Z * 12) | 0) + 4) >> 2] | 0)
                            if ((na | 0) != (S | 0)) {
                                ba = f[o >> 2] | 0
                                la = f[t >> 2] | 0
                                ka = (ba - la) >> 2
                                wa = f[v >> 2] | 0
                                ja = f[l >> 2] | 0
                                if ((((ka | 0) == 0 ? 0 : (((ka * 113) | 0) + -1) | 0) | 0) == ((ja + wa) | 0)) {
                                    Jc(e)
                                    za = f[v >> 2] | 0
                                    Aa = f[l >> 2] | 0
                                    Ba = f[o >> 2] | 0
                                    Ca = f[t >> 2] | 0
                                } else {
                                    za = wa
                                    Aa = ja
                                    Ba = ba
                                    Ca = la
                                }
                                la = (Aa + za) | 0
                                if ((Ba | 0) == (Ca | 0)) Da = 0
                                else Da = ((f[(Ca + ((((la >>> 0) / 113) | 0) << 2)) >> 2] | 0) + ((((la >>> 0) % 113 | 0) * 36) | 0)) | 0
                                f[Da >> 2] = S
                                la = (Da + 4) | 0
                                f[la >> 2] = r
                                f[(la + 4) >> 2] = x
                                f[(Da + 12) >> 2] = na
                                f[(Da + 16) >> 2] = i
                                f[(Da + 20) >> 2] = aa
                                f[(Da + 24) >> 2] = V
                                f[(Da + 28) >> 2] = U
                                f[(Da + 32) >> 2] = Z
                                f[l >> 2] = (f[l >> 2] | 0) + 1
                            }
                            if ((W | 0) != (na | 0)) {
                                la = f[o >> 2] | 0
                                ba = f[t >> 2] | 0
                                ja = (la - ba) >> 2
                                wa = f[v >> 2] | 0
                                ka = f[l >> 2] | 0
                                if ((((ja | 0) == 0 ? 0 : (((ja * 113) | 0) + -1) | 0) | 0) == ((ka + wa) | 0)) {
                                    Jc(e)
                                    Ea = f[v >> 2] | 0
                                    Fa = f[l >> 2] | 0
                                    Ga = f[o >> 2] | 0
                                    Ha = f[t >> 2] | 0
                                } else {
                                    Ea = wa
                                    Fa = ka
                                    Ga = la
                                    Ha = ba
                                }
                                ba = (Fa + Ea) | 0
                                if ((Ga | 0) == (Ha | 0)) Ia = 0
                                else Ia = ((f[(Ha + ((((ba >>> 0) / 113) | 0) << 2)) >> 2] | 0) + ((((ba >>> 0) % 113 | 0) * 36) | 0)) | 0
                                f[Ia >> 2] = na
                                f[(Ia + 4) >> 2] = i
                                f[(Ia + 8) >> 2] = aa
                                f[(Ia + 12) >> 2] = W
                                ba = (Ia + 16) | 0
                                f[ba >> 2] = p
                                f[(ba + 4) >> 2] = q
                                f[(Ia + 24) >> 2] = V
                                f[(Ia + 28) >> 2] = ca
                                f[(Ia + 32) >> 2] = $
                                ba = ((f[l >> 2] | 0) + 1) | 0
                                f[l >> 2] = ba
                                Ja = ba
                            } else fa = 99
                        } else fa = 99
                    while (0)
                    if ((fa | 0) == 99) {
                        fa = 0
                        Ja = f[l >> 2] | 0
                    }
                    if (!Ja) break
                    else Q = Ja
                }
            }
            Ja = f[t >> 2] | 0
            Q = f[v >> 2] | 0
            Ia = (Ja + ((((Q >>> 0) / 113) | 0) << 2)) | 0
            q = f[o >> 2] | 0
            p = q
            i = Ja
            if ((q | 0) == (Ja | 0)) {
                Ka = 0
                La = 0
            } else {
                na = ((f[Ia >> 2] | 0) + ((((Q >>> 0) % 113 | 0) * 36) | 0)) | 0
                Ka = na
                La = na
            }
            na = Ia
            Ia = La
            c: while (1) {
                La = Ia
                do {
                    Q = La
                    if ((Ka | 0) == (Q | 0)) break c
                    La = (Q + 36) | 0
                } while (((La - (f[na >> 2] | 0)) | 0) != 4068)
                La = (na + 4) | 0
                na = La
                Ia = f[La >> 2] | 0
            }
            f[l >> 2] = 0
            l = (p - i) >> 2
            if (l >>> 0 > 2) {
                i = Ja
                do {
                    br(f[i >> 2] | 0)
                    i = ((f[t >> 2] | 0) + 4) | 0
                    f[t >> 2] = i
                    Ma = f[o >> 2] | 0
                    Na = (Ma - i) >> 2
                } while (Na >>> 0 > 2)
                Oa = Na
                Pa = i
                Qa = Ma
            } else {
                Oa = l
                Pa = Ja
                Qa = q
            }
            switch (Oa | 0) {
                case 1: {
                    Ra = 56
                    fa = 113
                    break
                }
                case 2: {
                    Ra = 113
                    fa = 113
                    break
                }
                default: {
                }
            }
            if ((fa | 0) == 113) f[v >> 2] = Ra
            if ((Pa | 0) != (Qa | 0)) {
                Ra = Pa
                do {
                    br(f[Ra >> 2] | 0)
                    Ra = (Ra + 4) | 0
                } while ((Ra | 0) != (Qa | 0))
                Qa = f[t >> 2] | 0
                t = f[o >> 2] | 0
                if ((t | 0) != (Qa | 0)) f[o >> 2] = t + (~(((t + -4 - Qa) | 0) >>> 2) << 2)
            }
            Qa = f[e >> 2] | 0
            if (!Qa) {
                u = d
                return
            }
            br(Qa)
            u = d
            return
        }
        function ib(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0
            d = u
            u = (u + 80) | 0
            e = (d + 56) | 0
            g = (d + 52) | 0
            h = (d + 48) | 0
            i = (d + 68) | 0
            j = d
            k = (d + 44) | 0
            l = (d + 40) | 0
            m = (d + 36) | 0
            n = (d + 32) | 0
            o = (d + 28) | 0
            p = (d + 24) | 0
            q = (d + 20) | 0
            r = (d + 16) | 0
            s = (d + 12) | 0
            if (!(b[(c + 288) >> 0] | 0)) {
                Ne(e, f[(c + 8) >> 2] | 0)
                t = (c + 12) | 0
                v = f[e >> 2] | 0
                f[e >> 2] = 0
                w = f[t >> 2] | 0
                f[t >> 2] = v
                if (w) {
                    ui(w)
                    br(w)
                    w = f[e >> 2] | 0
                    f[e >> 2] = 0
                    if (w | 0) {
                        ui(w)
                        br(w)
                    }
                } else f[e >> 2] = 0
            } else {
                Mg(e, f[(c + 8) >> 2] | 0)
                w = (c + 12) | 0
                v = f[e >> 2] | 0
                f[e >> 2] = 0
                t = f[w >> 2] | 0
                f[w >> 2] = v
                if (t) {
                    ui(t)
                    br(t)
                    t = f[e >> 2] | 0
                    f[e >> 2] = 0
                    if (t | 0) {
                        ui(t)
                        br(t)
                    }
                } else f[e >> 2] = 0
            }
            t = (c + 12) | 0
            v = f[t >> 2] | 0
            if (v | 0 ? ((((((f[(v + 4) >> 2] | 0) - (f[v >> 2] | 0)) >> 2) >>> 0) / 3) | 0 | 0) != (f[(v + 40) >> 2] | 0) : 0) {
                w = (c + 200) | 0
                f[(c + 264) >> 2] = c
                x = (c + 4) | 0
                Nh(((((f[(v + 28) >> 2] | 0) - (f[(v + 24) >> 2] | 0)) >> 2) - (f[(v + 44) >> 2] | 0)) | 0, f[((f[x >> 2] | 0) + 44) >> 2] | 0) | 0
                v = f[t >> 2] | 0
                Nh((((((((f[(v + 4) >> 2] | 0) - (f[v >> 2] | 0)) >> 2) >>> 0) / 3) | 0) - (f[(v + 40) >> 2] | 0)) | 0, f[((f[x >> 2] | 0) + 44) >> 2] | 0) | 0
                v = (c + 28) | 0
                y = (c + 8) | 0
                z = f[y >> 2] | 0
                A = ((((f[(z + 100) >> 2] | 0) - (f[(z + 96) >> 2] | 0)) | 0) / 12) | 0
                b[e >> 0] = 0
                Xg(v, A, e)
                A = f[t >> 2] | 0
                z = ((f[(A + 28) >> 2] | 0) - (f[(A + 24) >> 2] | 0)) >> 2
                f[e >> 2] = -1
                Sf((c + 52) | 0, z, e)
                z = (c + 40) | 0
                A = f[z >> 2] | 0
                B = (c + 44) | 0
                C = f[B >> 2] | 0
                if ((C | 0) != (A | 0)) f[B >> 2] = C + (~(((C + -4 - A) | 0) >>> 2) << 2)
                A = f[t >> 2] | 0
                C = ((f[(A + 4) >> 2] | 0) - (f[A >> 2] | 0)) >> 2
                $j(z, (C - ((C >>> 0) % 3 | 0)) | 0)
                C = (c + 84) | 0
                z = f[t >> 2] | 0
                A = ((f[(z + 28) >> 2] | 0) - (f[(z + 24) >> 2] | 0)) >> 2
                b[e >> 0] = 0
                Xg(C, A, e)
                A = (c + 96) | 0
                z = f[A >> 2] | 0
                B = (c + 100) | 0
                D = f[B >> 2] | 0
                if ((D | 0) != (z | 0)) f[B >> 2] = D + (~(((D + -4 - z) | 0) >>> 2) << 2)
                f[(c + 164) >> 2] = -1
                z = (c + 168) | 0
                f[z >> 2] = 0
                D = f[(c + 108) >> 2] | 0
                E = (c + 112) | 0
                F = f[E >> 2] | 0
                if ((F | 0) != (D | 0)) f[E >> 2] = F + ((~(((((F + -12 - D) | 0) >>> 0) / 12) | 0) * 12) | 0)
                D = (c + 132) | 0
                if (f[D >> 2] | 0) {
                    F = (c + 128) | 0
                    E = f[F >> 2] | 0
                    if (E | 0) {
                        G = E
                        do {
                            E = G
                            G = f[G >> 2] | 0
                            br(E)
                        } while ((G | 0) != 0)
                    }
                    f[F >> 2] = 0
                    F = f[(c + 124) >> 2] | 0
                    if (F | 0) {
                        G = (c + 120) | 0
                        E = 0
                        do {
                            f[((f[G >> 2] | 0) + (E << 2)) >> 2] = 0
                            E = (E + 1) | 0
                        } while ((E | 0) != (F | 0))
                    }
                    f[D >> 2] = 0
                }
                f[(c + 144) >> 2] = 0
                D = f[t >> 2] | 0
                F = ((f[(D + 28) >> 2] | 0) - (f[(D + 24) >> 2] | 0)) >> 2
                f[e >> 2] = -1
                Sf((c + 152) | 0, F, e)
                F = (c + 72) | 0
                D = f[F >> 2] | 0
                E = (c + 76) | 0
                G = f[E >> 2] | 0
                if ((G | 0) != (D | 0)) f[E >> 2] = G + (~(((G + -4 - D) | 0) >>> 2) << 2)
                D = f[t >> 2] | 0
                $j(F, (((((f[(D + 4) >> 2] | 0) - (f[D >> 2] | 0)) >> 2) >>> 0) / 3) | 0)
                f[(c + 64) >> 2] = 0
                if (!(oe(c) | 0)) {
                    D = dn(32) | 0
                    f[e >> 2] = D
                    f[(e + 8) >> 2] = -2147483616
                    f[(e + 4) >> 2] = 29
                    H = D
                    I = 13227
                    J = (H + 29) | 0
                    do {
                        b[H >> 0] = b[I >> 0] | 0
                        H = (H + 1) | 0
                        I = (I + 1) | 0
                    } while ((H | 0) < (J | 0))
                    b[(D + 29) >> 0] = 0
                    f[a >> 2] = -1
                    dj((a + 4) | 0, e)
                    if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
                    u = d
                    return
                }
                if (!(ch(c) | 0)) {
                    D = dn(48) | 0
                    f[e >> 2] = D
                    f[(e + 8) >> 2] = -2147483600
                    f[(e + 4) >> 2] = 36
                    H = D
                    I = 13257
                    J = (H + 36) | 0
                    do {
                        b[H >> 0] = b[I >> 0] | 0
                        H = (H + 1) | 0
                        I = (I + 1) | 0
                    } while ((H | 0) < (J | 0))
                    b[(D + 36) >> 0] = 0
                    f[a >> 2] = -1
                    dj((a + 4) | 0, e)
                    if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
                    u = d
                    return
                }
                D = (c + 172) | 0
                G = (c + 176) | 0
                K = (((((f[G >> 2] | 0) - (f[D >> 2] | 0)) | 0) / 136) | 0) & 255
                b[i >> 0] = K
                L = f[((f[x >> 2] | 0) + 44) >> 2] | 0
                M = (L + 16) | 0
                N = f[(M + 4) >> 2] | 0
                if (((N | 0) > 0) | (((N | 0) == 0) & ((f[M >> 2] | 0) >>> 0 > 0))) O = K
                else {
                    f[g >> 2] = f[(L + 4) >> 2]
                    f[e >> 2] = f[g >> 2]
                    ye(L, e, i, (i + 1) | 0) | 0
                    O = b[i >> 0] | 0
                }
                i = (c + 284) | 0
                f[i >> 2] = O & 255
                O = f[t >> 2] | 0
                L = ((f[(O + 4) >> 2] | 0) - (f[O >> 2] | 0)) | 0
                O = L >> 2
                Ti(w)
                f[j >> 2] = 0
                K = (j + 4) | 0
                f[K >> 2] = 0
                f[(j + 8) >> 2] = 0
                a: do
                    if ((L | 0) > 0) {
                        M = (c + 104) | 0
                        N = (j + 8) | 0
                        P = 0
                        b: while (1) {
                            Q = ((P >>> 0) / 3) | 0
                            R = Q >>> 5
                            S = 1 << (Q & 31)
                            if (((f[((f[v >> 2] | 0) + (R << 2)) >> 2] & S) | 0) == 0 ? ((T = f[t >> 2] | 0), (f[k >> 2] = Q), (f[e >> 2] = f[k >> 2]), !(Rj(T, e) | 0)) : 0) {
                                f[g >> 2] = 0
                                f[l >> 2] = Q
                                f[e >> 2] = f[l >> 2]
                                Q = gg(c, e, g) | 0
                                Vi(w, Q)
                                T = f[g >> 2] | 0
                                U = (T | 0) == -1
                                do
                                    if (Q) {
                                        do
                                            if (U) {
                                                V = -1
                                                W = -1
                                                X = -1
                                            } else {
                                                Y = f[f[t >> 2] >> 2] | 0
                                                Z = f[(Y + (T << 2)) >> 2] | 0
                                                _ = (T + 1) | 0
                                                $ = ((_ >>> 0) % 3 | 0 | 0) == 0 ? (T + -2) | 0 : _
                                                if (($ | 0) == -1) aa = -1
                                                else aa = f[(Y + ($ << 2)) >> 2] | 0
                                                $ = ((((T >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + T) | 0
                                                if (($ | 0) == -1) {
                                                    V = -1
                                                    W = aa
                                                    X = Z
                                                    break
                                                }
                                                V = f[(Y + ($ << 2)) >> 2] | 0
                                                W = aa
                                                X = Z
                                            }
                                        while (0)
                                        Z = f[C >> 2] | 0
                                        $ = (Z + ((X >>> 5) << 2)) | 0
                                        f[$ >> 2] = f[$ >> 2] | (1 << (X & 31))
                                        $ = (Z + ((W >>> 5) << 2)) | 0
                                        f[$ >> 2] = f[$ >> 2] | (1 << (W & 31))
                                        $ = (Z + ((V >>> 5) << 2)) | 0
                                        f[$ >> 2] = f[$ >> 2] | (1 << (V & 31))
                                        f[e >> 2] = 1
                                        $ = f[B >> 2] | 0
                                        if ($ >>> 0 < (f[M >> 2] | 0) >>> 0) {
                                            f[$ >> 2] = 1
                                            f[B >> 2] = $ + 4
                                        } else Ci(A, e)
                                        $ = ((f[v >> 2] | 0) + (R << 2)) | 0
                                        f[$ >> 2] = f[$ >> 2] | S
                                        $ = (T + 1) | 0
                                        if (U) ba = -1
                                        else ba = (($ >>> 0) % 3 | 0 | 0) == 0 ? (T + -2) | 0 : $
                                        f[e >> 2] = ba
                                        Z = f[K >> 2] | 0
                                        if (Z >>> 0 < (f[N >> 2] | 0) >>> 0) {
                                            f[Z >> 2] = ba
                                            f[K >> 2] = Z + 4
                                        } else Ci(j, e)
                                        if (U) break
                                        Z = (($ >>> 0) % 3 | 0 | 0) == 0 ? (T + -2) | 0 : $
                                        if ((Z | 0) == -1) break
                                        $ = f[((f[((f[t >> 2] | 0) + 12) >> 2] | 0) + (Z << 2)) >> 2] | 0
                                        Z = ($ | 0) == -1
                                        Y = Z ? -1 : (($ >>> 0) / 3) | 0
                                        if (Z) break
                                        if ((f[((f[v >> 2] | 0) + ((Y >>> 5) << 2)) >> 2] & (1 << (Y & 31))) | 0) break
                                        f[m >> 2] = $
                                        f[e >> 2] = f[m >> 2]
                                        if (!(hc(c, e) | 0)) {
                                            ca = 65
                                            break b
                                        }
                                    } else {
                                        $ = (T + 1) | 0
                                        if (U) da = -1
                                        else da = (($ >>> 0) % 3 | 0 | 0) == 0 ? (T + -2) | 0 : $
                                        f[n >> 2] = da
                                        f[e >> 2] = f[n >> 2]
                                        Ce(c, e, 1) | 0
                                        f[o >> 2] = f[g >> 2]
                                        f[e >> 2] = f[o >> 2]
                                        if (!(hc(c, e) | 0)) {
                                            ca = 71
                                            break b
                                        }
                                    }
                                while (0)
                            }
                            P = (P + 1) | 0
                            if ((P | 0) >= (O | 0)) {
                                ca = 77
                                break a
                            }
                        }
                        if ((ca | 0) == 65) {
                            f[e >> 2] = 0
                            f[(e + 4) >> 2] = 0
                            f[(e + 8) >> 2] = 0
                            P = dn(48) | 0
                            f[e >> 2] = P
                            f[(e + 8) >> 2] = -2147483600
                            f[(e + 4) >> 2] = 32
                            H = P
                            I = 13294
                            J = (H + 32) | 0
                            do {
                                b[H >> 0] = b[I >> 0] | 0
                                H = (H + 1) | 0
                                I = (I + 1) | 0
                            } while ((H | 0) < (J | 0))
                            b[(P + 32) >> 0] = 0
                            f[a >> 2] = -1
                            dj((a + 4) | 0, e)
                            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
                        } else if ((ca | 0) == 71) {
                            f[e >> 2] = 0
                            f[(e + 4) >> 2] = 0
                            f[(e + 8) >> 2] = 0
                            N = dn(48) | 0
                            f[e >> 2] = N
                            f[(e + 8) >> 2] = -2147483600
                            f[(e + 4) >> 2] = 32
                            H = N
                            I = 13294
                            J = (H + 32) | 0
                            do {
                                b[H >> 0] = b[I >> 0] | 0
                                H = (H + 1) | 0
                                I = (I + 1) | 0
                            } while ((H | 0) < (J | 0))
                            b[(N + 32) >> 0] = 0
                            f[a >> 2] = -1
                            dj((a + 4) | 0, e)
                            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
                        }
                    } else ca = 77
                while (0)
                do
                    if ((ca | 0) == 77) {
                        O = f[F >> 2] | 0
                        o = f[E >> 2] | 0
                        n = o
                        if ((O | 0) != (o | 0) ? ((da = (o + -4) | 0), O >>> 0 < da >>> 0) : 0) {
                            o = O
                            O = da
                            do {
                                da = f[o >> 2] | 0
                                f[o >> 2] = f[O >> 2]
                                f[O >> 2] = da
                                o = (o + 4) | 0
                                O = (O + -4) | 0
                            } while (o >>> 0 < O >>> 0)
                        }
                        f[p >> 2] = n
                        f[q >> 2] = f[j >> 2]
                        f[r >> 2] = f[K >> 2]
                        f[h >> 2] = f[p >> 2]
                        f[g >> 2] = f[q >> 2]
                        f[e >> 2] = f[r >> 2]
                        Md(F, h, g, e) | 0
                        if (
                            (f[G >> 2] | 0) != (f[D >> 2] | 0)
                                ? ((O = f[y >> 2] | 0),
                                  (o = ((((f[(O + 100) >> 2] | 0) - (f[(O + 96) >> 2] | 0)) | 0) / 12) | 0),
                                  (b[e >> 0] = 0),
                                  Xg(v, o, e),
                                  (o = f[F >> 2] | 0),
                                  (O = f[E >> 2] | 0),
                                  (o | 0) != (O | 0))
                                : 0
                        ) {
                            N = o
                            do {
                                f[s >> 2] = f[N >> 2]
                                f[e >> 2] = f[s >> 2]
                                ue(c, e) | 0
                                N = (N + 4) | 0
                            } while ((N | 0) != (O | 0))
                        }
                        _g(w)
                        O = (c + 232) | 0
                        fd(w, O)
                        N = (c + 280) | 0
                        n = f[N >> 2] | 0
                        if ((n | 0 ? (f[i >> 2] | 0) > 0 : 0) ? (fd(n, O), (f[i >> 2] | 0) > 1) : 0) {
                            n = 1
                            do {
                                fd(((f[N >> 2] | 0) + (n << 5)) | 0, O)
                                n = (n + 1) | 0
                            } while ((n | 0) < (f[i >> 2] | 0))
                        }
                        Nh(((f[(c + 272) >> 2] | 0) - (f[(c + 268) >> 2] | 0)) >> 2, f[((f[x >> 2] | 0) + 44) >> 2] | 0) | 0
                        Nh(f[z >> 2] | 0, f[((f[x >> 2] | 0) + 44) >> 2] | 0) | 0
                        if (Jg(c) | 0) {
                            n = f[((f[x >> 2] | 0) + 44) >> 2] | 0
                            N = f[O >> 2] | 0
                            o = (n + 16) | 0
                            da = f[(o + 4) >> 2] | 0
                            if (!(((da | 0) > 0) | (((da | 0) == 0) & ((f[o >> 2] | 0) >>> 0 > 0)))) {
                                o = ((f[(c + 236) >> 2] | 0) - N) | 0
                                f[g >> 2] = f[(n + 4) >> 2]
                                f[e >> 2] = f[g >> 2]
                                ye(n, e, N, (N + o) | 0) | 0
                            }
                            f[a >> 2] = 0
                            f[(a + 4) >> 2] = 0
                            f[(a + 8) >> 2] = 0
                            f[(a + 12) >> 2] = 0
                            break
                        } else {
                            f[e >> 2] = 0
                            f[(e + 4) >> 2] = 0
                            f[(e + 8) >> 2] = 0
                            o = dn(32) | 0
                            f[e >> 2] = o
                            f[(e + 8) >> 2] = -2147483616
                            f[(e + 4) >> 2] = 28
                            H = o
                            I = 13327
                            J = (H + 28) | 0
                            do {
                                b[H >> 0] = b[I >> 0] | 0
                                H = (H + 1) | 0
                                I = (I + 1) | 0
                            } while ((H | 0) < (J | 0))
                            b[(o + 28) >> 0] = 0
                            f[a >> 2] = -1
                            dj((a + 4) | 0, e)
                            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
                            break
                        }
                    }
                while (0)
                g = f[j >> 2] | 0
                if (g | 0) {
                    j = f[K >> 2] | 0
                    if ((j | 0) != (g | 0)) f[K >> 2] = j + (~(((j + -4 - g) | 0) >>> 2) << 2)
                    br(g)
                }
                u = d
                return
            }
            g = dn(32) | 0
            f[e >> 2] = g
            f[(e + 8) >> 2] = -2147483616
            f[(e + 4) >> 2] = 29
            H = g
            I = 13197
            J = (H + 29) | 0
            do {
                b[H >> 0] = b[I >> 0] | 0
                H = (H + 1) | 0
                I = (I + 1) | 0
            } while ((H | 0) < (J | 0))
            b[(g + 29) >> 0] = 0
            f[a >> 2] = -1
            dj((a + 4) | 0, e)
            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
            u = d
            return
        }
        function jb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                Y = 0,
                Z = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0,
                xa = 0,
                ya = 0,
                za = 0,
                Aa = 0,
                Ba = 0,
                Ca = 0,
                Da = 0,
                Ea = 0,
                Fa = 0,
                Ga = 0,
                Ha = 0,
                Ia = 0,
                Ja = 0,
                Ka = 0,
                La = 0,
                Ma = 0,
                Na = 0
            d = u
            u = (u + 48) | 0
            e = (d + 36) | 0
            g = (d + 24) | 0
            h = d
            i = (a + 8) | 0
            j = f[i >> 2] | 0
            f[e >> 2] = 0
            k = (e + 4) | 0
            f[k >> 2] = 0
            f[(e + 8) >> 2] = 0
            do
                if (j)
                    if (j >>> 0 > 1073741823) mq(e)
                    else {
                        l = j << 2
                        m = dn(l) | 0
                        f[e >> 2] = m
                        n = (m + (j << 2)) | 0
                        f[(e + 8) >> 2] = n
                        hj(m | 0, 0, l | 0) | 0
                        f[k >> 2] = n
                        o = n
                        p = m
                        break
                    }
                else {
                    o = 0
                    p = 0
                }
            while (0)
            m = (a + 1164) | 0
            n = f[m >> 2] | 0
            l = f[n >> 2] | 0
            q = (n + 4) | 0
            if (!l) {
                r = (n + 8) | 0
                s = p
                t = o
                v = j
            } else {
                j = f[q >> 2] | 0
                if ((j | 0) != (l | 0)) f[q >> 2] = j + (~(((j + -4 - l) | 0) >>> 2) << 2)
                br(l)
                l = (n + 8) | 0
                f[l >> 2] = 0
                f[q >> 2] = 0
                f[n >> 2] = 0
                r = l
                s = f[e >> 2] | 0
                t = f[k >> 2] | 0
                v = f[i >> 2] | 0
            }
            f[n >> 2] = s
            f[q >> 2] = t
            f[r >> 2] = f[(e + 8) >> 2]
            f[e >> 2] = 0
            r = (e + 4) | 0
            f[r >> 2] = 0
            f[(e + 8) >> 2] = 0
            do
                if (v)
                    if (v >>> 0 > 1073741823) mq(e)
                    else {
                        t = v << 2
                        q = dn(t) | 0
                        f[e >> 2] = q
                        s = (q + (v << 2)) | 0
                        f[(e + 8) >> 2] = s
                        hj(q | 0, 0, t | 0) | 0
                        f[r >> 2] = s
                        w = s
                        x = q
                        break
                    }
                else {
                    w = 0
                    x = 0
                }
            while (0)
            v = (a + 1176) | 0
            q = f[v >> 2] | 0
            s = f[q >> 2] | 0
            t = (q + 4) | 0
            if (!s) {
                y = (q + 8) | 0
                z = x
                A = w
            } else {
                w = f[t >> 2] | 0
                if ((w | 0) != (s | 0)) f[t >> 2] = w + (~(((w + -4 - s) | 0) >>> 2) << 2)
                br(s)
                s = (q + 8) | 0
                f[s >> 2] = 0
                f[t >> 2] = 0
                f[q >> 2] = 0
                y = s
                z = f[e >> 2] | 0
                A = f[r >> 2] | 0
            }
            f[q >> 2] = z
            f[t >> 2] = A
            f[y >> 2] = f[(e + 8) >> 2]
            y = f[b >> 2] | 0
            A = (b + 4) | 0
            t = f[A >> 2] | 0
            z = f[(A + 4) >> 2] | 0
            A = f[c >> 2] | 0
            q = (c + 4) | 0
            r = f[q >> 2] | 0
            s = f[(q + 4) >> 2] | 0
            f[h >> 2] = 0
            f[(h + 4) >> 2] = 0
            f[(h + 8) >> 2] = 0
            f[(h + 12) >> 2] = 0
            f[(h + 16) >> 2] = 0
            f[(h + 20) >> 2] = 0
            q = (h + 8) | 0
            w = (h + 4) | 0
            x = (h + 16) | 0
            n = (h + 20) | 0
            k = t
            Jc(h)
            l = f[w >> 2] | 0
            j = ((f[n >> 2] | 0) + (f[x >> 2] | 0)) | 0
            if ((f[q >> 2] | 0) == (l | 0)) B = 0
            else B = ((f[(l + ((((j >>> 0) / 113) | 0) << 2)) >> 2] | 0) + ((((j >>> 0) % 113 | 0) * 36) | 0)) | 0
            f[B >> 2] = y
            j = (B + 4) | 0
            f[j >> 2] = t
            f[(j + 4) >> 2] = z
            f[(B + 12) >> 2] = A
            j = (B + 16) | 0
            f[j >> 2] = r
            f[(j + 4) >> 2] = s
            f[(B + 24) >> 2] = 0
            f[(B + 28) >> 2] = A - y
            f[(B + 32) >> 2] = 0
            B = ((f[n >> 2] | 0) + 1) | 0
            f[n >> 2] = B
            if (B | 0) {
                y = (a + 1152) | 0
                A = (a + 1084) | 0
                j = (a + 1080) | 0
                l = (a + 1072) | 0
                o = (a + 1076) | 0
                p = (a + 1068) | 0
                C = (b + 8) | 0
                D = (c + 8) | 0
                E = (a + 1124) | 0
                F = (a + 1120) | 0
                G = (a + 1112) | 0
                H = (a + 1116) | 0
                I = (a + 1108) | 0
                J = (k + 4) | 0
                K = (k + 24) | 0
                L = (k + 24) | 0
                M = (r + 24) | 0
                N = B
                while (1) {
                    B = f[x >> 2] | 0
                    O = (N + -1) | 0
                    P = (O + B) | 0
                    Q = f[w >> 2] | 0
                    R = f[(Q + ((((P >>> 0) / 113) | 0) << 2)) >> 2] | 0
                    S = (P >>> 0) % 113 | 0
                    P = f[(R + ((S * 36) | 0)) >> 2] | 0
                    T = f[(R + ((S * 36) | 0) + 12) >> 2] | 0
                    U = f[(R + ((S * 36) | 0) + 24) >> 2] | 0
                    V = f[(R + ((S * 36) | 0) + 32) >> 2] | 0
                    f[n >> 2] = O
                    O = f[q >> 2] | 0
                    S = (O - Q) >> 2
                    if (((1 - N - B + ((S | 0) == 0 ? 0 : (((S * 113) | 0) + -1) | 0)) | 0) >>> 0 > 225) {
                        br(f[(O + -4) >> 2] | 0)
                        f[q >> 2] = (f[q >> 2] | 0) + -4
                    }
                    f[b >> 2] = P
                    f[c >> 2] = T
                    O = f[m >> 2] | 0
                    S = (O + ((V * 12) | 0)) | 0
                    B = ((f[v >> 2] | 0) + ((V * 12) | 0)) | 0
                    f[g >> 2] = f[b >> 2]
                    f[(g + 4) >> 2] = f[(b + 4) >> 2]
                    f[(g + 8) >> 2] = f[(b + 8) >> 2]
                    f[e >> 2] = f[c >> 2]
                    f[(e + 4) >> 2] = f[(c + 4) >> 2]
                    f[(e + 8) >> 2] = f[(c + 8) >> 2]
                    Q = Gd(a, g, e, S, B, U) | 0
                    U = (T - P) | 0
                    R = ((f[a >> 2] | 0) - (f[((f[B >> 2] | 0) + (Q << 2)) >> 2] | 0)) | 0
                    a: do
                        if (R) {
                            if (U >>> 0 < 3) {
                                W = f[y >> 2] | 0
                                f[W >> 2] = Q
                                Y = f[i >> 2] | 0
                                if (Y >>> 0 > 1) {
                                    Z = 1
                                    $ = Y
                                    aa = Q
                                    while (1) {
                                        aa = (aa | 0) == (($ + -1) | 0) ? 0 : (aa + 1) | 0
                                        f[(W + (Z << 2)) >> 2] = aa
                                        Z = (Z + 1) | 0
                                        ba = f[i >> 2] | 0
                                        if (Z >>> 0 >= ba >>> 0) {
                                            ca = ba
                                            break
                                        } else $ = ba
                                    }
                                } else ca = Y
                                if (!U) {
                                    da = 87
                                    break
                                } else {
                                    ea = 0
                                    fa = ca
                                }
                                while (1) {
                                    $ = ((f[K >> 2] | 0) + ((X(f[J >> 2] | 0, (P + ea) | 0) | 0) << 2)) | 0
                                    if (!fa) ga = 0
                                    else {
                                        Z = 0
                                        do {
                                            aa = f[((f[y >> 2] | 0) + (Z << 2)) >> 2] | 0
                                            W = ((f[a >> 2] | 0) - (f[((f[B >> 2] | 0) + (aa << 2)) >> 2] | 0)) | 0
                                            do
                                                if (W | 0) {
                                                    ba = f[A >> 2] | 0
                                                    ha = (32 - ba) | 0
                                                    ia = (32 - W) | 0
                                                    ja = f[($ + (aa << 2)) >> 2] << ia
                                                    if ((W | 0) > (ha | 0)) {
                                                        ka = ja >>> ia
                                                        ia = (W - ha) | 0
                                                        f[A >> 2] = ia
                                                        ha = f[j >> 2] | (ka >>> ia)
                                                        f[j >> 2] = ha
                                                        ia = f[l >> 2] | 0
                                                        if ((ia | 0) == (f[o >> 2] | 0)) Ci(p, j)
                                                        else {
                                                            f[ia >> 2] = ha
                                                            f[l >> 2] = ia + 4
                                                        }
                                                        f[j >> 2] = ka << (32 - (f[A >> 2] | 0))
                                                        break
                                                    }
                                                    ka = f[j >> 2] | (ja >>> ba)
                                                    f[j >> 2] = ka
                                                    ja = (ba + W) | 0
                                                    f[A >> 2] = ja
                                                    if ((ja | 0) != 32) break
                                                    ja = f[l >> 2] | 0
                                                    if ((ja | 0) == (f[o >> 2] | 0)) Ci(p, j)
                                                    else {
                                                        f[ja >> 2] = ka
                                                        f[l >> 2] = ja + 4
                                                    }
                                                    f[j >> 2] = 0
                                                    f[A >> 2] = 0
                                                }
                                            while (0)
                                            Z = (Z + 1) | 0
                                            W = f[i >> 2] | 0
                                        } while (Z >>> 0 < W >>> 0)
                                        ga = W
                                    }
                                    ea = (ea + 1) | 0
                                    if (ea >>> 0 >= U >>> 0) {
                                        da = 87
                                        break a
                                    } else fa = ga
                                }
                            }
                            Y = (V + 1) | 0
                            Z = f[m >> 2] | 0
                            $ = (Z + ((Y * 12) | 0)) | 0
                            if (($ | 0) == (S | 0)) la = Z
                            else {
                                qg($, f[S >> 2] | 0, f[(O + ((V * 12) | 0) + 4) >> 2] | 0)
                                la = f[m >> 2] | 0
                            }
                            $ = ((f[(la + ((Y * 12) | 0)) >> 2] | 0) + (Q << 2)) | 0
                            Z = ((f[$ >> 2] | 0) + (1 << (R + -1))) | 0
                            f[$ >> 2] = Z
                            $ = f[C >> 2] | 0
                            W = f[D >> 2] | 0
                            b: do
                                if ((T | 0) == (P | 0)) ma = P
                                else {
                                    aa = f[L >> 2] | 0
                                    if (!$) {
                                        if ((f[(aa + (Q << 2)) >> 2] | 0) >>> 0 < Z >>> 0) {
                                            ma = T
                                            break
                                        } else {
                                            na = T
                                            oa = P
                                        }
                                        while (1) {
                                            ja = na
                                            do {
                                                ja = (ja + -1) | 0
                                                if ((oa | 0) == (ja | 0)) {
                                                    ma = oa
                                                    break b
                                                }
                                                ka = ((f[M >> 2] | 0) + ((X(ja, W) | 0) << 2) + (Q << 2)) | 0
                                            } while ((f[ka >> 2] | 0) >>> 0 >= Z >>> 0)
                                            oa = (oa + 1) | 0
                                            if ((oa | 0) == (ja | 0)) {
                                                ma = ja
                                                break b
                                            } else na = ja
                                        }
                                    } else {
                                        pa = T
                                        qa = P
                                    }
                                    while (1) {
                                        ka = qa
                                        while (1) {
                                            ra = (aa + ((X(ka, $) | 0) << 2)) | 0
                                            if ((f[(ra + (Q << 2)) >> 2] | 0) >>> 0 >= Z >>> 0) {
                                                sa = pa
                                                break
                                            }
                                            ba = (ka + 1) | 0
                                            if ((ba | 0) == (pa | 0)) {
                                                ma = pa
                                                break b
                                            } else ka = ba
                                        }
                                        while (1) {
                                            sa = (sa + -1) | 0
                                            if ((ka | 0) == (sa | 0)) {
                                                ma = ka
                                                break b
                                            }
                                            ta = ((f[M >> 2] | 0) + ((X(sa, W) | 0) << 2)) | 0
                                            if ((f[(ta + (Q << 2)) >> 2] | 0) >>> 0 < Z >>> 0) {
                                                ua = 0
                                                break
                                            }
                                        }
                                        do {
                                            ja = (ra + (ua << 2)) | 0
                                            ba = (ta + (ua << 2)) | 0
                                            ia = f[ja >> 2] | 0
                                            f[ja >> 2] = f[ba >> 2]
                                            f[ba >> 2] = ia
                                            ua = (ua + 1) | 0
                                        } while ((ua | 0) != ($ | 0))
                                        qa = (ka + 1) | 0
                                        if ((qa | 0) == (sa | 0)) {
                                            ma = sa
                                            break
                                        } else pa = sa
                                    }
                                }
                            while (0)
                            Z = (_(U | 0) | 0) ^ 31
                            W = (ma - P) | 0
                            aa = (T - ma) | 0
                            ia = W >>> 0 < aa >>> 0
                            if ((W | 0) != (aa | 0)) {
                                ba = f[E >> 2] | 0
                                if (ia) f[F >> 2] = f[F >> 2] | (1 << (31 - ba))
                                ja = (ba + 1) | 0
                                f[E >> 2] = ja
                                if ((ja | 0) == 32) {
                                    ja = f[G >> 2] | 0
                                    if ((ja | 0) == (f[H >> 2] | 0)) Ci(I, F)
                                    else {
                                        f[ja >> 2] = f[F >> 2]
                                        f[G >> 2] = ja + 4
                                    }
                                    f[E >> 2] = 0
                                    f[F >> 2] = 0
                                }
                            }
                            ja = U >>> 1
                            if (ia) {
                                ia = (ja - W) | 0
                                if (Z | 0) {
                                    ba = 0
                                    ha = 1 << (Z + -1)
                                    while (1) {
                                        Vi((a + 12 + (ba << 5)) | 0, ((ha & ia) | 0) != 0)
                                        ba = (ba + 1) | 0
                                        if ((ba | 0) == (Z | 0)) break
                                        else ha = ha >>> 1
                                    }
                                }
                            } else {
                                ha = (ja - aa) | 0
                                if (Z | 0) {
                                    ba = 0
                                    ia = 1 << (Z + -1)
                                    while (1) {
                                        Vi((a + 12 + (ba << 5)) | 0, ((ia & ha) | 0) != 0)
                                        ba = (ba + 1) | 0
                                        if ((ba | 0) == (Z | 0)) break
                                        else ia = ia >>> 1
                                    }
                                }
                            }
                            ia = f[v >> 2] | 0
                            Z = f[(ia + ((V * 12) | 0)) >> 2] | 0
                            ba = (Z + (Q << 2)) | 0
                            f[ba >> 2] = (f[ba >> 2] | 0) + 1
                            qg((ia + ((Y * 12) | 0)) | 0, Z, f[(ia + ((V * 12) | 0) + 4) >> 2] | 0)
                            if ((ma | 0) != (P | 0)) {
                                ia = f[q >> 2] | 0
                                Z = f[w >> 2] | 0
                                ba = (ia - Z) >> 2
                                ha = f[x >> 2] | 0
                                ja = f[n >> 2] | 0
                                if ((((ba | 0) == 0 ? 0 : (((ba * 113) | 0) + -1) | 0) | 0) == ((ja + ha) | 0)) {
                                    Jc(h)
                                    va = f[x >> 2] | 0
                                    wa = f[n >> 2] | 0
                                    xa = f[q >> 2] | 0
                                    ya = f[w >> 2] | 0
                                } else {
                                    va = ha
                                    wa = ja
                                    xa = ia
                                    ya = Z
                                }
                                Z = (wa + va) | 0
                                if ((xa | 0) == (ya | 0)) za = 0
                                else za = ((f[(ya + ((((Z >>> 0) / 113) | 0) << 2)) >> 2] | 0) + ((((Z >>> 0) % 113 | 0) * 36) | 0)) | 0
                                f[za >> 2] = P
                                Z = (za + 4) | 0
                                f[Z >> 2] = t
                                f[(Z + 4) >> 2] = z
                                f[(za + 12) >> 2] = ma
                                f[(za + 16) >> 2] = k
                                f[(za + 20) >> 2] = $
                                f[(za + 24) >> 2] = Q
                                f[(za + 28) >> 2] = W
                                f[(za + 32) >> 2] = V
                                f[n >> 2] = (f[n >> 2] | 0) + 1
                            }
                            if ((T | 0) != (ma | 0)) {
                                Z = f[q >> 2] | 0
                                ia = f[w >> 2] | 0
                                ja = (Z - ia) >> 2
                                ha = f[x >> 2] | 0
                                ba = f[n >> 2] | 0
                                if ((((ja | 0) == 0 ? 0 : (((ja * 113) | 0) + -1) | 0) | 0) == ((ba + ha) | 0)) {
                                    Jc(h)
                                    Aa = f[x >> 2] | 0
                                    Ba = f[n >> 2] | 0
                                    Ca = f[q >> 2] | 0
                                    Da = f[w >> 2] | 0
                                } else {
                                    Aa = ha
                                    Ba = ba
                                    Ca = Z
                                    Da = ia
                                }
                                ia = (Ba + Aa) | 0
                                if ((Ca | 0) == (Da | 0)) Ea = 0
                                else Ea = ((f[(Da + ((((ia >>> 0) / 113) | 0) << 2)) >> 2] | 0) + ((((ia >>> 0) % 113 | 0) * 36) | 0)) | 0
                                f[Ea >> 2] = ma
                                f[(Ea + 4) >> 2] = k
                                f[(Ea + 8) >> 2] = $
                                f[(Ea + 12) >> 2] = T
                                ia = (Ea + 16) | 0
                                f[ia >> 2] = r
                                f[(ia + 4) >> 2] = s
                                f[(Ea + 24) >> 2] = Q
                                f[(Ea + 28) >> 2] = aa
                                f[(Ea + 32) >> 2] = Y
                                ia = ((f[n >> 2] | 0) + 1) | 0
                                f[n >> 2] = ia
                                Fa = ia
                            } else da = 87
                        } else da = 87
                    while (0)
                    if ((da | 0) == 87) {
                        da = 0
                        Fa = f[n >> 2] | 0
                    }
                    if (!Fa) break
                    else N = Fa
                }
            }
            Fa = f[w >> 2] | 0
            N = f[x >> 2] | 0
            Ea = (Fa + ((((N >>> 0) / 113) | 0) << 2)) | 0
            s = f[q >> 2] | 0
            r = s
            k = Fa
            if ((s | 0) == (Fa | 0)) {
                Ga = 0
                Ha = 0
            } else {
                ma = ((f[Ea >> 2] | 0) + ((((N >>> 0) % 113 | 0) * 36) | 0)) | 0
                Ga = ma
                Ha = ma
            }
            ma = Ea
            Ea = Ha
            c: while (1) {
                Ha = Ea
                do {
                    N = Ha
                    if ((Ga | 0) == (N | 0)) break c
                    Ha = (N + 36) | 0
                } while (((Ha - (f[ma >> 2] | 0)) | 0) != 4068)
                Ha = (ma + 4) | 0
                ma = Ha
                Ea = f[Ha >> 2] | 0
            }
            f[n >> 2] = 0
            n = (r - k) >> 2
            if (n >>> 0 > 2) {
                k = Fa
                do {
                    br(f[k >> 2] | 0)
                    k = ((f[w >> 2] | 0) + 4) | 0
                    f[w >> 2] = k
                    Ia = f[q >> 2] | 0
                    Ja = (Ia - k) >> 2
                } while (Ja >>> 0 > 2)
                Ka = Ja
                La = k
                Ma = Ia
            } else {
                Ka = n
                La = Fa
                Ma = s
            }
            switch (Ka | 0) {
                case 1: {
                    Na = 56
                    da = 101
                    break
                }
                case 2: {
                    Na = 113
                    da = 101
                    break
                }
                default: {
                }
            }
            if ((da | 0) == 101) f[x >> 2] = Na
            if ((La | 0) != (Ma | 0)) {
                Na = La
                do {
                    br(f[Na >> 2] | 0)
                    Na = (Na + 4) | 0
                } while ((Na | 0) != (Ma | 0))
                Ma = f[w >> 2] | 0
                w = f[q >> 2] | 0
                if ((w | 0) != (Ma | 0)) f[q >> 2] = w + (~(((w + -4 - Ma) | 0) >>> 2) << 2)
            }
            Ma = f[h >> 2] | 0
            if (!Ma) {
                u = d
                return
            }
            br(Ma)
            u = d
            return
        }
        function kb(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 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,
                Y = 0,
                Z = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0,
                xa = 0,
                ya = 0,
                za = 0,
                Aa = 0,
                Ba = 0,
                Ca = 0,
                Da = 0,
                Ea = 0,
                Fa = 0,
                Ga = 0,
                Ha = 0,
                Ia = 0,
                Ja = 0,
                Ka = 0,
                La = 0
            d = u
            u = (u + 1424) | 0
            e = (d + 1408) | 0
            g = (d + 1396) | 0
            h = (d + 1420) | 0
            i = (d + 1200) | 0
            j = (d + 12) | 0
            k = d
            l = (d + 1384) | 0
            m = (d + 1372) | 0
            n = (d + 1360) | 0
            o = (d + 1348) | 0
            p = (d + 1336) | 0
            q = (d + 1324) | 0
            r = (d + 1312) | 0
            s = (d + 1300) | 0
            t = (d + 1288) | 0
            v = (d + 1276) | 0
            w = (d + 1264) | 0
            x = (d + 1252) | 0
            y = (d + 1240) | 0
            z = (d + 1228) | 0
            A = (a + 28) | 0
            B = (10 - (Yh(f[((f[A >> 2] | 0) + 48) >> 2] | 0) | 0)) | 0
            C = (B | 0) < 6 ? B : 6
            b[h >> 0] = C
            if (((C & 255) | 0) == 6 ? (f[(a + 72) >> 2] | 0) > 15 : 0) b[h >> 0] = 5
            C = (c + 16) | 0
            B = f[(C + 4) >> 2] | 0
            if (!(((B | 0) > 0) | (((B | 0) == 0) & ((f[C >> 2] | 0) >>> 0 > 0)))) {
                f[g >> 2] = f[(c + 4) >> 2]
                f[e >> 2] = f[g >> 2]
                ye(c, e, h, (h + 1) | 0) | 0
            }
            C = f[A >> 2] | 0
            B = f[((f[(C + 4) >> 2] | 0) + 80) >> 2] | 0
            D = (a + 72) | 0
            E = f[D >> 2] | 0
            f[i >> 2] = B
            F = (i + 4) | 0
            f[F >> 2] = E
            f[(i + 8) >> 2] = E << 2
            G = (i + 12) | 0
            H = X(E, B) | 0
            f[G >> 2] = 0
            J = (i + 16) | 0
            f[J >> 2] = 0
            f[(i + 20) >> 2] = 0
            do
                if (H)
                    if (H >>> 0 > 1073741823) mq(G)
                    else {
                        K = H << 2
                        L = dn(K) | 0
                        f[G >> 2] = L
                        M = (L + (H << 2)) | 0
                        f[(i + 20) >> 2] = M
                        hj(L | 0, 0, K | 0) | 0
                        f[J >> 2] = M
                        N = L
                        break
                    }
                else N = 0
            while (0)
            H = (i + 24) | 0
            f[H >> 2] = N
            G = (a + 4) | 0
            L = (a + 8) | 0
            M = f[G >> 2] | 0
            a: do
                if ((f[L >> 2] | 0) != (M | 0)) {
                    K = (j + 4) | 0
                    O = (j + 8) | 0
                    P = (j + 8) | 0
                    Q = (B | 0) == 0
                    R = (j + 4) | 0
                    S = (j + 8) | 0
                    T = (k + 4) | 0
                    U = (k + 8) | 0
                    V = (k + 8) | 0
                    W = (a + 48) | 0
                    Y = (j + 8) | 0
                    Z = (a + 60) | 0
                    $ = 0
                    aa = 0
                    ba = 0
                    ca = 0
                    da = M
                    ea = C
                    b: while (1) {
                        fa = f[((f[((f[(ea + 4) >> 2] | 0) + 8) >> 2] | 0) + (f[(da + (ca << 2)) >> 2] << 2)) >> 2] | 0
                        switch (f[(fa + 28) >> 2] | 0) {
                            case 1:
                            case 3:
                            case 5:
                            case 2:
                            case 4:
                            case 6: {
                                ga = fa
                                ha = aa
                                break
                            }
                            case 9: {
                                ga = f[((f[Z >> 2] | 0) + (aa << 2)) >> 2] | 0
                                ha = (aa + 1) | 0
                                break
                            }
                            default: {
                                ia = 0
                                break a
                            }
                        }
                        if (!ga) {
                            ia = 0
                            break a
                        }
                        c: do
                            switch (f[(ga + 28) >> 2] | 0) {
                                case 6: {
                                    if (Q) {
                                        ja = ba
                                        ka = (ga + 24) | 0
                                        break c
                                    }
                                    fa = (ga + 84) | 0
                                    la = (ga + 68) | 0
                                    ma = (ga + 48) | 0
                                    na = (ga + 40) | 0
                                    oa = (ga + 24) | 0
                                    pa = 0
                                    do {
                                        if (!(b[fa >> 0] | 0)) qa = f[((f[la >> 2] | 0) + (pa << 2)) >> 2] | 0
                                        else qa = pa
                                        ra = ma
                                        sa = f[ra >> 2] | 0
                                        ta = f[(ra + 4) >> 2] | 0
                                        ra = na
                                        ua = on(f[ra >> 2] | 0, f[(ra + 4) >> 2] | 0, qa | 0, 0) | 0
                                        ra = Tn(ua | 0, I | 0, sa | 0, ta | 0) | 0
                                        Rg(((f[H >> 2] | 0) + ((X(f[F >> 2] | 0, pa) | 0) << 2) + ($ << 2)) | 0, ((f[f[ga >> 2] >> 2] | 0) + ra) | 0, (b[oa >> 0] << 2) | 0) | 0
                                        pa = (pa + 1) | 0
                                    } while ((pa | 0) != (B | 0))
                                    ja = ba
                                    ka = oa
                                    break
                                }
                                case 1:
                                case 3:
                                case 5: {
                                    oa = (ga + 24) | 0
                                    pa = b[oa >> 0] | 0
                                    na = (pa << 24) >> 24
                                    f[j >> 2] = 0
                                    f[R >> 2] = 0
                                    f[S >> 2] = 0
                                    if (!((pa << 24) >> 24)) va = 0
                                    else {
                                        if ((pa << 24) >> 24 < 0) {
                                            wa = 24
                                            break b
                                        }
                                        pa = na << 2
                                        ma = dn(pa) | 0
                                        f[j >> 2] = ma
                                        la = (ma + (na << 2)) | 0
                                        f[Y >> 2] = la
                                        hj(ma | 0, 0, pa | 0) | 0
                                        f[R >> 2] = la
                                        va = b[oa >> 0] | 0
                                    }
                                    la = (va << 24) >> 24
                                    f[k >> 2] = 0
                                    f[T >> 2] = 0
                                    f[U >> 2] = 0
                                    if (!((va << 24) >> 24)) {
                                        xa = 0
                                        ya = 0
                                    } else {
                                        if ((va << 24) >> 24 < 0) {
                                            wa = 30
                                            break b
                                        }
                                        pa = la << 2
                                        ma = dn(pa) | 0
                                        f[k >> 2] = ma
                                        na = (ma + (la << 2)) | 0
                                        f[V >> 2] = na
                                        hj(ma | 0, 0, pa | 0) | 0
                                        f[T >> 2] = na
                                        xa = ma
                                        ya = ma
                                    }
                                    if (Q) {
                                        za = ya
                                        Aa = xa
                                    } else {
                                        ma = (ga + 84) | 0
                                        na = (ga + 68) | 0
                                        pa = 0
                                        do {
                                            if (!(b[ma >> 0] | 0)) Ba = f[((f[na >> 2] | 0) + (pa << 2)) >> 2] | 0
                                            else Ba = pa
                                            la = f[j >> 2] | 0
                                            f[g >> 2] = Ba
                                            fa = b[oa >> 0] | 0
                                            f[e >> 2] = f[g >> 2]
                                            Pb(ga, e, fa, la) | 0
                                            la = b[oa >> 0] | 0
                                            fa = (la << 24) >> 24
                                            if ((la << 24) >> 24 > 0) {
                                                la = f[j >> 2] | 0
                                                ra = f[W >> 2] | 0
                                                ta = f[k >> 2] | 0
                                                sa = 0
                                                do {
                                                    f[(ta + (sa << 2)) >> 2] = (f[(la + (sa << 2)) >> 2] | 0) - (f[(ra + ((sa + ba) << 2)) >> 2] | 0)
                                                    sa = (sa + 1) | 0
                                                } while ((sa | 0) < (fa | 0))
                                                Ca = ta
                                            } else Ca = f[k >> 2] | 0
                                            Rg(((f[H >> 2] | 0) + ((X(f[F >> 2] | 0, pa) | 0) << 2) + ($ << 2)) | 0, Ca | 0, (fa << 2) | 0) | 0
                                            pa = (pa + 1) | 0
                                        } while (pa >>> 0 < B >>> 0)
                                        pa = f[k >> 2] | 0
                                        za = pa
                                        Aa = pa
                                    }
                                    pa = (ba + (b[oa >> 0] | 0)) | 0
                                    if (za | 0) {
                                        na = f[T >> 2] | 0
                                        if ((na | 0) != (za | 0)) f[T >> 2] = na + (~(((na + -4 - za) | 0) >>> 2) << 2)
                                        br(Aa)
                                    }
                                    na = f[j >> 2] | 0
                                    if (na | 0) {
                                        ma = f[R >> 2] | 0
                                        if ((ma | 0) != (na | 0)) f[R >> 2] = ma + (~(((ma + -4 - na) | 0) >>> 2) << 2)
                                        br(na)
                                    }
                                    ja = pa
                                    ka = oa
                                    break
                                }
                                default: {
                                    pa = (ga + 24) | 0
                                    na = b[pa >> 0] | 0
                                    ma = (na << 24) >> 24
                                    f[j >> 2] = 0
                                    f[K >> 2] = 0
                                    f[O >> 2] = 0
                                    if (!((na << 24) >> 24)) {
                                        Da = 0
                                        Ea = 0
                                    } else {
                                        if ((na << 24) >> 24 < 0) {
                                            wa = 53
                                            break b
                                        }
                                        na = ma << 2
                                        ta = dn(na) | 0
                                        f[j >> 2] = ta
                                        sa = (ta + (ma << 2)) | 0
                                        f[P >> 2] = sa
                                        hj(ta | 0, 0, na | 0) | 0
                                        f[K >> 2] = sa
                                        Da = ta
                                        Ea = ta
                                    }
                                    if (Q) {
                                        Fa = Ea
                                        Ga = Da
                                    } else {
                                        ta = (ga + 84) | 0
                                        sa = (ga + 68) | 0
                                        na = 0
                                        do {
                                            if (!(b[ta >> 0] | 0)) Ha = f[((f[sa >> 2] | 0) + (na << 2)) >> 2] | 0
                                            else Ha = na
                                            ma = f[j >> 2] | 0
                                            f[g >> 2] = Ha
                                            ra = b[pa >> 0] | 0
                                            f[e >> 2] = f[g >> 2]
                                            Ob(ga, e, ra, ma) | 0
                                            Rg(((f[H >> 2] | 0) + ((X(f[F >> 2] | 0, na) | 0) << 2) + ($ << 2)) | 0, f[j >> 2] | 0, (b[pa >> 0] << 2) | 0) | 0
                                            na = (na + 1) | 0
                                        } while (na >>> 0 < B >>> 0)
                                        na = f[j >> 2] | 0
                                        Fa = na
                                        Ga = na
                                    }
                                    if (Fa | 0) {
                                        na = f[K >> 2] | 0
                                        if ((na | 0) != (Fa | 0)) f[K >> 2] = na + (~(((na + -4 - Fa) | 0) >>> 2) << 2)
                                        br(Ga)
                                    }
                                    ja = ba
                                    ka = pa
                                }
                            }
                        while (0)
                        na = (ca + 1) | 0
                        sa = f[G >> 2] | 0
                        if (na >>> 0 >= (((f[L >> 2] | 0) - sa) >> 2) >>> 0) {
                            wa = 66
                            break
                        }
                        $ = ($ + (b[ka >> 0] | 0)) | 0
                        aa = ha
                        ba = ja
                        ca = na
                        da = sa
                        ea = f[A >> 2] | 0
                    }
                    if ((wa | 0) == 24) mq(j)
                    else if ((wa | 0) == 30) mq(k)
                    else if ((wa | 0) == 53) mq(j)
                    else if ((wa | 0) == 66) {
                        Ia = f[D >> 2] | 0
                        Ja = f[H >> 2] | 0
                        wa = 67
                        break
                    }
                } else {
                    Ia = E
                    Ja = N
                    wa = 67
                }
            while (0)
            d: do
                if ((wa | 0) == 67) {
                    N = X(Ia, B) | 0
                    if ((N | 0) > 0) {
                        E = 0
                        H = 0
                        while (1) {
                            D = f[(Ja + (E << 2)) >> 2] | 0
                            if (!D) Ka = H
                            else {
                                A = (_(D | 0) | 0) ^ 31
                                Ka = (A | 0) < (H | 0) ? H : (A + 1) | 0
                            }
                            E = (E + 1) | 0
                            if ((E | 0) >= (N | 0)) {
                                La = Ka
                                break
                            } else H = Ka
                        }
                    } else La = 0
                    switch (b[h >> 0] | 0) {
                        case 6: {
                            Ge(j, Ia)
                            f[l >> 2] = 0
                            f[(l + 4) >> 2] = i
                            H = f[F >> 2] | 0
                            f[(l + 8) >> 2] = H
                            f[m >> 2] = f[i >> 2]
                            f[(m + 4) >> 2] = i
                            f[(m + 8) >> 2] = H
                            f[k >> 2] = La
                            f[g >> 2] = f[l >> 2]
                            f[(g + 4) >> 2] = f[(l + 4) >> 2]
                            f[(g + 8) >> 2] = f[(l + 8) >> 2]
                            f[e >> 2] = f[m >> 2]
                            f[(e + 4) >> 2] = f[(m + 4) >> 2]
                            f[(e + 8) >> 2] = f[(m + 8) >> 2]
                            H = ff(j, g, e, k, c) | 0
                            Ee(j)
                            if (!H) {
                                ia = 0
                                break d
                            }
                            break
                        }
                        case 5: {
                            Ge(j, Ia)
                            f[n >> 2] = 0
                            f[(n + 4) >> 2] = i
                            H = f[F >> 2] | 0
                            f[(n + 8) >> 2] = H
                            f[o >> 2] = f[i >> 2]
                            f[(o + 4) >> 2] = i
                            f[(o + 8) >> 2] = H
                            f[k >> 2] = La
                            f[g >> 2] = f[n >> 2]
                            f[(g + 4) >> 2] = f[(n + 4) >> 2]
                            f[(g + 8) >> 2] = f[(n + 8) >> 2]
                            f[e >> 2] = f[o >> 2]
                            f[(e + 4) >> 2] = f[(o + 4) >> 2]
                            f[(e + 8) >> 2] = f[(o + 8) >> 2]
                            H = gf(j, g, e, k, c) | 0
                            Ee(j)
                            if (!H) {
                                ia = 0
                                break d
                            }
                            break
                        }
                        case 4: {
                            Ge(j, Ia)
                            f[p >> 2] = 0
                            f[(p + 4) >> 2] = i
                            H = f[F >> 2] | 0
                            f[(p + 8) >> 2] = H
                            f[q >> 2] = f[i >> 2]
                            f[(q + 4) >> 2] = i
                            f[(q + 8) >> 2] = H
                            f[k >> 2] = La
                            f[g >> 2] = f[p >> 2]
                            f[(g + 4) >> 2] = f[(p + 4) >> 2]
                            f[(g + 8) >> 2] = f[(p + 8) >> 2]
                            f[e >> 2] = f[q >> 2]
                            f[(e + 4) >> 2] = f[(q + 4) >> 2]
                            f[(e + 8) >> 2] = f[(q + 8) >> 2]
                            H = gf(j, g, e, k, c) | 0
                            Ee(j)
                            if (!H) {
                                ia = 0
                                break d
                            }
                            break
                        }
                        case 3: {
                            Oe(j, Ia)
                            f[r >> 2] = 0
                            f[(r + 4) >> 2] = i
                            H = f[F >> 2] | 0
                            f[(r + 8) >> 2] = H
                            f[s >> 2] = f[i >> 2]
                            f[(s + 4) >> 2] = i
                            f[(s + 8) >> 2] = H
                            f[k >> 2] = La
                            f[g >> 2] = f[r >> 2]
                            f[(g + 4) >> 2] = f[(r + 4) >> 2]
                            f[(g + 8) >> 2] = f[(r + 8) >> 2]
                            f[e >> 2] = f[s >> 2]
                            f[(e + 4) >> 2] = f[(s + 4) >> 2]
                            f[(e + 8) >> 2] = f[(s + 8) >> 2]
                            H = mf(j, g, e, k, c) | 0
                            Ue(j)
                            if (!H) {
                                ia = 0
                                break d
                            }
                            break
                        }
                        case 2: {
                            Oe(j, Ia)
                            f[t >> 2] = 0
                            f[(t + 4) >> 2] = i
                            H = f[F >> 2] | 0
                            f[(t + 8) >> 2] = H
                            f[v >> 2] = f[i >> 2]
                            f[(v + 4) >> 2] = i
                            f[(v + 8) >> 2] = H
                            f[k >> 2] = La
                            f[g >> 2] = f[t >> 2]
                            f[(g + 4) >> 2] = f[(t + 4) >> 2]
                            f[(g + 8) >> 2] = f[(t + 8) >> 2]
                            f[e >> 2] = f[v >> 2]
                            f[(e + 4) >> 2] = f[(v + 4) >> 2]
                            f[(e + 8) >> 2] = f[(v + 8) >> 2]
                            H = mf(j, g, e, k, c) | 0
                            Ue(j)
                            if (!H) {
                                ia = 0
                                break d
                            }
                            break
                        }
                        case 1: {
                            Pe(j, Ia)
                            f[w >> 2] = 0
                            f[(w + 4) >> 2] = i
                            H = f[F >> 2] | 0
                            f[(w + 8) >> 2] = H
                            f[x >> 2] = f[i >> 2]
                            f[(x + 4) >> 2] = i
                            f[(x + 8) >> 2] = H
                            f[k >> 2] = La
                            f[g >> 2] = f[w >> 2]
                            f[(g + 4) >> 2] = f[(w + 4) >> 2]
                            f[(g + 8) >> 2] = f[(w + 8) >> 2]
                            f[e >> 2] = f[x >> 2]
                            f[(e + 4) >> 2] = f[(x + 4) >> 2]
                            f[(e + 8) >> 2] = f[(x + 8) >> 2]
                            H = lf(j, g, e, k, c) | 0
                            Te(j)
                            if (!H) {
                                ia = 0
                                break d
                            }
                            break
                        }
                        case 0: {
                            Pe(j, Ia)
                            f[y >> 2] = 0
                            f[(y + 4) >> 2] = i
                            H = f[F >> 2] | 0
                            f[(y + 8) >> 2] = H
                            f[z >> 2] = f[i >> 2]
                            f[(z + 4) >> 2] = i
                            f[(z + 8) >> 2] = H
                            f[k >> 2] = La
                            f[g >> 2] = f[y >> 2]
                            f[(g + 4) >> 2] = f[(y + 4) >> 2]
                            f[(g + 8) >> 2] = f[(y + 8) >> 2]
                            f[e >> 2] = f[z >> 2]
                            f[(e + 4) >> 2] = f[(z + 4) >> 2]
                            f[(e + 8) >> 2] = f[(z + 8) >> 2]
                            H = lf(j, g, e, k, c) | 0
                            Te(j)
                            if (!H) {
                                ia = 0
                                break d
                            }
                            break
                        }
                        default: {
                            ia = 0
                            break d
                        }
                    }
                    ia = 1
                }
            while (0)
            j = f[(i + 12) >> 2] | 0
            if (!j) {
                u = d
                return ia | 0
            }
            i = f[J >> 2] | 0
            if ((i | 0) != (j | 0)) f[J >> 2] = i + (~(((i + -4 - j) | 0) >>> 2) << 2)
            br(j)
            u = d
            return ia | 0
        }
        function lb(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0
            d = u
            u = (u + 80) | 0
            e = (d + 56) | 0
            g = (d + 52) | 0
            h = (d + 48) | 0
            i = (d + 68) | 0
            j = d
            k = (d + 44) | 0
            l = (d + 40) | 0
            m = (d + 36) | 0
            n = (d + 32) | 0
            o = (d + 28) | 0
            p = (d + 24) | 0
            q = (d + 20) | 0
            r = (d + 16) | 0
            s = (d + 12) | 0
            if (!(b[(c + 352) >> 0] | 0)) {
                Ne(e, f[(c + 8) >> 2] | 0)
                t = (c + 12) | 0
                v = f[e >> 2] | 0
                f[e >> 2] = 0
                w = f[t >> 2] | 0
                f[t >> 2] = v
                if (w) {
                    ui(w)
                    br(w)
                    w = f[e >> 2] | 0
                    f[e >> 2] = 0
                    if (w | 0) {
                        ui(w)
                        br(w)
                    }
                } else f[e >> 2] = 0
            } else {
                Mg(e, f[(c + 8) >> 2] | 0)
                w = (c + 12) | 0
                v = f[e >> 2] | 0
                f[e >> 2] = 0
                t = f[w >> 2] | 0
                f[w >> 2] = v
                if (t) {
                    ui(t)
                    br(t)
                    t = f[e >> 2] | 0
                    f[e >> 2] = 0
                    if (t | 0) {
                        ui(t)
                        br(t)
                    }
                } else f[e >> 2] = 0
            }
            t = (c + 12) | 0
            v = f[t >> 2] | 0
            if (v | 0 ? ((((((f[(v + 4) >> 2] | 0) - (f[v >> 2] | 0)) >> 2) >>> 0) / 3) | 0 | 0) != (f[(v + 40) >> 2] | 0) : 0) {
                v = (c + 200) | 0
                Td(v, c) | 0
                w = f[t >> 2] | 0
                x = (c + 4) | 0
                Nh(((((f[(w + 28) >> 2] | 0) - (f[(w + 24) >> 2] | 0)) >> 2) - (f[(w + 44) >> 2] | 0)) | 0, f[((f[x >> 2] | 0) + 44) >> 2] | 0) | 0
                w = f[t >> 2] | 0
                Nh((((((((f[(w + 4) >> 2] | 0) - (f[w >> 2] | 0)) >> 2) >>> 0) / 3) | 0) - (f[(w + 40) >> 2] | 0)) | 0, f[((f[x >> 2] | 0) + 44) >> 2] | 0) | 0
                w = (c + 28) | 0
                y = (c + 8) | 0
                z = f[y >> 2] | 0
                A = ((((f[(z + 100) >> 2] | 0) - (f[(z + 96) >> 2] | 0)) | 0) / 12) | 0
                b[e >> 0] = 0
                Xg(w, A, e)
                A = f[t >> 2] | 0
                z = ((f[(A + 28) >> 2] | 0) - (f[(A + 24) >> 2] | 0)) >> 2
                f[e >> 2] = -1
                Sf((c + 52) | 0, z, e)
                z = (c + 40) | 0
                A = f[z >> 2] | 0
                B = (c + 44) | 0
                C = f[B >> 2] | 0
                if ((C | 0) != (A | 0)) f[B >> 2] = C + (~(((C + -4 - A) | 0) >>> 2) << 2)
                A = f[t >> 2] | 0
                C = ((f[(A + 4) >> 2] | 0) - (f[A >> 2] | 0)) >> 2
                $j(z, (C - ((C >>> 0) % 3 | 0)) | 0)
                C = (c + 84) | 0
                z = f[t >> 2] | 0
                A = ((f[(z + 28) >> 2] | 0) - (f[(z + 24) >> 2] | 0)) >> 2
                b[e >> 0] = 0
                Xg(C, A, e)
                A = (c + 96) | 0
                z = f[A >> 2] | 0
                B = (c + 100) | 0
                D = f[B >> 2] | 0
                if ((D | 0) != (z | 0)) f[B >> 2] = D + (~(((D + -4 - z) | 0) >>> 2) << 2)
                f[(c + 164) >> 2] = -1
                z = (c + 168) | 0
                f[z >> 2] = 0
                D = f[(c + 108) >> 2] | 0
                E = (c + 112) | 0
                F = f[E >> 2] | 0
                if ((F | 0) != (D | 0)) f[E >> 2] = F + ((~(((((F + -12 - D) | 0) >>> 0) / 12) | 0) * 12) | 0)
                D = (c + 132) | 0
                if (f[D >> 2] | 0) {
                    F = (c + 128) | 0
                    E = f[F >> 2] | 0
                    if (E | 0) {
                        G = E
                        do {
                            E = G
                            G = f[G >> 2] | 0
                            br(E)
                        } while ((G | 0) != 0)
                    }
                    f[F >> 2] = 0
                    F = f[(c + 124) >> 2] | 0
                    if (F | 0) {
                        G = (c + 120) | 0
                        E = 0
                        do {
                            f[((f[G >> 2] | 0) + (E << 2)) >> 2] = 0
                            E = (E + 1) | 0
                        } while ((E | 0) != (F | 0))
                    }
                    f[D >> 2] = 0
                }
                f[(c + 144) >> 2] = 0
                D = f[t >> 2] | 0
                F = ((f[(D + 28) >> 2] | 0) - (f[(D + 24) >> 2] | 0)) >> 2
                f[e >> 2] = -1
                Sf((c + 152) | 0, F, e)
                F = (c + 72) | 0
                D = f[F >> 2] | 0
                E = (c + 76) | 0
                G = f[E >> 2] | 0
                if ((G | 0) != (D | 0)) f[E >> 2] = G + (~(((G + -4 - D) | 0) >>> 2) << 2)
                D = f[t >> 2] | 0
                $j(F, (((((f[(D + 4) >> 2] | 0) - (f[D >> 2] | 0)) >> 2) >>> 0) / 3) | 0)
                f[(c + 64) >> 2] = 0
                if (!(oe(c) | 0)) {
                    D = dn(32) | 0
                    f[e >> 2] = D
                    f[(e + 8) >> 2] = -2147483616
                    f[(e + 4) >> 2] = 29
                    H = D
                    I = 13227
                    J = (H + 29) | 0
                    do {
                        b[H >> 0] = b[I >> 0] | 0
                        H = (H + 1) | 0
                        I = (I + 1) | 0
                    } while ((H | 0) < (J | 0))
                    b[(D + 29) >> 0] = 0
                    f[a >> 2] = -1
                    dj((a + 4) | 0, e)
                    if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
                    u = d
                    return
                }
                if (!(bh(c) | 0)) {
                    D = dn(48) | 0
                    f[e >> 2] = D
                    f[(e + 8) >> 2] = -2147483600
                    f[(e + 4) >> 2] = 36
                    H = D
                    I = 13257
                    J = (H + 36) | 0
                    do {
                        b[H >> 0] = b[I >> 0] | 0
                        H = (H + 1) | 0
                        I = (I + 1) | 0
                    } while ((H | 0) < (J | 0))
                    b[(D + 36) >> 0] = 0
                    f[a >> 2] = -1
                    dj((a + 4) | 0, e)
                    if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
                    u = d
                    return
                }
                D = (c + 172) | 0
                G = (c + 176) | 0
                K = (((((f[G >> 2] | 0) - (f[D >> 2] | 0)) | 0) / 136) | 0) & 255
                b[i >> 0] = K
                L = f[((f[x >> 2] | 0) + 44) >> 2] | 0
                M = (L + 16) | 0
                N = f[(M + 4) >> 2] | 0
                if (((N | 0) > 0) | (((N | 0) == 0) & ((f[M >> 2] | 0) >>> 0 > 0))) O = K
                else {
                    f[g >> 2] = f[(L + 4) >> 2]
                    f[e >> 2] = f[g >> 2]
                    ye(L, e, i, (i + 1) | 0) | 0
                    O = b[i >> 0] | 0
                }
                f[(c + 284) >> 2] = O & 255
                O = f[t >> 2] | 0
                i = ((f[(O + 4) >> 2] | 0) - (f[O >> 2] | 0)) | 0
                O = i >> 2
                Ti(v)
                f[j >> 2] = 0
                L = (j + 4) | 0
                f[L >> 2] = 0
                f[(j + 8) >> 2] = 0
                a: do
                    if ((i | 0) > 0) {
                        K = (c + 104) | 0
                        M = (j + 8) | 0
                        N = 0
                        b: while (1) {
                            P = ((N >>> 0) / 3) | 0
                            Q = P >>> 5
                            R = 1 << (P & 31)
                            if (((f[((f[w >> 2] | 0) + (Q << 2)) >> 2] & R) | 0) == 0 ? ((S = f[t >> 2] | 0), (f[k >> 2] = P), (f[e >> 2] = f[k >> 2]), !(Rj(S, e) | 0)) : 0) {
                                f[g >> 2] = 0
                                f[l >> 2] = P
                                f[e >> 2] = f[l >> 2]
                                P = gg(c, e, g) | 0
                                Vi(v, P)
                                S = f[g >> 2] | 0
                                T = (S | 0) == -1
                                do
                                    if (P) {
                                        do
                                            if (T) {
                                                U = -1
                                                V = -1
                                                W = -1
                                            } else {
                                                X = f[f[t >> 2] >> 2] | 0
                                                Y = f[(X + (S << 2)) >> 2] | 0
                                                Z = (S + 1) | 0
                                                _ = ((Z >>> 0) % 3 | 0 | 0) == 0 ? (S + -2) | 0 : Z
                                                if ((_ | 0) == -1) $ = -1
                                                else $ = f[(X + (_ << 2)) >> 2] | 0
                                                _ = ((((S >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + S) | 0
                                                if ((_ | 0) == -1) {
                                                    U = -1
                                                    V = $
                                                    W = Y
                                                    break
                                                }
                                                U = f[(X + (_ << 2)) >> 2] | 0
                                                V = $
                                                W = Y
                                            }
                                        while (0)
                                        Y = f[C >> 2] | 0
                                        _ = (Y + ((W >>> 5) << 2)) | 0
                                        f[_ >> 2] = f[_ >> 2] | (1 << (W & 31))
                                        _ = (Y + ((V >>> 5) << 2)) | 0
                                        f[_ >> 2] = f[_ >> 2] | (1 << (V & 31))
                                        _ = (Y + ((U >>> 5) << 2)) | 0
                                        f[_ >> 2] = f[_ >> 2] | (1 << (U & 31))
                                        f[e >> 2] = 1
                                        _ = f[B >> 2] | 0
                                        if (_ >>> 0 < (f[K >> 2] | 0) >>> 0) {
                                            f[_ >> 2] = 1
                                            f[B >> 2] = _ + 4
                                        } else Ci(A, e)
                                        _ = ((f[w >> 2] | 0) + (Q << 2)) | 0
                                        f[_ >> 2] = f[_ >> 2] | R
                                        _ = (S + 1) | 0
                                        if (T) aa = -1
                                        else aa = ((_ >>> 0) % 3 | 0 | 0) == 0 ? (S + -2) | 0 : _
                                        f[e >> 2] = aa
                                        Y = f[L >> 2] | 0
                                        if (Y >>> 0 < (f[M >> 2] | 0) >>> 0) {
                                            f[Y >> 2] = aa
                                            f[L >> 2] = Y + 4
                                        } else Ci(j, e)
                                        if (T) break
                                        Y = ((_ >>> 0) % 3 | 0 | 0) == 0 ? (S + -2) | 0 : _
                                        if ((Y | 0) == -1) break
                                        _ = f[((f[((f[t >> 2] | 0) + 12) >> 2] | 0) + (Y << 2)) >> 2] | 0
                                        Y = (_ | 0) == -1
                                        X = Y ? -1 : ((_ >>> 0) / 3) | 0
                                        if (Y) break
                                        if ((f[((f[w >> 2] | 0) + ((X >>> 5) << 2)) >> 2] & (1 << (X & 31))) | 0) break
                                        f[m >> 2] = _
                                        f[e >> 2] = f[m >> 2]
                                        if (!(Zb(c, e) | 0)) {
                                            ba = 65
                                            break b
                                        }
                                    } else {
                                        _ = (S + 1) | 0
                                        if (T) ca = -1
                                        else ca = ((_ >>> 0) % 3 | 0 | 0) == 0 ? (S + -2) | 0 : _
                                        f[n >> 2] = ca
                                        f[e >> 2] = f[n >> 2]
                                        Ce(c, e, 1) | 0
                                        f[o >> 2] = f[g >> 2]
                                        f[e >> 2] = f[o >> 2]
                                        if (!(Zb(c, e) | 0)) {
                                            ba = 71
                                            break b
                                        }
                                    }
                                while (0)
                            }
                            N = (N + 1) | 0
                            if ((N | 0) >= (O | 0)) {
                                ba = 77
                                break a
                            }
                        }
                        if ((ba | 0) == 65) {
                            f[e >> 2] = 0
                            f[(e + 4) >> 2] = 0
                            f[(e + 8) >> 2] = 0
                            N = dn(48) | 0
                            f[e >> 2] = N
                            f[(e + 8) >> 2] = -2147483600
                            f[(e + 4) >> 2] = 32
                            H = N
                            I = 13294
                            J = (H + 32) | 0
                            do {
                                b[H >> 0] = b[I >> 0] | 0
                                H = (H + 1) | 0
                                I = (I + 1) | 0
                            } while ((H | 0) < (J | 0))
                            b[(N + 32) >> 0] = 0
                            f[a >> 2] = -1
                            dj((a + 4) | 0, e)
                            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
                        } else if ((ba | 0) == 71) {
                            f[e >> 2] = 0
                            f[(e + 4) >> 2] = 0
                            f[(e + 8) >> 2] = 0
                            M = dn(48) | 0
                            f[e >> 2] = M
                            f[(e + 8) >> 2] = -2147483600
                            f[(e + 4) >> 2] = 32
                            H = M
                            I = 13294
                            J = (H + 32) | 0
                            do {
                                b[H >> 0] = b[I >> 0] | 0
                                H = (H + 1) | 0
                                I = (I + 1) | 0
                            } while ((H | 0) < (J | 0))
                            b[(M + 32) >> 0] = 0
                            f[a >> 2] = -1
                            dj((a + 4) | 0, e)
                            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
                        }
                    } else ba = 77
                while (0)
                do
                    if ((ba | 0) == 77) {
                        O = f[F >> 2] | 0
                        o = f[E >> 2] | 0
                        n = o
                        if ((O | 0) != (o | 0) ? ((ca = (o + -4) | 0), O >>> 0 < ca >>> 0) : 0) {
                            o = O
                            O = ca
                            do {
                                ca = f[o >> 2] | 0
                                f[o >> 2] = f[O >> 2]
                                f[O >> 2] = ca
                                o = (o + 4) | 0
                                O = (O + -4) | 0
                            } while (o >>> 0 < O >>> 0)
                        }
                        f[p >> 2] = n
                        f[q >> 2] = f[j >> 2]
                        f[r >> 2] = f[L >> 2]
                        f[h >> 2] = f[p >> 2]
                        f[g >> 2] = f[q >> 2]
                        f[e >> 2] = f[r >> 2]
                        Md(F, h, g, e) | 0
                        if (
                            (f[G >> 2] | 0) != (f[D >> 2] | 0)
                                ? ((O = f[y >> 2] | 0),
                                  (o = ((((f[(O + 100) >> 2] | 0) - (f[(O + 96) >> 2] | 0)) | 0) / 12) | 0),
                                  (b[e >> 0] = 0),
                                  Xg(w, o, e),
                                  (o = f[F >> 2] | 0),
                                  (O = f[E >> 2] | 0),
                                  (o | 0) != (O | 0))
                                : 0
                        ) {
                            M = o
                            do {
                                f[s >> 2] = f[M >> 2]
                                f[e >> 2] = f[s >> 2]
                                ue(c, e) | 0
                                M = (M + 4) | 0
                            } while ((M | 0) != (O | 0))
                        }
                        $h(v)
                        Nh(f[(c + 324) >> 2] | 0, f[((f[x >> 2] | 0) + 44) >> 2] | 0) | 0
                        Nh(f[z >> 2] | 0, f[((f[x >> 2] | 0) + 44) >> 2] | 0) | 0
                        if (Jg(c) | 0) {
                            O = f[((f[x >> 2] | 0) + 44) >> 2] | 0
                            M = f[(c + 232) >> 2] | 0
                            n = (O + 16) | 0
                            o = f[(n + 4) >> 2] | 0
                            if (!(((o | 0) > 0) | (((o | 0) == 0) & ((f[n >> 2] | 0) >>> 0 > 0)))) {
                                n = ((f[(c + 236) >> 2] | 0) - M) | 0
                                f[g >> 2] = f[(O + 4) >> 2]
                                f[e >> 2] = f[g >> 2]
                                ye(O, e, M, (M + n) | 0) | 0
                            }
                            f[a >> 2] = 0
                            f[(a + 4) >> 2] = 0
                            f[(a + 8) >> 2] = 0
                            f[(a + 12) >> 2] = 0
                            break
                        } else {
                            f[e >> 2] = 0
                            f[(e + 4) >> 2] = 0
                            f[(e + 8) >> 2] = 0
                            n = dn(32) | 0
                            f[e >> 2] = n
                            f[(e + 8) >> 2] = -2147483616
                            f[(e + 4) >> 2] = 28
                            H = n
                            I = 13327
                            J = (H + 28) | 0
                            do {
                                b[H >> 0] = b[I >> 0] | 0
                                H = (H + 1) | 0
                                I = (I + 1) | 0
                            } while ((H | 0) < (J | 0))
                            b[(n + 28) >> 0] = 0
                            f[a >> 2] = -1
                            dj((a + 4) | 0, e)
                            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
                            break
                        }
                    }
                while (0)
                g = f[j >> 2] | 0
                if (g | 0) {
                    j = f[L >> 2] | 0
                    if ((j | 0) != (g | 0)) f[L >> 2] = j + (~(((j + -4 - g) | 0) >>> 2) << 2)
                    br(g)
                }
                u = d
                return
            }
            g = dn(32) | 0
            f[e >> 2] = g
            f[(e + 8) >> 2] = -2147483616
            f[(e + 4) >> 2] = 29
            H = g
            I = 13197
            J = (H + 29) | 0
            do {
                b[H >> 0] = b[I >> 0] | 0
                H = (H + 1) | 0
                I = (I + 1) | 0
            } while ((H | 0) < (J | 0))
            b[(g + 29) >> 0] = 0
            f[a >> 2] = -1
            dj((a + 4) | 0, e)
            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
            u = d
            return
        }
        function mb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                Y = 0,
                Z = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0,
                xa = 0,
                ya = 0,
                za = 0,
                Aa = 0,
                Ba = 0,
                Ca = 0,
                Da = 0,
                Ea = 0,
                Fa = 0,
                Ga = 0,
                Ha = 0,
                Ia = 0,
                Ja = 0
            d = u
            u = (u + 32) | 0
            e = d
            g = (a + 8) | 0
            h = f[g >> 2] | 0
            f[e >> 2] = 0
            i = (e + 4) | 0
            f[i >> 2] = 0
            f[(e + 8) >> 2] = 0
            do
                if (h)
                    if (h >>> 0 > 1073741823) mq(e)
                    else {
                        j = h << 2
                        k = dn(j) | 0
                        f[e >> 2] = k
                        l = (k + (h << 2)) | 0
                        f[(e + 8) >> 2] = l
                        hj(k | 0, 0, j | 0) | 0
                        f[i >> 2] = l
                        m = l
                        n = k
                        break
                    }
                else {
                    m = 0
                    n = 0
                }
            while (0)
            k = (a + 1164) | 0
            l = f[k >> 2] | 0
            j = f[l >> 2] | 0
            o = (l + 4) | 0
            if (!j) {
                p = (l + 8) | 0
                q = n
                r = m
                s = h
            } else {
                h = f[o >> 2] | 0
                if ((h | 0) != (j | 0)) f[o >> 2] = h + (~(((h + -4 - j) | 0) >>> 2) << 2)
                br(j)
                j = (l + 8) | 0
                f[j >> 2] = 0
                f[o >> 2] = 0
                f[l >> 2] = 0
                p = j
                q = f[e >> 2] | 0
                r = f[i >> 2] | 0
                s = f[g >> 2] | 0
            }
            f[l >> 2] = q
            f[o >> 2] = r
            f[p >> 2] = f[(e + 8) >> 2]
            f[e >> 2] = 0
            p = (e + 4) | 0
            f[p >> 2] = 0
            f[(e + 8) >> 2] = 0
            do
                if (s)
                    if (s >>> 0 > 1073741823) mq(e)
                    else {
                        r = s << 2
                        o = dn(r) | 0
                        f[e >> 2] = o
                        q = (o + (s << 2)) | 0
                        f[(e + 8) >> 2] = q
                        hj(o | 0, 0, r | 0) | 0
                        f[p >> 2] = q
                        t = q
                        v = o
                        break
                    }
                else {
                    t = 0
                    v = 0
                }
            while (0)
            s = (a + 1176) | 0
            o = f[s >> 2] | 0
            q = f[o >> 2] | 0
            r = (o + 4) | 0
            if (!q) {
                w = (o + 8) | 0
                x = v
                y = t
            } else {
                t = f[r >> 2] | 0
                if ((t | 0) != (q | 0)) f[r >> 2] = t + (~(((t + -4 - q) | 0) >>> 2) << 2)
                br(q)
                q = (o + 8) | 0
                f[q >> 2] = 0
                f[r >> 2] = 0
                f[o >> 2] = 0
                w = q
                x = f[e >> 2] | 0
                y = f[p >> 2] | 0
            }
            f[o >> 2] = x
            f[r >> 2] = y
            f[w >> 2] = f[(e + 8) >> 2]
            w = f[b >> 2] | 0
            y = (b + 4) | 0
            r = f[y >> 2] | 0
            x = f[(y + 4) >> 2] | 0
            y = f[c >> 2] | 0
            o = (c + 4) | 0
            p = f[o >> 2] | 0
            q = f[(o + 4) >> 2] | 0
            f[e >> 2] = 0
            f[(e + 4) >> 2] = 0
            f[(e + 8) >> 2] = 0
            f[(e + 12) >> 2] = 0
            f[(e + 16) >> 2] = 0
            f[(e + 20) >> 2] = 0
            o = (e + 8) | 0
            t = (e + 4) | 0
            v = (e + 16) | 0
            l = (e + 20) | 0
            i = r
            Jc(e)
            j = f[t >> 2] | 0
            h = ((f[l >> 2] | 0) + (f[v >> 2] | 0)) | 0
            if ((f[o >> 2] | 0) == (j | 0)) z = 0
            else z = ((f[(j + ((((h >>> 0) / 113) | 0) << 2)) >> 2] | 0) + ((((h >>> 0) % 113 | 0) * 36) | 0)) | 0
            f[z >> 2] = w
            h = (z + 4) | 0
            f[h >> 2] = r
            f[(h + 4) >> 2] = x
            f[(z + 12) >> 2] = y
            h = (z + 16) | 0
            f[h >> 2] = p
            f[(h + 4) >> 2] = q
            f[(z + 24) >> 2] = 0
            f[(z + 28) >> 2] = y - w
            f[(z + 32) >> 2] = 0
            z = ((f[l >> 2] | 0) + 1) | 0
            f[l >> 2] = z
            if (z | 0) {
                w = (a + 1152) | 0
                y = (a + 1084) | 0
                h = (a + 1080) | 0
                j = (a + 1072) | 0
                m = (a + 1076) | 0
                n = (a + 1068) | 0
                A = (b + 8) | 0
                B = (c + 8) | 0
                C = (a + 1124) | 0
                D = (a + 1120) | 0
                E = (a + 1112) | 0
                F = (a + 1116) | 0
                G = (a + 1108) | 0
                H = (i + 4) | 0
                I = (i + 24) | 0
                J = (i + 24) | 0
                K = (p + 24) | 0
                L = z
                while (1) {
                    z = f[v >> 2] | 0
                    M = (L + -1) | 0
                    N = (M + z) | 0
                    O = f[t >> 2] | 0
                    P = f[(O + ((((N >>> 0) / 113) | 0) << 2)) >> 2] | 0
                    Q = (N >>> 0) % 113 | 0
                    N = f[(P + ((Q * 36) | 0)) >> 2] | 0
                    R = f[(P + ((Q * 36) | 0) + 12) >> 2] | 0
                    S = f[(P + ((Q * 36) | 0) + 24) >> 2] | 0
                    T = f[(P + ((Q * 36) | 0) + 32) >> 2] | 0
                    f[l >> 2] = M
                    M = f[o >> 2] | 0
                    Q = (M - O) >> 2
                    if (((1 - L - z + ((Q | 0) == 0 ? 0 : (((Q * 113) | 0) + -1) | 0)) | 0) >>> 0 > 225) {
                        br(f[(M + -4) >> 2] | 0)
                        f[o >> 2] = (f[o >> 2] | 0) + -4
                    }
                    f[b >> 2] = N
                    f[c >> 2] = R
                    M = f[k >> 2] | 0
                    Q = (((f[g >> 2] | 0) + -1) | 0) == (S | 0) ? 0 : (S + 1) | 0
                    S = ((f[s >> 2] | 0) + ((T * 12) | 0)) | 0
                    z = (R - N) | 0
                    O = ((f[a >> 2] | 0) - (f[((f[S >> 2] | 0) + (Q << 2)) >> 2] | 0)) | 0
                    a: do
                        if (O) {
                            if (z >>> 0 < 3) {
                                P = f[w >> 2] | 0
                                f[P >> 2] = Q
                                U = f[g >> 2] | 0
                                if (U >>> 0 > 1) {
                                    V = 1
                                    W = U
                                    Y = Q
                                    while (1) {
                                        Y = (Y | 0) == ((W + -1) | 0) ? 0 : (Y + 1) | 0
                                        f[(P + (V << 2)) >> 2] = Y
                                        V = (V + 1) | 0
                                        Z = f[g >> 2] | 0
                                        if (V >>> 0 >= Z >>> 0) {
                                            $ = Z
                                            break
                                        } else W = Z
                                    }
                                } else $ = U
                                if (!z) {
                                    aa = 85
                                    break
                                } else {
                                    ba = 0
                                    ca = $
                                }
                                while (1) {
                                    W = ((f[I >> 2] | 0) + ((X(f[H >> 2] | 0, (N + ba) | 0) | 0) << 2)) | 0
                                    if (!ca) da = 0
                                    else {
                                        V = 0
                                        do {
                                            Y = f[((f[w >> 2] | 0) + (V << 2)) >> 2] | 0
                                            P = ((f[a >> 2] | 0) - (f[((f[S >> 2] | 0) + (Y << 2)) >> 2] | 0)) | 0
                                            do
                                                if (P | 0) {
                                                    Z = f[y >> 2] | 0
                                                    ea = (32 - Z) | 0
                                                    fa = (32 - P) | 0
                                                    ga = f[(W + (Y << 2)) >> 2] << fa
                                                    if ((P | 0) > (ea | 0)) {
                                                        ha = ga >>> fa
                                                        fa = (P - ea) | 0
                                                        f[y >> 2] = fa
                                                        ea = f[h >> 2] | (ha >>> fa)
                                                        f[h >> 2] = ea
                                                        fa = f[j >> 2] | 0
                                                        if ((fa | 0) == (f[m >> 2] | 0)) Ci(n, h)
                                                        else {
                                                            f[fa >> 2] = ea
                                                            f[j >> 2] = fa + 4
                                                        }
                                                        f[h >> 2] = ha << (32 - (f[y >> 2] | 0))
                                                        break
                                                    }
                                                    ha = f[h >> 2] | (ga >>> Z)
                                                    f[h >> 2] = ha
                                                    ga = (Z + P) | 0
                                                    f[y >> 2] = ga
                                                    if ((ga | 0) != 32) break
                                                    ga = f[j >> 2] | 0
                                                    if ((ga | 0) == (f[m >> 2] | 0)) Ci(n, h)
                                                    else {
                                                        f[ga >> 2] = ha
                                                        f[j >> 2] = ga + 4
                                                    }
                                                    f[h >> 2] = 0
                                                    f[y >> 2] = 0
                                                }
                                            while (0)
                                            V = (V + 1) | 0
                                            P = f[g >> 2] | 0
                                        } while (V >>> 0 < P >>> 0)
                                        da = P
                                    }
                                    ba = (ba + 1) | 0
                                    if (ba >>> 0 >= z >>> 0) {
                                        aa = 85
                                        break a
                                    } else ca = da
                                }
                            }
                            U = (T + 1) | 0
                            qg((M + ((U * 12) | 0)) | 0, f[(M + ((T * 12) | 0)) >> 2] | 0, f[(M + ((T * 12) | 0) + 4) >> 2] | 0)
                            V = ((f[((f[k >> 2] | 0) + ((U * 12) | 0)) >> 2] | 0) + (Q << 2)) | 0
                            W = ((f[V >> 2] | 0) + (1 << (O + -1))) | 0
                            f[V >> 2] = W
                            V = f[A >> 2] | 0
                            P = f[B >> 2] | 0
                            b: do
                                if ((R | 0) == (N | 0)) ia = N
                                else {
                                    Y = f[J >> 2] | 0
                                    if (!V) {
                                        if ((f[(Y + (Q << 2)) >> 2] | 0) >>> 0 < W >>> 0) {
                                            ia = R
                                            break
                                        } else {
                                            ja = R
                                            ka = N
                                        }
                                        while (1) {
                                            ga = ja
                                            do {
                                                ga = (ga + -1) | 0
                                                if ((ka | 0) == (ga | 0)) {
                                                    ia = ka
                                                    break b
                                                }
                                                ha = ((f[K >> 2] | 0) + ((X(ga, P) | 0) << 2) + (Q << 2)) | 0
                                            } while ((f[ha >> 2] | 0) >>> 0 >= W >>> 0)
                                            ka = (ka + 1) | 0
                                            if ((ka | 0) == (ga | 0)) {
                                                ia = ga
                                                break b
                                            } else ja = ga
                                        }
                                    } else {
                                        la = R
                                        ma = N
                                    }
                                    while (1) {
                                        ha = ma
                                        while (1) {
                                            na = (Y + ((X(ha, V) | 0) << 2)) | 0
                                            if ((f[(na + (Q << 2)) >> 2] | 0) >>> 0 >= W >>> 0) {
                                                oa = la
                                                break
                                            }
                                            Z = (ha + 1) | 0
                                            if ((Z | 0) == (la | 0)) {
                                                ia = la
                                                break b
                                            } else ha = Z
                                        }
                                        while (1) {
                                            oa = (oa + -1) | 0
                                            if ((ha | 0) == (oa | 0)) {
                                                ia = ha
                                                break b
                                            }
                                            pa = ((f[K >> 2] | 0) + ((X(oa, P) | 0) << 2)) | 0
                                            if ((f[(pa + (Q << 2)) >> 2] | 0) >>> 0 < W >>> 0) {
                                                qa = 0
                                                break
                                            }
                                        }
                                        do {
                                            ga = (na + (qa << 2)) | 0
                                            Z = (pa + (qa << 2)) | 0
                                            fa = f[ga >> 2] | 0
                                            f[ga >> 2] = f[Z >> 2]
                                            f[Z >> 2] = fa
                                            qa = (qa + 1) | 0
                                        } while ((qa | 0) != (V | 0))
                                        ma = (ha + 1) | 0
                                        if ((ma | 0) == (oa | 0)) {
                                            ia = oa
                                            break
                                        } else la = oa
                                    }
                                }
                            while (0)
                            W = (_(z | 0) | 0) ^ 31
                            P = (ia - N) | 0
                            Y = (R - ia) | 0
                            fa = P >>> 0 < Y >>> 0
                            if ((P | 0) != (Y | 0)) {
                                Z = f[C >> 2] | 0
                                if (fa) f[D >> 2] = f[D >> 2] | (1 << (31 - Z))
                                ga = (Z + 1) | 0
                                f[C >> 2] = ga
                                if ((ga | 0) == 32) {
                                    ga = f[E >> 2] | 0
                                    if ((ga | 0) == (f[F >> 2] | 0)) Ci(G, D)
                                    else {
                                        f[ga >> 2] = f[D >> 2]
                                        f[E >> 2] = ga + 4
                                    }
                                    f[C >> 2] = 0
                                    f[D >> 2] = 0
                                }
                            }
                            ga = z >>> 1
                            if (fa) {
                                fa = (ga - P) | 0
                                if (W | 0) {
                                    Z = 0
                                    ea = 1 << (W + -1)
                                    while (1) {
                                        Vi((a + 12 + (Z << 5)) | 0, ((ea & fa) | 0) != 0)
                                        Z = (Z + 1) | 0
                                        if ((Z | 0) == (W | 0)) break
                                        else ea = ea >>> 1
                                    }
                                }
                            } else {
                                ea = (ga - Y) | 0
                                if (W | 0) {
                                    Z = 0
                                    fa = 1 << (W + -1)
                                    while (1) {
                                        Vi((a + 12 + (Z << 5)) | 0, ((fa & ea) | 0) != 0)
                                        Z = (Z + 1) | 0
                                        if ((Z | 0) == (W | 0)) break
                                        else fa = fa >>> 1
                                    }
                                }
                            }
                            fa = f[s >> 2] | 0
                            W = f[(fa + ((T * 12) | 0)) >> 2] | 0
                            Z = (W + (Q << 2)) | 0
                            f[Z >> 2] = (f[Z >> 2] | 0) + 1
                            qg((fa + ((U * 12) | 0)) | 0, W, f[(fa + ((T * 12) | 0) + 4) >> 2] | 0)
                            if ((ia | 0) != (N | 0)) {
                                fa = f[o >> 2] | 0
                                W = f[t >> 2] | 0
                                Z = (fa - W) >> 2
                                ea = f[v >> 2] | 0
                                ga = f[l >> 2] | 0
                                if ((((Z | 0) == 0 ? 0 : (((Z * 113) | 0) + -1) | 0) | 0) == ((ga + ea) | 0)) {
                                    Jc(e)
                                    ra = f[v >> 2] | 0
                                    sa = f[l >> 2] | 0
                                    ta = f[o >> 2] | 0
                                    ua = f[t >> 2] | 0
                                } else {
                                    ra = ea
                                    sa = ga
                                    ta = fa
                                    ua = W
                                }
                                W = (sa + ra) | 0
                                if ((ta | 0) == (ua | 0)) va = 0
                                else va = ((f[(ua + ((((W >>> 0) / 113) | 0) << 2)) >> 2] | 0) + ((((W >>> 0) % 113 | 0) * 36) | 0)) | 0
                                f[va >> 2] = N
                                W = (va + 4) | 0
                                f[W >> 2] = r
                                f[(W + 4) >> 2] = x
                                f[(va + 12) >> 2] = ia
                                f[(va + 16) >> 2] = i
                                f[(va + 20) >> 2] = V
                                f[(va + 24) >> 2] = Q
                                f[(va + 28) >> 2] = P
                                f[(va + 32) >> 2] = T
                                f[l >> 2] = (f[l >> 2] | 0) + 1
                            }
                            if ((R | 0) != (ia | 0)) {
                                W = f[o >> 2] | 0
                                fa = f[t >> 2] | 0
                                ga = (W - fa) >> 2
                                ea = f[v >> 2] | 0
                                Z = f[l >> 2] | 0
                                if ((((ga | 0) == 0 ? 0 : (((ga * 113) | 0) + -1) | 0) | 0) == ((Z + ea) | 0)) {
                                    Jc(e)
                                    wa = f[v >> 2] | 0
                                    xa = f[l >> 2] | 0
                                    ya = f[o >> 2] | 0
                                    za = f[t >> 2] | 0
                                } else {
                                    wa = ea
                                    xa = Z
                                    ya = W
                                    za = fa
                                }
                                fa = (xa + wa) | 0
                                if ((ya | 0) == (za | 0)) Aa = 0
                                else Aa = ((f[(za + ((((fa >>> 0) / 113) | 0) << 2)) >> 2] | 0) + ((((fa >>> 0) % 113 | 0) * 36) | 0)) | 0
                                f[Aa >> 2] = ia
                                f[(Aa + 4) >> 2] = i
                                f[(Aa + 8) >> 2] = V
                                f[(Aa + 12) >> 2] = R
                                fa = (Aa + 16) | 0
                                f[fa >> 2] = p
                                f[(fa + 4) >> 2] = q
                                f[(Aa + 24) >> 2] = Q
                                f[(Aa + 28) >> 2] = Y
                                f[(Aa + 32) >> 2] = U
                                fa = ((f[l >> 2] | 0) + 1) | 0
                                f[l >> 2] = fa
                                Ba = fa
                            } else aa = 85
                        } else aa = 85
                    while (0)
                    if ((aa | 0) == 85) {
                        aa = 0
                        Ba = f[l >> 2] | 0
                    }
                    if (!Ba) break
                    else L = Ba
                }
            }
            Ba = f[t >> 2] | 0
            L = f[v >> 2] | 0
            Aa = (Ba + ((((L >>> 0) / 113) | 0) << 2)) | 0
            q = f[o >> 2] | 0
            p = q
            i = Ba
            if ((q | 0) == (Ba | 0)) {
                Ca = 0
                Da = 0
            } else {
                ia = ((f[Aa >> 2] | 0) + ((((L >>> 0) % 113 | 0) * 36) | 0)) | 0
                Ca = ia
                Da = ia
            }
            ia = Aa
            Aa = Da
            c: while (1) {
                Da = Aa
                do {
                    L = Da
                    if ((Ca | 0) == (L | 0)) break c
                    Da = (L + 36) | 0
                } while (((Da - (f[ia >> 2] | 0)) | 0) != 4068)
                Da = (ia + 4) | 0
                ia = Da
                Aa = f[Da >> 2] | 0
            }
            f[l >> 2] = 0
            l = (p - i) >> 2
            if (l >>> 0 > 2) {
                i = Ba
                do {
                    br(f[i >> 2] | 0)
                    i = ((f[t >> 2] | 0) + 4) | 0
                    f[t >> 2] = i
                    Ea = f[o >> 2] | 0
                    Fa = (Ea - i) >> 2
                } while (Fa >>> 0 > 2)
                Ga = Fa
                Ha = i
                Ia = Ea
            } else {
                Ga = l
                Ha = Ba
                Ia = q
            }
            switch (Ga | 0) {
                case 1: {
                    Ja = 56
                    aa = 99
                    break
                }
                case 2: {
                    Ja = 113
                    aa = 99
                    break
                }
                default: {
                }
            }
            if ((aa | 0) == 99) f[v >> 2] = Ja
            if ((Ha | 0) != (Ia | 0)) {
                Ja = Ha
                do {
                    br(f[Ja >> 2] | 0)
                    Ja = (Ja + 4) | 0
                } while ((Ja | 0) != (Ia | 0))
                Ia = f[t >> 2] | 0
                t = f[o >> 2] | 0
                if ((t | 0) != (Ia | 0)) f[o >> 2] = t + (~(((t + -4 - Ia) | 0) >>> 2) << 2)
            }
            Ia = f[e >> 2] | 0
            if (!Ia) {
                u = d
                return
            }
            br(Ia)
            u = d
            return
        }
        function nb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                Y = 0,
                Z = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0,
                xa = 0,
                ya = 0,
                za = 0,
                Aa = 0,
                Ba = 0,
                Ca = 0,
                Da = 0,
                Ea = 0,
                Fa = 0,
                Ga = 0,
                Ha = 0,
                Ia = 0,
                Ja = 0,
                Ka = 0
            d = u
            u = (u + 32) | 0
            e = d
            g = (a + 8) | 0
            h = f[g >> 2] | 0
            f[e >> 2] = 0
            i = (e + 4) | 0
            f[i >> 2] = 0
            f[(e + 8) >> 2] = 0
            do
                if (h)
                    if (h >>> 0 > 1073741823) mq(e)
                    else {
                        j = h << 2
                        k = dn(j) | 0
                        f[e >> 2] = k
                        l = (k + (h << 2)) | 0
                        f[(e + 8) >> 2] = l
                        hj(k | 0, 0, j | 0) | 0
                        f[i >> 2] = l
                        m = l
                        n = k
                        break
                    }
                else {
                    m = 0
                    n = 0
                }
            while (0)
            k = (a + 140) | 0
            l = f[k >> 2] | 0
            j = f[l >> 2] | 0
            o = (l + 4) | 0
            if (!j) {
                p = (l + 8) | 0
                q = n
                r = m
                s = h
            } else {
                h = f[o >> 2] | 0
                if ((h | 0) != (j | 0)) f[o >> 2] = h + (~(((h + -4 - j) | 0) >>> 2) << 2)
                br(j)
                j = (l + 8) | 0
                f[j >> 2] = 0
                f[o >> 2] = 0
                f[l >> 2] = 0
                p = j
                q = f[e >> 2] | 0
                r = f[i >> 2] | 0
                s = f[g >> 2] | 0
            }
            f[l >> 2] = q
            f[o >> 2] = r
            f[p >> 2] = f[(e + 8) >> 2]
            f[e >> 2] = 0
            p = (e + 4) | 0
            f[p >> 2] = 0
            f[(e + 8) >> 2] = 0
            do
                if (s)
                    if (s >>> 0 > 1073741823) mq(e)
                    else {
                        r = s << 2
                        o = dn(r) | 0
                        f[e >> 2] = o
                        q = (o + (s << 2)) | 0
                        f[(e + 8) >> 2] = q
                        hj(o | 0, 0, r | 0) | 0
                        f[p >> 2] = q
                        t = q
                        v = o
                        break
                    }
                else {
                    t = 0
                    v = 0
                }
            while (0)
            s = (a + 152) | 0
            o = f[s >> 2] | 0
            q = f[o >> 2] | 0
            r = (o + 4) | 0
            if (!q) {
                w = (o + 8) | 0
                x = v
                y = t
            } else {
                t = f[r >> 2] | 0
                if ((t | 0) != (q | 0)) f[r >> 2] = t + (~(((t + -4 - q) | 0) >>> 2) << 2)
                br(q)
                q = (o + 8) | 0
                f[q >> 2] = 0
                f[r >> 2] = 0
                f[o >> 2] = 0
                w = q
                x = f[e >> 2] | 0
                y = f[p >> 2] | 0
            }
            f[o >> 2] = x
            f[r >> 2] = y
            f[w >> 2] = f[(e + 8) >> 2]
            w = f[b >> 2] | 0
            y = (b + 4) | 0
            r = f[y >> 2] | 0
            x = f[(y + 4) >> 2] | 0
            y = f[c >> 2] | 0
            o = (c + 4) | 0
            p = f[o >> 2] | 0
            q = f[(o + 4) >> 2] | 0
            f[e >> 2] = 0
            f[(e + 4) >> 2] = 0
            f[(e + 8) >> 2] = 0
            f[(e + 12) >> 2] = 0
            f[(e + 16) >> 2] = 0
            f[(e + 20) >> 2] = 0
            o = (e + 8) | 0
            t = (e + 4) | 0
            v = (e + 16) | 0
            l = (e + 20) | 0
            i = r
            Jc(e)
            j = f[t >> 2] | 0
            h = ((f[l >> 2] | 0) + (f[v >> 2] | 0)) | 0
            if ((f[o >> 2] | 0) == (j | 0)) z = 0
            else z = ((f[(j + ((((h >>> 0) / 113) | 0) << 2)) >> 2] | 0) + ((((h >>> 0) % 113 | 0) * 36) | 0)) | 0
            f[z >> 2] = w
            h = (z + 4) | 0
            f[h >> 2] = r
            f[(h + 4) >> 2] = x
            f[(z + 12) >> 2] = y
            h = (z + 16) | 0
            f[h >> 2] = p
            f[(h + 4) >> 2] = q
            f[(z + 24) >> 2] = 0
            f[(z + 28) >> 2] = y - w
            f[(z + 32) >> 2] = 0
            z = ((f[l >> 2] | 0) + 1) | 0
            f[l >> 2] = z
            if (z | 0) {
                w = (a + 128) | 0
                y = (a + 60) | 0
                h = (a + 56) | 0
                j = (a + 48) | 0
                m = (a + 52) | 0
                n = (a + 44) | 0
                A = (b + 8) | 0
                B = (c + 8) | 0
                C = (a + 12) | 0
                D = (a + 100) | 0
                E = (a + 96) | 0
                F = (a + 88) | 0
                G = (a + 92) | 0
                H = (a + 84) | 0
                I = (i + 4) | 0
                J = (i + 24) | 0
                K = (i + 24) | 0
                L = (p + 24) | 0
                M = z
                while (1) {
                    z = f[v >> 2] | 0
                    N = (M + -1) | 0
                    O = (N + z) | 0
                    P = f[t >> 2] | 0
                    Q = f[(P + ((((O >>> 0) / 113) | 0) << 2)) >> 2] | 0
                    R = (O >>> 0) % 113 | 0
                    O = f[(Q + ((R * 36) | 0)) >> 2] | 0
                    S = f[(Q + ((R * 36) | 0) + 12) >> 2] | 0
                    T = f[(Q + ((R * 36) | 0) + 24) >> 2] | 0
                    U = f[(Q + ((R * 36) | 0) + 32) >> 2] | 0
                    f[l >> 2] = N
                    N = f[o >> 2] | 0
                    R = (N - P) >> 2
                    if (((1 - M - z + ((R | 0) == 0 ? 0 : (((R * 113) | 0) + -1) | 0)) | 0) >>> 0 > 225) {
                        br(f[(N + -4) >> 2] | 0)
                        f[o >> 2] = (f[o >> 2] | 0) + -4
                    }
                    f[b >> 2] = O
                    f[c >> 2] = S
                    N = f[k >> 2] | 0
                    R = (((f[g >> 2] | 0) + -1) | 0) == (T | 0) ? 0 : (T + 1) | 0
                    T = ((f[s >> 2] | 0) + ((U * 12) | 0)) | 0
                    z = (S - O) | 0
                    P = ((f[a >> 2] | 0) - (f[((f[T >> 2] | 0) + (R << 2)) >> 2] | 0)) | 0
                    a: do
                        if (P) {
                            if (z >>> 0 < 3) {
                                Q = f[w >> 2] | 0
                                f[Q >> 2] = R
                                V = f[g >> 2] | 0
                                if (V >>> 0 > 1) {
                                    W = 1
                                    Y = V
                                    Z = R
                                    while (1) {
                                        Z = (Z | 0) == ((Y + -1) | 0) ? 0 : (Z + 1) | 0
                                        f[(Q + (W << 2)) >> 2] = Z
                                        W = (W + 1) | 0
                                        $ = f[g >> 2] | 0
                                        if (W >>> 0 >= $ >>> 0) {
                                            aa = $
                                            break
                                        } else Y = $
                                    }
                                } else aa = V
                                if (!z) {
                                    ba = 81
                                    break
                                } else {
                                    ca = 0
                                    da = aa
                                }
                                while (1) {
                                    Y = ((f[J >> 2] | 0) + ((X(f[I >> 2] | 0, (O + ca) | 0) | 0) << 2)) | 0
                                    if (!da) ea = 0
                                    else {
                                        W = 0
                                        do {
                                            Z = f[((f[w >> 2] | 0) + (W << 2)) >> 2] | 0
                                            Q = ((f[a >> 2] | 0) - (f[((f[T >> 2] | 0) + (Z << 2)) >> 2] | 0)) | 0
                                            do
                                                if (Q | 0) {
                                                    $ = f[y >> 2] | 0
                                                    fa = (32 - $) | 0
                                                    ga = (32 - Q) | 0
                                                    ha = f[(Y + (Z << 2)) >> 2] << ga
                                                    if ((Q | 0) > (fa | 0)) {
                                                        ia = ha >>> ga
                                                        ga = (Q - fa) | 0
                                                        f[y >> 2] = ga
                                                        fa = f[h >> 2] | (ia >>> ga)
                                                        f[h >> 2] = fa
                                                        ga = f[j >> 2] | 0
                                                        if ((ga | 0) == (f[m >> 2] | 0)) Ci(n, h)
                                                        else {
                                                            f[ga >> 2] = fa
                                                            f[j >> 2] = ga + 4
                                                        }
                                                        f[h >> 2] = ia << (32 - (f[y >> 2] | 0))
                                                        break
                                                    }
                                                    ia = f[h >> 2] | (ha >>> $)
                                                    f[h >> 2] = ia
                                                    ha = ($ + Q) | 0
                                                    f[y >> 2] = ha
                                                    if ((ha | 0) != 32) break
                                                    ha = f[j >> 2] | 0
                                                    if ((ha | 0) == (f[m >> 2] | 0)) Ci(n, h)
                                                    else {
                                                        f[ha >> 2] = ia
                                                        f[j >> 2] = ha + 4
                                                    }
                                                    f[h >> 2] = 0
                                                    f[y >> 2] = 0
                                                }
                                            while (0)
                                            W = (W + 1) | 0
                                            Q = f[g >> 2] | 0
                                        } while (W >>> 0 < Q >>> 0)
                                        ea = Q
                                    }
                                    ca = (ca + 1) | 0
                                    if (ca >>> 0 >= z >>> 0) {
                                        ba = 81
                                        break a
                                    } else da = ea
                                }
                            }
                            V = (U + 1) | 0
                            qg((N + ((V * 12) | 0)) | 0, f[(N + ((U * 12) | 0)) >> 2] | 0, f[(N + ((U * 12) | 0) + 4) >> 2] | 0)
                            W = ((f[((f[k >> 2] | 0) + ((V * 12) | 0)) >> 2] | 0) + (R << 2)) | 0
                            Y = ((f[W >> 2] | 0) + (1 << (P + -1))) | 0
                            f[W >> 2] = Y
                            W = f[A >> 2] | 0
                            Q = f[B >> 2] | 0
                            b: do
                                if ((S | 0) == (O | 0)) ja = O
                                else {
                                    Z = f[K >> 2] | 0
                                    if (!W) {
                                        if ((f[(Z + (R << 2)) >> 2] | 0) >>> 0 < Y >>> 0) {
                                            ja = S
                                            break
                                        } else {
                                            ka = S
                                            la = O
                                        }
                                        while (1) {
                                            ha = ka
                                            do {
                                                ha = (ha + -1) | 0
                                                if ((la | 0) == (ha | 0)) {
                                                    ja = la
                                                    break b
                                                }
                                                ia = ((f[L >> 2] | 0) + ((X(ha, Q) | 0) << 2) + (R << 2)) | 0
                                            } while ((f[ia >> 2] | 0) >>> 0 >= Y >>> 0)
                                            la = (la + 1) | 0
                                            if ((la | 0) == (ha | 0)) {
                                                ja = ha
                                                break b
                                            } else ka = ha
                                        }
                                    } else {
                                        ma = S
                                        na = O
                                    }
                                    while (1) {
                                        ia = na
                                        while (1) {
                                            oa = (Z + ((X(ia, W) | 0) << 2)) | 0
                                            if ((f[(oa + (R << 2)) >> 2] | 0) >>> 0 >= Y >>> 0) {
                                                pa = ma
                                                break
                                            }
                                            $ = (ia + 1) | 0
                                            if (($ | 0) == (ma | 0)) {
                                                ja = ma
                                                break b
                                            } else ia = $
                                        }
                                        while (1) {
                                            pa = (pa + -1) | 0
                                            if ((ia | 0) == (pa | 0)) {
                                                ja = ia
                                                break b
                                            }
                                            qa = ((f[L >> 2] | 0) + ((X(pa, Q) | 0) << 2)) | 0
                                            if ((f[(qa + (R << 2)) >> 2] | 0) >>> 0 < Y >>> 0) {
                                                ra = 0
                                                break
                                            }
                                        }
                                        do {
                                            ha = (oa + (ra << 2)) | 0
                                            $ = (qa + (ra << 2)) | 0
                                            ga = f[ha >> 2] | 0
                                            f[ha >> 2] = f[$ >> 2]
                                            f[$ >> 2] = ga
                                            ra = (ra + 1) | 0
                                        } while ((ra | 0) != (W | 0))
                                        na = (ia + 1) | 0
                                        if ((na | 0) == (pa | 0)) {
                                            ja = pa
                                            break
                                        } else ma = pa
                                    }
                                }
                            while (0)
                            Y = (_(z | 0) | 0) ^ 31
                            Q = (ja - O) | 0
                            Z = (S - ja) | 0
                            ga = Q >>> 0 < Z >>> 0
                            if ((Q | 0) != (Z | 0)) {
                                $ = f[D >> 2] | 0
                                if (ga) f[E >> 2] = f[E >> 2] | (1 << (31 - $))
                                ha = ($ + 1) | 0
                                f[D >> 2] = ha
                                if ((ha | 0) == 32) {
                                    ha = f[F >> 2] | 0
                                    if ((ha | 0) == (f[G >> 2] | 0)) Ci(H, E)
                                    else {
                                        f[ha >> 2] = f[E >> 2]
                                        f[F >> 2] = ha + 4
                                    }
                                    f[D >> 2] = 0
                                    f[E >> 2] = 0
                                }
                            }
                            ha = z >>> 1
                            if (ga) bg(C, Y, (ha - Q) | 0)
                            else bg(C, Y, (ha - Z) | 0)
                            ha = f[s >> 2] | 0
                            Y = f[(ha + ((U * 12) | 0)) >> 2] | 0
                            ga = (Y + (R << 2)) | 0
                            f[ga >> 2] = (f[ga >> 2] | 0) + 1
                            qg((ha + ((V * 12) | 0)) | 0, Y, f[(ha + ((U * 12) | 0) + 4) >> 2] | 0)
                            if ((ja | 0) != (O | 0)) {
                                ha = f[o >> 2] | 0
                                Y = f[t >> 2] | 0
                                ga = (ha - Y) >> 2
                                $ = f[v >> 2] | 0
                                fa = f[l >> 2] | 0
                                if ((((ga | 0) == 0 ? 0 : (((ga * 113) | 0) + -1) | 0) | 0) == ((fa + $) | 0)) {
                                    Jc(e)
                                    sa = f[v >> 2] | 0
                                    ta = f[l >> 2] | 0
                                    ua = f[o >> 2] | 0
                                    va = f[t >> 2] | 0
                                } else {
                                    sa = $
                                    ta = fa
                                    ua = ha
                                    va = Y
                                }
                                Y = (ta + sa) | 0
                                if ((ua | 0) == (va | 0)) wa = 0
                                else wa = ((f[(va + ((((Y >>> 0) / 113) | 0) << 2)) >> 2] | 0) + ((((Y >>> 0) % 113 | 0) * 36) | 0)) | 0
                                f[wa >> 2] = O
                                Y = (wa + 4) | 0
                                f[Y >> 2] = r
                                f[(Y + 4) >> 2] = x
                                f[(wa + 12) >> 2] = ja
                                f[(wa + 16) >> 2] = i
                                f[(wa + 20) >> 2] = W
                                f[(wa + 24) >> 2] = R
                                f[(wa + 28) >> 2] = Q
                                f[(wa + 32) >> 2] = U
                                f[l >> 2] = (f[l >> 2] | 0) + 1
                            }
                            if ((S | 0) != (ja | 0)) {
                                Q = f[o >> 2] | 0
                                Y = f[t >> 2] | 0
                                ha = (Q - Y) >> 2
                                fa = f[v >> 2] | 0
                                $ = f[l >> 2] | 0
                                if ((((ha | 0) == 0 ? 0 : (((ha * 113) | 0) + -1) | 0) | 0) == (($ + fa) | 0)) {
                                    Jc(e)
                                    xa = f[v >> 2] | 0
                                    ya = f[l >> 2] | 0
                                    za = f[o >> 2] | 0
                                    Aa = f[t >> 2] | 0
                                } else {
                                    xa = fa
                                    ya = $
                                    za = Q
                                    Aa = Y
                                }
                                Y = (ya + xa) | 0
                                if ((za | 0) == (Aa | 0)) Ba = 0
                                else Ba = ((f[(Aa + ((((Y >>> 0) / 113) | 0) << 2)) >> 2] | 0) + ((((Y >>> 0) % 113 | 0) * 36) | 0)) | 0
                                f[Ba >> 2] = ja
                                f[(Ba + 4) >> 2] = i
                                f[(Ba + 8) >> 2] = W
                                f[(Ba + 12) >> 2] = S
                                Y = (Ba + 16) | 0
                                f[Y >> 2] = p
                                f[(Y + 4) >> 2] = q
                                f[(Ba + 24) >> 2] = R
                                f[(Ba + 28) >> 2] = Z
                                f[(Ba + 32) >> 2] = V
                                Z = ((f[l >> 2] | 0) + 1) | 0
                                f[l >> 2] = Z
                                Ca = Z
                            } else ba = 81
                        } else ba = 81
                    while (0)
                    if ((ba | 0) == 81) {
                        ba = 0
                        Ca = f[l >> 2] | 0
                    }
                    if (!Ca) break
                    else M = Ca
                }
            }
            Ca = f[t >> 2] | 0
            M = f[v >> 2] | 0
            Ba = (Ca + ((((M >>> 0) / 113) | 0) << 2)) | 0
            q = f[o >> 2] | 0
            p = q
            i = Ca
            if ((q | 0) == (Ca | 0)) {
                Da = 0
                Ea = 0
            } else {
                ja = ((f[Ba >> 2] | 0) + ((((M >>> 0) % 113 | 0) * 36) | 0)) | 0
                Da = ja
                Ea = ja
            }
            ja = Ba
            Ba = Ea
            c: while (1) {
                Ea = Ba
                do {
                    M = Ea
                    if ((Da | 0) == (M | 0)) break c
                    Ea = (M + 36) | 0
                } while (((Ea - (f[ja >> 2] | 0)) | 0) != 4068)
                Ea = (ja + 4) | 0
                ja = Ea
                Ba = f[Ea >> 2] | 0
            }
            f[l >> 2] = 0
            l = (p - i) >> 2
            if (l >>> 0 > 2) {
                i = Ca
                do {
                    br(f[i >> 2] | 0)
                    i = ((f[t >> 2] | 0) + 4) | 0
                    f[t >> 2] = i
                    Fa = f[o >> 2] | 0
                    Ga = (Fa - i) >> 2
                } while (Ga >>> 0 > 2)
                Ha = Ga
                Ia = i
                Ja = Fa
            } else {
                Ha = l
                Ia = Ca
                Ja = q
            }
            switch (Ha | 0) {
                case 1: {
                    Ka = 56
                    ba = 95
                    break
                }
                case 2: {
                    Ka = 113
                    ba = 95
                    break
                }
                default: {
                }
            }
            if ((ba | 0) == 95) f[v >> 2] = Ka
            if ((Ia | 0) != (Ja | 0)) {
                Ka = Ia
                do {
                    br(f[Ka >> 2] | 0)
                    Ka = (Ka + 4) | 0
                } while ((Ka | 0) != (Ja | 0))
                Ja = f[t >> 2] | 0
                t = f[o >> 2] | 0
                if ((t | 0) != (Ja | 0)) f[o >> 2] = t + (~(((t + -4 - Ja) | 0) >>> 2) << 2)
            }
            Ja = f[e >> 2] | 0
            if (!Ja) {
                u = d
                return
            }
            br(Ja)
            u = d
            return
        }
        function ob(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                J = 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,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0,
                xa = 0,
                ya = 0,
                za = 0,
                Aa = 0.0,
                Ba = 0,
                Ca = 0,
                Da = 0,
                Ea = 0,
                Fa = 0,
                Ga = 0,
                Ha = 0,
                Ia = 0,
                Ja = 0,
                Ka = 0,
                La = 0,
                Ma = 0,
                Na = 0,
                Oa = 0,
                Pa = 0,
                Qa = 0,
                Ra = 0,
                Sa = 0,
                Ta = 0,
                Ua = 0,
                Va = 0,
                Wa = 0,
                Xa = 0,
                Ya = 0,
                Za = 0,
                _a = 0,
                $a = 0,
                ab = 0,
                bb = 0.0,
                cb = 0,
                db = 0,
                eb = 0,
                fb = 0,
                gb = 0,
                hb = 0,
                ib = 0,
                jb = 0.0,
                kb = 0.0,
                lb = 0.0,
                mb = 0.0,
                nb = 0.0,
                ob = 0.0,
                pb = 0.0,
                qb = 0.0,
                rb = 0.0,
                sb = 0.0,
                tb = 0
            i = u
            u = (u + 512) | 0
            j = i
            k = (d + c) | 0
            l = (0 - k) | 0
            m = (a + 4) | 0
            n = (a + 100) | 0
            o = b
            b = 0
            a: while (1) {
                switch (o | 0) {
                    case 46: {
                        p = 6
                        break a
                        break
                    }
                    case 48:
                        break
                    default: {
                        q = 0
                        r = o
                        s = b
                        t = 0
                        v = 0
                        break a
                    }
                }
                w = f[m >> 2] | 0
                if (w >>> 0 < (f[n >> 2] | 0) >>> 0) {
                    f[m >> 2] = w + 1
                    o = h[w >> 0] | 0
                    b = 1
                    continue
                } else {
                    o = Di(a) | 0
                    b = 1
                    continue
                }
            }
            if ((p | 0) == 6) {
                o = f[m >> 2] | 0
                if (o >>> 0 < (f[n >> 2] | 0) >>> 0) {
                    f[m >> 2] = o + 1
                    x = h[o >> 0] | 0
                } else x = Di(a) | 0
                if ((x | 0) == 48) {
                    o = 0
                    w = 0
                    while (1) {
                        y = Tn(o | 0, w | 0, -1, -1) | 0
                        z = I
                        A = f[m >> 2] | 0
                        if (A >>> 0 < (f[n >> 2] | 0) >>> 0) {
                            f[m >> 2] = A + 1
                            B = h[A >> 0] | 0
                        } else B = Di(a) | 0
                        if ((B | 0) == 48) {
                            o = y
                            w = z
                        } else {
                            q = 1
                            r = B
                            s = 1
                            t = y
                            v = z
                            break
                        }
                    }
                } else {
                    q = 1
                    r = x
                    s = b
                    t = 0
                    v = 0
                }
            }
            f[j >> 2] = 0
            b = (r + -48) | 0
            x = (r | 0) == 46
            b: do
                if (x | (b >>> 0 < 10)) {
                    B = (j + 496) | 0
                    w = 0
                    o = 0
                    z = 0
                    y = q
                    A = s
                    C = r
                    D = x
                    E = b
                    F = t
                    G = v
                    H = 0
                    J = 0
                    c: while (1) {
                        do
                            if (D)
                                if (!y) {
                                    L = w
                                    M = o
                                    N = 1
                                    O = z
                                    P = A
                                    Q = H
                                    R = J
                                    S = H
                                    T = J
                                } else break c
                            else {
                                U = Tn(H | 0, J | 0, 1, 0) | 0
                                V = I
                                W = (C | 0) != 48
                                if ((o | 0) >= 125) {
                                    if (!W) {
                                        L = w
                                        M = o
                                        N = y
                                        O = z
                                        P = A
                                        Q = F
                                        R = G
                                        S = U
                                        T = V
                                        break
                                    }
                                    f[B >> 2] = f[B >> 2] | 1
                                    L = w
                                    M = o
                                    N = y
                                    O = z
                                    P = A
                                    Q = F
                                    R = G
                                    S = U
                                    T = V
                                    break
                                }
                                Y = (j + (o << 2)) | 0
                                if (!w) Z = E
                                else Z = (C + -48 + (((f[Y >> 2] | 0) * 10) | 0)) | 0
                                f[Y >> 2] = Z
                                Y = (w + 1) | 0
                                _ = (Y | 0) == 9
                                L = _ ? 0 : Y
                                M = (o + (_ & 1)) | 0
                                N = y
                                O = W ? U : z
                                P = 1
                                Q = F
                                R = G
                                S = U
                                T = V
                            }
                        while (0)
                        V = f[m >> 2] | 0
                        if (V >>> 0 < (f[n >> 2] | 0) >>> 0) {
                            f[m >> 2] = V + 1
                            $ = h[V >> 0] | 0
                        } else $ = Di(a) | 0
                        E = ($ + -48) | 0
                        D = ($ | 0) == 46
                        if (!(D | (E >>> 0 < 10))) {
                            aa = L
                            ba = M
                            ca = O
                            da = N
                            ea = $
                            fa = P
                            ga = S
                            ha = Q
                            ia = T
                            ja = R
                            p = 29
                            break b
                        } else {
                            w = L
                            o = M
                            z = O
                            y = N
                            A = P
                            C = $
                            F = Q
                            G = R
                            H = S
                            J = T
                        }
                    }
                    ka = w
                    la = o
                    ma = z
                    na = H
                    oa = J
                    pa = F
                    qa = G
                    ra = (A | 0) != 0
                    p = 37
                } else {
                    aa = 0
                    ba = 0
                    ca = 0
                    da = q
                    ea = r
                    fa = s
                    ga = 0
                    ha = t
                    ia = 0
                    ja = v
                    p = 29
                }
            while (0)
            do
                if ((p | 0) == 29) {
                    v = (da | 0) == 0
                    t = v ? ga : ha
                    s = v ? ia : ja
                    v = (fa | 0) != 0
                    if (!(v & ((ea | 32 | 0) == 101)))
                        if ((ea | 0) > -1) {
                            ka = aa
                            la = ba
                            ma = ca
                            na = ga
                            oa = ia
                            pa = t
                            qa = s
                            ra = v
                            p = 37
                            break
                        } else {
                            sa = aa
                            ta = ba
                            ua = ca
                            va = ga
                            wa = ia
                            xa = v
                            ya = t
                            za = s
                            p = 39
                            break
                        }
                    v = De(a, g) | 0
                    r = I
                    if (((v | 0) == 0) & ((r | 0) == -2147483648)) {
                        if (!g) {
                            Rm(a, 0)
                            Aa = 0.0
                            break
                        }
                        if (!(f[n >> 2] | 0)) {
                            Ba = 0
                            Ca = 0
                        } else {
                            f[m >> 2] = (f[m >> 2] | 0) + -1
                            Ba = 0
                            Ca = 0
                        }
                    } else {
                        Ba = v
                        Ca = r
                    }
                    r = Tn(Ba | 0, Ca | 0, t | 0, s | 0) | 0
                    Da = aa
                    Ea = ba
                    Fa = ca
                    Ga = r
                    Ha = ga
                    Ia = I
                    Ja = ia
                    p = 41
                }
            while (0)
            if ((p | 0) == 37)
                if (f[n >> 2] | 0) {
                    f[m >> 2] = (f[m >> 2] | 0) + -1
                    if (ra) {
                        Da = ka
                        Ea = la
                        Fa = ma
                        Ga = pa
                        Ha = na
                        Ia = qa
                        Ja = oa
                        p = 41
                    } else p = 40
                } else {
                    sa = ka
                    ta = la
                    ua = ma
                    va = na
                    wa = oa
                    xa = ra
                    ya = pa
                    za = qa
                    p = 39
                }
            if ((p | 0) == 39)
                if (xa) {
                    Da = sa
                    Ea = ta
                    Fa = ua
                    Ga = ya
                    Ha = va
                    Ia = za
                    Ja = wa
                    p = 41
                } else p = 40
            do
                if ((p | 0) == 40) {
                    wa = ir() | 0
                    f[wa >> 2] = 22
                    Rm(a, 0)
                    Aa = 0.0
                } else if ((p | 0) == 41) {
                    wa = f[j >> 2] | 0
                    if (!wa) {
                        Aa = +(e | 0) * 0.0
                        break
                    }
                    if ((((Ja | 0) < 0) | (((Ja | 0) == 0) & (Ha >>> 0 < 10))) & (((Ga | 0) == (Ha | 0)) & ((Ia | 0) == (Ja | 0))) ? ((c | 0) > 30) | (((wa >>> c) | 0) == 0) : 0) {
                        Aa = +(e | 0) * +(wa >>> 0)
                        break
                    }
                    wa = ((d | 0) / -2) | 0
                    za = (((wa | 0) < 0) << 31) >> 31
                    if (((Ia | 0) > (za | 0)) | (((Ia | 0) == (za | 0)) & (Ga >>> 0 > wa >>> 0))) {
                        wa = ir() | 0
                        f[wa >> 2] = 34
                        Aa = +(e | 0) * 1797693134862315708145274.0e284 * 1797693134862315708145274.0e284
                        break
                    }
                    wa = (d + -106) | 0
                    za = (((wa | 0) < 0) << 31) >> 31
                    if (((Ia | 0) < (za | 0)) | (((Ia | 0) == (za | 0)) & (Ga >>> 0 < wa >>> 0))) {
                        wa = ir() | 0
                        f[wa >> 2] = 34
                        Aa = +(e | 0) * 2.2250738585072014e-308 * 2.2250738585072014e-308
                        break
                    }
                    if (!Da) Ka = Ea
                    else {
                        if ((Da | 0) < 9) {
                            wa = (j + (Ea << 2)) | 0
                            za = Da
                            va = f[wa >> 2] | 0
                            while (1) {
                                va = (va * 10) | 0
                                if ((za | 0) >= 8) break
                                else za = (za + 1) | 0
                            }
                            f[wa >> 2] = va
                        }
                        Ka = (Ea + 1) | 0
                    }
                    if ((Fa | 0) < 9 ? ((Fa | 0) <= (Ga | 0)) & ((Ga | 0) < 18) : 0) {
                        if ((Ga | 0) == 9) {
                            Aa = +(e | 0) * +((f[j >> 2] | 0) >>> 0)
                            break
                        }
                        if ((Ga | 0) < 9) {
                            Aa = (+(e | 0) * +((f[j >> 2] | 0) >>> 0)) / +(f[(6408 + ((8 - Ga) << 2)) >> 2] | 0)
                            break
                        }
                        za = (c + 27 + (X(Ga, -3) | 0)) | 0
                        A = f[j >> 2] | 0
                        if (((za | 0) > 30) | (((A >>> za) | 0) == 0)) {
                            Aa = +(e | 0) * +(A >>> 0) * +(f[(6408 + ((Ga + -10) << 2)) >> 2] | 0)
                            break
                        }
                    }
                    A = (Ga | 0) % 9 | 0
                    if (!A) {
                        La = 0
                        Ma = Ka
                        Na = 0
                        Oa = Ga
                    } else {
                        za = (Ga | 0) > -1 ? A : (A + 9) | 0
                        A = f[(6408 + ((8 - za) << 2)) >> 2] | 0
                        if (Ka) {
                            G = (1e9 / (A | 0)) | 0
                            F = 0
                            J = 0
                            H = Ga
                            z = 0
                            do {
                                o = (j + (z << 2)) | 0
                                w = f[o >> 2] | 0
                                ya = ((((w >>> 0) / (A >>> 0)) | 0) + F) | 0
                                f[o >> 2] = ya
                                F = X(G, (w >>> 0) % (A >>> 0) | 0) | 0
                                w = ((z | 0) == (J | 0)) & ((ya | 0) == 0)
                                H = w ? (H + -9) | 0 : H
                                J = w ? (J + 1) & 127 : J
                                z = (z + 1) | 0
                            } while ((z | 0) != (Ka | 0))
                            if (!F) {
                                Pa = J
                                Qa = Ka
                                Ra = H
                            } else {
                                f[(j + (Ka << 2)) >> 2] = F
                                Pa = J
                                Qa = (Ka + 1) | 0
                                Ra = H
                            }
                        } else {
                            Pa = 0
                            Qa = 0
                            Ra = Ga
                        }
                        La = 0
                        Ma = Qa
                        Na = Pa
                        Oa = (9 - za + Ra) | 0
                    }
                    d: while (1) {
                        z = (Oa | 0) < 18
                        A = (Oa | 0) == 18
                        G = (j + (Na << 2)) | 0
                        va = La
                        wa = Ma
                        while (1) {
                            if (!z) {
                                if (!A) {
                                    Sa = va
                                    Ta = Na
                                    Ua = Oa
                                    Va = wa
                                    break d
                                }
                                if ((f[G >> 2] | 0) >>> 0 >= 9007199) {
                                    Sa = va
                                    Ta = Na
                                    Ua = 18
                                    Va = wa
                                    break d
                                }
                            }
                            w = 0
                            Wa = wa
                            ya = (wa + 127) | 0
                            while (1) {
                                o = ya & 127
                                ua = (j + (o << 2)) | 0
                                ta = Rn(f[ua >> 2] | 0, 0, 29) | 0
                                sa = Tn(ta | 0, I | 0, w | 0, 0) | 0
                                ta = I
                                if ((ta >>> 0 > 0) | (((ta | 0) == 0) & (sa >>> 0 > 1e9))) {
                                    xa = up(sa | 0, ta | 0, 1e9, 0) | 0
                                    qa = an(sa | 0, ta | 0, 1e9, 0) | 0
                                    Xa = xa
                                    Ya = qa
                                } else {
                                    Xa = 0
                                    Ya = sa
                                }
                                f[ua >> 2] = Ya
                                ua = (o | 0) == (Na | 0)
                                Wa = ((Ya | 0) == 0) & ((((o | 0) != (((Wa + 127) & 127) | 0)) | ua) ^ 1) ? o : Wa
                                if (ua) break
                                else {
                                    w = Xa
                                    ya = (o + -1) | 0
                                }
                            }
                            va = (va + -29) | 0
                            if (Xa | 0) break
                            else wa = Wa
                        }
                        wa = (Na + 127) & 127
                        G = (Wa + 127) & 127
                        A = (j + (((Wa + 126) & 127) << 2)) | 0
                        if ((wa | 0) == (Wa | 0)) {
                            f[A >> 2] = f[A >> 2] | f[(j + (G << 2)) >> 2]
                            Za = G
                        } else Za = Wa
                        f[(j + (wa << 2)) >> 2] = Xa
                        La = va
                        Ma = Za
                        Na = wa
                        Oa = (Oa + 9) | 0
                    }
                    e: while (1) {
                        za = (Va + 1) & 127
                        H = (j + (((Va + 127) & 127) << 2)) | 0
                        J = Sa
                        F = Ta
                        wa = Ua
                        while (1) {
                            G = (wa | 0) == 18
                            A = (wa | 0) > 27 ? 9 : 1
                            _a = J
                            $a = F
                            while (1) {
                                z = 0
                                while (1) {
                                    ya = (z + $a) & 127
                                    if ((ya | 0) == (Va | 0)) {
                                        ab = 2
                                        p = 88
                                        break
                                    }
                                    w = f[(j + (ya << 2)) >> 2] | 0
                                    ya = f[(6440 + (z << 2)) >> 2] | 0
                                    if (w >>> 0 < ya >>> 0) {
                                        ab = 2
                                        p = 88
                                        break
                                    }
                                    if (w >>> 0 > ya >>> 0) break
                                    ya = (z + 1) | 0
                                    if ((z | 0) < 1) z = ya
                                    else {
                                        ab = ya
                                        p = 88
                                        break
                                    }
                                }
                                if ((p | 0) == 88 ? ((p = 0), G & ((ab | 0) == 2)) : 0) {
                                    bb = 0.0
                                    cb = 0
                                    db = Va
                                    break e
                                }
                                eb = (A + _a) | 0
                                if (($a | 0) == (Va | 0)) {
                                    _a = eb
                                    $a = Va
                                } else break
                            }
                            G = ((1 << A) + -1) | 0
                            z = 1e9 >>> A
                            fb = 0
                            gb = $a
                            hb = wa
                            ya = $a
                            do {
                                w = (j + (ya << 2)) | 0
                                o = f[w >> 2] | 0
                                ua = ((o >>> A) + fb) | 0
                                f[w >> 2] = ua
                                fb = X(o & G, z) | 0
                                o = ((ya | 0) == (gb | 0)) & ((ua | 0) == 0)
                                hb = o ? (hb + -9) | 0 : hb
                                gb = o ? (gb + 1) & 127 : gb
                                ya = (ya + 1) & 127
                            } while ((ya | 0) != (Va | 0))
                            if (!fb) {
                                J = eb
                                F = gb
                                wa = hb
                                continue
                            }
                            if ((za | 0) != (gb | 0)) break
                            f[H >> 2] = f[H >> 2] | 1
                            J = eb
                            F = gb
                            wa = hb
                        }
                        f[(j + (Va << 2)) >> 2] = fb
                        Sa = eb
                        Ta = gb
                        Ua = hb
                        Va = za
                    }
                    while (1) {
                        wa = (cb + $a) & 127
                        F = (db + 1) & 127
                        if ((wa | 0) == (db | 0)) {
                            f[(j + ((F + -1) << 2)) >> 2] = 0
                            ib = F
                        } else ib = db
                        bb = bb * 1.0e9 + +((f[(j + (wa << 2)) >> 2] | 0) >>> 0)
                        cb = (cb + 1) | 0
                        if ((cb | 0) == 2) break
                        else db = ib
                    }
                    jb = +(e | 0)
                    kb = bb * jb
                    wa = (_a + 53) | 0
                    F = (wa - d) | 0
                    J = (F | 0) < (c | 0)
                    H = J ? ((F | 0) > 0 ? F : 0) : c
                    if ((H | 0) < 53) {
                        lb = +Gq(+Wj(1.0, (105 - H) | 0), kb)
                        mb = +Sq(kb, +Wj(1.0, (53 - H) | 0))
                        nb = lb
                        ob = mb
                        pb = lb + (kb - mb)
                    } else {
                        nb = 0.0
                        ob = 0.0
                        pb = kb
                    }
                    va = ($a + 2) & 127
                    if ((va | 0) != (ib | 0)) {
                        ya = f[(j + (va << 2)) >> 2] | 0
                        do
                            if (ya >>> 0 >= 5e8) {
                                if ((ya | 0) != 5e8) {
                                    qb = jb * 0.75 + ob
                                    break
                                }
                                if (((($a + 3) & 127) | 0) == (ib | 0)) {
                                    qb = jb * 0.5 + ob
                                    break
                                } else {
                                    qb = jb * 0.75 + ob
                                    break
                                }
                            } else {
                                if ((ya | 0) == 0 ? ((($a + 3) & 127) | 0) == (ib | 0) : 0) {
                                    qb = ob
                                    break
                                }
                                qb = jb * 0.25 + ob
                            }
                        while (0)
                        if (((53 - H) | 0) > 1 ? !(+Sq(qb, 1.0) != 0.0) : 0) rb = qb + 1.0
                        else rb = qb
                    } else rb = ob
                    jb = pb + rb - nb
                    do
                        if (((wa & 2147483647) | 0) > ((-2 - k) | 0)) {
                            ya = !(+K(+jb) >= 9007199254740992.0)
                            va = (_a + ((ya ^ 1) & 1)) | 0
                            kb = ya ? jb : jb * 0.5
                            if (((va + 50) | 0) <= (l | 0) ? !((rb != 0.0) & (J & (((H | 0) != (F | 0)) | ya))) : 0) {
                                sb = kb
                                tb = va
                                break
                            }
                            ya = ir() | 0
                            f[ya >> 2] = 34
                            sb = kb
                            tb = va
                        } else {
                            sb = jb
                            tb = _a
                        }
                    while (0)
                    Aa = +Hq(sb, tb)
                }
            while (0)
            u = i
            return +Aa
        }
        function pb(a, c, d, e, g, i) {
            a = a | 0
            c = +c
            d = d | 0
            e = e | 0
            g = g | 0
            i = i | 0
            var j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                p = 0,
                q = 0.0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0.0,
                C = 0,
                D = 0.0,
                E = 0,
                F = 0,
                G = 0,
                H = 0.0,
                J = 0,
                K = 0,
                L = 0,
                M = 0,
                N = 0,
                O = 0.0,
                P = 0,
                Q = 0,
                R = 0,
                S = 0,
                T = 0,
                U = 0,
                V = 0,
                W = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0.0,
                ga = 0.0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0,
                xa = 0,
                ya = 0,
                za = 0,
                Aa = 0,
                Ba = 0,
                Ca = 0,
                Da = 0,
                Ea = 0,
                Fa = 0
            j = u
            u = (u + 560) | 0
            k = (j + 8) | 0
            l = j
            m = (j + 524) | 0
            n = m
            o = (j + 512) | 0
            f[l >> 2] = 0
            p = (o + 12) | 0
            xo(c) | 0
            if ((I | 0) < 0) {
                q = -c
                r = 1
                s = 15511
            } else {
                q = c
                r = (((g & 2049) | 0) != 0) & 1
                s = ((g & 2048) | 0) == 0 ? (((g & 1) | 0) == 0 ? 15512 : 15517) : 15514
            }
            xo(q) | 0
            do
                if ((0 == 0) & (((I & 2146435072) | 0) == 2146435072)) {
                    t = ((i & 32) | 0) != 0
                    v = (r + 3) | 0
                    Hk(a, 32, d, v, g & -65537)
                    ep(a, s, r)
                    ep(a, (q != q) | (0.0 != 0.0) ? (t ? 17461 : 15538) : t ? 15530 : 15534, 3)
                    Hk(a, 32, d, v, g ^ 8192)
                    w = v
                } else {
                    c = +Iq(q, l) * 2.0
                    v = c != 0.0
                    if (v) f[l >> 2] = (f[l >> 2] | 0) + -1
                    t = i | 32
                    if ((t | 0) == 97) {
                        x = i & 32
                        y = (x | 0) == 0 ? s : (s + 9) | 0
                        z = r | 2
                        A = (12 - e) | 0
                        do
                            if (!((e >>> 0 > 11) | ((A | 0) == 0))) {
                                B = 8.0
                                C = A
                                do {
                                    C = (C + -1) | 0
                                    B = B * 16.0
                                } while ((C | 0) != 0)
                                if ((b[y >> 0] | 0) == 45) {
                                    D = -(B + (-c - B))
                                    break
                                } else {
                                    D = c + B - B
                                    break
                                }
                            } else D = c
                        while (0)
                        A = f[l >> 2] | 0
                        C = (A | 0) < 0 ? (0 - A) | 0 : A
                        E = Jj(C, (((C | 0) < 0) << 31) >> 31, p) | 0
                        if ((E | 0) == (p | 0)) {
                            C = (o + 11) | 0
                            b[C >> 0] = 48
                            F = C
                        } else F = E
                        b[(F + -1) >> 0] = ((A >> 31) & 2) + 43
                        A = (F + -2) | 0
                        b[A >> 0] = i + 15
                        E = (e | 0) < 1
                        C = ((g & 8) | 0) == 0
                        G = m
                        H = D
                        while (1) {
                            J = ~~H
                            K = (G + 1) | 0
                            b[G >> 0] = x | h[(15542 + J) >> 0]
                            H = (H - +(J | 0)) * 16.0
                            if (((K - n) | 0) == 1 ? !(C & (E & (H == 0.0))) : 0) {
                                b[K >> 0] = 46
                                L = (G + 2) | 0
                            } else L = K
                            if (!(H != 0.0)) break
                            else G = L
                        }
                        G = L
                        if ((e | 0) != 0 ? ((-2 - n + G) | 0) < (e | 0) : 0) {
                            M = (G - n) | 0
                            N = (e + 2) | 0
                        } else {
                            E = (G - n) | 0
                            M = E
                            N = E
                        }
                        E = (p - A) | 0
                        G = (E + z + N) | 0
                        Hk(a, 32, d, G, g)
                        ep(a, y, z)
                        Hk(a, 48, d, G, g ^ 65536)
                        ep(a, m, M)
                        Hk(a, 48, (N - M) | 0, 0, 0)
                        ep(a, A, E)
                        Hk(a, 32, d, G, g ^ 8192)
                        w = G
                        break
                    }
                    G = (e | 0) < 0 ? 6 : e
                    if (v) {
                        E = ((f[l >> 2] | 0) + -28) | 0
                        f[l >> 2] = E
                        O = c * 268435456.0
                        P = E
                    } else {
                        O = c
                        P = f[l >> 2] | 0
                    }
                    E = (P | 0) < 0 ? k : (k + 288) | 0
                    C = E
                    H = O
                    do {
                        x = ~~H >>> 0
                        f[C >> 2] = x
                        C = (C + 4) | 0
                        H = (H - +(x >>> 0)) * 1.0e9
                    } while (H != 0.0)
                    if ((P | 0) > 0) {
                        v = E
                        A = C
                        z = P
                        while (1) {
                            y = (z | 0) < 29 ? z : 29
                            x = (A + -4) | 0
                            if (x >>> 0 >= v >>> 0) {
                                K = x
                                x = 0
                                do {
                                    J = Rn(f[K >> 2] | 0, 0, y | 0) | 0
                                    Q = Tn(J | 0, I | 0, x | 0, 0) | 0
                                    J = I
                                    R = an(Q | 0, J | 0, 1e9, 0) | 0
                                    f[K >> 2] = R
                                    x = up(Q | 0, J | 0, 1e9, 0) | 0
                                    K = (K + -4) | 0
                                } while (K >>> 0 >= v >>> 0)
                                if (x) {
                                    K = (v + -4) | 0
                                    f[K >> 2] = x
                                    S = K
                                } else S = v
                            } else S = v
                            K = A
                            while (1) {
                                if (K >>> 0 <= S >>> 0) break
                                J = (K + -4) | 0
                                if (!(f[J >> 2] | 0)) K = J
                                else break
                            }
                            x = ((f[l >> 2] | 0) - y) | 0
                            f[l >> 2] = x
                            if ((x | 0) > 0) {
                                v = S
                                A = K
                                z = x
                            } else {
                                T = S
                                U = K
                                V = x
                                break
                            }
                        }
                    } else {
                        T = E
                        U = C
                        V = P
                    }
                    if ((V | 0) < 0) {
                        z = (((((G + 25) | 0) / 9) | 0) + 1) | 0
                        A = (t | 0) == 102
                        v = T
                        x = U
                        J = V
                        while (1) {
                            Q = (0 - J) | 0
                            R = (Q | 0) < 9 ? Q : 9
                            if (v >>> 0 < x >>> 0) {
                                Q = ((1 << R) + -1) | 0
                                W = 1e9 >>> R
                                Y = 0
                                Z = v
                                do {
                                    _ = f[Z >> 2] | 0
                                    f[Z >> 2] = (_ >>> R) + Y
                                    Y = X(_ & Q, W) | 0
                                    Z = (Z + 4) | 0
                                } while (Z >>> 0 < x >>> 0)
                                Z = (f[v >> 2] | 0) == 0 ? (v + 4) | 0 : v
                                if (!Y) {
                                    $ = Z
                                    aa = x
                                } else {
                                    f[x >> 2] = Y
                                    $ = Z
                                    aa = (x + 4) | 0
                                }
                            } else {
                                $ = (f[v >> 2] | 0) == 0 ? (v + 4) | 0 : v
                                aa = x
                            }
                            Z = A ? E : $
                            W = (((aa - Z) >> 2) | 0) > (z | 0) ? (Z + (z << 2)) | 0 : aa
                            J = ((f[l >> 2] | 0) + R) | 0
                            f[l >> 2] = J
                            if ((J | 0) >= 0) {
                                ba = $
                                ca = W
                                break
                            } else {
                                v = $
                                x = W
                            }
                        }
                    } else {
                        ba = T
                        ca = U
                    }
                    x = E
                    if (ba >>> 0 < ca >>> 0) {
                        v = (((x - ba) >> 2) * 9) | 0
                        J = f[ba >> 2] | 0
                        if (J >>> 0 < 10) da = v
                        else {
                            z = v
                            v = 10
                            while (1) {
                                v = (v * 10) | 0
                                A = (z + 1) | 0
                                if (J >>> 0 < v >>> 0) {
                                    da = A
                                    break
                                } else z = A
                            }
                        }
                    } else da = 0
                    z = (t | 0) == 103
                    v = (G | 0) != 0
                    J = (G - ((t | 0) != 102 ? da : 0) + (((v & z) << 31) >> 31)) | 0
                    if ((J | 0) < ((((((ca - x) >> 2) * 9) | 0) + -9) | 0)) {
                        A = (J + 9216) | 0
                        J = (E + 4 + (((((A | 0) / 9) | 0) + -1024) << 2)) | 0
                        C = (A | 0) % 9 | 0
                        if ((C | 0) < 8) {
                            A = C
                            C = 10
                            while (1) {
                                W = (C * 10) | 0
                                if ((A | 0) < 7) {
                                    A = (A + 1) | 0
                                    C = W
                                } else {
                                    ea = W
                                    break
                                }
                            }
                        } else ea = 10
                        C = f[J >> 2] | 0
                        A = (C >>> 0) % (ea >>> 0) | 0
                        t = ((J + 4) | 0) == (ca | 0)
                        if (!(t & ((A | 0) == 0))) {
                            B = (((((C >>> 0) / (ea >>> 0)) | 0) & 1) | 0) == 0 ? 9007199254740992.0 : 9007199254740994.0
                            W = ((ea | 0) / 2) | 0
                            H = A >>> 0 < W >>> 0 ? 0.5 : t & ((A | 0) == (W | 0)) ? 1.0 : 1.5
                            if (!r) {
                                fa = H
                                ga = B
                            } else {
                                W = (b[s >> 0] | 0) == 45
                                fa = W ? -H : H
                                ga = W ? -B : B
                            }
                            W = (C - A) | 0
                            f[J >> 2] = W
                            if (ga + fa != ga) {
                                A = (W + ea) | 0
                                f[J >> 2] = A
                                if (A >>> 0 > 999999999) {
                                    A = ba
                                    W = J
                                    while (1) {
                                        C = (W + -4) | 0
                                        f[W >> 2] = 0
                                        if (C >>> 0 < A >>> 0) {
                                            t = (A + -4) | 0
                                            f[t >> 2] = 0
                                            ha = t
                                        } else ha = A
                                        t = ((f[C >> 2] | 0) + 1) | 0
                                        f[C >> 2] = t
                                        if (t >>> 0 > 999999999) {
                                            A = ha
                                            W = C
                                        } else {
                                            ia = ha
                                            ja = C
                                            break
                                        }
                                    }
                                } else {
                                    ia = ba
                                    ja = J
                                }
                                W = (((x - ia) >> 2) * 9) | 0
                                A = f[ia >> 2] | 0
                                if (A >>> 0 < 10) {
                                    ka = ja
                                    la = W
                                    ma = ia
                                } else {
                                    C = W
                                    W = 10
                                    while (1) {
                                        W = (W * 10) | 0
                                        t = (C + 1) | 0
                                        if (A >>> 0 < W >>> 0) {
                                            ka = ja
                                            la = t
                                            ma = ia
                                            break
                                        } else C = t
                                    }
                                }
                            } else {
                                ka = J
                                la = da
                                ma = ba
                            }
                        } else {
                            ka = J
                            la = da
                            ma = ba
                        }
                        C = (ka + 4) | 0
                        na = la
                        oa = ca >>> 0 > C >>> 0 ? C : ca
                        pa = ma
                    } else {
                        na = da
                        oa = ca
                        pa = ba
                    }
                    C = oa
                    while (1) {
                        if (C >>> 0 <= pa >>> 0) {
                            qa = 0
                            break
                        }
                        W = (C + -4) | 0
                        if (!(f[W >> 2] | 0)) C = W
                        else {
                            qa = 1
                            break
                        }
                    }
                    J = (0 - na) | 0
                    do
                        if (z) {
                            W = (G + ((v ^ 1) & 1)) | 0
                            if (((W | 0) > (na | 0)) & ((na | 0) > -5)) {
                                ra = (i + -1) | 0
                                sa = (W + -1 - na) | 0
                            } else {
                                ra = (i + -2) | 0
                                sa = (W + -1) | 0
                            }
                            W = g & 8
                            if (!W) {
                                if (qa ? ((A = f[(C + -4) >> 2] | 0), (A | 0) != 0) : 0)
                                    if (!((A >>> 0) % 10 | 0)) {
                                        t = 0
                                        Z = 10
                                        while (1) {
                                            Z = (Z * 10) | 0
                                            Q = (t + 1) | 0
                                            if ((A >>> 0) % (Z >>> 0) | 0 | 0) {
                                                ta = Q
                                                break
                                            } else t = Q
                                        }
                                    } else ta = 0
                                else ta = 9
                                t = (((((C - x) >> 2) * 9) | 0) + -9) | 0
                                if ((ra | 32 | 0) == 102) {
                                    Z = (t - ta) | 0
                                    A = (Z | 0) > 0 ? Z : 0
                                    ua = ra
                                    va = (sa | 0) < (A | 0) ? sa : A
                                    wa = 0
                                    break
                                } else {
                                    A = (t + na - ta) | 0
                                    t = (A | 0) > 0 ? A : 0
                                    ua = ra
                                    va = (sa | 0) < (t | 0) ? sa : t
                                    wa = 0
                                    break
                                }
                            } else {
                                ua = ra
                                va = sa
                                wa = W
                            }
                        } else {
                            ua = i
                            va = G
                            wa = g & 8
                        }
                    while (0)
                    G = va | wa
                    x = ((G | 0) != 0) & 1
                    v = (ua | 32 | 0) == 102
                    if (v) {
                        xa = 0
                        ya = (na | 0) > 0 ? na : 0
                    } else {
                        z = (na | 0) < 0 ? J : na
                        t = Jj(z, (((z | 0) < 0) << 31) >> 31, p) | 0
                        z = p
                        if (((z - t) | 0) < 2) {
                            A = t
                            while (1) {
                                Z = (A + -1) | 0
                                b[Z >> 0] = 48
                                if (((z - Z) | 0) < 2) A = Z
                                else {
                                    za = Z
                                    break
                                }
                            }
                        } else za = t
                        b[(za + -1) >> 0] = ((na >> 31) & 2) + 43
                        A = (za + -2) | 0
                        b[A >> 0] = ua
                        xa = A
                        ya = (z - A) | 0
                    }
                    A = (r + 1 + va + x + ya) | 0
                    Hk(a, 32, d, A, g)
                    ep(a, s, r)
                    Hk(a, 48, d, A, g ^ 65536)
                    if (v) {
                        J = pa >>> 0 > E >>> 0 ? E : pa
                        Z = (m + 9) | 0
                        R = Z
                        Y = (m + 8) | 0
                        Q = J
                        do {
                            K = Jj(f[Q >> 2] | 0, 0, Z) | 0
                            if ((Q | 0) == (J | 0))
                                if ((K | 0) == (Z | 0)) {
                                    b[Y >> 0] = 48
                                    Aa = Y
                                } else Aa = K
                            else if (K >>> 0 > m >>> 0) {
                                hj(m | 0, 48, (K - n) | 0) | 0
                                y = K
                                while (1) {
                                    _ = (y + -1) | 0
                                    if (_ >>> 0 > m >>> 0) y = _
                                    else {
                                        Aa = _
                                        break
                                    }
                                }
                            } else Aa = K
                            ep(a, Aa, (R - Aa) | 0)
                            Q = (Q + 4) | 0
                        } while (Q >>> 0 <= E >>> 0)
                        if (G | 0) ep(a, 15558, 1)
                        if ((Q >>> 0 < C >>> 0) & ((va | 0) > 0)) {
                            E = va
                            R = Q
                            while (1) {
                                Y = Jj(f[R >> 2] | 0, 0, Z) | 0
                                if (Y >>> 0 > m >>> 0) {
                                    hj(m | 0, 48, (Y - n) | 0) | 0
                                    J = Y
                                    while (1) {
                                        v = (J + -1) | 0
                                        if (v >>> 0 > m >>> 0) J = v
                                        else {
                                            Ba = v
                                            break
                                        }
                                    }
                                } else Ba = Y
                                ep(a, Ba, (E | 0) < 9 ? E : 9)
                                R = (R + 4) | 0
                                J = (E + -9) | 0
                                if (!((R >>> 0 < C >>> 0) & ((E | 0) > 9))) {
                                    Ca = J
                                    break
                                } else E = J
                            }
                        } else Ca = va
                        Hk(a, 48, (Ca + 9) | 0, 9, 0)
                    } else {
                        E = qa ? C : (pa + 4) | 0
                        if ((va | 0) > -1) {
                            R = (m + 9) | 0
                            Z = (wa | 0) == 0
                            Q = R
                            G = (0 - n) | 0
                            J = (m + 8) | 0
                            K = va
                            v = pa
                            while (1) {
                                x = Jj(f[v >> 2] | 0, 0, R) | 0
                                if ((x | 0) == (R | 0)) {
                                    b[J >> 0] = 48
                                    Da = J
                                } else Da = x
                                do
                                    if ((v | 0) == (pa | 0)) {
                                        x = (Da + 1) | 0
                                        ep(a, Da, 1)
                                        if (Z & ((K | 0) < 1)) {
                                            Ea = x
                                            break
                                        }
                                        ep(a, 15558, 1)
                                        Ea = x
                                    } else {
                                        if (Da >>> 0 <= m >>> 0) {
                                            Ea = Da
                                            break
                                        }
                                        hj(m | 0, 48, (Da + G) | 0) | 0
                                        x = Da
                                        while (1) {
                                            z = (x + -1) | 0
                                            if (z >>> 0 > m >>> 0) x = z
                                            else {
                                                Ea = z
                                                break
                                            }
                                        }
                                    }
                                while (0)
                                Y = (Q - Ea) | 0
                                ep(a, Ea, (K | 0) > (Y | 0) ? Y : K)
                                x = (K - Y) | 0
                                v = (v + 4) | 0
                                if (!((v >>> 0 < E >>> 0) & ((x | 0) > -1))) {
                                    Fa = x
                                    break
                                } else K = x
                            }
                        } else Fa = va
                        Hk(a, 48, (Fa + 18) | 0, 18, 0)
                        ep(a, xa, (p - xa) | 0)
                    }
                    Hk(a, 32, d, A, g ^ 8192)
                    w = A
                }
            while (0)
            u = j
            return ((w | 0) < (d | 0) ? d : w) | 0
        }
        function qb(a, c, e, g, h) {
            a = a | 0
            c = c | 0
            e = e | 0
            g = g | 0
            h = h | 0
            var i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0,
                o = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 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,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0,
                xa = 0,
                ya = 0,
                za = 0,
                Aa = 0,
                Ba = 0,
                Ca = 0,
                Da = 0,
                Ea = 0,
                Fa = 0,
                Ga = 0,
                Ha = 0,
                Ia = 0
            i = u
            u = (u + 64) | 0
            j = (i + 16) | 0
            k = i
            l = (i + 24) | 0
            m = (i + 8) | 0
            n = (i + 20) | 0
            f[j >> 2] = c
            c = (a | 0) != 0
            o = (l + 40) | 0
            q = o
            r = (l + 39) | 0
            l = (m + 4) | 0
            s = 0
            t = 0
            v = 0
            a: while (1) {
                do
                    if ((t | 0) > -1)
                        if ((s | 0) > ((2147483647 - t) | 0)) {
                            w = ir() | 0
                            f[w >> 2] = 75
                            x = -1
                            break
                        } else {
                            x = (s + t) | 0
                            break
                        }
                    else x = t
                while (0)
                w = f[j >> 2] | 0
                y = b[w >> 0] | 0
                if (!((y << 24) >> 24)) {
                    z = 88
                    break
                } else {
                    A = y
                    B = w
                }
                b: while (1) {
                    switch ((A << 24) >> 24) {
                        case 37: {
                            C = B
                            D = B
                            z = 9
                            break b
                            break
                        }
                        case 0: {
                            E = B
                            break b
                            break
                        }
                        default: {
                        }
                    }
                    y = (B + 1) | 0
                    f[j >> 2] = y
                    A = b[y >> 0] | 0
                    B = y
                }
                c: do
                    if ((z | 0) == 9)
                        while (1) {
                            z = 0
                            if ((b[(D + 1) >> 0] | 0) != 37) {
                                E = C
                                break c
                            }
                            y = (C + 1) | 0
                            D = (D + 2) | 0
                            f[j >> 2] = D
                            if ((b[D >> 0] | 0) != 37) {
                                E = y
                                break
                            } else {
                                C = y
                                z = 9
                            }
                        }
                while (0)
                y = (E - w) | 0
                if (c) ep(a, w, y)
                if (y | 0) {
                    s = y
                    t = x
                    continue
                }
                y = (Pq(b[((f[j >> 2] | 0) + 1) >> 0] | 0) | 0) == 0
                F = f[j >> 2] | 0
                if (!y ? (b[(F + 2) >> 0] | 0) == 36 : 0) {
                    G = ((b[(F + 1) >> 0] | 0) + -48) | 0
                    H = 1
                    J = 3
                } else {
                    G = -1
                    H = v
                    J = 1
                }
                y = (F + J) | 0
                f[j >> 2] = y
                F = b[y >> 0] | 0
                K = (((F << 24) >> 24) + -32) | 0
                if ((K >>> 0 > 31) | ((((1 << K) & 75913) | 0) == 0)) {
                    L = 0
                    M = F
                    N = y
                } else {
                    K = 0
                    O = F
                    F = y
                    while (1) {
                        y = (1 << (((O << 24) >> 24) + -32)) | K
                        P = (F + 1) | 0
                        f[j >> 2] = P
                        Q = b[P >> 0] | 0
                        R = (((Q << 24) >> 24) + -32) | 0
                        if ((R >>> 0 > 31) | ((((1 << R) & 75913) | 0) == 0)) {
                            L = y
                            M = Q
                            N = P
                            break
                        } else {
                            K = y
                            O = Q
                            F = P
                        }
                    }
                }
                if ((M << 24) >> 24 == 42) {
                    if ((Pq(b[(N + 1) >> 0] | 0) | 0) != 0 ? ((F = f[j >> 2] | 0), (b[(F + 2) >> 0] | 0) == 36) : 0) {
                        O = (F + 1) | 0
                        f[(h + (((b[O >> 0] | 0) + -48) << 2)) >> 2] = 10
                        S = f[(g + (((b[O >> 0] | 0) + -48) << 3)) >> 2] | 0
                        T = 1
                        U = (F + 3) | 0
                    } else {
                        if (H | 0) {
                            V = -1
                            break
                        }
                        if (c) {
                            F = ((f[e >> 2] | 0) + (4 - 1)) & ~(4 - 1)
                            O = f[F >> 2] | 0
                            f[e >> 2] = F + 4
                            W = O
                        } else W = 0
                        S = W
                        T = 0
                        U = ((f[j >> 2] | 0) + 1) | 0
                    }
                    f[j >> 2] = U
                    O = (S | 0) < 0
                    X = O ? (0 - S) | 0 : S
                    Y = O ? L | 8192 : L
                    Z = T
                    _ = U
                } else {
                    O = Cl(j) | 0
                    if ((O | 0) < 0) {
                        V = -1
                        break
                    }
                    X = O
                    Y = L
                    Z = H
                    _ = f[j >> 2] | 0
                }
                do
                    if ((b[_ >> 0] | 0) == 46) {
                        if ((b[(_ + 1) >> 0] | 0) != 42) {
                            f[j >> 2] = _ + 1
                            O = Cl(j) | 0
                            $ = O
                            aa = f[j >> 2] | 0
                            break
                        }
                        if (Pq(b[(_ + 2) >> 0] | 0) | 0 ? ((O = f[j >> 2] | 0), (b[(O + 3) >> 0] | 0) == 36) : 0) {
                            F = (O + 2) | 0
                            f[(h + (((b[F >> 0] | 0) + -48) << 2)) >> 2] = 10
                            K = f[(g + (((b[F >> 0] | 0) + -48) << 3)) >> 2] | 0
                            F = (O + 4) | 0
                            f[j >> 2] = F
                            $ = K
                            aa = F
                            break
                        }
                        if (Z | 0) {
                            V = -1
                            break a
                        }
                        if (c) {
                            F = ((f[e >> 2] | 0) + (4 - 1)) & ~(4 - 1)
                            K = f[F >> 2] | 0
                            f[e >> 2] = F + 4
                            ba = K
                        } else ba = 0
                        K = ((f[j >> 2] | 0) + 2) | 0
                        f[j >> 2] = K
                        $ = ba
                        aa = K
                    } else {
                        $ = -1
                        aa = _
                    }
                while (0)
                K = 0
                F = aa
                while (1) {
                    if ((((b[F >> 0] | 0) + -65) | 0) >>> 0 > 57) {
                        V = -1
                        break a
                    }
                    O = F
                    F = (F + 1) | 0
                    f[j >> 2] = F
                    ca = b[((b[O >> 0] | 0) + -65 + (15030 + ((K * 58) | 0))) >> 0] | 0
                    da = ca & 255
                    if (((da + -1) | 0) >>> 0 >= 8) break
                    else K = da
                }
                if (!((ca << 24) >> 24)) {
                    V = -1
                    break
                }
                O = (G | 0) > -1
                do
                    if ((ca << 24) >> 24 == 19)
                        if (O) {
                            V = -1
                            break a
                        } else z = 50
                    else {
                        if (O) {
                            f[(h + (G << 2)) >> 2] = da
                            P = (g + (G << 3)) | 0
                            Q = f[(P + 4) >> 2] | 0
                            y = k
                            f[y >> 2] = f[P >> 2]
                            f[(y + 4) >> 2] = Q
                            z = 50
                            break
                        }
                        if (!c) {
                            V = 0
                            break a
                        }
                        Ie(k, da, e)
                        ea = f[j >> 2] | 0
                    }
                while (0)
                if ((z | 0) == 50) {
                    z = 0
                    if (c) ea = F
                    else {
                        s = 0
                        t = x
                        v = Z
                        continue
                    }
                }
                O = b[(ea + -1) >> 0] | 0
                Q = ((K | 0) != 0) & (((O & 15) | 0) == 3) ? O & -33 : O
                O = Y & -65537
                y = ((Y & 8192) | 0) == 0 ? Y : O
                d: do
                    switch (Q | 0) {
                        case 110: {
                            switch (((K & 255) << 24) >> 24) {
                                case 0: {
                                    f[f[k >> 2] >> 2] = x
                                    s = 0
                                    t = x
                                    v = Z
                                    continue a
                                    break
                                }
                                case 1: {
                                    f[f[k >> 2] >> 2] = x
                                    s = 0
                                    t = x
                                    v = Z
                                    continue a
                                    break
                                }
                                case 2: {
                                    P = f[k >> 2] | 0
                                    f[P >> 2] = x
                                    f[(P + 4) >> 2] = (((x | 0) < 0) << 31) >> 31
                                    s = 0
                                    t = x
                                    v = Z
                                    continue a
                                    break
                                }
                                case 3: {
                                    d[f[k >> 2] >> 1] = x
                                    s = 0
                                    t = x
                                    v = Z
                                    continue a
                                    break
                                }
                                case 4: {
                                    b[f[k >> 2] >> 0] = x
                                    s = 0
                                    t = x
                                    v = Z
                                    continue a
                                    break
                                }
                                case 6: {
                                    f[f[k >> 2] >> 2] = x
                                    s = 0
                                    t = x
                                    v = Z
                                    continue a
                                    break
                                }
                                case 7: {
                                    P = f[k >> 2] | 0
                                    f[P >> 2] = x
                                    f[(P + 4) >> 2] = (((x | 0) < 0) << 31) >> 31
                                    s = 0
                                    t = x
                                    v = Z
                                    continue a
                                    break
                                }
                                default: {
                                    s = 0
                                    t = x
                                    v = Z
                                    continue a
                                }
                            }
                            break
                        }
                        case 112: {
                            fa = 120
                            ga = $ >>> 0 > 8 ? $ : 8
                            ha = y | 8
                            z = 62
                            break
                        }
                        case 88:
                        case 120: {
                            fa = Q
                            ga = $
                            ha = y
                            z = 62
                            break
                        }
                        case 111: {
                            P = k
                            R = f[P >> 2] | 0
                            ia = f[(P + 4) >> 2] | 0
                            P = Gl(R, ia, o) | 0
                            ja = (q - P) | 0
                            ka = P
                            la = 0
                            ma = 15494
                            na = (((y & 8) | 0) == 0) | (($ | 0) > (ja | 0)) ? $ : (ja + 1) | 0
                            oa = y
                            pa = R
                            qa = ia
                            z = 68
                            break
                        }
                        case 105:
                        case 100: {
                            ia = k
                            R = f[ia >> 2] | 0
                            ja = f[(ia + 4) >> 2] | 0
                            if ((ja | 0) < 0) {
                                ia = Vn(0, 0, R | 0, ja | 0) | 0
                                P = I
                                ra = k
                                f[ra >> 2] = ia
                                f[(ra + 4) >> 2] = P
                                sa = 1
                                ta = 15494
                                ua = ia
                                va = P
                                z = 67
                                break d
                            } else {
                                sa = (((y & 2049) | 0) != 0) & 1
                                ta = ((y & 2048) | 0) == 0 ? (((y & 1) | 0) == 0 ? 15494 : 15496) : 15495
                                ua = R
                                va = ja
                                z = 67
                                break d
                            }
                            break
                        }
                        case 117: {
                            ja = k
                            sa = 0
                            ta = 15494
                            ua = f[ja >> 2] | 0
                            va = f[(ja + 4) >> 2] | 0
                            z = 67
                            break
                        }
                        case 99: {
                            b[r >> 0] = f[k >> 2]
                            wa = r
                            xa = 0
                            ya = 15494
                            za = o
                            Aa = 1
                            Ba = O
                            break
                        }
                        case 109: {
                            ja = ir() | 0
                            Ca = kp(f[ja >> 2] | 0) | 0
                            z = 72
                            break
                        }
                        case 115: {
                            ja = f[k >> 2] | 0
                            Ca = ja | 0 ? ja : 15504
                            z = 72
                            break
                        }
                        case 67: {
                            f[m >> 2] = f[k >> 2]
                            f[l >> 2] = 0
                            f[k >> 2] = m
                            Da = -1
                            Ea = m
                            z = 76
                            break
                        }
                        case 83: {
                            ja = f[k >> 2] | 0
                            if (!$) {
                                Hk(a, 32, X, 0, y)
                                Fa = 0
                                z = 85
                            } else {
                                Da = $
                                Ea = ja
                                z = 76
                            }
                            break
                        }
                        case 65:
                        case 71:
                        case 70:
                        case 69:
                        case 97:
                        case 103:
                        case 102:
                        case 101: {
                            s = pb(a, +p[k >> 3], X, $, y, Q) | 0
                            t = x
                            v = Z
                            continue a
                            break
                        }
                        default: {
                            wa = w
                            xa = 0
                            ya = 15494
                            za = o
                            Aa = $
                            Ba = y
                        }
                    }
                while (0)
                e: do
                    if ((z | 0) == 62) {
                        z = 0
                        w = k
                        Q = f[w >> 2] | 0
                        K = f[(w + 4) >> 2] | 0
                        w = ol(Q, K, o, fa & 32) | 0
                        F = (((ha & 8) | 0) == 0) | (((Q | 0) == 0) & ((K | 0) == 0))
                        ka = w
                        la = F ? 0 : 2
                        ma = F ? 15494 : (15494 + (fa >> 4)) | 0
                        na = ga
                        oa = ha
                        pa = Q
                        qa = K
                        z = 68
                    } else if ((z | 0) == 67) {
                        z = 0
                        ka = Jj(ua, va, o) | 0
                        la = sa
                        ma = ta
                        na = $
                        oa = y
                        pa = ua
                        qa = va
                        z = 68
                    } else if ((z | 0) == 72) {
                        z = 0
                        K = cg(Ca, 0, $) | 0
                        Q = (K | 0) == 0
                        wa = Ca
                        xa = 0
                        ya = 15494
                        za = Q ? (Ca + $) | 0 : K
                        Aa = Q ? $ : (K - Ca) | 0
                        Ba = O
                    } else if ((z | 0) == 76) {
                        z = 0
                        K = Ea
                        Q = 0
                        F = 0
                        while (1) {
                            w = f[K >> 2] | 0
                            if (!w) {
                                Ga = Q
                                Ha = F
                                break
                            }
                            ja = Yo(n, w) | 0
                            if (((ja | 0) < 0) | (ja >>> 0 > ((Da - Q) | 0) >>> 0)) {
                                Ga = Q
                                Ha = ja
                                break
                            }
                            w = (ja + Q) | 0
                            if (Da >>> 0 > w >>> 0) {
                                K = (K + 4) | 0
                                Q = w
                                F = ja
                            } else {
                                Ga = w
                                Ha = ja
                                break
                            }
                        }
                        if ((Ha | 0) < 0) {
                            V = -1
                            break a
                        }
                        Hk(a, 32, X, Ga, y)
                        if (!Ga) {
                            Fa = 0
                            z = 85
                        } else {
                            F = Ea
                            Q = 0
                            while (1) {
                                K = f[F >> 2] | 0
                                if (!K) {
                                    Fa = Ga
                                    z = 85
                                    break e
                                }
                                ja = Yo(n, K) | 0
                                Q = (ja + Q) | 0
                                if ((Q | 0) > (Ga | 0)) {
                                    Fa = Ga
                                    z = 85
                                    break e
                                }
                                ep(a, n, ja)
                                if (Q >>> 0 >= Ga >>> 0) {
                                    Fa = Ga
                                    z = 85
                                    break
                                } else F = (F + 4) | 0
                            }
                        }
                    }
                while (0)
                if ((z | 0) == 68) {
                    z = 0
                    O = ((pa | 0) != 0) | ((qa | 0) != 0)
                    F = ((na | 0) != 0) | O
                    Q = (q - ka + ((O ^ 1) & 1)) | 0
                    wa = F ? ka : o
                    xa = la
                    ya = ma
                    za = o
                    Aa = F ? ((na | 0) > (Q | 0) ? na : Q) : na
                    Ba = (na | 0) > -1 ? oa & -65537 : oa
                } else if ((z | 0) == 85) {
                    z = 0
                    Hk(a, 32, X, Fa, y ^ 8192)
                    s = (X | 0) > (Fa | 0) ? X : Fa
                    t = x
                    v = Z
                    continue
                }
                Q = (za - wa) | 0
                F = (Aa | 0) < (Q | 0) ? Q : Aa
                O = (F + xa) | 0
                ja = (X | 0) < (O | 0) ? O : X
                Hk(a, 32, ja, O, Ba)
                ep(a, ya, xa)
                Hk(a, 48, ja, O, Ba ^ 65536)
                Hk(a, 48, F, Q, 0)
                ep(a, wa, Q)
                Hk(a, 32, ja, O, Ba ^ 8192)
                s = ja
                t = x
                v = Z
            }
            f: do
                if ((z | 0) == 88)
                    if (!a)
                        if (v) {
                            Z = 1
                            while (1) {
                                t = f[(h + (Z << 2)) >> 2] | 0
                                if (!t) {
                                    Ia = Z
                                    break
                                }
                                Ie((g + (Z << 3)) | 0, t, e)
                                t = (Z + 1) | 0
                                if ((Z | 0) < 9) Z = t
                                else {
                                    Ia = t
                                    break
                                }
                            }
                            if ((Ia | 0) < 10) {
                                Z = Ia
                                while (1) {
                                    if (f[(h + (Z << 2)) >> 2] | 0) {
                                        V = -1
                                        break f
                                    }
                                    if ((Z | 0) < 9) Z = (Z + 1) | 0
                                    else {
                                        V = 1
                                        break
                                    }
                                }
                            } else V = 1
                        } else V = 0
                    else V = x
            while (0)
            u = i
            return V | 0
        }
        function rb(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = Oa,
                ma = Oa,
                na = Oa,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0
            c = u
            u = (u + 64) | 0
            d = (c + 28) | 0
            e = (c + 16) | 0
            g = (c + 4) | 0
            h = c
            i = a
            j = (a + 80) | 0
            k = f[j >> 2] | 0
            f[d >> 2] = 0
            f[(d + 4) >> 2] = 0
            f[(d + 8) >> 2] = 0
            f[(d + 12) >> 2] = 0
            f[(d + 16) >> 2] = i
            l = (d + 20) | 0
            n[l >> 2] = $(1.0)
            f[(d + 24) >> 2] = i
            qh(d, k)
            k = f[j >> 2] | 0
            f[e >> 2] = 0
            i = (e + 4) | 0
            f[i >> 2] = 0
            f[(e + 8) >> 2] = 0
            m = (k | 0) == 0
            do
                if (!m)
                    if (k >>> 0 > 1073741823) mq(e)
                    else {
                        o = k << 2
                        p = dn(o) | 0
                        f[e >> 2] = p
                        q = (p + (k << 2)) | 0
                        f[(e + 8) >> 2] = q
                        hj(p | 0, 0, o | 0) | 0
                        f[i >> 2] = q
                        break
                    }
            while (0)
            f[g >> 2] = 0
            k = (g + 4) | 0
            f[k >> 2] = 0
            f[(g + 8) >> 2] = 0
            f[h >> 2] = 0
            if (!m) {
                m = (d + 16) | 0
                q = (d + 4) | 0
                o = (d + 12) | 0
                p = (d + 8) | 0
                r = (g + 8) | 0
                s = (d + 24) | 0
                t = 0
                v = 0
                while (1) {
                    w = f[m >> 2] | 0
                    x = f[(w + 8) >> 2] | 0
                    y = ((f[(w + 12) >> 2] | 0) - x) | 0
                    w = (y | 0) > 0
                    z = x
                    if (w) {
                        x = y >>> 2
                        A = 0
                        B = 0
                        while (1) {
                            C = f[(z + (A << 2)) >> 2] | 0
                            if (!(b[(C + 84) >> 0] | 0)) D = f[((f[(C + 68) >> 2] | 0) + (v << 2)) >> 2] | 0
                            else D = v
                            C = (D + 239) ^ B
                            A = (A + 1) | 0
                            if ((A | 0) >= (x | 0)) {
                                E = C
                                break
                            } else B = C
                        }
                    } else E = 0
                    B = f[q >> 2] | 0
                    x = (B | 0) == 0
                    a: do
                        if (!x) {
                            A = (B + -1) | 0
                            C = ((A & B) | 0) == 0
                            if (!C)
                                if (E >>> 0 < B >>> 0) F = E
                                else F = (E >>> 0) % (B >>> 0) | 0
                            else F = A & E
                            G = f[((f[d >> 2] | 0) + (F << 2)) >> 2] | 0
                            if ((G | 0) != 0 ? ((H = f[G >> 2] | 0), (H | 0) != 0) : 0) {
                                G = f[s >> 2] | 0
                                I = (G + 8) | 0
                                J = (G + 12) | 0
                                b: do
                                    if (C) {
                                        G = H
                                        while (1) {
                                            K = f[(G + 4) >> 2] | 0
                                            L = (K | 0) == (E | 0)
                                            if (!(L | (((K & A) | 0) == (F | 0)))) {
                                                M = 44
                                                break a
                                            }
                                            c: do
                                                if (L) {
                                                    K = f[(G + 8) >> 2] | 0
                                                    N = f[I >> 2] | 0
                                                    O = ((f[J >> 2] | 0) - N) | 0
                                                    P = N
                                                    if ((O | 0) <= 0) {
                                                        Q = G
                                                        break b
                                                    }
                                                    N = O >>> 2
                                                    O = 0
                                                    while (1) {
                                                        R = f[(P + (O << 2)) >> 2] | 0
                                                        if (!(b[(R + 84) >> 0] | 0)) {
                                                            S = f[(R + 68) >> 2] | 0
                                                            T = f[(S + (v << 2)) >> 2] | 0
                                                            U = f[(S + (K << 2)) >> 2] | 0
                                                        } else {
                                                            T = v
                                                            U = K
                                                        }
                                                        O = (O + 1) | 0
                                                        if ((U | 0) != (T | 0)) break c
                                                        if ((O | 0) >= (N | 0)) {
                                                            V = G
                                                            M = 42
                                                            break b
                                                        }
                                                    }
                                                }
                                            while (0)
                                            G = f[G >> 2] | 0
                                            if (!G) {
                                                M = 44
                                                break a
                                            }
                                        }
                                    } else {
                                        G = H
                                        while (1) {
                                            L = f[(G + 4) >> 2] | 0
                                            d: do
                                                if ((L | 0) != (E | 0)) {
                                                    if (L >>> 0 < B >>> 0) X = L
                                                    else X = (L >>> 0) % (B >>> 0) | 0
                                                    if ((X | 0) != (F | 0)) {
                                                        M = 44
                                                        break a
                                                    }
                                                } else {
                                                    N = f[(G + 8) >> 2] | 0
                                                    O = f[I >> 2] | 0
                                                    K = ((f[J >> 2] | 0) - O) | 0
                                                    P = O
                                                    if ((K | 0) <= 0) {
                                                        Q = G
                                                        break b
                                                    }
                                                    O = K >>> 2
                                                    K = 0
                                                    while (1) {
                                                        S = f[(P + (K << 2)) >> 2] | 0
                                                        if (!(b[(S + 84) >> 0] | 0)) {
                                                            R = f[(S + 68) >> 2] | 0
                                                            Y = f[(R + (v << 2)) >> 2] | 0
                                                            Z = f[(R + (N << 2)) >> 2] | 0
                                                        } else {
                                                            Y = v
                                                            Z = N
                                                        }
                                                        K = (K + 1) | 0
                                                        if ((Z | 0) != (Y | 0)) break d
                                                        if ((K | 0) >= (O | 0)) {
                                                            V = G
                                                            M = 42
                                                            break b
                                                        }
                                                    }
                                                }
                                            while (0)
                                            G = f[G >> 2] | 0
                                            if (!G) {
                                                M = 44
                                                break a
                                            }
                                        }
                                    }
                                while (0)
                                if ((M | 0) == 42) {
                                    M = 0
                                    if (!V) {
                                        M = 44
                                        break
                                    } else Q = V
                                }
                                f[((f[e >> 2] | 0) + (v << 2)) >> 2] = f[(Q + 12) >> 2]
                                _ = t
                            } else M = 44
                        } else M = 44
                    while (0)
                    do
                        if ((M | 0) == 44) {
                            M = 0
                            if (w) {
                                J = y >>> 2
                                I = 0
                                H = 0
                                while (1) {
                                    A = f[(z + (I << 2)) >> 2] | 0
                                    if (!(b[(A + 84) >> 0] | 0)) aa = f[((f[(A + 68) >> 2] | 0) + (v << 2)) >> 2] | 0
                                    else aa = v
                                    A = (aa + 239) ^ H
                                    I = (I + 1) | 0
                                    if ((I | 0) >= (J | 0)) {
                                        ba = A
                                        break
                                    } else H = A
                                }
                            } else ba = 0
                            e: do
                                if (!x) {
                                    H = (B + -1) | 0
                                    J = ((H & B) | 0) == 0
                                    if (!J)
                                        if (ba >>> 0 < B >>> 0) ca = ba
                                        else ca = (ba >>> 0) % (B >>> 0) | 0
                                    else ca = H & ba
                                    I = f[((f[d >> 2] | 0) + (ca << 2)) >> 2] | 0
                                    if ((I | 0) != 0 ? ((A = f[I >> 2] | 0), (A | 0) != 0) : 0) {
                                        I = f[s >> 2] | 0
                                        C = (I + 8) | 0
                                        G = (I + 12) | 0
                                        if (J) {
                                            J = A
                                            while (1) {
                                                I = f[(J + 4) >> 2] | 0
                                                if (!(((I | 0) == (ba | 0)) | (((I & H) | 0) == (ca | 0)))) {
                                                    da = ca
                                                    M = 76
                                                    break e
                                                }
                                                I = f[(J + 8) >> 2] | 0
                                                L = f[C >> 2] | 0
                                                O = ((f[G >> 2] | 0) - L) | 0
                                                K = L
                                                if ((O | 0) <= 0) {
                                                    ea = v
                                                    break e
                                                }
                                                L = O >>> 2
                                                O = 0
                                                while (1) {
                                                    N = f[(K + (O << 2)) >> 2] | 0
                                                    if (!(b[(N + 84) >> 0] | 0)) {
                                                        P = f[(N + 68) >> 2] | 0
                                                        fa = f[(P + (v << 2)) >> 2] | 0
                                                        ga = f[(P + (I << 2)) >> 2] | 0
                                                    } else {
                                                        fa = v
                                                        ga = I
                                                    }
                                                    O = (O + 1) | 0
                                                    if ((ga | 0) != (fa | 0)) break
                                                    if ((O | 0) >= (L | 0)) {
                                                        ea = v
                                                        break e
                                                    }
                                                }
                                                J = f[J >> 2] | 0
                                                if (!J) {
                                                    da = ca
                                                    M = 76
                                                    break e
                                                }
                                            }
                                        } else ha = A
                                        while (1) {
                                            J = f[(ha + 4) >> 2] | 0
                                            if ((J | 0) != (ba | 0)) {
                                                if (J >>> 0 < B >>> 0) ia = J
                                                else ia = (J >>> 0) % (B >>> 0) | 0
                                                if ((ia | 0) != (ca | 0)) {
                                                    da = ca
                                                    M = 76
                                                    break e
                                                }
                                            }
                                            J = f[(ha + 8) >> 2] | 0
                                            H = f[C >> 2] | 0
                                            L = ((f[G >> 2] | 0) - H) | 0
                                            O = H
                                            if ((L | 0) <= 0) {
                                                ea = v
                                                break e
                                            }
                                            H = L >>> 2
                                            L = 0
                                            while (1) {
                                                I = f[(O + (L << 2)) >> 2] | 0
                                                if (!(b[(I + 84) >> 0] | 0)) {
                                                    K = f[(I + 68) >> 2] | 0
                                                    ja = f[(K + (v << 2)) >> 2] | 0
                                                    ka = f[(K + (J << 2)) >> 2] | 0
                                                } else {
                                                    ja = v
                                                    ka = J
                                                }
                                                L = (L + 1) | 0
                                                if ((ka | 0) != (ja | 0)) break
                                                if ((L | 0) >= (H | 0)) {
                                                    ea = v
                                                    break e
                                                }
                                            }
                                            ha = f[ha >> 2] | 0
                                            if (!ha) {
                                                da = ca
                                                M = 76
                                                break
                                            }
                                        }
                                    } else {
                                        da = ca
                                        M = 76
                                    }
                                } else {
                                    da = 0
                                    M = 76
                                }
                            while (0)
                            if ((M | 0) == 76) {
                                M = 0
                                G = dn(16) | 0
                                f[(G + 8) >> 2] = v
                                f[(G + 12) >> 2] = t
                                f[(G + 4) >> 2] = ba
                                f[G >> 2] = 0
                                la = $((((f[o >> 2] | 0) + 1) | 0) >>> 0)
                                ma = $(B >>> 0)
                                na = $(n[l >> 2])
                                do
                                    if (x | ($(na * ma) < la)) {
                                        C = (B << 1) | (((B >>> 0 < 3) | ((((B + -1) & B) | 0) != 0)) & 1)
                                        A = ~~$(W($(la / na))) >>> 0
                                        qh(d, C >>> 0 < A >>> 0 ? A : C)
                                        C = f[q >> 2] | 0
                                        A = (C + -1) | 0
                                        if (!(A & C)) {
                                            oa = C
                                            pa = A & ba
                                            break
                                        }
                                        if (ba >>> 0 < C >>> 0) {
                                            oa = C
                                            pa = ba
                                        } else {
                                            oa = C
                                            pa = (ba >>> 0) % (C >>> 0) | 0
                                        }
                                    } else {
                                        oa = B
                                        pa = da
                                    }
                                while (0)
                                C = ((f[d >> 2] | 0) + (pa << 2)) | 0
                                A = f[C >> 2] | 0
                                if (!A) {
                                    f[G >> 2] = f[p >> 2]
                                    f[p >> 2] = G
                                    f[C >> 2] = p
                                    C = f[G >> 2] | 0
                                    if (C | 0) {
                                        H = f[(C + 4) >> 2] | 0
                                        C = (oa + -1) | 0
                                        if (C & oa)
                                            if (H >>> 0 < oa >>> 0) qa = H
                                            else qa = (H >>> 0) % (oa >>> 0) | 0
                                        else qa = H & C
                                        ra = ((f[d >> 2] | 0) + (qa << 2)) | 0
                                        M = 89
                                    }
                                } else {
                                    f[G >> 2] = f[A >> 2]
                                    ra = A
                                    M = 89
                                }
                                if ((M | 0) == 89) {
                                    M = 0
                                    f[ra >> 2] = G
                                }
                                f[o >> 2] = (f[o >> 2] | 0) + 1
                                ea = f[h >> 2] | 0
                            }
                            A = (t + 1) | 0
                            f[((f[e >> 2] | 0) + (ea << 2)) >> 2] = t
                            C = f[k >> 2] | 0
                            if ((C | 0) == (f[r >> 2] | 0)) {
                                Ci(g, h)
                                _ = A
                                break
                            } else {
                                f[C >> 2] = f[h >> 2]
                                f[k >> 2] = C + 4
                                _ = A
                                break
                            }
                        }
                    while (0)
                    v = ((f[h >> 2] | 0) + 1) | 0
                    f[h >> 2] = v
                    sa = f[j >> 2] | 0
                    if (v >>> 0 >= sa >>> 0) break
                    else t = _
                }
                if ((_ | 0) != (sa | 0)) {
                    Xa[f[((f[a >> 2] | 0) + 24) >> 2] & 15](a, e, g)
                    f[j >> 2] = _
                }
            }
            _ = f[g >> 2] | 0
            if (_ | 0) {
                g = f[k >> 2] | 0
                if ((g | 0) != (_ | 0)) f[k >> 2] = g + (~(((g + -4 - _) | 0) >>> 2) << 2)
                br(_)
            }
            _ = f[e >> 2] | 0
            if (_ | 0) {
                e = f[i >> 2] | 0
                if ((e | 0) != (_ | 0)) f[i >> 2] = e + (~(((e + -4 - _) | 0) >>> 2) << 2)
                br(_)
            }
            _ = f[(d + 8) >> 2] | 0
            if (_ | 0) {
                e = _
                do {
                    _ = e
                    e = f[e >> 2] | 0
                    br(_)
                } while ((e | 0) != 0)
            }
            e = f[d >> 2] | 0
            f[d >> 2] = 0
            if (!e) {
                u = c
                return
            }
            br(e)
            u = c
            return
        }
        function sb(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 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,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0
            g = u
            u = (u + 80) | 0
            h = (g + 76) | 0
            i = (g + 72) | 0
            j = (g + 48) | 0
            k = (g + 24) | 0
            l = g
            m = (a + 32) | 0
            n = f[c >> 2] | 0
            c = (n + 1) | 0
            if ((n | 0) != -1) {
                o = ((c >>> 0) % 3 | 0 | 0) == 0 ? (n + -2) | 0 : c
                c = ((((n >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + n) | 0
                if ((o | 0) == -1) p = -1
                else p = f[((f[f[m >> 2] >> 2] | 0) + (o << 2)) >> 2] | 0
                if ((c | 0) == -1) {
                    q = p
                    r = -1
                } else {
                    q = p
                    r = f[((f[f[m >> 2] >> 2] | 0) + (c << 2)) >> 2] | 0
                }
            } else {
                q = -1
                r = -1
            }
            c = f[(a + 36) >> 2] | 0
            m = f[c >> 2] | 0
            p = ((f[(c + 4) >> 2] | 0) - m) >> 2
            if (p >>> 0 <= q >>> 0) mq(c)
            o = m
            m = f[(o + (q << 2)) >> 2] | 0
            if (p >>> 0 <= r >>> 0) mq(c)
            c = f[(o + (r << 2)) >> 2] | 0
            r = (m | 0) < (e | 0)
            do
                if (r & ((c | 0) < (e | 0))) {
                    o = m << 1
                    p = f[(d + (o << 2)) >> 2] | 0
                    q = (((p | 0) < 0) << 31) >> 31
                    n = f[(d + ((o | 1) << 2)) >> 2] | 0
                    o = (((n | 0) < 0) << 31) >> 31
                    s = c << 1
                    t = f[(d + (s << 2)) >> 2] | 0
                    v = f[(d + ((s | 1) << 2)) >> 2] | 0
                    if (!(((t | 0) != (p | 0)) | ((v | 0) != (n | 0)))) {
                        f[(a + 8) >> 2] = p
                        f[(a + 12) >> 2] = n
                        u = g
                        return 1
                    }
                    s = (a + 4) | 0
                    w = f[((f[s >> 2] | 0) + (e << 2)) >> 2] | 0
                    f[j >> 2] = 0
                    f[(j + 4) >> 2] = 0
                    f[(j + 8) >> 2] = 0
                    f[(j + 12) >> 2] = 0
                    f[(j + 16) >> 2] = 0
                    f[(j + 20) >> 2] = 0
                    x = f[a >> 2] | 0
                    if (!(b[(x + 84) >> 0] | 0)) y = f[((f[(x + 68) >> 2] | 0) + (w << 2)) >> 2] | 0
                    else y = w
                    f[i >> 2] = y
                    w = b[(x + 24) >> 0] | 0
                    f[h >> 2] = f[i >> 2]
                    ub(x, h, w, j) | 0
                    w = f[((f[s >> 2] | 0) + (m << 2)) >> 2] | 0
                    f[k >> 2] = 0
                    f[(k + 4) >> 2] = 0
                    f[(k + 8) >> 2] = 0
                    f[(k + 12) >> 2] = 0
                    f[(k + 16) >> 2] = 0
                    f[(k + 20) >> 2] = 0
                    x = f[a >> 2] | 0
                    if (!(b[(x + 84) >> 0] | 0)) z = f[((f[(x + 68) >> 2] | 0) + (w << 2)) >> 2] | 0
                    else z = w
                    f[i >> 2] = z
                    w = b[(x + 24) >> 0] | 0
                    f[h >> 2] = f[i >> 2]
                    ub(x, h, w, k) | 0
                    w = f[((f[s >> 2] | 0) + (c << 2)) >> 2] | 0
                    f[l >> 2] = 0
                    f[(l + 4) >> 2] = 0
                    f[(l + 8) >> 2] = 0
                    f[(l + 12) >> 2] = 0
                    f[(l + 16) >> 2] = 0
                    f[(l + 20) >> 2] = 0
                    s = f[a >> 2] | 0
                    if (!(b[(s + 84) >> 0] | 0)) A = f[((f[(s + 68) >> 2] | 0) + (w << 2)) >> 2] | 0
                    else A = w
                    f[i >> 2] = A
                    w = b[(s + 24) >> 0] | 0
                    f[h >> 2] = f[i >> 2]
                    ub(s, h, w, l) | 0
                    w = l
                    s = k
                    x = f[s >> 2] | 0
                    B = f[(s + 4) >> 2] | 0
                    s = Vn(f[w >> 2] | 0, f[(w + 4) >> 2] | 0, x | 0, B | 0) | 0
                    w = I
                    C = (l + 8) | 0
                    D = (k + 8) | 0
                    E = f[D >> 2] | 0
                    F = f[(D + 4) >> 2] | 0
                    D = Vn(f[C >> 2] | 0, f[(C + 4) >> 2] | 0, E | 0, F | 0) | 0
                    C = I
                    G = (l + 16) | 0
                    H = (k + 16) | 0
                    J = f[H >> 2] | 0
                    K = f[(H + 4) >> 2] | 0
                    H = Vn(f[G >> 2] | 0, f[(G + 4) >> 2] | 0, J | 0, K | 0) | 0
                    G = I
                    L = on(s | 0, w | 0, s | 0, w | 0) | 0
                    M = I
                    N = on(D | 0, C | 0, D | 0, C | 0) | 0
                    O = Tn(N | 0, I | 0, L | 0, M | 0) | 0
                    M = I
                    L = on(H | 0, G | 0, H | 0, G | 0) | 0
                    N = Tn(O | 0, M | 0, L | 0, I | 0) | 0
                    L = I
                    if (((N | 0) == 0) & ((L | 0) == 0)) break
                    M = j
                    O = Vn(f[M >> 2] | 0, f[(M + 4) >> 2] | 0, x | 0, B | 0) | 0
                    B = I
                    x = (j + 8) | 0
                    M = Vn(f[x >> 2] | 0, f[(x + 4) >> 2] | 0, E | 0, F | 0) | 0
                    F = I
                    E = (j + 16) | 0
                    x = Vn(f[E >> 2] | 0, f[(E + 4) >> 2] | 0, J | 0, K | 0) | 0
                    K = I
                    J = on(O | 0, B | 0, s | 0, w | 0) | 0
                    E = I
                    P = on(M | 0, F | 0, D | 0, C | 0) | 0
                    Q = Tn(P | 0, I | 0, J | 0, E | 0) | 0
                    E = I
                    J = on(x | 0, K | 0, H | 0, G | 0) | 0
                    P = Tn(Q | 0, E | 0, J | 0, I | 0) | 0
                    J = I
                    E = Vn(t | 0, ((((t | 0) < 0) << 31) >> 31) | 0, p | 0, q | 0) | 0
                    t = I
                    Q = Vn(v | 0, ((((v | 0) < 0) << 31) >> 31) | 0, n | 0, o | 0) | 0
                    v = I
                    R = on(N | 0, L | 0, p | 0, q | 0) | 0
                    q = I
                    p = on(N | 0, L | 0, n | 0, o | 0) | 0
                    o = I
                    n = on(P | 0, J | 0, E | 0, t | 0) | 0
                    S = I
                    T = on(P | 0, J | 0, Q | 0, v | 0) | 0
                    U = I
                    V = Tn(n | 0, S | 0, R | 0, q | 0) | 0
                    q = I
                    R = Tn(T | 0, U | 0, p | 0, o | 0) | 0
                    o = I
                    p = on(P | 0, J | 0, s | 0, w | 0) | 0
                    w = I
                    s = on(P | 0, J | 0, D | 0, C | 0) | 0
                    C = I
                    D = on(P | 0, J | 0, H | 0, G | 0) | 0
                    G = I
                    H = zk(p | 0, w | 0, N | 0, L | 0) | 0
                    w = I
                    p = zk(s | 0, C | 0, N | 0, L | 0) | 0
                    C = I
                    s = zk(D | 0, G | 0, N | 0, L | 0) | 0
                    G = I
                    D = Vn(O | 0, B | 0, H | 0, w | 0) | 0
                    w = I
                    H = Vn(M | 0, F | 0, p | 0, C | 0) | 0
                    C = I
                    p = Vn(x | 0, K | 0, s | 0, G | 0) | 0
                    G = I
                    s = on(D | 0, w | 0, D | 0, w | 0) | 0
                    w = I
                    D = on(H | 0, C | 0, H | 0, C | 0) | 0
                    C = Tn(D | 0, I | 0, s | 0, w | 0) | 0
                    w = I
                    s = on(p | 0, G | 0, p | 0, G | 0) | 0
                    G = Tn(C | 0, w | 0, s | 0, I | 0) | 0
                    s = I
                    w = Vn(0, 0, E | 0, t | 0) | 0
                    t = I
                    E = on(G | 0, s | 0, N | 0, L | 0) | 0
                    s = I
                    switch (E | 0) {
                        case 0: {
                            if (!s) {
                                W = 0
                                X = 0
                            } else {
                                Y = 1
                                Z = 0
                                _ = E
                                $ = s
                                aa = 23
                            }
                            break
                        }
                        case 1: {
                            if (!s) {
                                ba = 1
                                ca = 0
                                aa = 24
                            } else {
                                Y = 1
                                Z = 0
                                _ = E
                                $ = s
                                aa = 23
                            }
                            break
                        }
                        default: {
                            Y = 1
                            Z = 0
                            _ = E
                            $ = s
                            aa = 23
                        }
                    }
                    if ((aa | 0) == 23)
                        while (1) {
                            aa = 0
                            G = Rn(Y | 0, Z | 0, 1) | 0
                            C = I
                            p = _
                            _ = Wn(_ | 0, $ | 0, 2) | 0
                            if (!(($ >>> 0 > 0) | ((($ | 0) == 0) & (p >>> 0 > 7)))) {
                                ba = G
                                ca = C
                                aa = 24
                                break
                            } else {
                                Y = G
                                Z = C
                                $ = I
                                aa = 23
                            }
                        }
                    if ((aa | 0) == 24)
                        while (1) {
                            aa = 0
                            C = up(E | 0, s | 0, ba | 0, ca | 0) | 0
                            G = Tn(C | 0, I | 0, ba | 0, ca | 0) | 0
                            C = Wn(G | 0, I | 0, 1) | 0
                            G = I
                            p = on(C | 0, G | 0, C | 0, G | 0) | 0
                            D = I
                            if ((D >>> 0 > s >>> 0) | (((D | 0) == (s | 0)) & (p >>> 0 > E >>> 0))) {
                                ba = C
                                ca = G
                                aa = 24
                            } else {
                                W = C
                                X = G
                                break
                            }
                        }
                    E = on(W | 0, X | 0, Q | 0, v | 0) | 0
                    s = I
                    G = on(W | 0, X | 0, w | 0, t | 0) | 0
                    C = I
                    p = Tn(E | 0, s | 0, V | 0, q | 0) | 0
                    D = I
                    H = Tn(G | 0, C | 0, R | 0, o | 0) | 0
                    K = I
                    x = zk(p | 0, D | 0, N | 0, L | 0) | 0
                    D = I
                    p = zk(H | 0, K | 0, N | 0, L | 0) | 0
                    K = I
                    H = Vn(V | 0, q | 0, E | 0, s | 0) | 0
                    s = I
                    E = Vn(R | 0, o | 0, G | 0, C | 0) | 0
                    C = I
                    G = zk(H | 0, s | 0, N | 0, L | 0) | 0
                    s = I
                    H = zk(E | 0, C | 0, N | 0, L | 0) | 0
                    C = I
                    E = e << 1
                    F = f[(d + (E << 2)) >> 2] | 0
                    M = (((F | 0) < 0) << 31) >> 31
                    B = f[(d + ((E | 1) << 2)) >> 2] | 0
                    E = (((B | 0) < 0) << 31) >> 31
                    O = Vn(F | 0, M | 0, x | 0, D | 0) | 0
                    J = I
                    P = Vn(B | 0, E | 0, p | 0, K | 0) | 0
                    U = I
                    T = on(O | 0, J | 0, O | 0, J | 0) | 0
                    J = I
                    O = on(P | 0, U | 0, P | 0, U | 0) | 0
                    U = Tn(O | 0, I | 0, T | 0, J | 0) | 0
                    J = I
                    T = Vn(F | 0, M | 0, G | 0, s | 0) | 0
                    M = I
                    F = Vn(B | 0, E | 0, H | 0, C | 0) | 0
                    E = I
                    B = on(T | 0, M | 0, T | 0, M | 0) | 0
                    M = I
                    T = on(F | 0, E | 0, F | 0, E | 0) | 0
                    E = Tn(T | 0, I | 0, B | 0, M | 0) | 0
                    M = I
                    B = (a + 16) | 0
                    T = (a + 20) | 0
                    F = f[T >> 2] | 0
                    O = f[(a + 24) >> 2] | 0
                    P = (F | 0) == ((O << 5) | 0)
                    if ((J >>> 0 < M >>> 0) | (((J | 0) == (M | 0)) & (U >>> 0 < E >>> 0))) {
                        do
                            if (P)
                                if (((F + 1) | 0) < 0) mq(B)
                                else {
                                    E = O << 6
                                    U = (F + 32) & -32
                                    hi(B, F >>> 0 < 1073741823 ? (E >>> 0 < U >>> 0 ? U : E) : 2147483647)
                                    da = f[T >> 2] | 0
                                    break
                                }
                            else da = F
                        while (0)
                        f[T >> 2] = da + 1
                        L = ((f[B >> 2] | 0) + ((da >>> 5) << 2)) | 0
                        f[L >> 2] = f[L >> 2] | (1 << (da & 31))
                        ea = x
                        fa = p
                        ga = K
                        ha = D
                    } else {
                        do
                            if (P)
                                if (((F + 1) | 0) < 0) mq(B)
                                else {
                                    L = O << 6
                                    N = (F + 32) & -32
                                    hi(B, F >>> 0 < 1073741823 ? (L >>> 0 < N >>> 0 ? N : L) : 2147483647)
                                    ia = f[T >> 2] | 0
                                    break
                                }
                            else ia = F
                        while (0)
                        f[T >> 2] = ia + 1
                        F = ((f[B >> 2] | 0) + ((ia >>> 5) << 2)) | 0
                        f[F >> 2] = f[F >> 2] & ~(1 << (ia & 31))
                        ea = G
                        fa = H
                        ga = C
                        ha = s
                    }
                    f[(a + 8) >> 2] = ea
                    f[(a + 12) >> 2] = fa
                    u = g
                    return 1
                }
            while (0)
            do
                if (r) ja = m << 1
                else {
                    if ((e | 0) > 0) {
                        ja = ((e << 1) + -2) | 0
                        break
                    }
                    fa = (a + 8) | 0
                    f[fa >> 2] = 0
                    f[(fa + 4) >> 2] = 0
                    u = g
                    return 1
                }
            while (0)
            f[(a + 8) >> 2] = f[(d + (ja << 2)) >> 2]
            f[(a + 12) >> 2] = f[(d + ((ja + 1) << 2)) >> 2]
            u = g
            return 1
        }
        function tb(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 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,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0
            g = u
            u = (u + 80) | 0
            h = (g + 76) | 0
            i = (g + 72) | 0
            j = (g + 48) | 0
            k = (g + 24) | 0
            l = g
            m = (a + 32) | 0
            n = f[c >> 2] | 0
            c = (n + 1) | 0
            do
                if ((n | 0) != -1) {
                    o = ((c >>> 0) % 3 | 0 | 0) == 0 ? (n + -2) | 0 : c
                    if (!((n >>> 0) % 3 | 0)) {
                        p = (n + 2) | 0
                        q = o
                        break
                    } else {
                        p = (n + -1) | 0
                        q = o
                        break
                    }
                } else {
                    p = -1
                    q = -1
                }
            while (0)
            n = f[((f[m >> 2] | 0) + 28) >> 2] | 0
            m = f[(n + (q << 2)) >> 2] | 0
            q = f[(n + (p << 2)) >> 2] | 0
            p = f[(a + 36) >> 2] | 0
            n = f[p >> 2] | 0
            c = ((f[(p + 4) >> 2] | 0) - n) >> 2
            if (c >>> 0 <= m >>> 0) mq(p)
            o = n
            n = f[(o + (m << 2)) >> 2] | 0
            if (c >>> 0 <= q >>> 0) mq(p)
            p = f[(o + (q << 2)) >> 2] | 0
            q = (n | 0) < (e | 0)
            do
                if (q & ((p | 0) < (e | 0))) {
                    o = n << 1
                    c = f[(d + (o << 2)) >> 2] | 0
                    m = (((c | 0) < 0) << 31) >> 31
                    r = f[(d + ((o | 1) << 2)) >> 2] | 0
                    o = (((r | 0) < 0) << 31) >> 31
                    s = p << 1
                    t = f[(d + (s << 2)) >> 2] | 0
                    v = f[(d + ((s | 1) << 2)) >> 2] | 0
                    if (!(((t | 0) != (c | 0)) | ((v | 0) != (r | 0)))) {
                        f[(a + 8) >> 2] = c
                        f[(a + 12) >> 2] = r
                        u = g
                        return 1
                    }
                    s = (a + 4) | 0
                    w = f[((f[s >> 2] | 0) + (e << 2)) >> 2] | 0
                    f[j >> 2] = 0
                    f[(j + 4) >> 2] = 0
                    f[(j + 8) >> 2] = 0
                    f[(j + 12) >> 2] = 0
                    f[(j + 16) >> 2] = 0
                    f[(j + 20) >> 2] = 0
                    x = f[a >> 2] | 0
                    if (!(b[(x + 84) >> 0] | 0)) y = f[((f[(x + 68) >> 2] | 0) + (w << 2)) >> 2] | 0
                    else y = w
                    f[i >> 2] = y
                    w = b[(x + 24) >> 0] | 0
                    f[h >> 2] = f[i >> 2]
                    ub(x, h, w, j) | 0
                    w = f[((f[s >> 2] | 0) + (n << 2)) >> 2] | 0
                    f[k >> 2] = 0
                    f[(k + 4) >> 2] = 0
                    f[(k + 8) >> 2] = 0
                    f[(k + 12) >> 2] = 0
                    f[(k + 16) >> 2] = 0
                    f[(k + 20) >> 2] = 0
                    x = f[a >> 2] | 0
                    if (!(b[(x + 84) >> 0] | 0)) z = f[((f[(x + 68) >> 2] | 0) + (w << 2)) >> 2] | 0
                    else z = w
                    f[i >> 2] = z
                    w = b[(x + 24) >> 0] | 0
                    f[h >> 2] = f[i >> 2]
                    ub(x, h, w, k) | 0
                    w = f[((f[s >> 2] | 0) + (p << 2)) >> 2] | 0
                    f[l >> 2] = 0
                    f[(l + 4) >> 2] = 0
                    f[(l + 8) >> 2] = 0
                    f[(l + 12) >> 2] = 0
                    f[(l + 16) >> 2] = 0
                    f[(l + 20) >> 2] = 0
                    s = f[a >> 2] | 0
                    if (!(b[(s + 84) >> 0] | 0)) A = f[((f[(s + 68) >> 2] | 0) + (w << 2)) >> 2] | 0
                    else A = w
                    f[i >> 2] = A
                    w = b[(s + 24) >> 0] | 0
                    f[h >> 2] = f[i >> 2]
                    ub(s, h, w, l) | 0
                    w = l
                    s = k
                    x = f[s >> 2] | 0
                    B = f[(s + 4) >> 2] | 0
                    s = Vn(f[w >> 2] | 0, f[(w + 4) >> 2] | 0, x | 0, B | 0) | 0
                    w = I
                    C = (l + 8) | 0
                    D = (k + 8) | 0
                    E = f[D >> 2] | 0
                    F = f[(D + 4) >> 2] | 0
                    D = Vn(f[C >> 2] | 0, f[(C + 4) >> 2] | 0, E | 0, F | 0) | 0
                    C = I
                    G = (l + 16) | 0
                    H = (k + 16) | 0
                    J = f[H >> 2] | 0
                    K = f[(H + 4) >> 2] | 0
                    H = Vn(f[G >> 2] | 0, f[(G + 4) >> 2] | 0, J | 0, K | 0) | 0
                    G = I
                    L = on(s | 0, w | 0, s | 0, w | 0) | 0
                    M = I
                    N = on(D | 0, C | 0, D | 0, C | 0) | 0
                    O = Tn(N | 0, I | 0, L | 0, M | 0) | 0
                    M = I
                    L = on(H | 0, G | 0, H | 0, G | 0) | 0
                    N = Tn(O | 0, M | 0, L | 0, I | 0) | 0
                    L = I
                    if (((N | 0) == 0) & ((L | 0) == 0)) break
                    M = j
                    O = Vn(f[M >> 2] | 0, f[(M + 4) >> 2] | 0, x | 0, B | 0) | 0
                    B = I
                    x = (j + 8) | 0
                    M = Vn(f[x >> 2] | 0, f[(x + 4) >> 2] | 0, E | 0, F | 0) | 0
                    F = I
                    E = (j + 16) | 0
                    x = Vn(f[E >> 2] | 0, f[(E + 4) >> 2] | 0, J | 0, K | 0) | 0
                    K = I
                    J = on(O | 0, B | 0, s | 0, w | 0) | 0
                    E = I
                    P = on(M | 0, F | 0, D | 0, C | 0) | 0
                    Q = Tn(P | 0, I | 0, J | 0, E | 0) | 0
                    E = I
                    J = on(x | 0, K | 0, H | 0, G | 0) | 0
                    P = Tn(Q | 0, E | 0, J | 0, I | 0) | 0
                    J = I
                    E = Vn(t | 0, ((((t | 0) < 0) << 31) >> 31) | 0, c | 0, m | 0) | 0
                    t = I
                    Q = Vn(v | 0, ((((v | 0) < 0) << 31) >> 31) | 0, r | 0, o | 0) | 0
                    v = I
                    R = on(N | 0, L | 0, c | 0, m | 0) | 0
                    m = I
                    c = on(N | 0, L | 0, r | 0, o | 0) | 0
                    o = I
                    r = on(P | 0, J | 0, E | 0, t | 0) | 0
                    S = I
                    T = on(P | 0, J | 0, Q | 0, v | 0) | 0
                    U = I
                    V = Tn(r | 0, S | 0, R | 0, m | 0) | 0
                    m = I
                    R = Tn(T | 0, U | 0, c | 0, o | 0) | 0
                    o = I
                    c = on(P | 0, J | 0, s | 0, w | 0) | 0
                    w = I
                    s = on(P | 0, J | 0, D | 0, C | 0) | 0
                    C = I
                    D = on(P | 0, J | 0, H | 0, G | 0) | 0
                    G = I
                    H = zk(c | 0, w | 0, N | 0, L | 0) | 0
                    w = I
                    c = zk(s | 0, C | 0, N | 0, L | 0) | 0
                    C = I
                    s = zk(D | 0, G | 0, N | 0, L | 0) | 0
                    G = I
                    D = Vn(O | 0, B | 0, H | 0, w | 0) | 0
                    w = I
                    H = Vn(M | 0, F | 0, c | 0, C | 0) | 0
                    C = I
                    c = Vn(x | 0, K | 0, s | 0, G | 0) | 0
                    G = I
                    s = on(D | 0, w | 0, D | 0, w | 0) | 0
                    w = I
                    D = on(H | 0, C | 0, H | 0, C | 0) | 0
                    C = Tn(D | 0, I | 0, s | 0, w | 0) | 0
                    w = I
                    s = on(c | 0, G | 0, c | 0, G | 0) | 0
                    G = Tn(C | 0, w | 0, s | 0, I | 0) | 0
                    s = I
                    w = Vn(0, 0, E | 0, t | 0) | 0
                    t = I
                    E = on(G | 0, s | 0, N | 0, L | 0) | 0
                    s = I
                    switch (E | 0) {
                        case 0: {
                            if (!s) {
                                W = 0
                                X = 0
                            } else {
                                Y = 1
                                Z = 0
                                _ = E
                                $ = s
                                aa = 22
                            }
                            break
                        }
                        case 1: {
                            if (!s) {
                                ba = 1
                                ca = 0
                                aa = 23
                            } else {
                                Y = 1
                                Z = 0
                                _ = E
                                $ = s
                                aa = 22
                            }
                            break
                        }
                        default: {
                            Y = 1
                            Z = 0
                            _ = E
                            $ = s
                            aa = 22
                        }
                    }
                    if ((aa | 0) == 22)
                        while (1) {
                            aa = 0
                            G = Rn(Y | 0, Z | 0, 1) | 0
                            C = I
                            c = _
                            _ = Wn(_ | 0, $ | 0, 2) | 0
                            if (!(($ >>> 0 > 0) | ((($ | 0) == 0) & (c >>> 0 > 7)))) {
                                ba = G
                                ca = C
                                aa = 23
                                break
                            } else {
                                Y = G
                                Z = C
                                $ = I
                                aa = 22
                            }
                        }
                    if ((aa | 0) == 23)
                        while (1) {
                            aa = 0
                            C = up(E | 0, s | 0, ba | 0, ca | 0) | 0
                            G = Tn(C | 0, I | 0, ba | 0, ca | 0) | 0
                            C = Wn(G | 0, I | 0, 1) | 0
                            G = I
                            c = on(C | 0, G | 0, C | 0, G | 0) | 0
                            D = I
                            if ((D >>> 0 > s >>> 0) | (((D | 0) == (s | 0)) & (c >>> 0 > E >>> 0))) {
                                ba = C
                                ca = G
                                aa = 23
                            } else {
                                W = C
                                X = G
                                break
                            }
                        }
                    E = on(W | 0, X | 0, Q | 0, v | 0) | 0
                    s = I
                    G = on(W | 0, X | 0, w | 0, t | 0) | 0
                    C = I
                    c = Tn(E | 0, s | 0, V | 0, m | 0) | 0
                    D = I
                    H = Tn(G | 0, C | 0, R | 0, o | 0) | 0
                    K = I
                    x = zk(c | 0, D | 0, N | 0, L | 0) | 0
                    D = I
                    c = zk(H | 0, K | 0, N | 0, L | 0) | 0
                    K = I
                    H = Vn(V | 0, m | 0, E | 0, s | 0) | 0
                    s = I
                    E = Vn(R | 0, o | 0, G | 0, C | 0) | 0
                    C = I
                    G = zk(H | 0, s | 0, N | 0, L | 0) | 0
                    s = I
                    H = zk(E | 0, C | 0, N | 0, L | 0) | 0
                    C = I
                    E = e << 1
                    F = f[(d + (E << 2)) >> 2] | 0
                    M = (((F | 0) < 0) << 31) >> 31
                    B = f[(d + ((E | 1) << 2)) >> 2] | 0
                    E = (((B | 0) < 0) << 31) >> 31
                    O = Vn(F | 0, M | 0, x | 0, D | 0) | 0
                    J = I
                    P = Vn(B | 0, E | 0, c | 0, K | 0) | 0
                    U = I
                    T = on(O | 0, J | 0, O | 0, J | 0) | 0
                    J = I
                    O = on(P | 0, U | 0, P | 0, U | 0) | 0
                    U = Tn(O | 0, I | 0, T | 0, J | 0) | 0
                    J = I
                    T = Vn(F | 0, M | 0, G | 0, s | 0) | 0
                    M = I
                    F = Vn(B | 0, E | 0, H | 0, C | 0) | 0
                    E = I
                    B = on(T | 0, M | 0, T | 0, M | 0) | 0
                    M = I
                    T = on(F | 0, E | 0, F | 0, E | 0) | 0
                    E = Tn(T | 0, I | 0, B | 0, M | 0) | 0
                    M = I
                    B = (a + 16) | 0
                    T = (a + 20) | 0
                    F = f[T >> 2] | 0
                    O = f[(a + 24) >> 2] | 0
                    P = (F | 0) == ((O << 5) | 0)
                    if ((J >>> 0 < M >>> 0) | (((J | 0) == (M | 0)) & (U >>> 0 < E >>> 0))) {
                        do
                            if (P)
                                if (((F + 1) | 0) < 0) mq(B)
                                else {
                                    E = O << 6
                                    U = (F + 32) & -32
                                    hi(B, F >>> 0 < 1073741823 ? (E >>> 0 < U >>> 0 ? U : E) : 2147483647)
                                    da = f[T >> 2] | 0
                                    break
                                }
                            else da = F
                        while (0)
                        f[T >> 2] = da + 1
                        L = ((f[B >> 2] | 0) + ((da >>> 5) << 2)) | 0
                        f[L >> 2] = f[L >> 2] | (1 << (da & 31))
                        ea = x
                        fa = c
                        ga = K
                        ha = D
                    } else {
                        do
                            if (P)
                                if (((F + 1) | 0) < 0) mq(B)
                                else {
                                    L = O << 6
                                    N = (F + 32) & -32
                                    hi(B, F >>> 0 < 1073741823 ? (L >>> 0 < N >>> 0 ? N : L) : 2147483647)
                                    ia = f[T >> 2] | 0
                                    break
                                }
                            else ia = F
                        while (0)
                        f[T >> 2] = ia + 1
                        F = ((f[B >> 2] | 0) + ((ia >>> 5) << 2)) | 0
                        f[F >> 2] = f[F >> 2] & ~(1 << (ia & 31))
                        ea = G
                        fa = H
                        ga = C
                        ha = s
                    }
                    f[(a + 8) >> 2] = ea
                    f[(a + 12) >> 2] = fa
                    u = g
                    return 1
                }
            while (0)
            do
                if (q) ja = n << 1
                else {
                    if ((e | 0) > 0) {
                        ja = ((e << 1) + -2) | 0
                        break
                    }
                    fa = (a + 8) | 0
                    f[fa >> 2] = 0
                    f[(fa + 4) >> 2] = 0
                    u = g
                    return 1
                }
            while (0)
            f[(a + 8) >> 2] = f[(d + (ja << 2)) >> 2]
            f[(a + 12) >> 2] = f[(d + ((ja + 1) << 2)) >> 2]
            u = g
            return 1
        }
        function ub(a, c, e, g) {
            a = a | 0
            c = c | 0
            e = e | 0
            g = g | 0
            var i = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 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 = Oa,
                D = 0,
                E = 0.0,
                F = 0,
                G = 0
            if (!g) {
                i = 0
                return i | 0
            }
            do
                switch (f[(a + 28) >> 2] | 0) {
                    case 1: {
                        k = (a + 24) | 0
                        l = b[k >> 0] | 0
                        if ((((l << 24) >> 24 > (e << 24) >> 24 ? e : l) << 24) >> 24 > 0) {
                            m = f[f[a >> 2] >> 2] | 0
                            o = (a + 40) | 0
                            q = on(f[o >> 2] | 0, f[(o + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            o = (a + 48) | 0
                            r = Tn(q | 0, I | 0, f[o >> 2] | 0, f[(o + 4) >> 2] | 0) | 0
                            o = (m + r) | 0
                            r = 0
                            while (1) {
                                m = b[o >> 0] | 0
                                q = (g + (r << 3)) | 0
                                f[q >> 2] = m
                                f[(q + 4) >> 2] = (((m | 0) < 0) << 31) >> 31
                                r = (r + 1) | 0
                                m = b[k >> 0] | 0
                                if ((r | 0) >= (((((m << 24) >> 24 > (e << 24) >> 24 ? e : m) << 24) >> 24) | 0)) {
                                    s = m
                                    break
                                } else o = (o + 1) | 0
                            }
                        } else s = l
                        o = (s << 24) >> 24
                        if ((s << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (o << 3)) | 0, 0, ((((e << 24) >> 24) - o) << 3) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 2: {
                        o = (a + 24) | 0
                        r = b[o >> 0] | 0
                        if ((((r << 24) >> 24 > (e << 24) >> 24 ? e : r) << 24) >> 24 > 0) {
                            k = f[f[a >> 2] >> 2] | 0
                            m = (a + 40) | 0
                            q = on(f[m >> 2] | 0, f[(m + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            m = (a + 48) | 0
                            t = Tn(q | 0, I | 0, f[m >> 2] | 0, f[(m + 4) >> 2] | 0) | 0
                            m = (k + t) | 0
                            t = 0
                            while (1) {
                                k = (g + (t << 3)) | 0
                                f[k >> 2] = h[m >> 0]
                                f[(k + 4) >> 2] = 0
                                t = (t + 1) | 0
                                k = b[o >> 0] | 0
                                if ((t | 0) >= (((((k << 24) >> 24 > (e << 24) >> 24 ? e : k) << 24) >> 24) | 0)) {
                                    u = k
                                    break
                                } else m = (m + 1) | 0
                            }
                        } else u = r
                        m = (u << 24) >> 24
                        if ((u << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (m << 3)) | 0, 0, ((((e << 24) >> 24) - m) << 3) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 3: {
                        m = (a + 24) | 0
                        t = b[m >> 0] | 0
                        if ((((t << 24) >> 24 > (e << 24) >> 24 ? e : t) << 24) >> 24 > 0) {
                            o = f[f[a >> 2] >> 2] | 0
                            l = (a + 40) | 0
                            k = on(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            l = (a + 48) | 0
                            q = Tn(k | 0, I | 0, f[l >> 2] | 0, f[(l + 4) >> 2] | 0) | 0
                            l = (o + q) | 0
                            q = 0
                            while (1) {
                                o = d[l >> 1] | 0
                                k = (g + (q << 3)) | 0
                                f[k >> 2] = o
                                f[(k + 4) >> 2] = (((o | 0) < 0) << 31) >> 31
                                q = (q + 1) | 0
                                o = b[m >> 0] | 0
                                if ((q | 0) >= (((((o << 24) >> 24 > (e << 24) >> 24 ? e : o) << 24) >> 24) | 0)) {
                                    v = o
                                    break
                                } else l = (l + 2) | 0
                            }
                        } else v = t
                        l = (v << 24) >> 24
                        if ((v << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (l << 3)) | 0, 0, ((((e << 24) >> 24) - l) << 3) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 4: {
                        l = (a + 24) | 0
                        q = b[l >> 0] | 0
                        if ((((q << 24) >> 24 > (e << 24) >> 24 ? e : q) << 24) >> 24 > 0) {
                            m = f[f[a >> 2] >> 2] | 0
                            r = (a + 40) | 0
                            o = on(f[r >> 2] | 0, f[(r + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            r = (a + 48) | 0
                            k = Tn(o | 0, I | 0, f[r >> 2] | 0, f[(r + 4) >> 2] | 0) | 0
                            r = (m + k) | 0
                            k = 0
                            while (1) {
                                m = (g + (k << 3)) | 0
                                f[m >> 2] = j[r >> 1]
                                f[(m + 4) >> 2] = 0
                                k = (k + 1) | 0
                                m = b[l >> 0] | 0
                                if ((k | 0) >= (((((m << 24) >> 24 > (e << 24) >> 24 ? e : m) << 24) >> 24) | 0)) {
                                    w = m
                                    break
                                } else r = (r + 2) | 0
                            }
                        } else w = q
                        r = (w << 24) >> 24
                        if ((w << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (r << 3)) | 0, 0, ((((e << 24) >> 24) - r) << 3) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 5: {
                        r = (a + 24) | 0
                        k = b[r >> 0] | 0
                        if ((((k << 24) >> 24 > (e << 24) >> 24 ? e : k) << 24) >> 24 > 0) {
                            l = f[f[a >> 2] >> 2] | 0
                            t = (a + 40) | 0
                            m = on(f[t >> 2] | 0, f[(t + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            t = (a + 48) | 0
                            o = Tn(m | 0, I | 0, f[t >> 2] | 0, f[(t + 4) >> 2] | 0) | 0
                            t = (l + o) | 0
                            o = 0
                            while (1) {
                                l = f[t >> 2] | 0
                                m = (g + (o << 3)) | 0
                                f[m >> 2] = l
                                f[(m + 4) >> 2] = (((l | 0) < 0) << 31) >> 31
                                o = (o + 1) | 0
                                l = b[r >> 0] | 0
                                if ((o | 0) >= (((((l << 24) >> 24 > (e << 24) >> 24 ? e : l) << 24) >> 24) | 0)) {
                                    x = l
                                    break
                                } else t = (t + 4) | 0
                            }
                        } else x = k
                        t = (x << 24) >> 24
                        if ((x << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (t << 3)) | 0, 0, ((((e << 24) >> 24) - t) << 3) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 6: {
                        t = (a + 24) | 0
                        o = b[t >> 0] | 0
                        if ((((o << 24) >> 24 > (e << 24) >> 24 ? e : o) << 24) >> 24 > 0) {
                            r = f[f[a >> 2] >> 2] | 0
                            q = (a + 40) | 0
                            l = on(f[q >> 2] | 0, f[(q + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            q = (a + 48) | 0
                            m = Tn(l | 0, I | 0, f[q >> 2] | 0, f[(q + 4) >> 2] | 0) | 0
                            q = (r + m) | 0
                            m = 0
                            while (1) {
                                r = (g + (m << 3)) | 0
                                f[r >> 2] = f[q >> 2]
                                f[(r + 4) >> 2] = 0
                                m = (m + 1) | 0
                                r = b[t >> 0] | 0
                                if ((m | 0) >= (((((r << 24) >> 24 > (e << 24) >> 24 ? e : r) << 24) >> 24) | 0)) {
                                    y = r
                                    break
                                } else q = (q + 4) | 0
                            }
                        } else y = o
                        q = (y << 24) >> 24
                        if ((y << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (q << 3)) | 0, 0, ((((e << 24) >> 24) - q) << 3) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 7: {
                        q = (a + 24) | 0
                        m = b[q >> 0] | 0
                        if ((((m << 24) >> 24 > (e << 24) >> 24 ? e : m) << 24) >> 24 > 0) {
                            t = f[f[a >> 2] >> 2] | 0
                            k = (a + 40) | 0
                            r = on(f[k >> 2] | 0, f[(k + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            k = (a + 48) | 0
                            l = Tn(r | 0, I | 0, f[k >> 2] | 0, f[(k + 4) >> 2] | 0) | 0
                            k = (t + l) | 0
                            l = 0
                            while (1) {
                                t = k
                                r = f[(t + 4) >> 2] | 0
                                z = (g + (l << 3)) | 0
                                f[z >> 2] = f[t >> 2]
                                f[(z + 4) >> 2] = r
                                l = (l + 1) | 0
                                r = b[q >> 0] | 0
                                if ((l | 0) >= (((((r << 24) >> 24 > (e << 24) >> 24 ? e : r) << 24) >> 24) | 0)) {
                                    A = r
                                    break
                                } else k = (k + 8) | 0
                            }
                        } else A = m
                        k = (A << 24) >> 24
                        if ((A << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (k << 3)) | 0, 0, ((((e << 24) >> 24) - k) << 3) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 8: {
                        k = (a + 24) | 0
                        l = b[k >> 0] | 0
                        if ((((l << 24) >> 24 > (e << 24) >> 24 ? e : l) << 24) >> 24 > 0) {
                            q = f[f[a >> 2] >> 2] | 0
                            o = (a + 40) | 0
                            r = on(f[o >> 2] | 0, f[(o + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            o = (a + 48) | 0
                            z = Tn(r | 0, I | 0, f[o >> 2] | 0, f[(o + 4) >> 2] | 0) | 0
                            o = (q + z) | 0
                            z = 0
                            while (1) {
                                q = o
                                r = f[(q + 4) >> 2] | 0
                                t = (g + (z << 3)) | 0
                                f[t >> 2] = f[q >> 2]
                                f[(t + 4) >> 2] = r
                                z = (z + 1) | 0
                                r = b[k >> 0] | 0
                                if ((z | 0) >= (((((r << 24) >> 24 > (e << 24) >> 24 ? e : r) << 24) >> 24) | 0)) {
                                    B = r
                                    break
                                } else o = (o + 8) | 0
                            }
                        } else B = l
                        o = (B << 24) >> 24
                        if ((B << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (o << 3)) | 0, 0, ((((e << 24) >> 24) - o) << 3) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 9: {
                        o = (a + 24) | 0
                        z = b[o >> 0] | 0
                        if ((((z << 24) >> 24 > (e << 24) >> 24 ? e : z) << 24) >> 24 > 0) {
                            k = f[f[a >> 2] >> 2] | 0
                            m = (a + 40) | 0
                            r = on(f[m >> 2] | 0, f[(m + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            m = (a + 48) | 0
                            t = Tn(r | 0, I | 0, f[m >> 2] | 0, f[(m + 4) >> 2] | 0) | 0
                            m = (k + t) | 0
                            t = 0
                            while (1) {
                                C = $(n[m >> 2])
                                k = +K(+C) >= 1.0 ? (+C > 0.0 ? ~~+Y(+J(+C / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((+C - +(~~+C >>> 0)) / 4294967296.0) >>> 0) : 0
                                r = (g + (t << 3)) | 0
                                f[r >> 2] = ~~+C >>> 0
                                f[(r + 4) >> 2] = k
                                t = (t + 1) | 0
                                k = b[o >> 0] | 0
                                if ((t | 0) >= (((((k << 24) >> 24 > (e << 24) >> 24 ? e : k) << 24) >> 24) | 0)) {
                                    D = k
                                    break
                                } else m = (m + 4) | 0
                            }
                        } else D = z
                        m = (D << 24) >> 24
                        if ((D << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (m << 3)) | 0, 0, ((((e << 24) >> 24) - m) << 3) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 10: {
                        m = (a + 24) | 0
                        t = b[m >> 0] | 0
                        if ((((t << 24) >> 24 > (e << 24) >> 24 ? e : t) << 24) >> 24 > 0) {
                            o = f[f[a >> 2] >> 2] | 0
                            l = (a + 40) | 0
                            k = on(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            l = (a + 48) | 0
                            r = Tn(k | 0, I | 0, f[l >> 2] | 0, f[(l + 4) >> 2] | 0) | 0
                            l = (o + r) | 0
                            r = 0
                            while (1) {
                                E = +p[l >> 3]
                                o = +K(E) >= 1.0 ? (E > 0.0 ? ~~+Y(+J(E / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((E - +(~~E >>> 0)) / 4294967296.0) >>> 0) : 0
                                k = (g + (r << 3)) | 0
                                f[k >> 2] = ~~E >>> 0
                                f[(k + 4) >> 2] = o
                                r = (r + 1) | 0
                                o = b[m >> 0] | 0
                                if ((r | 0) >= (((((o << 24) >> 24 > (e << 24) >> 24 ? e : o) << 24) >> 24) | 0)) {
                                    F = o
                                    break
                                } else l = (l + 8) | 0
                            }
                        } else F = t
                        l = (F << 24) >> 24
                        if ((F << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (l << 3)) | 0, 0, ((((e << 24) >> 24) - l) << 3) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 11: {
                        l = (a + 24) | 0
                        r = b[l >> 0] | 0
                        if ((((r << 24) >> 24 > (e << 24) >> 24 ? e : r) << 24) >> 24 > 0) {
                            m = f[f[a >> 2] >> 2] | 0
                            z = (a + 40) | 0
                            o = on(f[z >> 2] | 0, f[(z + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            z = (a + 48) | 0
                            k = Tn(o | 0, I | 0, f[z >> 2] | 0, f[(z + 4) >> 2] | 0) | 0
                            z = (m + k) | 0
                            k = 0
                            while (1) {
                                m = (g + (k << 3)) | 0
                                f[m >> 2] = h[z >> 0]
                                f[(m + 4) >> 2] = 0
                                k = (k + 1) | 0
                                m = b[l >> 0] | 0
                                if ((k | 0) >= (((((m << 24) >> 24 > (e << 24) >> 24 ? e : m) << 24) >> 24) | 0)) {
                                    G = m
                                    break
                                } else z = (z + 1) | 0
                            }
                        } else G = r
                        z = (G << 24) >> 24
                        if ((G << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (z << 3)) | 0, 0, ((((e << 24) >> 24) - z) << 3) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    default: {
                        i = 0
                        return i | 0
                    }
                }
            while (0)
            return 0
        }
        function vb(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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
            c = u
            u = (u + 16) | 0
            d = (c + 8) | 0
            e = c
            if ((f[(a + 92) >> 2] | 0) == (f[(a + 88) >> 2] | 0)) {
                u = c
                return 1
            }
            g = (a + 52) | 0
            h = f[g >> 2] | 0
            if ((h | 0) == (f[(a + 56) >> 2] | 0)) {
                Ci((a + 48) | 0, b)
                i = b
            } else {
                f[h >> 2] = f[b >> 2]
                f[g >> 2] = h + 4
                i = b
            }
            b = (a + 84) | 0
            f[b >> 2] = 0
            h = (a + 4) | 0
            g = f[h >> 2] | 0
            j = f[i >> 2] | 0
            k = (j + 1) | 0
            if ((j | 0) != -1) {
                l = ((k >>> 0) % 3 | 0 | 0) == 0 ? (j + -2) | 0 : k
                if ((l | 0) == -1) m = -1
                else m = f[((f[g >> 2] | 0) + (l << 2)) >> 2] | 0
                l = ((((j >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + j) | 0
                if ((l | 0) == -1) {
                    n = m
                    o = -1
                } else {
                    n = m
                    o = f[((f[g >> 2] | 0) + (l << 2)) >> 2] | 0
                }
            } else {
                n = -1
                o = -1
            }
            l = (a + 36) | 0
            g = f[l >> 2] | 0
            m = (g + ((n >>> 5) << 2)) | 0
            j = 1 << (n & 31)
            k = f[m >> 2] | 0
            if (!(k & j)) {
                f[m >> 2] = k | j
                j = f[i >> 2] | 0
                k = (j + 1) | 0
                if ((j | 0) == -1) p = -1
                else p = ((k >>> 0) % 3 | 0 | 0) == 0 ? (j + -2) | 0 : k
                f[e >> 2] = p
                k = f[((f[((f[(a + 16) >> 2] | 0) + 96) >> 2] | 0) + (((((p >>> 0) / 3) | 0) * 12) | 0) + (((p >>> 0) % 3 | 0) << 2)) >> 2] | 0
                p = f[(a + 20) >> 2] | 0
                f[d >> 2] = k
                j = f[(p + 4) >> 2] | 0
                p = (j + 4) | 0
                m = f[p >> 2] | 0
                if ((m | 0) == (f[(j + 8) >> 2] | 0)) Ci(j, d)
                else {
                    f[m >> 2] = k
                    f[p >> 2] = m + 4
                }
                m = (a + 12) | 0
                p = f[m >> 2] | 0
                k = (p + 4) | 0
                j = f[k >> 2] | 0
                if ((j | 0) == (f[(p + 8) >> 2] | 0)) {
                    Ci(p, e)
                    q = f[m >> 2] | 0
                } else {
                    f[j >> 2] = f[e >> 2]
                    f[k >> 2] = j + 4
                    q = p
                }
                p = (q + 24) | 0
                f[((f[(q + 12) >> 2] | 0) + (n << 2)) >> 2] = f[p >> 2]
                f[p >> 2] = (f[p >> 2] | 0) + 1
                r = f[l >> 2] | 0
            } else r = g
            g = (r + ((o >>> 5) << 2)) | 0
            r = 1 << (o & 31)
            p = f[g >> 2] | 0
            if (!(p & r)) {
                f[g >> 2] = p | r
                r = f[i >> 2] | 0
                do
                    if ((r | 0) != -1)
                        if (!((r >>> 0) % 3 | 0)) {
                            s = (r + 2) | 0
                            break
                        } else {
                            s = (r + -1) | 0
                            break
                        }
                    else s = -1
                while (0)
                f[e >> 2] = s
                r = f[((f[((f[(a + 16) >> 2] | 0) + 96) >> 2] | 0) + (((((s >>> 0) / 3) | 0) * 12) | 0) + (((s >>> 0) % 3 | 0) << 2)) >> 2] | 0
                s = f[(a + 20) >> 2] | 0
                f[d >> 2] = r
                p = f[(s + 4) >> 2] | 0
                s = (p + 4) | 0
                g = f[s >> 2] | 0
                if ((g | 0) == (f[(p + 8) >> 2] | 0)) Ci(p, d)
                else {
                    f[g >> 2] = r
                    f[s >> 2] = g + 4
                }
                g = (a + 12) | 0
                s = f[g >> 2] | 0
                r = (s + 4) | 0
                p = f[r >> 2] | 0
                if ((p | 0) == (f[(s + 8) >> 2] | 0)) {
                    Ci(s, e)
                    t = f[g >> 2] | 0
                } else {
                    f[p >> 2] = f[e >> 2]
                    f[r >> 2] = p + 4
                    t = s
                }
                s = (t + 24) | 0
                f[((f[(t + 12) >> 2] | 0) + (o << 2)) >> 2] = f[s >> 2]
                f[s >> 2] = (f[s >> 2] | 0) + 1
            }
            s = f[i >> 2] | 0
            if ((s | 0) == -1) v = -1
            else v = f[((f[f[h >> 2] >> 2] | 0) + (s << 2)) >> 2] | 0
            s = ((f[l >> 2] | 0) + ((v >>> 5) << 2)) | 0
            o = 1 << (v & 31)
            t = f[s >> 2] | 0
            if (!(o & t)) {
                f[s >> 2] = t | o
                o = f[i >> 2] | 0
                f[e >> 2] = o
                t = f[((f[((f[(a + 16) >> 2] | 0) + 96) >> 2] | 0) + (((((o >>> 0) / 3) | 0) * 12) | 0) + (((o >>> 0) % 3 | 0) << 2)) >> 2] | 0
                o = f[(a + 20) >> 2] | 0
                f[d >> 2] = t
                s = f[(o + 4) >> 2] | 0
                o = (s + 4) | 0
                p = f[o >> 2] | 0
                if ((p | 0) == (f[(s + 8) >> 2] | 0)) Ci(s, d)
                else {
                    f[p >> 2] = t
                    f[o >> 2] = p + 4
                }
                p = (a + 12) | 0
                o = f[p >> 2] | 0
                t = (o + 4) | 0
                s = f[t >> 2] | 0
                if ((s | 0) == (f[(o + 8) >> 2] | 0)) {
                    Ci(o, e)
                    w = f[p >> 2] | 0
                } else {
                    f[s >> 2] = f[e >> 2]
                    f[t >> 2] = s + 4
                    w = o
                }
                o = (w + 24) | 0
                f[((f[(w + 12) >> 2] | 0) + (v << 2)) >> 2] = f[o >> 2]
                f[o >> 2] = (f[o >> 2] | 0) + 1
            }
            o = f[b >> 2] | 0
            a: do
                if ((o | 0) < 3) {
                    v = (a + 24) | 0
                    w = (a + 16) | 0
                    s = (a + 20) | 0
                    t = (a + 12) | 0
                    p = (a + 88) | 0
                    r = o
                    while (1) {
                        g = r
                        while (1) {
                            x = (a + 48 + ((g * 12) | 0) + 4) | 0
                            y = f[x >> 2] | 0
                            if ((f[(a + 48 + ((g * 12) | 0)) >> 2] | 0) != (y | 0)) break
                            if ((g | 0) < 2) g = (g + 1) | 0
                            else break a
                        }
                        n = (y + -4) | 0
                        q = f[n >> 2] | 0
                        f[x >> 2] = n
                        f[b >> 2] = g
                        f[i >> 2] = q
                        if ((q | 0) == -1) break
                        n = ((q >>> 0) / 3) | 0
                        j = f[v >> 2] | 0
                        do
                            if (!(f[(j + ((n >>> 5) << 2)) >> 2] & (1 << (n & 31)))) {
                                k = q
                                m = j
                                b: while (1) {
                                    z = ((k >>> 0) / 3) | 0
                                    A = (m + ((z >>> 5) << 2)) | 0
                                    f[A >> 2] = (1 << (z & 31)) | f[A >> 2]
                                    A = f[i >> 2] | 0
                                    if ((A | 0) == -1) B = -1
                                    else B = f[((f[f[h >> 2] >> 2] | 0) + (A << 2)) >> 2] | 0
                                    z = ((f[l >> 2] | 0) + ((B >>> 5) << 2)) | 0
                                    C = 1 << (B & 31)
                                    D = f[z >> 2] | 0
                                    if (!(C & D)) {
                                        f[z >> 2] = D | C
                                        C = f[i >> 2] | 0
                                        f[e >> 2] = C
                                        D = f[((f[((f[w >> 2] | 0) + 96) >> 2] | 0) + (((((C >>> 0) / 3) | 0) * 12) | 0) + (((C >>> 0) % 3 | 0) << 2)) >> 2] | 0
                                        C = f[s >> 2] | 0
                                        f[d >> 2] = D
                                        z = f[(C + 4) >> 2] | 0
                                        C = (z + 4) | 0
                                        E = f[C >> 2] | 0
                                        if ((E | 0) == (f[(z + 8) >> 2] | 0)) Ci(z, d)
                                        else {
                                            f[E >> 2] = D
                                            f[C >> 2] = E + 4
                                        }
                                        E = f[t >> 2] | 0
                                        C = (E + 4) | 0
                                        D = f[C >> 2] | 0
                                        if ((D | 0) == (f[(E + 8) >> 2] | 0)) {
                                            Ci(E, e)
                                            F = f[t >> 2] | 0
                                        } else {
                                            f[D >> 2] = f[e >> 2]
                                            f[C >> 2] = D + 4
                                            F = E
                                        }
                                        E = (F + 24) | 0
                                        f[((f[(F + 12) >> 2] | 0) + (B << 2)) >> 2] = f[E >> 2]
                                        f[E >> 2] = (f[E >> 2] | 0) + 1
                                        G = f[i >> 2] | 0
                                    } else G = A
                                    A = f[h >> 2] | 0
                                    if ((G | 0) == -1) {
                                        H = 93
                                        break
                                    }
                                    E = (G + 1) | 0
                                    D = ((E >>> 0) % 3 | 0 | 0) == 0 ? (G + -2) | 0 : E
                                    if ((D | 0) == -1) I = -1
                                    else I = f[((f[(A + 12) >> 2] | 0) + (D << 2)) >> 2] | 0
                                    D = ((((G >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + G) | 0
                                    if ((D | 0) == -1) J = -1
                                    else J = f[((f[(A + 12) >> 2] | 0) + (D << 2)) >> 2] | 0
                                    D = (I | 0) == -1
                                    E = D ? -1 : ((I >>> 0) / 3) | 0
                                    C = (J | 0) == -1
                                    z = C ? -1 : ((J >>> 0) / 3) | 0
                                    if (D) K = 1
                                    else K = ((f[((f[v >> 2] | 0) + ((E >>> 5) << 2)) >> 2] & (1 << (E & 31))) | 0) != 0
                                    do
                                        if (C)
                                            if (K) {
                                                H = 93
                                                break b
                                            } else H = 82
                                        else {
                                            if ((f[((f[v >> 2] | 0) + ((z >>> 5) << 2)) >> 2] & (1 << (z & 31))) | 0)
                                                if (K) {
                                                    H = 93
                                                    break b
                                                } else {
                                                    H = 82
                                                    break
                                                }
                                            E = f[((f[A >> 2] | 0) + (J << 2)) >> 2] | 0
                                            if (!((1 << (E & 31)) & f[((f[l >> 2] | 0) + ((E >>> 5) << 2)) >> 2])) {
                                                L = ((f[p >> 2] | 0) + (E << 2)) | 0
                                                E = f[L >> 2] | 0
                                                f[L >> 2] = E + 1
                                                M = (E | 0) > 0 ? 1 : 2
                                            } else M = 0
                                            if (K ? (M | 0) <= (f[b >> 2] | 0) : 0) {
                                                N = J
                                                break
                                            }
                                            f[d >> 2] = J
                                            E = (a + 48 + ((M * 12) | 0) + 4) | 0
                                            L = f[E >> 2] | 0
                                            if ((L | 0) == (f[(a + 48 + ((M * 12) | 0) + 8) >> 2] | 0)) Ci((a + 48 + ((M * 12) | 0)) | 0, d)
                                            else {
                                                f[L >> 2] = J
                                                f[E >> 2] = L + 4
                                            }
                                            if ((f[b >> 2] | 0) > (M | 0)) f[b >> 2] = M
                                            if (K) {
                                                H = 93
                                                break b
                                            } else H = 82
                                        }
                                    while (0)
                                    if ((H | 0) == 82) {
                                        H = 0
                                        if (D) O = -1
                                        else O = f[((f[f[h >> 2] >> 2] | 0) + (I << 2)) >> 2] | 0
                                        if (!((1 << (O & 31)) & f[((f[l >> 2] | 0) + ((O >>> 5) << 2)) >> 2])) {
                                            A = ((f[p >> 2] | 0) + (O << 2)) | 0
                                            z = f[A >> 2] | 0
                                            f[A >> 2] = z + 1
                                            P = (z | 0) > 0 ? 1 : 2
                                        } else P = 0
                                        if ((P | 0) > (f[b >> 2] | 0)) break
                                        else N = I
                                    }
                                    f[i >> 2] = N
                                    k = N
                                    m = f[v >> 2] | 0
                                }
                                if ((H | 0) == 93) {
                                    H = 0
                                    Q = f[b >> 2] | 0
                                    break
                                }
                                f[d >> 2] = I
                                m = (a + 48 + ((P * 12) | 0) + 4) | 0
                                k = f[m >> 2] | 0
                                if ((k | 0) == (f[(a + 48 + ((P * 12) | 0) + 8) >> 2] | 0)) Ci((a + 48 + ((P * 12) | 0)) | 0, d)
                                else {
                                    f[k >> 2] = I
                                    f[m >> 2] = k + 4
                                }
                                k = f[b >> 2] | 0
                                if ((k | 0) > (P | 0)) {
                                    f[b >> 2] = P
                                    R = P
                                } else R = k
                                Q = R
                            } else Q = g
                        while (0)
                        if ((Q | 0) < 3) r = Q
                        else break a
                    }
                    u = c
                    return 1
                }
            while (0)
            f[i >> 2] = -1
            u = c
            return 1
        }
        function wb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    wb(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    wb((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function xb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    xb(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    xb((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function yb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    yb(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    yb((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function zb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    zb(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    zb((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function Ab(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    Ab(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    Ab((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function Bb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    Bb(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    Bb((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function Cb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    Cb(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    Cb((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function Db(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    Db(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    Db((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function Eb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    Eb(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    Eb((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function Fb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    Fb(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    Fb((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function Gb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    Gb(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    Gb((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function Hb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    Hb(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    Hb((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function Ib(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    Ib(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    Ib((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function Jb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    Jb(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    Jb((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function Kb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    Kb(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    Kb((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function Lb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    Lb(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    Lb((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function Mb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    Mb(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    Mb((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function Nb(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 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,
                u = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0
            d = a
            a = b
            a: while (1) {
                b = a
                e = (a + -4) | 0
                g = d
                while (1) {
                    h = g
                    b: while (1) {
                        i = h
                        j = (b - i) | 0
                        k = j >> 2
                        switch (k | 0) {
                            case 2: {
                                l = 5
                                break a
                                break
                            }
                            case 3: {
                                l = 11
                                break a
                                break
                            }
                            case 4: {
                                l = 12
                                break a
                                break
                            }
                            case 5: {
                                l = 13
                                break a
                                break
                            }
                            case 1:
                            case 0: {
                                l = 84
                                break a
                                break
                            }
                            default: {
                            }
                        }
                        if ((j | 0) < 124) {
                            l = 15
                            break a
                        }
                        m = (h + ((((k | 0) / 2) | 0) << 2)) | 0
                        if ((j | 0) > 3996) {
                            j = ((k | 0) / 4) | 0
                            n = Tf(h, (h + (j << 2)) | 0, m, (m + (j << 2)) | 0, e, c) | 0
                        } else n = Cg(h, m, e, c) | 0
                        o = f[h >> 2] | 0
                        j = f[m >> 2] | 0
                        p = f[c >> 2] | 0
                        k = f[p >> 2] | 0
                        q = ((f[(p + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= o >>> 0) {
                            l = 20
                            break a
                        }
                        r = k
                        if (q >>> 0 <= j >>> 0) {
                            l = 22
                            break a
                        }
                        k = f[(r + (o << 3)) >> 2] | 0
                        s = f[(r + (j << 3)) >> 2] | 0
                        if (k >>> 0 < s >>> 0) {
                            t = e
                            u = n
                            break
                        } else v = e
                        while (1) {
                            v = (v + -4) | 0
                            if ((h | 0) == (v | 0)) break
                            w = f[v >> 2] | 0
                            if (q >>> 0 <= w >>> 0) {
                                l = 51
                                break a
                            }
                            if ((f[(r + (w << 3)) >> 2] | 0) >>> 0 < s >>> 0) {
                                l = 53
                                break b
                            }
                        }
                        s = (h + 4) | 0
                        j = f[e >> 2] | 0
                        if (q >>> 0 <= j >>> 0) {
                            l = 26
                            break a
                        }
                        if (k >>> 0 < (f[(r + (j << 3)) >> 2] | 0) >>> 0) x = s
                        else {
                            if ((s | 0) == (e | 0)) {
                                l = 84
                                break a
                            } else y = s
                            while (1) {
                                z = f[y >> 2] | 0
                                if (q >>> 0 <= z >>> 0) {
                                    l = 32
                                    break a
                                }
                                if (k >>> 0 < (f[(r + (z << 3)) >> 2] | 0) >>> 0) break
                                s = (y + 4) | 0
                                if ((s | 0) == (e | 0)) {
                                    l = 84
                                    break a
                                } else y = s
                            }
                            f[y >> 2] = j
                            f[e >> 2] = z
                            x = (y + 4) | 0
                        }
                        if ((x | 0) == (e | 0)) {
                            l = 84
                            break a
                        }
                        r = f[h >> 2] | 0
                        A = f[c >> 2] | 0
                        k = f[A >> 2] | 0
                        q = ((f[(A + 4) >> 2] | 0) - k) >> 3
                        if (q >>> 0 <= r >>> 0) {
                            l = 38
                            break a
                        }
                        s = k
                        k = e
                        B = x
                        C = r
                        while (1) {
                            r = (s + (C << 3)) | 0
                            D = q >>> 0 > C >>> 0
                            E = B
                            while (1) {
                                F = f[E >> 2] | 0
                                if (q >>> 0 <= F >>> 0) {
                                    l = 40
                                    break a
                                }
                                G = f[r >> 2] | 0
                                if (G >>> 0 < (f[(s + (F << 3)) >> 2] | 0) >>> 0) break
                                if (D) E = (E + 4) | 0
                                else {
                                    l = 38
                                    break a
                                }
                            }
                            if (q >>> 0 > C >>> 0) H = k
                            else {
                                l = 46
                                break a
                            }
                            do {
                                H = (H + -4) | 0
                                I = f[H >> 2] | 0
                                if (q >>> 0 <= I >>> 0) {
                                    l = 47
                                    break a
                                }
                            } while (G >>> 0 < (f[(s + (I << 3)) >> 2] | 0) >>> 0)
                            if (E >>> 0 >= H >>> 0) {
                                h = E
                                continue b
                            }
                            D = f[E >> 2] | 0
                            f[E >> 2] = I
                            f[H >> 2] = D
                            C = f[h >> 2] | 0
                            if (q >>> 0 <= C >>> 0) {
                                l = 38
                                break a
                            } else {
                                k = H
                                B = (E + 4) | 0
                            }
                        }
                    }
                    if ((l | 0) == 53) {
                        l = 0
                        f[h >> 2] = w
                        f[v >> 2] = o
                        t = v
                        u = (n + 1) | 0
                    }
                    B = (h + 4) | 0
                    c: do
                        if (B >>> 0 < t >>> 0) {
                            k = f[B >> 2] | 0
                            C = f[c >> 2] | 0
                            q = f[C >> 2] | 0
                            s = ((f[(C + 4) >> 2] | 0) - q) >> 3
                            if (s >>> 0 > k >>> 0) {
                                J = t
                                K = B
                                L = u
                                M = m
                                N = s
                                O = q
                                P = C
                                Q = k
                            } else {
                                R = C
                                l = 57
                                break a
                            }
                            while (1) {
                                C = f[c >> 2] | 0
                                k = (C + 4) | 0
                                q = f[M >> 2] | 0
                                s = K
                                j = O
                                D = N
                                S = P
                                r = Q
                                while (1) {
                                    F = j
                                    if (D >>> 0 <= q >>> 0) {
                                        l = 59
                                        break a
                                    }
                                    if ((f[(F + (r << 3)) >> 2] | 0) >>> 0 >= (f[(F + (q << 3)) >> 2] | 0) >>> 0) break
                                    F = (s + 4) | 0
                                    T = f[F >> 2] | 0
                                    j = f[C >> 2] | 0
                                    D = ((f[k >> 2] | 0) - j) >> 3
                                    if (D >>> 0 <= T >>> 0) {
                                        R = C
                                        l = 57
                                        break a
                                    } else {
                                        s = F
                                        S = C
                                        r = T
                                    }
                                }
                                C = f[M >> 2] | 0
                                O = f[S >> 2] | 0
                                N = ((f[(S + 4) >> 2] | 0) - O) >> 3
                                D = O
                                j = (D + (C << 3)) | 0
                                if (N >>> 0 > C >>> 0) U = J
                                else {
                                    l = 65
                                    break a
                                }
                                do {
                                    U = (U + -4) | 0
                                    V = f[U >> 2] | 0
                                    if (N >>> 0 <= V >>> 0) {
                                        l = 66
                                        break a
                                    }
                                } while ((f[(D + (V << 3)) >> 2] | 0) >>> 0 >= (f[j >> 2] | 0) >>> 0)
                                if (s >>> 0 > U >>> 0) {
                                    W = M
                                    X = L
                                    Y = s
                                    break c
                                }
                                f[s >> 2] = V
                                f[U >> 2] = r
                                K = (s + 4) | 0
                                Q = f[K >> 2] | 0
                                if (N >>> 0 <= Q >>> 0) {
                                    R = S
                                    l = 57
                                    break a
                                } else {
                                    J = U
                                    L = (L + 1) | 0
                                    M = (M | 0) == (s | 0) ? U : M
                                    P = S
                                }
                            }
                        } else {
                            W = m
                            X = u
                            Y = B
                        }
                    while (0)
                    if ((Y | 0) != (W | 0)) {
                        B = f[W >> 2] | 0
                        j = f[Y >> 2] | 0
                        Z = f[c >> 2] | 0
                        D = f[Z >> 2] | 0
                        C = ((f[(Z + 4) >> 2] | 0) - D) >> 3
                        if (C >>> 0 <= B >>> 0) {
                            l = 72
                            break a
                        }
                        k = D
                        if (C >>> 0 <= j >>> 0) {
                            l = 74
                            break a
                        }
                        if ((f[(k + (B << 3)) >> 2] | 0) >>> 0 < (f[(k + (j << 3)) >> 2] | 0) >>> 0) {
                            f[Y >> 2] = B
                            f[W >> 2] = j
                            _ = (X + 1) | 0
                        } else _ = X
                    } else _ = X
                    if (!_) {
                        $ = Qd(h, Y, c) | 0
                        j = (Y + 4) | 0
                        if (Qd(j, a, c) | 0) {
                            l = 83
                            break
                        }
                        if ($) {
                            g = j
                            continue
                        }
                    }
                    j = Y
                    if (((j - i) | 0) >= ((b - j) | 0)) {
                        l = 82
                        break
                    }
                    Nb(h, Y, c)
                    g = (Y + 4) | 0
                }
                if ((l | 0) == 82) {
                    l = 0
                    Nb((Y + 4) | 0, a, c)
                    d = h
                    a = Y
                    continue
                } else if ((l | 0) == 83) {
                    l = 0
                    if ($) {
                        l = 84
                        break
                    } else {
                        d = h
                        a = Y
                        continue
                    }
                }
            }
            switch (l | 0) {
                case 5: {
                    l = f[e >> 2] | 0
                    Y = f[h >> 2] | 0
                    d = f[c >> 2] | 0
                    $ = f[d >> 2] | 0
                    i = ((f[(d + 4) >> 2] | 0) - $) >> 3
                    if (i >>> 0 <= l >>> 0) mq(d)
                    _ = $
                    if (i >>> 0 <= Y >>> 0) mq(d)
                    if ((f[(_ + (l << 3)) >> 2] | 0) >>> 0 >= (f[(_ + (Y << 3)) >> 2] | 0) >>> 0) return
                    f[h >> 2] = l
                    f[e >> 2] = Y
                    return
                }
                case 11: {
                    Cg(h, (h + 4) | 0, e, c) | 0
                    return
                }
                case 12: {
                    Qg(h, (h + 4) | 0, (h + 8) | 0, e, c) | 0
                    return
                }
                case 13: {
                    Tf(h, (h + 4) | 0, (h + 8) | 0, (h + 12) | 0, e, c) | 0
                    return
                }
                case 15: {
                    Pg(h, a, c)
                    return
                }
                case 20: {
                    mq(p)
                    break
                }
                case 22: {
                    mq(p)
                    break
                }
                case 26: {
                    mq(p)
                    break
                }
                case 32: {
                    mq(p)
                    break
                }
                case 38: {
                    mq(A)
                    break
                }
                case 40: {
                    mq(A)
                    break
                }
                case 46: {
                    mq(A)
                    break
                }
                case 47: {
                    mq(A)
                    break
                }
                case 51: {
                    mq(p)
                    break
                }
                case 57: {
                    mq(R)
                    break
                }
                case 59: {
                    mq(S)
                    break
                }
                case 65: {
                    if (N >>> 0 > (f[(J + -4) >> 2] | 0) >>> 0) mq(S)
                    else mq(S)
                    break
                }
                case 66: {
                    mq(S)
                    break
                }
                case 72: {
                    mq(Z)
                    break
                }
                case 74: {
                    mq(Z)
                    break
                }
                case 84:
                    return
            }
        }
        function Ob(a, c, e, g) {
            a = a | 0
            c = c | 0
            e = e | 0
            g = g | 0
            var i = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 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
            if (!g) {
                i = 0
                return i | 0
            }
            do
                switch (f[(a + 28) >> 2] | 0) {
                    case 1: {
                        k = (a + 24) | 0
                        l = b[k >> 0] | 0
                        if ((((l << 24) >> 24 > (e << 24) >> 24 ? e : l) << 24) >> 24 > 0) {
                            m = f[f[a >> 2] >> 2] | 0
                            o = (a + 40) | 0
                            q = on(f[o >> 2] | 0, f[(o + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            o = (a + 48) | 0
                            r = Tn(q | 0, I | 0, f[o >> 2] | 0, f[(o + 4) >> 2] | 0) | 0
                            o = (m + r) | 0
                            r = 0
                            while (1) {
                                f[(g + (r << 2)) >> 2] = b[o >> 0]
                                r = (r + 1) | 0
                                m = b[k >> 0] | 0
                                if ((r | 0) >= (((((m << 24) >> 24 > (e << 24) >> 24 ? e : m) << 24) >> 24) | 0)) {
                                    s = m
                                    break
                                } else o = (o + 1) | 0
                            }
                        } else s = l
                        o = (s << 24) >> 24
                        if ((s << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (o << 2)) | 0, 0, ((((e << 24) >> 24) - o) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 2: {
                        o = (a + 24) | 0
                        r = b[o >> 0] | 0
                        if ((((r << 24) >> 24 > (e << 24) >> 24 ? e : r) << 24) >> 24 > 0) {
                            k = f[f[a >> 2] >> 2] | 0
                            m = (a + 40) | 0
                            q = on(f[m >> 2] | 0, f[(m + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            m = (a + 48) | 0
                            t = Tn(q | 0, I | 0, f[m >> 2] | 0, f[(m + 4) >> 2] | 0) | 0
                            m = (k + t) | 0
                            t = 0
                            while (1) {
                                f[(g + (t << 2)) >> 2] = h[m >> 0]
                                t = (t + 1) | 0
                                k = b[o >> 0] | 0
                                if ((t | 0) >= (((((k << 24) >> 24 > (e << 24) >> 24 ? e : k) << 24) >> 24) | 0)) {
                                    u = k
                                    break
                                } else m = (m + 1) | 0
                            }
                        } else u = r
                        m = (u << 24) >> 24
                        if ((u << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (m << 2)) | 0, 0, ((((e << 24) >> 24) - m) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 3: {
                        m = (a + 24) | 0
                        t = b[m >> 0] | 0
                        if ((((t << 24) >> 24 > (e << 24) >> 24 ? e : t) << 24) >> 24 > 0) {
                            o = f[f[a >> 2] >> 2] | 0
                            l = (a + 40) | 0
                            k = on(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            l = (a + 48) | 0
                            q = Tn(k | 0, I | 0, f[l >> 2] | 0, f[(l + 4) >> 2] | 0) | 0
                            l = (o + q) | 0
                            q = 0
                            while (1) {
                                f[(g + (q << 2)) >> 2] = d[l >> 1]
                                q = (q + 1) | 0
                                o = b[m >> 0] | 0
                                if ((q | 0) >= (((((o << 24) >> 24 > (e << 24) >> 24 ? e : o) << 24) >> 24) | 0)) {
                                    v = o
                                    break
                                } else l = (l + 2) | 0
                            }
                        } else v = t
                        l = (v << 24) >> 24
                        if ((v << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (l << 2)) | 0, 0, ((((e << 24) >> 24) - l) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 4: {
                        l = (a + 24) | 0
                        q = b[l >> 0] | 0
                        if ((((q << 24) >> 24 > (e << 24) >> 24 ? e : q) << 24) >> 24 > 0) {
                            m = f[f[a >> 2] >> 2] | 0
                            r = (a + 40) | 0
                            o = on(f[r >> 2] | 0, f[(r + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            r = (a + 48) | 0
                            k = Tn(o | 0, I | 0, f[r >> 2] | 0, f[(r + 4) >> 2] | 0) | 0
                            r = (m + k) | 0
                            k = 0
                            while (1) {
                                f[(g + (k << 2)) >> 2] = j[r >> 1]
                                k = (k + 1) | 0
                                m = b[l >> 0] | 0
                                if ((k | 0) >= (((((m << 24) >> 24 > (e << 24) >> 24 ? e : m) << 24) >> 24) | 0)) {
                                    w = m
                                    break
                                } else r = (r + 2) | 0
                            }
                        } else w = q
                        r = (w << 24) >> 24
                        if ((w << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (r << 2)) | 0, 0, ((((e << 24) >> 24) - r) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 5: {
                        r = (a + 24) | 0
                        k = b[r >> 0] | 0
                        if ((((k << 24) >> 24 > (e << 24) >> 24 ? e : k) << 24) >> 24 > 0) {
                            l = f[f[a >> 2] >> 2] | 0
                            t = (a + 40) | 0
                            m = on(f[t >> 2] | 0, f[(t + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            t = (a + 48) | 0
                            o = Tn(m | 0, I | 0, f[t >> 2] | 0, f[(t + 4) >> 2] | 0) | 0
                            t = (l + o) | 0
                            o = 0
                            while (1) {
                                f[(g + (o << 2)) >> 2] = f[t >> 2]
                                o = (o + 1) | 0
                                l = b[r >> 0] | 0
                                if ((o | 0) >= (((((l << 24) >> 24 > (e << 24) >> 24 ? e : l) << 24) >> 24) | 0)) {
                                    x = l
                                    break
                                } else t = (t + 4) | 0
                            }
                        } else x = k
                        t = (x << 24) >> 24
                        if ((x << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (t << 2)) | 0, 0, ((((e << 24) >> 24) - t) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 6: {
                        t = (a + 24) | 0
                        o = b[t >> 0] | 0
                        if ((((o << 24) >> 24 > (e << 24) >> 24 ? e : o) << 24) >> 24 > 0) {
                            r = f[f[a >> 2] >> 2] | 0
                            q = (a + 40) | 0
                            l = on(f[q >> 2] | 0, f[(q + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            q = (a + 48) | 0
                            m = Tn(l | 0, I | 0, f[q >> 2] | 0, f[(q + 4) >> 2] | 0) | 0
                            q = (r + m) | 0
                            m = 0
                            while (1) {
                                f[(g + (m << 2)) >> 2] = f[q >> 2]
                                m = (m + 1) | 0
                                r = b[t >> 0] | 0
                                if ((m | 0) >= (((((r << 24) >> 24 > (e << 24) >> 24 ? e : r) << 24) >> 24) | 0)) {
                                    y = r
                                    break
                                } else q = (q + 4) | 0
                            }
                        } else y = o
                        q = (y << 24) >> 24
                        if ((y << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (q << 2)) | 0, 0, ((((e << 24) >> 24) - q) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 7: {
                        q = (a + 24) | 0
                        m = b[q >> 0] | 0
                        if ((((m << 24) >> 24 > (e << 24) >> 24 ? e : m) << 24) >> 24 > 0) {
                            t = f[f[a >> 2] >> 2] | 0
                            k = (a + 40) | 0
                            r = on(f[k >> 2] | 0, f[(k + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            k = (a + 48) | 0
                            l = Tn(r | 0, I | 0, f[k >> 2] | 0, f[(k + 4) >> 2] | 0) | 0
                            k = (t + l) | 0
                            l = 0
                            while (1) {
                                f[(g + (l << 2)) >> 2] = f[k >> 2]
                                l = (l + 1) | 0
                                t = b[q >> 0] | 0
                                if ((l | 0) >= (((((t << 24) >> 24 > (e << 24) >> 24 ? e : t) << 24) >> 24) | 0)) {
                                    z = t
                                    break
                                } else k = (k + 8) | 0
                            }
                        } else z = m
                        k = (z << 24) >> 24
                        if ((z << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (k << 2)) | 0, 0, ((((e << 24) >> 24) - k) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 8: {
                        k = (a + 24) | 0
                        l = b[k >> 0] | 0
                        if ((((l << 24) >> 24 > (e << 24) >> 24 ? e : l) << 24) >> 24 > 0) {
                            q = f[f[a >> 2] >> 2] | 0
                            o = (a + 40) | 0
                            t = on(f[o >> 2] | 0, f[(o + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            o = (a + 48) | 0
                            r = Tn(t | 0, I | 0, f[o >> 2] | 0, f[(o + 4) >> 2] | 0) | 0
                            o = (q + r) | 0
                            r = 0
                            while (1) {
                                f[(g + (r << 2)) >> 2] = f[o >> 2]
                                r = (r + 1) | 0
                                q = b[k >> 0] | 0
                                if ((r | 0) >= (((((q << 24) >> 24 > (e << 24) >> 24 ? e : q) << 24) >> 24) | 0)) {
                                    A = q
                                    break
                                } else o = (o + 8) | 0
                            }
                        } else A = l
                        o = (A << 24) >> 24
                        if ((A << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (o << 2)) | 0, 0, ((((e << 24) >> 24) - o) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 9: {
                        o = (a + 24) | 0
                        r = b[o >> 0] | 0
                        if ((((r << 24) >> 24 > (e << 24) >> 24 ? e : r) << 24) >> 24 > 0) {
                            k = f[f[a >> 2] >> 2] | 0
                            m = (a + 40) | 0
                            q = on(f[m >> 2] | 0, f[(m + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            m = (a + 48) | 0
                            t = Tn(q | 0, I | 0, f[m >> 2] | 0, f[(m + 4) >> 2] | 0) | 0
                            m = (k + t) | 0
                            t = 0
                            while (1) {
                                k = ~~$(n[m >> 2]) >>> 0
                                f[(g + (t << 2)) >> 2] = k
                                t = (t + 1) | 0
                                k = b[o >> 0] | 0
                                if ((t | 0) >= (((((k << 24) >> 24 > (e << 24) >> 24 ? e : k) << 24) >> 24) | 0)) {
                                    B = k
                                    break
                                } else m = (m + 4) | 0
                            }
                        } else B = r
                        m = (B << 24) >> 24
                        if ((B << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (m << 2)) | 0, 0, ((((e << 24) >> 24) - m) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 10: {
                        m = (a + 24) | 0
                        t = b[m >> 0] | 0
                        if ((((t << 24) >> 24 > (e << 24) >> 24 ? e : t) << 24) >> 24 > 0) {
                            o = f[f[a >> 2] >> 2] | 0
                            l = (a + 40) | 0
                            k = on(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            l = (a + 48) | 0
                            q = Tn(k | 0, I | 0, f[l >> 2] | 0, f[(l + 4) >> 2] | 0) | 0
                            l = (o + q) | 0
                            q = 0
                            while (1) {
                                f[(g + (q << 2)) >> 2] = ~~+p[l >> 3] >>> 0
                                q = (q + 1) | 0
                                o = b[m >> 0] | 0
                                if ((q | 0) >= (((((o << 24) >> 24 > (e << 24) >> 24 ? e : o) << 24) >> 24) | 0)) {
                                    C = o
                                    break
                                } else l = (l + 8) | 0
                            }
                        } else C = t
                        l = (C << 24) >> 24
                        if ((C << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (l << 2)) | 0, 0, ((((e << 24) >> 24) - l) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 11: {
                        l = (a + 24) | 0
                        q = b[l >> 0] | 0
                        if ((((q << 24) >> 24 > (e << 24) >> 24 ? e : q) << 24) >> 24 > 0) {
                            m = f[f[a >> 2] >> 2] | 0
                            r = (a + 40) | 0
                            o = on(f[r >> 2] | 0, f[(r + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            r = (a + 48) | 0
                            k = Tn(o | 0, I | 0, f[r >> 2] | 0, f[(r + 4) >> 2] | 0) | 0
                            r = (m + k) | 0
                            k = 0
                            while (1) {
                                f[(g + (k << 2)) >> 2] = h[r >> 0]
                                k = (k + 1) | 0
                                m = b[l >> 0] | 0
                                if ((k | 0) >= (((((m << 24) >> 24 > (e << 24) >> 24 ? e : m) << 24) >> 24) | 0)) {
                                    D = m
                                    break
                                } else r = (r + 1) | 0
                            }
                        } else D = q
                        r = (D << 24) >> 24
                        if ((D << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (r << 2)) | 0, 0, ((((e << 24) >> 24) - r) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    default: {
                        i = 0
                        return i | 0
                    }
                }
            while (0)
            return 0
        }
        function Pb(a, c, e, g) {
            a = a | 0
            c = c | 0
            e = e | 0
            g = g | 0
            var i = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 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
            if (!g) {
                i = 0
                return i | 0
            }
            do
                switch (f[(a + 28) >> 2] | 0) {
                    case 1: {
                        k = (a + 24) | 0
                        l = b[k >> 0] | 0
                        if ((((l << 24) >> 24 > (e << 24) >> 24 ? e : l) << 24) >> 24 > 0) {
                            m = f[f[a >> 2] >> 2] | 0
                            o = (a + 40) | 0
                            q = on(f[o >> 2] | 0, f[(o + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            o = (a + 48) | 0
                            r = Tn(q | 0, I | 0, f[o >> 2] | 0, f[(o + 4) >> 2] | 0) | 0
                            o = (m + r) | 0
                            r = 0
                            while (1) {
                                f[(g + (r << 2)) >> 2] = b[o >> 0]
                                r = (r + 1) | 0
                                m = b[k >> 0] | 0
                                if ((r | 0) >= (((((m << 24) >> 24 > (e << 24) >> 24 ? e : m) << 24) >> 24) | 0)) {
                                    s = m
                                    break
                                } else o = (o + 1) | 0
                            }
                        } else s = l
                        o = (s << 24) >> 24
                        if ((s << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (o << 2)) | 0, 0, ((((e << 24) >> 24) - o) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 2: {
                        o = (a + 24) | 0
                        r = b[o >> 0] | 0
                        if ((((r << 24) >> 24 > (e << 24) >> 24 ? e : r) << 24) >> 24 > 0) {
                            k = f[f[a >> 2] >> 2] | 0
                            m = (a + 40) | 0
                            q = on(f[m >> 2] | 0, f[(m + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            m = (a + 48) | 0
                            t = Tn(q | 0, I | 0, f[m >> 2] | 0, f[(m + 4) >> 2] | 0) | 0
                            m = (k + t) | 0
                            t = 0
                            while (1) {
                                f[(g + (t << 2)) >> 2] = h[m >> 0]
                                t = (t + 1) | 0
                                k = b[o >> 0] | 0
                                if ((t | 0) >= (((((k << 24) >> 24 > (e << 24) >> 24 ? e : k) << 24) >> 24) | 0)) {
                                    u = k
                                    break
                                } else m = (m + 1) | 0
                            }
                        } else u = r
                        m = (u << 24) >> 24
                        if ((u << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (m << 2)) | 0, 0, ((((e << 24) >> 24) - m) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 3: {
                        m = (a + 24) | 0
                        t = b[m >> 0] | 0
                        if ((((t << 24) >> 24 > (e << 24) >> 24 ? e : t) << 24) >> 24 > 0) {
                            o = f[f[a >> 2] >> 2] | 0
                            l = (a + 40) | 0
                            k = on(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            l = (a + 48) | 0
                            q = Tn(k | 0, I | 0, f[l >> 2] | 0, f[(l + 4) >> 2] | 0) | 0
                            l = (o + q) | 0
                            q = 0
                            while (1) {
                                f[(g + (q << 2)) >> 2] = d[l >> 1]
                                q = (q + 1) | 0
                                o = b[m >> 0] | 0
                                if ((q | 0) >= (((((o << 24) >> 24 > (e << 24) >> 24 ? e : o) << 24) >> 24) | 0)) {
                                    v = o
                                    break
                                } else l = (l + 2) | 0
                            }
                        } else v = t
                        l = (v << 24) >> 24
                        if ((v << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (l << 2)) | 0, 0, ((((e << 24) >> 24) - l) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 4: {
                        l = (a + 24) | 0
                        q = b[l >> 0] | 0
                        if ((((q << 24) >> 24 > (e << 24) >> 24 ? e : q) << 24) >> 24 > 0) {
                            m = f[f[a >> 2] >> 2] | 0
                            r = (a + 40) | 0
                            o = on(f[r >> 2] | 0, f[(r + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            r = (a + 48) | 0
                            k = Tn(o | 0, I | 0, f[r >> 2] | 0, f[(r + 4) >> 2] | 0) | 0
                            r = (m + k) | 0
                            k = 0
                            while (1) {
                                f[(g + (k << 2)) >> 2] = j[r >> 1]
                                k = (k + 1) | 0
                                m = b[l >> 0] | 0
                                if ((k | 0) >= (((((m << 24) >> 24 > (e << 24) >> 24 ? e : m) << 24) >> 24) | 0)) {
                                    w = m
                                    break
                                } else r = (r + 2) | 0
                            }
                        } else w = q
                        r = (w << 24) >> 24
                        if ((w << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (r << 2)) | 0, 0, ((((e << 24) >> 24) - r) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 5: {
                        r = (a + 24) | 0
                        k = b[r >> 0] | 0
                        if ((((k << 24) >> 24 > (e << 24) >> 24 ? e : k) << 24) >> 24 > 0) {
                            l = f[f[a >> 2] >> 2] | 0
                            t = (a + 40) | 0
                            m = on(f[t >> 2] | 0, f[(t + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            t = (a + 48) | 0
                            o = Tn(m | 0, I | 0, f[t >> 2] | 0, f[(t + 4) >> 2] | 0) | 0
                            t = (l + o) | 0
                            o = 0
                            while (1) {
                                f[(g + (o << 2)) >> 2] = f[t >> 2]
                                o = (o + 1) | 0
                                l = b[r >> 0] | 0
                                if ((o | 0) >= (((((l << 24) >> 24 > (e << 24) >> 24 ? e : l) << 24) >> 24) | 0)) {
                                    x = l
                                    break
                                } else t = (t + 4) | 0
                            }
                        } else x = k
                        t = (x << 24) >> 24
                        if ((x << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (t << 2)) | 0, 0, ((((e << 24) >> 24) - t) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 6: {
                        t = (a + 24) | 0
                        o = b[t >> 0] | 0
                        if ((((o << 24) >> 24 > (e << 24) >> 24 ? e : o) << 24) >> 24 > 0) {
                            r = f[f[a >> 2] >> 2] | 0
                            q = (a + 40) | 0
                            l = on(f[q >> 2] | 0, f[(q + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            q = (a + 48) | 0
                            m = Tn(l | 0, I | 0, f[q >> 2] | 0, f[(q + 4) >> 2] | 0) | 0
                            q = (r + m) | 0
                            m = 0
                            while (1) {
                                f[(g + (m << 2)) >> 2] = f[q >> 2]
                                m = (m + 1) | 0
                                r = b[t >> 0] | 0
                                if ((m | 0) >= (((((r << 24) >> 24 > (e << 24) >> 24 ? e : r) << 24) >> 24) | 0)) {
                                    y = r
                                    break
                                } else q = (q + 4) | 0
                            }
                        } else y = o
                        q = (y << 24) >> 24
                        if ((y << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (q << 2)) | 0, 0, ((((e << 24) >> 24) - q) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 7: {
                        q = (a + 24) | 0
                        m = b[q >> 0] | 0
                        if ((((m << 24) >> 24 > (e << 24) >> 24 ? e : m) << 24) >> 24 > 0) {
                            t = f[f[a >> 2] >> 2] | 0
                            k = (a + 40) | 0
                            r = on(f[k >> 2] | 0, f[(k + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            k = (a + 48) | 0
                            l = Tn(r | 0, I | 0, f[k >> 2] | 0, f[(k + 4) >> 2] | 0) | 0
                            k = (t + l) | 0
                            l = 0
                            while (1) {
                                f[(g + (l << 2)) >> 2] = f[k >> 2]
                                l = (l + 1) | 0
                                t = b[q >> 0] | 0
                                if ((l | 0) >= (((((t << 24) >> 24 > (e << 24) >> 24 ? e : t) << 24) >> 24) | 0)) {
                                    z = t
                                    break
                                } else k = (k + 8) | 0
                            }
                        } else z = m
                        k = (z << 24) >> 24
                        if ((z << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (k << 2)) | 0, 0, ((((e << 24) >> 24) - k) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 8: {
                        k = (a + 24) | 0
                        l = b[k >> 0] | 0
                        if ((((l << 24) >> 24 > (e << 24) >> 24 ? e : l) << 24) >> 24 > 0) {
                            q = f[f[a >> 2] >> 2] | 0
                            o = (a + 40) | 0
                            t = on(f[o >> 2] | 0, f[(o + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            o = (a + 48) | 0
                            r = Tn(t | 0, I | 0, f[o >> 2] | 0, f[(o + 4) >> 2] | 0) | 0
                            o = (q + r) | 0
                            r = 0
                            while (1) {
                                f[(g + (r << 2)) >> 2] = f[o >> 2]
                                r = (r + 1) | 0
                                q = b[k >> 0] | 0
                                if ((r | 0) >= (((((q << 24) >> 24 > (e << 24) >> 24 ? e : q) << 24) >> 24) | 0)) {
                                    A = q
                                    break
                                } else o = (o + 8) | 0
                            }
                        } else A = l
                        o = (A << 24) >> 24
                        if ((A << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (o << 2)) | 0, 0, ((((e << 24) >> 24) - o) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 9: {
                        o = (a + 24) | 0
                        r = b[o >> 0] | 0
                        if ((((r << 24) >> 24 > (e << 24) >> 24 ? e : r) << 24) >> 24 > 0) {
                            k = f[f[a >> 2] >> 2] | 0
                            m = (a + 40) | 0
                            q = on(f[m >> 2] | 0, f[(m + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            m = (a + 48) | 0
                            t = Tn(q | 0, I | 0, f[m >> 2] | 0, f[(m + 4) >> 2] | 0) | 0
                            m = (k + t) | 0
                            t = 0
                            while (1) {
                                k = ~~$(n[m >> 2])
                                f[(g + (t << 2)) >> 2] = k
                                t = (t + 1) | 0
                                k = b[o >> 0] | 0
                                if ((t | 0) >= (((((k << 24) >> 24 > (e << 24) >> 24 ? e : k) << 24) >> 24) | 0)) {
                                    B = k
                                    break
                                } else m = (m + 4) | 0
                            }
                        } else B = r
                        m = (B << 24) >> 24
                        if ((B << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (m << 2)) | 0, 0, ((((e << 24) >> 24) - m) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 10: {
                        m = (a + 24) | 0
                        t = b[m >> 0] | 0
                        if ((((t << 24) >> 24 > (e << 24) >> 24 ? e : t) << 24) >> 24 > 0) {
                            o = f[f[a >> 2] >> 2] | 0
                            l = (a + 40) | 0
                            k = on(f[l >> 2] | 0, f[(l + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            l = (a + 48) | 0
                            q = Tn(k | 0, I | 0, f[l >> 2] | 0, f[(l + 4) >> 2] | 0) | 0
                            l = (o + q) | 0
                            q = 0
                            while (1) {
                                f[(g + (q << 2)) >> 2] = ~~+p[l >> 3]
                                q = (q + 1) | 0
                                o = b[m >> 0] | 0
                                if ((q | 0) >= (((((o << 24) >> 24 > (e << 24) >> 24 ? e : o) << 24) >> 24) | 0)) {
                                    C = o
                                    break
                                } else l = (l + 8) | 0
                            }
                        } else C = t
                        l = (C << 24) >> 24
                        if ((C << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (l << 2)) | 0, 0, ((((e << 24) >> 24) - l) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    case 11: {
                        l = (a + 24) | 0
                        q = b[l >> 0] | 0
                        if ((((q << 24) >> 24 > (e << 24) >> 24 ? e : q) << 24) >> 24 > 0) {
                            m = f[f[a >> 2] >> 2] | 0
                            r = (a + 40) | 0
                            o = on(f[r >> 2] | 0, f[(r + 4) >> 2] | 0, f[c >> 2] | 0, 0) | 0
                            r = (a + 48) | 0
                            k = Tn(o | 0, I | 0, f[r >> 2] | 0, f[(r + 4) >> 2] | 0) | 0
                            r = (m + k) | 0
                            k = 0
                            while (1) {
                                f[(g + (k << 2)) >> 2] = h[r >> 0]
                                k = (k + 1) | 0
                                m = b[l >> 0] | 0
                                if ((k | 0) >= (((((m << 24) >> 24 > (e << 24) >> 24 ? e : m) << 24) >> 24) | 0)) {
                                    D = m
                                    break
                                } else r = (r + 1) | 0
                            }
                        } else D = q
                        r = (D << 24) >> 24
                        if ((D << 24) >> 24 >= (e << 24) >> 24) {
                            i = 1
                            return i | 0
                        }
                        hj((g + (r << 2)) | 0, 0, ((((e << 24) >> 24) - r) << 2) | 0) | 0
                        i = 1
                        return i | 0
                    }
                    default: {
                        i = 0
                        return i | 0
                    }
                }
            while (0)
            return 0
        }
        function Qb(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                I = Oa,
                J = 0,
                K = 0,
                L = 0,
                M = 0,
                N = Oa
            e = u
            u = (u + 48) | 0
            g = (e + 36) | 0
            h = (e + 24) | 0
            i = (e + 12) | 0
            j = e
            if (!(ih(a, c, d) | 0)) {
                k = 0
                u = e
                return k | 0
            }
            l = f[((f[((f[(c + 4) >> 2] | 0) + 8) >> 2] | 0) + (d << 2)) >> 2] | 0
            if ((f[(l + 28) >> 2] | 0) != 9) {
                k = 0
                u = e
                return k | 0
            }
            m = (c + 48) | 0
            c = f[m >> 2] | 0
            o = dn(32) | 0
            f[g >> 2] = o
            f[(g + 8) >> 2] = -2147483616
            f[(g + 4) >> 2] = 17
            p = o
            q = 12932
            r = (p + 17) | 0
            do {
                b[p >> 0] = b[q >> 0] | 0
                p = (p + 1) | 0
                q = (q + 1) | 0
            } while ((p | 0) < (r | 0))
            b[(o + 17) >> 0] = 0
            o = (c + 16) | 0
            s = f[o >> 2] | 0
            if (s) {
                t = o
                v = s
                a: while (1) {
                    s = v
                    while (1) {
                        if ((f[(s + 16) >> 2] | 0) >= (d | 0)) break
                        w = f[(s + 4) >> 2] | 0
                        if (!w) {
                            x = t
                            break a
                        } else s = w
                    }
                    v = f[s >> 2] | 0
                    if (!v) {
                        x = s
                        break
                    } else t = s
                }
                if (((x | 0) != (o | 0) ? (f[(x + 16) >> 2] | 0) <= (d | 0) : 0) ? ((o = (x + 20) | 0), (sh(o, g) | 0) != 0) : 0) y = yk(o, g, -1) | 0
                else z = 12
            } else z = 12
            if ((z | 0) == 12) y = yk(c, g, -1) | 0
            if ((b[(g + 11) >> 0] | 0) < 0) br(f[g >> 2] | 0)
            if ((y | 0) < 1) {
                k = 0
                u = e
                return k | 0
            }
            c = f[m >> 2] | 0
            o = dn(32) | 0
            f[g >> 2] = o
            f[(g + 8) >> 2] = -2147483616
            f[(g + 4) >> 2] = 19
            p = o
            q = 13005
            r = (p + 19) | 0
            do {
                b[p >> 0] = b[q >> 0] | 0
                p = (p + 1) | 0
                q = (q + 1) | 0
            } while ((p | 0) < (r | 0))
            b[(o + 19) >> 0] = 0
            o = (c + 16) | 0
            x = f[o >> 2] | 0
            if (x) {
                t = o
                v = x
                b: while (1) {
                    x = v
                    while (1) {
                        if ((f[(x + 16) >> 2] | 0) >= (d | 0)) break
                        w = f[(x + 4) >> 2] | 0
                        if (!w) {
                            A = t
                            break b
                        } else x = w
                    }
                    v = f[x >> 2] | 0
                    if (!v) {
                        A = x
                        break
                    } else t = x
                }
                if ((A | 0) != (o | 0) ? (f[(A + 16) >> 2] | 0) <= (d | 0) : 0) B = (A + 20) | 0
                else z = 24
            } else z = 24
            if ((z | 0) == 24) B = c
            if (!(sh(B, g) | 0)) C = 0
            else {
                B = f[m >> 2] | 0
                f[h >> 2] = 0
                f[(h + 4) >> 2] = 0
                f[(h + 8) >> 2] = 0
                c = dn(32) | 0
                f[h >> 2] = c
                f[(h + 8) >> 2] = -2147483616
                f[(h + 4) >> 2] = 18
                p = c
                q = 13025
                r = (p + 18) | 0
                do {
                    b[p >> 0] = b[q >> 0] | 0
                    p = (p + 1) | 0
                    q = (q + 1) | 0
                } while ((p | 0) < (r | 0))
                b[(c + 18) >> 0] = 0
                c = (B + 16) | 0
                A = f[c >> 2] | 0
                if (A) {
                    o = c
                    t = A
                    c: while (1) {
                        A = t
                        while (1) {
                            if ((f[(A + 16) >> 2] | 0) >= (d | 0)) break
                            v = f[(A + 4) >> 2] | 0
                            if (!v) {
                                D = o
                                break c
                            } else A = v
                        }
                        t = f[A >> 2] | 0
                        if (!t) {
                            D = A
                            break
                        } else o = A
                    }
                    if ((D | 0) != (c | 0) ? (f[(D + 16) >> 2] | 0) <= (d | 0) : 0) E = (D + 20) | 0
                    else z = 34
                } else z = 34
                if ((z | 0) == 34) E = B
                B = (sh(E, h) | 0) != 0
                if ((b[(h + 11) >> 0] | 0) < 0) br(f[h >> 2] | 0)
                C = B
            }
            if ((b[(g + 11) >> 0] | 0) < 0) br(f[g >> 2] | 0)
            if (!C) {
                Kd((a + 40) | 0, l, y) | 0
                k = 1
                u = e
                return k | 0
            }
            C = (l + 24) | 0
            l = b[C >> 0] | 0
            B = (l << 24) >> 24
            f[i >> 2] = 0
            E = (i + 4) | 0
            f[E >> 2] = 0
            f[(i + 8) >> 2] = 0
            do
                if ((l << 24) >> 24)
                    if ((l << 24) >> 24 < 0) mq(i)
                    else {
                        D = B << 2
                        c = dn(D) | 0
                        f[i >> 2] = c
                        o = (c + (B << 2)) | 0
                        f[(i + 8) >> 2] = o
                        hj(c | 0, 0, D | 0) | 0
                        f[E >> 2] = o
                        F = c
                        break
                    }
                else F = 0
            while (0)
            B = f[m >> 2] | 0
            f[j >> 2] = 0
            f[(j + 4) >> 2] = 0
            f[(j + 8) >> 2] = 0
            l = dn(32) | 0
            f[j >> 2] = l
            f[(j + 8) >> 2] = -2147483616
            f[(j + 4) >> 2] = 19
            p = l
            q = 13005
            r = (p + 19) | 0
            do {
                b[p >> 0] = b[q >> 0] | 0
                p = (p + 1) | 0
                q = (q + 1) | 0
            } while ((p | 0) < (r | 0))
            b[(l + 19) >> 0] = 0
            l = b[C >> 0] | 0
            c = (l << 24) >> 24
            o = (B + 16) | 0
            D = f[o >> 2] | 0
            if (D) {
                t = o
                x = D
                d: while (1) {
                    D = x
                    while (1) {
                        if ((f[(D + 16) >> 2] | 0) >= (d | 0)) break
                        v = f[(D + 4) >> 2] | 0
                        if (!v) {
                            G = t
                            break d
                        } else D = v
                    }
                    x = f[D >> 2] | 0
                    if (!x) {
                        G = D
                        break
                    } else t = D
                }
                if (((G | 0) != (o | 0) ? (f[(G + 16) >> 2] | 0) <= (d | 0) : 0) ? ((o = (G + 20) | 0), (sh(o, j) | 0) != 0) : 0) {
                    t = zg(o, j) | 0
                    if ((t | 0) != ((G + 24) | 0)) {
                        dj(g, (t + 28) | 0)
                        t = (g + 11) | 0
                        G = b[t >> 0] | 0
                        o = (G << 24) >> 24 < 0
                        if (!((o ? f[(g + 4) >> 2] | 0 : G & 255) | 0)) H = G
                        else {
                            if ((l << 24) >> 24 > 0) {
                                x = o ? f[g >> 2] | 0 : g
                                o = 0
                                do {
                                    I = $(pq(x, h))
                                    A = x
                                    x = f[h >> 2] | 0
                                    if ((A | 0) == (x | 0)) break
                                    n[(F + (o << 2)) >> 2] = I
                                    o = (o + 1) | 0
                                } while ((o | 0) < (c | 0))
                                J = b[t >> 0] | 0
                            } else J = G
                            H = J
                        }
                        if ((H << 24) >> 24 < 0) br(f[g >> 2] | 0)
                    }
                } else z = 64
            } else z = 64
            if ((z | 0) == 64 ? ((H = zg(B, j) | 0), (H | 0) != ((B + 4) | 0)) : 0) {
                dj(g, (H + 28) | 0)
                H = (g + 11) | 0
                B = b[H >> 0] | 0
                J = (B << 24) >> 24 < 0
                if (!((J ? f[(g + 4) >> 2] | 0 : B & 255) | 0)) K = B
                else {
                    if ((l << 24) >> 24 > 0) {
                        l = J ? f[g >> 2] | 0 : g
                        J = 0
                        do {
                            I = $(pq(l, h))
                            G = l
                            l = f[h >> 2] | 0
                            if ((G | 0) == (l | 0)) break
                            n[(F + (J << 2)) >> 2] = I
                            J = (J + 1) | 0
                        } while ((J | 0) < (c | 0))
                        L = b[H >> 0] | 0
                    } else L = B
                    K = L
                }
                if ((K << 24) >> 24 < 0) br(f[g >> 2] | 0)
            }
            if ((b[(j + 11) >> 0] | 0) < 0) br(f[j >> 2] | 0)
            j = f[m >> 2] | 0
            f[g >> 2] = 0
            f[(g + 4) >> 2] = 0
            f[(g + 8) >> 2] = 0
            m = dn(32) | 0
            f[g >> 2] = m
            f[(g + 8) >> 2] = -2147483616
            f[(g + 4) >> 2] = 18
            p = m
            q = 13025
            r = (p + 18) | 0
            do {
                b[p >> 0] = b[q >> 0] | 0
                p = (p + 1) | 0
                q = (q + 1) | 0
            } while ((p | 0) < (r | 0))
            b[(m + 18) >> 0] = 0
            m = (j + 16) | 0
            q = f[m >> 2] | 0
            if (q) {
                p = m
                r = q
                e: while (1) {
                    q = r
                    while (1) {
                        if ((f[(q + 16) >> 2] | 0) >= (d | 0)) break
                        K = f[(q + 4) >> 2] | 0
                        if (!K) {
                            M = p
                            break e
                        } else q = K
                    }
                    r = f[q >> 2] | 0
                    if (!r) {
                        M = q
                        break
                    } else p = q
                }
                if (((M | 0) != (m | 0) ? (f[(M + 16) >> 2] | 0) <= (d | 0) : 0) ? ((d = (M + 20) | 0), (sh(d, g) | 0) != 0) : 0) N = $(kk(d, g, $(1.0)))
                else z = 86
            } else z = 86
            if ((z | 0) == 86) N = $(kk(j, g, $(1.0)))
            if ((b[(g + 11) >> 0] | 0) < 0) br(f[g >> 2] | 0)
            wl((a + 40) | 0, y, f[i >> 2] | 0, b[C >> 0] | 0, N)
            C = f[i >> 2] | 0
            if (C | 0) {
                i = f[E >> 2] | 0
                if ((i | 0) != (C | 0)) f[E >> 2] = i + (~(((i + -4 - C) | 0) >>> 2) << 2)
                br(C)
            }
            k = 1
            u = e
            return k | 0
        }
        function Rb(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 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,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0
            e = u
            u = (u + 64) | 0
            d = (e + 48) | 0
            h = (e + 36) | 0
            i = (e + 24) | 0
            j = (e + 16) | 0
            k = (e + 8) | 0
            l = e
            m = (e + 32) | 0
            n = (a + 60) | 0
            f[(a + 68) >> 2] = g
            g = (a + 108) | 0
            lk(g)
            o = (a + 56) | 0
            p = f[o >> 2] | 0
            q = ((f[(p + 4) >> 2] | 0) - (f[p >> 2] | 0)) | 0
            r = q >> 2
            f[h >> 2] = 0
            f[(h + 4) >> 2] = 0
            f[(h + 8) >> 2] = 0
            s = i
            f[s >> 2] = 0
            f[(s + 4) >> 2] = 0
            s = j
            f[s >> 2] = 0
            f[(s + 4) >> 2] = 0
            s = k
            f[s >> 2] = 0
            f[(s + 4) >> 2] = 0
            s = l
            f[s >> 2] = 0
            f[(s + 4) >> 2] = 0
            if ((q | 0) <= 0) {
                u = e
                return 1
            }
            q = (h + 4) | 0
            s = (h + 8) | 0
            t = (a + 104) | 0
            v = (i + 4) | 0
            w = (a + 100) | 0
            x = (j + 4) | 0
            y = (a + 8) | 0
            z = (a + 16) | 0
            A = (a + 32) | 0
            B = (a + 12) | 0
            C = (a + 28) | 0
            D = (a + 20) | 0
            E = (a + 24) | 0
            F = (a + 96) | 0
            a = (k + 4) | 0
            G = (l + 4) | 0
            H = f[p >> 2] | 0
            if ((f[(p + 4) >> 2] | 0) == (H | 0)) {
                J = p
                mq(J)
            } else {
                K = 0
                L = H
            }
            while (1) {
                f[m >> 2] = f[(L + (K << 2)) >> 2]
                f[d >> 2] = f[m >> 2]
                fc(n, d, h)
                H = f[h >> 2] | 0
                p = (H | 0) > -1 ? H : (0 - H) | 0
                M = f[q >> 2] | 0
                N = (M | 0) > -1 ? M : (0 - M) | 0
                O = Tn(N | 0, ((((N | 0) < 0) << 31) >> 31) | 0, p | 0, ((((p | 0) < 0) << 31) >> 31) | 0) | 0
                p = f[s >> 2] | 0
                N = (p | 0) > -1
                P = N ? p : (0 - p) | 0
                p = Tn(O | 0, I | 0, P | 0, ((((P | 0) < 0) << 31) >> 31) | 0) | 0
                P = I
                if (((p | 0) == 0) & ((P | 0) == 0)) {
                    O = f[t >> 2] | 0
                    Q = O
                    R = h
                    S = M
                    T = O
                } else {
                    O = f[t >> 2] | 0
                    U = (((O | 0) < 0) << 31) >> 31
                    V = on(O | 0, U | 0, H | 0, ((((H | 0) < 0) << 31) >> 31) | 0) | 0
                    H = zk(V | 0, I | 0, p | 0, P | 0) | 0
                    f[h >> 2] = H
                    V = on(O | 0, U | 0, M | 0, ((((M | 0) < 0) << 31) >> 31) | 0) | 0
                    M = zk(V | 0, I | 0, p | 0, P | 0) | 0
                    f[q >> 2] = M
                    P = (O - ((H | 0) > -1 ? H : (0 - H) | 0) - ((M | 0) > -1 ? M : (0 - M) | 0)) | 0
                    Q = N ? P : (0 - P) | 0
                    R = s
                    S = M
                    T = O
                }
                f[R >> 2] = Q
                O = f[h >> 2] | 0
                do
                    if ((O | 0) <= -1) {
                        if ((S | 0) < 0) {
                            M = f[s >> 2] | 0
                            W = (M | 0) > -1 ? M : (0 - M) | 0
                            X = M
                        } else {
                            M = f[s >> 2] | 0
                            W = ((f[w >> 2] | 0) - ((M | 0) > -1 ? M : (0 - M) | 0)) | 0
                            X = M
                        }
                        if ((X | 0) < 0) {
                            Y = (S | 0) > -1 ? S : (0 - S) | 0
                            Z = W
                            _ = X
                            break
                        } else {
                            Y = ((f[w >> 2] | 0) - ((S | 0) > -1 ? S : (0 - S) | 0)) | 0
                            Z = W
                            _ = X
                            break
                        }
                    } else {
                        M = f[s >> 2] | 0
                        Y = (M + T) | 0
                        Z = (T + S) | 0
                        _ = M
                    }
                while (0)
                M = (Z | 0) == 0
                P = (Y | 0) == 0
                N = f[w >> 2] | 0
                do
                    if (Y | Z) {
                        H = (N | 0) == (Y | 0)
                        if (!(M & H)) {
                            p = (N | 0) == (Z | 0)
                            if (!(P & p)) {
                                if (M & ((T | 0) < (Y | 0))) {
                                    $ = 0
                                    aa = ((T << 1) - Y) | 0
                                    break
                                }
                                if (p & ((T | 0) > (Y | 0))) {
                                    $ = Z
                                    aa = ((T << 1) - Y) | 0
                                    break
                                }
                                if (H & ((T | 0) > (Z | 0))) {
                                    $ = ((T << 1) - Z) | 0
                                    aa = Y
                                    break
                                }
                                if (P) {
                                    $ = (T | 0) < (Z | 0) ? ((T << 1) - Z) | 0 : Z
                                    aa = 0
                                } else {
                                    $ = Z
                                    aa = Y
                                }
                            } else {
                                $ = Z
                                aa = Z
                            }
                        } else {
                            $ = Y
                            aa = Y
                        }
                    } else {
                        $ = N
                        aa = N
                    }
                while (0)
                f[i >> 2] = $
                f[v >> 2] = aa
                P = (0 - S) | 0
                M = (0 - _) | 0
                f[h >> 2] = 0 - O
                f[q >> 2] = P
                f[s >> 2] = M
                if ((O | 0) < 1) {
                    ba = (T - _) | 0
                    ca = (T - S) | 0
                } else {
                    H = (_ | 0) < 1 ? M : _
                    M = (S | 0) < 1 ? P : S
                    ba = (_ | 0) > 0 ? M : (N - M) | 0
                    ca = (S | 0) > 0 ? H : (N - H) | 0
                }
                H = (ca | 0) == 0
                M = (ba | 0) == 0
                do
                    if (((ba | ca | 0) != 0 ? ((P = (N | 0) == (ba | 0)), !(H & P)) : 0) ? ((p = (N | 0) == (ca | 0)), !(M & p)) : 0) {
                        if (H & ((T | 0) < (ba | 0))) {
                            da = 0
                            ea = ((T << 1) - ba) | 0
                            break
                        }
                        if (p & ((T | 0) > (ba | 0))) {
                            da = N
                            ea = ((T << 1) - ba) | 0
                            break
                        }
                        if (P & ((T | 0) > (ca | 0))) {
                            da = ((T << 1) - ca) | 0
                            ea = N
                            break
                        }
                        if (M) {
                            da = (T | 0) < (ca | 0) ? ((T << 1) - ca) | 0 : ca
                            ea = 0
                        } else {
                            da = ca
                            ea = ba
                        }
                    } else {
                        da = N
                        ea = N
                    }
                while (0)
                f[j >> 2] = da
                f[x >> 2] = ea
                N = K << 1
                M = (b + (N << 2)) | 0
                H = f[y >> 2] | 0
                if ((H | 0) > 0) {
                    O = 0
                    P = i
                    p = H
                    while (1) {
                        if ((p | 0) > 0) {
                            H = 0
                            do {
                                V = f[(P + (H << 2)) >> 2] | 0
                                U = f[z >> 2] | 0
                                if ((V | 0) > (U | 0)) {
                                    fa = f[A >> 2] | 0
                                    f[(fa + (H << 2)) >> 2] = U
                                    ga = fa
                                } else {
                                    fa = f[B >> 2] | 0
                                    U = f[A >> 2] | 0
                                    f[(U + (H << 2)) >> 2] = (V | 0) < (fa | 0) ? fa : V
                                    ga = U
                                }
                                H = (H + 1) | 0
                                U = f[y >> 2] | 0
                            } while ((H | 0) < (U | 0))
                            ha = ga
                            ia = U
                        } else {
                            ha = f[A >> 2] | 0
                            ia = p
                        }
                        H = ((f[(M + (O << 2)) >> 2] | 0) - (f[(ha + (O << 2)) >> 2] | 0)) | 0
                        U = (k + (O << 2)) | 0
                        f[U >> 2] = H
                        ja = f[C >> 2] | 0
                        if ((H | 0) >= (ja | 0)) {
                            if ((H | 0) > (f[E >> 2] | 0)) {
                                ka = (H - (f[D >> 2] | 0)) | 0
                                la = 52
                            }
                        } else {
                            ka = ((f[D >> 2] | 0) + H) | 0
                            la = 52
                        }
                        if ((la | 0) == 52) {
                            la = 0
                            f[U >> 2] = ka
                        }
                        O = (O + 1) | 0
                        if ((O | 0) >= (ia | 0)) break
                        else {
                            P = ha
                            p = ia
                        }
                    }
                    if ((ia | 0) > 0) {
                        p = 0
                        P = j
                        O = ia
                        U = ja
                        while (1) {
                            if ((O | 0) > 0) {
                                H = 0
                                do {
                                    V = f[(P + (H << 2)) >> 2] | 0
                                    fa = f[z >> 2] | 0
                                    if ((V | 0) > (fa | 0)) f[(ha + (H << 2)) >> 2] = fa
                                    else {
                                        fa = f[B >> 2] | 0
                                        f[(ha + (H << 2)) >> 2] = (V | 0) < (fa | 0) ? fa : V
                                    }
                                    H = (H + 1) | 0
                                    ma = f[y >> 2] | 0
                                } while ((H | 0) < (ma | 0))
                                na = f[C >> 2] | 0
                                oa = ma
                            } else {
                                na = U
                                oa = O
                            }
                            H = ((f[(M + (p << 2)) >> 2] | 0) - (f[(ha + (p << 2)) >> 2] | 0)) | 0
                            V = (l + (p << 2)) | 0
                            f[V >> 2] = H
                            if ((H | 0) >= (na | 0)) {
                                if ((H | 0) > (f[E >> 2] | 0)) {
                                    pa = (H - (f[D >> 2] | 0)) | 0
                                    la = 65
                                }
                            } else {
                                pa = ((f[D >> 2] | 0) + H) | 0
                                la = 65
                            }
                            if ((la | 0) == 65) {
                                la = 0
                                f[V >> 2] = pa
                            }
                            p = (p + 1) | 0
                            if ((p | 0) >= (oa | 0)) break
                            else {
                                P = ha
                                O = oa
                                U = na
                            }
                        }
                    }
                }
                U = f[k >> 2] | 0
                O = f[t >> 2] | 0
                if ((O | 0) >= (U | 0))
                    if ((U | 0) < ((0 - O) | 0)) qa = ((f[F >> 2] | 0) + U) | 0
                    else qa = U
                else qa = (U - (f[F >> 2] | 0)) | 0
                f[k >> 2] = qa
                U = f[a >> 2] | 0
                if ((O | 0) >= (U | 0))
                    if ((U | 0) < ((0 - O) | 0)) ra = ((f[F >> 2] | 0) + U) | 0
                    else ra = U
                else ra = (U - (f[F >> 2] | 0)) | 0
                f[a >> 2] = ra
                U = f[l >> 2] | 0
                if ((O | 0) >= (U | 0))
                    if ((U | 0) < ((0 - O) | 0)) sa = ((f[F >> 2] | 0) + U) | 0
                    else sa = U
                else sa = (U - (f[F >> 2] | 0)) | 0
                f[l >> 2] = sa
                U = f[G >> 2] | 0
                if ((O | 0) >= (U | 0))
                    if ((U | 0) < ((0 - O) | 0)) ta = ((f[F >> 2] | 0) + U) | 0
                    else ta = U
                else ta = (U - (f[F >> 2] | 0)) | 0
                f[G >> 2] = ta
                if (((((ra | 0) > -1 ? ra : (0 - ra) | 0) + ((qa | 0) > -1 ? qa : (0 - qa) | 0)) | 0) < ((((sa | 0) > -1 ? sa : (0 - sa) | 0) + ((ta | 0) > -1 ? ta : (0 - ta) | 0)) | 0)) {
                    Vi(g, 0)
                    ua = k
                } else {
                    Vi(g, 1)
                    ua = l
                }
                U = f[ua >> 2] | 0
                if ((U | 0) < 0) va = ((f[F >> 2] | 0) + U) | 0
                else va = U
                U = (c + (N << 2)) | 0
                f[U >> 2] = va
                O = f[(ua + 4) >> 2] | 0
                if ((O | 0) < 0) wa = ((f[F >> 2] | 0) + O) | 0
                else wa = O
                f[(U + 4) >> 2] = wa
                K = (K + 1) | 0
                if ((K | 0) >= (r | 0)) {
                    la = 3
                    break
                }
                U = f[o >> 2] | 0
                L = f[U >> 2] | 0
                if ((((f[(U + 4) >> 2] | 0) - L) >> 2) >>> 0 <= K >>> 0) {
                    J = U
                    la = 4
                    break
                }
            }
            if ((la | 0) == 3) {
                u = e
                return 1
            } else if ((la | 0) == 4) mq(J)
            return 0
        }
        function Sb(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 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,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0
            e = u
            u = (u + 64) | 0
            d = (e + 48) | 0
            h = (e + 36) | 0
            i = (e + 24) | 0
            j = (e + 16) | 0
            k = (e + 8) | 0
            l = e
            m = (e + 32) | 0
            n = (a + 60) | 0
            f[(a + 68) >> 2] = g
            g = (a + 108) | 0
            lk(g)
            o = (a + 56) | 0
            p = f[o >> 2] | 0
            q = ((f[(p + 4) >> 2] | 0) - (f[p >> 2] | 0)) | 0
            r = q >> 2
            f[h >> 2] = 0
            f[(h + 4) >> 2] = 0
            f[(h + 8) >> 2] = 0
            s = i
            f[s >> 2] = 0
            f[(s + 4) >> 2] = 0
            s = j
            f[s >> 2] = 0
            f[(s + 4) >> 2] = 0
            s = k
            f[s >> 2] = 0
            f[(s + 4) >> 2] = 0
            s = l
            f[s >> 2] = 0
            f[(s + 4) >> 2] = 0
            if ((q | 0) <= 0) {
                u = e
                return 1
            }
            q = (h + 4) | 0
            s = (h + 8) | 0
            t = (a + 104) | 0
            v = (i + 4) | 0
            w = (a + 100) | 0
            x = (j + 4) | 0
            y = (a + 8) | 0
            z = (a + 16) | 0
            A = (a + 32) | 0
            B = (a + 12) | 0
            C = (a + 28) | 0
            D = (a + 20) | 0
            E = (a + 24) | 0
            F = (a + 96) | 0
            a = (k + 4) | 0
            G = (l + 4) | 0
            H = f[p >> 2] | 0
            if ((f[(p + 4) >> 2] | 0) == (H | 0)) {
                J = p
                mq(J)
            } else {
                K = 0
                L = H
            }
            while (1) {
                f[m >> 2] = f[(L + (K << 2)) >> 2]
                f[d >> 2] = f[m >> 2]
                $b(n, d, h)
                H = f[h >> 2] | 0
                p = (H | 0) > -1 ? H : (0 - H) | 0
                M = f[q >> 2] | 0
                N = (M | 0) > -1 ? M : (0 - M) | 0
                O = Tn(N | 0, ((((N | 0) < 0) << 31) >> 31) | 0, p | 0, ((((p | 0) < 0) << 31) >> 31) | 0) | 0
                p = f[s >> 2] | 0
                N = (p | 0) > -1
                P = N ? p : (0 - p) | 0
                p = Tn(O | 0, I | 0, P | 0, ((((P | 0) < 0) << 31) >> 31) | 0) | 0
                P = I
                if (((p | 0) == 0) & ((P | 0) == 0)) {
                    O = f[t >> 2] | 0
                    Q = O
                    R = h
                    S = M
                    T = O
                } else {
                    O = f[t >> 2] | 0
                    U = (((O | 0) < 0) << 31) >> 31
                    V = on(O | 0, U | 0, H | 0, ((((H | 0) < 0) << 31) >> 31) | 0) | 0
                    H = zk(V | 0, I | 0, p | 0, P | 0) | 0
                    f[h >> 2] = H
                    V = on(O | 0, U | 0, M | 0, ((((M | 0) < 0) << 31) >> 31) | 0) | 0
                    M = zk(V | 0, I | 0, p | 0, P | 0) | 0
                    f[q >> 2] = M
                    P = (O - ((H | 0) > -1 ? H : (0 - H) | 0) - ((M | 0) > -1 ? M : (0 - M) | 0)) | 0
                    Q = N ? P : (0 - P) | 0
                    R = s
                    S = M
                    T = O
                }
                f[R >> 2] = Q
                O = f[h >> 2] | 0
                do
                    if ((O | 0) <= -1) {
                        if ((S | 0) < 0) {
                            M = f[s >> 2] | 0
                            W = (M | 0) > -1 ? M : (0 - M) | 0
                            X = M
                        } else {
                            M = f[s >> 2] | 0
                            W = ((f[w >> 2] | 0) - ((M | 0) > -1 ? M : (0 - M) | 0)) | 0
                            X = M
                        }
                        if ((X | 0) < 0) {
                            Y = (S | 0) > -1 ? S : (0 - S) | 0
                            Z = W
                            _ = X
                            break
                        } else {
                            Y = ((f[w >> 2] | 0) - ((S | 0) > -1 ? S : (0 - S) | 0)) | 0
                            Z = W
                            _ = X
                            break
                        }
                    } else {
                        M = f[s >> 2] | 0
                        Y = (M + T) | 0
                        Z = (T + S) | 0
                        _ = M
                    }
                while (0)
                M = (Z | 0) == 0
                P = (Y | 0) == 0
                N = f[w >> 2] | 0
                do
                    if (Y | Z) {
                        H = (N | 0) == (Y | 0)
                        if (!(M & H)) {
                            p = (N | 0) == (Z | 0)
                            if (!(P & p)) {
                                if (M & ((T | 0) < (Y | 0))) {
                                    $ = 0
                                    aa = ((T << 1) - Y) | 0
                                    break
                                }
                                if (p & ((T | 0) > (Y | 0))) {
                                    $ = Z
                                    aa = ((T << 1) - Y) | 0
                                    break
                                }
                                if (H & ((T | 0) > (Z | 0))) {
                                    $ = ((T << 1) - Z) | 0
                                    aa = Y
                                    break
                                }
                                if (P) {
                                    $ = (T | 0) < (Z | 0) ? ((T << 1) - Z) | 0 : Z
                                    aa = 0
                                } else {
                                    $ = Z
                                    aa = Y
                                }
                            } else {
                                $ = Z
                                aa = Z
                            }
                        } else {
                            $ = Y
                            aa = Y
                        }
                    } else {
                        $ = N
                        aa = N
                    }
                while (0)
                f[i >> 2] = $
                f[v >> 2] = aa
                P = (0 - S) | 0
                M = (0 - _) | 0
                f[h >> 2] = 0 - O
                f[q >> 2] = P
                f[s >> 2] = M
                if ((O | 0) < 1) {
                    ba = (T - _) | 0
                    ca = (T - S) | 0
                } else {
                    H = (_ | 0) < 1 ? M : _
                    M = (S | 0) < 1 ? P : S
                    ba = (_ | 0) > 0 ? M : (N - M) | 0
                    ca = (S | 0) > 0 ? H : (N - H) | 0
                }
                H = (ca | 0) == 0
                M = (ba | 0) == 0
                do
                    if (((ba | ca | 0) != 0 ? ((P = (N | 0) == (ba | 0)), !(H & P)) : 0) ? ((p = (N | 0) == (ca | 0)), !(M & p)) : 0) {
                        if (H & ((T | 0) < (ba | 0))) {
                            da = 0
                            ea = ((T << 1) - ba) | 0
                            break
                        }
                        if (p & ((T | 0) > (ba | 0))) {
                            da = N
                            ea = ((T << 1) - ba) | 0
                            break
                        }
                        if (P & ((T | 0) > (ca | 0))) {
                            da = ((T << 1) - ca) | 0
                            ea = N
                            break
                        }
                        if (M) {
                            da = (T | 0) < (ca | 0) ? ((T << 1) - ca) | 0 : ca
                            ea = 0
                        } else {
                            da = ca
                            ea = ba
                        }
                    } else {
                        da = N
                        ea = N
                    }
                while (0)
                f[j >> 2] = da
                f[x >> 2] = ea
                N = K << 1
                M = (b + (N << 2)) | 0
                H = f[y >> 2] | 0
                if ((H | 0) > 0) {
                    O = 0
                    P = i
                    p = H
                    while (1) {
                        if ((p | 0) > 0) {
                            H = 0
                            do {
                                V = f[(P + (H << 2)) >> 2] | 0
                                U = f[z >> 2] | 0
                                if ((V | 0) > (U | 0)) {
                                    fa = f[A >> 2] | 0
                                    f[(fa + (H << 2)) >> 2] = U
                                    ga = fa
                                } else {
                                    fa = f[B >> 2] | 0
                                    U = f[A >> 2] | 0
                                    f[(U + (H << 2)) >> 2] = (V | 0) < (fa | 0) ? fa : V
                                    ga = U
                                }
                                H = (H + 1) | 0
                                U = f[y >> 2] | 0
                            } while ((H | 0) < (U | 0))
                            ha = ga
                            ia = U
                        } else {
                            ha = f[A >> 2] | 0
                            ia = p
                        }
                        H = ((f[(M + (O << 2)) >> 2] | 0) - (f[(ha + (O << 2)) >> 2] | 0)) | 0
                        U = (k + (O << 2)) | 0
                        f[U >> 2] = H
                        ja = f[C >> 2] | 0
                        if ((H | 0) >= (ja | 0)) {
                            if ((H | 0) > (f[E >> 2] | 0)) {
                                ka = (H - (f[D >> 2] | 0)) | 0
                                la = 52
                            }
                        } else {
                            ka = ((f[D >> 2] | 0) + H) | 0
                            la = 52
                        }
                        if ((la | 0) == 52) {
                            la = 0
                            f[U >> 2] = ka
                        }
                        O = (O + 1) | 0
                        if ((O | 0) >= (ia | 0)) break
                        else {
                            P = ha
                            p = ia
                        }
                    }
                    if ((ia | 0) > 0) {
                        p = 0
                        P = j
                        O = ia
                        U = ja
                        while (1) {
                            if ((O | 0) > 0) {
                                H = 0
                                do {
                                    V = f[(P + (H << 2)) >> 2] | 0
                                    fa = f[z >> 2] | 0
                                    if ((V | 0) > (fa | 0)) f[(ha + (H << 2)) >> 2] = fa
                                    else {
                                        fa = f[B >> 2] | 0
                                        f[(ha + (H << 2)) >> 2] = (V | 0) < (fa | 0) ? fa : V
                                    }
                                    H = (H + 1) | 0
                                    ma = f[y >> 2] | 0
                                } while ((H | 0) < (ma | 0))
                                na = f[C >> 2] | 0
                                oa = ma
                            } else {
                                na = U
                                oa = O
                            }
                            H = ((f[(M + (p << 2)) >> 2] | 0) - (f[(ha + (p << 2)) >> 2] | 0)) | 0
                            V = (l + (p << 2)) | 0
                            f[V >> 2] = H
                            if ((H | 0) >= (na | 0)) {
                                if ((H | 0) > (f[E >> 2] | 0)) {
                                    pa = (H - (f[D >> 2] | 0)) | 0
                                    la = 65
                                }
                            } else {
                                pa = ((f[D >> 2] | 0) + H) | 0
                                la = 65
                            }
                            if ((la | 0) == 65) {
                                la = 0
                                f[V >> 2] = pa
                            }
                            p = (p + 1) | 0
                            if ((p | 0) >= (oa | 0)) break
                            else {
                                P = ha
                                O = oa
                                U = na
                            }
                        }
                    }
                }
                U = f[k >> 2] | 0
                O = f[t >> 2] | 0
                if ((O | 0) >= (U | 0))
                    if ((U | 0) < ((0 - O) | 0)) qa = ((f[F >> 2] | 0) + U) | 0
                    else qa = U
                else qa = (U - (f[F >> 2] | 0)) | 0
                f[k >> 2] = qa
                U = f[a >> 2] | 0
                if ((O | 0) >= (U | 0))
                    if ((U | 0) < ((0 - O) | 0)) ra = ((f[F >> 2] | 0) + U) | 0
                    else ra = U
                else ra = (U - (f[F >> 2] | 0)) | 0
                f[a >> 2] = ra
                U = f[l >> 2] | 0
                if ((O | 0) >= (U | 0))
                    if ((U | 0) < ((0 - O) | 0)) sa = ((f[F >> 2] | 0) + U) | 0
                    else sa = U
                else sa = (U - (f[F >> 2] | 0)) | 0
                f[l >> 2] = sa
                U = f[G >> 2] | 0
                if ((O | 0) >= (U | 0))
                    if ((U | 0) < ((0 - O) | 0)) ta = ((f[F >> 2] | 0) + U) | 0
                    else ta = U
                else ta = (U - (f[F >> 2] | 0)) | 0
                f[G >> 2] = ta
                if (((((ra | 0) > -1 ? ra : (0 - ra) | 0) + ((qa | 0) > -1 ? qa : (0 - qa) | 0)) | 0) < ((((sa | 0) > -1 ? sa : (0 - sa) | 0) + ((ta | 0) > -1 ? ta : (0 - ta) | 0)) | 0)) {
                    Vi(g, 0)
                    ua = k
                } else {
                    Vi(g, 1)
                    ua = l
                }
                U = f[ua >> 2] | 0
                if ((U | 0) < 0) va = ((f[F >> 2] | 0) + U) | 0
                else va = U
                U = (c + (N << 2)) | 0
                f[U >> 2] = va
                O = f[(ua + 4) >> 2] | 0
                if ((O | 0) < 0) wa = ((f[F >> 2] | 0) + O) | 0
                else wa = O
                f[(U + 4) >> 2] = wa
                K = (K + 1) | 0
                if ((K | 0) >= (r | 0)) {
                    la = 3
                    break
                }
                U = f[o >> 2] | 0
                L = f[U >> 2] | 0
                if ((((f[(U + 4) >> 2] | 0) - L) >> 2) >>> 0 <= K >>> 0) {
                    J = U
                    la = 4
                    break
                }
            }
            if ((la | 0) == 3) {
                u = e
                return 1
            } else if ((la | 0) == 4) mq(J)
            return 0
        }
        function Tb(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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
            c = u
            u = (u + 16) | 0
            d = (c + 8) | 0
            e = c
            g = f[b >> 2] | 0
            if ((g | 0) == -1) {
                h = 1
                u = c
                return h | 0
            }
            i = ((g >>> 0) / 3) | 0
            j = (a + 24) | 0
            if ((f[((f[j >> 2] | 0) + ((i >>> 5) << 2)) >> 2] & (1 << (i & 31))) | 0) {
                h = 1
                u = c
                return h | 0
            }
            i = (a + 48) | 0
            k = f[i >> 2] | 0
            l = (a + 52) | 0
            m = f[l >> 2] | 0
            if ((m | 0) == (k | 0)) n = k
            else {
                o = (m + (~(((m + -4 - k) | 0) >>> 2) << 2)) | 0
                f[l >> 2] = o
                n = o
            }
            o = (a + 56) | 0
            if ((n | 0) == (f[o >> 2] | 0)) Ci(i, b)
            else {
                f[n >> 2] = g
                f[l >> 2] = n + 4
            }
            n = (a + 4) | 0
            g = f[n >> 2] | 0
            k = f[b >> 2] | 0
            m = (k + 1) | 0
            do
                if ((k | 0) != -1) {
                    p = f[(g + 28) >> 2] | 0
                    q = f[(p + ((((m >>> 0) % 3 | 0 | 0) == 0 ? (k + -2) | 0 : m) << 2)) >> 2] | 0
                    if (!((k >>> 0) % 3 | 0)) {
                        r = q
                        s = (k + 2) | 0
                        t = p
                        break
                    } else {
                        r = q
                        s = (k + -1) | 0
                        t = p
                        break
                    }
                } else {
                    p = f[(g + 28) >> 2] | 0
                    r = f[(p + -4) >> 2] | 0
                    s = -1
                    t = p
                }
            while (0)
            g = f[(t + (s << 2)) >> 2] | 0
            if (((r | 0) == -1) | ((g | 0) == -1)) {
                h = 0
                u = c
                return h | 0
            }
            s = (a + 36) | 0
            t = f[s >> 2] | 0
            k = (t + ((r >>> 5) << 2)) | 0
            m = 1 << (r & 31)
            p = f[k >> 2] | 0
            if (!(p & m)) {
                f[k >> 2] = p | m
                m = f[b >> 2] | 0
                p = (m + 1) | 0
                if ((m | 0) == -1) v = -1
                else v = ((p >>> 0) % 3 | 0 | 0) == 0 ? (m + -2) | 0 : p
                f[e >> 2] = v
                p = f[((f[((f[(a + 16) >> 2] | 0) + 96) >> 2] | 0) + (((((v >>> 0) / 3) | 0) * 12) | 0) + (((v >>> 0) % 3 | 0) << 2)) >> 2] | 0
                v = f[(a + 20) >> 2] | 0
                f[d >> 2] = p
                m = f[(v + 4) >> 2] | 0
                v = (m + 4) | 0
                k = f[v >> 2] | 0
                if ((k | 0) == (f[(m + 8) >> 2] | 0)) Ci(m, d)
                else {
                    f[k >> 2] = p
                    f[v >> 2] = k + 4
                }
                k = (a + 12) | 0
                v = f[k >> 2] | 0
                p = (v + 4) | 0
                m = f[p >> 2] | 0
                if ((m | 0) == (f[(v + 8) >> 2] | 0)) {
                    Ci(v, e)
                    w = f[k >> 2] | 0
                } else {
                    f[m >> 2] = f[e >> 2]
                    f[p >> 2] = m + 4
                    w = v
                }
                v = (w + 24) | 0
                f[((f[(w + 12) >> 2] | 0) + (r << 2)) >> 2] = f[v >> 2]
                f[v >> 2] = (f[v >> 2] | 0) + 1
                x = f[s >> 2] | 0
            } else x = t
            t = (x + ((g >>> 5) << 2)) | 0
            x = 1 << (g & 31)
            v = f[t >> 2] | 0
            if (!(v & x)) {
                f[t >> 2] = v | x
                x = f[b >> 2] | 0
                do
                    if ((x | 0) != -1)
                        if (!((x >>> 0) % 3 | 0)) {
                            y = (x + 2) | 0
                            break
                        } else {
                            y = (x + -1) | 0
                            break
                        }
                    else y = -1
                while (0)
                f[e >> 2] = y
                x = f[((f[((f[(a + 16) >> 2] | 0) + 96) >> 2] | 0) + (((((y >>> 0) / 3) | 0) * 12) | 0) + (((y >>> 0) % 3 | 0) << 2)) >> 2] | 0
                y = f[(a + 20) >> 2] | 0
                f[d >> 2] = x
                v = f[(y + 4) >> 2] | 0
                y = (v + 4) | 0
                t = f[y >> 2] | 0
                if ((t | 0) == (f[(v + 8) >> 2] | 0)) Ci(v, d)
                else {
                    f[t >> 2] = x
                    f[y >> 2] = t + 4
                }
                t = (a + 12) | 0
                y = f[t >> 2] | 0
                x = (y + 4) | 0
                v = f[x >> 2] | 0
                if ((v | 0) == (f[(y + 8) >> 2] | 0)) {
                    Ci(y, e)
                    z = f[t >> 2] | 0
                } else {
                    f[v >> 2] = f[e >> 2]
                    f[x >> 2] = v + 4
                    z = y
                }
                y = (z + 24) | 0
                f[((f[(z + 12) >> 2] | 0) + (g << 2)) >> 2] = f[y >> 2]
                f[y >> 2] = (f[y >> 2] | 0) + 1
            }
            y = f[i >> 2] | 0
            g = f[l >> 2] | 0
            if ((y | 0) == (g | 0)) {
                h = 1
                u = c
                return h | 0
            }
            z = (a + 16) | 0
            v = (a + 20) | 0
            x = (a + 12) | 0
            a = g
            g = y
            a: while (1) {
                y = f[(a + -4) >> 2] | 0
                f[b >> 2] = y
                t = ((y >>> 0) / 3) | 0
                if ((y | 0) != -1 ? ((y = ((f[j >> 2] | 0) + ((t >>> 5) << 2)) | 0), (r = 1 << (t & 31)), (t = f[y >> 2] | 0), ((t & r) | 0) == 0) : 0) {
                    f[y >> 2] = t | r
                    r = f[n >> 2] | 0
                    t = f[b >> 2] | 0
                    y = f[((f[(r + 28) >> 2] | 0) + (t << 2)) >> 2] | 0
                    if ((y | 0) == -1) {
                        h = 0
                        A = 79
                        break
                    } else {
                        B = y
                        C = r
                        D = t
                    }
                    b: while (1) {
                        t = ((f[s >> 2] | 0) + ((B >>> 5) << 2)) | 0
                        r = 1 << (B & 31)
                        y = f[t >> 2] | 0
                        do
                            if (!(y & r)) {
                                w = f[((f[(C + 40) >> 2] | 0) + (B << 2)) >> 2] | 0
                                if ((w | 0) == -1) E = 1
                                else {
                                    m = f[((f[f[(C + 64) >> 2] >> 2] | 0) + (w << 2)) >> 2] | 0
                                    E = (((1 << (m & 31)) & f[((f[(C + 12) >> 2] | 0) + ((m >>> 5) << 2)) >> 2]) | 0) != 0
                                }
                                f[t >> 2] = y | r
                                m = f[b >> 2] | 0
                                f[e >> 2] = m
                                w = f[((f[((f[z >> 2] | 0) + 96) >> 2] | 0) + (((((m >>> 0) / 3) | 0) * 12) | 0) + (((m >>> 0) % 3 | 0) << 2)) >> 2] | 0
                                m = f[v >> 2] | 0
                                f[d >> 2] = w
                                p = f[(m + 4) >> 2] | 0
                                m = (p + 4) | 0
                                k = f[m >> 2] | 0
                                if ((k | 0) == (f[(p + 8) >> 2] | 0)) Ci(p, d)
                                else {
                                    f[k >> 2] = w
                                    f[m >> 2] = k + 4
                                }
                                k = f[x >> 2] | 0
                                m = (k + 4) | 0
                                w = f[m >> 2] | 0
                                if ((w | 0) == (f[(k + 8) >> 2] | 0)) {
                                    Ci(k, e)
                                    F = f[x >> 2] | 0
                                } else {
                                    f[w >> 2] = f[e >> 2]
                                    f[m >> 2] = w + 4
                                    F = k
                                }
                                k = (F + 24) | 0
                                f[((f[(F + 12) >> 2] | 0) + (B << 2)) >> 2] = f[k >> 2]
                                f[k >> 2] = (f[k >> 2] | 0) + 1
                                k = f[n >> 2] | 0
                                w = f[b >> 2] | 0
                                if (E) {
                                    G = w
                                    H = k
                                    A = 59
                                    break
                                }
                                m = (w + 1) | 0
                                do
                                    if ((w | 0) == -1) I = -1
                                    else {
                                        p = ((m >>> 0) % 3 | 0 | 0) == 0 ? (w + -2) | 0 : m
                                        if ((p | 0) == -1) {
                                            I = -1
                                            break
                                        }
                                        if ((f[((f[k >> 2] | 0) + ((p >>> 5) << 2)) >> 2] & (1 << (p & 31))) | 0) {
                                            I = -1
                                            break
                                        }
                                        I = f[((f[((f[(k + 64) >> 2] | 0) + 12) >> 2] | 0) + (p << 2)) >> 2] | 0
                                    }
                                while (0)
                                f[b >> 2] = I
                                J = ((I >>> 0) / 3) | 0
                                K = k
                            } else {
                                G = D
                                H = C
                                A = 59
                            }
                        while (0)
                        if ((A | 0) == 59) {
                            A = 0
                            r = (G + 1) | 0
                            if ((G | 0) == -1) {
                                A = 60
                                break
                            }
                            y = ((r >>> 0) % 3 | 0 | 0) == 0 ? (G + -2) | 0 : r
                            do
                                if ((y | 0) == -1) L = -1
                                else {
                                    if ((f[((f[H >> 2] | 0) + ((y >>> 5) << 2)) >> 2] & (1 << (y & 31))) | 0) {
                                        L = -1
                                        break
                                    }
                                    L = f[((f[((f[(H + 64) >> 2] | 0) + 12) >> 2] | 0) + (y << 2)) >> 2] | 0
                                }
                            while (0)
                            f[d >> 2] = L
                            y = ((((G >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + G) | 0
                            do
                                if ((y | 0) == -1) M = -1
                                else {
                                    if ((f[((f[H >> 2] | 0) + ((y >>> 5) << 2)) >> 2] & (1 << (y & 31))) | 0) {
                                        M = -1
                                        break
                                    }
                                    M = f[((f[((f[(H + 64) >> 2] | 0) + 12) >> 2] | 0) + (y << 2)) >> 2] | 0
                                }
                            while (0)
                            y = (L | 0) == -1
                            r = ((L >>> 0) / 3) | 0
                            t = y ? -1 : r
                            m = (M | 0) == -1
                            w = ((M >>> 0) / 3) | 0
                            p = m ? -1 : w
                            do
                                if (!y) {
                                    q = f[j >> 2] | 0
                                    if ((f[(q + ((t >>> 5) << 2)) >> 2] & (1 << (t & 31))) | 0) {
                                        A = 69
                                        break
                                    }
                                    if (m) {
                                        N = L
                                        O = r
                                        break
                                    }
                                    if (!(f[(q + ((p >>> 5) << 2)) >> 2] & (1 << (p & 31)))) {
                                        A = 74
                                        break b
                                    } else {
                                        N = L
                                        O = r
                                    }
                                } else A = 69
                            while (0)
                            if ((A | 0) == 69) {
                                A = 0
                                if (m) {
                                    A = 71
                                    break
                                }
                                if (!(f[((f[j >> 2] | 0) + ((p >>> 5) << 2)) >> 2] & (1 << (p & 31)))) {
                                    N = M
                                    O = w
                                } else {
                                    A = 71
                                    break
                                }
                            }
                            f[b >> 2] = N
                            J = O
                            K = H
                        }
                        r = ((f[j >> 2] | 0) + ((J >>> 5) << 2)) | 0
                        f[r >> 2] = f[r >> 2] | (1 << (J & 31))
                        D = f[b >> 2] | 0
                        B = f[((f[(K + 28) >> 2] | 0) + (D << 2)) >> 2] | 0
                        if ((B | 0) == -1) {
                            h = 0
                            A = 79
                            break a
                        } else C = K
                    }
                    do
                        if ((A | 0) == 60) {
                            A = 0
                            f[d >> 2] = -1
                            A = 71
                        } else if ((A | 0) == 74) {
                            A = 0
                            r = f[l >> 2] | 0
                            f[(r + -4) >> 2] = M
                            if ((r | 0) == (f[o >> 2] | 0)) {
                                Ci(i, d)
                                P = f[l >> 2] | 0
                                break
                            } else {
                                f[r >> 2] = f[d >> 2]
                                t = (r + 4) | 0
                                f[l >> 2] = t
                                P = t
                                break
                            }
                        }
                    while (0)
                    if ((A | 0) == 71) {
                        A = 0
                        t = ((f[l >> 2] | 0) + -4) | 0
                        f[l >> 2] = t
                        P = t
                    }
                    Q = f[i >> 2] | 0
                    R = P
                } else {
                    t = (a + -4) | 0
                    f[l >> 2] = t
                    Q = g
                    R = t
                }
                if ((Q | 0) == (R | 0)) {
                    h = 1
                    A = 79
                    break
                } else {
                    a = R
                    g = Q
                }
            }
            if ((A | 0) == 79) {
                u = c
                return h | 0
            }
            return 0
        }
        function Ub(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = Oa,
                V = Oa,
                Y = Oa,
                Z = 0,
                _ = 0,
                aa = 0,
                ba = 0
            d = u
            u = (u + 16) | 0
            e = d
            g = (a + 16) | 0
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            f[(a + 12) >> 2] = 0
            n[g >> 2] = $(1.0)
            i = (a + 20) | 0
            f[i >> 2] = 0
            f[(i + 4) >> 2] = 0
            f[(i + 8) >> 2] = 0
            f[(i + 12) >> 2] = 0
            n[(a + 36) >> 2] = $(1.0)
            j = f[(c + 8) >> 2] | 0
            a: do
                if (j | 0) {
                    k = (a + 4) | 0
                    l = (a + 12) | 0
                    m = (a + 8) | 0
                    o = j
                    p = j
                    while (1) {
                        q = (o + 8) | 0
                        r = b[(q + 11) >> 0] | 0
                        s = (r << 24) >> 24 < 0
                        t = s ? f[q >> 2] | 0 : q
                        v = s ? f[(o + 12) >> 2] | 0 : r & 255
                        if (v >>> 0 > 3) {
                            r = t
                            s = v
                            w = v
                            while (1) {
                                x = X(h[r >> 0] | (h[(r + 1) >> 0] << 8) | (h[(r + 2) >> 0] << 16) | (h[(r + 3) >> 0] << 24), 1540483477) | 0
                                s = (X((x >>> 24) ^ x, 1540483477) | 0) ^ (X(s, 1540483477) | 0)
                                w = (w + -4) | 0
                                if (w >>> 0 <= 3) break
                                else r = (r + 4) | 0
                            }
                            r = (v + -4) | 0
                            w = r & -4
                            y = (r - w) | 0
                            z = (t + (w + 4)) | 0
                            A = s
                        } else {
                            y = v
                            z = t
                            A = v
                        }
                        switch (y | 0) {
                            case 3: {
                                B = (h[(z + 2) >> 0] << 16) ^ A
                                C = 8
                                break
                            }
                            case 2: {
                                B = A
                                C = 8
                                break
                            }
                            case 1: {
                                D = A
                                C = 9
                                break
                            }
                            default:
                                E = A
                        }
                        if ((C | 0) == 8) {
                            C = 0
                            D = (h[(z + 1) >> 0] << 8) ^ B
                            C = 9
                        }
                        if ((C | 0) == 9) {
                            C = 0
                            E = X(D ^ h[z >> 0], 1540483477) | 0
                        }
                        w = X((E >>> 13) ^ E, 1540483477) | 0
                        r = (w >>> 15) ^ w
                        w = f[k >> 2] | 0
                        x = (w | 0) == 0
                        b: do
                            if (!x) {
                                F = (w + -1) | 0
                                G = ((F & w) | 0) == 0
                                if (!G)
                                    if (r >>> 0 < w >>> 0) H = r
                                    else H = (r >>> 0) % (w >>> 0) | 0
                                else H = r & F
                                I = f[((f[a >> 2] | 0) + (H << 2)) >> 2] | 0
                                if ((I | 0) != 0 ? ((J = f[I >> 2] | 0), (J | 0) != 0) : 0) {
                                    I = (v | 0) == 0
                                    if (G) {
                                        if (I) {
                                            G = J
                                            while (1) {
                                                K = f[(G + 4) >> 2] | 0
                                                if (!(((K | 0) == (r | 0)) | (((K & F) | 0) == (H | 0)))) {
                                                    L = H
                                                    C = 50
                                                    break b
                                                }
                                                K = b[(G + 8 + 11) >> 0] | 0
                                                if (!(((K << 24) >> 24 < 0 ? f[(G + 12) >> 2] | 0 : K & 255) | 0)) break b
                                                G = f[G >> 2] | 0
                                                if (!G) {
                                                    L = H
                                                    C = 50
                                                    break b
                                                }
                                            }
                                        } else M = J
                                        while (1) {
                                            G = f[(M + 4) >> 2] | 0
                                            if (!(((G | 0) == (r | 0)) | (((G & F) | 0) == (H | 0)))) {
                                                L = H
                                                C = 50
                                                break b
                                            }
                                            G = (M + 8) | 0
                                            K = b[(G + 11) >> 0] | 0
                                            N = (K << 24) >> 24 < 0
                                            O = K & 255
                                            do
                                                if (((N ? f[(M + 12) >> 2] | 0 : O) | 0) == (v | 0)) {
                                                    K = f[G >> 2] | 0
                                                    if (N)
                                                        if (!(Pk(K, t, v) | 0)) break b
                                                        else break
                                                    if ((b[t >> 0] | 0) == ((K & 255) << 24) >> 24) {
                                                        K = G
                                                        P = O
                                                        Q = t
                                                        do {
                                                            P = (P + -1) | 0
                                                            K = (K + 1) | 0
                                                            if (!P) break b
                                                            Q = (Q + 1) | 0
                                                        } while ((b[K >> 0] | 0) == (b[Q >> 0] | 0))
                                                    }
                                                }
                                            while (0)
                                            M = f[M >> 2] | 0
                                            if (!M) {
                                                L = H
                                                C = 50
                                                break b
                                            }
                                        }
                                    }
                                    if (I) {
                                        F = J
                                        while (1) {
                                            O = f[(F + 4) >> 2] | 0
                                            if ((O | 0) != (r | 0)) {
                                                if (O >>> 0 < w >>> 0) R = O
                                                else R = (O >>> 0) % (w >>> 0) | 0
                                                if ((R | 0) != (H | 0)) {
                                                    L = H
                                                    C = 50
                                                    break b
                                                }
                                            }
                                            O = b[(F + 8 + 11) >> 0] | 0
                                            if (!(((O << 24) >> 24 < 0 ? f[(F + 12) >> 2] | 0 : O & 255) | 0)) break b
                                            F = f[F >> 2] | 0
                                            if (!F) {
                                                L = H
                                                C = 50
                                                break b
                                            }
                                        }
                                    } else S = J
                                    while (1) {
                                        F = f[(S + 4) >> 2] | 0
                                        if ((F | 0) != (r | 0)) {
                                            if (F >>> 0 < w >>> 0) T = F
                                            else T = (F >>> 0) % (w >>> 0) | 0
                                            if ((T | 0) != (H | 0)) {
                                                L = H
                                                C = 50
                                                break b
                                            }
                                        }
                                        F = (S + 8) | 0
                                        I = b[(F + 11) >> 0] | 0
                                        O = (I << 24) >> 24 < 0
                                        G = I & 255
                                        do
                                            if (((O ? f[(S + 12) >> 2] | 0 : G) | 0) == (v | 0)) {
                                                I = f[F >> 2] | 0
                                                if (O)
                                                    if (!(Pk(I, t, v) | 0)) break b
                                                    else break
                                                if ((b[t >> 0] | 0) == ((I & 255) << 24) >> 24) {
                                                    I = F
                                                    N = G
                                                    Q = t
                                                    do {
                                                        N = (N + -1) | 0
                                                        I = (I + 1) | 0
                                                        if (!N) break b
                                                        Q = (Q + 1) | 0
                                                    } while ((b[I >> 0] | 0) == (b[Q >> 0] | 0))
                                                }
                                            }
                                        while (0)
                                        S = f[S >> 2] | 0
                                        if (!S) {
                                            L = H
                                            C = 50
                                            break
                                        }
                                    }
                                } else {
                                    L = H
                                    C = 50
                                }
                            } else {
                                L = 0
                                C = 50
                            }
                        while (0)
                        if ((C | 0) == 50) {
                            C = 0
                            pi(e, a, r, q)
                            U = $((((f[l >> 2] | 0) + 1) | 0) >>> 0)
                            V = $(w >>> 0)
                            Y = $(n[g >> 2])
                            do
                                if (x | ($(Y * V) < U)) {
                                    t = (w << 1) | (((w >>> 0 < 3) | ((((w + -1) & w) | 0) != 0)) & 1)
                                    v = ~~$(W($(U / Y))) >>> 0
                                    Ph(a, t >>> 0 < v >>> 0 ? v : t)
                                    t = f[k >> 2] | 0
                                    v = (t + -1) | 0
                                    if (!(v & t)) {
                                        Z = t
                                        _ = v & r
                                        break
                                    }
                                    if (r >>> 0 < t >>> 0) {
                                        Z = t
                                        _ = r
                                    } else {
                                        Z = t
                                        _ = (r >>> 0) % (t >>> 0) | 0
                                    }
                                } else {
                                    Z = w
                                    _ = L
                                }
                            while (0)
                            w = f[((f[a >> 2] | 0) + (_ << 2)) >> 2] | 0
                            if (!w) {
                                f[f[e >> 2] >> 2] = f[m >> 2]
                                f[m >> 2] = f[e >> 2]
                                f[((f[a >> 2] | 0) + (_ << 2)) >> 2] = m
                                r = f[e >> 2] | 0
                                x = f[r >> 2] | 0
                                if (x | 0) {
                                    q = f[(x + 4) >> 2] | 0
                                    x = (Z + -1) | 0
                                    if (x & Z)
                                        if (q >>> 0 < Z >>> 0) aa = q
                                        else aa = (q >>> 0) % (Z >>> 0) | 0
                                    else aa = q & x
                                    f[((f[a >> 2] | 0) + (aa << 2)) >> 2] = r
                                }
                            } else {
                                f[f[e >> 2] >> 2] = f[w >> 2]
                                f[w >> 2] = f[e >> 2]
                            }
                            f[l >> 2] = (f[l >> 2] | 0) + 1
                        }
                        w = f[p >> 2] | 0
                        if (!w) break a
                        else {
                            o = w
                            p = w
                        }
                    }
                }
            while (0)
            e = f[(c + 28) >> 2] | 0
            if (!e) {
                u = d
                return
            } else ba = e
            do {
                e = ba
                c = dn(40) | 0
                Ub(c, f[(e + 20) >> 2] | 0)
                aa = xc(i, (e + 8) | 0) | 0
                e = f[aa >> 2] | 0
                f[aa >> 2] = c
                if (e | 0) {
                    c = f[(e + 28) >> 2] | 0
                    if (c | 0) {
                        aa = c
                        do {
                            c = aa
                            aa = f[aa >> 2] | 0
                            bi((c + 8) | 0)
                            br(c)
                        } while ((aa | 0) != 0)
                    }
                    aa = (e + 20) | 0
                    c = f[aa >> 2] | 0
                    f[aa >> 2] = 0
                    if (c | 0) br(c)
                    c = f[(e + 8) >> 2] | 0
                    if (c | 0) {
                        aa = c
                        do {
                            c = aa
                            aa = f[aa >> 2] | 0
                            a = (c + 8) | 0
                            Z = f[(c + 20) >> 2] | 0
                            if (Z | 0) {
                                _ = (c + 24) | 0
                                if ((f[_ >> 2] | 0) != (Z | 0)) f[_ >> 2] = Z
                                br(Z)
                            }
                            if ((b[(a + 11) >> 0] | 0) < 0) br(f[a >> 2] | 0)
                            br(c)
                        } while ((aa | 0) != 0)
                    }
                    aa = f[e >> 2] | 0
                    f[e >> 2] = 0
                    if (aa | 0) br(aa)
                    br(e)
                }
                ba = f[ba >> 2] | 0
            } while ((ba | 0) != 0)
            u = d
            return
        }
        function Vb(a, c, e) {
            a = a | 0
            c = c | 0
            e = e | 0
            var g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 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,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = Oa,
                fa = Oa,
                ga = Oa,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0
            g = u
            u = (u + 48) | 0
            i = (g + 16) | 0
            j = (g + 12) | 0
            k = g
            l = (i + 16) | 0
            f[i >> 2] = 0
            f[(i + 4) >> 2] = 0
            f[(i + 8) >> 2] = 0
            f[(i + 12) >> 2] = 0
            n[l >> 2] = $(1.0)
            m = (a + 80) | 0
            o = f[m >> 2] | 0
            f[k >> 2] = 0
            p = (k + 4) | 0
            f[p >> 2] = 0
            f[(k + 8) >> 2] = 0
            if (o) {
                if (o >>> 0 > 1073741823) mq(k)
                q = o << 2
                r = dn(q) | 0
                f[k >> 2] = r
                s = (r + (o << 2)) | 0
                f[(k + 8) >> 2] = s
                hj(r | 0, 0, q | 0) | 0
                f[p >> 2] = s
                s = (c + 48) | 0
                q = (c + 40) | 0
                o = (i + 4) | 0
                t = (i + 12) | 0
                v = (i + 8) | 0
                w = (a + 40) | 0
                x = (a + 64) | 0
                y = f[e >> 2] | 0
                e = r
                z = 0
                A = 0
                B = r
                C = r
                D = 0
                E = r
                while (1) {
                    r = s
                    F = f[r >> 2] | 0
                    G = f[(r + 4) >> 2] | 0
                    r = q
                    H = on(f[r >> 2] | 0, f[(r + 4) >> 2] | 0, (y + z) | 0, 0) | 0
                    r = Tn(H | 0, I | 0, F | 0, G | 0) | 0
                    G = ((f[f[c >> 2] >> 2] | 0) + r) | 0
                    r = h[G >> 0] | (h[(G + 1) >> 0] << 8) | (h[(G + 2) >> 0] << 16) | (h[(G + 3) >> 0] << 24)
                    f[j >> 2] = r
                    G = r & 65535
                    F = r >>> 16
                    H = F & 65535
                    J = (((r & 65535) ^ 318) + 239) ^ F
                    F = (D | 0) == 0
                    a: do
                        if (!F) {
                            K = (D + -1) | 0
                            L = ((K & D) | 0) == 0
                            if (!L)
                                if (J >>> 0 < D >>> 0) M = J
                                else M = (J >>> 0) % (D >>> 0) | 0
                            else M = J & K
                            N = f[((f[i >> 2] | 0) + (M << 2)) >> 2] | 0
                            do
                                if (N | 0 ? ((O = f[N >> 2] | 0), O | 0) : 0) {
                                    b: do
                                        if (L) {
                                            P = O
                                            while (1) {
                                                Q = f[(P + 4) >> 2] | 0
                                                R = (Q | 0) == (J | 0)
                                                if (!(R | (((Q & K) | 0) == (M | 0)))) {
                                                    S = 27
                                                    break b
                                                }
                                                if ((R ? ((R = (P + 8) | 0), (d[R >> 1] | 0) == (G << 16) >> 16) : 0) ? (d[(R + 2) >> 1] | 0) == (H << 16) >> 16 : 0) {
                                                    T = P
                                                    S = 26
                                                    break b
                                                }
                                                P = f[P >> 2] | 0
                                                if (!P) {
                                                    S = 27
                                                    break
                                                }
                                            }
                                        } else {
                                            P = O
                                            while (1) {
                                                R = f[(P + 4) >> 2] | 0
                                                if ((R | 0) == (J | 0)) {
                                                    Q = (P + 8) | 0
                                                    if ((d[Q >> 1] | 0) == (G << 16) >> 16 ? (d[(Q + 2) >> 1] | 0) == (H << 16) >> 16 : 0) {
                                                        T = P
                                                        S = 26
                                                        break b
                                                    }
                                                } else {
                                                    if (R >>> 0 < D >>> 0) U = R
                                                    else U = (R >>> 0) % (D >>> 0) | 0
                                                    if ((U | 0) != (M | 0)) {
                                                        S = 27
                                                        break b
                                                    }
                                                }
                                                P = f[P >> 2] | 0
                                                if (!P) {
                                                    S = 27
                                                    break
                                                }
                                            }
                                        }
                                    while (0)
                                    if ((S | 0) == 26) {
                                        S = 0
                                        f[(E + (z << 2)) >> 2] = f[(T + 12) >> 2]
                                        V = e
                                        X = A
                                        Y = C
                                        Z = B
                                        _ = E
                                        break a
                                    } else if ((S | 0) == 27) {
                                        S = 0
                                        if (F) {
                                            aa = 0
                                            S = 46
                                            break a
                                        } else break
                                    }
                                }
                            while (0)
                            K = (D + -1) | 0
                            L = ((K & D) | 0) == 0
                            if (!L)
                                if (J >>> 0 < D >>> 0) ba = J
                                else ba = (J >>> 0) % (D >>> 0) | 0
                            else ba = K & J
                            N = f[((f[i >> 2] | 0) + (ba << 2)) >> 2] | 0
                            if ((N | 0) != 0 ? ((O = f[N >> 2] | 0), (O | 0) != 0) : 0) {
                                if (L) {
                                    L = O
                                    while (1) {
                                        N = f[(L + 4) >> 2] | 0
                                        if (!(((N | 0) == (J | 0)) | (((N & K) | 0) == (ba | 0)))) {
                                            aa = ba
                                            S = 46
                                            break a
                                        }
                                        N = (L + 8) | 0
                                        if ((d[N >> 1] | 0) == (G << 16) >> 16 ? (d[(N + 2) >> 1] | 0) == (H << 16) >> 16 : 0) {
                                            S = 61
                                            break a
                                        }
                                        L = f[L >> 2] | 0
                                        if (!L) {
                                            aa = ba
                                            S = 46
                                            break a
                                        }
                                    }
                                } else ca = O
                                while (1) {
                                    L = f[(ca + 4) >> 2] | 0
                                    if ((L | 0) != (J | 0)) {
                                        if (L >>> 0 < D >>> 0) da = L
                                        else da = (L >>> 0) % (D >>> 0) | 0
                                        if ((da | 0) != (ba | 0)) {
                                            aa = ba
                                            S = 46
                                            break a
                                        }
                                    }
                                    L = (ca + 8) | 0
                                    if ((d[L >> 1] | 0) == (G << 16) >> 16 ? (d[(L + 2) >> 1] | 0) == (H << 16) >> 16 : 0) {
                                        S = 61
                                        break a
                                    }
                                    ca = f[ca >> 2] | 0
                                    if (!ca) {
                                        aa = ba
                                        S = 46
                                        break
                                    }
                                }
                            } else {
                                aa = ba
                                S = 46
                            }
                        } else {
                            aa = 0
                            S = 46
                        }
                    while (0)
                    if ((S | 0) == 46) {
                        S = 0
                        H = dn(16) | 0
                        G = (H + 8) | 0
                        d[G >> 1] = r
                        d[(G + 2) >> 1] = r >>> 16
                        f[(H + 12) >> 2] = A
                        f[(H + 4) >> 2] = J
                        f[H >> 2] = 0
                        ea = $((((f[t >> 2] | 0) + 1) | 0) >>> 0)
                        fa = $(D >>> 0)
                        ga = $(n[l >> 2])
                        do
                            if (F | ($(ga * fa) < ea)) {
                                G = (D << 1) | (((D >>> 0 < 3) | ((((D + -1) & D) | 0) != 0)) & 1)
                                O = ~~$(W($(ea / ga))) >>> 0
                                Eh(i, G >>> 0 < O >>> 0 ? O : G)
                                G = f[o >> 2] | 0
                                O = (G + -1) | 0
                                if (!(O & G)) {
                                    ha = G
                                    ia = O & J
                                    break
                                }
                                if (J >>> 0 < G >>> 0) {
                                    ha = G
                                    ia = J
                                } else {
                                    ha = G
                                    ia = (J >>> 0) % (G >>> 0) | 0
                                }
                            } else {
                                ha = D
                                ia = aa
                            }
                        while (0)
                        J = ((f[i >> 2] | 0) + (ia << 2)) | 0
                        F = f[J >> 2] | 0
                        if (!F) {
                            f[H >> 2] = f[v >> 2]
                            f[v >> 2] = H
                            f[J >> 2] = v
                            J = f[H >> 2] | 0
                            if (J | 0) {
                                r = f[(J + 4) >> 2] | 0
                                J = (ha + -1) | 0
                                if (J & ha)
                                    if (r >>> 0 < ha >>> 0) ja = r
                                    else ja = (r >>> 0) % (ha >>> 0) | 0
                                else ja = r & J
                                ka = ((f[i >> 2] | 0) + (ja << 2)) | 0
                                S = 59
                            }
                        } else {
                            f[H >> 2] = f[F >> 2]
                            ka = F
                            S = 59
                        }
                        if ((S | 0) == 59) {
                            S = 0
                            f[ka >> 2] = H
                        }
                        f[t >> 2] = (f[t >> 2] | 0) + 1
                        S = 61
                    }
                    if ((S | 0) == 61) {
                        S = 0
                        F = w
                        J = f[F >> 2] | 0
                        r = on(J | 0, f[(F + 4) >> 2] | 0, A | 0, 0) | 0
                        Rg(((f[f[x >> 2] >> 2] | 0) + r) | 0, j | 0, J | 0) | 0
                        J = f[k >> 2] | 0
                        f[(J + (z << 2)) >> 2] = A
                        V = J
                        X = (A + 1) | 0
                        Y = J
                        Z = J
                        _ = J
                    }
                    J = (z + 1) | 0
                    la = f[m >> 2] | 0
                    if (J >>> 0 >= la >>> 0) break
                    e = V
                    z = J
                    A = X
                    B = Z
                    C = Y
                    D = f[o >> 2] | 0
                    E = _
                }
                if ((X | 0) == (la | 0)) ma = Z
                else {
                    Z = (a + 84) | 0
                    if (!(b[Z >> 0] | 0)) {
                        _ = f[(a + 72) >> 2] | 0
                        E = f[(a + 68) >> 2] | 0
                        o = E
                        if ((_ | 0) == (E | 0)) na = V
                        else {
                            D = (_ - E) >> 2
                            E = 0
                            do {
                                _ = (o + (E << 2)) | 0
                                f[_ >> 2] = f[(Y + (f[_ >> 2] << 2)) >> 2]
                                E = (E + 1) | 0
                            } while (E >>> 0 < D >>> 0)
                            na = V
                        }
                    } else {
                        b[Z >> 0] = 0
                        Z = (a + 68) | 0
                        V = (a + 72) | 0
                        D = f[V >> 2] | 0
                        E = f[Z >> 2] | 0
                        Y = (D - E) >> 2
                        o = E
                        E = D
                        if (la >>> 0 <= Y >>> 0)
                            if (la >>> 0 < Y >>> 0 ? ((D = (o + (la << 2)) | 0), (D | 0) != (E | 0)) : 0) {
                                f[V >> 2] = E + (~(((E + -4 - D) | 0) >>> 2) << 2)
                                oa = la
                            } else oa = la
                        else {
                            kh(Z, (la - Y) | 0, 1204)
                            oa = f[m >> 2] | 0
                        }
                        Y = f[k >> 2] | 0
                        if (!oa) na = Y
                        else {
                            k = f[(a + 68) >> 2] | 0
                            a = 0
                            do {
                                f[(k + (a << 2)) >> 2] = f[(Y + (a << 2)) >> 2]
                                a = (a + 1) | 0
                            } while (a >>> 0 < oa >>> 0)
                            na = Y
                        }
                    }
                    f[m >> 2] = X
                    ma = na
                }
                if (!ma) pa = X
                else {
                    na = f[p >> 2] | 0
                    if ((na | 0) != (ma | 0)) f[p >> 2] = na + (~(((na + -4 - ma) | 0) >>> 2) << 2)
                    br(ma)
                    pa = X
                }
            } else pa = 0
            X = f[(i + 8) >> 2] | 0
            if (X | 0) {
                ma = X
                do {
                    X = ma
                    ma = f[ma >> 2] | 0
                    br(X)
                } while ((ma | 0) != 0)
            }
            ma = f[i >> 2] | 0
            f[i >> 2] = 0
            if (!ma) {
                u = g
                return pa | 0
            }
            br(ma)
            u = g
            return pa | 0
        }
        function Wb(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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
            c = u
            u = (u + 16) | 0
            d = (c + 8) | 0
            e = c
            g = f[b >> 2] | 0
            if ((g | 0) == -1) {
                h = 1
                u = c
                return h | 0
            }
            i = ((g >>> 0) / 3) | 0
            j = (a + 24) | 0
            if ((f[((f[j >> 2] | 0) + ((i >>> 5) << 2)) >> 2] & (1 << (i & 31))) | 0) {
                h = 1
                u = c
                return h | 0
            }
            i = (a + 48) | 0
            k = f[i >> 2] | 0
            l = (a + 52) | 0
            m = f[l >> 2] | 0
            if ((m | 0) == (k | 0)) n = k
            else {
                o = (m + (~(((m + -4 - k) | 0) >>> 2) << 2)) | 0
                f[l >> 2] = o
                n = o
            }
            o = (a + 56) | 0
            if ((n | 0) == (f[o >> 2] | 0)) Ci(i, b)
            else {
                f[n >> 2] = g
                f[l >> 2] = n + 4
            }
            n = (a + 4) | 0
            g = f[n >> 2] | 0
            k = f[b >> 2] | 0
            m = (k + 1) | 0
            if ((k | 0) == -1) {
                h = 0
                u = c
                return h | 0
            }
            p = ((m >>> 0) % 3 | 0 | 0) == 0 ? (k + -2) | 0 : m
            if ((p | 0) == -1) q = -1
            else q = f[((f[g >> 2] | 0) + (p << 2)) >> 2] | 0
            p = ((((k >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + k) | 0
            if ((p | 0) == -1) {
                h = 0
                u = c
                return h | 0
            }
            k = f[((f[g >> 2] | 0) + (p << 2)) >> 2] | 0
            if (((q | 0) == -1) | ((k | 0) == -1)) {
                h = 0
                u = c
                return h | 0
            }
            p = (a + 36) | 0
            g = f[p >> 2] | 0
            m = (g + ((q >>> 5) << 2)) | 0
            r = 1 << (q & 31)
            s = f[m >> 2] | 0
            if (!(s & r)) {
                f[m >> 2] = s | r
                r = f[b >> 2] | 0
                s = (r + 1) | 0
                if ((r | 0) == -1) t = -1
                else t = ((s >>> 0) % 3 | 0 | 0) == 0 ? (r + -2) | 0 : s
                f[e >> 2] = t
                s = f[((f[((f[(a + 16) >> 2] | 0) + 96) >> 2] | 0) + (((((t >>> 0) / 3) | 0) * 12) | 0) + (((t >>> 0) % 3 | 0) << 2)) >> 2] | 0
                t = f[(a + 20) >> 2] | 0
                f[d >> 2] = s
                r = f[(t + 4) >> 2] | 0
                t = (r + 4) | 0
                m = f[t >> 2] | 0
                if ((m | 0) == (f[(r + 8) >> 2] | 0)) Ci(r, d)
                else {
                    f[m >> 2] = s
                    f[t >> 2] = m + 4
                }
                m = (a + 12) | 0
                t = f[m >> 2] | 0
                s = (t + 4) | 0
                r = f[s >> 2] | 0
                if ((r | 0) == (f[(t + 8) >> 2] | 0)) {
                    Ci(t, e)
                    v = f[m >> 2] | 0
                } else {
                    f[r >> 2] = f[e >> 2]
                    f[s >> 2] = r + 4
                    v = t
                }
                t = (v + 24) | 0
                f[((f[(v + 12) >> 2] | 0) + (q << 2)) >> 2] = f[t >> 2]
                f[t >> 2] = (f[t >> 2] | 0) + 1
                w = f[p >> 2] | 0
            } else w = g
            g = (w + ((k >>> 5) << 2)) | 0
            w = 1 << (k & 31)
            t = f[g >> 2] | 0
            if (!(t & w)) {
                f[g >> 2] = t | w
                w = f[b >> 2] | 0
                do
                    if ((w | 0) != -1)
                        if (!((w >>> 0) % 3 | 0)) {
                            x = (w + 2) | 0
                            break
                        } else {
                            x = (w + -1) | 0
                            break
                        }
                    else x = -1
                while (0)
                f[e >> 2] = x
                w = f[((f[((f[(a + 16) >> 2] | 0) + 96) >> 2] | 0) + (((((x >>> 0) / 3) | 0) * 12) | 0) + (((x >>> 0) % 3 | 0) << 2)) >> 2] | 0
                x = f[(a + 20) >> 2] | 0
                f[d >> 2] = w
                t = f[(x + 4) >> 2] | 0
                x = (t + 4) | 0
                g = f[x >> 2] | 0
                if ((g | 0) == (f[(t + 8) >> 2] | 0)) Ci(t, d)
                else {
                    f[g >> 2] = w
                    f[x >> 2] = g + 4
                }
                g = (a + 12) | 0
                x = f[g >> 2] | 0
                w = (x + 4) | 0
                t = f[w >> 2] | 0
                if ((t | 0) == (f[(x + 8) >> 2] | 0)) {
                    Ci(x, e)
                    y = f[g >> 2] | 0
                } else {
                    f[t >> 2] = f[e >> 2]
                    f[w >> 2] = t + 4
                    y = x
                }
                x = (y + 24) | 0
                f[((f[(y + 12) >> 2] | 0) + (k << 2)) >> 2] = f[x >> 2]
                f[x >> 2] = (f[x >> 2] | 0) + 1
            }
            x = f[i >> 2] | 0
            k = f[l >> 2] | 0
            if ((x | 0) == (k | 0)) {
                h = 1
                u = c
                return h | 0
            }
            y = (a + 16) | 0
            t = (a + 20) | 0
            w = (a + 12) | 0
            a = k
            k = x
            a: while (1) {
                x = f[(a + -4) >> 2] | 0
                f[b >> 2] = x
                g = ((x >>> 0) / 3) | 0
                if ((x | 0) != -1 ? ((x = ((f[j >> 2] | 0) + ((g >>> 5) << 2)) | 0), (q = 1 << (g & 31)), (g = f[x >> 2] | 0), ((g & q) | 0) == 0) : 0) {
                    f[x >> 2] = g | q
                    q = f[b >> 2] | 0
                    if ((q | 0) == -1) {
                        h = 0
                        z = 80
                        break
                    }
                    g = f[n >> 2] | 0
                    x = q
                    b: while (1) {
                        q = f[((f[g >> 2] | 0) + (x << 2)) >> 2] | 0
                        if ((q | 0) == -1) {
                            h = 0
                            z = 80
                            break a
                        }
                        v = ((f[p >> 2] | 0) + ((q >>> 5) << 2)) | 0
                        r = 1 << (q & 31)
                        s = f[v >> 2] | 0
                        do
                            if (!(s & r)) {
                                m = f[((f[(g + 24) >> 2] | 0) + (q << 2)) >> 2] | 0
                                A = (m + 1) | 0
                                do
                                    if ((m | 0) == -1) B = 1
                                    else {
                                        C = ((A >>> 0) % 3 | 0 | 0) == 0 ? (m + -2) | 0 : A
                                        if ((C | 0) == -1) {
                                            B = 1
                                            break
                                        }
                                        D = f[((f[(g + 12) >> 2] | 0) + (C << 2)) >> 2] | 0
                                        C = (D + 1) | 0
                                        if ((D | 0) == -1) {
                                            B = 1
                                            break
                                        }
                                        B = ((((C >>> 0) % 3 | 0 | 0) == 0 ? (D + -2) | 0 : C) | 0) == -1
                                    }
                                while (0)
                                f[v >> 2] = s | r
                                A = f[b >> 2] | 0
                                f[e >> 2] = A
                                m = f[((f[((f[y >> 2] | 0) + 96) >> 2] | 0) + (((((A >>> 0) / 3) | 0) * 12) | 0) + (((A >>> 0) % 3 | 0) << 2)) >> 2] | 0
                                A = f[t >> 2] | 0
                                f[d >> 2] = m
                                C = f[(A + 4) >> 2] | 0
                                A = (C + 4) | 0
                                D = f[A >> 2] | 0
                                if ((D | 0) == (f[(C + 8) >> 2] | 0)) Ci(C, d)
                                else {
                                    f[D >> 2] = m
                                    f[A >> 2] = D + 4
                                }
                                D = f[w >> 2] | 0
                                A = (D + 4) | 0
                                m = f[A >> 2] | 0
                                if ((m | 0) == (f[(D + 8) >> 2] | 0)) {
                                    Ci(D, e)
                                    E = f[w >> 2] | 0
                                } else {
                                    f[m >> 2] = f[e >> 2]
                                    f[A >> 2] = m + 4
                                    E = D
                                }
                                D = (E + 24) | 0
                                f[((f[(E + 12) >> 2] | 0) + (q << 2)) >> 2] = f[D >> 2]
                                f[D >> 2] = (f[D >> 2] | 0) + 1
                                D = f[n >> 2] | 0
                                m = f[b >> 2] | 0
                                if (B)
                                    if ((m | 0) == -1) {
                                        z = 63
                                        break b
                                    } else {
                                        F = m
                                        G = D
                                        z = 64
                                        break
                                    }
                                do
                                    if ((m | 0) == -1) H = -1
                                    else {
                                        A = (m + 1) | 0
                                        C = ((A >>> 0) % 3 | 0 | 0) == 0 ? (m + -2) | 0 : A
                                        if ((C | 0) == -1) {
                                            H = -1
                                            break
                                        }
                                        H = f[((f[(D + 12) >> 2] | 0) + (C << 2)) >> 2] | 0
                                    }
                                while (0)
                                f[b >> 2] = H
                                I = ((H >>> 0) / 3) | 0
                                J = D
                            } else {
                                F = x
                                G = g
                                z = 64
                            }
                        while (0)
                        if ((z | 0) == 64) {
                            z = 0
                            q = (F + 1) | 0
                            r = ((q >>> 0) % 3 | 0 | 0) == 0 ? (F + -2) | 0 : q
                            if ((r | 0) == -1) K = -1
                            else K = f[((f[(G + 12) >> 2] | 0) + (r << 2)) >> 2] | 0
                            f[d >> 2] = K
                            r = ((((F >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + F) | 0
                            if ((r | 0) == -1) L = -1
                            else L = f[((f[(G + 12) >> 2] | 0) + (r << 2)) >> 2] | 0
                            r = (K | 0) == -1
                            q = ((K >>> 0) / 3) | 0
                            s = r ? -1 : q
                            v = (L | 0) == -1
                            m = ((L >>> 0) / 3) | 0
                            C = v ? -1 : m
                            do
                                if (!r) {
                                    A = f[j >> 2] | 0
                                    if ((f[(A + ((s >>> 5) << 2)) >> 2] & (1 << (s & 31))) | 0) {
                                        z = 70
                                        break
                                    }
                                    if (v) {
                                        M = K
                                        N = q
                                        break
                                    }
                                    if (!(f[(A + ((C >>> 5) << 2)) >> 2] & (1 << (C & 31)))) {
                                        z = 75
                                        break b
                                    } else {
                                        M = K
                                        N = q
                                    }
                                } else z = 70
                            while (0)
                            if ((z | 0) == 70) {
                                z = 0
                                if (v) {
                                    z = 72
                                    break
                                }
                                if (!(f[((f[j >> 2] | 0) + ((C >>> 5) << 2)) >> 2] & (1 << (C & 31)))) {
                                    M = L
                                    N = m
                                } else {
                                    z = 72
                                    break
                                }
                            }
                            f[b >> 2] = M
                            I = N
                            J = G
                        }
                        q = ((f[j >> 2] | 0) + ((I >>> 5) << 2)) | 0
                        f[q >> 2] = f[q >> 2] | (1 << (I & 31))
                        x = f[b >> 2] | 0
                        if ((x | 0) == -1) {
                            h = 0
                            z = 80
                            break a
                        } else g = J
                    }
                    do
                        if ((z | 0) == 63) {
                            z = 0
                            f[d >> 2] = -1
                            z = 72
                        } else if ((z | 0) == 75) {
                            z = 0
                            g = f[l >> 2] | 0
                            f[(g + -4) >> 2] = L
                            if ((g | 0) == (f[o >> 2] | 0)) {
                                Ci(i, d)
                                O = f[l >> 2] | 0
                                break
                            } else {
                                f[g >> 2] = f[d >> 2]
                                x = (g + 4) | 0
                                f[l >> 2] = x
                                O = x
                                break
                            }
                        }
                    while (0)
                    if ((z | 0) == 72) {
                        z = 0
                        x = ((f[l >> 2] | 0) + -4) | 0
                        f[l >> 2] = x
                        O = x
                    }
                    P = f[i >> 2] | 0
                    Q = O
                } else {
                    x = (a + -4) | 0
                    f[l >> 2] = x
                    P = k
                    Q = x
                }
                if ((P | 0) == (Q | 0)) {
                    h = 1
                    z = 80
                    break
                } else {
                    a = Q
                    k = P
                }
            }
            if ((z | 0) == 80) {
                u = c
                return h | 0
            }
            return 0
        }
        function Xb(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 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,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                aa = 0,
                ba = 0,
                ca = Oa,
                da = Oa,
                ea = Oa,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0
            e = u
            u = (u + 48) | 0
            g = (e + 20) | 0
            i = e
            j = (e + 8) | 0
            k = (g + 16) | 0
            f[g >> 2] = 0
            f[(g + 4) >> 2] = 0
            f[(g + 8) >> 2] = 0
            f[(g + 12) >> 2] = 0
            n[k >> 2] = $(1.0)
            l = (a + 80) | 0
            m = f[l >> 2] | 0
            f[j >> 2] = 0
            o = (j + 4) | 0
            f[o >> 2] = 0
            f[(j + 8) >> 2] = 0
            if (m) {
                if (m >>> 0 > 1073741823) mq(j)
                p = m << 2
                q = dn(p) | 0
                f[j >> 2] = q
                r = (q + (m << 2)) | 0
                f[(j + 8) >> 2] = r
                hj(q | 0, 0, p | 0) | 0
                f[o >> 2] = r
                r = (c + 48) | 0
                p = (c + 40) | 0
                m = (g + 4) | 0
                s = (g + 12) | 0
                t = (g + 8) | 0
                v = (a + 40) | 0
                w = (a + 64) | 0
                x = f[d >> 2] | 0
                d = q
                y = 0
                z = 0
                A = q
                B = q
                C = q
                q = 0
                while (1) {
                    D = r
                    E = f[D >> 2] | 0
                    F = f[(D + 4) >> 2] | 0
                    D = p
                    G = on(f[D >> 2] | 0, f[(D + 4) >> 2] | 0, (x + y) | 0, 0) | 0
                    D = Tn(G | 0, I | 0, E | 0, F | 0) | 0
                    F = ((f[f[c >> 2] >> 2] | 0) + D) | 0
                    D = F
                    E = h[D >> 0] | (h[(D + 1) >> 0] << 8) | (h[(D + 2) >> 0] << 16) | (h[(D + 3) >> 0] << 24)
                    D = (F + 4) | 0
                    F = h[D >> 0] | (h[(D + 1) >> 0] << 8) | (h[(D + 2) >> 0] << 16) | (h[(D + 3) >> 0] << 24)
                    D = i
                    f[D >> 2] = E
                    f[(D + 4) >> 2] = F
                    D = ((E ^ 318) + 239) ^ F
                    G = (q | 0) == 0
                    a: do
                        if (!G) {
                            H = (q + -1) | 0
                            J = ((H & q) | 0) == 0
                            if (!J)
                                if (D >>> 0 < q >>> 0) K = D
                                else K = (D >>> 0) % (q >>> 0) | 0
                            else K = D & H
                            L = f[((f[g >> 2] | 0) + (K << 2)) >> 2] | 0
                            do
                                if (L | 0 ? ((M = f[L >> 2] | 0), M | 0) : 0) {
                                    b: do
                                        if (J) {
                                            N = M
                                            while (1) {
                                                O = f[(N + 4) >> 2] | 0
                                                P = (O | 0) == (D | 0)
                                                if (!(P | (((O & H) | 0) == (K | 0)))) {
                                                    Q = 27
                                                    break b
                                                }
                                                if ((P ? (f[(N + 8) >> 2] | 0) == (E | 0) : 0) ? (f[(N + 12) >> 2] | 0) == (F | 0) : 0) {
                                                    R = N
                                                    Q = 26
                                                    break b
                                                }
                                                N = f[N >> 2] | 0
                                                if (!N) {
                                                    Q = 27
                                                    break
                                                }
                                            }
                                        } else {
                                            N = M
                                            while (1) {
                                                P = f[(N + 4) >> 2] | 0
                                                if ((P | 0) == (D | 0)) {
                                                    if ((f[(N + 8) >> 2] | 0) == (E | 0) ? (f[(N + 12) >> 2] | 0) == (F | 0) : 0) {
                                                        R = N
                                                        Q = 26
                                                        break b
                                                    }
                                                } else {
                                                    if (P >>> 0 < q >>> 0) S = P
                                                    else S = (P >>> 0) % (q >>> 0) | 0
                                                    if ((S | 0) != (K | 0)) {
                                                        Q = 27
                                                        break b
                                                    }
                                                }
                                                N = f[N >> 2] | 0
                                                if (!N) {
                                                    Q = 27
                                                    break
                                                }
                                            }
                                        }
                                    while (0)
                                    if ((Q | 0) == 26) {
                                        Q = 0
                                        f[(A + (y << 2)) >> 2] = f[(R + 16) >> 2]
                                        T = d
                                        U = z
                                        V = C
                                        X = B
                                        Y = A
                                        break a
                                    } else if ((Q | 0) == 27) {
                                        Q = 0
                                        if (G) {
                                            Z = 0
                                            Q = 46
                                            break a
                                        } else break
                                    }
                                }
                            while (0)
                            H = (q + -1) | 0
                            J = ((H & q) | 0) == 0
                            if (!J)
                                if (D >>> 0 < q >>> 0) _ = D
                                else _ = (D >>> 0) % (q >>> 0) | 0
                            else _ = H & D
                            L = f[((f[g >> 2] | 0) + (_ << 2)) >> 2] | 0
                            if ((L | 0) != 0 ? ((M = f[L >> 2] | 0), (M | 0) != 0) : 0) {
                                if (J) {
                                    J = M
                                    while (1) {
                                        L = f[(J + 4) >> 2] | 0
                                        if (!(((L | 0) == (D | 0)) | (((L & H) | 0) == (_ | 0)))) {
                                            Z = _
                                            Q = 46
                                            break a
                                        }
                                        if ((f[(J + 8) >> 2] | 0) == (E | 0) ? (f[(J + 12) >> 2] | 0) == (F | 0) : 0) {
                                            Q = 61
                                            break a
                                        }
                                        J = f[J >> 2] | 0
                                        if (!J) {
                                            Z = _
                                            Q = 46
                                            break a
                                        }
                                    }
                                } else aa = M
                                while (1) {
                                    J = f[(aa + 4) >> 2] | 0
                                    if ((J | 0) != (D | 0)) {
                                        if (J >>> 0 < q >>> 0) ba = J
                                        else ba = (J >>> 0) % (q >>> 0) | 0
                                        if ((ba | 0) != (_ | 0)) {
                                            Z = _
                                            Q = 46
                                            break a
                                        }
                                    }
                                    if ((f[(aa + 8) >> 2] | 0) == (E | 0) ? (f[(aa + 12) >> 2] | 0) == (F | 0) : 0) {
                                        Q = 61
                                        break a
                                    }
                                    aa = f[aa >> 2] | 0
                                    if (!aa) {
                                        Z = _
                                        Q = 46
                                        break
                                    }
                                }
                            } else {
                                Z = _
                                Q = 46
                            }
                        } else {
                            Z = 0
                            Q = 46
                        }
                    while (0)
                    if ((Q | 0) == 46) {
                        Q = 0
                        M = dn(20) | 0
                        J = (M + 8) | 0
                        f[J >> 2] = E
                        f[(J + 4) >> 2] = F
                        f[(M + 16) >> 2] = z
                        f[(M + 4) >> 2] = D
                        f[M >> 2] = 0
                        ca = $((((f[s >> 2] | 0) + 1) | 0) >>> 0)
                        da = $(q >>> 0)
                        ea = $(n[k >> 2])
                        do
                            if (G | ($(ea * da) < ca)) {
                                J = (q << 1) | (((q >>> 0 < 3) | ((((q + -1) & q) | 0) != 0)) & 1)
                                H = ~~$(W($(ca / ea))) >>> 0
                                Ih(g, J >>> 0 < H >>> 0 ? H : J)
                                J = f[m >> 2] | 0
                                H = (J + -1) | 0
                                if (!(H & J)) {
                                    fa = J
                                    ga = H & D
                                    break
                                }
                                if (D >>> 0 < J >>> 0) {
                                    fa = J
                                    ga = D
                                } else {
                                    fa = J
                                    ga = (D >>> 0) % (J >>> 0) | 0
                                }
                            } else {
                                fa = q
                                ga = Z
                            }
                        while (0)
                        D = ((f[g >> 2] | 0) + (ga << 2)) | 0
                        G = f[D >> 2] | 0
                        if (!G) {
                            f[M >> 2] = f[t >> 2]
                            f[t >> 2] = M
                            f[D >> 2] = t
                            D = f[M >> 2] | 0
                            if (D | 0) {
                                F = f[(D + 4) >> 2] | 0
                                D = (fa + -1) | 0
                                if (D & fa)
                                    if (F >>> 0 < fa >>> 0) ha = F
                                    else ha = (F >>> 0) % (fa >>> 0) | 0
                                else ha = F & D
                                ia = ((f[g >> 2] | 0) + (ha << 2)) | 0
                                Q = 59
                            }
                        } else {
                            f[M >> 2] = f[G >> 2]
                            ia = G
                            Q = 59
                        }
                        if ((Q | 0) == 59) {
                            Q = 0
                            f[ia >> 2] = M
                        }
                        f[s >> 2] = (f[s >> 2] | 0) + 1
                        Q = 61
                    }
                    if ((Q | 0) == 61) {
                        Q = 0
                        G = v
                        D = f[G >> 2] | 0
                        F = on(D | 0, f[(G + 4) >> 2] | 0, z | 0, 0) | 0
                        Rg(((f[f[w >> 2] >> 2] | 0) + F) | 0, i | 0, D | 0) | 0
                        D = f[j >> 2] | 0
                        f[(D + (y << 2)) >> 2] = z
                        T = D
                        U = (z + 1) | 0
                        V = D
                        X = D
                        Y = D
                    }
                    D = (y + 1) | 0
                    ja = f[l >> 2] | 0
                    if (D >>> 0 >= ja >>> 0) break
                    d = T
                    y = D
                    z = U
                    A = Y
                    B = X
                    C = V
                    q = f[m >> 2] | 0
                }
                if ((U | 0) == (ja | 0)) ka = X
                else {
                    X = (a + 84) | 0
                    if (!(b[X >> 0] | 0)) {
                        m = f[(a + 72) >> 2] | 0
                        q = f[(a + 68) >> 2] | 0
                        C = q
                        if ((m | 0) == (q | 0)) la = T
                        else {
                            B = (m - q) >> 2
                            q = 0
                            do {
                                m = (C + (q << 2)) | 0
                                f[m >> 2] = f[(V + (f[m >> 2] << 2)) >> 2]
                                q = (q + 1) | 0
                            } while (q >>> 0 < B >>> 0)
                            la = T
                        }
                    } else {
                        b[X >> 0] = 0
                        X = (a + 68) | 0
                        T = (a + 72) | 0
                        B = f[T >> 2] | 0
                        q = f[X >> 2] | 0
                        V = (B - q) >> 2
                        C = q
                        q = B
                        if (ja >>> 0 <= V >>> 0)
                            if (ja >>> 0 < V >>> 0 ? ((B = (C + (ja << 2)) | 0), (B | 0) != (q | 0)) : 0) {
                                f[T >> 2] = q + (~(((q + -4 - B) | 0) >>> 2) << 2)
                                ma = ja
                            } else ma = ja
                        else {
                            kh(X, (ja - V) | 0, 1204)
                            ma = f[l >> 2] | 0
                        }
                        V = f[j >> 2] | 0
                        if (!ma) la = V
                        else {
                            j = f[(a + 68) >> 2] | 0
                            a = 0
                            do {
                                f[(j + (a << 2)) >> 2] = f[(V + (a << 2)) >> 2]
                                a = (a + 1) | 0
                            } while (a >>> 0 < ma >>> 0)
                            la = V
                        }
                    }
                    f[l >> 2] = U
                    ka = la
                }
                if (!ka) na = U
                else {
                    la = f[o >> 2] | 0
                    if ((la | 0) != (ka | 0)) f[o >> 2] = la + (~(((la + -4 - ka) | 0) >>> 2) << 2)
                    br(ka)
                    na = U
                }
            } else na = 0
            U = f[(g + 8) >> 2] | 0
            if (U | 0) {
                ka = U
                do {
                    U = ka
                    ka = f[ka >> 2] | 0
                    br(U)
                } while ((ka | 0) != 0)
            }
            ka = f[g >> 2] | 0
            f[g >> 2] = 0
            if (!ka) {
                u = e
                return na | 0
            }
            br(ka)
            u = e
            return na | 0
        }
        function Yb(a, c, e) {
            a = a | 0
            c = c | 0
            e = e | 0
            var g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 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,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = Oa,
                fa = Oa,
                ga = Oa,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0
            g = u
            u = (u + 48) | 0
            i = (g + 12) | 0
            j = (g + 32) | 0
            k = g
            l = (i + 16) | 0
            f[i >> 2] = 0
            f[(i + 4) >> 2] = 0
            f[(i + 8) >> 2] = 0
            f[(i + 12) >> 2] = 0
            n[l >> 2] = $(1.0)
            m = (a + 80) | 0
            o = f[m >> 2] | 0
            f[k >> 2] = 0
            p = (k + 4) | 0
            f[p >> 2] = 0
            f[(k + 8) >> 2] = 0
            if (o) {
                if (o >>> 0 > 1073741823) mq(k)
                q = o << 2
                r = dn(q) | 0
                f[k >> 2] = r
                s = (r + (o << 2)) | 0
                f[(k + 8) >> 2] = s
                hj(r | 0, 0, q | 0) | 0
                f[p >> 2] = s
                s = (c + 48) | 0
                q = (c + 40) | 0
                o = (i + 4) | 0
                t = (i + 12) | 0
                v = (i + 8) | 0
                w = (a + 40) | 0
                x = (a + 64) | 0
                y = f[e >> 2] | 0
                e = r
                z = 0
                A = 0
                B = r
                C = r
                D = 0
                E = r
                while (1) {
                    r = s
                    F = f[r >> 2] | 0
                    G = f[(r + 4) >> 2] | 0
                    r = q
                    H = on(f[r >> 2] | 0, f[(r + 4) >> 2] | 0, (y + z) | 0, 0) | 0
                    r = Tn(H | 0, I | 0, F | 0, G | 0) | 0
                    G = ((f[f[c >> 2] >> 2] | 0) + r) | 0
                    r = h[G >> 0] | (h[(G + 1) >> 0] << 8)
                    d[j >> 1] = r
                    G = r & 255
                    F = (r & 65535) >>> 8
                    H = F & 255
                    J = ((((((r & 255) ^ 318) + 239) << 16) >> 16) ^ F) & 65535
                    F = (D | 0) == 0
                    a: do
                        if (!F) {
                            K = (D + -1) | 0
                            L = ((K & D) | 0) == 0
                            if (!L)
                                if (D >>> 0 > J >>> 0) M = J
                                else M = (J >>> 0) % (D >>> 0) | 0
                            else M = K & J
                            N = f[((f[i >> 2] | 0) + (M << 2)) >> 2] | 0
                            do
                                if (N | 0 ? ((O = f[N >> 2] | 0), O | 0) : 0) {
                                    b: do
                                        if (L) {
                                            P = O
                                            while (1) {
                                                Q = f[(P + 4) >> 2] | 0
                                                R = (Q | 0) == (J | 0)
                                                if (!(R | (((Q & K) | 0) == (M | 0)))) {
                                                    S = 27
                                                    break b
                                                }
                                                if ((R ? ((R = (P + 8) | 0), (b[R >> 0] | 0) == (G << 24) >> 24) : 0) ? (b[(R + 1) >> 0] | 0) == (H << 24) >> 24 : 0) {
                                                    T = P
                                                    S = 26
                                                    break b
                                                }
                                                P = f[P >> 2] | 0
                                                if (!P) {
                                                    S = 27
                                                    break
                                                }
                                            }
                                        } else {
                                            P = O
                                            while (1) {
                                                R = f[(P + 4) >> 2] | 0
                                                if ((R | 0) == (J | 0)) {
                                                    Q = (P + 8) | 0
                                                    if ((b[Q >> 0] | 0) == (G << 24) >> 24 ? (b[(Q + 1) >> 0] | 0) == (H << 24) >> 24 : 0) {
                                                        T = P
                                                        S = 26
                                                        break b
                                                    }
                                                } else {
                                                    if (R >>> 0 < D >>> 0) U = R
                                                    else U = (R >>> 0) % (D >>> 0) | 0
                                                    if ((U | 0) != (M | 0)) {
                                                        S = 27
                                                        break b
                                                    }
                                                }
                                                P = f[P >> 2] | 0
                                                if (!P) {
                                                    S = 27
                                                    break
                                                }
                                            }
                                        }
                                    while (0)
                                    if ((S | 0) == 26) {
                                        S = 0
                                        f[(E + (z << 2)) >> 2] = f[(T + 12) >> 2]
                                        V = e
                                        X = A
                                        Y = C
                                        Z = B
                                        _ = E
                                        break a
                                    } else if ((S | 0) == 27) {
                                        S = 0
                                        if (F) {
                                            aa = 0
                                            S = 46
                                            break a
                                        } else break
                                    }
                                }
                            while (0)
                            K = (D + -1) | 0
                            L = ((K & D) | 0) == 0
                            if (!L)
                                if (D >>> 0 > J >>> 0) ba = J
                                else ba = (J >>> 0) % (D >>> 0) | 0
                            else ba = K & J
                            N = f[((f[i >> 2] | 0) + (ba << 2)) >> 2] | 0
                            if ((N | 0) != 0 ? ((O = f[N >> 2] | 0), (O | 0) != 0) : 0) {
                                if (L) {
                                    L = O
                                    while (1) {
                                        N = f[(L + 4) >> 2] | 0
                                        if (!(((N | 0) == (J | 0)) | (((N & K) | 0) == (ba | 0)))) {
                                            aa = ba
                                            S = 46
                                            break a
                                        }
                                        N = (L + 8) | 0
                                        if ((b[N >> 0] | 0) == (G << 24) >> 24 ? (b[(N + 1) >> 0] | 0) == (H << 24) >> 24 : 0) {
                                            S = 61
                                            break a
                                        }
                                        L = f[L >> 2] | 0
                                        if (!L) {
                                            aa = ba
                                            S = 46
                                            break a
                                        }
                                    }
                                } else ca = O
                                while (1) {
                                    L = f[(ca + 4) >> 2] | 0
                                    if ((L | 0) != (J | 0)) {
                                        if (L >>> 0 < D >>> 0) da = L
                                        else da = (L >>> 0) % (D >>> 0) | 0
                                        if ((da | 0) != (ba | 0)) {
                                            aa = ba
                                            S = 46
                                            break a
                                        }
                                    }
                                    L = (ca + 8) | 0
                                    if ((b[L >> 0] | 0) == (G << 24) >> 24 ? (b[(L + 1) >> 0] | 0) == (H << 24) >> 24 : 0) {
                                        S = 61
                                        break a
                                    }
                                    ca = f[ca >> 2] | 0
                                    if (!ca) {
                                        aa = ba
                                        S = 46
                                        break
                                    }
                                }
                            } else {
                                aa = ba
                                S = 46
                            }
                        } else {
                            aa = 0
                            S = 46
                        }
                    while (0)
                    if ((S | 0) == 46) {
                        S = 0
                        H = dn(16) | 0
                        G = (H + 8) | 0
                        b[G >> 0] = r
                        b[(G + 1) >> 0] = r >> 8
                        f[(H + 12) >> 2] = A
                        f[(H + 4) >> 2] = J
                        f[H >> 2] = 0
                        ea = $((((f[t >> 2] | 0) + 1) | 0) >>> 0)
                        fa = $(D >>> 0)
                        ga = $(n[l >> 2])
                        do
                            if (F | ($(ga * fa) < ea)) {
                                G = (D << 1) | (((D >>> 0 < 3) | ((((D + -1) & D) | 0) != 0)) & 1)
                                O = ~~$(W($(ea / ga))) >>> 0
                                Lh(i, G >>> 0 < O >>> 0 ? O : G)
                                G = f[o >> 2] | 0
                                O = (G + -1) | 0
                                if (!(O & G)) {
                                    ha = G
                                    ia = O & J
                                    break
                                }
                                if (G >>> 0 > J >>> 0) {
                                    ha = G
                                    ia = J
                                } else {
                                    ha = G
                                    ia = (J >>> 0) % (G >>> 0) | 0
                                }
                            } else {
                                ha = D
                                ia = aa
                            }
                        while (0)
                        J = ((f[i >> 2] | 0) + (ia << 2)) | 0
                        F = f[J >> 2] | 0
                        if (!F) {
                            f[H >> 2] = f[v >> 2]
                            f[v >> 2] = H
                            f[J >> 2] = v
                            J = f[H >> 2] | 0
                            if (J | 0) {
                                r = f[(J + 4) >> 2] | 0
                                J = (ha + -1) | 0
                                if (J & ha)
                                    if (r >>> 0 < ha >>> 0) ja = r
                                    else ja = (r >>> 0) % (ha >>> 0) | 0
                                else ja = r & J
                                ka = ((f[i >> 2] | 0) + (ja << 2)) | 0
                                S = 59
                            }
                        } else {
                            f[H >> 2] = f[F >> 2]
                            ka = F
                            S = 59
                        }
                        if ((S | 0) == 59) {
                            S = 0
                            f[ka >> 2] = H
                        }
                        f[t >> 2] = (f[t >> 2] | 0) + 1
                        S = 61
                    }
                    if ((S | 0) == 61) {
                        S = 0
                        F = w
                        J = f[F >> 2] | 0
                        r = on(J | 0, f[(F + 4) >> 2] | 0, A | 0, 0) | 0
                        Rg(((f[f[x >> 2] >> 2] | 0) + r) | 0, j | 0, J | 0) | 0
                        J = f[k >> 2] | 0
                        f[(J + (z << 2)) >> 2] = A
                        V = J
                        X = (A + 1) | 0
                        Y = J
                        Z = J
                        _ = J
                    }
                    J = (z + 1) | 0
                    la = f[m >> 2] | 0
                    if (J >>> 0 >= la >>> 0) break
                    e = V
                    z = J
                    A = X
                    B = Z
                    C = Y
                    D = f[o >> 2] | 0
                    E = _
                }
                if ((X | 0) == (la | 0)) ma = Z
                else {
                    Z = (a + 84) | 0
                    if (!(b[Z >> 0] | 0)) {
                        _ = f[(a + 72) >> 2] | 0
                        E = f[(a + 68) >> 2] | 0
                        o = E
                        if ((_ | 0) == (E | 0)) na = V
                        else {
                            D = (_ - E) >> 2
                            E = 0
                            do {
                                _ = (o + (E << 2)) | 0
                                f[_ >> 2] = f[(Y + (f[_ >> 2] << 2)) >> 2]
                                E = (E + 1) | 0
                            } while (E >>> 0 < D >>> 0)
                            na = V
                        }
                    } else {
                        b[Z >> 0] = 0
                        Z = (a + 68) | 0
                        V = (a + 72) | 0
                        D = f[V >> 2] | 0
                        E = f[Z >> 2] | 0
                        Y = (D - E) >> 2
                        o = E
                        E = D
                        if (la >>> 0 <= Y >>> 0)
                            if (la >>> 0 < Y >>> 0 ? ((D = (o + (la << 2)) | 0), (D | 0) != (E | 0)) : 0) {
                                f[V >> 2] = E + (~(((E + -4 - D) | 0) >>> 2) << 2)
                                oa = la
                            } else oa = la
                        else {
                            kh(Z, (la - Y) | 0, 1204)
                            oa = f[m >> 2] | 0
                        }
                        Y = f[k >> 2] | 0
                        if (!oa) na = Y
                        else {
                            k = f[(a + 68) >> 2] | 0
                            a = 0
                            do {
                                f[(k + (a << 2)) >> 2] = f[(Y + (a << 2)) >> 2]
                                a = (a + 1) | 0
                            } while (a >>> 0 < oa >>> 0)
                            na = Y
                        }
                    }
                    f[m >> 2] = X
                    ma = na
                }
                if (!ma) pa = X
                else {
                    na = f[p >> 2] | 0
                    if ((na | 0) != (ma | 0)) f[p >> 2] = na + (~(((na + -4 - ma) | 0) >>> 2) << 2)
                    br(ma)
                    pa = X
                }
            } else pa = 0
            X = f[(i + 8) >> 2] | 0
            if (X | 0) {
                ma = X
                do {
                    X = ma
                    ma = f[ma >> 2] | 0
                    br(X)
                } while ((ma | 0) != 0)
            }
            ma = f[i >> 2] | 0
            f[i >> 2] = 0
            if (!ma) {
                u = g
                return pa | 0
            }
            br(ma)
            u = g
            return pa | 0
        }
        function Zb(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0
            c = u
            u = (u + 16) | 0
            d = (c + 8) | 0
            e = c
            g = (c + 4) | 0
            h = (a + 16) | 0
            i = f[h >> 2] | 0
            j = (a + 20) | 0
            k = f[j >> 2] | 0
            if ((k | 0) == (i | 0)) l = i
            else {
                m = (k + (~(((k + -4 - i) | 0) >>> 2) << 2)) | 0
                f[j >> 2] = m
                l = m
            }
            m = (a + 24) | 0
            if ((l | 0) == (f[m >> 2] | 0)) {
                Ci(h, b)
                n = f[h >> 2] | 0
                o = f[j >> 2] | 0
            } else {
                f[l >> 2] = f[b >> 2]
                k = (l + 4) | 0
                f[j >> 2] = k
                n = i
                o = k
            }
            k = f[(a + 8) >> 2] | 0
            i = ((f[(k + 100) >> 2] | 0) - (f[(k + 96) >> 2] | 0)) | 0
            k = ((i | 0) / 12) | 0
            if ((n | 0) == (o | 0)) {
                u = c
                return 1
            }
            n = (a + 28) | 0
            l = (i | 0) > 0
            i = (a + 164) | 0
            p = (a + 12) | 0
            q = (a + 76) | 0
            r = (a + 80) | 0
            s = (a + 72) | 0
            t = (a + 200) | 0
            v = (a + 320) | 0
            w = (a + 152) | 0
            x = (a + 84) | 0
            y = (a + 324) | 0
            z = (a + 292) | 0
            A = (a + 304) | 0
            B = (a + 316) | 0
            C = (a + 328) | 0
            D = (a + 336) | 0
            E = (a + 332) | 0
            F = (a + 168) | 0
            G = (a + 140) | 0
            H = (a + 120) | 0
            I = o
            do {
                o = f[(I + -4) >> 2] | 0
                f[b >> 2] = o
                a: do
                    if ((o | 0) != -1 ? ((J = ((o >>> 0) / 3) | 0), (K = f[n >> 2] | 0), ((f[(K + ((J >>> 5) << 2)) >> 2] & (1 << (J & 31))) | 0) == 0) : 0) {
                        if (l) {
                            J = 0
                            L = K
                            b: while (1) {
                                K = (J + 1) | 0
                                f[i >> 2] = (f[i >> 2] | 0) + 1
                                M = f[b >> 2] | 0
                                N = (M | 0) == -1 ? -1 : ((M >>> 0) / 3) | 0
                                M = (L + ((N >>> 5) << 2)) | 0
                                f[M >> 2] = (1 << (N & 31)) | f[M >> 2]
                                M = f[q >> 2] | 0
                                if ((M | 0) == (f[r >> 2] | 0)) Ci(s, b)
                                else {
                                    f[M >> 2] = f[b >> 2]
                                    f[q >> 2] = M + 4
                                }
                                f[v >> 2] = f[b >> 2]
                                M = f[b >> 2] | 0
                                if ((M | 0) == -1) O = -1
                                else O = f[((f[f[p >> 2] >> 2] | 0) + (M << 2)) >> 2] | 0
                                P = (f[((f[w >> 2] | 0) + (O << 2)) >> 2] | 0) != -1
                                Q = ((f[x >> 2] | 0) + ((O >>> 5) << 2)) | 0
                                R = 1 << (O & 31)
                                S = f[Q >> 2] | 0
                                do
                                    if (!(S & R)) {
                                        f[Q >> 2] = S | R
                                        if (P) {
                                            T = f[b >> 2] | 0
                                            U = 38
                                            break
                                        }
                                        f[y >> 2] = (f[y >> 2] | 0) + 1
                                        V = f[v >> 2] | 0
                                        W = (V + 1) | 0
                                        do
                                            if ((V | 0) != -1) {
                                                X = ((W >>> 0) % 3 | 0 | 0) == 0 ? (V + -2) | 0 : W
                                                if (!((V >>> 0) % 3 | 0)) {
                                                    Y = (V + 2) | 0
                                                    Z = X
                                                    break
                                                } else {
                                                    Y = (V + -1) | 0
                                                    Z = X
                                                    break
                                                }
                                            } else {
                                                Y = -1
                                                Z = -1
                                            }
                                        while (0)
                                        V = f[z >> 2] | 0
                                        W = f[A >> 2] | 0
                                        X = (W + (f[(V + (Z << 2)) >> 2] << 2)) | 0
                                        _ = f[X >> 2] | 0
                                        f[X >> 2] = _ + -1
                                        X = (W + (f[(V + (Y << 2)) >> 2] << 2)) | 0
                                        f[X >> 2] = (f[X >> 2] | 0) + -1
                                        X = f[B >> 2] | 0
                                        if ((X | 0) != -1) {
                                            V = f[C >> 2] | 0
                                            if ((_ | 0) < (V | 0)) $ = V
                                            else {
                                                W = f[E >> 2] | 0
                                                $ = (_ | 0) > (W | 0) ? W : _
                                            }
                                            _ = ($ - V) | 0
                                            V = f[D >> 2] | 0
                                            W = f[(3384 + (X << 2)) >> 2] | 0
                                            f[d >> 2] = W
                                            X = (V + ((_ * 12) | 0) + 4) | 0
                                            aa = f[X >> 2] | 0
                                            if (aa >>> 0 < (f[(V + ((_ * 12) | 0) + 8) >> 2] | 0) >>> 0) {
                                                f[aa >> 2] = W
                                                f[X >> 2] = aa + 4
                                            } else Ci((V + ((_ * 12) | 0)) | 0, d)
                                        }
                                        f[B >> 2] = 0
                                        _ = f[b >> 2] | 0
                                        V = (_ + 1) | 0
                                        if ((_ | 0) != -1 ? ((aa = ((V >>> 0) % 3 | 0 | 0) == 0 ? (_ + -2) | 0 : V), (aa | 0) != -1) : 0)
                                            ba = f[((f[((f[p >> 2] | 0) + 12) >> 2] | 0) + (aa << 2)) >> 2] | 0
                                        else ba = -1
                                        f[b >> 2] = ba
                                    } else {
                                        T = M
                                        U = 38
                                    }
                                while (0)
                                if ((U | 0) == 38) {
                                    U = 0
                                    M = (T + 1) | 0
                                    if ((T | 0) == -1) {
                                        U = 43
                                        break
                                    }
                                    R = ((M >>> 0) % 3 | 0 | 0) == 0 ? (T + -2) | 0 : M
                                    if ((R | 0) == -1) ca = -1
                                    else ca = f[((f[((f[p >> 2] | 0) + 12) >> 2] | 0) + (R << 2)) >> 2] | 0
                                    f[e >> 2] = ca
                                    R = ((((T >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + T) | 0
                                    if ((R | 0) == -1) da = -1
                                    else da = f[((f[((f[p >> 2] | 0) + 12) >> 2] | 0) + (R << 2)) >> 2] | 0
                                    R = (ca | 0) == -1
                                    S = R ? -1 : ((ca >>> 0) / 3) | 0
                                    ea = (da | 0) == -1
                                    fa = ea ? -1 : ((da >>> 0) / 3) | 0
                                    Q = ((M >>> 0) % 3 | 0 | 0) == 0 ? (T + -2) | 0 : M
                                    if (
                                        ((Q | 0) != -1 ? ((M = f[((f[p >> 2] | 0) + 12) >> 2] | 0), (aa = f[(M + (Q << 2)) >> 2] | 0), (aa | 0) != -1) : 0)
                                            ? ((Q = ((aa >>> 0) / 3) | 0), (aa = f[n >> 2] | 0), ((f[(aa + ((Q >>> 5) << 2)) >> 2] & (1 << (Q & 31))) | 0) == 0)
                                            : 0
                                    ) {
                                        Q = ((((T >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + T) | 0
                                        do
                                            if ((Q | 0) != -1) {
                                                V = f[(M + (Q << 2)) >> 2] | 0
                                                if ((V | 0) == -1) break
                                                _ = ((V >>> 0) / 3) | 0
                                                if (!(f[(aa + ((_ >>> 5) << 2)) >> 2] & (1 << (_ & 31)))) {
                                                    U = 62
                                                    break b
                                                }
                                            }
                                        while (0)
                                        if (!ea) jf(a, f[i >> 2] | 0, N, 0, fa)
                                        hd(t, 3)
                                        ga = f[e >> 2] | 0
                                    } else {
                                        if (!R) {
                                            jf(a, f[i >> 2] | 0, N, 1, S)
                                            aa = f[b >> 2] | 0
                                            if ((aa | 0) == -1) {
                                                U = 52
                                                break
                                            } else ha = aa
                                        } else ha = T
                                        aa = ((((ha >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + ha) | 0
                                        if ((aa | 0) == -1) {
                                            U = 52
                                            break
                                        }
                                        Q = f[((f[((f[p >> 2] | 0) + 12) >> 2] | 0) + (aa << 2)) >> 2] | 0
                                        if ((Q | 0) == -1) {
                                            U = 52
                                            break
                                        }
                                        aa = ((Q >>> 0) / 3) | 0
                                        if ((f[((f[n >> 2] | 0) + ((aa >>> 5) << 2)) >> 2] & (1 << (aa & 31))) | 0) {
                                            U = 52
                                            break
                                        }
                                        hd(t, 5)
                                        ga = da
                                    }
                                    f[b >> 2] = ga
                                }
                                if ((K | 0) >= (k | 0)) break a
                                J = K
                                L = f[n >> 2] | 0
                            }
                            do
                                if ((U | 0) == 43) {
                                    U = 0
                                    f[e >> 2] = -1
                                    U = 54
                                } else if ((U | 0) == 52) {
                                    U = 0
                                    if (ea) U = 54
                                    else {
                                        jf(a, f[i >> 2] | 0, N, 0, fa)
                                        U = 54
                                    }
                                } else if ((U | 0) == 62) {
                                    U = 0
                                    hd(t, 1)
                                    f[F >> 2] = (f[F >> 2] | 0) + 1
                                    if (P ? ((L = f[((f[w >> 2] | 0) + (O << 2)) >> 2] | 0), (((1 << (L & 31)) & f[((f[G >> 2] | 0) + ((L >>> 5) << 2)) >> 2]) | 0) == 0) : 0) {
                                        f[g >> 2] = f[b >> 2]
                                        f[d >> 2] = f[g >> 2]
                                        Ce(a, d, 0) | 0
                                    }
                                    L = f[i >> 2] | 0
                                    f[d >> 2] = N
                                    J = Sd(H, d) | 0
                                    f[J >> 2] = L
                                    L = f[j >> 2] | 0
                                    f[(L + -4) >> 2] = da
                                    if ((L | 0) == (f[m >> 2] | 0)) {
                                        Ci(h, e)
                                        break
                                    } else {
                                        f[L >> 2] = f[e >> 2]
                                        f[j >> 2] = L + 4
                                        break
                                    }
                                }
                            while (0)
                            if ((U | 0) == 54) {
                                U = 0
                                hd(t, 7)
                                f[j >> 2] = (f[j >> 2] | 0) + -4
                            }
                        }
                    } else U = 11
                while (0)
                if ((U | 0) == 11) {
                    U = 0
                    f[j >> 2] = I + -4
                }
                I = f[j >> 2] | 0
            } while ((f[h >> 2] | 0) != (I | 0))
            u = c
            return 1
        }
        function _b(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                I = 0,
                J = Oa,
                K = Oa,
                L = Oa,
                M = 0,
                N = 0,
                O = 0,
                P = 0
            e = u
            u = (u + 64) | 0
            g = (e + 40) | 0
            i = (e + 16) | 0
            j = e
            k = xd(a, c) | 0
            if (k | 0) {
                f[i >> 2] = k
                f[g >> 2] = f[i >> 2]
                Xe(a, g) | 0
            }
            f[j >> 2] = 0
            k = (j + 4) | 0
            f[k >> 2] = 0
            f[(j + 8) >> 2] = 0
            ri(j, 8)
            l = d
            d = l
            m = h[d >> 0] | (h[(d + 1) >> 0] << 8) | (h[(d + 2) >> 0] << 16) | (h[(d + 3) >> 0] << 24)
            d = (l + 4) | 0
            l = h[d >> 0] | (h[(d + 1) >> 0] << 8) | (h[(d + 2) >> 0] << 16) | (h[(d + 3) >> 0] << 24)
            d = f[j >> 2] | 0
            o = d
            b[o >> 0] = m
            b[(o + 1) >> 0] = m >> 8
            b[(o + 2) >> 0] = m >> 16
            b[(o + 3) >> 0] = m >> 24
            m = (d + 4) | 0
            b[m >> 0] = l
            b[(m + 1) >> 0] = l >> 8
            b[(m + 2) >> 0] = l >> 16
            b[(m + 3) >> 0] = l >> 24
            dj(i, c)
            c = (i + 12) | 0
            f[c >> 2] = 0
            l = (i + 16) | 0
            f[l >> 2] = 0
            f[(i + 20) >> 2] = 0
            m = f[k >> 2] | 0
            d = f[j >> 2] | 0
            o = (m - d) | 0
            if (!o) {
                p = d
                q = m
                r = 0
            } else {
                ri(c, o)
                p = f[j >> 2] | 0
                q = f[k >> 2] | 0
                r = f[c >> 2] | 0
            }
            Rg(r | 0, p | 0, (q - p) | 0) | 0
            p = (i + 11) | 0
            q = b[p >> 0] | 0
            r = (q << 24) >> 24 < 0
            c = r ? f[i >> 2] | 0 : i
            o = r ? f[(i + 4) >> 2] | 0 : q & 255
            if (o >>> 0 > 3) {
                q = c
                r = o
                m = o
                while (1) {
                    d = X(h[q >> 0] | (h[(q + 1) >> 0] << 8) | (h[(q + 2) >> 0] << 16) | (h[(q + 3) >> 0] << 24), 1540483477) | 0
                    r = (X((d >>> 24) ^ d, 1540483477) | 0) ^ (X(r, 1540483477) | 0)
                    m = (m + -4) | 0
                    if (m >>> 0 <= 3) break
                    else q = (q + 4) | 0
                }
                q = (o + -4) | 0
                m = q & -4
                s = (q - m) | 0
                t = (c + (m + 4)) | 0
                v = r
            } else {
                s = o
                t = c
                v = o
            }
            switch (s | 0) {
                case 3: {
                    w = (h[(t + 2) >> 0] << 16) ^ v
                    x = 10
                    break
                }
                case 2: {
                    w = v
                    x = 10
                    break
                }
                case 1: {
                    y = v
                    x = 11
                    break
                }
                default:
                    z = v
            }
            if ((x | 0) == 10) {
                y = (h[(t + 1) >> 0] << 8) ^ w
                x = 11
            }
            if ((x | 0) == 11) z = X(y ^ h[t >> 0], 1540483477) | 0
            t = X((z >>> 13) ^ z, 1540483477) | 0
            z = (t >>> 15) ^ t
            t = (a + 4) | 0
            y = f[t >> 2] | 0
            w = (y | 0) == 0
            a: do
                if (!w) {
                    v = (y + -1) | 0
                    s = ((v & y) | 0) == 0
                    if (!s)
                        if (z >>> 0 < y >>> 0) A = z
                        else A = (z >>> 0) % (y >>> 0) | 0
                    else A = z & v
                    r = f[((f[a >> 2] | 0) + (A << 2)) >> 2] | 0
                    if ((r | 0) != 0 ? ((m = f[r >> 2] | 0), (m | 0) != 0) : 0) {
                        r = (o | 0) == 0
                        if (s) {
                            if (r) {
                                s = m
                                while (1) {
                                    q = f[(s + 4) >> 2] | 0
                                    if (!(((q | 0) == (z | 0)) | (((q & v) | 0) == (A | 0)))) {
                                        B = A
                                        x = 52
                                        break a
                                    }
                                    q = b[(s + 8 + 11) >> 0] | 0
                                    if (!(((q << 24) >> 24 < 0 ? f[(s + 12) >> 2] | 0 : q & 255) | 0)) break a
                                    s = f[s >> 2] | 0
                                    if (!s) {
                                        B = A
                                        x = 52
                                        break a
                                    }
                                }
                            } else C = m
                            while (1) {
                                s = f[(C + 4) >> 2] | 0
                                if (!(((s | 0) == (z | 0)) | (((s & v) | 0) == (A | 0)))) {
                                    B = A
                                    x = 52
                                    break a
                                }
                                s = (C + 8) | 0
                                q = b[(s + 11) >> 0] | 0
                                d = (q << 24) >> 24 < 0
                                D = q & 255
                                do
                                    if (((d ? f[(C + 12) >> 2] | 0 : D) | 0) == (o | 0)) {
                                        q = f[s >> 2] | 0
                                        if (d)
                                            if (!(Pk(q, c, o) | 0)) break a
                                            else break
                                        if ((b[c >> 0] | 0) == ((q & 255) << 24) >> 24) {
                                            q = s
                                            E = D
                                            F = c
                                            do {
                                                E = (E + -1) | 0
                                                q = (q + 1) | 0
                                                if (!E) break a
                                                F = (F + 1) | 0
                                            } while ((b[q >> 0] | 0) == (b[F >> 0] | 0))
                                        }
                                    }
                                while (0)
                                C = f[C >> 2] | 0
                                if (!C) {
                                    B = A
                                    x = 52
                                    break a
                                }
                            }
                        }
                        if (r) {
                            v = m
                            while (1) {
                                D = f[(v + 4) >> 2] | 0
                                if ((D | 0) != (z | 0)) {
                                    if (D >>> 0 < y >>> 0) G = D
                                    else G = (D >>> 0) % (y >>> 0) | 0
                                    if ((G | 0) != (A | 0)) {
                                        B = A
                                        x = 52
                                        break a
                                    }
                                }
                                D = b[(v + 8 + 11) >> 0] | 0
                                if (!(((D << 24) >> 24 < 0 ? f[(v + 12) >> 2] | 0 : D & 255) | 0)) break a
                                v = f[v >> 2] | 0
                                if (!v) {
                                    B = A
                                    x = 52
                                    break a
                                }
                            }
                        } else H = m
                        while (1) {
                            v = f[(H + 4) >> 2] | 0
                            if ((v | 0) != (z | 0)) {
                                if (v >>> 0 < y >>> 0) I = v
                                else I = (v >>> 0) % (y >>> 0) | 0
                                if ((I | 0) != (A | 0)) {
                                    B = A
                                    x = 52
                                    break a
                                }
                            }
                            v = (H + 8) | 0
                            r = b[(v + 11) >> 0] | 0
                            D = (r << 24) >> 24 < 0
                            s = r & 255
                            do
                                if (((D ? f[(H + 12) >> 2] | 0 : s) | 0) == (o | 0)) {
                                    r = f[v >> 2] | 0
                                    if (D)
                                        if (!(Pk(r, c, o) | 0)) break a
                                        else break
                                    if ((b[c >> 0] | 0) == ((r & 255) << 24) >> 24) {
                                        r = v
                                        d = s
                                        F = c
                                        do {
                                            d = (d + -1) | 0
                                            r = (r + 1) | 0
                                            if (!d) break a
                                            F = (F + 1) | 0
                                        } while ((b[r >> 0] | 0) == (b[F >> 0] | 0))
                                    }
                                }
                            while (0)
                            H = f[H >> 2] | 0
                            if (!H) {
                                B = A
                                x = 52
                                break
                            }
                        }
                    } else {
                        B = A
                        x = 52
                    }
                } else {
                    B = 0
                    x = 52
                }
            while (0)
            if ((x | 0) == 52) {
                _h(g, a, z, i)
                x = (a + 12) | 0
                J = $((((f[x >> 2] | 0) + 1) | 0) >>> 0)
                K = $(y >>> 0)
                L = $(n[(a + 16) >> 2])
                do
                    if (w | ($(L * K) < J)) {
                        A = (y << 1) | (((y >>> 0 < 3) | ((((y + -1) & y) | 0) != 0)) & 1)
                        H = ~~$(W($(J / L))) >>> 0
                        Ph(a, A >>> 0 < H >>> 0 ? H : A)
                        A = f[t >> 2] | 0
                        H = (A + -1) | 0
                        if (!(H & A)) {
                            M = A
                            N = H & z
                            break
                        }
                        if (z >>> 0 < A >>> 0) {
                            M = A
                            N = z
                        } else {
                            M = A
                            N = (z >>> 0) % (A >>> 0) | 0
                        }
                    } else {
                        M = y
                        N = B
                    }
                while (0)
                B = f[((f[a >> 2] | 0) + (N << 2)) >> 2] | 0
                if (!B) {
                    y = (a + 8) | 0
                    f[f[g >> 2] >> 2] = f[y >> 2]
                    f[y >> 2] = f[g >> 2]
                    f[((f[a >> 2] | 0) + (N << 2)) >> 2] = y
                    y = f[g >> 2] | 0
                    N = f[y >> 2] | 0
                    if (!N) O = g
                    else {
                        z = f[(N + 4) >> 2] | 0
                        N = (M + -1) | 0
                        if (N & M)
                            if (z >>> 0 < M >>> 0) P = z
                            else P = (z >>> 0) % (M >>> 0) | 0
                        else P = z & N
                        f[((f[a >> 2] | 0) + (P << 2)) >> 2] = y
                        O = g
                    }
                } else {
                    f[f[g >> 2] >> 2] = f[B >> 2]
                    f[B >> 2] = f[g >> 2]
                    O = g
                }
                f[x >> 2] = (f[x >> 2] | 0) + 1
                f[O >> 2] = 0
            }
            O = f[(i + 12) >> 2] | 0
            if (O | 0) {
                if ((f[l >> 2] | 0) != (O | 0)) f[l >> 2] = O
                br(O)
            }
            if ((b[p >> 0] | 0) < 0) br(f[i >> 2] | 0)
            i = f[j >> 2] | 0
            if (!i) {
                u = e
                return
            }
            if ((f[k >> 2] | 0) != (i | 0)) f[k >> 2] = i
            br(i)
            u = e
            return
        }
        function $b(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 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,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0,
                ua = 0,
                va = 0,
                wa = 0,
                xa = 0,
                ya = 0,
                za = 0
            e = u
            u = (u + 96) | 0
            g = (e + 92) | 0
            h = (e + 88) | 0
            i = (e + 72) | 0
            j = (e + 48) | 0
            k = (e + 24) | 0
            l = e
            m = (a + 16) | 0
            n = f[m >> 2] | 0
            o = f[c >> 2] | 0
            f[i >> 2] = n
            f[(i + 4) >> 2] = o
            c = (i + 8) | 0
            f[c >> 2] = o
            b[(i + 12) >> 0] = 1
            p = (o | 0) == -1
            if (p) q = -1
            else q = f[((f[n >> 2] | 0) + (o << 2)) >> 2] | 0
            n = (a + 20) | 0
            r = f[n >> 2] | 0
            s = f[r >> 2] | 0
            if ((((f[(r + 4) >> 2] | 0) - s) >> 2) >>> 0 <= q >>> 0) mq(r)
            r = (a + 8) | 0
            t = f[((f[r >> 2] | 0) + (f[(s + (q << 2)) >> 2] << 2)) >> 2] | 0
            q = (a + 4) | 0
            s = f[q >> 2] | 0
            if (!(b[(s + 84) >> 0] | 0)) v = f[((f[(s + 68) >> 2] | 0) + (t << 2)) >> 2] | 0
            else v = t
            f[j >> 2] = 0
            f[(j + 4) >> 2] = 0
            f[(j + 8) >> 2] = 0
            f[(j + 12) >> 2] = 0
            f[(j + 16) >> 2] = 0
            f[(j + 20) >> 2] = 0
            f[h >> 2] = v
            v = b[(s + 24) >> 0] | 0
            f[g >> 2] = f[h >> 2]
            ub(s, g, v, j) | 0
            v = (a + 28) | 0
            a = (f[v >> 2] | 0) == 0
            a: do
                if (!p) {
                    s = (k + 8) | 0
                    t = (j + 8) | 0
                    w = (k + 16) | 0
                    x = (j + 16) | 0
                    y = (l + 8) | 0
                    z = (l + 16) | 0
                    A = o
                    B = o
                    C = 0
                    D = 0
                    E = 0
                    F = 0
                    G = 0
                    H = 0
                    J = a
                    K = o
                    while (1) {
                        do
                            if (J) {
                                L = (K + 1) | 0
                                if ((K | 0) == -1) {
                                    M = A
                                    N = -1
                                    O = -1
                                    P = -1
                                    break
                                }
                                Q = ((L >>> 0) % 3 | 0 | 0) == 0 ? (K + -2) | 0 : L
                                if ((A | 0) != -1)
                                    if (!((A >>> 0) % 3 | 0)) {
                                        R = A
                                        S = (A + 2) | 0
                                        T = Q
                                        U = A
                                        V = 19
                                        break
                                    } else {
                                        R = A
                                        S = (A + -1) | 0
                                        T = Q
                                        U = A
                                        V = 19
                                        break
                                    }
                                else {
                                    R = -1
                                    S = -1
                                    T = Q
                                    U = -1
                                    V = 19
                                }
                            } else {
                                Q = (B + 1) | 0
                                L = ((Q >>> 0) % 3 | 0 | 0) == 0 ? (B + -2) | 0 : Q
                                if (!((B >>> 0) % 3 | 0)) {
                                    R = A
                                    S = (B + 2) | 0
                                    T = L
                                    U = K
                                    V = 19
                                    break
                                } else {
                                    R = A
                                    S = (B + -1) | 0
                                    T = L
                                    U = K
                                    V = 19
                                    break
                                }
                            }
                        while (0)
                        if ((V | 0) == 19) {
                            V = 0
                            if ((T | 0) == -1) {
                                M = R
                                N = -1
                                O = S
                                P = U
                            } else {
                                M = R
                                N = f[((f[f[m >> 2] >> 2] | 0) + (T << 2)) >> 2] | 0
                                O = S
                                P = U
                            }
                        }
                        W = f[n >> 2] | 0
                        L = f[W >> 2] | 0
                        if ((((f[(W + 4) >> 2] | 0) - L) >> 2) >>> 0 <= N >>> 0) {
                            V = 22
                            break
                        }
                        Q = f[((f[r >> 2] | 0) + (f[(L + (N << 2)) >> 2] << 2)) >> 2] | 0
                        L = f[q >> 2] | 0
                        if (!(b[(L + 84) >> 0] | 0)) X = f[((f[(L + 68) >> 2] | 0) + (Q << 2)) >> 2] | 0
                        else X = Q
                        f[k >> 2] = 0
                        f[(k + 4) >> 2] = 0
                        f[(k + 8) >> 2] = 0
                        f[(k + 12) >> 2] = 0
                        f[(k + 16) >> 2] = 0
                        f[(k + 20) >> 2] = 0
                        f[h >> 2] = X
                        Q = b[(L + 24) >> 0] | 0
                        f[g >> 2] = f[h >> 2]
                        ub(L, g, Q, k) | 0
                        if ((O | 0) == -1) Y = -1
                        else Y = f[((f[f[m >> 2] >> 2] | 0) + (O << 2)) >> 2] | 0
                        Z = f[n >> 2] | 0
                        Q = f[Z >> 2] | 0
                        if ((((f[(Z + 4) >> 2] | 0) - Q) >> 2) >>> 0 <= Y >>> 0) {
                            V = 28
                            break
                        }
                        L = f[((f[r >> 2] | 0) + (f[(Q + (Y << 2)) >> 2] << 2)) >> 2] | 0
                        Q = f[q >> 2] | 0
                        if (!(b[(Q + 84) >> 0] | 0)) _ = f[((f[(Q + 68) >> 2] | 0) + (L << 2)) >> 2] | 0
                        else _ = L
                        f[l >> 2] = 0
                        f[(l + 4) >> 2] = 0
                        f[(l + 8) >> 2] = 0
                        f[(l + 12) >> 2] = 0
                        f[(l + 16) >> 2] = 0
                        f[(l + 20) >> 2] = 0
                        f[h >> 2] = _
                        L = b[(Q + 24) >> 0] | 0
                        f[g >> 2] = f[h >> 2]
                        ub(Q, g, L, l) | 0
                        L = k
                        Q = j
                        $ = f[Q >> 2] | 0
                        aa = f[(Q + 4) >> 2] | 0
                        Q = Vn(f[L >> 2] | 0, f[(L + 4) >> 2] | 0, $ | 0, aa | 0) | 0
                        L = I
                        ba = s
                        ca = t
                        da = f[ca >> 2] | 0
                        ea = f[(ca + 4) >> 2] | 0
                        ca = Vn(f[ba >> 2] | 0, f[(ba + 4) >> 2] | 0, da | 0, ea | 0) | 0
                        ba = I
                        fa = w
                        ga = x
                        ha = f[ga >> 2] | 0
                        ia = f[(ga + 4) >> 2] | 0
                        ga = Vn(f[fa >> 2] | 0, f[(fa + 4) >> 2] | 0, ha | 0, ia | 0) | 0
                        fa = I
                        ja = l
                        ka = Vn(f[ja >> 2] | 0, f[(ja + 4) >> 2] | 0, $ | 0, aa | 0) | 0
                        aa = I
                        $ = y
                        ja = Vn(f[$ >> 2] | 0, f[($ + 4) >> 2] | 0, da | 0, ea | 0) | 0
                        ea = I
                        da = z
                        $ = Vn(f[da >> 2] | 0, f[(da + 4) >> 2] | 0, ha | 0, ia | 0) | 0
                        ia = I
                        ha = on($ | 0, ia | 0, ca | 0, ba | 0) | 0
                        da = I
                        la = on(ja | 0, ea | 0, ga | 0, fa | 0) | 0
                        ma = I
                        na = on(ka | 0, aa | 0, ga | 0, fa | 0) | 0
                        fa = I
                        ga = on($ | 0, ia | 0, Q | 0, L | 0) | 0
                        ia = I
                        $ = on(ja | 0, ea | 0, Q | 0, L | 0) | 0
                        L = I
                        Q = on(ka | 0, aa | 0, ca | 0, ba | 0) | 0
                        ba = I
                        ca = Vn(C | 0, D | 0, la | 0, ma | 0) | 0
                        ma = Tn(ca | 0, I | 0, ha | 0, da | 0) | 0
                        da = I
                        ha = Tn(na | 0, fa | 0, E | 0, F | 0) | 0
                        fa = Vn(ha | 0, I | 0, ga | 0, ia | 0) | 0
                        ia = I
                        ga = Vn(G | 0, H | 0, Q | 0, ba | 0) | 0
                        ba = Tn(ga | 0, I | 0, $ | 0, L | 0) | 0
                        L = I
                        ph(i)
                        B = f[c >> 2] | 0
                        $ = (f[v >> 2] | 0) == 0
                        if ((B | 0) == -1) {
                            oa = $
                            pa = da
                            qa = ma
                            ra = ia
                            sa = fa
                            ta = L
                            ua = ba
                            break a
                        } else {
                            A = M
                            C = ma
                            D = da
                            E = fa
                            F = ia
                            G = ba
                            H = L
                            J = $
                            K = P
                        }
                    }
                    if ((V | 0) == 22) mq(W)
                    else if ((V | 0) == 28) mq(Z)
                } else {
                    oa = a
                    pa = 0
                    qa = 0
                    ra = 0
                    sa = 0
                    ta = 0
                    ua = 0
                }
            while (0)
            a = ((pa | 0) > -1) | (((pa | 0) == -1) & (qa >>> 0 > 4294967295))
            Z = Vn(0, 0, qa | 0, pa | 0) | 0
            V = a ? pa : I
            W = ((ra | 0) > -1) | (((ra | 0) == -1) & (sa >>> 0 > 4294967295))
            P = Vn(0, 0, sa | 0, ra | 0) | 0
            M = W ? ra : I
            v = ((ta | 0) > -1) | (((ta | 0) == -1) & (ua >>> 0 > 4294967295))
            c = Vn(0, 0, ua | 0, ta | 0) | 0
            i = Tn((W ? sa : P) | 0, M | 0, (v ? ua : c) | 0, (v ? ta : I) | 0) | 0
            v = Tn(i | 0, I | 0, (a ? qa : Z) | 0, V | 0) | 0
            V = I
            if (oa) {
                if ((v | 0) <= 536870912) {
                    va = qa
                    wa = sa
                    xa = ua
                    f[d >> 2] = va
                    ya = (d + 4) | 0
                    f[ya >> 2] = wa
                    za = (d + 8) | 0
                    f[za >> 2] = xa
                    u = e
                    return
                }
                oa = Wn(v | 0, V | 0, 29) | 0
                Z = oa & 7
                oa = zk(qa | 0, pa | 0, Z | 0, 0) | 0
                a = zk(sa | 0, ra | 0, Z | 0, 0) | 0
                i = zk(ua | 0, ta | 0, Z | 0, 0) | 0
                va = oa
                wa = a
                xa = i
                f[d >> 2] = va
                ya = (d + 4) | 0
                f[ya >> 2] = wa
                za = (d + 8) | 0
                f[za >> 2] = xa
                u = e
                return
            } else {
                if (!(((V | 0) > 0) | (((V | 0) == 0) & (v >>> 0 > 536870912)))) {
                    va = qa
                    wa = sa
                    xa = ua
                    f[d >> 2] = va
                    ya = (d + 4) | 0
                    f[ya >> 2] = wa
                    za = (d + 8) | 0
                    f[za >> 2] = xa
                    u = e
                    return
                }
                i = Wn(v | 0, V | 0, 29) | 0
                V = I
                v = zk(qa | 0, pa | 0, i | 0, V | 0) | 0
                pa = zk(sa | 0, ra | 0, i | 0, V | 0) | 0
                ra = zk(ua | 0, ta | 0, i | 0, V | 0) | 0
                va = v
                wa = pa
                xa = ra
                f[d >> 2] = va
                ya = (d + 4) | 0
                f[ya >> 2] = wa
                za = (d + 8) | 0
                f[za >> 2] = xa
                u = e
                return
            }
        }
        function ac(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                I = 0,
                J = 0,
                K = 0,
                L = Oa,
                M = Oa,
                N = Oa,
                O = 0,
                P = 0,
                Q = 0,
                R = 0
            e = u
            u = (u + 64) | 0
            g = (e + 40) | 0
            i = (e + 16) | 0
            j = e
            k = xd(a, c) | 0
            if (k | 0) {
                f[i >> 2] = k
                f[g >> 2] = f[i >> 2]
                Xe(a, g) | 0
            }
            f[j >> 2] = 0
            k = (j + 4) | 0
            f[k >> 2] = 0
            f[(j + 8) >> 2] = 0
            l = (d + 11) | 0
            m = b[l >> 0] | 0
            o = (d + 4) | 0
            p = f[o >> 2] | 0
            q = (m << 24) >> 24 < 0 ? p : m & 255
            if (!q) {
                r = m
                s = p
                t = 0
            } else {
                ri(j, q)
                r = b[l >> 0] | 0
                s = f[o >> 2] | 0
                t = f[j >> 2] | 0
            }
            o = (r << 24) >> 24 < 0
            Rg(t | 0, (o ? f[d >> 2] | 0 : d) | 0, (o ? s : r & 255) | 0) | 0
            dj(i, c)
            c = (i + 12) | 0
            f[c >> 2] = 0
            r = (i + 16) | 0
            f[r >> 2] = 0
            f[(i + 20) >> 2] = 0
            s = f[k >> 2] | 0
            o = f[j >> 2] | 0
            d = (s - o) | 0
            if (!d) {
                v = o
                w = s
                x = 0
            } else {
                ri(c, d)
                v = f[j >> 2] | 0
                w = f[k >> 2] | 0
                x = f[c >> 2] | 0
            }
            Rg(x | 0, v | 0, (w - v) | 0) | 0
            v = (i + 11) | 0
            w = b[v >> 0] | 0
            x = (w << 24) >> 24 < 0
            c = x ? f[i >> 2] | 0 : i
            d = x ? f[(i + 4) >> 2] | 0 : w & 255
            if (d >>> 0 > 3) {
                w = c
                x = d
                s = d
                while (1) {
                    o = X(h[w >> 0] | (h[(w + 1) >> 0] << 8) | (h[(w + 2) >> 0] << 16) | (h[(w + 3) >> 0] << 24), 1540483477) | 0
                    x = (X((o >>> 24) ^ o, 1540483477) | 0) ^ (X(x, 1540483477) | 0)
                    s = (s + -4) | 0
                    if (s >>> 0 <= 3) break
                    else w = (w + 4) | 0
                }
                w = (d + -4) | 0
                s = w & -4
                y = (w - s) | 0
                z = (c + (s + 4)) | 0
                A = x
            } else {
                y = d
                z = c
                A = d
            }
            switch (y | 0) {
                case 3: {
                    B = (h[(z + 2) >> 0] << 16) ^ A
                    C = 12
                    break
                }
                case 2: {
                    B = A
                    C = 12
                    break
                }
                case 1: {
                    D = A
                    C = 13
                    break
                }
                default:
                    E = A
            }
            if ((C | 0) == 12) {
                D = (h[(z + 1) >> 0] << 8) ^ B
                C = 13
            }
            if ((C | 0) == 13) E = X(D ^ h[z >> 0], 1540483477) | 0
            z = X((E >>> 13) ^ E, 1540483477) | 0
            E = (z >>> 15) ^ z
            z = (a + 4) | 0
            D = f[z >> 2] | 0
            B = (D | 0) == 0
            a: do
                if (!B) {
                    A = (D + -1) | 0
                    y = ((A & D) | 0) == 0
                    if (!y)
                        if (E >>> 0 < D >>> 0) F = E
                        else F = (E >>> 0) % (D >>> 0) | 0
                    else F = E & A
                    x = f[((f[a >> 2] | 0) + (F << 2)) >> 2] | 0
                    if ((x | 0) != 0 ? ((s = f[x >> 2] | 0), (s | 0) != 0) : 0) {
                        x = (d | 0) == 0
                        if (y) {
                            if (x) {
                                y = s
                                while (1) {
                                    w = f[(y + 4) >> 2] | 0
                                    if (!(((w | 0) == (E | 0)) | (((w & A) | 0) == (F | 0)))) {
                                        G = F
                                        C = 54
                                        break a
                                    }
                                    w = b[(y + 8 + 11) >> 0] | 0
                                    if (!(((w << 24) >> 24 < 0 ? f[(y + 12) >> 2] | 0 : w & 255) | 0)) break a
                                    y = f[y >> 2] | 0
                                    if (!y) {
                                        G = F
                                        C = 54
                                        break a
                                    }
                                }
                            } else H = s
                            while (1) {
                                y = f[(H + 4) >> 2] | 0
                                if (!(((y | 0) == (E | 0)) | (((y & A) | 0) == (F | 0)))) {
                                    G = F
                                    C = 54
                                    break a
                                }
                                y = (H + 8) | 0
                                w = b[(y + 11) >> 0] | 0
                                o = (w << 24) >> 24 < 0
                                t = w & 255
                                do
                                    if (((o ? f[(H + 12) >> 2] | 0 : t) | 0) == (d | 0)) {
                                        w = f[y >> 2] | 0
                                        if (o)
                                            if (!(Pk(w, c, d) | 0)) break a
                                            else break
                                        if ((b[c >> 0] | 0) == ((w & 255) << 24) >> 24) {
                                            w = y
                                            l = t
                                            q = c
                                            do {
                                                l = (l + -1) | 0
                                                w = (w + 1) | 0
                                                if (!l) break a
                                                q = (q + 1) | 0
                                            } while ((b[w >> 0] | 0) == (b[q >> 0] | 0))
                                        }
                                    }
                                while (0)
                                H = f[H >> 2] | 0
                                if (!H) {
                                    G = F
                                    C = 54
                                    break a
                                }
                            }
                        }
                        if (x) {
                            A = s
                            while (1) {
                                t = f[(A + 4) >> 2] | 0
                                if ((t | 0) != (E | 0)) {
                                    if (t >>> 0 < D >>> 0) I = t
                                    else I = (t >>> 0) % (D >>> 0) | 0
                                    if ((I | 0) != (F | 0)) {
                                        G = F
                                        C = 54
                                        break a
                                    }
                                }
                                t = b[(A + 8 + 11) >> 0] | 0
                                if (!(((t << 24) >> 24 < 0 ? f[(A + 12) >> 2] | 0 : t & 255) | 0)) break a
                                A = f[A >> 2] | 0
                                if (!A) {
                                    G = F
                                    C = 54
                                    break a
                                }
                            }
                        } else J = s
                        while (1) {
                            A = f[(J + 4) >> 2] | 0
                            if ((A | 0) != (E | 0)) {
                                if (A >>> 0 < D >>> 0) K = A
                                else K = (A >>> 0) % (D >>> 0) | 0
                                if ((K | 0) != (F | 0)) {
                                    G = F
                                    C = 54
                                    break a
                                }
                            }
                            A = (J + 8) | 0
                            x = b[(A + 11) >> 0] | 0
                            t = (x << 24) >> 24 < 0
                            y = x & 255
                            do
                                if (((t ? f[(J + 12) >> 2] | 0 : y) | 0) == (d | 0)) {
                                    x = f[A >> 2] | 0
                                    if (t)
                                        if (!(Pk(x, c, d) | 0)) break a
                                        else break
                                    if ((b[c >> 0] | 0) == ((x & 255) << 24) >> 24) {
                                        x = A
                                        o = y
                                        q = c
                                        do {
                                            o = (o + -1) | 0
                                            x = (x + 1) | 0
                                            if (!o) break a
                                            q = (q + 1) | 0
                                        } while ((b[x >> 0] | 0) == (b[q >> 0] | 0))
                                    }
                                }
                            while (0)
                            J = f[J >> 2] | 0
                            if (!J) {
                                G = F
                                C = 54
                                break
                            }
                        }
                    } else {
                        G = F
                        C = 54
                    }
                } else {
                    G = 0
                    C = 54
                }
            while (0)
            if ((C | 0) == 54) {
                _h(g, a, E, i)
                C = (a + 12) | 0
                L = $((((f[C >> 2] | 0) + 1) | 0) >>> 0)
                M = $(D >>> 0)
                N = $(n[(a + 16) >> 2])
                do
                    if (B | ($(N * M) < L)) {
                        F = (D << 1) | (((D >>> 0 < 3) | ((((D + -1) & D) | 0) != 0)) & 1)
                        J = ~~$(W($(L / N))) >>> 0
                        Ph(a, F >>> 0 < J >>> 0 ? J : F)
                        F = f[z >> 2] | 0
                        J = (F + -1) | 0
                        if (!(J & F)) {
                            O = F
                            P = J & E
                            break
                        }
                        if (E >>> 0 < F >>> 0) {
                            O = F
                            P = E
                        } else {
                            O = F
                            P = (E >>> 0) % (F >>> 0) | 0
                        }
                    } else {
                        O = D
                        P = G
                    }
                while (0)
                G = f[((f[a >> 2] | 0) + (P << 2)) >> 2] | 0
                if (!G) {
                    D = (a + 8) | 0
                    f[f[g >> 2] >> 2] = f[D >> 2]
                    f[D >> 2] = f[g >> 2]
                    f[((f[a >> 2] | 0) + (P << 2)) >> 2] = D
                    D = f[g >> 2] | 0
                    P = f[D >> 2] | 0
                    if (!P) Q = g
                    else {
                        E = f[(P + 4) >> 2] | 0
                        P = (O + -1) | 0
                        if (P & O)
                            if (E >>> 0 < O >>> 0) R = E
                            else R = (E >>> 0) % (O >>> 0) | 0
                        else R = E & P
                        f[((f[a >> 2] | 0) + (R << 2)) >> 2] = D
                        Q = g
                    }
                } else {
                    f[f[g >> 2] >> 2] = f[G >> 2]
                    f[G >> 2] = f[g >> 2]
                    Q = g
                }
                f[C >> 2] = (f[C >> 2] | 0) + 1
                f[Q >> 2] = 0
            }
            Q = f[(i + 12) >> 2] | 0
            if (Q | 0) {
                if ((f[r >> 2] | 0) != (Q | 0)) f[r >> 2] = Q
                br(Q)
            }
            if ((b[v >> 0] | 0) < 0) br(f[i >> 2] | 0)
            i = f[j >> 2] | 0
            if (!i) {
                u = e
                return
            }
            if ((f[k >> 2] | 0) != (i | 0)) f[k >> 2] = i
            br(i)
            u = e
            return
        }
        function bc(a, c, e) {
            a = a | 0
            c = c | 0
            e = e | 0
            var g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 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,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = Oa,
                fa = Oa,
                ga = Oa,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0
            g = u
            u = (u + 48) | 0
            i = (g + 12) | 0
            j = (g + 32) | 0
            k = g
            l = (i + 16) | 0
            f[i >> 2] = 0
            f[(i + 4) >> 2] = 0
            f[(i + 8) >> 2] = 0
            f[(i + 12) >> 2] = 0
            n[l >> 2] = $(1.0)
            m = (a + 80) | 0
            o = f[m >> 2] | 0
            f[k >> 2] = 0
            p = (k + 4) | 0
            f[p >> 2] = 0
            f[(k + 8) >> 2] = 0
            if (o) {
                if (o >>> 0 > 1073741823) mq(k)
                q = o << 2
                r = dn(q) | 0
                f[k >> 2] = r
                s = (r + (o << 2)) | 0
                f[(k + 8) >> 2] = s
                hj(r | 0, 0, q | 0) | 0
                f[p >> 2] = s
                s = (c + 48) | 0
                q = (c + 40) | 0
                o = (i + 4) | 0
                t = (i + 12) | 0
                v = (i + 8) | 0
                w = (a + 40) | 0
                x = (a + 64) | 0
                y = f[e >> 2] | 0
                e = 0
                z = r
                A = 0
                B = 0
                C = r
                D = r
                E = r
                while (1) {
                    r = s
                    F = f[r >> 2] | 0
                    G = f[(r + 4) >> 2] | 0
                    r = q
                    H = on(f[r >> 2] | 0, f[(r + 4) >> 2] | 0, (y + A) | 0, 0) | 0
                    r = Tn(H | 0, I | 0, F | 0, G | 0) | 0
                    G = ((f[f[c >> 2] >> 2] | 0) + r) | 0
                    r = h[G >> 0] | (h[(G + 1) >> 0] << 8)
                    d[j >> 1] = r
                    G = (r ^ 318) & 65535
                    a: do
                        if (e) {
                            F = (e + -1) | 0
                            H = ((F & e) | 0) == 0
                            if (!H)
                                if (e >>> 0 > G >>> 0) J = G
                                else J = (G >>> 0) % (e >>> 0) | 0
                            else J = F & G
                            K = f[i >> 2] | 0
                            L = f[(K + (J << 2)) >> 2] | 0
                            b: do
                                if (L | 0 ? ((M = f[L >> 2] | 0), M | 0) : 0) {
                                    c: do
                                        if (H) {
                                            N = M
                                            while (1) {
                                                O = f[(N + 4) >> 2] | 0
                                                P = (O | 0) == (G | 0)
                                                if (!(P | (((O & F) | 0) == (J | 0)))) break b
                                                if (P ? (d[(N + 8) >> 1] | 0) == (r << 16) >> 16 : 0) {
                                                    Q = N
                                                    break c
                                                }
                                                N = f[N >> 2] | 0
                                                if (!N) break b
                                            }
                                        } else {
                                            N = M
                                            while (1) {
                                                P = f[(N + 4) >> 2] | 0
                                                if ((P | 0) == (G | 0)) {
                                                    if ((d[(N + 8) >> 1] | 0) == (r << 16) >> 16) {
                                                        Q = N
                                                        break c
                                                    }
                                                } else {
                                                    if (P >>> 0 < e >>> 0) R = P
                                                    else R = (P >>> 0) % (e >>> 0) | 0
                                                    if ((R | 0) != (J | 0)) break b
                                                }
                                                N = f[N >> 2] | 0
                                                if (!N) break b
                                            }
                                        }
                                    while (0)
                                    f[(E + (A << 2)) >> 2] = f[(Q + 12) >> 2]
                                    S = z
                                    T = B
                                    U = D
                                    V = C
                                    X = E
                                    break a
                                }
                            while (0)
                            if (!H)
                                if (e >>> 0 > G >>> 0) Y = G
                                else Y = (G >>> 0) % (e >>> 0) | 0
                            else Y = F & G
                            L = f[(K + (Y << 2)) >> 2] | 0
                            if (!L) {
                                Z = Y
                                _ = e
                                aa = 0
                                ba = 40
                            } else {
                                if (H) {
                                    M = L
                                    while (1) {
                                        M = f[M >> 2] | 0
                                        if (!M) {
                                            Z = Y
                                            _ = e
                                            aa = 0
                                            ba = 40
                                            break a
                                        }
                                        N = f[(M + 4) >> 2] | 0
                                        if (!(((N | 0) == (G | 0)) | (((N & F) | 0) == (Y | 0)))) {
                                            Z = Y
                                            _ = e
                                            aa = 0
                                            ba = 40
                                            break a
                                        }
                                        if ((d[(M + 8) >> 1] | 0) == (r << 16) >> 16) {
                                            ba = 55
                                            break a
                                        }
                                    }
                                } else ca = L
                                while (1) {
                                    ca = f[ca >> 2] | 0
                                    if (!ca) {
                                        Z = Y
                                        _ = e
                                        aa = 0
                                        ba = 40
                                        break a
                                    }
                                    M = f[(ca + 4) >> 2] | 0
                                    if ((M | 0) != (G | 0)) {
                                        if (M >>> 0 < e >>> 0) da = M
                                        else da = (M >>> 0) % (e >>> 0) | 0
                                        if ((da | 0) != (Y | 0)) {
                                            Z = Y
                                            _ = e
                                            aa = 0
                                            ba = 40
                                            break a
                                        }
                                    }
                                    if ((d[(ca + 8) >> 1] | 0) == (r << 16) >> 16) {
                                        ba = 55
                                        break
                                    }
                                }
                            }
                        } else {
                            Z = 0
                            _ = 0
                            aa = 1
                            ba = 40
                        }
                    while (0)
                    if ((ba | 0) == 40) {
                        ba = 0
                        L = dn(16) | 0
                        d[(L + 8) >> 1] = r
                        f[(L + 12) >> 2] = B
                        f[(L + 4) >> 2] = G
                        f[L >> 2] = 0
                        ea = $((((f[t >> 2] | 0) + 1) | 0) >>> 0)
                        fa = $(_ >>> 0)
                        ga = $(n[l >> 2])
                        do
                            if (aa | ($(ga * fa) < ea)) {
                                M = (_ << 1) | (((_ >>> 0 < 3) | ((((_ + -1) & _) | 0) != 0)) & 1)
                                F = ~~$(W($(ea / ga))) >>> 0
                                Fh(i, M >>> 0 < F >>> 0 ? F : M)
                                M = f[o >> 2] | 0
                                F = (M + -1) | 0
                                if (!(F & M)) {
                                    ha = M
                                    ia = F & G
                                    break
                                }
                                if (M >>> 0 > G >>> 0) {
                                    ha = M
                                    ia = G
                                } else {
                                    ha = M
                                    ia = (G >>> 0) % (M >>> 0) | 0
                                }
                            } else {
                                ha = _
                                ia = Z
                            }
                        while (0)
                        G = ((f[i >> 2] | 0) + (ia << 2)) | 0
                        r = f[G >> 2] | 0
                        if (!r) {
                            f[L >> 2] = f[v >> 2]
                            f[v >> 2] = L
                            f[G >> 2] = v
                            G = f[L >> 2] | 0
                            if (G | 0) {
                                M = f[(G + 4) >> 2] | 0
                                G = (ha + -1) | 0
                                if (G & ha)
                                    if (M >>> 0 < ha >>> 0) ja = M
                                    else ja = (M >>> 0) % (ha >>> 0) | 0
                                else ja = M & G
                                ka = ((f[i >> 2] | 0) + (ja << 2)) | 0
                                ba = 53
                            }
                        } else {
                            f[L >> 2] = f[r >> 2]
                            ka = r
                            ba = 53
                        }
                        if ((ba | 0) == 53) {
                            ba = 0
                            f[ka >> 2] = L
                        }
                        f[t >> 2] = (f[t >> 2] | 0) + 1
                        ba = 55
                    }
                    if ((ba | 0) == 55) {
                        ba = 0
                        r = w
                        G = f[r >> 2] | 0
                        M = on(G | 0, f[(r + 4) >> 2] | 0, B | 0, 0) | 0
                        Rg(((f[f[x >> 2] >> 2] | 0) + M) | 0, j | 0, G | 0) | 0
                        G = f[k >> 2] | 0
                        f[(G + (A << 2)) >> 2] = B
                        S = G
                        T = (B + 1) | 0
                        U = G
                        V = G
                        X = G
                    }
                    G = (A + 1) | 0
                    la = f[m >> 2] | 0
                    if (G >>> 0 >= la >>> 0) break
                    e = f[o >> 2] | 0
                    z = S
                    A = G
                    B = T
                    C = V
                    D = U
                    E = X
                }
                if ((T | 0) == (la | 0)) ma = V
                else {
                    V = (a + 84) | 0
                    if (!(b[V >> 0] | 0)) {
                        X = f[(a + 72) >> 2] | 0
                        E = f[(a + 68) >> 2] | 0
                        D = E
                        if ((X | 0) == (E | 0)) na = S
                        else {
                            C = (X - E) >> 2
                            E = 0
                            do {
                                X = (D + (E << 2)) | 0
                                f[X >> 2] = f[(U + (f[X >> 2] << 2)) >> 2]
                                E = (E + 1) | 0
                            } while (E >>> 0 < C >>> 0)
                            na = S
                        }
                    } else {
                        b[V >> 0] = 0
                        V = (a + 68) | 0
                        S = (a + 72) | 0
                        C = f[S >> 2] | 0
                        E = f[V >> 2] | 0
                        U = (C - E) >> 2
                        D = E
                        E = C
                        if (la >>> 0 <= U >>> 0)
                            if (la >>> 0 < U >>> 0 ? ((C = (D + (la << 2)) | 0), (C | 0) != (E | 0)) : 0) {
                                f[S >> 2] = E + (~(((E + -4 - C) | 0) >>> 2) << 2)
                                oa = la
                            } else oa = la
                        else {
                            kh(V, (la - U) | 0, 1204)
                            oa = f[m >> 2] | 0
                        }
                        U = f[k >> 2] | 0
                        if (!oa) na = U
                        else {
                            k = f[(a + 68) >> 2] | 0
                            a = 0
                            do {
                                f[(k + (a << 2)) >> 2] = f[(U + (a << 2)) >> 2]
                                a = (a + 1) | 0
                            } while (a >>> 0 < oa >>> 0)
                            na = U
                        }
                    }
                    f[m >> 2] = T
                    ma = na
                }
                if (!ma) pa = T
                else {
                    na = f[p >> 2] | 0
                    if ((na | 0) != (ma | 0)) f[p >> 2] = na + (~(((na + -4 - ma) | 0) >>> 2) << 2)
                    br(ma)
                    pa = T
                }
            } else pa = 0
            T = f[(i + 8) >> 2] | 0
            if (T | 0) {
                ma = T
                do {
                    T = ma
                    ma = f[ma >> 2] | 0
                    br(T)
                } while ((ma | 0) != 0)
            }
            ma = f[i >> 2] | 0
            f[i >> 2] = 0
            if (!ma) {
                u = g
                return pa | 0
            }
            br(ma)
            u = g
            return pa | 0
        }
        function cc(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                I = 0,
                J = Oa,
                K = Oa,
                L = Oa,
                M = 0,
                N = 0,
                O = 0,
                P = 0
            e = u
            u = (u + 64) | 0
            g = (e + 40) | 0
            i = (e + 16) | 0
            j = e
            k = xd(a, c) | 0
            if (k | 0) {
                f[i >> 2] = k
                f[g >> 2] = f[i >> 2]
                Xe(a, g) | 0
            }
            f[j >> 2] = 0
            k = (j + 4) | 0
            f[k >> 2] = 0
            f[(j + 8) >> 2] = 0
            ri(j, 4)
            l = f[j >> 2] | 0
            m = h[d >> 0] | (h[(d + 1) >> 0] << 8) | (h[(d + 2) >> 0] << 16) | (h[(d + 3) >> 0] << 24)
            b[l >> 0] = m
            b[(l + 1) >> 0] = m >> 8
            b[(l + 2) >> 0] = m >> 16
            b[(l + 3) >> 0] = m >> 24
            dj(i, c)
            c = (i + 12) | 0
            f[c >> 2] = 0
            m = (i + 16) | 0
            f[m >> 2] = 0
            f[(i + 20) >> 2] = 0
            l = f[k >> 2] | 0
            d = f[j >> 2] | 0
            o = (l - d) | 0
            if (!o) {
                p = d
                q = l
                r = 0
            } else {
                ri(c, o)
                p = f[j >> 2] | 0
                q = f[k >> 2] | 0
                r = f[c >> 2] | 0
            }
            Rg(r | 0, p | 0, (q - p) | 0) | 0
            p = (i + 11) | 0
            q = b[p >> 0] | 0
            r = (q << 24) >> 24 < 0
            c = r ? f[i >> 2] | 0 : i
            o = r ? f[(i + 4) >> 2] | 0 : q & 255
            if (o >>> 0 > 3) {
                q = c
                r = o
                l = o
                while (1) {
                    d = X(h[q >> 0] | (h[(q + 1) >> 0] << 8) | (h[(q + 2) >> 0] << 16) | (h[(q + 3) >> 0] << 24), 1540483477) | 0
                    r = (X((d >>> 24) ^ d, 1540483477) | 0) ^ (X(r, 1540483477) | 0)
                    l = (l + -4) | 0
                    if (l >>> 0 <= 3) break
                    else q = (q + 4) | 0
                }
                q = (o + -4) | 0
                l = q & -4
                s = (q - l) | 0
                t = (c + (l + 4)) | 0
                v = r
            } else {
                s = o
                t = c
                v = o
            }
            switch (s | 0) {
                case 3: {
                    w = (h[(t + 2) >> 0] << 16) ^ v
                    x = 10
                    break
                }
                case 2: {
                    w = v
                    x = 10
                    break
                }
                case 1: {
                    y = v
                    x = 11
                    break
                }
                default:
                    z = v
            }
            if ((x | 0) == 10) {
                y = (h[(t + 1) >> 0] << 8) ^ w
                x = 11
            }
            if ((x | 0) == 11) z = X(y ^ h[t >> 0], 1540483477) | 0
            t = X((z >>> 13) ^ z, 1540483477) | 0
            z = (t >>> 15) ^ t
            t = (a + 4) | 0
            y = f[t >> 2] | 0
            w = (y | 0) == 0
            a: do
                if (!w) {
                    v = (y + -1) | 0
                    s = ((v & y) | 0) == 0
                    if (!s)
                        if (z >>> 0 < y >>> 0) A = z
                        else A = (z >>> 0) % (y >>> 0) | 0
                    else A = z & v
                    r = f[((f[a >> 2] | 0) + (A << 2)) >> 2] | 0
                    if ((r | 0) != 0 ? ((l = f[r >> 2] | 0), (l | 0) != 0) : 0) {
                        r = (o | 0) == 0
                        if (s) {
                            if (r) {
                                s = l
                                while (1) {
                                    q = f[(s + 4) >> 2] | 0
                                    if (!(((q | 0) == (z | 0)) | (((q & v) | 0) == (A | 0)))) {
                                        B = A
                                        x = 52
                                        break a
                                    }
                                    q = b[(s + 8 + 11) >> 0] | 0
                                    if (!(((q << 24) >> 24 < 0 ? f[(s + 12) >> 2] | 0 : q & 255) | 0)) break a
                                    s = f[s >> 2] | 0
                                    if (!s) {
                                        B = A
                                        x = 52
                                        break a
                                    }
                                }
                            } else C = l
                            while (1) {
                                s = f[(C + 4) >> 2] | 0
                                if (!(((s | 0) == (z | 0)) | (((s & v) | 0) == (A | 0)))) {
                                    B = A
                                    x = 52
                                    break a
                                }
                                s = (C + 8) | 0
                                q = b[(s + 11) >> 0] | 0
                                d = (q << 24) >> 24 < 0
                                D = q & 255
                                do
                                    if (((d ? f[(C + 12) >> 2] | 0 : D) | 0) == (o | 0)) {
                                        q = f[s >> 2] | 0
                                        if (d)
                                            if (!(Pk(q, c, o) | 0)) break a
                                            else break
                                        if ((b[c >> 0] | 0) == ((q & 255) << 24) >> 24) {
                                            q = s
                                            E = D
                                            F = c
                                            do {
                                                E = (E + -1) | 0
                                                q = (q + 1) | 0
                                                if (!E) break a
                                                F = (F + 1) | 0
                                            } while ((b[q >> 0] | 0) == (b[F >> 0] | 0))
                                        }
                                    }
                                while (0)
                                C = f[C >> 2] | 0
                                if (!C) {
                                    B = A
                                    x = 52
                                    break a
                                }
                            }
                        }
                        if (r) {
                            v = l
                            while (1) {
                                D = f[(v + 4) >> 2] | 0
                                if ((D | 0) != (z | 0)) {
                                    if (D >>> 0 < y >>> 0) G = D
                                    else G = (D >>> 0) % (y >>> 0) | 0
                                    if ((G | 0) != (A | 0)) {
                                        B = A
                                        x = 52
                                        break a
                                    }
                                }
                                D = b[(v + 8 + 11) >> 0] | 0
                                if (!(((D << 24) >> 24 < 0 ? f[(v + 12) >> 2] | 0 : D & 255) | 0)) break a
                                v = f[v >> 2] | 0
                                if (!v) {
                                    B = A
                                    x = 52
                                    break a
                                }
                            }
                        } else H = l
                        while (1) {
                            v = f[(H + 4) >> 2] | 0
                            if ((v | 0) != (z | 0)) {
                                if (v >>> 0 < y >>> 0) I = v
                                else I = (v >>> 0) % (y >>> 0) | 0
                                if ((I | 0) != (A | 0)) {
                                    B = A
                                    x = 52
                                    break a
                                }
                            }
                            v = (H + 8) | 0
                            r = b[(v + 11) >> 0] | 0
                            D = (r << 24) >> 24 < 0
                            s = r & 255
                            do
                                if (((D ? f[(H + 12) >> 2] | 0 : s) | 0) == (o | 0)) {
                                    r = f[v >> 2] | 0
                                    if (D)
                                        if (!(Pk(r, c, o) | 0)) break a
                                        else break
                                    if ((b[c >> 0] | 0) == ((r & 255) << 24) >> 24) {
                                        r = v
                                        d = s
                                        F = c
                                        do {
                                            d = (d + -1) | 0
                                            r = (r + 1) | 0
                                            if (!d) break a
                                            F = (F + 1) | 0
                                        } while ((b[r >> 0] | 0) == (b[F >> 0] | 0))
                                    }
                                }
                            while (0)
                            H = f[H >> 2] | 0
                            if (!H) {
                                B = A
                                x = 52
                                break
                            }
                        }
                    } else {
                        B = A
                        x = 52
                    }
                } else {
                    B = 0
                    x = 52
                }
            while (0)
            if ((x | 0) == 52) {
                _h(g, a, z, i)
                x = (a + 12) | 0
                J = $((((f[x >> 2] | 0) + 1) | 0) >>> 0)
                K = $(y >>> 0)
                L = $(n[(a + 16) >> 2])
                do
                    if (w | ($(L * K) < J)) {
                        A = (y << 1) | (((y >>> 0 < 3) | ((((y + -1) & y) | 0) != 0)) & 1)
                        H = ~~$(W($(J / L))) >>> 0
                        Ph(a, A >>> 0 < H >>> 0 ? H : A)
                        A = f[t >> 2] | 0
                        H = (A + -1) | 0
                        if (!(H & A)) {
                            M = A
                            N = H & z
                            break
                        }
                        if (z >>> 0 < A >>> 0) {
                            M = A
                            N = z
                        } else {
                            M = A
                            N = (z >>> 0) % (A >>> 0) | 0
                        }
                    } else {
                        M = y
                        N = B
                    }
                while (0)
                B = f[((f[a >> 2] | 0) + (N << 2)) >> 2] | 0
                if (!B) {
                    y = (a + 8) | 0
                    f[f[g >> 2] >> 2] = f[y >> 2]
                    f[y >> 2] = f[g >> 2]
                    f[((f[a >> 2] | 0) + (N << 2)) >> 2] = y
                    y = f[g >> 2] | 0
                    N = f[y >> 2] | 0
                    if (!N) O = g
                    else {
                        z = f[(N + 4) >> 2] | 0
                        N = (M + -1) | 0
                        if (N & M)
                            if (z >>> 0 < M >>> 0) P = z
                            else P = (z >>> 0) % (M >>> 0) | 0
                        else P = z & N
                        f[((f[a >> 2] | 0) + (P << 2)) >> 2] = y
                        O = g
                    }
                } else {
                    f[f[g >> 2] >> 2] = f[B >> 2]
                    f[B >> 2] = f[g >> 2]
                    O = g
                }
                f[x >> 2] = (f[x >> 2] | 0) + 1
                f[O >> 2] = 0
            }
            O = f[(i + 12) >> 2] | 0
            if (O | 0) {
                if ((f[m >> 2] | 0) != (O | 0)) f[m >> 2] = O
                br(O)
            }
            if ((b[p >> 0] | 0) < 0) br(f[i >> 2] | 0)
            i = f[j >> 2] | 0
            if (!i) {
                u = e
                return
            }
            if ((f[k >> 2] | 0) != (i | 0)) f[k >> 2] = i
            br(i)
            u = e
            return
        }
        function dc(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 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,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                aa = 0,
                ba = 0,
                ca = Oa,
                da = Oa,
                ea = Oa,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0
            e = u
            u = (u + 48) | 0
            g = (e + 12) | 0
            h = (e + 32) | 0
            i = e
            j = (g + 16) | 0
            f[g >> 2] = 0
            f[(g + 4) >> 2] = 0
            f[(g + 8) >> 2] = 0
            f[(g + 12) >> 2] = 0
            n[j >> 2] = $(1.0)
            k = (a + 80) | 0
            l = f[k >> 2] | 0
            f[i >> 2] = 0
            m = (i + 4) | 0
            f[m >> 2] = 0
            f[(i + 8) >> 2] = 0
            if (l) {
                if (l >>> 0 > 1073741823) mq(i)
                o = l << 2
                p = dn(o) | 0
                f[i >> 2] = p
                q = (p + (l << 2)) | 0
                f[(i + 8) >> 2] = q
                hj(p | 0, 0, o | 0) | 0
                f[m >> 2] = q
                q = (c + 48) | 0
                o = (c + 40) | 0
                l = (g + 4) | 0
                r = (g + 12) | 0
                s = (g + 8) | 0
                t = (a + 40) | 0
                v = (a + 64) | 0
                w = f[d >> 2] | 0
                d = 0
                x = p
                y = 0
                z = 0
                A = p
                B = p
                C = p
                while (1) {
                    p = q
                    D = f[p >> 2] | 0
                    E = f[(p + 4) >> 2] | 0
                    p = o
                    F = on(f[p >> 2] | 0, f[(p + 4) >> 2] | 0, (w + y) | 0, 0) | 0
                    p = Tn(F | 0, I | 0, D | 0, E | 0) | 0
                    E = b[((f[f[c >> 2] >> 2] | 0) + p) >> 0] | 0
                    b[h >> 0] = E
                    p = (E & 255) ^ 318
                    a: do
                        if (d) {
                            D = (d + -1) | 0
                            F = ((D & d) | 0) == 0
                            if (!F)
                                if (p >>> 0 < d >>> 0) G = p
                                else G = (p >>> 0) % (d >>> 0) | 0
                            else G = D & p
                            H = f[g >> 2] | 0
                            J = f[(H + (G << 2)) >> 2] | 0
                            b: do
                                if (J | 0 ? ((K = f[J >> 2] | 0), K | 0) : 0) {
                                    c: do
                                        if (F) {
                                            L = K
                                            while (1) {
                                                M = f[(L + 4) >> 2] | 0
                                                N = (M | 0) == (p | 0)
                                                if (!(N | (((M & D) | 0) == (G | 0)))) break b
                                                if (N ? (b[(L + 8) >> 0] | 0) == (E << 24) >> 24 : 0) {
                                                    O = L
                                                    break c
                                                }
                                                L = f[L >> 2] | 0
                                                if (!L) break b
                                            }
                                        } else {
                                            L = K
                                            while (1) {
                                                N = f[(L + 4) >> 2] | 0
                                                if ((N | 0) == (p | 0)) {
                                                    if ((b[(L + 8) >> 0] | 0) == (E << 24) >> 24) {
                                                        O = L
                                                        break c
                                                    }
                                                } else {
                                                    if (N >>> 0 < d >>> 0) P = N
                                                    else P = (N >>> 0) % (d >>> 0) | 0
                                                    if ((P | 0) != (G | 0)) break b
                                                }
                                                L = f[L >> 2] | 0
                                                if (!L) break b
                                            }
                                        }
                                    while (0)
                                    f[(C + (y << 2)) >> 2] = f[(O + 12) >> 2]
                                    Q = x
                                    R = z
                                    S = B
                                    T = A
                                    U = C
                                    break a
                                }
                            while (0)
                            if (!F)
                                if (p >>> 0 < d >>> 0) V = p
                                else V = (p >>> 0) % (d >>> 0) | 0
                            else V = D & p
                            J = f[(H + (V << 2)) >> 2] | 0
                            if (!J) {
                                X = V
                                Y = d
                                Z = 0
                                _ = 40
                            } else {
                                if (F) {
                                    K = J
                                    while (1) {
                                        K = f[K >> 2] | 0
                                        if (!K) {
                                            X = V
                                            Y = d
                                            Z = 0
                                            _ = 40
                                            break a
                                        }
                                        L = f[(K + 4) >> 2] | 0
                                        if (!(((L | 0) == (p | 0)) | (((L & D) | 0) == (V | 0)))) {
                                            X = V
                                            Y = d
                                            Z = 0
                                            _ = 40
                                            break a
                                        }
                                        if ((b[(K + 8) >> 0] | 0) == (E << 24) >> 24) {
                                            _ = 55
                                            break a
                                        }
                                    }
                                } else aa = J
                                while (1) {
                                    aa = f[aa >> 2] | 0
                                    if (!aa) {
                                        X = V
                                        Y = d
                                        Z = 0
                                        _ = 40
                                        break a
                                    }
                                    K = f[(aa + 4) >> 2] | 0
                                    if ((K | 0) != (p | 0)) {
                                        if (K >>> 0 < d >>> 0) ba = K
                                        else ba = (K >>> 0) % (d >>> 0) | 0
                                        if ((ba | 0) != (V | 0)) {
                                            X = V
                                            Y = d
                                            Z = 0
                                            _ = 40
                                            break a
                                        }
                                    }
                                    if ((b[(aa + 8) >> 0] | 0) == (E << 24) >> 24) {
                                        _ = 55
                                        break
                                    }
                                }
                            }
                        } else {
                            X = 0
                            Y = 0
                            Z = 1
                            _ = 40
                        }
                    while (0)
                    if ((_ | 0) == 40) {
                        _ = 0
                        J = dn(16) | 0
                        b[(J + 8) >> 0] = E
                        f[(J + 12) >> 2] = z
                        f[(J + 4) >> 2] = p
                        f[J >> 2] = 0
                        ca = $((((f[r >> 2] | 0) + 1) | 0) >>> 0)
                        da = $(Y >>> 0)
                        ea = $(n[j >> 2])
                        do
                            if (Z | ($(ea * da) < ca)) {
                                K = (Y << 1) | (((Y >>> 0 < 3) | ((((Y + -1) & Y) | 0) != 0)) & 1)
                                D = ~~$(W($(ca / ea))) >>> 0
                                Mh(g, K >>> 0 < D >>> 0 ? D : K)
                                K = f[l >> 2] | 0
                                D = (K + -1) | 0
                                if (!(D & K)) {
                                    fa = K
                                    ga = D & p
                                    break
                                }
                                if (p >>> 0 < K >>> 0) {
                                    fa = K
                                    ga = p
                                } else {
                                    fa = K
                                    ga = (p >>> 0) % (K >>> 0) | 0
                                }
                            } else {
                                fa = Y
                                ga = X
                            }
                        while (0)
                        p = ((f[g >> 2] | 0) + (ga << 2)) | 0
                        E = f[p >> 2] | 0
                        if (!E) {
                            f[J >> 2] = f[s >> 2]
                            f[s >> 2] = J
                            f[p >> 2] = s
                            p = f[J >> 2] | 0
                            if (p | 0) {
                                K = f[(p + 4) >> 2] | 0
                                p = (fa + -1) | 0
                                if (p & fa)
                                    if (K >>> 0 < fa >>> 0) ha = K
                                    else ha = (K >>> 0) % (fa >>> 0) | 0
                                else ha = K & p
                                ia = ((f[g >> 2] | 0) + (ha << 2)) | 0
                                _ = 53
                            }
                        } else {
                            f[J >> 2] = f[E >> 2]
                            ia = E
                            _ = 53
                        }
                        if ((_ | 0) == 53) {
                            _ = 0
                            f[ia >> 2] = J
                        }
                        f[r >> 2] = (f[r >> 2] | 0) + 1
                        _ = 55
                    }
                    if ((_ | 0) == 55) {
                        _ = 0
                        E = t
                        p = f[E >> 2] | 0
                        K = on(p | 0, f[(E + 4) >> 2] | 0, z | 0, 0) | 0
                        Rg(((f[f[v >> 2] >> 2] | 0) + K) | 0, h | 0, p | 0) | 0
                        p = f[i >> 2] | 0
                        f[(p + (y << 2)) >> 2] = z
                        Q = p
                        R = (z + 1) | 0
                        S = p
                        T = p
                        U = p
                    }
                    p = (y + 1) | 0
                    ja = f[k >> 2] | 0
                    if (p >>> 0 >= ja >>> 0) break
                    d = f[l >> 2] | 0
                    x = Q
                    y = p
                    z = R
                    A = T
                    B = S
                    C = U
                }
                if ((R | 0) == (ja | 0)) ka = T
                else {
                    T = (a + 84) | 0
                    if (!(b[T >> 0] | 0)) {
                        U = f[(a + 72) >> 2] | 0
                        C = f[(a + 68) >> 2] | 0
                        B = C
                        if ((U | 0) == (C | 0)) la = Q
                        else {
                            A = (U - C) >> 2
                            C = 0
                            do {
                                U = (B + (C << 2)) | 0
                                f[U >> 2] = f[(S + (f[U >> 2] << 2)) >> 2]
                                C = (C + 1) | 0
                            } while (C >>> 0 < A >>> 0)
                            la = Q
                        }
                    } else {
                        b[T >> 0] = 0
                        T = (a + 68) | 0
                        Q = (a + 72) | 0
                        A = f[Q >> 2] | 0
                        C = f[T >> 2] | 0
                        S = (A - C) >> 2
                        B = C
                        C = A
                        if (ja >>> 0 <= S >>> 0)
                            if (ja >>> 0 < S >>> 0 ? ((A = (B + (ja << 2)) | 0), (A | 0) != (C | 0)) : 0) {
                                f[Q >> 2] = C + (~(((C + -4 - A) | 0) >>> 2) << 2)
                                ma = ja
                            } else ma = ja
                        else {
                            kh(T, (ja - S) | 0, 1204)
                            ma = f[k >> 2] | 0
                        }
                        S = f[i >> 2] | 0
                        if (!ma) la = S
                        else {
                            i = f[(a + 68) >> 2] | 0
                            a = 0
                            do {
                                f[(i + (a << 2)) >> 2] = f[(S + (a << 2)) >> 2]
                                a = (a + 1) | 0
                            } while (a >>> 0 < ma >>> 0)
                            la = S
                        }
                    }
                    f[k >> 2] = R
                    ka = la
                }
                if (!ka) na = R
                else {
                    la = f[m >> 2] | 0
                    if ((la | 0) != (ka | 0)) f[m >> 2] = la + (~(((la + -4 - ka) | 0) >>> 2) << 2)
                    br(ka)
                    na = R
                }
            } else na = 0
            R = f[(g + 8) >> 2] | 0
            if (R | 0) {
                ka = R
                do {
                    R = ka
                    ka = f[ka >> 2] | 0
                    br(R)
                } while ((ka | 0) != 0)
            }
            ka = f[g >> 2] | 0
            f[g >> 2] = 0
            if (!ka) {
                u = e
                return na | 0
            }
            br(ka)
            u = e
            return na | 0
        }
        function ec(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 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,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = Oa,
                ea = Oa,
                fa = Oa,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0
            e = u
            u = (u + 48) | 0
            g = (e + 16) | 0
            i = (e + 12) | 0
            j = e
            k = (g + 16) | 0
            f[g >> 2] = 0
            f[(g + 4) >> 2] = 0
            f[(g + 8) >> 2] = 0
            f[(g + 12) >> 2] = 0
            n[k >> 2] = $(1.0)
            l = (a + 80) | 0
            m = f[l >> 2] | 0
            f[j >> 2] = 0
            o = (j + 4) | 0
            f[o >> 2] = 0
            f[(j + 8) >> 2] = 0
            if (m) {
                if (m >>> 0 > 1073741823) mq(j)
                p = m << 2
                q = dn(p) | 0
                f[j >> 2] = q
                r = (q + (m << 2)) | 0
                f[(j + 8) >> 2] = r
                hj(q | 0, 0, p | 0) | 0
                f[o >> 2] = r
                r = (c + 48) | 0
                p = (c + 40) | 0
                m = (g + 4) | 0
                s = (g + 12) | 0
                t = (g + 8) | 0
                v = (a + 40) | 0
                w = (a + 64) | 0
                x = f[d >> 2] | 0
                d = 0
                y = q
                z = 0
                A = 0
                B = q
                C = q
                D = q
                while (1) {
                    q = r
                    E = f[q >> 2] | 0
                    F = f[(q + 4) >> 2] | 0
                    q = p
                    G = on(f[q >> 2] | 0, f[(q + 4) >> 2] | 0, (x + z) | 0, 0) | 0
                    q = Tn(G | 0, I | 0, E | 0, F | 0) | 0
                    F = ((f[f[c >> 2] >> 2] | 0) + q) | 0
                    q = h[F >> 0] | (h[(F + 1) >> 0] << 8) | (h[(F + 2) >> 0] << 16) | (h[(F + 3) >> 0] << 24)
                    f[i >> 2] = q
                    F = q ^ 318
                    a: do
                        if (d) {
                            E = (d + -1) | 0
                            G = ((E & d) | 0) == 0
                            if (!G)
                                if (F >>> 0 < d >>> 0) H = F
                                else H = (F >>> 0) % (d >>> 0) | 0
                            else H = E & F
                            J = f[g >> 2] | 0
                            K = f[(J + (H << 2)) >> 2] | 0
                            b: do
                                if (K | 0 ? ((L = f[K >> 2] | 0), L | 0) : 0) {
                                    c: do
                                        if (G) {
                                            M = L
                                            while (1) {
                                                N = f[(M + 4) >> 2] | 0
                                                O = (N | 0) == (F | 0)
                                                if (!(O | (((N & E) | 0) == (H | 0)))) break b
                                                if (O ? (f[(M + 8) >> 2] | 0) == (q | 0) : 0) {
                                                    P = M
                                                    break c
                                                }
                                                M = f[M >> 2] | 0
                                                if (!M) break b
                                            }
                                        } else {
                                            M = L
                                            while (1) {
                                                O = f[(M + 4) >> 2] | 0
                                                if ((O | 0) == (F | 0)) {
                                                    if ((f[(M + 8) >> 2] | 0) == (q | 0)) {
                                                        P = M
                                                        break c
                                                    }
                                                } else {
                                                    if (O >>> 0 < d >>> 0) Q = O
                                                    else Q = (O >>> 0) % (d >>> 0) | 0
                                                    if ((Q | 0) != (H | 0)) break b
                                                }
                                                M = f[M >> 2] | 0
                                                if (!M) break b
                                            }
                                        }
                                    while (0)
                                    f[(D + (z << 2)) >> 2] = f[(P + 12) >> 2]
                                    R = y
                                    S = A
                                    T = C
                                    U = B
                                    V = D
                                    break a
                                }
                            while (0)
                            if (!G)
                                if (F >>> 0 < d >>> 0) X = F
                                else X = (F >>> 0) % (d >>> 0) | 0
                            else X = E & F
                            K = f[(J + (X << 2)) >> 2] | 0
                            if (!K) {
                                Y = X
                                Z = d
                                _ = 0
                                aa = 40
                            } else {
                                if (G) {
                                    L = K
                                    while (1) {
                                        L = f[L >> 2] | 0
                                        if (!L) {
                                            Y = X
                                            Z = d
                                            _ = 0
                                            aa = 40
                                            break a
                                        }
                                        M = f[(L + 4) >> 2] | 0
                                        if (!(((M | 0) == (F | 0)) | (((M & E) | 0) == (X | 0)))) {
                                            Y = X
                                            Z = d
                                            _ = 0
                                            aa = 40
                                            break a
                                        }
                                        if ((f[(L + 8) >> 2] | 0) == (q | 0)) {
                                            aa = 55
                                            break a
                                        }
                                    }
                                } else ba = K
                                while (1) {
                                    ba = f[ba >> 2] | 0
                                    if (!ba) {
                                        Y = X
                                        Z = d
                                        _ = 0
                                        aa = 40
                                        break a
                                    }
                                    L = f[(ba + 4) >> 2] | 0
                                    if ((L | 0) != (F | 0)) {
                                        if (L >>> 0 < d >>> 0) ca = L
                                        else ca = (L >>> 0) % (d >>> 0) | 0
                                        if ((ca | 0) != (X | 0)) {
                                            Y = X
                                            Z = d
                                            _ = 0
                                            aa = 40
                                            break a
                                        }
                                    }
                                    if ((f[(ba + 8) >> 2] | 0) == (q | 0)) {
                                        aa = 55
                                        break
                                    }
                                }
                            }
                        } else {
                            Y = 0
                            Z = 0
                            _ = 1
                            aa = 40
                        }
                    while (0)
                    if ((aa | 0) == 40) {
                        aa = 0
                        K = dn(16) | 0
                        f[(K + 8) >> 2] = q
                        f[(K + 12) >> 2] = A
                        f[(K + 4) >> 2] = F
                        f[K >> 2] = 0
                        da = $((((f[s >> 2] | 0) + 1) | 0) >>> 0)
                        ea = $(Z >>> 0)
                        fa = $(n[k >> 2])
                        do
                            if (_ | ($(fa * ea) < da)) {
                                L = (Z << 1) | (((Z >>> 0 < 3) | ((((Z + -1) & Z) | 0) != 0)) & 1)
                                E = ~~$(W($(da / fa))) >>> 0
                                ti(g, L >>> 0 < E >>> 0 ? E : L)
                                L = f[m >> 2] | 0
                                E = (L + -1) | 0
                                if (!(E & L)) {
                                    ga = L
                                    ha = E & F
                                    break
                                }
                                if (F >>> 0 < L >>> 0) {
                                    ga = L
                                    ha = F
                                } else {
                                    ga = L
                                    ha = (F >>> 0) % (L >>> 0) | 0
                                }
                            } else {
                                ga = Z
                                ha = Y
                            }
                        while (0)
                        F = ((f[g >> 2] | 0) + (ha << 2)) | 0
                        q = f[F >> 2] | 0
                        if (!q) {
                            f[K >> 2] = f[t >> 2]
                            f[t >> 2] = K
                            f[F >> 2] = t
                            F = f[K >> 2] | 0
                            if (F | 0) {
                                L = f[(F + 4) >> 2] | 0
                                F = (ga + -1) | 0
                                if (F & ga)
                                    if (L >>> 0 < ga >>> 0) ia = L
                                    else ia = (L >>> 0) % (ga >>> 0) | 0
                                else ia = L & F
                                ja = ((f[g >> 2] | 0) + (ia << 2)) | 0
                                aa = 53
                            }
                        } else {
                            f[K >> 2] = f[q >> 2]
                            ja = q
                            aa = 53
                        }
                        if ((aa | 0) == 53) {
                            aa = 0
                            f[ja >> 2] = K
                        }
                        f[s >> 2] = (f[s >> 2] | 0) + 1
                        aa = 55
                    }
                    if ((aa | 0) == 55) {
                        aa = 0
                        q = v
                        F = f[q >> 2] | 0
                        L = on(F | 0, f[(q + 4) >> 2] | 0, A | 0, 0) | 0
                        Rg(((f[f[w >> 2] >> 2] | 0) + L) | 0, i | 0, F | 0) | 0
                        F = f[j >> 2] | 0
                        f[(F + (z << 2)) >> 2] = A
                        R = F
                        S = (A + 1) | 0
                        T = F
                        U = F
                        V = F
                    }
                    F = (z + 1) | 0
                    ka = f[l >> 2] | 0
                    if (F >>> 0 >= ka >>> 0) break
                    d = f[m >> 2] | 0
                    y = R
                    z = F
                    A = S
                    B = U
                    C = T
                    D = V
                }
                if ((S | 0) == (ka | 0)) la = U
                else {
                    U = (a + 84) | 0
                    if (!(b[U >> 0] | 0)) {
                        V = f[(a + 72) >> 2] | 0
                        D = f[(a + 68) >> 2] | 0
                        C = D
                        if ((V | 0) == (D | 0)) ma = R
                        else {
                            B = (V - D) >> 2
                            D = 0
                            do {
                                V = (C + (D << 2)) | 0
                                f[V >> 2] = f[(T + (f[V >> 2] << 2)) >> 2]
                                D = (D + 1) | 0
                            } while (D >>> 0 < B >>> 0)
                            ma = R
                        }
                    } else {
                        b[U >> 0] = 0
                        U = (a + 68) | 0
                        R = (a + 72) | 0
                        B = f[R >> 2] | 0
                        D = f[U >> 2] | 0
                        T = (B - D) >> 2
                        C = D
                        D = B
                        if (ka >>> 0 <= T >>> 0)
                            if (ka >>> 0 < T >>> 0 ? ((B = (C + (ka << 2)) | 0), (B | 0) != (D | 0)) : 0) {
                                f[R >> 2] = D + (~(((D + -4 - B) | 0) >>> 2) << 2)
                                na = ka
                            } else na = ka
                        else {
                            kh(U, (ka - T) | 0, 1204)
                            na = f[l >> 2] | 0
                        }
                        T = f[j >> 2] | 0
                        if (!na) ma = T
                        else {
                            j = f[(a + 68) >> 2] | 0
                            a = 0
                            do {
                                f[(j + (a << 2)) >> 2] = f[(T + (a << 2)) >> 2]
                                a = (a + 1) | 0
                            } while (a >>> 0 < na >>> 0)
                            ma = T
                        }
                    }
                    f[l >> 2] = S
                    la = ma
                }
                if (!la) oa = S
                else {
                    ma = f[o >> 2] | 0
                    if ((ma | 0) != (la | 0)) f[o >> 2] = ma + (~(((ma + -4 - la) | 0) >>> 2) << 2)
                    br(la)
                    oa = S
                }
            } else oa = 0
            S = f[(g + 8) >> 2] | 0
            if (S | 0) {
                la = S
                do {
                    S = la
                    la = f[la >> 2] | 0
                    br(S)
                } while ((la | 0) != 0)
            }
            la = f[g >> 2] | 0
            f[g >> 2] = 0
            if (!la) {
                u = e
                return oa | 0
            }
            br(la)
            u = e
            return oa | 0
        }
        function fc(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 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,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0,
                na = 0,
                oa = 0,
                pa = 0,
                qa = 0,
                ra = 0,
                sa = 0,
                ta = 0
            e = u
            u = (u + 96) | 0
            g = (e + 92) | 0
            h = (e + 88) | 0
            i = (e + 72) | 0
            j = (e + 48) | 0
            k = (e + 24) | 0
            l = e
            m = (a + 16) | 0
            n = f[m >> 2] | 0
            o = f[c >> 2] | 0
            f[i >> 2] = n
            f[(i + 4) >> 2] = o
            c = (i + 8) | 0
            f[c >> 2] = o
            b[(i + 12) >> 0] = 1
            p = f[((f[(n + 28) >> 2] | 0) + (o << 2)) >> 2] | 0
            n = (a + 20) | 0
            q = f[n >> 2] | 0
            r = f[q >> 2] | 0
            if ((((f[(q + 4) >> 2] | 0) - r) >> 2) >>> 0 <= p >>> 0) mq(q)
            q = (a + 8) | 0
            s = f[((f[q >> 2] | 0) + (f[(r + (p << 2)) >> 2] << 2)) >> 2] | 0
            p = (a + 4) | 0
            r = f[p >> 2] | 0
            if (!(b[(r + 84) >> 0] | 0)) t = f[((f[(r + 68) >> 2] | 0) + (s << 2)) >> 2] | 0
            else t = s
            f[j >> 2] = 0
            f[(j + 4) >> 2] = 0
            f[(j + 8) >> 2] = 0
            f[(j + 12) >> 2] = 0
            f[(j + 16) >> 2] = 0
            f[(j + 20) >> 2] = 0
            f[h >> 2] = t
            t = b[(r + 24) >> 0] | 0
            f[g >> 2] = f[h >> 2]
            ub(r, g, t, j) | 0
            t = (a + 28) | 0
            a = (f[t >> 2] | 0) == 0
            a: do
                if ((o | 0) != -1) {
                    r = (k + 8) | 0
                    s = (j + 8) | 0
                    v = (k + 16) | 0
                    w = (j + 16) | 0
                    x = (l + 8) | 0
                    y = (l + 16) | 0
                    z = o
                    A = o
                    B = 0
                    C = 0
                    D = 0
                    E = 0
                    F = 0
                    G = 0
                    H = a
                    J = o
                    while (1) {
                        do
                            if (H) {
                                K = (J + 1) | 0
                                if ((J | 0) != -1) {
                                    L = ((K >>> 0) % 3 | 0 | 0) == 0 ? (J + -2) | 0 : K
                                    if ((z | 0) != -1)
                                        if (!((z >>> 0) % 3 | 0)) {
                                            M = z
                                            N = (z + 2) | 0
                                            O = L
                                            P = z
                                            break
                                        } else {
                                            M = z
                                            N = (z + -1) | 0
                                            O = L
                                            P = z
                                            break
                                        }
                                    else {
                                        M = -1
                                        N = -1
                                        O = L
                                        P = -1
                                    }
                                } else {
                                    M = z
                                    N = -1
                                    O = -1
                                    P = -1
                                }
                            } else {
                                L = (A + 1) | 0
                                K = ((L >>> 0) % 3 | 0 | 0) == 0 ? (A + -2) | 0 : L
                                if (!((A >>> 0) % 3 | 0)) {
                                    M = z
                                    N = (A + 2) | 0
                                    O = K
                                    P = J
                                    break
                                } else {
                                    M = z
                                    N = (A + -1) | 0
                                    O = K
                                    P = J
                                    break
                                }
                            }
                        while (0)
                        K = f[((f[((f[m >> 2] | 0) + 28) >> 2] | 0) + (O << 2)) >> 2] | 0
                        Q = f[n >> 2] | 0
                        L = f[Q >> 2] | 0
                        if ((((f[(Q + 4) >> 2] | 0) - L) >> 2) >>> 0 <= K >>> 0) {
                            R = 17
                            break
                        }
                        S = f[((f[q >> 2] | 0) + (f[(L + (K << 2)) >> 2] << 2)) >> 2] | 0
                        K = f[p >> 2] | 0
                        if (!(b[(K + 84) >> 0] | 0)) T = f[((f[(K + 68) >> 2] | 0) + (S << 2)) >> 2] | 0
                        else T = S
                        f[k >> 2] = 0
                        f[(k + 4) >> 2] = 0
                        f[(k + 8) >> 2] = 0
                        f[(k + 12) >> 2] = 0
                        f[(k + 16) >> 2] = 0
                        f[(k + 20) >> 2] = 0
                        f[h >> 2] = T
                        S = b[(K + 24) >> 0] | 0
                        f[g >> 2] = f[h >> 2]
                        ub(K, g, S, k) | 0
                        S = f[((f[((f[m >> 2] | 0) + 28) >> 2] | 0) + (N << 2)) >> 2] | 0
                        U = f[n >> 2] | 0
                        K = f[U >> 2] | 0
                        if ((((f[(U + 4) >> 2] | 0) - K) >> 2) >>> 0 <= S >>> 0) {
                            R = 21
                            break
                        }
                        L = f[((f[q >> 2] | 0) + (f[(K + (S << 2)) >> 2] << 2)) >> 2] | 0
                        S = f[p >> 2] | 0
                        if (!(b[(S + 84) >> 0] | 0)) V = f[((f[(S + 68) >> 2] | 0) + (L << 2)) >> 2] | 0
                        else V = L
                        f[l >> 2] = 0
                        f[(l + 4) >> 2] = 0
                        f[(l + 8) >> 2] = 0
                        f[(l + 12) >> 2] = 0
                        f[(l + 16) >> 2] = 0
                        f[(l + 20) >> 2] = 0
                        f[h >> 2] = V
                        L = b[(S + 24) >> 0] | 0
                        f[g >> 2] = f[h >> 2]
                        ub(S, g, L, l) | 0
                        L = k
                        S = j
                        K = f[S >> 2] | 0
                        W = f[(S + 4) >> 2] | 0
                        S = Vn(f[L >> 2] | 0, f[(L + 4) >> 2] | 0, K | 0, W | 0) | 0
                        L = I
                        X = r
                        Y = s
                        Z = f[Y >> 2] | 0
                        _ = f[(Y + 4) >> 2] | 0
                        Y = Vn(f[X >> 2] | 0, f[(X + 4) >> 2] | 0, Z | 0, _ | 0) | 0
                        X = I
                        $ = v
                        aa = w
                        ba = f[aa >> 2] | 0
                        ca = f[(aa + 4) >> 2] | 0
                        aa = Vn(f[$ >> 2] | 0, f[($ + 4) >> 2] | 0, ba | 0, ca | 0) | 0
                        $ = I
                        da = l
                        ea = Vn(f[da >> 2] | 0, f[(da + 4) >> 2] | 0, K | 0, W | 0) | 0
                        W = I
                        K = x
                        da = Vn(f[K >> 2] | 0, f[(K + 4) >> 2] | 0, Z | 0, _ | 0) | 0
                        _ = I
                        Z = y
                        K = Vn(f[Z >> 2] | 0, f[(Z + 4) >> 2] | 0, ba | 0, ca | 0) | 0
                        ca = I
                        ba = on(K | 0, ca | 0, Y | 0, X | 0) | 0
                        Z = I
                        fa = on(da | 0, _ | 0, aa | 0, $ | 0) | 0
                        ga = I
                        ha = on(ea | 0, W | 0, aa | 0, $ | 0) | 0
                        $ = I
                        aa = on(K | 0, ca | 0, S | 0, L | 0) | 0
                        ca = I
                        K = on(da | 0, _ | 0, S | 0, L | 0) | 0
                        L = I
                        S = on(ea | 0, W | 0, Y | 0, X | 0) | 0
                        X = I
                        Y = Vn(B | 0, C | 0, fa | 0, ga | 0) | 0
                        ga = Tn(Y | 0, I | 0, ba | 0, Z | 0) | 0
                        Z = I
                        ba = Tn(ha | 0, $ | 0, D | 0, E | 0) | 0
                        $ = Vn(ba | 0, I | 0, aa | 0, ca | 0) | 0
                        ca = I
                        aa = Vn(F | 0, G | 0, S | 0, X | 0) | 0
                        X = Tn(aa | 0, I | 0, K | 0, L | 0) | 0
                        L = I
                        xg(i)
                        A = f[c >> 2] | 0
                        K = (f[t >> 2] | 0) == 0
                        if ((A | 0) == -1) {
                            ia = K
                            ja = Z
                            ka = ga
                            la = ca
                            ma = $
                            na = L
                            oa = X
                            break a
                        } else {
                            z = M
                            B = ga
                            C = Z
                            D = $
                            E = ca
                            F = X
                            G = L
                            H = K
                            J = P
                        }
                    }
                    if ((R | 0) == 17) mq(Q)
                    else if ((R | 0) == 21) mq(U)
                } else {
                    ia = a
                    ja = 0
                    ka = 0
                    la = 0
                    ma = 0
                    na = 0
                    oa = 0
                }
            while (0)
            a = ((ja | 0) > -1) | (((ja | 0) == -1) & (ka >>> 0 > 4294967295))
            U = Vn(0, 0, ka | 0, ja | 0) | 0
            R = a ? ja : I
            Q = ((la | 0) > -1) | (((la | 0) == -1) & (ma >>> 0 > 4294967295))
            P = Vn(0, 0, ma | 0, la | 0) | 0
            M = Q ? la : I
            t = ((na | 0) > -1) | (((na | 0) == -1) & (oa >>> 0 > 4294967295))
            c = Vn(0, 0, oa | 0, na | 0) | 0
            i = Tn((Q ? ma : P) | 0, M | 0, (t ? oa : c) | 0, (t ? na : I) | 0) | 0
            t = Tn(i | 0, I | 0, (a ? ka : U) | 0, R | 0) | 0
            R = I
            if (ia) {
                if ((t | 0) <= 536870912) {
                    pa = ka
                    qa = ma
                    ra = oa
                    f[d >> 2] = pa
                    sa = (d + 4) | 0
                    f[sa >> 2] = qa
                    ta = (d + 8) | 0
                    f[ta >> 2] = ra
                    u = e
                    return
                }
                ia = Wn(t | 0, R | 0, 29) | 0
                U = ia & 7
                ia = zk(ka | 0, ja | 0, U | 0, 0) | 0
                a = zk(ma | 0, la | 0, U | 0, 0) | 0
                i = zk(oa | 0, na | 0, U | 0, 0) | 0
                pa = ia
                qa = a
                ra = i
                f[d >> 2] = pa
                sa = (d + 4) | 0
                f[sa >> 2] = qa
                ta = (d + 8) | 0
                f[ta >> 2] = ra
                u = e
                return
            } else {
                if (!(((R | 0) > 0) | (((R | 0) == 0) & (t >>> 0 > 536870912)))) {
                    pa = ka
                    qa = ma
                    ra = oa
                    f[d >> 2] = pa
                    sa = (d + 4) | 0
                    f[sa >> 2] = qa
                    ta = (d + 8) | 0
                    f[ta >> 2] = ra
                    u = e
                    return
                }
                i = Wn(t | 0, R | 0, 29) | 0
                R = I
                t = zk(ka | 0, ja | 0, i | 0, R | 0) | 0
                ja = zk(ma | 0, la | 0, i | 0, R | 0) | 0
                la = zk(oa | 0, na | 0, i | 0, R | 0) | 0
                pa = t
                qa = ja
                ra = la
                f[d >> 2] = pa
                sa = (d + 4) | 0
                f[sa >> 2] = qa
                ta = (d + 8) | 0
                f[ta >> 2] = ra
                u = e
                return
            }
        }
        function gc(a, c, e) {
            a = a | 0
            c = c | 0
            e = e | 0
            var g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                J = 0,
                K = 0,
                L = 0,
                M = 0,
                N = 0,
                O = 0,
                P = 0,
                Q = 0,
                R = 0,
                S = 0,
                T = 0,
                U = Oa,
                V = Oa,
                X = Oa,
                Y = 0,
                Z = 0,
                _ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0
            g = u
            u = (u + 48) | 0
            i = (g + 28) | 0
            j = (g + 8) | 0
            k = g
            l = (g + 16) | 0
            m = (i + 16) | 0
            f[i >> 2] = 0
            f[(i + 4) >> 2] = 0
            f[(i + 8) >> 2] = 0
            f[(i + 12) >> 2] = 0
            n[m >> 2] = $(1.0)
            o = (a + 80) | 0
            p = f[o >> 2] | 0
            f[l >> 2] = 0
            q = (l + 4) | 0
            f[q >> 2] = 0
            f[(l + 8) >> 2] = 0
            if (p) {
                if (p >>> 0 > 1073741823) mq(l)
                r = p << 2
                s = dn(r) | 0
                f[l >> 2] = s
                t = (s + (p << 2)) | 0
                f[(l + 8) >> 2] = t
                hj(s | 0, 0, r | 0) | 0
                f[q >> 2] = t
                t = f[e >> 2] | 0
                e = (c + 48) | 0
                r = (c + 40) | 0
                s = (i + 4) | 0
                p = (i + 12) | 0
                v = (i + 8) | 0
                w = (a + 40) | 0
                x = (a + 64) | 0
                y = 0
                z = 0
                while (1) {
                    A = e
                    B = f[A >> 2] | 0
                    C = f[(A + 4) >> 2] | 0
                    A = r
                    D = on(f[A >> 2] | 0, f[(A + 4) >> 2] | 0, (t + y) | 0, 0) | 0
                    A = Tn(D | 0, I | 0, B | 0, C | 0) | 0
                    C = ((f[f[c >> 2] >> 2] | 0) + A) | 0
                    A = C
                    B = h[A >> 0] | (h[(A + 1) >> 0] << 8) | (h[(A + 2) >> 0] << 16) | (h[(A + 3) >> 0] << 24)
                    A = (C + 4) | 0
                    C = h[A >> 0] | (h[(A + 1) >> 0] << 8) | (h[(A + 2) >> 0] << 16) | (h[(A + 3) >> 0] << 24)
                    A = j
                    f[A >> 2] = B
                    f[(A + 4) >> 2] = C
                    A = k
                    f[A >> 2] = B
                    f[(A + 4) >> 2] = C
                    C = kf(i, k) | 0
                    if (!C) {
                        A = k
                        B = f[A >> 2] | 0
                        D = f[(A + 4) >> 2] | 0
                        A = B & 65535
                        E = Wn(B | 0, D | 0, 16) | 0
                        F = E & 65535
                        G = D & 65535
                        H = Wn(B | 0, D | 0, 48) | 0
                        J = H & 65535
                        K = (((((((A ^ 318) & 65535) + 239) ^ (E & 65535)) + 239) ^ (D & 65535)) + 239) ^ (H & 65535)
                        H = f[s >> 2] | 0
                        E = (H | 0) == 0
                        a: do
                            if (!E) {
                                L = (H + -1) | 0
                                M = ((L & H) | 0) == 0
                                if (!M)
                                    if (K >>> 0 < H >>> 0) N = K
                                    else N = (K >>> 0) % (H >>> 0) | 0
                                else N = K & L
                                O = f[((f[i >> 2] | 0) + (N << 2)) >> 2] | 0
                                if ((O | 0) != 0 ? ((P = f[O >> 2] | 0), (P | 0) != 0) : 0) {
                                    if (M) {
                                        M = P
                                        while (1) {
                                            O = f[(M + 4) >> 2] | 0
                                            if (!(((O | 0) == (K | 0)) | (((O & L) | 0) == (N | 0)))) {
                                                Q = N
                                                R = 31
                                                break a
                                            }
                                            O = (M + 8) | 0
                                            if (
                                                (((d[O >> 1] | 0) == (A << 16) >> 16 ? (d[(O + 2) >> 1] | 0) == (F << 16) >> 16 : 0) ? (d[(M + 12) >> 1] | 0) == (G << 16) >> 16 : 0)
                                                    ? (d[(O + 6) >> 1] | 0) == (J << 16) >> 16
                                                    : 0
                                            )
                                                break a
                                            M = f[M >> 2] | 0
                                            if (!M) {
                                                Q = N
                                                R = 31
                                                break a
                                            }
                                        }
                                    } else S = P
                                    while (1) {
                                        M = f[(S + 4) >> 2] | 0
                                        if ((M | 0) != (K | 0)) {
                                            if (M >>> 0 < H >>> 0) T = M
                                            else T = (M >>> 0) % (H >>> 0) | 0
                                            if ((T | 0) != (N | 0)) {
                                                Q = N
                                                R = 31
                                                break a
                                            }
                                        }
                                        M = (S + 8) | 0
                                        if (
                                            (((d[M >> 1] | 0) == (A << 16) >> 16 ? (d[(M + 2) >> 1] | 0) == (F << 16) >> 16 : 0) ? (d[(S + 12) >> 1] | 0) == (G << 16) >> 16 : 0)
                                                ? (d[(M + 6) >> 1] | 0) == (J << 16) >> 16
                                                : 0
                                        )
                                            break a
                                        S = f[S >> 2] | 0
                                        if (!S) {
                                            Q = N
                                            R = 31
                                            break
                                        }
                                    }
                                } else {
                                    Q = N
                                    R = 31
                                }
                            } else {
                                Q = 0
                                R = 31
                            }
                        while (0)
                        if ((R | 0) == 31) {
                            R = 0
                            J = dn(20) | 0
                            G = (J + 8) | 0
                            F = G
                            d[F >> 1] = B
                            d[(F + 2) >> 1] = B >>> 16
                            F = (G + 4) | 0
                            d[F >> 1] = D
                            d[(F + 2) >> 1] = D >>> 16
                            f[(J + 16) >> 2] = z
                            f[(J + 4) >> 2] = K
                            f[J >> 2] = 0
                            U = $((((f[p >> 2] | 0) + 1) | 0) >>> 0)
                            V = $(H >>> 0)
                            X = $(n[m >> 2])
                            do
                                if (E | ($(X * V) < U)) {
                                    F = (H << 1) | (((H >>> 0 < 3) | ((((H + -1) & H) | 0) != 0)) & 1)
                                    G = ~~$(W($(U / X))) >>> 0
                                    Ch(i, F >>> 0 < G >>> 0 ? G : F)
                                    F = f[s >> 2] | 0
                                    G = (F + -1) | 0
                                    if (!(G & F)) {
                                        Y = F
                                        Z = G & K
                                        break
                                    }
                                    if (K >>> 0 < F >>> 0) {
                                        Y = F
                                        Z = K
                                    } else {
                                        Y = F
                                        Z = (K >>> 0) % (F >>> 0) | 0
                                    }
                                } else {
                                    Y = H
                                    Z = Q
                                }
                            while (0)
                            H = ((f[i >> 2] | 0) + (Z << 2)) | 0
                            K = f[H >> 2] | 0
                            if (!K) {
                                f[J >> 2] = f[v >> 2]
                                f[v >> 2] = J
                                f[H >> 2] = v
                                H = f[J >> 2] | 0
                                if (H | 0) {
                                    E = f[(H + 4) >> 2] | 0
                                    H = (Y + -1) | 0
                                    if (H & Y)
                                        if (E >>> 0 < Y >>> 0) _ = E
                                        else _ = (E >>> 0) % (Y >>> 0) | 0
                                    else _ = E & H
                                    aa = ((f[i >> 2] | 0) + (_ << 2)) | 0
                                    R = 44
                                }
                            } else {
                                f[J >> 2] = f[K >> 2]
                                aa = K
                                R = 44
                            }
                            if ((R | 0) == 44) {
                                R = 0
                                f[aa >> 2] = J
                            }
                            f[p >> 2] = (f[p >> 2] | 0) + 1
                        }
                        K = w
                        H = f[K >> 2] | 0
                        E = on(H | 0, f[(K + 4) >> 2] | 0, z | 0, 0) | 0
                        Rg(((f[f[x >> 2] >> 2] | 0) + E) | 0, j | 0, H | 0) | 0
                        H = f[l >> 2] | 0
                        f[(H + (y << 2)) >> 2] = z
                        ba = (z + 1) | 0
                        ca = H
                    } else {
                        H = f[l >> 2] | 0
                        f[(H + (y << 2)) >> 2] = f[(C + 16) >> 2]
                        ba = z
                        ca = H
                    }
                    y = (y + 1) | 0
                    da = f[o >> 2] | 0
                    if (y >>> 0 >= da >>> 0) break
                    else z = ba
                }
                if ((ba | 0) == (da | 0)) ea = ca
                else {
                    z = (a + 84) | 0
                    if (!(b[z >> 0] | 0)) {
                        y = f[(a + 72) >> 2] | 0
                        j = f[(a + 68) >> 2] | 0
                        x = j
                        if ((y | 0) == (j | 0)) fa = ca
                        else {
                            w = (y - j) >> 2
                            j = 0
                            do {
                                y = (x + (j << 2)) | 0
                                f[y >> 2] = f[(ca + (f[y >> 2] << 2)) >> 2]
                                j = (j + 1) | 0
                            } while (j >>> 0 < w >>> 0)
                            fa = ca
                        }
                    } else {
                        b[z >> 0] = 0
                        z = (a + 68) | 0
                        ca = (a + 72) | 0
                        w = f[ca >> 2] | 0
                        j = f[z >> 2] | 0
                        x = (w - j) >> 2
                        y = j
                        j = w
                        if (da >>> 0 <= x >>> 0)
                            if (da >>> 0 < x >>> 0 ? ((w = (y + (da << 2)) | 0), (w | 0) != (j | 0)) : 0) {
                                f[ca >> 2] = j + (~(((j + -4 - w) | 0) >>> 2) << 2)
                                ga = da
                            } else ga = da
                        else {
                            kh(z, (da - x) | 0, 1204)
                            ga = f[o >> 2] | 0
                        }
                        x = f[l >> 2] | 0
                        if (!ga) fa = x
                        else {
                            l = f[(a + 68) >> 2] | 0
                            a = 0
                            do {
                                f[(l + (a << 2)) >> 2] = f[(x + (a << 2)) >> 2]
                                a = (a + 1) | 0
                            } while (a >>> 0 < ga >>> 0)
                            fa = x
                        }
                    }
                    f[o >> 2] = ba
                    ea = fa
                }
                if (!ea) ha = ba
                else {
                    fa = f[q >> 2] | 0
                    if ((fa | 0) != (ea | 0)) f[q >> 2] = fa + (~(((fa + -4 - ea) | 0) >>> 2) << 2)
                    br(ea)
                    ha = ba
                }
            } else ha = 0
            ba = f[(i + 8) >> 2] | 0
            if (ba | 0) {
                ea = ba
                do {
                    ba = ea
                    ea = f[ea >> 2] | 0
                    br(ba)
                } while ((ea | 0) != 0)
            }
            ea = f[i >> 2] | 0
            f[i >> 2] = 0
            if (!ea) {
                u = g
                return ha | 0
            }
            br(ea)
            u = g
            return ha | 0
        }
        function hc(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0
            c = u
            u = (u + 16) | 0
            d = (c + 8) | 0
            e = c
            g = (c + 4) | 0
            h = (a + 16) | 0
            i = f[h >> 2] | 0
            j = (a + 20) | 0
            k = f[j >> 2] | 0
            if ((k | 0) == (i | 0)) l = i
            else {
                m = (k + (~(((k + -4 - i) | 0) >>> 2) << 2)) | 0
                f[j >> 2] = m
                l = m
            }
            m = (a + 24) | 0
            if ((l | 0) == (f[m >> 2] | 0)) {
                Ci(h, b)
                n = f[h >> 2] | 0
                o = f[j >> 2] | 0
            } else {
                f[l >> 2] = f[b >> 2]
                k = (l + 4) | 0
                f[j >> 2] = k
                n = i
                o = k
            }
            k = f[(a + 8) >> 2] | 0
            i = ((f[(k + 100) >> 2] | 0) - (f[(k + 96) >> 2] | 0)) | 0
            k = ((i | 0) / 12) | 0
            if ((n | 0) == (o | 0)) {
                u = c
                return 1
            }
            n = (a + 28) | 0
            l = (i | 0) > 0
            i = (a + 164) | 0
            p = (a + 12) | 0
            q = (a + 76) | 0
            r = (a + 80) | 0
            s = (a + 72) | 0
            t = (a + 152) | 0
            v = (a + 84) | 0
            w = (a + 272) | 0
            x = (a + 276) | 0
            y = (a + 268) | 0
            z = (a + 168) | 0
            A = (a + 140) | 0
            B = (a + 120) | 0
            C = o
            do {
                o = f[(C + -4) >> 2] | 0
                f[b >> 2] = o
                a: do
                    if ((o | 0) != -1 ? ((D = ((o >>> 0) / 3) | 0), (E = f[n >> 2] | 0), ((f[(E + ((D >>> 5) << 2)) >> 2] & (1 << (D & 31))) | 0) == 0) : 0) {
                        if (l) {
                            D = 0
                            F = E
                            b: while (1) {
                                E = (D + 1) | 0
                                f[i >> 2] = (f[i >> 2] | 0) + 1
                                G = f[b >> 2] | 0
                                H = (G | 0) == -1 ? -1 : ((G >>> 0) / 3) | 0
                                G = (F + ((H >>> 5) << 2)) | 0
                                f[G >> 2] = (1 << (H & 31)) | f[G >> 2]
                                G = f[q >> 2] | 0
                                if ((G | 0) == (f[r >> 2] | 0)) Ci(s, b)
                                else {
                                    f[G >> 2] = f[b >> 2]
                                    f[q >> 2] = G + 4
                                }
                                G = f[b >> 2] | 0
                                if ((G | 0) == -1) I = -1
                                else I = f[((f[f[p >> 2] >> 2] | 0) + (G << 2)) >> 2] | 0
                                J = (f[((f[t >> 2] | 0) + (I << 2)) >> 2] | 0) != -1
                                K = ((f[v >> 2] | 0) + ((I >>> 5) << 2)) | 0
                                L = 1 << (I & 31)
                                M = f[K >> 2] | 0
                                do
                                    if (!(M & L)) {
                                        f[K >> 2] = M | L
                                        if (J) {
                                            N = f[b >> 2] | 0
                                            O = 30
                                            break
                                        }
                                        f[d >> 2] = 0
                                        P = f[w >> 2] | 0
                                        if ((P | 0) == (f[x >> 2] | 0)) Ci(y, d)
                                        else {
                                            f[P >> 2] = 0
                                            f[w >> 2] = P + 4
                                        }
                                        P = f[b >> 2] | 0
                                        Q = (P + 1) | 0
                                        if ((P | 0) != -1 ? ((R = ((Q >>> 0) % 3 | 0 | 0) == 0 ? (P + -2) | 0 : Q), (R | 0) != -1) : 0)
                                            S = f[((f[((f[p >> 2] | 0) + 12) >> 2] | 0) + (R << 2)) >> 2] | 0
                                        else S = -1
                                        f[b >> 2] = S
                                    } else {
                                        N = G
                                        O = 30
                                    }
                                while (0)
                                if ((O | 0) == 30) {
                                    O = 0
                                    G = (N + 1) | 0
                                    if ((N | 0) == -1) {
                                        O = 35
                                        break
                                    }
                                    L = ((G >>> 0) % 3 | 0 | 0) == 0 ? (N + -2) | 0 : G
                                    if ((L | 0) == -1) T = -1
                                    else T = f[((f[((f[p >> 2] | 0) + 12) >> 2] | 0) + (L << 2)) >> 2] | 0
                                    f[e >> 2] = T
                                    L = ((((N >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + N) | 0
                                    if ((L | 0) == -1) U = -1
                                    else U = f[((f[((f[p >> 2] | 0) + 12) >> 2] | 0) + (L << 2)) >> 2] | 0
                                    L = (T | 0) == -1
                                    M = L ? -1 : ((T >>> 0) / 3) | 0
                                    V = (U | 0) == -1
                                    W = V ? -1 : ((U >>> 0) / 3) | 0
                                    K = ((G >>> 0) % 3 | 0 | 0) == 0 ? (N + -2) | 0 : G
                                    if (
                                        ((K | 0) != -1 ? ((G = f[((f[p >> 2] | 0) + 12) >> 2] | 0), (R = f[(G + (K << 2)) >> 2] | 0), (R | 0) != -1) : 0)
                                            ? ((K = ((R >>> 0) / 3) | 0), (R = f[n >> 2] | 0), ((f[(R + ((K >>> 5) << 2)) >> 2] & (1 << (K & 31))) | 0) == 0)
                                            : 0
                                    ) {
                                        K = ((((N >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + N) | 0
                                        do
                                            if ((K | 0) != -1) {
                                                Q = f[(G + (K << 2)) >> 2] | 0
                                                if ((Q | 0) == -1) break
                                                P = ((Q >>> 0) / 3) | 0
                                                if (!(f[(R + ((P >>> 5) << 2)) >> 2] & (1 << (P & 31)))) {
                                                    O = 63
                                                    break b
                                                }
                                            }
                                        while (0)
                                        if (!V) jf(a, f[i >> 2] | 0, H, 0, W)
                                        f[d >> 2] = 3
                                        R = f[w >> 2] | 0
                                        if ((R | 0) == (f[x >> 2] | 0)) Ci(y, d)
                                        else {
                                            f[R >> 2] = 3
                                            f[w >> 2] = R + 4
                                        }
                                        X = f[e >> 2] | 0
                                    } else {
                                        if (!L) {
                                            jf(a, f[i >> 2] | 0, H, 1, M)
                                            R = f[b >> 2] | 0
                                            if ((R | 0) == -1) {
                                                O = 44
                                                break
                                            } else Y = R
                                        } else Y = N
                                        R = ((((Y >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + Y) | 0
                                        if ((R | 0) == -1) {
                                            O = 44
                                            break
                                        }
                                        K = f[((f[((f[p >> 2] | 0) + 12) >> 2] | 0) + (R << 2)) >> 2] | 0
                                        if ((K | 0) == -1) {
                                            O = 44
                                            break
                                        }
                                        R = ((K >>> 0) / 3) | 0
                                        if ((f[((f[n >> 2] | 0) + ((R >>> 5) << 2)) >> 2] & (1 << (R & 31))) | 0) {
                                            O = 44
                                            break
                                        }
                                        f[d >> 2] = 5
                                        R = f[w >> 2] | 0
                                        if ((R | 0) == (f[x >> 2] | 0)) Ci(y, d)
                                        else {
                                            f[R >> 2] = 5
                                            f[w >> 2] = R + 4
                                        }
                                        X = U
                                    }
                                    f[b >> 2] = X
                                }
                                if ((E | 0) >= (k | 0)) break a
                                D = E
                                F = f[n >> 2] | 0
                            }
                            do
                                if ((O | 0) == 35) {
                                    O = 0
                                    f[e >> 2] = -1
                                    O = 46
                                } else if ((O | 0) == 44) {
                                    O = 0
                                    if (V) O = 46
                                    else {
                                        jf(a, f[i >> 2] | 0, H, 0, W)
                                        O = 46
                                    }
                                } else if ((O | 0) == 63) {
                                    O = 0
                                    f[d >> 2] = 1
                                    F = f[w >> 2] | 0
                                    if ((F | 0) == (f[x >> 2] | 0)) Ci(y, d)
                                    else {
                                        f[F >> 2] = 1
                                        f[w >> 2] = F + 4
                                    }
                                    f[z >> 2] = (f[z >> 2] | 0) + 1
                                    if (J ? ((F = f[((f[t >> 2] | 0) + (I << 2)) >> 2] | 0), (((1 << (F & 31)) & f[((f[A >> 2] | 0) + ((F >>> 5) << 2)) >> 2]) | 0) == 0) : 0) {
                                        f[g >> 2] = f[b >> 2]
                                        f[d >> 2] = f[g >> 2]
                                        Ce(a, d, 0) | 0
                                    }
                                    F = f[i >> 2] | 0
                                    f[d >> 2] = H
                                    D = Sd(B, d) | 0
                                    f[D >> 2] = F
                                    F = f[j >> 2] | 0
                                    f[(F + -4) >> 2] = U
                                    if ((F | 0) == (f[m >> 2] | 0)) {
                                        Ci(h, e)
                                        break
                                    } else {
                                        f[F >> 2] = f[e >> 2]
                                        f[j >> 2] = F + 4
                                        break
                                    }
                                }
                            while (0)
                            if ((O | 0) == 46) {
                                O = 0
                                f[d >> 2] = 7
                                F = f[w >> 2] | 0
                                if ((F | 0) == (f[x >> 2] | 0)) Ci(y, d)
                                else {
                                    f[F >> 2] = 7
                                    f[w >> 2] = F + 4
                                }
                                f[j >> 2] = (f[j >> 2] | 0) + -4
                            }
                        }
                    } else O = 11
                while (0)
                if ((O | 0) == 11) {
                    O = 0
                    f[j >> 2] = C + -4
                }
                C = f[j >> 2] | 0
            } while ((f[h >> 2] | 0) != (C | 0))
            u = c
            return 1
        }
        function ic(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                J = 0,
                K = 0,
                L = 0,
                M = 0,
                N = 0,
                O = 0,
                P = 0,
                Q = 0,
                R = 0,
                S = 0,
                T = 0,
                U = Oa,
                V = Oa,
                X = Oa,
                Y = 0,
                Z = 0,
                _ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0
            e = u
            u = (u + 48) | 0
            g = (e + 20) | 0
            i = (e + 16) | 0
            j = (e + 12) | 0
            k = e
            l = (g + 16) | 0
            f[g >> 2] = 0
            f[(g + 4) >> 2] = 0
            f[(g + 8) >> 2] = 0
            f[(g + 12) >> 2] = 0
            n[l >> 2] = $(1.0)
            m = (a + 80) | 0
            o = f[m >> 2] | 0
            f[k >> 2] = 0
            p = (k + 4) | 0
            f[p >> 2] = 0
            f[(k + 8) >> 2] = 0
            if (o) {
                if (o >>> 0 > 1073741823) mq(k)
                q = o << 2
                r = dn(q) | 0
                f[k >> 2] = r
                s = (r + (o << 2)) | 0
                f[(k + 8) >> 2] = s
                hj(r | 0, 0, q | 0) | 0
                f[p >> 2] = s
                s = f[d >> 2] | 0
                d = (c + 48) | 0
                q = (c + 40) | 0
                r = (g + 4) | 0
                o = (g + 12) | 0
                t = (g + 8) | 0
                v = (a + 40) | 0
                w = (a + 64) | 0
                x = 0
                y = 0
                while (1) {
                    z = d
                    A = f[z >> 2] | 0
                    B = f[(z + 4) >> 2] | 0
                    z = q
                    C = on(f[z >> 2] | 0, f[(z + 4) >> 2] | 0, (s + x) | 0, 0) | 0
                    z = Tn(C | 0, I | 0, A | 0, B | 0) | 0
                    B = ((f[f[c >> 2] >> 2] | 0) + z) | 0
                    z = h[B >> 0] | (h[(B + 1) >> 0] << 8) | (h[(B + 2) >> 0] << 16) | (h[(B + 3) >> 0] << 24)
                    f[i >> 2] = z
                    f[j >> 2] = z
                    z = pf(g, j) | 0
                    if (!z) {
                        B = f[j >> 2] | 0
                        A = B & 255
                        C = B >>> 8
                        D = C & 255
                        E = B >>> 16
                        F = E & 255
                        G = B >>> 24
                        H = G & 255
                        J = C & 255
                        C = E & 255
                        E = (((((((B & 255) ^ 318) + 239) ^ J) + 239) ^ C) + 239) ^ G
                        G = f[r >> 2] | 0
                        K = (G | 0) == 0
                        a: do
                            if (!K) {
                                L = (G + -1) | 0
                                M = ((L & G) | 0) == 0
                                if (!M)
                                    if (E >>> 0 < G >>> 0) N = E
                                    else N = (E >>> 0) % (G >>> 0) | 0
                                else N = E & L
                                O = f[((f[g >> 2] | 0) + (N << 2)) >> 2] | 0
                                if ((O | 0) != 0 ? ((P = f[O >> 2] | 0), (P | 0) != 0) : 0) {
                                    if (M) {
                                        M = P
                                        while (1) {
                                            O = f[(M + 4) >> 2] | 0
                                            if (!(((O | 0) == (E | 0)) | (((O & L) | 0) == (N | 0)))) {
                                                Q = N
                                                R = 31
                                                break a
                                            }
                                            O = (M + 8) | 0
                                            if (
                                                (((b[O >> 0] | 0) == (A << 24) >> 24 ? (b[(O + 1) >> 0] | 0) == (D << 24) >> 24 : 0) ? (b[(O + 2) >> 0] | 0) == (F << 24) >> 24 : 0)
                                                    ? (b[(O + 3) >> 0] | 0) == (H << 24) >> 24
                                                    : 0
                                            )
                                                break a
                                            M = f[M >> 2] | 0
                                            if (!M) {
                                                Q = N
                                                R = 31
                                                break a
                                            }
                                        }
                                    } else S = P
                                    while (1) {
                                        M = f[(S + 4) >> 2] | 0
                                        if ((M | 0) != (E | 0)) {
                                            if (M >>> 0 < G >>> 0) T = M
                                            else T = (M >>> 0) % (G >>> 0) | 0
                                            if ((T | 0) != (N | 0)) {
                                                Q = N
                                                R = 31
                                                break a
                                            }
                                        }
                                        M = (S + 8) | 0
                                        if (
                                            (((b[M >> 0] | 0) == (A << 24) >> 24 ? (b[(M + 1) >> 0] | 0) == (D << 24) >> 24 : 0) ? (b[(M + 2) >> 0] | 0) == (F << 24) >> 24 : 0)
                                                ? (b[(M + 3) >> 0] | 0) == (H << 24) >> 24
                                                : 0
                                        )
                                            break a
                                        S = f[S >> 2] | 0
                                        if (!S) {
                                            Q = N
                                            R = 31
                                            break
                                        }
                                    }
                                } else {
                                    Q = N
                                    R = 31
                                }
                            } else {
                                Q = 0
                                R = 31
                            }
                        while (0)
                        if ((R | 0) == 31) {
                            R = 0
                            H = dn(16) | 0
                            F = (H + 8) | 0
                            D = (B & -16776961) | (C << 16) | (J << 8)
                            b[F >> 0] = D
                            b[(F + 1) >> 0] = D >> 8
                            b[(F + 2) >> 0] = D >> 16
                            b[(F + 3) >> 0] = D >> 24
                            f[(H + 12) >> 2] = y
                            f[(H + 4) >> 2] = E
                            f[H >> 2] = 0
                            U = $((((f[o >> 2] | 0) + 1) | 0) >>> 0)
                            V = $(G >>> 0)
                            X = $(n[l >> 2])
                            do
                                if (K | ($(X * V) < U)) {
                                    D = (G << 1) | (((G >>> 0 < 3) | ((((G + -1) & G) | 0) != 0)) & 1)
                                    F = ~~$(W($(U / X))) >>> 0
                                    Jh(g, D >>> 0 < F >>> 0 ? F : D)
                                    D = f[r >> 2] | 0
                                    F = (D + -1) | 0
                                    if (!(F & D)) {
                                        Y = D
                                        Z = F & E
                                        break
                                    }
                                    if (E >>> 0 < D >>> 0) {
                                        Y = D
                                        Z = E
                                    } else {
                                        Y = D
                                        Z = (E >>> 0) % (D >>> 0) | 0
                                    }
                                } else {
                                    Y = G
                                    Z = Q
                                }
                            while (0)
                            G = ((f[g >> 2] | 0) + (Z << 2)) | 0
                            E = f[G >> 2] | 0
                            if (!E) {
                                f[H >> 2] = f[t >> 2]
                                f[t >> 2] = H
                                f[G >> 2] = t
                                G = f[H >> 2] | 0
                                if (G | 0) {
                                    K = f[(G + 4) >> 2] | 0
                                    G = (Y + -1) | 0
                                    if (G & Y)
                                        if (K >>> 0 < Y >>> 0) _ = K
                                        else _ = (K >>> 0) % (Y >>> 0) | 0
                                    else _ = K & G
                                    aa = ((f[g >> 2] | 0) + (_ << 2)) | 0
                                    R = 44
                                }
                            } else {
                                f[H >> 2] = f[E >> 2]
                                aa = E
                                R = 44
                            }
                            if ((R | 0) == 44) {
                                R = 0
                                f[aa >> 2] = H
                            }
                            f[o >> 2] = (f[o >> 2] | 0) + 1
                        }
                        E = v
                        G = f[E >> 2] | 0
                        K = on(G | 0, f[(E + 4) >> 2] | 0, y | 0, 0) | 0
                        Rg(((f[f[w >> 2] >> 2] | 0) + K) | 0, i | 0, G | 0) | 0
                        G = f[k >> 2] | 0
                        f[(G + (x << 2)) >> 2] = y
                        ba = (y + 1) | 0
                        ca = G
                    } else {
                        G = f[k >> 2] | 0
                        f[(G + (x << 2)) >> 2] = f[(z + 12) >> 2]
                        ba = y
                        ca = G
                    }
                    x = (x + 1) | 0
                    da = f[m >> 2] | 0
                    if (x >>> 0 >= da >>> 0) break
                    else y = ba
                }
                if ((ba | 0) == (da | 0)) ea = ca
                else {
                    y = (a + 84) | 0
                    if (!(b[y >> 0] | 0)) {
                        x = f[(a + 72) >> 2] | 0
                        i = f[(a + 68) >> 2] | 0
                        w = i
                        if ((x | 0) == (i | 0)) fa = ca
                        else {
                            v = (x - i) >> 2
                            i = 0
                            do {
                                x = (w + (i << 2)) | 0
                                f[x >> 2] = f[(ca + (f[x >> 2] << 2)) >> 2]
                                i = (i + 1) | 0
                            } while (i >>> 0 < v >>> 0)
                            fa = ca
                        }
                    } else {
                        b[y >> 0] = 0
                        y = (a + 68) | 0
                        ca = (a + 72) | 0
                        v = f[ca >> 2] | 0
                        i = f[y >> 2] | 0
                        w = (v - i) >> 2
                        x = i
                        i = v
                        if (da >>> 0 <= w >>> 0)
                            if (da >>> 0 < w >>> 0 ? ((v = (x + (da << 2)) | 0), (v | 0) != (i | 0)) : 0) {
                                f[ca >> 2] = i + (~(((i + -4 - v) | 0) >>> 2) << 2)
                                ga = da
                            } else ga = da
                        else {
                            kh(y, (da - w) | 0, 1204)
                            ga = f[m >> 2] | 0
                        }
                        w = f[k >> 2] | 0
                        if (!ga) fa = w
                        else {
                            k = f[(a + 68) >> 2] | 0
                            a = 0
                            do {
                                f[(k + (a << 2)) >> 2] = f[(w + (a << 2)) >> 2]
                                a = (a + 1) | 0
                            } while (a >>> 0 < ga >>> 0)
                            fa = w
                        }
                    }
                    f[m >> 2] = ba
                    ea = fa
                }
                if (!ea) ha = ba
                else {
                    fa = f[p >> 2] | 0
                    if ((fa | 0) != (ea | 0)) f[p >> 2] = fa + (~(((fa + -4 - ea) | 0) >>> 2) << 2)
                    br(ea)
                    ha = ba
                }
            } else ha = 0
            ba = f[(g + 8) >> 2] | 0
            if (ba | 0) {
                ea = ba
                do {
                    ba = ea
                    ea = f[ea >> 2] | 0
                    br(ba)
                } while ((ea | 0) != 0)
            }
            ea = f[g >> 2] | 0
            f[g >> 2] = 0
            if (!ea) {
                u = e
                return ha | 0
            }
            br(ea)
            u = e
            return ha | 0
        }
        function jc(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                J = 0,
                K = 0,
                L = 0,
                M = 0,
                N = 0,
                O = 0,
                P = 0,
                Q = 0,
                R = 0,
                S = 0,
                T = 0,
                U = Oa,
                V = Oa,
                X = Oa,
                Y = 0,
                Z = 0,
                _ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0
            e = u
            u = (u + 80) | 0
            g = (e + 48) | 0
            h = (e + 32) | 0
            i = (e + 16) | 0
            j = e
            k = (g + 16) | 0
            f[g >> 2] = 0
            f[(g + 4) >> 2] = 0
            f[(g + 8) >> 2] = 0
            f[(g + 12) >> 2] = 0
            n[k >> 2] = $(1.0)
            l = (a + 80) | 0
            m = f[l >> 2] | 0
            f[j >> 2] = 0
            o = (j + 4) | 0
            f[o >> 2] = 0
            f[(j + 8) >> 2] = 0
            if (m) {
                if (m >>> 0 > 1073741823) mq(j)
                p = m << 2
                q = dn(p) | 0
                f[j >> 2] = q
                r = (q + (m << 2)) | 0
                f[(j + 8) >> 2] = r
                hj(q | 0, 0, p | 0) | 0
                f[o >> 2] = r
                r = f[d >> 2] | 0
                d = (c + 48) | 0
                p = (c + 40) | 0
                q = (i + 4) | 0
                m = (i + 8) | 0
                s = (i + 12) | 0
                t = (g + 4) | 0
                v = (g + 12) | 0
                w = (g + 8) | 0
                x = (a + 40) | 0
                y = (a + 64) | 0
                z = 0
                A = 0
                while (1) {
                    B = d
                    C = f[B >> 2] | 0
                    D = f[(B + 4) >> 2] | 0
                    B = p
                    E = on(f[B >> 2] | 0, f[(B + 4) >> 2] | 0, (r + A) | 0, 0) | 0
                    B = Tn(E | 0, I | 0, C | 0, D | 0) | 0
                    D = ((f[f[c >> 2] >> 2] | 0) + B) | 0
                    B = h
                    C = D
                    E = (B + 16) | 0
                    do {
                        b[B >> 0] = b[C >> 0] | 0
                        B = (B + 1) | 0
                        C = (C + 1) | 0
                    } while ((B | 0) < (E | 0))
                    Xl(i | 0, D | 0, 16) | 0
                    C = Ff(g, i) | 0
                    if (!C) {
                        B = f[i >> 2] | 0
                        E = f[q >> 2] | 0
                        F = f[m >> 2] | 0
                        G = f[s >> 2] | 0
                        H = ((((((B ^ 318) + 239) ^ E) + 239) ^ F) + 239) ^ G
                        J = f[t >> 2] | 0
                        K = (J | 0) == 0
                        a: do
                            if (!K) {
                                L = (J + -1) | 0
                                M = ((L & J) | 0) == 0
                                if (!M)
                                    if (H >>> 0 < J >>> 0) N = H
                                    else N = (H >>> 0) % (J >>> 0) | 0
                                else N = H & L
                                O = f[((f[g >> 2] | 0) + (N << 2)) >> 2] | 0
                                if ((O | 0) != 0 ? ((P = f[O >> 2] | 0), (P | 0) != 0) : 0) {
                                    if (M) {
                                        M = P
                                        while (1) {
                                            O = f[(M + 4) >> 2] | 0
                                            if (!(((O | 0) == (H | 0)) | (((O & L) | 0) == (N | 0)))) {
                                                Q = N
                                                R = 31
                                                break a
                                            }
                                            if (
                                                (((f[(M + 8) >> 2] | 0) == (B | 0) ? (f[(M + 12) >> 2] | 0) == (E | 0) : 0) ? (f[(M + 16) >> 2] | 0) == (F | 0) : 0)
                                                    ? (f[(M + 20) >> 2] | 0) == (G | 0)
                                                    : 0
                                            )
                                                break a
                                            M = f[M >> 2] | 0
                                            if (!M) {
                                                Q = N
                                                R = 31
                                                break a
                                            }
                                        }
                                    } else S = P
                                    while (1) {
                                        M = f[(S + 4) >> 2] | 0
                                        if ((M | 0) != (H | 0)) {
                                            if (M >>> 0 < J >>> 0) T = M
                                            else T = (M >>> 0) % (J >>> 0) | 0
                                            if ((T | 0) != (N | 0)) {
                                                Q = N
                                                R = 31
                                                break a
                                            }
                                        }
                                        if (
                                            (((f[(S + 8) >> 2] | 0) == (B | 0) ? (f[(S + 12) >> 2] | 0) == (E | 0) : 0) ? (f[(S + 16) >> 2] | 0) == (F | 0) : 0) ? (f[(S + 20) >> 2] | 0) == (G | 0) : 0
                                        )
                                            break a
                                        S = f[S >> 2] | 0
                                        if (!S) {
                                            Q = N
                                            R = 31
                                            break
                                        }
                                    }
                                } else {
                                    Q = N
                                    R = 31
                                }
                            } else {
                                Q = 0
                                R = 31
                            }
                        while (0)
                        if ((R | 0) == 31) {
                            R = 0
                            D = dn(28) | 0
                            f[(D + 8) >> 2] = B
                            f[(D + 12) >> 2] = E
                            f[(D + 16) >> 2] = F
                            f[(D + 20) >> 2] = G
                            f[(D + 24) >> 2] = z
                            f[(D + 4) >> 2] = H
                            f[D >> 2] = 0
                            U = $((((f[v >> 2] | 0) + 1) | 0) >>> 0)
                            V = $(J >>> 0)
                            X = $(n[k >> 2])
                            do
                                if (K | ($(X * V) < U)) {
                                    P = (J << 1) | (((J >>> 0 < 3) | ((((J + -1) & J) | 0) != 0)) & 1)
                                    M = ~~$(W($(U / X))) >>> 0
                                    Gh(g, P >>> 0 < M >>> 0 ? M : P)
                                    P = f[t >> 2] | 0
                                    M = (P + -1) | 0
                                    if (!(M & P)) {
                                        Y = P
                                        Z = M & H
                                        break
                                    }
                                    if (H >>> 0 < P >>> 0) {
                                        Y = P
                                        Z = H
                                    } else {
                                        Y = P
                                        Z = (H >>> 0) % (P >>> 0) | 0
                                    }
                                } else {
                                    Y = J
                                    Z = Q
                                }
                            while (0)
                            J = ((f[g >> 2] | 0) + (Z << 2)) | 0
                            H = f[J >> 2] | 0
                            if (!H) {
                                f[D >> 2] = f[w >> 2]
                                f[w >> 2] = D
                                f[J >> 2] = w
                                J = f[D >> 2] | 0
                                if (J | 0) {
                                    K = f[(J + 4) >> 2] | 0
                                    J = (Y + -1) | 0
                                    if (J & Y)
                                        if (K >>> 0 < Y >>> 0) _ = K
                                        else _ = (K >>> 0) % (Y >>> 0) | 0
                                    else _ = K & J
                                    aa = ((f[g >> 2] | 0) + (_ << 2)) | 0
                                    R = 44
                                }
                            } else {
                                f[D >> 2] = f[H >> 2]
                                aa = H
                                R = 44
                            }
                            if ((R | 0) == 44) {
                                R = 0
                                f[aa >> 2] = D
                            }
                            f[v >> 2] = (f[v >> 2] | 0) + 1
                        }
                        H = x
                        J = f[H >> 2] | 0
                        K = on(J | 0, f[(H + 4) >> 2] | 0, z | 0, 0) | 0
                        Rg(((f[f[y >> 2] >> 2] | 0) + K) | 0, h | 0, J | 0) | 0
                        J = f[j >> 2] | 0
                        f[(J + (A << 2)) >> 2] = z
                        ba = (z + 1) | 0
                        ca = J
                    } else {
                        J = f[j >> 2] | 0
                        f[(J + (A << 2)) >> 2] = f[(C + 24) >> 2]
                        ba = z
                        ca = J
                    }
                    A = (A + 1) | 0
                    da = f[l >> 2] | 0
                    if (A >>> 0 >= da >>> 0) break
                    else z = ba
                }
                if ((ba | 0) == (da | 0)) ea = ca
                else {
                    z = (a + 84) | 0
                    if (!(b[z >> 0] | 0)) {
                        A = f[(a + 72) >> 2] | 0
                        h = f[(a + 68) >> 2] | 0
                        y = h
                        if ((A | 0) == (h | 0)) fa = ca
                        else {
                            x = (A - h) >> 2
                            h = 0
                            do {
                                A = (y + (h << 2)) | 0
                                f[A >> 2] = f[(ca + (f[A >> 2] << 2)) >> 2]
                                h = (h + 1) | 0
                            } while (h >>> 0 < x >>> 0)
                            fa = ca
                        }
                    } else {
                        b[z >> 0] = 0
                        z = (a + 68) | 0
                        ca = (a + 72) | 0
                        x = f[ca >> 2] | 0
                        h = f[z >> 2] | 0
                        y = (x - h) >> 2
                        A = h
                        h = x
                        if (da >>> 0 <= y >>> 0)
                            if (da >>> 0 < y >>> 0 ? ((x = (A + (da << 2)) | 0), (x | 0) != (h | 0)) : 0) {
                                f[ca >> 2] = h + (~(((h + -4 - x) | 0) >>> 2) << 2)
                                ga = da
                            } else ga = da
                        else {
                            kh(z, (da - y) | 0, 1204)
                            ga = f[l >> 2] | 0
                        }
                        y = f[j >> 2] | 0
                        if (!ga) fa = y
                        else {
                            j = f[(a + 68) >> 2] | 0
                            a = 0
                            do {
                                f[(j + (a << 2)) >> 2] = f[(y + (a << 2)) >> 2]
                                a = (a + 1) | 0
                            } while (a >>> 0 < ga >>> 0)
                            fa = y
                        }
                    }
                    f[l >> 2] = ba
                    ea = fa
                }
                if (!ea) ha = ba
                else {
                    fa = f[o >> 2] | 0
                    if ((fa | 0) != (ea | 0)) f[o >> 2] = fa + (~(((fa + -4 - ea) | 0) >>> 2) << 2)
                    br(ea)
                    ha = ba
                }
            } else ha = 0
            ba = f[(g + 8) >> 2] | 0
            if (ba | 0) {
                ea = ba
                do {
                    ba = ea
                    ea = f[ea >> 2] | 0
                    br(ba)
                } while ((ea | 0) != 0)
            }
            ea = f[g >> 2] | 0
            f[g >> 2] = 0
            if (!ea) {
                u = e
                return ha | 0
            }
            br(ea)
            u = e
            return ha | 0
        }
        function kc(a, c, e) {
            a = a | 0
            c = c | 0
            e = e | 0
            var g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                J = 0,
                K = 0,
                L = 0,
                M = 0,
                N = 0,
                O = 0,
                P = 0,
                Q = 0,
                R = 0,
                S = Oa,
                T = Oa,
                U = Oa,
                V = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0
            g = u
            u = (u + 48) | 0
            h = (g + 12) | 0
            i = (g + 38) | 0
            j = (g + 32) | 0
            k = g
            l = (h + 16) | 0
            f[h >> 2] = 0
            f[(h + 4) >> 2] = 0
            f[(h + 8) >> 2] = 0
            f[(h + 12) >> 2] = 0
            n[l >> 2] = $(1.0)
            m = (a + 80) | 0
            o = f[m >> 2] | 0
            f[k >> 2] = 0
            p = (k + 4) | 0
            f[p >> 2] = 0
            f[(k + 8) >> 2] = 0
            if (o) {
                if (o >>> 0 > 1073741823) mq(k)
                q = o << 2
                r = dn(q) | 0
                f[k >> 2] = r
                s = (r + (o << 2)) | 0
                f[(k + 8) >> 2] = s
                hj(r | 0, 0, q | 0) | 0
                f[p >> 2] = s
                s = f[e >> 2] | 0
                e = (c + 48) | 0
                q = (c + 40) | 0
                r = (j + 2) | 0
                o = (j + 4) | 0
                t = (h + 4) | 0
                v = (h + 12) | 0
                w = (h + 8) | 0
                x = (a + 40) | 0
                y = (a + 64) | 0
                z = 0
                A = 0
                while (1) {
                    B = e
                    C = f[B >> 2] | 0
                    D = f[(B + 4) >> 2] | 0
                    B = q
                    E = on(f[B >> 2] | 0, f[(B + 4) >> 2] | 0, (s + A) | 0, 0) | 0
                    B = Tn(E | 0, I | 0, C | 0, D | 0) | 0
                    D = ((f[f[c >> 2] >> 2] | 0) + B) | 0
                    b[i >> 0] = b[D >> 0] | 0
                    b[(i + 1) >> 0] = b[(D + 1) >> 0] | 0
                    b[(i + 2) >> 0] = b[(D + 2) >> 0] | 0
                    b[(i + 3) >> 0] = b[(D + 3) >> 0] | 0
                    b[(i + 4) >> 0] = b[(D + 4) >> 0] | 0
                    b[(i + 5) >> 0] = b[(D + 5) >> 0] | 0
                    Xl(j | 0, D | 0, 6) | 0
                    D = Pf(h, j) | 0
                    if (!D) {
                        B = d[j >> 1] | 0
                        C = d[r >> 1] | 0
                        E = d[o >> 1] | 0
                        F = (((((B ^ 318) & 65535) + 239) ^ (C & 65535)) + 239) ^ (E & 65535)
                        G = f[t >> 2] | 0
                        H = (G | 0) == 0
                        a: do
                            if (!H) {
                                J = (G + -1) | 0
                                K = ((J & G) | 0) == 0
                                if (!K)
                                    if (F >>> 0 < G >>> 0) L = F
                                    else L = (F >>> 0) % (G >>> 0) | 0
                                else L = F & J
                                M = f[((f[h >> 2] | 0) + (L << 2)) >> 2] | 0
                                if ((M | 0) != 0 ? ((N = f[M >> 2] | 0), (N | 0) != 0) : 0) {
                                    if (K) {
                                        K = N
                                        while (1) {
                                            M = f[(K + 4) >> 2] | 0
                                            if (!(((M | 0) == (F | 0)) | (((M & J) | 0) == (L | 0)))) {
                                                O = L
                                                P = 29
                                                break a
                                            }
                                            M = (K + 8) | 0
                                            if (((d[M >> 1] | 0) == (B << 16) >> 16 ? (d[(M + 2) >> 1] | 0) == (C << 16) >> 16 : 0) ? (d[(K + 12) >> 1] | 0) == (E << 16) >> 16 : 0) break a
                                            K = f[K >> 2] | 0
                                            if (!K) {
                                                O = L
                                                P = 29
                                                break a
                                            }
                                        }
                                    } else Q = N
                                    while (1) {
                                        K = f[(Q + 4) >> 2] | 0
                                        if ((K | 0) != (F | 0)) {
                                            if (K >>> 0 < G >>> 0) R = K
                                            else R = (K >>> 0) % (G >>> 0) | 0
                                            if ((R | 0) != (L | 0)) {
                                                O = L
                                                P = 29
                                                break a
                                            }
                                        }
                                        K = (Q + 8) | 0
                                        if (((d[K >> 1] | 0) == (B << 16) >> 16 ? (d[(K + 2) >> 1] | 0) == (C << 16) >> 16 : 0) ? (d[(Q + 12) >> 1] | 0) == (E << 16) >> 16 : 0) break a
                                        Q = f[Q >> 2] | 0
                                        if (!Q) {
                                            O = L
                                            P = 29
                                            break
                                        }
                                    }
                                } else {
                                    O = L
                                    P = 29
                                }
                            } else {
                                O = 0
                                P = 29
                            }
                        while (0)
                        if ((P | 0) == 29) {
                            P = 0
                            N = dn(20) | 0
                            d[(N + 8) >> 1] = B
                            d[(N + 10) >> 1] = C
                            d[(N + 12) >> 1] = E
                            f[(N + 16) >> 2] = z
                            f[(N + 4) >> 2] = F
                            f[N >> 2] = 0
                            S = $((((f[v >> 2] | 0) + 1) | 0) >>> 0)
                            T = $(G >>> 0)
                            U = $(n[l >> 2])
                            do
                                if (H | ($(U * T) < S)) {
                                    K = (G << 1) | (((G >>> 0 < 3) | ((((G + -1) & G) | 0) != 0)) & 1)
                                    J = ~~$(W($(S / U))) >>> 0
                                    Dh(h, K >>> 0 < J >>> 0 ? J : K)
                                    K = f[t >> 2] | 0
                                    J = (K + -1) | 0
                                    if (!(J & K)) {
                                        V = K
                                        X = J & F
                                        break
                                    }
                                    if (F >>> 0 < K >>> 0) {
                                        V = K
                                        X = F
                                    } else {
                                        V = K
                                        X = (F >>> 0) % (K >>> 0) | 0
                                    }
                                } else {
                                    V = G
                                    X = O
                                }
                            while (0)
                            G = ((f[h >> 2] | 0) + (X << 2)) | 0
                            F = f[G >> 2] | 0
                            if (!F) {
                                f[N >> 2] = f[w >> 2]
                                f[w >> 2] = N
                                f[G >> 2] = w
                                G = f[N >> 2] | 0
                                if (G | 0) {
                                    H = f[(G + 4) >> 2] | 0
                                    G = (V + -1) | 0
                                    if (G & V)
                                        if (H >>> 0 < V >>> 0) Y = H
                                        else Y = (H >>> 0) % (V >>> 0) | 0
                                    else Y = H & G
                                    Z = ((f[h >> 2] | 0) + (Y << 2)) | 0
                                    P = 42
                                }
                            } else {
                                f[N >> 2] = f[F >> 2]
                                Z = F
                                P = 42
                            }
                            if ((P | 0) == 42) {
                                P = 0
                                f[Z >> 2] = N
                            }
                            f[v >> 2] = (f[v >> 2] | 0) + 1
                        }
                        F = x
                        G = f[F >> 2] | 0
                        H = on(G | 0, f[(F + 4) >> 2] | 0, z | 0, 0) | 0
                        Rg(((f[f[y >> 2] >> 2] | 0) + H) | 0, i | 0, G | 0) | 0
                        G = f[k >> 2] | 0
                        f[(G + (A << 2)) >> 2] = z
                        _ = (z + 1) | 0
                        aa = G
                    } else {
                        G = f[k >> 2] | 0
                        f[(G + (A << 2)) >> 2] = f[(D + 16) >> 2]
                        _ = z
                        aa = G
                    }
                    A = (A + 1) | 0
                    ba = f[m >> 2] | 0
                    if (A >>> 0 >= ba >>> 0) break
                    else z = _
                }
                if ((_ | 0) == (ba | 0)) ca = aa
                else {
                    z = (a + 84) | 0
                    if (!(b[z >> 0] | 0)) {
                        A = f[(a + 72) >> 2] | 0
                        i = f[(a + 68) >> 2] | 0
                        y = i
                        if ((A | 0) == (i | 0)) da = aa
                        else {
                            x = (A - i) >> 2
                            i = 0
                            do {
                                A = (y + (i << 2)) | 0
                                f[A >> 2] = f[(aa + (f[A >> 2] << 2)) >> 2]
                                i = (i + 1) | 0
                            } while (i >>> 0 < x >>> 0)
                            da = aa
                        }
                    } else {
                        b[z >> 0] = 0
                        z = (a + 68) | 0
                        aa = (a + 72) | 0
                        x = f[aa >> 2] | 0
                        i = f[z >> 2] | 0
                        y = (x - i) >> 2
                        A = i
                        i = x
                        if (ba >>> 0 <= y >>> 0)
                            if (ba >>> 0 < y >>> 0 ? ((x = (A + (ba << 2)) | 0), (x | 0) != (i | 0)) : 0) {
                                f[aa >> 2] = i + (~(((i + -4 - x) | 0) >>> 2) << 2)
                                ea = ba
                            } else ea = ba
                        else {
                            kh(z, (ba - y) | 0, 1204)
                            ea = f[m >> 2] | 0
                        }
                        y = f[k >> 2] | 0
                        if (!ea) da = y
                        else {
                            k = f[(a + 68) >> 2] | 0
                            a = 0
                            do {
                                f[(k + (a << 2)) >> 2] = f[(y + (a << 2)) >> 2]
                                a = (a + 1) | 0
                            } while (a >>> 0 < ea >>> 0)
                            da = y
                        }
                    }
                    f[m >> 2] = _
                    ca = da
                }
                if (!ca) fa = _
                else {
                    da = f[p >> 2] | 0
                    if ((da | 0) != (ca | 0)) f[p >> 2] = da + (~(((da + -4 - ca) | 0) >>> 2) << 2)
                    br(ca)
                    fa = _
                }
            } else fa = 0
            _ = f[(h + 8) >> 2] | 0
            if (_ | 0) {
                ca = _
                do {
                    _ = ca
                    ca = f[ca >> 2] | 0
                    br(_)
                } while ((ca | 0) != 0)
            }
            ca = f[h >> 2] | 0
            f[h >> 2] = 0
            if (!ca) {
                u = g
                return fa | 0
            }
            br(ca)
            u = g
            return fa | 0
        }
        function lc(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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
            d = u
            u = (u + 80) | 0
            e = (d + 72) | 0
            g = (d + 64) | 0
            h = d
            i = (d + 68) | 0
            j = (d + 60) | 0
            k = (a + 352) | 0
            if (b[k >> 0] | 0 ? ((l = Qa[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a) | 0), (((f[(l + 12) >> 2] | 0) - (f[(l + 8) >> 2] | 0)) | 0) > 0) : 0) {
                l = ((Qa[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a) | 0) + 8) | 0
                m = f[f[l >> 2] >> 2] | 0
                f[e >> 2] = c
                l = (m + 4) | 0
                n = (m + 8) | 0
                o = f[n >> 2] | 0
                if ((o | 0) == (f[(m + 12) >> 2] | 0)) Ci(l, e)
                else {
                    f[o >> 2] = c
                    f[n >> 2] = o + 4
                }
                o = f[e >> 2] | 0
                p = (m + 16) | 0
                q = (m + 20) | 0
                m = f[q >> 2] | 0
                r = f[p >> 2] | 0
                s = (m - r) >> 2
                t = r
                if ((o | 0) < (s | 0)) {
                    v = t
                    w = o
                } else {
                    r = (o + 1) | 0
                    f[g >> 2] = -1
                    x = m
                    if (r >>> 0 <= s >>> 0)
                        if (r >>> 0 < s >>> 0 ? ((m = (t + (r << 2)) | 0), (m | 0) != (x | 0)) : 0) {
                            f[q >> 2] = x + (~(((x + -4 - m) | 0) >>> 2) << 2)
                            y = o
                            z = t
                        } else {
                            y = o
                            z = t
                        }
                    else {
                        kh(p, (r - s) | 0, g)
                        y = f[e >> 2] | 0
                        z = f[p >> 2] | 0
                    }
                    v = z
                    w = y
                }
                f[(v + (w << 2)) >> 2] = (((f[n >> 2] | 0) - (f[l >> 2] | 0)) >> 2) + -1
                A = 1
                u = d
                return A | 0
            }
            l = ((Qa[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a) | 0) + 56) | 0
            n = f[((f[((f[l >> 2] | 0) + 84) >> 2] | 0) + (c << 2)) >> 2] | 0
            l = ((Qa[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a) | 0) + 4) | 0
            w = f[((f[((f[l >> 2] | 0) + 8) >> 2] | 0) + (c << 2)) >> 2] | 0
            f[g >> 2] = -1
            l = (a + 172) | 0
            v = f[(a + 176) >> 2] | 0
            y = f[l >> 2] | 0
            z = y
            a: do
                if ((v | 0) == (y | 0)) B = -1
                else {
                    p = (((v - y) | 0) / 136) | 0
                    s = 0
                    while (1) {
                        if ((f[(z + ((s * 136) | 0)) >> 2] | 0) == (c | 0)) break
                        r = (s + 1) | 0
                        if (r >>> 0 < p >>> 0) s = r
                        else {
                            B = -1
                            break a
                        }
                    }
                    f[g >> 2] = s
                    B = s
                }
            while (0)
            b: do
                if (!(b[k >> 0] | 0)) {
                    y = (f[(w + 56) >> 2] | 0) == 0
                    do
                        if (!(((n | 0) == 0) | y)) {
                            if ((n | 0) == 1 ? b[(z + ((B * 136) | 0) + 28) >> 0] | 0 : 0) break
                            v = (z + ((B * 136) | 0) + 104) | 0
                            p = (z + ((B * 136) | 0) + 4) | 0
                            r = ((f[(z + ((B * 136) | 0) + 60) >> 2] | 0) - (f[(z + ((B * 136) | 0) + 56) >> 2] | 0)) >> 2
                            f[e >> 2] = -1
                            Sf((z + ((B * 136) | 0) + 116) | 0, r, e)
                            r = dn(80) | 0
                            t = f[(a + 8) >> 2] | 0
                            f[(r + 4) >> 2] = 0
                            f[r >> 2] = 3164
                            o = (r + 8) | 0
                            m = (r + 12) | 0
                            x = (m + 44) | 0
                            do {
                                f[m >> 2] = 0
                                m = (m + 4) | 0
                            } while ((m | 0) < (x | 0))
                            f[o >> 2] = 3188
                            q = (r + 56) | 0
                            f[q >> 2] = 0
                            f[(r + 60) >> 2] = 0
                            f[(r + 64) >> 2] = 0
                            f[(r + 68) >> 2] = t
                            f[(r + 72) >> 2] = v
                            C = (r + 76) | 0
                            f[C >> 2] = 0
                            D = (h + 4) | 0
                            m = (D + 4) | 0
                            x = (m + 40) | 0
                            do {
                                f[m >> 2] = 0
                                m = (m + 4) | 0
                            } while ((m | 0) < (x | 0))
                            f[h >> 2] = 3188
                            m = (h + 48) | 0
                            f[m >> 2] = 0
                            x = (h + 52) | 0
                            f[x >> 2] = 0
                            f[(h + 56) >> 2] = 0
                            f[D >> 2] = p
                            E = f[(z + ((B * 136) | 0) + 68) >> 2] | 0
                            F = (((((f[(E + 4) >> 2] | 0) - (f[E >> 2] | 0)) >> 2) >>> 0) / 3) | 0
                            b[e >> 0] = 0
                            Xg((h + 24) | 0, F, e)
                            F = f[D >> 2] | 0
                            E = ((f[(F + 56) >> 2] | 0) - (f[(F + 52) >> 2] | 0)) >> 2
                            b[e >> 0] = 0
                            Xg((h + 36) | 0, E, e)
                            f[(h + 8) >> 2] = p
                            f[(h + 12) >> 2] = v
                            f[(h + 16) >> 2] = t
                            f[(h + 20) >> 2] = r
                            f[C >> 2] = a + 72
                            ef(o, h) | 0
                            Yf(q, f[m >> 2] | 0, f[x >> 2] | 0)
                            E = r
                            f[h >> 2] = 3188
                            F = f[m >> 2] | 0
                            if (F | 0) {
                                m = f[x >> 2] | 0
                                if ((m | 0) != (F | 0)) f[x >> 2] = m + (~(((m + -4 - F) | 0) >>> 2) << 2)
                                br(F)
                            }
                            f[h >> 2] = 3208
                            F = f[(h + 36) >> 2] | 0
                            if (F | 0) br(F)
                            F = f[(h + 24) >> 2] | 0
                            if (F | 0) br(F)
                            G = 0
                            H = E
                            I = 42
                            break b
                        }
                    while (0)
                    if (!y) {
                        s = f[(a + 12) >> 2] | 0
                        E = ((f[(s + 28) >> 2] | 0) - (f[(s + 24) >> 2] | 0)) >> 2
                        f[e >> 2] = -1
                        Sf((z + ((B * 136) | 0) + 116) | 0, E, e)
                        b[((f[l >> 2] | 0) + (((f[g >> 2] | 0) * 136) | 0) + 100) >> 0] = 0
                        J = (z + ((B * 136) | 0) + 104) | 0
                        I = 26
                    } else I = 24
                } else I = 24
            while (0)
            if ((I | 0) == 24) {
                J = (a + 40) | 0
                I = 26
            }
            if ((I | 0) == 26) {
                B = ((Qa[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a) | 0) + 48) | 0
                do
                    if ((Yh(f[B >> 2] | 0) | 0) == 0 ? (f[(w + 56) >> 2] | 0) == 0 : 0) {
                        if (b[k >> 0] | 0 ? ((z = f[(a + 8) >> 2] | 0), (((f[(z + 12) >> 2] | 0) - (f[(z + 8) >> 2] | 0)) | 0) >= 5) : 0) {
                            I = 31
                            break
                        }
                        uf(e, a, J)
                        K = 1
                        L = f[e >> 2] | 0
                    } else I = 31
                while (0)
                if ((I | 0) == 31) {
                    Le(e, a, J)
                    K = 0
                    L = f[e >> 2] | 0
                }
                if (!L) M = 0
                else {
                    G = K
                    H = L
                    I = 42
                }
            }
            if ((I | 0) == 42) {
                I = f[g >> 2] | 0
                if ((I | 0) == -1) N = (a + 68) | 0
                else N = ((f[l >> 2] | 0) + ((I * 136) | 0) + 132) | 0
                f[N >> 2] = G
                G = dn(76) | 0
                f[i >> 2] = H
                ml(G, i, c)
                c = G
                G = f[i >> 2] | 0
                f[i >> 2] = 0
                if (G | 0) Va[f[((f[G >> 2] | 0) + 4) >> 2] & 127](G)
                G = (a + 188) | 0
                i = f[G >> 2] | 0
                if ((i | 0) == (f[(a + 192) >> 2] | 0)) Ci((a + 184) | 0, g)
                else {
                    f[i >> 2] = f[g >> 2]
                    f[G >> 2] = i + 4
                }
                i = Qa[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a) | 0
                f[j >> 2] = c
                a = (i + 12) | 0
                G = f[a >> 2] | 0
                if (G >>> 0 < (f[(i + 16) >> 2] | 0) >>> 0) {
                    f[j >> 2] = 0
                    f[G >> 2] = c
                    f[a >> 2] = G + 4
                    O = j
                } else {
                    yg((i + 8) | 0, j)
                    O = j
                }
                j = f[O >> 2] | 0
                f[O >> 2] = 0
                if (!j) M = 1
                else {
                    Va[f[((f[j >> 2] | 0) + 4) >> 2] & 127](j)
                    M = 1
                }
            }
            A = M
            u = d
            return A | 0
        }
        function mc(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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
            d = u
            u = (u + 80) | 0
            e = (d + 72) | 0
            g = (d + 64) | 0
            h = d
            i = (d + 68) | 0
            j = (d + 60) | 0
            k = (a + 288) | 0
            if (b[k >> 0] | 0 ? ((l = Qa[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a) | 0), (((f[(l + 12) >> 2] | 0) - (f[(l + 8) >> 2] | 0)) | 0) > 0) : 0) {
                l = ((Qa[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a) | 0) + 8) | 0
                m = f[f[l >> 2] >> 2] | 0
                f[e >> 2] = c
                l = (m + 4) | 0
                n = (m + 8) | 0
                o = f[n >> 2] | 0
                if ((o | 0) == (f[(m + 12) >> 2] | 0)) Ci(l, e)
                else {
                    f[o >> 2] = c
                    f[n >> 2] = o + 4
                }
                o = f[e >> 2] | 0
                p = (m + 16) | 0
                q = (m + 20) | 0
                m = f[q >> 2] | 0
                r = f[p >> 2] | 0
                s = (m - r) >> 2
                t = r
                if ((o | 0) < (s | 0)) {
                    v = t
                    w = o
                } else {
                    r = (o + 1) | 0
                    f[g >> 2] = -1
                    x = m
                    if (r >>> 0 <= s >>> 0)
                        if (r >>> 0 < s >>> 0 ? ((m = (t + (r << 2)) | 0), (m | 0) != (x | 0)) : 0) {
                            f[q >> 2] = x + (~(((x + -4 - m) | 0) >>> 2) << 2)
                            y = o
                            z = t
                        } else {
                            y = o
                            z = t
                        }
                    else {
                        kh(p, (r - s) | 0, g)
                        y = f[e >> 2] | 0
                        z = f[p >> 2] | 0
                    }
                    v = z
                    w = y
                }
                f[(v + (w << 2)) >> 2] = (((f[n >> 2] | 0) - (f[l >> 2] | 0)) >> 2) + -1
                A = 1
                u = d
                return A | 0
            }
            l = ((Qa[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a) | 0) + 56) | 0
            n = f[((f[((f[l >> 2] | 0) + 84) >> 2] | 0) + (c << 2)) >> 2] | 0
            l = ((Qa[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a) | 0) + 4) | 0
            w = f[((f[((f[l >> 2] | 0) + 8) >> 2] | 0) + (c << 2)) >> 2] | 0
            f[g >> 2] = -1
            l = (a + 172) | 0
            v = f[(a + 176) >> 2] | 0
            y = f[l >> 2] | 0
            z = y
            a: do
                if ((v | 0) == (y | 0)) B = -1
                else {
                    p = (((v - y) | 0) / 136) | 0
                    s = 0
                    while (1) {
                        if ((f[(z + ((s * 136) | 0)) >> 2] | 0) == (c | 0)) break
                        r = (s + 1) | 0
                        if (r >>> 0 < p >>> 0) s = r
                        else {
                            B = -1
                            break a
                        }
                    }
                    f[g >> 2] = s
                    B = s
                }
            while (0)
            b: do
                if (!(b[k >> 0] | 0)) {
                    y = (f[(w + 56) >> 2] | 0) == 0
                    do
                        if (!(((n | 0) == 0) | y)) {
                            if ((n | 0) == 1 ? b[(z + ((B * 136) | 0) + 28) >> 0] | 0 : 0) break
                            v = (z + ((B * 136) | 0) + 104) | 0
                            p = (z + ((B * 136) | 0) + 4) | 0
                            r = ((f[(z + ((B * 136) | 0) + 60) >> 2] | 0) - (f[(z + ((B * 136) | 0) + 56) >> 2] | 0)) >> 2
                            f[e >> 2] = -1
                            Sf((z + ((B * 136) | 0) + 116) | 0, r, e)
                            r = dn(80) | 0
                            t = f[(a + 8) >> 2] | 0
                            f[(r + 4) >> 2] = 0
                            f[r >> 2] = 3164
                            o = (r + 8) | 0
                            m = (r + 12) | 0
                            x = (m + 44) | 0
                            do {
                                f[m >> 2] = 0
                                m = (m + 4) | 0
                            } while ((m | 0) < (x | 0))
                            f[o >> 2] = 3188
                            q = (r + 56) | 0
                            f[q >> 2] = 0
                            f[(r + 60) >> 2] = 0
                            f[(r + 64) >> 2] = 0
                            f[(r + 68) >> 2] = t
                            f[(r + 72) >> 2] = v
                            C = (r + 76) | 0
                            f[C >> 2] = 0
                            D = (h + 4) | 0
                            m = (D + 4) | 0
                            x = (m + 40) | 0
                            do {
                                f[m >> 2] = 0
                                m = (m + 4) | 0
                            } while ((m | 0) < (x | 0))
                            f[h >> 2] = 3188
                            m = (h + 48) | 0
                            f[m >> 2] = 0
                            x = (h + 52) | 0
                            f[x >> 2] = 0
                            f[(h + 56) >> 2] = 0
                            f[D >> 2] = p
                            E = f[(z + ((B * 136) | 0) + 68) >> 2] | 0
                            F = (((((f[(E + 4) >> 2] | 0) - (f[E >> 2] | 0)) >> 2) >>> 0) / 3) | 0
                            b[e >> 0] = 0
                            Xg((h + 24) | 0, F, e)
                            F = f[D >> 2] | 0
                            E = ((f[(F + 56) >> 2] | 0) - (f[(F + 52) >> 2] | 0)) >> 2
                            b[e >> 0] = 0
                            Xg((h + 36) | 0, E, e)
                            f[(h + 8) >> 2] = p
                            f[(h + 12) >> 2] = v
                            f[(h + 16) >> 2] = t
                            f[(h + 20) >> 2] = r
                            f[C >> 2] = a + 72
                            ef(o, h) | 0
                            Yf(q, f[m >> 2] | 0, f[x >> 2] | 0)
                            E = r
                            f[h >> 2] = 3188
                            F = f[m >> 2] | 0
                            if (F | 0) {
                                m = f[x >> 2] | 0
                                if ((m | 0) != (F | 0)) f[x >> 2] = m + (~(((m + -4 - F) | 0) >>> 2) << 2)
                                br(F)
                            }
                            f[h >> 2] = 3208
                            F = f[(h + 36) >> 2] | 0
                            if (F | 0) br(F)
                            F = f[(h + 24) >> 2] | 0
                            if (F | 0) br(F)
                            G = 0
                            H = E
                            I = 42
                            break b
                        }
                    while (0)
                    if (!y) {
                        s = f[(a + 12) >> 2] | 0
                        E = ((f[(s + 28) >> 2] | 0) - (f[(s + 24) >> 2] | 0)) >> 2
                        f[e >> 2] = -1
                        Sf((z + ((B * 136) | 0) + 116) | 0, E, e)
                        b[((f[l >> 2] | 0) + (((f[g >> 2] | 0) * 136) | 0) + 100) >> 0] = 0
                        J = (z + ((B * 136) | 0) + 104) | 0
                        I = 26
                    } else I = 24
                } else I = 24
            while (0)
            if ((I | 0) == 24) {
                J = (a + 40) | 0
                I = 26
            }
            if ((I | 0) == 26) {
                B = ((Qa[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a) | 0) + 48) | 0
                do
                    if ((Yh(f[B >> 2] | 0) | 0) == 0 ? (f[(w + 56) >> 2] | 0) == 0 : 0) {
                        if (b[k >> 0] | 0 ? ((z = f[(a + 8) >> 2] | 0), (((f[(z + 12) >> 2] | 0) - (f[(z + 8) >> 2] | 0)) | 0) >= 5) : 0) {
                            I = 31
                            break
                        }
                        uf(e, a, J)
                        K = 1
                        L = f[e >> 2] | 0
                    } else I = 31
                while (0)
                if ((I | 0) == 31) {
                    Le(e, a, J)
                    K = 0
                    L = f[e >> 2] | 0
                }
                if (!L) M = 0
                else {
                    G = K
                    H = L
                    I = 42
                }
            }
            if ((I | 0) == 42) {
                I = f[g >> 2] | 0
                if ((I | 0) == -1) N = (a + 68) | 0
                else N = ((f[l >> 2] | 0) + ((I * 136) | 0) + 132) | 0
                f[N >> 2] = G
                G = dn(76) | 0
                f[i >> 2] = H
                ml(G, i, c)
                c = G
                G = f[i >> 2] | 0
                f[i >> 2] = 0
                if (G | 0) Va[f[((f[G >> 2] | 0) + 4) >> 2] & 127](G)
                G = (a + 188) | 0
                i = f[G >> 2] | 0
                if ((i | 0) == (f[(a + 192) >> 2] | 0)) Ci((a + 184) | 0, g)
                else {
                    f[i >> 2] = f[g >> 2]
                    f[G >> 2] = i + 4
                }
                i = Qa[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a) | 0
                f[j >> 2] = c
                a = (i + 12) | 0
                G = f[a >> 2] | 0
                if (G >>> 0 < (f[(i + 16) >> 2] | 0) >>> 0) {
                    f[j >> 2] = 0
                    f[G >> 2] = c
                    f[a >> 2] = G + 4
                    O = j
                } else {
                    yg((i + 8) | 0, j)
                    O = j
                }
                j = f[O >> 2] | 0
                f[O >> 2] = 0
                if (!j) M = 1
                else {
                    Va[f[((f[j >> 2] | 0) + 4) >> 2] & 127](j)
                    M = 1
                }
            }
            A = M
            u = d
            return A | 0
        }
        function nc(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 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,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0
            e = u
            u = (u + 64) | 0
            d = (e + 48) | 0
            h = (e + 40) | 0
            i = (e + 32) | 0
            j = (e + 16) | 0
            k = (e + 8) | 0
            l = e
            m = (e + 28) | 0
            n = (a + 8) | 0
            o = f[n >> 2] | 0
            if (((o + -2) | 0) >>> 0 <= 28) {
                f[(a + 72) >> 2] = o
                p = 1 << o
                f[(a + 76) >> 2] = p + -1
                o = (p + -2) | 0
                f[(a + 80) >> 2] = o
                f[(a + 84) >> 2] = ((o | 0) / 2) | 0
            }
            o = (a + 40) | 0
            f[(a + 48) >> 2] = g
            g = (a + 88) | 0
            lk(g)
            p = (a + 36) | 0
            q = f[p >> 2] | 0
            r = ((f[(q + 4) >> 2] | 0) - (f[q >> 2] | 0)) | 0
            s = r >> 2
            f[j >> 2] = 0
            f[(j + 4) >> 2] = 0
            f[(j + 8) >> 2] = 0
            t = k
            f[t >> 2] = 0
            f[(t + 4) >> 2] = 0
            t = l
            f[t >> 2] = 0
            f[(t + 4) >> 2] = 0
            if ((r | 0) <= 0) {
                u = e
                return 1
            }
            r = (j + 4) | 0
            t = (j + 8) | 0
            v = (a + 84) | 0
            w = (a + 80) | 0
            x = (h + 4) | 0
            y = (i + 4) | 0
            z = (d + 4) | 0
            A = (k + 4) | 0
            B = (h + 4) | 0
            C = (i + 4) | 0
            D = (d + 4) | 0
            E = (l + 4) | 0
            F = (a + 76) | 0
            a = (k + 4) | 0
            G = (l + 4) | 0
            H = f[q >> 2] | 0
            if ((f[(q + 4) >> 2] | 0) == (H | 0)) {
                J = q
                mq(J)
            } else {
                K = 0
                L = H
            }
            while (1) {
                f[m >> 2] = f[(L + (K << 2)) >> 2]
                f[d >> 2] = f[m >> 2]
                fc(o, d, j)
                H = f[j >> 2] | 0
                q = (H | 0) > -1 ? H : (0 - H) | 0
                M = f[r >> 2] | 0
                N = (M | 0) > -1 ? M : (0 - M) | 0
                O = Tn(N | 0, ((((N | 0) < 0) << 31) >> 31) | 0, q | 0, ((((q | 0) < 0) << 31) >> 31) | 0) | 0
                q = f[t >> 2] | 0
                N = (q | 0) > -1
                P = N ? q : (0 - q) | 0
                q = Tn(O | 0, I | 0, P | 0, ((((P | 0) < 0) << 31) >> 31) | 0) | 0
                P = I
                if (((q | 0) == 0) & ((P | 0) == 0)) {
                    O = f[v >> 2] | 0
                    Q = O
                    R = j
                    S = M
                    T = O
                } else {
                    O = f[v >> 2] | 0
                    U = (((O | 0) < 0) << 31) >> 31
                    V = on(O | 0, U | 0, H | 0, ((((H | 0) < 0) << 31) >> 31) | 0) | 0
                    H = zk(V | 0, I | 0, q | 0, P | 0) | 0
                    f[j >> 2] = H
                    V = on(O | 0, U | 0, M | 0, ((((M | 0) < 0) << 31) >> 31) | 0) | 0
                    M = zk(V | 0, I | 0, q | 0, P | 0) | 0
                    f[r >> 2] = M
                    P = (O - ((H | 0) > -1 ? H : (0 - H) | 0) - ((M | 0) > -1 ? M : (0 - M) | 0)) | 0
                    Q = N ? P : (0 - P) | 0
                    R = t
                    S = M
                    T = O
                }
                f[R >> 2] = Q
                O = f[j >> 2] | 0
                do
                    if ((O | 0) <= -1) {
                        if ((S | 0) < 0) {
                            M = f[t >> 2] | 0
                            W = (M | 0) > -1 ? M : (0 - M) | 0
                            X = M
                        } else {
                            M = f[t >> 2] | 0
                            W = ((f[w >> 2] | 0) - ((M | 0) > -1 ? M : (0 - M) | 0)) | 0
                            X = M
                        }
                        if ((X | 0) < 0) {
                            Y = (S | 0) > -1 ? S : (0 - S) | 0
                            Z = W
                            _ = X
                            break
                        } else {
                            Y = ((f[w >> 2] | 0) - ((S | 0) > -1 ? S : (0 - S) | 0)) | 0
                            Z = W
                            _ = X
                            break
                        }
                    } else {
                        M = f[t >> 2] | 0
                        Y = (M + T) | 0
                        Z = (T + S) | 0
                        _ = M
                    }
                while (0)
                M = (Z | 0) == 0
                P = (Y | 0) == 0
                N = f[w >> 2] | 0
                do
                    if (Y | Z) {
                        H = (N | 0) == (Y | 0)
                        if (!(M & H)) {
                            q = (N | 0) == (Z | 0)
                            if (!(P & q)) {
                                if (M & ((T | 0) < (Y | 0))) {
                                    $ = 0
                                    aa = ((T << 1) - Y) | 0
                                    break
                                }
                                if (q & ((T | 0) > (Y | 0))) {
                                    $ = Z
                                    aa = ((T << 1) - Y) | 0
                                    break
                                }
                                if (H & ((T | 0) > (Z | 0))) {
                                    $ = ((T << 1) - Z) | 0
                                    aa = Y
                                    break
                                }
                                if (P) {
                                    $ = (T | 0) < (Z | 0) ? ((T << 1) - Z) | 0 : Z
                                    aa = 0
                                } else {
                                    $ = Z
                                    aa = Y
                                }
                            } else {
                                $ = Z
                                aa = Z
                            }
                        } else {
                            $ = Y
                            aa = Y
                        }
                    } else {
                        $ = N
                        aa = N
                    }
                while (0)
                P = (0 - S) | 0
                M = (0 - _) | 0
                f[j >> 2] = 0 - O
                f[r >> 2] = P
                f[t >> 2] = M
                if ((O | 0) < 1) {
                    ba = (T - _) | 0
                    ca = (T - S) | 0
                } else {
                    H = (_ | 0) < 1 ? M : _
                    M = (S | 0) < 1 ? P : S
                    ba = (_ | 0) > 0 ? M : (N - M) | 0
                    ca = (S | 0) > 0 ? H : (N - H) | 0
                }
                H = (ca | 0) == 0
                M = (ba | 0) == 0
                do
                    if (((ba | ca | 0) != 0 ? ((P = (N | 0) == (ba | 0)), !(H & P)) : 0) ? ((q = (N | 0) == (ca | 0)), !(M & q)) : 0) {
                        if (H & ((T | 0) < (ba | 0))) {
                            da = 0
                            ea = ((T << 1) - ba) | 0
                            break
                        }
                        if (q & ((T | 0) > (ba | 0))) {
                            da = N
                            ea = ((T << 1) - ba) | 0
                            break
                        }
                        if (P & ((T | 0) > (ca | 0))) {
                            da = ((T << 1) - ca) | 0
                            ea = N
                            break
                        }
                        if (M) {
                            da = (T | 0) < (ca | 0) ? ((T << 1) - ca) | 0 : ca
                            ea = 0
                        } else {
                            da = ca
                            ea = ba
                        }
                    } else {
                        da = N
                        ea = N
                    }
                while (0)
                N = K << 1
                M = (b + (N << 2)) | 0
                H = (M + 4) | 0
                O = f[H >> 2] | 0
                f[h >> 2] = f[M >> 2]
                f[x >> 2] = O
                f[i >> 2] = $
                f[y >> 2] = aa
                Dd(d, n, h, i)
                O = f[d >> 2] | 0
                f[k >> 2] = O
                P = f[z >> 2] | 0
                f[A >> 2] = P
                q = f[H >> 2] | 0
                f[h >> 2] = f[M >> 2]
                f[B >> 2] = q
                f[i >> 2] = da
                f[C >> 2] = ea
                Dd(d, n, h, i)
                q = f[d >> 2] | 0
                f[l >> 2] = q
                M = f[D >> 2] | 0
                f[E >> 2] = M
                H = f[v >> 2] | 0
                if ((H | 0) >= (O | 0))
                    if ((O | 0) < ((0 - H) | 0)) fa = ((f[F >> 2] | 0) + O) | 0
                    else fa = O
                else fa = (O - (f[F >> 2] | 0)) | 0
                f[k >> 2] = fa
                if ((H | 0) >= (P | 0))
                    if ((P | 0) < ((0 - H) | 0)) ga = ((f[F >> 2] | 0) + P) | 0
                    else ga = P
                else ga = (P - (f[F >> 2] | 0)) | 0
                f[a >> 2] = ga
                if ((H | 0) >= (q | 0))
                    if ((q | 0) < ((0 - H) | 0)) ha = ((f[F >> 2] | 0) + q) | 0
                    else ha = q
                else ha = (q - (f[F >> 2] | 0)) | 0
                f[l >> 2] = ha
                if ((H | 0) >= (M | 0))
                    if ((M | 0) < ((0 - H) | 0)) ia = ((f[F >> 2] | 0) + M) | 0
                    else ia = M
                else ia = (M - (f[F >> 2] | 0)) | 0
                f[G >> 2] = ia
                if (((((ga | 0) > -1 ? ga : (0 - ga) | 0) + ((fa | 0) > -1 ? fa : (0 - fa) | 0)) | 0) < ((((ha | 0) > -1 ? ha : (0 - ha) | 0) + ((ia | 0) > -1 ? ia : (0 - ia) | 0)) | 0)) {
                    Vi(g, 0)
                    ja = k
                } else {
                    Vi(g, 1)
                    ja = l
                }
                M = f[ja >> 2] | 0
                if ((M | 0) < 0) ka = ((f[F >> 2] | 0) + M) | 0
                else ka = M
                M = (c + (N << 2)) | 0
                f[M >> 2] = ka
                N = f[(ja + 4) >> 2] | 0
                if ((N | 0) < 0) la = ((f[F >> 2] | 0) + N) | 0
                else la = N
                f[(M + 4) >> 2] = la
                K = (K + 1) | 0
                if ((K | 0) >= (s | 0)) {
                    ma = 5
                    break
                }
                M = f[p >> 2] | 0
                L = f[M >> 2] | 0
                if ((((f[(M + 4) >> 2] | 0) - L) >> 2) >>> 0 <= K >>> 0) {
                    J = M
                    ma = 6
                    break
                }
            }
            if ((ma | 0) == 5) {
                u = e
                return 1
            } else if ((ma | 0) == 6) mq(J)
            return 0
        }
        function oc(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0
            c = u
            u = (u + 48) | 0
            d = (c + 24) | 0
            e = (c + 12) | 0
            g = c
            if (!b) {
                h = 0
                u = c
                return h | 0
            }
            i = (a + 12) | 0
            j = (a + 4) | 0
            k = f[j >> 2] | 0
            l = f[a >> 2] | 0
            m = (k - l) >> 2
            n = (a + 16) | 0
            o = f[n >> 2] | 0
            p = f[i >> 2] | 0
            q = (o - p) >> 2
            r = p
            p = o
            if (m >>> 0 <= q >>> 0)
                if (m >>> 0 < q >>> 0 ? ((o = (r + (m << 2)) | 0), (o | 0) != (p | 0)) : 0) {
                    f[n >> 2] = p + (~(((p + -4 - o) | 0) >>> 2) << 2)
                    s = l
                    t = k
                } else {
                    s = l
                    t = k
                }
            else {
                kh(i, (m - q) | 0, 5828)
                s = f[a >> 2] | 0
                t = f[j >> 2] | 0
            }
            f[d >> 2] = 0
            q = (d + 4) | 0
            f[q >> 2] = 0
            f[(d + 8) >> 2] = 0
            $j(d, (t - s) >> 2)
            s = f[j >> 2] | 0
            t = f[a >> 2] | 0
            if ((s | 0) == (t | 0)) {
                v = s
                w = s
            } else {
                m = f[d >> 2] | 0
                k = m
                l = k
                o = 0
                p = s
                s = k
                k = t
                t = m
                while (1) {
                    m = f[(k + (o << 2)) >> 2] | 0
                    n = f[q >> 2] | 0
                    if (m >>> 0 < ((n - t) >> 2) >>> 0) {
                        x = l
                        y = s
                        z = k
                        A = p
                    } else {
                        r = (m + 1) | 0
                        f[e >> 2] = 0
                        B = (n - t) >> 2
                        C = t
                        D = n
                        if (r >>> 0 <= B >>> 0)
                            if (r >>> 0 < B >>> 0 ? ((n = (C + (r << 2)) | 0), (n | 0) != (D | 0)) : 0) {
                                f[q >> 2] = D + (~(((D + -4 - n) | 0) >>> 2) << 2)
                                E = l
                                F = p
                                G = k
                            } else {
                                E = l
                                F = p
                                G = k
                            }
                        else {
                            kh(d, (r - B) | 0, e)
                            E = f[d >> 2] | 0
                            F = f[j >> 2] | 0
                            G = f[a >> 2] | 0
                        }
                        x = E
                        y = E
                        z = G
                        A = F
                    }
                    B = (y + (m << 2)) | 0
                    f[B >> 2] = (f[B >> 2] | 0) + 1
                    o = (o + 1) | 0
                    if (o >>> 0 >= ((A - z) >> 2) >>> 0) {
                        v = z
                        w = A
                        break
                    } else {
                        l = x
                        p = A
                        s = y
                        k = z
                        t = y
                    }
                }
            }
            y = (w - v) | 0
            v = y >> 2
            f[e >> 2] = 0
            w = (e + 4) | 0
            f[w >> 2] = 0
            f[(e + 8) >> 2] = 0
            if (!v) {
                H = 0
                I = 0
            } else {
                if (v >>> 0 > 536870911) mq(e)
                t = dn(y << 1) | 0
                f[w >> 2] = t
                f[e >> 2] = t
                y = (t + (v << 3)) | 0
                f[(e + 8) >> 2] = y
                z = v
                v = t
                k = t
                while (1) {
                    s = v
                    f[s >> 2] = -1
                    f[(s + 4) >> 2] = -1
                    s = (k + 8) | 0
                    A = (z + -1) | 0
                    if (!A) break
                    else {
                        z = A
                        v = s
                        k = s
                    }
                }
                f[w >> 2] = y
                H = t
                I = t
            }
            t = f[q >> 2] | 0
            y = f[d >> 2] | 0
            k = (t - y) | 0
            v = k >> 2
            f[g >> 2] = 0
            z = (g + 4) | 0
            f[z >> 2] = 0
            f[(g + 8) >> 2] = 0
            s = y
            do
                if (v)
                    if (v >>> 0 > 1073741823) mq(g)
                    else {
                        A = dn(k) | 0
                        f[g >> 2] = A
                        p = (A + (v << 2)) | 0
                        f[(g + 8) >> 2] = p
                        hj(A | 0, 0, k | 0) | 0
                        f[z >> 2] = p
                        J = A
                        K = p
                        L = A
                        break
                    }
                else {
                    J = 0
                    K = 0
                    L = 0
                }
            while (0)
            if ((t | 0) != (y | 0)) {
                y = 0
                t = 0
                while (1) {
                    f[(J + (t << 2)) >> 2] = y
                    k = (t + 1) | 0
                    if (k >>> 0 < v >>> 0) {
                        y = ((f[(s + (t << 2)) >> 2] | 0) + y) | 0
                        t = k
                    } else break
                }
            }
            t = f[j >> 2] | 0
            j = f[a >> 2] | 0
            y = j
            if ((t | 0) != (j | 0)) {
                k = (a + 40) | 0
                a = (t - j) >> 2
                j = H
                t = H
                g = H
                A = H
                p = H
                x = H
                l = 0
                o = J
                while (1) {
                    F = f[(y + (l << 2)) >> 2] | 0
                    G = (l + 1) | 0
                    E = ((G >>> 0) % 3 | 0 | 0) == 0 ? (l + -2) | 0 : G
                    if ((E | 0) == -1) M = -1
                    else M = f[(y + (E << 2)) >> 2] | 0
                    E = ((l >>> 0) % 3 | 0 | 0) == 0
                    G = ((E ? 2 : -1) + l) | 0
                    if ((G | 0) == -1) N = -1
                    else N = f[(y + (G << 2)) >> 2] | 0
                    if (E ? ((M | 0) == (N | 0)) | (((F | 0) == (M | 0)) | ((F | 0) == (N | 0))) : 0) {
                        f[k >> 2] = (f[k >> 2] | 0) + 1
                        O = j
                        P = t
                        Q = g
                        R = A
                        S = p
                        T = x
                        U = (l + 2) | 0
                        V = o
                    } else W = 51
                    a: do
                        if ((W | 0) == 51) {
                            W = 0
                            E = f[(s + (N << 2)) >> 2] | 0
                            b: do
                                if ((E | 0) > 0) {
                                    G = 0
                                    B = f[(o + (N << 2)) >> 2] | 0
                                    while (1) {
                                        m = f[(p + (B << 3)) >> 2] | 0
                                        if ((m | 0) == -1) {
                                            X = j
                                            Y = t
                                            Z = A
                                            _ = p
                                            break b
                                        }
                                        if ((m | 0) == (M | 0)) {
                                            m = f[(p + (B << 3) + 4) >> 2] | 0
                                            if ((m | 0) == -1) $ = -1
                                            else $ = f[(y + (m << 2)) >> 2] | 0
                                            if ((F | 0) != ($ | 0)) break
                                        }
                                        m = (G + 1) | 0
                                        if ((m | 0) < (E | 0)) {
                                            G = m
                                            B = (B + 1) | 0
                                        } else {
                                            X = j
                                            Y = t
                                            Z = A
                                            _ = p
                                            break b
                                        }
                                    }
                                    m = f[(A + (B << 3) + 4) >> 2] | 0
                                    r = G
                                    n = B
                                    D = t
                                    while (1) {
                                        r = (r + 1) | 0
                                        if ((r | 0) >= (E | 0)) break
                                        C = (n + 1) | 0
                                        f[(D + (n << 3)) >> 2] = f[(D + (C << 3)) >> 2]
                                        f[(D + (n << 3) + 4) >> 2] = f[(D + (C << 3) + 4) >> 2]
                                        if ((f[(j + (n << 3)) >> 2] | 0) == -1) break
                                        else {
                                            n = C
                                            D = j
                                        }
                                    }
                                    f[(g + (n << 3)) >> 2] = -1
                                    if ((m | 0) == -1) {
                                        X = g
                                        Y = g
                                        Z = g
                                        _ = g
                                    } else {
                                        D = f[i >> 2] | 0
                                        f[(D + (l << 2)) >> 2] = m
                                        f[(D + (m << 2)) >> 2] = l
                                        O = g
                                        P = g
                                        Q = g
                                        R = g
                                        S = g
                                        T = x
                                        U = l
                                        V = o
                                        break a
                                    }
                                } else {
                                    X = j
                                    Y = t
                                    Z = A
                                    _ = p
                                }
                            while (0)
                            E = f[(s + (M << 2)) >> 2] | 0
                            if ((E | 0) > 0) {
                                D = 0
                                r = f[(J + (M << 2)) >> 2] | 0
                                while (1) {
                                    aa = (x + (r << 3)) | 0
                                    if ((f[aa >> 2] | 0) == -1) break
                                    D = (D + 1) | 0
                                    if ((D | 0) >= (E | 0)) {
                                        O = x
                                        P = x
                                        Q = x
                                        R = x
                                        S = x
                                        T = x
                                        U = l
                                        V = J
                                        break a
                                    } else r = (r + 1) | 0
                                }
                                f[aa >> 2] = N
                                f[(H + (r << 3) + 4) >> 2] = l
                                O = H
                                P = H
                                Q = H
                                R = H
                                S = H
                                T = H
                                U = l
                                V = J
                            } else {
                                O = X
                                P = Y
                                Q = g
                                R = Z
                                S = _
                                T = x
                                U = l
                                V = o
                            }
                        }
                    while (0)
                    l = (U + 1) | 0
                    if (l >>> 0 >= a >>> 0) break
                    else {
                        j = O
                        t = P
                        g = Q
                        A = R
                        p = S
                        x = T
                        o = V
                    }
                }
            }
            f[b >> 2] = v
            if (!J) {
                ba = H
                ca = I
            } else {
                if ((K | 0) != (J | 0)) f[z >> 2] = K + (~(((K + -4 - J) | 0) >>> 2) << 2)
                br(L)
                L = f[e >> 2] | 0
                ba = L
                ca = L
            }
            if (ba | 0) {
                L = f[w >> 2] | 0
                if ((L | 0) != (ba | 0)) f[w >> 2] = L + (~(((L + -8 - ba) | 0) >>> 3) << 3)
                br(ca)
            }
            ca = f[d >> 2] | 0
            if (ca | 0) {
                d = f[q >> 2] | 0
                if ((d | 0) != (ca | 0)) f[q >> 2] = d + (~(((d + -4 - ca) | 0) >>> 2) << 2)
                br(ca)
            }
            h = 1
            u = c
            return h | 0
        }
        function pc(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                J = 0,
                K = 0,
                L = 0,
                M = 0,
                N = 0,
                O = 0,
                P = 0,
                Q = 0,
                R = Oa,
                S = Oa,
                T = Oa,
                U = 0,
                V = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0
            e = u
            u = (u + 48) | 0
            g = (e + 12) | 0
            h = (e + 35) | 0
            i = (e + 32) | 0
            j = e
            k = (g + 16) | 0
            f[g >> 2] = 0
            f[(g + 4) >> 2] = 0
            f[(g + 8) >> 2] = 0
            f[(g + 12) >> 2] = 0
            n[k >> 2] = $(1.0)
            l = (a + 80) | 0
            m = f[l >> 2] | 0
            f[j >> 2] = 0
            o = (j + 4) | 0
            f[o >> 2] = 0
            f[(j + 8) >> 2] = 0
            if (m) {
                if (m >>> 0 > 1073741823) mq(j)
                p = m << 2
                q = dn(p) | 0
                f[j >> 2] = q
                r = (q + (m << 2)) | 0
                f[(j + 8) >> 2] = r
                hj(q | 0, 0, p | 0) | 0
                f[o >> 2] = r
                r = f[d >> 2] | 0
                d = (c + 48) | 0
                p = (c + 40) | 0
                q = (i + 1) | 0
                m = (i + 2) | 0
                s = (g + 4) | 0
                t = (g + 12) | 0
                v = (g + 8) | 0
                w = (a + 40) | 0
                x = (a + 64) | 0
                y = 0
                z = 0
                while (1) {
                    A = d
                    B = f[A >> 2] | 0
                    C = f[(A + 4) >> 2] | 0
                    A = p
                    D = on(f[A >> 2] | 0, f[(A + 4) >> 2] | 0, (r + y) | 0, 0) | 0
                    A = Tn(D | 0, I | 0, B | 0, C | 0) | 0
                    C = ((f[f[c >> 2] >> 2] | 0) + A) | 0
                    b[h >> 0] = b[C >> 0] | 0
                    b[(h + 1) >> 0] = b[(C + 1) >> 0] | 0
                    b[(h + 2) >> 0] = b[(C + 2) >> 0] | 0
                    Xl(i | 0, C | 0, 3) | 0
                    C = Uf(g, i) | 0
                    if (!C) {
                        A = b[i >> 0] | 0
                        B = b[q >> 0] | 0
                        D = b[m >> 0] | 0
                        E = (((((A & 255) ^ 318) + 239) ^ (B & 255)) + 239) ^ (D & 255)
                        F = f[s >> 2] | 0
                        G = (F | 0) == 0
                        a: do
                            if (!G) {
                                H = (F + -1) | 0
                                J = ((H & F) | 0) == 0
                                if (!J)
                                    if (E >>> 0 < F >>> 0) K = E
                                    else K = (E >>> 0) % (F >>> 0) | 0
                                else K = E & H
                                L = f[((f[g >> 2] | 0) + (K << 2)) >> 2] | 0
                                if ((L | 0) != 0 ? ((M = f[L >> 2] | 0), (M | 0) != 0) : 0) {
                                    if (J) {
                                        J = M
                                        while (1) {
                                            L = f[(J + 4) >> 2] | 0
                                            if (!(((L | 0) == (E | 0)) | (((L & H) | 0) == (K | 0)))) {
                                                N = K
                                                O = 29
                                                break a
                                            }
                                            L = (J + 8) | 0
                                            if (((b[L >> 0] | 0) == (A << 24) >> 24 ? (b[(L + 1) >> 0] | 0) == (B << 24) >> 24 : 0) ? (b[(L + 2) >> 0] | 0) == (D << 24) >> 24 : 0) break a
                                            J = f[J >> 2] | 0
                                            if (!J) {
                                                N = K
                                                O = 29
                                                break a
                                            }
                                        }
                                    } else P = M
                                    while (1) {
                                        J = f[(P + 4) >> 2] | 0
                                        if ((J | 0) != (E | 0)) {
                                            if (J >>> 0 < F >>> 0) Q = J
                                            else Q = (J >>> 0) % (F >>> 0) | 0
                                            if ((Q | 0) != (K | 0)) {
                                                N = K
                                                O = 29
                                                break a
                                            }
                                        }
                                        J = (P + 8) | 0
                                        if (((b[J >> 0] | 0) == (A << 24) >> 24 ? (b[(J + 1) >> 0] | 0) == (B << 24) >> 24 : 0) ? (b[(J + 2) >> 0] | 0) == (D << 24) >> 24 : 0) break a
                                        P = f[P >> 2] | 0
                                        if (!P) {
                                            N = K
                                            O = 29
                                            break
                                        }
                                    }
                                } else {
                                    N = K
                                    O = 29
                                }
                            } else {
                                N = 0
                                O = 29
                            }
                        while (0)
                        if ((O | 0) == 29) {
                            O = 0
                            M = dn(16) | 0
                            b[(M + 8) >> 0] = A
                            b[(M + 9) >> 0] = B
                            b[(M + 10) >> 0] = D
                            f[(M + 12) >> 2] = z
                            f[(M + 4) >> 2] = E
                            f[M >> 2] = 0
                            R = $((((f[t >> 2] | 0) + 1) | 0) >>> 0)
                            S = $(F >>> 0)
                            T = $(n[k >> 2])
                            do
                                if (G | ($(T * S) < R)) {
                                    J = (F << 1) | (((F >>> 0 < 3) | ((((F + -1) & F) | 0) != 0)) & 1)
                                    H = ~~$(W($(R / T))) >>> 0
                                    Kh(g, J >>> 0 < H >>> 0 ? H : J)
                                    J = f[s >> 2] | 0
                                    H = (J + -1) | 0
                                    if (!(H & J)) {
                                        U = J
                                        V = H & E
                                        break
                                    }
                                    if (E >>> 0 < J >>> 0) {
                                        U = J
                                        V = E
                                    } else {
                                        U = J
                                        V = (E >>> 0) % (J >>> 0) | 0
                                    }
                                } else {
                                    U = F
                                    V = N
                                }
                            while (0)
                            F = ((f[g >> 2] | 0) + (V << 2)) | 0
                            E = f[F >> 2] | 0
                            if (!E) {
                                f[M >> 2] = f[v >> 2]
                                f[v >> 2] = M
                                f[F >> 2] = v
                                F = f[M >> 2] | 0
                                if (F | 0) {
                                    G = f[(F + 4) >> 2] | 0
                                    F = (U + -1) | 0
                                    if (F & U)
                                        if (G >>> 0 < U >>> 0) X = G
                                        else X = (G >>> 0) % (U >>> 0) | 0
                                    else X = G & F
                                    Y = ((f[g >> 2] | 0) + (X << 2)) | 0
                                    O = 42
                                }
                            } else {
                                f[M >> 2] = f[E >> 2]
                                Y = E
                                O = 42
                            }
                            if ((O | 0) == 42) {
                                O = 0
                                f[Y >> 2] = M
                            }
                            f[t >> 2] = (f[t >> 2] | 0) + 1
                        }
                        E = w
                        F = f[E >> 2] | 0
                        G = on(F | 0, f[(E + 4) >> 2] | 0, z | 0, 0) | 0
                        Rg(((f[f[x >> 2] >> 2] | 0) + G) | 0, h | 0, F | 0) | 0
                        F = f[j >> 2] | 0
                        f[(F + (y << 2)) >> 2] = z
                        Z = (z + 1) | 0
                        _ = F
                    } else {
                        F = f[j >> 2] | 0
                        f[(F + (y << 2)) >> 2] = f[(C + 12) >> 2]
                        Z = z
                        _ = F
                    }
                    y = (y + 1) | 0
                    aa = f[l >> 2] | 0
                    if (y >>> 0 >= aa >>> 0) break
                    else z = Z
                }
                if ((Z | 0) == (aa | 0)) ba = _
                else {
                    z = (a + 84) | 0
                    if (!(b[z >> 0] | 0)) {
                        y = f[(a + 72) >> 2] | 0
                        h = f[(a + 68) >> 2] | 0
                        x = h
                        if ((y | 0) == (h | 0)) ca = _
                        else {
                            w = (y - h) >> 2
                            h = 0
                            do {
                                y = (x + (h << 2)) | 0
                                f[y >> 2] = f[(_ + (f[y >> 2] << 2)) >> 2]
                                h = (h + 1) | 0
                            } while (h >>> 0 < w >>> 0)
                            ca = _
                        }
                    } else {
                        b[z >> 0] = 0
                        z = (a + 68) | 0
                        _ = (a + 72) | 0
                        w = f[_ >> 2] | 0
                        h = f[z >> 2] | 0
                        x = (w - h) >> 2
                        y = h
                        h = w
                        if (aa >>> 0 <= x >>> 0)
                            if (aa >>> 0 < x >>> 0 ? ((w = (y + (aa << 2)) | 0), (w | 0) != (h | 0)) : 0) {
                                f[_ >> 2] = h + (~(((h + -4 - w) | 0) >>> 2) << 2)
                                da = aa
                            } else da = aa
                        else {
                            kh(z, (aa - x) | 0, 1204)
                            da = f[l >> 2] | 0
                        }
                        x = f[j >> 2] | 0
                        if (!da) ca = x
                        else {
                            j = f[(a + 68) >> 2] | 0
                            a = 0
                            do {
                                f[(j + (a << 2)) >> 2] = f[(x + (a << 2)) >> 2]
                                a = (a + 1) | 0
                            } while (a >>> 0 < da >>> 0)
                            ca = x
                        }
                    }
                    f[l >> 2] = Z
                    ba = ca
                }
                if (!ba) ea = Z
                else {
                    ca = f[o >> 2] | 0
                    if ((ca | 0) != (ba | 0)) f[o >> 2] = ca + (~(((ca + -4 - ba) | 0) >>> 2) << 2)
                    br(ba)
                    ea = Z
                }
            } else ea = 0
            Z = f[(g + 8) >> 2] | 0
            if (Z | 0) {
                ba = Z
                do {
                    Z = ba
                    ba = f[ba >> 2] | 0
                    br(Z)
                } while ((ba | 0) != 0)
            }
            ba = f[g >> 2] | 0
            f[g >> 2] = 0
            if (!ba) {
                u = e
                return ea | 0
            }
            br(ba)
            u = e
            return ea | 0
        }
        function qc(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 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,
                _ = 0,
                $ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0,
                ga = 0,
                ha = 0,
                ia = 0,
                ja = 0,
                ka = 0,
                la = 0,
                ma = 0
            e = u
            u = (u + 64) | 0
            d = (e + 48) | 0
            h = (e + 40) | 0
            i = (e + 32) | 0
            j = (e + 16) | 0
            k = (e + 8) | 0
            l = e
            m = (e + 28) | 0
            n = (a + 8) | 0
            o = f[n >> 2] | 0
            if (((o + -2) | 0) >>> 0 <= 28) {
                f[(a + 72) >> 2] = o
                p = 1 << o
                f[(a + 76) >> 2] = p + -1
                o = (p + -2) | 0
                f[(a + 80) >> 2] = o
                f[(a + 84) >> 2] = ((o | 0) / 2) | 0
            }
            o = (a + 40) | 0
            f[(a + 48) >> 2] = g
            g = (a + 88) | 0
            lk(g)
            p = (a + 36) | 0
            q = f[p >> 2] | 0
            r = ((f[(q + 4) >> 2] | 0) - (f[q >> 2] | 0)) | 0
            s = r >> 2
            f[j >> 2] = 0
            f[(j + 4) >> 2] = 0
            f[(j + 8) >> 2] = 0
            t = k
            f[t >> 2] = 0
            f[(t + 4) >> 2] = 0
            t = l
            f[t >> 2] = 0
            f[(t + 4) >> 2] = 0
            if ((r | 0) <= 0) {
                u = e
                return 1
            }
            r = (j + 4) | 0
            t = (j + 8) | 0
            v = (a + 84) | 0
            w = (a + 80) | 0
            x = (h + 4) | 0
            y = (i + 4) | 0
            z = (d + 4) | 0
            A = (k + 4) | 0
            B = (h + 4) | 0
            C = (i + 4) | 0
            D = (d + 4) | 0
            E = (l + 4) | 0
            F = (a + 76) | 0
            a = (k + 4) | 0
            G = (l + 4) | 0
            H = f[q >> 2] | 0
            if ((f[(q + 4) >> 2] | 0) == (H | 0)) {
                J = q
                mq(J)
            } else {
                K = 0
                L = H
            }
            while (1) {
                f[m >> 2] = f[(L + (K << 2)) >> 2]
                f[d >> 2] = f[m >> 2]
                $b(o, d, j)
                H = f[j >> 2] | 0
                q = (H | 0) > -1 ? H : (0 - H) | 0
                M = f[r >> 2] | 0
                N = (M | 0) > -1 ? M : (0 - M) | 0
                O = Tn(N | 0, ((((N | 0) < 0) << 31) >> 31) | 0, q | 0, ((((q | 0) < 0) << 31) >> 31) | 0) | 0
                q = f[t >> 2] | 0
                N = (q | 0) > -1
                P = N ? q : (0 - q) | 0
                q = Tn(O | 0, I | 0, P | 0, ((((P | 0) < 0) << 31) >> 31) | 0) | 0
                P = I
                if (((q | 0) == 0) & ((P | 0) == 0)) {
                    O = f[v >> 2] | 0
                    Q = O
                    R = j
                    S = M
                    T = O
                } else {
                    O = f[v >> 2] | 0
                    U = (((O | 0) < 0) << 31) >> 31
                    V = on(O | 0, U | 0, H | 0, ((((H | 0) < 0) << 31) >> 31) | 0) | 0
                    H = zk(V | 0, I | 0, q | 0, P | 0) | 0
                    f[j >> 2] = H
                    V = on(O | 0, U | 0, M | 0, ((((M | 0) < 0) << 31) >> 31) | 0) | 0
                    M = zk(V | 0, I | 0, q | 0, P | 0) | 0
                    f[r >> 2] = M
                    P = (O - ((H | 0) > -1 ? H : (0 - H) | 0) - ((M | 0) > -1 ? M : (0 - M) | 0)) | 0
                    Q = N ? P : (0 - P) | 0
                    R = t
                    S = M
                    T = O
                }
                f[R >> 2] = Q
                O = f[j >> 2] | 0
                do
                    if ((O | 0) <= -1) {
                        if ((S | 0) < 0) {
                            M = f[t >> 2] | 0
                            W = (M | 0) > -1 ? M : (0 - M) | 0
                            X = M
                        } else {
                            M = f[t >> 2] | 0
                            W = ((f[w >> 2] | 0) - ((M | 0) > -1 ? M : (0 - M) | 0)) | 0
                            X = M
                        }
                        if ((X | 0) < 0) {
                            Y = (S | 0) > -1 ? S : (0 - S) | 0
                            Z = W
                            _ = X
                            break
                        } else {
                            Y = ((f[w >> 2] | 0) - ((S | 0) > -1 ? S : (0 - S) | 0)) | 0
                            Z = W
                            _ = X
                            break
                        }
                    } else {
                        M = f[t >> 2] | 0
                        Y = (M + T) | 0
                        Z = (T + S) | 0
                        _ = M
                    }
                while (0)
                M = (Z | 0) == 0
                P = (Y | 0) == 0
                N = f[w >> 2] | 0
                do
                    if (Y | Z) {
                        H = (N | 0) == (Y | 0)
                        if (!(M & H)) {
                            q = (N | 0) == (Z | 0)
                            if (!(P & q)) {
                                if (M & ((T | 0) < (Y | 0))) {
                                    $ = 0
                                    aa = ((T << 1) - Y) | 0
                                    break
                                }
                                if (q & ((T | 0) > (Y | 0))) {
                                    $ = Z
                                    aa = ((T << 1) - Y) | 0
                                    break
                                }
                                if (H & ((T | 0) > (Z | 0))) {
                                    $ = ((T << 1) - Z) | 0
                                    aa = Y
                                    break
                                }
                                if (P) {
                                    $ = (T | 0) < (Z | 0) ? ((T << 1) - Z) | 0 : Z
                                    aa = 0
                                } else {
                                    $ = Z
                                    aa = Y
                                }
                            } else {
                                $ = Z
                                aa = Z
                            }
                        } else {
                            $ = Y
                            aa = Y
                        }
                    } else {
                        $ = N
                        aa = N
                    }
                while (0)
                P = (0 - S) | 0
                M = (0 - _) | 0
                f[j >> 2] = 0 - O
                f[r >> 2] = P
                f[t >> 2] = M
                if ((O | 0) < 1) {
                    ba = (T - _) | 0
                    ca = (T - S) | 0
                } else {
                    H = (_ | 0) < 1 ? M : _
                    M = (S | 0) < 1 ? P : S
                    ba = (_ | 0) > 0 ? M : (N - M) | 0
                    ca = (S | 0) > 0 ? H : (N - H) | 0
                }
                H = (ca | 0) == 0
                M = (ba | 0) == 0
                do
                    if (((ba | ca | 0) != 0 ? ((P = (N | 0) == (ba | 0)), !(H & P)) : 0) ? ((q = (N | 0) == (ca | 0)), !(M & q)) : 0) {
                        if (H & ((T | 0) < (ba | 0))) {
                            da = 0
                            ea = ((T << 1) - ba) | 0
                            break
                        }
                        if (q & ((T | 0) > (ba | 0))) {
                            da = N
                            ea = ((T << 1) - ba) | 0
                            break
                        }
                        if (P & ((T | 0) > (ca | 0))) {
                            da = ((T << 1) - ca) | 0
                            ea = N
                            break
                        }
                        if (M) {
                            da = (T | 0) < (ca | 0) ? ((T << 1) - ca) | 0 : ca
                            ea = 0
                        } else {
                            da = ca
                            ea = ba
                        }
                    } else {
                        da = N
                        ea = N
                    }
                while (0)
                N = K << 1
                M = (b + (N << 2)) | 0
                H = (M + 4) | 0
                O = f[H >> 2] | 0
                f[h >> 2] = f[M >> 2]
                f[x >> 2] = O
                f[i >> 2] = $
                f[y >> 2] = aa
                Dd(d, n, h, i)
                O = f[d >> 2] | 0
                f[k >> 2] = O
                P = f[z >> 2] | 0
                f[A >> 2] = P
                q = f[H >> 2] | 0
                f[h >> 2] = f[M >> 2]
                f[B >> 2] = q
                f[i >> 2] = da
                f[C >> 2] = ea
                Dd(d, n, h, i)
                q = f[d >> 2] | 0
                f[l >> 2] = q
                M = f[D >> 2] | 0
                f[E >> 2] = M
                H = f[v >> 2] | 0
                if ((H | 0) >= (O | 0))
                    if ((O | 0) < ((0 - H) | 0)) fa = ((f[F >> 2] | 0) + O) | 0
                    else fa = O
                else fa = (O - (f[F >> 2] | 0)) | 0
                f[k >> 2] = fa
                if ((H | 0) >= (P | 0))
                    if ((P | 0) < ((0 - H) | 0)) ga = ((f[F >> 2] | 0) + P) | 0
                    else ga = P
                else ga = (P - (f[F >> 2] | 0)) | 0
                f[a >> 2] = ga
                if ((H | 0) >= (q | 0))
                    if ((q | 0) < ((0 - H) | 0)) ha = ((f[F >> 2] | 0) + q) | 0
                    else ha = q
                else ha = (q - (f[F >> 2] | 0)) | 0
                f[l >> 2] = ha
                if ((H | 0) >= (M | 0))
                    if ((M | 0) < ((0 - H) | 0)) ia = ((f[F >> 2] | 0) + M) | 0
                    else ia = M
                else ia = (M - (f[F >> 2] | 0)) | 0
                f[G >> 2] = ia
                if (((((ga | 0) > -1 ? ga : (0 - ga) | 0) + ((fa | 0) > -1 ? fa : (0 - fa) | 0)) | 0) < ((((ha | 0) > -1 ? ha : (0 - ha) | 0) + ((ia | 0) > -1 ? ia : (0 - ia) | 0)) | 0)) {
                    Vi(g, 0)
                    ja = k
                } else {
                    Vi(g, 1)
                    ja = l
                }
                M = f[ja >> 2] | 0
                if ((M | 0) < 0) ka = ((f[F >> 2] | 0) + M) | 0
                else ka = M
                M = (c + (N << 2)) | 0
                f[M >> 2] = ka
                N = f[(ja + 4) >> 2] | 0
                if ((N | 0) < 0) la = ((f[F >> 2] | 0) + N) | 0
                else la = N
                f[(M + 4) >> 2] = la
                K = (K + 1) | 0
                if ((K | 0) >= (s | 0)) {
                    ma = 5
                    break
                }
                M = f[p >> 2] | 0
                L = f[M >> 2] | 0
                if ((((f[(M + 4) >> 2] | 0) - L) >> 2) >>> 0 <= K >>> 0) {
                    J = M
                    ma = 6
                    break
                }
            }
            if ((ma | 0) == 5) {
                u = e
                return 1
            } else if ((ma | 0) == 6) mq(J)
            return 0
        }
        function rc(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                o = 0,
                p = 0,
                q = 0,
                r = 0,
                s = 0,
                t = 0,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                J = 0,
                K = 0,
                L = 0,
                M = 0,
                N = 0,
                O = 0,
                P = 0,
                Q = 0,
                R = 0,
                S = Oa,
                T = Oa,
                U = Oa,
                V = 0,
                X = 0,
                Y = 0,
                Z = 0,
                _ = 0,
                aa = 0,
                ba = 0,
                ca = 0,
                da = 0,
                ea = 0,
                fa = 0
            e = u
            u = (u + 64) | 0
            g = (e + 36) | 0
            h = (e + 24) | 0
            i = (e + 12) | 0
            j = e
            k = (g + 16) | 0
            f[g >> 2] = 0
            f[(g + 4) >> 2] = 0
            f[(g + 8) >> 2] = 0
            f[(g + 12) >> 2] = 0
            n[k >> 2] = $(1.0)
            l = (a + 80) | 0
            m = f[l >> 2] | 0
            f[j >> 2] = 0
            o = (j + 4) | 0
            f[o >> 2] = 0
            f[(j + 8) >> 2] = 0
            if (m) {
                if (m >>> 0 > 1073741823) mq(j)
                p = m << 2
                q = dn(p) | 0
                f[j >> 2] = q
                r = (q + (m << 2)) | 0
                f[(j + 8) >> 2] = r
                hj(q | 0, 0, p | 0) | 0
                f[o >> 2] = r
                r = f[d >> 2] | 0
                d = (c + 48) | 0
                p = (c + 40) | 0
                q = (i + 4) | 0
                m = (i + 8) | 0
                s = (g + 4) | 0
                t = (g + 12) | 0
                v = (g + 8) | 0
                w = (a + 40) | 0
                x = (a + 64) | 0
                y = 0
                z = 0
                while (1) {
                    A = d
                    B = f[A >> 2] | 0
                    C = f[(A + 4) >> 2] | 0
                    A = p
                    D = on(f[A >> 2] | 0, f[(A + 4) >> 2] | 0, (r + z) | 0, 0) | 0
                    A = Tn(D | 0, I | 0, B | 0, C | 0) | 0
                    C = ((f[f[c >> 2] >> 2] | 0) + A) | 0
                    A = h
                    B = C
                    D = (A + 12) | 0
                    do {
                        b[A >> 0] = b[B >> 0] | 0
                        A = (A + 1) | 0
                        B = (B + 1) | 0
                    } while ((A | 0) < (D | 0))
                    Xl(i | 0, C | 0, 12) | 0
                    B = _f(g, i) | 0
                    if (!B) {
                        A = f[i >> 2] | 0
                        D = f[q >> 2] | 0
                        E = f[m >> 2] | 0
                        F = ((((A ^ 318) + 239) ^ D) + 239) ^ E
                        G = f[s >> 2] | 0
                        H = (G | 0) == 0
                        a: do
                            if (!H) {
                                J = (G + -1) | 0
                                K = ((J & G) | 0) == 0
                                if (!K)
                                    if (F >>> 0 < G >>> 0) L = F
                                    else L = (F >>> 0) % (G >>> 0) | 0
                                else L = F & J
                                M = f[((f[g >> 2] | 0) + (L << 2)) >> 2] | 0
                                if ((M | 0) != 0 ? ((N = f[M >> 2] | 0), (N | 0) != 0) : 0) {
                                    if (K) {
                                        K = N
                                        while (1) {
                                            M = f[(K + 4) >> 2] | 0
                                            if (!(((M | 0) == (F | 0)) | (((M & J) | 0) == (L | 0)))) {
                                                O = L
                                                P = 29
                                                break a
                                            }
                                            if (((f[(K + 8) >> 2] | 0) == (A | 0) ? (f[(K + 12) >> 2] | 0) == (D | 0) : 0) ? (f[(K + 16) >> 2] | 0) == (E | 0) : 0) break a
                                            K = f[K >> 2] | 0
                                            if (!K) {
                                                O = L
                                                P = 29
                                                break a
                                            }
                                        }
                                    } else Q = N
                                    while (1) {
                                        K = f[(Q + 4) >> 2] | 0
                                        if ((K | 0) != (F | 0)) {
                                            if (K >>> 0 < G >>> 0) R = K
                                            else R = (K >>> 0) % (G >>> 0) | 0
                                            if ((R | 0) != (L | 0)) {
                                                O = L
                                                P = 29
                                                break a
                                            }
                                        }
                                        if (((f[(Q + 8) >> 2] | 0) == (A | 0) ? (f[(Q + 12) >> 2] | 0) == (D | 0) : 0) ? (f[(Q + 16) >> 2] | 0) == (E | 0) : 0) break a
                                        Q = f[Q >> 2] | 0
                                        if (!Q) {
                                            O = L
                                            P = 29
                                            break
                                        }
                                    }
                                } else {
                                    O = L
                                    P = 29
                                }
                            } else {
                                O = 0
                                P = 29
                            }
                        while (0)
                        if ((P | 0) == 29) {
                            P = 0
                            C = dn(24) | 0
                            f[(C + 8) >> 2] = A
                            f[(C + 12) >> 2] = D
                            f[(C + 16) >> 2] = E
                            f[(C + 20) >> 2] = y
                            f[(C + 4) >> 2] = F
                            f[C >> 2] = 0
                            S = $((((f[t >> 2] | 0) + 1) | 0) >>> 0)
                            T = $(G >>> 0)
                            U = $(n[k >> 2])
                            do
                                if (H | ($(U * T) < S)) {
                                    N = (G << 1) | (((G >>> 0 < 3) | ((((G + -1) & G) | 0) != 0)) & 1)
                                    K = ~~$(W($(S / U))) >>> 0
                                    Hh(g, N >>> 0 < K >>> 0 ? K : N)
                                    N = f[s >> 2] | 0
                                    K = (N + -1) | 0
                                    if (!(K & N)) {
                                        V = N
                                        X = K & F
                                        break
                                    }
                                    if (F >>> 0 < N >>> 0) {
                                        V = N
                                        X = F
                                    } else {
                                        V = N
                                        X = (F >>> 0) % (N >>> 0) | 0
                                    }
                                } else {
                                    V = G
                                    X = O
                                }
                            while (0)
                            G = ((f[g >> 2] | 0) + (X << 2)) | 0
                            F = f[G >> 2] | 0
                            if (!F) {
                                f[C >> 2] = f[v >> 2]
                                f[v >> 2] = C
                                f[G >> 2] = v
                                G = f[C >> 2] | 0
                                if (G | 0) {
                                    H = f[(G + 4) >> 2] | 0
                                    G = (V + -1) | 0
                                    if (G & V)
                                        if (H >>> 0 < V >>> 0) Y = H
                                        else Y = (H >>> 0) % (V >>> 0) | 0
                                    else Y = H & G
                                    Z = ((f[g >> 2] | 0) + (Y << 2)) | 0
                                    P = 42
                                }
                            } else {
                                f[C >> 2] = f[F >> 2]
                                Z = F
                                P = 42
                            }
                            if ((P | 0) == 42) {
                                P = 0
                                f[Z >> 2] = C
                            }
                            f[t >> 2] = (f[t >> 2] | 0) + 1
                        }
                        F = w
                        G = f[F >> 2] | 0
                        H = on(G | 0, f[(F + 4) >> 2] | 0, y | 0, 0) | 0
                        Rg(((f[f[x >> 2] >> 2] | 0) + H) | 0, h | 0, G | 0) | 0
                        G = f[j >> 2] | 0
                        f[(G + (z << 2)) >> 2] = y
                        _ = (y + 1) | 0
                        aa = G
                    } else {
                        G = f[j >> 2] | 0
                        f[(G + (z << 2)) >> 2] = f[(B + 20) >> 2]
                        _ = y
                        aa = G
                    }
                    z = (z + 1) | 0
                    ba = f[l >> 2] | 0
                    if (z >>> 0 >= ba >>> 0) break
                    else y = _
                }
                if ((_ | 0) == (ba | 0)) ca = aa
                else {
                    y = (a + 84) | 0
                    if (!(b[y >> 0] | 0)) {
                        z = f[(a + 72) >> 2] | 0
                        h = f[(a + 68) >> 2] | 0
                        x = h
                        if ((z | 0) == (h | 0)) da = aa
                        else {
                            w = (z - h) >> 2
                            h = 0
                            do {
                                z = (x + (h << 2)) | 0
                                f[z >> 2] = f[(aa + (f[z >> 2] << 2)) >> 2]
                                h = (h + 1) | 0
                            } while (h >>> 0 < w >>> 0)
                            da = aa
                        }
                    } else {
                        b[y >> 0] = 0
                        y = (a + 68) | 0
                        aa = (a + 72) | 0
                        w = f[aa >> 2] | 0
                        h = f[y >> 2] | 0
                        x = (w - h) >> 2
                        z = h
                        h = w
                        if (ba >>> 0 <= x >>> 0)
                            if (ba >>> 0 < x >>> 0 ? ((w = (z + (ba << 2)) | 0), (w | 0) != (h | 0)) : 0) {
                                f[aa >> 2] = h + (~(((h + -4 - w) | 0) >>> 2) << 2)
                                ea = ba
                            } else ea = ba
                        else {
                            kh(y, (ba - x) | 0, 1204)
                            ea = f[l >> 2] | 0
                        }
                        x = f[j >> 2] | 0
                        if (!ea) da = x
                        else {
                            j = f[(a + 68) >> 2] | 0
                            a = 0
                            do {
                                f[(j + (a << 2)) >> 2] = f[(x + (a << 2)) >> 2]
                                a = (a + 1) | 0
                            } while (a >>> 0 < ea >>> 0)
                            da = x
                        }
                    }
                    f[l >> 2] = _
                    ca = da
                }
                if (!ca) fa = _
                else {
                    da = f[o >> 2] | 0
                    if ((da | 0) != (ca | 0)) f[o >> 2] = da + (~(((da + -4 - ca) | 0) >>> 2) << 2)
                    br(ca)
                    fa = _
                }
            } else fa = 0
            _ = f[(g + 8) >> 2] | 0
            if (_ | 0) {
                ca = _
                do {
                    _ = ca
                    ca = f[ca >> 2] | 0
                    br(_)
                } while ((ca | 0) != 0)
            }
            ca = f[g >> 2] | 0
            f[g >> 2] = 0
            if (!ca) {
                u = e
                return fa | 0
            }
            br(ca)
            u = e
            return fa | 0
        }
        function sc(a, c) {
            a = a | 0
            c = c | 0
            var e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0,
                F = 0,
                G = 0,
                H = 0,
                I = 0,
                J = 0,
                K = 0,
                L = 0,
                M = 0
            e = u
            u = (u + 32) | 0
            g = (e + 4) | 0
            h = e
            i = (e + 16) | 0
            j = (c + 56) | 0
            k = f[j >> 2] | 0
            l = ((f[(k + 100) >> 2] | 0) - (f[(k + 96) >> 2] | 0)) | 0
            k = ((l | 0) / 12) | 0
            m = (c + 44) | 0
            Nh(k, f[m >> 2] | 0) | 0
            Nh(f[((f[j >> 2] | 0) + 80) >> 2] | 0, f[m >> 2] | 0) | 0
            n = f[(c + 48) >> 2] | 0
            o = dn(32) | 0
            f[g >> 2] = o
            f[(g + 8) >> 2] = -2147483616
            f[(g + 4) >> 2] = 21
            p = o
            q = 14562
            r = (p + 21) | 0
            do {
                b[p >> 0] = b[q >> 0] | 0
                p = (p + 1) | 0
                q = (q + 1) | 0
            } while ((p | 0) < (r | 0))
            b[(o + 21) >> 0] = 0
            o = Oj(n, g, 0) | 0
            if ((b[(g + 11) >> 0] | 0) < 0) br(f[g >> 2] | 0)
            n = f[m >> 2] | 0
            if (o) {
                b[i >> 0] = 0
                o = (n + 16) | 0
                q = f[(o + 4) >> 2] | 0
                if (!(((q | 0) > 0) | (((q | 0) == 0) & ((f[o >> 2] | 0) >>> 0 > 0)))) {
                    f[h >> 2] = f[(n + 4) >> 2]
                    f[g >> 2] = f[h >> 2]
                    ye(n, g, i, (i + 1) | 0) | 0
                }
                Ye(c) | 0
                f[a >> 2] = 0
                f[(a + 4) >> 2] = 0
                f[(a + 8) >> 2] = 0
                f[(a + 12) >> 2] = 0
                u = e
                return
            }
            b[i >> 0] = 1
            c = (n + 16) | 0
            o = f[(c + 4) >> 2] | 0
            if (!(((o | 0) > 0) | (((o | 0) == 0) & ((f[c >> 2] | 0) >>> 0 > 0)))) {
                f[h >> 2] = f[(n + 4) >> 2]
                f[g >> 2] = f[h >> 2]
                ye(n, g, i, (i + 1) | 0) | 0
            }
            n = f[j >> 2] | 0
            c = f[(n + 80) >> 2] | 0
            if (c >>> 0 < 256) {
                if (!l) {
                    f[a >> 2] = 0
                    f[(a + 4) >> 2] = 0
                    f[(a + 8) >> 2] = 0
                    f[(a + 12) >> 2] = 0
                    u = e
                    return
                }
                o = (i + 1) | 0
                q = (i + 1) | 0
                p = (i + 1) | 0
                r = 0
                s = n
                while (1) {
                    t = f[(s + 96) >> 2] | 0
                    v = f[m >> 2] | 0
                    b[i >> 0] = f[(t + ((r * 12) | 0)) >> 2]
                    w = (v + 16) | 0
                    x = f[w >> 2] | 0
                    y = f[(w + 4) >> 2] | 0
                    if (((y | 0) > 0) | (((y | 0) == 0) & (x >>> 0 > 0))) {
                        z = x
                        A = v
                        B = y
                    } else {
                        f[h >> 2] = f[(v + 4) >> 2]
                        f[g >> 2] = f[h >> 2]
                        ye(v, g, i, p) | 0
                        v = f[m >> 2] | 0
                        y = (v + 16) | 0
                        z = f[y >> 2] | 0
                        A = v
                        B = f[(y + 4) >> 2] | 0
                    }
                    b[i >> 0] = f[(t + ((r * 12) | 0) + 4) >> 2]
                    if (((B | 0) > 0) | (((B | 0) == 0) & (z >>> 0 > 0))) {
                        C = B
                        D = z
                        E = A
                    } else {
                        f[h >> 2] = f[(A + 4) >> 2]
                        f[g >> 2] = f[h >> 2]
                        ye(A, g, i, q) | 0
                        y = f[m >> 2] | 0
                        v = (y + 16) | 0
                        C = f[(v + 4) >> 2] | 0
                        D = f[v >> 2] | 0
                        E = y
                    }
                    b[i >> 0] = f[(t + ((r * 12) | 0) + 8) >> 2]
                    if (!(((C | 0) > 0) | (((C | 0) == 0) & (D >>> 0 > 0)))) {
                        f[h >> 2] = f[(E + 4) >> 2]
                        f[g >> 2] = f[h >> 2]
                        ye(E, g, i, o) | 0
                    }
                    t = (r + 1) | 0
                    if (t >>> 0 >= k >>> 0) break
                    r = t
                    s = f[j >> 2] | 0
                }
                f[a >> 2] = 0
                f[(a + 4) >> 2] = 0
                f[(a + 8) >> 2] = 0
                f[(a + 12) >> 2] = 0
                u = e
                return
            }
            if (c >>> 0 < 65536) {
                if (!l) {
                    f[a >> 2] = 0
                    f[(a + 4) >> 2] = 0
                    f[(a + 8) >> 2] = 0
                    f[(a + 12) >> 2] = 0
                    u = e
                    return
                }
                s = (i + 2) | 0
                r = (i + 2) | 0
                o = (i + 2) | 0
                E = 0
                D = n
                while (1) {
                    C = f[(D + 96) >> 2] | 0
                    q = f[m >> 2] | 0
                    d[i >> 1] = f[(C + ((E * 12) | 0)) >> 2]
                    A = (q + 16) | 0
                    z = f[A >> 2] | 0
                    B = f[(A + 4) >> 2] | 0
                    if (((B | 0) > 0) | (((B | 0) == 0) & (z >>> 0 > 0))) {
                        F = B
                        G = z
                        H = q
                    } else {
                        f[h >> 2] = f[(q + 4) >> 2]
                        f[g >> 2] = f[h >> 2]
                        ye(q, g, i, o) | 0
                        q = f[m >> 2] | 0
                        z = (q + 16) | 0
                        F = f[(z + 4) >> 2] | 0
                        G = f[z >> 2] | 0
                        H = q
                    }
                    d[i >> 1] = f[(C + ((E * 12) | 0) + 4) >> 2]
                    if (((F | 0) > 0) | (((F | 0) == 0) & (G >>> 0 > 0))) {
                        I = F
                        J = G
                        K = H
                    } else {
                        f[h >> 2] = f[(H + 4) >> 2]
                        f[g >> 2] = f[h >> 2]
                        ye(H, g, i, r) | 0
                        q = f[m >> 2] | 0
                        z = (q + 16) | 0
                        I = f[(z + 4) >> 2] | 0
                        J = f[z >> 2] | 0
                        K = q
                    }
                    d[i >> 1] = f[(C + ((E * 12) | 0) + 8) >> 2]
                    if (!(((I | 0) > 0) | (((I | 0) == 0) & (J >>> 0 > 0)))) {
                        f[h >> 2] = f[(K + 4) >> 2]
                        f[g >> 2] = f[h >> 2]
                        ye(K, g, i, s) | 0
                    }
                    C = (E + 1) | 0
                    if (C >>> 0 >= k >>> 0) break
                    E = C
                    D = f[j >> 2] | 0
                }
                f[a >> 2] = 0
                f[(a + 4) >> 2] = 0
                f[(a + 8) >> 2] = 0
                f[(a + 12) >> 2] = 0
                u = e
                return
            }
            D = (l | 0) != 0
            if (c >>> 0 < 2097152) {
                if (D) {
                    L = 0
                    M = n
                } else {
                    f[a >> 2] = 0
                    f[(a + 4) >> 2] = 0
                    f[(a + 8) >> 2] = 0
                    f[(a + 12) >> 2] = 0
                    u = e
                    return
                }
                while (1) {
                    c = f[(M + 96) >> 2] | 0
                    Nh(f[(c + ((L * 12) | 0)) >> 2] | 0, f[m >> 2] | 0) | 0
                    Nh(f[(c + ((L * 12) | 0) + 4) >> 2] | 0, f[m >> 2] | 0) | 0
                    Nh(f[(c + ((L * 12) | 0) + 8) >> 2] | 0, f[m >> 2] | 0) | 0
                    c = (L + 1) | 0
                    if (c >>> 0 >= k >>> 0) break
                    L = c
                    M = f[j >> 2] | 0
                }
                f[a >> 2] = 0
                f[(a + 4) >> 2] = 0
                f[(a + 8) >> 2] = 0
                f[(a + 12) >> 2] = 0
                u = e
                return
            }
            if (!D) {
                f[a >> 2] = 0
                f[(a + 4) >> 2] = 0
                f[(a + 8) >> 2] = 0
                f[(a + 12) >> 2] = 0
                u = e
                return
            }
            D = 0
            M = n
            while (1) {
                n = ((f[(M + 96) >> 2] | 0) + ((D * 12) | 0)) | 0
                L = f[m >> 2] | 0
                c = (L + 16) | 0
                l = f[(c + 4) >> 2] | 0
                if (!(((l | 0) > 0) | (((l | 0) == 0) & ((f[c >> 2] | 0) >>> 0 > 0)))) {
                    f[h >> 2] = f[(L + 4) >> 2]
                    f[g >> 2] = f[h >> 2]
                    ye(L, g, n, (n + 12) | 0) | 0
                }
                n = (D + 1) | 0
                if (n >>> 0 >= k >>> 0) break
                D = n
                M = f[j >> 2] | 0
            }
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            f[(a + 12) >> 2] = 0
            u = e
            return
        }
        function tc(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0
            e = u
            u = (u + 32) | 0
            g = (e + 16) | 0
            h = (e + 12) | 0
            i = (e + 8) | 0
            j = (e + 4) | 0
            k = e
            switch (f[(c + 28) >> 2] | 0) {
                case 9: {
                    l = f[d >> 2] | 0
                    switch (b[(c + 24) >> 0] | 0) {
                        case 1: {
                            f[h >> 2] = l
                            f[g >> 2] = f[h >> 2]
                            m = ec(a, c, g) | 0
                            break
                        }
                        case 2: {
                            f[i >> 2] = l
                            f[g >> 2] = f[i >> 2]
                            m = Xb(a, c, g) | 0
                            break
                        }
                        case 3: {
                            f[j >> 2] = l
                            f[g >> 2] = f[j >> 2]
                            m = rc(a, c, g) | 0
                            break
                        }
                        case 4: {
                            f[k >> 2] = l
                            f[g >> 2] = f[k >> 2]
                            m = jc(a, c, g) | 0
                            break
                        }
                        default:
                            m = 0
                    }
                    n = m
                    break
                }
                case 1: {
                    m = f[d >> 2] | 0
                    switch (b[(c + 24) >> 0] | 0) {
                        case 1: {
                            f[h >> 2] = m
                            f[g >> 2] = f[h >> 2]
                            o = dc(a, c, g) | 0
                            break
                        }
                        case 2: {
                            f[i >> 2] = m
                            f[g >> 2] = f[i >> 2]
                            o = Yb(a, c, g) | 0
                            break
                        }
                        case 3: {
                            f[j >> 2] = m
                            f[g >> 2] = f[j >> 2]
                            o = pc(a, c, g) | 0
                            break
                        }
                        case 4: {
                            f[k >> 2] = m
                            f[g >> 2] = f[k >> 2]
                            o = ic(a, c, g) | 0
                            break
                        }
                        default:
                            o = 0
                    }
                    n = o
                    break
                }
                case 11:
                case 2: {
                    o = f[d >> 2] | 0
                    switch (b[(c + 24) >> 0] | 0) {
                        case 1: {
                            f[h >> 2] = o
                            f[g >> 2] = f[h >> 2]
                            p = dc(a, c, g) | 0
                            break
                        }
                        case 2: {
                            f[i >> 2] = o
                            f[g >> 2] = f[i >> 2]
                            p = Yb(a, c, g) | 0
                            break
                        }
                        case 3: {
                            f[j >> 2] = o
                            f[g >> 2] = f[j >> 2]
                            p = pc(a, c, g) | 0
                            break
                        }
                        case 4: {
                            f[k >> 2] = o
                            f[g >> 2] = f[k >> 2]
                            p = ic(a, c, g) | 0
                            break
                        }
                        default:
                            p = 0
                    }
                    n = p
                    break
                }
                case 4: {
                    p = f[d >> 2] | 0
                    switch (b[(c + 24) >> 0] | 0) {
                        case 1: {
                            f[h >> 2] = p
                            f[g >> 2] = f[h >> 2]
                            q = bc(a, c, g) | 0
                            break
                        }
                        case 2: {
                            f[i >> 2] = p
                            f[g >> 2] = f[i >> 2]
                            q = Vb(a, c, g) | 0
                            break
                        }
                        case 3: {
                            f[j >> 2] = p
                            f[g >> 2] = f[j >> 2]
                            q = kc(a, c, g) | 0
                            break
                        }
                        case 4: {
                            f[k >> 2] = p
                            f[g >> 2] = f[k >> 2]
                            q = gc(a, c, g) | 0
                            break
                        }
                        default:
                            q = 0
                    }
                    n = q
                    break
                }
                case 3: {
                    q = f[d >> 2] | 0
                    switch (b[(c + 24) >> 0] | 0) {
                        case 1: {
                            f[h >> 2] = q
                            f[g >> 2] = f[h >> 2]
                            r = bc(a, c, g) | 0
                            break
                        }
                        case 2: {
                            f[i >> 2] = q
                            f[g >> 2] = f[i >> 2]
                            r = Vb(a, c, g) | 0
                            break
                        }
                        case 3: {
                            f[j >> 2] = q
                            f[g >> 2] = f[j >> 2]
                            r = kc(a, c, g) | 0
                            break
                        }
                        case 4: {
                            f[k >> 2] = q
                            f[g >> 2] = f[k >> 2]
                            r = gc(a, c, g) | 0
                            break
                        }
                        default:
                            r = 0
                    }
                    n = r
                    break
                }
                case 6: {
                    r = f[d >> 2] | 0
                    switch (b[(c + 24) >> 0] | 0) {
                        case 1: {
                            f[h >> 2] = r
                            f[g >> 2] = f[h >> 2]
                            s = ec(a, c, g) | 0
                            break
                        }
                        case 2: {
                            f[i >> 2] = r
                            f[g >> 2] = f[i >> 2]
                            s = Xb(a, c, g) | 0
                            break
                        }
                        case 3: {
                            f[j >> 2] = r
                            f[g >> 2] = f[j >> 2]
                            s = rc(a, c, g) | 0
                            break
                        }
                        case 4: {
                            f[k >> 2] = r
                            f[g >> 2] = f[k >> 2]
                            s = jc(a, c, g) | 0
                            break
                        }
                        default:
                            s = 0
                    }
                    n = s
                    break
                }
                case 5: {
                    s = f[d >> 2] | 0
                    switch (b[(c + 24) >> 0] | 0) {
                        case 1: {
                            f[h >> 2] = s
                            f[g >> 2] = f[h >> 2]
                            t = ec(a, c, g) | 0
                            break
                        }
                        case 2: {
                            f[i >> 2] = s
                            f[g >> 2] = f[i >> 2]
                            t = Xb(a, c, g) | 0
                            break
                        }
                        case 3: {
                            f[j >> 2] = s
                            f[g >> 2] = f[j >> 2]
                            t = rc(a, c, g) | 0
                            break
                        }
                        case 4: {
                            f[k >> 2] = s
                            f[g >> 2] = f[k >> 2]
                            t = jc(a, c, g) | 0
                            break
                        }
                        default:
                            t = 0
                    }
                    n = t
                    break
                }
                default: {
                    v = -1
                    u = e
                    return v | 0
                }
            }
            v = (n | 0) == 0 ? -1 : n
            u = e
            return v | 0
        }
        function uc(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 0,
                D = 0,
                E = 0
            e = u
            u = (u + 32) | 0
            g = (e + 16) | 0
            h = (e + 12) | 0
            i = (e + 29) | 0
            j = e
            k = (e + 28) | 0
            if (!(f[((f[(a + 8) >> 2] | 0) + 80) >> 2] | 0)) {
                l = 1
                u = e
                return l | 0
            }
            b[i >> 0] = -2
            m = (a + 36) | 0
            n = f[m >> 2] | 0
            if (n)
                if (Ra[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a, n) | 0) {
                    n = f[m >> 2] | 0
                    o = (Qa[f[((f[n >> 2] | 0) + 8) >> 2] & 127](n) | 0) & 255
                    b[i >> 0] = o
                    p = 5
                } else q = 0
            else p = 5
            if ((p | 0) == 5) {
                o = (d + 16) | 0
                n = o
                r = f[(n + 4) >> 2] | 0
                if (!(((r | 0) > 0) | (((r | 0) == 0) & ((f[n >> 2] | 0) >>> 0 > 0)))) {
                    f[h >> 2] = f[(d + 4) >> 2]
                    f[g >> 2] = f[h >> 2]
                    ye(d, g, i, (i + 1) | 0) | 0
                }
                i = f[m >> 2] | 0
                if (
                    i | 0
                        ? ((n = (Qa[f[((f[i >> 2] | 0) + 36) >> 2] & 127](i) | 0) & 255),
                          (b[j >> 0] = n),
                          (n = o),
                          (i = f[(n + 4) >> 2] | 0),
                          !(((i | 0) > 0) | (((i | 0) == 0) & ((f[n >> 2] | 0) >>> 0 > 0))))
                        : 0
                ) {
                    f[h >> 2] = f[(d + 4) >> 2]
                    f[g >> 2] = f[h >> 2]
                    ye(d, g, j, (j + 1) | 0) | 0
                }
                n = f[(a + 32) >> 2] | 0
                i = b[(n + 24) >> 0] | 0
                r = X(f[(n + 80) >> 2] | 0, i) | 0
                s = ((f[f[n >> 2] >> 2] | 0) + (f[(n + 48) >> 2] | 0)) | 0
                f[j >> 2] = 0
                n = (j + 4) | 0
                f[n >> 2] = 0
                f[(j + 8) >> 2] = 0
                t = (r | 0) == 0
                do
                    if (!t)
                        if (r >>> 0 > 1073741823) mq(j)
                        else {
                            v = r << 2
                            w = dn(v) | 0
                            f[j >> 2] = w
                            x = (w + (r << 2)) | 0
                            f[(j + 8) >> 2] = x
                            hj(w | 0, 0, v | 0) | 0
                            f[n >> 2] = x
                            y = w
                            break
                        }
                    else y = 0
                while (0)
                w = f[m >> 2] | 0
                do
                    if (w) {
                        Ta[f[((f[w >> 2] | 0) + 44) >> 2] & 31](w, s, y, r, i, f[c >> 2] | 0) | 0
                        x = f[m >> 2] | 0
                        if (!x) {
                            z = s
                            A = f[j >> 2] | 0
                            p = 20
                            break
                        }
                        if (!(Qa[f[((f[x >> 2] | 0) + 32) >> 2] & 127](x) | 0)) {
                            x = f[j >> 2] | 0
                            z = f[m >> 2] | 0 ? x : s
                            A = x
                            p = 20
                        }
                    } else {
                        z = s
                        A = y
                        p = 20
                    }
                while (0)
                if ((p | 0) == 20) km(z, r, A)
                A = (a + 4) | 0
                a = f[A >> 2] | 0
                do
                    if (a) {
                        z = f[(a + 48) >> 2] | 0
                        f[g >> 2] = 0
                        f[(g + 4) >> 2] = 0
                        f[(g + 8) >> 2] = 0
                        y = dn(48) | 0
                        f[g >> 2] = y
                        f[(g + 8) >> 2] = -2147483600
                        f[(g + 4) >> 2] = 34
                        s = y
                        w = 9835
                        x = (s + 34) | 0
                        do {
                            b[s >> 0] = b[w >> 0] | 0
                            s = (s + 1) | 0
                            w = (w + 1) | 0
                        } while ((s | 0) < (x | 0))
                        b[(y + 34) >> 0] = 0
                        w = Oj(z, g, 1) | 0
                        if ((b[(g + 11) >> 0] | 0) < 0) br(f[g >> 2] | 0)
                        if (!w) {
                            if (!t) {
                                w = f[j >> 2] | 0
                                s = 0
                                x = 0
                                do {
                                    x = f[(w + (s << 2)) >> 2] | x
                                    s = (s + 1) | 0
                                } while ((s | 0) != (r | 0))
                                if (x) B = ((((_(x | 0) | 0) >>> 3) ^ 3) + 1) | 0
                                else B = 1
                            } else B = 1
                            b[k >> 0] = 0
                            s = o
                            w = f[s >> 2] | 0
                            z = f[(s + 4) >> 2] | 0
                            if (((z | 0) > 0) | (((z | 0) == 0) & (w >>> 0 > 0))) {
                                C = z
                                D = w
                            } else {
                                f[h >> 2] = f[(d + 4) >> 2]
                                f[g >> 2] = f[h >> 2]
                                ye(d, g, k, (k + 1) | 0) | 0
                                w = o
                                C = f[(w + 4) >> 2] | 0
                                D = f[w >> 2] | 0
                            }
                            b[k >> 0] = B
                            if (!(((C | 0) > 0) | (((C | 0) == 0) & (D >>> 0 > 0)))) {
                                f[h >> 2] = f[(d + 4) >> 2]
                                f[g >> 2] = f[h >> 2]
                                ye(d, g, k, (k + 1) | 0) | 0
                            }
                            if ((B | 0) == (Ll(5) | 0)) {
                                w = f[j >> 2] | 0
                                z = o
                                s = f[(z + 4) >> 2] | 0
                                if (!(((s | 0) > 0) | (((s | 0) == 0) & ((f[z >> 2] | 0) >>> 0 > 0)))) {
                                    f[h >> 2] = f[(d + 4) >> 2]
                                    f[g >> 2] = f[h >> 2]
                                    ye(d, g, w, (w + (r << 2)) | 0) | 0
                                }
                                p = 48
                                break
                            }
                            if (t) p = 48
                            else {
                                w = (d + 4) | 0
                                z = 0
                                do {
                                    s = ((f[j >> 2] | 0) + (z << 2)) | 0
                                    y = o
                                    v = f[(y + 4) >> 2] | 0
                                    if (!(((v | 0) > 0) | (((v | 0) == 0) & ((f[y >> 2] | 0) >>> 0 > 0)))) {
                                        f[h >> 2] = f[w >> 2]
                                        f[g >> 2] = f[h >> 2]
                                        ye(d, g, s, (s + B) | 0) | 0
                                    }
                                    z = (z + 1) | 0
                                } while (z >>> 0 < r >>> 0)
                                p = 48
                            }
                        } else p = 27
                    } else p = 27
                while (0)
                if ((p | 0) == 27) {
                    b[k >> 0] = 1
                    r = o
                    o = f[(r + 4) >> 2] | 0
                    if (!(((o | 0) > 0) | (((o | 0) == 0) & ((f[r >> 2] | 0) >>> 0 > 0)))) {
                        f[h >> 2] = f[(d + 4) >> 2]
                        f[g >> 2] = f[h >> 2]
                        ye(d, g, k, (k + 1) | 0) | 0
                    }
                    wp(g)
                    k = f[A >> 2] | 0
                    if (k | 0) Pj(g, (10 - (Yh(f[(k + 48) >> 2] | 0) | 0)) | 0) | 0
                    k = Dc(f[j >> 2] | 0, X(((f[(c + 4) >> 2] | 0) - (f[c >> 2] | 0)) >> 2, i) | 0, i, g, d) | 0
                    sj(g, f[(g + 4) >> 2] | 0)
                    if (k) p = 48
                    else E = 0
                }
                if ((p | 0) == 48) {
                    p = f[m >> 2] | 0
                    if (!p) E = 1
                    else {
                        Ra[f[((f[p >> 2] | 0) + 40) >> 2] & 127](p, d) | 0
                        E = 1
                    }
                }
                d = f[j >> 2] | 0
                if (d | 0) {
                    j = f[n >> 2] | 0
                    if ((j | 0) != (d | 0)) f[n >> 2] = j + (~(((j + -4 - d) | 0) >>> 2) << 2)
                    br(d)
                }
                q = E
            }
            l = q
            u = e
            return l | 0
        }
        function vc(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 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,
                v = 0,
                w = 0,
                x = 0,
                y = 0,
                z = 0,
                A = 0,
                B = 0,
                C = 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,
                U = 0,
                V = 0,
                W = 0,
                X = 0
            b = u
            u = (u + 48) | 0
            c = (b + 24) | 0
            d = (b + 12) | 0
            e = b
            g = (a + 32) | 0
            h = (a + 8) | 0
            i = (a + 12) | 0
            j = f[i >> 2] | 0
            k = f[h >> 2] | 0
            l = (j - k) >> 2
            m = (a + 36) | 0
            n = f[m >> 2] | 0
            o = f[g >> 2] | 0
            p = (n - o) >> 2
            q = o
            o = n
            n = k
            if (l >>> 0 <= p >>> 0)
                if (l >>> 0 < p >>> 0 ? ((r = (q + (l << 2)) | 0), (r | 0) != (o | 0)) : 0) {
                    f[m >> 2] = o + (~(((o + -4 - r) | 0) >>> 2) << 2)
                    s = n
                    t = k
                    v = j
                } else {
                    s = n
                    t = k
                    v = j
                }
            else {
                oi(g, (l - p) | 0)
                p = f[h >> 2] | 0
                s = p
                t = p
                v = f[i >> 2] | 0
            }
            p = (v - t) | 0
            l = p >> 2
            f[c >> 2] = 0
            j = (c + 4) | 0
            f[j >> 2] = 0
            k = (c + 8) | 0
            f[k >> 2] = 0
            if (l | 0) {
                if ((p | 0) < 0) mq(c)
                p = ((((l + -1) | 0) >>> 5) + 1) | 0
                n = dn(p << 2) | 0
                f[c >> 2] = n
                f[k >> 2] = p
                f[j >> 2] = l
                j = l >>> 5
                hj(n | 0, 0, (j << 2) | 0) | 0
                p = l & 31
                l = (n + (j << 2)) | 0
                if (p | 0) f[l >> 2] = f[l >> 2] & ~(-1 >>> ((32 - p) | 0))
            }
            p = (a + 20) | 0
            l = 0
            j = s
            s = t
            t = v
            while (1) {
                if (l >>> 0 < ((t - s) >> 2) >>> 0) {
                    w = 0
                    x = 0
                    y = l
                    z = s
                    A = j
                } else {
                    B = 25
                    break
                }
                while (1) {
                    v = x >>> 5
                    n = 1 << (x & 31)
                    do
                        if (!(f[((f[c >> 2] | 0) + (v << 2)) >> 2] & n)) {
                            k = f[(A + (x << 2)) >> 2] | 0
                            if ((f[(k + 8) >> 2] | 0) != (f[(k + 4) >> 2] | 0)) {
                                r = 0
                                o = 1
                                m = A
                                q = k
                                while (1) {
                                    k = f[((f[(q + 4) >> 2] | 0) + (r << 2)) >> 2] | 0
                                    C = 0
                                    D = m
                                    while (1) {
                                        E = f[(D + (x << 2)) >> 2] | 0
                                        if ((C | 0) >= (Ra[f[((f[E >> 2] | 0) + 24) >> 2] & 127](E, k) | 0)) {
                                            F = o
                                            break
                                        }
                                        E = f[((f[h >> 2] | 0) + (x << 2)) >> 2] | 0
                                        G = Sa[f[((f[E >> 2] | 0) + 28) >> 2] & 31](E, k, C) | 0
                                        if ((G | 0) != (x | 0) ? ((E = f[((f[p >> 2] | 0) + (G << 2)) >> 2] | 0), (((1 << (E & 31)) & f[((f[c >> 2] | 0) + ((E >>> 5) << 2)) >> 2]) | 0) == 0) : 0) {
                                            F = 0
                                            break
                                        }
                                        C = (C + 1) | 0
                                        D = f[h >> 2] | 0
                                    }
                                    r = (r + 1) | 0
                                    m = f[h >> 2] | 0
                                    q = f[(m + (x << 2)) >> 2] | 0
                                    if (r >>> 0 >= (((f[(q + 8) >> 2] | 0) - (f[(q + 4) >> 2] | 0)) >> 2) >>> 0) break
                                    else o = F
                                }
                                o = m
                                if (F) H = o
                                else {
                                    I = w
                                    J = y
                                    K = o
                                    break
                                }
                            } else H = z
                            f[((f[g >> 2] | 0) + (y << 2)) >> 2] = x
                            o = ((f[c >> 2] | 0) + (v << 2)) | 0
                            f[o >> 2] = f[o >> 2] | n
                            I = 1
                            J = (y + 1) | 0
                            K = H
                        } else {
                            I = w
                            J = y
                            K = z
                        }
                    while (0)
                    x = (x + 1) | 0
                    L = f[i >> 2] | 0
                    M = (L - K) >> 2
                    A = K
                    if (x >>> 0 >= M >>> 0) break
                    else {
                        w = I
                        y = J
                        z = K
                    }
                }
                if ((J >>> 0 < M >>> 0) & (I ^ 1)) {
                    N = 0
                    break
                } else {
                    l = J
                    j = A
                    s = K
                    t = L
                }
            }
            if ((B | 0) == 25) {
                f[d >> 2] = 0
                B = (d + 4) | 0
                f[B >> 2] = 0
                f[(d + 8) >> 2] = 0
                L = f[(a + 4) >> 2] | 0
                a = ((f[(L + 12) >> 2] | 0) - (f[(L + 8) >> 2] | 0)) | 0
                L = a >> 2
                f[e >> 2] = 0
                K = (e + 4) | 0
                f[K >> 2] = 0
                A = (e + 8) | 0
                f[A >> 2] = 0
                if (L | 0) {
                    if ((a | 0) < 0) mq(e)
                    a = ((((L + -1) | 0) >>> 5) + 1) | 0
                    J = dn(a << 2) | 0
                    f[e >> 2] = J
                    f[A >> 2] = a
                    f[K >> 2] = L
                    K = L >>> 5
                    hj(J | 0, 0, (K << 2) | 0) | 0
                    a = L & 31
                    L = (J + (K << 2)) | 0
                    if (a | 0) f[L >> 2] = f[L >> 2] & ~(-1 >>> ((32 - a) | 0))
                }
                a: do
                    if ((t | 0) == (s | 0)) O = 1
                    else {
                        a = 0
                        L = j
                        K = s
                        J = t
                        while (1) {
                            A = f[((f[g >> 2] | 0) + (a << 2)) >> 2] | 0
                            l = f[(L + (A << 2)) >> 2] | 0
                            I = ((f[(l + 8) >> 2] | 0) - (f[(l + 4) >> 2] | 0)) | 0
                            l = I >> 2
                            if ((I | 0) < 8) {
                                P = K
                                Q = J
                            } else {
                                I = f[B >> 2] | 0
                                M = f[d >> 2] | 0
                                z = (I - M) >> 2
                                y = M
                                M = I
                                if (l >>> 0 <= z >>> 0)
                                    if (l >>> 0 < z >>> 0 ? ((I = (y + (l << 2)) | 0), (I | 0) != (M | 0)) : 0) {
                                        f[B >> 2] = M + (~(((M + -4 - I) | 0) >>> 2) << 2)
                                        R = 0
                                    } else R = 0
                                else {
                                    oi(d, (l - z) | 0)
                                    R = 0
                                }
                                while (1) {
                                    if ((R | 0) < (l | 0)) {
                                        S = 0
                                        T = 0
                                        U = R
                                    } else break
                                    while (1) {
                                        z = f[((f[h >> 2] | 0) + (A << 2)) >> 2] | 0
                                        I = f[((f[(z + 4) >> 2] | 0) + (S << 2)) >> 2] | 0
                                        M = S >>> 5
                                        y = 1 << (S & 31)
                                        if (!(f[((f[e >> 2] | 0) + (M << 2)) >> 2] & y)) {
                                            w = 0
                                            x = 1
                                            H = z
                                            while (1) {
                                                if ((w | 0) >= (Ra[f[((f[H >> 2] | 0) + 24) >> 2] & 127](H, I) | 0)) {
                                                    V = x
                                                    break
                                                }
                                                z = f[((f[h >> 2] | 0) + (A << 2)) >> 2] | 0
                                                F = Sa[f[((f[z >> 2] | 0) + 28) >> 2] & 31](z, I, w) | 0
                                                z = ((f[((f[e >> 2] | 0) + ((F >>> 5) << 2)) >> 2] & (1 << (F & 31))) | 0) != 0
                                                F = x & z
                                                if (!z) {
                                                    V = F
                                                    break
                                                }
                                                w = (w + 1) | 0
                                                x = F
                                                H = f[((f[h >> 2] | 0) + (A << 2)) >> 2] | 0
                                            }
                                            if (V) {
                                                f[((f[d >> 2] | 0) + (U << 2)) >> 2] = S
                                                H = ((f[e >> 2] | 0) + (M << 2)) | 0
                                                f[H >> 2] = f[H >> 2] | y
                                                W = 1
                                                X = (U + 1) | 0
                                            } else {
                                                W = T
                                                X = U
                                            }
                                        } else {
                                            W = T
                                            X = U
                                        }
                                        S = (S + 1) | 0
                                        if ((S | 0) >= (l | 0)) break
                                        else {
                                            T = W
                                            U = X
                                        }
                                    }
                                    if (W | ((X | 0) >= (l | 0))) R = X
                                    else {
                                        O = 0
                                        break a
                                    }
                                }
                                Of(f[((f[h >> 2] | 0) + (A << 2)) >> 2] | 0, d)
                                P = f[h >> 2] | 0
                                Q = f[i >> 2] | 0
                            }
                            a = (a + 1) | 0
                            if (a >>> 0 >= ((Q - P) >> 2) >>> 0) {
                                O = 1
                                break
                            } else {
                                L = P
                                K = P
                                J = Q
                            }
                        }
                    }
                while (0)
                Q = f[e >> 2] | 0
                if (Q | 0) br(Q)
                Q = f[d >> 2] | 0
                if (Q | 0) {
                    d = f[B >> 2] | 0
                    if ((d | 0) != (Q | 0)) f[B >> 2] = d + (~(((d + -4 - Q) | 0) >>> 2) << 2)
                    br(Q)
                }
                N = O
            }
            O = f[c >> 2] | 0
            if (!O) {
                u = b
                return N | 0
            }
            br(O)
            u = b
            return N | 0
        }
        function uj(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0
            e = u
            u = (u + 16) | 0
            g = e
            h = (a + 4) | 0
            f[h >> 2] = c
            i = f[(c + 64) >> 2] | 0
            c = (((((f[(i + 4) >> 2] | 0) - (f[i >> 2] | 0)) >> 2) >>> 0) / 3) | 0
            b[g >> 0] = 0
            Xg((a + 24) | 0, c, g)
            c = f[h >> 2] | 0
            h = ((f[(c + 56) >> 2] | 0) - (f[(c + 52) >> 2] | 0)) >> 2
            b[g >> 0] = 0
            Xg((a + 36) | 0, h, g)
            g = (a + 8) | 0
            f[g >> 2] = f[d >> 2]
            f[(g + 4) >> 2] = f[(d + 4) >> 2]
            f[(g + 8) >> 2] = f[(d + 8) >> 2]
            f[(g + 12) >> 2] = f[(d + 12) >> 2]
            u = e
            return
        }
        function vj(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0
            c = a
            a: do
                if (!(c & 3)) {
                    d = a
                    e = 4
                } else {
                    g = a
                    h = c
                    while (1) {
                        if (!(b[g >> 0] | 0)) {
                            i = h
                            break a
                        }
                        j = (g + 1) | 0
                        h = j
                        if (!(h & 3)) {
                            d = j
                            e = 4
                            break
                        } else g = j
                    }
                }
            while (0)
            if ((e | 0) == 4) {
                e = d
                while (1) {
                    k = f[e >> 2] | 0
                    if (!(((k & -2139062144) ^ -2139062144) & (k + -16843009))) e = (e + 4) | 0
                    else break
                }
                if (!(((k & 255) << 24) >> 24)) l = e
                else {
                    k = e
                    while (1) {
                        e = (k + 1) | 0
                        if (!(b[e >> 0] | 0)) {
                            l = e
                            break
                        } else k = e
                    }
                }
                i = l
            }
            return (i - c) | 0
        }
        function wj(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            e = u
            u = (u + 16) | 0
            g = e
            h = (a + 11) | 0
            i = b[h >> 0] | 0
            j = (i << 24) >> 24 < 0
            if (j) k = f[(a + 4) >> 2] | 0
            else k = i & 255
            do
                if (k >>> 0 >= c >>> 0)
                    if (j) {
                        i = ((f[a >> 2] | 0) + c) | 0
                        b[g >> 0] = 0
                        Hp(i, g)
                        f[(a + 4) >> 2] = c
                        break
                    } else {
                        b[g >> 0] = 0
                        Hp((a + c) | 0, g)
                        b[h >> 0] = c
                        break
                    }
                else Xi(a, (c - k) | 0, d) | 0
            while (0)
            u = e
            return
        }
        function xj(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            if (!a) return
            b = (a + 88) | 0
            c = f[b >> 2] | 0
            f[b >> 2] = 0
            if (c | 0) {
                b = f[(c + 8) >> 2] | 0
                if (b | 0) {
                    d = (c + 12) | 0
                    if ((f[d >> 2] | 0) != (b | 0)) f[d >> 2] = b
                    br(b)
                }
                br(c)
            }
            c = f[(a + 68) >> 2] | 0
            if (c | 0) {
                b = (a + 72) | 0
                d = f[b >> 2] | 0
                if ((d | 0) != (c | 0)) f[b >> 2] = d + (~(((d + -4 - c) | 0) >>> 2) << 2)
                br(c)
            }
            c = (a + 64) | 0
            d = f[c >> 2] | 0
            f[c >> 2] = 0
            if (d | 0) {
                c = f[d >> 2] | 0
                if (c | 0) {
                    b = (d + 4) | 0
                    if ((f[b >> 2] | 0) != (c | 0)) f[b >> 2] = c
                    br(c)
                }
                br(d)
            }
            br(a)
            return
        }
        function yj(a, c, d, e, g, h, i, j, k, l) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            h = h | 0
            i = i | 0
            j = j | 0
            k = k | 0
            l = l | 0
            var m = 0,
                n = 0,
                o = 0
            f[a >> 2] = d
            if (d | 0) {
                m = (d + 16) | 0
                n = f[(m + 4) >> 2] | 0
                o = (a + 8) | 0
                f[o >> 2] = f[m >> 2]
                f[(o + 4) >> 2] = n
                n = (d + 24) | 0
                d = f[(n + 4) >> 2] | 0
                o = (a + 16) | 0
                f[o >> 2] = f[n >> 2]
                f[(o + 4) >> 2] = d
            }
            b[(a + 24) >> 0] = e
            f[(a + 28) >> 2] = g
            b[(a + 32) >> 0] = h & 1
            h = (a + 40) | 0
            f[h >> 2] = i
            f[(h + 4) >> 2] = j
            j = (a + 48) | 0
            f[j >> 2] = k
            f[(j + 4) >> 2] = l
            f[(a + 56) >> 2] = c
            return
        }
        function zj(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            if ((f[(c + 76) >> 2] | 0) >= 0 ? (gr(c) | 0) != 0 : 0) {
                d = a & 255
                e = a & 255
                if ((e | 0) != (b[(c + 75) >> 0] | 0) ? ((g = (c + 20) | 0), (h = f[g >> 2] | 0), h >>> 0 < (f[(c + 16) >> 2] | 0) >>> 0) : 0) {
                    f[g >> 2] = h + 1
                    b[h >> 0] = d
                    i = e
                } else i = Bj(c, a) | 0
                fr(c)
                j = i
            } else k = 3
            do
                if ((k | 0) == 3) {
                    i = a & 255
                    e = a & 255
                    if ((e | 0) != (b[(c + 75) >> 0] | 0) ? ((d = (c + 20) | 0), (h = f[d >> 2] | 0), h >>> 0 < (f[(c + 16) >> 2] | 0) >>> 0) : 0) {
                        f[d >> 2] = h + 1
                        b[h >> 0] = i
                        j = e
                        break
                    }
                    j = Bj(c, a) | 0
                }
            while (0)
            return j | 0
        }
        function Aj(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            d = u
            u = (u + 16) | 0
            e = (d + 4) | 0
            g = d
            h = (d + 8) | 0
            i = f[(a + 4) >> 2] | 0
            if ((i | 0) == -1) {
                j = 0
                u = d
                return j | 0
            }
            b[h >> 0] = i
            i = (c + 16) | 0
            a = f[(i + 4) >> 2] | 0
            if (!(((a | 0) > 0) | (((a | 0) == 0) & ((f[i >> 2] | 0) >>> 0 > 0)))) {
                f[g >> 2] = f[(c + 4) >> 2]
                f[e >> 2] = f[g >> 2]
                ye(c, e, h, (h + 1) | 0) | 0
            }
            j = 1
            u = d
            return j | 0
        }
        function Bj(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                i = 0,
                j = 0,
                k = 0,
                l = 0,
                m = 0,
                n = 0
            d = u
            u = (u + 16) | 0
            e = d
            g = c & 255
            b[e >> 0] = g
            i = (a + 16) | 0
            j = f[i >> 2] | 0
            if (!j)
                if (!(pl(a) | 0)) {
                    k = f[i >> 2] | 0
                    l = 4
                } else m = -1
            else {
                k = j
                l = 4
            }
            do
                if ((l | 0) == 4) {
                    j = (a + 20) | 0
                    i = f[j >> 2] | 0
                    if (i >>> 0 < k >>> 0 ? ((n = c & 255), (n | 0) != (b[(a + 75) >> 0] | 0)) : 0) {
                        f[j >> 2] = i + 1
                        b[i >> 0] = g
                        m = n
                        break
                    }
                    if ((Sa[f[(a + 36) >> 2] & 31](a, e, 1) | 0) == 1) m = h[e >> 0] | 0
                    else m = -1
                }
            while (0)
            u = d
            return m | 0
        }
        function Cj(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0
            c = dn(88) | 0
            d = (c + 60) | 0
            e = c
            g = (e + 60) | 0
            do {
                f[e >> 2] = 0
                e = (e + 4) | 0
            } while ((e | 0) < (g | 0))
            f[d >> 2] = c
            d = (c + 64) | 0
            f[d >> 2] = 0
            f[(d + 4) >> 2] = 0
            f[(d + 8) >> 2] = 0
            f[(d + 12) >> 2] = 0
            f[(d + 16) >> 2] = 0
            f[(d + 20) >> 2] = 0
            d = Kf(c, b) | 0
            f[a >> 2] = d ? c : 0
            a = d ? 0 : c
            if (d) return
            ui(a)
            br(a)
            return
        }
        function Dj(a, b) {
            a = a | 0
            b = b | 0
            if (!b) return
            else {
                Dj(a, f[b >> 2] | 0)
                Dj(a, f[(b + 4) >> 2] | 0)
                sj((b + 20) | 0, f[(b + 24) >> 2] | 0)
                br(b)
                return
            }
        }
        function Ej(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0
            e = u
            u = (u + 16) | 0
            g = e
            h = (a + 4) | 0
            f[h >> 2] = c
            i = (((((f[(c + 4) >> 2] | 0) - (f[c >> 2] | 0)) >> 2) >>> 0) / 3) | 0
            b[g >> 0] = 0
            Xg((a + 24) | 0, i, g)
            i = f[h >> 2] | 0
            h = ((f[(i + 28) >> 2] | 0) - (f[(i + 24) >> 2] | 0)) >> 2
            b[g >> 0] = 0
            Xg((a + 36) | 0, h, g)
            g = (a + 8) | 0
            f[g >> 2] = f[d >> 2]
            f[(g + 4) >> 2] = f[(d + 4) >> 2]
            f[(g + 8) >> 2] = f[(d + 8) >> 2]
            f[(g + 12) >> 2] = f[(d + 12) >> 2]
            u = e
            return
        }
        function Fj(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            e = u
            u = (u + 16) | 0
            g = e
            h = (e + 4) | 0
            f[g >> 2] = c
            c = (a + 4) | 0
            a = dn(32) | 0
            f[h >> 2] = a
            f[(h + 8) >> 2] = -2147483616
            f[(h + 4) >> 2] = 17
            i = a
            j = 12932
            k = (i + 17) | 0
            do {
                b[i >> 0] = b[j >> 0] | 0
                i = (i + 1) | 0
                j = (j + 1) | 0
            } while ((i | 0) < (k | 0))
            b[(a + 17) >> 0] = 0
            Nj(wd(c, g) | 0, h, d)
            if ((b[(h + 11) >> 0] | 0) >= 0) {
                u = e
                return
            }
            br(f[h >> 2] | 0)
            u = e
            return
        }
        function Gj(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0
            c = f[(a + 16) >> 2] | 0
            if (((((f[(a + 20) >> 2] | 0) - c) >> 2) | 0) <= (b | 0)) {
                d = 0
                return d | 0
            }
            e = f[(c + (b << 2)) >> 2] | 0
            if ((e | 0) < 0) {
                d = 0
                return d | 0
            }
            b = (a + 48) | 0
            if ((f[(a + 52) >> 2] | 0) >>> 0 <= e >>> 0) pe(b, (e + 1) | 0, 0)
            c = ((f[b >> 2] | 0) + ((e >>> 5) << 2)) | 0
            f[c >> 2] = f[c >> 2] | (1 << (e & 31))
            c = f[(a + 36) >> 2] | 0
            if ((((f[(a + 40) >> 2] | 0) - c) >> 2) >>> 0 <= e >>> 0) {
                d = 1
                return d | 0
            }
            Pp(f[(c + (e << 2)) >> 2] | 0)
            d = 1
            return d | 0
        }
        function Hj(a) {
            a = a | 0
            if (!a) return
            f[a >> 2] = 1136
            sj((a + 28) | 0, f[(a + 32) >> 2] | 0)
            nj((a + 16) | 0, f[(a + 20) >> 2] | 0)
            sj((a + 4) | 0, f[(a + 8) >> 2] | 0)
            br(a)
            return
        }
        function Ij(a) {
            a = a | 0
            f[a >> 2] = 1136
            sj((a + 28) | 0, f[(a + 32) >> 2] | 0)
            nj((a + 16) | 0, f[(a + 20) >> 2] | 0)
            sj((a + 4) | 0, f[(a + 8) >> 2] | 0)
            return
        }
        function Jj(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                f = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            if ((c >>> 0 > 0) | (((c | 0) == 0) & (a >>> 0 > 4294967295))) {
                e = d
                f = a
                g = c
                while (1) {
                    c = an(f | 0, g | 0, 10, 0) | 0
                    e = (e + -1) | 0
                    b[e >> 0] = (c & 255) | 48
                    c = f
                    f = up(f | 0, g | 0, 10, 0) | 0
                    if (!((g >>> 0 > 9) | (((g | 0) == 9) & (c >>> 0 > 4294967295)))) break
                    else g = I
                }
                h = f
                i = e
            } else {
                h = a
                i = d
            }
            if (!h) j = i
            else {
                d = h
                h = i
                while (1) {
                    i = (h + -1) | 0
                    b[i >> 0] = (d >>> 0) % 10 | 0 | 48
                    if (d >>> 0 < 10) {
                        j = i
                        break
                    } else {
                        d = ((d >>> 0) / 10) | 0
                        h = i
                    }
                }
            }
            return j | 0
        }
        function Kj(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                f = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            c = a
            while (1) {
                d = (c + 1) | 0
                if (!(tq(b[c >> 0] | 0) | 0)) break
                else c = d
            }
            a = b[c >> 0] | 0
            switch (((a << 24) >> 24) | 0) {
                case 45: {
                    e = 1
                    f = 5
                    break
                }
                case 43: {
                    e = 0
                    f = 5
                    break
                }
                default: {
                    g = 0
                    h = c
                    i = a
                }
            }
            if ((f | 0) == 5) {
                g = e
                h = d
                i = b[d >> 0] | 0
            }
            if (!(Pq((i << 24) >> 24) | 0)) j = 0
            else {
                i = 0
                d = h
                while (1) {
                    h = (((i * 10) | 0) + 48 - (b[d >> 0] | 0)) | 0
                    d = (d + 1) | 0
                    if (!(Pq(b[d >> 0] | 0) | 0)) {
                        j = h
                        break
                    } else i = h
                }
            }
            return (g | 0 ? j : (0 - j) | 0) | 0
        }
        function Lj(a, c, d) {
            a = a | 0
            c = c | 0
            d = $(d)
            var e = 0,
                g = 0,
                h = 0
            e = u
            u = (u + 16) | 0
            g = e
            cl(g, d)
            h = mi(a, c) | 0
            c = (h + 11) | 0
            if ((b[c >> 0] | 0) < 0) {
                b[f[h >> 2] >> 0] = 0
                f[(h + 4) >> 2] = 0
            } else {
                b[h >> 0] = 0
                b[c >> 0] = 0
            }
            Ng(h, 0)
            f[h >> 2] = f[g >> 2]
            f[(h + 4) >> 2] = f[(g + 4) >> 2]
            f[(h + 8) >> 2] = f[(g + 8) >> 2]
            u = e
            return
        }
        function Mj(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0
            e = u
            u = (u + 16) | 0
            g = e
            fl(g, d & 1)
            d = mi(a, c) | 0
            c = (d + 11) | 0
            if ((b[c >> 0] | 0) < 0) {
                b[f[d >> 2] >> 0] = 0
                f[(d + 4) >> 2] = 0
            } else {
                b[d >> 0] = 0
                b[c >> 0] = 0
            }
            Ng(d, 0)
            f[d >> 2] = f[g >> 2]
            f[(d + 4) >> 2] = f[(g + 4) >> 2]
            f[(d + 8) >> 2] = f[(g + 8) >> 2]
            u = e
            return
        }
        function Nj(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0
            e = u
            u = (u + 16) | 0
            g = e
            fl(g, d)
            d = mi(a, c) | 0
            c = (d + 11) | 0
            if ((b[c >> 0] | 0) < 0) {
                b[f[d >> 2] >> 0] = 0
                f[(d + 4) >> 2] = 0
            } else {
                b[d >> 0] = 0
                b[c >> 0] = 0
            }
            Ng(d, 0)
            f[d >> 2] = f[g >> 2]
            f[(d + 4) >> 2] = f[(g + 4) >> 2]
            f[(d + 8) >> 2] = f[(g + 8) >> 2]
            u = e
            return
        }
        function Oj(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            e = zg(a, c) | 0
            if ((e | 0) == ((a + 4) | 0)) {
                g = -1
                h = (g | 0) == -1
                i = (g | 0) != 0
                j = h ? d : i
                return j | 0
            }
            a = (e + 28) | 0
            if ((b[(a + 11) >> 0] | 0) < 0) k = f[a >> 2] | 0
            else k = a
            g = Kj(k) | 0
            h = (g | 0) == -1
            i = (g | 0) != 0
            j = h ? d : i
            return j | 0
        }
        function Pj(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0,
                k = 0
            d = u
            u = (u + 16) | 0
            e = d
            if (c >>> 0 > 10) {
                g = 0
                u = d
                return g | 0
            }
            h = dn(48) | 0
            f[e >> 2] = h
            f[(e + 8) >> 2] = -2147483600
            f[(e + 4) >> 2] = 33
            i = h
            j = 13067
            k = (i + 33) | 0
            do {
                b[i >> 0] = b[j >> 0] | 0
                i = (i + 1) | 0
                j = (j + 1) | 0
            } while ((i | 0) < (k | 0))
            b[(h + 33) >> 0] = 0
            Nj(a, e, c)
            if ((b[(e + 11) >> 0] | 0) < 0) br(f[e >> 2] | 0)
            g = 1
            u = d
            return g | 0
        }
        function Qj(a) {
            a = a | 0
            f[a >> 2] = 1136
            sj((a + 28) | 0, f[(a + 32) >> 2] | 0)
            nj((a + 16) | 0, f[(a + 20) >> 2] | 0)
            sj((a + 4) | 0, f[(a + 8) >> 2] | 0)
            br(a)
            return
        }
        function Rj(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0
            c = f[b >> 2] | 0
            if ((c | 0) == -1) return 1
            b = (c * 3) | 0
            if ((b | 0) == -1) return 1
            c = f[a >> 2] | 0
            a = f[(c + (b << 2)) >> 2] | 0
            d = (b + 1) | 0
            e = ((d >>> 0) % 3 | 0 | 0) == 0 ? (b + -2) | 0 : d
            if ((e | 0) == -1) g = -1
            else g = f[(c + (e << 2)) >> 2] | 0
            e = ((((b >>> 0) % 3 | 0 | 0) == 0 ? 2 : -1) + b) | 0
            if ((e | 0) == -1) h = -1
            else h = f[(c + (e << 2)) >> 2] | 0
            if ((a | 0) == (g | 0)) return 1
            else return ((a | 0) == (h | 0)) | ((g | 0) == (h | 0)) | 0
            return 0
        }
        function Sj(a) {
            a = a | 0
            f[a >> 2] = 2968
            sj((a + 28) | 0, f[(a + 32) >> 2] | 0)
            Dj((a + 16) | 0, f[(a + 20) >> 2] | 0)
            sj((a + 4) | 0, f[(a + 8) >> 2] | 0)
            return
        }
        function Tj(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                i = 0,
                j = 0,
                k = 0
            d = 0
            while (1) {
                if ((h[(15560 + d) >> 0] | 0) == (a | 0)) {
                    e = 2
                    break
                }
                g = (d + 1) | 0
                if ((g | 0) == 87) {
                    i = 15648
                    j = 87
                    e = 5
                    break
                } else d = g
            }
            if ((e | 0) == 2)
                if (!d) k = 15648
                else {
                    i = 15648
                    j = d
                    e = 5
                }
            if ((e | 0) == 5)
                while (1) {
                    e = 0
                    d = i
                    do {
                        a = d
                        d = (d + 1) | 0
                    } while ((b[a >> 0] | 0) != 0)
                    j = (j + -1) | 0
                    if (!j) {
                        k = d
                        break
                    } else {
                        i = d
                        e = 5
                    }
                }
            return yq(k, f[(c + 20) >> 2] | 0) | 0
        }
        function Uj(a, b) {
            a = +a
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0.0,
                h = 0.0,
                i = 0,
                j = 0.0
            p[s >> 3] = a
            c = f[s >> 2] | 0
            d = f[(s + 4) >> 2] | 0
            e = Wn(c | 0, d | 0, 52) | 0
            switch (e & 2047) {
                case 0: {
                    if (a != 0.0) {
                        g = +Uj(a * 18446744073709551616.0, b)
                        h = g
                        i = ((f[b >> 2] | 0) + -64) | 0
                    } else {
                        h = a
                        i = 0
                    }
                    f[b >> 2] = i
                    j = h
                    break
                }
                case 2047: {
                    j = a
                    break
                }
                default: {
                    f[b >> 2] = (e & 2047) + -1022
                    f[s >> 2] = c
                    f[(s + 4) >> 2] = (d & -2146435073) | 1071644672
                    j = +p[s >> 3]
                }
            }
            return +j
        }
        function Vj(a) {
            a = a | 0
            f[a >> 2] = 2968
            sj((a + 28) | 0, f[(a + 32) >> 2] | 0)
            Dj((a + 16) | 0, f[(a + 20) >> 2] | 0)
            sj((a + 4) | 0, f[(a + 8) >> 2] | 0)
            br(a)
            return
        }
        function Wj(a, b) {
            a = +a
            b = b | 0
            var c = 0.0,
                d = 0,
                e = 0,
                g = 0.0,
                h = 0
            if ((b | 0) <= 1023)
                if ((b | 0) < -1022) {
                    c = a * 2.2250738585072014e-308
                    d = (b | 0) < -2044
                    e = (b + 2044) | 0
                    g = d ? c * 2.2250738585072014e-308 : c
                    h = d ? ((e | 0) > -1022 ? e : -1022) : (b + 1022) | 0
                } else {
                    g = a
                    h = b
                }
            else {
                c = a * 8988465674311579538646525.0e283
                e = (b | 0) > 2046
                d = (b + -2046) | 0
                g = e ? c * 8988465674311579538646525.0e283 : c
                h = e ? ((d | 0) < 1023 ? d : 1023) : (b + -1023) | 0
            }
            b = Rn((h + 1023) | 0, 0, 52) | 0
            h = I
            f[s >> 2] = b
            f[(s + 4) >> 2] = h
            return +(g * +p[s >> 3])
        }
        function Xj(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0
            if (!(f[(a + 80) >> 2] | 0)) {
                b = 0
                return b | 0
            }
            c = (a + 8) | 0
            d = (a + 12) | 0
            a = f[c >> 2] | 0
            if ((((f[d >> 2] | 0) - a) | 0) > 0) {
                e = 0
                g = a
            } else {
                b = 1
                return b | 0
            }
            while (1) {
                a = f[(g + (e << 2)) >> 2] | 0
                e = (e + 1) | 0
                if (!(yl(a, a) | 0)) {
                    b = 0
                    h = 5
                    break
                }
                g = f[c >> 2] | 0
                if ((e | 0) >= ((((f[d >> 2] | 0) - g) >> 2) | 0)) {
                    b = 1
                    h = 5
                    break
                }
            }
            if ((h | 0) == 5) return b | 0
            return 0
        }
        function Yj(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            c = (a + 36) | 0
            d = (a + 40) | 0
            e = f[c >> 2] | 0
            if ((f[d >> 2] | 0) == (e | 0)) {
                g = 1
                return g | 0
            }
            h = (a + 60) | 0
            a = 0
            i = e
            while (1) {
                e = f[(i + (a << 2)) >> 2] | 0
                a = (a + 1) | 0
                if (!(Sa[f[((f[e >> 2] | 0) + 20) >> 2] & 31](e, h, b) | 0)) {
                    g = 0
                    j = 5
                    break
                }
                i = f[c >> 2] | 0
                if (a >>> 0 >= (((f[d >> 2] | 0) - i) >> 2) >>> 0) {
                    g = 1
                    j = 5
                    break
                }
            }
            if ((j | 0) == 5) return g | 0
            return 0
        }
        function Zj(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0
            c = (a + 36) | 0
            d = (a + 40) | 0
            a = f[c >> 2] | 0
            if ((f[d >> 2] | 0) == (a | 0)) {
                e = 1
                return e | 0
            } else {
                g = 0
                h = a
            }
            while (1) {
                a = f[(h + (g << 2)) >> 2] | 0
                g = (g + 1) | 0
                if (!(Ra[f[((f[a >> 2] | 0) + 24) >> 2] & 127](a, b) | 0)) {
                    e = 0
                    i = 4
                    break
                }
                h = f[c >> 2] | 0
                if (g >>> 0 >= (((f[d >> 2] | 0) - h) >> 2) >>> 0) {
                    e = 1
                    i = 4
                    break
                }
            }
            if ((i | 0) == 4) return e | 0
            return 0
        }
        function _j(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0
            f[a >> 2] = 0
            c = (a + 4) | 0
            f[c >> 2] = 0
            f[(a + 8) >> 2] = 0
            d = (b + 4) | 0
            e = ((f[d >> 2] | 0) - (f[b >> 2] | 0)) | 0
            g = e >> 2
            if (!g) return
            if (g >>> 0 > 1073741823) mq(a)
            h = dn(e) | 0
            f[c >> 2] = h
            f[a >> 2] = h
            f[(a + 8) >> 2] = h + (g << 2)
            g = f[b >> 2] | 0
            b = ((f[d >> 2] | 0) - g) | 0
            if ((b | 0) <= 0) return
            Rg(h | 0, g | 0, b | 0) | 0
            f[c >> 2] = h + ((b >>> 2) << 2)
            return
        }
        function $j(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0
            c = (a + 8) | 0
            d = f[a >> 2] | 0
            if ((((f[c >> 2] | 0) - d) >> 2) >>> 0 >= b >>> 0) return
            e = (a + 4) | 0
            if (b >>> 0 > 1073741823) {
                g = ra(8) | 0
                Wo(g, 14941)
                f[g >> 2] = 6944
                va(g | 0, 1080, 114)
            }
            g = ((f[e >> 2] | 0) - d) | 0
            h = dn(b << 2) | 0
            if ((g | 0) > 0) Rg(h | 0, d | 0, g | 0) | 0
            f[a >> 2] = h
            f[e >> 2] = h + ((g >> 2) << 2)
            f[c >> 2] = h + (b << 2)
            if (!d) return
            br(d)
            return
        }
        function ak(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0
            b = (a + 36) | 0
            c = (a + 40) | 0
            d = f[b >> 2] | 0
            if ((f[c >> 2] | 0) == (d | 0)) {
                e = 1
                return e | 0
            }
            g = (a + 60) | 0
            a = 0
            h = d
            while (1) {
                d = f[(h + (a << 2)) >> 2] | 0
                a = (a + 1) | 0
                if (!(Ra[f[((f[d >> 2] | 0) + 16) >> 2] & 127](d, g) | 0)) {
                    e = 0
                    i = 5
                    break
                }
                h = f[b >> 2] | 0
                if (a >>> 0 >= (((f[c >> 2] | 0) - h) >> 2) >>> 0) {
                    e = 1
                    i = 5
                    break
                }
            }
            if ((i | 0) == 5) return e | 0
            return 0
        }
        function bk(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            d = u
            u = (u + 16) | 0
            e = d
            g = dn(16) | 0
            f[e >> 2] = g
            f[(e + 8) >> 2] = -2147483632
            f[(e + 4) >> 2] = 15
            h = g
            i = 12916
            j = (h + 15) | 0
            do {
                b[h >> 0] = b[i >> 0] | 0
                h = (h + 1) | 0
                i = (i + 1) | 0
            } while ((h | 0) < (j | 0))
            b[(g + 15) >> 0] = 0
            Nj((a + 4) | 0, e, c)
            if ((b[(e + 11) >> 0] | 0) >= 0) {
                u = d
                return
            }
            br(f[e >> 2] | 0)
            u = d
            return
        }
        function ck(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0
            f[a >> 2] = 0
            f[(a + 4) >> 2] = b
            if (b | 0 ? ((c = mh(b, 992, 976, 0) | 0), c | 0) : 0) {
                d = dn(56) | 0
                Gm(d, c)
                c = f[a >> 2] | 0
                f[a >> 2] = d
                if (!c) return
                Va[f[((f[c >> 2] | 0) + 4) >> 2] & 127](c)
                return
            }
            c = dn(56) | 0
            Am(c, b)
            b = f[a >> 2] | 0
            f[a >> 2] = c
            if (!b) return
            Va[f[((f[b >> 2] | 0) + 4) >> 2] & 127](b)
            return
        }
        function dk(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0
            d = f[(a + 176) >> 2] | 0
            e = f[(a + 172) >> 2] | 0
            a = e
            if ((d | 0) == (e | 0)) return 0
            g = (((d - e) | 0) / 136) | 0
            e = 0
            while (1) {
                if ((f[(a + ((e * 136) | 0)) >> 2] | 0) == (c | 0)) {
                    h = 4
                    break
                }
                d = (e + 1) | 0
                if (d >>> 0 < g >>> 0) e = d
                else {
                    h = 6
                    break
                }
            }
            if ((h | 0) == 4) return ((b[(a + ((e * 136) | 0) + 100) >> 0] | 0) == 0 ? 0 : (a + ((e * 136) | 0) + 4) | 0) | 0
            else if ((h | 0) == 6) return 0
            return 0
        }
        function ek(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0
            c = f[(a + 72) >> 2] | 0
            if (!c) {
                d = 0
                return d | 0
            }
            f[(c + 4) >> 2] = a + 60
            if (!(Qa[f[((f[c >> 2] | 0) + 12) >> 2] & 127](c) | 0)) {
                d = 0
                return d | 0
            }
            if (!(Qa[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a) | 0)) {
                d = 0
                return d | 0
            }
            if (!(Ra[f[((f[a >> 2] | 0) + 44) >> 2] & 127](a, b) | 0)) {
                d = 0
                return d | 0
            }
            d = Ra[f[((f[a >> 2] | 0) + 48) >> 2] & 127](a, b) | 0
            return d | 0
        }
        function fk(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0
            f[a >> 2] = 0
            d = (a + 4) | 0
            f[d >> 2] = 0
            f[(a + 8) >> 2] = 0
            if (!b) return
            if (b >>> 0 > 357913941) mq(a)
            e = dn((b * 12) | 0) | 0
            f[d >> 2] = e
            f[a >> 2] = e
            f[(a + 8) >> 2] = e + ((b * 12) | 0)
            a = b
            b = e
            do {
                _j(b, c)
                b = ((f[d >> 2] | 0) + 12) | 0
                f[d >> 2] = b
                a = (a + -1) | 0
            } while ((a | 0) != 0)
            return
        }
        function gk(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0
            c = f[b >> 2] | 0
            if (!c) {
                d = 0
                return d | 0
            }
            e = (a + 44) | 0
            g = f[e >> 2] | 0
            if (g >>> 0 < (f[(a + 48) >> 2] | 0) >>> 0) {
                f[b >> 2] = 0
                f[g >> 2] = c
                f[e >> 2] = (f[e >> 2] | 0) + 4
                d = 1
                return d | 0
            } else {
                Bg((a + 40) | 0, b)
                d = 1
                return d | 0
            }
            return 0
        }
        function hk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 2880
            f[(a + 40) >> 2] = 1180
            b = f[(a + 48) >> 2] | 0
            if (b | 0) {
                c = (a + 52) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            f[a >> 2] = 1460
            b = (a + 36) | 0
            d = f[b >> 2] | 0
            f[b >> 2] = 0
            if (!d) {
                zi(a)
                br(a)
                return
            }
            Va[f[((f[d >> 2] | 0) + 4) >> 2] & 127](d)
            zi(a)
            br(a)
            return
        }
        function ik(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                i = 0
            f[c >> 2] = 2
            d = (a + 4) | 0
            a = (c + 8) | 0
            e = f[a >> 2] | 0
            g = ((f[(c + 12) >> 2] | 0) - e) | 0
            if (g >>> 0 < 4294967292) {
                Bk(a, (g + 4) | 0, 0)
                i = f[a >> 2] | 0
            } else i = e
            e = (i + g) | 0
            g = h[d >> 0] | (h[(d + 1) >> 0] << 8) | (h[(d + 2) >> 0] << 16) | (h[(d + 3) >> 0] << 24)
            b[e >> 0] = g
            b[(e + 1) >> 0] = g >> 8
            b[(e + 2) >> 0] = g >> 16
            b[(e + 3) >> 0] = g >> 24
            return
        }
        function jk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0
            f[a >> 2] = 3164
            b = (a + 8) | 0
            f[b >> 2] = 3188
            c = f[(a + 56) >> 2] | 0
            if (c | 0) {
                d = (a + 60) | 0
                e = f[d >> 2] | 0
                if ((e | 0) != (c | 0)) f[d >> 2] = e + (~(((e + -4 - c) | 0) >>> 2) << 2)
                br(c)
            }
            f[b >> 2] = 3208
            b = f[(a + 44) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 32) >> 2] | 0
            if (!b) {
                br(a)
                return
            }
            br(b)
            br(a)
            return
        }
        function kk(a, c, d) {
            a = a | 0
            c = c | 0
            d = $(d)
            var e = 0,
                g = Oa,
                h = 0
            e = zg(a, c) | 0
            if ((e | 0) == ((a + 4) | 0)) {
                g = d
                return $(g)
            }
            a = (e + 28) | 0
            if ((b[(a + 11) >> 0] | 0) < 0) h = f[a >> 2] | 0
            else h = a
            g = $(+Xq(h))
            return $(g)
        }
        function lk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0
            b = u
            u = (u + 16) | 0
            c = b
            d = c
            f[d >> 2] = 0
            f[(d + 4) >> 2] = 0
            cf(a, 2, c)
            c = f[(a + 12) >> 2] | 0
            d = (a + 16) | 0
            e = f[d >> 2] | 0
            if ((e | 0) == (c | 0)) {
                g = (a + 24) | 0
                f[g >> 2] = 0
                h = (a + 28) | 0
                f[h >> 2] = 0
                u = b
                return
            }
            f[d >> 2] = e + (~(((e + -4 - c) | 0) >>> 2) << 2)
            g = (a + 24) | 0
            f[g >> 2] = 0
            h = (a + 28) | 0
            f[h >> 2] = 0
            u = b
            return
        }
        function mk(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            c = f[(a + 176) >> 2] | 0
            d = f[(a + 172) >> 2] | 0
            e = d
            a: do
                if ((c | 0) != (d | 0)) {
                    g = (((c - d) | 0) / 136) | 0
                    h = 0
                    while (1) {
                        if ((f[(e + ((h * 136) | 0)) >> 2] | 0) == (b | 0)) break
                        i = (h + 1) | 0
                        if (i >>> 0 < g >>> 0) h = i
                        else break a
                    }
                    j = (e + ((h * 136) | 0) + 104) | 0
                    return j | 0
                }
            while (0)
            j = (a + 40) | 0
            return j | 0
        }
        function nk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0
            f[a >> 2] = 3232
            b = (a + 8) | 0
            f[b >> 2] = 3256
            c = f[(a + 56) >> 2] | 0
            if (c | 0) {
                d = (a + 60) | 0
                e = f[d >> 2] | 0
                if ((e | 0) != (c | 0)) f[d >> 2] = e + (~(((e + -4 - c) | 0) >>> 2) << 2)
                br(c)
            }
            f[b >> 2] = 3276
            b = f[(a + 44) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 32) >> 2] | 0
            if (!b) {
                br(a)
                return
            }
            br(b)
            br(a)
            return
        }
        function ok(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 2880
            f[(a + 40) >> 2] = 1180
            b = f[(a + 48) >> 2] | 0
            if (b | 0) {
                c = (a + 52) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            f[a >> 2] = 1460
            b = (a + 36) | 0
            d = f[b >> 2] | 0
            f[b >> 2] = 0
            if (!d) {
                zi(a)
                return
            }
            Va[f[((f[d >> 2] | 0) + 4) >> 2] & 127](d)
            zi(a)
            return
        }
        function pk(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0
            Ec(a, b)
            if ((b | 0) <= -1) return
            c = (a + 88) | 0
            d = f[c >> 2] | 0
            e = f[(a + 84) >> 2] | 0
            if ((((d - e) >> 2) | 0) <= (b | 0)) return
            a = (e + (b << 2)) | 0
            b = (a + 4) | 0
            e = (d - b) | 0
            g = e >> 2
            if (!g) h = d
            else {
                Xl(a | 0, b | 0, e | 0) | 0
                h = f[c >> 2] | 0
            }
            e = (a + (g << 2)) | 0
            if ((h | 0) == (e | 0)) return
            f[c >> 2] = h + (~(((h + -4 - e) | 0) >>> 2) << 2)
            return
        }
        function qk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0
            b = f[(a + 32) >> 2] | 0
            c = f[(a + 36) >> 2] | 0
            if ((b | 0) == (c | 0)) {
                d = 1
                return d | 0
            }
            e = (a + 8) | 0
            g = (a + 44) | 0
            a = b
            while (1) {
                b = f[((f[e >> 2] | 0) + (f[a >> 2] << 2)) >> 2] | 0
                a = (a + 4) | 0
                if (!(Ra[f[((f[b >> 2] | 0) + 20) >> 2] & 127](b, f[g >> 2] | 0) | 0)) {
                    d = 0
                    h = 5
                    break
                }
                if ((a | 0) == (c | 0)) {
                    d = 1
                    h = 5
                    break
                }
            }
            if ((h | 0) == 5) return d | 0
            return 0
        }
        function rk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0
            f[a >> 2] = 3164
            b = (a + 8) | 0
            f[b >> 2] = 3188
            c = f[(a + 56) >> 2] | 0
            if (c | 0) {
                d = (a + 60) | 0
                e = f[d >> 2] | 0
                if ((e | 0) != (c | 0)) f[d >> 2] = e + (~(((e + -4 - c) | 0) >>> 2) << 2)
                br(c)
            }
            f[b >> 2] = 3208
            b = f[(a + 44) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 32) >> 2] | 0
            if (!b) return
            br(b)
            return
        }
        function sk(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0,
                i = 0.0
            d = u
            u = (u + 128) | 0
            e = d
            g = e
            h = (g + 124) | 0
            do {
                f[g >> 2] = 0
                g = (g + 4) | 0
            } while ((g | 0) < (h | 0))
            g = (e + 4) | 0
            f[g >> 2] = a
            h = (e + 8) | 0
            f[h >> 2] = -1
            f[(e + 44) >> 2] = a
            f[(e + 76) >> 2] = -1
            Rm(e, 0)
            i = +Lc(e, c, 1)
            c = ((f[g >> 2] | 0) - (f[h >> 2] | 0) + (f[(e + 108) >> 2] | 0)) | 0
            if (b | 0) f[b >> 2] = c | 0 ? (a + c) | 0 : a
            u = d
            return +i
        }
        function tk(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var g = 0,
                h = 0
            a = (c + 16) | 0
            g = f[a >> 2] | 0
            do
                if (g) {
                    if ((g | 0) != (d | 0)) {
                        h = (c + 36) | 0
                        f[h >> 2] = (f[h >> 2] | 0) + 1
                        f[(c + 24) >> 2] = 2
                        b[(c + 54) >> 0] = 1
                        break
                    }
                    h = (c + 24) | 0
                    if ((f[h >> 2] | 0) == 2) f[h >> 2] = e
                } else {
                    f[a >> 2] = d
                    f[(c + 24) >> 2] = e
                    f[(c + 36) >> 2] = 1
                }
            while (0)
            return
        }
        function uk(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0
            c = (a + 74) | 0
            d = b[c >> 0] | 0
            b[c >> 0] = (d + 255) | d
            d = (a + 20) | 0
            c = (a + 28) | 0
            if ((f[d >> 2] | 0) >>> 0 > (f[c >> 2] | 0) >>> 0) Sa[f[(a + 36) >> 2] & 31](a, 0, 0) | 0
            f[(a + 16) >> 2] = 0
            f[c >> 2] = 0
            f[d >> 2] = 0
            d = f[a >> 2] | 0
            if (!(d & 4)) {
                c = ((f[(a + 44) >> 2] | 0) + (f[(a + 48) >> 2] | 0)) | 0
                f[(a + 8) >> 2] = c
                f[(a + 4) >> 2] = c
                e = (d << 27) >> 31
            } else {
                f[a >> 2] = d | 32
                e = -1
            }
            return e | 0
        }
        function vk(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0
            d = zg(a, c) | 0
            if ((d | 0) == ((a + 4) | 0)) {
                e = 0
                return e | 0
            }
            a = (d + 28) | 0
            if ((b[(a + 11) >> 0] | 0) < 0) g = f[a >> 2] | 0
            else g = a
            e = (((Kj(g) | 0) + 1) | 0) >>> 0 > 1
            return e | 0
        }
        function wk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 5840
            b = f[(a + 96) >> 2] | 0
            if (b | 0) {
                c = (a + 100) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + ((~(((((d + -12 - b) | 0) >>> 0) / 12) | 0) * 12) | 0)
                br(b)
            }
            b = f[(a + 84) >> 2] | 0
            if (!b) {
                wg(a)
                br(a)
                return
            }
            d = (a + 88) | 0
            c = f[d >> 2] | 0
            if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
            br(b)
            wg(a)
            br(a)
            return
        }
        function xk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0
            f[a >> 2] = 3232
            b = (a + 8) | 0
            f[b >> 2] = 3256
            c = f[(a + 56) >> 2] | 0
            if (c | 0) {
                d = (a + 60) | 0
                e = f[d >> 2] | 0
                if ((e | 0) != (c | 0)) f[d >> 2] = e + (~(((e + -4 - c) | 0) >>> 2) << 2)
                br(c)
            }
            f[b >> 2] = 3276
            b = f[(a + 44) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 32) >> 2] | 0
            if (!b) return
            br(b)
            return
        }
        function yk(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0,
                h = 0
            e = zg(a, c) | 0
            if ((e | 0) == ((a + 4) | 0)) {
                g = d
                return g | 0
            }
            d = (e + 28) | 0
            if ((b[(d + 11) >> 0] | 0) < 0) h = f[d >> 2] | 0
            else h = d
            g = Kj(h) | 0
            return g | 0
        }
        function zk(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0,
                f = 0,
                g = 0,
                h = 0,
                i = 0
            e = (b >> 31) | (((b | 0) < 0 ? -1 : 0) << 1)
            f = (((b | 0) < 0 ? -1 : 0) >> 31) | (((b | 0) < 0 ? -1 : 0) << 1)
            g = (d >> 31) | (((d | 0) < 0 ? -1 : 0) << 1)
            h = (((d | 0) < 0 ? -1 : 0) >> 31) | (((d | 0) < 0 ? -1 : 0) << 1)
            i = Vn((e ^ a) | 0, (f ^ b) | 0, e | 0, f | 0) | 0
            b = I
            a = g ^ e
            e = h ^ f
            return Vn(((Bd(i, b, Vn((g ^ c) | 0, (h ^ d) | 0, g | 0, h | 0) | 0, I, 0) | 0) ^ a) | 0, (I ^ e) | 0, a | 0, e | 0) | 0
        }
        function Ak(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            var h = 0,
                i = 0,
                j = 0
            f[a >> 2] = b
            h = (b + 16) | 0
            i = f[(h + 4) >> 2] | 0
            j = (a + 8) | 0
            f[j >> 2] = f[h >> 2]
            f[(j + 4) >> 2] = i
            i = (b + 24) | 0
            b = f[(i + 4) >> 2] | 0
            j = (a + 16) | 0
            f[j >> 2] = f[i >> 2]
            f[(j + 4) >> 2] = b
            b = (a + 40) | 0
            f[b >> 2] = c
            f[(b + 4) >> 2] = d
            d = (a + 48) | 0
            f[d >> 2] = e
            f[(d + 4) >> 2] = g
            return
        }
        function Bk(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0
            c = (a + 4) | 0
            d = f[c >> 2] | 0
            e = f[a >> 2] | 0
            g = (d - e) | 0
            h = e
            e = d
            if (g >>> 0 >= b >>> 0) {
                if (g >>> 0 > b >>> 0 ? ((d = (h + b) | 0), (d | 0) != (e | 0)) : 0) f[c >> 2] = d
            } else ri(a, (b - g) | 0)
            g = (a + 24) | 0
            a = g
            b = Tn(f[a >> 2] | 0, f[(a + 4) >> 2] | 0, 1, 0) | 0
            a = g
            f[a >> 2] = b
            f[(a + 4) >> 2] = I
            return
        }
        function Ck(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0
            d = zg(a, c) | 0
            if ((d | 0) == ((a + 4) | 0)) {
                e = -1
                return e | 0
            }
            a = (d + 28) | 0
            if ((b[(a + 11) >> 0] | 0) < 0) g = f[a >> 2] | 0
            else g = a
            e = Kj(g) | 0
            return e | 0
        }
        function Dk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 5840
            b = f[(a + 96) >> 2] | 0
            if (b | 0) {
                c = (a + 100) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + ((~(((((d + -12 - b) | 0) >>> 0) / 12) | 0) * 12) | 0)
                br(b)
            }
            b = f[(a + 84) >> 2] | 0
            if (!b) {
                wg(a)
                return
            }
            d = (a + 88) | 0
            c = f[d >> 2] | 0
            if ((c | 0) != (b | 0)) f[d >> 2] = c + (~(((c + -4 - b) | 0) >>> 2) << 2)
            br(b)
            wg(a)
            return
        }
        function Ek(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            f[(a + 12) >> 2] = 0
            f[(a + 16) >> 2] = 0
            f[(a + 20) >> 2] = 0
            b[(a + 24) >> 0] = 1
            c = (a + 68) | 0
            d = (a + 28) | 0
            e = (d + 40) | 0
            do {
                f[d >> 2] = 0
                d = (d + 4) | 0
            } while ((d | 0) < (e | 0))
            f[c >> 2] = a
            c = (a + 72) | 0
            f[c >> 2] = 0
            f[(c + 4) >> 2] = 0
            f[(c + 8) >> 2] = 0
            f[(c + 12) >> 2] = 0
            f[(c + 16) >> 2] = 0
            f[(c + 20) >> 2] = 0
            return
        }
        function Fk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 3188
            b = f[(a + 48) >> 2] | 0
            if (b | 0) {
                c = (a + 52) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            f[a >> 2] = 3208
            b = f[(a + 36) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 24) >> 2] | 0
            if (!b) {
                br(a)
                return
            }
            br(b)
            br(a)
            return
        }
        function Gk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 2004
            b = f[(a + 76) >> 2] | 0
            if (b | 0) br(b)
            f[a >> 2] = 1528
            b = f[(a + 32) >> 2] | 0
            if (!b) {
                br(a)
                return
            }
            c = (a + 36) | 0
            d = f[c >> 2] | 0
            if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
            br(b)
            br(a)
            return
        }
        function Hk(a, b, c, d, e) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var f = 0,
                g = 0,
                h = 0
            f = u
            u = (u + 256) | 0
            g = f
            if (((c | 0) > (d | 0)) & (((e & 73728) | 0) == 0)) {
                e = (c - d) | 0
                hj(g | 0, ((b << 24) >> 24) | 0, (e >>> 0 < 256 ? e : 256) | 0) | 0
                if (e >>> 0 > 255) {
                    b = (c - d) | 0
                    d = e
                    do {
                        ep(a, g, 256)
                        d = (d + -256) | 0
                    } while (d >>> 0 > 255)
                    h = b & 255
                } else h = e
                ep(a, g, h)
            }
            u = f
            return
        }
        function Ik(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 3256
            b = f[(a + 48) >> 2] | 0
            if (b | 0) {
                c = (a + 52) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            f[a >> 2] = 3276
            b = f[(a + 36) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 24) >> 2] | 0
            if (!b) {
                br(a)
                return
            }
            br(b)
            br(a)
            return
        }
        function Jk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 1696
            b = f[(a + 76) >> 2] | 0
            if (b | 0) br(b)
            f[a >> 2] = 1528
            b = f[(a + 32) >> 2] | 0
            if (!b) {
                br(a)
                return
            }
            c = (a + 36) | 0
            d = f[c >> 2] | 0
            if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
            br(b)
            br(a)
            return
        }
        function Kk(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            var h = 0
            if (qp(a, f[(b + 8) >> 2] | 0, g) | 0) fj(0, b, c, d, e)
            else {
                h = f[(a + 8) >> 2] | 0
                _a[f[((f[h >> 2] | 0) + 20) >> 2] & 3](h, b, c, d, e, g)
            }
            return
        }
        function Lk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 3188
            b = f[(a + 48) >> 2] | 0
            if (b | 0) {
                c = (a + 52) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            f[a >> 2] = 3208
            b = f[(a + 36) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 24) >> 2] | 0
            if (!b) return
            br(b)
            return
        }
        function Mk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 2060
            tj((a + 108) | 0)
            f[a >> 2] = 1528
            b = f[(a + 32) >> 2] | 0
            if (!b) {
                br(a)
                return
            }
            c = (a + 36) | 0
            d = f[c >> 2] | 0
            if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
            br(b)
            br(a)
            return
        }
        function Nk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 3256
            b = f[(a + 48) >> 2] | 0
            if (b | 0) {
                c = (a + 52) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            f[a >> 2] = 3276
            b = f[(a + 36) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 24) >> 2] | 0
            if (!b) return
            br(b)
            return
        }
        function Ok(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 1752
            tj((a + 108) | 0)
            f[a >> 2] = 1528
            b = f[(a + 32) >> 2] | 0
            if (!b) {
                br(a)
                return
            }
            c = (a + 36) | 0
            d = f[c >> 2] | 0
            if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
            br(b)
            br(a)
            return
        }
        function Pk(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                f = 0,
                g = 0,
                h = 0,
                i = 0,
                j = 0
            a: do
                if (!d) e = 0
                else {
                    f = a
                    g = d
                    h = c
                    while (1) {
                        i = b[f >> 0] | 0
                        j = b[h >> 0] | 0
                        if ((i << 24) >> 24 != (j << 24) >> 24) break
                        g = (g + -1) | 0
                        if (!g) {
                            e = 0
                            break a
                        } else {
                            f = (f + 1) | 0
                            h = (h + 1) | 0
                        }
                    }
                    e = ((i & 255) - (j & 255)) | 0
                }
            while (0)
            return e | 0
        }
        function Qk(a) {
            a = a | 0
            if (!(f[(a + 44) >> 2] | 0)) return 0
            if (!(f[(a + 48) >> 2] | 0)) return 0
            if (!(f[(a + 24) >> 2] | 0)) return 0
            if (!(f[(a + 28) >> 2] | 0)) return 0
            if (!(f[(a + 32) >> 2] | 0)) return 0
            else return ((f[(a + 36) >> 2] | 0) != 0) | 0
            return 0
        }
        function Rk(a) {
            a = a | 0
            var b = 0,
                c = 0
            f[a >> 2] = 2004
            b = f[(a + 76) >> 2] | 0
            if (b | 0) br(b)
            f[a >> 2] = 1528
            b = f[(a + 32) >> 2] | 0
            if (!b) return
            c = (a + 36) | 0
            a = f[c >> 2] | 0
            if ((a | 0) != (b | 0)) f[c >> 2] = a + (~(((a + -4 - b) | 0) >>> 2) << 2)
            br(b)
            return
        }
        function Sk(a) {
            a = a | 0
            var c = 0,
                d = 0
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            c = 0
            while (1) {
                if ((c | 0) == 3) break
                f[(a + (c << 2)) >> 2] = 0
                c = (c + 1) | 0
            }
            if ((b[(a + 11) >> 0] | 0) < 0) d = ((f[(a + 8) >> 2] & 2147483647) + -1) | 0
            else d = 10
            wj(a, d, 0)
            return
        }
        function Tk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0.0,
                g = 0.0
            b = f[(a + 8) >> 2] | 0
            if ((b | 0) < 2) {
                c = 0
                d = 0
                I = c
                return d | 0
            }
            e = +(b | 0)
            g = +Fg(e) * e
            e = +W(+(g - +p[a >> 3]))
            c = +K(e) >= 1.0 ? (e > 0.0 ? ~~+Y(+J(e / 4294967296.0), 4294967295.0) >>> 0 : ~~+W((e - +(~~e >>> 0)) / 4294967296.0) >>> 0) : 0
            d = ~~e >>> 0
            I = c
            return d | 0
        }
        function Uk(a) {
            a = a | 0
            var b = 0,
                c = 0
            f[a >> 2] = 1696
            b = f[(a + 76) >> 2] | 0
            if (b | 0) br(b)
            f[a >> 2] = 1528
            b = f[(a + 32) >> 2] | 0
            if (!b) return
            c = (a + 36) | 0
            a = f[c >> 2] | 0
            if ((a | 0) != (b | 0)) f[c >> 2] = a + (~(((a + -4 - b) | 0) >>> 2) << 2)
            br(b)
            return
        }
        function Vk(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0
            c = f[(a + 16) >> 2] | 0
            if (((((f[(a + 20) >> 2] | 0) - c) >> 2) | 0) <= (b | 0)) {
                d = 0
                return d | 0
            }
            e = f[(c + (b << 2)) >> 2] | 0
            if ((e | 0) < 0) {
                d = 0
                return d | 0
            }
            b = f[((f[(a + 36) >> 2] | 0) + (e << 2)) >> 2] | 0
            e = f[(b + 32) >> 2] | 0
            if (e | 0) {
                d = e
                return d | 0
            }
            d = f[(b + 8) >> 2] | 0
            return d | 0
        }
        function Wk(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 1216
            b = f[(a + 16) >> 2] | 0
            if (b | 0) {
                c = (a + 20) | 0
                d = f[c >> 2] | 0
                if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
                br(b)
            }
            b = f[(a + 4) >> 2] | 0
            if (!b) return
            d = (a + 8) | 0
            a = f[d >> 2] | 0
            if ((a | 0) != (b | 0)) f[d >> 2] = a + (~(((a + -4 - b) | 0) >>> 2) << 2)
            br(b)
            return
        }
        function Xk(a) {
            a = a | 0
            var b = 0,
                c = 0
            f[a >> 2] = 2060
            tj((a + 108) | 0)
            f[a >> 2] = 1528
            b = f[(a + 32) >> 2] | 0
            if (!b) return
            c = (a + 36) | 0
            a = f[c >> 2] | 0
            if ((a | 0) != (b | 0)) f[c >> 2] = a + (~(((a + -4 - b) | 0) >>> 2) << 2)
            br(b)
            return
        }
        function Yk(a) {
            a = a | 0
            if (!(f[(a + 64) >> 2] | 0)) return 0
            if (!(f[(a + 68) >> 2] | 0)) return 0
            if (!(f[(a + 44) >> 2] | 0)) return 0
            if (!(f[(a + 48) >> 2] | 0)) return 0
            if (!(f[(a + 52) >> 2] | 0)) return 0
            else return ((f[(a + 56) >> 2] | 0) != 0) | 0
            return 0
        }
        function Zk(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0
            if (qp(a, f[(b + 8) >> 2] | 0, 0) | 0) tk(0, b, c, d)
            else {
                e = f[(a + 8) >> 2] | 0
                Ya[f[((f[e >> 2] | 0) + 28) >> 2] & 7](e, b, c, d)
            }
            return
        }
        function _k(a) {
            a = a | 0
            var b = 0,
                c = 0
            f[a >> 2] = 1752
            tj((a + 108) | 0)
            f[a >> 2] = 1528
            b = f[(a + 32) >> 2] | 0
            if (!b) return
            c = (a + 36) | 0
            a = f[c >> 2] | 0
            if ((a | 0) != (b | 0)) f[c >> 2] = a + (~(((a + -4 - b) | 0) >>> 2) << 2)
            br(b)
            return
        }
        function $k(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0
            if ((b | 0) < 0) {
                c = 0
                return c | 0
            }
            d = f[(a + 4) >> 2] | 0
            if (((((f[(d + 12) >> 2] | 0) - (f[(d + 8) >> 2] | 0)) >> 2) | 0) <= (b | 0)) {
                c = 0
                return c | 0
            }
            d = f[((f[(a + 8) >> 2] | 0) + (f[((f[(a + 20) >> 2] | 0) + (b << 2)) >> 2] << 2)) >> 2] | 0
            c = Ra[f[((f[d >> 2] | 0) + 36) >> 2] & 127](d, b) | 0
            return c | 0
        }
        function al(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0
            if ((b | 0) < 0) {
                c = 0
                return c | 0
            }
            d = f[(a + 4) >> 2] | 0
            if (((((f[(d + 12) >> 2] | 0) - (f[(d + 8) >> 2] | 0)) >> 2) | 0) <= (b | 0)) {
                c = 0
                return c | 0
            }
            d = f[((f[(a + 8) >> 2] | 0) + (f[((f[(a + 20) >> 2] | 0) + (b << 2)) >> 2] << 2)) >> 2] | 0
            c = Ra[f[((f[d >> 2] | 0) + 32) >> 2] & 127](d, b) | 0
            return c | 0
        }
        function bl(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0,
                f = 0,
                g = 0
            d = b[a >> 0] | 0
            e = b[c >> 0] | 0
            if ((d << 24) >> 24 == 0 ? 1 : (d << 24) >> 24 != (e << 24) >> 24) {
                f = e
                g = d
            } else {
                d = c
                c = a
                do {
                    c = (c + 1) | 0
                    d = (d + 1) | 0
                    a = b[c >> 0] | 0
                    e = b[d >> 0] | 0
                } while (!((a << 24) >> 24 == 0 ? 1 : (a << 24) >> 24 != (e << 24) >> 24))
                f = e
                g = a
            }
            return ((g & 255) - (f & 255)) | 0
        }
        function cl(a, b) {
            a = a | 0
            b = $(b)
            var c = 0,
                d = 0
            c = u
            u = (u + 16) | 0
            d = c
            Sk(d)
            qi(a, d, b)
            Go(d)
            u = c
            return
        }
        function dl(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0,
                e = 0,
                g = 0
            b = f[a >> 2] | 0
            c = (a + 4) | 0
            d = f[c >> 2] | 0
            if ((d | 0) == (b | 0)) e = b
            else {
                g = (d + (~(((d + -4 - b) | 0) >>> 2) << 2)) | 0
                f[c >> 2] = g
                e = g
            }
            f[(a + 12) >> 2] = 0
            f[(a + 16) >> 2] = 0
            if (!b) return
            if ((e | 0) != (b | 0)) f[c >> 2] = e + (~(((e + -4 - b) | 0) >>> 2) << 2)
            br(b)
            return
        }
        function el(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0
            d = f[(a + 16) >> 2] | 0
            if (((((f[(a + 20) >> 2] | 0) - d) >> 2) | 0) <= (b | 0)) {
                e = -1
                return e | 0
            }
            g = f[(d + (b << 2)) >> 2] | 0
            if ((g | 0) < 0) {
                e = -1
                return e | 0
            }
            e = f[((f[((f[((f[(a + 36) >> 2] | 0) + (g << 2)) >> 2] | 0) + 16) >> 2] | 0) + (c << 2)) >> 2] | 0
            return e | 0
        }
        function fl(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0
            c = u
            u = (u + 16) | 0
            d = c
            Sk(d)
            vi(a, d, b)
            Go(d)
            u = c
            return
        }
        function gl(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0,
                h = 0
            d = u
            u = (u + 32) | 0
            e = d
            g = (d + 20) | 0
            f[e >> 2] = f[(a + 60) >> 2]
            f[(e + 4) >> 2] = 0
            f[(e + 8) >> 2] = b
            f[(e + 12) >> 2] = g
            f[(e + 16) >> 2] = c
            if ((ro(za(140, e | 0) | 0) | 0) < 0) {
                f[g >> 2] = -1
                h = -1
            } else h = f[g >> 2] | 0
            u = d
            return h | 0
        }
        function hl(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0
            if (((b | 0) == -1) | ((b | 0) > 4)) {
                c = 0
                return c | 0
            }
            d = f[(a + 20 + ((b * 12) | 0)) >> 2] | 0
            if ((((f[(a + 20 + ((b * 12) | 0) + 4) >> 2] | 0) - d) | 0) <= 0) {
                c = 0
                return c | 0
            }
            b = f[d >> 2] | 0
            if ((b | 0) == -1) {
                c = 0
                return c | 0
            }
            c = f[((f[(a + 8) >> 2] | 0) + (b << 2)) >> 2] | 0
            return c | 0
        }
        function il(a) {
            a = a | 0
            if (!(f[(a + 40) >> 2] | 0)) return 0
            if (!(f[(a + 24) >> 2] | 0)) return 0
            if (!(f[(a + 28) >> 2] | 0)) return 0
            if (!(f[(a + 32) >> 2] | 0)) return 0
            else return ((f[(a + 36) >> 2] | 0) != 0) | 0
            return 0
        }
        function jl(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0
            c = f[(a + 16) >> 2] | 0
            if (((((f[(a + 20) >> 2] | 0) - c) >> 2) | 0) <= (b | 0)) {
                d = 0
                return d | 0
            }
            e = f[(c + (b << 2)) >> 2] | 0
            if ((e | 0) < 0) {
                d = 0
                return d | 0
            }
            b = f[((f[(a + 36) >> 2] | 0) + (e << 2)) >> 2] | 0
            d = ((f[(b + 20) >> 2] | 0) - (f[(b + 16) >> 2] | 0)) >> 2
            return d | 0
        }
        function kl(a) {
            a = a | 0
            var b = 0
            if (!(f[(a + 24) >> 2] | 0)) {
                b = 0
                return b | 0
            }
            if (!(f[(a + 28) >> 2] | 0)) {
                b = 0
                return b | 0
            }
            if (!(f[(a + 32) >> 2] | 0)) {
                b = 0
                return b | 0
            }
            b = (f[(a + 36) >> 2] | 0) != 0
            return b | 0
        }
        function ll(a) {
            a = a | 0
            if (!(f[(a + 60) >> 2] | 0)) return 0
            if (!(f[(a + 44) >> 2] | 0)) return 0
            if (!(f[(a + 48) >> 2] | 0)) return 0
            if (!(f[(a + 52) >> 2] | 0)) return 0
            else return ((f[(a + 56) >> 2] | 0) != 0) | 0
            return 0
        }
        function ml(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0
            Sg(a, c)
            f[a >> 2] = 1392
            c = (a + 72) | 0
            d = (a + 36) | 0
            a = (d + 36) | 0
            do {
                f[d >> 2] = 0
                d = (d + 4) | 0
            } while ((d | 0) < (a | 0))
            d = f[b >> 2] | 0
            f[b >> 2] = 0
            f[c >> 2] = d
            return
        }
        function nl(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0
            d = a
            e = c
            c = (d + 64) | 0
            do {
                f[d >> 2] = f[e >> 2]
                d = (d + 4) | 0
                e = (e + 4) | 0
            } while ((d | 0) < (c | 0))
            e = (a + 64) | 0
            f[(a + 88) >> 2] = 0
            f[e >> 2] = 0
            f[(e + 4) >> 2] = 0
            f[(e + 8) >> 2] = 0
            f[(e + 12) >> 2] = 0
            f[(e + 16) >> 2] = 0
            b[(e + 20) >> 0] = 0
            return
        }
        function ol(a, c, d, e) {
            a = a | 0
            c = c | 0
            d = d | 0
            e = e | 0
            var f = 0,
                g = 0
            if (((a | 0) == 0) & ((c | 0) == 0)) f = d
            else {
                g = d
                d = c
                c = a
                while (1) {
                    a = (g + -1) | 0
                    b[a >> 0] = h[(15542 + (c & 15)) >> 0] | 0 | e
                    c = Wn(c | 0, d | 0, 4) | 0
                    d = I
                    if (((c | 0) == 0) & ((d | 0) == 0)) {
                        f = a
                        break
                    } else g = a
                }
            }
            return f | 0
        }
        function pl(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0
            c = (a + 74) | 0
            d = b[c >> 0] | 0
            b[c >> 0] = (d + 255) | d
            d = f[a >> 2] | 0
            if (!(d & 8)) {
                f[(a + 8) >> 2] = 0
                f[(a + 4) >> 2] = 0
                c = f[(a + 44) >> 2] | 0
                f[(a + 28) >> 2] = c
                f[(a + 20) >> 2] = c
                f[(a + 16) >> 2] = c + (f[(a + 48) >> 2] | 0)
                e = 0
            } else {
                f[a >> 2] = d | 32
                e = -1
            }
            return e | 0
        }
        function ql(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0
            c = f[(b + 88) >> 2] | 0
            if (!c) {
                d = 0
                return d | 0
            }
            if ((f[c >> 2] | 0) != 2) {
                d = 0
                return d | 0
            }
            b = f[(c + 8) >> 2] | 0
            f[(a + 4) >> 2] = h[b >> 0] | (h[(b + 1) >> 0] << 8) | (h[(b + 2) >> 0] << 16) | (h[(b + 3) >> 0] << 24)
            d = 1
            return d | 0
        }
        function rl(a) {
            a = a | 0
            var b = 0
            if (!(f[(a + 44) >> 2] | 0)) {
                b = 0
                return b | 0
            }
            if (!(f[(a + 48) >> 2] | 0)) {
                b = 0
                return b | 0
            }
            if (!(f[(a + 52) >> 2] | 0)) {
                b = 0
                return b | 0
            }
            b = (f[(a + 56) >> 2] | 0) != 0
            return b | 0
        }
        function sl(a) {
            a = a | 0
            kj(a)
            br(a)
            return
        }
        function tl(a, c) {
            a = a | 0
            c = c | 0
            var d = 0
            if (f[(c + 56) >> 2] | 0) {
                d = 0
                return d | 0
            }
            if ((b[(c + 24) >> 0] | 0) != 3) {
                d = 0
                return d | 0
            }
            f[(a + 40) >> 2] = c
            d = 1
            return d | 0
        }
        function ul(a, c) {
            a = a | 0
            c = c | 0
            var d = 0
            if (f[(c + 56) >> 2] | 0) {
                d = 0
                return d | 0
            }
            if ((b[(c + 24) >> 0] | 0) != 3) {
                d = 0
                return d | 0
            }
            f[(a + 44) >> 2] = c
            d = 1
            return d | 0
        }
        function vl(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0
            c = (a + 4) | 0
            d = f[c >> 2] | 0
            e = f[a >> 2] | 0
            g = (d - e) | 0
            if (g >>> 0 < b >>> 0) {
                ri(a, (b - g) | 0)
                return
            }
            if (g >>> 0 <= b >>> 0) return
            g = (e + b) | 0
            if ((g | 0) == (d | 0)) return
            f[c >> 2] = g
            return
        }
        function wl(a, b, c, d, e) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = $(e)
            f[(a + 4) >> 2] = b
            Jf((a + 8) | 0, c, (c + (d << 2)) | 0)
            n[(a + 20) >> 2] = e
            return
        }
        function xl(a, b) {
            a = a | 0
            b = b | 0
            var c = 0
            if (!(Qa[f[((f[a >> 2] | 0) + 40) >> 2] & 127](a) | 0)) {
                c = 0
                return c | 0
            }
            if (!(Ra[f[((f[a >> 2] | 0) + 44) >> 2] & 127](a, b) | 0)) {
                c = 0
                return c | 0
            }
            c = Ra[f[((f[a >> 2] | 0) + 48) >> 2] & 127](a, b) | 0
            return c | 0
        }
        function yl(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0
            c = u
            u = (u + 16) | 0
            d = (c + 4) | 0
            e = c
            f[e >> 2] = 0
            f[d >> 2] = f[e >> 2]
            e = tc(a, b, d) | 0
            u = c
            return e | 0
        }
        function zl(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0
            d = f[c >> 2] | 0
            c = a
            e = (b - a) >> 2
            while (1) {
                if (!e) break
                a = ((e | 0) / 2) | 0
                b = (c + (a << 2)) | 0
                g = (f[b >> 2] | 0) >>> 0 < d >>> 0
                c = g ? (b + 4) | 0 : c
                e = g ? (e + -1 - a) | 0 : a
            }
            return c | 0
        }
        function Al(a) {
            a = a | 0
            var c = 0
            f[a >> 2] = 0
            c = (a + 8) | 0
            f[c >> 2] = 0
            f[(c + 4) >> 2] = 0
            f[(c + 8) >> 2] = 0
            f[(c + 12) >> 2] = 0
            b[(a + 24) >> 0] = 1
            f[(a + 28) >> 2] = 9
            c = (a + 40) | 0
            f[c >> 2] = 0
            f[(c + 4) >> 2] = 0
            f[(c + 8) >> 2] = 0
            f[(c + 12) >> 2] = 0
            f[(a + 56) >> 2] = -1
            f[(a + 60) >> 2] = 0
            return
        }
        function Bl(a) {
            a = a | 0
            mj(a)
            br(a)
            return
        }
        function Cl(a) {
            a = a | 0
            var c = 0,
                d = 0,
                e = 0,
                g = 0,
                h = 0
            if (!(Pq(b[f[a >> 2] >> 0] | 0) | 0)) c = 0
            else {
                d = 0
                while (1) {
                    e = f[a >> 2] | 0
                    g = (((d * 10) | 0) + -48 + (b[e >> 0] | 0)) | 0
                    h = (e + 1) | 0
                    f[a >> 2] = h
                    if (!(Pq(b[h >> 0] | 0) | 0)) {
                        c = g
                        break
                    } else d = g
                }
            }
            return c | 0
        }
        function Dl(a, c) {
            a = a | 0
            c = c | 0
            var d = 0
            if (f[(c + 56) >> 2] | 0) {
                d = 0
                return d | 0
            }
            if ((b[(c + 24) >> 0] | 0) != 3) {
                d = 0
                return d | 0
            }
            f[(a + 60) >> 2] = c
            d = 1
            return d | 0
        }
        function El(a, c) {
            a = a | 0
            c = c | 0
            var d = 0
            if (f[(c + 56) >> 2] | 0) {
                d = 0
                return d | 0
            }
            if ((b[(c + 24) >> 0] | 0) != 3) {
                d = 0
                return d | 0
            }
            f[(a + 64) >> 2] = c
            d = 1
            return d | 0
        }
        function Fl(a) {
            a = a | 0
            var b = 0,
                c = 0
            b = f[r >> 2] | 0
            c = (b + a) | 0
            if ((((a | 0) > 0) & ((c | 0) < (b | 0))) | ((c | 0) < 0)) {
                ea() | 0
                ya(12)
                return -1
            }
            f[r >> 2] = c
            if ((c | 0) > (da() | 0) ? (ca() | 0) == 0 : 0) {
                f[r >> 2] = b
                ya(12)
                return -1
            }
            return b | 0
        }
        function Gl(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0,
                f = 0
            if (((a | 0) == 0) & ((c | 0) == 0)) e = d
            else {
                f = d
                d = c
                c = a
                while (1) {
                    a = (f + -1) | 0
                    b[a >> 0] = (c & 7) | 48
                    c = Wn(c | 0, d | 0, 3) | 0
                    d = I
                    if (((c | 0) == 0) & ((d | 0) == 0)) {
                        e = a
                        break
                    } else f = a
                }
            }
            return e | 0
        }
        function Hl(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 1528
            b = f[(a + 32) >> 2] | 0
            if (!b) {
                br(a)
                return
            }
            c = (a + 36) | 0
            d = f[c >> 2] | 0
            if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
            br(b)
            br(a)
            return
        }
        function Il(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = g | 0
            if (qp(a, f[(b + 8) >> 2] | 0, g) | 0) fj(0, b, c, d, e)
            return
        }
        function Jl(a) {
            a = a | 0
            var b = 0,
                c = 0
            b = f[(a + 64) >> 2] | 0
            if (!b) return
            c = Qa[f[((f[b >> 2] | 0) + 32) >> 2] & 127](b) | 0
            if (!c) return
            f[(a + 60) >> 2] = ((((((f[(c + 4) >> 2] | 0) - (f[c >> 2] | 0)) >> 2) >>> 0) / 3) | 0) - (f[(c + 40) >> 2] | 0)
            return
        }
        function Kl(a) {
            a = a | 0
            Ii(a)
            br(a)
            return
        }
        function Ll(a) {
            a = a | 0
            var b = 0
            switch (a | 0) {
                case 11:
                case 2:
                case 1: {
                    b = 1
                    break
                }
                case 4:
                case 3: {
                    b = 2
                    break
                }
                case 6:
                case 5: {
                    b = 4
                    break
                }
                case 8:
                case 7: {
                    b = 8
                    break
                }
                case 9: {
                    b = 4
                    break
                }
                case 10: {
                    b = 8
                    break
                }
                default:
                    b = -1
            }
            return b | 0
        }
        function Ml() {
            var a = 0,
                b = 0
            a = dn(40) | 0
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            f[(a + 12) >> 2] = 0
            n[(a + 16) >> 2] = $(1.0)
            b = (a + 20) | 0
            f[b >> 2] = 0
            f[(b + 4) >> 2] = 0
            f[(b + 8) >> 2] = 0
            f[(b + 12) >> 2] = 0
            n[(a + 36) >> 2] = $(1.0)
            return a | 0
        }
        function Nl(a, b) {
            a = +a
            b = +b
            var c = 0,
                d = 0,
                e = 0
            p[s >> 3] = a
            c = f[s >> 2] | 0
            d = f[(s + 4) >> 2] | 0
            p[s >> 3] = b
            e = (f[(s + 4) >> 2] & -2147483648) | (d & 2147483647)
            f[s >> 2] = c
            f[(s + 4) >> 2] = e
            return +(+p[s >> 3])
        }
        function Ol(a, b, c) {
            a = a | 0
            b = b | 0
            c = +c
            var d = 0,
                e = 0
            d = u
            u = (u + 16) | 0
            e = d
            p[e >> 3] = c
            _b(a, b, e)
            u = d
            return
        }
        function Pl(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0
            d = u
            u = (u + 16) | 0
            e = d
            f[e >> 2] = c
            cc(a, b, e)
            u = d
            return
        }
        function Ql(a, c) {
            a = a | 0
            c = c | 0
            var d = 0,
                e = 0
            if ((a | 0) != (c | 0)) {
                d = b[(c + 11) >> 0] | 0
                e = (d << 24) >> 24 < 0
                Zi(a, e ? f[c >> 2] | 0 : c, e ? f[(c + 4) >> 2] | 0 : d & 255) | 0
            }
            return a | 0
        }
        function Rl(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0,
                f = 0
            c = a & 65535
            d = b & 65535
            e = X(d, c) | 0
            f = a >>> 16
            a = ((e >>> 16) + (X(d, f) | 0)) | 0
            d = b >>> 16
            b = X(d, c) | 0
            return ((I = ((a >>> 16) + (X(d, f) | 0) + ((((a & 65535) + b) | 0) >>> 16)) | 0), ((a + b) << 16) | (e & 65535) | 0) | 0
        }
        function Sl(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0
            c = vj(b) | 0
            d = dn((c + 13) | 0) | 0
            f[d >> 2] = c
            f[(d + 4) >> 2] = c
            f[(d + 8) >> 2] = 0
            e = Sp(d) | 0
            Rg(e | 0, b | 0, (c + 1) | 0) | 0
            f[a >> 2] = e
            return
        }
        function Tl(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0
            if (((b | 0) == -1) | ((b | 0) > 4)) {
                c = -1
                return c | 0
            }
            d = f[(a + 20 + ((b * 12) | 0)) >> 2] | 0
            if ((((f[(a + 20 + ((b * 12) | 0) + 4) >> 2] | 0) - d) | 0) <= 0) {
                c = -1
                return c | 0
            }
            c = f[d >> 2] | 0
            return c | 0
        }
        function Ul(a) {
            a = a | 0
            Li(a)
            br(a)
            return
        }
        function Vl(a) {
            a = a | 0
            var b = 0,
                c = 0
            f[a >> 2] = 1528
            b = f[(a + 32) >> 2] | 0
            if (!b) return
            c = (a + 36) | 0
            a = f[c >> 2] | 0
            if ((a | 0) != (b | 0)) f[c >> 2] = a + (~(((a + -4 - b) | 0) >>> 2) << 2)
            br(b)
            return
        }
        function Wl(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            if (qp(a, f[(b + 8) >> 2] | 0, 0) | 0) tk(0, b, c, d)
            return
        }
        function Xl(a, c, d) {
            a = a | 0
            c = c | 0
            d = d | 0
            var e = 0
            if (((c | 0) < (a | 0)) & ((a | 0) < ((c + d) | 0))) {
                e = a
                c = (c + d) | 0
                a = (a + d) | 0
                while ((d | 0) > 0) {
                    a = (a - 1) | 0
                    c = (c - 1) | 0
                    d = (d - 1) | 0
                    b[a >> 0] = b[c >> 0] | 0
                }
                a = e
            } else Rg(a, c, d) | 0
            return a | 0
        }
        function Yl(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            f[a >> 2] = 1180
            b = f[(a + 8) >> 2] | 0
            if (!b) {
                br(a)
                return
            }
            c = (a + 12) | 0
            d = f[c >> 2] | 0
            if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
            br(b)
            br(a)
            return
        }
        function Zl(a) {
            a = a | 0
            var b = 0
            f[a >> 2] = 2740
            b = f[(a + 56) >> 2] | 0
            if (!b) {
                br(a)
                return
            }
            br(b)
            br(a)
            return
        }
        function _l(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0
            d = u
            u = (u + 16) | 0
            e = d
            f[e >> 2] = f[c >> 2]
            g = Sa[f[((f[a >> 2] | 0) + 16) >> 2] & 31](a, b, e) | 0
            if (g) f[c >> 2] = f[e >> 2]
            u = d
            return (g & 1) | 0
        }
        function $l(a, b) {
            a = a | 0
            b = b | 0
            var c = 0
            if (b >>> 0 >= 2) {
                c = 0
                return c | 0
            }
            f[(a + 28) >> 2] = b
            c = 1
            return c | 0
        }
        function am(a) {
            a = a | 0
            var b = 0,
                c = 0
            f[a >> 2] = 3e3
            b = (a + 64) | 0
            c = f[b >> 2] | 0
            f[b >> 2] = 0
            if (!c) {
                aj(a)
                return
            }
            Va[f[((f[c >> 2] | 0) + 4) >> 2] & 127](c)
            aj(a)
            return
        }
        function bm() {
            var a = 0,
                b = 0
            a = mn() | 0
            if ((a | 0 ? ((b = f[a >> 2] | 0), b | 0) : 0) ? ((a = (b + 48) | 0), ((f[a >> 2] & -256) | 0) == 1126902528 ? (f[(a + 4) >> 2] | 0) == 1129074247 : 0) : 0) Qo(f[(b + 12) >> 2] | 0)
            Qo(bq() | 0)
        }
        function cm(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            return Bf(a, b, c, d, e, f, 6) | 0
        }
        function dm(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            return Af(a, b, c, d, e, f, 4) | 0
        }
        function em(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            return Gf(a, b, c, d, e, f, 2) | 0
        }
        function fm(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            return Af(a, b, c, d, e, f, 3) | 0
        }
        function gm(a) {
            a = a | 0
            var b = 0
            f[a >> 2] = 2488
            b = f[(a + 56) >> 2] | 0
            if (!b) {
                br(a)
                return
            }
            br(b)
            br(a)
            return
        }
        function hm(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            return Gf(a, b, c, d, e, f, 1) | 0
        }
        function im(a) {
            a = a | 0
            var c = 0
            c = b[(w + (a & 255)) >> 0] | 0
            if ((c | 0) < 8) return c | 0
            c = b[(w + ((a >> 8) & 255)) >> 0] | 0
            if ((c | 0) < 8) return (c + 8) | 0
            c = b[(w + ((a >> 16) & 255)) >> 0] | 0
            if ((c | 0) < 8) return (c + 16) | 0
            return ((b[(w + (a >>> 24)) >> 0] | 0) + 24) | 0
        }
        function jm(a, b) {
            a = a | 0
            b = b | 0
            var c = 0.0,
                d = 0.0,
                e = 0.0,
                f = 0.0
            if (!a) {
                c = 0.0
                return +c
            }
            if (((b | 0) == 0) | ((a | 0) == (b | 0))) {
                c = 0.0
                return +c
            }
            d = +(b >>> 0) / +(a >>> 0)
            e = 1.0 - d
            f = d * +Fg(d)
            c = -(f + e * +Fg(e))
            return +c
        }
        function km(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0
            if ((b | 0) > 0) d = 0
            else return
            do {
                e = f[(a + (d << 2)) >> 2] | 0
                f[(c + (d << 2)) >> 2] = (e << 1) ^ (e >> 31)
                d = (d + 1) | 0
            } while ((d | 0) != (b | 0))
            return
        }
        function lm(a) {
            a = a | 0
            var b = 0,
                c = 0
            if (Eq(a) | 0 ? ((b = Zp(f[a >> 2] | 0) | 0), (a = (b + 8) | 0), (c = f[a >> 2] | 0), (f[a >> 2] = c + -1), ((c + -1) | 0) < 0) : 0) br(b)
            return
        }
        function mm(a) {
            a = a | 0
            var b = 0
            Ao(a)
            f[a >> 2] = 2880
            f[(a + 40) >> 2] = 1180
            f[(a + 44) >> 2] = -1
            b = (a + 48) | 0
            f[b >> 2] = 0
            f[(b + 4) >> 2] = 0
            f[(b + 8) >> 2] = 0
            f[(b + 12) >> 2] = 0
            return
        }
        function nm(a, c) {
            a = a | 0
            c = c | 0
            var d = 0
            b[(c + 84) >> 0] = 1
            a = f[(c + 68) >> 2] | 0
            d = (c + 72) | 0
            c = f[d >> 2] | 0
            if ((c | 0) == (a | 0)) return 1
            f[d >> 2] = c + (~(((c + -4 - a) | 0) >>> 2) << 2)
            return 1
        }
        function om(a) {
            a = a | 0
            var b = 0,
                c = 0
            b = f[(a + 16) >> 2] | 0
            c = ((((((f[(a + 12) >> 2] | 0) + 1 - b) | 0) / 64) | 0) + b) << 3
            a = b << 3
            b = Tn(c | 0, ((((c | 0) < 0) << 31) >> 31) | 0, a | 0, ((((a | 0) < 0) << 31) >> 31) | 0) | 0
            return b | 0
        }
        function pm(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            return Bf(a, b, c, d, e, f, 5) | 0
        }
        function qm(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            return Bf(a, b, c, d, e, f, 9) | 0
        }
        function rm(a) {
            a = a | 0
            var b = 0
            f[a >> 2] = 3208
            b = f[(a + 36) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 24) >> 2] | 0
            if (!b) {
                br(a)
                return
            }
            br(b)
            br(a)
            return
        }
        function sm(a) {
            a = a | 0
            var b = 0
            f[a >> 2] = 2740
            b = f[(a + 56) >> 2] | 0
            if (!b) return
            br(b)
            return
        }
        function tm(a) {
            a = a | 0
            var b = 0,
                c = 0
            f[a >> 2] = 1460
            b = (a + 36) | 0
            c = f[b >> 2] | 0
            f[b >> 2] = 0
            if (c | 0) Va[f[((f[c >> 2] | 0) + 4) >> 2] & 127](c)
            zi(a)
            br(a)
            return
        }
        function um(a) {
            a = a | 0
            var b = 0,
                c = 0
            f[a >> 2] = 1180
            b = f[(a + 8) >> 2] | 0
            if (!b) return
            c = (a + 12) | 0
            a = f[c >> 2] | 0
            if ((a | 0) != (b | 0)) f[c >> 2] = a + (~(((a + -4 - b) | 0) >>> 2) << 2)
            br(b)
            return
        }
        function vm(a) {
            a = a | 0
            var b = 0
            f[a >> 2] = 3276
            b = f[(a + 36) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 24) >> 2] | 0
            if (!b) {
                br(a)
                return
            }
            br(b)
            br(a)
            return
        }
        function wm(a) {
            a = a | 0
            var c = 0
            f[a >> 2] = 1336
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            f[(a + 12) >> 2] = -1
            c = (a + 16) | 0
            f[(a + 32) >> 2] = 0
            f[c >> 2] = 0
            f[(c + 4) >> 2] = 0
            f[(c + 8) >> 2] = 0
            b[(c + 12) >> 0] = 0
            return
        }
        function xm(a) {
            a = a | 0
            f[a >> 2] = 3296
            Gi((a + 8) | 0)
            br(a)
            return
        }
        function ym(a) {
            a = a | 0
            var b = 0
            f[a >> 2] = 2488
            b = f[(a + 56) >> 2] | 0
            if (!b) return
            br(b)
            return
        }
        function zm(a) {
            a = a | 0
            var b = 0,
                c = 0
            f[a >> 2] = 1460
            b = (a + 36) | 0
            c = f[b >> 2] | 0
            f[b >> 2] = 0
            if (c | 0) Va[f[((f[c >> 2] | 0) + 4) >> 2] & 127](c)
            zi(a)
            return
        }
        function Am(a, b) {
            a = a | 0
            b = b | 0
            f[a >> 2] = 2968
            Vh((a + 4) | 0)
            f[(a + 40) >> 2] = 0
            f[(a + 44) >> 2] = 0
            f[a >> 2] = 2984
            f[(a + 48) >> 2] = b
            f[(a + 52) >> 2] = 0
            return
        }
        function Bm(a) {
            a = a | 0
            var b = 0,
                c = 0
            f[a >> 2] = 3e3
            b = (a + 64) | 0
            c = f[b >> 2] | 0
            f[b >> 2] = 0
            if (c | 0) Va[f[((f[c >> 2] | 0) + 4) >> 2] & 127](c)
            aj(a)
            br(a)
            return
        }
        function Cm(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            b = f[a >> 2] | 0
            c = (a + 4) | 0
            d = f[c >> 2] | 0
            if ((d | 0) != (b | 0)) f[c >> 2] = d + (~(((d + -4 - b) | 0) >>> 2) << 2)
            f[(a + 12) >> 2] = 0
            f[(a + 16) >> 2] = 0
            return
        }
        function Dm(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            var d = 0,
                e = 0,
                g = 0
            d = (a + 20) | 0
            e = f[d >> 2] | 0
            g = ((f[(a + 16) >> 2] | 0) - e) | 0
            a = g >>> 0 > c >>> 0 ? c : g
            Rg(e | 0, b | 0, a | 0) | 0
            f[d >> 2] = (f[d >> 2] | 0) + a
            return c | 0
        }
        function Em(a) {
            a = a | 0
            var b = 0
            f[a >> 2] = 3208
            b = f[(a + 36) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 24) >> 2] | 0
            if (!b) return
            br(b)
            return
        }
        function Fm(a) {
            a = a | 0
            f[a >> 2] = 3296
            Gi((a + 8) | 0)
            return
        }
        function Gm(a, b) {
            a = a | 0
            b = b | 0
            f[a >> 2] = 2968
            Vh((a + 4) | 0)
            f[(a + 40) >> 2] = 0
            f[(a + 44) >> 2] = 0
            f[a >> 2] = 2984
            f[(a + 48) >> 2] = b
            f[(a + 52) >> 2] = b
            return
        }
        function Hm(a) {
            a = a | 0
            var b = 0,
                c = 0
            b = f[a >> 2] | 0
            if (!b) return
            c = (a + 4) | 0
            a = f[c >> 2] | 0
            if ((a | 0) != (b | 0)) f[c >> 2] = a + (~(((a + -8 - b) | 0) >>> 3) << 3)
            br(b)
            return
        }
        function Im(a) {
            a = a | 0
            var b = 0,
                c = 0
            b = f[a >> 2] | 0
            if (!b) return
            c = (a + 4) | 0
            a = f[c >> 2] | 0
            if ((a | 0) != (b | 0)) f[c >> 2] = a + (~(((a + -4 - b) | 0) >>> 2) << 2)
            br(b)
            return
        }
        function Jm(a, b) {
            a = a | 0
            b = b | 0
            var c = 0
            c = f[b >> 2] | 0
            return ((((1 << (c & 31)) & f[((f[(a + 28) >> 2] | 0) + ((c >>> 5) << 2)) >> 2]) | 0) != 0) | 0
        }
        function Km(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            return Sa[f[((f[a >> 2] | 0) + 44) >> 2] & 31](a, b, c) | 0
        }
        function Lm(a) {
            a = a | 0
            var c = 0
            Al(a)
            c = (a + 64) | 0
            f[(a + 88) >> 2] = 0
            f[c >> 2] = 0
            f[(c + 4) >> 2] = 0
            f[(c + 8) >> 2] = 0
            f[(c + 12) >> 2] = 0
            f[(c + 16) >> 2] = 0
            b[(c + 20) >> 0] = 0
            return
        }
        function Mm(a) {
            a = a | 0
            f[a >> 2] = 2796
            tj((a + 88) | 0)
            br(a)
            return
        }
        function Nm(a) {
            a = a | 0
            var b = 0
            f[a >> 2] = 3276
            b = f[(a + 36) >> 2] | 0
            if (b | 0) br(b)
            b = f[(a + 24) >> 2] | 0
            if (!b) return
            br(b)
            return
        }
        function Om(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            if ((f[(b + 4) >> 2] | 0) == (c | 0) ? ((c = (b + 28) | 0), (f[c >> 2] | 0) != 1) : 0) f[c >> 2] = d
            return
        }
        function Pm(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = $(f)
            pg(a, b, c, d, e, f)
            return
        }
        function Qm(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            b = u
            u = (u + 16) | 0
            c = b
            if ((uk(a) | 0) == 0 ? (Sa[f[(a + 32) >> 2] & 31](a, c, 1) | 0) == 1 : 0) d = h[c >> 0] | 0
            else d = -1
            u = b
            return d | 0
        }
        function Rm(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0,
                e = 0
            f[(a + 104) >> 2] = b
            c = f[(a + 8) >> 2] | 0
            d = f[(a + 4) >> 2] | 0
            e = (c - d) | 0
            f[(a + 108) >> 2] = e
            f[(a + 100) >> 2] = ((b | 0) != 0) & ((e | 0) > (b | 0)) ? (d + b) | 0 : c
            return
        }
        function Sm(a) {
            a = a | 0
            var b = 0
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            b = (a + 16) | 0
            f[b >> 2] = 0
            f[(b + 4) >> 2] = 0
            f[(b + 8) >> 2] = 0
            f[(b + 12) >> 2] = 0
            f[(b + 16) >> 2] = 0
            return
        }
        function Tm(a, b, c, d, e, g) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            g = $(g)
            pg(f[a >> 2] | 0, b, c, d, e, g)
            return
        }
        function Um(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = $(f)
            Pm(a, b, c, d, e, f)
            return
        }
        function Vm(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            return cm(a, b, c, d, e, f) | 0
        }
        function Wm(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            return dm(a, b, c, d, e, f) | 0
        }
        function Xm(a) {
            a = a | 0
            var b = 0,
                c = 0
            if (!a) return
            b = f[a >> 2] | 0
            if (b | 0) {
                c = (a + 4) | 0
                if ((f[c >> 2] | 0) != (b | 0)) f[c >> 2] = b
                br(b)
            }
            br(a)
            return
        }
        function Ym(a) {
            a = a | 0
            f[a >> 2] = 2544
            tj((a + 88) | 0)
            br(a)
            return
        }
        function Zm(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            return em(a, b, c, d, e, f) | 0
        }
        function _m(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            return fm(a, b, c, d, e, f) | 0
        }
        function $m(a) {
            a = a | 0
            f[a >> 2] = 2796
            tj((a + 88) | 0)
            return
        }
        function an(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0
            e = u
            u = (u + 16) | 0
            g = e | 0
            Bd(a, b, c, d, g) | 0
            u = e
            return ((I = f[(g + 4) >> 2] | 0), f[g >> 2] | 0) | 0
        }
        function bn(a) {
            a = a | 0
            var b = 0
            $n(a)
            f[a >> 2] = 5840
            b = (a + 84) | 0
            f[b >> 2] = 0
            f[(b + 4) >> 2] = 0
            f[(b + 8) >> 2] = 0
            f[(b + 12) >> 2] = 0
            f[(b + 16) >> 2] = 0
            f[(b + 20) >> 2] = 0
            return
        }
        function cn(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            return hm(a, b, c, d, e, f) | 0
        }
        function dn(a) {
            a = a | 0
            var b = 0,
                c = 0
            b = (a | 0) == 0 ? 1 : a
            while (1) {
                a = $a(b) | 0
                if (a | 0) {
                    c = a
                    break
                }
                a = $p() | 0
                if (!a) {
                    c = 0
                    break
                }
                Ua[a & 3]()
            }
            return c | 0
        }
        function en(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            ac(a, b, c)
            return
        }
        function fn(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            f[(a + 4) >> 2] = b
            f[(a + 8) >> 2] = f[((f[((f[(b + 4) >> 2] | 0) + 8) >> 2] | 0) + (c << 2)) >> 2]
            f[(a + 12) >> 2] = c
            return 1
        }
        function gn(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            return pm(a, b, c, d, e, f) | 0
        }
        function hn(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            return qm(a, b, c, d, e, f) | 0
        }
        function jn(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = $(f)
            Tm(a, b, c, d, e, f)
            return
        }
        function kn(a) {
            a = a | 0
            f[a >> 2] = 2544
            tj((a + 88) | 0)
            return
        }
        function ln(a) {
            a = a | 0
            var b = 0,
                c = 0,
                d = 0
            b = u
            u = (u + 16) | 0
            c = b
            d = dr(f[(a + 60) >> 2] | 0) | 0
            f[c >> 2] = d
            d = ro(Ba(6, c | 0) | 0) | 0
            u = b
            return d | 0
        }
        function mn() {
            var a = 0,
                b = 0
            a = u
            u = (u + 16) | 0
            if (!(Ka(18612, 3) | 0)) {
                b = Ia(f[4654] | 0) | 0
                u = a
                return b | 0
            } else Dn(17746, a)
            return 0
        }
        function nn(a) {
            a = a | 0
            var b = 0
            if (!a) return
            b = f[a >> 2] | 0
            f[a >> 2] = 0
            if (b | 0) Va[f[((f[b >> 2] | 0) + 4) >> 2] & 127](b)
            br(a)
            return
        }
        function on(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0,
                f = 0
            e = a
            a = c
            c = Rl(e, a) | 0
            f = I
            return ((I = ((X(b, a) | 0) + (X(d, e) | 0) + f) | (f & 0)), c | 0 | 0) | 0
        }
        function pn(a, b) {
            a = a | 0
            b = b | 0
            Sg(a, b)
            f[a >> 2] = 1276
            b = (a + 36) | 0
            a = (b + 40) | 0
            do {
                f[b >> 2] = 0
                b = (b + 4) | 0
            } while ((b | 0) < (a | 0))
            return
        }
        function qn(a) {
            a = a | 0
            Gi(a)
            br(a)
            return
        }
        function rn(a) {
            a = a | 0
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            f[(a + 12) >> 2] = 0
            f[(a + 16) >> 2] = 0
            f[(a + 20) >> 2] = 0
            f[(a + 24) >> 2] = 0
            f[(a + 28) >> 2] = 0
            return
        }
        function sn(a) {
            a = a | 0
            var b = 0
            b = u
            u = (u + 16) | 0
            wc(a)
            if (!(La(f[4654] | 0, 0) | 0)) {
                u = b
                return
            } else Dn(17845, b)
        }
        function tn(a) {
            a = a | 0
            var b = 0
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            b = (a + 16) | 0
            f[b >> 2] = 0
            f[(b + 4) >> 2] = 0
            f[(b + 8) >> 2] = 0
            f[(b + 12) >> 2] = 0
            return
        }
        function un(a, b) {
            a = a | 0
            b = b | 0
            return eg((a + 40) | 0, b) | 0
        }
        function vn(a, b) {
            a = a | 0
            b = b | 0
            return $i(a, b, Aq(b) | 0) | 0
        }
        function wn(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0,
                g = 0
            e = u
            u = (u + 16) | 0
            g = e
            f[g >> 2] = d
            d = Mi(a, b, c, g) | 0
            u = e
            return d | 0
        }
        function xn(a, b) {
            a = a | 0
            b = b | 0
            return Aj((a + 40) | 0, b) | 0
        }
        function yn(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            return zh(a, b, c, d) | 0
        }
        function zn(a) {
            a = a | 0
            var b = 0
            f[a >> 2] = 3608
            f[(a + 52) >> 2] = 0
            b = (a + 4) | 0
            a = (b + 44) | 0
            do {
                f[b >> 2] = 0
                b = (b + 4) | 0
            } while ((b | 0) < (a | 0))
            return
        }
        function An(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            return $g(a, b, c, d) | 0
        }
        function Bn(a, b) {
            a = a | 0
            b = b | 0
            var c = 0
            c = f[(a + 64) >> 2] | 0
            return Ra[f[((f[c >> 2] | 0) + 24) >> 2] & 127](c, b) | 0
        }
        function Cn(a) {
            a = a | 0
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            f[(a + 12) >> 2] = 0
            f[(a + 16) >> 2] = 0
            f[(a + 20) >> 2] = 0
            b[(a + 24) >> 0] = 0
            return
        }
        function Dn(a, b) {
            a = a | 0
            b = b | 0
            var c = 0,
                d = 0
            c = u
            u = (u + 16) | 0
            d = c
            f[d >> 2] = b
            b = f[1478] | 0
            hh(b, a, d) | 0
            zj(10, b) | 0
            Ca()
        }
        function En(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
            return Ta[a & 31](b | 0, c | 0, d | 0, e | 0, f | 0, g | 0) | 0
        }
        function Fn(a) {
            a = a | 0
            var b = 0
            b = f[(a + 56) >> 2] | 0
            f[(a + 60) >> 2] = ((((f[(b + 100) >> 2] | 0) - (f[(b + 96) >> 2] | 0)) | 0) / 12) | 0
            return
        }
        function Gn(a, b) {
            a = a | 0
            b = b | 0
            var c = 0
            c = f[(a + 64) >> 2] | 0
            return Ra[f[((f[c >> 2] | 0) + 16) >> 2] & 127](c, b) | 0
        }
        function Hn(a, b) {
            a = a | 0
            b = b | 0
            var c = 0
            c = f[(a + 64) >> 2] | 0
            return Ra[f[((f[c >> 2] | 0) + 20) >> 2] & 127](c, b) | 0
        }
        function In(a, b) {
            a = a | 0
            b = b | 0
            var c = 0
            c = f[(a + 64) >> 2] | 0
            return Ra[f[((f[c >> 2] | 0) + 12) >> 2] & 127](c, b) | 0
        }
        function Jn() {
            var a = 0
            a = u
            u = (u + 16) | 0
            if (!(Ja(18616, 117) | 0)) {
                u = a
                return
            } else Dn(17795, a)
        }
        function Kn(a) {
            a = a | 0
            f[a >> 2] = 1136
            Vh((a + 4) | 0)
            f[(a + 40) >> 2] = 0
            f[(a + 44) >> 2] = 0
            f[a >> 2] = 2944
            return
        }
        function Ln(a) {
            a = a | 0
            Se(a)
            br(a)
            return
        }
        function Mn(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
            _a[a & 3](b | 0, c | 0, d | 0, e | 0, f | 0, g | 0)
        }
        function Nn(a, b) {
            a = a | 0
            b = b | 0
            var c = 0
            c = f[(b + 64) >> 2] | 0
            Wa[f[((f[c >> 2] | 0) + 28) >> 2] & 15](a, c)
            return
        }
        function On(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            if (b | 0) hj(a | 0, ((zq(c) | 0) & 255) | 0, b | 0) | 0
            return a | 0
        }
        function Pn(a) {
            a = a | 0
            return 4
        }
        function Qn(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            return Ui(0, b, c) | 0
        }
        function Rn(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            if ((c | 0) < 32) {
                I = (b << c) | ((a & (((1 << c) - 1) << (32 - c))) >>> (32 - c))
                return a << c
            }
            I = a << (c - 32)
            return 0
        }
        function Sn() {}
        function Tn(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0
            e = (a + c) >>> 0
            return ((I = (b + d + ((e >>> 0 < a >>> 0) | 0)) >>> 0), e | 0) | 0
        }
        function Un(a, b) {
            a = a | 0
            b = b | 0
            var c = 0
            if (!b) c = 0
            else c = lh(f[b >> 2] | 0, f[(b + 4) >> 2] | 0, a) | 0
            return (c | 0 ? c : a) | 0
        }
        function Vn(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            var e = 0
            e = (b - d) >>> 0
            e = (b - d - ((c >>> 0 > a >>> 0) | 0)) >>> 0
            return ((I = e), ((a - c) >>> 0) | 0) | 0
        }
        function Wn(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            if ((c | 0) < 32) {
                I = b >>> c
                return (a >>> c) | ((b & ((1 << c) - 1)) << (32 - c))
            }
            I = 0
            return (b >>> (c - 32)) | 0
        }
        function Xn(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            return qe(a, b, c, d) | 0
        }
        function Yn(a) {
            a = a | 0
            Ve(a)
            br(a)
            return
        }
        function Zn(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = +d
            return Oi(a, b, c, d) | 0
        }
        function _n(a) {
            a = a | 0
            return 5
        }
        function $n(a) {
            a = a | 0
            var b = 0
            f[a >> 2] = 5880
            b = (a + 4) | 0
            a = (b + 80) | 0
            do {
                f[b >> 2] = 0
                b = (b + 4) | 0
            } while ((b | 0) < (a | 0))
            return
        }
        function ao(a) {
            a = a | 0
            return 6
        }
        function bo(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            return Pi(a, b, c, d) | 0
        }
        function co(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            Fj(a, b, c)
            return
        }
        function eo(a, b) {
            a = a | 0
            b = b | 0
            xi(f[a >> 2] | 0, b)
            return
        }
        function fo(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            co(a, b, c)
            return
        }
        function go(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            He(a, b, c, d, 1)
            return
        }
        function ho(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            He(a, b, c, d, 0)
            return
        }
        function io(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            return Eg(a, b, c, d) | 0
        }
        function jo(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            return Qh(a, b, c) | 0
        }
        function ko(a) {
            a = a | 0
            var b = 0
            b = f[(a + 64) >> 2] | 0
            return Qa[f[((f[b >> 2] | 0) + 32) >> 2] & 127](b) | 0
        }
        function lo(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            f[(a + 28) >> 2] = b
            f[(a + 32) >> 2] = c
            return 1
        }
        function mo(a, b) {
            a = a | 0
            b = b | 0
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            f[(a + 12) >> 2] = 0
            return
        }
        function no(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            Fj(f[a >> 2] | 0, b, c)
            return
        }
        function oo(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            return Ui(a, b, c) | 0
        }
        function po(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            return Qn(a, b, c) | 0
        }
        function qo(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            Za[a & 3](b | 0, c | 0, d | 0, e | 0, f | 0)
        }
        function ro(a) {
            a = a | 0
            var b = 0,
                c = 0
            if (a >>> 0 > 4294963200) {
                b = ir() | 0
                f[b >> 2] = 0 - a
                c = -1
            } else c = a
            return c | 0
        }
        function so(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            return rh(a, b, c) | 0
        }
        function to(a) {
            a = a | 0
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            f[(a + 12) >> 2] = 0
            f[(a + 16) >> 2] = 0
            return
        }
        function uo(a, b) {
            a = a | 0
            b = b | 0
            f[(a + 8) >> 2] = b
            f[(a + 12) >> 2] = -1
            return 1
        }
        function vo(a, b) {
            a = a | 0
            b = b | 0
            f[(a + 56) >> 2] = b
            tp(a, b)
            return
        }
        function wo(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            no(a, b, c)
            return
        }
        function xo(a) {
            a = +a
            var b = 0
            p[s >> 3] = a
            b = f[s >> 2] | 0
            I = f[(s + 4) >> 2] | 0
            return b | 0
        }
        function yo(a, b, c) {
            a = a | 0
            b = $(b)
            c = c | 0
            var d = Oa
            d = $($(c | 0) / b)
            n[a >> 2] = d
            return
        }
        function zo(a, b) {
            a = a | 0
            b = b | 0
            xi(a, b)
            return
        }
        function Ao(a) {
            a = a | 0
            wm(a)
            f[a >> 2] = 1460
            f[(a + 36) >> 2] = 0
            return
        }
        function Bo(a) {
            a = a | 0
            zn(a)
            f[a >> 2] = 3424
            f[(a + 56) >> 2] = 0
            f[(a + 60) >> 2] = 0
            return
        }
        function Co(a) {
            a = a | 0
            var b = 0
            if (!a) b = 0
            else b = ((mh(a, 1024, 1112, 0) | 0) != 0) & 1
            return b | 0
        }
        function Do(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            Eo(f[a >> 2] | 0, b, c)
            return
        }
        function Eo(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            Fi((a + 4) | 0, b, c)
            return
        }
        function Fo(a) {
            a = a | 0
            var b = 0
            b = dn(8) | 0
            ck(b, a)
            return b | 0
        }
        function Go(a) {
            a = a | 0
            if ((b[(a + 11) >> 0] | 0) < 0) br(f[a >> 2] | 0)
            return
        }
        function Ho(a) {
            a = a | 0
            if (!a) return
            Va[f[((f[a >> 2] | 0) + 4) >> 2] & 127](a)
            return
        }
        function Io(a, b, c, d, e) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            Ya[a & 7](b | 0, c | 0, d | 0, e | 0)
        }
        function Jo(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            if (c | 0) Xl(a | 0, b | 0, c | 0) | 0
            return a | 0
        }
        function Ko(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            Do(a, b, c)
            return
        }
        function Lo(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            if (c | 0) Rg(a | 0, b | 0, c | 0) | 0
            return a | 0
        }
        function Mo(a) {
            a = a | 0
            f[(a + 52) >> 2] = f[((f[(a + 4) >> 2] | 0) + 80) >> 2]
            return
        }
        function No(a, b) {
            a = a | 0
            b = b | 0
            eo(a, b)
            return
        }
        function Oo(a) {
            a = a | 0
            f[(a + 52) >> 2] = f[((f[(a + 56) >> 2] | 0) + 80) >> 2]
            return
        }
        function Po(a, b) {
            a = a | 0
            b = b | 0
            return -1
        }
        function Qo(a) {
            a = a | 0
            var b = 0
            b = u
            u = (u + 16) | 0
            Ua[a & 3]()
            Dn(17898, b)
        }
        function Ro(a) {
            a = a | 0
            wh(a)
            br(a)
            return
        }
        function So(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            $o(a, b, c)
            return
        }
        function To(a, b) {
            a = a | 0
            b = b | 0
            bk(f[a >> 2] | 0, b)
            return
        }
        function Uo(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            return Sa[a & 31](b | 0, c | 0, d | 0) | 0
        }
        function Vo(a, b) {
            a = a | 0
            b = b | 0
            return (((Jp(a, b) | 0) << 24) >> 24) | 0
        }
        function Wo(a, b) {
            a = a | 0
            b = b | 0
            f[a >> 2] = 6924
            Sl((a + 4) | 0, b)
            return
        }
        function Xo(a) {
            a = a | 0
            Bo(a)
            f[a >> 2] = 3e3
            f[(a + 64) >> 2] = 0
            return
        }
        function Yo(a, b) {
            a = a | 0
            b = b | 0
            var c = 0
            if (!a) c = 0
            else c = Bi(a, b, 0) | 0
            return c | 0
        }
        function Zo(a, b) {
            a = a | 0
            b = b | 0
            zo(a, b)
            return
        }
        function _o(a) {
            a = a | 0
            return f[(a + 12) >> 2] | 0
        }
        function $o(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            Eo(a, b, c)
            return
        }
        function ap() {
            var a = 0
            a = dn(64) | 0
            Al(a)
            return a | 0
        }
        function bp(a, b) {
            a = a | 0
            b = b | 0
            To(a, b)
            return
        }
        function cp(a) {
            a = a | 0
            if (!a) return
            Qi(a)
            br(a)
            return
        }
        function dp(a) {
            a = a | 0
            return f[(a + 4) >> 2] | 0
        }
        function ep(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            if (!(f[a >> 2] & 32)) ai(b, c, a) | 0
            return
        }
        function fp(a) {
            a = a | 0
            return Mp(a) | 0
        }
        function gp(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            Xa[a & 15](b | 0, c | 0, d | 0)
        }
        function hp() {
            var a = 0
            a = dn(96) | 0
            Lm(a)
            return a | 0
        }
        function ip(a) {
            a = a | 0
            return Np(a) | 0
        }
        function jp(a) {
            a = a | 0
            var b = 0
            b = u
            u = (u + a) | 0
            u = (u + 15) & -16
            return b | 0
        }
        function kp(a) {
            a = a | 0
            var b = 0
            b = ((Yq() | 0) + 188) | 0
            return Tj(a, f[b >> 2] | 0) | 0
        }
        function lp(a) {
            a = a | 0
            return ((((f[(a + 100) >> 2] | 0) - (f[(a + 96) >> 2] | 0)) | 0) / 12) | 0 | 0
        }
        function mp(a, b) {
            a = a | 0
            b = b | 0
            vp(a, b)
            return
        }
        function np(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            aa(3)
            return 0
        }
        function op() {
            var a = 0
            a = dn(12) | 0
            Bp(a)
            return a | 0
        }
        function pp(a) {
            a = a | 0
            zi(a)
            br(a)
            return
        }
        function qp(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            return ((a | 0) == (b | 0)) | 0
        }
        function rp(a, b) {
            a = a | 0
            b = b | 0
            var c = 0
            c = Fp(a | 0) | 0
            return ((b | 0) == 0 ? a : c) | 0
        }
        function sp(a) {
            a = a | 0
            return (((f[(a + 12) >> 2] | 0) - (f[(a + 8) >> 2] | 0)) >> 2) | 0
        }
        function tp(a, b) {
            a = a | 0
            b = b | 0
            f[(a + 4) >> 2] = b
            return
        }
        function up(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            return Bd(a, b, c, d, 0) | 0
        }
        function vp(a, b) {
            a = a | 0
            b = b | 0
            bk(a, b)
            return
        }
        function wp(a) {
            a = a | 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            f[a >> 2] = a + 4
            return
        }
        function xp(a) {
            a = a | 0
            return nq(a) | 0
        }
        function yp() {
            var a = 0
            a = dn(84) | 0
            $n(a)
            return a | 0
        }
        function zp(a) {
            a = a | 0
            gi(a)
            br(a)
            return
        }
        function Ap(a) {
            a = a | 0
            return oq(a) | 0
        }
        function Bp(a) {
            a = a | 0
            f[a >> 2] = 0
            f[(a + 4) >> 2] = 0
            f[(a + 8) >> 2] = 0
            return
        }
        function Cp(a) {
            a = a | 0
            f[a >> 2] = 6924
            lm((a + 4) | 0)
            return
        }
        function Dp(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            return Ra[a & 127](b | 0, c | 0) | 0
        }
        function Ep(a, b, c, d, e, f) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            f = f | 0
            aa(10)
        }
        function Fp(a) {
            a = a | 0
            return ((a & 255) << 24) | (((a >> 8) & 255) << 16) | (((a >> 16) & 255) << 8) | (a >>> 24) | 0
        }
        function Gp(a) {
            a = a | 0
            Bo(a)
            f[a >> 2] = 3504
            return
        }
        function Hp(a, c) {
            a = a | 0
            c = c | 0
            b[a >> 0] = b[c >> 0] | 0
            return
        }
        function Ip(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            return -1
        }
        function Jp(a, c) {
            a = a | 0
            c = c | 0
            return b[((f[a >> 2] | 0) + c) >> 0] | 0
        }
        function Kp(a) {
            a = a | 0
            return ((f[(a + 4) >> 2] | 0) - (f[a >> 2] | 0)) | 0
        }
        function Lp(a) {
            a = a | 0
            aj(a)
            br(a)
            return
        }
        function Mp(a) {
            a = a | 0
            return f[((f[a >> 2] | 0) + 40) >> 2] | 0
        }
        function Np(a) {
            a = a | 0
            return f[((f[a >> 2] | 0) + 44) >> 2] | 0
        }
        function Op(a) {
            a = a | 0
            if (!a) return
            br(a)
            return
        }
        function Pp(a) {
            a = a | 0
            b[(a + 28) >> 0] = 1
            return
        }
        function Qp(a, b) {
            a = a | 0
            b = b | 0
            if (!x) {
                x = a
                y = b
            }
        }
        function Rp(a, b) {
            a = a | 0
            b = b | 0
            return 1
        }
        function Sp(a) {
            a = a | 0
            return (a + 12) | 0
        }
        function Tp(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            Wa[a & 15](b | 0, c | 0)
        }
        function Up(a, b) {
            a = a | 0
            b = b | 0
            f[(a + 80) >> 2] = b
            return
        }
        function Vp() {
            var a = 0
            a = dn(48) | 0
            Fq(a)
            return a | 0
        }
        function Wp(a) {
            a = a | 0
            return vq((a + 4) | 0) | 0
        }
        function Xp() {
            var a = 0
            a = dn(108) | 0
            bn(a)
            return a | 0
        }
        function Yp(a) {
            a = a | 0
            return ((b[(a + 32) >> 0] | 0) != 0) | 0
        }
        function Zp(a) {
            a = a | 0
            return (a + -12) | 0
        }
        function _p(a, b, c, d, e) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            e = e | 0
            aa(9)
        }
        function $p() {
            var a = 0
            a = f[4655] | 0
            f[4655] = a + 0
            return a | 0
        }
        function aq(a) {
            a = a | 0
            return f[(a + 56) >> 2] | 0
        }
        function bq() {
            var a = 0
            a = f[1708] | 0
            f[1708] = a + 0
            return a | 0
        }
        function cq(a) {
            a = a | 0
            wg(a)
            br(a)
            return
        }
        function dq(a) {
            a = a | 0
            fr(a)
            br(a)
            return
        }
        function eq(a) {
            a = a | 0
            return b[(a + 24) >> 0] | 0
        }
        function fq(a, b) {
            a = a | 0
            b = b | 0
            return 0
        }
        function gq(a) {
            a = a | 0
            return f[(a + 48) >> 2] | 0
        }
        function hq(a, b) {
            a = a | 0
            b = b | 0
            return Qa[a & 127](b | 0) | 0
        }
        function iq(a) {
            a = a | 0
            return f[(a + 60) >> 2] | 0
        }
        function jq(a) {
            a = a | 0
            return f[(a + 28) >> 2] | 0
        }
        function kq(a) {
            a = a | 0
            sa(a | 0) | 0
            bm()
        }
        function lq(a) {
            a = a | 0
            Cp(a)
            br(a)
            return
        }
        function mq(a) {
            a = a | 0
            Ca()
        }
        function nq(a) {
            a = a | 0
            return f[(a + 40) >> 2] | 0
        }
        function oq(a) {
            a = a | 0
            return f[(a + 44) >> 2] | 0
        }
        function pq(a, b) {
            a = a | 0
            b = b | 0
            return $(+sk(a, b, 0))
        }
        function qq(a) {
            a = a | 0
            return 3
        }
        function rq(a, b) {
            a = a | 0
            b = b | 0
            u = a
            v = b
        }
        function sq(a) {
            a = a | 0
            n[a >> 2] = $(1.0)
            return
        }
        function tq(a) {
            a = a | 0
            return ((((a | 0) == 32) | (((a + -9) | 0) >>> 0 < 5)) & 1) | 0
        }
        function uq(a) {
            a = a | 0
            return f[(a + 80) >> 2] | 0
        }
        function vq(a) {
            a = a | 0
            return f[a >> 2] | 0
        }
        function wq(a, b, c, d) {
            a = a | 0
            b = b | 0
            c = c | 0
            d = d | 0
            aa(8)
        }
        function xq(a, b) {
            a = a | 0
            b = b | 0
            Va[a & 127](b | 0)
        }
        function yq(a, b) {
            a = a | 0
            b = b | 0
            return Un(a, b) | 0
        }
        function zq(a) {
            a = a | 0
            return (a & 255) | 0
        }
        function Aq(a) {
            a = a | 0
            return vj(a) | 0
        }
        function Bq(a, b) {
            a = a | 0
            b = b | 0
            return +(+sk(a, b, 1))
        }
        function Cq(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            aa(2)
            return 0
        }
        function Dq(a) {
            a = a | 0
            return 2
        }
        function Eq(a) {
            a = a | 0
            return 1
        }
        function Fq(a) {
            a = a | 0
            Kn(a)
            return
        }
        function Gq(a, b) {
            a = +a
            b = +b
            return +(+Nl(a, b))
        }
        function Hq(a, b) {
            a = +a
            b = b | 0
            return +(+Wj(a, b))
        }
        function Iq(a, b) {
            a = +a
            b = b | 0
            return +(+Uj(a, b))
        }
        function Jq() {
            return 3
        }
        function Kq(a, b, c) {
            a = a | 0
            b = b | 0
            c = c | 0
            aa(7)
        }
        function Lq() {
            return 0
        }
        function Mq() {
            return -1
        }
        function Nq() {
            return dn(1) | 0
        }
        function Oq() {
            return 4
        }
        function Pq(a) {
            a = a | 0
            return (((a + -48) | 0) >>> 0 < 10) | 0
        }
        function Qq() {
            return 1
        }
        function Rq() {
            return 2
        }
        function Sq(a, b) {
            a = +a
            b = +b
            return +(+pd(a, b))
        }
        function Tq(a, b) {
            a = a | 0
            b = b | 0
            aa(1)
            return 0
        }
        function Uq(a) {
            a = a | 0
            Ha()
        }
        function Vq(a) {
            a = a | 0
            Ua[a & 3]()
        }
        function Wq() {
            ua()
        }
        function Xq(a) {
            a = a | 0
            return +(+Bq(a, 0))
        }
        function Yq() {
            return lr() | 0
        }
        function Zq(a, b) {
            a = a | 0
            b = b | 0
            aa(6)
        }
        function _q(a) {
            a = a | 0
            return dn(a) | 0
        }
        function $q(a) {
            a = a | 0
            br(a)
            return
        }
        function ar(a) {
            a = a | 0
            u = a
        }
        function br(a) {
            a = a | 0
            wc(a)
            return
        }
        function cr(a) {
            a = a | 0
            I = a
        }
        function dr(a) {
            a = a | 0
            return a | 0
        }
        function er(a) {
            a = a | 0
            aa(0)
            return 0
        }
        function fr(a) {
            a = a | 0
            return
        }
        function gr(a) {
            a = a | 0
            return 0
        }
        function hr() {
            return I | 0
        }
        function ir() {
            return 18544
        }
        function jr() {
            return u | 0
        }
        function kr(a) {
            a = a | 0
            aa(5)
        }
        function lr() {
            return 6040
        }
        function mr() {
            aa(4)
        }

        // EMSCRIPTEN_END_FUNCS
        var Qa = [
            er,
            Dq,
            Eq,
            Eq,
            Dq,
            gb,
            gr,
            gr,
            gr,
            ak,
            Vf,
            Eq,
            dp,
            gr,
            gr,
            Eq,
            gr,
            Eq,
            Eq,
            rl,
            _n,
            ll,
            Eq,
            ao,
            Yk,
            Eq,
            jq,
            Pn,
            rl,
            Eq,
            rl,
            _n,
            ll,
            Eq,
            ao,
            Yk,
            Eq,
            jq,
            Pn,
            rl,
            Eq,
            qq,
            gr,
            dp,
            Eq,
            gr,
            Eq,
            qq,
            Eq,
            kl,
            Pn,
            kl,
            _n,
            il,
            Eq,
            ao,
            Qk,
            Eq,
            jq,
            Eq,
            kl,
            Pn,
            kl,
            _n,
            il,
            Eq,
            ao,
            Qk,
            Eq,
            jq,
            Eq,
            Dq,
            Eq,
            Eq,
            Cd,
            Eq,
            Je,
            Tg,
            qk,
            ko,
            _o,
            dp,
            lg,
            sg,
            $e,
            _o,
            dp,
            Eq,
            gr,
            gr,
            wi,
            gr,
            Eq,
            gr,
            Xj,
            ln,
            Wp,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
            er,
        ]
        var Ra = [
            Tq,
            ql,
            Ug,
            ve,
            xl,
            fq,
            fq,
            fq,
            Rp,
            kb,
            gj,
            uo,
            Rp,
            Rp,
            fi,
            bj,
            Uh,
            ek,
            jl,
            Gj,
            Vk,
            Yj,
            Zj,
            Fe,
            Po,
            fq,
            Zh,
            fq,
            Dl,
            _e,
            fq,
            El,
            Zg,
            $l,
            td,
            fq,
            Dl,
            _e,
            fq,
            El,
            Zg,
            $l,
            td,
            xn,
            Po,
            fq,
            Xh,
            sd,
            fq,
            tl,
            We,
            fq,
            ul,
            Yg,
            $l,
            sd,
            fq,
            tl,
            We,
            fq,
            ul,
            Yg,
            $l,
            un,
            Hn,
            Bn,
            In,
            Gn,
            Kg,
            dk,
            mk,
            mc,
            le,
            Jm,
            wf,
            af,
            Ze,
            Ig,
            dk,
            mk,
            lc,
            le,
            Jm,
            Rp,
            fq,
            fq,
            bf,
            nm,
            Xf,
            bf,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
            Tq,
        ]
        var Sa = [Cq, lo, Ip, fn, Km, fg, cj, el, ih, uc, vh, $f, Rh, Qb, Oh, vg, gl, Dm, qj, Cq, Cq, Cq, Cq, Cq, Cq, Cq, Cq, Cq, Cq, Cq, Cq, Cq]
        var Ta = [np, Ld, Bc, ne, Sb, bb, Cc, me, Rb, ab, Lg, ed, eb, sf, qc, id, db, qf, nc, np, np, np, np, np, np, np, np, np, np, np, np, np]
        var Ua = [mr, Wq, Ai, Jn]
        var Va = [
            kr,
            Ij,
            Qj,
            fr,
            $q,
            um,
            Yl,
            Wk,
            Uq,
            gi,
            zp,
            zi,
            pp,
            wh,
            Ro,
            zm,
            tm,
            Vl,
            Uq,
            Hl,
            Hl,
            Uk,
            Jk,
            _k,
            Ok,
            fr,
            $q,
            Uq,
            Li,
            Ul,
            Hl,
            Rk,
            Gk,
            Xk,
            Mk,
            fr,
            $q,
            Uq,
            Ii,
            Kl,
            zm,
            tm,
            fr,
            $q,
            $q,
            mj,
            Bl,
            ym,
            gm,
            kn,
            Ym,
            fr,
            $q,
            $q,
            kj,
            sl,
            sm,
            Zl,
            $m,
            Mm,
            fr,
            $q,
            ok,
            hk,
            Qj,
            Sj,
            Vj,
            Vj,
            am,
            Bm,
            Mc,
            Jl,
            Ve,
            Yn,
            rk,
            jk,
            Lk,
            Fk,
            Em,
            rm,
            xk,
            nk,
            Nk,
            Ik,
            Nm,
            vm,
            Fm,
            xm,
            Gi,
            qn,
            Se,
            Ln,
            aj,
            Uq,
            Lp,
            Oo,
            Fn,
            fr,
            $q,
            Uq,
            Lp,
            Mo,
            Lp,
            Mo,
            Dk,
            wk,
            rb,
            wg,
            cq,
            fr,
            dq,
            fr,
            fr,
            dq,
            Cp,
            lq,
            lq,
            sn,
            kr,
            kr,
            kr,
            kr,
            kr,
            kr,
            kr,
            kr,
            kr,
            kr,
        ]
        var Wa = [Zq, ik, Rf, Ri, Nn, ib, lb, sc, mo, ej, ej, pk, Ec, Zq, Zq, Zq]
        var Xa = [Kq, ze, Yi, $b, fc, Fc, $b, fc, uj, Ej, Hg, oj, ug, If, Kq, Kq]
        var Ya = [wq, Dg, Zf, Wl, Zk, wq, wq, wq]
        var Za = [_p, ij, Vg, _p]
        var _a = [Ep, Il, Kk, Ep]
        return {
            ___cxa_can_catch: _l,
            ___cxa_is_pointer_type: Co,
            ___divdi3: zk,
            ___muldi3: on,
            ___udivdi3: up,
            ___uremdi3: an,
            _bitshift64Lshr: Wn,
            _bitshift64Shl: Rn,
            _emscripten_bind_DracoInt8Array_DracoInt8Array_0: op,
            _emscripten_bind_DracoInt8Array_GetValue_1: Vo,
            _emscripten_bind_DracoInt8Array___destroy___0: Xm,
            _emscripten_bind_DracoInt8Array_size_0: Kp,
            _emscripten_bind_Encoder_EncodeMeshToDracoBuffer_2: jo,
            _emscripten_bind_Encoder_EncodePointCloudToDracoBuffer_3: An,
            _emscripten_bind_Encoder_Encoder_0: Vp,
            _emscripten_bind_Encoder_GetNumberOfEncodedFaces_0: Ap,
            _emscripten_bind_Encoder_GetNumberOfEncodedPoints_0: xp,
            _emscripten_bind_Encoder_SetAttributeExplicitQuantization_5: Um,
            _emscripten_bind_Encoder_SetAttributeQuantization_2: fo,
            _emscripten_bind_Encoder_SetEncodingMethod_1: mp,
            _emscripten_bind_Encoder_SetSpeedOptions_2: So,
            _emscripten_bind_Encoder_SetTrackEncodedProperties_1: Zo,
            _emscripten_bind_Encoder___destroy___0: Hj,
            _emscripten_bind_ExpertEncoder_EncodeToDracoBuffer_2: so,
            _emscripten_bind_ExpertEncoder_ExpertEncoder_1: Fo,
            _emscripten_bind_ExpertEncoder_GetNumberOfEncodedFaces_0: ip,
            _emscripten_bind_ExpertEncoder_GetNumberOfEncodedPoints_0: fp,
            _emscripten_bind_ExpertEncoder_SetAttributeExplicitQuantization_5: jn,
            _emscripten_bind_ExpertEncoder_SetAttributeQuantization_2: wo,
            _emscripten_bind_ExpertEncoder_SetEncodingMethod_1: bp,
            _emscripten_bind_ExpertEncoder_SetSpeedOptions_2: Ko,
            _emscripten_bind_ExpertEncoder_SetTrackEncodedProperties_1: No,
            _emscripten_bind_ExpertEncoder___destroy___0: nn,
            _emscripten_bind_GeometryAttribute_GeometryAttribute_0: ap,
            _emscripten_bind_GeometryAttribute___destroy___0: Op,
            _emscripten_bind_MeshBuilder_AddFacesToMesh_3: io,
            _emscripten_bind_MeshBuilder_AddFloatAttributeToMesh_5: hn,
            _emscripten_bind_MeshBuilder_AddFloatAttribute_5: hn,
            _emscripten_bind_MeshBuilder_AddInt16Attribute_5: _m,
            _emscripten_bind_MeshBuilder_AddInt32AttributeToMesh_5: gn,
            _emscripten_bind_MeshBuilder_AddInt32Attribute_5: gn,
            _emscripten_bind_MeshBuilder_AddInt8Attribute_5: cn,
            _emscripten_bind_MeshBuilder_AddMetadataToMesh_2: po,
            _emscripten_bind_MeshBuilder_AddMetadata_2: oo,
            _emscripten_bind_MeshBuilder_AddUInt16Attribute_5: Wm,
            _emscripten_bind_MeshBuilder_AddUInt32Attribute_5: Vm,
            _emscripten_bind_MeshBuilder_AddUInt8Attribute_5: Zm,
            _emscripten_bind_MeshBuilder_MeshBuilder_0: Nq,
            _emscripten_bind_MeshBuilder_SetMetadataForAttribute_3: yn,
            _emscripten_bind_MeshBuilder___destroy___0: Op,
            _emscripten_bind_Mesh_Mesh_0: Xp,
            _emscripten_bind_Mesh___destroy___0: Ho,
            _emscripten_bind_Mesh_num_attributes_0: sp,
            _emscripten_bind_Mesh_num_faces_0: lp,
            _emscripten_bind_Mesh_num_points_0: uq,
            _emscripten_bind_Mesh_set_num_points_1: Up,
            _emscripten_bind_MetadataBuilder_AddDoubleEntry_3: Zn,
            _emscripten_bind_MetadataBuilder_AddIntEntry_3: bo,
            _emscripten_bind_MetadataBuilder_AddStringEntry_3: Xn,
            _emscripten_bind_MetadataBuilder_MetadataBuilder_0: Nq,
            _emscripten_bind_MetadataBuilder___destroy___0: Op,
            _emscripten_bind_Metadata_Metadata_0: Ml,
            _emscripten_bind_Metadata___destroy___0: cp,
            _emscripten_bind_PointAttribute_PointAttribute_0: hp,
            _emscripten_bind_PointAttribute___destroy___0: xj,
            _emscripten_bind_PointAttribute_attribute_type_0: aq,
            _emscripten_bind_PointAttribute_byte_offset_0: gq,
            _emscripten_bind_PointAttribute_byte_stride_0: nq,
            _emscripten_bind_PointAttribute_data_type_0: jq,
            _emscripten_bind_PointAttribute_normalized_0: Yp,
            _emscripten_bind_PointAttribute_num_components_0: eq,
            _emscripten_bind_PointAttribute_size_0: uq,
            _emscripten_bind_PointAttribute_unique_id_0: iq,
            _emscripten_bind_PointCloudBuilder_AddFloatAttribute_5: hn,
            _emscripten_bind_PointCloudBuilder_AddInt16Attribute_5: _m,
            _emscripten_bind_PointCloudBuilder_AddInt32Attribute_5: gn,
            _emscripten_bind_PointCloudBuilder_AddInt8Attribute_5: cn,
            _emscripten_bind_PointCloudBuilder_AddMetadata_2: oo,
            _emscripten_bind_PointCloudBuilder_AddUInt16Attribute_5: Wm,
            _emscripten_bind_PointCloudBuilder_AddUInt32Attribute_5: Vm,
            _emscripten_bind_PointCloudBuilder_AddUInt8Attribute_5: Zm,
            _emscripten_bind_PointCloudBuilder_PointCloudBuilder_0: Nq,
            _emscripten_bind_PointCloudBuilder_SetMetadataForAttribute_3: yn,
            _emscripten_bind_PointCloudBuilder___destroy___0: Op,
            _emscripten_bind_PointCloud_PointCloud_0: yp,
            _emscripten_bind_PointCloud___destroy___0: Ho,
            _emscripten_bind_PointCloud_num_attributes_0: sp,
            _emscripten_bind_PointCloud_num_points_0: uq,
            _emscripten_bind_VoidPtr___destroy___0: Op,
            _emscripten_enum_draco_EncodedGeometryType_INVALID_GEOMETRY_TYPE: Mq,
            _emscripten_enum_draco_EncodedGeometryType_POINT_CLOUD: Lq,
            _emscripten_enum_draco_EncodedGeometryType_TRIANGULAR_MESH: Qq,
            _emscripten_enum_draco_GeometryAttribute_Type_COLOR: Rq,
            _emscripten_enum_draco_GeometryAttribute_Type_GENERIC: Oq,
            _emscripten_enum_draco_GeometryAttribute_Type_INVALID: Mq,
            _emscripten_enum_draco_GeometryAttribute_Type_NORMAL: Qq,
            _emscripten_enum_draco_GeometryAttribute_Type_POSITION: Lq,
            _emscripten_enum_draco_GeometryAttribute_Type_TEX_COORD: Jq,
            _emscripten_enum_draco_MeshEncoderMethod_MESH_EDGEBREAKER_ENCODING: Qq,
            _emscripten_enum_draco_MeshEncoderMethod_MESH_SEQUENTIAL_ENCODING: Lq,
            _emscripten_replace_memory: Pa,
            _free: wc,
            _i64Add: Tn,
            _i64Subtract: Vn,
            _llvm_bswap_i32: Fp,
            _malloc: $a,
            _memcpy: Rg,
            _memmove: Xl,
            _memset: hj,
            _sbrk: Fl,
            dynCall_ii: hq,
            dynCall_iii: Dp,
            dynCall_iiii: Uo,
            dynCall_iiiiiii: En,
            dynCall_v: Vq,
            dynCall_vi: xq,
            dynCall_vii: Tp,
            dynCall_viii: gp,
            dynCall_viiii: Io,
            dynCall_viiiii: qo,
            dynCall_viiiiii: Mn,
            establishStackSpace: rq,
            getTempRet0: hr,
            runPostSets: Sn,
            setTempRet0: cr,
            setThrew: Qp,
            stackAlloc: jp,
            stackRestore: ar,
            stackSave: jr,
        }
    })(
        // EMSCRIPTEN_END_ASM
        Module.asmGlobalArg,
        Module.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 ___divdi3 = (Module['___divdi3'] = asm['___divdi3'])
    var ___muldi3 = (Module['___muldi3'] = asm['___muldi3'])
    var ___udivdi3 = (Module['___udivdi3'] = asm['___udivdi3'])
    var ___uremdi3 = (Module['___uremdi3'] = asm['___uremdi3'])
    var _bitshift64Lshr = (Module['_bitshift64Lshr'] = asm['_bitshift64Lshr'])
    var _bitshift64Shl = (Module['_bitshift64Shl'] = asm['_bitshift64Shl'])
    var _emscripten_bind_DracoInt8Array_DracoInt8Array_0 = (Module['_emscripten_bind_DracoInt8Array_DracoInt8Array_0'] = asm['_emscripten_bind_DracoInt8Array_DracoInt8Array_0'])
    var _emscripten_bind_DracoInt8Array_GetValue_1 = (Module['_emscripten_bind_DracoInt8Array_GetValue_1'] = asm['_emscripten_bind_DracoInt8Array_GetValue_1'])
    var _emscripten_bind_DracoInt8Array___destroy___0 = (Module['_emscripten_bind_DracoInt8Array___destroy___0'] = asm['_emscripten_bind_DracoInt8Array___destroy___0'])
    var _emscripten_bind_DracoInt8Array_size_0 = (Module['_emscripten_bind_DracoInt8Array_size_0'] = asm['_emscripten_bind_DracoInt8Array_size_0'])
    var _emscripten_bind_Encoder_EncodeMeshToDracoBuffer_2 = (Module['_emscripten_bind_Encoder_EncodeMeshToDracoBuffer_2'] = asm['_emscripten_bind_Encoder_EncodeMeshToDracoBuffer_2'])
    var _emscripten_bind_Encoder_EncodePointCloudToDracoBuffer_3 = (Module['_emscripten_bind_Encoder_EncodePointCloudToDracoBuffer_3'] =
        asm['_emscripten_bind_Encoder_EncodePointCloudToDracoBuffer_3'])
    var _emscripten_bind_Encoder_Encoder_0 = (Module['_emscripten_bind_Encoder_Encoder_0'] = asm['_emscripten_bind_Encoder_Encoder_0'])
    var _emscripten_bind_Encoder_GetNumberOfEncodedFaces_0 = (Module['_emscripten_bind_Encoder_GetNumberOfEncodedFaces_0'] = asm['_emscripten_bind_Encoder_GetNumberOfEncodedFaces_0'])
    var _emscripten_bind_Encoder_GetNumberOfEncodedPoints_0 = (Module['_emscripten_bind_Encoder_GetNumberOfEncodedPoints_0'] = asm['_emscripten_bind_Encoder_GetNumberOfEncodedPoints_0'])
    var _emscripten_bind_Encoder_SetAttributeExplicitQuantization_5 = (Module['_emscripten_bind_Encoder_SetAttributeExplicitQuantization_5'] =
        asm['_emscripten_bind_Encoder_SetAttributeExplicitQuantization_5'])
    var _emscripten_bind_Encoder_SetAttributeQuantization_2 = (Module['_emscripten_bind_Encoder_SetAttributeQuantization_2'] = asm['_emscripten_bind_Encoder_SetAttributeQuantization_2'])
    var _emscripten_bind_Encoder_SetEncodingMethod_1 = (Module['_emscripten_bind_Encoder_SetEncodingMethod_1'] = asm['_emscripten_bind_Encoder_SetEncodingMethod_1'])
    var _emscripten_bind_Encoder_SetSpeedOptions_2 = (Module['_emscripten_bind_Encoder_SetSpeedOptions_2'] = asm['_emscripten_bind_Encoder_SetSpeedOptions_2'])
    var _emscripten_bind_Encoder_SetTrackEncodedProperties_1 = (Module['_emscripten_bind_Encoder_SetTrackEncodedProperties_1'] = asm['_emscripten_bind_Encoder_SetTrackEncodedProperties_1'])
    var _emscripten_bind_Encoder___destroy___0 = (Module['_emscripten_bind_Encoder___destroy___0'] = asm['_emscripten_bind_Encoder___destroy___0'])
    var _emscripten_bind_ExpertEncoder_EncodeToDracoBuffer_2 = (Module['_emscripten_bind_ExpertEncoder_EncodeToDracoBuffer_2'] = asm['_emscripten_bind_ExpertEncoder_EncodeToDracoBuffer_2'])
    var _emscripten_bind_ExpertEncoder_ExpertEncoder_1 = (Module['_emscripten_bind_ExpertEncoder_ExpertEncoder_1'] = asm['_emscripten_bind_ExpertEncoder_ExpertEncoder_1'])
    var _emscripten_bind_ExpertEncoder_GetNumberOfEncodedFaces_0 = (Module['_emscripten_bind_ExpertEncoder_GetNumberOfEncodedFaces_0'] =
        asm['_emscripten_bind_ExpertEncoder_GetNumberOfEncodedFaces_0'])
    var _emscripten_bind_ExpertEncoder_GetNumberOfEncodedPoints_0 = (Module['_emscripten_bind_ExpertEncoder_GetNumberOfEncodedPoints_0'] =
        asm['_emscripten_bind_ExpertEncoder_GetNumberOfEncodedPoints_0'])
    var _emscripten_bind_ExpertEncoder_SetAttributeExplicitQuantization_5 = (Module['_emscripten_bind_ExpertEncoder_SetAttributeExplicitQuantization_5'] =
        asm['_emscripten_bind_ExpertEncoder_SetAttributeExplicitQuantization_5'])
    var _emscripten_bind_ExpertEncoder_SetAttributeQuantization_2 = (Module['_emscripten_bind_ExpertEncoder_SetAttributeQuantization_2'] =
        asm['_emscripten_bind_ExpertEncoder_SetAttributeQuantization_2'])
    var _emscripten_bind_ExpertEncoder_SetEncodingMethod_1 = (Module['_emscripten_bind_ExpertEncoder_SetEncodingMethod_1'] = asm['_emscripten_bind_ExpertEncoder_SetEncodingMethod_1'])
    var _emscripten_bind_ExpertEncoder_SetSpeedOptions_2 = (Module['_emscripten_bind_ExpertEncoder_SetSpeedOptions_2'] = asm['_emscripten_bind_ExpertEncoder_SetSpeedOptions_2'])
    var _emscripten_bind_ExpertEncoder_SetTrackEncodedProperties_1 = (Module['_emscripten_bind_ExpertEncoder_SetTrackEncodedProperties_1'] =
        asm['_emscripten_bind_ExpertEncoder_SetTrackEncodedProperties_1'])
    var _emscripten_bind_ExpertEncoder___destroy___0 = (Module['_emscripten_bind_ExpertEncoder___destroy___0'] = asm['_emscripten_bind_ExpertEncoder___destroy___0'])
    var _emscripten_bind_GeometryAttribute_GeometryAttribute_0 = (Module['_emscripten_bind_GeometryAttribute_GeometryAttribute_0'] = asm['_emscripten_bind_GeometryAttribute_GeometryAttribute_0'])
    var _emscripten_bind_GeometryAttribute___destroy___0 = (Module['_emscripten_bind_GeometryAttribute___destroy___0'] = asm['_emscripten_bind_GeometryAttribute___destroy___0'])
    var _emscripten_bind_MeshBuilder_AddFacesToMesh_3 = (Module['_emscripten_bind_MeshBuilder_AddFacesToMesh_3'] = asm['_emscripten_bind_MeshBuilder_AddFacesToMesh_3'])
    var _emscripten_bind_MeshBuilder_AddFloatAttributeToMesh_5 = (Module['_emscripten_bind_MeshBuilder_AddFloatAttributeToMesh_5'] = asm['_emscripten_bind_MeshBuilder_AddFloatAttributeToMesh_5'])
    var _emscripten_bind_MeshBuilder_AddFloatAttribute_5 = (Module['_emscripten_bind_MeshBuilder_AddFloatAttribute_5'] = asm['_emscripten_bind_MeshBuilder_AddFloatAttribute_5'])
    var _emscripten_bind_MeshBuilder_AddInt16Attribute_5 = (Module['_emscripten_bind_MeshBuilder_AddInt16Attribute_5'] = asm['_emscripten_bind_MeshBuilder_AddInt16Attribute_5'])
    var _emscripten_bind_MeshBuilder_AddInt32AttributeToMesh_5 = (Module['_emscripten_bind_MeshBuilder_AddInt32AttributeToMesh_5'] = asm['_emscripten_bind_MeshBuilder_AddInt32AttributeToMesh_5'])
    var _emscripten_bind_MeshBuilder_AddInt32Attribute_5 = (Module['_emscripten_bind_MeshBuilder_AddInt32Attribute_5'] = asm['_emscripten_bind_MeshBuilder_AddInt32Attribute_5'])
    var _emscripten_bind_MeshBuilder_AddInt8Attribute_5 = (Module['_emscripten_bind_MeshBuilder_AddInt8Attribute_5'] = asm['_emscripten_bind_MeshBuilder_AddInt8Attribute_5'])
    var _emscripten_bind_MeshBuilder_AddMetadataToMesh_2 = (Module['_emscripten_bind_MeshBuilder_AddMetadataToMesh_2'] = asm['_emscripten_bind_MeshBuilder_AddMetadataToMesh_2'])
    var _emscripten_bind_MeshBuilder_AddMetadata_2 = (Module['_emscripten_bind_MeshBuilder_AddMetadata_2'] = asm['_emscripten_bind_MeshBuilder_AddMetadata_2'])
    var _emscripten_bind_MeshBuilder_AddUInt16Attribute_5 = (Module['_emscripten_bind_MeshBuilder_AddUInt16Attribute_5'] = asm['_emscripten_bind_MeshBuilder_AddUInt16Attribute_5'])
    var _emscripten_bind_MeshBuilder_AddUInt32Attribute_5 = (Module['_emscripten_bind_MeshBuilder_AddUInt32Attribute_5'] = asm['_emscripten_bind_MeshBuilder_AddUInt32Attribute_5'])
    var _emscripten_bind_MeshBuilder_AddUInt8Attribute_5 = (Module['_emscripten_bind_MeshBuilder_AddUInt8Attribute_5'] = asm['_emscripten_bind_MeshBuilder_AddUInt8Attribute_5'])
    var _emscripten_bind_MeshBuilder_MeshBuilder_0 = (Module['_emscripten_bind_MeshBuilder_MeshBuilder_0'] = asm['_emscripten_bind_MeshBuilder_MeshBuilder_0'])
    var _emscripten_bind_MeshBuilder_SetMetadataForAttribute_3 = (Module['_emscripten_bind_MeshBuilder_SetMetadataForAttribute_3'] = asm['_emscripten_bind_MeshBuilder_SetMetadataForAttribute_3'])
    var _emscripten_bind_MeshBuilder___destroy___0 = (Module['_emscripten_bind_MeshBuilder___destroy___0'] = asm['_emscripten_bind_MeshBuilder___destroy___0'])
    var _emscripten_bind_Mesh_Mesh_0 = (Module['_emscripten_bind_Mesh_Mesh_0'] = asm['_emscripten_bind_Mesh_Mesh_0'])
    var _emscripten_bind_Mesh___destroy___0 = (Module['_emscripten_bind_Mesh___destroy___0'] = asm['_emscripten_bind_Mesh___destroy___0'])
    var _emscripten_bind_Mesh_num_attributes_0 = (Module['_emscripten_bind_Mesh_num_attributes_0'] = asm['_emscripten_bind_Mesh_num_attributes_0'])
    var _emscripten_bind_Mesh_num_faces_0 = (Module['_emscripten_bind_Mesh_num_faces_0'] = asm['_emscripten_bind_Mesh_num_faces_0'])
    var _emscripten_bind_Mesh_num_points_0 = (Module['_emscripten_bind_Mesh_num_points_0'] = asm['_emscripten_bind_Mesh_num_points_0'])
    var _emscripten_bind_Mesh_set_num_points_1 = (Module['_emscripten_bind_Mesh_set_num_points_1'] = asm['_emscripten_bind_Mesh_set_num_points_1'])
    var _emscripten_bind_MetadataBuilder_AddDoubleEntry_3 = (Module['_emscripten_bind_MetadataBuilder_AddDoubleEntry_3'] = asm['_emscripten_bind_MetadataBuilder_AddDoubleEntry_3'])
    var _emscripten_bind_MetadataBuilder_AddIntEntry_3 = (Module['_emscripten_bind_MetadataBuilder_AddIntEntry_3'] = asm['_emscripten_bind_MetadataBuilder_AddIntEntry_3'])
    var _emscripten_bind_MetadataBuilder_AddStringEntry_3 = (Module['_emscripten_bind_MetadataBuilder_AddStringEntry_3'] = asm['_emscripten_bind_MetadataBuilder_AddStringEntry_3'])
    var _emscripten_bind_MetadataBuilder_MetadataBuilder_0 = (Module['_emscripten_bind_MetadataBuilder_MetadataBuilder_0'] = asm['_emscripten_bind_MetadataBuilder_MetadataBuilder_0'])
    var _emscripten_bind_MetadataBuilder___destroy___0 = (Module['_emscripten_bind_MetadataBuilder___destroy___0'] = asm['_emscripten_bind_MetadataBuilder___destroy___0'])
    var _emscripten_bind_Metadata_Metadata_0 = (Module['_emscripten_bind_Metadata_Metadata_0'] = asm['_emscripten_bind_Metadata_Metadata_0'])
    var _emscripten_bind_Metadata___destroy___0 = (Module['_emscripten_bind_Metadata___destroy___0'] = asm['_emscripten_bind_Metadata___destroy___0'])
    var _emscripten_bind_PointAttribute_PointAttribute_0 = (Module['_emscripten_bind_PointAttribute_PointAttribute_0'] = asm['_emscripten_bind_PointAttribute_PointAttribute_0'])
    var _emscripten_bind_PointAttribute___destroy___0 = (Module['_emscripten_bind_PointAttribute___destroy___0'] = asm['_emscripten_bind_PointAttribute___destroy___0'])
    var _emscripten_bind_PointAttribute_attribute_type_0 = (Module['_emscripten_bind_PointAttribute_attribute_type_0'] = asm['_emscripten_bind_PointAttribute_attribute_type_0'])
    var _emscripten_bind_PointAttribute_byte_offset_0 = (Module['_emscripten_bind_PointAttribute_byte_offset_0'] = asm['_emscripten_bind_PointAttribute_byte_offset_0'])
    var _emscripten_bind_PointAttribute_byte_stride_0 = (Module['_emscripten_bind_PointAttribute_byte_stride_0'] = asm['_emscripten_bind_PointAttribute_byte_stride_0'])
    var _emscripten_bind_PointAttribute_data_type_0 = (Module['_emscripten_bind_PointAttribute_data_type_0'] = asm['_emscripten_bind_PointAttribute_data_type_0'])
    var _emscripten_bind_PointAttribute_normalized_0 = (Module['_emscripten_bind_PointAttribute_normalized_0'] = asm['_emscripten_bind_PointAttribute_normalized_0'])
    var _emscripten_bind_PointAttribute_num_components_0 = (Module['_emscripten_bind_PointAttribute_num_components_0'] = asm['_emscripten_bind_PointAttribute_num_components_0'])
    var _emscripten_bind_PointAttribute_size_0 = (Module['_emscripten_bind_PointAttribute_size_0'] = asm['_emscripten_bind_PointAttribute_size_0'])
    var _emscripten_bind_PointAttribute_unique_id_0 = (Module['_emscripten_bind_PointAttribute_unique_id_0'] = asm['_emscripten_bind_PointAttribute_unique_id_0'])
    var _emscripten_bind_PointCloudBuilder_AddFloatAttribute_5 = (Module['_emscripten_bind_PointCloudBuilder_AddFloatAttribute_5'] = asm['_emscripten_bind_PointCloudBuilder_AddFloatAttribute_5'])
    var _emscripten_bind_PointCloudBuilder_AddInt16Attribute_5 = (Module['_emscripten_bind_PointCloudBuilder_AddInt16Attribute_5'] = asm['_emscripten_bind_PointCloudBuilder_AddInt16Attribute_5'])
    var _emscripten_bind_PointCloudBuilder_AddInt32Attribute_5 = (Module['_emscripten_bind_PointCloudBuilder_AddInt32Attribute_5'] = asm['_emscripten_bind_PointCloudBuilder_AddInt32Attribute_5'])
    var _emscripten_bind_PointCloudBuilder_AddInt8Attribute_5 = (Module['_emscripten_bind_PointCloudBuilder_AddInt8Attribute_5'] = asm['_emscripten_bind_PointCloudBuilder_AddInt8Attribute_5'])
    var _emscripten_bind_PointCloudBuilder_AddMetadata_2 = (Module['_emscripten_bind_PointCloudBuilder_AddMetadata_2'] = asm['_emscripten_bind_PointCloudBuilder_AddMetadata_2'])
    var _emscripten_bind_PointCloudBuilder_AddUInt16Attribute_5 = (Module['_emscripten_bind_PointCloudBuilder_AddUInt16Attribute_5'] = asm['_emscripten_bind_PointCloudBuilder_AddUInt16Attribute_5'])
    var _emscripten_bind_PointCloudBuilder_AddUInt32Attribute_5 = (Module['_emscripten_bind_PointCloudBuilder_AddUInt32Attribute_5'] = asm['_emscripten_bind_PointCloudBuilder_AddUInt32Attribute_5'])
    var _emscripten_bind_PointCloudBuilder_AddUInt8Attribute_5 = (Module['_emscripten_bind_PointCloudBuilder_AddUInt8Attribute_5'] = asm['_emscripten_bind_PointCloudBuilder_AddUInt8Attribute_5'])
    var _emscripten_bind_PointCloudBuilder_PointCloudBuilder_0 = (Module['_emscripten_bind_PointCloudBuilder_PointCloudBuilder_0'] = asm['_emscripten_bind_PointCloudBuilder_PointCloudBuilder_0'])
    var _emscripten_bind_PointCloudBuilder_SetMetadataForAttribute_3 = (Module['_emscripten_bind_PointCloudBuilder_SetMetadataForAttribute_3'] =
        asm['_emscripten_bind_PointCloudBuilder_SetMetadataForAttribute_3'])
    var _emscripten_bind_PointCloudBuilder___destroy___0 = (Module['_emscripten_bind_PointCloudBuilder___destroy___0'] = asm['_emscripten_bind_PointCloudBuilder___destroy___0'])
    var _emscripten_bind_PointCloud_PointCloud_0 = (Module['_emscripten_bind_PointCloud_PointCloud_0'] = asm['_emscripten_bind_PointCloud_PointCloud_0'])
    var _emscripten_bind_PointCloud___destroy___0 = (Module['_emscripten_bind_PointCloud___destroy___0'] = asm['_emscripten_bind_PointCloud___destroy___0'])
    var _emscripten_bind_PointCloud_num_attributes_0 = (Module['_emscripten_bind_PointCloud_num_attributes_0'] = asm['_emscripten_bind_PointCloud_num_attributes_0'])
    var _emscripten_bind_PointCloud_num_points_0 = (Module['_emscripten_bind_PointCloud_num_points_0'] = asm['_emscripten_bind_PointCloud_num_points_0'])
    var _emscripten_bind_VoidPtr___destroy___0 = (Module['_emscripten_bind_VoidPtr___destroy___0'] = asm['_emscripten_bind_VoidPtr___destroy___0'])
    var _emscripten_enum_draco_EncodedGeometryType_INVALID_GEOMETRY_TYPE = (Module['_emscripten_enum_draco_EncodedGeometryType_INVALID_GEOMETRY_TYPE'] =
        asm['_emscripten_enum_draco_EncodedGeometryType_INVALID_GEOMETRY_TYPE'])
    var _emscripten_enum_draco_EncodedGeometryType_POINT_CLOUD = (Module['_emscripten_enum_draco_EncodedGeometryType_POINT_CLOUD'] = asm['_emscripten_enum_draco_EncodedGeometryType_POINT_CLOUD'])
    var _emscripten_enum_draco_EncodedGeometryType_TRIANGULAR_MESH = (Module['_emscripten_enum_draco_EncodedGeometryType_TRIANGULAR_MESH'] =
        asm['_emscripten_enum_draco_EncodedGeometryType_TRIANGULAR_MESH'])
    var _emscripten_enum_draco_GeometryAttribute_Type_COLOR = (Module['_emscripten_enum_draco_GeometryAttribute_Type_COLOR'] = asm['_emscripten_enum_draco_GeometryAttribute_Type_COLOR'])
    var _emscripten_enum_draco_GeometryAttribute_Type_GENERIC = (Module['_emscripten_enum_draco_GeometryAttribute_Type_GENERIC'] = asm['_emscripten_enum_draco_GeometryAttribute_Type_GENERIC'])
    var _emscripten_enum_draco_GeometryAttribute_Type_INVALID = (Module['_emscripten_enum_draco_GeometryAttribute_Type_INVALID'] = asm['_emscripten_enum_draco_GeometryAttribute_Type_INVALID'])
    var _emscripten_enum_draco_GeometryAttribute_Type_NORMAL = (Module['_emscripten_enum_draco_GeometryAttribute_Type_NORMAL'] = asm['_emscripten_enum_draco_GeometryAttribute_Type_NORMAL'])
    var _emscripten_enum_draco_GeometryAttribute_Type_POSITION = (Module['_emscripten_enum_draco_GeometryAttribute_Type_POSITION'] = asm['_emscripten_enum_draco_GeometryAttribute_Type_POSITION'])
    var _emscripten_enum_draco_GeometryAttribute_Type_TEX_COORD = (Module['_emscripten_enum_draco_GeometryAttribute_Type_TEX_COORD'] = asm['_emscripten_enum_draco_GeometryAttribute_Type_TEX_COORD'])
    var _emscripten_enum_draco_MeshEncoderMethod_MESH_EDGEBREAKER_ENCODING = (Module['_emscripten_enum_draco_MeshEncoderMethod_MESH_EDGEBREAKER_ENCODING'] =
        asm['_emscripten_enum_draco_MeshEncoderMethod_MESH_EDGEBREAKER_ENCODING'])
    var _emscripten_enum_draco_MeshEncoderMethod_MESH_SEQUENTIAL_ENCODING = (Module['_emscripten_enum_draco_MeshEncoderMethod_MESH_SEQUENTIAL_ENCODING'] =
        asm['_emscripten_enum_draco_MeshEncoderMethod_MESH_SEQUENTIAL_ENCODING'])
    var _emscripten_replace_memory = (Module['_emscripten_replace_memory'] = asm['_emscripten_replace_memory'])
    var _free = (Module['_free'] = asm['_free'])
    var _i64Add = (Module['_i64Add'] = asm['_i64Add'])
    var _i64Subtract = (Module['_i64Subtract'] = asm['_i64Subtract'])
    var _llvm_bswap_i32 = (Module['_llvm_bswap_i32'] = asm['_llvm_bswap_i32'])
    var _malloc = (Module['_malloc'] = asm['_malloc'])
    var _memcpy = (Module['_memcpy'] = asm['_memcpy'])
    var _memmove = (Module['_memmove'] = asm['_memmove'])
    var _memset = (Module['_memset'] = asm['_memset'])
    var _sbrk = (Module['_sbrk'] = asm['_sbrk'])
    var establishStackSpace = (Module['establishStackSpace'] = asm['establishStackSpace'])
    var getTempRet0 = (Module['getTempRet0'] = asm['getTempRet0'])
    var runPostSets = (Module['runPostSets'] = asm['runPostSets'])
    var setTempRet0 = (Module['setTempRet0'] = asm['setTempRet0'])
    var setThrew = (Module['setThrew'] = asm['setThrew'])
    var stackAlloc = (Module['stackAlloc'] = asm['stackAlloc'])
    var stackRestore = (Module['stackRestore'] = asm['stackRestore'])
    var stackSave = (Module['stackSave'] = asm['stackSave'])
    var dynCall_ii = (Module['dynCall_ii'] = asm['dynCall_ii'])
    var dynCall_iii = (Module['dynCall_iii'] = asm['dynCall_iii'])
    var dynCall_iiii = (Module['dynCall_iiii'] = asm['dynCall_iiii'])
    var dynCall_iiiiiii = (Module['dynCall_iiiiiii'] = asm['dynCall_iiiiiii'])
    var dynCall_v = (Module['dynCall_v'] = asm['dynCall_v'])
    var dynCall_vi = (Module['dynCall_vi'] = asm['dynCall_vi'])
    var dynCall_vii = (Module['dynCall_vii'] = asm['dynCall_vii'])
    var dynCall_viii = (Module['dynCall_viii'] = asm['dynCall_viii'])
    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
    if (memoryInitializer) {
        if (!isDataURI(memoryInitializer)) {
            if (typeof Module['locateFile'] === 'function') {
                memoryInitializer = Module['locateFile'](memoryInitializer)
            } else if (Module['memoryInitializerPrefixURL']) {
                memoryInitializer = Module['memoryInitializerPrefixURL'] + 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')
            }
            function doBrowserLoad() {
                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']) {
                function useRequest() {
                    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()
            }
        }
    }
    Module['then'] = function (func) {
        if (Module['calledRun']) {
            func(Module)
        } else {
            var old = Module['onRuntimeInitialized']
            Module['onRuntimeInitialized'] = function () {
                if (old) old()
                func(Module)
            }
        }
        return Module
    }
    function ExitStatus(status) {
        this.name = 'ExitStatus'
        this.message = 'Program terminated with exit(' + status + ')'
        this.status = status
    }
    ExitStatus.prototype = new Error()
    ExitStatus.prototype.constructor = ExitStatus
    var initialStackTop
    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 exit(status, implicit) {
        if (implicit && Module['noExitRuntime'] && status === 0) {
            return
        }
        if (Module['noExitRuntime']) {
        } else {
            ABORT = true
            EXITSTATUS = status
            STACKTOP = initialStackTop
            exitRuntime()
            if (Module['onExit']) Module['onExit'](status)
        }
        if (ENVIRONMENT_IS_NODE) {
            process['exit'](status)
        }
        Module['quit'](status, new ExitStatus(status))
    }
    Module['exit'] = exit
    function abort(what) {
        if (Module['onAbort']) {
            Module['onAbort'](what)
        }
        if (what !== undefined) {
            Module.print(what)
            Module.printErr(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()
    function WrapperObject() {}
    WrapperObject.prototype = Object.create(WrapperObject.prototype)
    WrapperObject.prototype.constructor = WrapperObject
    WrapperObject.prototype.__class__ = WrapperObject
    WrapperObject.__cache__ = {}
    Module['WrapperObject'] = WrapperObject
    function getCache(__class__) {
        return (__class__ || WrapperObject).__cache__
    }
    Module['getCache'] = getCache
    function wrapPointer(ptr, __class__) {
        var cache = getCache(__class__)
        var ret = cache[ptr]
        if (ret) return ret
        ret = Object.create((__class__ || WrapperObject).prototype)
        ret.ptr = ptr
        return (cache[ptr] = ret)
    }
    Module['wrapPointer'] = wrapPointer
    function castObject(obj, __class__) {
        return wrapPointer(obj.ptr, __class__)
    }
    Module['castObject'] = castObject
    Module['NULL'] = wrapPointer(0)
    function destroy(obj) {
        if (!obj['__destroy__']) throw 'Error: Cannot destroy object. (Did you create it yourself?)'
        obj['__destroy__']()
        delete getCache(obj.__class__)[obj.ptr]
    }
    Module['destroy'] = destroy
    function compare(obj1, obj2) {
        return obj1.ptr === obj2.ptr
    }
    Module['compare'] = compare
    function getPointer(obj) {
        return obj.ptr
    }
    Module['getPointer'] = getPointer
    function getClass(obj) {
        return obj.__class__
    }
    Module['getClass'] = getClass
    var ensureCache = {
        buffer: 0,
        size: 0,
        pos: 0,
        temps: [],
        needed: 0,
        prepare: function () {
            if (ensureCache.needed) {
                for (var i = 0; i < ensureCache.temps.length; i++) {
                    Module['_free'](ensureCache.temps[i])
                }
                ensureCache.temps.length = 0
                Module['_free'](ensureCache.buffer)
                ensureCache.buffer = 0
                ensureCache.size += ensureCache.needed
                ensureCache.needed = 0
            }
            if (!ensureCache.buffer) {
                ensureCache.size += 128
                ensureCache.buffer = Module['_malloc'](ensureCache.size)
                assert(ensureCache.buffer)
            }
            ensureCache.pos = 0
        },
        alloc: function (array, view) {
            assert(ensureCache.buffer)
            var bytes = view.BYTES_PER_ELEMENT
            var len = array.length * bytes
            len = (len + 7) & -8
            var ret
            if (ensureCache.pos + len >= ensureCache.size) {
                assert(len > 0)
                ensureCache.needed += len
                ret = Module['_malloc'](len)
                ensureCache.temps.push(ret)
            } else {
                ret = ensureCache.buffer + ensureCache.pos
                ensureCache.pos += len
            }
            return ret
        },
        copy: function (array, view, offset) {
            var offsetShifted = offset
            var bytes = view.BYTES_PER_ELEMENT
            switch (bytes) {
                case 2:
                    offsetShifted >>= 1
                    break
                case 4:
                    offsetShifted >>= 2
                    break
                case 8:
                    offsetShifted >>= 3
                    break
            }
            for (var i = 0; i < array.length; i++) {
                view[offsetShifted + i] = array[i]
            }
        },
    }
    function ensureString(value) {
        if (typeof value === 'string') {
            var intArray = intArrayFromString(value)
            var offset = ensureCache.alloc(intArray, HEAP8)
            ensureCache.copy(intArray, HEAP8, offset)
            return offset
        }
        return value
    }
    function ensureInt8(value) {
        if (typeof value === 'object') {
            var offset = ensureCache.alloc(value, HEAP8)
            ensureCache.copy(value, HEAP8, offset)
            return offset
        }
        return value
    }
    function ensureInt16(value) {
        if (typeof value === 'object') {
            var offset = ensureCache.alloc(value, HEAP16)
            ensureCache.copy(value, HEAP16, offset)
            return offset
        }
        return value
    }
    function ensureInt32(value) {
        if (typeof value === 'object') {
            var offset = ensureCache.alloc(value, HEAP32)
            ensureCache.copy(value, HEAP32, offset)
            return offset
        }
        return value
    }
    function ensureFloat32(value) {
        if (typeof value === 'object') {
            var offset = ensureCache.alloc(value, HEAPF32)
            ensureCache.copy(value, HEAPF32, offset)
            return offset
        }
        return value
    }
    function PointCloud() {
        this.ptr = _emscripten_bind_PointCloud_PointCloud_0()
        getCache(PointCloud)[this.ptr] = this
    }
    PointCloud.prototype = Object.create(WrapperObject.prototype)
    PointCloud.prototype.constructor = PointCloud
    PointCloud.prototype.__class__ = PointCloud
    PointCloud.__cache__ = {}
    Module['PointCloud'] = PointCloud
    PointCloud.prototype['num_attributes'] = PointCloud.prototype.num_attributes = function () {
        var self = this.ptr
        return _emscripten_bind_PointCloud_num_attributes_0(self)
    }
    PointCloud.prototype['num_points'] = PointCloud.prototype.num_points = function () {
        var self = this.ptr
        return _emscripten_bind_PointCloud_num_points_0(self)
    }
    PointCloud.prototype['__destroy__'] = PointCloud.prototype.__destroy__ = function () {
        var self = this.ptr
        _emscripten_bind_PointCloud___destroy___0(self)
    }
    function ExpertEncoder(arg0) {
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        this.ptr = _emscripten_bind_ExpertEncoder_ExpertEncoder_1(arg0)
        getCache(ExpertEncoder)[this.ptr] = this
    }
    ExpertEncoder.prototype = Object.create(WrapperObject.prototype)
    ExpertEncoder.prototype.constructor = ExpertEncoder
    ExpertEncoder.prototype.__class__ = ExpertEncoder
    ExpertEncoder.__cache__ = {}
    Module['ExpertEncoder'] = ExpertEncoder
    ExpertEncoder.prototype['SetEncodingMethod'] = ExpertEncoder.prototype.SetEncodingMethod = function (arg0) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        _emscripten_bind_ExpertEncoder_SetEncodingMethod_1(self, arg0)
    }
    ExpertEncoder.prototype['SetAttributeQuantization'] = ExpertEncoder.prototype.SetAttributeQuantization = function (arg0, arg1) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        _emscripten_bind_ExpertEncoder_SetAttributeQuantization_2(self, arg0, arg1)
    }
    ExpertEncoder.prototype['SetAttributeExplicitQuantization'] = ExpertEncoder.prototype.SetAttributeExplicitQuantization = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (typeof arg3 == 'object') {
            arg3 = ensureFloat32(arg3)
        }
        if (arg4 && typeof arg4 === 'object') arg4 = arg4.ptr
        _emscripten_bind_ExpertEncoder_SetAttributeExplicitQuantization_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    ExpertEncoder.prototype['SetSpeedOptions'] = ExpertEncoder.prototype.SetSpeedOptions = function (arg0, arg1) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        _emscripten_bind_ExpertEncoder_SetSpeedOptions_2(self, arg0, arg1)
    }
    ExpertEncoder.prototype['SetTrackEncodedProperties'] = ExpertEncoder.prototype.SetTrackEncodedProperties = function (arg0) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        _emscripten_bind_ExpertEncoder_SetTrackEncodedProperties_1(self, arg0)
    }
    ExpertEncoder.prototype['EncodeToDracoBuffer'] = ExpertEncoder.prototype.EncodeToDracoBuffer = function (arg0, arg1) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        return _emscripten_bind_ExpertEncoder_EncodeToDracoBuffer_2(self, arg0, arg1)
    }
    ExpertEncoder.prototype['GetNumberOfEncodedPoints'] = ExpertEncoder.prototype.GetNumberOfEncodedPoints = function () {
        var self = this.ptr
        return _emscripten_bind_ExpertEncoder_GetNumberOfEncodedPoints_0(self)
    }
    ExpertEncoder.prototype['GetNumberOfEncodedFaces'] = ExpertEncoder.prototype.GetNumberOfEncodedFaces = function () {
        var self = this.ptr
        return _emscripten_bind_ExpertEncoder_GetNumberOfEncodedFaces_0(self)
    }
    ExpertEncoder.prototype['__destroy__'] = ExpertEncoder.prototype.__destroy__ = function () {
        var self = this.ptr
        _emscripten_bind_ExpertEncoder___destroy___0(self)
    }
    function PointAttribute() {
        this.ptr = _emscripten_bind_PointAttribute_PointAttribute_0()
        getCache(PointAttribute)[this.ptr] = this
    }
    PointAttribute.prototype = Object.create(WrapperObject.prototype)
    PointAttribute.prototype.constructor = PointAttribute
    PointAttribute.prototype.__class__ = PointAttribute
    PointAttribute.__cache__ = {}
    Module['PointAttribute'] = PointAttribute
    PointAttribute.prototype['size'] = PointAttribute.prototype.size = function () {
        var self = this.ptr
        return _emscripten_bind_PointAttribute_size_0(self)
    }
    PointAttribute.prototype['attribute_type'] = PointAttribute.prototype.attribute_type = function () {
        var self = this.ptr
        return _emscripten_bind_PointAttribute_attribute_type_0(self)
    }
    PointAttribute.prototype['data_type'] = PointAttribute.prototype.data_type = function () {
        var self = this.ptr
        return _emscripten_bind_PointAttribute_data_type_0(self)
    }
    PointAttribute.prototype['num_components'] = PointAttribute.prototype.num_components = function () {
        var self = this.ptr
        return _emscripten_bind_PointAttribute_num_components_0(self)
    }
    PointAttribute.prototype['normalized'] = PointAttribute.prototype.normalized = function () {
        var self = this.ptr
        return !!_emscripten_bind_PointAttribute_normalized_0(self)
    }
    PointAttribute.prototype['byte_stride'] = PointAttribute.prototype.byte_stride = function () {
        var self = this.ptr
        return _emscripten_bind_PointAttribute_byte_stride_0(self)
    }
    PointAttribute.prototype['byte_offset'] = PointAttribute.prototype.byte_offset = function () {
        var self = this.ptr
        return _emscripten_bind_PointAttribute_byte_offset_0(self)
    }
    PointAttribute.prototype['unique_id'] = PointAttribute.prototype.unique_id = function () {
        var self = this.ptr
        return _emscripten_bind_PointAttribute_unique_id_0(self)
    }
    PointAttribute.prototype['__destroy__'] = PointAttribute.prototype.__destroy__ = function () {
        var self = this.ptr
        _emscripten_bind_PointAttribute___destroy___0(self)
    }
    function Encoder() {
        this.ptr = _emscripten_bind_Encoder_Encoder_0()
        getCache(Encoder)[this.ptr] = this
    }
    Encoder.prototype = Object.create(WrapperObject.prototype)
    Encoder.prototype.constructor = Encoder
    Encoder.prototype.__class__ = Encoder
    Encoder.__cache__ = {}
    Module['Encoder'] = Encoder
    Encoder.prototype['SetEncodingMethod'] = Encoder.prototype.SetEncodingMethod = function (arg0) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        _emscripten_bind_Encoder_SetEncodingMethod_1(self, arg0)
    }
    Encoder.prototype['SetAttributeQuantization'] = Encoder.prototype.SetAttributeQuantization = function (arg0, arg1) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        _emscripten_bind_Encoder_SetAttributeQuantization_2(self, arg0, arg1)
    }
    Encoder.prototype['SetAttributeExplicitQuantization'] = Encoder.prototype.SetAttributeExplicitQuantization = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (typeof arg3 == 'object') {
            arg3 = ensureFloat32(arg3)
        }
        if (arg4 && typeof arg4 === 'object') arg4 = arg4.ptr
        _emscripten_bind_Encoder_SetAttributeExplicitQuantization_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    Encoder.prototype['SetSpeedOptions'] = Encoder.prototype.SetSpeedOptions = function (arg0, arg1) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        _emscripten_bind_Encoder_SetSpeedOptions_2(self, arg0, arg1)
    }
    Encoder.prototype['SetTrackEncodedProperties'] = Encoder.prototype.SetTrackEncodedProperties = function (arg0) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        _emscripten_bind_Encoder_SetTrackEncodedProperties_1(self, arg0)
    }
    Encoder.prototype['EncodeMeshToDracoBuffer'] = Encoder.prototype.EncodeMeshToDracoBuffer = function (arg0, arg1) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        return _emscripten_bind_Encoder_EncodeMeshToDracoBuffer_2(self, arg0, arg1)
    }
    Encoder.prototype['EncodePointCloudToDracoBuffer'] = Encoder.prototype.EncodePointCloudToDracoBuffer = function (arg0, arg1, arg2) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        return _emscripten_bind_Encoder_EncodePointCloudToDracoBuffer_3(self, arg0, arg1, arg2)
    }
    Encoder.prototype['GetNumberOfEncodedPoints'] = Encoder.prototype.GetNumberOfEncodedPoints = function () {
        var self = this.ptr
        return _emscripten_bind_Encoder_GetNumberOfEncodedPoints_0(self)
    }
    Encoder.prototype['GetNumberOfEncodedFaces'] = Encoder.prototype.GetNumberOfEncodedFaces = function () {
        var self = this.ptr
        return _emscripten_bind_Encoder_GetNumberOfEncodedFaces_0(self)
    }
    Encoder.prototype['__destroy__'] = Encoder.prototype.__destroy__ = function () {
        var self = this.ptr
        _emscripten_bind_Encoder___destroy___0(self)
    }
    function MeshBuilder() {
        this.ptr = _emscripten_bind_MeshBuilder_MeshBuilder_0()
        getCache(MeshBuilder)[this.ptr] = this
    }
    MeshBuilder.prototype = Object.create(WrapperObject.prototype)
    MeshBuilder.prototype.constructor = MeshBuilder
    MeshBuilder.prototype.__class__ = MeshBuilder
    MeshBuilder.__cache__ = {}
    Module['MeshBuilder'] = MeshBuilder
    MeshBuilder.prototype['AddFacesToMesh'] = MeshBuilder.prototype.AddFacesToMesh = function (arg0, arg1, arg2) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (typeof arg2 == 'object') {
            arg2 = ensureInt32(arg2)
        }
        return !!_emscripten_bind_MeshBuilder_AddFacesToMesh_3(self, arg0, arg1, arg2)
    }
    MeshBuilder.prototype['AddFloatAttributeToMesh'] = MeshBuilder.prototype.AddFloatAttributeToMesh = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (arg3 && typeof arg3 === 'object') arg3 = arg3.ptr
        if (typeof arg4 == 'object') {
            arg4 = ensureFloat32(arg4)
        }
        return _emscripten_bind_MeshBuilder_AddFloatAttributeToMesh_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    MeshBuilder.prototype['AddInt32AttributeToMesh'] = MeshBuilder.prototype.AddInt32AttributeToMesh = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (arg3 && typeof arg3 === 'object') arg3 = arg3.ptr
        if (typeof arg4 == 'object') {
            arg4 = ensureInt32(arg4)
        }
        return _emscripten_bind_MeshBuilder_AddInt32AttributeToMesh_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    MeshBuilder.prototype['AddMetadataToMesh'] = MeshBuilder.prototype.AddMetadataToMesh = function (arg0, arg1) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        return !!_emscripten_bind_MeshBuilder_AddMetadataToMesh_2(self, arg0, arg1)
    }
    MeshBuilder.prototype['AddFloatAttribute'] = MeshBuilder.prototype.AddFloatAttribute = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (arg3 && typeof arg3 === 'object') arg3 = arg3.ptr
        if (typeof arg4 == 'object') {
            arg4 = ensureFloat32(arg4)
        }
        return _emscripten_bind_MeshBuilder_AddFloatAttribute_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    MeshBuilder.prototype['AddInt8Attribute'] = MeshBuilder.prototype.AddInt8Attribute = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (arg3 && typeof arg3 === 'object') arg3 = arg3.ptr
        if (typeof arg4 == 'object') {
            arg4 = ensureInt8(arg4)
        }
        return _emscripten_bind_MeshBuilder_AddInt8Attribute_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    MeshBuilder.prototype['AddUInt8Attribute'] = MeshBuilder.prototype.AddUInt8Attribute = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (arg3 && typeof arg3 === 'object') arg3 = arg3.ptr
        if (typeof arg4 == 'object') {
            arg4 = ensureInt8(arg4)
        }
        return _emscripten_bind_MeshBuilder_AddUInt8Attribute_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    MeshBuilder.prototype['AddInt16Attribute'] = MeshBuilder.prototype.AddInt16Attribute = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (arg3 && typeof arg3 === 'object') arg3 = arg3.ptr
        if (typeof arg4 == 'object') {
            arg4 = ensureInt16(arg4)
        }
        return _emscripten_bind_MeshBuilder_AddInt16Attribute_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    MeshBuilder.prototype['AddUInt16Attribute'] = MeshBuilder.prototype.AddUInt16Attribute = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (arg3 && typeof arg3 === 'object') arg3 = arg3.ptr
        if (typeof arg4 == 'object') {
            arg4 = ensureInt16(arg4)
        }
        return _emscripten_bind_MeshBuilder_AddUInt16Attribute_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    MeshBuilder.prototype['AddInt32Attribute'] = MeshBuilder.prototype.AddInt32Attribute = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (arg3 && typeof arg3 === 'object') arg3 = arg3.ptr
        if (typeof arg4 == 'object') {
            arg4 = ensureInt32(arg4)
        }
        return _emscripten_bind_MeshBuilder_AddInt32Attribute_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    MeshBuilder.prototype['AddUInt32Attribute'] = MeshBuilder.prototype.AddUInt32Attribute = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (arg3 && typeof arg3 === 'object') arg3 = arg3.ptr
        if (typeof arg4 == 'object') {
            arg4 = ensureInt32(arg4)
        }
        return _emscripten_bind_MeshBuilder_AddUInt32Attribute_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    MeshBuilder.prototype['AddMetadata'] = MeshBuilder.prototype.AddMetadata = function (arg0, arg1) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        return !!_emscripten_bind_MeshBuilder_AddMetadata_2(self, arg0, arg1)
    }
    MeshBuilder.prototype['SetMetadataForAttribute'] = MeshBuilder.prototype.SetMetadataForAttribute = function (arg0, arg1, arg2) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        return !!_emscripten_bind_MeshBuilder_SetMetadataForAttribute_3(self, arg0, arg1, arg2)
    }
    MeshBuilder.prototype['__destroy__'] = MeshBuilder.prototype.__destroy__ = function () {
        var self = this.ptr
        _emscripten_bind_MeshBuilder___destroy___0(self)
    }
    function DracoInt8Array() {
        this.ptr = _emscripten_bind_DracoInt8Array_DracoInt8Array_0()
        getCache(DracoInt8Array)[this.ptr] = this
    }
    DracoInt8Array.prototype = Object.create(WrapperObject.prototype)
    DracoInt8Array.prototype.constructor = DracoInt8Array
    DracoInt8Array.prototype.__class__ = DracoInt8Array
    DracoInt8Array.__cache__ = {}
    Module['DracoInt8Array'] = DracoInt8Array
    DracoInt8Array.prototype['GetValue'] = DracoInt8Array.prototype.GetValue = function (arg0) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        return _emscripten_bind_DracoInt8Array_GetValue_1(self, arg0)
    }
    DracoInt8Array.prototype['size'] = DracoInt8Array.prototype.size = function () {
        var self = this.ptr
        return _emscripten_bind_DracoInt8Array_size_0(self)
    }
    DracoInt8Array.prototype['__destroy__'] = DracoInt8Array.prototype.__destroy__ = function () {
        var self = this.ptr
        _emscripten_bind_DracoInt8Array___destroy___0(self)
    }
    function MetadataBuilder() {
        this.ptr = _emscripten_bind_MetadataBuilder_MetadataBuilder_0()
        getCache(MetadataBuilder)[this.ptr] = this
    }
    MetadataBuilder.prototype = Object.create(WrapperObject.prototype)
    MetadataBuilder.prototype.constructor = MetadataBuilder
    MetadataBuilder.prototype.__class__ = MetadataBuilder
    MetadataBuilder.__cache__ = {}
    Module['MetadataBuilder'] = MetadataBuilder
    MetadataBuilder.prototype['AddStringEntry'] = MetadataBuilder.prototype.AddStringEntry = function (arg0, arg1, arg2) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        else arg1 = ensureString(arg1)
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        else arg2 = ensureString(arg2)
        return !!_emscripten_bind_MetadataBuilder_AddStringEntry_3(self, arg0, arg1, arg2)
    }
    MetadataBuilder.prototype['AddIntEntry'] = MetadataBuilder.prototype.AddIntEntry = function (arg0, arg1, arg2) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        else arg1 = ensureString(arg1)
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        return !!_emscripten_bind_MetadataBuilder_AddIntEntry_3(self, arg0, arg1, arg2)
    }
    MetadataBuilder.prototype['AddDoubleEntry'] = MetadataBuilder.prototype.AddDoubleEntry = function (arg0, arg1, arg2) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        else arg1 = ensureString(arg1)
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        return !!_emscripten_bind_MetadataBuilder_AddDoubleEntry_3(self, arg0, arg1, arg2)
    }
    MetadataBuilder.prototype['__destroy__'] = MetadataBuilder.prototype.__destroy__ = function () {
        var self = this.ptr
        _emscripten_bind_MetadataBuilder___destroy___0(self)
    }
    function GeometryAttribute() {
        this.ptr = _emscripten_bind_GeometryAttribute_GeometryAttribute_0()
        getCache(GeometryAttribute)[this.ptr] = this
    }
    GeometryAttribute.prototype = Object.create(WrapperObject.prototype)
    GeometryAttribute.prototype.constructor = GeometryAttribute
    GeometryAttribute.prototype.__class__ = GeometryAttribute
    GeometryAttribute.__cache__ = {}
    Module['GeometryAttribute'] = GeometryAttribute
    GeometryAttribute.prototype['__destroy__'] = GeometryAttribute.prototype.__destroy__ = function () {
        var self = this.ptr
        _emscripten_bind_GeometryAttribute___destroy___0(self)
    }
    function Mesh() {
        this.ptr = _emscripten_bind_Mesh_Mesh_0()
        getCache(Mesh)[this.ptr] = this
    }
    Mesh.prototype = Object.create(WrapperObject.prototype)
    Mesh.prototype.constructor = Mesh
    Mesh.prototype.__class__ = Mesh
    Mesh.__cache__ = {}
    Module['Mesh'] = Mesh
    Mesh.prototype['num_faces'] = Mesh.prototype.num_faces = function () {
        var self = this.ptr
        return _emscripten_bind_Mesh_num_faces_0(self)
    }
    Mesh.prototype['num_attributes'] = Mesh.prototype.num_attributes = function () {
        var self = this.ptr
        return _emscripten_bind_Mesh_num_attributes_0(self)
    }
    Mesh.prototype['num_points'] = Mesh.prototype.num_points = function () {
        var self = this.ptr
        return _emscripten_bind_Mesh_num_points_0(self)
    }
    Mesh.prototype['set_num_points'] = Mesh.prototype.set_num_points = function (arg0) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        _emscripten_bind_Mesh_set_num_points_1(self, arg0)
    }
    Mesh.prototype['__destroy__'] = Mesh.prototype.__destroy__ = function () {
        var self = this.ptr
        _emscripten_bind_Mesh___destroy___0(self)
    }
    function PointCloudBuilder() {
        this.ptr = _emscripten_bind_PointCloudBuilder_PointCloudBuilder_0()
        getCache(PointCloudBuilder)[this.ptr] = this
    }
    PointCloudBuilder.prototype = Object.create(WrapperObject.prototype)
    PointCloudBuilder.prototype.constructor = PointCloudBuilder
    PointCloudBuilder.prototype.__class__ = PointCloudBuilder
    PointCloudBuilder.__cache__ = {}
    Module['PointCloudBuilder'] = PointCloudBuilder
    PointCloudBuilder.prototype['AddFloatAttribute'] = PointCloudBuilder.prototype.AddFloatAttribute = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (arg3 && typeof arg3 === 'object') arg3 = arg3.ptr
        if (typeof arg4 == 'object') {
            arg4 = ensureFloat32(arg4)
        }
        return _emscripten_bind_PointCloudBuilder_AddFloatAttribute_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    PointCloudBuilder.prototype['AddInt8Attribute'] = PointCloudBuilder.prototype.AddInt8Attribute = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (arg3 && typeof arg3 === 'object') arg3 = arg3.ptr
        if (typeof arg4 == 'object') {
            arg4 = ensureInt8(arg4)
        }
        return _emscripten_bind_PointCloudBuilder_AddInt8Attribute_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    PointCloudBuilder.prototype['AddUInt8Attribute'] = PointCloudBuilder.prototype.AddUInt8Attribute = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (arg3 && typeof arg3 === 'object') arg3 = arg3.ptr
        if (typeof arg4 == 'object') {
            arg4 = ensureInt8(arg4)
        }
        return _emscripten_bind_PointCloudBuilder_AddUInt8Attribute_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    PointCloudBuilder.prototype['AddInt16Attribute'] = PointCloudBuilder.prototype.AddInt16Attribute = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (arg3 && typeof arg3 === 'object') arg3 = arg3.ptr
        if (typeof arg4 == 'object') {
            arg4 = ensureInt16(arg4)
        }
        return _emscripten_bind_PointCloudBuilder_AddInt16Attribute_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    PointCloudBuilder.prototype['AddUInt16Attribute'] = PointCloudBuilder.prototype.AddUInt16Attribute = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (arg3 && typeof arg3 === 'object') arg3 = arg3.ptr
        if (typeof arg4 == 'object') {
            arg4 = ensureInt16(arg4)
        }
        return _emscripten_bind_PointCloudBuilder_AddUInt16Attribute_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    PointCloudBuilder.prototype['AddInt32Attribute'] = PointCloudBuilder.prototype.AddInt32Attribute = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (arg3 && typeof arg3 === 'object') arg3 = arg3.ptr
        if (typeof arg4 == 'object') {
            arg4 = ensureInt32(arg4)
        }
        return _emscripten_bind_PointCloudBuilder_AddInt32Attribute_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    PointCloudBuilder.prototype['AddUInt32Attribute'] = PointCloudBuilder.prototype.AddUInt32Attribute = function (arg0, arg1, arg2, arg3, arg4) {
        var self = this.ptr
        ensureCache.prepare()
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        if (arg3 && typeof arg3 === 'object') arg3 = arg3.ptr
        if (typeof arg4 == 'object') {
            arg4 = ensureInt32(arg4)
        }
        return _emscripten_bind_PointCloudBuilder_AddUInt32Attribute_5(self, arg0, arg1, arg2, arg3, arg4)
    }
    PointCloudBuilder.prototype['AddMetadata'] = PointCloudBuilder.prototype.AddMetadata = function (arg0, arg1) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        return !!_emscripten_bind_PointCloudBuilder_AddMetadata_2(self, arg0, arg1)
    }
    PointCloudBuilder.prototype['SetMetadataForAttribute'] = PointCloudBuilder.prototype.SetMetadataForAttribute = function (arg0, arg1, arg2) {
        var self = this.ptr
        if (arg0 && typeof arg0 === 'object') arg0 = arg0.ptr
        if (arg1 && typeof arg1 === 'object') arg1 = arg1.ptr
        if (arg2 && typeof arg2 === 'object') arg2 = arg2.ptr
        return !!_emscripten_bind_PointCloudBuilder_SetMetadataForAttribute_3(self, arg0, arg1, arg2)
    }
    PointCloudBuilder.prototype['__destroy__'] = PointCloudBuilder.prototype.__destroy__ = function () {
        var self = this.ptr
        _emscripten_bind_PointCloudBuilder___destroy___0(self)
    }
    function VoidPtr() {
        throw 'cannot construct a VoidPtr, no constructor in IDL'
    }
    VoidPtr.prototype = Object.create(WrapperObject.prototype)
    VoidPtr.prototype.constructor = VoidPtr
    VoidPtr.prototype.__class__ = VoidPtr
    VoidPtr.__cache__ = {}
    Module['VoidPtr'] = VoidPtr
    VoidPtr.prototype['__destroy__'] = VoidPtr.prototype.__destroy__ = function () {
        var self = this.ptr
        _emscripten_bind_VoidPtr___destroy___0(self)
    }
    function Metadata() {
        this.ptr = _emscripten_bind_Metadata_Metadata_0()
        getCache(Metadata)[this.ptr] = this
    }
    Metadata.prototype = Object.create(WrapperObject.prototype)
    Metadata.prototype.constructor = Metadata
    Metadata.prototype.__class__ = Metadata
    Metadata.__cache__ = {}
    Module['Metadata'] = Metadata
    Metadata.prototype['__destroy__'] = Metadata.prototype.__destroy__ = function () {
        var self = this.ptr
        _emscripten_bind_Metadata___destroy___0(self)
    }
    ;(function () {
        function setupEnums() {
            Module['MESH_SEQUENTIAL_ENCODING'] = _emscripten_enum_draco_MeshEncoderMethod_MESH_SEQUENTIAL_ENCODING()
            Module['MESH_EDGEBREAKER_ENCODING'] = _emscripten_enum_draco_MeshEncoderMethod_MESH_EDGEBREAKER_ENCODING()
            Module['INVALID_GEOMETRY_TYPE'] = _emscripten_enum_draco_EncodedGeometryType_INVALID_GEOMETRY_TYPE()
            Module['POINT_CLOUD'] = _emscripten_enum_draco_EncodedGeometryType_POINT_CLOUD()
            Module['TRIANGULAR_MESH'] = _emscripten_enum_draco_EncodedGeometryType_TRIANGULAR_MESH()
            Module['INVALID'] = _emscripten_enum_draco_GeometryAttribute_Type_INVALID()
            Module['POSITION'] = _emscripten_enum_draco_GeometryAttribute_Type_POSITION()
            Module['NORMAL'] = _emscripten_enum_draco_GeometryAttribute_Type_NORMAL()
            Module['COLOR'] = _emscripten_enum_draco_GeometryAttribute_Type_COLOR()
            Module['TEX_COORD'] = _emscripten_enum_draco_GeometryAttribute_Type_TEX_COORD()
            Module['GENERIC'] = _emscripten_enum_draco_GeometryAttribute_Type_GENERIC()
        }
        if (Module['calledRun']) setupEnums()
        else addOnPreMain(setupEnums)
    })()
    if (typeof Module['onModuleParsed'] === 'function') {
        Module['onModuleParsed']()
    }

    return DracoEncoderModule
}
if (typeof exports === 'object' && typeof module === 'object') module.exports = DracoEncoderModule
else if (typeof define === 'function' && define['amd'])
    define([], function () {
        return DracoEncoderModule
    })
else if (typeof exports === 'object') exports['DracoEncoderModule'] = DracoEncoderModule