{"version":3,"sources":["Static/scripts/Web/Shared/mapsUtils/texture_decompressor.js","Static/scripts/Web/Shared/mapsUtils/protobuf_decoder.js","Static/scripts/Web/Shared/mapsUtils/decode-resource.ts","wwwroot/dist/GMapsUtils.bundle.min.js"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;ACngLA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACtsCA,IAAO,GAAG,CAoBT;AApBD,WAAO,GAAG;IAAC,IAAA,KAAK,CAoBf;IApBU,WAAA,KAAK;QAAC,IAAA,IAAI,CAoBpB;QApBgB,WAAA,IAAI;YACN,mBAAc,GAAG,CAAC;gBACzB,IAAM,SAAS,GAAG,EAAE,CAAC;gBACrB,IAAM,IAAI,GAA8D;oBACpE,WAAW,EAAX,UAAY,CAAC,EAAE,CAAC;wBACZ,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC3B,OAAO,SAAS,CAAO,KAAM,CAAC,EAAE,CAAC,CAAC;oBACtC,CAAC;iBACJ,CAAC;gBAEF,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;gBAEzB,OAAO,SAAe,MAAM,CAAC,OAAO,EAAE,OAAO;;;;;;oCACnC,EAAE,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC;oCACzB,qBAAM,IAAI,OAAO,CAAC,UAAC,OAAO,EAAE,MAAM;4CACrC,SAAS,CAAC,EAAE,CAAC,GAAG,EAAE,OAAO,SAAA,EAAE,MAAM,QAAA,EAAE,CAAA;4CACnC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAA,EAAE,OAAO,SAAA,EAAE,OAAO,SAAA,EAAE,EAAE,CAAC,CAAC;wCACvD,CAAC,CAAC,EAAA;wCAHF,sBAAO,SAGL,EAAC;;;;iBACN,CAAA;YACL,CAAC,CAAC,EAAE,CAAC;QACT,CAAC,EApBgB,IAAI,GAAJ,UAAI,KAAJ,UAAI,QAoBpB;IAAD,CAAC,EApBU,KAAK,GAAL,SAAK,KAAL,SAAK,QAoBf;AAAD,CAAC,EApBM,GAAG,KAAH,GAAG,QAoBT;;ACpBD","file":"gMapsUtils.js","sourcesContent":["var spt;\r\n(function (spt) {\r\n var Utils;\r\n (function (Utils) {\r\n var Maps;\r\n (function (Maps) {\r\n //emscripten - js port of crunch/crnlib c++ library - Advanced DXTn texture compression library\r\n function CrunchDecompressor() {\r\n this.init()\r\n }\r\n\r\n // allocate buffer on heap\r\n CrunchDecompressor.prototype.malloc = function (size) {\r\n return this.a._malloc(size)\r\n };\r\n\r\n //frees allocated buffer\r\n CrunchDecompressor.prototype.free = function (cBuffer) {\r\n this.a._free(cBuffer)\r\n };\r\n\r\n // copys data from typedArray at [startIndex .. (startIndex + count)] to buffer\r\n CrunchDecompressor.prototype.setData = function (array, startIndex, count, buffer) {\r\n this.a.HEAPU8.set(array.subarray(startIndex, startIndex + count), buffer)\r\n };\r\n\r\n // copys data from typedArray to buffer\r\n CrunchDecompressor.prototype.setArrayData = function (array, buffer) {\r\n this.a.HEAPU8.set(array, buffer)\r\n };\r\n\r\n // copys data from buffer to typedArray\r\n CrunchDecompressor.prototype.getData = function (buffer, count, targetArray, startIndex) {\r\n targetArray.set(this.a.HEAPU8.subarray(buffer, buffer + count), startIndex || 0)\r\n };\r\n\r\n //get decompressed size of buffer\r\n CrunchDecompressor.prototype.getDecompressedSize = function (cBuffer, size) {\r\n return this.a._crn_get_decompressed_size(cBuffer, size)\r\n };\r\n\r\n //decompress cBuffer to target buffer\r\n CrunchDecompressor.prototype.decompress = function (cBufferSource, sourceSize, cBufferTarget, targetSize) {\r\n return this.a._crn_decompress(cBufferSource, sourceSize, cBufferTarget, targetSize)\r\n };\r\n\r\n //decompress Uint8Array\r\n CrunchDecompressor.prototype.decompressArray = function (srcArray) {\r\n if (!srcArray || !srcArray.length)\r\n return srcArray;\r\n\r\n var srcLength = srcArray.length;\r\n var bufferSource = this.malloc(srcLength);\r\n this.setArrayData(srcArray, bufferSource);\r\n var targetLength = this.getDecompressedSize(bufferSource, srcLength);\r\n var bufferTarget = this.malloc(targetLength);\r\n this.decompress(bufferSource, srcLength, bufferTarget, targetLength);\r\n var result = new Uint8Array(targetLength);\r\n this.getData(bufferTarget, targetLength, result, 0);\r\n this.free(bufferSource);\r\n this.free(bufferTarget);\r\n };\r\n\r\n //compiled emscripten js code\r\n CrunchDecompressor.prototype.init = function () {\r\n function c(a) {\r\n eval.call(null, a)\r\n }\r\n\r\n function d(a) {\r\n w.print(a + \":\\n\" + Error().stack);\r\n throw \"Assertion: \" + a;\r\n }\r\n\r\n function e(a, b) {\r\n a || d(\"Assertion failed: \" + b)\r\n }\r\n\r\n function h(a, b, n, u) {\r\n var f = 0;\r\n try {\r\n var c = eval(\"_\" + a)\r\n } catch (Fa) {\r\n try {\r\n c = Kd.Module[\"_\" + a]\r\n } catch (sf) { }\r\n }\r\n e(c, \"Cannot call unknown function \" + a + \" (perhaps LLVM optimizations or closure removed it?)\");\r\n var r = 0;\r\n a = u ? u.map(function (a) {\r\n var b = n[r++];\r\n \"string\" == b ? (f || (f = Q.Bb()), b = Q.Ma(a.length + 1), G(a, b), a = b) : \"array\" == b && (f || (f = Q.Bb()), b = Q.Ma(a.length), C(a, b), a = b);\r\n return a\r\n }) : [];\r\n b = function (a, b) {\r\n if (\"string\" == b) return m(a);\r\n e(\"array\" != b);\r\n return a\r\n }(c.apply(null, a), b);\r\n f && Q.kd(f);\r\n return b\r\n }\r\n\r\n function k(a, f, n) {\r\n n = n || \"i8\";\r\n \"*\" === n[n.length - 1] && (n = \"i32\");\r\n switch (n) {\r\n case \"i1\":\r\n D[a] = f;\r\n break;\r\n case \"i8\":\r\n D[a] = f;\r\n break;\r\n case \"i16\":\r\n Da[a >> 1] = f;\r\n break;\r\n case \"i32\":\r\n b[a >> 2] = f;\r\n break;\r\n case \"i64\":\r\n b[a >> 2] = f;\r\n break;\r\n case \"float\":\r\n Cb[a >> 2] = f;\r\n break;\r\n case \"double\":\r\n Xb[0] = f;\r\n b[a >> 2] = cb[0];\r\n b[a + 4 >> 2] = cb[1];\r\n break;\r\n default:\r\n d(\"invalid type for setValue: \" + n)\r\n }\r\n }\r\n\r\n function g(a, b, n) {\r\n if (\"number\" === typeof a) {\r\n var f = !0;\r\n var c = a\r\n } else f = !1, c = a.length;\r\n var N = \"string\" === typeof b ? b : null;\r\n n = [db, Q.Ma, Q.Cb][void 0 === n ? 2 : n](Math.max(c, N ? 1 : b.length));\r\n if (f) return Xa(n, 0, c), n;\r\n f = 0;\r\n for (var r; f < c;) {\r\n var d = a[f];\r\n \"function\" === typeof d && (d = Q.ef(d));\r\n r = N || b[f];\r\n 0 === r ? f++ : (\"i64\" == r && (r = \"i32\"), k(n + f, d, r), f += Q.Ea(r))\r\n }\r\n return n\r\n }\r\n\r\n function m(a, b) {\r\n for (var f = \"undefined\" == typeof b, u = \"\", c = 0, N, r = String.fromCharCode(0); ;) {\r\n N = String.fromCharCode(I[a + c]);\r\n if (f && N == r) break;\r\n u += N;\r\n c += 1;\r\n if (!f && c == b) break\r\n }\r\n return u\r\n }\r\n\r\n function p(a) {\r\n for (; 0 < a.length;) {\r\n var b = a.shift(),\r\n n = b.Da;\r\n \"number\" === typeof n && (n = Ma[n]);\r\n n(void 0 === b.gc ? null : b.gc)\r\n }\r\n }\r\n\r\n function v(a, b) {\r\n return Array.prototype.slice.call(D.subarray(a, a + b))\r\n }\r\n\r\n function z(a) {\r\n for (var b = 0; D[a + b];) b++;\r\n return b\r\n }\r\n\r\n function B(a, b) {\r\n var f = z(a);\r\n b && f++;\r\n a = v(a, f);\r\n b && (a[f - 1] = 0);\r\n return a\r\n }\r\n\r\n function A(a, b, n) {\r\n var f = [],\r\n c = 0;\r\n void 0 === n && (n = a.length);\r\n for (; c < n;) {\r\n var N = a.charCodeAt(c);\r\n 255 < N && (N &= 255);\r\n f.push(N);\r\n c += 1\r\n }\r\n b || f.push(0);\r\n return f\r\n }\r\n\r\n function G(a, b, n) {\r\n for (var f = 0; f < a.length;) {\r\n var c = a.charCodeAt(f);\r\n 255 < c && (c &= 255);\r\n D[b + f] = c;\r\n f += 1\r\n }\r\n n || (D[b + f] = 0)\r\n }\r\n\r\n function C(a, b) {\r\n for (var f = 0; f < a.length; f++) D[b + f] = a[f]\r\n }\r\n\r\n function R(a, b) {\r\n return 0 <= a ? a : 32 >= b ? 2 * Math.abs(1 << b - 1) + a : Math.pow(2, b) + a\r\n }\r\n\r\n function L(a, b) {\r\n if (0 >= a) return a;\r\n var f = 32 >= b ? Math.abs(1 << b - 1) : Math.pow(2, b - 1);\r\n a >= f && (32 >= b || a > f) && (a = -2 * f + a);\r\n return a\r\n }\r\n\r\n function O(a) {\r\n return 0 == (a | 0) ? 0 : 0 == (a - 1 & a | 0)\r\n }\r\n\r\n function sa(a) {\r\n a = a - 1 | 0;\r\n a |= a >>> 16;\r\n a |= a >>> 8;\r\n a |= a >>> 4;\r\n a |= a >>> 2;\r\n return (a >>> 1 | a) + 1 | 0\r\n }\r\n\r\n function ka(a, b) {\r\n return a >>> 0 < b >>> 0 ? a : b\r\n }\r\n\r\n function qa(a, b) {\r\n return a >>> 0 > b >>> 0 ? a : b\r\n }\r\n\r\n function P(a, f, n) {\r\n var u = M;\r\n M += 512;\r\n var c = u | 0;\r\n Ld(c, q.md | 0, (lb = M, M += 12, b[lb >> 2] = f, b[lb + 4 >> 2] = n, b[lb + 8 >> 2] = a, lb));\r\n Md(c);\r\n M = u\r\n }\r\n\r\n function la(a, f, n, u, c) {\r\n var N = M;\r\n M += 4;\r\n var na = N,\r\n d = a + 4 | 0;\r\n var e = (a + 8 | 0) >> 2;\r\n t[d >> 2] >>> 0 > t[e] >>> 0 && P(q.nd | 0, q.a | 0, 2181);\r\n Math.floor(2147418112 / (u >>> 0)) >>> 0 <= f >>> 0 && P(q.Vb | 0, q.a | 0, 2182);\r\n var h = t[e],\r\n y = h >>> 0 < f >>> 0;\r\n do {\r\n if (y) {\r\n var E = n ? O(f) ? f : sa(f) : f;\r\n 0 != (E | 0) & E >>> 0 > h >>> 0 || P(q.$b | 0, q.a | 0, 2191);\r\n var H = E * u | 0;\r\n if (0 == (c | 0)) {\r\n var x = a | 0;\r\n var l = Ea(b[x >> 2], H, na, 1);\r\n if (0 == (l | 0)) {\r\n E = 0;\r\n break\r\n }\r\n b[x >> 2] = l\r\n } else {\r\n l = J(H, na);\r\n if (0 == (l | 0)) {\r\n E = 0;\r\n break\r\n }\r\n x = (a | 0) >> 2;\r\n Ma[c](l, b[x], b[d >> 2]);\r\n var g = b[x];\r\n 0 != (g | 0) && aa(g);\r\n b[x] = l\r\n }\r\n x = t[na >> 2];\r\n b[e] = x >>> 0 > H >>> 0 ? Math.floor((x >>> 0) / (u >>> 0)) : E\r\n }\r\n E = 1\r\n } while (0);\r\n M = N;\r\n return E\r\n }\r\n\r\n function Ea(a, f, n, u) {\r\n var c = M;\r\n M += 4;\r\n var N = c;\r\n 0 == (a & 7 | 0) ? 2147418112 < f >>> 0 ? (mb(q.o | 0), n = 0) : (b[N >> 2] = f, a = Ma[b[Yb >> 2]](a, f, N, u, b[Zb >> 2]), 0 != (n | 0) && (b[n >> 2] = b[N >> 2]), 0 != (a & 7 | 0) && P(q.u | 0, q.a | 0, 2654), n = a) : (mb(q.Fb | 0), n = 0);\r\n M = c;\r\n return n\r\n }\r\n\r\n function J(a, f) {\r\n var n = M;\r\n M += 4;\r\n var u = n;\r\n a = a + 3 & -4;\r\n a = 0 == (a | 0) ? 4 : a;\r\n if (2147418112 < a >>> 0) mb(q.o | 0), f = 0;\r\n else {\r\n b[u >> 2] = a;\r\n var c = Ma[b[Yb >> 2]](0, a, u, 1, b[Zb >> 2]);\r\n u = t[u >> 2];\r\n 0 != (f | 0) && (b[f >> 2] = u);\r\n 0 == (c | 0) | u >>> 0 < a >>> 0 ? (mb(q.Eb | 0), f = 0) : (0 != (c & 7 | 0) && P(q.u | 0, q.a | 0, 2629), f = c)\r\n }\r\n M = n;\r\n return f\r\n }\r\n\r\n function aa(a) {\r\n if (0 != (a | 0))\r\n if (0 == (a & 7 | 0)) Ma[b[Yb >> 2]](a, 0, 0, 1, b[Zb >> 2]);\r\n else mb(q.Gb | 0)\r\n }\r\n\r\n function Ja(a, f, n, u) {\r\n var c = a >> 2,\r\n N = M;\r\n M += 200;\r\n var r = N >> 2;\r\n var d = N + 64;\r\n var e = d >> 2;\r\n var l = N + 132,\r\n y = 0 == (f | 0) | 11 < u >>> 0;\r\n a: do\r\n if (y) var E = 0;\r\n else {\r\n b[c] = f;\r\n Ua(d);\r\n for (var H = 0; ;) {\r\n var x = I[n + H | 0];\r\n if (0 != x << 24 >> 24) {\r\n var h = ((x & 255) << 2) + d | 0;\r\n b[h >> 2] = b[h >> 2] + 1 | 0\r\n }\r\n var g = H + 1 | 0;\r\n if ((g | 0) == (f | 0)) {\r\n var k = 1,\r\n $b = -1,\r\n p = 0,\r\n m = 0,\r\n v = 0;\r\n break\r\n }\r\n H = g\r\n }\r\n for (; ;) {\r\n var A = t[(k << 2 >> 2) + e];\r\n if (0 == (A | 0)) {\r\n b[((k - 1 << 2) + 28 >> 2) + c] = 0;\r\n var w = v,\r\n z = m,\r\n B = p,\r\n G = $b\r\n } else {\r\n var C = ka($b, k),\r\n F = qa(p, k),\r\n K = k - 1 | 0;\r\n b[(K << 2 >> 2) + r] = v;\r\n var J = A + v | 0,\r\n U = 16 - k | 0;\r\n b[((K << 2) + 28 >> 2) + c] = (J - 1 << U | (1 << U) - 1) + 1 | 0;\r\n b[((K << 2) + 96 >> 2) + c] = m;\r\n b[l + (k << 2) >> 2] = m;\r\n w = J;\r\n z = A + m | 0;\r\n B = F;\r\n G = C\r\n }\r\n var L = k + 1 | 0;\r\n if (17 == (L | 0)) break;\r\n k = L;\r\n $b = G;\r\n p = B;\r\n m = z;\r\n v = w << 1\r\n }\r\n b[c + 1] = z;\r\n var ac = (a + 172 | 0) >> 2;\r\n if (z >>> 0 > t[ac] >>> 0) {\r\n var R = O(z) ? z : ka(f, sa(z));\r\n b[ac] = R;\r\n var Q = a + 176 | 0,\r\n W = b[Q >> 2];\r\n if (0 == (W | 0)) var wc = R;\r\n else ab(W), wc = b[ac];\r\n var ma = Ya(wc);\r\n b[Q >> 2] = ma;\r\n if (0 == (ma | 0)) {\r\n E = 0;\r\n break\r\n }\r\n var fa = Q\r\n } else fa = a + 176 | 0;\r\n var ha = a + 24 | 0;\r\n D[ha] = G & 255;\r\n D[a + 25 | 0] = B & 255;\r\n for (var ba = 0; ;) {\r\n var ia = I[n + ba | 0],\r\n ca = ia & 255;\r\n if (0 != ia << 24 >> 24) {\r\n 0 == (b[(ca << 2 >> 2) + e] | 0) && P(q.ac | 0, q.a | 0, 2334);\r\n var ja = (ca << 2) + l | 0,\r\n V = t[ja >> 2];\r\n b[ja >> 2] = V + 1 | 0;\r\n V >>> 0 >= z >>> 0 && P(q.bc | 0, q.a | 0, 2338);\r\n Da[b[fa >> 2] + (V << 1) >> 1] = ba & 65535\r\n }\r\n var S = ba + 1 | 0;\r\n if ((S | 0) == (f | 0)) break;\r\n ba = S\r\n }\r\n var X = I[ha],\r\n ea = (X & 255) >>> 0 < u >>> 0 ? u : 0,\r\n da = a + 8 | 0;\r\n b[da >> 2] = ea;\r\n var xc = 0 != (ea | 0);\r\n if (xc) {\r\n var oa = 1 << ea,\r\n ua = a + 164 | 0;\r\n if (oa >>> 0 > t[ua >> 2] >>> 0) {\r\n b[ua >> 2] = oa;\r\n var Y = a + 168 | 0,\r\n yc = b[Y >> 2];\r\n 0 != (yc | 0) && Va(yc);\r\n var Ca = va(oa);\r\n b[Y >> 2] = Ca;\r\n if (0 == (Ca | 0)) {\r\n E = 0;\r\n break a\r\n }\r\n Xa(Ca, -1, oa << 2, 1);\r\n if (0 == (ea | 0)) var aa = 26;\r\n else ra = Y, aa = 34\r\n } else {\r\n var la = a + 168 | 0;\r\n Xa(b[la >> 2], -1, oa << 2, 1);\r\n var ra = la;\r\n aa = 34\r\n }\r\n b: do\r\n if (34 == aa)\r\n for (var pa = 1; ;) {\r\n var xa = 0 == (b[(pa << 2 >> 2) + e] | 0);\r\n c: do\r\n if (!xa) {\r\n var Ba = ea - pa | 0,\r\n Aa = 1 << Ba,\r\n ta = pa - 1 | 0,\r\n za = t[(ta << 2 >> 2) + r],\r\n zc = Nd(a, pa);\r\n if (!(za >>> 0 > zc >>> 0))\r\n for (var Ja = b[((ta << 2) + 96 >> 2) + c] - za | 0, Ha = pa << 16, ya = za; ;) {\r\n var Ka = Z[b[fa >> 2] + (Ja + ya << 1) >> 1] & 65535;\r\n (I[n + Ka | 0] & 255 | 0) != (pa | 0) && P(q.cc | 0, q.a | 0, 2380);\r\n for (var La = ya << Ba, Oa = Ka | Ha, Ga = 0; ;) {\r\n var ub = Ga + La | 0;\r\n ub >>> 0 >= oa >>> 0 && P(q.ec | 0, q.a | 0, 2386);\r\n var vb = t[ra >> 2];\r\n if (-1 == (b[vb + (ub << 2) >> 2] | 0)) var Ac = vb;\r\n else P(q.fc | 0, q.a | 0, 2388), Ac = b[ra >> 2];\r\n b[Ac + (ub << 2) >> 2] = Oa;\r\n var Ia = Ga + 1 | 0;\r\n if (Ia >>> 0 >= Aa >>> 0) break;\r\n Ga = Ia\r\n }\r\n var wa = ya + 1 | 0;\r\n if (wa >>> 0 > zc >>> 0) break c;\r\n ya = wa\r\n }\r\n }\r\n while (0);\r\n var Ea = pa + 1 | 0;\r\n if (Ea >>> 0 > ea >>> 0) break b;\r\n pa = Ea\r\n }\r\n while (0);\r\n var Ma = D[ha]\r\n } else Ma = X;\r\n var Na = a + 96 | 0;\r\n b[Na >> 2] = b[Na >> 2] - b[r] | 0;\r\n var Qa = a + 100 | 0;\r\n b[Qa >> 2] = b[Qa >> 2] - b[r + 1] | 0;\r\n var Sa = a + 104 | 0;\r\n b[Sa >> 2] = b[Sa >> 2] - b[r + 2] | 0;\r\n var Bc = a + 108 | 0;\r\n b[Bc >> 2] = b[Bc >> 2] - b[r + 3] | 0;\r\n var Cc = a + 112 | 0;\r\n b[Cc >> 2] = b[Cc >> 2] - b[r + 4] | 0;\r\n var Gb = a + 116 | 0;\r\n b[Gb >> 2] = b[Gb >> 2] - b[r + 5] | 0;\r\n var Pa = a + 120 | 0;\r\n b[Pa >> 2] = b[Pa >> 2] - b[r + 6] | 0;\r\n var nb = a + 124 | 0;\r\n b[nb >> 2] = b[nb >> 2] - b[r + 7] | 0;\r\n var Ta = a + 128 | 0;\r\n b[Ta >> 2] = b[Ta >> 2] - b[r + 8] | 0;\r\n var Dc = a + 132 | 0;\r\n b[Dc >> 2] = b[Dc >> 2] - b[r + 9] | 0;\r\n var Ec = a + 136 | 0;\r\n b[Ec >> 2] = b[Ec >> 2] - b[r + 10] | 0;\r\n var rb = a + 140 | 0;\r\n b[rb >> 2] = b[rb >> 2] - b[r + 11] | 0;\r\n var Hb = a + 144 | 0;\r\n b[Hb >> 2] = b[Hb >> 2] - b[r + 12] | 0;\r\n var Ib = a + 148 | 0;\r\n b[Ib >> 2] = b[Ib >> 2] - b[r + 13] | 0;\r\n var Jb = a + 152 | 0;\r\n b[Jb >> 2] = b[Jb >> 2] - b[r + 14] | 0;\r\n var ob = a + 156 | 0;\r\n b[ob >> 2] = b[ob >> 2] - b[r + 15] | 0;\r\n var Kb = a + 16 | 0;\r\n b[Kb >> 2] = 0;\r\n var Za = (a + 20 | 0) >> 2;\r\n b[Za] = Ma & 255;\r\n b: do\r\n if (xc) {\r\n for (var sb = ea; ;) {\r\n if (0 == (sb | 0)) break b;\r\n var $a = sb - 1 | 0;\r\n if (0 != (b[(sb << 2 >> 2) + e] | 0)) break;\r\n sb = $a\r\n }\r\n b[Kb >> 2] = b[(($a << 2) + 28 >> 2) + c];\r\n for (var Lb = ea + 1 | 0, Ra = b[Za] = Lb; ;) {\r\n if (Ra >>> 0 > B >>> 0) break b;\r\n if (0 != (b[(Ra << 2 >> 2) + e] | 0)) break;\r\n Ra = Ra + 1 | 0\r\n }\r\n b[Za] = Ra\r\n }\r\n while (0);\r\n b[c + 23] = -1;\r\n b[c + 40] = 1048575;\r\n b[c + 3] = 32 - b[da >> 2] | 0;\r\n E = 1\r\n }\r\n while (0);\r\n M = N;\r\n return E\r\n }\r\n\r\n function Ua(a) {\r\n Xa(a, 0, 68, 1)\r\n }\r\n\r\n function ab(a) {\r\n if (0 != (a | 0)) {\r\n var f = b[a - 4 >> 2];\r\n a = a - 8 | 0;\r\n var n = 0 == (f | 0) ? 4 : (f | 0) == (b[a >> 2] ^ -1 | 0) ? 5 : 4;\r\n 4 == n && P(q.M | 0, q.a | 0, 696);\r\n aa(a)\r\n }\r\n }\r\n\r\n function Ya(a) {\r\n a = 0 == (a | 0) ? 1 : a;\r\n var f = J((a << 1) + 8 | 0, 0);\r\n 0 == (f | 0) ? a = 0 : (b[f + 4 >> 2] = a, b[f >> 2] = a ^ -1, a = f + 8 | 0);\r\n return a\r\n }\r\n\r\n function Va(a) {\r\n if (0 != (a | 0)) {\r\n var f = b[a - 4 >> 2];\r\n a = a - 8 | 0;\r\n var n = 0 == (f | 0) ? 4 : (f | 0) == (b[a >> 2] ^ -1 | 0) ? 5 : 4;\r\n 4 == n && P(q.M | 0, q.a | 0, 696);\r\n aa(a)\r\n }\r\n }\r\n\r\n function va(a) {\r\n a = 0 == (a | 0) ? 1 : a;\r\n var f = J((a << 2) + 8 | 0, 0);\r\n 0 == (f | 0) ? a = 0 : (b[f + 4 >> 2] = a, b[f >> 2] = a ^ -1, a = f + 8 | 0);\r\n return a\r\n }\r\n\r\n function Nd(a, f) {\r\n 0 != (f | 0) & 17 > f >>> 0 || P(q.Zb | 0, q.a | 0, 2018);\r\n a = b[a + (f - 1 << 2) + 28 >> 2];\r\n return 0 == (a | 0) ? -1 : (a - 1 | 0) >>> ((16 - f | 0) >>> 0)\r\n }\r\n\r\n function pa(a) {\r\n return (I[a | 0] & 255) << 8 | I[a + 1 | 0] & 255\r\n }\r\n\r\n function pb(a) {\r\n return (I[a + 1 | 0] & 255) << 16 | (I[a | 0] & 255) << 24 | I[a + 3 | 0] & 255 | (I[a + 2 | 0] & 255) << 8\r\n }\r\n\r\n function Ka(a) {\r\n return I[a | 0] & 255\r\n }\r\n\r\n function Na(a) {\r\n return I[a + 2 | 0] & 255 | (I[a | 0] & 255) << 16 | (I[a + 1 | 0] & 255) << 8\r\n }\r\n\r\n function Od(a) {\r\n return 0 != (D[a + 12 | 0] & 1) << 24 >> 24\r\n }\r\n\r\n function Pd(a, f, n, u) {\r\n 0 == (a | 0) ? (a = db(f), 0 == (n | 0) ? n = a : (b[n >> 2] = 0 == (a | 0) ? 0 : bc(a), n = a)) : 0 == (f | 0) ? (eb(a), 0 != (n | 0) && (b[n >> 2] = 0), n = 0) : (u ? (f = Qd(a, f), 0 == (f | 0) ? f = 0 : a = f) : f = 0, 0 != (n | 0) && (b[n >> 2] = bc(a)), n = f);\r\n return n\r\n }\r\n\r\n function Rd(a) {\r\n return 0 == (a | 0) ? 0 : bc(a)\r\n }\r\n\r\n function mb(a) {\r\n P(a, q.a | 0, 2602)\r\n }\r\n\r\n function Sd(a, b) {\r\n 0 == a && 0 == b || 9 == a && 0 == b ? a = 4 : 1 == a && 0 == b || 2 == a && 0 == b || 7 == a && 0 == b || 8 == a && 0 == b || 3 == a && 0 == b || 4 == a && 0 == b || 5 == a && 0 == b || 6 == a && 0 == b ? a = 8 : (P(q.Mb | 0, q.a | 0, 2766), a = 0);\r\n return a\r\n }\r\n\r\n function Fc(a, b) {\r\n return Sd(a, b) << 1 & 536870910\r\n }\r\n\r\n function Gc(a, b, n) {\r\n if (0 == (b | 0) | 74 > n >>> 0) var f = 0;\r\n else 18552 != (pa(b) | 0) ? f = 0 : 74 > pa(b + 2 | 0) >>> 0 ? f = 0 : pb(b + 6 | 0) >>> 0 > n >>> 0 ? f = 0 : f = b;\r\n return f\r\n }\r\n\r\n function Sa(a, f, n) {\r\n var u = n >> 2;\r\n 0 == (a | 0) | 74 > f >>> 0 | 0 == (n | 0) ? u = 0 : 40 != (b[u] | 0) ? u = 0 : (a = Gc(0, a, f), 0 == (a | 0) ? u = 0 : (b[u + 1] = pa(a + 12 | 0), b[u + 2] = pa(a + 14 | 0), b[u + 3] = Ka(a + 16 | 0), b[u + 4] = Ka(a + 17 | 0), f = a + 18 | 0, n = n + 32 | 0, b[n >> 2] = Ka(f), b[n + 4 >> 2] = 0, n = Ka(f), b[u + 5] = 0 == (n | 0) ? 8 : 9 == (n | 0) ? 8 : 16, b[u + 6] = pb(a + 25 | 0), b[u + 7] = pb(a + 29 | 0), u = 1));\r\n return u\r\n }\r\n\r\n function Ha(a) {\r\n b[a >> 2] = 0;\r\n Hc(a + 4 | 0);\r\n b[a + 20 >> 2] = 0\r\n }\r\n\r\n function Hc(a) {\r\n Td(a)\r\n }\r\n\r\n function Ud(a, f) {\r\n if ((a | 0) != (f | 0)) {\r\n b[a >> 2] = b[f >> 2];\r\n var n = a + 4 | 0;\r\n Vd(n, f + 4 | 0);\r\n if (Od(n)) Ic(a);\r\n else {\r\n n = b[f + 20 >> 2];\r\n f = (a + 20 | 0) >> 2;\r\n var u = b[f];\r\n 0 == (n | 0) ? (cc(u), b[f] = 0) : 0 == (u | 0) ? (n = Wd(n), b[f] = n) : Jc(u, n)\r\n }\r\n }\r\n return a\r\n }\r\n\r\n function Xd(a) {\r\n Yd(a)\r\n }\r\n\r\n function cc(a) {\r\n 0 != (a | 0) && (Zd(a), aa(a))\r\n }\r\n\r\n function Vd(a, b) {\r\n $d(a, b);\r\n return a\r\n }\r\n\r\n function Ic(a) {\r\n b[a >> 2] = 0;\r\n dc(a + 4 | 0);\r\n a = a + 20 | 0;\r\n var f = b[a >> 2];\r\n 0 != (f | 0) && (cc(f), b[a >> 2] = 0)\r\n }\r\n\r\n function ae(a, f) {\r\n b[a >> 2] = 0;\r\n Hc(a + 4 | 0);\r\n b[a + 20 >> 2] = 0;\r\n Ud(a, f)\r\n }\r\n\r\n function ya(a) {\r\n var f = b[a + 20 >> 2];\r\n 0 != (f | 0) && cc(f);\r\n Xd(a + 4 | 0)\r\n }\r\n\r\n function be(a) {\r\n var b = 0 == (a | 0);\r\n a: do\r\n if (b) var n = 0;\r\n else\r\n for (b = 0; ;)\r\n if (a >>>= 1, b = b + 1 | 0, 0 == (a | 0)) {\r\n n = b;\r\n break a\r\n }\r\n while (0);\r\n return n\r\n }\r\n\r\n function ce(a) {\r\n return b[a + 4 >> 2]\r\n }\r\n\r\n function Kc(a) {\r\n a >>= 2;\r\n b[a] = 0;\r\n b[a + 1] = 0;\r\n b[a + 2] = 0;\r\n b[a + 3] = 0;\r\n b[a + 4] = 0;\r\n b[a + 5] = 0\r\n }\r\n\r\n function de(a) {\r\n b[a + 16 >> 2] = 0;\r\n b[a + 20 >> 2] = 0\r\n }\r\n\r\n function Jc(a, f) {\r\n if ((a | 0) != (f | 0)) {\r\n ee(a);\r\n fb(a, f, 180, 1);\r\n var n = f + 168 | 0;\r\n if (0 != (b[n >> 2] | 0)) {\r\n var u = a + 164 | 0,\r\n c = va(b[u >> 2]);\r\n b[a + 168 >> 2] = c;\r\n 0 != (c | 0) && fb(c, b[n >> 2], b[u >> 2] << 2, 1)\r\n }\r\n f = f + 176 | 0;\r\n 0 != (b[f >> 2] | 0) && (n = a + 172 | 0, u = Ya(b[n >> 2]), b[a + 176 >> 2] = u, 0 != (u | 0) && fb(u, b[f >> 2], b[n >> 2] << 1, 1))\r\n }\r\n return a\r\n }\r\n\r\n function Wd(a) {\r\n var b = J(180, 0);\r\n return 0 == (b | 0) ? 0 : fe(b, a)\r\n }\r\n\r\n function dc(a) {\r\n var f = a | 0,\r\n n = b[f >> 2];\r\n if (0 != (n | 0)) {\r\n var u = a + 4 | 0;\r\n aa(n);\r\n b[f >> 2] = 0;\r\n b[u >> 2] = 0;\r\n b[a + 8 >> 2] = 0\r\n }\r\n D[a + 12 | 0] = 0\r\n }\r\n\r\n function ec(a, f) {\r\n var n = (a + 4 | 0) >> 2;\r\n var u = t[n],\r\n c = (u | 0) == (f | 0);\r\n do\r\n if (c) var N = 1;\r\n else {\r\n if (u >>> 0 <= f >>> 0) {\r\n if (t[a + 8 >> 2] >>> 0 < f >>> 0) {\r\n if (!Lc(a, f, (u + 1 | 0) == (f | 0))) {\r\n N = 0;\r\n break\r\n }\r\n N = b[n]\r\n } else N = u;\r\n ge(b[a >> 2] + N | 0, f - N | 0)\r\n }\r\n b[n] = f;\r\n N = 1\r\n } while (0);\r\n return N\r\n }\r\n\r\n function gb(a, f) {\r\n t[a + 4 >> 2] >>> 0 <= f >>> 0 && P(q.l | 0, q.a | 0, 968);\r\n return b[a >> 2] + f | 0\r\n }\r\n\r\n function he() {\r\n var a = J(180, 0);\r\n return 0 == (a | 0) ? 0 : ie(a)\r\n }\r\n\r\n function je(a) {\r\n a = t[a >> 2];\r\n return 16 < a >>> 0 ? ka(ke(a) + 1 | 0, 11) & 255 : 0\r\n }\r\n\r\n function Mc(a) {\r\n var f = a + 4 | 0,\r\n n = ce(f);\r\n 0 != (n | 0) & 8193 > n >>> 0 || P(q.Pb | 0, q.a | 0, 3106);\r\n var u = a | 0;\r\n b[u >> 2] = n;\r\n var c = a + 20 | 0,\r\n N = t[c >> 2];\r\n 0 == (N | 0) ? (n = he(), c = b[c >> 2] = n, u = b[u >> 2]) : (c = N, u = n);\r\n f = gb(f, 0);\r\n return Ja(c, u, f, je(a))\r\n }\r\n\r\n function ke(a) {\r\n var b = le(a);\r\n return 32 == (b | 0) ? 32 : (1 << b >>> 0 < a >>> 0 & 1) + b | 0\r\n }\r\n\r\n function Ta(a, b) {\r\n 0 == (b | 0) ? a = 0 : 16 < b >>> 0 ? (b = yb(a, b - 16 | 0), a = yb(a, 16), a = b << 16 | a) : a = yb(a, b);\r\n return a\r\n }\r\n\r\n function U(a, f) {\r\n var n = t[f + 20 >> 2] >> 2;\r\n var u = (a + 20 | 0) >> 2;\r\n var c = t[u];\r\n if (24 > (c | 0)) {\r\n var N = (a + 4 | 0) >> 2;\r\n var r = t[N],\r\n d = t[a + 8 >> 2],\r\n e = r >>> 0 < d >>> 0;\r\n 16 > (c | 0) ? (e ? (e = r + 1 | 0, r = (I[r] & 255) << 8) : (e = r, r = 0), e >>> 0 < d >>> 0 ? (d = e + 1 | 0, e = I[e] & 255) : (d = e, e = 0), b[N] = d, b[u] = c + 16 | 0, N = a + 16 | 0, c = (e | r) << 16 - c | b[N >> 2], b[N >> 2] = c) : (e ? (b[N] = r + 1 | 0, r = I[r] & 255) : r = 0, b[u] = c + 8 | 0, N = a + 16 | 0, c = r << 24 - c | b[N >> 2], b[N >> 2] = c)\r\n } else c = b[a + 16 >> 2];\r\n a = a + 16 | 0;\r\n N = (c >>> 16) + 1 | 0;\r\n if (N >>> 0 > t[n + 4] >>> 0) {\r\n d = t[n + 5];\r\n e = d - 1 | 0;\r\n var l = N >>> 0 > t[((e << 2) + 28 >> 2) + n] >>> 0;\r\n a: do\r\n if (l)\r\n for (; ;) {\r\n r = d + 1 | 0;\r\n if (N >>> 0 <= t[((d << 2) + 28 >> 2) + n] >>> 0) {\r\n var y = d;\r\n break a\r\n }\r\n d = r\r\n } else r = d, y = e; while (0);\r\n c = (c >>> ((32 - r | 0) >>> 0)) + b[((y << 2) + 96 >> 2) + n] | 0;\r\n if (c >>> 0 < t[f >> 2] >>> 0) {\r\n x = r;\r\n h = Z[b[n + 44] + (c << 1) >> 1] & 65535;\r\n var E = 22\r\n } else {\r\n P(q.L | 0, q.a | 0, 3375);\r\n var H = 0;\r\n E = 23\r\n }\r\n } else {\r\n x = t[b[n + 42] + (c >>> ((32 - b[n + 2] | 0) >>> 0) << 2) >> 2]; - 1 == (x | 0) && P(q.Tb | 0, q.a | 0, 3353);\r\n n = x & 65535;\r\n x >>>= 16;\r\n f = me(f + 4 | 0, n);\r\n if ((I[f] & 255 | 0) == (x | 0)) var x = x,\r\n h = n;\r\n else P(q.Ub | 0, q.a | 0, 3357), h = n;\r\n E = 22\r\n }\r\n 22 == E && (b[a >> 2] <<= x, b[u] = b[u] - x | 0, H = h);\r\n return H\r\n }\r\n\r\n function hb(a, f, n) {\r\n 0 == (n | 0) ? a = 0 : (b[a >> 2] = f, b[a + 4 >> 2] = f, b[a + 12 >> 2] = n, b[a + 8 >> 2] = f + n | 0, de(a), a = 1);\r\n return a\r\n }\r\n\r\n function yb(a, f) {\r\n 33 <= f >>> 0 && P(q.Qb | 0, q.a | 0, 3299);\r\n var n = (a + 20 | 0) >> 2;\r\n var u = t[n],\r\n c = (u | 0) < (f | 0);\r\n a: do\r\n if (c) {\r\n var N = a + 4 | 0;\r\n c = a + 8 | 0;\r\n for (var d = a + 16 | 0, e = u; ;)\r\n if (u = b[N >> 2], (u | 0) == (b[c >> 2] | 0) ? u = 0 : (b[N >> 2] = u + 1 | 0, u = I[u] & 255), e = e + 8 | 0, b[n] = e, 33 > (e | 0) || (P(q.Rb | 0, q.a | 0, 3308), e = b[n]), u = u << 32 - e | b[d >> 2], b[d >> 2] = u, (e | 0) >= (f | 0)) {\r\n N = e;\r\n d = u;\r\n break a\r\n }\r\n } else N = u, d = b[a + 16 >> 2]; while (0);\r\n b[a + 16 >> 2] = d << f;\r\n b[n] = N - f | 0;\r\n return d >>> ((32 - f | 0) >>> 0)\r\n }\r\n\r\n function me(a, f) {\r\n t[a + 4 >> 2] >>> 0 <= f >>> 0 && P(q.l | 0, q.a | 0, 967);\r\n return b[a >> 2] + f | 0\r\n }\r\n\r\n function wa(a, b) {\r\n var f = M;\r\n M += 24;\r\n var u = f,\r\n c = Ta(a, be(8192));\r\n if (0 == (c | 0)) Ic(b), a = 1;\r\n else {\r\n var d = b + 4 | 0;\r\n if (ec(d, c)) {\r\n var r = gb(d, 0);\r\n Xa(r, 0, c, 1);\r\n r = Ta(a, 5);\r\n if (0 == (r | 0) | 21 < r >>> 0) a = 0;\r\n else {\r\n Ha(u);\r\n var e = u + 4 | 0,\r\n h = ec(e, 21);\r\n a: do\r\n if (h) {\r\n for (var l = 0; ;) {\r\n var y = Ta(a, 3),\r\n E = gb(e, I[q.ba + l | 0] & 255);\r\n D[E] = y & 255;\r\n l = l + 1 | 0;\r\n if ((l | 0) == (r | 0)) break\r\n }\r\n if (Mc(u)) b: for (r = 0; ;) {\r\n l = r >>> 0 < c >>> 0;\r\n e = c - r | 0;\r\n y = 0 == (r | 0);\r\n for (E = r - 1 | 0; ;) {\r\n if (!l) {\r\n if ((r | 0) != (c | 0)) {\r\n l = 0;\r\n break a\r\n }\r\n l = Mc(b);\r\n break a\r\n }\r\n h = U(a, u);\r\n if (17 > h >>> 0) {\r\n e = gb(d, r);\r\n D[e] = h & 255;\r\n r = r + 1 | 0;\r\n continue b\r\n }\r\n if (17 == (h | 0)) {\r\n h = Ta(a, 3) + 3 | 0;\r\n if (h >>> 0 > e >>> 0) {\r\n l = 0;\r\n break a\r\n }\r\n r = h + r | 0;\r\n continue b\r\n } else if (18 == (h | 0)) {\r\n h = Ta(a, 7) + 11 | 0;\r\n if (h >>> 0 > e >>> 0) {\r\n l = 0;\r\n break a\r\n }\r\n r = h + r | 0;\r\n continue b\r\n } else {\r\n if (2 <= (h - 19 | 0) >>> 0) {\r\n P(q.L | 0, q.a | 0, 3249);\r\n l = 0;\r\n break a\r\n }\r\n var H = 19 == (h | 0) ? Ta(a, 2) + 3 | 0 : Ta(a, 6) + 7 | 0;\r\n if (y | H >>> 0 > e >>> 0) {\r\n l = 0;\r\n break a\r\n }\r\n h = gb(d, E);\r\n h = I[h];\r\n if (0 == h << 24 >> 24) {\r\n l = 0;\r\n break a\r\n }\r\n H = H + r | 0;\r\n if (r >>> 0 < H >>> 0) {\r\n e = r;\r\n break\r\n }\r\n }\r\n }\r\n for (; ;)\r\n if (r = gb(d, e), e = e + 1 | 0, D[r] = h, (e | 0) == (H | 0)) {\r\n r = H;\r\n continue b\r\n }\r\n } else l = 0\r\n } else l = 0; while (0);\r\n ya(u);\r\n a = l\r\n }\r\n } else a = 0\r\n }\r\n M = f;\r\n return a\r\n }\r\n\r\n function Nc(a) {\r\n return 519686845 == (b[a >> 2] | 0)\r\n }\r\n\r\n function ne(a, b) {\r\n if (0 == (a | 0) | 62 > b >>> 0) a = 0;\r\n else {\r\n var f = oe();\r\n 0 == (f | 0) ? a = 0 : pe(f, a, b) ? a = f : (Oc(f), a = 0)\r\n }\r\n return a\r\n }\r\n\r\n function oe() {\r\n var a = J(300, 0);\r\n return 0 == (a | 0) ? 0 : qe(a)\r\n }\r\n\r\n function pe(a, f, n) {\r\n var u = Gc(0, f, n);\r\n b[a + 88 >> 2] = u;\r\n if (0 == (u | 0)) var c = 0;\r\n else b[a + 4 >> 2] = f, b[a + 8 >> 2] = n, re(a) ? c = se(a) : c = 0;\r\n return c\r\n }\r\n\r\n function Oc(a) {\r\n 0 != (a | 0) && (te(a), aa(a))\r\n }\r\n\r\n function ue(a, b, n, u, c) {\r\n if (0 == (a | 0) | 0 == (b | 0) | 8 > n >>> 0 | 15 < c >>> 0) var f = 0;\r\n else Nc(a) ? f = ve(a, b, n, u, c) : f = 0;\r\n return f\r\n }\r\n\r\n function ve(a, f, n, u, c) {\r\n var d = t[a + 88 >> 2],\r\n r = pb((c << 2) + d + 70 | 0),\r\n e = b[a + 8 >> 2],\r\n na = c + 1 | 0;\r\n d = na >>> 0 < Ka(d + 16 | 0) >>> 0 ? pb((na << 2) + d + 70 | 0) : e;\r\n d >>> 0 <= r >>> 0 && P(q.Wb | 0, q.a | 0, 3794);\r\n return Pc(a, b[a + 4 >> 2] + r | 0, d - r | 0, f, n, u, c)\r\n }\r\n\r\n function Pc(a, f, n, u, c, d, r) {\r\n var N = a + 88 | 0,\r\n e = t[N >> 2],\r\n na = (qa(pa(e + 12 | 0) >>> (r >>> 0), 1) + 3 | 0) >>> 2;\r\n r = (qa(pa(e + 14 | 0) >>> (r >>> 0), 1) + 3 | 0) >>> 2;\r\n e = Ka(e + 18 | 0);\r\n e = (0 == (e | 0) ? 8 : 9 == (e | 0) ? 8 : 16) * na | 0;\r\n if (0 == (d | 0)) {\r\n var y = e;\r\n var E = 5\r\n } else if (e >>> 0 <= d >>> 0 & 0 == (d & 3 | 0)) y = d, E = 5;\r\n else {\r\n var H = 0;\r\n E = 12\r\n }\r\n 5 == E && ((y * r | 0) >>> 0 > c >>> 0 ? H = 0 : (c = (na + 1 | 0) >>> 1, d = (r + 1 | 0) >>> 1, hb(a + 92 | 0, f, n) ? (f = Ka(b[N >> 2] + 18 | 0), 0 == (f | 0) ? (Qc(a, u, 0, y, na, r, c, d), H = 1) : 2 == (f | 0) || 3 == (f | 0) || 5 == (f | 0) || 6 == (f | 0) || 4 == (f | 0) ? (Rc(a, u, 0, y, na, r, c, d), H = 1) : 9 == (f | 0) ? (Sc(a, u, 0, y, na, r, c, d), H = 1) : 7 == (f | 0) || 8 == (f | 0) ? (Tc(a, u, 0, y, na, r, c, d), H = 1) : H = 0) : H = 0));\r\n return H\r\n }\r\n\r\n function we(a) {\r\n 0 == (a | 0) ? a = 0 : Nc(a) ? (Oc(a), a = 1) : a = 0;\r\n return a\r\n }\r\n\r\n function xe(a, f) {\r\n var n = M;\r\n M += 40;\r\n var c = n;\r\n Wa(c);\r\n Sa(a, f, c);\r\n a = b[c + 4 >> 2];\r\n M = n;\r\n return a\r\n }\r\n\r\n function Wa(a) {\r\n ye(a)\r\n }\r\n\r\n function ze(a, f) {\r\n var n = M;\r\n M += 40;\r\n var c = n;\r\n Wa(c);\r\n Sa(a, f, c);\r\n a = b[c + 8 >> 2];\r\n M = n;\r\n return a\r\n }\r\n\r\n function Ae(a, f) {\r\n var n = M;\r\n M += 40;\r\n var c = n;\r\n Wa(c);\r\n Sa(a, f, c);\r\n a = b[c + 12 >> 2];\r\n M = n;\r\n return a\r\n }\r\n\r\n function Be(a, f) {\r\n var n = M;\r\n M += 40;\r\n var c = n;\r\n Wa(c);\r\n Sa(a, f, c);\r\n a = b[(c + 32 | 0) >> 2];\r\n M = n;\r\n return a\r\n }\r\n\r\n function Ce(a, f) {\r\n var n = M;\r\n M += 40;\r\n var c = n;\r\n Wa(c);\r\n Sa(a, f, c);\r\n a = (b[c + 4 >> 2] + 3 | 0) >>> 2;\r\n f = (b[c + 8 >> 2] + 3 | 0) >>> 2;\r\n c = c + 32 | 0;\r\n c = Fc(b[c >> 2], b[c + 4 >> 2]);\r\n M = n;\r\n return f * a * c | 0\r\n }\r\n\r\n function De(a, f, n, c) {\r\n var u = M;\r\n M += 44;\r\n var d = u,\r\n r = u + 40;\r\n Wa(d);\r\n Sa(a, f, d);\r\n var e = (b[d + 4 >> 2] + 3 | 0) >>> 2;\r\n d = d + 32 | 0;\r\n d = Fc(b[d >> 2], b[d + 4 >> 2]);\r\n e = e * d | 0;\r\n a = ne(a, f);\r\n r |= 0;\r\n b[r >> 2] = n;\r\n ue(a, r, c, e, 0);\r\n we(a);\r\n M = u\r\n }\r\n\r\n function te(a) {\r\n Ee(a)\r\n }\r\n\r\n function Ee(a) {\r\n Uc(a)\r\n }\r\n\r\n function Fe(a) {\r\n b[a >> 2] = 0;\r\n b[a + 4 >> 2] = 0;\r\n b[a + 8 >> 2] = 0;\r\n D[a + 12 | 0] = 0\r\n }\r\n\r\n function Ge(a) {\r\n b[a >> 2] = 0;\r\n b[a + 4 >> 2] = 0;\r\n b[a + 8 >> 2] = 0;\r\n D[a + 12 | 0] = 0\r\n }\r\n\r\n function He(a) {\r\n b[a + 164 >> 2] = 0;\r\n b[a + 168 >> 2] = 0;\r\n b[a + 172 >> 2] = 0;\r\n b[a + 176 >> 2] = 0\r\n }\r\n\r\n function Td(a) {\r\n b[a >> 2] = 0;\r\n b[a + 4 >> 2] = 0;\r\n b[a + 8 >> 2] = 0;\r\n D[a + 12 | 0] = 0\r\n }\r\n\r\n function ye(a) {\r\n b[a >> 2] = 40\r\n }\r\n\r\n function Vc(a) {\r\n Ie(a)\r\n }\r\n\r\n function Wc(a) {\r\n Je(a)\r\n }\r\n\r\n function Je(a) {\r\n Ke(a)\r\n }\r\n\r\n function Ke(a) {\r\n var f = a | 0,\r\n n = b[f >> 2];\r\n if (0 != (n | 0)) {\r\n var c = a + 4 | 0;\r\n aa(n);\r\n b[f >> 2] = 0;\r\n b[c >> 2] = 0;\r\n b[a + 8 >> 2] = 0\r\n }\r\n D[a + 12 | 0] = 0\r\n }\r\n\r\n function Ie(a) {\r\n Le(a)\r\n }\r\n\r\n function Le(a) {\r\n var f = a | 0,\r\n n = b[f >> 2];\r\n if (0 != (n | 0)) {\r\n var c = a + 4 | 0;\r\n aa(n);\r\n b[f >> 2] = 0;\r\n b[c >> 2] = 0;\r\n b[a + 8 >> 2] = 0\r\n }\r\n D[a + 12 | 0] = 0\r\n }\r\n\r\n function qe(a) {\r\n 0 == (a | 0) ? a = 0 : Me(a);\r\n return a\r\n }\r\n\r\n function Me(a) {\r\n Ne(a)\r\n }\r\n\r\n function Ne(a) {\r\n b[a >> 2] = 519686845;\r\n b[a + 4 >> 2] = 0;\r\n b[a + 8 >> 2] = 0;\r\n b[a + 88 >> 2] = 0;\r\n Kc(a + 92 | 0);\r\n Ha(a + 116 | 0);\r\n Ha(a + 140 | 0);\r\n Ha(a + 164 | 0);\r\n Ha(a + 188 | 0);\r\n Ha(a + 212 | 0);\r\n Xc(a + 236 | 0);\r\n Xc(a + 252 | 0);\r\n Yc(a + 268 | 0);\r\n Yc(a + 284 | 0)\r\n }\r\n\r\n function Xc(a) {\r\n Ge(a)\r\n }\r\n\r\n function Yc(a) {\r\n Fe(a)\r\n }\r\n\r\n function ie(a) {\r\n 0 == (a | 0) ? a = 0 : Oe(a);\r\n return a\r\n }\r\n\r\n function Oe(a) {\r\n He(a)\r\n }\r\n\r\n function Lc(a, b, n) {\r\n la(a, b, n, 1, 0) ? a = 1 : (D[a + 12 | 0] = 1, a = 0);\r\n return a\r\n }\r\n\r\n function ge(a, b) {\r\n Xa(a, 0, b, 1)\r\n }\r\n\r\n function fe(a, b) {\r\n 0 == (a | 0) ? a = 0 : Pe(a, b);\r\n return a\r\n }\r\n\r\n function Pe(a, b) {\r\n Qe(a, b)\r\n }\r\n\r\n function Qe(a, f) {\r\n b[a + 164 >> 2] = 0;\r\n b[a + 168 >> 2] = 0;\r\n b[a + 172 >> 2] = 0;\r\n b[a + 176 >> 2] = 0;\r\n Jc(a, f)\r\n }\r\n\r\n function $d(a, f) {\r\n var n = (a | 0) == (f | 0);\r\n do\r\n if (n) var c = 1;\r\n else {\r\n c = (f + 4 | 0) >> 2;\r\n if ((b[a + 8 >> 2] | 0) == (b[c] | 0)) ec(a, 0);\r\n else if (dc(a), !Lc(a, b[c], 0)) {\r\n c = 0;\r\n break\r\n }\r\n fb(b[a >> 2], b[f >> 2], b[c], 1);\r\n b[a + 4 >> 2] = b[c];\r\n c = 1\r\n } while (0);\r\n return c\r\n }\r\n\r\n function Zd(a) {\r\n Re(a)\r\n }\r\n\r\n function Re(a) {\r\n Se(a)\r\n }\r\n\r\n function Se(a) {\r\n var f = b[a + 168 >> 2];\r\n 0 != (f | 0) && Va(f);\r\n a = b[a + 176 >> 2];\r\n 0 != (a | 0) && ab(a)\r\n }\r\n\r\n function Yd(a) {\r\n dc(a)\r\n }\r\n\r\n function Qc(a, f, c, u, d, N, r, e) {\r\n var n, na = M;\r\n M += 24;\r\n var y = na;\r\n var E = y >> 2;\r\n var H = na + 4;\r\n var x = H >> 2;\r\n c = na + 8 >> 2;\r\n var h = a + 236 | 0,\r\n l = zb(h),\r\n g = a + 252 | 0,\r\n Fa = zb(g);\r\n b[E] = 0;\r\n b[x] = 0;\r\n var k = Ka(b[a + 88 >> 2] + 17 | 0),\r\n p = u >>> 2,\r\n m = 0 == (k | 0);\r\n a: do\r\n if (!m) {\r\n m = 0 == (e | 0);\r\n var v = e - 1 | 0;\r\n N = 0 != (N & 1 | 0);\r\n var A = u << 1,\r\n w = a + 92 | 0,\r\n z = a + 116 | 0,\r\n B = a + 188 | 0,\r\n G = p + 1 | 0,\r\n D = p + 2 | 0,\r\n C = p + 3 | 0,\r\n K = r - 1 | 0;\r\n a = a + 140 | 0;\r\n var F = K << 4;\r\n d = 0 != (d & 1 | 0);\r\n for (var J = 0, L = 1; ;) {\r\n b: do\r\n if (m) var O = L;\r\n else {\r\n O = b[f + (J << 2) >> 2];\r\n for (var P = 0, W = L; ;) {\r\n if (0 == (P & 1 | 0)) {\r\n var Q = O;\r\n L = 16;\r\n var Z = 1,\r\n fa = r,\r\n ha = 0\r\n } else Q = O + F | 0, L = -16, fa = Z = -1, ha = K;\r\n var ba = (P | 0) == (v | 0),\r\n ia = ba & N,\r\n ca = (ha | 0) == (fa | 0);\r\n c: do\r\n if (ca) var ja = W;\r\n else\r\n for (ja = ba & N ^ 1, ba = W, W = Q, Q = W >> 2; ;) {\r\n ca = 1 == (ba | 0) ? U(w, z) | 512 : ba;\r\n ba = ca & 7;\r\n ca >>>= 3;\r\n var V = I[q.h + ba | 0] & 255;\r\n var S = 0;\r\n for (n = b[E]; ;) {\r\n var X = U(w, a);\r\n b[E] = n + X | 0;\r\n ma(y, l);\r\n n = t[E];\r\n X = za(h, n);\r\n b[(S << 2 >> 2) + c] = b[X >> 2];\r\n S = S + 1 | 0;\r\n if (S >>> 0 >= V >>> 0) break\r\n }\r\n V = (ha | 0) == (K | 0) & d;\r\n S = W >> 2;\r\n n = ia | V;\r\n d: do\r\n if (n)\r\n for (S = 0; ;) {\r\n var ea = S * u | 0;\r\n n = ea >> 2;\r\n var da = W + ea | 0,\r\n R = 0 == (S | 0) | ja;\r\n X = S << 1;\r\n var oa = U(w, B);\r\n b[x] = b[x] + oa | 0;\r\n ma(H, Fa);\r\n V ? (R ? (b[da >> 2] = b[((I[(ba << 2) + ta + X | 0] & 255) << 2 >> 2) + c], X = za(g, b[x]), b[n + (Q + 1)] = b[X >> 2], n = U(w, B), b[x] = b[x] + n | 0) : (n = U(w, B), b[x] = b[x] + n | 0), ma(H, Fa)) : R ? (b[da >> 2] = b[((I[(ba << 2) + ta + X | 0] & 255) << 2 >> 2) + c], da = za(g, b[x]), b[n + (Q + 1)] = b[da >> 2], ea = ea + (W + 8) | 0, da = U(w, B), b[x] = b[x] + da | 0, ma(H, Fa), b[ea >> 2] = b[((I[(ba << 2) + ta + (X | 1) | 0] & 255) << 2 >> 2) + c], X = za(g, b[x]), b[n + (Q + 3)] = b[X >> 2]) : (n = U(w, B), b[x] = b[x] + n | 0, ma(H, Fa));\r\n S = S + 1 | 0;\r\n if (2 == (S | 0)) break d\r\n } else b[S] = b[((I[(ba << 2) + ta | 0] & 255) << 2 >> 2) + c], X = U(w, B), b[x] = b[x] + X | 0, ma(H, Fa), X = za(g, b[x]), b[Q + 1] = b[X >> 2], b[Q + 2] = b[((I[(ba << 2) + ta + 1 | 0] & 255) << 2 >> 2) + c], X = U(w, B), b[x] = b[x] + X | 0, ma(H, Fa), X = za(g, b[x]), b[Q + 3] = b[X >> 2], b[(p << 2 >> 2) + S] = b[((I[(ba << 2) + ta + 2 | 0] & 255) << 2 >> 2) + c], X = U(w, B), b[x] = b[x] + X | 0, ma(H, Fa), X = za(g, b[x]), b[(G << 2 >> 2) + S] = b[X >> 2], b[(D << 2 >> 2) + S] = b[((I[(ba << 2) + ta + 3 | 0] & 255) << 2 >> 2) + c], X = U(w, B), b[x] = b[x] + X | 0, ma(H, Fa), X = za(g, b[x]), b[(C << 2 >> 2) + S] = b[X >> 2]; while (0);\r\n ha = ha + Z | 0;\r\n if ((ha | 0) == (fa | 0)) {\r\n ja = ca;\r\n break c\r\n }\r\n ba = ca;\r\n W = W + L | 0;\r\n Q = W >> 2\r\n }\r\n while (0);\r\n P = P + 1 | 0;\r\n if ((P | 0) == (e | 0)) {\r\n O = ja;\r\n break b\r\n }\r\n O = O + A | 0;\r\n W = ja\r\n }\r\n } while (0); J = J + 1 | 0;\r\n if ((J | 0) == (k | 0)) break a; L = O\r\n }\r\n }\r\n while (0);\r\n M = na;\r\n return 1\r\n }\r\n\r\n function Uc(a) {\r\n b[a >> 2] = 0;\r\n Vc(a + 284 | 0);\r\n Vc(a + 268 | 0);\r\n Wc(a + 252 | 0);\r\n Wc(a + 236 | 0);\r\n var f = a + 188 | 0;\r\n ya(a + 212 | 0);\r\n ya(f);\r\n f = a + 140 | 0;\r\n ya(a + 164 | 0);\r\n ya(f);\r\n ya(a + 116 | 0)\r\n }\r\n\r\n function ma(a, f) {\r\n var c = b[a >> 2];\r\n f = c - f | 0;\r\n var u = f >> 31;\r\n b[a >> 2] = u & c | f & (u ^ -1)\r\n }\r\n\r\n function fc(a) {\r\n return b[a + 4 >> 2]\r\n }\r\n\r\n function zb(a) {\r\n return b[a + 4 >> 2]\r\n }\r\n\r\n function Rc(a, f, c, u, d, N, r, e) {\r\n var n = M;\r\n M += 48;\r\n var na = n;\r\n var y = na >> 2;\r\n var E = n + 4;\r\n var H = E >> 2;\r\n var x = n + 8;\r\n var h = x >> 2;\r\n var l = n + 12;\r\n var g = l >> 2;\r\n var Fa = n + 16 >> 2;\r\n c = n + 32 >> 2;\r\n var k = a + 236 | 0,\r\n p = zb(k),\r\n m = a + 252 | 0,\r\n v = zb(m),\r\n w = a + 268 | 0,\r\n A = fc(w),\r\n z = b[a + 88 >> 2],\r\n B = pa(z + 63 | 0);\r\n b[y] = 0;\r\n b[H] = 0;\r\n b[h] = 0;\r\n b[g] = 0;\r\n z = Ka(z + 17 | 0);\r\n var G = 0 == (z | 0);\r\n a: do\r\n if (!G) {\r\n G = 0 == (e | 0);\r\n var D = e - 1 | 0;\r\n N = 0 == (N & 1 | 0);\r\n var K = u << 1,\r\n C = a + 92 | 0,\r\n F = a + 116 | 0,\r\n J = a + 212 | 0,\r\n L = a + 188 | 0,\r\n O = a + 284 | 0,\r\n P = a + 140 | 0;\r\n a = a + 164 | 0;\r\n var W = r - 1 | 0,\r\n Q = W << 5;\r\n d = 0 != (d & 1 | 0);\r\n for (var R = 0, fa = 1; ;) {\r\n b: do\r\n if (G) var ha = fa;\r\n else {\r\n ha = b[f + (R << 2) >> 2];\r\n for (var ba = 0, ia = fa; ;) {\r\n if (0 == (ba & 1 | 0)) {\r\n var ca = ha;\r\n fa = 32;\r\n var ja = 1,\r\n V = r,\r\n S = 0\r\n } else ca = ha + Q | 0, fa = -32, V = ja = -1, S = W;\r\n var X = N | (ba | 0) != (D | 0);\r\n var ea = (S | 0) == (V | 0);\r\n c: do\r\n if (ea) var da = ia;\r\n else\r\n for (da = ia; ;) {\r\n ia = 1 == (da | 0) ? U(C, F) | 512 : da;\r\n da = ia & 7;\r\n ia >>>= 3;\r\n ea = I[q.h + da | 0] & 255;\r\n for (var Y = 0, oa = b[h]; ;) {\r\n var ua = U(C, a);\r\n b[h] = oa + ua | 0;\r\n ma(x, A);\r\n oa = t[h];\r\n ua = Aa(w, oa);\r\n b[(Y << 2 >> 2) + c] = Z[ua >> 1] & 65535;\r\n Y = Y + 1 | 0;\r\n if (Y >>> 0 >= ea >>> 0) break\r\n }\r\n Y = 0;\r\n for (oa = b[y]; !(ua = U(C, P), b[y] = oa + ua | 0, ma(na, p), oa = t[y], ua = za(k, oa), b[(Y << 2 >> 2) + Fa] = b[ua >> 2], Y = Y + 1 | 0, Y >>> 0 >= ea >>> 0););\r\n Y = (S | 0) == (W | 0) & d;\r\n oa = ca;\r\n ea = oa >> 2;\r\n for (ua = 0; ;) {\r\n var ka = 0 == (ua | 0) | X;\r\n var aa = ua << 1;\r\n var Ca = U(C, J);\r\n b[g] = b[g] + Ca | 0;\r\n ma(l, B);\r\n Ca = U(C, L);\r\n b[H] = b[H] + Ca | 0;\r\n ma(E, v);\r\n if (ka) {\r\n var ra = oa,\r\n la = I[(da << 2) + ta + aa | 0] & 255;\r\n Ca = Aa(O, 3 * b[g] | 0) >> 1;\r\n b[ra >> 2] = (Z[Ca] & 65535) << 16 | b[(la << 2 >> 2) + c];\r\n b[ea + 1] = (Z[Ca + 2] & 65535) << 16 | Z[Ca + 1] & 65535;\r\n b[ea + 2] = b[(la << 2 >> 2) + Fa];\r\n Ca = za(m, b[H]);\r\n b[ea + 3] = b[Ca >> 2]\r\n }\r\n Ca = U(C, J);\r\n b[g] = b[g] + Ca | 0;\r\n ma(l, B);\r\n Ca = U(C, L);\r\n b[H] = b[H] + Ca | 0;\r\n ma(E, v);\r\n Y | ka ^ 1 || (ka = oa + 16 | 0, Ca = I[(da << 2) + ta + (aa | 1) | 0] & 255, aa = Aa(O, 3 * b[g] | 0) >> 1, b[ka >> 2] = (Z[aa] & 65535) << 16 | b[(Ca << 2 >> 2) + c], b[ea + 5] = (Z[aa + 2] & 65535) << 16 | Z[aa + 1] & 65535, b[ea + 6] = b[(Ca << 2 >> 2) + Fa], aa = za(m, b[H]), b[ea + 7] = b[aa >> 2]);\r\n ua = ua + 1 | 0;\r\n if (2 == (ua | 0)) break;\r\n oa = oa + u | 0;\r\n ea = oa >> 2\r\n }\r\n S = S + ja | 0;\r\n if ((S | 0) == (V | 0)) {\r\n da = ia;\r\n break c\r\n }\r\n da = ia;\r\n ca = ca + fa | 0\r\n }\r\n while (0);\r\n ba = ba + 1 | 0;\r\n if ((ba | 0) == (e | 0)) {\r\n ha = da;\r\n break b\r\n }\r\n ha = ha + K | 0;\r\n ia = da\r\n }\r\n } while (0); R = R + 1 | 0;\r\n if ((R | 0) == (z | 0)) break a; fa = ha\r\n }\r\n }\r\n while (0);\r\n M = n;\r\n return 1\r\n }\r\n\r\n function Sc(a, f, c, u, d, N, r, e) {\r\n var n, na = M;\r\n M += 24;\r\n var y = na;\r\n var E = y >> 2;\r\n var H = na + 4;\r\n var x = H >> 2;\r\n c = na + 8 >> 2;\r\n var h = a + 268 | 0,\r\n l = fc(h),\r\n g = b[a + 88 >> 2],\r\n k = pa(g + 63 | 0);\r\n b[E] = 0;\r\n b[x] = 0;\r\n g = Ka(g + 17 | 0);\r\n var Fa = 0 == (g | 0);\r\n a: do\r\n if (!Fa) {\r\n Fa = 0 == (e | 0);\r\n var p = e - 1 | 0;\r\n N = 0 == (N & 1 | 0);\r\n var m = u << 1,\r\n v = a + 92 | 0,\r\n w = a + 116 | 0;\r\n d = 0 == (d & 1 | 0);\r\n var z = a + 164 | 0,\r\n A = a + 212 | 0;\r\n a = a + 284 | 0;\r\n for (var B = r - 1 | 0, C = B << 4, G = 0, D = 1; ;) {\r\n b: do\r\n if (Fa) var K = D;\r\n else {\r\n K = b[f + (G << 2) >> 2];\r\n for (var F = 0, J = D; ;) {\r\n if (0 == (F & 1 | 0)) {\r\n var L = K;\r\n D = 16;\r\n var O = 1,\r\n P = r,\r\n W = 0\r\n } else L = K + C | 0, D = -16, P = O = -1, W = B;\r\n var Q = N | (F | 0) != (p | 0),\r\n R = (W | 0) == (P | 0);\r\n c: do\r\n if (R) var fa = J;\r\n else\r\n for (fa = J; ;) {\r\n J = 1 == (fa | 0) ? U(v, w) | 512 : fa;\r\n fa = J & 7;\r\n J >>>= 3;\r\n var ha = I[q.h + fa | 0] & 255;\r\n R = d | (W | 0) != (B | 0);\r\n var ba = 0;\r\n for (n = b[E]; ;) {\r\n var ia = U(v, z);\r\n b[E] = n + ia | 0;\r\n ma(y, l);\r\n n = t[E];\r\n ia = Aa(h, n);\r\n b[(ba << 2 >> 2) + c] = Z[ia >> 1] & 65535;\r\n ba = ba + 1 | 0;\r\n if (ba >>> 0 >= ha >>> 0) {\r\n ha = L;\r\n n = ha >> 2;\r\n ba = 0;\r\n break\r\n }\r\n }\r\n for (; ;) {\r\n ia = ha;\r\n var ca = 0 == (ba | 0) | Q;\r\n var ja = ba << 1;\r\n var V = U(v, A);\r\n b[x] = b[x] + V | 0;\r\n ma(H, k);\r\n R ? ca ? (V = I[(fa << 2) + ta + ja | 0] & 255, ca = Aa(a, 3 * b[x] | 0) >> 1, b[ia >> 2] = (Z[ca] & 65535) << 16 | b[(V << 2 >> 2) + c], b[n + 1] = (Z[ca + 2] & 65535) << 16 | Z[ca + 1] & 65535, ia = ha + 8 | 0, ca = U(v, A), b[x] = b[x] + ca | 0, ma(H, k), ca = I[(fa << 2) + ta + (ja | 1) | 0] & 255, ja = Aa(a, 3 * b[x] | 0) >> 1, b[ia >> 2] = (Z[ja] & 65535) << 16 | b[(ca << 2 >> 2) + c], b[n + 3] = (Z[ja + 2] & 65535) << 16 | Z[ja + 1] & 65535) : (n = U(v, A), b[x] = b[x] + n | 0, ma(H, k)) : (ca ? (ca = I[(fa << 2) + ta + ja | 0] & 255, ja = Aa(a, 3 * b[x] | 0) >> 1, b[ia >> 2] = (Z[ja] & 65535) << 16 | b[(ca << 2 >> 2) + c], b[n + 1] = (Z[ja + 2] & 65535) << 16 | Z[ja + 1] & 65535, n = U(v, A), b[x] = b[x] + n | 0) : (n = U(v, A), b[x] = b[x] + n | 0), ma(H, k));\r\n ba = ba + 1 | 0;\r\n if (2 == (ba | 0)) break;\r\n ha = ha + u | 0;\r\n n = ha >> 2\r\n }\r\n W = W + O | 0;\r\n if ((W | 0) == (P | 0)) {\r\n fa = J;\r\n break c\r\n }\r\n fa = J;\r\n L = L + D | 0\r\n }\r\n while (0);\r\n F = F + 1 | 0;\r\n if ((F | 0) == (e | 0)) {\r\n K = fa;\r\n break b\r\n }\r\n K = K + m | 0;\r\n J = fa\r\n }\r\n } while (0); G = G + 1 | 0;\r\n if ((G | 0) == (g | 0)) break a; D = K\r\n }\r\n }\r\n while (0);\r\n M = na;\r\n return 1\r\n }\r\n\r\n function Tc(a, f, c, u, d, e, r, h) {\r\n var n = M;\r\n M += 48;\r\n var N = n;\r\n var y = N >> 2;\r\n var E = n + 4;\r\n var na = E >> 2;\r\n var x = n + 8;\r\n var l = x >> 2;\r\n var g = n + 12;\r\n var k = g >> 2;\r\n var Fa = n + 16 >> 2;\r\n c = n + 32 >> 2;\r\n var p = a + 268 | 0,\r\n m = fc(p),\r\n v = b[a + 88 >> 2],\r\n w = pa(v + 63 | 0);\r\n b[y] = 0;\r\n b[na] = 0;\r\n b[l] = 0;\r\n b[k] = 0;\r\n v = Ka(v + 17 | 0);\r\n var A = 0 == (v | 0);\r\n a: do\r\n if (!A) {\r\n A = 0 == (h | 0);\r\n var z = h - 1 | 0;\r\n e = 0 == (e & 1 | 0);\r\n var B = u << 1,\r\n K = a + 92 | 0,\r\n G = a + 116 | 0,\r\n D = a + 212 | 0,\r\n C = a + 284 | 0;\r\n a = a + 164 | 0;\r\n var F = r - 1 | 0,\r\n J = F << 5;\r\n d = 0 != (d & 1 | 0);\r\n for (var L = 0, O = 1; ;) {\r\n b: do\r\n if (A) var P = O;\r\n else {\r\n P = b[f + (L << 2) >> 2];\r\n for (var Q = 0, W = O; ;) {\r\n if (0 == (Q & 1 | 0)) {\r\n var R = P;\r\n O = 32;\r\n var Y = 1,\r\n fa = r,\r\n ha = 0\r\n } else R = P + J | 0, O = -32, fa = Y = -1, ha = F;\r\n var ba = e | (Q | 0) != (z | 0);\r\n var ia = (ha | 0) == (fa | 0);\r\n c: do\r\n if (ia) var ca = W;\r\n else\r\n for (ca = W; ;) {\r\n W = 1 == (ca | 0) ? U(K, G) | 512 : ca;\r\n ca = W & 7;\r\n W >>>= 3;\r\n ia = I[q.h + ca | 0] & 255;\r\n for (var ja = 0, V = b[y]; ;) {\r\n var S = U(K, a);\r\n b[y] = V + S | 0;\r\n ma(N, m);\r\n V = t[y];\r\n S = Aa(p, V);\r\n b[(ja << 2 >> 2) + Fa] = Z[S >> 1] & 65535;\r\n ja = ja + 1 | 0;\r\n if (ja >>> 0 >= ia >>> 0) break\r\n }\r\n ja = 0;\r\n for (V = b[l]; !(S = U(K, a), b[l] = V + S | 0, ma(x, m), V = t[l], S = Aa(p, V), b[(ja << 2 >> 2) + c] = Z[S >> 1] & 65535, ja = ja + 1 | 0, ja >>> 0 >= ia >>> 0););\r\n ja = (ha | 0) == (F | 0) & d;\r\n V = R;\r\n ia = V >> 2;\r\n for (S = 0; ;) {\r\n var X = 0 == (S | 0) | ba;\r\n var ea = S << 1;\r\n var da = U(K, D);\r\n b[na] = b[na] + da | 0;\r\n ma(E, w);\r\n da = U(K, D);\r\n b[k] = b[k] + da | 0;\r\n ma(g, w);\r\n if (X) {\r\n var aa = V,\r\n oa = I[(ca << 2) + ta + ea | 0] & 255;\r\n var ua = Aa(C, 3 * b[na] | 0) >> 1;\r\n da = Aa(C, 3 * b[k] | 0) >> 1;\r\n b[aa >> 2] = (Z[ua] & 65535) << 16 | b[(oa << 2 >> 2) + Fa];\r\n b[ia + 1] = (Z[ua + 2] & 65535) << 16 | Z[ua + 1] & 65535;\r\n b[ia + 2] = (Z[da] & 65535) << 16 | b[(oa << 2 >> 2) + c];\r\n b[ia + 3] = (Z[da + 2] & 65535) << 16 | Z[da + 1] & 65535\r\n }\r\n da = U(K, D);\r\n b[na] = b[na] + da | 0;\r\n ma(E, w);\r\n da = U(K, D);\r\n b[k] = b[k] + da | 0;\r\n ma(g, w);\r\n ja | X ^ 1 || (X = V + 16 | 0, ua = I[(ca << 2) + ta + (ea | 1) | 0] & 255, da = Aa(C, 3 * b[na] | 0) >> 1, ea = Aa(C, 3 * b[k] | 0) >> 1, b[X >> 2] = (Z[da] & 65535) << 16 | b[(ua << 2 >> 2) + Fa], b[ia + 5] = (Z[da + 2] & 65535) << 16 | Z[da + 1] & 65535, b[ia + 6] = (Z[ea] & 65535) << 16 | b[(ua << 2 >> 2) + c], b[ia + 7] = (Z[ea + 2] & 65535) << 16 | Z[ea + 1] & 65535);\r\n S = S + 1 | 0;\r\n if (2 == (S | 0)) break;\r\n V = V + u | 0;\r\n ia = V >> 2\r\n }\r\n ha = ha + Y | 0;\r\n if ((ha | 0) == (fa | 0)) {\r\n ca = W;\r\n break c\r\n }\r\n ca = W;\r\n R = R + O | 0\r\n }\r\n while (0);\r\n Q = Q + 1 | 0;\r\n if ((Q | 0) == (h | 0)) {\r\n P = ca;\r\n break b\r\n }\r\n P = P + B | 0;\r\n W = ca\r\n }\r\n } while (0); L = L + 1 | 0;\r\n if ((L | 0) == (v | 0)) break a; O = P\r\n }\r\n }\r\n while (0);\r\n M = n;\r\n return 1\r\n }\r\n\r\n function Aa(a, f) {\r\n t[a + 4 >> 2] >>> 0 <= f >>> 0 && P(q.l | 0, q.a | 0, 968);\r\n return (f << 1) + b[a >> 2] | 0\r\n }\r\n\r\n function za(a, f) {\r\n t[a + 4 >> 2] >>> 0 <= f >>> 0 && P(q.l | 0, q.a | 0, 968);\r\n return (f << 2) + b[a >> 2] | 0\r\n }\r\n\r\n function re(a) {\r\n var f = a + 92 | 0,\r\n c = b[a + 4 >> 2];\r\n var u = (a + 88 | 0) >> 2;\r\n var d = b[u];\r\n c = hb(f, c + Na(d + 67 | 0) | 0, pa(d + 65 | 0));\r\n do\r\n if (c)\r\n if (wa(f, a + 116 | 0)) {\r\n d = b[u];\r\n if (0 == (pa(d + 39 | 0) | 0)) {\r\n if (0 == (pa(d + 55 | 0) | 0)) {\r\n d = 0;\r\n break\r\n }\r\n } else {\r\n if (!wa(f, a + 140 | 0)) {\r\n d = 0;\r\n break\r\n }\r\n if (!wa(f, a + 188 | 0)) {\r\n d = 0;\r\n break\r\n }\r\n d = b[u]\r\n }\r\n if (0 != (pa(d + 55 | 0) | 0)) {\r\n if (!wa(f, a + 164 | 0)) {\r\n d = 0;\r\n break\r\n }\r\n if (!wa(f, a + 212 | 0)) {\r\n d = 0;\r\n break\r\n }\r\n }\r\n d = 1\r\n } else d = 0;\r\n else d = 0; while (0);\r\n return d\r\n }\r\n\r\n function le(a) {\r\n var b = 1 < a >>> 0;\r\n a: do\r\n if (b)\r\n for (b = 0; ;) {\r\n b = b + 1 | 0;\r\n if (3 >= a >>> 0) {\r\n var c = b;\r\n break a\r\n }\r\n a >>>= 1\r\n } else c = 0; while (0);\r\n return c\r\n }\r\n\r\n function se(a) {\r\n var f = a + 88 | 0,\r\n c = b[f >> 2];\r\n if (0 == (pa(c + 39 | 0) | 0)) {\r\n d = c;\r\n var u = 5\r\n } else if (Zc(a))\r\n if ($c(a)) {\r\n var d = b[f >> 2];\r\n u = 5\r\n } else e = 0, u = 9;\r\n else {\r\n var e = 0;\r\n u = 9\r\n }\r\n do\r\n if (5 == u) {\r\n if (0 != (pa(d + 55 | 0) | 0)) {\r\n if (!ad(a)) {\r\n e = 0;\r\n break\r\n }\r\n if (!bd(a)) {\r\n e = 0;\r\n break\r\n }\r\n }\r\n e = 1\r\n } while (0);\r\n return e\r\n }\r\n\r\n function cd(a) {\r\n Xa(a, 0, 64, 1)\r\n }\r\n\r\n function dd(a, f) {\r\n var c = (a + 4 | 0) >> 2;\r\n var u = t[c],\r\n d = (u | 0) == (f | 0);\r\n do\r\n if (d) var e = 1;\r\n else {\r\n if (u >>> 0 <= f >>> 0) {\r\n if (t[a + 8 >> 2] >>> 0 < f >>> 0) {\r\n if (!Te(a, f, (u + 1 | 0) == (f | 0))) {\r\n e = 0;\r\n break\r\n }\r\n e = b[c]\r\n } else e = u;\r\n Ue((e << 1) + b[a >> 2] | 0, f - e | 0)\r\n }\r\n b[c] = f;\r\n e = 1\r\n } while (0);\r\n return e\r\n }\r\n\r\n function Te(a, b, c) {\r\n la(a, b, c, 2, 0) ? a = 1 : (D[a + 12 | 0] = 1, a = 0);\r\n return a\r\n }\r\n\r\n function Ue(a, b) {\r\n Xa(a, 0, b << 1, 1)\r\n }\r\n\r\n function ed(a, f) {\r\n var c = (a + 4 | 0) >> 2;\r\n var u = t[c],\r\n d = (u | 0) == (f | 0);\r\n do\r\n if (d) var e = 1;\r\n else {\r\n if (u >>> 0 <= f >>> 0) {\r\n if (t[a + 8 >> 2] >>> 0 < f >>> 0) {\r\n if (!Ve(a, f, (u + 1 | 0) == (f | 0))) {\r\n e = 0;\r\n break\r\n }\r\n e = b[c]\r\n } else e = u;\r\n We((e << 2) + b[a >> 2] | 0, f - e | 0)\r\n }\r\n b[c] = f;\r\n e = 1\r\n } while (0);\r\n return e\r\n }\r\n\r\n function Ve(a, b, c) {\r\n la(a, b, c, 4, 0) ? a = 1 : (D[a + 12 | 0] = 1, a = 0);\r\n return a\r\n }\r\n\r\n function We(a, b) {\r\n Xa(a, 0, b << 2, 1)\r\n }\r\n\r\n function ee(a) {\r\n var f = a + 168 | 0,\r\n c = b[f >> 2];\r\n 0 != (c | 0) && (Va(c), b[f >> 2] = 0, b[a + 164 >> 2] = 0);\r\n f = a + 176 | 0;\r\n c = b[f >> 2];\r\n 0 != (c | 0) && (ab(c), b[f >> 2] = 0, b[a + 172 >> 2] = 0)\r\n }\r\n\r\n function Zc(a) {\r\n var f = M;\r\n M += 48;\r\n var c = f,\r\n u = a + 88 | 0,\r\n d = pa(b[u >> 2] + 39 | 0),\r\n e = a + 236 | 0;\r\n if (ed(e, d)) {\r\n var r = a + 92 | 0;\r\n u = b[u >> 2];\r\n if (hb(r, b[a + 4 >> 2] + Na(u + 33 | 0) | 0, Na(u + 36 | 0))) {\r\n a = c | 0;\r\n Ha(a);\r\n u = c + 24 | 0;\r\n Ha(u);\r\n for (var h = 0; ;) {\r\n if (2 <= h >>> 0) {\r\n var l = 9;\r\n break\r\n }\r\n if (!wa(r, c + 24 * h | 0)) {\r\n var g = 0;\r\n l = 11;\r\n break\r\n }\r\n h = h + 1 | 0\r\n }\r\n a: do\r\n if (9 == l)\r\n if (c = za(e, 0), 0 == (d | 0)) g = 1;\r\n else {\r\n var y = g = e = 0,\r\n E = 0,\r\n H = 0,\r\n x = 0;\r\n for (h = 0; ;) {\r\n x = U(r, a) + x & 31;\r\n H = U(r, u) + H & 63;\r\n E = U(r, a) + E & 31;\r\n var k = U(r, a) + y | 0;\r\n y = k & 31;\r\n g = U(r, u) + g & 63;\r\n e = U(r, a) + e & 31;\r\n b[c >> 2] = H << 5 | x << 11 | E | k << 27 | g << 21 | e << 16;\r\n h = h + 1 | 0;\r\n if ((h | 0) == (d | 0)) {\r\n g = 1;\r\n break a\r\n }\r\n c = c + 4 | 0\r\n }\r\n }\r\n while (0);\r\n ya(u);\r\n ya(a);\r\n d = g\r\n } else d = 0\r\n } else d = 0;\r\n M = f;\r\n return d\r\n }\r\n\r\n function $c(a) {\r\n var f = M;\r\n M += 480;\r\n var c = f,\r\n u = f + 24,\r\n d = f + 220,\r\n e = f + 416,\r\n r = b[a + 88 >> 2],\r\n h = pa(r + 47 | 0),\r\n l = a + 92 | 0;\r\n if (hb(l, b[a + 4 >> 2] + Na(r + 41 | 0) | 0, Na(r + 44 | 0))) {\r\n Ha(c);\r\n r = wa(l, c);\r\n a: do\r\n if (r) {\r\n for (var g = -3, y = -3, E = 0; ;) {\r\n b[u + (E << 2) >> 2] = g;\r\n b[d + (E << 2) >> 2] = y;\r\n g = g + 1 | 0;\r\n var H = 3 < (g | 0);\r\n y = (H & 1) + y | 0;\r\n E = E + 1 | 0;\r\n if (49 == (E | 0)) break;\r\n g = H ? -3 : g\r\n }\r\n cd(e);\r\n y = a + 252 | 0;\r\n if (ed(y, h)) {\r\n var x = za(y, 0);\r\n if (0 == (h | 0)) y = 1;\r\n else {\r\n a = e | 0;\r\n r = e + 4 | 0;\r\n y = e + 8 | 0;\r\n E = e + 12 | 0;\r\n g = e + 16 | 0;\r\n H = e + 20 | 0;\r\n for (var k = e + 24 | 0, t = e + 28 | 0, p = e + 32 | 0, m = e + 36 | 0, v = e + 40 | 0, w = e + 44 | 0, A = e + 48 | 0, z = e + 52 | 0, B = e + 56 | 0, K = e + 60 | 0, D = 0; ;) {\r\n for (var C = 0; ;) {\r\n var G = U(l, c),\r\n F = C << 1,\r\n J = (F << 2) + e | 0;\r\n b[J >> 2] = b[J >> 2] + b[u + (G << 2) >> 2] & 3;\r\n F = ((F | 1) << 2) + e | 0;\r\n b[F >> 2] = b[F >> 2] + b[d + (G << 2) >> 2] & 3;\r\n C = C + 1 | 0;\r\n if (8 == (C | 0)) break\r\n }\r\n b[x >> 2] = (I[q.c + b[r >> 2] | 0] & 255) << 2 | I[q.c + b[a >> 2] | 0] & 255 | (I[q.c + b[y >> 2] | 0] & 255) << 4 | (I[q.c + b[E >> 2] | 0] & 255) << 6 | (I[q.c + b[g >> 2] | 0] & 255) << 8 | (I[q.c + b[H >> 2] | 0] & 255) << 10 | (I[q.c + b[k >> 2] | 0] & 255) << 12 | (I[q.c + b[t >> 2] | 0] & 255) << 14 | (I[q.c + b[p >> 2] | 0] & 255) << 16 | (I[q.c + b[m >> 2] | 0] & 255) << 18 | (I[q.c + b[v >> 2] | 0] & 255) << 20 | (I[q.c + b[w >> 2] | 0] & 255) << 22 | (I[q.c + b[A >> 2] | 0] & 255) << 24 | (I[q.c + b[z >> 2] | 0] & 255) << 26 | (I[q.c + b[B >> 2] | 0] & 255) << 28 | (I[q.c + b[K >> 2] | 0] & 255) << 30;\r\n D = D + 1 | 0;\r\n if ((D | 0) == (h | 0)) {\r\n y = 1;\r\n break a\r\n }\r\n x = x + 4 | 0\r\n }\r\n }\r\n } else y = 0\r\n } else y = 0; while (0);\r\n ya(c);\r\n c = y\r\n } else c = 0;\r\n M = f;\r\n return c\r\n }\r\n\r\n function ad(a) {\r\n var f = M;\r\n M += 24;\r\n var c = f,\r\n u = b[a + 88 >> 2],\r\n d = pa(u + 55 | 0),\r\n e = a + 92 | 0;\r\n if (hb(e, b[a + 4 >> 2] + Na(u + 49 | 0) | 0, Na(u + 52 | 0))) {\r\n Ha(c);\r\n u = wa(e, c);\r\n a: do\r\n if (u) {\r\n var r = a + 268 | 0;\r\n if (dd(r, d))\r\n if (r = Aa(r, 0), 0 == (d | 0)) r = 1;\r\n else {\r\n a = r;\r\n for (var h = r = u = 0; ;) {\r\n var l = U(e, c),\r\n g = U(e, c);\r\n u = l + u & 255;\r\n r = g + r & 255;\r\n Da[a >> 1] = (r << 8 | u) & 65535;\r\n h = h + 1 | 0;\r\n if ((h | 0) == (d | 0)) {\r\n r = 1;\r\n break a\r\n }\r\n a = a + 2 | 0\r\n }\r\n }\r\n else r = 0\r\n } else r = 0; while (0);\r\n ya(c);\r\n c = r\r\n } else c = 0;\r\n M = f;\r\n return c\r\n }\r\n\r\n function bd(a) {\r\n var f = M;\r\n M += 1888;\r\n var c = f,\r\n u = f + 24,\r\n d = f + 924,\r\n e = f + 1824,\r\n r = b[a + 88 >> 2],\r\n h = pa(r + 63 | 0),\r\n l = a + 92 | 0;\r\n if (hb(l, b[a + 4 >> 2] + Na(r + 57 | 0) | 0, Na(r + 60 | 0))) {\r\n Ha(c);\r\n r = wa(l, c);\r\n a: do\r\n if (r) {\r\n for (var g = -7, y = -7, E = 0; ;) {\r\n b[u + (E << 2) >> 2] = g;\r\n b[d + (E << 2) >> 2] = y;\r\n g = g + 1 | 0;\r\n var H = 7 < (g | 0);\r\n y = (H & 1) + y | 0;\r\n E = E + 1 | 0;\r\n if (225 == (E | 0)) break;\r\n g = H ? -7 : g\r\n }\r\n cd(e);\r\n y = a + 284 | 0;\r\n if (dd(y, 3 * h | 0)) {\r\n var x = Aa(y, 0);\r\n if (0 == (h | 0)) y = 1;\r\n else {\r\n a = e | 0;\r\n r = e + 4 | 0;\r\n y = e + 8 | 0;\r\n E = e + 12 | 0;\r\n g = e + 16 | 0;\r\n H = e + 20 | 0;\r\n var k = e + 24 | 0,\r\n t = e + 28 | 0,\r\n p = e + 32 | 0,\r\n m = e + 36 | 0,\r\n v = e + 40 | 0,\r\n w = e + 44 | 0,\r\n A = e + 48 | 0,\r\n z = e + 52 | 0,\r\n B = e + 56 | 0,\r\n K = e + 60 | 0,\r\n C = x;\r\n x = C >> 1;\r\n for (var D = 0; ;) {\r\n for (var F = 0; ;) {\r\n var G = U(l, c),\r\n J = F << 1,\r\n L = (J << 2) + e | 0;\r\n b[L >> 2] = b[L >> 2] + b[u + (G << 2) >> 2] & 7;\r\n J = ((J | 1) << 2) + e | 0;\r\n b[J >> 2] = b[J >> 2] + b[d + (G << 2) >> 2] & 7;\r\n F = F + 1 | 0;\r\n if (8 == (F | 0)) break\r\n }\r\n Da[x] = (I[q.b + b[r >> 2] | 0] & 255) << 3 | I[q.b + b[a >> 2] | 0] & 255 | (I[q.b + b[y >> 2] | 0] & 255) << 6 | (I[q.b + b[E >> 2] | 0] & 255) << 9 | (I[q.b + b[g >> 2] | 0] & 255) << 12 | (I[q.b + b[H >> 2] | 0] & 255) << 15;\r\n Da[x + 1] = (I[q.b + b[k >> 2] | 0] & 255) << 2 | (I[q.b + b[H >> 2] | 0] & 255) >>> 1 | (I[q.b + b[t >> 2] | 0] & 255) << 5 | (I[q.b + b[p >> 2] | 0] & 255) << 8 | (I[q.b + b[m >> 2] | 0] & 255) << 11 | (I[q.b + b[v >> 2] | 0] & 255) << 14;\r\n Da[x + 2] = (I[q.b + b[w >> 2] | 0] & 255) << 1 | (I[q.b + b[v >> 2] | 0] & 255) >>> 2 | (I[q.b + b[A >> 2] | 0] & 255) << 4 | (I[q.b + b[z >> 2] | 0] & 255) << 7 | (I[q.b + b[B >> 2] | 0] & 255) << 10 | (I[q.b + b[K >> 2] | 0] & 255) << 13;\r\n D = D + 1 | 0;\r\n if ((D | 0) == (h | 0)) {\r\n y = 1;\r\n break a\r\n }\r\n C = C + 6 | 0;\r\n x = C >> 1\r\n }\r\n }\r\n } else y = 0\r\n } else y = 0; while (0);\r\n ya(c);\r\n c = y\r\n } else c = 0;\r\n M = f;\r\n return c\r\n }\r\n\r\n function db(a) {\r\n var f = 245 > a >>> 0;\r\n do {\r\n if (f) {\r\n var c = 11 > a >>> 0 ? 16 : a + 11 & -8,\r\n u = c >>> 3,\r\n d = t[l >> 2],\r\n e = d >>> (u >>> 0);\r\n if (0 != (e & 3 | 0)) {\r\n a = (e & 1 ^ 1) + u | 0;\r\n c = a << 1;\r\n f = (c << 2) + l + 40 | 0;\r\n u = (c + 2 << 2) + l + 40 | 0;\r\n var r = t[u >> 2];\r\n c = r + 8 | 0;\r\n e = t[c >> 2];\r\n if ((f | 0) == (e | 0)) b[l >> 2] = d & (1 << a ^ -1);\r\n else {\r\n if (e >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[u >> 2] = e;\r\n b[e + 12 >> 2] = f\r\n }\r\n d = a << 3;\r\n b[r + 4 >> 2] = d | 3;\r\n d = r + (d | 4) | 0;\r\n b[d >> 2] |= 1;\r\n r = c;\r\n var h = 38;\r\n break\r\n }\r\n if (c >>> 0 <= t[l + 8 >> 2] >>> 0) {\r\n var g = c;\r\n h = 30;\r\n break\r\n }\r\n if (0 != (e | 0)) {\r\n a = 2 << u;\r\n a = e << u & (a | -a);\r\n f = (a & -a) - 1 | 0;\r\n a = f >>> 12 & 16;\r\n r = f >>> (a >>> 0);\r\n f = r >>> 5 & 8;\r\n u = r >>> (f >>> 0);\r\n r = u >>> 2 & 4;\r\n e = u >>> (r >>> 0);\r\n u = e >>> 1 & 2;\r\n e >>>= u >>> 0;\r\n var k = e >>> 1 & 1;\r\n r = (f | a | r | u | k) + (e >>> (k >>> 0)) | 0;\r\n a = r << 1;\r\n u = (a << 2) + l + 40 | 0;\r\n e = (a + 2 << 2) + l + 40 | 0;\r\n f = t[e >> 2];\r\n a = f + 8 | 0;\r\n k = t[a >> 2];\r\n if ((u | 0) == (k | 0)) b[l >> 2] = d & (1 << r ^ -1);\r\n else {\r\n if (k >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[e >> 2] = k;\r\n b[k + 12 >> 2] = u\r\n }\r\n r <<= 3;\r\n d = r - c | 0;\r\n b[f + 4 >> 2] = c | 3;\r\n u = f;\r\n f = u + c | 0;\r\n b[u + (c | 4) >> 2] = d | 1;\r\n b[u + r >> 2] = d;\r\n k = t[l + 8 >> 2];\r\n if (0 != (k | 0)) {\r\n c = b[l + 20 >> 2];\r\n u = k >>> 2 & 1073741822;\r\n r = (u << 2) + l + 40 | 0;\r\n e = t[l >> 2];\r\n k = 1 << (k >>> 3);\r\n if (0 == (e & k | 0)) b[l >> 2] = e | k, e = r, u = (u + 2 << 2) + l + 40 | 0;\r\n else if (u = (u + 2 << 2) + l + 40 | 0, e = t[u >> 2], !(e >>> 0 >= t[l + 16 >> 2] >>> 0)) throw K(), \"Reached an unreachable!\";\r\n b[u >> 2] = c;\r\n b[e + 12 >> 2] = c;\r\n b[(c + 8 | 0) >> 2] = e;\r\n b[(c + 12 | 0) >> 2] = r\r\n }\r\n b[l + 8 >> 2] = d;\r\n b[l + 20 >> 2] = f;\r\n r = a;\r\n h = 38;\r\n break\r\n }\r\n if (0 == (b[l + 4 >> 2] | 0)) {\r\n g = c;\r\n h = 30;\r\n break\r\n }\r\n d = fd(c);\r\n if (0 == (d | 0)) {\r\n g = c;\r\n h = 30;\r\n break\r\n }\r\n r = d\r\n } else {\r\n if (4294967231 < a >>> 0) {\r\n g = -1;\r\n h = 30;\r\n break\r\n }\r\n d = a + 11 & -8;\r\n if (0 == (b[l + 4 >> 2] | 0)) {\r\n g = d;\r\n h = 30;\r\n break\r\n }\r\n c = gd(d);\r\n if (0 == (c | 0)) {\r\n g = d;\r\n h = 30;\r\n break\r\n }\r\n r = c\r\n }\r\n h = 38\r\n } while (0);\r\n 30 == h && (c = t[l + 8 >> 2], g >>> 0 > c >>> 0 ? (d = t[l + 12 >> 2], g >>> 0 < d >>> 0 ? (d = d - g | 0, b[l + 12 >> 2] = d, c = t[l + 24 >> 2], b[l + 24 >> 2] = c + g | 0, b[g + (c + 4) >> 2] = d | 1, b[c + 4 >> 2] = g | 3, r = c + 8 | 0) : r = hd(g)) : (a = c - g | 0, d = t[l + 20 >> 2], 15 < a >>> 0 ? (b[l + 20 >> 2] = d + g | 0, b[l + 8 >> 2] = a, b[g + (d + 4) >> 2] = a | 1, b[d + c >> 2] = a, b[d + 4 >> 2] = g | 3) : (b[l + 8 >> 2] = 0, b[l + 20 >> 2] = 0, b[d + 4 >> 2] = c | 3, g = c + (d + 4) | 0, b[g >> 2] |= 1), r = d + 8 | 0));\r\n return r\r\n }\r\n\r\n function fd(a) {\r\n var f = b[l + 4 >> 2],\r\n c = (f & -f) - 1 | 0;\r\n f = c >>> 12 & 16;\r\n var d = c >>> (f >>> 0);\r\n c = d >>> 5 & 8;\r\n var e = d >>> (c >>> 0);\r\n d = e >>> 2 & 4;\r\n var h = e >>> (d >>> 0);\r\n e = h >>> 1 & 2;\r\n h >>>= e >>> 0;\r\n var r = h >>> 1 & 1;\r\n f = c = t[l + ((c | f | d | e | r) + (h >>> (r >>> 0)) << 2) + 304 >> 2];\r\n e = f >> 2;\r\n c = (b[c + 4 >> 2] & -8) - a | 0;\r\n a: for (; ;)\r\n for (d = f; ;) {\r\n h = b[d + 16 >> 2];\r\n if (0 == (h | 0)) {\r\n if (d = b[d + 20 >> 2], 0 == (d | 0)) break a\r\n } else d = h;\r\n h = (b[d + 4 >> 2] & -8) - a | 0;\r\n if (h >>> 0 < c >>> 0) {\r\n f = d;\r\n e = f >> 2;\r\n c = h;\r\n continue a\r\n }\r\n }\r\n h = f;\r\n var g = t[l + 16 >> 2];\r\n if (!(h >>> 0 < g >>> 0 || (d = h + a | 0, h >>> 0 >= d >>> 0))) {\r\n r = t[e + 6];\r\n var k = t[e + 3],\r\n p = (k | 0) == (f | 0);\r\n do {\r\n if (p) {\r\n var y = f + 20 | 0;\r\n var E = b[y >> 2];\r\n if (0 == (E | 0) && (y = f + 16 | 0, E = b[y >> 2], 0 == (E | 0))) {\r\n E = 0;\r\n y = E >> 2;\r\n break\r\n }\r\n for (; ;) {\r\n var H = E + 20 | 0,\r\n x = b[H >> 2];\r\n if (0 != (x | 0)) y = H, E = x;\r\n else {\r\n H = E + 16 | 0;\r\n x = t[H >> 2];\r\n if (0 == (x | 0)) break;\r\n y = H;\r\n E = x\r\n }\r\n }\r\n if (y >>> 0 < g >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[y >> 2] = 0\r\n } else {\r\n y = t[e + 2];\r\n if (y >>> 0 < g >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[y + 12 >> 2] = k;\r\n b[k + 8 >> 2] = y;\r\n E = k\r\n }\r\n y = E >> 2\r\n } while (0);\r\n g = 0 == (r | 0);\r\n a: do\r\n if (!g) {\r\n k = f + 28 | 0;\r\n p = (b[k >> 2] << 2) + l + 304 | 0;\r\n H = (f | 0) == (b[p >> 2] | 0);\r\n do {\r\n if (H) {\r\n b[p >> 2] = E;\r\n if (0 != (E | 0)) break;\r\n b[l + 4 >> 2] &= 1 << b[k >> 2] ^ -1;\r\n break a\r\n }\r\n if (r >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n x = r + 16 | 0;\r\n (b[x >> 2] | 0) == (f | 0) ? b[x >> 2] = E : b[r + 20 >> 2] = E;\r\n if (0 == (E | 0)) break a\r\n } while (0);\r\n if (E >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[y + 6] = r;\r\n k = t[e + 4];\r\n if (0 != (k | 0)) {\r\n if (k >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[y + 4] = k;\r\n b[k + 24 >> 2] = E\r\n }\r\n k = t[e + 5];\r\n if (0 != (k | 0)) {\r\n if (k >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[y + 5] = k;\r\n b[k + 24 >> 2] = E\r\n }\r\n }\r\n while (0);\r\n if (16 > c >>> 0) a = c + a | 0, b[e + 1] = a | 3, a = a + (h + 4) | 0, b[a >> 2] |= 1;\r\n else {\r\n b[e + 1] = a | 3;\r\n b[a + (h + 4) >> 2] = c | 1;\r\n b[h + c + a >> 2] = c;\r\n g = t[l + 8 >> 2];\r\n if (0 != (g | 0)) {\r\n a = t[l + 20 >> 2];\r\n h = g >>> 2 & 1073741822;\r\n e = (h << 2) + l + 40 | 0;\r\n r = t[l >> 2];\r\n g = 1 << (g >>> 3);\r\n if (0 == (r & g | 0)) b[l >> 2] = r | g, r = e, h = (h + 2 << 2) + l + 40 | 0;\r\n else if (h = (h + 2 << 2) + l + 40 | 0, r = t[h >> 2], !(r >>> 0 >= t[l + 16 >> 2] >>> 0)) throw K(), \"Reached an unreachable!\";\r\n b[h >> 2] = a;\r\n b[r + 12 >> 2] = a;\r\n b[a + 8 >> 2] = r;\r\n b[a + 12 >> 2] = e\r\n }\r\n b[l + 8 >> 2] = c;\r\n b[l + 20 >> 2] = d\r\n }\r\n return f + 8 | 0\r\n }\r\n K();\r\n throw \"Reached an unreachable!\";\r\n }\r\n\r\n function hd(a) {\r\n 0 == (b[xa >> 2] | 0) && id();\r\n var f = 0 == (b[l + 440 >> 2] & 4 | 0);\r\n do\r\n if (f) {\r\n var c = b[l + 24 >> 2];\r\n if (0 == (c | 0)) var d = 6;\r\n else if (c = gc(c), 0 == (c | 0)) d = 6;\r\n else {\r\n var e = b[xa + 8 >> 2];\r\n e = a + 47 - b[l + 12 >> 2] + e & -e;\r\n if (2147483647 <= e >>> 0) d = 14;\r\n else {\r\n var h = La(e);\r\n if ((h | 0) == (b[c >> 2] + b[c + 4 >> 2] | 0)) {\r\n var r = h,\r\n g = e;\r\n var k = h;\r\n d = 13\r\n } else {\r\n var p = h,\r\n y = e;\r\n d = 15\r\n }\r\n }\r\n }\r\n if (6 == d)\r\n if (c = La(0), -1 == (c | 0)) d = 14;\r\n else {\r\n e = b[xa + 8 >> 2];\r\n e = e + (a + 47) & -e;\r\n h = c;\r\n var E = b[xa + 4 >> 2],\r\n H = E - 1 | 0;\r\n e = 0 == (H & h | 0) ? e : e - h + (H + h & -E) | 0;\r\n 2147483647 <= e >>> 0 ? d = 14 : (h = La(e), (h | 0) == (c | 0) ? (r = c, g = e, k = h, d = 13) : (p = h, y = e, d = 15))\r\n } if (13 == d) {\r\n if (-1 != (r | 0)) {\r\n var x = g,\r\n q = r;\r\n d = 26;\r\n break\r\n }\r\n p = k;\r\n y = g\r\n } else if (14 == d) {\r\n b[l + 440 >> 2] |= 4;\r\n d = 23;\r\n break\r\n }\r\n c = -y | 0;\r\n if (-1 != (p | 0) & 2147483647 > y >>> 0)\r\n if (y >>> 0 >= (a + 48 | 0) >>> 0) {\r\n var m = y;\r\n d = 21\r\n } else e = b[xa + 8 >> 2], e = a + 47 - y + e & -e, 2147483647 <= e >>> 0 ? (m = y, d = 21) : -1 == (La(e) | 0) ? (La(c), d = 22) : (m = e + y | 0, d = 21);\r\n else m = y, d = 21;\r\n 21 == d && -1 != (p | 0) ? (x = m, q = p, d = 26) : (b[l + 440 >> 2] |= 4, d = 23)\r\n } else d = 23; while (0);\r\n 23 == d && (f = b[xa + 8 >> 2], f = f + (a + 47) & -f, 2147483647 <= f >>> 0 ? d = 49 : (f = La(f), r = La(0), -1 != (r | 0) & -1 != (f | 0) & f >>> 0 < r >>> 0 ? (r = r - f | 0, r >>> 0 <= (a + 40 | 0) >>> 0 | -1 == (f | 0) ? d = 49 : (x = r, q = f, d = 26)) : d = 49));\r\n a: do\r\n if (26 == d) {\r\n f = b[l + 432 >> 2] + x | 0;\r\n b[l + 432 >> 2] = f;\r\n f >>> 0 > t[l + 436 >> 2] >>> 0 && (b[l + 436 >> 2] = f);\r\n f = t[l + 24 >> 2];\r\n r = 0 == (f | 0);\r\n b: do\r\n if (r) g = t[l + 16 >> 2], 0 == (g | 0) | q >>> 0 < g >>> 0 && (b[l + 16 >> 2] = q), b[l + 444 >> 2] = q, b[l + 448 >> 2] = x, b[l + 456 >> 2] = 0, b[l + 36 >> 2] = b[xa >> 2], b[l + 32 >> 2] = -1, Xe(), Ab(q, x - 40 | 0);\r\n else {\r\n p = l + 444 | 0;\r\n for (k = p >> 2; 0 != (p | 0);) {\r\n g = t[k];\r\n p = p + 4 | 0;\r\n y = t[p >> 2];\r\n m = g + y | 0;\r\n if ((q | 0) == (m | 0)) {\r\n if (0 != (b[k + 3] & 8 | 0)) break;\r\n k = f;\r\n if (!(k >>> 0 >= g >>> 0 & k >>> 0 < m >>> 0)) break;\r\n b[p >> 2] = y + x | 0;\r\n Ab(b[l + 24 >> 2], b[l + 12 >> 2] + x | 0);\r\n break b\r\n }\r\n p = b[k + 2];\r\n k = p >> 2\r\n }\r\n q >>> 0 < t[l + 16 >> 2] >>> 0 && (b[l + 16 >> 2] = q);\r\n k = q + x | 0;\r\n for (p = l + 444 | 0; 0 != (p | 0);) {\r\n y = p | 0;\r\n g = t[y >> 2];\r\n if ((g | 0) == (k | 0)) {\r\n if (0 != (b[p + 12 >> 2] & 8 | 0)) break;\r\n b[y >> 2] = q;\r\n var v = p + 4 | 0;\r\n b[v >> 2] = b[v >> 2] + x | 0;\r\n v = jd(q, g, a);\r\n d = 50;\r\n break a\r\n }\r\n p = b[p + 8 >> 2]\r\n }\r\n kd(q, x)\r\n }\r\n while (0);\r\n f = t[l + 12 >> 2];\r\n f >>> 0 <= a >>> 0 ? d = 49 : (v = f - a | 0, b[l + 12 >> 2] = v, r = f = t[l + 24 >> 2], b[l + 24 >> 2] = r + a | 0, b[a + (r + 4) >> 2] = v | 1, b[f + 4 >> 2] = a | 3, v = f + 8 | 0, d = 50)\r\n }\r\n while (0);\r\n 49 == d && (a = ld(), b[a >> 2] = 12, v = 0);\r\n return v\r\n }\r\n\r\n function gd(a) {\r\n var f = a >> 2,\r\n c = -a | 0,\r\n d = a >>> 8;\r\n if (0 == (d | 0)) var e = 0;\r\n else if (16777215 < a >>> 0) e = 31;\r\n else {\r\n var h = (d + 1048320 | 0) >>> 16 & 8,\r\n r = d << h,\r\n g = (r + 520192 | 0) >>> 16 & 4,\r\n k = r << g,\r\n p = (k + 245760 | 0) >>> 16 & 2,\r\n y = 14 - (g | h | p) + (k << p >>> 15) | 0;\r\n e = a >>> ((y + 7 | 0) >>> 0) & 1 | y << 1\r\n }\r\n var E = t[l + (e << 2) + 304 >> 2],\r\n H = 0 == (E | 0);\r\n a: do\r\n if (H) var x = 0,\r\n q = c,\r\n v = 0;\r\n else {\r\n var m = 31 == (e | 0) ? 0 : 25 - (e >>> 1) | 0,\r\n w = 0,\r\n A = c,\r\n z = E;\r\n var B = z >> 2;\r\n for (var C = a << m, D = 0; ;) {\r\n var F = b[B + 1] & -8,\r\n G = F - a | 0;\r\n if (G >>> 0 < A >>> 0) {\r\n if ((F | 0) == (a | 0)) {\r\n x = z;\r\n q = G;\r\n v = z;\r\n break a\r\n }\r\n var I = z,\r\n J = G\r\n } else I = w, J = A;\r\n var M = t[B + 5],\r\n L = t[((C >>> 31 << 2) + 16 >> 2) + B],\r\n O = 0 == (M | 0) | (M | 0) == (L | 0) ? D : M;\r\n if (0 == (L | 0)) {\r\n x = I;\r\n q = J;\r\n v = O;\r\n break a\r\n }\r\n w = I;\r\n A = J;\r\n z = L;\r\n B = z >> 2;\r\n C <<= 1;\r\n D = O\r\n }\r\n }\r\n while (0);\r\n if (0 == (v | 0) & 0 == (x | 0)) {\r\n var P = 2 << e,\r\n Q = b[l + 4 >> 2] & (P | -P);\r\n if (0 == (Q | 0)) var R = v;\r\n else {\r\n var U = (Q & -Q) - 1 | 0,\r\n Y = U >>> 12 & 16,\r\n W = U >>> (Y >>> 0),\r\n Z = W >>> 5 & 8,\r\n aa = W >>> (Z >>> 0),\r\n fa = aa >>> 2 & 4,\r\n ha = aa >>> (fa >>> 0),\r\n ba = ha >>> 1 & 2,\r\n ia = ha >>> (ba >>> 0),\r\n ca = ia >>> 1 & 1;\r\n R = b[l + ((Z | Y | fa | ba | ca) + (ia >>> (ca >>> 0)) << 2) + 304 >> 2]\r\n }\r\n } else R = v;\r\n var ja = 0 == (R | 0);\r\n a: do\r\n if (ja) {\r\n var V = q,\r\n S = x;\r\n var X = S >> 2\r\n } else {\r\n var ea = R;\r\n var da = ea >> 2;\r\n for (var ka = q, oa = x; ;) {\r\n var ua = (b[da + 1] & -8) - a | 0,\r\n ma = ua >>> 0 < ka >>> 0,\r\n pa = ma ? ua : ka,\r\n Ca = ma ? ea : oa,\r\n la = t[da + 4];\r\n if (0 != (la | 0)) ea = la;\r\n else {\r\n var ra = t[da + 5];\r\n if (0 == (ra | 0)) {\r\n V = pa;\r\n S = Ca;\r\n X = S >> 2;\r\n break a\r\n }\r\n ea = ra\r\n }\r\n da = ea >> 2;\r\n ka = pa;\r\n oa = Ca\r\n }\r\n }\r\n while (0);\r\n var va = 0 == (S | 0);\r\n a: do\r\n if (va) var sa = 0;\r\n else if (V >>> 0 >= (b[l + 8 >> 2] - a | 0) >>> 0) sa = 0;\r\n else {\r\n var qa = S;\r\n var Ba = qa >> 2;\r\n var xa = t[l + 16 >> 2];\r\n if (!(qa >>> 0 < xa >>> 0)) {\r\n var ya = qa + a | 0,\r\n za = ya;\r\n if (!(qa >>> 0 >= ya >>> 0)) {\r\n var ta = t[X + 6],\r\n Aa = t[X + 3],\r\n Ja = (Aa | 0) == (S | 0);\r\n do {\r\n if (Ja) {\r\n var Ka = S + 20 | 0,\r\n Ha = b[Ka >> 2];\r\n if (0 == (Ha | 0)) {\r\n var Ia = S + 16 | 0,\r\n Oa = b[Ia >> 2];\r\n if (0 == (Oa | 0)) {\r\n var Ga = 0;\r\n var ub = Ga >> 2;\r\n break\r\n }\r\n var vb = Ia,\r\n wa = Oa\r\n } else vb = Ka, wa = Ha;\r\n for (; ;) {\r\n var La = wa + 20 | 0,\r\n Ea = b[La >> 2];\r\n if (0 != (Ea | 0)) vb = La, wa = Ea;\r\n else {\r\n var Ma = wa + 16 | 0,\r\n Na = t[Ma >> 2];\r\n if (0 == (Na | 0)) break;\r\n vb = Ma;\r\n wa = Na\r\n }\r\n }\r\n if (vb >>> 0 < xa >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[vb >> 2] = 0;\r\n Ga = wa\r\n } else {\r\n var Da = t[X + 2];\r\n if (Da >>> 0 < xa >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[Da + 12 >> 2] = Aa;\r\n b[Aa + 8 >> 2] = Da;\r\n Ga = Aa\r\n }\r\n ub = Ga >> 2\r\n } while (0);\r\n var Qa = 0 == (ta | 0);\r\n b: do\r\n if (!Qa) {\r\n var Sa = S + 28 | 0,\r\n Ta = (b[Sa >> 2] << 2) + l + 304 | 0,\r\n Xa = (S | 0) == (b[Ta >> 2] | 0);\r\n do {\r\n if (Xa) {\r\n b[Ta >> 2] = Ga;\r\n if (0 != (Ga | 0)) break;\r\n b[l + 4 >> 2] &= 1 << b[Sa >> 2] ^ -1;\r\n break b\r\n }\r\n if (ta >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n var Gb = ta + 16 | 0;\r\n (b[Gb >> 2] | 0) == (S | 0) ? b[Gb >> 2] = Ga : b[ta + 20 >> 2] = Ga;\r\n if (0 == (Ga | 0)) break b\r\n } while (0);\r\n if (Ga >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[ub + 6] = ta;\r\n var Pa = t[X + 4];\r\n if (0 != (Pa | 0)) {\r\n if (Pa >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[ub + 4] = Pa;\r\n b[Pa + 24 >> 2] = Ga\r\n }\r\n var nb = t[X + 5];\r\n if (0 != (nb | 0)) {\r\n if (nb >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[ub + 5] = nb;\r\n b[nb + 24 >> 2] = Ga\r\n }\r\n }\r\n while (0);\r\n var ab = 16 > V >>> 0;\r\n b: do\r\n if (ab) {\r\n var Va = V + a | 0;\r\n b[X + 1] = Va | 3;\r\n var Ya = Va + (qa + 4) | 0;\r\n b[Ya >> 2] |= 1\r\n } else if (b[X + 1] = a | 3, b[f + (Ba + 1)] = V | 1, b[(V >> 2) + Ba + f] = V, 256 > V >>> 0) {\r\n var rb = V >>> 2 & 1073741822,\r\n Hb = (rb << 2) + l + 40 | 0,\r\n Ib = t[l >> 2],\r\n Jb = 1 << (V >>> 3);\r\n if (0 == (Ib & Jb | 0)) {\r\n b[l >> 2] = Ib | Jb;\r\n var ob = Hb,\r\n Kb = (rb + 2 << 2) + l + 40 | 0\r\n } else {\r\n var Za = (rb + 2 << 2) + l + 40 | 0,\r\n sb = t[Za >> 2];\r\n if (sb >>> 0 >= t[l + 16 >> 2] >>> 0) ob = sb, Kb = Za;\r\n else throw K(), \"Reached an unreachable!\";\r\n }\r\n b[Kb >> 2] = za;\r\n b[ob + 12 >> 2] = za;\r\n b[f + (Ba + 2)] = ob;\r\n b[f + (Ba + 3)] = Hb\r\n } else {\r\n var $a = ya,\r\n Lb = V >>> 8;\r\n if (0 == (Lb | 0)) var Ra = 0;\r\n else if (16777215 < V >>> 0) Ra = 31;\r\n else {\r\n var Ua = (Lb + 1048320 | 0) >>> 16 & 8,\r\n cb = Lb << Ua,\r\n db = (cb + 520192 | 0) >>> 16 & 4,\r\n eb = cb << db,\r\n gb = (eb + 245760 | 0) >>> 16 & 2,\r\n hb = 14 - (db | Ua | gb) + (eb << gb >>> 15) | 0;\r\n Ra = V >>> ((hb + 7 | 0) >>> 0) & 1 | hb << 1\r\n }\r\n var Wa = (Ra << 2) + l + 304 | 0;\r\n b[f + (Ba + 7)] = Ra;\r\n var tb = a + (qa + 16) | 0;\r\n b[f + (Ba + 5)] = 0;\r\n b[tb >> 2] = 0;\r\n var bb = b[l + 4 >> 2],\r\n Db = 1 << Ra;\r\n if (0 == (bb & Db | 0)) b[l + 4 >> 2] = bb | Db, b[Wa >> 2] = $a, b[f + (Ba + 6)] = Wa, b[f + (Ba + 3)] = $a, b[f + (Ba + 2)] = $a;\r\n else\r\n for (var lb = V << (31 == (Ra | 0) ? 0 : 25 - (Ra >>> 1) | 0), qb = b[Wa >> 2]; ;) {\r\n if ((b[qb + 4 >> 2] & -8 | 0) == (V | 0)) {\r\n var mb = qb + 8 | 0,\r\n Eb = t[mb >> 2],\r\n pb = t[l + 16 >> 2];\r\n if (!(qb >>> 0 < pb >>> 0 || Eb >>> 0 < pb >>> 0)) {\r\n b[Eb + 12 >> 2] = $a;\r\n b[mb >> 2] = $a;\r\n b[f + (Ba + 2)] = Eb;\r\n b[f + (Ba + 3)] = qb;\r\n b[f + (Ba + 6)] = 0;\r\n break b\r\n }\r\n K();\r\n throw \"Reached an unreachable!\";\r\n }\r\n var fb = (lb >>> 31 << 2) + qb + 16 | 0,\r\n ib = t[fb >> 2];\r\n if (0 == (ib | 0)) {\r\n if (fb >>> 0 >= t[l + 16 >> 2] >>> 0) {\r\n b[fb >> 2] = $a;\r\n b[f + (Ba + 6)] = qb;\r\n b[f + (Ba + 3)] = $a;\r\n b[f + (Ba + 2)] = $a;\r\n break b\r\n }\r\n K();\r\n throw \"Reached an unreachable!\";\r\n }\r\n lb <<= 1;\r\n qb = ib\r\n }\r\n }\r\n while (0);\r\n sa = S + 8 | 0;\r\n break a\r\n }\r\n }\r\n K();\r\n throw \"Reached an unreachable!\";\r\n }\r\n while (0);\r\n return sa\r\n }\r\n\r\n function md(a) {\r\n 0 == (b[xa >> 2] | 0) && id();\r\n var f = 4294967232 > a >>> 0;\r\n a: do {\r\n if (f) {\r\n var c = t[l + 24 >> 2];\r\n if (0 == (c | 0)) {\r\n c = 0;\r\n break\r\n }\r\n var d = t[l + 12 >> 2];\r\n if (d >>> 0 > (a + 40 | 0) >>> 0) {\r\n var e = t[xa + 8 >> 2],\r\n h = (Math.floor(((-40 - a - 1 + d + e | 0) >>> 0) / (e >>> 0)) - 1) * e | 0,\r\n r = gc(c);\r\n if (0 == (b[r + 12 >> 2] & 8 | 0) && (d = La(0), c = (r + 4 | 0) >> 2, (d | 0) == (b[r >> 2] + b[c] | 0) && (h = La(-(2147483646 < h >>> 0 ? -2147483648 - e | 0 : h) | 0), e = La(0), -1 != (h | 0) & e >>> 0 < d >>> 0 && (h = d - e | 0, (d | 0) != (e | 0))))) {\r\n b[c] = b[c] - h | 0;\r\n b[l + 432 >> 2] = b[l + 432 >> 2] - h | 0;\r\n Ab(b[l + 24 >> 2], b[l + 12 >> 2] - h | 0);\r\n c = (d | 0) != (e | 0);\r\n break a\r\n }\r\n }\r\n if (t[l + 12 >> 2] >>> 0 <= t[l + 28 >> 2] >>> 0) {\r\n c = 0;\r\n break\r\n }\r\n b[l + 28 >> 2] = -1\r\n }\r\n c = 0\r\n } while (0);\r\n return c & 1\r\n }\r\n\r\n function eb(a) {\r\n var f = a >> 2,\r\n c = 0 == (a | 0);\r\n a: do\r\n if (!c) {\r\n var d = a - 8 | 0,\r\n e = d,\r\n h = t[l + 16 >> 2],\r\n r = d >>> 0 < h >>> 0;\r\n b: do\r\n if (!r) {\r\n var g = t[a - 4 >> 2],\r\n k = g & 3;\r\n if (1 != (k | 0)) {\r\n var p = g & -8;\r\n var y = p >> 2;\r\n var E = a + (p - 8) | 0,\r\n H = E,\r\n x = 0 == (g & 1 | 0);\r\n c: do\r\n if (x) {\r\n var q = t[d >> 2];\r\n if (0 == (k | 0)) break a;\r\n var v = -8 - q | 0;\r\n var m = v >> 2;\r\n var w = a + v | 0,\r\n A = w,\r\n z = q + p | 0;\r\n if (w >>> 0 < h >>> 0) break b;\r\n if ((A | 0) == (b[l + 20 >> 2] | 0)) {\r\n var B = (a + (p - 4) | 0) >> 2;\r\n if (3 != (b[B] & 3 | 0)) {\r\n var C = A;\r\n var D = C >> 2;\r\n var F = z;\r\n break\r\n }\r\n b[l + 8 >> 2] = z;\r\n b[B] &= -2;\r\n b[m + (f + 1)] = z | 1;\r\n b[E >> 2] = z;\r\n break a\r\n }\r\n if (256 > q >>> 0) {\r\n var G = t[m + (f + 2)],\r\n I = t[m + (f + 3)];\r\n if ((G | 0) == (I | 0)) b[l >> 2] &= 1 << (q >>> 3) ^ -1, C = A, D = C >> 2, F = z;\r\n else {\r\n var J = ((q >>> 2 & 1073741822) << 2) + l + 40 | 0;\r\n if (!((G | 0) != (J | 0) & G >>> 0 < h >>> 0) && (I | 0) == (J | 0) | I >>> 0 >= h >>> 0) {\r\n b[G + 12 >> 2] = I;\r\n b[I + 8 >> 2] = G;\r\n C = A;\r\n D = C >> 2;\r\n F = z;\r\n break c\r\n }\r\n K();\r\n throw \"Reached an unreachable!\";\r\n }\r\n } else {\r\n var M = w,\r\n L = t[m + (f + 6)],\r\n O = t[m + (f + 3)],\r\n P = (O | 0) == (M | 0);\r\n do {\r\n if (P) {\r\n var Q = v + (a + 20) | 0,\r\n R = b[Q >> 2];\r\n if (0 == (R | 0)) {\r\n var U = v + (a + 16) | 0,\r\n Y = b[U >> 2];\r\n if (0 == (Y | 0)) {\r\n var W = 0;\r\n var Z = W >> 2;\r\n break\r\n }\r\n var aa = U,\r\n fa = Y\r\n } else {\r\n aa = Q;\r\n fa = R;\r\n var ha = 21\r\n }\r\n for (; ;) {\r\n var ba = fa + 20 | 0,\r\n ia = b[ba >> 2];\r\n if (0 != (ia | 0)) aa = ba, fa = ia;\r\n else {\r\n var ca = fa + 16 | 0,\r\n ja = t[ca >> 2];\r\n if (0 == (ja | 0)) break;\r\n aa = ca;\r\n fa = ja\r\n }\r\n }\r\n if (aa >>> 0 < h >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[aa >> 2] = 0;\r\n W = fa\r\n } else {\r\n var V = t[m + (f + 2)];\r\n if (V >>> 0 < h >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[V + 12 >> 2] = O;\r\n b[O + 8 >> 2] = V;\r\n W = O\r\n }\r\n Z = W >> 2\r\n } while (0);\r\n if (0 != (L | 0)) {\r\n var S = v + (a + 28) | 0,\r\n X = (b[S >> 2] << 2) + l + 304 | 0,\r\n ea = (M | 0) == (b[X >> 2] | 0);\r\n do {\r\n if (ea) {\r\n b[X >> 2] = W;\r\n if (0 != (W | 0)) break;\r\n b[l + 4 >> 2] &= 1 << b[S >> 2] ^ -1;\r\n C = A;\r\n D = C >> 2;\r\n F = z;\r\n break c\r\n }\r\n if (L >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n var da = L + 16 | 0;\r\n (b[da >> 2] | 0) == (M | 0) ? b[da >> 2] = W : b[L + 20 >> 2] = W;\r\n if (0 == (W | 0)) {\r\n C = A;\r\n D = C >> 2;\r\n F = z;\r\n break c\r\n }\r\n } while (0);\r\n if (W >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[Z + 6] = L;\r\n var ka = t[m + (f + 4)];\r\n if (0 != (ka | 0)) {\r\n if (ka >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[Z + 4] = ka;\r\n b[ka + 24 >> 2] = W\r\n }\r\n var oa = t[m + (f + 5)];\r\n if (0 != (oa | 0)) {\r\n if (oa >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[Z + 5] = oa;\r\n b[oa + 24 >> 2] = W\r\n }\r\n }\r\n C = A;\r\n D = C >> 2;\r\n F = z\r\n }\r\n } else C = e, D = C >> 2, F = p; while (0);\r\n var ma = C;\r\n if (!(ma >>> 0 >= E >>> 0)) {\r\n var pa = a + (p - 4) | 0,\r\n la = t[pa >> 2];\r\n if (0 != (la & 1 | 0)) {\r\n if (0 == (la & 2 | 0)) {\r\n if ((H | 0) == (b[l + 24 >> 2] | 0)) {\r\n var ra = b[l + 12 >> 2] + F | 0;\r\n b[l + 12 >> 2] = ra;\r\n b[l + 24 >> 2] = C;\r\n b[D + 1] = ra | 1;\r\n (C | 0) == (b[l + 20 >> 2] | 0) && (b[l + 20 >> 2] = 0, b[l + 8 >> 2] = 0);\r\n if (ra >>> 0 <= t[l + 28 >> 2] >>> 0) break a;\r\n md(0);\r\n break a\r\n }\r\n if ((H | 0) == (b[l + 20 >> 2] | 0)) {\r\n var qa = b[l + 8 >> 2] + F | 0;\r\n b[l + 8 >> 2] = qa;\r\n b[l + 20 >> 2] = C;\r\n b[D + 1] = qa | 1;\r\n b[(ma + qa | 0) >> 2] = qa;\r\n break a\r\n }\r\n var sa = (la & -8) + F | 0,\r\n va = la >>> 3,\r\n xa = 256 > la >>> 0;\r\n c: do\r\n if (xa) {\r\n var ta = t[f + y],\r\n Ba = t[((p | 4) >> 2) + f];\r\n if ((ta | 0) == (Ba | 0)) b[l >> 2] &= 1 << va ^ -1;\r\n else {\r\n var Aa = ((la >>> 2 & 1073741822) << 2) + l + 40 | 0;\r\n ha = (ta | 0) == (Aa | 0) ? 63 : ta >>> 0 < t[l + 16 >> 2] >>> 0 ? 66 : 63;\r\n if (63 == ha && !((Ba | 0) != (Aa | 0) && Ba >>> 0 < t[l + 16 >> 2] >>> 0)) {\r\n b[ta + 12 >> 2] = Ba;\r\n b[Ba + 8 >> 2] = ta;\r\n break c\r\n }\r\n K();\r\n throw \"Reached an unreachable!\";\r\n }\r\n } else {\r\n var ya = E,\r\n wa = t[y + (f + 4)],\r\n za = t[((p | 4) >> 2) + f],\r\n Ka = (za | 0) == (ya | 0);\r\n do {\r\n if (Ka) {\r\n var Ha = p + (a + 12) | 0,\r\n Ia = b[Ha >> 2];\r\n if (0 == (Ia | 0)) {\r\n var Ja = p + (a + 8) | 0,\r\n La = b[Ja >> 2];\r\n if (0 == (La | 0)) {\r\n var Oa = 0;\r\n var Ga = Oa >> 2;\r\n break\r\n }\r\n var Ea = Ja,\r\n Da = La\r\n } else Ea = Ha, Da = Ia, ha = 73;\r\n for (; ;) {\r\n var Ma = Da + 20 | 0,\r\n Na = b[Ma >> 2];\r\n if (0 != (Na | 0)) Ea = Ma, Da = Na;\r\n else {\r\n var Sa = Da + 16 | 0,\r\n Ta = t[Sa >> 2];\r\n if (0 == (Ta | 0)) break;\r\n Ea = Sa;\r\n Da = Ta\r\n }\r\n }\r\n if (Ea >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[Ea >> 2] = 0;\r\n Oa = Da\r\n } else {\r\n var Qa = t[f + y];\r\n if (Qa >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[Qa + 12 >> 2] = za;\r\n b[za + 8 >> 2] = Qa;\r\n Oa = za\r\n }\r\n Ga = Oa >> 2\r\n } while (0);\r\n if (0 != (wa | 0)) {\r\n var Va = p + (a + 20) | 0,\r\n Xa = (b[Va >> 2] << 2) + l + 304 | 0,\r\n ab = (ya | 0) == (b[Xa >> 2] | 0);\r\n do {\r\n if (ab) {\r\n b[Xa >> 2] = Oa;\r\n if (0 != (Oa | 0)) break;\r\n b[l + 4 >> 2] &= 1 << b[Va >> 2] ^ -1;\r\n break c\r\n }\r\n if (wa >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n var Ya = wa + 16 | 0;\r\n (b[Ya >> 2] | 0) == (ya | 0) ? b[Ya >> 2] = Oa : b[wa + 20 >> 2] = Oa;\r\n if (0 == (Oa | 0)) break c\r\n } while (0);\r\n if (Oa >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[Ga + 6] = wa;\r\n var Ua = t[y + (f + 2)];\r\n if (0 != (Ua | 0)) {\r\n if (Ua >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[Ga + 4] = Ua;\r\n b[Ua + 24 >> 2] = Oa\r\n }\r\n var Wa = t[y + (f + 3)];\r\n if (0 != (Wa | 0)) {\r\n if (Wa >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[Ga + 5] = Wa;\r\n b[Wa + 24 >> 2] = Oa\r\n }\r\n }\r\n }\r\n while (0);\r\n b[D + 1] = sa | 1;\r\n b[ma + sa >> 2] = sa;\r\n if ((C | 0) != (b[l + 20 >> 2] | 0)) var Pa = sa;\r\n else {\r\n b[l + 8 >> 2] = sa;\r\n break a\r\n }\r\n } else b[pa >> 2] = la & -2, b[D + 1] = F | 1, Pa = b[ma + F >> 2] = F;\r\n if (256 > Pa >>> 0) {\r\n var nb = Pa >>> 2 & 1073741822,\r\n cb = (nb << 2) + l + 40 | 0,\r\n db = t[l >> 2],\r\n eb = 1 << (Pa >>> 3);\r\n if (0 == (db & eb | 0)) {\r\n b[l >> 2] = db | eb;\r\n var rb = cb,\r\n fb = (nb + 2 << 2) + l + 40 | 0\r\n } else {\r\n var gb = (nb + 2 << 2) + l + 40 | 0,\r\n hb = t[gb >> 2];\r\n if (hb >>> 0 >= t[l + 16 >> 2] >>> 0) rb = hb, fb = gb;\r\n else throw K(), \"Reached an unreachable!\";\r\n }\r\n b[fb >> 2] = C;\r\n b[rb + 12 >> 2] = C;\r\n b[D + 2] = rb;\r\n b[D + 3] = cb;\r\n break a\r\n }\r\n var ob = C,\r\n bb = Pa >>> 8;\r\n if (0 == (bb | 0)) var Za = 0;\r\n else if (16777215 < Pa >>> 0) Za = 31;\r\n else {\r\n var sb = (bb + 1048320 | 0) >>> 16 & 8,\r\n $a = bb << sb,\r\n lb = ($a + 520192 | 0) >>> 16 & 4,\r\n Ra = $a << lb,\r\n mb = (Ra + 245760 | 0) >>> 16 & 2,\r\n pb = 14 - (lb | sb | mb) + (Ra << mb >>> 15) | 0;\r\n Za = Pa >>> ((pb + 7 | 0) >>> 0) & 1 | pb << 1\r\n }\r\n var ib = (Za << 2) + l + 304 | 0;\r\n b[D + 7] = Za;\r\n b[D + 5] = 0;\r\n b[D + 4] = 0;\r\n var wb = b[l + 4 >> 2],\r\n xb = 1 << Za,\r\n Cb = 0 == (wb & xb | 0);\r\n c: do\r\n if (Cb) b[l + 4 >> 2] = wb | xb, b[ib >> 2] = ob, b[D + 6] = ib, b[D + 3] = C, b[D + 2] = C;\r\n else\r\n for (var yb = Pa << (31 == (Za | 0) ? 0 : 25 - (Za >>> 1) | 0), tb = b[ib >> 2]; ;) {\r\n if ((b[tb + 4 >> 2] & -8 | 0) == (Pa | 0)) {\r\n var zb = tb + 8 | 0,\r\n Db = t[zb >> 2],\r\n Ab = t[l + 16 >> 2];\r\n if (!(tb >>> 0 < Ab >>> 0 || Db >>> 0 < Ab >>> 0)) {\r\n b[Db + 12 >> 2] = ob;\r\n b[zb >> 2] = ob;\r\n b[D + 2] = Db;\r\n b[D + 3] = tb;\r\n b[D + 6] = 0;\r\n break c\r\n }\r\n K();\r\n throw \"Reached an unreachable!\";\r\n }\r\n var qb = (yb >>> 31 << 2) + tb + 16 | 0,\r\n Bb = t[qb >> 2];\r\n if (0 == (Bb | 0)) {\r\n if (qb >>> 0 >= t[l + 16 >> 2] >>> 0) {\r\n b[qb >> 2] = ob;\r\n b[D + 6] = tb;\r\n b[D + 3] = C;\r\n b[D + 2] = C;\r\n break c\r\n }\r\n K();\r\n throw \"Reached an unreachable!\";\r\n }\r\n yb <<= 1;\r\n tb = Bb\r\n }\r\n while (0);\r\n var Eb = b[l + 32 >> 2] - 1 | 0;\r\n b[l + 32 >> 2] = Eb;\r\n if (0 != (Eb | 0)) break a;\r\n Ye();\r\n break a\r\n }\r\n }\r\n }\r\n }\r\n while (0);\r\n K();\r\n throw \"Reached an unreachable!\";\r\n }\r\n while (0)\r\n }\r\n\r\n function Ye() {\r\n var a = b[l + 452 >> 2],\r\n f = 0 == (a | 0);\r\n a: do\r\n if (!f)\r\n for (; ;)\r\n if (a = b[a + 8 >> 2], 0 == (a | 0)) break a; while (0);\r\n b[l + 32 >> 2] = -1\r\n }\r\n\r\n function Qd(a, b) {\r\n return 0 == (a | 0) ? db(b) : nd(a, b)\r\n }\r\n\r\n function nd(a, f) {\r\n var c;\r\n var d = 4294967231 < f >>> 0;\r\n a: do\r\n if (d) {\r\n var e = ld();\r\n b[e >> 2] = 12;\r\n e = 0\r\n } else {\r\n var h = c = a - 8 | 0;\r\n d = (a - 4 | 0) >> 2;\r\n var r = t[d];\r\n e = r & -8;\r\n var g = e - 8 | 0,\r\n k = a + g | 0;\r\n if (!(c >>> 0 < t[l + 16 >> 2] >>> 0)) {\r\n var p = r & 3;\r\n if (1 != (p | 0) & -8 < (g | 0) && (c = (a + (e - 4) | 0) >> 2, 0 != (b[c] & 1 | 0))) {\r\n g = 11 > f >>> 0 ? 16 : f + 11 & -8;\r\n if (0 == (p | 0)) {\r\n var y = 0,\r\n E = Ze(h, g);\r\n var H = 17\r\n } else e >>> 0 < g >>> 0 ? (k | 0) != (b[l + 24 >> 2] | 0) ? H = 21 : (k = b[l + 12 >> 2] + e | 0, k >>> 0 <= g >>> 0 ? H = 21 : (y = k - g | 0, E = a + (g - 8) | 0, b[d] = g | r & 1 | 2, b[a + (g - 4) >> 2] = y | 1, b[l + 24 >> 2] = E, b[l + 12 >> 2] = y, y = 0, E = h, H = 17)) : (y = e - g | 0, 15 >= y >>> 0 ? y = 0 : (b[d] = g | r & 1 | 2, b[a + (g - 4) >> 2] = y | 3, b[c] |= 1, y = a + g | 0), E = h, H = 17);\r\n if (17 == H && 0 != (E | 0)) {\r\n 0 != (y | 0) && eb(y);\r\n e = E + 8 | 0;\r\n break a\r\n }\r\n h = db(f);\r\n if (0 == (h | 0)) {\r\n e = 0;\r\n break a\r\n }\r\n d = e - (0 == (b[d] & 3 | 0) ? 8 : 4) | 0;\r\n fb(h, a, d >>> 0 < f >>> 0 ? d : f, 1);\r\n eb(a);\r\n e = h;\r\n break a\r\n }\r\n }\r\n K();\r\n throw \"Reached an unreachable!\";\r\n }\r\n while (0);\r\n return e\r\n }\r\n\r\n function id() {\r\n if (0 == (b[xa >> 2] | 0)) {\r\n var a = $e(8);\r\n if (0 == (a - 1 & a | 0)) b[xa + 8 >> 2] = a, b[xa + 4 >> 2] = a, b[xa + 12 >> 2] = -1, b[xa + 16 >> 2] = 2097152, b[xa + 20 >> 2] = 0, b[l + 440 >> 2] = 0, a = af(0), b[xa >> 2] = a & -16 ^ 1431655768;\r\n else throw K(), \"Reached an unreachable!\";\r\n }\r\n }\r\n\r\n function bc(a) {\r\n if (0 == (a | 0)) a = 0;\r\n else {\r\n a = b[a - 4 >> 2];\r\n var f = a & 3;\r\n a = 1 == (f | 0) ? 0 : (a & -8) - (0 == (f | 0) ? 8 : 4) | 0\r\n }\r\n return a\r\n }\r\n\r\n function Ze(a, f) {\r\n var c = b[a + 4 >> 2] & -8;\r\n if (256 > f >>> 0) var d = 0;\r\n else c >>> 0 >= (f + 4 | 0) >>> 0 && (c - f | 0) >>> 0 <= b[xa + 8 >> 2] << 1 >>> 0 ? d = a : d = 0;\r\n return d\r\n }\r\n\r\n function gc(a) {\r\n var f, c = l + 444 | 0;\r\n for (f = c >> 2; ;) {\r\n var d = t[f];\r\n if (d >>> 0 <= a >>> 0 && (d + b[f + 1] | 0) >>> 0 > a >>> 0) {\r\n a = c;\r\n break\r\n }\r\n f = t[f + 2];\r\n if (0 == (f | 0)) {\r\n a = 0;\r\n break\r\n }\r\n c = f;\r\n f = c >> 2\r\n }\r\n return a\r\n }\r\n\r\n function Ab(a, f) {\r\n var c = a + 8 | 0;\r\n c = 0 == (c & 7 | 0) ? 0 : -c & 7;\r\n var d = f - c | 0;\r\n b[l + 24 >> 2] = a + c | 0;\r\n b[l + 12 >> 2] = d;\r\n b[c + (a + 4) >> 2] = d | 1;\r\n b[f + (a + 4) >> 2] = 40;\r\n b[l + 28 >> 2] = b[xa + 16 >> 2]\r\n }\r\n\r\n function Xe() {\r\n for (var a = 0; ;) {\r\n var f = a << 1,\r\n c = (f << 2) + l + 40 | 0;\r\n b[l + (f + 3 << 2) + 40 >> 2] = c;\r\n b[l + (f + 2 << 2) + 40 >> 2] = c;\r\n a = a + 1 | 0;\r\n if (32 == (a | 0)) break\r\n }\r\n }\r\n\r\n function jd(a, f, c) {\r\n var d = f >> 2,\r\n e = a >> 2,\r\n n = a + 8 | 0;\r\n n = 0 == (n & 7 | 0) ? 0 : -n & 7;\r\n var h = f + 8 | 0;\r\n var g = 0 == (h & 7 | 0) ? 0 : -h & 7;\r\n var k = g >> 2;\r\n var p = f + g | 0,\r\n y = n + c | 0;\r\n h = y >> 2;\r\n var E = a + y | 0,\r\n H = p - (a + n) - c | 0;\r\n b[(n + 4 >> 2) + e] = c | 3;\r\n c = (p | 0) == (b[l + 24 >> 2] | 0);\r\n a: do\r\n if (c) {\r\n var x = b[l + 12 >> 2] + H | 0;\r\n b[l + 12 >> 2] = x;\r\n b[l + 24 >> 2] = E;\r\n b[h + (e + 1)] = x | 1\r\n } else if ((p | 0) == (b[l + 20 >> 2] | 0)) x = b[l + 8 >> 2] + H | 0, b[l + 8 >> 2] = x, b[l + 20 >> 2] = E, b[h + (e + 1)] = x | 1, b[(a + x + y | 0) >> 2] = x;\r\n else {\r\n var q = t[k + (d + 1)];\r\n if (1 == (q & 3 | 0)) {\r\n x = q & -8;\r\n var v = q >>> 3,\r\n m = 256 > q >>> 0;\r\n b: do\r\n if (m) {\r\n var w = t[((g | 8) >> 2) + d],\r\n z = t[k + (d + 3)];\r\n if ((w | 0) == (z | 0)) b[l >> 2] &= 1 << v ^ -1;\r\n else {\r\n q = ((q >>> 2 & 1073741822) << 2) + l + 40 | 0;\r\n var A = (w | 0) == (q | 0) ? 15 : w >>> 0 < t[l + 16 >> 2] >>> 0 ? 18 : 15;\r\n if (15 == A && !((z | 0) != (q | 0) && z >>> 0 < t[l + 16 >> 2] >>> 0)) {\r\n b[w + 12 >> 2] = z;\r\n b[z + 8 >> 2] = w;\r\n break b\r\n }\r\n K();\r\n throw \"Reached an unreachable!\";\r\n }\r\n } else {\r\n w = p;\r\n z = t[((g | 24) >> 2) + d];\r\n var C = t[k + (d + 3)],\r\n D = (C | 0) == (w | 0);\r\n do {\r\n if (D) {\r\n var B = g | 16;\r\n var F = B + (f + 4) | 0,\r\n G = b[F >> 2];\r\n if (0 == (G | 0)) {\r\n if (B = f + B | 0, G = b[B >> 2], 0 == (G | 0)) {\r\n G = 0;\r\n B = G >> 2;\r\n break\r\n }\r\n } else B = F, A = 25;\r\n for (; ;) {\r\n F = G + 20 | 0;\r\n var I = b[F >> 2];\r\n if (0 != (I | 0)) B = F, G = I;\r\n else {\r\n F = G + 16 | 0;\r\n I = t[F >> 2];\r\n if (0 == (I | 0)) break;\r\n B = F;\r\n G = I\r\n }\r\n }\r\n if (B >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[B >> 2] = 0\r\n } else {\r\n B = t[((g | 8) >> 2) + d];\r\n if (B >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[B + 12 >> 2] = C;\r\n b[C + 8 >> 2] = B;\r\n G = C\r\n }\r\n B = G >> 2\r\n } while (0);\r\n if (0 != (z | 0)) {\r\n C = g + (f + 28) | 0;\r\n D = (b[C >> 2] << 2) + l + 304 | 0;\r\n F = (w | 0) == (b[D >> 2] | 0);\r\n do {\r\n if (F) {\r\n b[D >> 2] = G;\r\n if (0 != (G | 0)) break;\r\n b[l + 4 >> 2] &= 1 << b[C >> 2] ^ -1;\r\n break b\r\n }\r\n if (z >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n I = z + 16 | 0;\r\n (b[I >> 2] | 0) == (w | 0) ? b[I >> 2] = G : b[z + 20 >> 2] = G;\r\n if (0 == (G | 0)) break b\r\n } while (0);\r\n if (G >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[B + 6] = z;\r\n w = g | 16;\r\n z = t[(w >> 2) + d];\r\n if (0 != (z | 0)) {\r\n if (z >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[B + 4] = z;\r\n b[z + 24 >> 2] = G\r\n }\r\n w = t[(w + 4 >> 2) + d];\r\n if (0 != (w | 0)) {\r\n if (w >>> 0 < t[l + 16 >> 2] >>> 0) throw K(), \"Reached an unreachable!\";\r\n b[B + 5] = w;\r\n b[w + 24 >> 2] = G\r\n }\r\n }\r\n }\r\n while (0);\r\n q = f + (x | g) | 0;\r\n x = x + H | 0\r\n } else q = p, x = H;\r\n q = q + 4 | 0;\r\n b[q >> 2] &= -2;\r\n b[h + (e + 1)] = x | 1;\r\n b[(x >> 2) + e + h] = x;\r\n if (256 > x >>> 0) {\r\n v = x >>> 2 & 1073741822;\r\n q = (v << 2) + l + 40 | 0;\r\n m = t[l >> 2];\r\n x = 1 << (x >>> 3);\r\n if (0 == (m & x | 0)) b[l >> 2] = m | x, x = q, v = (v + 2 << 2) + l + 40 | 0;\r\n else if (v = (v + 2 << 2) + l + 40 | 0, x = t[v >> 2], !(x >>> 0 >= t[l + 16 >> 2] >>> 0)) throw K(), \"Reached an unreachable!\";\r\n b[v >> 2] = E;\r\n b[x + 12 >> 2] = E;\r\n b[h + (e + 2)] = x;\r\n b[h + (e + 3)] = q\r\n } else if (q = E, m = x >>> 8, 0 == (m | 0) ? m = 0 : 16777215 < x >>> 0 ? m = 31 : (v = (m + 1048320 | 0) >>> 16 & 8, w = m << v, m = (w + 520192 | 0) >>> 16 & 4, w <<= m, z = (w + 245760 | 0) >>> 16 & 2, v = 14 - (m | v | z) + (w << z >>> 15) | 0, m = x >>> ((v + 7 | 0) >>> 0) & 1 | v << 1), v = (m << 2) + l + 304 | 0, b[h + (e + 7)] = m, w = y + (a + 16) | 0, b[h + (e + 5)] = 0, b[w >> 2] = 0, w = b[l + 4 >> 2], z = 1 << m, 0 == (w & z | 0)) b[l + 4 >> 2] = w | z, b[v >> 2] = q, b[h + (e + 6)] = v, b[h + (e + 3)] = q, b[h + (e + 2)] = q;\r\n else\r\n for (d = x << (31 == (m | 0) ? 0 : 25 - (m >>> 1) | 0), f = b[v >> 2]; ;) {\r\n if ((b[f + 4 >> 2] & -8 | 0) == (x | 0)) {\r\n d = f + 8 | 0;\r\n k = t[d >> 2];\r\n g = t[l + 16 >> 2];\r\n if (!(f >>> 0 < g >>> 0 || k >>> 0 < g >>> 0)) {\r\n b[k + 12 >> 2] = q;\r\n b[d >> 2] = q;\r\n b[h + (e + 2)] = k;\r\n b[h + (e + 3)] = f;\r\n b[h + (e + 6)] = 0;\r\n break a\r\n }\r\n K();\r\n throw \"Reached an unreachable!\";\r\n }\r\n k = (d >>> 31 << 2) + f + 16 | 0;\r\n g = t[k >> 2];\r\n if (0 == (g | 0)) {\r\n if (k >>> 0 >= t[l + 16 >> 2] >>> 0) {\r\n b[k >> 2] = q;\r\n b[h + (e + 6)] = f;\r\n b[h + (e + 3)] = q;\r\n b[h + (e + 2)] = q;\r\n break a\r\n }\r\n K();\r\n throw \"Reached an unreachable!\";\r\n }\r\n d <<= 1;\r\n f = g\r\n }\r\n }\r\n while (0);\r\n return a + (n | 8) | 0\r\n }\r\n\r\n function bf() {\r\n return q.Yb | 0\r\n }\r\n\r\n function cf() {\r\n return q.Hb | 0\r\n }\r\n\r\n function od(a) {\r\n b[a >> 2] = pd + 8 | 0\r\n }\r\n\r\n function qd(a) {\r\n 0 != (a | 0) && eb(a)\r\n }\r\n\r\n function df(a) {\r\n hc(a);\r\n qd(a)\r\n }\r\n\r\n function hc(a) {\r\n ef(a | 0)\r\n }\r\n\r\n function ff(a) {\r\n od(a | 0);\r\n b[a >> 2] = rd + 8 | 0\r\n }\r\n\r\n function gf(a) {\r\n hc(a | 0);\r\n qd(a)\r\n }\r\n\r\n function kd(a, f) {\r\n var c = t[l + 24 >> 2];\r\n var d = c >> 2;\r\n var e = gc(c),\r\n h = b[e >> 2];\r\n var g = b[e + 4 >> 2];\r\n e = h + g | 0;\r\n var k = h + (g - 39) | 0;\r\n h = h + (g - 47) + (0 == (k & 7 | 0) ? 0 : -k & 7) | 0;\r\n h = h >>> 0 < (c + 16 | 0) >>> 0 ? c : h;\r\n k = h + 8 | 0;\r\n g = k >> 2;\r\n Ab(a, f - 40 | 0);\r\n b[(h + 4 | 0) >> 2] = 27;\r\n b[g] = b[l + 444 >> 2];\r\n b[g + 1] = b[l + 448 >> 2];\r\n b[g + 2] = b[l + 452 >> 2];\r\n b[g + 3] = b[l + 456 >> 2];\r\n b[l + 444 >> 2] = a;\r\n b[l + 448 >> 2] = f;\r\n b[l + 456 >> 2] = 0;\r\n b[l + 452 >> 2] = k;\r\n a = h + 28 | 0;\r\n b[a >> 2] = 7;\r\n f = (h + 32 | 0) >>> 0 < e >>> 0;\r\n a: do\r\n if (f)\r\n for (; ;) {\r\n f = a + 4 | 0;\r\n b[f >> 2] = 7;\r\n if ((a + 8 | 0) >>> 0 >= e >>> 0) break a;\r\n a = f\r\n }\r\n while (0);\r\n e = (h | 0) == (c | 0);\r\n a: do\r\n if (!e)\r\n if (a = h - c | 0, f = c + a | 0, g = a + (c + 4) | 0, b[g >> 2] &= -2, b[d + 1] = a | 1, b[f >> 2] = a, 256 > a >>> 0) {\r\n g = a >>> 2 & 1073741822;\r\n f = (g << 2) + l + 40 | 0;\r\n k = t[l >> 2];\r\n a = 1 << (a >>> 3);\r\n if (0 == (k & a | 0)) b[l >> 2] = k | a, a = f, g = (g + 2 << 2) + l + 40 | 0;\r\n else if (g = (g + 2 << 2) + l + 40 | 0, a = t[g >> 2], !(a >>> 0 >= t[l + 16 >> 2] >>> 0)) throw K(), \"Reached an unreachable!\";\r\n b[g >> 2] = c;\r\n b[a + 12 >> 2] = c;\r\n b[d + 2] = a;\r\n b[d + 3] = f\r\n } else {\r\n f = c;\r\n k = a >>> 8;\r\n if (0 == (k | 0)) k = 0;\r\n else if (16777215 < a >>> 0) k = 31;\r\n else {\r\n g = (k + 1048320 | 0) >>> 16 & 8;\r\n var p = k << g;\r\n k = (p + 520192 | 0) >>> 16 & 4;\r\n p <<= k;\r\n var q = (p + 245760 | 0) >>> 16 & 2;\r\n g = 14 - (k | g | q) + (p << q >>> 15) | 0;\r\n k = a >>> ((g + 7 | 0) >>> 0) & 1 | g << 1\r\n }\r\n g = (k << 2) + l + 304 | 0;\r\n b[d + 7] = k;\r\n b[d + 5] = 0;\r\n b[d + 4] = 0;\r\n p = b[l + 4 >> 2];\r\n q = 1 << k;\r\n if (0 == (p & q | 0)) b[l + 4 >> 2] = p | q, b[g >> 2] = f, b[d + 6] = g, b[d + 3] = c, b[d + 2] = c;\r\n else\r\n for (e = a << (31 == (k | 0) ? 0 : 25 - (k >>> 1) | 0), h = b[g >> 2]; ;) {\r\n if ((b[h + 4 >> 2] & -8 | 0) == (a | 0)) {\r\n c = h + 8 | 0;\r\n e = t[c >> 2];\r\n a = t[l + 16 >> 2];\r\n if (!(h >>> 0 < a >>> 0 || e >>> 0 < a >>> 0)) {\r\n b[e + 12 >> 2] = f;\r\n b[c >> 2] = f;\r\n b[d + 2] = e;\r\n b[d + 3] = h;\r\n b[d + 6] = 0;\r\n break a\r\n }\r\n K();\r\n throw \"Reached an unreachable!\";\r\n }\r\n g = (e >>> 31 << 2) + h + 16 | 0;\r\n k = t[g >> 2];\r\n if (0 == (k | 0)) {\r\n if (g >>> 0 >= t[l + 16 >> 2] >>> 0) {\r\n b[g >> 2] = f;\r\n b[d + 6] = h;\r\n b[d + 3] = c;\r\n b[d + 2] = c;\r\n break a\r\n }\r\n K();\r\n throw \"Reached an unreachable!\";\r\n }\r\n e <<= 1;\r\n h = k\r\n }\r\n }\r\n while (0)\r\n }\r\n\r\n function hf(a, c) {\r\n function f(a) {\r\n if (\"double\" === a) var f = (cb[0] = b[c + d >> 2], cb[1] = b[c + d + 4 >> 2], Xb[0]);\r\n else \"i64\" == a ? f = [b[c + d >> 2], b[c + d + 4 >> 2]] : (a = \"i32\", f = b[c + d >> 2]);\r\n d += Q.Cc(a);\r\n return f\r\n }\r\n for (var d = 0, e = [], h, g; ;) {\r\n var k = a;\r\n h = D[a];\r\n if (0 === h) break;\r\n g = D[a + 1];\r\n if (37 == h) {\r\n var l = !1,\r\n p = !1,\r\n y = !1,\r\n E = !1;\r\n a: for (; ;) {\r\n switch (g) {\r\n case 43:\r\n l = !0;\r\n break;\r\n case 45:\r\n p = !0;\r\n break;\r\n case 35:\r\n y = !0;\r\n break;\r\n case 48:\r\n if (E) break a;\r\n else {\r\n E = !0;\r\n break\r\n }\r\n default:\r\n break a\r\n }\r\n a++;\r\n g = D[a + 1]\r\n }\r\n var H = 0;\r\n if (42 == g) H = f(\"i32\"), a++ , g = D[a + 1];\r\n else\r\n for (; 48 <= g && 57 >= g;) H = 10 * H + (g - 48), a++ , g = D[a + 1];\r\n var x = !1;\r\n if (46 == g) {\r\n var q = 0;\r\n x = !0;\r\n a++;\r\n g = D[a + 1];\r\n if (42 == g) q = f(\"i32\"), a++;\r\n else\r\n for (; ;) {\r\n g = D[a + 1];\r\n if (48 > g || 57 < g) break;\r\n q = 10 * q + (g - 48);\r\n a++\r\n }\r\n g = D[a + 1]\r\n } else q = 6;\r\n switch (String.fromCharCode(g)) {\r\n case \"h\":\r\n g = D[a + 2];\r\n if (104 == g) {\r\n a++;\r\n var t = 1\r\n } else t = 2;\r\n break;\r\n case \"l\":\r\n g = D[a + 2];\r\n 108 == g ? (a++ , t = 8) : t = 4;\r\n break;\r\n case \"L\":\r\n case \"q\":\r\n case \"j\":\r\n t = 8;\r\n break;\r\n case \"z\":\r\n case \"t\":\r\n case \"I\":\r\n t = 4;\r\n break;\r\n default:\r\n t = null\r\n }\r\n t && a++;\r\n g = D[a + 1];\r\n if (-1 != \"diuoxXp\".split(\"\").indexOf(String.fromCharCode(g))) {\r\n k = 100 == g || 105 == g;\r\n t = t || 4;\r\n var v = h = f(\"i\" + 8 * t),\r\n m;\r\n 8 == t && (h = Q.Mc(h[0], h[1], 117 == g));\r\n 4 >= t && (h = (k ? L : R)(h & Math.pow(256, t) - 1, 8 * t));\r\n var w = Math.abs(h);\r\n k = \"\";\r\n if (100 == g || 105 == g) 8 == t && Bb ? m = Bb.stringify(v[0], v[1]) : m = L(h, 8 * t, 1).toString(10);\r\n else if (117 == g) 8 == t && Bb ? m = Bb.stringify(v[0], v[1], !0) : m = R(h, 8 * t, 1).toString(10), h = Math.abs(h);\r\n else if (111 == g) m = (y ? \"0\" : \"\") + w.toString(8);\r\n else if (120 == g || 88 == g) {\r\n k = y ? \"0x\" : \"\";\r\n if (0 > h) {\r\n h = -h;\r\n m = (w - 1).toString(16);\r\n y = [];\r\n for (v = 0; v < m.length; v++) y.push((15 - parseInt(m[v], 16)).toString(16));\r\n for (m = y.join(\"\"); m.length < 2 * t;) m = \"f\" + m\r\n } else m = w.toString(16);\r\n 88 == g && (k = k.toUpperCase(), m = m.toUpperCase())\r\n } else 112 == g && (0 === w ? m = \"(nil)\" : (k = \"0x\", m = w.toString(16)));\r\n if (x)\r\n for (; m.length < q;) m = \"0\" + m;\r\n for (l && (k = 0 > h ? \"-\" + k : \"+\" + k); k.length + m.length < H;) p ? m += \" \" : E ? m = \"0\" + m : k = \" \" + k;\r\n m = k + m;\r\n m.split(\"\").forEach(function (a) {\r\n e.push(a.charCodeAt(0))\r\n })\r\n } else if (-1 != \"fFeEgG\".split(\"\").indexOf(String.fromCharCode(g))) {\r\n h = f(\"double\");\r\n if (isNaN(h)) m = \"nan\", E = !1;\r\n else if (isFinite(h)) {\r\n x = !1;\r\n t = Math.min(q, 20);\r\n if (103 == g || 71 == g) x = !0, q = q || 1, t = parseInt(h.toExponential(t).split(\"e\")[1], 10), q > t && -4 <= t ? (g = (103 == g ? \"f\" : \"F\").charCodeAt(0), q -= t + 1) : (g = (103 == g ? \"e\" : \"E\").charCodeAt(0), q--), t = Math.min(q, 20);\r\n if (101 == g || 69 == g) m = h.toExponential(t), /[eE][-+]\\d$/.test(m) && (m = m.slice(0, -1) + \"0\" + m.slice(-1));\r\n else if (102 == g || 70 == g) m = h.toFixed(t);\r\n k = m.split(\"e\");\r\n if (x && !y)\r\n for (; 1 < k[0].length && -1 != k[0].indexOf(\".\") && (\"0\" == k[0].slice(-1) || \".\" == k[0].slice(-1));) k[0] = k[0].slice(0, -1);\r\n else\r\n for (y && -1 == m.indexOf(\".\") && (k[0] += \".\"); q > t++;) k[0] += \"0\";\r\n m = k[0] + (1 < k.length ? \"e\" + k[1] : \"\");\r\n 69 == g && (m = m.toUpperCase());\r\n l && 0 <= h && (m = \"+\" + m)\r\n } else m = (0 > h ? \"-\" : \"\") + \"inf\", E = !1;\r\n for (; m.length < H;) p ? m += \" \" : !E || \"-\" != m[0] && \"+\" != m[0] ? m = (E ? \"0\" : \" \") + m : m = m[0] + \"0\" + m.slice(1);\r\n 97 > g && (m = m.toUpperCase());\r\n m.split(\"\").forEach(function (a) {\r\n e.push(a.charCodeAt(0))\r\n })\r\n } else if (115 == g) {\r\n (l = f(\"i8*\")) ? (l = B(l), x && l.length > q && (l = l.slice(0, q))) : l = A(\"(null)\", !0);\r\n if (!p)\r\n for (; l.length < H--;) e.push(32);\r\n e = e.concat(l);\r\n if (p)\r\n for (; l.length < H--;) e.push(32)\r\n } else if (99 == g) {\r\n for (p && e.push(f(\"i8\")); 0 < --H;) e.push(32);\r\n p || e.push(f(\"i8\"))\r\n } else if (110 == g) p = f(\"i32*\"), b[p >> 2] = e.length;\r\n else if (37 == g) e.push(h);\r\n else\r\n for (v = k; v < a + 2; v++) e.push(D[v]);\r\n a += 2\r\n } else e.push(h), a += 1\r\n }\r\n return e\r\n }\r\n\r\n function jf(a, b, c, d) {\r\n c = hf(c, d);\r\n b = void 0 === b ? c.length : Math.min(c.length, b - 1);\r\n for (d = 0; d < b; d++) D[a + d] = c[d];\r\n D[a + d] = 0;\r\n return c.length\r\n }\r\n\r\n function Ld(a, b, c) {\r\n return jf(a, void 0, b, c)\r\n }\r\n\r\n function Y(a) {\r\n Y.a || (Y.a = g([0], \"i32\", 2));\r\n return b[Y.a >> 2] = a\r\n }\r\n\r\n function kf(a, b, c, d) {\r\n a = F.streams[a];\r\n if (!a || a.object.T) return Y(ra.Pa), -1;\r\n if (a.pa) {\r\n if (a.object.Y) return Y(ra.Jb), -1;\r\n if (0 > c || 0 > d) return Y(ra.wa), -1;\r\n for (var f = a.object.v; f.length < d;) f.push(0);\r\n for (var e = 0; e < c; e++) f[d + e] = I[b + e];\r\n a.object.timestamp = Date.now();\r\n return e\r\n }\r\n Y(ra.fa);\r\n return -1\r\n }\r\n\r\n function sd(a, b, c) {\r\n var f = F.streams[a];\r\n if (f) {\r\n if (f.pa) {\r\n if (0 > c) return Y(ra.wa), -1;\r\n if (f.object.T) {\r\n if (f.object.ca) {\r\n for (a = 0; a < c; a++) try {\r\n f.object.ca(D[b + a])\r\n } catch (na) {\r\n return Y(ra.Qa), -1\r\n }\r\n f.object.timestamp = Date.now();\r\n return a\r\n }\r\n Y(ra.Lb);\r\n return -1\r\n }\r\n b = kf(a, b, c, f.position); - 1 != b && (f.position += b);\r\n return b\r\n }\r\n Y(ra.fa);\r\n return -1\r\n }\r\n Y(ra.Pa);\r\n return -1\r\n }\r\n\r\n function lf(a) {\r\n return z(a)\r\n }\r\n\r\n function mf(a, b) {\r\n return sd(b, a, lf(a))\r\n }\r\n\r\n function Nb(a, b) {\r\n a = R(a & 255);\r\n D[Nb.a] = a;\r\n return -1 == sd(b, Nb.a, 1) ? (b in F.streams && (F.streams[b].error = !0), -1) : a\r\n }\r\n\r\n function Md(a) {\r\n var c = b[Ob >> 2];\r\n a = mf(a, c);\r\n return 0 > a ? a : 0 > Nb(10, c) ? -1 : a + 1\r\n }\r\n\r\n function Xa(a, c, d) {\r\n if (20 <= d) {\r\n for (d = a + d; a % 4;) D[a++] = c;\r\n 0 > c && (c += 256);\r\n a >>= 2;\r\n for (var f = d >> 2, e = c | c << 8 | c << 16 | c << 24; a < f;) b[a++] = e;\r\n for (a <<= 2; a < d;) D[a++] = c\r\n } else\r\n for (; d--;) D[a++] = c\r\n }\r\n\r\n function fb(a, c, d) {\r\n if (20 <= d && c % 2 == a % 2)\r\n if (c % 4 == a % 4) {\r\n for (d = c + d; c % 4;) D[a++] = D[c++];\r\n c >>= 2;\r\n a >>= 2;\r\n for (var f = d >> 2; c < f;) b[a++] = b[c++];\r\n c <<= 2;\r\n for (a <<= 2; c < d;) D[a++] = D[c++]\r\n } else {\r\n d = c + d;\r\n c % 2 && (D[a++] = D[c++]);\r\n c >>= 1;\r\n a >>= 1;\r\n for (f = d >> 1; c < f;) Da[a++] = Da[c++];\r\n c <<= 1;\r\n a <<= 1;\r\n c < d && (D[a++] = D[c++])\r\n }\r\n else\r\n for (; d--;) D[a++] = D[c++]\r\n }\r\n\r\n function K() {\r\n throw \"abort() at \" + Error().stack;\r\n }\r\n\r\n function $e(a) {\r\n switch (a) {\r\n case 8:\r\n return 4096;\r\n case 54:\r\n case 56:\r\n case 21:\r\n case 61:\r\n case 63:\r\n case 22:\r\n case 67:\r\n case 23:\r\n case 24:\r\n case 25:\r\n case 26:\r\n case 27:\r\n case 69:\r\n case 28:\r\n case 101:\r\n case 70:\r\n case 71:\r\n case 29:\r\n case 30:\r\n case 199:\r\n case 75:\r\n case 76:\r\n case 32:\r\n case 43:\r\n case 44:\r\n case 80:\r\n case 46:\r\n case 47:\r\n case 45:\r\n case 48:\r\n case 49:\r\n case 42:\r\n case 82:\r\n case 33:\r\n case 7:\r\n case 108:\r\n case 109:\r\n case 107:\r\n case 112:\r\n case 119:\r\n case 121:\r\n return 200809;\r\n case 13:\r\n case 104:\r\n case 94:\r\n case 95:\r\n case 34:\r\n case 35:\r\n case 77:\r\n case 81:\r\n case 83:\r\n case 84:\r\n case 85:\r\n case 86:\r\n case 87:\r\n case 88:\r\n case 89:\r\n case 90:\r\n case 91:\r\n case 94:\r\n case 95:\r\n case 110:\r\n case 111:\r\n case 113:\r\n case 114:\r\n case 115:\r\n case 116:\r\n case 117:\r\n case 118:\r\n case 120:\r\n case 40:\r\n case 16:\r\n case 79:\r\n case 19:\r\n return -1;\r\n case 92:\r\n case 93:\r\n case 5:\r\n case 72:\r\n case 6:\r\n case 74:\r\n case 92:\r\n case 93:\r\n case 96:\r\n case 97:\r\n case 98:\r\n case 99:\r\n case 102:\r\n case 103:\r\n case 105:\r\n return 1;\r\n case 38:\r\n case 66:\r\n case 50:\r\n case 51:\r\n case 4:\r\n return 1024;\r\n case 15:\r\n case 64:\r\n case 41:\r\n return 32;\r\n case 55:\r\n case 37:\r\n case 17:\r\n return 2147483647;\r\n case 18:\r\n case 1:\r\n return 47839;\r\n case 59:\r\n case 57:\r\n return 99;\r\n case 68:\r\n case 58:\r\n return 2048;\r\n case 0:\r\n return 2097152;\r\n case 3:\r\n return 65536;\r\n case 14:\r\n return 32768;\r\n case 73:\r\n return 32767;\r\n case 39:\r\n return 16384;\r\n case 60:\r\n return 1E3;\r\n case 106:\r\n return 700;\r\n case 52:\r\n return 256;\r\n case 62:\r\n return 255;\r\n case 2:\r\n return 100;\r\n case 65:\r\n return 64;\r\n case 36:\r\n return 20;\r\n case 100:\r\n return 16;\r\n case 20:\r\n return 6;\r\n case 53:\r\n return 4\r\n }\r\n Y(ra.wa);\r\n return -1\r\n }\r\n\r\n function af(a) {\r\n var c = Math.floor(Date.now() / 1E3);\r\n a && (b[a >> 2] = c);\r\n return c\r\n }\r\n\r\n function nf() {\r\n return Y.a\r\n }\r\n\r\n function La(a) {\r\n var b = La;\r\n b.b || (Ia = Ia + 4095 >> 12 << 12, b.b = !0);\r\n b = Ia;\r\n 0 != a && Q.Cb(a);\r\n return b\r\n }\r\n\r\n function td(a) {\r\n a = a || w.arguments;\r\n w.setStatus && w.setStatus(\"\");\r\n w.preRun && w.preRun();\r\n var b = null;\r\n w._main && (p(ud), b = w.jc(a), w.noExitRuntime || (p(vd), of.print()));\r\n w.postRun && w.postRun();\r\n return b\r\n }\r\n\r\n var ib = {};\r\n\r\n if (\"undefined\" == typeof wb) var wb = {};\r\n\r\n var w = {};\r\n\r\n try {\r\n this.Module = w\r\n } catch (a) {\r\n this.Module = w = {}\r\n }\r\n\r\n var wd = \"object\" === typeof wb;\r\n if (wd)\r\n if (wd) w.print || (w.print = function (a) {\r\n console.log(a)\r\n }), w.printErr || (w.printErr = function (a) {\r\n console.log(a)\r\n }), w.read = function (a) {\r\n var b = new XMLHttpRequest;\r\n b.open(\"GET\", a, !1);\r\n b.send(null);\r\n return b.responseText\r\n }, w.arguments || \"undefined\" != typeof arguments && (w.arguments = arguments);\r\n else throw \"Unknown runtime environment. Where are we?\";\r\n else w.print = print, w.printErr = printErr, w.read = \"undefined\" != typeof read ? read : function (a) {\r\n snarf(a)\r\n }, w.arguments || (\"undefined\" != typeof scriptArgs ? w.arguments = scriptArgs : \"undefined\" != typeof arguments && (w.arguments = arguments));\r\n \"undefined\" == !w.load && w.read && (w.load = function (a) {\r\n c(w.read(a))\r\n });\r\n w.printErr || (w.printErr = function () { });\r\n w.print || (w.print = w.printErr);\r\n w.arguments || (w.arguments = []);\r\n w.print = w.print;\r\n w.qf = w.printErr;\r\n var Q = {\r\n Bb: function () {\r\n return M\r\n },\r\n kd: function (a) {\r\n M = a\r\n },\r\n bf: function (a, b) {\r\n b = b || 4;\r\n return 1 == b ? a : \"Math.ceil((\" + a + \")/\" + b + \")*\" + b\r\n },\r\n Ic: function (a) {\r\n return a in Q.Sb || a in Q.Nb\r\n },\r\n Jc: function (a) {\r\n return \"*\" == a[a.length - 1]\r\n },\r\n Lc: function (a) {\r\n return isPointerType(a) ? !1 : /^\\[\\d+ x (.*)\\]/.test(a) || /?/.test(a) ? !0 : \"%\" == a[0]\r\n },\r\n Sb: {\r\n i1: 0,\r\n i8: 0,\r\n i16: 0,\r\n i32: 0,\r\n i64: 0\r\n },\r\n Nb: {\r\n \"float\": 0,\r\n \"double\": 0\r\n },\r\n Se: function (a, b, c, e) {\r\n var f = Math.pow(2, e) - 1;\r\n if (32 > e) switch (c) {\r\n case \"shl\":\r\n return [a << e, b << e | (a & f << 32 - e) >>> 32 - e];\r\n case \"ashr\":\r\n return [(a >>> e | (b & f) << 32 - e) >> 0 >>> 0, b >> e >>> 0];\r\n case \"lshr\":\r\n return [(a >>> e | (b & f) << 32 - e) >>> 0, b >>> e]\r\n } else if (32 == e) switch (c) {\r\n case \"shl\":\r\n return [0, a];\r\n case \"ashr\":\r\n return [b, 0 > (b | 0) ? f : 0];\r\n case \"lshr\":\r\n return [b, 0]\r\n } else switch (c) {\r\n case \"shl\":\r\n return [0, a << e - 32];\r\n case \"ashr\":\r\n return [b >> e - 32 >>> 0, 0 > (b | 0) ? f : 0];\r\n case \"lshr\":\r\n return [b >>> e - 32, 0]\r\n }\r\n d(\"unknown bitshift64 op: \" + [value, c, e])\r\n },\r\n nf: function (a, b) {\r\n return (a | 0 | b | 0) + 4294967296 * (Math.round(a / 4294967296) | Math.round(b / 4294967296))\r\n },\r\n Qe: function (a, b) {\r\n return ((a | 0) & (b | 0)) + 4294967296 * (Math.round(a / 4294967296) & Math.round(b / 4294967296))\r\n },\r\n uf: function (a, b) {\r\n return ((a | 0) ^ (b | 0)) + 4294967296 * (Math.round(a / 4294967296) ^ Math.round(b / 4294967296))\r\n },\r\n Ea: function (a) {\r\n if (1 == Q.ja) return 1;\r\n var b = {\r\n \"%i1\": 1,\r\n \"%i8\": 1,\r\n \"%i16\": 2,\r\n \"%i32\": 4,\r\n \"%i64\": 8,\r\n \"%float\": 4,\r\n \"%double\": 8\r\n }[\"%\" + a];\r\n b || (\"*\" == a[a.length - 1] ? b = Q.ja : \"i\" == a[0] && (a = parseInt(a.substr(1)), e(0 == a % 8), b = a / 8));\r\n return b\r\n },\r\n Cc: function (a) {\r\n return Math.max(Q.Ea(a), Q.ja)\r\n },\r\n tc: function (a, b) {\r\n var c = {};\r\n return b ? a.filter(function (a) {\r\n return c[a[b]] ? !1 : c[a[b]] = !0\r\n }) : a.filter(function (a) {\r\n return c[a] ? !1 : c[a] = !0\r\n })\r\n },\r\n set: function () {\r\n for (var a = \"object\" === typeof arguments[0] ? arguments[0] : arguments, b = {}, c = 0; c < a.length; c++) b[a[c]] = 0;\r\n return b\r\n },\r\n ic: function (a) {\r\n a.W = 0;\r\n a.la = 0;\r\n var b = [],\r\n c = -1;\r\n a.lb = a.Ca.map(function (f) {\r\n var d;\r\n if (Q.Ic(f) || Q.Jc(f)) f = d = Q.Ea(f);\r\n else if (Q.Lc(f)) d = ib.types[f].W, f = ib.types[f].la;\r\n else throw \"Unclear type in struct: \" + f + \", in \" + a.Qc + \" :: \" + dump(ib.types[a.Qc]);\r\n f = a.pf ? 1 : Math.min(f, Q.ja);\r\n a.la = Math.max(a.la, f);\r\n f = Q.ka(a.W, f);\r\n a.W = f + d;\r\n 0 <= c && b.push(f - c);\r\n return c = f\r\n });\r\n a.W = Q.ka(a.W, a.la);\r\n 0 == b.length ? a.kb = a.W : 1 == Q.tc(b).length && (a.kb = b[0]);\r\n a.lf = 1 != a.kb;\r\n return a.lb\r\n },\r\n zc: function (a, b, c) {\r\n if (b) {\r\n c = c || 0;\r\n var f = (\"undefined\" === typeof ib ? Q.tf : ib.types)[b];\r\n if (!f) return null;\r\n e(f.Ca.length === a.length, \"Number of named fields must match the type for \" + b);\r\n var d = f.lb\r\n } else f = {\r\n Ca: a.map(function (a) {\r\n return a[0]\r\n })\r\n }, d = Q.ic(f);\r\n var g = {\r\n Ne: f.W\r\n };\r\n b ? a.forEach(function (a, b) {\r\n if (\"string\" === typeof a) g[a] = d[b] + c;\r\n else {\r\n var e;\r\n for (e in a) var h = e;\r\n g[h] = Q.zc(a[h], f.Ca[b], d[b])\r\n }\r\n }) : a.forEach(function (a, b) {\r\n g[a[1]] = d[b]\r\n });\r\n return g\r\n },\r\n Pe: function (a) {\r\n var b = Ma.length;\r\n Ma.push(a);\r\n Ma.push(0);\r\n return b\r\n },\r\n Ma: function (a) {\r\n var b = M;\r\n M += a;\r\n M = M + 3 >> 2 << 2;\r\n return b\r\n },\r\n Cb: function (a) {\r\n var c = Ia;\r\n Ia += a;\r\n Ia = Ia + 3 >> 2 << 2;\r\n if (Ia >= bb) {\r\n for (; bb <= Ia;) bb = 2 * bb + 4095 >> 12 << 12;\r\n a = D;\r\n var d = new ArrayBuffer(bb);\r\n D = new Int8Array(d);\r\n Da = new Int16Array(d);\r\n b = new Int32Array(d);\r\n I = new Uint8Array(d);\r\n Z = new Uint16Array(d);\r\n t = new Uint32Array(d);\r\n Cb = new Float32Array(d);\r\n ic = new Float64Array(d);\r\n D.set(a)\r\n }\r\n return c\r\n },\r\n ka: function (a, b) {\r\n return Math.ceil(a / (b ? b : 4)) * (b ? b : 4)\r\n },\r\n Mc: function (a, b, c) {\r\n return c ? (a >>> 0) + 4294967296 * (b >>> 0) : (a >>> 0) + 4294967296 * (b | 0)\r\n },\r\n ja: 4,\r\n Me: 0\r\n },\r\n of = {\r\n Xb: 0,\r\n bb: 0,\r\n rf: {},\r\n mf: function (a, b) {\r\n b || (this.bb++ , this.bb >= this.Xb && d(\"\\n\\nToo many corrections!\"))\r\n },\r\n print: function () { }\r\n },\r\n lb, Kd = this;\r\n w.ccall = h;\r\n w.cwrap = function (a, b, c) {\r\n return function () {\r\n return h(a, b, c, Array.prototype.slice.call(arguments))\r\n }\r\n };\r\n w.setValue = k;\r\n w.getValue = function (a, c) {\r\n c = c || \"i8\";\r\n \"*\" === c[c.length - 1] && (c = \"i32\");\r\n switch (c) {\r\n case \"i1\":\r\n return D[a];\r\n case \"i8\":\r\n return D[a];\r\n case \"i16\":\r\n return Da[a >> 1];\r\n case \"i32\":\r\n return b[a >> 2];\r\n case \"i64\":\r\n return b[a >> 2];\r\n case \"float\":\r\n return Cb[a >> 2];\r\n case \"double\":\r\n return cb[0] = b[a >> 2], cb[1] = b[a + 4 >> 2], Xb[0];\r\n default:\r\n d(\"invalid type for setValue: \" + c)\r\n }\r\n return null\r\n };\r\n w.ALLOC_NORMAL = 0;\r\n w.ALLOC_STACK = 1;\r\n w.ALLOC_STATIC = 2;\r\n w.allocate = g;\r\n w.Pointer_stringify = m;\r\n w.Array_stringify = function (a) {\r\n for (var b = \"\", c = 0; c < a.length; c++) b += String.fromCharCode(a[c]);\r\n return b\r\n };\r\n var M, pf = w.TOTAL_STACK || 5242880,\r\n bb = w.TOTAL_MEMORY || 10485760;\r\n e(!!Int32Array && !!Float64Array && !!(new Int32Array(1)).subarray && !!(new Int32Array(1)).set, \"Cannot fallback to non-typed array case: Code is too specialized\");\r\n var Qa = new ArrayBuffer(bb);\r\n var D = new Int8Array(Qa);\r\n var Da = new Int16Array(Qa);\r\n var b = new Int32Array(Qa);\r\n var I = new Uint8Array(Qa);\r\n var Z = new Uint16Array(Qa);\r\n var t = new Uint32Array(Qa);\r\n var Cb = new Float32Array(Qa);\r\n var ic = new Float64Array(Qa);\r\n b[0] = 255;\r\n e(255 === I[0] && 0 === I[3], \"Typed arrays 2 must be run on a little-endian system\");\r\n var jc = A(\"(null)\");\r\n var Ia = jc.length;\r\n for (var Pb = 0; Pb < jc.length; Pb++) D[Pb] = jc[Pb];\r\n w.HEAP = void 0;\r\n w.HEAP8 = D;\r\n w.HEAP16 = Da;\r\n w.HEAP32 = b;\r\n w.HEAPU8 = I;\r\n w.HEAPU16 = Z;\r\n w.HEAPU32 = t;\r\n w.HEAPF32 = Cb;\r\n w.HEAPF64 = ic;\r\n var kc = (M = Q.ka(Ia)) + pf;\r\n var lc = Q.ka(kc, 8),\r\n cb = b.subarray(lc >> 2),\r\n Xb = ic.subarray(lc >> 3);\r\n kc = lc + 8;\r\n Ia = kc + 4095 >> 12 << 12;\r\n var xd = [],\r\n ud = [],\r\n vd = [];\r\n w.Array_copy = v;\r\n w.TypedArray_copy = function (a, b, c) {\r\n void 0 === c && (c = 0);\r\n for (var d = new Uint8Array(b - c), f = c; f < b; ++f) d[f - c] = D[a + f];\r\n return d.buffer\r\n };\r\n w.String_len = z;\r\n w.String_copy = B;\r\n w.intArrayFromString = A;\r\n w.intArrayToString = function (a) {\r\n for (var b = [], c = 0; c < a.length; c++) {\r\n var d = a[c];\r\n 255 < d && (d &= 255);\r\n b.push(String.fromCharCode(d))\r\n }\r\n return b.join(\"\")\r\n };\r\n w.writeStringToMemory = G;\r\n w.writeArrayToMemory = C;\r\n var q = [],\r\n mc = 0;\r\n la.X = 1;\r\n Ja.X = 1;\r\n Sa.X = 1;\r\n U.X = 1;\r\n yb.X = 1;\r\n wa.X = 1;\r\n Pc.X = 1;\r\n w._crn_get_width = xe;\r\n w._crn_get_height = ze;\r\n w._crn_get_levels = Ae;\r\n w._crn_get_dxt_format = Be;\r\n w._crn_get_decompressed_size = Ce;\r\n w._crn_decompress = De;\r\n Qc.X = 1;\r\n Uc.X = 1;\r\n Rc.X = 1;\r\n Sc.X = 1;\r\n Tc.X = 1;\r\n Zc.X = 1;\r\n $c.X = 1;\r\n ad.X = 1;\r\n bd.X = 1;\r\n w._malloc = db;\r\n db.X = 1;\r\n fd.X = 1;\r\n hd.X = 1;\r\n gd.X = 1;\r\n md.X = 1;\r\n w._free = eb;\r\n eb.X = 1;\r\n nd.X = 1;\r\n jd.X = 1;\r\n kd.X = 1;\r\n var Bb = function () {\r\n function a(a, b) {\r\n this.j = a | 0;\r\n this.m = b | 0\r\n }\r\n\r\n function b(a, b, c) {\r\n null != a && (\"number\" == typeof a ? this.C(a, b, c) : null == b && \"string\" != typeof a ? this.J(a, 256) : this.J(a, b))\r\n }\r\n\r\n function c() {\r\n return new b(null)\r\n }\r\n\r\n function d(a) {\r\n return \"0123456789abcdefghijklmnopqrstuvwxyz\".charAt(a)\r\n }\r\n\r\n function e(a, b) {\r\n a = h[a.charCodeAt(b)];\r\n return null == a ? -1 : a\r\n }\r\n\r\n function g(a) {\r\n var b = c();\r\n b.S(a);\r\n return b\r\n }\r\n a.Va = {};\r\n a.S = function (b) {\r\n if (-128 <= b && 128 > b) {\r\n var c = a.Va[b];\r\n if (c) return c\r\n }\r\n c = new a(b | 0, 0 > b ? -1 : 0); - 128 <= b && 128 > b && (a.Va[b] = c);\r\n return c\r\n };\r\n a.C = function (b) {\r\n return isNaN(b) || !isFinite(b) ? a.K : b <= -a.Ya ? a.w : b + 1 >= a.Ya ? a.yc : 0 > b ? a.C(-b).s() : new a(b % a.P | 0, b / a.P | 0)\r\n };\r\n a.I = function (b, c) {\r\n return new a(b, c)\r\n };\r\n a.J = function (b, c) {\r\n if (0 == b.length) throw Error(\"number format error: empty string\");\r\n c = c || 10;\r\n if (2 > c || 36 < c) throw Error(\"radix out of range: \" + c);\r\n if (\"-\" == b.charAt(0)) return a.J(b.substring(1), c).s();\r\n if (0 <= b.indexOf(\"-\")) throw Error('number format error: interior \"-\" character: ' + b);\r\n for (var d = a.C(Math.pow(c, 8)), f = a.K, e = 0; e < b.length; e += 8) {\r\n var g = Math.min(8, b.length - e),\r\n h = parseInt(b.substring(e, e + g), c);\r\n 8 > g ? (g = a.C(Math.pow(c, g)), f = f.multiply(g).add(a.C(h))) : (f = f.multiply(d), f = f.add(a.C(h)))\r\n }\r\n return f\r\n };\r\n a.xa = 65536;\r\n a.Ge = 16777216;\r\n a.P = a.xa * a.xa;\r\n a.He = a.P / 2;\r\n a.Ie = a.P * a.xa;\r\n a.dc = a.P * a.P;\r\n a.Ya = a.dc / 2;\r\n a.K = a.S(0);\r\n a.ga = a.S(1);\r\n a.Wa = a.S(-1);\r\n a.yc = a.I(-1, 2147483647);\r\n a.w = a.I(0, -2147483648);\r\n a.Xa = a.S(16777216);\r\n a.prototype.va = function () {\r\n return this.m * a.P + this.Bc()\r\n };\r\n a.prototype.toString = function (b) {\r\n b = b || 10;\r\n if (2 > b || 36 < b) throw Error(\"radix out of range: \" + b);\r\n if (this.Z()) return \"0\";\r\n if (this.A()) {\r\n if (this.equals(a.w)) {\r\n var c = a.C(b),\r\n d = this.H(c);\r\n c = d.multiply(c).V(this);\r\n return d.toString(b) + c.j.toString(b)\r\n }\r\n return \"-\" + this.s().toString(b)\r\n }\r\n d = a.C(Math.pow(b, 6));\r\n c = this;\r\n for (var f = \"\"; ;) {\r\n var e = c.H(d),\r\n g = c.V(e.multiply(d)).j.toString(b);\r\n c = e;\r\n if (c.Z()) return g + f;\r\n for (; 6 > g.length;) g = \"0\" + g;\r\n f = \"\" + g + f\r\n }\r\n };\r\n a.prototype.Bc = function () {\r\n return 0 <= this.j ? this.j : a.P + this.j\r\n };\r\n a.prototype.Z = function () {\r\n return 0 == this.m && 0 == this.j\r\n };\r\n a.prototype.A = function () {\r\n return 0 > this.m\r\n };\r\n a.prototype.rb = function () {\r\n return 1 == (this.j & 1)\r\n };\r\n a.prototype.equals = function (a) {\r\n return this.m == a.m && this.j == a.j\r\n };\r\n a.prototype.vb = function (a) {\r\n return 0 > this.compare(a)\r\n };\r\n a.prototype.Dc = function (a) {\r\n return 0 < this.compare(a)\r\n };\r\n a.prototype.Ec = function (a) {\r\n return 0 <= this.compare(a)\r\n };\r\n a.prototype.compare = function (a) {\r\n if (this.equals(a)) return 0;\r\n var b = this.A(),\r\n c = a.A();\r\n return b && !c ? -1 : !b && c ? 1 : this.V(a).A() ? -1 : 1\r\n };\r\n a.prototype.s = function () {\r\n return this.equals(a.w) ? a.w : this.Sc().add(a.ga)\r\n };\r\n a.prototype.add = function (b) {\r\n var c = this.m >>> 16,\r\n d = this.m & 65535,\r\n f = this.j >>> 16,\r\n e = b.m >>> 16,\r\n g = b.m & 65535,\r\n h = b.j >>> 16;\r\n b = (this.j & 65535) + (b.j & 65535);\r\n h = (b >>> 16) + (f + h);\r\n f = h >>> 16;\r\n f += d + g;\r\n c = (f >>> 16) + (c + e) & 65535;\r\n return a.I((h & 65535) << 16 | b & 65535, c << 16 | f & 65535)\r\n };\r\n a.prototype.V = function (a) {\r\n return this.add(a.s())\r\n };\r\n a.prototype.multiply = function (b) {\r\n if (this.Z() || b.Z()) return a.K;\r\n if (this.equals(a.w)) return b.rb() ? a.w : a.K;\r\n if (b.equals(a.w)) return this.rb() ? a.w : a.K;\r\n if (this.A()) return b.A() ? this.s().multiply(b.s()) : this.s().multiply(b).s();\r\n if (b.A()) return this.multiply(b.s()).s();\r\n if (this.vb(a.Xa) && b.vb(a.Xa)) return a.C(this.va() * b.va());\r\n var c = this.m >>> 16,\r\n d = this.m & 65535,\r\n f = this.j >>> 16,\r\n e = this.j & 65535,\r\n g = b.m >>> 16,\r\n h = b.m & 65535,\r\n k = b.j >>> 16;\r\n b = b.j & 65535;\r\n var y = e * b;\r\n var l = (y >>> 16) + f * b;\r\n var n = l >>> 16;\r\n l = (l & 65535) + e * k;\r\n n += l >>> 16;\r\n n += d * b;\r\n var m = n >>> 16;\r\n n = (n & 65535) + f * k;\r\n m += n >>> 16;\r\n n = (n & 65535) + e * h;\r\n m = m + (n >>> 16) + (c * b + d * k + f * h + e * g) & 65535;\r\n return a.I((l & 65535) << 16 | y & 65535, m << 16 | n & 65535)\r\n };\r\n a.prototype.H = function (b) {\r\n if (b.Z()) throw Error(\"division by zero\");\r\n if (this.Z()) return a.K;\r\n if (this.equals(a.w)) {\r\n if (b.equals(a.ga) || b.equals(a.Wa)) return a.w;\r\n if (b.equals(a.w)) return a.ga;\r\n var c = this.gd(1).H(b).shiftLeft(1);\r\n if (c.equals(a.K)) return b.A() ? a.ga : a.Wa;\r\n var d = this.V(b.multiply(c));\r\n return c.add(d.H(b))\r\n }\r\n if (b.equals(a.w)) return a.K;\r\n if (this.A()) return b.A() ? this.s().H(b.s()) : this.s().H(b).s();\r\n if (b.A()) return this.H(b.s()).s();\r\n var f = a.K;\r\n for (d = this; d.Ec(b);) {\r\n c = Math.max(1, Math.floor(d.va() / b.va()));\r\n var e = Math.ceil(Math.log(c) / Math.LN2);\r\n e = 48 >= e ? 1 : Math.pow(2, e - 48);\r\n for (var g = a.C(c), h = g.multiply(b); h.A() || h.Dc(d);) c -= e, g = a.C(c), h = g.multiply(b);\r\n g.Z() && (g = a.ga);\r\n f = f.add(g);\r\n d = d.V(h)\r\n }\r\n return f\r\n };\r\n a.prototype.yb = function (a) {\r\n return this.V(this.H(a).multiply(a))\r\n };\r\n a.prototype.Sc = function () {\r\n return a.I(~this.j, ~this.m)\r\n };\r\n a.prototype.shiftLeft = function (b) {\r\n b &= 63;\r\n if (0 == b) return this;\r\n var c = this.j;\r\n return 32 > b ? a.I(c << b, this.m << b | c >>> 32 - b) : a.I(0, c << b - 32)\r\n };\r\n a.prototype.gd = function (b) {\r\n b &= 63;\r\n if (0 == b) return this;\r\n var c = this.m;\r\n return 32 > b ? a.I(this.j >>> b | c << 32 - b, c >> b) : a.I(c >> b - 32, 0 <= c ? 0 : -1)\r\n };\r\n b.prototype.ya = function (a, b, c, d, f, e) {\r\n for (; 0 <= --e;) {\r\n var g = b * this[a++] + c[d] + f;\r\n f = Math.floor(g / 67108864);\r\n c[d++] = g & 67108863\r\n }\r\n return f\r\n };\r\n b.prototype.i = 26;\r\n b.prototype.G = 67108863;\r\n b.prototype.ea = 67108864;\r\n b.prototype.Ob = Math.pow(2, 52);\r\n b.prototype.Ta = 26;\r\n b.prototype.Ua = 0;\r\n var h = [],\r\n k;\r\n var l = 48;\r\n for (k = 0; 9 >= k; ++k) h[l++] = k;\r\n l = 97;\r\n for (k = 10; 36 > k; ++k) h[l++] = k;\r\n l = 65;\r\n for (k = 10; 36 > k; ++k) h[l++] = k;\r\n b.prototype.copyTo = function (a) {\r\n for (var b = this.t - 1; 0 <= b; --b) a[b] = this[b];\r\n a.t = this.t;\r\n a.g = this.g\r\n };\r\n b.prototype.S = function (a) {\r\n this.t = 1;\r\n this.g = 0 > a ? -1 : 0;\r\n 0 < a ? this[0] = a : -1 > a ? this[0] = a + DV : this.t = 0\r\n };\r\n b.prototype.J = function (a, c) {\r\n if (16 == c) c = 4;\r\n else if (8 == c) c = 3;\r\n else if (256 == c) c = 8;\r\n else if (2 == c) c = 1;\r\n else if (32 == c) c = 5;\r\n else if (4 == c) c = 2;\r\n else {\r\n this.xc(a, c);\r\n return\r\n }\r\n this.g = this.t = 0;\r\n for (var d = a.length, f = !1, g = 0; 0 <= --d;) {\r\n var h = 8 == c ? a[d] & 255 : e(a, d);\r\n 0 > h ? \"-\" == a.charAt(d) && (f = !0) : (f = !1, 0 == g ? this[this.t++] = h : g + c > this.i ? (this[this.t - 1] |= (h & (1 << this.i - g) - 1) << g, this[this.t++] = h >> this.i - g) : this[this.t - 1] |= h << g, g += c, g >= this.i && (g -= this.i))\r\n }\r\n 8 == c && 0 != (a[0] & 128) && (this.g = -1, 0 < g && (this[this.t - 1] |= (1 << this.i - g) - 1 << g));\r\n this.R();\r\n f && b.a.F(this, this)\r\n };\r\n b.prototype.R = function () {\r\n for (var a = this.g & this.G; 0 < this.t && this[this.t - 1] == a;)--this.t\r\n };\r\n b.prototype.Ba = function (a, b) {\r\n var c;\r\n for (c = this.t - 1; 0 <= c; --c) b[c + a] = this[c];\r\n for (c = a - 1; 0 <= c; --c) b[c] = 0;\r\n b.t = this.t + a;\r\n b.g = this.g\r\n };\r\n b.prototype.vc = function (a, b) {\r\n for (var c = a; c < this.t; ++c) b[c - a] = this[c];\r\n b.t = Math.max(this.t - a, 0);\r\n b.g = this.g\r\n };\r\n b.prototype.ub = function (a, b) {\r\n var c = a % this.i,\r\n d = this.i - c,\r\n f = (1 << d) - 1;\r\n a = Math.floor(a / this.i);\r\n var e = this.g << c & this.G,\r\n g;\r\n for (g = this.t - 1; 0 <= g; --g) b[g + a + 1] = this[g] >> d | e, e = (this[g] & f) << c;\r\n for (g = a - 1; 0 <= g; --g) b[g] = 0;\r\n b[a] = e;\r\n b.t = this.t + a + 1;\r\n b.g = this.g;\r\n b.R()\r\n };\r\n b.prototype.Uc = function (a, b) {\r\n b.g = this.g;\r\n var c = Math.floor(a / this.i);\r\n if (c >= this.t) b.t = 0;\r\n else {\r\n a %= this.i;\r\n var d = this.i - a,\r\n f = (1 << a) - 1;\r\n b[0] = this[c] >> a;\r\n for (var e = c + 1; e < this.t; ++e) b[e - c - 1] |= (this[e] & f) << d, b[e - c] = this[e] >> a;\r\n 0 < a && (b[this.t - c - 1] |= (this.g & f) << d);\r\n b.t = this.t - c;\r\n b.R()\r\n }\r\n };\r\n b.prototype.F = function (a, b) {\r\n for (var c = 0, d = 0, f = Math.min(a.t, this.t); c < f;) d += this[c] - a[c], b[c++] = d & this.G, d >>= this.i;\r\n if (a.t < this.t) {\r\n for (d -= a.g; c < this.t;) d += this[c], b[c++] = d & this.G, d >>= this.i;\r\n d += this.g\r\n } else {\r\n for (d += this.g; c < a.t;) d -= a[c], b[c++] = d & this.G, d >>= this.i;\r\n d -= a.g\r\n }\r\n b.g = 0 > d ? -1 : 0; - 1 > d ? b[c++] = this.ea + d : 0 < d && (b[c++] = d);\r\n b.t = c;\r\n b.R()\r\n };\r\n b.prototype.Pc = function (a, c) {\r\n var d = this.abs(),\r\n f = a.abs(),\r\n e = d.t;\r\n for (c.t = e + f.t; 0 <= --e;) c[e] = 0;\r\n for (e = 0; e < f.t; ++e) c[e + d.t] = d.ya(0, f[e], c, e, 0, d.t);\r\n c.g = 0;\r\n c.R();\r\n this.g != a.g && b.a.F(c, c)\r\n };\r\n b.prototype.aa = function (a, d, f) {\r\n var e = a.abs();\r\n if (!(0 >= e.t)) {\r\n var g = this.abs();\r\n if (g.t < e.t) null != d && d.S(0), null != f && this.copyTo(f);\r\n else {\r\n null == f && (f = c());\r\n var h = c(),\r\n k = this.g;\r\n a = a.g;\r\n var l = e[e.t - 1],\r\n n = 1,\r\n m;\r\n 0 != (m = l >>> 16) && (l = m, n += 16);\r\n 0 != (m = l >> 8) && (l = m, n += 8);\r\n 0 != (m = l >> 4) && (l = m, n += 4);\r\n 0 != (m = l >> 2) && (l = m, n += 2);\r\n 0 != l >> 1 && (n += 1);\r\n l = this.i - n;\r\n 0 < l ? (e.ub(l, h), g.ub(l, f)) : (e.copyTo(h), g.copyTo(f));\r\n e = h.t;\r\n g = h[e - 1];\r\n if (0 != g) {\r\n m = g * (1 << this.Ta) + (1 < e ? h[e - 2] >> this.Ua : 0);\r\n n = this.Ob / m;\r\n m = (1 << this.Ta) / m;\r\n var u = 1 << this.Ua,\r\n y = f.t,\r\n p = y - e,\r\n r = null == d ? c() : d;\r\n h.Ba(p, r);\r\n 0 <= f.kc(r) && (f[f.t++] = 1, f.F(r, f));\r\n b.c.Ba(e, r);\r\n for (r.F(h, h); h.t < e;) h[h.t++] = 0;\r\n for (; 0 <= --p;) {\r\n var q = f[--y] == g ? this.G : Math.floor(f[y] * n + (f[y - 1] + u) * m);\r\n if ((f[y] += h.ya(0, q, f, p, 0, e)) < q)\r\n for (h.Ba(p, r), f.F(r, f); f[y] < --q;) f.F(r, f)\r\n }\r\n null != d && (f.vc(e, d), k != a && b.a.F(d, d));\r\n f.t = e;\r\n f.R();\r\n 0 < l && f.Uc(l, f);\r\n 0 > k && b.a.F(f, f)\r\n }\r\n }\r\n }\r\n };\r\n b.prototype.toString = function (a) {\r\n if (0 > this.g) return \"-\" + this.s().toString(a);\r\n if (16 == a) a = 4;\r\n else if (8 == a) a = 3;\r\n else if (2 == a) a = 1;\r\n else if (32 == a) a = 5;\r\n else if (4 == a) a = 2;\r\n else return this.ld(a);\r\n var b = (1 << a) - 1,\r\n c, f = !1,\r\n e = \"\",\r\n g = this.t,\r\n h = this.i - g * this.i % a;\r\n if (0 < g--)\r\n for (h < this.i && 0 < (c = this[g] >> h) && (f = !0, e = d(c)); 0 <= g;) h < a ? (c = (this[g] & (1 << h) - 1) << a - h, c |= this[--g] >> (h += this.i - a)) : (c = this[g] >> (h -= a) & b, 0 >= h && (h += this.i, --g)), 0 < c && (f = !0), f && (e += d(c));\r\n return f ? e : \"0\"\r\n };\r\n b.prototype.s = function () {\r\n var a = c();\r\n b.a.F(this, a);\r\n return a\r\n };\r\n b.prototype.abs = function () {\r\n return 0 > this.g ? this.s() : this\r\n };\r\n b.prototype.kc = function (a) {\r\n var b = this.g - a.g;\r\n if (0 != b) return b;\r\n var c = this.t;\r\n b = c - a.t;\r\n if (0 != b) return b;\r\n for (; 0 <= --c;)\r\n if (0 != (b = this[c] - a[c])) return b;\r\n return 0\r\n };\r\n b.a = g(0);\r\n b.c = g(1);\r\n b.prototype.xc = function (a, c) {\r\n this.S(0);\r\n null == c && (c = 10);\r\n for (var d = this.ab(c), f = Math.pow(c, d), g = !1, h = 0, k = 0, l = 0; l < a.length; ++l) {\r\n var n = e(a, l);\r\n 0 > n ? \"-\" == a.charAt(l) && 0 == this.La() && (g = !0) : (k = c * k + n, ++h >= d && (this.gb(f), this.fb(k, 0), k = h = 0))\r\n }\r\n 0 < h && (this.gb(Math.pow(c, h)), this.fb(k, 0));\r\n g && b.a.F(this, this)\r\n };\r\n b.prototype.ab = function (a) {\r\n return Math.floor(Math.LN2 * this.i / Math.log(a))\r\n };\r\n b.prototype.La = function () {\r\n return 0 > this.g ? -1 : 0 >= this.t || 1 == this.t && 0 >= this[0] ? 0 : 1\r\n };\r\n b.prototype.gb = function (a) {\r\n this[this.t] = this.ya(0, a - 1, this, 0, 0, this.t);\r\n ++this.t;\r\n this.R()\r\n };\r\n b.prototype.fb = function (a, b) {\r\n if (0 != a) {\r\n for (; this.t <= b;) this[this.t++] = 0;\r\n for (this[b] += a; this[b] >= this.ea;) this[b] -= this.ea, ++b >= this.t && (this[this.t++] = 0), ++this[b]\r\n }\r\n };\r\n b.prototype.ld = function (a) {\r\n null == a && (a = 10);\r\n if (0 == this.La() || 2 > a || 36 < a) return \"0\";\r\n var b = Math.pow(a, this.ab(a)),\r\n d = g(b),\r\n f = c(),\r\n e = c(),\r\n h = \"\";\r\n for (this.aa(d, f, e); 0 < f.La();) h = (b + e.pb()).toString(a).substr(1) + h, f.aa(d, f, e);\r\n return e.pb().toString(a) + h\r\n };\r\n b.prototype.pb = function () {\r\n if (0 > this.g) {\r\n if (1 == this.t) return this[0] - this.ea;\r\n if (0 == this.t) return -1\r\n } else {\r\n if (1 == this.t) return this[0];\r\n if (0 == this.t) return 0\r\n }\r\n return (this[1] & (1 << 32 - this.i) - 1) << this.i | this[0]\r\n };\r\n b.prototype.$a = function (a, b) {\r\n for (var c = 0, d = 0, f = Math.min(a.t, this.t); c < f;) d += this[c] + a[c], b[c++] = d & this.G, d >>= this.i;\r\n if (a.t < this.t) {\r\n for (d += a.g; c < this.t;) d += this[c], b[c++] = d & this.G, d >>= this.i;\r\n d += this.g\r\n } else {\r\n for (d += this.g; c < a.t;) d += a[c], b[c++] = d & this.G, d >>= this.i;\r\n d += a.g\r\n }\r\n b.g = 0 > d ? -1 : 0;\r\n 0 < d ? b[c++] = d : -1 > d && (b[c++] = this.ea + d);\r\n b.t = c;\r\n b.R()\r\n };\r\n var m = {\r\n result: [0, 0],\r\n add: function (b, c, d, f) {\r\n b = (new a(b, c)).add(new a(d, f));\r\n m.result[0] = b.j;\r\n m.result[1] = b.m\r\n },\r\n V: function (b, c, d, f) {\r\n b = (new a(b, c)).V(new a(d, f));\r\n m.result[0] = b.j;\r\n m.result[1] = b.m\r\n },\r\n multiply: function (b, c, d, f) {\r\n b = (new a(b, c)).multiply(new a(d, f));\r\n m.result[0] = b.j;\r\n m.result[1] = b.m\r\n },\r\n wb: function () {\r\n m.da = new b;\r\n m.da.J(\"4294967296\", 10)\r\n },\r\n qa: function (a, c) {\r\n var d = new b;\r\n d.J(c.toString(), 10);\r\n c = new b;\r\n d.Pc(m.da, c);\r\n d = new b;\r\n d.J(a.toString(), 10);\r\n a = new b;\r\n d.$a(c, a);\r\n return a\r\n },\r\n Ze: function (c, d, f, e, g) {\r\n m.da || m.wb();\r\n g ? (c = m.qa(c >>> 0, d >>> 0), e = m.qa(f >>> 0, e >>> 0), f = new b, c.aa(e, f, null), e = new b, c = new b, f.aa(m.da, c, e), m.result[0] = parseInt(e.toString()) | 0, m.result[1] = parseInt(c.toString()) | 0) : (c = new a(c, d), e = new a(f, e), f = c.H(e), m.result[0] = f.j, m.result[1] = f.m)\r\n },\r\n yb: function (c, d, f, e, g) {\r\n m.da || m.wb();\r\n g ? (c = m.qa(c >>> 0, d >>> 0), e = m.qa(f >>> 0, e >>> 0), f = new b, c.aa(e, null, f), e = new b, c = new b, f.aa(m.da, c, e), m.result[0] = parseInt(e.toString()) | 0, m.result[1] = parseInt(c.toString()) | 0) : (c = new a(c, d), e = new a(f, e), f = c.yb(e), m.result[0] = f.j, m.result[1] = f.m)\r\n },\r\n stringify: function (c, d, f) {\r\n c = (new a(c, d)).toString();\r\n f && \"-\" == c[0] && (m.Na || (m.Na = new b, m.Na.J(\"18446744073709551616\", 10)), f = new b, f.J(c, 10), c = new b, m.Na.$a(f, c), c = c.toString(10));\r\n return c\r\n }\r\n };\r\n return m\r\n }(),\r\n ra = {\r\n pd: 7,\r\n fa: 13,\r\n qd: 98,\r\n rd: 99,\r\n sd: 97,\r\n td: 11,\r\n ud: 114,\r\n Pa: 9,\r\n vd: 74,\r\n wd: 16,\r\n xd: 125,\r\n yd: 10,\r\n zd: 103,\r\n Ad: 111,\r\n Bd: 104,\r\n Cd: 35,\r\n Dd: 89,\r\n Ed: 33,\r\n Fd: 122,\r\n Ib: 17,\r\n Gd: 14,\r\n Hd: 27,\r\n Id: 113,\r\n Jd: 43,\r\n Kd: 84,\r\n Ld: 115,\r\n Md: 4,\r\n wa: 22,\r\n Qa: 5,\r\n Nd: 106,\r\n Jb: 21,\r\n Kb: 40,\r\n Od: 24,\r\n Pd: 31,\r\n Qd: 90,\r\n Rd: 72,\r\n Sd: 36,\r\n Td: 100,\r\n Ud: 102,\r\n Vd: 101,\r\n Wd: 23,\r\n Xd: 105,\r\n Yd: 61,\r\n Zd: 19,\r\n Ra: 2,\r\n $d: 8,\r\n ae: 37,\r\n be: 67,\r\n ce: 12,\r\n de: 42,\r\n ee: 92,\r\n fe: 28,\r\n ge: 63,\r\n he: 60,\r\n ie: 38,\r\n je: 107,\r\n Sa: 20,\r\n ke: 39,\r\n le: 131,\r\n me: 88,\r\n ne: 95,\r\n oe: 25,\r\n Lb: 6,\r\n pe: 75,\r\n qe: 130,\r\n re: 1,\r\n se: 32,\r\n te: 71,\r\n ue: 93,\r\n ve: 91,\r\n we: 34,\r\n xe: 30,\r\n ye: 29,\r\n ze: 3,\r\n Ae: 116,\r\n Be: 62,\r\n Ce: 110,\r\n De: 26,\r\n Ee: 11,\r\n Fe: 18\r\n },\r\n nc = 0,\r\n Ob = 0,\r\n oc = 0,\r\n F = {\r\n rc: \"/\",\r\n Rc: 2,\r\n streams: [null],\r\n nb: !0,\r\n Za: function (a, b) {\r\n if (\"string\" !== typeof a) return null;\r\n void 0 === b && (b = F.rc);\r\n a && \"/\" == a[0] && (b = \"\");\r\n a = (b + \"/\" + a).split(\"/\").reverse();\r\n for (b = [\"\"]; a.length;) {\r\n var c = a.pop();\r\n \"\" != c && \".\" != c && (\"..\" == c ? 1 < b.length && b.pop() : b.push(c))\r\n }\r\n return 1 == b.length ? \"/\" : b.join(\"/\")\r\n },\r\n za: function (a, b, c) {\r\n var d = {\r\n Kc: !1,\r\n oa: !1,\r\n error: 0,\r\n name: null,\r\n path: null,\r\n object: null,\r\n Ga: !1,\r\n zb: null,\r\n Ha: null\r\n };\r\n a = F.Za(a);\r\n if (\"/\" == a) d.Kc = !0, d.oa = d.Ga = !0, d.name = \"/\", d.path = d.zb = \"/\", d.object = d.Ha = F.root;\r\n else if (null !== a) {\r\n c = c || 0;\r\n a = a.slice(1).split(\"/\");\r\n for (var f = F.root, e = [\"\"]; a.length;) {\r\n 1 == a.length && f.Y && (d.Ga = !0, d.zb = 1 == e.length ? \"/\" : e.join(\"/\"), d.Ha = f, d.name = a[0]);\r\n var g = a.shift();\r\n if (!f.Y) {\r\n d.error = ra.Sa;\r\n break\r\n } else if (!f.read) {\r\n d.error = ra.fa;\r\n break\r\n } else if (!f.v.hasOwnProperty(g)) {\r\n d.error = ra.Ra;\r\n break\r\n }\r\n f = f.v[g];\r\n if (f.link && (!b || 0 != a.length)) {\r\n if (40 < c) {\r\n d.error = ra.Kb;\r\n break\r\n }\r\n d = F.Za(f.link, e.join(\"/\"));\r\n d = F.za([d].concat(a).join(\"/\"), b, c + 1);\r\n break\r\n }\r\n e.push(g);\r\n 0 == a.length && (d.oa = !0, d.path = e.join(\"/\"), d.object = f)\r\n }\r\n }\r\n return d\r\n },\r\n jb: function (a, b) {\r\n F.hb();\r\n a = F.za(a, b);\r\n if (a.oa) return a.object;\r\n Y(a.error);\r\n return null\r\n },\r\n eb: function (a, b, c, d, e) {\r\n a || (a = \"/\");\r\n \"string\" === typeof a && (a = F.jb(a));\r\n if (!a) throw Y(ra.fa), Error(\"Parent path must exist.\");\r\n if (!a.Y) throw Y(ra.Sa), Error(\"Parent must be a folder.\");\r\n if (!a.write && !F.nb) throw Y(ra.fa), Error(\"Parent folder must be writeable.\");\r\n if (!b || \".\" == b || \"..\" == b) throw Y(ra.Ra), Error(\"Name must not be empty.\");\r\n if (a.v.hasOwnProperty(b)) throw Y(ra.Ib), Error(\"Can't overwrite object.\");\r\n a.v[b] = {\r\n read: void 0 === d ? !0 : d,\r\n write: void 0 === e ? !1 : e,\r\n timestamp: Date.now(),\r\n Hc: F.Rc++\r\n };\r\n for (var f in c) c.hasOwnProperty(f) && (a.v[b][f] = c[f]);\r\n return a.v[b]\r\n },\r\n Aa: function (a, b, c, d) {\r\n return F.eb(a, b, {\r\n Y: !0,\r\n T: !1,\r\n v: {}\r\n }, c, d)\r\n },\r\n qc: function (a, b, c, d) {\r\n a = F.jb(a);\r\n if (null === a) throw Error(\"Invalid parent.\");\r\n for (b = b.split(\"/\").reverse(); b.length;) {\r\n var f = b.pop();\r\n f && (a.v.hasOwnProperty(f) || F.Aa(a, f, c, d), a = a.v[f])\r\n }\r\n return a\r\n },\r\n na: function (a, b, c, d, e) {\r\n c.Y = !1;\r\n return F.eb(a, b, c, d, e)\r\n },\r\n Ue: function (a, b, c, d, e) {\r\n if (\"string\" === typeof c) {\r\n for (var f = Array(c.length), g = 0, h = c.length; g < h; ++g) f[g] = c.charCodeAt(g);\r\n c = f\r\n }\r\n return F.na(a, b, {\r\n T: !1,\r\n v: c\r\n }, d, e)\r\n },\r\n Ve: function (a, b, c, d, e) {\r\n return F.na(a, b, {\r\n T: !1,\r\n url: c\r\n }, d, e)\r\n },\r\n We: function (a, b, c, d, e) {\r\n return F.na(a, b, {\r\n T: !1,\r\n link: c\r\n }, d, e)\r\n },\r\n ma: function (a, b, c, d) {\r\n if (!c && !d) throw Error(\"A device must have at least one callback defined.\");\r\n return F.na(a, b, {\r\n T: !0,\r\n input: c,\r\n ca: d\r\n }, !!c, !!d)\r\n },\r\n cf: function (a) {\r\n if (a.T || a.Y || a.link || a.v) return !0;\r\n var b = !0;\r\n if (\"undefined\" !== typeof XMLHttpRequest) e(\"Cannot do synchronous binary XHRs in modern browsers. Use --embed-file or --preload-file in emcc\");\r\n else if (w.read) try {\r\n a.v = A(w.read(a.url), !0)\r\n } catch (n) {\r\n b = !1\r\n } else throw Error(\"Cannot load without read() or XMLHttpRequest.\");\r\n b || Y(ra.Qa);\r\n return b\r\n },\r\n hb: function () {\r\n F.root || (F.root = {\r\n read: !0,\r\n write: !0,\r\n Y: !0,\r\n T: !1,\r\n timestamp: Date.now(),\r\n Hc: 1,\r\n v: {}\r\n })\r\n },\r\n ha: function (a, b, c) {\r\n function d(a) {\r\n null === a || 10 === a ? (b.ta(b.buffer.join(\"\")), b.buffer = []) : b.buffer.push(String.fromCharCode(a))\r\n }\r\n e(!F.ha.b, \"FS.init was previously called. If you want to initialize later with custom parameters, remove any earlier calls (note that one is automatically added to the generated code)\");\r\n F.ha.b = !0;\r\n F.hb();\r\n a = a || w.stdin;\r\n b = b || w.stdout;\r\n c = c || w.stderr;\r\n var f = !0,\r\n h = !0,\r\n k = !0;\r\n a || (f = !1, a = function () {\r\n if (!a.cache || !a.cache.length) {\r\n var b;\r\n \"undefined\" != typeof wb && \"function\" == typeof wb.prompt ? b = wb.prompt(\"Input: \") : \"function\" == typeof readline && (b = readline());\r\n b || (b = \"\");\r\n a.cache = A(b + \"\\n\", !0)\r\n }\r\n return a.cache.shift()\r\n });\r\n b || (h = !1, b = d);\r\n b.ta || (b.ta = w.print);\r\n b.buffer || (b.buffer = []);\r\n c || (k = !1, c = d);\r\n c.ta || (c.ta = w.print);\r\n c.buffer || (c.buffer = []);\r\n F.Aa(\"/\", \"tmp\", !0, !0);\r\n var l = F.Aa(\"/\", \"dev\", !0, !0),\r\n m = F.ma(l, \"stdin\", a),\r\n n = F.ma(l, \"stdout\", null, b);\r\n c = F.ma(l, \"stderr\", null, c);\r\n F.ma(l, \"tty\", a, b);\r\n F.streams[1] = {\r\n path: \"/dev/stdin\",\r\n object: m,\r\n position: 0,\r\n sb: !0,\r\n pa: !1,\r\n qb: !1,\r\n tb: !f,\r\n error: !1,\r\n ib: !1,\r\n Db: []\r\n };\r\n F.streams[2] = {\r\n path: \"/dev/stdout\",\r\n object: n,\r\n position: 0,\r\n sb: !1,\r\n pa: !0,\r\n qb: !1,\r\n tb: !h,\r\n error: !1,\r\n ib: !1,\r\n Db: []\r\n };\r\n F.streams[3] = {\r\n path: \"/dev/stderr\",\r\n object: c,\r\n position: 0,\r\n sb: !1,\r\n pa: !0,\r\n qb: !1,\r\n tb: !k,\r\n error: !1,\r\n ib: !1,\r\n Db: []\r\n };\r\n nc = g([1], \"void*\", 2);\r\n Ob = g([2], \"void*\", 2);\r\n oc = g([3], \"void*\", 2);\r\n F.qc(\"/\", \"dev/shm/tmp\", !0, !0);\r\n F.streams[nc] = F.streams[1];\r\n F.streams[Ob] = F.streams[2];\r\n F.streams[oc] = F.streams[3];\r\n g([g([0, 0, 0, 0, nc, 0, 0, 0, Ob, 0, 0, 0, oc, 0, 0, 0], \"void*\", 2)], \"void*\", 2)\r\n },\r\n Tc: function () {\r\n F.ha.b && (F.streams[2] && 0 < F.streams[2].object.ca.buffer.length && F.streams[2].object.ca(10), F.streams[3] && 0 < F.streams[3].object.ca.buffer.length && F.streams[3].object.ca(10))\r\n },\r\n sf: function (a) {\r\n \"./\" == a.substr(0, 2) && (a = a.substr(2));\r\n return a\r\n },\r\n Ye: function (a) {\r\n a = F.za(a);\r\n if (!a.Ga || !a.oa) throw \"Invalid path \" + a;\r\n delete a.Ha.v[a.name]\r\n }\r\n },\r\n ld = nf,\r\n ef;\r\n xd.unshift({\r\n Da: function () {\r\n w.noFSInit || F.ha.b || F.ha()\r\n }\r\n });\r\n ud.push({\r\n Da: function () {\r\n F.nb = !1\r\n }\r\n });\r\n vd.push({\r\n Da: function () {\r\n F.Tc()\r\n }\r\n });\r\n Y(0);\r\n Nb.a = g([0], \"i8\", 2);\r\n g(12, \"void*\", 2);\r\n w.jc = function (a) {\r\n function b() {\r\n for (var a = 0; 3 > a; a++) d.push(0)\r\n }\r\n var c = a.length + 1,\r\n d = [g(A(\"/bin/this.program\"), \"i8\", 2)];\r\n b();\r\n for (var e = 0; e < c - 1; e += 1) d.push(g(A(a[e]), \"i8\", 2)), b();\r\n d.push(0);\r\n d = g(d, \"i32\", 2);\r\n return _main(c, d, 0)\r\n };\r\n var qf;\r\n q.md = g([37, 115, 40, 37, 117, 41, 58, 32, 65, 115, 115, 101, 114, 116, 105, 111, 110, 32, 102, 97, 105, 108, 117, 114, 101, 58, 32, 34, 37, 115, 34, 10, 0], \"i8\", 2);\r\n q.nd = g([109, 95, 115, 105, 122, 101, 32, 60, 61, 32, 109, 95, 99, 97, 112, 97, 99, 105, 116, 121, 0], \"i8\", 2);\r\n q.a = g([116, 104, 105, 114, 100, 95, 112, 97, 114, 116, 121, 47, 99, 114, 117, 110, 99, 104, 47, 101, 109, 115, 99, 114, 105, 112, 116, 101, 110, 47, 46, 46, 47, 105, 110, 99, 47, 99, 114, 110, 95, 100, 101, 99, 111, 109, 112, 46, 104, 0], \"i8\", 2);\r\n q.Vb = g([109, 105, 110, 95, 110, 101, 119, 95, 99, 97, 112, 97, 99, 105, 116, 121, 32, 60, 32, 40, 48, 120, 55, 70, 70, 70, 48, 48, 48, 48, 85, 32, 47, 32, 101, 108, 101, 109, 101, 110, 116, 95, 115, 105, 122, 101, 41, 0], \"i8\", 2);\r\n q.$b = g([110, 101, 119, 95, 99, 97, 112, 97, 99, 105, 116, 121, 32, 38, 38, 32, 40, 110, 101, 119, 95, 99, 97, 112, 97, 99, 105, 116, 121, 32, 62, 32, 109, 95, 99, 97, 112, 97, 99, 105, 116, 121, 41, 0], \"i8\", 2);\r\n q.ac = g([110, 117, 109, 95, 99, 111, 100, 101, 115, 91, 99, 93, 0], \"i8\", 2);\r\n q.bc = g([115, 111, 114, 116, 101, 100, 95, 112, 111, 115, 32, 60, 32, 116, 111, 116, 97, 108, 95, 117, 115, 101, 100, 95, 115, 121, 109, 115, 0], \"i8\", 2);\r\n q.cc = g([112, 67, 111, 100, 101, 115, 105, 122, 101, 115, 91, 115, 121, 109, 95, 105, 110, 100, 101, 120, 93, 32, 61, 61, 32, 99, 111, 100, 101, 115, 105, 122, 101, 0], \"i8\", 2);\r\n q.ec = g([116, 32, 60, 32, 40, 49, 85, 32, 60, 60, 32, 116, 97, 98, 108, 101, 95, 98, 105, 116, 115, 41, 0], \"i8\", 2);\r\n q.fc = g([109, 95, 108, 111, 111, 107, 117, 112, 91, 116, 93, 32, 61, 61, 32, 99, 85, 73, 78, 84, 51, 50, 95, 77, 65, 88, 0], \"i8\", 2);\r\n var Yb = g([2], [\"i8* (i8*, i32, i32*, i1, i8*)*\", 0, 0, 0, 0], 2);\r\n g([4], [\"i32 (i8*, i8*)*\", 0, 0, 0, 0], 2);\r\n var Zb = g(1, \"i8*\", 2);\r\n q.o = g([99, 114, 110, 100, 95, 109, 97, 108, 108, 111, 99, 58, 32, 115, 105, 122, 101, 32, 116, 111, 111, 32, 98, 105, 103, 0], \"i8\", 2);\r\n q.Eb = g([99, 114, 110, 100, 95, 109, 97, 108, 108, 111, 99, 58, 32, 111, 117, 116, 32, 111, 102, 32, 109, 101, 109, 111, 114, 121, 0], \"i8\", 2);\r\n q.u = g([40, 40, 117, 105, 110, 116, 51, 50, 41, 112, 95, 110, 101, 119, 32, 38, 32, 40, 67, 82, 78, 68, 95, 77, 73, 78, 95, 65, 76, 76, 79, 67, 95, 65, 76, 73, 71, 78, 77, 69, 78, 84, 32, 45, 32, 49, 41, 41, 32, 61, 61, 32, 48, 0], \"i8\", 2);\r\n q.Fb = g([99, 114, 110, 100, 95, 114, 101, 97, 108, 108, 111, 99, 58, 32, 98, 97, 100, 32, 112, 116, 114, 0], \"i8\", 2);\r\n q.Gb = g([99, 114, 110, 100, 95, 102, 114, 101, 101, 58, 32, 98, 97, 100, 32, 112, 116, 114, 0], \"i8\", 2);\r\n q.Re = g([99, 114, 110, 100, 95, 109, 115, 105, 122, 101, 58, 32, 98, 97, 100, 32, 112, 116, 114, 0], \"i8\", 2);\r\n g([1, 0, 0, 0, 2, 0, 0, 0, 4, 0, 0, 0, 8, 0, 0, 0, 16, 0, 0, 0, 32, 0, 0, 0, 64, 0, 0, 0, 128, 0, 0, 0, 256, 0, 0, 0, 512, 0, 0, 0, 1024, 0, 0, 0, 2048, 0, 0, 0, 4096, 0, 0, 0, 8192, 0, 0, 0, 16384, 0, 0, 0, 32768, 0, 0, 0, 65536, 0, 0, 0, 131072, 0, 0, 0, 262144, 0, 0, 0, 524288, 0, 0, 0, 1048576, 0, 0, 0, 2097152, 0, 0, 0, 4194304, 0, 0, 0, 8388608, 0, 0, 0, 16777216, 0, 0, 0, 33554432, 0, 0, 0, 67108864, 0, 0, 0, 134217728, 0, 0, 0, 268435456, 0, 0, 0, 536870912, 0, 0, 0, 1073741824, 0, 0, 0, -2147483648, 0, 0, 0], [\"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0], 2);\r\n q.Mb = g([102, 97, 108, 115, 101, 0], \"i8\", 2);\r\n q.Te = g([99, 114, 110, 100, 95, 118, 97, 108, 105, 100, 97, 116, 101, 95, 102, 105, 108, 101, 40, 38, 110, 101, 119, 95, 104, 101, 97, 100, 101, 114, 44, 32, 97, 99, 116, 117, 97, 108, 95, 98, 97, 115, 101, 95, 100, 97, 116, 97, 95, 115, 105, 122, 101, 44, 32, 78, 85, 76, 76, 41, 0], \"i8\", 2);\r\n q.Xe = g([40, 116, 111, 116, 97, 108, 95, 115, 121, 109, 115, 32, 62, 61, 32, 49, 41, 32, 38, 38, 32, 40, 116, 111, 116, 97, 108, 95, 115, 121, 109, 115, 32, 60, 61, 32, 112, 114, 101, 102, 105, 120, 95, 99, 111, 100, 105, 110, 103, 58, 58, 99, 77, 97, 120, 83, 117, 112, 112, 111, 114, 116, 101, 100, 83, 121, 109, 115, 41, 32, 38, 38, 32, 40, 99, 111, 100, 101, 95, 115, 105, 122, 101, 95, 108, 105, 109, 105, 116, 32, 62, 61, 32, 49, 41, 0], \"i8\", 2);\r\n q.Pb = g([40, 116, 111, 116, 97, 108, 95, 115, 121, 109, 115, 32, 62, 61, 32, 49, 41, 32, 38, 38, 32, 40, 116, 111, 116, 97, 108, 95, 115, 121, 109, 115, 32, 60, 61, 32, 112, 114, 101, 102, 105, 120, 95, 99, 111, 100, 105, 110, 103, 58, 58, 99, 77, 97, 120, 83, 117, 112, 112, 111, 114, 116, 101, 100, 83, 121, 109, 115, 41, 0], \"i8\", 2);\r\n q.ba = g([17, 18, 19, 20, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15, 16], \"i8\", 2);\r\n q.L = g([48, 0], \"i8\", 2);\r\n q.Qb = g([110, 117, 109, 95, 98, 105, 116, 115, 32, 60, 61, 32, 51, 50, 85, 0], \"i8\", 2);\r\n q.Rb = g([109, 95, 98, 105, 116, 95, 99, 111, 117, 110, 116, 32, 60, 61, 32, 99, 66, 105, 116, 66, 117, 102, 83, 105, 122, 101, 0], \"i8\", 2);\r\n q.Tb = g([116, 32, 33, 61, 32, 99, 85, 73, 78, 84, 51, 50, 95, 77, 65, 88, 0], \"i8\", 2);\r\n q.Ub = g([109, 111, 100, 101, 108, 46, 109, 95, 99, 111, 100, 101, 95, 115, 105, 122, 101, 115, 91, 115, 121, 109, 93, 32, 61, 61, 32, 108, 101, 110, 0], \"i8\", 2);\r\n g([1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 4, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 8, 0, 0, 0, 4, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 8, 0, 0, 0, 3, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 8, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 4, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 7, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 8, 0, 0, 0, 4, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 5, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 8, 0, 0, 0, 3, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 6, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 8, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 7, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 5, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 7, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 8, 0, 0, 0], [\"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0], 2);\r\n g([0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 0, 0, 0, 4, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 8, 0, 0, 0, 4, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 8, 0, 0, 0, 3, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 8, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 5, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 7, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 4, 0, 0, 0, 8, 0, 0, 0], [\"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0], 2);\r\n q.Je = g([0, 3, 1, 2], \"i8\", 2);\r\n q.c = g([0, 2, 3, 1], \"i8\", 2);\r\n q.Ke = g([0, 7, 1, 2, 3, 4, 5, 6], \"i8\", 2);\r\n q.b = g([0, 2, 3, 4, 5, 6, 7, 1], \"i8\", 2);\r\n q.Le = g([1, 0, 5, 4, 3, 2, 6, 7], \"i8\", 2);\r\n q.od = g([1, 0, 7, 6, 5, 4, 3, 2], \"i8\", 2);\r\n q.af = g([105, 110, 100, 101, 120, 32, 60, 32, 50, 0], \"i8\", 2);\r\n q.df = g([40, 108, 111, 32, 60, 61, 32, 48, 120, 70, 70, 70, 70, 85, 41, 32, 38, 38, 32, 40, 104, 105, 32, 60, 61, 32, 48, 120, 70, 70, 70, 70, 85, 41, 0], \"i8\", 2);\r\n q.ff = g([40, 120, 32, 60, 32, 99, 68, 88, 84, 66, 108, 111, 99, 107, 83, 105, 122, 101, 41, 32, 38, 38, 32, 40, 121, 32, 60, 32, 99, 68, 88, 84, 66, 108, 111, 99, 107, 83, 105, 122, 101, 41, 0], \"i8\", 2);\r\n q.gf = g([118, 97, 108, 117, 101, 32, 60, 61, 32, 48, 120, 70, 70, 0], \"i8\", 2);\r\n q.hf = g([118, 97, 108, 117, 101, 32, 60, 61, 32, 48, 120, 70, 0], \"i8\", 2);\r\n q.jf = g([40, 108, 111, 32, 60, 61, 32, 48, 120, 70, 70, 41, 32, 38, 38, 32, 40, 104, 105, 32, 60, 61, 32, 48, 120, 70, 70, 41, 0], \"i8\", 2);\r\n q.l = g([105, 32, 60, 32, 109, 95, 115, 105, 122, 101, 0], \"i8\", 2);\r\n q.M = g([110, 117, 109, 32, 38, 38, 32, 40, 110, 117, 109, 32, 61, 61, 32, 126, 110, 117, 109, 95, 99, 104, 101, 99, 107, 41, 0], \"i8\", 2);\r\n q.h = g([1, 2, 2, 3, 3, 3, 3, 4], \"i8\", 2);\r\n var ta = g([0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 2, 1, 2, 0, 0, 0, 1, 0, 2, 1, 0, 2, 0, 0, 1, 2, 3], \"i8\", 2);\r\n q.Wb = g([110, 101, 120, 116, 95, 108, 101, 118, 101, 108, 95, 111, 102, 115, 32, 62, 32, 99, 117, 114, 95, 108, 101, 118, 101, 108, 95, 111, 102, 115, 0], \"i8\", 2);\r\n q.Zb = g([40, 108, 101, 110, 32, 62, 61, 32, 49, 41, 32, 38, 38, 32, 40, 108, 101, 110, 32, 60, 61, 32, 99, 77, 97, 120, 69, 120, 112, 101, 99, 116, 101, 100, 67, 111, 100, 101, 83, 105, 122, 101, 41, 0], \"i8\", 2);\r\n var l = g(468, [\"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"i32\", 0, 0, 0, \"*\", 0, 0, 0, \"i32\", 0, 0, 0, \"*\", 0, 0, 0, \"i32\", 0, 0, 0, \"*\", 0, 0, 0, \"i32\", 0, 0, 0], 2);\r\n var xa = g(24, \"i32\", 2);\r\n q.kf = g([109, 97, 120, 32, 115, 121, 115, 116, 101, 109, 32, 98, 121, 116, 101, 115, 32, 61, 32, 37, 49, 48, 108, 117, 10, 0], \"i8\", 2);\r\n q.Oe = g([115, 121, 115, 116, 101, 109, 32, 98, 121, 116, 101, 115, 32, 32, 32, 32, 32, 61, 32, 37, 49, 48, 108, 117, 10, 0], \"i8\", 2);\r\n q.$e = g([105, 110, 32, 117, 115, 101, 32, 98, 121, 116, 101, 115, 32, 32, 32, 32, 32, 61, 32, 37, 49, 48, 108, 117, 10, 0], \"i8\", 2);\r\n g([0], \"i8\", 2);\r\n g(1, \"void ()*\", 2);\r\n var pd = g([0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 8, 0, 0, 0, 10, 0, 0, 0], [\"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0], 2);\r\n g(1, \"void*\", 2);\r\n q.Yb = g([115, 116, 100, 58, 58, 98, 97, 100, 95, 97, 108, 108, 111, 99, 0], \"i8\", 2);\r\n var rd = g([0, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 12, 0, 0, 0, 14, 0, 0, 0], [\"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0, \"*\", 0, 0, 0], 2);\r\n g(1, \"void*\", 2);\r\n q.Hb = g([98, 97, 100, 95, 97, 114, 114, 97, 121, 95, 110, 101, 119, 95, 108, 101, 110, 103, 116, 104, 0], \"i8\", 2);\r\n q.Oa = g([83, 116, 57, 98, 97, 100, 95, 97, 108, 108, 111, 99, 0], \"i8\", 2);\r\n var xb = g(12, \"*\", 2);\r\n q.ra = g([83, 116, 50, 48, 98, 97, 100, 95, 97, 114, 114, 97, 121, 95, 110, 101, 119, 95, 108, 101, 110, 103, 116, 104, 0], \"i8\", 2);\r\n var Qb = g(12, \"*\", 2);\r\n b[pd + 4 >> 2] = xb;\r\n b[rd + 4 >> 2] = Qb;\r\n var yd = g([2, 0, 0, 0, 0], [\"i8*\", 0, 0, 0, 0], 2);\r\n b[xb >> 2] = yd + 8 | 0;\r\n b[xb + 4 >> 2] = q.Oa | 0;\r\n b[xb + 8 >> 2] = qf;\r\n b[Qb >> 2] = yd + 8 | 0;\r\n b[Qb + 4 >> 2] = q.ra | 0;\r\n b[Qb + 8 >> 2] = xb;\r\n var Ma = [0, 0, Pd, 0, Rd, 0, hc, 0, df, 0, bf, 0, gf, 0, cf, 0, Ha, 0, ae, 0, ya, 0, Kc, 0, od, 0, ff, 0];\r\n w.FUNCTION_TABLE = Ma;\r\n w.run = td;\r\n p(xd);\r\n w.noInitialRun && (mc++ , w.monitorRunDependencies && w.monitorRunDependencies(mc));\r\n 0 == mc && td();\r\n this.a = w\r\n };\r\n\r\n Maps.CrunchDecompressor = CrunchDecompressor;\r\n })(Maps = Utils.Maps || (Utils.Maps = {}));\r\n })(Utils = spt.Utils || (spt.Utils = {}));\r\n})(spt || (spt = {}));","var spt;\r\n(function (spt) {\r\n var Utils;\r\n (function (Utils) {\r\n var Maps;\r\n (function (Maps) {\r\n Maps.greateDecoder = function (scope) {\r\n var self = scope;\r\n\r\n //minified decoder for gm protobuf\r\n (function () {\r\n 'use strict';\r\n var T, jb = this;\r\n\r\n function kb(c, d, e) {\r\n c = c.split(\".\");\r\n e = e || jb;\r\n c[0] in e || \"undefined\" == typeof e.execScript || e.execScript(\"var \" + c[0]);\r\n for (var h; c.length && (h = c.shift());) c.length || void 0 === d ? e[h] && e[h] !== Object.prototype[h] ? e = e[h] : e = e[h] = {} : e[h] = d\r\n }\r\n var Fb = Date.now || function () {\r\n return +new Date\r\n };\r\n\r\n function Mb(c) {\r\n this.length = c.length || c;\r\n for (var d = 0; d < this.length; d++) this[d] = c[d] || 0\r\n }\r\n Mb.prototype.a = 4;\r\n Mb.prototype.set = function (c, d) {\r\n d = d || 0;\r\n for (var e = 0; e < c.length && d + e < this.length; e++) this[d + e] = c[e]\r\n };\r\n Mb.prototype.toString = Array.prototype.join;\r\n \"undefined\" == typeof Float32Array && (Mb.BYTES_PER_ELEMENT = 4, Mb.prototype.BYTES_PER_ELEMENT = Mb.prototype.a, Mb.prototype.set = Mb.prototype.set, Mb.prototype.toString = Mb.prototype.toString, kb(\"Float32Array\", Mb, void 0));\r\n\r\n function Rb(c) {\r\n this.length = c.length || c;\r\n for (var d = 0; d < this.length; d++) this[d] = c[d] || 0\r\n }\r\n Rb.prototype.a = 8;\r\n Rb.prototype.set = function (c, d) {\r\n d = d || 0;\r\n for (var e = 0; e < c.length && d + e < this.length; e++) this[d + e] = c[e]\r\n };\r\n Rb.prototype.toString = Array.prototype.join;\r\n if (\"undefined\" == typeof Float64Array) {\r\n try {\r\n Rb.BYTES_PER_ELEMENT = 8\r\n } catch (c) { }\r\n Rb.prototype.BYTES_PER_ELEMENT = Rb.prototype.a;\r\n Rb.prototype.set = Rb.prototype.set;\r\n Rb.prototype.toString = Rb.prototype.toString;\r\n kb(\"Float64Array\", Rb, void 0)\r\n };\r\n\r\n function Sb() {\r\n this.matrixMeshFromGlobe = this.matrixGlobeFromMesh = null;\r\n this.meshes = [];\r\n this.overlaySurfaceMeshes = [];\r\n this.copyrightIds = this.waterMesh = null;\r\n this.nonEmptyOctants = 0;\r\n this.bvhTriPermutation = this.bvhNodes = null\r\n }\r\n\r\n function Tb() {\r\n this.vertexAlphas = this.indices = this.uvOffsetAndScale = this.layerBounds = this.texture = this.vertices = null;\r\n this.numNonDegenerateTriangles = 0;\r\n this.meshId = -1;\r\n this.octantCounts = this.normals = null\r\n }\r\n\r\n function Ub() {\r\n this.bytes = null;\r\n this.textureFormat = 1;\r\n this.viewDirection = this.height = this.width = 0;\r\n this.meshId = -1\r\n }\r\n\r\n function Vb() {\r\n this.headNodePath = \"\";\r\n this.obbRotations = this.obbExtents = this.obbCenters = this.metersPerTexel = this.flags = this.bulkMetadataEpoch = this.epoch = this.childIndices = null;\r\n this.defaultImageryEpoch = 0;\r\n this.imageryEpochArray = null;\r\n this.defaultTextureFormat = 0;\r\n this.textureFormatArray = null;\r\n this.defaultAvailableViewDirections = 0;\r\n this.childBulkMetadata = this.nodes = this.viewDependentTextureFormatArray = this.availableViewDirectionsArray = null\r\n }\r\n\r\n function Wb() {\r\n this.textures = [];\r\n this.transformInfo = [];\r\n this.projectionOrigin = null\r\n }\r\n\r\n function pc() {\r\n this.vertexTransformMap = this.transformTable = null;\r\n this.meshId = -1;\r\n this.uvOffsetAndScale = null\r\n };\r\n\r\n function qc(c) {\r\n this.u = new DataView(c.buffer);\r\n this.b = c;\r\n this.a = 0;\r\n this.c = c.length;\r\n this.h = [];\r\n this.l = this.o = 0\r\n }\r\n T = qc.prototype;\r\n T.D = function () {\r\n if (this.a < this.c) {\r\n var c = this.sa();\r\n this.o = c & 7;\r\n return this.l = c >> 3\r\n }\r\n return 0\r\n };\r\n T.O = function (c) {\r\n this.h.push(this.c);\r\n this.c = c\r\n };\r\n T.N = function () {\r\n if (!this.h.length) return !1;\r\n this.c = this.h.pop();\r\n return !0\r\n };\r\n T.sa = function () {\r\n var c = 0,\r\n d = 1;\r\n do {\r\n var e = this.b[this.a++];\r\n c += (127 & e) * d;\r\n d *= 128\r\n } while (e & 128);\r\n return c\r\n };\r\n T.jd = function () {\r\n do var c = this.b[this.a++]; while (c & 128)\r\n };\r\n T.hd = function () {\r\n this.a = this.sa() + this.a\r\n };\r\n T.B = function () {\r\n switch (this.o) {\r\n case 0:\r\n return this.jd(), !0;\r\n case 1:\r\n return this.a += 8, !0;\r\n case 2:\r\n return this.hd(), !0;\r\n case 5:\r\n return this.a += 4, !0\r\n }\r\n return !1\r\n };\r\n T.Xc = function () {\r\n var c = this.sa();\r\n return c & 2147483648 ? (c & 2147483647) - 2147483648 : c\r\n };\r\n T.f = qc.prototype.sa;\r\n T.$ = function () {\r\n var c = this.u.getFloat32(this.a, !0);\r\n this.a += 4;\r\n return c\r\n };\r\n T.ua = function () {\r\n var c = this.u.getFloat64(this.a, !0);\r\n this.a += 8;\r\n return c\r\n };\r\n T.Ia = function () {\r\n return this.b[this.a++]\r\n };\r\n T.Ka = function () {\r\n var c = this.b[this.a++];\r\n c |= this.b[this.a++] << 8;\r\n return c & 32768 ? c | 4294901760 : c\r\n };\r\n T.ia = function () {\r\n var c = this.b[this.a++];\r\n return this.b[this.a++] << 8 | c\r\n };\r\n T.cd = function () {\r\n var c = this.b[this.a++];\r\n c = this.a + c;\r\n for (var d = \"\"; this.a < c;) {\r\n var e = this.b[this.a++];\r\n if (128 > e) d += String.fromCharCode(e);\r\n else if (!(192 > e))\r\n if (224 > e) {\r\n var h = this.b[this.a++];\r\n d += String.fromCharCode((e & 31) << 6 | h & 63)\r\n } else if (240 > e) {\r\n h = this.b[this.a++];\r\n var k = this.b[this.a++];\r\n d += String.fromCharCode((e & 15) << 12 | (h & 63) << 6 | k & 63)\r\n }\r\n }\r\n return d\r\n };\r\n T.data = function () {\r\n return this.b\r\n };\r\n T.Oc = function () {\r\n this.a = this.l = this.o = 0;\r\n this.c = this.b.length;\r\n this.h = []\r\n };\r\n T.U = function (c) {\r\n this.a += c\r\n };\r\n\r\n function rc(c, d) {\r\n this.h = new qc(c);\r\n this.Oa = d;\r\n this.c = null;\r\n this.b = new Float64Array(3);\r\n this.a = new Float32Array(4);\r\n this.o = {};\r\n this.l = this.u = 0;\r\n this.ra = this.L = this.ba = this.M = !1\r\n }\r\n T = rc.prototype;\r\n T.Nc = function () {\r\n var c = this.h,\r\n d, e = [],\r\n h = this.c = new Vb;\r\n this.a[0] = Infinity;\r\n this.a[1] = Infinity;\r\n this.a[2] = Infinity;\r\n this.a[3] = Infinity;\r\n for (h.defaultTextureFormat = 6; d = c.D();) switch (d) {\r\n case 1:\r\n d = c.f();\r\n c.O(c.a + d);\r\n e.push(this.bd());\r\n c.N();\r\n break;\r\n case 2:\r\n d = c.f();\r\n c.O(c.a + d);\r\n this.Vc();\r\n c.N();\r\n break;\r\n case 3:\r\n c.f();\r\n this.b[0] = c.ua();\r\n this.b[1] = c.ua();\r\n this.b[2] = c.ua();\r\n break;\r\n case 4:\r\n c.f();\r\n this.a[0] = c.$();\r\n this.a[1] = c.$();\r\n this.a[2] = c.$();\r\n this.a[3] = c.$();\r\n break;\r\n case 5:\r\n h.defaultImageryEpoch = c.f();\r\n break;\r\n case 6:\r\n h.defaultTextureFormat = sc(c.f());\r\n break;\r\n case 7:\r\n h.defaultAvailableViewDirections = c.f();\r\n break;\r\n case 8:\r\n h.defaultViewDependentTextureFormat = sc(c.f());\r\n break;\r\n default:\r\n c.B()\r\n }\r\n c.Oc();\r\n d = e.slice();\r\n d.sort(tc);\r\n for (var k = 0; k < e.length; k++) this.o[d[k]] = k;\r\n k = e.length;\r\n h.epoch = new Uint32Array(k);\r\n h.bulkMetadataEpoch = new Uint32Array(k);\r\n h.flags = new Uint8Array(k);\r\n h.metersPerTexel = new Float32Array(k);\r\n h.obbCenters = new Float64Array(3 * k);\r\n h.obbExtents = new Float32Array(3 * k);\r\n h.obbRotations = new Float32Array(9 * k);\r\n h.imageryEpochArray = new Uint32Array(k);\r\n h.textureFormatArray = new Uint8Array(k);\r\n h.viewDependentTextureFormatArray = new Uint8Array(k);\r\n h.availableViewDirectionsArray = new Uint8Array(k);\r\n for (k = 0; d = c.D();) switch (d) {\r\n case 1:\r\n d = c.f();\r\n c.O(c.a + d);\r\n this.$c(e[k++]);\r\n c.N();\r\n break;\r\n default:\r\n c.B()\r\n }\r\n this.pc();\r\n c = [h.childIndices.buffer, h.epoch.buffer, h.bulkMetadataEpoch.buffer, h.flags.buffer, h.metersPerTexel.buffer, h.obbCenters.buffer, h.obbExtents.buffer, h.obbRotations.buffer];\r\n this.M ? c.push(h.imageryEpochArray.buffer) : h.imageryEpochArray = null;\r\n this.ba ? c.push(h.textureFormatArray.buffer) : h.textureFormatArray = null;\r\n this.L ? c.push(h.availableViewDirectionsArray.buffer) : h.availableViewDirectionsArray = null;\r\n this.ra ? c.push(h.viewDependentTextureFormatArray.buffer) : h.viewDependentTextureFormatArray = null;\r\n this.Oa(h, c)\r\n };\r\n\r\n function tc(c, d) {\r\n var e = c.length - d.length;\r\n return 0 != e ? e : c < d ? -1 : 1\r\n }\r\n T.Vc = function () {\r\n for (var c = this.h, d = this.c, e; e = c.D();) switch (e) {\r\n case 1:\r\n d.headNodePath = c.cd();\r\n break;\r\n case 2:\r\n this.l = c.f();\r\n break;\r\n default:\r\n c.B()\r\n }\r\n };\r\n T.bd = function () {\r\n for (var c = this.h, d, e = \"\"; d = c.D();) switch (d) {\r\n case 1:\r\n e = c.f();\r\n d = (e & 3) + 1;\r\n e = e >> 2 & (1 << 3 * d) - 1;\r\n for (var h = \"\", k = 0; k < d; k++) h += e >> 3 * k & 7;\r\n e = h;\r\n break;\r\n default:\r\n c.B()\r\n }\r\n return e\r\n };\r\n T.$c = function (c) {\r\n var d = this.h,\r\n e = this.c,\r\n h, k = 0,\r\n g = [],\r\n m = [],\r\n p = [],\r\n v = 0,\r\n z = this.l,\r\n B = this.l,\r\n A = this.o[c];\r\n e.imageryEpochArray[A] = e.defaultImageryEpoch;\r\n e.textureFormatArray[A] = e.defaultTextureFormat;\r\n for (e.availableViewDirectionsArray[A] = e.defaultAvailableViewDirections; h = d.D();) switch (h) {\r\n case 1:\r\n k = d.f();\r\n break;\r\n case 3:\r\n d.f();\r\n g[0] = d.Ka();\r\n g[1] = d.Ka();\r\n g[2] = d.Ka();\r\n m[0] = d.Ia();\r\n m[1] = d.Ia();\r\n m[2] = d.Ia();\r\n p[0] = d.ia();\r\n p[1] = d.ia();\r\n p[2] = d.ia();\r\n break;\r\n case 4:\r\n v = d.$();\r\n break;\r\n case 2:\r\n z = d.f();\r\n break;\r\n case 5:\r\n B = d.f();\r\n break;\r\n case 7:\r\n this.M = !0;\r\n e.imageryEpochArray[A] = d.f();\r\n break;\r\n case 8:\r\n this.ba = !0;\r\n e.textureFormatArray[A] = sc(d.f());\r\n break;\r\n case 9:\r\n this.L = !0;\r\n e.availableViewDirectionsArray[A] = d.f();\r\n break;\r\n case 10:\r\n this.ra = !0;\r\n e.viewDependentTextureFormatArray[A] = sc(d.f());\r\n break;\r\n default:\r\n d.B()\r\n }\r\n c = c.length;\r\n 4 > c && this.u++;\r\n e.epoch[A] = z;\r\n e.bulkMetadataEpoch[A] = B;\r\n e.flags[A] = k >> 2 + 3 * c;\r\n 0 == v && (v = this.a[c - 1]);\r\n e.metersPerTexel[A] = v;\r\n g[0] = g[0] * v + this.b[0];\r\n g[1] = g[1] * v + this.b[1];\r\n g[2] = g[2] * v + this.b[2];\r\n m[0] *= v;\r\n m[1] *= v;\r\n m[2] *= v;\r\n p[0] = p[0] * Math.PI / 32768;\r\n p[1] = p[1] * Math.PI / 65536;\r\n p[2] = p[2] * Math.PI / 32768;\r\n k = new Float32Array(9);\r\n z = p[0];\r\n c = p[1];\r\n v = p[2];\r\n p = Math.cos(z);\r\n z = Math.sin(z);\r\n B = Math.cos(c);\r\n c = Math.sin(c);\r\n d = Math.cos(v);\r\n v = Math.sin(v);\r\n k[0] = p * d - B * z * v;\r\n k[1] = B * p * v + d * z;\r\n k[2] = v * c;\r\n k[3] = -p * v - d * B * z;\r\n k[4] = p * B * d - z * v;\r\n k[5] = d * c;\r\n k[6] = c * z;\r\n k[7] = -p * c;\r\n k[8] = B;\r\n k == k ? (p = k[1], v = k[2], z = k[5], k[1] = k[3], k[2] = k[6], k[3] = p, k[5] = k[7], k[6] = v, k[7] = z) : (k[0] = k[0], k[1] = k[3], k[2] = k[6], k[3] = k[1], k[4] = k[4], k[5] = k[7], k[6] = k[2], k[7] = k[5], k[8] = k[8]);\r\n e.obbCenters.set(g, 3 * A);\r\n e.obbRotations.set(k, 9 * A);\r\n e.obbExtents.set(m, 3 * A)\r\n };\r\n T.pc = function () {\r\n this.c.childIndices = new Int16Array(8 * (this.u + 1));\r\n this.Ab(\"\", -1)\r\n };\r\n T.Ab = function (c, d) {\r\n if (4 != c.length)\r\n for (var e = 0; 8 > e; e++) {\r\n var h = c + e,\r\n k = this.o[h];\r\n void 0 !== k ? this.Ab(h, k) : k = -1;\r\n this.c.childIndices[8 * (d + 1) + e] = k\r\n }\r\n };\r\n var uc = [6, 1];\r\n\r\n function sc(c) {\r\n for (var d = 0; d < uc.length; d++) {\r\n var e = uc[d];\r\n if (c & 1 << e - 1) return 0 == e && c.toString(16), e\r\n }\r\n c.toString(16);\r\n return uc[0]\r\n };\r\n\r\n function vc(c, d) {\r\n return 0 == d ? c + 1 & -2 : 1 == d ? c | 1 : c + 2\r\n };\r\n\r\n function zd(c) {\r\n this.ba = c;\r\n this.l = null;\r\n this.o = 0;\r\n this.b = this.h = this.L = this.M = this.c = this.u = null;\r\n this.a = 0\r\n }\r\n T = zd.prototype;\r\n T.start = function () {\r\n for (var c = this.ba, d = 0, e = 0; e < c.length; ++e) d += c[e].numNonDegenerateTriangles;\r\n if (0 >= d) return null;\r\n this.M = new Uint32Array(d);\r\n this.c = new Uint32Array(d);\r\n this.L = new Uint8Array(6 * d);\r\n this.h = Array(3);\r\n this.h[0] = new Uint8Array(d);\r\n this.h[1] = new Uint8Array(d);\r\n this.h[2] = new Uint8Array(d);\r\n for (var h = this.L, k = this.h, g, m, p, v, z, B, A = 0, G = 0, C = 0, R = 0, L = 0, O = 0, sa = 0, ka = 0, qa = 0; qa < c.length; ++qa) {\r\n e = c[qa];\r\n var P = e.indices,\r\n la = e.vertices,\r\n Ea = P.length - 2;\r\n for (e = 0; e < Ea; ++e) {\r\n m = P[vc(e, 0)];\r\n var J = P[vc(e, 1)],\r\n aa = P[vc(e, 2)];\r\n if (m != J && J != aa && aa != m) {\r\n this.M[ka] = qa << 24 | e;\r\n this.c[ka] = ka;\r\n p = 8 * m;\r\n g = v = la[p++];\r\n m = z = la[p++];\r\n p = B = la[p];\r\n var Ja = 8 * J;\r\n J = la[Ja++];\r\n J < g ? g = J : J > v && (v = J);\r\n J = la[Ja++];\r\n J < m ? m = J : J > z && (z = J);\r\n J = la[Ja];\r\n J < p ? p = J : J > B && (B = J);\r\n aa *= 8;\r\n J = la[aa++];\r\n J < g ? g = J : J > v && (v = J);\r\n J = la[aa++];\r\n J < m ? m = J : J > z && (z = J);\r\n J = la[aa];\r\n J < p ? p = J : J > B && (B = J);\r\n h[A++] = g;\r\n h[A++] = m;\r\n h[A++] = p;\r\n h[A++] = v;\r\n h[A++] = z;\r\n h[A++] = B;\r\n g = g + v >> 1;\r\n m = m + z >> 1;\r\n p = p + B >> 1;\r\n k[0][ka] = g;\r\n k[1][ka] = m;\r\n k[2][ka] = p;\r\n 0 < ka ? (g < G ? G = g : g > L && (L = g), m < C ? C = m : m > O && (O = m), p < R ? R = p : p > sa && (sa = p)) : (G = L = g, C = O = m, R = sa = p);\r\n ++ka\r\n }\r\n }\r\n }\r\n this.l = c = new Uint8Array(24 * d);\r\n this.u = new Uint32Array(c.buffer);\r\n c[0] = G;\r\n c[1] = C;\r\n c[2] = R;\r\n c[3] = L;\r\n c[4] = O;\r\n c[5] = sa;\r\n this.b = new Uint32Array(3 * d);\r\n this.a = 0;\r\n this.b[this.a++] = 0;\r\n this.b[this.a++] = 0;\r\n this.b[this.a++] = d;\r\n this.o = 1;\r\n return this.cb\r\n };\r\n T.cb = function () {\r\n for (var c = this.b, d = 0; 0 < this.a;) {\r\n var e = c[--this.a],\r\n h = c[--this.a],\r\n k = c[--this.a],\r\n g = e - h;\r\n if (0 == d || 1E4 > d + g) this.nc(k, h, e), d += g;\r\n else {\r\n this.a += 3;\r\n break\r\n }\r\n }\r\n return 0 == this.a ? this.wc : this.cb\r\n };\r\n T.nc = function (c, d, e) {\r\n var h = e - d;\r\n if (4 >= h) this.ob(c, d, e);\r\n else {\r\n var k = this.l,\r\n g = 12 * c,\r\n m = k[g + 3] - k[g + 0],\r\n p = k[g + 4] - k[g + 1],\r\n v = k[g + 5] - k[g + 2];\r\n if (m > p && m > v) var z = 0;\r\n else p > v ? (z = 1, m = p) : (z = 2, m = v);\r\n k = k[g + z] + (m >> 1);\r\n p = d;\r\n v = e;\r\n g = this.h[z];\r\n for (m = this.c; ;) {\r\n for (; p < v && !(g[m[p]] >= k);) p++;\r\n for (; p < v && !(g[m[v - 1]] < k);) v--;\r\n if (p == v) {\r\n p = v;\r\n break\r\n }\r\n var B = m[p];\r\n m[p] = m[v - 1];\r\n m[v - 1] = B\r\n }\r\n if (p == d || p == e) {\r\n if (255 > h) {\r\n this.ob(c, d, e);\r\n return\r\n }\r\n p = (d + e) / 2;\r\n k = g[m[p]]\r\n }\r\n h = this.o++;\r\n g = this.o++;\r\n this.Fc(c, h, z, k, d, p, e);\r\n this.b[this.a++] = g;\r\n this.b[this.a++] = p;\r\n this.b[this.a++] = e;\r\n this.b[this.a++] = h;\r\n this.b[this.a++] = d;\r\n this.b[this.a++] = p\r\n }\r\n };\r\n T.Fc = function (c, d, e, h, k, g, m) {\r\n h = this.l;\r\n c *= 12;\r\n h[c + 6] = 0;\r\n h[c + 7] = e;\r\n this.u[c + 8 >> 2] = d;\r\n e = this.h[0];\r\n c = this.h[1];\r\n for (var p = this.h[2], v = 0; 2 > v; v++) {\r\n var z = 0 == v ? k : g,\r\n B = 0 == v ? g : m;\r\n if (!(4 >= B - z)) {\r\n var A = this.c[z],\r\n G = e[A],\r\n C = c[A];\r\n A = p[A];\r\n var R = G,\r\n L = G,\r\n O = C,\r\n sa = C,\r\n ka = A,\r\n qa = A;\r\n for (z += 1; z < B; z++) A = this.c[z], G = e[A], C = c[A], A = p[A], G < R ? R = G : G > L && (L = G), C < O ? O = C : C > sa && (sa = C), A < ka ? ka = A : A > qa && (qa = A);\r\n B = 12 * (0 == v ? d : d + 1);\r\n h[B++] = R;\r\n h[B++] = O;\r\n h[B++] = ka;\r\n h[B++] = L;\r\n h[B++] = sa;\r\n h[B] = qa\r\n }\r\n }\r\n };\r\n T.ob = function (c, d, e) {\r\n var h = this.L,\r\n k = this.c,\r\n g, m, p, v;\r\n var z = g = m = 255;\r\n var B = p = v = 0;\r\n for (var A = d; A < e; ++A) {\r\n var G = 6 * k[A],\r\n C = h[G++];\r\n z = z < C ? z : C;\r\n C = h[G++];\r\n g = g < C ? g : C;\r\n C = h[G++];\r\n m = m < C ? m : C;\r\n C = h[G++];\r\n B = B > C ? B : C;\r\n C = h[G++];\r\n p = p > C ? p : C;\r\n C = h[G++];\r\n v = v > C ? v : C\r\n }\r\n h = this.l;\r\n c *= 12;\r\n k = c + 0;\r\n h[k++] = z;\r\n h[k++] = g;\r\n h[k++] = m;\r\n h[k++] = B;\r\n h[k++] = p;\r\n h[k] = v;\r\n h[c + 6] = 1;\r\n h[c + 7] = e - d;\r\n this.u[c + 8 >> 2] = d\r\n };\r\n T.wc = function () {\r\n for (var c = this.l, d = this.u, e = this.o - 1; 0 <= e; e--) {\r\n var h = 12 * e;\r\n if (0 == c[h + 6]) {\r\n var k = h + 0;\r\n h = 12 * d[h + 8 >> 2];\r\n for (var g = h + 12, m = 0; 3 > m; m++ , k++ , h++ , g++) {\r\n var p = c[h],\r\n v = c[g];\r\n c[k] = p <= v ? p : v;\r\n p = c[3 + h];\r\n v = c[3 + g];\r\n c[3 + k] = p >= v ? p : v\r\n }\r\n }\r\n }\r\n for (e = 0; e < this.c.length; ++e) this.c[e] = this.M[this.c[e]];\r\n this.l = c.subarray(0, 12 * this.o);\r\n return null\r\n };\r\n T.hc = function () {\r\n return this.l\r\n };\r\n var Ad = null;\r\n\r\n function Cd(c, d, e) {\r\n this.b = new qc(c);\r\n this.o = d;\r\n this.a = new Wb;\r\n this.l = e\r\n }\r\n Cd.prototype.c = function () {\r\n for (var c = this.b, d; d = c.D();) switch (d) {\r\n case 2:\r\n d = c.f();\r\n c.O(c.a + d);\r\n this.a.textures.push(Dd(c, this.o));\r\n c.N();\r\n break;\r\n case 3:\r\n d = c.f();\r\n c.O(c.a + d);\r\n d = this.h();\r\n this.a.transformInfo[d.meshId] = d;\r\n c.N();\r\n break;\r\n case 4:\r\n var e = c.f() / 4;\r\n this.a.projectionOrigin = new Float32Array(e);\r\n for (d = 0; d < e; ++d) this.a.projectionOrigin[d] = c.$();\r\n break;\r\n default:\r\n c.B()\r\n }\r\n c = [];\r\n e = this.a.textures;\r\n for (d = 0; d < e.length; d++) c.push(e[d].bytes.buffer);\r\n for (d = 0; d < this.a.transformInfo.length; ++d)\r\n if (this.a.transformInfo[d]) {\r\n c.push(this.a.transformInfo[d].transformTable.buffer);\r\n c.push(this.a.transformInfo[d].vertexTransformMap.buffer);\r\n var h = e[this.a.transformInfo[d].meshId];\r\n h = new Float32Array([.5, .5 - h.height, 1 / h.width, -1 / h.height]);\r\n this.a.transformInfo[d].uvOffsetAndScale = h;\r\n c.push(h.buffer)\r\n } this.a.projectionOrigin && c.push(this.a.projectionOrigin.buffer);\r\n this.l(this.a, c)\r\n };\r\n Cd.prototype.h = function () {\r\n for (var c = this.b, d, e = new pc; d = c.D();) switch (d) {\r\n case 1:\r\n d = c.f();\r\n for (var h = d / 6, k = new Float64Array(5 * h), g = c.data(), m = c.a, p = 0; p < h; ++p) {\r\n var v = m + 6 * p,\r\n z = g[v],\r\n B = g[v + 1],\r\n A = g[v + 2],\r\n G = g[v + 3],\r\n C = g[v + 4];\r\n v = g[v + 5];\r\n 127 < G && (G -= 256);\r\n A += G << 8;\r\n 127 < v && (v -= 256);\r\n C += v << 8;\r\n G = 2 * Math.PI * z / 256;\r\n z = Math.cos(G);\r\n G = Math.sin(G);\r\n B /= 255;\r\n k[5 * p] = 1 + (B - 1) * z * z;\r\n k[5 * p + 1] = (B - 1) * z * G;\r\n k[5 * p + 2] = 1 + (B - 1) * G * G;\r\n k[5 * p + 3] = A;\r\n k[5 * p + 4] = C\r\n }\r\n e.transformTable = k;\r\n c.U(d);\r\n break;\r\n case 2:\r\n d = c.f();\r\n h = d / 2;\r\n k = new Uint16Array(h);\r\n g = c.data();\r\n m = c.a;\r\n for (p = 0; p < h; ++p) k[p] = g[m + 2 * p] + (g[m + 2 * p + 1] << 8);\r\n e.vertexTransformMap = k;\r\n c.U(d);\r\n break;\r\n case 3:\r\n e.meshId = c.f();\r\n break;\r\n default:\r\n c.B()\r\n }\r\n return e\r\n };\r\n var Ed = null;\r\n\r\n function Dd(c, d) {\r\n for (var e = c.data(), h, k = 1, g = 0, m = 0, p = 256, v = 256, z = 0, B = -1; h = c.D();) switch (h) {\r\n case 1:\r\n m = c.Xc();\r\n g || (g = c.a);\r\n c.U(m);\r\n break;\r\n case 3:\r\n p = c.f();\r\n break;\r\n case 4:\r\n v = c.f();\r\n break;\r\n case 2:\r\n k = c.f();\r\n break;\r\n case 5:\r\n z = c.f();\r\n break;\r\n case 6:\r\n B = c.f();\r\n break;\r\n default:\r\n c.B()\r\n }\r\n c = new Ub;\r\n switch (k) {\r\n case 1:\r\n c.bytes = new Uint8Array(m);\r\n c.bytes.set(e.subarray(g, g + m));\r\n break;\r\n case 6:\r\n Ed || (Ed = new Maps.CrunchDecompressor());\r\n h = Ed;\r\n var A = h.malloc(m);\r\n h.setData(e, g, m, A);\r\n e = h.getDecompressedSize(A, m);\r\n g = h.malloc(e);\r\n c.bytes = new Uint8Array(e);\r\n h.decompress(A, m, g, e);\r\n h.getData(g, e, c.bytes, 0);\r\n h.free(A);\r\n h.free(g);\r\n if (!d) {\r\n d = new Uint16Array(c.bytes.buffer);\r\n m = p;\r\n A = v;\r\n e = new Uint16Array(m * A);\r\n Ad || (Ad = new Uint16Array(4));\r\n g = Ad;\r\n h = m / 4;\r\n for (var G = A / 4, C = 0; C < G; C++)\r\n for (var R = 0; R < h; R++) {\r\n A = 4 * (C * h + R);\r\n g[0] = d[A];\r\n g[1] = d[A + 1];\r\n var L = g[0] & 31;\r\n var O = g[0] & 2016;\r\n var sa = g[0] & 63488;\r\n var ka = g[1] & 31;\r\n var qa = g[1] & 2016;\r\n var P = g[1] & 63488;\r\n g[2] = 5 * L + 3 * ka >> 3 | 5 * O + 3 * qa >> 3 & 2016 | 5 * sa + 3 * P >> 3 & 63488;\r\n g[3] = 5 * ka + 3 * L >> 3 | 5 * qa + 3 * O >> 3 & 2016 | 5 * P + 3 * sa >> 3 & 63488;\r\n O = 4 * C * m + 4 * R;\r\n L = d[A + 2];\r\n e[O] = g[L & 3];\r\n e[O + 1] = g[L >> 2 & 3];\r\n e[O + 2] = g[L >> 4 & 3];\r\n e[O + 3] = g[L >> 6 & 3];\r\n O += m;\r\n e[O] = g[L >> 8 & 3];\r\n e[O + 1] = g[L >> 10 & 3];\r\n e[O + 2] = g[L >> 12 & 3];\r\n e[O + 3] = g[L >> 14];\r\n L = d[A + 3];\r\n O += m;\r\n e[O] = g[L & 3];\r\n e[O + 1] = g[L >> 2 & 3];\r\n e[O + 2] = g[L >> 4 & 3];\r\n e[O + 3] = g[L >> 6 & 3];\r\n O += m;\r\n e[O] = g[L >> 8 & 3];\r\n e[O + 1] = g[L >> 10 & 3];\r\n e[O + 2] = g[L >> 12 & 3];\r\n e[O + 3] = g[L >> 14]\r\n }\r\n c.bytes = new Uint8Array(e.buffer)\r\n }\r\n }\r\n c.textureFormat = k;\r\n c.width = p;\r\n c.height = v;\r\n c.viewDirection = z;\r\n c.meshId = B;\r\n return c\r\n };\r\n\r\n function Fd(c, d, e, h) {\r\n this.b = new qc(c);\r\n this.u = d;\r\n this.h = e;\r\n this.a = new Sb;\r\n this.l = [];\r\n this.o = h;\r\n this.c = null\r\n }\r\n T = Fd.prototype;\r\n T.Fa = function () {\r\n for (var c = this.b, d; d = c.D();) switch (d) {\r\n case 1:\r\n var e = c.f() / 8,\r\n h = this.a.matrixGlobeFromMesh = new Float64Array(16);\r\n for (d = 0; d < e; d++) h[d] = c.ua();\r\n this.a.matrixMeshFromGlobe = new Float64Array(16);\r\n d = this.a.matrixMeshFromGlobe;\r\n e = h[0];\r\n var k = h[1],\r\n g = h[2],\r\n m = h[3],\r\n p = h[4],\r\n v = h[5],\r\n z = h[6],\r\n B = h[7],\r\n A = h[8],\r\n G = h[9],\r\n C = h[10],\r\n R = h[11],\r\n L = h[12],\r\n O = h[13],\r\n sa = h[14];\r\n h = h[15];\r\n var ka = e * v - k * p,\r\n qa = e * z - g * p,\r\n P = e * B - m * p,\r\n la = k * z - g * v,\r\n Ea = k * B - m * v,\r\n J = g * B - m * z,\r\n aa = A * O - G * L,\r\n Ja = A * sa - C * L,\r\n Ua = A * h - R * L,\r\n ab = G * sa - C * O,\r\n Ya = G * h - R * O,\r\n Va = C * h - R * sa,\r\n va = ka * Va - qa * Ya + P * ab + la * Ua - Ea * Ja + J * aa;\r\n 0 != va && (va = 1 / va, d[0] = (v * Va - z * Ya + B * ab) * va, d[1] = (-k * Va + g * Ya - m * ab) * va, d[2] = (O * J - sa * Ea + h * la) * va, d[3] = (-G * J + C * Ea - R * la) * va, d[4] = (-p * Va + z * Ua - B * Ja) * va, d[5] = (e * Va - g * Ua + m * Ja) * va, d[6] = (-L * J + sa * P - h * qa) * va, d[7] = (A * J - C * P + R * qa) * va, d[8] = (p * Ya - v * Ua + B * aa) * va, d[9] = (-e * Ya + k * Ua - m * aa) * va, d[10] = (L * Ea - O * P + h * ka) * va, d[11] = (-A * Ea + G * P - R * ka) * va, d[12] = (-p * ab + v * Ja - z * aa) * va, d[13] = (e * ab - k * Ja + g * aa) * va, d[14] = (-L * la + O * qa - sa * ka) * va, d[15] = (A * la - G * qa + C * ka) * va);\r\n break;\r\n case 2:\r\n d = c.f();\r\n c.O(c.a + d);\r\n this.a.meshes.push(this.Ja());\r\n c.N();\r\n break;\r\n case 3:\r\n d = c.f();\r\n this.a.copyrightIds ? this.a.copyrightIds.push(d) : this.a.copyrightIds = [d];\r\n break;\r\n case 6:\r\n d = c.f();\r\n c.O(c.a + d);\r\n this.a.waterMesh = this.Ja();\r\n c.N();\r\n break;\r\n case 7:\r\n d = c.f();\r\n c.O(c.a + d);\r\n this.a.overlaySurfaceMeshes.push(this.Ja());\r\n c.N();\r\n break;\r\n case 8:\r\n this.h ? this.ad() : c.B();\r\n break;\r\n default:\r\n c.B()\r\n }\r\n this.oc();\r\n if (this.h)\r\n for (d = 0; d < this.a.meshes.length; ++d) this.uc(this.a.meshes[d]);\r\n c = [];\r\n c.push(this.a.matrixGlobeFromMesh.buffer);\r\n c.push(this.a.matrixMeshFromGlobe.buffer);\r\n e = this.a.meshes;\r\n for (d = 0; d < e.length; d++) c.push(e[d].vertices.buffer), c.push(e[d].uvOffsetAndScale.buffer), c.push(e[d].layerBounds.buffer), c.push(e[d].indices.buffer), e[d].normals && c.push(e[d].normals.buffer), (k = e[d].texture) && c.push(k.bytes.buffer);\r\n e = this.a.overlaySurfaceMeshes;\r\n for (d = 0; d < e.length; d++) c.push(e[d].vertices.buffer), c.push(e[d].layerBounds.buffer), c.push(e[d].indices.buffer), e[d].normals && c.push(e[d].normals.buffer);\r\n if (d = this.a.waterMesh) c.push(d.vertices.buffer), c.push(d.vertexAlphas.buffer), c.push(d.layerBounds.buffer), c.push(d.indices.buffer), d.normals && c.push(d.normals.buffer);\r\n c.push(this.a.bvhNodes.buffer);\r\n c.push(this.a.bvhTriPermutation.buffer);\r\n this.o(this.a, c)\r\n };\r\n T.oc = function () {\r\n for (var c = this.a, d = c.meshes.slice(), e = 0; e < c.overlaySurfaceMeshes.length; e++) d.push(c.overlaySurfaceMeshes[e]);\r\n c.waterMesh && d.push(c.waterMesh);\r\n if (0 != d.length) {\r\n c = new zd(d);\r\n for (d = c.start(); null != d;) d = d.apply(c);\r\n this.a.bvhNodes = c.hc();\r\n this.a.bvhTriPermutation = c.c\r\n }\r\n };\r\n T.Ja = function () {\r\n var c = this.b,\r\n d = new Tb,\r\n e = [];\r\n this.l.push(e);\r\n for (var h; h = c.D();) switch (h) {\r\n case 1:\r\n this.fd(d);\r\n break;\r\n case 3:\r\n this.Wc(d);\r\n break;\r\n case 6:\r\n h = c.f();\r\n c.O(c.a + h);\r\n d.texture = Dd(c, this.u);\r\n c.N();\r\n break;\r\n case 7:\r\n this.dd(d);\r\n break;\r\n case 8:\r\n this.Yc(d, e);\r\n break;\r\n case 9:\r\n this.ed(d);\r\n break;\r\n case 10:\r\n var k = c.f() / 4,\r\n g = d.uvOffsetAndScale = new Float32Array(4);\r\n for (h = 0; h < k; h++) g[h] = c.$();\r\n break;\r\n case 11:\r\n this.h ? this.Zc(d) : c.B();\r\n break;\r\n case 12:\r\n d.meshId = c.f();\r\n break;\r\n default:\r\n c.B()\r\n }\r\n d.uvOffsetAndScale && (d.uvOffsetAndScale[1] -= 1 / d.uvOffsetAndScale[3], d.uvOffsetAndScale[3] *= -1);\r\n c = d.vertices;\r\n k = d.indices;\r\n for (var m = g = 0; m < e.length; m++) {\r\n var p = m & 7;\r\n 0 < e[m] && (this.a.nonEmptyOctants |= 1 << p);\r\n for (h = 0; h < e[m]; h++) {\r\n var v = 8 * k[g++] + 3;\r\n c[v] = p\r\n }\r\n }\r\n return d\r\n };\r\n T.Wc = function (c) {\r\n var d = this.b;\r\n d.f();\r\n for (var e = d.f(), h = c.indices = new Uint16Array(e), k = 0, g = 0, m, p = 0, v = 0, z = 0; z < e; z++) {\r\n var B = d.f();\r\n m = p;\r\n p = v;\r\n v = k - B;\r\n h[z] = v;\r\n m != p && p != v && m != v && g++;\r\n B || k++\r\n }\r\n c.numNonDegenerateTriangles = g\r\n };\r\n T.fd = function (c) {\r\n var d = this.b,\r\n e = d.data(),\r\n h = d.f(),\r\n k = h / 3;\r\n c = c.vertices = new Uint8Array(8 * k);\r\n for (var g = d.a, m = 0; 2 >= m; m++) {\r\n var p = e[g++];\r\n c[m] = p;\r\n for (var v = 1; v < k; v++) p = p + e[g++] & 255, c[8 * v + m] = p\r\n }\r\n d.U(h)\r\n };\r\n T.ed = function (c) {\r\n var d = this.b,\r\n e = d.data(),\r\n h = d.f();\r\n c = c.vertexAlphas = new Uint8Array(h);\r\n var k = d.a,\r\n g = e[k++];\r\n c[0] = g;\r\n for (var m = 1; m < h; m++) g = g + e[k++] & 255, c[m] = g;\r\n d.U(h)\r\n };\r\n T.dd = function (c) {\r\n for (var d = this.b, e = d.data(), h = (d.f() - 4) / 4, k = d.ia(), g = d.ia(), m = 0, p = 0, v = d.a, z = c.vertices, B = 0; B < h; B++) {\r\n var A = e[v + 1 * h + B] + (e[v + 3 * h + B] << 8);\r\n m = (m + (e[v + 0 * h + B] + (e[v + 2 * h + B] << 8))) % (k + 1);\r\n p = (p + A) % (g + 1);\r\n A = 8 * B + 4;\r\n z[A + 0] = m & 255;\r\n z[A + 1] = m >> 8;\r\n z[A + 2] = p & 255;\r\n z[A + 3] = p >> 8\r\n }\r\n c.uvOffsetAndScale || (c.uvOffsetAndScale = new Float32Array([.5, .5, 1 / (k + 1), 1 / (g + 1)]));\r\n d.U(4 * h)\r\n };\r\n T.Yc = function (c, d) {\r\n var e = this.b;\r\n e.f();\r\n var h = e.f(),\r\n k = 0,\r\n g = c.layerBounds = new Uint32Array(10),\r\n m = 0;\r\n c = c.octantCounts = new Uint32Array(72);\r\n for (var p = 0; p < h; p++) {\r\n 0 == p % 8 && (g[m++] = k);\r\n var v = e.f();\r\n d.push(v);\r\n c[8 * (m - 1) + (p & 7)] = v;\r\n k += v\r\n }\r\n for (; 10 > m; m++) g[m] = k\r\n };\r\n\r\n function Gd(c, d) {\r\n if (4 >= d) return (c << d) + (c & (1 << d) - 1);\r\n if (6 >= d) {\r\n var e = 8 - d;\r\n return (c << d) + (c << d >> e) + (c << d >> e >> e) + (c << d >> e >> e >> e)\r\n }\r\n return -(c & 1)\r\n }\r\n\r\n function Hd(c, d) {\r\n return c < d ? c : d\r\n }\r\n\r\n function Id(c) {\r\n c = Math.round(c);\r\n return Hd(0 > c ? 0 : c, 255)\r\n }\r\n T.ad = function () {\r\n var c = this.b,\r\n d = c.data(),\r\n e = c.f(),\r\n h = c.a,\r\n k = d[h] + (d[h + 1] << 8),\r\n g = d[h + 2];\r\n h += 3;\r\n this.c = new Uint8Array(3 * k);\r\n for (var m = 0; m < e; ++m) {\r\n var p = d[h + m],\r\n v = d[h + k + m];\r\n p = Gd(p, g);\r\n v = Gd(v, g);\r\n var z = p / 255,\r\n B = v / 255;\r\n v = this.c;\r\n p = 3 * m;\r\n var A = z,\r\n G = B,\r\n C = A + G,\r\n R = A - G,\r\n L = 1;\r\n .5 <= C && 1.5 >= C && -.5 <= R && .5 >= R || (L = -1, .5 >= C ? (A = .5 - B, G = .5 - z) : 1.5 <= C ? (A = 1.5 - B, G = 1.5 - z) : -.5 >= R ? (A = B - .5, G = z + .5) : (A = B + .5, G = z - .5), C = A + G, R = A - G);\r\n z = Hd(Hd(2 * C - 1, 3 - 2 * C), Hd(2 * R + 1, 1 - 2 * R)) * L;\r\n A = 2 * A - 1;\r\n G = 2 * G - 1;\r\n B = 127 / Math.sqrt(z * z + A * A + G * G);\r\n v[p + 0] = Id(B * z + 127);\r\n v[p + 1] = Id(B * A + 127);\r\n v[p + 2] = Id(B * G + 127)\r\n }\r\n c.U(e)\r\n };\r\n T.Zc = function (c) {\r\n var d = this.b,\r\n e = d.data(),\r\n h = d.f(),\r\n k = d.a;\r\n c.normals = new Uint8Array(e.buffer.slice(k, k + h));\r\n d.U(h)\r\n };\r\n T.uc = function (c) {\r\n var d = c.normals;\r\n if (d && this.c)\r\n for (h = d.length / 2, c.normals = new Uint8Array(4 * h), k = 0; k < h; ++k) {\r\n var e = d[k] + (d[h + k] << 8);\r\n c.normals[4 * k] = this.c[3 * e];\r\n c.normals[4 * k + 1] = this.c[3 * e + 1];\r\n c.normals[4 * k + 2] = this.c[3 * e + 2];\r\n c.normals[4 * k + 3] = 0\r\n } else {\r\n var h = c.vertices.length / 8;\r\n c.normals = new Uint8Array(4 * h);\r\n for (var k = 0; k < h; ++k) c.normals[4 * k] = 127, c.normals[4 * k + 1] = 127, c.normals[4 * k + 2] = 127, c.normals[4 * k + 3] = 0\r\n }\r\n };\r\n var Jd = [];\r\n\r\n function rf(c) {\r\n this.b = c;\r\n c.webkitPostMessage && (c.postMessage = c.webkitPostMessage);\r\n var d = this;\r\n c.onmessage = function (c) {\r\n d.a(c)\r\n }\r\n }\r\n rf.prototype.a = function (c) {\r\n var d = Fb(),\r\n e = c.data.id,\r\n h = c.data.command;\r\n c = c.data.payload;\r\n var k = this.b;\r\n if (void 0 !== e && void 0 !== h && c) {\r\n c = new Uint8Array(c);\r\n var g = function (c, g) {\r\n var h = Fb() - d,\r\n m = {};\r\n m.id = e;\r\n m.time = h;\r\n m.payload = c;\r\n m.logs = [];\r\n m.complete = !0;\r\n k.postMessage(m, g)\r\n };\r\n 0 == h ? (h = new rc(c, g), h.Nc()) : 1 == h ? (h = new Fd(c, !0, !1, g), h.Fa()) : 2 == h ? (h = new Fd(c, !1, !0, g), h.Fa()) : 3 == h ? (h = new Fd(c, !0, !0, g), h.Fa()) : 4 == h ? (h = new Cd(c, !0, g), h.c()) : 5 == h ? (h = new Cd(c, !1, g), h.c()) : Jd.push(\"Bad DecodeTaskCommand: \" + h)\r\n }\r\n };\r\n new rf(self);\r\n }).call(scope);\r\n };\r\n })(Maps = Utils.Maps || (Utils.Maps = {}));\r\n })(Utils = spt.Utils || (spt.Utils = {}));\r\n})(spt || (spt = {}));","module spt.Utils.Maps {\r\n export var decodeResource = (() => {\r\n const callbacks = {};\r\n const self: {onmessage?: (data) => void; postMessage: (p, g) => void} = {\r\n postMessage(p, g) {\r\n callbacks[p.id].resolve(p);\r\n delete callbacks[(event).id];\r\n }\r\n };\r\n\r\n Maps.greateDecoder(self);\r\n\r\n return async function decode(command, payload): Promise {\r\n const id = Utils.GenerateGuid();\r\n return await new Promise((resolve, reject) => {\r\n callbacks[id] = { resolve, reject }\r\n self.onmessage({ data: { id, command, payload } });\r\n });\r\n }\r\n })();\r\n}","var GMapsUtils=function(o){function e(e){var t=e[0];var n=e[1];var r=e[2];var i,s,a=0,u=[];for(;a0?1:-1,f=a>0?1:-1;if(u>o){for(var h=e,d=t;l<0?h>=n:h<=n;h+=l){i.push({x:h,y:d});c+=o;if(c<<1>=u){d+=f;c-=u}}}else{for(var h=e,d=t;f<0?d>=r:d<=r;d+=f){i.push({x:h,y:d});c+=u;if(c<<1>=o){h+=l;c-=o}}}return i}function c(e,t){return a(e[0],e[1],t[0],t[1])}function l(e,i){var s=[].concat(c(e[1],e[2]),c(e[0],e[2]),c(e[0],e[1])).sort(function(e,t){return e.y===t.y?e.x-t.x:e.y-t.y});s.forEach(function(e,t){var n=s[t+1];if(n&&e.y===n.y){for(var r=e.x;r=o)return[2,{value:u&&u(i,t,n)}];a&&a(i,t,n);return[4,new Promise(function(e,t){return setTimeout(e,1e3*n)})];case 3:e.sent();return[3,4];case 4:return[2]}})};n=1,r=1;e.label=1;case 1:return[5,t(n,r)];case 2:i=e.sent();if(typeof i===\"object\")return[2,i.value];e.label=3;case 3:n++,r=Math.min(2*r,c);return[3,1];case 4:return[2]}})})}function k(s,a,u){return Object(v[\"a\"])(this,void 0,void 0,function(){var t,n,r,i;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:if(u&&y&&O[a]&&!O[a]._isDisposed&&(!O[a].meshes||!O[a].meshes.lenght||!O[a].meshes.some(function(e){return e&&!!e._isDisposed}))){return[2,O[a]]}if(!j[a])return[3,2];return[4,new Promise(function(e,t){j[a].push({resolve:e,reject:t})})];case 1:return[2,e.sent()];case 2:;j[a]=[];e.label=3;case 3:e.trys.push([3,6,,7]);return[4,L(a)];case 4:n=e.sent();return[4,spt.Utils.Maps.decodeResource(s,n)];case 5:r=e.sent();t=r.payload;if(u&&y)O[a]=t;return[3,7];case 6:i=e.sent();j[a].forEach(function(e){return e.reject(i)});delete j[a];throw i;case 7:j[a].forEach(function(e){return e.resolve(t)});delete j[a];return[2,t]}})})}function P(t){if(t===void 0){t=true}return Object(v[\"a\"])(this,void 0,void 0,function(){return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:return[4,k(M,\"\"+m+w,t)];case 1:return[2,e.sent()]}})})}function E(t,n){if(n===void 0){n=true}return Object(v[\"a\"])(this,void 0,void 0,function(){return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:return[4,k(B,t,n)];case 1:return[2,e.sent()]}})})}function V(t,n){if(n===void 0){n=true}return Object(v[\"a\"])(this,void 0,void 0,function(){return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:return[4,k(M,t,n)];case 1:return[2,e.sent()]}})})}function F(e,t){var n=-1;for(var r=t.length-1-(t.length-1)%4;rl)return[2,false];e.label=3;case 3:e.trys.push([3,5,,6]);return[4,R(f,o)];case 4:n=e.sent();if(!n)return[2,false];return[3,6];case 5:r=e.sent();console.error(r);return[2,false];case 6:e.trys.push([6,9,,10]);return[4,Promise.all([function(){return Object(v[\"a\"])(this,void 0,void 0,function(){var t;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:t={oct:0};return[4,C(o+\"0\",c,l,f)];case 1:return[2,(t.res=e.sent(),t)]}})})}(),function(){return Object(v[\"a\"])(this,void 0,void 0,function(){var t;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:t={oct:1};return[4,C(o+\"1\",c,l,f)];case 1:return[2,(t.res=e.sent(),t)]}})})}(),function(){return Object(v[\"a\"])(this,void 0,void 0,function(){var t;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:t={oct:2};return[4,C(o+\"2\",c,l,f)];case 1:return[2,(t.res=e.sent(),t)]}})})}(),function(){return Object(v[\"a\"])(this,void 0,void 0,function(){var t;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:t={oct:3};return[4,C(o+\"3\",c,l,f)];case 1:return[2,(t.res=e.sent(),t)]}})})}(),function(){return Object(v[\"a\"])(this,void 0,void 0,function(){var t;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:t={oct:4};return[4,C(o+\"4\",c,l,f)];case 1:return[2,(t.res=e.sent(),t)]}})})}(),function(){return Object(v[\"a\"])(this,void 0,void 0,function(){var t;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:t={oct:5};return[4,C(o+\"5\",c,l,f)];case 1:return[2,(t.res=e.sent(),t)]}})})}(),function(){return Object(v[\"a\"])(this,void 0,void 0,function(){var t;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:t={oct:6};return[4,C(o+\"6\",c,l,f)];case 1:return[2,(t.res=e.sent(),t)]}})})}(),function(){return Object(v[\"a\"])(this,void 0,void 0,function(){var t;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:t={oct:7};return[4,C(o+\"7\",c,l,f)];case 1:return[2,(t.res=e.sent(),t)]}})})}()])];case 7:i=e.sent();s=i.filter(function(e){return e.res}).map(function(e){return e.oct});return[4,T(o,n.bulk,n.index)];case 8:a=e.sent();c(o,a,s);return[3,10];case 9:u=e.sent();console.error(u);return[2,false];case 10:return[2,true]}})})}var N=function(){function f(e,t,n,r){this._initializing=false;this._isInitialized=false;this.path=e;this.box=n;this._children=r;this.octantNumber=t}f.getRootEpoch=function(){return Object(v[\"a\"])(this,void 0,void 0,function(){var t;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:return[4,P()];case 1:t=e.sent();return[2,t.bulkMetadataEpoch[0]]}})})};f.prototype.indexValid=function(t){return Object(v[\"a\"])(this,void 0,void 0,function(){return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:return[4,this.getIndex(t)];case 1:return[2,e.sent()>=0]}})})};f.prototype.getIndex=function(t){return Object(v[\"a\"])(this,void 0,void 0,function(){return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:if(!!this._isInitialized)return[3,2];return[4,this.initBulkAndIndex(t)];case 1:e.sent();e.label=2;case 2:return[2,this._index]}})})};f.prototype.getBulk=function(t){return Object(v[\"a\"])(this,void 0,void 0,function(){return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:if(!!this._isInitialized)return[3,2];return[4,this.initBulkAndIndex(t)];case 1:e.sent();e.label=2;case 2:if(!this._hasNodeAtIndex)return[2,null];return[2,this._bulk]}})})};f.prototype.hasNodeAtIndex=function(t){return Object(v[\"a\"])(this,void 0,void 0,function(){return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:if(!!this._isInitialized)return[3,2];return[4,this.initBulkAndIndex(t)];case 1:e.sent();e.label=2;case 2:return[2,this._hasNodeAtIndex]}})})};f.prototype.setBulkAndIndex=function(e,t){this._index=e;this._bulk=t;this._hasNodeAtIndex=this._bulk&&this._index>=0&&I(this._bulk,this._index);this._initializing=false;this._isInitialized=true;if(this._initResolveFuncs){if(this._initResolveFuncs.length)this._initResolveFuncs.forEach(function(e){return e()});delete this._initResolveFuncs}};f.prototype.initBulkAndIndex=function(f){return Object(v[\"a\"])(this,void 0,void 0,function(){var t,n,r,i,s,a,u,o,c;var l=this;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:if(!this._initializing)return[3,2];return[4,new Promise(function(e,t){l._initResolveFuncs.push(e)})];case 1:e.sent();return[2];case 2:this._initializing=true;this._initResolveFuncs=[];if(!!f)return[3,4];return[4,P()];case 3:t=e.sent();f=t.bulkMetadataEpoch[0];e.label=4;case 4:n=null,r=-1,i=f,s=this.path;a=4;e.label=5;case 5:if(!(a=90){e=this._children=[new f(a+\"0\",0,MapDrawing.BoundsLatLng.fromValues(i,s,u,r)),new f(a+\"1\",1,MapDrawing.BoundsLatLng.fromValues(i,o,u,r)),new f(a+\"2\",2,MapDrawing.BoundsLatLng.fromValues(u,s,n,o)),new f(a+\"4\",4,MapDrawing.BoundsLatLng.fromValues(i,s,u,r)),new f(a+\"5\",5,MapDrawing.BoundsLatLng.fromValues(i,o,u,r)),new f(a+\"6\",6,MapDrawing.BoundsLatLng.fromValues(u,s,n,o))]}else if(i<=-90){e=this._children=[new f(a+\"0\",0,MapDrawing.BoundsLatLng.fromValues(i,s,u,o)),new f(a+\"2\",2,MapDrawing.BoundsLatLng.fromValues(u,s,n,r)),new f(a+\"3\",3,MapDrawing.BoundsLatLng.fromValues(u,o,n,r)),new f(a+\"4\",4,MapDrawing.BoundsLatLng.fromValues(i,s,u,o)),new f(a+\"6\",6,MapDrawing.BoundsLatLng.fromValues(u,s,n,r)),new f(a+\"7\",7,MapDrawing.BoundsLatLng.fromValues(u,o,n,r))]}else{e=this._children=[new f(a+\"0\",0,MapDrawing.BoundsLatLng.fromValues(i,s,u,o)),new f(a+\"1\",1,MapDrawing.BoundsLatLng.fromValues(i,o,u,r)),new f(a+\"2\",2,MapDrawing.BoundsLatLng.fromValues(u,s,n,o)),new f(a+\"3\",3,MapDrawing.BoundsLatLng.fromValues(u,o,n,r)),new f(a+\"4\",4,MapDrawing.BoundsLatLng.fromValues(i,s,u,o)),new f(a+\"5\",5,MapDrawing.BoundsLatLng.fromValues(i,o,u,r)),new f(a+\"6\",6,MapDrawing.BoundsLatLng.fromValues(u,s,n,o)),new f(a+\"7\",7,MapDrawing.BoundsLatLng.fromValues(u,o,n,r))]}}return e},enumerable:false,configurable:true});f.prototype.isInside=function(e,t){return e>=this.box.Min.Latitude&&e<=this.box.Max.Latitude&&t>=this.box.Min.Longitude&&t<=this.box.Max.Longitude};f.prototype.getChildrenByPoint=function(t,n){return this.children.filter(function(e){return e.isInside(t,n)})};f.prototype.getChildrenByBounds=function(e){var t=Array.isArray(e)?e[Math.min(this.level+1,e.length-1)]:e;return this.children.filter(function(e){return e.box.Overlaps(t)})};f.prototype.getNodes=function(c,l,f){return Object(v[\"a\"])(this,void 0,Promise,function(){var t,n,r,i,s,a,u,o;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:if(!!l)return[3,2];return[4,P()];case 1:t=e.sent();l=t.bulkMetadataEpoch[0];e.label=2;case 2:if(!c)c=this.level;else if(this.level>c)return[2,null];e.label=3;case 3:e.trys.push([3,5,,6]);return[4,this.getBulk(l)];case 4:n=e.sent();if(!n)return[2,null];return[3,6];case 5:r=e.sent();console.error(r);return[2,null];case 6:return[4,this.getIndex(l)];case 7:i=e.sent();e.label=8;case 8:e.trys.push([8,11,,12]);return[4,Promise.all((f?this.getChildrenByBounds(f):this.children).map(function(n){return function(){return Object(v[\"a\"])(this,void 0,void 0,function(){var t;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:t={oct:n.octantNumber};return[4,n.getNodes(c,l,f)];case 1:return[2,(t.res=e.sent(),t)]}})})}()}))];case 9:s=e.sent();s=s.filter(function(e){return e.res&&e.res.length});a=s.map(function(e){return e.oct});return[4,T(this.path,n,i)];case 10:u=e.sent();return[2,s.map(function(e){return e.res}).reduce(function(e,t){return e.concat(t)},[{box:this,node:u,octantsToExclude:a}])];case 11:o=e.sent();console.error(o);return[3,12];case 12:return[2,null]}})})};f.searchByPoint=function(u,o,c,l){return Object(v[\"a\"])(this,void 0,void 0,function(){function s(i){return Object(v[\"a\"])(this,void 0,void 0,function(){var t,n,r;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:if(i.level>c)return[2];e.label=1;case 1:e.trys.push([1,4,,5]);return[4,i.indexValid(l)];case 2:t=e.sent();if(!t)return[2];if(i.level===c)a.push(i);n=i.getChildrenByPoint(u,o);return[4,Promise.all(n.map(function(e){return s(e)}))];case 3:e.sent();return[3,5];case 4:r=e.sent();console.error(r);return[2];case 5:return[2]}})})}var t,a;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:if(c<2)return[2,[]];if(!!l)return[3,2];return[4,P()];case 1:t=e.sent();l=t.bulkMetadataEpoch[0];e.label=2;case 2:a=[];return[4,Promise.all(f.Root.getChildrenByPoint(u,o).map(function(e){return s(e)}))];case 3:e.sent();return[2,a]}})})};f.searchByBounds=function(u,o,c){return Object(v[\"a\"])(this,void 0,void 0,function(){function s(i){return Object(v[\"a\"])(this,void 0,void 0,function(){var t,n,r;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:if(i.level>o)return[2];e.label=1;case 1:e.trys.push([1,4,,5]);return[4,i.indexValid(c)];case 2:t=e.sent();if(!t)return[2];if(i.level===o)a.push(i);n=i.getChildrenByBounds(u);return[4,Promise.all(n.map(function(e){return s(e)}))];case 3:e.sent();return[3,5];case 4:r=e.sent();console.error(r);return[2];case 5:return[2]}})})}var t,a;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:if(!u||u.IsEmpty||o<2)return[2,[]];if(!!c)return[3,2];return[4,P()];case 1:t=e.sent();c=t.bulkMetadataEpoch[0];e.label=2;case 2:a=[];return[4,Promise.all(f.Root.getChildrenByBounds(u).map(function(e){return s(e)}))];case 3:e.sent();return[2,a]}})})};f.Root=new f(\"\",0,MapDrawing.BoundsLatLng.fromValues(-90,-180,90,180),[new f(\"02\",2,MapDrawing.BoundsLatLng.fromValues(-90,-180,0,-90)),new f(\"03\",3,MapDrawing.BoundsLatLng.fromValues(-90,-90,0,0)),new f(\"12\",2,MapDrawing.BoundsLatLng.fromValues(-90,0,0,90)),new f(\"13\",3,MapDrawing.BoundsLatLng.fromValues(-90,90,0,180)),new f(\"20\",0,MapDrawing.BoundsLatLng.fromValues(0,-180,90,-90)),new f(\"21\",1,MapDrawing.BoundsLatLng.fromValues(0,-90,90,0)),new f(\"30\",0,MapDrawing.BoundsLatLng.fromValues(0,0,90,90)),new f(\"31\",1,MapDrawing.BoundsLatLng.fromValues(0,90,90,180))]);return f}();var z=function(){function e(e,t,n){if(e===void 0){e=256}if(t===void 0){t=256}this.maxAnisotropy=1;this._matrix=new u[\"Matrix4\"];this.p=new u[\"Vector3\"];this.bd=new u[\"Box3\"];this.orderQueue=[];this._animFrame=0;this.isPaused=false;this.renderWidth=this.initRenderWidth=e;this.renderHeight=this.initRenderHeight=t;this.initialize().then(function(){if(n)n()}).catch(function(e){console.log(e)})}e.prototype.setRenderSize=function(e,t){this.renderWidth=e;this.renderHeight=t;if(this.renderer){this.renderer.setSize(this.renderWidth,this.renderHeight)}};e.prototype.request=function(t){var n=this;if(this._isdisposed||!t)return;this.load(t).then(function(e){if(!n._isdisposed&&e)n.orderQueue.push(e)}).catch(function(e){console.log(e);if(t.callBack)t.callBack(false)})};e.prototype.requestRender=function(e,t,r,n,i,s){if(this._isdisposed||!e||!r)return;this.request({bounds:e,level:t,beforeRender:function(){return!!r()},drawFn:function(e){var t=r(),n=t&&t.getContext(\"2d\");if(n)n.drawImage(e,0,0)},callBack:n,renderWidth:i,renderHeight:s})};e.prototype.initialize=function(){return Object(v[\"a\"])(this,void 0,void 0,function(){var t,n,r,i,s,a;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:return[4,P()];case 1:t=e.sent();this.rootEpoch=t.bulkMetadataEpoch[0];n=this.scene=new u[\"Scene\"],r=this.root=new u[\"Object3D\"];n.add(r);i=this.camera=new u[\"OrthographicCamera\"](-100,100,100,-100,1,1e4);i.position.set(0,0,5e3);s=this.canvas=document.createElement(\"canvas\");a=this.renderer=new u[\"WebGLRenderer\"]({preserveDrawingBuffer:true,alpha:false,antialias:false,canvas:s});a.sortObjects=false;a.shadowMap.enabled=false;a.setClearColor(new u[\"Color\"](16777215));a.setSize(this.renderWidth,this.renderHeight);this.maxAnisotropy=a.capabilities.getMaxAnisotropy();this._animFrame=requestAnimationFrame(this.frameUpdate.bind(this));return[2]}})})};e.prototype.frameUpdate=function(){if(this._isdisposed)return;if(this._stop&&!this.orderQueue.length){this._isdisposed=true;return}this._animFrame=requestAnimationFrame(this.frameUpdate.bind(this));this.render()};e.prototype.load=function(i){return Object(v[\"a\"])(this,void 0,void 0,function(){var t,a,u,o,c,n,r;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:if(this._isdisposed||!i||!i.level||i.level<2)return[2,null];t=i.level,a=i.bounds,u=t>19?Math.max(21,t):t,o=this.rootEpoch,c=i.depthMaterial;if(t>19)t=19;return[4,N.searchByBounds(a,t,o)];case 1:n=e.sent();return[4,Promise.all(n.map(function(s){return function(){return Object(v[\"a\"])(this,void 0,void 0,function(){var t,n,r,i;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:return[4,s.getNodes(u,o,a)];case 1:t=e.sent();if(t){n=[];for(r=t.length;r--;){i=t[r];n.push.apply(n,spt.ThreeJs.utils.generateMeshesFromNodeData(i.node,i.box,i.octantsToExclude,c))}return[2,n]}return[2,[]]}})})}()}))];case 2:r=e.sent();i.meshes=r.reduce(function(e,t){return e.concat(t)},[]);i.maxLevel=i.meshes.reduce(function(e,t){return Math.max(e,+(t.userData.level||0))},0);return[2,i]}})})};e.prototype.setup=function(e){if(this._isdisposed||!e.bounds||!e.meshes||!e.meshes.length)return false;var t=e.bounds,n=e.meshes,r=e.renderWidth,i=e.renderHeight,s=t.Center,a=t.Size,u=a.X*.5,o=a.Y*.5,c=this,l=c.camera,f=c.root,h=c.p,d=c.bd,b=spt.ThreeJs.utils.latLngToMatrix4(s.Latitude,s.Longitude,this._matrix);if(e.drawFn&&(r&&this.renderWidth!==r||i&&this.renderHeight!==i))this.setRenderSize(r||256,i||256);n.forEach(function(e){e.applyMatrix4(b);d.expandByPoint(h.set(0,0,0).applyMatrix4(e.matrix));d.expandByPoint(h.set(256,256,256).applyMatrix4(e.matrix));f.add(e)});l.left=-u;l.right=u;l.top=o;l.bottom=-o;l.updateProjectionMatrix();return true};e.prototype.clearScene=function(){var e=this.root,t=e.children.slice();for(var n=t.length;n--;){e.remove(t[n])}};e.prototype.render=function(){if(this._isdisposed||!this.orderQueue.length)return;var e=this.orderQueue.shift();if(this.setup(e)){if((!e.beforeRender||e.beforeRender())&&e.drawFn){this.root.position.set(0,0,-this.bd.min.z);var t=this.renderer;t.render(this.scene,this.camera);e.drawFn(t.domElement,this.renderer.getContext(),e)}this.clearScene()}if(e.callBack)e.callBack(true,e)};e.prototype.pause=function(){this.isPaused=true;if(this._animFrame){cancelAnimationFrame(this._animFrame);this._animFrame=0}};e.prototype.unpause=function(){this.isPaused=false;if(!this._animFrame)this._animFrame=requestAnimationFrame(this.frameUpdate.bind(this))};e.prototype.stop=function(){if(this.isPaused)this.unpause();this._stop=true};e.prototype.dispose=function(){this._isdisposed=true;delete this.orderQueue};return e}();function S(o,i){return Object(v[\"a\"])(this,void 0,Promise,function(){var a,t,u,n,r;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:a=i>19?Math.max(21,i):i;if(i>19)i=19;return[4,P()];case 1:t=e.sent(),u=t.bulkMetadataEpoch[0];return[4,N.searchByBounds(o,i,u)];case 2:n=e.sent();return[4,Promise.all(n.map(function(s){return function(){return Object(v[\"a\"])(this,void 0,void 0,function(){var t,n,r,i;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:return[4,s.getNodes(a,u,o)];case 1:t=e.sent();if(t){n=[];for(r=t.length;r--;){i=t[r];n.push.apply(n,spt.ThreeJs.utils.generateMeshesFromNodeData(i.node,i.box,i.octantsToExclude))}return[2,n]}return[2,[]]}})})}()}))];case 3:r=e.sent();return[2,r.reduce(function(e,t){return e.concat(t)},[])]}})})}function W(l,f,h,d,b,p){return Object(v[\"a\"])(this,void 0,void 0,function(){var t,n,u,r,o,i,s,a,i,c;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:if(f<13)f=13;if(f>19)f=19;if(h23)h=23;t=MapDrawing.BoundsLatLng.FromCenterAndZoom(l,f,d,d);return[4,P()];case 1:n=e.sent(),u=n.bulkMetadataEpoch[0];return[4,N.searchByBounds(t,f,u)];case 2:r=e.sent(),o=[];if(p&&!t.IsInside(p))p=null;for(i=0;i<=h;i++){if(i>=f){s=MapDrawing.BoundsLatLng.FromCenterAndZoom(l,i,d,d);if(p)s.Expand(p);o[i]=s}else o[i]=t}a=function(a){var t,n;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:return[4,Promise.all(r.map(function(s){return function(){return Object(v[\"a\"])(this,void 0,void 0,function(){var t,n,r,i;return Object(v[\"b\"])(this,function(e){switch(e.label){case 0:return[4,s.getNodes(a,u,o)];case 1:t=e.sent();if(t){n=[];for(r=t.length;r--;){i=t[r];n.push.apply(n,spt.ThreeJs.utils.generateMeshesFromNodeData(i.node,i.box,i.octantsToExclude))}return[2,n]}return[2,[]]}})})}()}))];case 1:t=e.sent();n=t.reduce(function(e,t){return e.concat(t)},[]);if(!n.length||!b(n,a))return[2,\"break\"];return[2]}})};i=f;e.label=3;case 3:if(!(i<=h))return[3,6];return[5,a(i)];case 4:c=e.sent();if(c===\"break\")return[3,6];e.label=5;case 5:i++;return[3,3];case 6:return[2]}})})}function H(e,t,n,r){S(e,t).then(n).catch(function(e){if(r)r(e)})}function q(e,t,n,r,i,s,a){W(e,t,n,r,i,a).catch(function(e){if(s)s(e)})}}});"]}