maze-test 0.1.0 → 0.2.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (14) hide show
  1. package/README.md +104 -10
  2. package/dist/cli.cjs +1368 -0
  3. package/dist/cli.cjs.map +1 -0
  4. package/dist/cli.d.cts +1 -0
  5. package/dist/cli.d.ts +1 -0
  6. package/dist/cli.js +1345 -0
  7. package/dist/cli.js.map +1 -0
  8. package/dist/index.cjs +1262 -2
  9. package/dist/index.cjs.map +1 -1
  10. package/dist/index.d.cts +220 -2
  11. package/dist/index.d.ts +220 -2
  12. package/dist/index.js +1238 -1
  13. package/dist/index.js.map +1 -1
  14. package/package.json +14 -4
package/dist/cli.js.map ADDED
@@ -0,0 +1 @@
1
+ {"version":3,"sources":["../src/cli.ts","../src/coordinates.ts","../src/maze.ts","../src/simulator.ts","../src/trial.ts"],"sourcesContent":["#!/usr/bin/env node\n\nimport process from \"node:process\";\nimport { generateTrial } from \"./trial.js\";\nimport type { Language, ScenarioKind, TrialOptions } from \"./types.js\";\n\nconst VERSION = \"0.2.0\";\n\ntype Command = \"question\" | \"answer\";\ntype OutputFormat = \"text\" | \"json\";\n\ninterface CliOptions {\n command: Command;\n format: OutputFormat;\n trial: TrialOptions;\n}\n\ntry {\n const parsed = parseArguments(process.argv.slice(2));\n if (parsed === \"help\") {\n process.stdout.write(helpText());\n } else if (parsed === \"version\") {\n process.stdout.write(`${VERSION}\\n`);\n } else {\n const trial = generateTrial(parsed.trial);\n if (parsed.format === \"text\") {\n process.stdout.write(parsed.command === \"question\" ? trial.question : trial.answer);\n } else if (parsed.command === \"question\") {\n process.stdout.write(\n `${JSON.stringify(\n {\n schemaVersion: trial.schemaVersion,\n kind: \"question\",\n options: trial.options,\n maze: {\n id: trial.maze.id,\n requestedSeed: trial.maze.requestedSeed,\n effectiveSeed: trial.maze.seed,\n metrics: trial.maze.metrics\n },\n sections: trial.sections,\n question: trial.question\n },\n null,\n 2\n )}\\n`\n );\n } else {\n process.stdout.write(\n `${JSON.stringify(\n {\n schemaVersion: trial.schemaVersion,\n kind: \"answer\",\n options: trial.options,\n maze: {\n id: trial.maze.id,\n requestedSeed: trial.maze.requestedSeed,\n effectiveSeed: trial.maze.seed\n },\n answers: trial.result.answers,\n actionCount: trial.actions.length,\n answer: trial.answer\n },\n null,\n 2\n )}\\n`\n );\n }\n }\n} catch (error) {\n const message = error instanceof Error ? error.message : String(error);\n process.stderr.write(`maze-test: ${message}\\nRun \"maze-test --help\" for usage.\\n`);\n process.exitCode = 1;\n}\n\nfunction parseArguments(args: string[]): CliOptions | \"help\" | \"version\" {\n const values = [...args];\n let command: Command = \"question\";\n const first = values[0];\n if (first && !first.startsWith(\"-\")) {\n values.shift();\n if (first === \"question\" || first === \"q\") command = \"question\";\n else if (first === \"answer\" || first === \"a\") command = \"answer\";\n else throw new Error(`Unknown command: ${first}`);\n }\n\n const trial: TrialOptions = {};\n let format: OutputFormat = \"text\";\n for (let index = 0; index < values.length; index += 1) {\n const raw = values[index];\n if (!raw) continue;\n const equalIndex = raw.indexOf(\"=\");\n const flag = equalIndex >= 0 ? raw.slice(0, equalIndex) : raw;\n const inline = equalIndex >= 0 ? raw.slice(equalIndex + 1) : undefined;\n if (flag === \"--help\" || flag === \"-h\") return \"help\";\n if (flag === \"--version\" || flag === \"-v\") return \"version\";\n if (flag === \"--json\") {\n format = \"json\";\n continue;\n }\n const value = inline ?? values[++index];\n if (value === undefined) throw new Error(`Missing value for ${flag}.`);\n switch (flag) {\n case \"--seed\":\n trial.seed = parseInteger(value, flag);\n break;\n case \"--rows\":\n trial.rows = parseInteger(value, flag);\n break;\n case \"--cols\":\n trial.cols = parseInteger(value, flag);\n break;\n case \"--braid\":\n trial.braid = parseNumber(value, flag);\n break;\n case \"--doors\":\n trial.doorCount = parseInteger(value, flag);\n break;\n case \"--chests\":\n trial.chestCount = parseInteger(value, flag);\n break;\n case \"--traps\":\n trial.trapCount = parseInteger(value, flag);\n break;\n case \"--medicines\":\n trial.medicineCount = parseInteger(value, flag);\n break;\n case \"--scenario\":\n trial.scenario = value as ScenarioKind;\n break;\n case \"--lang\":\n case \"--language\":\n trial.language = value as Language;\n break;\n case \"--style\":\n trial.style = parseInteger(value, flag);\n break;\n case \"--min-distance\":\n trial.minDistance = parseInteger(value, flag);\n break;\n case \"--max-attempts\":\n trial.maxAttempts = parseInteger(value, flag);\n break;\n case \"--format\":\n if (value !== \"text\" && value !== \"json\") throw new Error(`Invalid format: ${value}`);\n format = value;\n break;\n default:\n throw new Error(`Unknown option: ${flag}`);\n }\n }\n return { command, format, trial };\n}\n\nfunction parseInteger(value: string, flag: string): number {\n if (!/^-?\\d+$/u.test(value)) throw new Error(`${flag} requires an integer.`);\n return Number(value);\n}\n\nfunction parseNumber(value: string, flag: string): number {\n const parsed = Number(value);\n if (!Number.isFinite(parsed)) throw new Error(`${flag} requires a number.`);\n return parsed;\n}\n\nfunction helpText(): string {\n return `maze-test ${VERSION}\n\nGenerate a deterministic maze question or its answer key.\n\nUsage:\n maze-test [question] [options]\n maze-test answer [options]\n\nCommands:\n question, q Generate the question (default)\n answer, a Generate the matching answer key\n\nOptions:\n --seed <integer> Root seed (default: 1)\n --rows <odd integer> Number of rows (default: 15)\n --cols <odd integer> Number of columns (default: 15)\n --braid <0..1> Chance to remove a dead end (default: 0)\n --doors <integer> Number of doors and keys (default: 1)\n --chests <integer> Number of chests (default: 2)\n --traps <integer> Number of traps (default: 2)\n --medicines <integer> Number of medicine rooms (default: 2)\n --scenario <name> success | treasure-and-leave | death-and-stop\n (default: success)\n --lang <language> en | zh (default: en)\n --style <integer> Deterministic wording variation (default: 0)\n --min-distance <integer> Minimum entry-to-goal distance (default: 0)\n --max-attempts <integer> Deterministic search limit (default: 500)\n --format <format> text | json (default: text)\n --json Alias for --format json\n -h, --help Show help\n -v, --version Show version\n\nExamples:\n npx maze-test question --seed 42 --rows 15 --cols 15\n npx maze-test answer --seed 42 --rows 15 --cols 15\n npx maze-test question --seed 42 --lang zh\n npx maze-test answer --seed 42 --format json\n`;\n}\n","import type { Cell } from \"./types.js\";\n\nexport function cell(row: number, col: number): Cell {\n return { row, col };\n}\n\nexport function cellKey(value: Cell): string {\n return `${value.row},${value.col}`;\n}\n\nexport function sameCell(a: Cell | undefined, b: Cell | undefined): boolean {\n return a?.row === b?.row && a?.col === b?.col;\n}\n\nexport function columnLabel(col: number): string {\n if (!Number.isInteger(col) || col < 1) throw new Error(`Invalid column number: ${col}`);\n let value = col;\n let label = \"\";\n while (value > 0) {\n value -= 1;\n label = String.fromCharCode(65 + (value % 26)) + label;\n value = Math.floor(value / 26);\n }\n return label;\n}\n\nexport function letterNumberCoordinate(value: Cell): string {\n return `${columnLabel(value.col)}${value.row}`;\n}\n\nexport function rowColumnCoordinate(value: Cell): string {\n return `第${value.row}行第${value.col}格`;\n}\n\nexport function neighbors(value: Cell, rows: number, cols: number): Cell[] {\n return [\n cell(value.row - 1, value.col),\n cell(value.row + 1, value.col),\n cell(value.row, value.col - 1),\n cell(value.row, value.col + 1)\n ].filter((item) => item.row >= 1 && item.row <= rows && item.col >= 1 && item.col <= cols);\n}\n","import { cell, cellKey, neighbors, sameCell } from \"./coordinates.js\";\nimport type {\n Cell,\n ChestObject,\n DecorateMazeOptions,\n GenerateMazeOptions,\n KeyObject,\n Maze,\n MazeMetrics,\n MazeObject,\n MazeValidation,\n MedicineObject,\n TrapObject\n} from \"./types.js\";\n\nexport function generateSolidCellMaze(options: GenerateMazeOptions = {}): Maze {\n const rows = oddDimension(options.rows ?? 15, \"rows\");\n const cols = oddDimension(options.cols ?? 15, \"cols\");\n const seed = integerOption(options.seed ?? 1, \"seed\", 0);\n const requestedSeed = integerOption(options.requestedSeed ?? seed, \"requestedSeed\", 0);\n const braid = numberOption(options.braid ?? 0, \"braid\", 0, 1);\n const rng = mulberry32(seed);\n const grid = Array.from({ length: rows }, () => Array<string>(cols).fill(\"#\"));\n const logicalCells: Cell[] = [];\n\n for (let row = 1; row < rows - 1; row += 2) {\n for (let col = 1; col < cols - 1; col += 2) logicalCells.push({ row, col });\n }\n\n const start = logicalCells[randomInt(rng, logicalCells.length)];\n if (!start) throw new Error(\"The maze has no logical cells.\");\n const visited = new Set([cellKey(start)]);\n const stack = [start];\n grid[start.row]![start.col] = \".\";\n\n while (stack.length > 0) {\n const current = stack.at(-1);\n if (!current) break;\n const choices = shuffle(\n rng,\n logicalNeighbors(current, rows, cols).filter((item) => !visited.has(cellKey(item)))\n );\n const next = choices[0];\n if (!next) {\n stack.pop();\n continue;\n }\n grid[(current.row + next.row) / 2]![(current.col + next.col) / 2] = \".\";\n grid[next.row]![next.col] = \".\";\n visited.add(cellKey(next));\n stack.push(next);\n }\n\n braidDeadEnds(grid, braid, rng);\n const terrain = grid.map((row) => row.join(\"\"));\n const first = farthestFloor(cell(2, 2), terrain).cell;\n const second = farthestFloor(first, terrain).cell;\n const maze: Maze = {\n schemaVersion: \"solid-cell-maze-v3@1\",\n id: options.id ?? `solid-maze-${rows}x${cols}-${requestedSeed}`,\n seed,\n requestedSeed,\n rows,\n cols,\n braid,\n coordinateSystem: {\n origin: \"top-left\",\n columns: \"letters-left-to-right\",\n rows: \"numbers-top-to-bottom\"\n },\n terrain,\n entry: first,\n goal: second,\n doors: [],\n objects: [],\n metrics: emptyMetrics(rows, cols)\n };\n maze.metrics = analyzeSolidCellMaze(maze);\n return maze;\n}\n\nexport function decorateSolidCellMaze(maze: Maze, options: DecorateMazeOptions = {}): Maze {\n const result = structuredClone(maze);\n const decorationSeed = integerOption(options.seed ?? maze.seed + 71_311, \"decoration seed\", 0);\n const rng = mulberry32(decorationSeed);\n const mainPath = shortestPath(result, result.entry, result.goal);\n const occupied = new Set([cellKey(result.entry), cellKey(result.goal)]);\n const doorCount = integerOption(\n options.doorCount ?? Math.max(1, Math.floor(result.metrics.floorCells / 120)),\n \"doorCount\",\n 0\n );\n const chestCount = integerOption(options.chestCount ?? 2, \"chestCount\", 0);\n const trapCount = integerOption(options.trapCount ?? 2, \"trapCount\", 0);\n const medicineCount = integerOption(options.medicineCount ?? 2, \"medicineCount\", 0);\n const doorIndices = selectGatingDoorIndices(result, mainPath, doorCount);\n\n result.doors = doorIndices.map((index, doorIndex) => {\n const position = mainPath[index];\n if (!position) throw new Error(`No path cell exists at door index ${index}.`);\n occupied.add(cellKey(position));\n return { id: `door-${doorIndex + 1}`, position, state: \"closed\" as const };\n });\n\n const objects: MazeObject[] = [];\n for (let index = 0; index < result.doors.length; index += 1) {\n const doorIndex = doorIndices[index];\n if (doorIndex === undefined) throw new Error(\"Door index mismatch.\");\n const preferredIndex = Math.max(1, Math.floor(doorIndex * 0.55));\n const position = freePathCellBefore(mainPath, preferredIndex, occupied);\n occupied.add(cellKey(position));\n const key: KeyObject = { id: `key-${index + 1}`, type: \"key\", position };\n objects.push(key);\n }\n\n const degrees = degreeMap(result);\n const deadEnds = shuffle(\n rng,\n floorCells(result).filter(\n (item) => degrees.get(cellKey(item)) === 1 && !occupied.has(cellKey(item))\n )\n );\n\n for (let index = 0; index < chestCount; index += 1) {\n const position = takeFree(deadEnds, result, occupied, rng, \"chest\");\n occupied.add(cellKey(position));\n const chest: ChestObject = {\n id: `chest-${index + 1}`,\n type: \"chest\",\n position,\n treasures: 1 + (index % 3)\n };\n objects.push(chest);\n }\n\n const trapCandidates = shuffle(rng, mainPath.slice(2, -2));\n for (let index = 0; index < trapCount; index += 1) {\n const position = takeFree(trapCandidates, result, occupied, rng, \"trap\");\n occupied.add(cellKey(position));\n const trap: TrapObject = {\n id: `trap-${index + 1}`,\n type: \"trap\",\n position,\n damage: 1\n };\n objects.push(trap);\n }\n\n const medicineCandidates = shuffle(rng, floorCells(result));\n for (let index = 0; index < medicineCount; index += 1) {\n const position = takeFree(medicineCandidates, result, occupied, rng, \"medicine\");\n occupied.add(cellKey(position));\n const medicine: MedicineObject = {\n id: `medicine-${index + 1}`,\n type: \"medicine\",\n position,\n recovery: 1\n };\n objects.push(medicine);\n }\n\n result.objects = objects;\n result.metrics = analyzeSolidCellMaze(result);\n return result;\n}\n\nexport function analyzeSolidCellMaze(maze: Maze): MazeMetrics {\n assertShape(maze);\n const floors = floorCells(maze);\n const graph = adjacency(maze);\n const distances = bfsDistances(maze.entry, graph);\n const degreeValues = [...graph.values()].map((items) => items.length);\n const edgeCount = degreeValues.reduce((sum, value) => sum + value, 0) / 2;\n const mainPath = shortestPath(maze, maze.entry, maze.goal);\n const objectCounts: Partial<Record<MazeObject[\"type\"], number>> = {};\n for (const object of maze.objects ?? []) {\n objectCounts[object.type] = (objectCounts[object.type] ?? 0) + 1;\n }\n return {\n totalCells: maze.rows * maze.cols,\n wallCells: maze.rows * maze.cols - floors.length,\n floorCells: floors.length,\n connectedFloorCells: distances.size,\n connected: distances.size === floors.length,\n floorAdjacencyEdges: edgeCount,\n independentCycles: edgeCount - floors.length + 1,\n deadEnds: degreeValues.filter((value) => value === 1).length,\n junctions: degreeValues.filter((value) => value >= 3).length,\n entryGoalDistance: mainPath.length > 0 ? mainPath.length - 1 : null,\n doorCount: maze.doors.length,\n gatingDoorCount: maze.doors.filter(\n (door) => shortestPath(maze, maze.entry, maze.goal, door.position).length === 0\n ).length,\n objectCounts\n };\n}\n\nexport function validateSolidCellMaze(maze: Maze): MazeValidation {\n const errors: string[] = [];\n try {\n assertShape(maze);\n } catch (error) {\n return {\n valid: false,\n errors: [error instanceof Error ? error.message : String(error)],\n metrics: null\n };\n }\n\n for (let row = 1; row <= maze.rows; row += 1) {\n for (let col = 1; col <= maze.cols; col += 1) {\n const value = terrainAt(maze, cell(row, col));\n if (value !== \"#\" && value !== \".\") errors.push(`Invalid terrain at ${row},${col}: ${value}`);\n if (\n (row === 1 || row === maze.rows || col === 1 || col === maze.cols) &&\n value !== \"#\"\n ) {\n errors.push(`The outer boundary is not a wall at ${row},${col}.`);\n }\n }\n }\n\n if (!isFloor(maze, maze.entry)) errors.push(\"The entry is not on a floor cell.\");\n if (!isFloor(maze, maze.goal)) errors.push(\"The goal is not on a floor cell.\");\n if (sameCell(maze.entry, maze.goal)) errors.push(\"The entry and goal overlap.\");\n const occupied = new Set([cellKey(maze.entry), cellKey(maze.goal)]);\n\n for (const door of maze.doors) {\n if (!isFloor(maze, door.position)) errors.push(`${door.id} is not on a floor cell.`);\n const key = cellKey(door.position);\n if (occupied.has(key)) errors.push(`${door.id} overlaps another feature.`);\n occupied.add(key);\n }\n for (const object of maze.objects) {\n if (!isFloor(maze, object.position)) errors.push(`${object.id} is not on a floor cell.`);\n const key = cellKey(object.position);\n if (occupied.has(key)) errors.push(`${object.id} overlaps another feature.`);\n occupied.add(key);\n }\n\n const metrics = analyzeSolidCellMaze(maze);\n if (!metrics.connected) {\n errors.push(`Floor cells are disconnected: ${metrics.connectedFloorCells}/${metrics.floorCells}.`);\n }\n if (metrics.deadEnds === 0) errors.push(\"The maze has no dead ends.\");\n if (metrics.junctions === 0) errors.push(\"The maze has no junctions.\");\n if (metrics.gatingDoorCount !== metrics.doorCount) {\n errors.push(`${metrics.doorCount - metrics.gatingDoorCount} door(s) can be bypassed.`);\n }\n\n const path = shortestPath(maze, maze.entry, maze.goal);\n const pathIndex = new Map(path.map((item, index) => [cellKey(item), index]));\n for (let index = 0; index < maze.doors.length; index += 1) {\n const door = maze.doors[index];\n if (!door) continue;\n const key = maze.objects.find((item) => item.id === `key-${index + 1}`);\n const doorIndex = pathIndex.get(cellKey(door.position));\n const keyIndex = key ? pathIndex.get(cellKey(key.position)) : undefined;\n if (!key) errors.push(`Missing a key for ${door.id}.`);\n else if (keyIndex === undefined || doorIndex === undefined || keyIndex >= doorIndex) {\n errors.push(`${key.id} is not before ${door.id} on the main path.`);\n }\n }\n return { valid: errors.length === 0, errors, metrics };\n}\n\nexport function shortestPath(\n maze: Pick<Maze, \"rows\" | \"cols\" | \"terrain\">,\n start: Cell,\n goal: Cell,\n excludedCell: Cell | null = null\n): Cell[] {\n if (excludedCell && (sameCell(start, excludedCell) || sameCell(goal, excludedCell))) return [];\n const graph = adjacency(maze, excludedCell);\n const queue = [start];\n const parent = new Map<string, string | null>([[cellKey(start), null]]);\n const values = new Map([[cellKey(start), start]]);\n let queueIndex = 0;\n while (queueIndex < queue.length) {\n const current = queue[queueIndex];\n queueIndex += 1;\n if (!current) break;\n if (sameCell(current, goal)) break;\n for (const next of graph.get(cellKey(current)) ?? []) {\n const key = cellKey(next);\n if (parent.has(key)) continue;\n parent.set(key, cellKey(current));\n values.set(key, next);\n queue.push(next);\n }\n }\n if (!parent.has(cellKey(goal))) return [];\n const path: Cell[] = [];\n let cursor: string | null = cellKey(goal);\n while (cursor !== null) {\n const value = values.get(cursor);\n if (!value) throw new Error(`Could not reconstruct path at ${cursor}.`);\n path.push(value);\n cursor = parent.get(cursor) ?? null;\n }\n return path.reverse();\n}\n\nexport function terrainAt(\n maze: Pick<Maze, \"rows\" | \"cols\" | \"terrain\">,\n value: Cell\n): string | null {\n if (value.row < 1 || value.row > maze.rows || value.col < 1 || value.col > maze.cols) {\n return null;\n }\n return maze.terrain[value.row - 1]?.[value.col - 1] ?? null;\n}\n\nexport function isFloor(maze: Pick<Maze, \"rows\" | \"cols\" | \"terrain\">, value: Cell): boolean {\n return terrainAt(maze, value) === \".\";\n}\n\nfunction braidDeadEnds(grid: string[][], braid: number, rng: () => number): void {\n if (braid <= 0) return;\n const rows = grid.length;\n const cols = grid[0]?.length ?? 0;\n const logicalCells: Cell[] = [];\n for (let row = 1; row < rows - 1; row += 2) {\n for (let col = 1; col < cols - 1; col += 2) logicalCells.push({ row, col });\n }\n const deadEnds = shuffle(\n rng,\n logicalCells.filter((value) => openLogicalNeighbors(grid, value).length === 1)\n );\n for (const current of deadEnds) {\n if (rng() > braid) continue;\n const closed = shuffle(\n rng,\n logicalNeighbors(current, rows, cols).filter(\n (next) => grid[(current.row + next.row) / 2]?.[(current.col + next.col) / 2] === \"#\"\n )\n );\n const next = closed[0];\n if (!next) continue;\n grid[(current.row + next.row) / 2]![(current.col + next.col) / 2] = \".\";\n }\n}\n\nfunction openLogicalNeighbors(grid: string[][], current: Cell): Cell[] {\n return logicalNeighbors(current, grid.length, grid[0]?.length ?? 0).filter(\n (next) => grid[(current.row + next.row) / 2]?.[(current.col + next.col) / 2] === \".\"\n );\n}\n\nfunction logicalNeighbors(value: Cell, rows: number, cols: number): Cell[] {\n return [\n { row: value.row - 2, col: value.col },\n { row: value.row + 2, col: value.col },\n { row: value.row, col: value.col - 2 },\n { row: value.row, col: value.col + 2 }\n ].filter((item) => item.row >= 1 && item.row < rows - 1 && item.col >= 1 && item.col < cols - 1);\n}\n\nfunction farthestFloor(start: Cell, terrain: string[]): { cell: Cell; distance: number } {\n const maze = { rows: terrain.length, cols: terrain[0]?.length ?? 0, terrain };\n const graph = adjacency(maze);\n const distances = bfsDistances(start, graph);\n let farthest = start;\n let distance = -1;\n for (const [key, value] of distances) {\n if (value <= distance) continue;\n distance = value;\n farthest = parseCellKey(key);\n }\n return { cell: farthest, distance };\n}\n\nfunction floorCells(maze: Pick<Maze, \"rows\" | \"cols\" | \"terrain\">): Cell[] {\n const values: Cell[] = [];\n for (let row = 1; row <= maze.rows; row += 1) {\n for (let col = 1; col <= maze.cols; col += 1) {\n if (isFloor(maze, cell(row, col))) values.push(cell(row, col));\n }\n }\n return values;\n}\n\nfunction adjacency(\n maze: Pick<Maze, \"rows\" | \"cols\" | \"terrain\">,\n excludedCell: Cell | null = null\n): Map<string, Cell[]> {\n const floors = floorCells(maze).filter((item) => !excludedCell || !sameCell(item, excludedCell));\n const floorKeys = new Set(floors.map(cellKey));\n return new Map(\n floors.map((item) => [\n cellKey(item),\n neighbors(item, maze.rows, maze.cols).filter((next) => floorKeys.has(cellKey(next)))\n ])\n );\n}\n\nfunction bfsDistances(start: Cell, graph: Map<string, Cell[]>): Map<string, number> {\n const distances = new Map([[cellKey(start), 0]]);\n const queue = [start];\n let queueIndex = 0;\n while (queueIndex < queue.length) {\n const current = queue[queueIndex];\n queueIndex += 1;\n if (!current) break;\n const distance = distances.get(cellKey(current));\n if (distance === undefined) continue;\n for (const next of graph.get(cellKey(current)) ?? []) {\n const key = cellKey(next);\n if (distances.has(key)) continue;\n distances.set(key, distance + 1);\n queue.push(next);\n }\n }\n return distances;\n}\n\nfunction degreeMap(maze: Maze): Map<string, number> {\n return new Map([...adjacency(maze)].map(([key, values]) => [key, values.length]));\n}\n\nfunction selectGatingDoorIndices(maze: Maze, mainPath: Cell[], count: number): number[] {\n if (count === 0) return [];\n const degrees = degreeMap(maze);\n const candidates: number[] = [];\n for (let index = 3; index < mainPath.length - 3; index += 1) {\n const pathCell = mainPath[index];\n if (!pathCell || (degrees.get(cellKey(pathCell)) ?? 0) !== 2) continue;\n if (shortestPath(maze, maze.entry, maze.goal, pathCell).length === 0) candidates.push(index);\n }\n if (candidates.length < count) {\n throw new Error(`Only ${candidates.length} non-bypassable path cells are available for ${count} doors.`);\n }\n const targets = spacedIndices(mainPath.length - 1, count, 0.28, 0.78);\n const selected: number[] = [];\n for (const target of targets) {\n const available = candidates.filter((index) => !selected.includes(index));\n available.sort(\n (left, right) => Math.abs(left - target) - Math.abs(right - target) || left - right\n );\n const candidate = available[0];\n if (candidate === undefined) throw new Error(`Could not place ${count} doors.`);\n selected.push(candidate);\n }\n if (selected.length !== count) throw new Error(`Could not space ${count} doors along the main path.`);\n return selected.sort((left, right) => left - right);\n}\n\nfunction freePathCellBefore(mainPath: Cell[], preferredIndex: number, occupied: Set<string>): Cell {\n for (let distance = 0; distance < mainPath.length; distance += 1) {\n for (const index of [preferredIndex - distance, preferredIndex + distance]) {\n if (index <= 0 || index >= mainPath.length - 1) continue;\n const candidate = mainPath[index];\n if (candidate && !occupied.has(cellKey(candidate))) return candidate;\n }\n }\n throw new Error(\"There is no free path cell on which to place a key.\");\n}\n\nfunction takeFree(\n candidates: Cell[],\n maze: Maze,\n occupied: Set<string>,\n rng: () => number,\n type: string\n): Cell {\n while (candidates.length > 0) {\n const value = candidates.shift();\n if (value && !occupied.has(cellKey(value))) return value;\n }\n const fallback = shuffle(rng, floorCells(maze)).find((item) => !occupied.has(cellKey(item)));\n if (!fallback) throw new Error(`There are not enough free floor cells to place ${type}.`);\n return fallback;\n}\n\nfunction spacedIndices(\n edgeCount: number,\n count: number,\n startRatio: number,\n endRatio: number\n): number[] {\n if (count === 0) return [];\n const values: number[] = [];\n for (let index = 0; index < count; index += 1) {\n const ratio =\n count === 1\n ? (startRatio + endRatio) / 2\n : startRatio + ((endRatio - startRatio) * index) / (count - 1);\n values.push(Math.max(2, Math.min(edgeCount - 2, Math.floor(edgeCount * ratio))));\n }\n return [...new Set(values)];\n}\n\nfunction parseCellKey(key: string): Cell {\n const [row, col] = key.split(\",\").map(Number);\n if (row === undefined || col === undefined) throw new Error(`Invalid cell key: ${key}`);\n return cell(row, col);\n}\n\nfunction assertShape(maze: Pick<Maze, \"rows\" | \"cols\" | \"terrain\">): void {\n oddDimension(maze.rows, \"rows\");\n oddDimension(maze.cols, \"cols\");\n if (!Array.isArray(maze.terrain) || maze.terrain.length !== maze.rows) {\n throw new Error(\"The terrain row count does not match rows.\");\n }\n if (maze.terrain.some((row) => typeof row !== \"string\" || row.length !== maze.cols)) {\n throw new Error(\"A terrain row does not match cols.\");\n }\n}\n\nfunction oddDimension(value: number, name: string): number {\n integerOption(value, name, 7);\n if (value % 2 === 0) throw new Error(`${name} must be odd.`);\n return value;\n}\n\nfunction integerOption(value: number, name: string, minimum: number): number {\n if (!Number.isInteger(value) || value < minimum) {\n throw new Error(`${name} must be an integer greater than or equal to ${minimum}.`);\n }\n return value;\n}\n\nfunction numberOption(value: number, name: string, minimum: number, maximum: number): number {\n if (!Number.isFinite(value) || value < minimum || value > maximum) {\n throw new Error(`${name} must be between ${minimum} and ${maximum}.`);\n }\n return value;\n}\n\nfunction randomInt(rng: () => number, maximum: number): number {\n return Math.floor(rng() * maximum);\n}\n\nfunction shuffle<T>(rng: () => number, input: readonly T[]): T[] {\n const values = [...input];\n for (let index = values.length - 1; index > 0; index -= 1) {\n const target = randomInt(rng, index + 1);\n const prior = values[index];\n const replacement = values[target];\n if (prior === undefined || replacement === undefined) continue;\n values[index] = replacement;\n values[target] = prior;\n }\n return values;\n}\n\nfunction mulberry32(seed: number): () => number {\n let value = seed >>> 0;\n return () => {\n value += 0x6d2b79f5;\n let mixed = value;\n mixed = Math.imul(mixed ^ (mixed >>> 15), mixed | 1);\n mixed ^= mixed + Math.imul(mixed ^ (mixed >>> 7), mixed | 61);\n return ((mixed ^ (mixed >>> 14)) >>> 0) / 4_294_967_296;\n };\n}\n\nfunction emptyMetrics(rows: number, cols: number): MazeMetrics {\n return {\n totalCells: rows * cols,\n wallCells: rows * cols,\n floorCells: 0,\n connectedFloorCells: 0,\n connected: false,\n floorAdjacencyEdges: 0,\n independentCycles: 0,\n deadEnds: 0,\n junctions: 0,\n entryGoalDistance: null,\n doorCount: 0,\n gatingDoorCount: 0,\n objectCounts: {}\n };\n}\n","import { cell, cellKey, letterNumberCoordinate, sameCell } from \"./coordinates.js\";\nimport { terrainAt } from \"./maze.js\";\nimport type {\n BlockedReason,\n Direction,\n InitialState,\n Maze,\n SimulationResult,\n TrialEvent,\n TrialState,\n TrialTraceItem\n} from \"./types.js\";\n\nconst DELTAS: Record<Direction, readonly [number, number]> = {\n up: [-1, 0],\n down: [1, 0],\n left: [0, -1],\n right: [0, 1]\n};\n\nexport function simulateTrial(\n maze: Maze,\n actions: readonly Direction[],\n initial: Partial<InitialState> = {}\n): SimulationResult {\n const health = initial.health ?? 5;\n const state: TrialState = {\n position: structuredClone(maze.entry),\n health,\n healthMax: initial.healthMax ?? health,\n keys: initial.keys ?? 0,\n treasures: initial.treasures ?? 0,\n alive: health > 0,\n reachedGoal: false,\n openedDoors: [],\n collectedKeys: [],\n openedChests: [],\n triggeredTraps: [],\n usedMedicines: []\n };\n const trace: TrialTraceItem[] = [];\n for (let index = 0; index < actions.length; index += 1) {\n const direction = actions[index];\n if (!direction) continue;\n trace.push(executeStep(maze, state, direction, index + 1));\n }\n return {\n state: structuredClone(state),\n trace,\n answers: {\n finalPosition: letterNumberCoordinate(state.position),\n keys: state.keys,\n treasures: state.treasures,\n health: state.health,\n alive: state.alive,\n reachedGoal: state.reachedGoal,\n openedDoors: state.openedDoors.length,\n openedChests: state.openedChests.length,\n triggeredTraps: state.triggeredTraps.length,\n usedMedicines: state.usedMedicines.length,\n blockedMoves: trace.filter((item) => !item.moved).length,\n blockedAfterDeath: trace.filter((item) => item.reason === \"dead\").length\n }\n };\n}\n\nfunction executeStep(\n maze: Maze,\n state: TrialState,\n direction: Direction,\n step: number\n): TrialTraceItem {\n const before = structuredClone(state);\n const events: TrialEvent[] = [];\n if (!state.alive) return record(step, direction, before, state, false, \"dead\", events);\n\n const [dr, dc] = DELTAS[direction];\n const target = cell(state.position.row + dr, state.position.col + dc);\n if (terrainAt(maze, target) !== \".\") {\n return record(step, direction, before, state, false, \"wall-or-outside\", events);\n }\n\n const door = maze.doors.find((item) => sameCell(item.position, target));\n if (door && !state.openedDoors.includes(door.id)) {\n if (state.keys <= 0) {\n return record(\n step,\n direction,\n before,\n state,\n false,\n \"closed-door-without-key\",\n events\n );\n }\n state.keys -= 1;\n state.openedDoors.push(door.id);\n events.push({ type: \"open-door\", id: door.id, keyCost: 1 });\n }\n\n state.position = target;\n const object = maze.objects.find((item) => sameCell(item.position, target));\n if (object?.type === \"key\" && !state.collectedKeys.includes(object.id)) {\n state.collectedKeys.push(object.id);\n state.keys += 1;\n events.push({ type: \"collect-key\", id: object.id });\n }\n if (object?.type === \"chest\" && !state.openedChests.includes(object.id)) {\n if (state.keys > 0) {\n state.keys -= 1;\n state.openedChests.push(object.id);\n state.treasures += object.treasures;\n events.push({\n type: \"open-chest\",\n id: object.id,\n keyCost: 1,\n treasures: object.treasures\n });\n } else {\n events.push({ type: \"pass-closed-chest\", id: object.id });\n }\n }\n if (object?.type === \"trap\" && !state.triggeredTraps.includes(object.id)) {\n state.triggeredTraps.push(object.id);\n state.health = Math.max(0, state.health - object.damage);\n events.push({ type: \"trigger-trap\", id: object.id, damage: object.damage });\n }\n if (object?.type === \"medicine\" && !state.usedMedicines.includes(object.id)) {\n state.usedMedicines.push(object.id);\n const prior = state.health;\n state.health = Math.min(state.healthMax, state.health + object.recovery);\n events.push({ type: \"use-medicine\", id: object.id, recovery: state.health - prior });\n }\n if (state.health <= 0 && state.alive) {\n state.alive = false;\n events.push({ type: \"die\" });\n }\n if (sameCell(state.position, maze.goal) && !state.reachedGoal) {\n state.reachedGoal = true;\n events.push({ type: \"reach-goal\" });\n }\n return record(step, direction, before, state, true, null, events);\n}\n\nfunction record(\n step: number,\n direction: Direction,\n before: TrialState,\n state: TrialState,\n moved: boolean,\n reason: BlockedReason | null,\n events: TrialEvent[]\n): TrialTraceItem {\n return {\n step,\n direction,\n before,\n moved,\n reason,\n events,\n after: structuredClone(state)\n };\n}\n\nexport function stateKey(state: TrialState): string {\n return [\n cellKey(state.position),\n state.health,\n state.healthMax,\n state.keys,\n state.treasures,\n state.alive,\n state.reachedGoal,\n [...state.openedDoors].sort().join(\",\"),\n [...state.collectedKeys].sort().join(\",\"),\n [...state.openedChests].sort().join(\",\"),\n [...state.triggeredTraps].sort().join(\",\"),\n [...state.usedMedicines].sort().join(\",\")\n ].join(\"|\");\n}\n","import { cell, columnLabel, letterNumberCoordinate } from \"./coordinates.js\";\nimport {\n decorateSolidCellMaze,\n generateSolidCellMaze,\n shortestPath,\n terrainAt,\n validateSolidCellMaze\n} from \"./maze.js\";\nimport { simulateTrial } from \"./simulator.js\";\nimport type {\n Cell,\n Direction,\n InitialState,\n Language,\n Maze,\n MazeTrial,\n ResolvedTrialOptions,\n ScenarioKind,\n TrialAnswers,\n TrialOptions,\n TrialSections\n} from \"./types.js\";\n\nconst DIRECTIONS: Record<Direction, { en: string; zh: string }> = {\n up: { en: \"up\", zh: \"上\" },\n down: { en: \"down\", zh: \"下\" },\n left: { en: \"left\", zh: \"左\" },\n right: { en: \"right\", zh: \"右\" }\n};\n\nconst ENGLISH_RULES = [\n \"The explorer can move only one cell at a time to an orthogonally adjacent cell. An instruction to move several cells is executed as that many consecutive one-cell moves.\",\n \"If the next cell is a wall or outside the map, the explorer stays in place, and the remaining actions continue.\",\n \"A closed door occupies a whole cell. To enter it, the explorer must spend one key; the door then stays open. Without a key, the explorer stays in place.\",\n \"The first time the explorer enters a cell containing a key, they collect it. A key cannot be collected twice.\",\n \"The first time the explorer enters a cell containing an unopened chest, one key is spent to open it if a key is available. Without a key, the explorer may pass through but does not open the chest.\",\n \"A trap removes one health point the first time it is entered and has no effect afterward.\",\n \"A medicine room restores one health point the first time it is entered, without exceeding maximum health, and has no effect afterward.\",\n \"When health reaches zero, the explorer dies. All remaining moves are still read but cannot change any state.\",\n \"Once the explorer enters the goal cell, reached-goal remains true even if the explorer later leaves it.\"\n];\n\nconst CHINESE_RULES = [\n \"探险者每次只能向上、下、左、右相邻的一格移动；“向某方向移动若干格”依次执行相应次数的单格移动。\",\n \"如果一次移动的目标是墙格或超出地图，探险者停在原地，但后续行动仍然继续。\",\n \"门占据一个完整格子。目标格是关闭的门时，探险者若持有钥匙，就消耗一把钥匙、打开该门并进入门格；没有钥匙则停在原地。已经打开的门可以直接进入。\",\n \"探险者第一次进入某把钥匙所在的格子时取得该钥匙，钥匙数增加一；同一把钥匙不能重复取得。\",\n \"探险者第一次进入尚未打开的宝箱格且持有钥匙时，消耗一把钥匙、打开宝箱并取得其中全部宝物；没有钥匙时可以经过该格，但不能打开宝箱。\",\n \"探险者第一次进入某个陷阱格时减少一点健康值；同一陷阱以后不再生效。\",\n \"仍然存活的探险者第一次进入某个药品房时恢复一点健康值，但不得超过健康上限；同一药品房以后不再生效。\",\n \"健康值降为零时探险者死亡。死亡以后，所有尚未执行的移动都不再改变任何状态。\",\n \"探险者一旦进入终点格，就把“曾经到达终点”记录为真；以后即使离开终点，该记录仍然保持为真。\"\n];\n\nconst ENGLISH_QUESTIONS = [\n \"Which cell is the explorer in after all actions are complete?\",\n \"How many keys does the explorer have at the end?\",\n \"How many treasures has the explorer collected at the end?\",\n \"How many health points does the explorer have at the end?\",\n \"Is the explorer alive at the end?\",\n \"Did the explorer ever reach the goal?\",\n \"How many doors were opened?\",\n \"How many chests were opened?\",\n \"How many traps were triggered?\",\n \"How many medicine rooms were used?\",\n \"How many individual moves did not change the explorer's position?\"\n];\n\nconst CHINESE_QUESTIONS = [\n \"全部行动结束后，探险者位于哪一格？\",\n \"探险者最后持有几把钥匙？\",\n \"探险者最后取得了几件宝物？\",\n \"探险者最后还剩几点健康值？\",\n \"探险者最后是否仍然存活？\",\n \"行动过程中，探险者是否曾经到达终点？\",\n \"行动过程中一共打开了几道门？\",\n \"行动过程中一共打开了几只宝箱？\",\n \"行动过程中一共触发了几个陷阱？\",\n \"行动过程中一共使用了几个药品房？\",\n \"行动过程中共有多少次移动没有改变探险者的位置？\"\n];\n\nexport function generateTrial(options: TrialOptions = {}): MazeTrial {\n const resolved = resolveTrialOptions(options);\n const maze = selectMaze(resolved);\n const plan = buildScenarioPlan(maze, resolved.scenario);\n const result = simulateTrial(maze, plan.actions, plan.initialState);\n verifyScenario(resolved.scenario, result.answers, maze);\n const sections: TrialSections = {\n map: renderMapDescription(maze, plan.initialState, resolved.language, resolved.style),\n rules: renderRules(resolved.language),\n actions: renderActionDescription(plan.actions, resolved.language, resolved.style),\n questions: renderQuestions(resolved.language)\n };\n const question = renderQuestion(resolved, maze, sections);\n const answer = renderAnswer(resolved, maze, result.answers, plan.actions.length);\n return {\n schemaVersion: \"maze-test-trial@1\",\n options: resolved,\n maze,\n initialState: plan.initialState,\n actions: plan.actions,\n sections,\n question,\n answer,\n result\n };\n}\n\nexport function generateQuestion(options: TrialOptions = {}): string {\n return generateTrial(options).question;\n}\n\nexport function generateAnswer(options: TrialOptions = {}): string {\n return generateTrial(options).answer;\n}\n\nexport function resolveTrialOptions(options: TrialOptions = {}): ResolvedTrialOptions {\n const scenario = options.scenario ?? \"success\";\n const language = options.language ?? \"en\";\n if (![\"success\", \"treasure-and-leave\", \"death-and-stop\"].includes(scenario)) {\n throw new Error(`Unknown scenario: ${scenario}`);\n }\n if (language !== \"en\" && language !== \"zh\") throw new Error(`Unknown language: ${language}`);\n const resolved: ResolvedTrialOptions = {\n seed: integer(options.seed ?? 1, \"seed\", 0),\n rows: oddInteger(options.rows ?? 15, \"rows\", 7),\n cols: oddInteger(options.cols ?? 15, \"cols\", 7),\n braid: finiteNumber(options.braid ?? 0, \"braid\", 0, 1),\n doorCount: integer(options.doorCount ?? 1, \"doorCount\", 0),\n chestCount: integer(options.chestCount ?? 2, \"chestCount\", 0),\n trapCount: integer(options.trapCount ?? 2, \"trapCount\", 0),\n medicineCount: integer(options.medicineCount ?? 2, \"medicineCount\", 0),\n scenario,\n language,\n style: integer(options.style ?? 0, \"style\", 0),\n minDistance: integer(options.minDistance ?? 0, \"minDistance\", 0),\n maxAttempts: integer(options.maxAttempts ?? 500, \"maxAttempts\", 1)\n };\n if (scenario === \"treasure-and-leave\" && resolved.chestCount < 1) {\n throw new Error(\"The treasure-and-leave scenario requires at least one chest.\");\n }\n if (scenario === \"treasure-and-leave\" && resolved.medicineCount < 1) {\n throw new Error(\"The treasure-and-leave scenario requires at least one medicine room.\");\n }\n if (scenario === \"death-and-stop\" && resolved.trapCount < 1) {\n throw new Error(\"The death-and-stop scenario requires at least one trap.\");\n }\n return resolved;\n}\n\nfunction selectMaze(options: ResolvedTrialOptions): Maze {\n let lastError: unknown = null;\n for (let offset = 0; offset < options.maxAttempts; offset += 1) {\n const effectiveSeed = options.seed + offset;\n try {\n const base = generateSolidCellMaze({\n rows: options.rows,\n cols: options.cols,\n braid: options.braid,\n seed: effectiveSeed,\n requestedSeed: options.seed,\n id: `maze-test-${options.rows}x${options.cols}-${options.seed}`\n });\n const maze = decorateSolidCellMaze(base, {\n seed: effectiveSeed + 80_000,\n doorCount: options.doorCount,\n chestCount: options.chestCount,\n trapCount: options.trapCount,\n medicineCount: options.medicineCount\n });\n const validation = validateSolidCellMaze(maze);\n if (!validation.valid) throw new Error(validation.errors.join(\" \"));\n if ((validation.metrics?.entryGoalDistance ?? 0) < options.minDistance) {\n throw new Error(`The entry-goal distance is below ${options.minDistance}.`);\n }\n const plan = buildScenarioPlan(maze, options.scenario);\n const result = simulateTrial(maze, plan.actions, plan.initialState);\n verifyScenario(options.scenario, result.answers, maze);\n return maze;\n } catch (error) {\n lastError = error;\n }\n }\n const detail = lastError instanceof Error ? ` Last error: ${lastError.message}` : \"\";\n throw new Error(\n `Could not generate a valid trial in ${options.maxAttempts} deterministic attempts.${detail}`\n );\n}\n\nfunction buildScenarioPlan(\n maze: Maze,\n scenario: ScenarioKind\n): { initialState: InitialState; actions: Direction[] } {\n if (scenario === \"success\") {\n return {\n initialState: { health: 5, healthMax: 5, keys: 0, treasures: 0 },\n actions: pathToActions(shortestPath(maze, maze.entry, maze.goal))\n };\n }\n if (scenario === \"treasure-and-leave\") {\n const medicine = maze.objects.find((item) => item.type === \"medicine\");\n const chest = maze.objects.find((item) => item.type === \"chest\");\n if (!medicine || !chest) throw new Error(\"This scenario requires a medicine room and a chest.\");\n const path1 = shortestPath(maze, maze.entry, medicine.position);\n const path2 = shortestPath(maze, medicine.position, chest.position);\n const path3 = shortestPath(maze, chest.position, maze.goal);\n const leavePath = [...path3].reverse().slice(0, Math.min(10, path3.length));\n let actions = [\n ...pathToActions(path1),\n ...pathToActions(path2),\n ...pathToActions(path3),\n ...pathToActions(leavePath)\n ];\n const initialState = {\n health: 3,\n healthMax: 5,\n keys: maze.doors.length + 2,\n treasures: 0\n };\n const beforeBump = simulateTrial(maze, actions, initialState);\n const bump = wallDirection(maze, beforeBump.state.position);\n if (bump) actions = [...actions, bump, bump];\n return { initialState, actions };\n }\n const trap = maze.objects.find((item) => item.type === \"trap\");\n if (!trap) throw new Error(\"This scenario requires a trap.\");\n const toTrap = shortestPath(maze, maze.entry, trap.position);\n const afterTrap = shortestPath(maze, trap.position, maze.goal).slice(0, 14);\n return {\n initialState: {\n health: 1,\n healthMax: 1,\n keys: maze.doors.length + 1,\n treasures: 0\n },\n actions: [...pathToActions(toTrap), ...pathToActions(afterTrap)]\n };\n}\n\nfunction verifyScenario(scenario: ScenarioKind, answers: TrialAnswers, maze: Maze): void {\n if (\n scenario === \"success\" &&\n (!answers.reachedGoal || !answers.alive || answers.finalPosition !== letterNumberCoordinate(maze.goal))\n ) {\n throw new Error(\"The success scenario did not finish alive at the goal.\");\n }\n if (\n scenario === \"treasure-and-leave\" &&\n (!answers.reachedGoal ||\n answers.finalPosition === letterNumberCoordinate(maze.goal) ||\n answers.openedChests < 1 ||\n answers.usedMedicines < 1 ||\n answers.blockedMoves < 2)\n ) {\n throw new Error(\"The treasure-and-leave scenario did not meet its invariants.\");\n }\n if (scenario === \"death-and-stop\" && (answers.alive || answers.blockedAfterDeath < 5)) {\n throw new Error(\"The death-and-stop scenario did not meet its invariants.\");\n }\n}\n\nfunction renderQuestion(\n options: ResolvedTrialOptions,\n maze: Maze,\n sections: TrialSections\n): string {\n const isZh = options.language === \"zh\";\n const title = isZh ? \"迷宫试题\" : \"Maze Trial\";\n const labels = isZh\n ? [\"地图描述\", \"机制描述\", \"行动描述\", \"问题\"]\n : [\"Map\", \"Rules\", \"Actions\", \"Questions\"];\n const seedLine =\n maze.seed === options.seed\n ? `${isZh ? \"种子\" : \"Seed\"}: ${options.seed}`\n : `${isZh ? \"种子\" : \"Seed\"}: ${options.seed} (${isZh ? \"有效迷宫种子\" : \"effective maze seed\"}: ${maze.seed})`;\n return [\n `# ${title}`,\n \"\",\n seedLine,\n \"\",\n `## 1. ${labels[0]}`,\n \"\",\n sections.map,\n \"\",\n `## 2. ${labels[1]}`,\n \"\",\n sections.rules,\n \"\",\n `## 3. ${labels[2]}`,\n \"\",\n sections.actions,\n \"\",\n `## 4. ${labels[3]}`,\n \"\",\n sections.questions,\n \"\"\n ].join(\"\\n\");\n}\n\nfunction renderAnswer(\n options: ResolvedTrialOptions,\n maze: Maze,\n answers: TrialAnswers,\n actionCount: number\n): string {\n const zh = options.language === \"zh\";\n const rows = zh\n ? [\n [\"最终位置\", answers.finalPosition],\n [\"最终钥匙数\", answers.keys],\n [\"最终宝物数\", answers.treasures],\n [\"最终健康值\", answers.health],\n [\"是否存活\", answers.alive ? \"是\" : \"否\"],\n [\"是否曾到达终点\", answers.reachedGoal ? \"是\" : \"否\"],\n [\"打开的门\", answers.openedDoors],\n [\"打开的宝箱\", answers.openedChests],\n [\"触发的陷阱\", answers.triggeredTraps],\n [\"使用的药品房\", answers.usedMedicines],\n [\"未改变位置的移动\", answers.blockedMoves]\n ]\n : [\n [\"Final position\", answers.finalPosition],\n [\"Keys remaining\", answers.keys],\n [\"Treasures collected\", answers.treasures],\n [\"Health remaining\", answers.health],\n [\"Alive\", answers.alive ? \"Yes\" : \"No\"],\n [\"Ever reached the goal\", answers.reachedGoal ? \"Yes\" : \"No\"],\n [\"Doors opened\", answers.openedDoors],\n [\"Chests opened\", answers.openedChests],\n [\"Traps triggered\", answers.triggeredTraps],\n [\"Medicine rooms used\", answers.usedMedicines],\n [\"Moves that did not change position\", answers.blockedMoves]\n ];\n return [\n `# ${zh ? \"标准答案\" : \"Answer Key\"}`,\n \"\",\n `${zh ? \"种子\" : \"Seed\"}: ${options.seed}`,\n ...(maze.seed === options.seed\n ? []\n : [\n `${zh ? \"有效迷宫种子\" : \"Effective maze seed\"}: ${maze.seed}`\n ]),\n \"\",\n `| ${zh ? \"问题\" : \"Item\"} | ${zh ? \"答案\" : \"Answer\"} |`,\n \"|---|---|\",\n ...rows.map(([label, value]) => `| ${label} | ${String(value)} |`),\n \"\",\n `${zh ? \"原子行动数\" : \"Atomic action count\"}: ${actionCount}`,\n \"\"\n ].join(\"\\n\");\n}\n\nfunction renderMapDescription(\n maze: Maze,\n initial: InitialState,\n language: Language,\n style: number\n): string {\n const terrain = renderTerrainDescription(maze, language, style);\n const objects = renderObjectDescription(maze, language);\n if (language === \"zh\") {\n return [\n `这是一座${maze.rows}行${maze.cols}列的迷宫。左上角为A1，列从左向右依次标为A至${columnLabel(maze.cols)}，行从上向下编号为1至${maze.rows}。`,\n `入口位于${letterNumberCoordinate(maze.entry)}，终点位于${letterNumberCoordinate(maze.goal)}。`,\n \"\",\n terrain,\n \"\",\n \"迷宫中的门和其他对象分布如下。门本身占据一个完整格子。\",\n objects,\n \"\",\n `迷宫中有一名探险者。他从入口出发，初始健康值为${numberZh(initial.health)}点，健康上限为${numberZh(initial.healthMax)}点；${initialPossessions(initial, language)}，尚未到达终点。`\n ].join(\"\\n\");\n }\n return [\n `This maze has ${maze.rows} rows and ${maze.cols} columns. The top-left cell is A1. Columns run left to right from A to ${columnLabel(maze.cols)}, and rows run top to bottom from 1 to ${maze.rows}.`,\n `The entry is at ${letterNumberCoordinate(maze.entry)}, and the goal is at ${letterNumberCoordinate(maze.goal)}.`,\n \"\",\n terrain,\n \"\",\n \"Doors and other objects are distributed as follows. Each door occupies a whole cell.\",\n objects,\n \"\",\n `An explorer starts at the entry with ${initial.health} health point${plural(initial.health)}, a maximum health of ${initial.healthMax}, ${initialPossessions(initial, language)}, and reached-goal set to false.`\n ].join(\"\\n\");\n}\n\nfunction renderTerrainDescription(maze: Maze, language: Language, style: number): string {\n const clauses = Array.from({ length: maze.rows }, (_, index) => index + 1).map((row) => {\n const kinds = Array.from({ length: maze.cols }, (_, index) =>\n terrainAt(maze, cell(row, index + 1)) === \".\" ? \"floor\" : \"wall\"\n );\n const label =\n language === \"zh\"\n ? [`第${row}行`, `${row}、`, `（${row}）`][style % 3]\n : `Row ${row}: `;\n return `${label ?? `第${row}行`}${describeTerrainLine(kinds, language)}`;\n });\n return language === \"zh\"\n ? [\"每行内部的格子均从左往右计数。从上往下，各行的格子情况如下：\", `${clauses.join(\"；\\n\")}。`].join(\"\\n\")\n : [\"Within each row, cells are counted from left to right:\", `${clauses.join(\";\\n\")}.`].join(\"\\n\");\n}\n\nfunction describeTerrainLine(kinds: string[], language: Language): string {\n const walls: number[] = [];\n const floors: number[] = [];\n for (let index = 0; index < kinds.length; index += 1) {\n (kinds[index] === \"wall\" ? walls : floors).push(index + 1);\n }\n if (language === \"zh\") {\n if (walls.length === 0) return \"都是通路\";\n if (floors.length === 0) return \"都是墙壁\";\n const limit = Math.floor(kinds.length / 3);\n if (walls.length <= limit) return `除了${positionList(walls, language)}是墙壁以外，其余都是通路`;\n if (floors.length <= limit) return `除了${positionList(floors, language)}是通路以外，其余都是墙壁`;\n return `${positionList(walls, language)}是墙壁，${positionList(floors, language)}是通路`;\n }\n if (walls.length === 0) return \"all cells are passages\";\n if (floors.length === 0) return \"all cells are walls\";\n const limit = Math.floor(kinds.length / 3);\n if (walls.length <= limit) return `all cells are passages except ${positionList(walls, language)}, which ${walls.length === 1 ? \"is a wall\" : \"are walls\"}`;\n if (floors.length <= limit) return `all cells are walls except ${positionList(floors, language)}, which ${floors.length === 1 ? \"is a passage\" : \"are passages\"}`;\n return `${positionList(walls, language)} ${walls.length === 1 ? \"is a wall\" : \"are walls\"}; ${positionList(floors, language)} ${floors.length === 1 ? \"is a passage\" : \"are passages\"}`;\n}\n\nfunction positionList(indices: number[], language: Language): string {\n const ranges: Array<[number, number]> = [];\n let start = indices[0];\n let end = indices[0];\n if (start === undefined || end === undefined) return \"\";\n for (const value of indices.slice(1)) {\n if (value === end + 1) {\n end = value;\n continue;\n }\n ranges.push([start, end]);\n start = value;\n end = value;\n }\n ranges.push([start, end]);\n const parts = ranges.map(([from, to]) =>\n language === \"zh\"\n ? from === to\n ? `第${from}格`\n : `第${from}格至第${to}格`\n : from === to\n ? `cell ${from}`\n : `cells ${from}-${to}`\n );\n if (parts.length === 1) return parts[0] ?? \"\";\n const last = parts.at(-1);\n return language === \"zh\"\n ? `${parts.slice(0, -1).join(\"、\")}和${last}`\n : `${parts.slice(0, -1).join(\", \")} and ${last}`;\n}\n\nfunction renderObjectDescription(maze: Maze, language: Language): string {\n const sentences: string[] = [];\n const doorPositions = maze.doors.map((item) => letterNumberCoordinate(item.position));\n const keys = maze.objects.filter((item) => item.type === \"key\");\n const chests = maze.objects.filter((item) => item.type === \"chest\");\n const traps = maze.objects.filter((item) => item.type === \"trap\");\n const medicines = maze.objects.filter((item) => item.type === \"medicine\");\n if (language === \"zh\") {\n if (doorPositions.length > 0) sentences.push(`${coordinateList(doorPositions, language)}${doorPositions.length > 1 ? \"各\" : \"\"}有一道初始关闭的门。`);\n const keyPositions = keys.map((item) => letterNumberCoordinate(item.position));\n if (keyPositions.length > 0) sentences.push(`${coordinateList(keyPositions, language)}${keyPositions.length > 1 ? \"各\" : \"\"}放着一把钥匙。`);\n for (const chest of chests) sentences.push(`${letterNumberCoordinate(chest.position)}放着一只初始关闭的宝箱，箱内有${numberZh(chest.treasures)}件宝物。`);\n const trapPositions = traps.map((item) => letterNumberCoordinate(item.position));\n if (trapPositions.length > 0) sentences.push(`${coordinateList(trapPositions, language)}${trapPositions.length > 1 ? \"各\" : \"\"}设有一个尚未触发的陷阱。`);\n const medicinePositions = medicines.map((item) => letterNumberCoordinate(item.position));\n if (medicinePositions.length > 0) sentences.push(`${coordinateList(medicinePositions, language)}${medicinePositions.length > 1 ? \"各\" : \"\"}有一个尚未使用的药品房。`);\n } else {\n if (doorPositions.length > 0) sentences.push(`${coordinateList(doorPositions, language)} ${doorPositions.length === 1 ? \"contains a closed door\" : \"each contain a closed door\"}.`);\n const keyPositions = keys.map((item) => letterNumberCoordinate(item.position));\n if (keyPositions.length > 0) sentences.push(`${coordinateList(keyPositions, language)} ${keyPositions.length === 1 ? \"contains a key\" : \"each contain a key\"}.`);\n for (const chest of chests) sentences.push(`${letterNumberCoordinate(chest.position)} contains a closed chest with ${chest.treasures} treasure${plural(chest.treasures)}.`);\n const trapPositions = traps.map((item) => letterNumberCoordinate(item.position));\n if (trapPositions.length > 0) sentences.push(`${coordinateList(trapPositions, language)} ${trapPositions.length === 1 ? \"contains an untriggered trap\" : \"each contain an untriggered trap\"}.`);\n const medicinePositions = medicines.map((item) => letterNumberCoordinate(item.position));\n if (medicinePositions.length > 0) sentences.push(`${coordinateList(medicinePositions, language)} ${medicinePositions.length === 1 ? \"contains an unused medicine room\" : \"each contain an unused medicine room\"}.`);\n }\n return sentences.length > 0 ? sentences.join(\"\\n\") : language === \"zh\" ? \"没有门或其他对象。\" : \"There are no doors or other objects.\";\n}\n\nfunction renderRules(language: Language): string {\n return (language === \"zh\" ? CHINESE_RULES : ENGLISH_RULES).join(\"\\n\");\n}\n\nfunction renderQuestions(language: Language): string {\n return (language === \"zh\" ? CHINESE_QUESTIONS : ENGLISH_QUESTIONS).join(\"\\n\");\n}\n\nfunction renderActionDescription(\n actions: Direction[],\n language: Language,\n style: number\n): string {\n const runs = compressActions(actions);\n if (language === \"zh\") {\n const connectors = [\"随后\", \"接着\", \"然后\", \"再\", \"之后\"];\n const clauses = runs.map((run, index) => {\n const connector = index === 0 ? \"探险者先\" : connectors[(style + index) % connectors.length];\n return `${connector ?? \"然后\"}向${DIRECTIONS[run.direction].zh}移动${numberZh(run.count)}格`;\n });\n return paragraphize(clauses, \"，\", \"。\");\n }\n const clauses = runs.map((run, index) => {\n const connector =\n index === 0\n ? \"First, the explorer moves\"\n : index % 4 === 0\n ? \"The explorer then moves\"\n : \"then moves\";\n const directionForms: Record<Direction, string[]> = {\n up: [\"up\", \"upward\"],\n down: [\"down\", \"downward\"],\n left: [\"left\", \"to the left\"],\n right: [\"right\", \"to the right\"]\n };\n const forms = directionForms[run.direction];\n const direction = forms[(style + index) % forms.length] ?? DIRECTIONS[run.direction].en;\n return `${connector} ${direction} ${run.count} cell${plural(run.count)}`;\n });\n return paragraphize(clauses, \", \", \".\");\n}\n\nfunction paragraphize(clauses: string[], separator: string, terminator: string): string {\n const sentences: string[] = [];\n for (let index = 0; index < clauses.length; index += 4) {\n sentences.push(`${clauses.slice(index, index + 4).join(separator)}${terminator}`);\n }\n return sentences.join(\"\\n\");\n}\n\nfunction compressActions(actions: Direction[]): Array<{ direction: Direction; count: number }> {\n const runs: Array<{ direction: Direction; count: number }> = [];\n for (const direction of actions) {\n const prior = runs.at(-1);\n if (prior?.direction === direction) prior.count += 1;\n else runs.push({ direction, count: 1 });\n }\n return runs;\n}\n\nfunction pathToActions(path: Cell[]): Direction[] {\n const actions: Direction[] = [];\n for (let index = 1; index < path.length; index += 1) {\n const current = path[index];\n const prior = path[index - 1];\n if (!current || !prior) continue;\n const dr = current.row - prior.row;\n const dc = current.col - prior.col;\n actions.push(dr === -1 ? \"up\" : dr === 1 ? \"down\" : dc === -1 ? \"left\" : \"right\");\n }\n return actions;\n}\n\nfunction wallDirection(maze: Maze, position: Cell): Direction | null {\n const candidates: Array<[Direction, Cell]> = [\n [\"up\", cell(position.row - 1, position.col)],\n [\"down\", cell(position.row + 1, position.col)],\n [\"left\", cell(position.row, position.col - 1)],\n [\"right\", cell(position.row, position.col + 1)]\n ];\n return candidates.find(([, target]) => terrainAt(maze, target) !== \".\")?.[0] ?? null;\n}\n\nfunction coordinateList(values: string[], language: Language): string {\n if (values.length <= 1) return values[0] ?? \"\";\n const last = values.at(-1);\n return language === \"zh\"\n ? `${values.slice(0, -1).join(\"、\")}和${last}`\n : `${values.slice(0, -1).join(\", \")} and ${last}`;\n}\n\nfunction initialPossessions(state: InitialState, language: Language): string {\n if (language === \"zh\") {\n const keys = state.keys > 0 ? `起初持有${numberZh(state.keys)}把钥匙` : \"起初没有钥匙\";\n const treasures = state.treasures > 0 ? `持有${numberZh(state.treasures)}件宝物` : \"没有宝物\";\n return `${keys}，${treasures}`;\n }\n const keys = state.keys > 0 ? `${state.keys} key${plural(state.keys)}` : \"no keys\";\n const treasures = state.treasures > 0 ? `${state.treasures} treasure${plural(state.treasures)}` : \"no treasures\";\n return `${keys} and ${treasures}`;\n}\n\nfunction numberZh(value: number): string {\n const forms = [\"零\", \"一\", \"两\", \"三\", \"四\", \"五\", \"六\", \"七\", \"八\", \"九\", \"十\"];\n return forms[value] ?? String(value);\n}\n\nfunction plural(value: number): string {\n return value === 1 ? \"\" : \"s\";\n}\n\nfunction integer(value: number, name: string, minimum: number): number {\n if (!Number.isInteger(value) || value < minimum) {\n throw new Error(`${name} must be an integer greater than or equal to ${minimum}.`);\n }\n return value;\n}\n\nfunction oddInteger(value: number, name: string, minimum: number): number {\n integer(value, name, minimum);\n if (value % 2 === 0) throw new Error(`${name} must be odd.`);\n return value;\n}\n\nfunction finiteNumber(value: number, name: string, minimum: number, maximum: number): number {\n if (!Number.isFinite(value) || value < minimum || value > maximum) {\n throw new Error(`${name} must be between ${minimum} and ${maximum}.`);\n }\n return value;\n}\n"],"mappings":";;;AAEA,OAAO,aAAa;;;ACAb,SAAS,KAAK,KAAa,KAAmB;AACnD,SAAO,EAAE,KAAK,IAAI;AACpB;AAEO,SAAS,QAAQ,OAAqB;AAC3C,SAAO,GAAG,MAAM,GAAG,IAAI,MAAM,GAAG;AAClC;AAEO,SAAS,SAAS,GAAqB,GAA8B;AAC1E,SAAO,GAAG,QAAQ,GAAG,OAAO,GAAG,QAAQ,GAAG;AAC5C;AAEO,SAAS,YAAY,KAAqB;AAC/C,MAAI,CAAC,OAAO,UAAU,GAAG,KAAK,MAAM,EAAG,OAAM,IAAI,MAAM,0BAA0B,GAAG,EAAE;AACtF,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,SAAO,QAAQ,GAAG;AAChB,aAAS;AACT,YAAQ,OAAO,aAAa,KAAM,QAAQ,EAAG,IAAI;AACjD,YAAQ,KAAK,MAAM,QAAQ,EAAE;AAAA,EAC/B;AACA,SAAO;AACT;AAEO,SAAS,uBAAuB,OAAqB;AAC1D,SAAO,GAAG,YAAY,MAAM,GAAG,CAAC,GAAG,MAAM,GAAG;AAC9C;AAMO,SAAS,UAAU,OAAa,MAAc,MAAsB;AACzE,SAAO;AAAA,IACL,KAAK,MAAM,MAAM,GAAG,MAAM,GAAG;AAAA,IAC7B,KAAK,MAAM,MAAM,GAAG,MAAM,GAAG;AAAA,IAC7B,KAAK,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,IAC7B,KAAK,MAAM,KAAK,MAAM,MAAM,CAAC;AAAA,EAC/B,EAAE,OAAO,CAAC,SAAS,KAAK,OAAO,KAAK,KAAK,OAAO,QAAQ,KAAK,OAAO,KAAK,KAAK,OAAO,IAAI;AAC3F;;;AC1BO,SAAS,sBAAsB,UAA+B,CAAC,GAAS;AAC7E,QAAM,OAAO,aAAa,QAAQ,QAAQ,IAAI,MAAM;AACpD,QAAM,OAAO,aAAa,QAAQ,QAAQ,IAAI,MAAM;AACpD,QAAM,OAAO,cAAc,QAAQ,QAAQ,GAAG,QAAQ,CAAC;AACvD,QAAM,gBAAgB,cAAc,QAAQ,iBAAiB,MAAM,iBAAiB,CAAC;AACrF,QAAM,QAAQ,aAAa,QAAQ,SAAS,GAAG,SAAS,GAAG,CAAC;AAC5D,QAAM,MAAM,WAAW,IAAI;AAC3B,QAAM,OAAO,MAAM,KAAK,EAAE,QAAQ,KAAK,GAAG,MAAM,MAAc,IAAI,EAAE,KAAK,GAAG,CAAC;AAC7E,QAAM,eAAuB,CAAC;AAE9B,WAAS,MAAM,GAAG,MAAM,OAAO,GAAG,OAAO,GAAG;AAC1C,aAAS,MAAM,GAAG,MAAM,OAAO,GAAG,OAAO,EAAG,cAAa,KAAK,EAAE,KAAK,IAAI,CAAC;AAAA,EAC5E;AAEA,QAAM,QAAQ,aAAa,UAAU,KAAK,aAAa,MAAM,CAAC;AAC9D,MAAI,CAAC,MAAO,OAAM,IAAI,MAAM,gCAAgC;AAC5D,QAAM,UAAU,oBAAI,IAAI,CAAC,QAAQ,KAAK,CAAC,CAAC;AACxC,QAAM,QAAQ,CAAC,KAAK;AACpB,OAAK,MAAM,GAAG,EAAG,MAAM,GAAG,IAAI;AAE9B,SAAO,MAAM,SAAS,GAAG;AACvB,UAAM,UAAU,MAAM,GAAG,EAAE;AAC3B,QAAI,CAAC,QAAS;AACd,UAAM,UAAU;AAAA,MACd;AAAA,MACA,iBAAiB,SAAS,MAAM,IAAI,EAAE,OAAO,CAAC,SAAS,CAAC,QAAQ,IAAI,QAAQ,IAAI,CAAC,CAAC;AAAA,IACpF;AACA,UAAM,OAAO,QAAQ,CAAC;AACtB,QAAI,CAAC,MAAM;AACT,YAAM,IAAI;AACV;AAAA,IACF;AACA,UAAM,QAAQ,MAAM,KAAK,OAAO,CAAC,GAAI,QAAQ,MAAM,KAAK,OAAO,CAAC,IAAI;AACpE,SAAK,KAAK,GAAG,EAAG,KAAK,GAAG,IAAI;AAC5B,YAAQ,IAAI,QAAQ,IAAI,CAAC;AACzB,UAAM,KAAK,IAAI;AAAA,EACjB;AAEA,gBAAc,MAAM,OAAO,GAAG;AAC9B,QAAM,UAAU,KAAK,IAAI,CAAC,QAAQ,IAAI,KAAK,EAAE,CAAC;AAC9C,QAAM,QAAQ,cAAc,KAAK,GAAG,CAAC,GAAG,OAAO,EAAE;AACjD,QAAM,SAAS,cAAc,OAAO,OAAO,EAAE;AAC7C,QAAM,OAAa;AAAA,IACjB,eAAe;AAAA,IACf,IAAI,QAAQ,MAAM,cAAc,IAAI,IAAI,IAAI,IAAI,aAAa;AAAA,IAC7D;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,kBAAkB;AAAA,MAChB,QAAQ;AAAA,MACR,SAAS;AAAA,MACT,MAAM;AAAA,IACR;AAAA,IACA;AAAA,IACA,OAAO;AAAA,IACP,MAAM;AAAA,IACN,OAAO,CAAC;AAAA,IACR,SAAS,CAAC;AAAA,IACV,SAAS,aAAa,MAAM,IAAI;AAAA,EAClC;AACA,OAAK,UAAU,qBAAqB,IAAI;AACxC,SAAO;AACT;AAEO,SAAS,sBAAsB,MAAY,UAA+B,CAAC,GAAS;AACzF,QAAM,SAAS,gBAAgB,IAAI;AACnC,QAAM,iBAAiB,cAAc,QAAQ,QAAQ,KAAK,OAAO,OAAQ,mBAAmB,CAAC;AAC7F,QAAM,MAAM,WAAW,cAAc;AACrC,QAAM,WAAW,aAAa,QAAQ,OAAO,OAAO,OAAO,IAAI;AAC/D,QAAM,WAAW,oBAAI,IAAI,CAAC,QAAQ,OAAO,KAAK,GAAG,QAAQ,OAAO,IAAI,CAAC,CAAC;AACtE,QAAM,YAAY;AAAA,IAChB,QAAQ,aAAa,KAAK,IAAI,GAAG,KAAK,MAAM,OAAO,QAAQ,aAAa,GAAG,CAAC;AAAA,IAC5E;AAAA,IACA;AAAA,EACF;AACA,QAAM,aAAa,cAAc,QAAQ,cAAc,GAAG,cAAc,CAAC;AACzE,QAAM,YAAY,cAAc,QAAQ,aAAa,GAAG,aAAa,CAAC;AACtE,QAAM,gBAAgB,cAAc,QAAQ,iBAAiB,GAAG,iBAAiB,CAAC;AAClF,QAAM,cAAc,wBAAwB,QAAQ,UAAU,SAAS;AAEvE,SAAO,QAAQ,YAAY,IAAI,CAAC,OAAO,cAAc;AACnD,UAAM,WAAW,SAAS,KAAK;AAC/B,QAAI,CAAC,SAAU,OAAM,IAAI,MAAM,qCAAqC,KAAK,GAAG;AAC5E,aAAS,IAAI,QAAQ,QAAQ,CAAC;AAC9B,WAAO,EAAE,IAAI,QAAQ,YAAY,CAAC,IAAI,UAAU,OAAO,SAAkB;AAAA,EAC3E,CAAC;AAED,QAAM,UAAwB,CAAC;AAC/B,WAAS,QAAQ,GAAG,QAAQ,OAAO,MAAM,QAAQ,SAAS,GAAG;AAC3D,UAAM,YAAY,YAAY,KAAK;AACnC,QAAI,cAAc,OAAW,OAAM,IAAI,MAAM,sBAAsB;AACnE,UAAM,iBAAiB,KAAK,IAAI,GAAG,KAAK,MAAM,YAAY,IAAI,CAAC;AAC/D,UAAM,WAAW,mBAAmB,UAAU,gBAAgB,QAAQ;AACtE,aAAS,IAAI,QAAQ,QAAQ,CAAC;AAC9B,UAAM,MAAiB,EAAE,IAAI,OAAO,QAAQ,CAAC,IAAI,MAAM,OAAO,SAAS;AACvE,YAAQ,KAAK,GAAG;AAAA,EAClB;AAEA,QAAM,UAAU,UAAU,MAAM;AAChC,QAAM,WAAW;AAAA,IACf;AAAA,IACA,WAAW,MAAM,EAAE;AAAA,MACjB,CAAC,SAAS,QAAQ,IAAI,QAAQ,IAAI,CAAC,MAAM,KAAK,CAAC,SAAS,IAAI,QAAQ,IAAI,CAAC;AAAA,IAC3E;AAAA,EACF;AAEA,WAAS,QAAQ,GAAG,QAAQ,YAAY,SAAS,GAAG;AAClD,UAAM,WAAW,SAAS,UAAU,QAAQ,UAAU,KAAK,OAAO;AAClE,aAAS,IAAI,QAAQ,QAAQ,CAAC;AAC9B,UAAM,QAAqB;AAAA,MACzB,IAAI,SAAS,QAAQ,CAAC;AAAA,MACtB,MAAM;AAAA,MACN;AAAA,MACA,WAAW,IAAK,QAAQ;AAAA,IAC1B;AACA,YAAQ,KAAK,KAAK;AAAA,EACpB;AAEA,QAAM,iBAAiB,QAAQ,KAAK,SAAS,MAAM,GAAG,EAAE,CAAC;AACzD,WAAS,QAAQ,GAAG,QAAQ,WAAW,SAAS,GAAG;AACjD,UAAM,WAAW,SAAS,gBAAgB,QAAQ,UAAU,KAAK,MAAM;AACvE,aAAS,IAAI,QAAQ,QAAQ,CAAC;AAC9B,UAAM,OAAmB;AAAA,MACvB,IAAI,QAAQ,QAAQ,CAAC;AAAA,MACrB,MAAM;AAAA,MACN;AAAA,MACA,QAAQ;AAAA,IACV;AACA,YAAQ,KAAK,IAAI;AAAA,EACnB;AAEA,QAAM,qBAAqB,QAAQ,KAAK,WAAW,MAAM,CAAC;AAC1D,WAAS,QAAQ,GAAG,QAAQ,eAAe,SAAS,GAAG;AACrD,UAAM,WAAW,SAAS,oBAAoB,QAAQ,UAAU,KAAK,UAAU;AAC/E,aAAS,IAAI,QAAQ,QAAQ,CAAC;AAC9B,UAAM,WAA2B;AAAA,MAC/B,IAAI,YAAY,QAAQ,CAAC;AAAA,MACzB,MAAM;AAAA,MACN;AAAA,MACA,UAAU;AAAA,IACZ;AACA,YAAQ,KAAK,QAAQ;AAAA,EACvB;AAEA,SAAO,UAAU;AACjB,SAAO,UAAU,qBAAqB,MAAM;AAC5C,SAAO;AACT;AAEO,SAAS,qBAAqB,MAAyB;AAC5D,cAAY,IAAI;AAChB,QAAM,SAAS,WAAW,IAAI;AAC9B,QAAM,QAAQ,UAAU,IAAI;AAC5B,QAAM,YAAY,aAAa,KAAK,OAAO,KAAK;AAChD,QAAM,eAAe,CAAC,GAAG,MAAM,OAAO,CAAC,EAAE,IAAI,CAAC,UAAU,MAAM,MAAM;AACpE,QAAM,YAAY,aAAa,OAAO,CAAC,KAAK,UAAU,MAAM,OAAO,CAAC,IAAI;AACxE,QAAM,WAAW,aAAa,MAAM,KAAK,OAAO,KAAK,IAAI;AACzD,QAAM,eAA4D,CAAC;AACnE,aAAW,UAAU,KAAK,WAAW,CAAC,GAAG;AACvC,iBAAa,OAAO,IAAI,KAAK,aAAa,OAAO,IAAI,KAAK,KAAK;AAAA,EACjE;AACA,SAAO;AAAA,IACL,YAAY,KAAK,OAAO,KAAK;AAAA,IAC7B,WAAW,KAAK,OAAO,KAAK,OAAO,OAAO;AAAA,IAC1C,YAAY,OAAO;AAAA,IACnB,qBAAqB,UAAU;AAAA,IAC/B,WAAW,UAAU,SAAS,OAAO;AAAA,IACrC,qBAAqB;AAAA,IACrB,mBAAmB,YAAY,OAAO,SAAS;AAAA,IAC/C,UAAU,aAAa,OAAO,CAAC,UAAU,UAAU,CAAC,EAAE;AAAA,IACtD,WAAW,aAAa,OAAO,CAAC,UAAU,SAAS,CAAC,EAAE;AAAA,IACtD,mBAAmB,SAAS,SAAS,IAAI,SAAS,SAAS,IAAI;AAAA,IAC/D,WAAW,KAAK,MAAM;AAAA,IACtB,iBAAiB,KAAK,MAAM;AAAA,MAC1B,CAAC,SAAS,aAAa,MAAM,KAAK,OAAO,KAAK,MAAM,KAAK,QAAQ,EAAE,WAAW;AAAA,IAChF,EAAE;AAAA,IACF;AAAA,EACF;AACF;AAEO,SAAS,sBAAsB,MAA4B;AAChE,QAAM,SAAmB,CAAC;AAC1B,MAAI;AACF,gBAAY,IAAI;AAAA,EAClB,SAAS,OAAO;AACd,WAAO;AAAA,MACL,OAAO;AAAA,MACP,QAAQ,CAAC,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK,CAAC;AAAA,MAC/D,SAAS;AAAA,IACX;AAAA,EACF;AAEA,WAAS,MAAM,GAAG,OAAO,KAAK,MAAM,OAAO,GAAG;AAC5C,aAAS,MAAM,GAAG,OAAO,KAAK,MAAM,OAAO,GAAG;AAC5C,YAAM,QAAQ,UAAU,MAAM,KAAK,KAAK,GAAG,CAAC;AAC5C,UAAI,UAAU,OAAO,UAAU,IAAK,QAAO,KAAK,sBAAsB,GAAG,IAAI,GAAG,KAAK,KAAK,EAAE;AAC5F,WACG,QAAQ,KAAK,QAAQ,KAAK,QAAQ,QAAQ,KAAK,QAAQ,KAAK,SAC7D,UAAU,KACV;AACA,eAAO,KAAK,uCAAuC,GAAG,IAAI,GAAG,GAAG;AAAA,MAClE;AAAA,IACF;AAAA,EACF;AAEA,MAAI,CAAC,QAAQ,MAAM,KAAK,KAAK,EAAG,QAAO,KAAK,mCAAmC;AAC/E,MAAI,CAAC,QAAQ,MAAM,KAAK,IAAI,EAAG,QAAO,KAAK,kCAAkC;AAC7E,MAAI,SAAS,KAAK,OAAO,KAAK,IAAI,EAAG,QAAO,KAAK,6BAA6B;AAC9E,QAAM,WAAW,oBAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,GAAG,QAAQ,KAAK,IAAI,CAAC,CAAC;AAElE,aAAW,QAAQ,KAAK,OAAO;AAC7B,QAAI,CAAC,QAAQ,MAAM,KAAK,QAAQ,EAAG,QAAO,KAAK,GAAG,KAAK,EAAE,0BAA0B;AACnF,UAAM,MAAM,QAAQ,KAAK,QAAQ;AACjC,QAAI,SAAS,IAAI,GAAG,EAAG,QAAO,KAAK,GAAG,KAAK,EAAE,4BAA4B;AACzE,aAAS,IAAI,GAAG;AAAA,EAClB;AACA,aAAW,UAAU,KAAK,SAAS;AACjC,QAAI,CAAC,QAAQ,MAAM,OAAO,QAAQ,EAAG,QAAO,KAAK,GAAG,OAAO,EAAE,0BAA0B;AACvF,UAAM,MAAM,QAAQ,OAAO,QAAQ;AACnC,QAAI,SAAS,IAAI,GAAG,EAAG,QAAO,KAAK,GAAG,OAAO,EAAE,4BAA4B;AAC3E,aAAS,IAAI,GAAG;AAAA,EAClB;AAEA,QAAM,UAAU,qBAAqB,IAAI;AACzC,MAAI,CAAC,QAAQ,WAAW;AACtB,WAAO,KAAK,iCAAiC,QAAQ,mBAAmB,IAAI,QAAQ,UAAU,GAAG;AAAA,EACnG;AACA,MAAI,QAAQ,aAAa,EAAG,QAAO,KAAK,4BAA4B;AACpE,MAAI,QAAQ,cAAc,EAAG,QAAO,KAAK,4BAA4B;AACrE,MAAI,QAAQ,oBAAoB,QAAQ,WAAW;AACjD,WAAO,KAAK,GAAG,QAAQ,YAAY,QAAQ,eAAe,2BAA2B;AAAA,EACvF;AAEA,QAAM,OAAO,aAAa,MAAM,KAAK,OAAO,KAAK,IAAI;AACrD,QAAM,YAAY,IAAI,IAAI,KAAK,IAAI,CAAC,MAAM,UAAU,CAAC,QAAQ,IAAI,GAAG,KAAK,CAAC,CAAC;AAC3E,WAAS,QAAQ,GAAG,QAAQ,KAAK,MAAM,QAAQ,SAAS,GAAG;AACzD,UAAM,OAAO,KAAK,MAAM,KAAK;AAC7B,QAAI,CAAC,KAAM;AACX,UAAM,MAAM,KAAK,QAAQ,KAAK,CAAC,SAAS,KAAK,OAAO,OAAO,QAAQ,CAAC,EAAE;AACtE,UAAM,YAAY,UAAU,IAAI,QAAQ,KAAK,QAAQ,CAAC;AACtD,UAAM,WAAW,MAAM,UAAU,IAAI,QAAQ,IAAI,QAAQ,CAAC,IAAI;AAC9D,QAAI,CAAC,IAAK,QAAO,KAAK,qBAAqB,KAAK,EAAE,GAAG;AAAA,aAC5C,aAAa,UAAa,cAAc,UAAa,YAAY,WAAW;AACnF,aAAO,KAAK,GAAG,IAAI,EAAE,kBAAkB,KAAK,EAAE,oBAAoB;AAAA,IACpE;AAAA,EACF;AACA,SAAO,EAAE,OAAO,OAAO,WAAW,GAAG,QAAQ,QAAQ;AACvD;AAEO,SAAS,aACd,MACA,OACA,MACA,eAA4B,MACpB;AACR,MAAI,iBAAiB,SAAS,OAAO,YAAY,KAAK,SAAS,MAAM,YAAY,GAAI,QAAO,CAAC;AAC7F,QAAM,QAAQ,UAAU,MAAM,YAAY;AAC1C,QAAM,QAAQ,CAAC,KAAK;AACpB,QAAM,SAAS,oBAAI,IAA2B,CAAC,CAAC,QAAQ,KAAK,GAAG,IAAI,CAAC,CAAC;AACtE,QAAM,SAAS,oBAAI,IAAI,CAAC,CAAC,QAAQ,KAAK,GAAG,KAAK,CAAC,CAAC;AAChD,MAAI,aAAa;AACjB,SAAO,aAAa,MAAM,QAAQ;AAChC,UAAM,UAAU,MAAM,UAAU;AAChC,kBAAc;AACd,QAAI,CAAC,QAAS;AACd,QAAI,SAAS,SAAS,IAAI,EAAG;AAC7B,eAAW,QAAQ,MAAM,IAAI,QAAQ,OAAO,CAAC,KAAK,CAAC,GAAG;AACpD,YAAM,MAAM,QAAQ,IAAI;AACxB,UAAI,OAAO,IAAI,GAAG,EAAG;AACrB,aAAO,IAAI,KAAK,QAAQ,OAAO,CAAC;AAChC,aAAO,IAAI,KAAK,IAAI;AACpB,YAAM,KAAK,IAAI;AAAA,IACjB;AAAA,EACF;AACA,MAAI,CAAC,OAAO,IAAI,QAAQ,IAAI,CAAC,EAAG,QAAO,CAAC;AACxC,QAAM,OAAe,CAAC;AACtB,MAAI,SAAwB,QAAQ,IAAI;AACxC,SAAO,WAAW,MAAM;AACtB,UAAM,QAAQ,OAAO,IAAI,MAAM;AAC/B,QAAI,CAAC,MAAO,OAAM,IAAI,MAAM,iCAAiC,MAAM,GAAG;AACtE,SAAK,KAAK,KAAK;AACf,aAAS,OAAO,IAAI,MAAM,KAAK;AAAA,EACjC;AACA,SAAO,KAAK,QAAQ;AACtB;AAEO,SAAS,UACd,MACA,OACe;AACf,MAAI,MAAM,MAAM,KAAK,MAAM,MAAM,KAAK,QAAQ,MAAM,MAAM,KAAK,MAAM,MAAM,KAAK,MAAM;AACpF,WAAO;AAAA,EACT;AACA,SAAO,KAAK,QAAQ,MAAM,MAAM,CAAC,IAAI,MAAM,MAAM,CAAC,KAAK;AACzD;AAEO,SAAS,QAAQ,MAA+C,OAAsB;AAC3F,SAAO,UAAU,MAAM,KAAK,MAAM;AACpC;AAEA,SAAS,cAAc,MAAkB,OAAe,KAAyB;AAC/E,MAAI,SAAS,EAAG;AAChB,QAAM,OAAO,KAAK;AAClB,QAAM,OAAO,KAAK,CAAC,GAAG,UAAU;AAChC,QAAM,eAAuB,CAAC;AAC9B,WAAS,MAAM,GAAG,MAAM,OAAO,GAAG,OAAO,GAAG;AAC1C,aAAS,MAAM,GAAG,MAAM,OAAO,GAAG,OAAO,EAAG,cAAa,KAAK,EAAE,KAAK,IAAI,CAAC;AAAA,EAC5E;AACA,QAAM,WAAW;AAAA,IACf;AAAA,IACA,aAAa,OAAO,CAAC,UAAU,qBAAqB,MAAM,KAAK,EAAE,WAAW,CAAC;AAAA,EAC/E;AACA,aAAW,WAAW,UAAU;AAC9B,QAAI,IAAI,IAAI,MAAO;AACnB,UAAM,SAAS;AAAA,MACb;AAAA,MACA,iBAAiB,SAAS,MAAM,IAAI,EAAE;AAAA,QACpC,CAACA,UAAS,MAAM,QAAQ,MAAMA,MAAK,OAAO,CAAC,KAAK,QAAQ,MAAMA,MAAK,OAAO,CAAC,MAAM;AAAA,MACnF;AAAA,IACF;AACA,UAAM,OAAO,OAAO,CAAC;AACrB,QAAI,CAAC,KAAM;AACX,UAAM,QAAQ,MAAM,KAAK,OAAO,CAAC,GAAI,QAAQ,MAAM,KAAK,OAAO,CAAC,IAAI;AAAA,EACtE;AACF;AAEA,SAAS,qBAAqB,MAAkB,SAAuB;AACrE,SAAO,iBAAiB,SAAS,KAAK,QAAQ,KAAK,CAAC,GAAG,UAAU,CAAC,EAAE;AAAA,IAClE,CAAC,SAAS,MAAM,QAAQ,MAAM,KAAK,OAAO,CAAC,KAAK,QAAQ,MAAM,KAAK,OAAO,CAAC,MAAM;AAAA,EACnF;AACF;AAEA,SAAS,iBAAiB,OAAa,MAAc,MAAsB;AACzE,SAAO;AAAA,IACL,EAAE,KAAK,MAAM,MAAM,GAAG,KAAK,MAAM,IAAI;AAAA,IACrC,EAAE,KAAK,MAAM,MAAM,GAAG,KAAK,MAAM,IAAI;AAAA,IACrC,EAAE,KAAK,MAAM,KAAK,KAAK,MAAM,MAAM,EAAE;AAAA,IACrC,EAAE,KAAK,MAAM,KAAK,KAAK,MAAM,MAAM,EAAE;AAAA,EACvC,EAAE,OAAO,CAAC,SAAS,KAAK,OAAO,KAAK,KAAK,MAAM,OAAO,KAAK,KAAK,OAAO,KAAK,KAAK,MAAM,OAAO,CAAC;AACjG;AAEA,SAAS,cAAc,OAAa,SAAqD;AACvF,QAAM,OAAO,EAAE,MAAM,QAAQ,QAAQ,MAAM,QAAQ,CAAC,GAAG,UAAU,GAAG,QAAQ;AAC5E,QAAM,QAAQ,UAAU,IAAI;AAC5B,QAAM,YAAY,aAAa,OAAO,KAAK;AAC3C,MAAI,WAAW;AACf,MAAI,WAAW;AACf,aAAW,CAAC,KAAK,KAAK,KAAK,WAAW;AACpC,QAAI,SAAS,SAAU;AACvB,eAAW;AACX,eAAW,aAAa,GAAG;AAAA,EAC7B;AACA,SAAO,EAAE,MAAM,UAAU,SAAS;AACpC;AAEA,SAAS,WAAW,MAAuD;AACzE,QAAM,SAAiB,CAAC;AACxB,WAAS,MAAM,GAAG,OAAO,KAAK,MAAM,OAAO,GAAG;AAC5C,aAAS,MAAM,GAAG,OAAO,KAAK,MAAM,OAAO,GAAG;AAC5C,UAAI,QAAQ,MAAM,KAAK,KAAK,GAAG,CAAC,EAAG,QAAO,KAAK,KAAK,KAAK,GAAG,CAAC;AAAA,IAC/D;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,UACP,MACA,eAA4B,MACP;AACrB,QAAM,SAAS,WAAW,IAAI,EAAE,OAAO,CAAC,SAAS,CAAC,gBAAgB,CAAC,SAAS,MAAM,YAAY,CAAC;AAC/F,QAAM,YAAY,IAAI,IAAI,OAAO,IAAI,OAAO,CAAC;AAC7C,SAAO,IAAI;AAAA,IACT,OAAO,IAAI,CAAC,SAAS;AAAA,MACnB,QAAQ,IAAI;AAAA,MACZ,UAAU,MAAM,KAAK,MAAM,KAAK,IAAI,EAAE,OAAO,CAAC,SAAS,UAAU,IAAI,QAAQ,IAAI,CAAC,CAAC;AAAA,IACrF,CAAC;AAAA,EACH;AACF;AAEA,SAAS,aAAa,OAAa,OAAiD;AAClF,QAAM,YAAY,oBAAI,IAAI,CAAC,CAAC,QAAQ,KAAK,GAAG,CAAC,CAAC,CAAC;AAC/C,QAAM,QAAQ,CAAC,KAAK;AACpB,MAAI,aAAa;AACjB,SAAO,aAAa,MAAM,QAAQ;AAChC,UAAM,UAAU,MAAM,UAAU;AAChC,kBAAc;AACd,QAAI,CAAC,QAAS;AACd,UAAM,WAAW,UAAU,IAAI,QAAQ,OAAO,CAAC;AAC/C,QAAI,aAAa,OAAW;AAC5B,eAAW,QAAQ,MAAM,IAAI,QAAQ,OAAO,CAAC,KAAK,CAAC,GAAG;AACpD,YAAM,MAAM,QAAQ,IAAI;AACxB,UAAI,UAAU,IAAI,GAAG,EAAG;AACxB,gBAAU,IAAI,KAAK,WAAW,CAAC;AAC/B,YAAM,KAAK,IAAI;AAAA,IACjB;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,UAAU,MAAiC;AAClD,SAAO,IAAI,IAAI,CAAC,GAAG,UAAU,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,KAAK,MAAM,MAAM,CAAC,KAAK,OAAO,MAAM,CAAC,CAAC;AAClF;AAEA,SAAS,wBAAwB,MAAY,UAAkB,OAAyB;AACtF,MAAI,UAAU,EAAG,QAAO,CAAC;AACzB,QAAM,UAAU,UAAU,IAAI;AAC9B,QAAM,aAAuB,CAAC;AAC9B,WAAS,QAAQ,GAAG,QAAQ,SAAS,SAAS,GAAG,SAAS,GAAG;AAC3D,UAAM,WAAW,SAAS,KAAK;AAC/B,QAAI,CAAC,aAAa,QAAQ,IAAI,QAAQ,QAAQ,CAAC,KAAK,OAAO,EAAG;AAC9D,QAAI,aAAa,MAAM,KAAK,OAAO,KAAK,MAAM,QAAQ,EAAE,WAAW,EAAG,YAAW,KAAK,KAAK;AAAA,EAC7F;AACA,MAAI,WAAW,SAAS,OAAO;AAC7B,UAAM,IAAI,MAAM,QAAQ,WAAW,MAAM,gDAAgD,KAAK,SAAS;AAAA,EACzG;AACA,QAAM,UAAU,cAAc,SAAS,SAAS,GAAG,OAAO,MAAM,IAAI;AACpE,QAAM,WAAqB,CAAC;AAC5B,aAAW,UAAU,SAAS;AAC5B,UAAM,YAAY,WAAW,OAAO,CAAC,UAAU,CAAC,SAAS,SAAS,KAAK,CAAC;AACxE,cAAU;AAAA,MACR,CAAC,MAAM,UAAU,KAAK,IAAI,OAAO,MAAM,IAAI,KAAK,IAAI,QAAQ,MAAM,KAAK,OAAO;AAAA,IAChF;AACA,UAAM,YAAY,UAAU,CAAC;AAC7B,QAAI,cAAc,OAAW,OAAM,IAAI,MAAM,mBAAmB,KAAK,SAAS;AAC9E,aAAS,KAAK,SAAS;AAAA,EACzB;AACA,MAAI,SAAS,WAAW,MAAO,OAAM,IAAI,MAAM,mBAAmB,KAAK,6BAA6B;AACpG,SAAO,SAAS,KAAK,CAAC,MAAM,UAAU,OAAO,KAAK;AACpD;AAEA,SAAS,mBAAmB,UAAkB,gBAAwB,UAA6B;AACjG,WAAS,WAAW,GAAG,WAAW,SAAS,QAAQ,YAAY,GAAG;AAChE,eAAW,SAAS,CAAC,iBAAiB,UAAU,iBAAiB,QAAQ,GAAG;AAC1E,UAAI,SAAS,KAAK,SAAS,SAAS,SAAS,EAAG;AAChD,YAAM,YAAY,SAAS,KAAK;AAChC,UAAI,aAAa,CAAC,SAAS,IAAI,QAAQ,SAAS,CAAC,EAAG,QAAO;AAAA,IAC7D;AAAA,EACF;AACA,QAAM,IAAI,MAAM,qDAAqD;AACvE;AAEA,SAAS,SACP,YACA,MACA,UACA,KACA,MACM;AACN,SAAO,WAAW,SAAS,GAAG;AAC5B,UAAM,QAAQ,WAAW,MAAM;AAC/B,QAAI,SAAS,CAAC,SAAS,IAAI,QAAQ,KAAK,CAAC,EAAG,QAAO;AAAA,EACrD;AACA,QAAM,WAAW,QAAQ,KAAK,WAAW,IAAI,CAAC,EAAE,KAAK,CAAC,SAAS,CAAC,SAAS,IAAI,QAAQ,IAAI,CAAC,CAAC;AAC3F,MAAI,CAAC,SAAU,OAAM,IAAI,MAAM,kDAAkD,IAAI,GAAG;AACxF,SAAO;AACT;AAEA,SAAS,cACP,WACA,OACA,YACA,UACU;AACV,MAAI,UAAU,EAAG,QAAO,CAAC;AACzB,QAAM,SAAmB,CAAC;AAC1B,WAAS,QAAQ,GAAG,QAAQ,OAAO,SAAS,GAAG;AAC7C,UAAM,QACJ,UAAU,KACL,aAAa,YAAY,IAC1B,cAAe,WAAW,cAAc,SAAU,QAAQ;AAChE,WAAO,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI,YAAY,GAAG,KAAK,MAAM,YAAY,KAAK,CAAC,CAAC,CAAC;AAAA,EACjF;AACA,SAAO,CAAC,GAAG,IAAI,IAAI,MAAM,CAAC;AAC5B;AAEA,SAAS,aAAa,KAAmB;AACvC,QAAM,CAAC,KAAK,GAAG,IAAI,IAAI,MAAM,GAAG,EAAE,IAAI,MAAM;AAC5C,MAAI,QAAQ,UAAa,QAAQ,OAAW,OAAM,IAAI,MAAM,qBAAqB,GAAG,EAAE;AACtF,SAAO,KAAK,KAAK,GAAG;AACtB;AAEA,SAAS,YAAY,MAAqD;AACxE,eAAa,KAAK,MAAM,MAAM;AAC9B,eAAa,KAAK,MAAM,MAAM;AAC9B,MAAI,CAAC,MAAM,QAAQ,KAAK,OAAO,KAAK,KAAK,QAAQ,WAAW,KAAK,MAAM;AACrE,UAAM,IAAI,MAAM,4CAA4C;AAAA,EAC9D;AACA,MAAI,KAAK,QAAQ,KAAK,CAAC,QAAQ,OAAO,QAAQ,YAAY,IAAI,WAAW,KAAK,IAAI,GAAG;AACnF,UAAM,IAAI,MAAM,oCAAoC;AAAA,EACtD;AACF;AAEA,SAAS,aAAa,OAAe,MAAsB;AACzD,gBAAc,OAAO,MAAM,CAAC;AAC5B,MAAI,QAAQ,MAAM,EAAG,OAAM,IAAI,MAAM,GAAG,IAAI,eAAe;AAC3D,SAAO;AACT;AAEA,SAAS,cAAc,OAAe,MAAc,SAAyB;AAC3E,MAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,SAAS;AAC/C,UAAM,IAAI,MAAM,GAAG,IAAI,gDAAgD,OAAO,GAAG;AAAA,EACnF;AACA,SAAO;AACT;AAEA,SAAS,aAAa,OAAe,MAAc,SAAiB,SAAyB;AAC3F,MAAI,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,WAAW,QAAQ,SAAS;AACjE,UAAM,IAAI,MAAM,GAAG,IAAI,oBAAoB,OAAO,QAAQ,OAAO,GAAG;AAAA,EACtE;AACA,SAAO;AACT;AAEA,SAAS,UAAU,KAAmB,SAAyB;AAC7D,SAAO,KAAK,MAAM,IAAI,IAAI,OAAO;AACnC;AAEA,SAAS,QAAW,KAAmB,OAA0B;AAC/D,QAAM,SAAS,CAAC,GAAG,KAAK;AACxB,WAAS,QAAQ,OAAO,SAAS,GAAG,QAAQ,GAAG,SAAS,GAAG;AACzD,UAAM,SAAS,UAAU,KAAK,QAAQ,CAAC;AACvC,UAAM,QAAQ,OAAO,KAAK;AAC1B,UAAM,cAAc,OAAO,MAAM;AACjC,QAAI,UAAU,UAAa,gBAAgB,OAAW;AACtD,WAAO,KAAK,IAAI;AAChB,WAAO,MAAM,IAAI;AAAA,EACnB;AACA,SAAO;AACT;AAEA,SAAS,WAAW,MAA4B;AAC9C,MAAI,QAAQ,SAAS;AACrB,SAAO,MAAM;AACX,aAAS;AACT,QAAI,QAAQ;AACZ,YAAQ,KAAK,KAAK,QAAS,UAAU,IAAK,QAAQ,CAAC;AACnD,aAAS,QAAQ,KAAK,KAAK,QAAS,UAAU,GAAI,QAAQ,EAAE;AAC5D,aAAS,QAAS,UAAU,QAAS,KAAK;AAAA,EAC5C;AACF;AAEA,SAAS,aAAa,MAAc,MAA2B;AAC7D,SAAO;AAAA,IACL,YAAY,OAAO;AAAA,IACnB,WAAW,OAAO;AAAA,IAClB,YAAY;AAAA,IACZ,qBAAqB;AAAA,IACrB,WAAW;AAAA,IACX,qBAAqB;AAAA,IACrB,mBAAmB;AAAA,IACnB,UAAU;AAAA,IACV,WAAW;AAAA,IACX,mBAAmB;AAAA,IACnB,WAAW;AAAA,IACX,iBAAiB;AAAA,IACjB,cAAc,CAAC;AAAA,EACjB;AACF;;;AChjBA,IAAM,SAAuD;AAAA,EAC3D,IAAI,CAAC,IAAI,CAAC;AAAA,EACV,MAAM,CAAC,GAAG,CAAC;AAAA,EACX,MAAM,CAAC,GAAG,EAAE;AAAA,EACZ,OAAO,CAAC,GAAG,CAAC;AACd;AAEO,SAAS,cACd,MACA,SACA,UAAiC,CAAC,GAChB;AAClB,QAAM,SAAS,QAAQ,UAAU;AACjC,QAAM,QAAoB;AAAA,IACxB,UAAU,gBAAgB,KAAK,KAAK;AAAA,IACpC;AAAA,IACA,WAAW,QAAQ,aAAa;AAAA,IAChC,MAAM,QAAQ,QAAQ;AAAA,IACtB,WAAW,QAAQ,aAAa;AAAA,IAChC,OAAO,SAAS;AAAA,IAChB,aAAa;AAAA,IACb,aAAa,CAAC;AAAA,IACd,eAAe,CAAC;AAAA,IAChB,cAAc,CAAC;AAAA,IACf,gBAAgB,CAAC;AAAA,IACjB,eAAe,CAAC;AAAA,EAClB;AACA,QAAM,QAA0B,CAAC;AACjC,WAAS,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACtD,UAAM,YAAY,QAAQ,KAAK;AAC/B,QAAI,CAAC,UAAW;AAChB,UAAM,KAAK,YAAY,MAAM,OAAO,WAAW,QAAQ,CAAC,CAAC;AAAA,EAC3D;AACA,SAAO;AAAA,IACL,OAAO,gBAAgB,KAAK;AAAA,IAC5B;AAAA,IACA,SAAS;AAAA,MACP,eAAe,uBAAuB,MAAM,QAAQ;AAAA,MACpD,MAAM,MAAM;AAAA,MACZ,WAAW,MAAM;AAAA,MACjB,QAAQ,MAAM;AAAA,MACd,OAAO,MAAM;AAAA,MACb,aAAa,MAAM;AAAA,MACnB,aAAa,MAAM,YAAY;AAAA,MAC/B,cAAc,MAAM,aAAa;AAAA,MACjC,gBAAgB,MAAM,eAAe;AAAA,MACrC,eAAe,MAAM,cAAc;AAAA,MACnC,cAAc,MAAM,OAAO,CAAC,SAAS,CAAC,KAAK,KAAK,EAAE;AAAA,MAClD,mBAAmB,MAAM,OAAO,CAAC,SAAS,KAAK,WAAW,MAAM,EAAE;AAAA,IACpE;AAAA,EACF;AACF;AAEA,SAAS,YACP,MACA,OACA,WACA,MACgB;AAChB,QAAM,SAAS,gBAAgB,KAAK;AACpC,QAAM,SAAuB,CAAC;AAC9B,MAAI,CAAC,MAAM,MAAO,QAAO,OAAO,MAAM,WAAW,QAAQ,OAAO,OAAO,QAAQ,MAAM;AAErF,QAAM,CAAC,IAAI,EAAE,IAAI,OAAO,SAAS;AACjC,QAAM,SAAS,KAAK,MAAM,SAAS,MAAM,IAAI,MAAM,SAAS,MAAM,EAAE;AACpE,MAAI,UAAU,MAAM,MAAM,MAAM,KAAK;AACnC,WAAO,OAAO,MAAM,WAAW,QAAQ,OAAO,OAAO,mBAAmB,MAAM;AAAA,EAChF;AAEA,QAAM,OAAO,KAAK,MAAM,KAAK,CAAC,SAAS,SAAS,KAAK,UAAU,MAAM,CAAC;AACtE,MAAI,QAAQ,CAAC,MAAM,YAAY,SAAS,KAAK,EAAE,GAAG;AAChD,QAAI,MAAM,QAAQ,GAAG;AACnB,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACF;AAAA,IACF;AACA,UAAM,QAAQ;AACd,UAAM,YAAY,KAAK,KAAK,EAAE;AAC9B,WAAO,KAAK,EAAE,MAAM,aAAa,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;AAAA,EAC5D;AAEA,QAAM,WAAW;AACjB,QAAM,SAAS,KAAK,QAAQ,KAAK,CAAC,SAAS,SAAS,KAAK,UAAU,MAAM,CAAC;AAC1E,MAAI,QAAQ,SAAS,SAAS,CAAC,MAAM,cAAc,SAAS,OAAO,EAAE,GAAG;AACtE,UAAM,cAAc,KAAK,OAAO,EAAE;AAClC,UAAM,QAAQ;AACd,WAAO,KAAK,EAAE,MAAM,eAAe,IAAI,OAAO,GAAG,CAAC;AAAA,EACpD;AACA,MAAI,QAAQ,SAAS,WAAW,CAAC,MAAM,aAAa,SAAS,OAAO,EAAE,GAAG;AACvE,QAAI,MAAM,OAAO,GAAG;AAClB,YAAM,QAAQ;AACd,YAAM,aAAa,KAAK,OAAO,EAAE;AACjC,YAAM,aAAa,OAAO;AAC1B,aAAO,KAAK;AAAA,QACV,MAAM;AAAA,QACN,IAAI,OAAO;AAAA,QACX,SAAS;AAAA,QACT,WAAW,OAAO;AAAA,MACpB,CAAC;AAAA,IACH,OAAO;AACL,aAAO,KAAK,EAAE,MAAM,qBAAqB,IAAI,OAAO,GAAG,CAAC;AAAA,IAC1D;AAAA,EACF;AACA,MAAI,QAAQ,SAAS,UAAU,CAAC,MAAM,eAAe,SAAS,OAAO,EAAE,GAAG;AACxE,UAAM,eAAe,KAAK,OAAO,EAAE;AACnC,UAAM,SAAS,KAAK,IAAI,GAAG,MAAM,SAAS,OAAO,MAAM;AACvD,WAAO,KAAK,EAAE,MAAM,gBAAgB,IAAI,OAAO,IAAI,QAAQ,OAAO,OAAO,CAAC;AAAA,EAC5E;AACA,MAAI,QAAQ,SAAS,cAAc,CAAC,MAAM,cAAc,SAAS,OAAO,EAAE,GAAG;AAC3E,UAAM,cAAc,KAAK,OAAO,EAAE;AAClC,UAAM,QAAQ,MAAM;AACpB,UAAM,SAAS,KAAK,IAAI,MAAM,WAAW,MAAM,SAAS,OAAO,QAAQ;AACvE,WAAO,KAAK,EAAE,MAAM,gBAAgB,IAAI,OAAO,IAAI,UAAU,MAAM,SAAS,MAAM,CAAC;AAAA,EACrF;AACA,MAAI,MAAM,UAAU,KAAK,MAAM,OAAO;AACpC,UAAM,QAAQ;AACd,WAAO,KAAK,EAAE,MAAM,MAAM,CAAC;AAAA,EAC7B;AACA,MAAI,SAAS,MAAM,UAAU,KAAK,IAAI,KAAK,CAAC,MAAM,aAAa;AAC7D,UAAM,cAAc;AACpB,WAAO,KAAK,EAAE,MAAM,aAAa,CAAC;AAAA,EACpC;AACA,SAAO,OAAO,MAAM,WAAW,QAAQ,OAAO,MAAM,MAAM,MAAM;AAClE;AAEA,SAAS,OACP,MACA,WACA,QACA,OACA,OACA,QACA,QACgB;AAChB,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,OAAO,gBAAgB,KAAK;AAAA,EAC9B;AACF;;;AC3IA,IAAM,aAA4D;AAAA,EAChE,IAAI,EAAE,IAAI,MAAM,IAAI,SAAI;AAAA,EACxB,MAAM,EAAE,IAAI,QAAQ,IAAI,SAAI;AAAA,EAC5B,MAAM,EAAE,IAAI,QAAQ,IAAI,SAAI;AAAA,EAC5B,OAAO,EAAE,IAAI,SAAS,IAAI,SAAI;AAChC;AAEA,IAAM,gBAAgB;AAAA,EACpB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,gBAAgB;AAAA,EACpB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,oBAAoB;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAM,oBAAoB;AAAA,EACxB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEO,SAAS,cAAc,UAAwB,CAAC,GAAc;AACnE,QAAM,WAAW,oBAAoB,OAAO;AAC5C,QAAM,OAAO,WAAW,QAAQ;AAChC,QAAM,OAAO,kBAAkB,MAAM,SAAS,QAAQ;AACtD,QAAM,SAAS,cAAc,MAAM,KAAK,SAAS,KAAK,YAAY;AAClE,iBAAe,SAAS,UAAU,OAAO,SAAS,IAAI;AACtD,QAAM,WAA0B;AAAA,IAC9B,KAAK,qBAAqB,MAAM,KAAK,cAAc,SAAS,UAAU,SAAS,KAAK;AAAA,IACpF,OAAO,YAAY,SAAS,QAAQ;AAAA,IACpC,SAAS,wBAAwB,KAAK,SAAS,SAAS,UAAU,SAAS,KAAK;AAAA,IAChF,WAAW,gBAAgB,SAAS,QAAQ;AAAA,EAC9C;AACA,QAAM,WAAW,eAAe,UAAU,MAAM,QAAQ;AACxD,QAAM,SAAS,aAAa,UAAU,MAAM,OAAO,SAAS,KAAK,QAAQ,MAAM;AAC/E,SAAO;AAAA,IACL,eAAe;AAAA,IACf,SAAS;AAAA,IACT;AAAA,IACA,cAAc,KAAK;AAAA,IACnB,SAAS,KAAK;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACF;AAUO,SAAS,oBAAoB,UAAwB,CAAC,GAAyB;AACpF,QAAM,WAAW,QAAQ,YAAY;AACrC,QAAM,WAAW,QAAQ,YAAY;AACrC,MAAI,CAAC,CAAC,WAAW,sBAAsB,gBAAgB,EAAE,SAAS,QAAQ,GAAG;AAC3E,UAAM,IAAI,MAAM,qBAAqB,QAAQ,EAAE;AAAA,EACjD;AACA,MAAI,aAAa,QAAQ,aAAa,KAAM,OAAM,IAAI,MAAM,qBAAqB,QAAQ,EAAE;AAC3F,QAAM,WAAiC;AAAA,IACrC,MAAM,QAAQ,QAAQ,QAAQ,GAAG,QAAQ,CAAC;AAAA,IAC1C,MAAM,WAAW,QAAQ,QAAQ,IAAI,QAAQ,CAAC;AAAA,IAC9C,MAAM,WAAW,QAAQ,QAAQ,IAAI,QAAQ,CAAC;AAAA,IAC9C,OAAO,aAAa,QAAQ,SAAS,GAAG,SAAS,GAAG,CAAC;AAAA,IACrD,WAAW,QAAQ,QAAQ,aAAa,GAAG,aAAa,CAAC;AAAA,IACzD,YAAY,QAAQ,QAAQ,cAAc,GAAG,cAAc,CAAC;AAAA,IAC5D,WAAW,QAAQ,QAAQ,aAAa,GAAG,aAAa,CAAC;AAAA,IACzD,eAAe,QAAQ,QAAQ,iBAAiB,GAAG,iBAAiB,CAAC;AAAA,IACrE;AAAA,IACA;AAAA,IACA,OAAO,QAAQ,QAAQ,SAAS,GAAG,SAAS,CAAC;AAAA,IAC7C,aAAa,QAAQ,QAAQ,eAAe,GAAG,eAAe,CAAC;AAAA,IAC/D,aAAa,QAAQ,QAAQ,eAAe,KAAK,eAAe,CAAC;AAAA,EACnE;AACA,MAAI,aAAa,wBAAwB,SAAS,aAAa,GAAG;AAChE,UAAM,IAAI,MAAM,8DAA8D;AAAA,EAChF;AACA,MAAI,aAAa,wBAAwB,SAAS,gBAAgB,GAAG;AACnE,UAAM,IAAI,MAAM,sEAAsE;AAAA,EACxF;AACA,MAAI,aAAa,oBAAoB,SAAS,YAAY,GAAG;AAC3D,UAAM,IAAI,MAAM,yDAAyD;AAAA,EAC3E;AACA,SAAO;AACT;AAEA,SAAS,WAAW,SAAqC;AACvD,MAAI,YAAqB;AACzB,WAAS,SAAS,GAAG,SAAS,QAAQ,aAAa,UAAU,GAAG;AAC9D,UAAM,gBAAgB,QAAQ,OAAO;AACrC,QAAI;AACF,YAAM,OAAO,sBAAsB;AAAA,QACjC,MAAM,QAAQ;AAAA,QACd,MAAM,QAAQ;AAAA,QACd,OAAO,QAAQ;AAAA,QACf,MAAM;AAAA,QACN,eAAe,QAAQ;AAAA,QACvB,IAAI,aAAa,QAAQ,IAAI,IAAI,QAAQ,IAAI,IAAI,QAAQ,IAAI;AAAA,MAC/D,CAAC;AACD,YAAM,OAAO,sBAAsB,MAAM;AAAA,QACvC,MAAM,gBAAgB;AAAA,QACtB,WAAW,QAAQ;AAAA,QACnB,YAAY,QAAQ;AAAA,QACpB,WAAW,QAAQ;AAAA,QACnB,eAAe,QAAQ;AAAA,MACzB,CAAC;AACD,YAAM,aAAa,sBAAsB,IAAI;AAC7C,UAAI,CAAC,WAAW,MAAO,OAAM,IAAI,MAAM,WAAW,OAAO,KAAK,GAAG,CAAC;AAClE,WAAK,WAAW,SAAS,qBAAqB,KAAK,QAAQ,aAAa;AACtE,cAAM,IAAI,MAAM,oCAAoC,QAAQ,WAAW,GAAG;AAAA,MAC5E;AACA,YAAM,OAAO,kBAAkB,MAAM,QAAQ,QAAQ;AACrD,YAAM,SAAS,cAAc,MAAM,KAAK,SAAS,KAAK,YAAY;AAClE,qBAAe,QAAQ,UAAU,OAAO,SAAS,IAAI;AACrD,aAAO;AAAA,IACT,SAAS,OAAO;AACd,kBAAY;AAAA,IACd;AAAA,EACF;AACA,QAAM,SAAS,qBAAqB,QAAQ,gBAAgB,UAAU,OAAO,KAAK;AAClF,QAAM,IAAI;AAAA,IACR,uCAAuC,QAAQ,WAAW,2BAA2B,MAAM;AAAA,EAC7F;AACF;AAEA,SAAS,kBACP,MACA,UACsD;AACtD,MAAI,aAAa,WAAW;AAC1B,WAAO;AAAA,MACL,cAAc,EAAE,QAAQ,GAAG,WAAW,GAAG,MAAM,GAAG,WAAW,EAAE;AAAA,MAC/D,SAAS,cAAc,aAAa,MAAM,KAAK,OAAO,KAAK,IAAI,CAAC;AAAA,IAClE;AAAA,EACF;AACA,MAAI,aAAa,sBAAsB;AACrC,UAAM,WAAW,KAAK,QAAQ,KAAK,CAAC,SAAS,KAAK,SAAS,UAAU;AACrE,UAAM,QAAQ,KAAK,QAAQ,KAAK,CAAC,SAAS,KAAK,SAAS,OAAO;AAC/D,QAAI,CAAC,YAAY,CAAC,MAAO,OAAM,IAAI,MAAM,qDAAqD;AAC9F,UAAM,QAAQ,aAAa,MAAM,KAAK,OAAO,SAAS,QAAQ;AAC9D,UAAM,QAAQ,aAAa,MAAM,SAAS,UAAU,MAAM,QAAQ;AAClE,UAAM,QAAQ,aAAa,MAAM,MAAM,UAAU,KAAK,IAAI;AAC1D,UAAM,YAAY,CAAC,GAAG,KAAK,EAAE,QAAQ,EAAE,MAAM,GAAG,KAAK,IAAI,IAAI,MAAM,MAAM,CAAC;AAC1E,QAAI,UAAU;AAAA,MACZ,GAAG,cAAc,KAAK;AAAA,MACtB,GAAG,cAAc,KAAK;AAAA,MACtB,GAAG,cAAc,KAAK;AAAA,MACtB,GAAG,cAAc,SAAS;AAAA,IAC5B;AACA,UAAM,eAAe;AAAA,MACnB,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,MAAM,KAAK,MAAM,SAAS;AAAA,MAC1B,WAAW;AAAA,IACb;AACA,UAAM,aAAa,cAAc,MAAM,SAAS,YAAY;AAC5D,UAAM,OAAO,cAAc,MAAM,WAAW,MAAM,QAAQ;AAC1D,QAAI,KAAM,WAAU,CAAC,GAAG,SAAS,MAAM,IAAI;AAC3C,WAAO,EAAE,cAAc,QAAQ;AAAA,EACjC;AACA,QAAM,OAAO,KAAK,QAAQ,KAAK,CAAC,SAAS,KAAK,SAAS,MAAM;AAC7D,MAAI,CAAC,KAAM,OAAM,IAAI,MAAM,gCAAgC;AAC3D,QAAM,SAAS,aAAa,MAAM,KAAK,OAAO,KAAK,QAAQ;AAC3D,QAAM,YAAY,aAAa,MAAM,KAAK,UAAU,KAAK,IAAI,EAAE,MAAM,GAAG,EAAE;AAC1E,SAAO;AAAA,IACL,cAAc;AAAA,MACZ,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,MAAM,KAAK,MAAM,SAAS;AAAA,MAC1B,WAAW;AAAA,IACb;AAAA,IACA,SAAS,CAAC,GAAG,cAAc,MAAM,GAAG,GAAG,cAAc,SAAS,CAAC;AAAA,EACjE;AACF;AAEA,SAAS,eAAe,UAAwB,SAAuB,MAAkB;AACvF,MACE,aAAa,cACZ,CAAC,QAAQ,eAAe,CAAC,QAAQ,SAAS,QAAQ,kBAAkB,uBAAuB,KAAK,IAAI,IACrG;AACA,UAAM,IAAI,MAAM,wDAAwD;AAAA,EAC1E;AACA,MACE,aAAa,yBACZ,CAAC,QAAQ,eACR,QAAQ,kBAAkB,uBAAuB,KAAK,IAAI,KAC1D,QAAQ,eAAe,KACvB,QAAQ,gBAAgB,KACxB,QAAQ,eAAe,IACzB;AACA,UAAM,IAAI,MAAM,8DAA8D;AAAA,EAChF;AACA,MAAI,aAAa,qBAAqB,QAAQ,SAAS,QAAQ,oBAAoB,IAAI;AACrF,UAAM,IAAI,MAAM,0DAA0D;AAAA,EAC5E;AACF;AAEA,SAAS,eACP,SACA,MACA,UACQ;AACR,QAAM,OAAO,QAAQ,aAAa;AAClC,QAAM,QAAQ,OAAO,6BAAS;AAC9B,QAAM,SAAS,OACX,CAAC,4BAAQ,4BAAQ,4BAAQ,cAAI,IAC7B,CAAC,OAAO,SAAS,WAAW,WAAW;AAC3C,QAAM,WACJ,KAAK,SAAS,QAAQ,OAClB,GAAG,OAAO,iBAAO,MAAM,KAAK,QAAQ,IAAI,KACxC,GAAG,OAAO,iBAAO,MAAM,KAAK,QAAQ,IAAI,KAAK,OAAO,yCAAW,qBAAqB,KAAK,KAAK,IAAI;AACxG,SAAO;AAAA,IACL,KAAK,KAAK;AAAA,IACV;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS,OAAO,CAAC,CAAC;AAAA,IAClB;AAAA,IACA,SAAS;AAAA,IACT;AAAA,IACA,SAAS,OAAO,CAAC,CAAC;AAAA,IAClB;AAAA,IACA,SAAS;AAAA,IACT;AAAA,IACA,SAAS,OAAO,CAAC,CAAC;AAAA,IAClB;AAAA,IACA,SAAS;AAAA,IACT;AAAA,IACA,SAAS,OAAO,CAAC,CAAC;AAAA,IAClB;AAAA,IACA,SAAS;AAAA,IACT;AAAA,EACF,EAAE,KAAK,IAAI;AACb;AAEA,SAAS,aACP,SACA,MACA,SACA,aACQ;AACR,QAAM,KAAK,QAAQ,aAAa;AAChC,QAAM,OAAO,KACT;AAAA,IACE,CAAC,4BAAQ,QAAQ,aAAa;AAAA,IAC9B,CAAC,kCAAS,QAAQ,IAAI;AAAA,IACtB,CAAC,kCAAS,QAAQ,SAAS;AAAA,IAC3B,CAAC,kCAAS,QAAQ,MAAM;AAAA,IACxB,CAAC,4BAAQ,QAAQ,QAAQ,WAAM,QAAG;AAAA,IAClC,CAAC,8CAAW,QAAQ,cAAc,WAAM,QAAG;AAAA,IAC3C,CAAC,4BAAQ,QAAQ,WAAW;AAAA,IAC5B,CAAC,kCAAS,QAAQ,YAAY;AAAA,IAC9B,CAAC,kCAAS,QAAQ,cAAc;AAAA,IAChC,CAAC,wCAAU,QAAQ,aAAa;AAAA,IAChC,CAAC,oDAAY,QAAQ,YAAY;AAAA,EACnC,IACA;AAAA,IACE,CAAC,kBAAkB,QAAQ,aAAa;AAAA,IACxC,CAAC,kBAAkB,QAAQ,IAAI;AAAA,IAC/B,CAAC,uBAAuB,QAAQ,SAAS;AAAA,IACzC,CAAC,oBAAoB,QAAQ,MAAM;AAAA,IACnC,CAAC,SAAS,QAAQ,QAAQ,QAAQ,IAAI;AAAA,IACtC,CAAC,yBAAyB,QAAQ,cAAc,QAAQ,IAAI;AAAA,IAC5D,CAAC,gBAAgB,QAAQ,WAAW;AAAA,IACpC,CAAC,iBAAiB,QAAQ,YAAY;AAAA,IACtC,CAAC,mBAAmB,QAAQ,cAAc;AAAA,IAC1C,CAAC,uBAAuB,QAAQ,aAAa;AAAA,IAC7C,CAAC,sCAAsC,QAAQ,YAAY;AAAA,EAC7D;AACJ,SAAO;AAAA,IACL,KAAK,KAAK,6BAAS,YAAY;AAAA,IAC/B;AAAA,IACA,GAAG,KAAK,iBAAO,MAAM,KAAK,QAAQ,IAAI;AAAA,IACtC,GAAI,KAAK,SAAS,QAAQ,OACtB,CAAC,IACD;AAAA,MACE,GAAG,KAAK,yCAAW,qBAAqB,KAAK,KAAK,IAAI;AAAA,IACxD;AAAA,IACJ;AAAA,IACA,KAAK,KAAK,iBAAO,MAAM,MAAM,KAAK,iBAAO,QAAQ;AAAA,IACjD;AAAA,IACA,GAAG,KAAK,IAAI,CAAC,CAAC,OAAO,KAAK,MAAM,KAAK,KAAK,MAAM,OAAO,KAAK,CAAC,IAAI;AAAA,IACjE;AAAA,IACA,GAAG,KAAK,mCAAU,qBAAqB,KAAK,WAAW;AAAA,IACvD;AAAA,EACF,EAAE,KAAK,IAAI;AACb;AAEA,SAAS,qBACP,MACA,SACA,UACA,OACQ;AACR,QAAM,UAAU,yBAAyB,MAAM,UAAU,KAAK;AAC9D,QAAM,UAAU,wBAAwB,MAAM,QAAQ;AACtD,MAAI,aAAa,MAAM;AACrB,WAAO;AAAA,MACL,2BAAO,KAAK,IAAI,SAAI,KAAK,IAAI,8HAA0B,YAAY,KAAK,IAAI,CAAC,gEAAc,KAAK,IAAI;AAAA,MACpG,2BAAO,uBAAuB,KAAK,KAAK,CAAC,iCAAQ,uBAAuB,KAAK,IAAI,CAAC;AAAA,MAClF;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA,6IAA0B,SAAS,QAAQ,MAAM,CAAC,6CAAU,SAAS,QAAQ,SAAS,CAAC,eAAK,mBAAmB,SAAS,QAAQ,CAAC;AAAA,IACnI,EAAE,KAAK,IAAI;AAAA,EACb;AACA,SAAO;AAAA,IACL,iBAAiB,KAAK,IAAI,aAAa,KAAK,IAAI,0EAA0E,YAAY,KAAK,IAAI,CAAC,0CAA0C,KAAK,IAAI;AAAA,IACnM,mBAAmB,uBAAuB,KAAK,KAAK,CAAC,wBAAwB,uBAAuB,KAAK,IAAI,CAAC;AAAA,IAC9G;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,wCAAwC,QAAQ,MAAM,gBAAgB,OAAO,QAAQ,MAAM,CAAC,yBAAyB,QAAQ,SAAS,KAAK,mBAAmB,SAAS,QAAQ,CAAC;AAAA,EAClL,EAAE,KAAK,IAAI;AACb;AAEA,SAAS,yBAAyB,MAAY,UAAoB,OAAuB;AACvF,QAAM,UAAU,MAAM,KAAK,EAAE,QAAQ,KAAK,KAAK,GAAG,CAAC,GAAG,UAAU,QAAQ,CAAC,EAAE,IAAI,CAAC,QAAQ;AACtF,UAAM,QAAQ,MAAM;AAAA,MAAK,EAAE,QAAQ,KAAK,KAAK;AAAA,MAAG,CAAC,GAAG,UAClD,UAAU,MAAM,KAAK,KAAK,QAAQ,CAAC,CAAC,MAAM,MAAM,UAAU;AAAA,IAC5D;AACA,UAAM,QACJ,aAAa,OACT,CAAC,SAAI,GAAG,UAAK,GAAG,GAAG,UAAK,SAAI,GAAG,QAAG,EAAE,QAAQ,CAAC,IAC7C,OAAO,GAAG;AAChB,WAAO,GAAG,SAAS,SAAI,GAAG,QAAG,GAAG,oBAAoB,OAAO,QAAQ,CAAC;AAAA,EACtE,CAAC;AACD,SAAO,aAAa,OAChB,CAAC,wLAAkC,GAAG,QAAQ,KAAK,UAAK,CAAC,QAAG,EAAE,KAAK,IAAI,IACvE,CAAC,0DAA0D,GAAG,QAAQ,KAAK,KAAK,CAAC,GAAG,EAAE,KAAK,IAAI;AACrG;AAEA,SAAS,oBAAoB,OAAiB,UAA4B;AACxE,QAAM,QAAkB,CAAC;AACzB,QAAM,SAAmB,CAAC;AAC1B,WAAS,QAAQ,GAAG,QAAQ,MAAM,QAAQ,SAAS,GAAG;AACpD,KAAC,MAAM,KAAK,MAAM,SAAS,QAAQ,QAAQ,KAAK,QAAQ,CAAC;AAAA,EAC3D;AACA,MAAI,aAAa,MAAM;AACrB,QAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,QAAI,OAAO,WAAW,EAAG,QAAO;AAChC,UAAMC,SAAQ,KAAK,MAAM,MAAM,SAAS,CAAC;AACzC,QAAI,MAAM,UAAUA,OAAO,QAAO,eAAK,aAAa,OAAO,QAAQ,CAAC;AACpE,QAAI,OAAO,UAAUA,OAAO,QAAO,eAAK,aAAa,QAAQ,QAAQ,CAAC;AACtE,WAAO,GAAG,aAAa,OAAO,QAAQ,CAAC,2BAAO,aAAa,QAAQ,QAAQ,CAAC;AAAA,EAC9E;AACA,MAAI,MAAM,WAAW,EAAG,QAAO;AAC/B,MAAI,OAAO,WAAW,EAAG,QAAO;AAChC,QAAM,QAAQ,KAAK,MAAM,MAAM,SAAS,CAAC;AACzC,MAAI,MAAM,UAAU,MAAO,QAAO,iCAAiC,aAAa,OAAO,QAAQ,CAAC,WAAW,MAAM,WAAW,IAAI,cAAc,WAAW;AACzJ,MAAI,OAAO,UAAU,MAAO,QAAO,8BAA8B,aAAa,QAAQ,QAAQ,CAAC,WAAW,OAAO,WAAW,IAAI,iBAAiB,cAAc;AAC/J,SAAO,GAAG,aAAa,OAAO,QAAQ,CAAC,IAAI,MAAM,WAAW,IAAI,cAAc,WAAW,KAAK,aAAa,QAAQ,QAAQ,CAAC,IAAI,OAAO,WAAW,IAAI,iBAAiB,cAAc;AACvL;AAEA,SAAS,aAAa,SAAmB,UAA4B;AACnE,QAAM,SAAkC,CAAC;AACzC,MAAI,QAAQ,QAAQ,CAAC;AACrB,MAAI,MAAM,QAAQ,CAAC;AACnB,MAAI,UAAU,UAAa,QAAQ,OAAW,QAAO;AACrD,aAAW,SAAS,QAAQ,MAAM,CAAC,GAAG;AACpC,QAAI,UAAU,MAAM,GAAG;AACrB,YAAM;AACN;AAAA,IACF;AACA,WAAO,KAAK,CAAC,OAAO,GAAG,CAAC;AACxB,YAAQ;AACR,UAAM;AAAA,EACR;AACA,SAAO,KAAK,CAAC,OAAO,GAAG,CAAC;AACxB,QAAM,QAAQ,OAAO;AAAA,IAAI,CAAC,CAAC,MAAM,EAAE,MACjC,aAAa,OACT,SAAS,KACP,SAAI,IAAI,WACR,SAAI,IAAI,qBAAM,EAAE,WAClB,SAAS,KACP,QAAQ,IAAI,KACZ,SAAS,IAAI,IAAI,EAAE;AAAA,EAC3B;AACA,MAAI,MAAM,WAAW,EAAG,QAAO,MAAM,CAAC,KAAK;AAC3C,QAAM,OAAO,MAAM,GAAG,EAAE;AACxB,SAAO,aAAa,OAChB,GAAG,MAAM,MAAM,GAAG,EAAE,EAAE,KAAK,QAAG,CAAC,SAAI,IAAI,KACvC,GAAG,MAAM,MAAM,GAAG,EAAE,EAAE,KAAK,IAAI,CAAC,QAAQ,IAAI;AAClD;AAEA,SAAS,wBAAwB,MAAY,UAA4B;AACvE,QAAM,YAAsB,CAAC;AAC7B,QAAM,gBAAgB,KAAK,MAAM,IAAI,CAAC,SAAS,uBAAuB,KAAK,QAAQ,CAAC;AACpF,QAAM,OAAO,KAAK,QAAQ,OAAO,CAAC,SAAS,KAAK,SAAS,KAAK;AAC9D,QAAM,SAAS,KAAK,QAAQ,OAAO,CAAC,SAAS,KAAK,SAAS,OAAO;AAClE,QAAM,QAAQ,KAAK,QAAQ,OAAO,CAAC,SAAS,KAAK,SAAS,MAAM;AAChE,QAAM,YAAY,KAAK,QAAQ,OAAO,CAAC,SAAS,KAAK,SAAS,UAAU;AACxE,MAAI,aAAa,MAAM;AACrB,QAAI,cAAc,SAAS,EAAG,WAAU,KAAK,GAAG,eAAe,eAAe,QAAQ,CAAC,GAAG,cAAc,SAAS,IAAI,WAAM,EAAE,8DAAY;AACzI,UAAM,eAAe,KAAK,IAAI,CAAC,SAAS,uBAAuB,KAAK,QAAQ,CAAC;AAC7E,QAAI,aAAa,SAAS,EAAG,WAAU,KAAK,GAAG,eAAe,cAAc,QAAQ,CAAC,GAAG,aAAa,SAAS,IAAI,WAAM,EAAE,4CAAS;AACnI,eAAW,SAAS,OAAQ,WAAU,KAAK,GAAG,uBAAuB,MAAM,QAAQ,CAAC,6FAAkB,SAAS,MAAM,SAAS,CAAC,0BAAM;AACrI,UAAM,gBAAgB,MAAM,IAAI,CAAC,SAAS,uBAAuB,KAAK,QAAQ,CAAC;AAC/E,QAAI,cAAc,SAAS,EAAG,WAAU,KAAK,GAAG,eAAe,eAAe,QAAQ,CAAC,GAAG,cAAc,SAAS,IAAI,WAAM,EAAE,0EAAc;AAC3I,UAAM,oBAAoB,UAAU,IAAI,CAAC,SAAS,uBAAuB,KAAK,QAAQ,CAAC;AACvF,QAAI,kBAAkB,SAAS,EAAG,WAAU,KAAK,GAAG,eAAe,mBAAmB,QAAQ,CAAC,GAAG,kBAAkB,SAAS,IAAI,WAAM,EAAE,0EAAc;AAAA,EACzJ,OAAO;AACL,QAAI,cAAc,SAAS,EAAG,WAAU,KAAK,GAAG,eAAe,eAAe,QAAQ,CAAC,IAAI,cAAc,WAAW,IAAI,2BAA2B,4BAA4B,GAAG;AAClL,UAAM,eAAe,KAAK,IAAI,CAAC,SAAS,uBAAuB,KAAK,QAAQ,CAAC;AAC7E,QAAI,aAAa,SAAS,EAAG,WAAU,KAAK,GAAG,eAAe,cAAc,QAAQ,CAAC,IAAI,aAAa,WAAW,IAAI,mBAAmB,oBAAoB,GAAG;AAC/J,eAAW,SAAS,OAAQ,WAAU,KAAK,GAAG,uBAAuB,MAAM,QAAQ,CAAC,iCAAiC,MAAM,SAAS,YAAY,OAAO,MAAM,SAAS,CAAC,GAAG;AAC1K,UAAM,gBAAgB,MAAM,IAAI,CAAC,SAAS,uBAAuB,KAAK,QAAQ,CAAC;AAC/E,QAAI,cAAc,SAAS,EAAG,WAAU,KAAK,GAAG,eAAe,eAAe,QAAQ,CAAC,IAAI,cAAc,WAAW,IAAI,iCAAiC,kCAAkC,GAAG;AAC9L,UAAM,oBAAoB,UAAU,IAAI,CAAC,SAAS,uBAAuB,KAAK,QAAQ,CAAC;AACvF,QAAI,kBAAkB,SAAS,EAAG,WAAU,KAAK,GAAG,eAAe,mBAAmB,QAAQ,CAAC,IAAI,kBAAkB,WAAW,IAAI,qCAAqC,sCAAsC,GAAG;AAAA,EACpN;AACA,SAAO,UAAU,SAAS,IAAI,UAAU,KAAK,IAAI,IAAI,aAAa,OAAO,2DAAc;AACzF;AAEA,SAAS,YAAY,UAA4B;AAC/C,UAAQ,aAAa,OAAO,gBAAgB,eAAe,KAAK,IAAI;AACtE;AAEA,SAAS,gBAAgB,UAA4B;AACnD,UAAQ,aAAa,OAAO,oBAAoB,mBAAmB,KAAK,IAAI;AAC9E;AAEA,SAAS,wBACP,SACA,UACA,OACQ;AACR,QAAM,OAAO,gBAAgB,OAAO;AACpC,MAAI,aAAa,MAAM;AACrB,UAAM,aAAa,CAAC,gBAAM,gBAAM,gBAAM,UAAK,cAAI;AAC/C,UAAMC,WAAU,KAAK,IAAI,CAAC,KAAK,UAAU;AACvC,YAAM,YAAY,UAAU,IAAI,6BAAS,YAAY,QAAQ,SAAS,WAAW,MAAM;AACvF,aAAO,GAAG,aAAa,cAAI,SAAI,WAAW,IAAI,SAAS,EAAE,EAAE,eAAK,SAAS,IAAI,KAAK,CAAC;AAAA,IACrF,CAAC;AACD,WAAO,aAAaA,UAAS,UAAK,QAAG;AAAA,EACvC;AACA,QAAM,UAAU,KAAK,IAAI,CAAC,KAAK,UAAU;AACvC,UAAM,YACJ,UAAU,IACN,8BACA,QAAQ,MAAM,IACZ,4BACA;AACR,UAAM,iBAA8C;AAAA,MAClD,IAAI,CAAC,MAAM,QAAQ;AAAA,MACnB,MAAM,CAAC,QAAQ,UAAU;AAAA,MACzB,MAAM,CAAC,QAAQ,aAAa;AAAA,MAC5B,OAAO,CAAC,SAAS,cAAc;AAAA,IACjC;AACA,UAAM,QAAQ,eAAe,IAAI,SAAS;AAC1C,UAAM,YAAY,OAAO,QAAQ,SAAS,MAAM,MAAM,KAAK,WAAW,IAAI,SAAS,EAAE;AACrF,WAAO,GAAG,SAAS,IAAI,SAAS,IAAI,IAAI,KAAK,QAAQ,OAAO,IAAI,KAAK,CAAC;AAAA,EACxE,CAAC;AACD,SAAO,aAAa,SAAS,MAAM,GAAG;AACxC;AAEA,SAAS,aAAa,SAAmB,WAAmB,YAA4B;AACtF,QAAM,YAAsB,CAAC;AAC7B,WAAS,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACtD,cAAU,KAAK,GAAG,QAAQ,MAAM,OAAO,QAAQ,CAAC,EAAE,KAAK,SAAS,CAAC,GAAG,UAAU,EAAE;AAAA,EAClF;AACA,SAAO,UAAU,KAAK,IAAI;AAC5B;AAEA,SAAS,gBAAgB,SAAsE;AAC7F,QAAM,OAAuD,CAAC;AAC9D,aAAW,aAAa,SAAS;AAC/B,UAAM,QAAQ,KAAK,GAAG,EAAE;AACxB,QAAI,OAAO,cAAc,UAAW,OAAM,SAAS;AAAA,QAC9C,MAAK,KAAK,EAAE,WAAW,OAAO,EAAE,CAAC;AAAA,EACxC;AACA,SAAO;AACT;AAEA,SAAS,cAAc,MAA2B;AAChD,QAAM,UAAuB,CAAC;AAC9B,WAAS,QAAQ,GAAG,QAAQ,KAAK,QAAQ,SAAS,GAAG;AACnD,UAAM,UAAU,KAAK,KAAK;AAC1B,UAAM,QAAQ,KAAK,QAAQ,CAAC;AAC5B,QAAI,CAAC,WAAW,CAAC,MAAO;AACxB,UAAM,KAAK,QAAQ,MAAM,MAAM;AAC/B,UAAM,KAAK,QAAQ,MAAM,MAAM;AAC/B,YAAQ,KAAK,OAAO,KAAK,OAAO,OAAO,IAAI,SAAS,OAAO,KAAK,SAAS,OAAO;AAAA,EAClF;AACA,SAAO;AACT;AAEA,SAAS,cAAc,MAAY,UAAkC;AACnE,QAAM,aAAuC;AAAA,IAC3C,CAAC,MAAM,KAAK,SAAS,MAAM,GAAG,SAAS,GAAG,CAAC;AAAA,IAC3C,CAAC,QAAQ,KAAK,SAAS,MAAM,GAAG,SAAS,GAAG,CAAC;AAAA,IAC7C,CAAC,QAAQ,KAAK,SAAS,KAAK,SAAS,MAAM,CAAC,CAAC;AAAA,IAC7C,CAAC,SAAS,KAAK,SAAS,KAAK,SAAS,MAAM,CAAC,CAAC;AAAA,EAChD;AACA,SAAO,WAAW,KAAK,CAAC,CAAC,EAAE,MAAM,MAAM,UAAU,MAAM,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK;AAClF;AAEA,SAAS,eAAe,QAAkB,UAA4B;AACpE,MAAI,OAAO,UAAU,EAAG,QAAO,OAAO,CAAC,KAAK;AAC5C,QAAM,OAAO,OAAO,GAAG,EAAE;AACzB,SAAO,aAAa,OAChB,GAAG,OAAO,MAAM,GAAG,EAAE,EAAE,KAAK,QAAG,CAAC,SAAI,IAAI,KACxC,GAAG,OAAO,MAAM,GAAG,EAAE,EAAE,KAAK,IAAI,CAAC,QAAQ,IAAI;AACnD;AAEA,SAAS,mBAAmB,OAAqB,UAA4B;AAC3E,MAAI,aAAa,MAAM;AACrB,UAAMC,QAAO,MAAM,OAAO,IAAI,2BAAO,SAAS,MAAM,IAAI,CAAC,uBAAQ;AACjE,UAAMC,aAAY,MAAM,YAAY,IAAI,eAAK,SAAS,MAAM,SAAS,CAAC,uBAAQ;AAC9E,WAAO,GAAGD,KAAI,SAAIC,UAAS;AAAA,EAC7B;AACA,QAAM,OAAO,MAAM,OAAO,IAAI,GAAG,MAAM,IAAI,OAAO,OAAO,MAAM,IAAI,CAAC,KAAK;AACzE,QAAM,YAAY,MAAM,YAAY,IAAI,GAAG,MAAM,SAAS,YAAY,OAAO,MAAM,SAAS,CAAC,KAAK;AAClG,SAAO,GAAG,IAAI,QAAQ,SAAS;AACjC;AAEA,SAAS,SAAS,OAAuB;AACvC,QAAM,QAAQ,CAAC,UAAK,UAAK,UAAK,UAAK,UAAK,UAAK,UAAK,UAAK,UAAK,UAAK,QAAG;AACpE,SAAO,MAAM,KAAK,KAAK,OAAO,KAAK;AACrC;AAEA,SAAS,OAAO,OAAuB;AACrC,SAAO,UAAU,IAAI,KAAK;AAC5B;AAEA,SAAS,QAAQ,OAAe,MAAc,SAAyB;AACrE,MAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,SAAS;AAC/C,UAAM,IAAI,MAAM,GAAG,IAAI,gDAAgD,OAAO,GAAG;AAAA,EACnF;AACA,SAAO;AACT;AAEA,SAAS,WAAW,OAAe,MAAc,SAAyB;AACxE,UAAQ,OAAO,MAAM,OAAO;AAC5B,MAAI,QAAQ,MAAM,EAAG,OAAM,IAAI,MAAM,GAAG,IAAI,eAAe;AAC3D,SAAO;AACT;AAEA,SAAS,aAAa,OAAe,MAAc,SAAiB,SAAyB;AAC3F,MAAI,CAAC,OAAO,SAAS,KAAK,KAAK,QAAQ,WAAW,QAAQ,SAAS;AACjE,UAAM,IAAI,MAAM,GAAG,IAAI,oBAAoB,OAAO,QAAQ,OAAO,GAAG;AAAA,EACtE;AACA,SAAO;AACT;;;AJhmBA,IAAM,UAAU;AAWhB,IAAI;AACF,QAAM,SAAS,eAAe,QAAQ,KAAK,MAAM,CAAC,CAAC;AACnD,MAAI,WAAW,QAAQ;AACrB,YAAQ,OAAO,MAAM,SAAS,CAAC;AAAA,EACjC,WAAW,WAAW,WAAW;AAC/B,YAAQ,OAAO,MAAM,GAAG,OAAO;AAAA,CAAI;AAAA,EACrC,OAAO;AACL,UAAM,QAAQ,cAAc,OAAO,KAAK;AACxC,QAAI,OAAO,WAAW,QAAQ;AAC5B,cAAQ,OAAO,MAAM,OAAO,YAAY,aAAa,MAAM,WAAW,MAAM,MAAM;AAAA,IACpF,WAAW,OAAO,YAAY,YAAY;AACxC,cAAQ,OAAO;AAAA,QACb,GAAG,KAAK;AAAA,UACN;AAAA,YACE,eAAe,MAAM;AAAA,YACrB,MAAM;AAAA,YACN,SAAS,MAAM;AAAA,YACf,MAAM;AAAA,cACJ,IAAI,MAAM,KAAK;AAAA,cACf,eAAe,MAAM,KAAK;AAAA,cAC1B,eAAe,MAAM,KAAK;AAAA,cAC1B,SAAS,MAAM,KAAK;AAAA,YACtB;AAAA,YACA,UAAU,MAAM;AAAA,YAChB,UAAU,MAAM;AAAA,UAClB;AAAA,UACA;AAAA,UACA;AAAA,QACF,CAAC;AAAA;AAAA,MACH;AAAA,IACF,OAAO;AACL,cAAQ,OAAO;AAAA,QACb,GAAG,KAAK;AAAA,UACN;AAAA,YACE,eAAe,MAAM;AAAA,YACrB,MAAM;AAAA,YACN,SAAS,MAAM;AAAA,YACf,MAAM;AAAA,cACJ,IAAI,MAAM,KAAK;AAAA,cACf,eAAe,MAAM,KAAK;AAAA,cAC1B,eAAe,MAAM,KAAK;AAAA,YAC5B;AAAA,YACA,SAAS,MAAM,OAAO;AAAA,YACtB,aAAa,MAAM,QAAQ;AAAA,YAC3B,QAAQ,MAAM;AAAA,UAChB;AAAA,UACA;AAAA,UACA;AAAA,QACF,CAAC;AAAA;AAAA,MACH;AAAA,IACF;AAAA,EACF;AACF,SAAS,OAAO;AACd,QAAM,UAAU,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;AACrE,UAAQ,OAAO,MAAM,cAAc,OAAO;AAAA;AAAA,CAAuC;AACjF,UAAQ,WAAW;AACrB;AAEA,SAAS,eAAe,MAAiD;AACvE,QAAM,SAAS,CAAC,GAAG,IAAI;AACvB,MAAI,UAAmB;AACvB,QAAM,QAAQ,OAAO,CAAC;AACtB,MAAI,SAAS,CAAC,MAAM,WAAW,GAAG,GAAG;AACnC,WAAO,MAAM;AACb,QAAI,UAAU,cAAc,UAAU,IAAK,WAAU;AAAA,aAC5C,UAAU,YAAY,UAAU,IAAK,WAAU;AAAA,QACnD,OAAM,IAAI,MAAM,oBAAoB,KAAK,EAAE;AAAA,EAClD;AAEA,QAAM,QAAsB,CAAC;AAC7B,MAAI,SAAuB;AAC3B,WAAS,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,GAAG;AACrD,UAAM,MAAM,OAAO,KAAK;AACxB,QAAI,CAAC,IAAK;AACV,UAAM,aAAa,IAAI,QAAQ,GAAG;AAClC,UAAM,OAAO,cAAc,IAAI,IAAI,MAAM,GAAG,UAAU,IAAI;AAC1D,UAAM,SAAS,cAAc,IAAI,IAAI,MAAM,aAAa,CAAC,IAAI;AAC7D,QAAI,SAAS,YAAY,SAAS,KAAM,QAAO;AAC/C,QAAI,SAAS,eAAe,SAAS,KAAM,QAAO;AAClD,QAAI,SAAS,UAAU;AACrB,eAAS;AACT;AAAA,IACF;AACA,UAAM,QAAQ,UAAU,OAAO,EAAE,KAAK;AACtC,QAAI,UAAU,OAAW,OAAM,IAAI,MAAM,qBAAqB,IAAI,GAAG;AACrE,YAAQ,MAAM;AAAA,MACZ,KAAK;AACH,cAAM,OAAO,aAAa,OAAO,IAAI;AACrC;AAAA,MACF,KAAK;AACH,cAAM,OAAO,aAAa,OAAO,IAAI;AACrC;AAAA,MACF,KAAK;AACH,cAAM,OAAO,aAAa,OAAO,IAAI;AACrC;AAAA,MACF,KAAK;AACH,cAAM,QAAQ,YAAY,OAAO,IAAI;AACrC;AAAA,MACF,KAAK;AACH,cAAM,YAAY,aAAa,OAAO,IAAI;AAC1C;AAAA,MACF,KAAK;AACH,cAAM,aAAa,aAAa,OAAO,IAAI;AAC3C;AAAA,MACF,KAAK;AACH,cAAM,YAAY,aAAa,OAAO,IAAI;AAC1C;AAAA,MACF,KAAK;AACH,cAAM,gBAAgB,aAAa,OAAO,IAAI;AAC9C;AAAA,MACF,KAAK;AACH,cAAM,WAAW;AACjB;AAAA,MACF,KAAK;AAAA,MACL,KAAK;AACH,cAAM,WAAW;AACjB;AAAA,MACF,KAAK;AACH,cAAM,QAAQ,aAAa,OAAO,IAAI;AACtC;AAAA,MACF,KAAK;AACH,cAAM,cAAc,aAAa,OAAO,IAAI;AAC5C;AAAA,MACF,KAAK;AACH,cAAM,cAAc,aAAa,OAAO,IAAI;AAC5C;AAAA,MACF,KAAK;AACH,YAAI,UAAU,UAAU,UAAU,OAAQ,OAAM,IAAI,MAAM,mBAAmB,KAAK,EAAE;AACpF,iBAAS;AACT;AAAA,MACF;AACE,cAAM,IAAI,MAAM,mBAAmB,IAAI,EAAE;AAAA,IAC7C;AAAA,EACF;AACA,SAAO,EAAE,SAAS,QAAQ,MAAM;AAClC;AAEA,SAAS,aAAa,OAAe,MAAsB;AACzD,MAAI,CAAC,WAAW,KAAK,KAAK,EAAG,OAAM,IAAI,MAAM,GAAG,IAAI,uBAAuB;AAC3E,SAAO,OAAO,KAAK;AACrB;AAEA,SAAS,YAAY,OAAe,MAAsB;AACxD,QAAM,SAAS,OAAO,KAAK;AAC3B,MAAI,CAAC,OAAO,SAAS,MAAM,EAAG,OAAM,IAAI,MAAM,GAAG,IAAI,qBAAqB;AAC1E,SAAO;AACT;AAEA,SAAS,WAAmB;AAC1B,SAAO,aAAa,OAAO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAsC7B;","names":["next","limit","clauses","keys","treasures"]}