cubing 0.49.2 → 0.50.0

package/dist/lib/cubing/chunks/search-dynamic-solve-fto-EY5ZVAGO.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../../../src/cubing/vendor/mpl/xyzzy/fto-solver.js"],
-  "sourcesContent": ["/* ftosolver.js - An FTO solver\nversion 0.5.1 (2021-04-20)\n\nCopyright (c) 2016, 2020, 2021\n\nFrom https://gist.github.com/torchlight/9a5c53da09d8e090756a228f4b5f3471\nOriginally MIT licensed, added to `cubing.js` under the GPL license by permission from the author (@torchlight/xyzzy).\n\nCompatibility note:\nThis is targeted at Firefox / Spidermonkey releases from 2019 and onwards. It might not run on older\nJavaScript engines. Recent Chrome / Node releases should also work, but are not tested as much.\n*/\n\nimport { randomUIntBelow } from \"random-uint-below\";\n\n/* Helper functions */\n\nfunction counter(A) {\n  let counts = [];\n  for (let a of A) {\n    counts[a] = (counts[a] || 0) + 1;\n  }\n  return counts;\n}\n\n/* Combinatoric functions */\n\nfunction factorial(n) {\n  if (n < 2) {\n    return n;\n  }\n  let f = 1;\n  for (let i = 2; i <= n; i++) {\n    f *= i;\n  }\n  return f;\n}\n\nfunction C(n, k) {\n  if (k < 0 || k > n) {\n    return 0;\n  }\n  if (k === 0 || k === n) {\n    return 1;\n  }\n  let c = 1;\n  for (let i = 0; i < k; i++) {\n    c = ((c * (n - i)) / (i + 1)) | 0;\n  }\n  return c;\n}\n\nfunction C4(n, k0, k1, k2, k3 = n - k0 - k1 - k2) {\n  return C(n, k0 + k1) * C(k0 + k1, k0) * C(k2 + k3, k2);\n}\n\nfunction permutation_to_index(perm) {\n  perm = perm.slice();\n  let n = perm.length;\n  let f = factorial(n - 1);\n  let ind = 0;\n  while (n > 1) {\n    n--;\n    // invariant: f === factorial(n)\n    // also, perm stores meaningful values up to perm[n]\n    let e = perm[0];\n    ind += e * f;\n    for (let i = 0; i < n; i++) {\n      let x = perm[i + 1];\n      perm[i] = x - (x > e);\n    }\n    f /= n;\n  }\n  return ind;\n}\n\nfunction index_to_permutation(ind, n) {\n  let perm = [];\n  let f = factorial(n - 1);\n  for (let i = 0; i < n; i++) {\n    perm[i] = (ind / f) | 0;\n    ind %= f;\n    f /= n - 1 - i;\n  }\n  for (let i = n - 2; i >= 0; i--) {\n    for (let j = i + 1; j < n; j++) {\n      perm[j] += +(perm[j] >= perm[i]);\n    }\n  }\n  return perm;\n}\n\nfunction permutation_parity(A) {\n  let n = A.length;\n  let parity = 0;\n  for (let i = 0; i < n - 1; i++) {\n    for (let j = i; j < n; j++) {\n      if (A[i] > A[j]) {\n        parity ^= 1;\n      }\n    }\n  }\n  return parity;\n}\n\nfunction index_to_evenpermutation(ind, n) {\n  let perm = [];\n  let f = factorial(n - 1) / 2;\n  let parity = 0;\n  for (let i = 0; i < n - 1; i++) {\n    perm[i] = (ind / f) | 0;\n    ind %= f;\n    f /= n - 1 - i;\n  }\n  perm[n - 1] = 0;\n  for (let i = n - 2; i >= 0; i--) {\n    for (let j = i + 1; j < n; j++) {\n      if (perm[j] >= perm[i]) {\n        perm[j]++;\n      } else {\n        parity ^= 1;\n      }\n    }\n  }\n  if (parity === 1) {\n    [perm[n - 2], perm[n - 1]] = [perm[n - 1], perm[n - 2]];\n  }\n  return perm;\n}\n\nfunction evenpermutation_to_index(perm) {\n  return permutation_to_index(perm) >> 1;\n}\n\nlet [evenpermutation8_to_index, index_to_evenpermutation8] = (() => {\n  let index_in_set_bits = new Int8Array(256 * 8);\n  let look_up_set_bits = new Int8Array(256 * 8);\n  for (let i = 0; i < 256; i++) {\n    for (let j = 0, counter = 0; j < 8; j++) {\n      if (((i >>> j) & 1) === 0) {\n        continue;\n      }\n      index_in_set_bits[(j << 8) | i] = counter;\n      look_up_set_bits[(counter << 8) | i] = j;\n      counter++;\n    }\n  }\n\n  function evenpermutation8_to_index(perm) {\n    let unused = 0xff; // track which values in 0..7 haven't been used so far\n    let f = 2520; // = 7!/2\n    let ind = 0;\n    for (let i = 0; i < 6; i++) {\n      let v = perm[i];\n      ind += index_in_set_bits[unused | (v << 8)] * f;\n      unused &= ~(1 << v);\n      f /= 7 - i;\n    }\n    return ind;\n  }\n\n  // note: this is *not* a drop-in replacement for index_to_evenpermutation!\n  function index_to_evenpermutation8(ind, perm) {\n    let unused = 0xff;\n    let f = 2520; // = 7!/2\n    let parity = 0;\n    for (let i = 0; i < 6; i++) {\n      let a = (ind / f) | 0;\n      ind -= a * f;\n      parity ^= a & 1;\n      let v = look_up_set_bits[unused | (a << 8)];\n      perm[i] = v;\n      unused &= ~(1 << v);\n      f /= 7 - i;\n    }\n    // the last two elements are uniquely determined by the others\n    perm[6] = look_up_set_bits[unused | (parity << 8)];\n    perm[7] = look_up_set_bits[unused | ((parity ^ 1) << 8)];\n    return perm;\n  }\n\n  return [evenpermutation8_to_index, index_to_evenpermutation8];\n})();\n\nfunction random_permutation(n) {\n  let p = [0];\n  for (let i = 1; i < n; i++) {\n    let r = randomUIntBelow(i + 1);\n    p[i] = p[r];\n    p[r] = i;\n  }\n  return p;\n}\n\nfunction random_even_permutation(n) {\n  let p = random_permutation(n);\n  if (permutation_parity(p) === 1) {\n    [p[0], p[1]] = [p[1], p[0]];\n  }\n  return p;\n}\n\nfunction comb_to_index(l) {\n  let bits = l.length;\n  let ones = 0;\n  for (let i = 0; i < bits; i++) {\n    ones += +(l[i] === 1);\n  }\n  let zeros = bits - ones;\n  if (zeros === 0 || ones === 0 || bits === 1) {\n    return 0;\n  }\n  let b = C(bits - 1, ones);\n  let ind = 0;\n  for (let i = 0; zeros > 0 && ones > 0 && bits > 1; i++) {\n    bits--;\n    if (l[i] === 0) {\n      b = (b * --zeros) / bits;\n    } else {\n      // l[i] === 1\n      ind += b;\n      b = (b * ones--) / bits;\n    }\n  }\n  return ind;\n}\n\nfunction index_to_comb(ind, ones, bits) {\n  let zeros = bits - ones;\n  let b = C(bits - 1, ones);\n  let l = [];\n  let n = bits - 1;\n  for (let i = 0; i < n; i++) {\n    bits--;\n    if (ind < b) {\n      l.push(0);\n      b = (b * --zeros) / bits;\n    } else {\n      l.push(1);\n      ind -= b;\n      b = (b * ones--) / bits;\n    }\n  }\n  l.push(ones);\n  return l;\n}\n\n// this is \"incorrect\" for n=0 but that's out of scope\nfunction ctz(n) {\n  n |= 0;\n  return 31 - Math.clz32(n ^ (n - 1));\n}\n\nlet comb_lookup_tables = {};\nfunction generate_comb_lookup_tables(n, k) {\n  // 2 <= n <= 28, 0 <= k <= n\n  n |= 0;\n  k |= 0;\n  let key = `${n} ${k}`;\n  if (comb_lookup_tables[key]) {\n    return comb_lookup_tables[key];\n  }\n  let total = C(n, k);\n  let index_to_comb_table = new Uint32Array(total);\n  let comb_to_index_table = new Uint32Array(1 << n).fill(-1);\n  for (let i = 0, c = (1 << k) - 1; i < total; i++) {\n    index_to_comb_table[i] = c;\n    comb_to_index_table[c] = i;\n    let t = c | (c - 1);\n    c = (t + 1) | (((~t & -~t) - 1) >> (ctz(c) + 1));\n  }\n  return (comb_lookup_tables[key] = [index_to_comb_table, comb_to_index_table]);\n}\n\nfunction popcount(n) {\n  n |= 0;\n  let c = 0;\n  while (n !== 0) {\n    n &= n - 1;\n    c++;\n  }\n  return c;\n}\n\nfunction spread_bits(n) {\n  n &= 0xffff;\n  n = (n | (n << 8)) & 0x00ff00ff;\n  n = (n | (n << 4)) & 0x0f0f0f0f;\n  n = (n | (n << 2)) & 0x33333333;\n  n = (n | (n << 1)) & 0x55555555;\n  return n;\n}\n\nfunction interleave_bits(x, y) {\n  return spread_bits(x) | (spread_bits(y) << 1);\n}\n\nlet comb4_lookup_tables = {};\nfunction generate_comb4_lookup_tables(n, k0, k1, k2, k3) {\n  // 3 <= n <= 14\n  // 0 <= k0,k1,k2,k3 <= n\n  // n = k0 + k1 + k2 + k3\n  // WARNING: This does not return the combinations in sorted order.\n  // (but if only two of k0,k1,k2,k3 are nonzero, then they will be sorted)\n  n |= 0;\n  k0 |= 0;\n  k1 |= 0;\n  k2 |= 0;\n  k3 |= 0;\n  if (n !== k0 + k1 + k2 + k3) {\n    throw new Error(\"generate_comb4_lookup_tables: invalid parameters\");\n  }\n  let key = [n, k0, k1, k2, k3].join(\" \");\n  if (comb4_lookup_tables[key]) {\n    return comb4_lookup_tables[key];\n  }\n  let [itcl, ctil] = generate_comb_lookup_tables(n, k1 + k3);\n  let [itch, ctih] = generate_comb_lookup_tables(n, k2 + k3);\n  let total = C4(n, k0, k1, k2, k3);\n  let index_to_comb4_table = new Uint32Array(total);\n  let comb4_to_index_table = new Uint32Array(4 ** n).fill(-1);\n  for (let i = 0, index = 0; i < itch.length; i++) {\n    let ch = itch[i];\n    for (let j = 0; j < itcl.length; j++) {\n      let cl = itcl[j];\n      if (popcount(cl & ch) === k3) {\n        let c = interleave_bits(cl, ch);\n        index_to_comb4_table[index] = c;\n        comb4_to_index_table[c] = index;\n        index++;\n      }\n    }\n  }\n  return (comb4_lookup_tables[key] = [\n    index_to_comb4_table,\n    comb4_to_index_table,\n  ]);\n}\n\nfunction compose(A, B) {\n  let C = [];\n  for (let i = 0; i < B.length; i++) {\n    C[i] = A[B[i]];\n  }\n  return C;\n}\n\nfunction compose3(A, B, C) {\n  let D = [];\n  for (let i = 0; i < C.length; i++) {\n    D[i] = A[B[C[i]]];\n  }\n  return D;\n}\n\nfunction compose_o(A, B) {\n  let p = compose(A[0], B[0]);\n  let o = [];\n  let n = B[0].length;\n  for (let i = 0; i < n; i++) {\n    o[i] = A[1][B[0][i]] ^ B[1][i];\n  }\n  return [p, o];\n}\n\n/*\nfunction permutation_from_cycle(cycle, n)\n{\n\tlet perm = [];\n\tfor (let i = 0; i < n; i++) {perm[i] = i};\n\tfor (let i = 0; i < cycle.length; i++)\n\t{\n\t\tperm[cycle[i]] = cycle[(i + 1) % cycle.length];\n\t}\n\treturn perm;\n}\n*/\n\nfunction permutation_from_cycles(cycles, n) {\n  let perm = [];\n  for (let i = 0; i < n; i++) {\n    perm[i] = i;\n  }\n  for (let cycle of cycles) {\n    for (let i = 0; i < cycle.length; i++) {\n      perm[cycle[i]] = cycle[(i + 1) % cycle.length];\n    }\n  }\n  return perm;\n}\n\nfunction reduce_permutation(perm, keep) {\n  // perm: a permutation\n  // keep: array of booleans, of the same length as perm\n  let n = perm.length;\n  let count = Array(n).fill(0);\n  for (let i = 1; i < n; i++) {\n    count[i] = count[i - 1] + keep[i - 1];\n  }\n  let nn = count[n - 1] + keep[n - 1];\n  let reduced = Array(nn);\n  for (let i = 0; i < n; i++) {\n    if (keep[i]) {\n      reduced[count[i]] = count[perm[i]];\n    }\n  }\n  return reduced;\n}\n\nfunction invert_permutation(perm) {\n  let n = perm.length;\n  let inverse = Array(n);\n  for (let i = 0; i < n; i++) {\n    inverse[perm[i]] = i;\n  }\n  return inverse;\n}\n\nfunction gcd(a, b) {\n  while (a && b) {\n    [a, b] = [b % a, a];\n  }\n  return Math.abs(a + b);\n}\n\nfunction lcm(a, b) {\n  return (a * b) / gcd(a, b);\n}\n\nfunction permutation_order(perm) {\n  let order = 1;\n  let n = perm.length;\n  let visited = Array(n).fill(false);\n  let i = -1;\n  while (true) {\n    i = visited.indexOf(false, i + 1);\n    if (i === -1) {\n      break;\n    }\n    let cycle_length = 0;\n    let j = i;\n    while (!visited[j]) {\n      visited[j] = true;\n      j = perm[j];\n      cycle_length++;\n    }\n    //console.log(cycle_length);\n    order = lcm(order, cycle_length);\n  }\n  return order;\n}\n\n/*\nFacelet layout:\n\t\t\t\tU\t\t\t\t\t\t\t\t\tB\n\t\t8\t7\t6\t5\t4\t\t\t\t\t67\t68\t69\t70\t71\n\t44\t\t3\t2\t1\t\t49\t\t\t22\t\t64\t65\t66\t\t35\n\t43\t39\t\t0\t\t46\t50\t\t\t23\t19\t\t63\t\t30\t34\nL\t42\t38\t36\t\t45\t47\t51\tR\tBR\t24\t20\t18\t\t27\t29\t33\tBL\n\t41\t37\t\t9\t\t48\t52\t\t\t25\t21\t\t54\t\t28\t32\n\t40\t\t10\t11\t12\t\t53\t\t\t26\t\t57\t56\t55\t\t31\n\t\t13\t14\t15\t16\t17\t\t\t\t\t62\t61\t60\t59\t58\n\t\t\t\tF\t\t\t\t\t\t\t\t\tD\n\nWe'll be using the facelet permutations as the underlying representation. This specific labelling\ngives us three symmetries that can be written very compactly, and this turns out to be enough to\ngenerate any face move from any other face move.\n\nWhich is nice, because I don't have an FTO and it would be very error prone if I were to write out\nevery move individually.\n\nX = T2\nY = Ro Lo' (I think)\nZ = mirroring so that U swaps with L and F swaps with R\n\nFaces / colours (Lanlan colour scheme):\n0: U (white)\n1: F (red)\n2: BR (grey)\n3: BL (orange)\n4: L (purple)\n5: R (green)\n6: D (yellow)\n7: B (blue)\n*/\n\nlet solved_state = Array(72)\n  .fill()\n  .map((_, i) => (i / 9) | 0);\n\nlet move_U = permutation_from_cycles(\n  [\n    [0, 4, 8],\n    [1, 6, 3],\n    [2, 5, 7],\n    [9, 22, 35],\n    [45, 67, 44],\n    [47, 68, 43],\n    [46, 69, 39],\n    [50, 70, 38],\n    [49, 71, 36],\n  ],\n  72,\n);\nlet move_Ui = compose(move_U, move_U);\n\nlet move_X = Array(72)\n  .fill()\n  .map((_, i) => ((i / 18) | 0) * 18 + ((i + 9) % 18));\nlet move_Y = Array(72)\n  .fill()\n  .map((_, i) => ((i / 36) | 0) * 36 + ((i + 18) % 36));\nlet move_Z = Array(72)\n  .fill()\n  .map((_, i) => (i + 36) % 72);\n\n// Z changes sign, so this is really setting up to U' rather than U\nlet move_L = compose3(move_Z, move_Ui, move_Z);\nlet move_F = compose3(move_X, move_U, move_X);\nlet move_R = compose3(move_X, move_L, move_X);\n\n//let move_BR = compose3(move_Y, move_U, move_Y);\n//let move_BL = compose3(move_Y, move_F, move_Y);\n//let move_B = compose3(move_Y, move_R, move_Y);\n//let move_D = compose3(move_Y, move_L, move_Y);\n\nlet move_Us = permutation_from_cycles(\n  [\n    [10, 24, 30],\n    [11, 23, 34],\n    [12, 19, 33],\n    [42, 48, 64],\n    [41, 52, 65],\n    [37, 51, 66],\n  ],\n  72,\n);\nlet move_Uw = compose(move_U, move_Us);\nlet move_Uwi = compose(move_Uw, move_Uw);\n\nlet move_Lw = compose3(move_Z, move_Uwi, move_Z);\nlet move_Fw = compose3(move_X, move_Uw, move_X);\nlet move_Rw = compose3(move_X, move_Lw, move_X);\n\nlet colour_map = Array(72)\n  .fill()\n  .map((_, i) => (i / 9) | 0);\n\nlet corner_piece_facelets = [\n  [0, 45, 9, 36], // U-F\n  [4, 67, 22, 49], // U-BR\n  [8, 44, 35, 71], // U-BL\n  [13, 58, 31, 40], // F-BL\n  [17, 53, 26, 62], // F-BR\n  [18, 63, 27, 54], // BR-BL\n];\n\nlet edge_piece_facelets = [\n  [1, 46], // U-R\n  [3, 39], // U-L\n  [6, 69], // U-B\n  [10, 37], // F-L\n  [33, 42], // BL-L\n  [12, 48], // F-R  *\n  [15, 60], // F-D  *\n  [24, 51], // BR-R *\n  [19, 64], // BR-B **\n  [28, 55], // BL-D **\n  [30, 66], // BL-B **\n  [21, 57], // BR-D **\n];\n\nlet centreA_piece_facelets = Array(12)\n  .fill()\n  .map((_, i) => ((i / 3) | 0) * 9 + [2, 5, 7][i % 3]);\nlet centreB_piece_facelets = centreA_piece_facelets.map((x) => x + 36);\n\n/*\nfacelet definition sanity test:\nall corner facelets are 0,4,8 mod 9; facelet order is always in U,R,U,R orbits\nall edge facelets are 1,3,6 mod 9; facelet order is always in U,R orbits\nall centre facelets are 2,5,7 mod 9\n\nfunction facelet_sanity_test()\n{\nif (corner_piece_facelets.length !== 6) {console.log('wrong number of corner pieces'); return;}\nif (edge_piece_facelets.length !== 12) {console.log('wrong number of edge pieces'); return;}\nif (!corner_piece_facelets.every(x => {return x.every(y => y % 9 % 4 === 0) && x[0] < 36 && x[2] < 36 && x[1] >= 36 && x[3] >= 36;}))\n{\n\tconsole.log('corner pieces weird');\n\treturn;\n}\nif (!edge_piece_facelets.every(x => {return x.every(y => [1,3,6].indexOf(y % 9) !== -1) && x[0] < 36 && x[1] >= 36;}))\n{\n\tconsole.log('edge pieces weird');\n\treturn;\n}\n}\n\n*/\n\nfunction identify_corner_piece(colourA, colourB) {\n  // return a 2-tuple [p, o] where\n  // p in {0,1,2,3,4,5} is the corner piece's ID and\n  // o in {0,1} is its orientation\n  for (let i = 0; i < 6; i++) {\n    if (\n      colourA === colour_map[corner_piece_facelets[i][0]] &&\n      colourB === colour_map[corner_piece_facelets[i][2]]\n    ) {\n      return [i, 0];\n    } else if (\n      colourA === colour_map[corner_piece_facelets[i][2]] &&\n      colourB === colour_map[corner_piece_facelets[i][0]]\n    ) {\n      return [i, 1];\n    }\n  }\n  throw new Error(\"unknown corner piece\");\n}\n\nfunction identify_edge_piece(colourA, colourB) {\n  // return p in {0..11} the edge piece's ID\n  // (edges are not flippable on the FTO)\n  for (let i = 0; i < 12; i++) {\n    if (\n      colourA === colour_map[edge_piece_facelets[i][0]] &&\n      colourB === colour_map[edge_piece_facelets[i][1]]\n    ) {\n      return i;\n    }\n    if (\n      colourB === colour_map[edge_piece_facelets[i][0]] &&\n      colourA === colour_map[edge_piece_facelets[i][1]]\n    ) {\n      return i;\n    }\n  }\n  throw new Error(\"unknown edge piece\");\n}\n\nfunction get_corner_piece(facelets, location) {\n  return identify_corner_piece(\n    facelets[corner_piece_facelets[location][0]],\n    facelets[corner_piece_facelets[location][2]],\n  );\n}\n\nfunction get_edge_piece(facelets, location) {\n  return identify_edge_piece(\n    facelets[edge_piece_facelets[location][0]],\n    facelets[edge_piece_facelets[location][1]],\n  );\n}\n\nfunction set_corner_piece(facelets, location, value, orientation) {\n  let indices = corner_piece_facelets[location];\n  let colours = corner_piece_facelets[value].map((x) => colour_map[x]);\n  if (orientation % 2 !== 0) {\n    colours = [colours[2], colours[3], colours[0], colours[1]];\n  }\n  for (let i = 0; i < 4; i++) {\n    facelets[indices[i]] = colours[i];\n  }\n}\n\nfunction set_edge_piece(facelets, location, value) {\n  let indices = edge_piece_facelets[location];\n  let colours = edge_piece_facelets[value].map((x) => colour_map[x]);\n  for (let i = 0; i < 2; i++) {\n    facelets[indices[i]] = colours[i];\n  }\n}\n\nfunction convert_move_to_permutations(move) {\n  let state = move.map((x) => colour_map[x]);\n  //console.log(state);\n  let cp_raw = Array(6)\n    .fill()\n    .map((_, i) => get_corner_piece(state, i));\n  let cp_half = cp_raw.map(([p, o]) => p + 6 * o);\n  let cp = cp_half.concat(cp_half.map((x) => (x + 6) % 12));\n  let ep = Array(12)\n    .fill()\n    .map((_, i) => get_edge_piece(state, i));\n  let ap = Array(12)\n    .fill()\n    .map((_, i) =>\n      centreA_piece_facelets.indexOf(move[centreA_piece_facelets[i]]),\n    );\n  let bp = Array(12)\n    .fill()\n    .map((_, i) =>\n      centreB_piece_facelets.indexOf(move[centreB_piece_facelets[i]]),\n    );\n  return { cp: cp, ep: ep, ap: ap, bp: bp };\n}\n\nlet moves = [\n  move_U,\n  move_L,\n  move_F,\n  move_R,\n  move_Uw,\n  move_Lw,\n  move_Fw,\n  move_Rw,\n];\nlet move_names = [\"U\", \"L\", \"F\", \"R\", \"u\", \"l\", \"f\", \"r\"];\n\nlet move_permutations = moves.map(convert_move_to_permutations);\n\n/*\nlet commute_table = (function () {\n\tlet n = moves.length;\n\tlet t = Array(n);\n\tfor (let i = 0; i < n; i++)\n\t{\n\t\tt[i] = Array(n);\n\t\tfor (let j = 0; j < n; j++)\n\t\t{\n\t\t\tlet a = compose(moves[i], moves[j]);\n\t\t\tlet b = compose(moves[j], moves[i]);\n\t\t\tt[i][j] = (a.join(' ') === b.join(' '));\n\t\t}\n\t}\n\treturn t;\n})();\n*/\n\n// generate a random state with the BR-BL corner solved\nfunction random_state() {\n  let facelets = Array(72);\n  let cp = random_even_permutation(5);\n  cp.push(5);\n  let co = Array(4)\n    .fill()\n    .map((_) => randomUIntBelow(2));\n  co.push(co.reduce((x, y) => x ^ y));\n  co.push(0);\n  for (let i = 0; i < 6; i++) {\n    set_corner_piece(facelets, i, cp[i], co[i]);\n  }\n\n  let ep = random_even_permutation(12);\n  for (let i = 0; i < 12; i++) {\n    set_edge_piece(facelets, i, ep[i]);\n  }\n\n  let a = random_permutation(12).map((x) => (x / 3) | 0);\n  let b = random_permutation(12).map((x) => 4 + ((x / 3) | 0));\n  for (let i = 0; i < 12; i++) {\n    facelets[centreA_piece_facelets[i]] = a[i];\n    facelets[centreB_piece_facelets[i]] = b[i];\n  }\n  return facelets;\n}\n\nfunction stringify_move_sequence(move_sequence, no_wide = false) {\n  if (no_wide) {\n    const U = 0;\n    const L = 1;\n    const F = 2;\n    const R = 3;\n    const D = 4;\n    const BR = 5;\n    const B = 6;\n    const BL = 7;\n    move_sequence = move_sequence.map((x) => x.slice());\n    let ordering = [U, L, F, R, D, BR, B, BL];\n    let rotations = [\n      [U, R, BR, B, D, BL, L, F],\n      [BL, L, U, B, R, BR, D, F],\n      [BL, D, F, L, R, U, B, BR],\n      [F, D, BR, R, B, U, L, BL],\n    ];\n    rotations = rotations.concat(rotations.map((p) => invert_permutation(p)));\n    for (let i = 0; i < move_sequence.length; i++) {\n      if (move_sequence[i][0] < 4) {\n        // it's already a single-layer turn\n        move_sequence[i][0] = ordering[move_sequence[i][0]];\n      } else {\n        // it's a double-layer turn and we need to Do Stuff\n        let m = ordering[move_sequence[i][0]];\n        let r = move_sequence[i][1];\n        move_sequence[i][0] = m;\n        ordering = compose(r === 1 ? rotations[m ^ 4] : rotations[m], ordering);\n        //console.log(ordering);\n      }\n    }\n  }\n  let names = no_wide ? \"U L F R D BR B BL\".split(\" \") : move_names; // WARNING: this ordering is _not_ the same as the facelet colours\n  let suffixes = [\"0\", \"\", \"'\"];\n  let s = move_sequence.map(([m, r]) => names[m] + suffixes[r]);\n  return s.join(\" \");\n}\n\nfunction print_move_sequence(move_sequence) {\n  console.log(stringify_move_sequence(move_sequence));\n}\n\nfunction apply_move_sequence(state, move_sequence) {\n  for (let [m, r] of move_sequence) {\n    for (let i = 0; i < r; i++) {\n      state = compose(state, moves[m]);\n    }\n  }\n  return state;\n}\n\nfunction invert_move_sequence(move_sequence) {\n  return move_sequence.map(([m, r]) => [m, (3 - r) % 3]).reverse();\n}\n\nfunction simplify_move_sequence(move_sequence, make_noise = false) {\n  if (move_sequence.length === 0) {\n    return [];\n  }\n  let simplified = [];\n  let last_move = undefined;\n  for (let [m, r] of move_sequence) {\n    if (last_move && last_move[0] === m) {\n      // turn of the same face\n      last_move[1] += r;\n      last_move[1] %= 3;\n      if (last_move[1] === 0) {\n        simplified.pop();\n        last_move =\n          simplified.length === 0\n            ? undefined\n            : simplified[simplified.length - 1];\n      }\n    } else if (\n      simplified.length >= 2 &&\n      (last_move[0] ^ m) === 4 &&\n      simplified[simplified.length - 2][0] === m\n    ) {\n      // turn of the opposite face\n      simplified[simplified.length - 2][1] += r;\n      simplified[simplified.length - 2][1] %= 3;\n      if (simplified[simplified.length - 2][1] === 0) {\n        simplified.splice(simplified.length - 2, 1);\n      }\n    } else {\n      last_move = [m, r];\n      simplified.push(last_move);\n    }\n  }\n  if (make_noise && `${move_sequence}` !== `${simplified}`) {\n    console.log(`simplified ${move_sequence} to ${simplified}`);\n  }\n  return simplified;\n}\n\nfunction generate_random_state_scramble() {\n  return stringify_move_sequence(\n    invert_move_sequence(solve(random_state(), true)),\n    true,\n  );\n}\n\nfunction generate_multiple_random_state_scrambles(n) {\n  let scrambles = [];\n  for (let i = 0; i < n; i++) {\n    scrambles[i] = generate_random_state_scramble();\n  }\n  return scrambles;\n}\n\n/*\nActual solver logic goes here.\n\nUnlike most of the earlier random-state scramblers I've written before, this one comes with a slight\ncomplication: the FTO's states are _not_ a group. In other words, we can't skip inverting the\nsolution to get the scramble. Not a big deal.\n\nWe assume the D-BR-B-BL corner is solved. (If not, rotate puzzle accordingly.)\n\nPhase 1: Solve a small pyramid around the D-BR-B-BL corner.\n- centres #6, #9 in orbit A and #6, #9 in orbit B\n- edges #8, #9, #10, #11\nReduction: (132/9)**2 * (12*11*10*9) = 2555520\n\nPhase 2: Reduce to LU 2-gen.\n- remaining BR, D centres, one each of F, R centres (#5, #7, #8 in each orbit)\n- edges F-R, F-D, R-BR (#5, #6, #7)\n- corner F-BR (#4)\n- corner orientation constraint on the other four corners\nReduction: 120**2 * (8*7*6) * 10 * 4 = 193536000\n\nPhase 3: Finish solve.\n- remaining centres (#0..#4, #10, #11 in each orbit)\n- edges #0..#4\n- corners #0..#3\nReduction: 210**2 * (5!/2) * (4!/2*2) = 63504000\n\n\n*/\n\nfunction generate_mtable_comb_generic(n, k, permutations) {\n  let N = C(n, k);\n  let nmoves = permutations.length;\n  let [itc, cti] = generate_comb_lookup_tables(n, k);\n  let mtable = Array(nmoves)\n    .fill()\n    .map(() => new Uint32Array(N));\n  for (let i = 0; i < N; i++) {\n    let c = itc[i];\n    let arr = Array(n);\n    for (let j = 0; j < n; j++) {\n      arr[j] = (c >> j) & 1;\n    }\n    for (let m = 0; m < nmoves; m++) {\n      let arr2 = compose(arr, permutations[m]);\n      let c2 = arr2.reduce((acc, x, j) => acc | (x << j), 0);\n      mtable[m][i] = cti[c2];\n    }\n  }\n  return mtable;\n}\n\nfunction generate_mtable_comb4_generic(n, k0, k1, k2, k3, permutations) {\n  let N = C4(n, k0, k1, k2, k3);\n  let nmoves = permutations.length;\n  let [itc, cti] = generate_comb4_lookup_tables(n, k0, k1, k2, k3);\n  let mtable = Array(nmoves)\n    .fill()\n    .map(() => new Uint32Array(N));\n  for (let i = 0; i < N; i++) {\n    let c = itc[i];\n    let arr = Array(n);\n    for (let j = 0; j < n; j++) {\n      arr[j] = (c >> (2 * j)) & 3;\n    }\n    for (let m = 0; m < nmoves; m++) {\n      let arr2 = compose(arr, permutations[m]);\n      let c2 = arr2.reduce((acc, x, j) => acc | (x << (2 * j)), 0);\n      mtable[m][i] = cti[c2];\n    }\n  }\n  return mtable;\n}\n\nfunction generate_mtable_single_generic(permutations) {\n  let n = permutations[0].length;\n  let nmoves = permutations.length;\n  let mtable = Array(nmoves)\n    .fill()\n    .map(() => new Uint32Array(n));\n  for (let i = 0; i < n; i++) {\n    for (let m = 0; m < nmoves; m++) {\n      mtable[m][permutations[m][i]] = i;\n      // we're using right-action convention here,\n      // so we use the *inverse* of the permutation\n      // to track how pieces move.\n    }\n  }\n  return mtable;\n}\n\nfunction combine_mtables(mtable0, mtable1) {\n  let n0 = mtable0[0].length;\n  let n1 = mtable1[0].length;\n  let nmoves = mtable0.length;\n  let combined = Array(nmoves)\n    .fill()\n    .map(() => new Uint32Array(n0 * n1));\n  for (let j = 0; j < n1; j++) {\n    for (let i = 0; i < n0; i++) {\n      let index = i + n0 * j;\n      for (let m = 0; m < nmoves; m++) {\n        combined[m][index] = mtable0[m][i] + n0 * mtable1[m][j];\n      }\n    }\n  }\n  return combined;\n}\n\nfunction trim_unreachable(mtable, origin) {\n  // input: mtable\n  // output: [trimmed mtable, map]\n  let nmoves = mtable.length;\n  let n = mtable[0].length;\n  let reachable = new Uint8Array(n);\n  reachable[origin] = 1;\n  let done = false;\n  while (!done) {\n    done = true;\n    for (let i = 0; i < n; i++) {\n      if (!reachable[i]) {\n        continue;\n      }\n      for (let m = 0; m < nmoves; m++) {\n        if (!reachable[mtable[m][i]]) {\n          reachable[mtable[m][i]] = 1;\n          done = false;\n        }\n      }\n    }\n  }\n  let map = new Int32Array(n).fill(-1);\n  for (let i = 0, counter = 0; i < n; i++) {\n    if (!reachable[i]) {\n      continue;\n    }\n    map[i] = counter;\n    counter++;\n  }\n  return [mtable.map((entry) => reduce_permutation(entry, reachable)), map];\n}\n\nfunction reduce_to_quotient(mtable, origins) {\n  let nmoves = mtable.length;\n  let n = mtable[0].length;\n  let quotient_map = new Int32Array(n).fill(-1);\n  origins.forEach((x) => {\n    quotient_map[x] = 0;\n  });\n  let preimages = [origins];\n  for (let image = 0; image < preimages.length; image++) {\n    let equiv_class = preimages[image];\n    for (let m = 0; m < nmoves; m++) {\n      let j = mtable[m][equiv_class[0]];\n      if (quotient_map[j] !== -1) {\n        continue;\n      } // already looked at those nodes\n      let new_equiv_class = equiv_class.map((x) => mtable[m][x]);\n      let new_image = preimages.length;\n      preimages.push(new_equiv_class);\n      for (let x of new_equiv_class) {\n        if (quotient_map[x] !== -1) {\n          throw new Error(\"quotienting failed\");\n        }\n        quotient_map[x] = new_image;\n      }\n    }\n  }\n  let n_quot = preimages.length;\n  let mtable_quot = Array(nmoves)\n    .fill()\n    .map(() => new Int32Array(n_quot));\n  for (let m = 0; m < nmoves; m++) {\n    for (let i = 0; i < n_quot; i++) {\n      mtable_quot[m][i] = quotient_map[mtable[m][preimages[i][0]]];\n    }\n  }\n  return [mtable_quot, quotient_map];\n}\n\nfunction generate_mirrored_coordinate_table(mtable, a, b) {\n  let n = mtable[0].length;\n  let nmoves = mtable.length;\n  let mirror_map = new Int32Array(n).fill(-1);\n  mirror_map[a] = b;\n  mirror_map[b] = a;\n  let done = false;\n  while (!done) {\n    done = true;\n    for (let i = 0; i < n; i++) {\n      if (mirror_map[i] === -1) {\n        continue;\n      }\n      let I = mirror_map[i];\n      for (let m = 0; m < nmoves; m++) {\n        let M = m ^ 1;\n        let new_i = mtable[m][i];\n        let new_I = mtable[M][mtable[M][I]];\n        // convert moves according to this table:\n        // U -> L2\n        // L -> U2\n        // F -> R2\n        // R -> F2\n        if (mirror_map[new_i] === -1) {\n          done = false;\n          mirror_map[new_i] = new_I;\n          mirror_map[new_I] = new_i;\n        } else if (mirror_map[new_i] !== new_I) {\n          throw new Error(\"mirroring failed - is the initial map correct?\");\n        }\n      }\n    }\n  }\n  return mirror_map;\n}\n\nfunction bfs(mtable, goal_states) {\n  let N = mtable[0].length;\n  let nmoves = mtable.length;\n  let ptable = new Int8Array(N).fill(-1);\n  for (let state of goal_states) {\n    ptable[state] = 0;\n  }\n  let depth = 0;\n  let done = false;\n  while (!done) {\n    done = true;\n    for (let state = 0; state < N; state++) {\n      if (ptable[state] !== depth) {\n        continue;\n      }\n      for (let move_index = 0; move_index < nmoves; move_index++) {\n        let new_state = mtable[move_index][state];\n        while (new_state !== state) {\n          if (ptable[new_state] === -1) {\n            done = false;\n            ptable[new_state] = depth + 1;\n          }\n          new_state = mtable[move_index][new_state];\n        }\n      }\n    }\n    depth++;\n  }\n  return ptable;\n}\n\nfunction* ida_solve_gen(indices, mtables, ptables, moves_left, commute) {\n  let ncoords = indices.length;\n  let bound = 0;\n  for (let i = 0; i < ncoords; i++) {\n    bound = Math.max(bound, ptables[i][indices[i]]);\n  }\n  while (bound <= moves_left) {\n    //console.log(`searching depth ${bound}`);\n    yield* ida_search_gen(indices, mtables, ptables, bound, -1, commute);\n    bound++;\n  }\n}\n\nfunction* ida_search_gen(indices, mtables, ptables, bound, last, commute) {\n  let ncoords = indices.length;\n  let nmoves = mtables[0].length;\n  let heuristic = 0;\n  for (let i = 0; i < ncoords; i++) {\n    heuristic = Math.max(heuristic, ptables[i][indices[i]]);\n  }\n  if (heuristic > bound) {\n    return;\n  }\n  if (bound === 0) {\n    yield [];\n    return;\n  }\n  if (heuristic === 0 && bound === 1) {\n    return;\n  }\n  for (let m = 0; m < nmoves; m++) {\n    if (m === last) {\n      continue;\n    }\n    if (m < last && commute[m][last]) {\n      continue;\n    }\n    let new_indices = indices.slice();\n    for (let c = 0; c < ncoords; c++) {\n      new_indices[c] = mtables[c][m][indices[c]];\n    }\n    let r = 1;\n    while (indices.some((_, i) => indices[i] !== new_indices[i])) {\n      let subpath_gen = ida_search_gen(\n        new_indices,\n        mtables,\n        ptables,\n        bound - 1,\n        m,\n        commute,\n      );\n      while (true) {\n        let { value: subpath, done } = subpath_gen.next();\n        if (done) {\n          break;\n        }\n        yield [[m, r]].concat(subpath);\n      }\n      for (let c = 0; c < ncoords; c++) {\n        new_indices[c] = mtables[c][m][new_indices[c]];\n      }\n      r++;\n    }\n  }\n}\n\nfunction solve(facelets, readable = false) {\n  let phase1sol = solve_phase1_gen(facelets).next().value;\n  let facelets2 = apply_move_sequence(facelets, phase1sol);\n  let phase2sol = (\n    readable ? solve_phase2_and_phase3_readable : solve_phase2_and_phase3_fast\n  )(facelets2);\n  let solution = simplify_move_sequence(phase1sol.concat(phase2sol), false);\n  if (\n    apply_move_sequence(facelets, solution).join(\"\") !== solved_state.join(\"\")\n  ) {\n    console.log(\"solving failed!\");\n    console.log(facelets);\n    console.log(phase1sol);\n    console.log(facelets2);\n    console.log(phase2sol);\n    console.log(apply_move_sequence(facelets, solution));\n  }\n  return solution;\n}\n\nlet cached_mtables = {};\nlet cached_ptables = {};\n\n/* Phase 1 stuff */\n\nlet phase1_centre_colour_map = [0, 0, 2, 3, 0, 0, 2, 3];\nfunction index_phase1(facelets) {\n  let [itc, cti] = generate_comb4_lookup_tables(12, 6, 0, 3, 3);\n  let ep = Array(12)\n    .fill()\n    .map((_, i) => get_edge_piece(facelets, i));\n  let edge_coord =\n    ep.indexOf(8) +\n    12 * ep.indexOf(9) +\n    12 ** 2 * ep.indexOf(10) +\n    12 ** 3 * ep.indexOf(11);\n  let [a_coord, b_coord] = [centreA_piece_facelets, centreB_piece_facelets].map(\n    (facelet_indices) => {\n      let arr = facelet_indices.map(\n        (x) => phase1_centre_colour_map[facelets[x]],\n      );\n      return cti[arr.reduce((acc, x, j) => acc | (x << (2 * j)), 0)];\n    },\n  );\n  return [edge_coord, a_coord, b_coord];\n}\n\nfunction generate_phase1_edge_mtable() {\n  if (cached_mtables.phase1_edge) {\n    return cached_mtables.phase1_edge;\n  }\n  let m1 = generate_mtable_single_generic(move_permutations.map((x) => x.ep));\n  let m2 = combine_mtables(m1, m1);\n  let m4 = combine_mtables(m2, m2);\n  return (cached_mtables.phase1_edge = m4);\n}\n\nfunction generate_phase1_edge_ptable() {\n  if (cached_ptables.phase1_edge) {\n    return cached_ptables.phase1_edge;\n  }\n  return (cached_ptables.phase1_edge = bfs(generate_phase1_edge_mtable(), [\n    8 + 12 * 9 + 12 ** 2 * 10 + 12 ** 3 * 11,\n  ]));\n}\n\nfunction generate_phase1_centreA_mtable() {\n  if (cached_mtables.phase1_centreA) {\n    return cached_mtables.phase1_centreA;\n  }\n  return (cached_mtables.phase1_centreA = generate_mtable_comb4_generic(\n    12,\n    6,\n    0,\n    3,\n    3,\n    move_permutations.map((x) => x.ap),\n  ));\n}\n\nfunction generate_phase1_centreB_mtable() {\n  if (cached_mtables.phase1_centreB) {\n    return cached_mtables.phase1_centreB;\n  }\n  return (cached_mtables.phase1_centreB = generate_mtable_comb4_generic(\n    12,\n    6,\n    0,\n    3,\n    3,\n    move_permutations.map((x) => x.bp),\n  ));\n}\n\nfunction generate_phase1_centre_ptable() {\n  // the pruning tables for the two centre orbits are identical due to the specific facelet\n  // labelling we're using.\n  if (cached_ptables.phase1_centre) {\n    return cached_ptables.phase1_centre;\n  }\n  let [itc, cti] = generate_comb4_lookup_tables(12, 6, 0, 3, 3);\n  let goal_states = itc\n    .filter((x) => {\n      let x6 = (x >> 12) & 3;\n      let x9 = (x >> 18) & 3;\n      return x6 === 2 && x9 === 3;\n    })\n    .map((x) => cti[x]);\n  return (cached_ptables.phase1_centre = bfs(\n    generate_phase1_centreB_mtable(),\n    goal_states,\n  ));\n}\n\nfunction* solve_phase1_gen(facelets) {\n  let mtables = [\n    generate_phase1_edge_mtable(),\n    generate_phase1_centreA_mtable(),\n    generate_phase1_centreB_mtable(),\n  ];\n  let ptables = [\n    generate_phase1_edge_ptable(),\n    generate_phase1_centre_ptable(),\n    generate_phase1_centre_ptable(),\n  ];\n  yield* phase1_ida_solve_gen(index_phase1(facelets), mtables, ptables, 15);\n}\n\nfunction* phase1_ida_solve_gen(indices, mtables, ptables, moves_left) {\n  let ncoords = indices.length;\n  let bound = 0;\n  for (let i = 0; i < ncoords; i++) {\n    bound = Math.max(bound, ptables[i][indices[i]]);\n  }\n  while (bound <= moves_left) {\n    //console.log(`searching depth ${bound}`);\n    yield* phase1_ida_search_gen(indices, mtables, ptables, bound, -1);\n    bound++;\n  }\n}\n\nfunction* phase1_ida_search_gen(indices, mtables, ptables, bound, last) {\n  let ncoords = 3; //indices.length;\n  let nmoves = 8; //mtables[0].length;\n  let heuristic = Math.max(\n    ptables[0][indices[0]],\n    ptables[1][indices[1]],\n    ptables[2][indices[2]],\n  ); //0;\n  //for (let i = 0; i < ncoords; i++) heuristic = Math.max(heuristic, ptables[i][indices[i]]);\n  if (heuristic > bound) {\n    return;\n  }\n  if (bound === 0) {\n    yield [];\n    return;\n  }\n  if (heuristic === 0 && bound === 1) {\n    return;\n  }\n  for (let m = 0; m < nmoves; m++) {\n    if (m === last) {\n      continue;\n    }\n    if (m === last - 4) {\n      continue;\n    }\n    let new_indices = [];\n    new_indices[0] = mtables[0][m][indices[0]];\n    new_indices[1] = mtables[1][m][indices[1]];\n    new_indices[2] = mtables[2][m][indices[2]];\n    let r = 1;\n    while (indices.some((_, i) => indices[i] !== new_indices[i])) {\n      let subpath_gen = phase1_ida_search_gen(\n        new_indices,\n        mtables,\n        ptables,\n        bound - 1,\n        m,\n      );\n      while (true) {\n        let { value: subpath, done } = subpath_gen.next();\n        if (done) {\n          break;\n        }\n        yield [[m, r]].concat(subpath);\n      }\n      new_indices[0] = mtables[0][m][new_indices[0]];\n      new_indices[1] = mtables[1][m][new_indices[1]];\n      new_indices[2] = mtables[2][m][new_indices[2]];\n      r++;\n    }\n  }\n}\n\n/* Phase 2 stuff */\n\nlet phase2_centre_colour_map = [0, 1, 2, 0, 0, 1, 2, 0];\n// we don't care about swapping U and BL centres in phase 2\n\nlet phase2_centre_indices = [0, 1, 2, 3, 4, 5, 7, 8, 10, 11]; // 6 and 9 are already solved in phase 1\nlet phase2_keep = [\n  true,\n  true,\n  true,\n  true,\n  true,\n  true,\n  false,\n  true,\n  true,\n  false,\n  true,\n  true,\n];\nlet phase2_corner_keep = [\n  true,\n  true,\n  true,\n  true,\n  true,\n  false,\n  true,\n  true,\n  true,\n  true,\n  true,\n  false,\n];\n\nfunction index_phase2(facelets) {\n  let [itc, cti] = generate_comb4_lookup_tables(10, 5, 3, 2, 0);\n  let ep = Array(8)\n    .fill()\n    .map((_, i) => get_edge_piece(facelets, i));\n  let edge_coord = ep.indexOf(5) + 8 * ep.indexOf(6) + 8 ** 2 * ep.indexOf(7);\n  let corners = Array(5)\n    .fill()\n    .map((_, i) => get_corner_piece(facelets, i));\n  let cp_inverse_full = invert_permutation(\n    corners\n      .map(([p, o]) => p + 5 * o)\n      .concat(corners.map(([p, o]) => p + 5 * (o ^ 1))),\n  );\n  let cp_inverse = cp_inverse_full.slice(0, 5).map((x) => x % 5);\n  let co_inverse = cp_inverse_full.slice(0, 5).map((x) => (x / 5) | 0);\n  let corner_coord =\n    evenpermutation_to_index(cp_inverse) * 8 +\n    (co_inverse[0] ^ co_inverse[2]) +\n    2 * (co_inverse[0] ^ co_inverse[3]) +\n    4 * co_inverse[4];\n  let [a_coord, b_coord] = [centreA_piece_facelets, centreB_piece_facelets].map(\n    (facelet_indices) => {\n      let arr = compose(facelet_indices, phase2_centre_indices).map(\n        (x) => phase2_centre_colour_map[facelets[x]],\n      );\n      return cti[arr.reduce((acc, x, j) => acc | (x << (2 * j)), 0)];\n    },\n  );\n  // we don't need these move tables, but we do need the reduction maps\n  // that are computed with these (and stored in global vars, yikes)\n  generate_phase2_edge_mtable();\n  generate_phase2_corner_mtable_compact();\n  return [\n    a_coord,\n    b_coord,\n    phase2_corner_reduction_map[corner_coord] +\n      40 * phase2_edge_reduction_map[edge_coord],\n  ];\n}\n\nfunction* solve_phase2_gen(facelets) {\n  yield* phase2_ida_solve_gen(index_phase2(facelets), 30);\n}\n\nfunction solve_phase2(facelets) {\n  return solve_phase2_gen(facelets).next().value;\n}\n\nfunction generate_phase2_centre_mtables() {\n  if (cached_mtables.phase2_centre) {\n    return cached_mtables.phase2_centre;\n  }\n  let a = generate_mtable_comb4_generic(\n    10,\n    5,\n    3,\n    2,\n    0,\n    move_permutations\n      .slice(0, 4)\n      .map((x) => reduce_permutation(x.ap, phase2_keep)),\n  );\n  let b = generate_mtable_comb4_generic(\n    10,\n    5,\n    3,\n    2,\n    0,\n    move_permutations\n      .slice(0, 4)\n      .map((x) => reduce_permutation(x.bp, phase2_keep)),\n  );\n  return (cached_mtables.phase2_centre = [a, b]);\n}\n\nlet phase2_edge_reduction_map;\nfunction generate_phase2_edge_mtable() {\n  if (cached_mtables.phase2_edge) {\n    return cached_mtables.phase2_edge;\n  }\n  let e = generate_mtable_single_generic(\n    move_permutations.slice(0, 4).map((x) => x.ep.slice(0, 8)),\n  );\n  let eee = combine_mtables(e, combine_mtables(e, e));\n  let eee_trimmed;\n  [eee_trimmed, phase2_edge_reduction_map] = trim_unreachable(eee, 0o765);\n  return (cached_mtables.phase2_edge = eee_trimmed);\n}\n\nfunction generate_phase2_corner_mtable() {\n  if (cached_mtables.phase2_corner) {\n    return cached_mtables.phase2_corner;\n  }\n  const HALFFACT5 = factorial(5) / 2; // = 60\n  const N = HALFFACT5 * 8; // = 480\n  const keep = [\n    true,\n    true,\n    true,\n    true,\n    true,\n    false,\n    true,\n    true,\n    true,\n    true,\n    true,\n    false,\n  ];\n  // ignore the sixth and twelfth entries, which encode corner #5's state\n  let mtable = Array(4)\n    .fill()\n    .map(() => new Uint32Array(N));\n  let permutations = move_permutations\n    .slice(0, 4)\n    .map((x) => invert_permutation(reduce_permutation(x.cp, keep)));\n  // using the left-action convention here, so take inverses\n  for (let i = 0; i < N; i++) {\n    let p = index_to_evenpermutation(i >> 3, 5);\n    let o = [0, 0, i & 1, (i >> 1) & 1, (i >> 2) & 1];\n    o[1] = o[2] ^ o[3] ^ o[4];\n    let cp = Array(10);\n    for (let j = 0; j < 5; j++) {\n      cp[j] = p[j] + 5 * o[j];\n      cp[j + 5] = p[j] + 5 * (o[j] ^ 1);\n    }\n    for (let m = 0; m < 4; m++) {\n      let cp2 = compose(permutations[m], cp);\n      let p2 = cp2.slice(0, 5).map((x) => x % 5);\n      let o2 = cp2.slice(0, 5).map((x) => (x / 5) | 0);\n      let orientation_index = (o2[0] ^ o2[2]) + 2 * (o2[0] ^ o2[3]) + 4 * o2[4];\n      mtable[m][i] = evenpermutation_to_index(p2) * 8 + orientation_index;\n    }\n  }\n  return (cached_mtables.phase2_corner = mtable);\n  /*\n\tfar as I can tell, there's no clean way to index the cosets of the corner subgroup in this\n\tphase. so we just do it the dirty way (see `reduce_to_quotient`).\n\t*/\n}\n\nlet phase2_corner_reduction_map;\nfunction generate_phase2_corner_mtable_compact() {\n  if (cached_mtables.phase2_corner_compact) {\n    return cached_mtables.phase2_corner_compact;\n  }\n  [cached_mtables.phase2_corner_compact, phase2_corner_reduction_map] =\n    reduce_to_quotient(\n      generate_phase2_corner_mtable(),\n      phase2_corner_goal_states(),\n    );\n  return cached_mtables.phase2_corner_compact;\n}\n\nfunction generate_phase2_ce_mtable() {\n  if (cached_mtables.phase2_ce) {\n    return cached_mtables.phase2_ce;\n  }\n  let c = generate_phase2_corner_mtable_compact();\n  let e = generate_phase2_edge_mtable();\n  return (cached_mtables.phase2_ce = combine_mtables(c, e));\n}\n\nlet phase2_ce_mirror_map;\nfunction generate_phase2_ce_mirror_map() {\n  if (phase2_ce_mirror_map) {\n    return phase2_ce_mirror_map;\n  }\n  const ce_solved = index_phase2(solved_state)[2];\n  return (phase2_ce_mirror_map = generate_mirrored_coordinate_table(\n    generate_phase2_ce_mtable(),\n    ce_solved,\n    ce_solved,\n  ));\n}\n\nfunction phase2_centre_goal_states() {\n  let [itc, cti] = generate_comb4_lookup_tables(10, 5, 3, 2, 0);\n  return itc.filter((x) => ((x >> 10) & 63) === 41).map((x) => cti[x]);\n  /*\n\tthe combination tracks the centre pieces at indices\n\t0, 1, 2, 3, 4, 5, 7, 8, 10, 11\n\tin little endian order.\n\tright-shifting 10 bits changes this to\n\t5, 7, 8, 10, 11\n\tand masking by 63 keeps only the three least significant digits\n\t5, 7, 8\n\twhich are exactly the pieces we're solving in this phase.\n\t1 + 4 * 2 + 4**2 * 2 = 41\n\tWARNING: this needs to be adjusted if the centre indexing is changed\n\t(also, this returns a Uint32Array, but nothing we do here can possibly cause overflow so\n\tthat's not a problem)\n\t*/\n}\n\nfunction phase2_corner_goal_states() {\n  let mtable = generate_phase2_corner_mtable();\n  let N = mtable[0].length;\n  let flags = Array(N).fill(false);\n  flags[0] = true; /* index 0 is the solved state */\n  let done = false;\n  while (!done) {\n    done = true;\n    for (let i = 0; i < N; i++) {\n      if (flags[i]) {\n        if (!flags[mtable[0][i]]) {\n          done = false;\n          flags[mtable[0][i]] = true;\n        }\n        if (!flags[mtable[1][i]]) {\n          done = false;\n          flags[mtable[1][i]] = true;\n        }\n      }\n    }\n  }\n  return flags.map((_, i) => i).filter((i) => flags[i]);\n}\n\nfunction generate_phase2_ace_ptable() {\n  if (cached_ptables.phase2_ace) {\n    return cached_ptables.phase2_ace;\n  }\n  const [mtable_a, mtable_b] = generate_phase2_centre_mtables();\n  const mtable_ce = generate_phase2_ce_mtable();\n  const Na = 2520;\n  const Nce = 40 * 336;\n  const N = Na * Nce; // = 33868800\n  const ce_solved = index_phase2(solved_state)[2];\n  const max_depth = 9;\n  let ptable = new Int8Array(N).fill(max_depth);\n  for (let a_solved of phase2_centre_goal_states()) {\n    ptable[a_solved + Na * ce_solved] = 0;\n  }\n  for (let depth = 0; depth < max_depth - 1; depth++) {\n    for (\n      let state = ptable.indexOf(depth);\n      state !== -1;\n      state = ptable.indexOf(depth, state + 1)\n    ) {\n      let a = state % Na;\n      let ce = (state / Na) | 0;\n      for (let move_index = 0; move_index < 4; move_index++) {\n        let new_a = mtable_a[move_index][a];\n        let new_ce = mtable_ce[move_index][ce];\n        let new_state = new_a + Na * new_ce;\n        if (ptable[new_state] === max_depth) {\n          ptable[new_state] = depth + 1;\n        }\n        new_a = mtable_a[move_index][new_a];\n        new_ce = mtable_ce[move_index][new_ce];\n        new_state = new_a + Na * new_ce;\n        if (ptable[new_state] === max_depth) {\n          ptable[new_state] = depth + 1;\n        }\n      }\n    }\n  }\n  // don't bother filling in the table for depth >=10; this saves a substantial amount of time\n  // on startup at a slight cost of pruning effectiveness\n  return (cached_ptables.phase2_ace = ptable);\n}\n\nfunction* phase2_ida_solve_gen(indices, moves_left) {\n  let [mtable_a, mtable_b] = generate_phase2_centre_mtables();\n  let mtable_ce = generate_phase2_ce_mtable();\n  let ptable_ace = generate_phase2_ace_ptable();\n  let mirror_map = generate_phase2_ce_mirror_map();\n  let [a, b, ce] = indices;\n  let ce_mirror = mirror_map[ce];\n  let bound = Math.max(\n    ptable_ace[a + 2520 * ce],\n    ptable_ace[b + 2520 * ce_mirror],\n  );\n  while (bound <= moves_left) {\n    //console.log(`searching depth ${bound}`);\n    yield* phase2_ida_search_gen(\n      a,\n      b,\n      ce,\n      mtable_a,\n      mtable_b,\n      mtable_ce,\n      ptable_ace,\n      mirror_map,\n      bound,\n      -1,\n    );\n    bound++;\n  }\n}\n\nfunction* phase2_ida_search_gen(\n  a,\n  b,\n  ce,\n  mtable_a,\n  mtable_b,\n  mtable_ce,\n  ptable_ace,\n  mirror_map,\n  bound,\n  last,\n) {\n  let h = Math.max(\n    ptable_ace[a + 2520 * ce],\n    ptable_ace[b + 2520 * mirror_map[ce]],\n  );\n  if (h > bound) {\n    return;\n  }\n  if (bound === 0) {\n    yield [];\n    return;\n  } else if (h === 0) {\n    return;\n  }\n  for (let m = 0; m < 4; m++) {\n    if (m === last) {\n      continue;\n    }\n    let new_a = a;\n    let new_b = b;\n    let new_ce = ce;\n    for (let r = 1; r <= 2; r++) {\n      new_a = mtable_a[m][new_a];\n      new_b = mtable_b[m][new_b];\n      new_ce = mtable_ce[m][new_ce];\n      let subpath_gen = phase2_ida_search_gen(\n        new_a,\n        new_b,\n        new_ce,\n        mtable_a,\n        mtable_b,\n        mtable_ce,\n        ptable_ace,\n        mirror_map,\n        bound - 1,\n        m,\n      );\n      while (true) {\n        let { value: subpath, done } = subpath_gen.next();\n        if (done) {\n          break;\n        }\n        yield [[m, r]].concat(subpath);\n      }\n    }\n  }\n}\n\n/* Phase 3 mostly-2-gen stuff */\n\nlet phase3_2gen_centre_indices = [0, 1, 2, 3, 4, 10, 11];\n\nlet phase3_2gen_keep = [\n  true,\n  true,\n  true,\n  true,\n  true,\n  false,\n  false,\n  false,\n  false,\n  false,\n  true,\n  true,\n];\n\nlet phase3_2gen_move_seqs = [\n  [[0, 1]], // U\n  [[1, 1]], // L\n\n  // F U R U' R' F'\n  [\n    [2, 1],\n    [0, 1],\n    [3, 1],\n    [0, 2],\n    [3, 2],\n    [2, 2],\n  ],\n  [\n    [3, 2],\n    [1, 2],\n    [2, 2],\n    [1, 1],\n    [2, 1],\n    [3, 1],\n  ],\n  [\n    [6, 1],\n    [0, 1],\n    [3, 1],\n    [0, 2],\n    [3, 2],\n    [6, 2],\n  ],\n  [\n    [7, 2],\n    [1, 2],\n    [2, 2],\n    [1, 1],\n    [2, 1],\n    [7, 1],\n  ],\n\n  // F U F' U F U F'\n  [\n    [2, 1],\n    [0, 1],\n    [2, 2],\n    [0, 1],\n    [2, 1],\n    [0, 1],\n    [2, 2],\n  ],\n  [\n    [3, 2],\n    [1, 1],\n    [3, 1],\n    [1, 1],\n    [3, 2],\n    [1, 1],\n    [3, 1],\n  ],\n\n  // F R F' L' U' F R F'\n  [\n    [2, 1],\n    [3, 1],\n    [2, 2],\n    [1, 2],\n    [0, 2],\n    [2, 1],\n    [3, 1],\n    [2, 2],\n  ],\n  [\n    [3, 2],\n    [2, 2],\n    [3, 1],\n    [0, 1],\n    [1, 1],\n    [3, 2],\n    [2, 2],\n    [3, 1],\n  ],\n  [\n    [6, 1],\n    [0, 1],\n    [6, 2],\n    [0, 2],\n    [1, 2],\n    [6, 1],\n    [0, 1],\n    [6, 2],\n  ],\n  [\n    [7, 2],\n    [1, 2],\n    [7, 1],\n    [1, 1],\n    [0, 1],\n    [7, 2],\n    [1, 2],\n    [7, 1],\n  ],\n\n  // F R' F' R U F' L F\n  [\n    [2, 1],\n    [3, 2],\n    [2, 2],\n    [3, 1],\n    [0, 1],\n    [2, 2],\n    [1, 1],\n    [2, 1],\n  ],\n  [\n    [3, 2],\n    [2, 1],\n    [3, 1],\n    [2, 2],\n    [1, 2],\n    [3, 1],\n    [0, 2],\n    [3, 2],\n  ],\n  [\n    [6, 1],\n    [0, 2],\n    [6, 2],\n    [7, 1],\n    [6, 1],\n    [1, 2],\n    [7, 1],\n    [6, 1],\n  ],\n  [\n    [7, 2],\n    [1, 1],\n    [7, 1],\n    [6, 2],\n    [7, 2],\n    [0, 1],\n    [6, 2],\n    [7, 2],\n  ],\n\n  // F' L' F' R' F' R' U' R'\n  [\n    [2, 2],\n    [1, 2],\n    [2, 2],\n    [3, 2],\n    [2, 2],\n    [3, 2],\n    [0, 2],\n    [3, 2],\n  ],\n  [\n    [6, 2],\n    [7, 2],\n    [1, 2],\n    [0, 2],\n    [1, 2],\n    [0, 2],\n    [6, 2],\n    [7, 2],\n  ],\n  /*\n[[2,1], [0,2], [2,2], [0,2], [2,1], [3,1], [0,2], [3,2], [2,2]], // F U' F' U' F R U' R' F'\n[[3,2], [1,1], [3,1], [1,1], [3,2], [2,2], [1,1], [2,1], [3,1]], // R' L R L R' F' L F R\n[[6,1], [3,2], [6,2], [1,2], [6,1], [0,1], [3,2], [0,2], [6,2]], // f R' f' L' f U R' U' f'\n[[7,2], [2,1], [7,1], [0,1], [7,2], [1,2], [2,1], [1,1], [7,1]], // r' F r U r' L' F L r\n[[2,1], [0,1], [3,1], [0,2], [3,2], [0,1], [3,1], [0,2], [3,2], [2,2]], // F (U R U' R')2 F'\n[[3,2], [1,2], [2,2], [1,1], [2,1], [1,2], [2,2], [1,1], [2,1], [3,1]], // R' (L' F' L F)2 R\n[[6,1], [0,1], [3,1], [0,2], [3,2], [0,1], [3,1], [0,2], [3,2], [6,2]], // f (U R U' R')2 f'\n[[7,2], [1,2], [2,2], [1,1], [2,1], [1,2], [2,2], [1,1], [2,1], [7,1]], // r' (L' F' L F)2 r\n*/\n];\nphase3_2gen_move_seqs = phase3_2gen_move_seqs.concat(\n  phase3_2gen_move_seqs.map((seq) => invert_move_sequence(seq)),\n);\nlet phase3_2gen_nmoves = phase3_2gen_move_seqs.length; // = 36\n/*\nThe moves we're using for this phase:\nU\nL\nF U R U' R' F'\nR' L' F' L F R\nf U R U' R' f'\nr' L' F' L F r\nF U F' U F U F' (= F' U F U F' U F = r' F r U r' F r = r l U' l F l r')\nR' L R L R' L R (= R L R' L R L R' = f R f' L f R f' = f' u R u L' u f)\n\nF R F' L' U' F R F'\nR' F' R U L R' F' R\nf U f' U' L' f U f'\nr' L' r L U r' L' r\n\nF R' F' R U F' L F\nR' F R F' L' R U' R'\nf U' f' r f L' r f\nr' L r f' r' U f' r'\n\nF' L' F' R' F' R' U' R'\nf' r' L' U' L' U' f' r'\n\nand the inverses of the above\n\nThese are the atomic 4-gen move sequences of length <= 8 where the induced permutations lie in the\n<U,L> group (verified with GAP, barring transcription errors).\n\nTemporarily going out of LU 2-gen can sometimes save _many_ moves, e.g. the F R U R' U' F' scramble\nobviously has a 6-move 4-gen solution (F U R U' R' F'), but the optimal 2-gen solution is 24 moves:\nU L' U L' U' L' U' L U' L U L' U L' U L U L' U' L U' L U L'.\n*/\n\nlet phase3_2gen_facelet_permutations = phase3_2gen_move_seqs.map((seq) =>\n  apply_move_sequence(permutation_from_cycles([], 72), seq),\n);\nlet phase3_2gen_piece_permutations = phase3_2gen_facelet_permutations.map(\n  convert_move_to_permutations,\n);\nlet phase3_2gen_move_orders =\n  phase3_2gen_facelet_permutations.map(permutation_order);\n\nfunction index_phase3_2gen(facelets) {\n  let [itc, cti] = generate_comb4_lookup_tables(7, 3, 2, 0, 2);\n  let ep = Array(5)\n    .fill()\n    .map((_, i) => get_edge_piece(facelets, i));\n  let edge_coord = evenpermutation_to_index(ep);\n  let corners = Array(4)\n    .fill()\n    .map((_, i) => get_corner_piece(facelets, i));\n  let corner_coord =\n    evenpermutation_to_index(corners.map((x) => x[0])) * 2 +\n    corners.find((x) => x[0] === 0)[1];\n  let [a_coord, b_coord] = [centreA_piece_facelets, centreB_piece_facelets].map(\n    (facelet_indices) => {\n      let arr = compose(facelet_indices, phase3_2gen_centre_indices).map(\n        (x) => facelets[x] % 4,\n      );\n      return cti[arr.reduce((acc, x, j) => acc | (x << (2 * j)), 0)];\n    },\n  );\n  return [a_coord + 210 * b_coord, corner_coord + 24 * edge_coord];\n}\n\nfunction generate_phase3_2gen_edge_mtable() {\n  if (cached_mtables.phase3_2gen_edge) {\n    return cached_mtables.phase3_2gen_edge;\n  }\n  const HALFFACT5 = factorial(5) / 2; // = 60\n  let mtable = Array(phase3_2gen_nmoves)\n    .fill()\n    .map(() => new Uint32Array(HALFFACT5));\n  let permutations = phase3_2gen_piece_permutations.map((x) =>\n    x.ep.slice(0, 5),\n  );\n  for (let i = 0; i < HALFFACT5; i++) {\n    let p = index_to_evenpermutation(i, 5);\n    for (let m = 0; m < phase3_2gen_nmoves; m++) {\n      mtable[m][i] = evenpermutation_to_index(compose(p, permutations[m]));\n    }\n  }\n  return (cached_mtables.phase3_2gen_edge = mtable);\n}\n\n// the group of corner states is the binary tetrahedral group 2T, where |2T| = 24\nfunction generate_phase3_2gen_corner_mtable() {\n  if (cached_mtables.phase3_2gen_corner) {\n    return cached_mtables.phase3_2gen_corner;\n  }\n  const HALFFACT4 = factorial(4) / 2; // = 12\n  const N = HALFFACT4 * 2; // = 24\n  const keep = [\n    true,\n    true,\n    true,\n    true,\n    false,\n    false,\n    true,\n    true,\n    true,\n    true,\n    false,\n    false,\n  ];\n  let mtable = Array(phase3_2gen_nmoves)\n    .fill()\n    .map(() => new Uint32Array(N));\n  let permutations = phase3_2gen_piece_permutations.map((x) =>\n    reduce_permutation(x.cp, keep).slice(0, 4),\n  );\n  for (let i = 0; i < N; i += 2) {\n    let p = index_to_evenpermutation(i >> 1, 4);\n    let cp = p.concat(p.map((x) => x + 4));\n    for (let m = 0; m < phase3_2gen_nmoves; m++) {\n      let cp2 = compose(cp, permutations[m]);\n      let p2 = cp2.map((x) => x % 4);\n      let o2 = cp2.find((x) => x % 4 === 0) >> 2;\n      mtable[m][i] = evenpermutation_to_index(p2) * 2 + o2;\n      mtable[m][i + 1] = evenpermutation_to_index(p2) * 2 + (o2 ^ 1);\n    }\n  }\n  return (cached_mtables.phase3_2gen_corner = mtable);\n}\n\nfunction generate_phase3_2gen_corneredge_mtable() {\n  if (cached_mtables.phase3_2gen_corneredge) {\n    return cached_mtables.phase3_2gen_corneredge;\n  }\n  return (cached_mtables.phase3_2gen_corneredge = combine_mtables(\n    generate_phase3_2gen_corner_mtable(),\n    generate_phase3_2gen_edge_mtable(),\n  ));\n}\n\nfunction generate_phase3_2gen_centre_mtable() {\n  if (cached_mtables.phase3_2gen_centre) {\n    return cached_mtables.phase3_2gen_centre;\n  }\n  let mtable_a = generate_mtable_comb4_generic(\n    7,\n    3,\n    2,\n    0,\n    2,\n    phase3_2gen_piece_permutations.map((x) =>\n      reduce_permutation(x.ap, phase3_2gen_keep),\n    ),\n  );\n  let mtable_b = generate_mtable_comb4_generic(\n    7,\n    3,\n    2,\n    0,\n    2,\n    phase3_2gen_piece_permutations.map((x) =>\n      reduce_permutation(x.bp, phase3_2gen_keep),\n    ),\n  );\n  cached_mtables.phase3_2gen_centreA = mtable_a;\n  cached_mtables.phase3_2gen_centreB = mtable_b;\n  return (cached_mtables.phase3_2gen_centre = combine_mtables(\n    mtable_a,\n    mtable_b,\n  ));\n}\n\nlet phase3_2gen_depth_table;\nfunction generate_phase3_2gen_depth_table() {\n  if (phase3_2gen_depth_table) {\n    return phase3_2gen_depth_table;\n  }\n  const mtable_ab = generate_phase3_2gen_centre_mtable();\n  const mtable_ce = generate_phase3_2gen_corneredge_mtable();\n  const Nab = mtable_ab[0].length; // = 44100\n  const Nce = mtable_ce[0].length; // = 1440\n  const N = Nab * Nce; // = 63504000\n  const max_depth = 25; // pre-determined; hard-coding this makes the algorithm a bit faster\n  const all_weights = phase3_2gen_move_seqs.map((seq) => seq.length);\n  const table = new Int8Array(N).fill(max_depth);\n  const solved_indices = index_phase3_2gen(solved_state);\n  table[solved_indices[0] + Nab * solved_indices[1]] = 0;\n  let depth = 0;\n  let done = false;\n  while (!done && depth < max_depth - 1) {\n    done = true;\n    //console.log(`scanning depth ${depth}`);\n    let move_indices = Array(phase3_2gen_nmoves)\n      .fill()\n      .map((x, i) => i)\n      .filter((m) => all_weights[m] + depth < max_depth);\n    move_indices.sort((m, mm) => all_weights[m] - all_weights[mm]);\n    let weights = compose(all_weights, move_indices);\n    let mtable_ab_pruned = compose(mtable_ab, move_indices);\n    let mtable_ce_pruned = compose(mtable_ce, move_indices);\n    let nmoves = move_indices.length;\n    //console.log(move_indices);\n    for (\n      let state = table.indexOf(depth);\n      state !== -1;\n      state = table.indexOf(depth, state + 1)\n    ) {\n      let ab = state % Nab;\n      let ce = (state / Nab) | 0;\n      for (let mi = 0; mi < nmoves; mi++) {\n        let weight = weights[mi];\n        let new_ab = mtable_ab_pruned[mi][ab];\n        let new_ce = mtable_ce_pruned[mi][ce];\n        let new_state = new_ab + Nab * new_ce;\n        if (table[new_state] > depth + weight) {\n          done = false;\n          table[new_state] = depth + weight;\n        }\n      }\n    }\n    depth++;\n  }\n  return (phase3_2gen_depth_table = table);\n}\n\nlet phase3_2gen_ace_table;\nfunction generate_phase3_2gen_ace_table() {\n  if (phase3_2gen_ace_table) {\n    return phase3_2gen_ace_table;\n  }\n  const mtable_ab = generate_phase3_2gen_centre_mtable();\n  const mtable_a = cached_mtables.phase3_2gen_centreA;\n  const mtable_ce = generate_phase3_2gen_corneredge_mtable();\n  const Na = mtable_a[0].length; // = 210\n  const Nce = mtable_ce[0].length; // = 1440\n  const N = Na * Nce; // = 302400\n  const max_depth = 25; // pre-determined; hard-coding this makes the algorithm a bit faster\n  const all_weights = phase3_2gen_move_seqs.map((seq) => seq.length);\n  const table = new Int8Array(N).fill(max_depth);\n  const solved_indices = index_phase3_2gen(solved_state);\n  table[(solved_indices[0] % Na) + Na * solved_indices[1]] = 0;\n  let depth = 0;\n  let done = false;\n  while (!done && depth < max_depth - 1) {\n    done = true;\n    //console.log(`scanning depth ${depth}`);\n    let move_indices = Array(phase3_2gen_nmoves)\n      .fill()\n      .map((x, i) => i)\n      .filter((m) => all_weights[m] + depth < max_depth);\n    move_indices.sort((m, mm) => all_weights[m] - all_weights[mm]);\n    let weights = compose(all_weights, move_indices);\n    let mtable_a_pruned = compose(mtable_a, move_indices);\n    let mtable_ce_pruned = compose(mtable_ce, move_indices);\n    let nmoves = move_indices.length;\n    //console.log(move_indices);\n    for (\n      let state = table.indexOf(depth);\n      state !== -1;\n      state = table.indexOf(depth, state + 1)\n    ) {\n      let a = state % Na;\n      let ce = (state / Na) | 0;\n      for (let mi = 0; mi < nmoves; mi++) {\n        let weight = weights[mi];\n        let new_a = mtable_a_pruned[mi][a];\n        let new_ce = mtable_ce_pruned[mi][ce];\n        let new_state = new_a + Na * new_ce;\n        if (table[new_state] > depth + weight) {\n          done = false;\n          table[new_state] = depth + weight;\n        }\n      }\n    }\n    depth++;\n  }\n  return (phase3_2gen_ace_table = table);\n}\n\nlet phase3_2gen_ce_mirror_map;\nfunction generate_phase3_2gen_ce_mirror_map() {\n  if (phase3_2gen_ce_mirror_map) {\n    return phase3_2gen_ce_mirror_map;\n  }\n  const mtable_ce = generate_phase3_2gen_corneredge_mtable().slice(0, 2);\n  const solved_indices = index_phase3_2gen(solved_state);\n  return (phase3_2gen_ce_mirror_map = generate_mirrored_coordinate_table(\n    mtable_ce,\n    solved_indices[1],\n    solved_indices[1],\n  ));\n}\n\n/*\nfunction solve_phase3_2gen(facelets, indices=index_phase3_2gen(facelets), simplify=true)\n{\n\tlet [ab, ce] = indices;\n\tlet Nab = 44100;\n\tlet mtable_ab = generate_phase3_2gen_centre_mtable();\n\tlet mtable_ce = generate_phase3_2gen_corneredge_mtable();\n\tlet depth_table = generate_phase3_2gen_depth_table();\n\tlet seq = [];\n\twhile (depth_table[ab + Nab*ce] > 0)\n\t{\n\t\tlet distance = depth_table[ab + Nab*ce];\n\t\tfor (let m = 0; m < phase3_2gen_nmoves; m++)\n\t\t{\n\t\t\tlet new_ab = mtable_ab[m][ab];\n\t\t\tlet new_ce = mtable_ce[m][ce];\n\t\t\tlet new_distance = depth_table[new_ab + Nab*new_ce];\n\t\t\tif (new_distance === distance-phase3_2gen_move_seqs[m].length)\n\t\t\t{\n\t\t\t\tseq = seq.concat(phase3_2gen_move_seqs[m]);\n\t\t\t\tab = new_ab;\n\t\t\t\tce = new_ce;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn simplify ? simplify_move_sequence(seq) : seq;\n}\n*/\n\nfunction solve_phase3_2gen(facelets, indices = index_phase3_2gen(facelets)) {\n  //const THRESHOLD = 31;\n  let [ab, ce] = indices;\n  let a = ab % 210;\n  let b = Math.floor(ab / 210);\n  let mtable_ab = generate_phase3_2gen_centre_mtable();\n  let mtable_a = cached_mtables.phase3_2gen_centreA;\n  let mtable_b = cached_mtables.phase3_2gen_centreB;\n  let mtable_ce = generate_phase3_2gen_corneredge_mtable();\n  let ace_table = generate_phase3_2gen_ace_table();\n  let mirror_map_ce = generate_phase3_2gen_ce_mirror_map();\n  let bound = 0;\n  while (true) {\n    let gen = solve_phase3_2gen_ida(\n      a,\n      b,\n      ce,\n      mtable_a,\n      mtable_b,\n      mtable_ce,\n      ace_table,\n      mirror_map_ce,\n      bound,\n    );\n    for (let solution of gen) {\n      return solution.map((m) => phase3_2gen_move_seqs[m]).flat();\n    }\n    bound++;\n  }\n}\n\nfunction solve_phase3_2gen_readable(\n  facelets,\n  indices = index_phase3_2gen(facelets),\n) {\n  //const THRESHOLD = 31;\n  let [ab, ce] = indices;\n  let a = ab % 210;\n  let b = Math.floor(ab / 210);\n  let mtable_ab = generate_phase3_2gen_centre_mtable();\n  let mtable_a = cached_mtables.phase3_2gen_centreA;\n  let mtable_b = cached_mtables.phase3_2gen_centreB;\n  let mtable_ce = generate_phase3_2gen_corneredge_mtable();\n  //let depth_table = generate_phase3_2gen_depth_table();\n  let ace_table = generate_phase3_2gen_ace_table();\n  let mirror_map_ce = generate_phase3_2gen_ce_mirror_map();\n  let initial = solve_phase3_2gen(facelets).length;\n  let best_score = Infinity;\n  let best_solution;\n  //console.log(`initial: ${initial}`);\n  for (let bound = initial; bound <= initial + 0; bound++) {\n    let gen = solve_phase3_2gen_ida(\n      a,\n      b,\n      ce,\n      mtable_a,\n      mtable_b,\n      mtable_ce,\n      ace_table,\n      mirror_map_ce,\n      bound,\n    );\n    for (let solution of gen) {\n      let expanded = solution.map((m) => phase3_2gen_move_seqs[m]).flat();\n      let simplified = simplify_move_sequence(expanded);\n      let score = grade_readability(simplified);\n      if (score < best_score) {\n        best_score = score;\n        best_solution = simplified;\n        //console.log(`${score} ${stringify_move_sequence(simplified, true)}`);\n        //if (score <= THRESHOLD) {break search;}\n      }\n    }\n  }\n  return best_solution;\n}\n\nfunction alternation_penalty(x) {\n  return ((x - 1) * (x - 2)) / 2;\n  // A B A B A       costs 1\n  // A B A B A B     costs 3\n  // A B A B A B A   costs 6\n  // A B A B A B A B costs 10\n  // etc.\n  // this should be chosen to be a convex function\n}\n\nfunction grade_readability(seq) {\n  let nowide = stringify_move_sequence(seq, true).replace(/'/g, \"\").split(\" \");\n  return (\n    seq.length +\n    alternations(nowide)\n      .map(alternation_penalty)\n      .reduce((x, y) => x + y, 0)\n  );\n}\n\nfunction alternations(seq) {\n  // return a list of \"alternating\" run lengths\n  // convention:\n  // A B       does not count\n  // A B A     counts as length 1\n  // A B A B   counts as length 2\n  // A B A B A counts as length 3\n  // etc.\n  if (seq.length < 3) {\n    return [];\n  }\n  let n = seq.length;\n  let a = [];\n  for (let i = 0; i < n - 2; i++) {\n    a[i] = seq[i] === seq[i + 2];\n  }\n  a.push(false);\n  let i = -1;\n  let runs = [];\n  while (i < n - 2) {\n    i = a.indexOf(true, i + 1);\n    if (i === -1) {\n      break;\n    }\n    let j = a.indexOf(false, i + 1);\n    runs.push(j - i);\n    i = j;\n  }\n  return runs;\n}\n\nfunction* solve_phase3_2gen_ida(\n  a,\n  b,\n  ce,\n  mtable_a,\n  mtable_b,\n  mtable_ce,\n  ace_table,\n  mirror_map_ce,\n  bound,\n  last = -1,\n) {\n  let h_ace = ace_table[a + 210 * ce];\n  let h_bce = ace_table[b + 210 * mirror_map_ce[ce]];\n  let h = Math.max(h_ace, h_bce);\n  //console.log(h_ace, h_bce, bound);\n  if (h > bound) {\n    return;\n  }\n  if (bound === 0) {\n    yield [];\n    return;\n  }\n  if (h === 0) {\n    return;\n  } // this solution includes redundant moves\n  for (let m = 0; m < phase3_2gen_nmoves; m++) {\n    if (m === last && phase3_2gen_move_orders[m] <= 3) {\n      continue;\n    }\n    let new_a = mtable_a[m][a];\n    let new_b = mtable_b[m][b];\n    let new_ce = mtable_ce[m][ce];\n    let new_bound = bound - phase3_2gen_move_seqs[m].length;\n    if (new_bound < 0) {\n      continue;\n    }\n    let subpath_gen = solve_phase3_2gen_ida(\n      new_a,\n      new_b,\n      new_ce,\n      mtable_a,\n      mtable_b,\n      mtable_ce,\n      ace_table,\n      mirror_map_ce,\n      new_bound,\n      m,\n    );\n    while (true) {\n      let { value: subpath, done } = subpath_gen.next();\n      if (done) {\n        break;\n      }\n      yield [m].concat(subpath);\n    }\n  }\n}\n\n/* Some glue code */\n\nfunction solve_phase2_and_phase3_fast(\n  facelets,\n  phase2_attempts = 200,\n  cap = 24,\n) {\n  let pool = [];\n  let gen = solve_phase2_gen(facelets);\n  let facelets_t2 = compose(facelets, move_X).map((x) => x ^ 1);\n  let gen_t2 = solve_phase2_gen(facelets_t2);\n  let best = Array(1000);\n  // phase 2 always takes <= 15 moves and phase 3 <= 25 moves, so this is a safe upper bound\n  for (let i = 0; i < phase2_attempts; i++) {\n    {\n      let { value, done } = gen.next();\n      if (!done) {\n        let intermediate_facelets = apply_move_sequence(facelets, value);\n        let solution = value.concat(solve_phase3_2gen(intermediate_facelets));\n        if (solution.length <= cap) {\n          return solution;\n        } else if (solution.length < best.length) {\n          best = solution;\n        }\n      }\n    }\n    {\n      let { value, done } = gen_t2.next();\n      if (!done) {\n        let intermediate_facelets = apply_move_sequence(facelets_t2, value);\n        let solution = value\n          .concat(solve_phase3_2gen(intermediate_facelets))\n          .map(([m, r]) => [m ^ 2, r]);\n        if (solution.length <= cap) {\n          return solution;\n        } else if (solution.length < best.length) {\n          best = solution;\n        }\n      }\n    }\n  }\n  return best;\n}\n\nfunction solve_phase2_and_phase3_readable(\n  facelets,\n  phase2_attempts = 20,\n  cap = 30,\n) {\n  let pool = [];\n  let gen = solve_phase2_gen(facelets);\n  let facelets_t2 = compose(facelets, move_X).map((x) => x ^ 1);\n  let gen_t2 = solve_phase2_gen(facelets_t2);\n  let best;\n  let best_score = Infinity;\n  for (let i = 0; i < phase2_attempts; i++) {\n    {\n      let { value, done } = gen.next();\n      if (!done) {\n        let intermediate_facelets = apply_move_sequence(facelets, value);\n        let solution = simplify_move_sequence(\n          value.concat(solve_phase3_2gen_readable(intermediate_facelets)),\n        );\n        let score = grade_readability(solution);\n        if (score <= cap) {\n          return solution;\n        } else if (score < best_score) {\n          best = solution;\n          best_score = score;\n        }\n      }\n    }\n    {\n      let { value, done } = gen_t2.next();\n      if (!done) {\n        let intermediate_facelets = apply_move_sequence(facelets_t2, value);\n        let solution = simplify_move_sequence(\n          value.concat(solve_phase3_2gen_readable(intermediate_facelets)),\n        );\n        solution = solution.map(([m, r]) => [m ^ 2, r]);\n        let score = grade_readability(solution);\n        if (score <= cap) {\n          return solution;\n        } else if (score < best_score) {\n          best = solution;\n          best_score = score;\n        }\n      }\n    }\n  }\n  return best;\n}\n\nexport function randomFTOScrambleString() {\n  return generate_random_state_scramble();\n}\n"],
-  "mappings": ";AAaA,SAAS,uBAAuB;AAchC,SAAS,UAAU,GAAG;AACpB,MAAI,IAAI,GAAG;AACT,WAAO;AAAA,EACT;AACA,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,SAAK;AAAA,EACP;AACA,SAAO;AACT;AAEA,SAAS,EAAE,GAAG,GAAG;AACf,MAAI,IAAI,KAAK,IAAI,GAAG;AAClB,WAAO;AAAA,EACT;AACA,MAAI,MAAM,KAAK,MAAM,GAAG;AACtB,WAAO;AAAA,EACT;AACA,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAM,KAAK,IAAI,MAAO,IAAI,KAAM;AAAA,EAClC;AACA,SAAO;AACT;AAEA,SAAS,GAAG,GAAG,IAAI,IAAI,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI;AAChD,SAAO,EAAE,GAAG,KAAK,EAAE,IAAI,EAAE,KAAK,IAAI,EAAE,IAAI,EAAE,KAAK,IAAI,EAAE;AACvD;AAEA,SAAS,qBAAqB,MAAM;AAClC,SAAO,KAAK,MAAM;AAClB,MAAI,IAAI,KAAK;AACb,MAAI,IAAI,UAAU,IAAI,CAAC;AACvB,MAAI,MAAM;AACV,SAAO,IAAI,GAAG;AACZ;AAGA,QAAI,IAAI,KAAK,CAAC;AACd,WAAO,IAAI;AACX,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,IAAI,KAAK,IAAI,CAAC;AAClB,WAAK,CAAC,IAAI,KAAK,IAAI;AAAA,IACrB;AACA,SAAK;AAAA,EACP;AACA,SAAO;AACT;AAkBA,SAAS,mBAAmB,GAAG;AAC7B,MAAI,IAAI,EAAE;AACV,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC9B,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG;AACf,kBAAU;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,yBAAyB,KAAK,GAAG;AACxC,MAAI,OAAO,CAAC;AACZ,MAAI,IAAI,UAAU,IAAI,CAAC,IAAI;AAC3B,MAAI,SAAS;AACb,WAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC9B,SAAK,CAAC,IAAK,MAAM,IAAK;AACtB,WAAO;AACP,SAAK,IAAI,IAAI;AAAA,EACf;AACA,OAAK,IAAI,CAAC,IAAI;AACd,WAAS,IAAI,IAAI,GAAG,KAAK,GAAG,KAAK;AAC/B,aAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;AAC9B,UAAI,KAAK,CAAC,KAAK,KAAK,CAAC,GAAG;AACtB,aAAK,CAAC;AAAA,MACR,OAAO;AACL,kBAAU;AAAA,MACZ;AAAA,IACF;AAAA,EACF;AACA,MAAI,WAAW,GAAG;AAChB,KAAC,KAAK,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC;AAAA,EACxD;AACA,SAAO;AACT;AAEA,SAAS,yBAAyB,MAAM;AACtC,SAAO,qBAAqB,IAAI,KAAK;AACvC;AAEA,IAAI,CAAC,2BAA2B,yBAAyB,KAAK,MAAM;AAClE,MAAI,oBAAoB,IAAI,UAAU,MAAM,CAAC;AAC7C,MAAI,mBAAmB,IAAI,UAAU,MAAM,CAAC;AAC5C,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,aAAS,IAAI,GAAG,UAAU,GAAG,IAAI,GAAG,KAAK;AACvC,WAAM,MAAM,IAAK,OAAO,GAAG;AACzB;AAAA,MACF;AACA,wBAAmB,KAAK,IAAK,CAAC,IAAI;AAClC,uBAAkB,WAAW,IAAK,CAAC,IAAI;AACvC;AAAA,IACF;AAAA,EACF;AAEA,WAASA,2BAA0B,MAAM;AACvC,QAAI,SAAS;AACb,QAAI,IAAI;AACR,QAAI,MAAM;AACV,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,IAAI,KAAK,CAAC;AACd,aAAO,kBAAkB,SAAU,KAAK,CAAE,IAAI;AAC9C,gBAAU,EAAE,KAAK;AACjB,WAAK,IAAI;AAAA,IACX;AACA,WAAO;AAAA,EACT;AAGA,WAASC,2BAA0B,KAAK,MAAM;AAC5C,QAAI,SAAS;AACb,QAAI,IAAI;AACR,QAAI,SAAS;AACb,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,IAAK,MAAM,IAAK;AACpB,aAAO,IAAI;AACX,gBAAU,IAAI;AACd,UAAI,IAAI,iBAAiB,SAAU,KAAK,CAAE;AAC1C,WAAK,CAAC,IAAI;AACV,gBAAU,EAAE,KAAK;AACjB,WAAK,IAAI;AAAA,IACX;AAEA,SAAK,CAAC,IAAI,iBAAiB,SAAU,UAAU,CAAE;AACjD,SAAK,CAAC,IAAI,iBAAiB,UAAW,SAAS,MAAM,CAAE;AACvD,WAAO;AAAA,EACT;AAEA,SAAO,CAACD,4BAA2BC,0BAAyB;AAC9D,GAAG;AAEH,SAAS,mBAAmB,GAAG;AAC7B,MAAI,IAAI,CAAC,CAAC;AACV,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,IAAI,gBAAgB,IAAI,CAAC;AAC7B,MAAE,CAAC,IAAI,EAAE,CAAC;AACV,MAAE,CAAC,IAAI;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,wBAAwB,GAAG;AAClC,MAAI,IAAI,mBAAmB,CAAC;AAC5B,MAAI,mBAAmB,CAAC,MAAM,GAAG;AAC/B,KAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;AAAA,EAC5B;AACA,SAAO;AACT;AAgDA,SAAS,IAAI,GAAG;AACd,OAAK;AACL,SAAO,KAAK,KAAK,MAAM,IAAK,IAAI,CAAE;AACpC;AAEA,IAAI,qBAAqB,CAAC;AAC1B,SAAS,4BAA4B,GAAG,GAAG;AAEzC,OAAK;AACL,OAAK;AACL,MAAI,MAAM,GAAG,CAAC,IAAI,CAAC;AACnB,MAAI,mBAAmB,GAAG,GAAG;AAC3B,WAAO,mBAAmB,GAAG;AAAA,EAC/B;AACA,MAAI,QAAQ,EAAE,GAAG,CAAC;AAClB,MAAI,sBAAsB,IAAI,YAAY,KAAK;AAC/C,MAAI,sBAAsB,IAAI,YAAY,KAAK,CAAC,EAAE,KAAK,EAAE;AACzD,WAAS,IAAI,GAAG,KAAK,KAAK,KAAK,GAAG,IAAI,OAAO,KAAK;AAChD,wBAAoB,CAAC,IAAI;AACzB,wBAAoB,CAAC,IAAI;AACzB,QAAI,IAAI,IAAK,IAAI;AACjB,QAAK,IAAI,KAAQ,CAAC,IAAI,CAAC,CAAC,KAAK,KAAO,IAAI,CAAC,IAAI;AAAA,EAC/C;AACA,SAAQ,mBAAmB,GAAG,IAAI,CAAC,qBAAqB,mBAAmB;AAC7E;AAEA,SAAS,SAAS,GAAG;AACnB,OAAK;AACL,MAAI,IAAI;AACR,SAAO,MAAM,GAAG;AACd,SAAK,IAAI;AACT;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,YAAY,GAAG;AACtB,OAAK;AACL,OAAK,IAAK,KAAK,KAAM;AACrB,OAAK,IAAK,KAAK,KAAM;AACrB,OAAK,IAAK,KAAK,KAAM;AACrB,OAAK,IAAK,KAAK,KAAM;AACrB,SAAO;AACT;AAEA,SAAS,gBAAgB,GAAG,GAAG;AAC7B,SAAO,YAAY,CAAC,IAAK,YAAY,CAAC,KAAK;AAC7C;AAEA,IAAI,sBAAsB,CAAC;AAC3B,SAAS,6BAA6B,GAAG,IAAI,IAAI,IAAI,IAAI;AAMvD,OAAK;AACL,QAAM;AACN,QAAM;AACN,QAAM;AACN,QAAM;AACN,MAAI,MAAM,KAAK,KAAK,KAAK,IAAI;AAC3B,UAAM,IAAI,MAAM,kDAAkD;AAAA,EACpE;AACA,MAAI,MAAM,CAAC,GAAG,IAAI,IAAI,IAAI,EAAE,EAAE,KAAK,GAAG;AACtC,MAAI,oBAAoB,GAAG,GAAG;AAC5B,WAAO,oBAAoB,GAAG;AAAA,EAChC;AACA,MAAI,CAAC,MAAM,IAAI,IAAI,4BAA4B,GAAG,KAAK,EAAE;AACzD,MAAI,CAAC,MAAM,IAAI,IAAI,4BAA4B,GAAG,KAAK,EAAE;AACzD,MAAI,QAAQ,GAAG,GAAG,IAAI,IAAI,IAAI,EAAE;AAChC,MAAI,uBAAuB,IAAI,YAAY,KAAK;AAChD,MAAI,uBAAuB,IAAI,YAAY,KAAK,CAAC,EAAE,KAAK,EAAE;AAC1D,WAAS,IAAI,GAAG,QAAQ,GAAG,IAAI,KAAK,QAAQ,KAAK;AAC/C,QAAI,KAAK,KAAK,CAAC;AACf,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAI,KAAK,KAAK,CAAC;AACf,UAAI,SAAS,KAAK,EAAE,MAAM,IAAI;AAC5B,YAAI,IAAI,gBAAgB,IAAI,EAAE;AAC9B,6BAAqB,KAAK,IAAI;AAC9B,6BAAqB,CAAC,IAAI;AAC1B;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAQ,oBAAoB,GAAG,IAAI;AAAA,IACjC;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,QAAQ,GAAG,GAAG;AACrB,MAAIC,KAAI,CAAC;AACT,WAAS,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,IAAAA,GAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;AAAA,EACf;AACA,SAAOA;AACT;AAEA,SAAS,SAAS,GAAG,GAAGA,IAAG;AACzB,MAAI,IAAI,CAAC;AACT,WAAS,IAAI,GAAG,IAAIA,GAAE,QAAQ,KAAK;AACjC,MAAE,CAAC,IAAI,EAAE,EAAEA,GAAE,CAAC,CAAC,CAAC;AAAA,EAClB;AACA,SAAO;AACT;AAyBA,SAAS,wBAAwB,QAAQ,GAAG;AAC1C,MAAI,OAAO,CAAC;AACZ,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,SAAK,CAAC,IAAI;AAAA,EACZ;AACA,WAAS,SAAS,QAAQ;AACxB,aAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,WAAK,MAAM,CAAC,CAAC,IAAI,OAAO,IAAI,KAAK,MAAM,MAAM;AAAA,IAC/C;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,MAAM,MAAM;AAGtC,MAAI,IAAI,KAAK;AACb,MAAI,QAAQ,MAAM,CAAC,EAAE,KAAK,CAAC;AAC3B,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAM,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;AAAA,EACtC;AACA,MAAI,KAAK,MAAM,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;AAClC,MAAI,UAAU,MAAM,EAAE;AACtB,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,KAAK,CAAC,GAAG;AACX,cAAQ,MAAM,CAAC,CAAC,IAAI,MAAM,KAAK,CAAC,CAAC;AAAA,IACnC;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,mBAAmB,MAAM;AAChC,MAAI,IAAI,KAAK;AACb,MAAI,UAAU,MAAM,CAAC;AACrB,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,YAAQ,KAAK,CAAC,CAAC,IAAI;AAAA,EACrB;AACA,SAAO;AACT;AAEA,SAAS,IAAI,GAAG,GAAG;AACjB,SAAO,KAAK,GAAG;AACb,KAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC;AAAA,EACpB;AACA,SAAO,KAAK,IAAI,IAAI,CAAC;AACvB;AAEA,SAAS,IAAI,GAAG,GAAG;AACjB,SAAQ,IAAI,IAAK,IAAI,GAAG,CAAC;AAC3B;AAEA,SAAS,kBAAkB,MAAM;AAC/B,MAAI,QAAQ;AACZ,MAAI,IAAI,KAAK;AACb,MAAI,UAAU,MAAM,CAAC,EAAE,KAAK,KAAK;AACjC,MAAI,IAAI;AACR,SAAO,MAAM;AACX,QAAI,QAAQ,QAAQ,OAAO,IAAI,CAAC;AAChC,QAAI,MAAM,IAAI;AACZ;AAAA,IACF;AACA,QAAI,eAAe;AACnB,QAAI,IAAI;AACR,WAAO,CAAC,QAAQ,CAAC,GAAG;AAClB,cAAQ,CAAC,IAAI;AACb,UAAI,KAAK,CAAC;AACV;AAAA,IACF;AAEA,YAAQ,IAAI,OAAO,YAAY;AAAA,EACjC;AACA,SAAO;AACT;AAoCA,IAAI,eAAe,MAAM,EAAE,EACxB,KAAK,EACL,IAAI,CAAC,GAAG,MAAO,IAAI,IAAK,CAAC;AAE5B,IAAI,SAAS;AAAA,EACX;AAAA,IACE,CAAC,GAAG,GAAG,CAAC;AAAA,IACR,CAAC,GAAG,GAAG,CAAC;AAAA,IACR,CAAC,GAAG,GAAG,CAAC;AAAA,IACR,CAAC,GAAG,IAAI,EAAE;AAAA,IACV,CAAC,IAAI,IAAI,EAAE;AAAA,IACX,CAAC,IAAI,IAAI,EAAE;AAAA,IACX,CAAC,IAAI,IAAI,EAAE;AAAA,IACX,CAAC,IAAI,IAAI,EAAE;AAAA,IACX,CAAC,IAAI,IAAI,EAAE;AAAA,EACb;AAAA,EACA;AACF;AACA,IAAI,UAAU,QAAQ,QAAQ,MAAM;AAEpC,IAAI,SAAS,MAAM,EAAE,EAClB,KAAK,EACL,IAAI,CAAC,GAAG,OAAQ,IAAI,KAAM,KAAK,MAAO,IAAI,KAAK,EAAG;AACrD,IAAI,SAAS,MAAM,EAAE,EAClB,KAAK,EACL,IAAI,CAAC,GAAG,OAAQ,IAAI,KAAM,KAAK,MAAO,IAAI,MAAM,EAAG;AACtD,IAAI,SAAS,MAAM,EAAE,EAClB,KAAK,EACL,IAAI,CAAC,GAAG,OAAO,IAAI,MAAM,EAAE;AAG9B,IAAI,SAAS,SAAS,QAAQ,SAAS,MAAM;AAC7C,IAAI,SAAS,SAAS,QAAQ,QAAQ,MAAM;AAC5C,IAAI,SAAS,SAAS,QAAQ,QAAQ,MAAM;AAO5C,IAAI,UAAU;AAAA,EACZ;AAAA,IACE,CAAC,IAAI,IAAI,EAAE;AAAA,IACX,CAAC,IAAI,IAAI,EAAE;AAAA,IACX,CAAC,IAAI,IAAI,EAAE;AAAA,IACX,CAAC,IAAI,IAAI,EAAE;AAAA,IACX,CAAC,IAAI,IAAI,EAAE;AAAA,IACX,CAAC,IAAI,IAAI,EAAE;AAAA,EACb;AAAA,EACA;AACF;AACA,IAAI,UAAU,QAAQ,QAAQ,OAAO;AACrC,IAAI,WAAW,QAAQ,SAAS,OAAO;AAEvC,IAAI,UAAU,SAAS,QAAQ,UAAU,MAAM;AAC/C,IAAI,UAAU,SAAS,QAAQ,SAAS,MAAM;AAC9C,IAAI,UAAU,SAAS,QAAQ,SAAS,MAAM;AAE9C,IAAI,aAAa,MAAM,EAAE,EACtB,KAAK,EACL,IAAI,CAAC,GAAG,MAAO,IAAI,IAAK,CAAC;AAE5B,IAAI,wBAAwB;AAAA,EAC1B,CAAC,GAAG,IAAI,GAAG,EAAE;AAAA;AAAA,EACb,CAAC,GAAG,IAAI,IAAI,EAAE;AAAA;AAAA,EACd,CAAC,GAAG,IAAI,IAAI,EAAE;AAAA;AAAA,EACd,CAAC,IAAI,IAAI,IAAI,EAAE;AAAA;AAAA,EACf,CAAC,IAAI,IAAI,IAAI,EAAE;AAAA;AAAA,EACf,CAAC,IAAI,IAAI,IAAI,EAAE;AAAA;AACjB;AAEA,IAAI,sBAAsB;AAAA,EACxB,CAAC,GAAG,EAAE;AAAA;AAAA,EACN,CAAC,GAAG,EAAE;AAAA;AAAA,EACN,CAAC,GAAG,EAAE;AAAA;AAAA,EACN,CAAC,IAAI,EAAE;AAAA;AAAA,EACP,CAAC,IAAI,EAAE;AAAA;AAAA,EACP,CAAC,IAAI,EAAE;AAAA;AAAA,EACP,CAAC,IAAI,EAAE;AAAA;AAAA,EACP,CAAC,IAAI,EAAE;AAAA;AAAA,EACP,CAAC,IAAI,EAAE;AAAA;AAAA,EACP,CAAC,IAAI,EAAE;AAAA;AAAA,EACP,CAAC,IAAI,EAAE;AAAA;AAAA,EACP,CAAC,IAAI,EAAE;AAAA;AACT;AAEA,IAAI,yBAAyB,MAAM,EAAE,EAClC,KAAK,EACL,IAAI,CAAC,GAAG,OAAQ,IAAI,IAAK,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;AACrD,IAAI,yBAAyB,uBAAuB,IAAI,CAAC,MAAM,IAAI,EAAE;AA0BrE,SAAS,sBAAsB,SAAS,SAAS;AAI/C,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QACE,YAAY,WAAW,sBAAsB,CAAC,EAAE,CAAC,CAAC,KAClD,YAAY,WAAW,sBAAsB,CAAC,EAAE,CAAC,CAAC,GAClD;AACA,aAAO,CAAC,GAAG,CAAC;AAAA,IACd,WACE,YAAY,WAAW,sBAAsB,CAAC,EAAE,CAAC,CAAC,KAClD,YAAY,WAAW,sBAAsB,CAAC,EAAE,CAAC,CAAC,GAClD;AACA,aAAO,CAAC,GAAG,CAAC;AAAA,IACd;AAAA,EACF;AACA,QAAM,IAAI,MAAM,sBAAsB;AACxC;AAEA,SAAS,oBAAoB,SAAS,SAAS;AAG7C,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,QACE,YAAY,WAAW,oBAAoB,CAAC,EAAE,CAAC,CAAC,KAChD,YAAY,WAAW,oBAAoB,CAAC,EAAE,CAAC,CAAC,GAChD;AACA,aAAO;AAAA,IACT;AACA,QACE,YAAY,WAAW,oBAAoB,CAAC,EAAE,CAAC,CAAC,KAChD,YAAY,WAAW,oBAAoB,CAAC,EAAE,CAAC,CAAC,GAChD;AACA,aAAO;AAAA,IACT;AAAA,EACF;AACA,QAAM,IAAI,MAAM,oBAAoB;AACtC;AAEA,SAAS,iBAAiB,UAAU,UAAU;AAC5C,SAAO;AAAA,IACL,SAAS,sBAAsB,QAAQ,EAAE,CAAC,CAAC;AAAA,IAC3C,SAAS,sBAAsB,QAAQ,EAAE,CAAC,CAAC;AAAA,EAC7C;AACF;AAEA,SAAS,eAAe,UAAU,UAAU;AAC1C,SAAO;AAAA,IACL,SAAS,oBAAoB,QAAQ,EAAE,CAAC,CAAC;AAAA,IACzC,SAAS,oBAAoB,QAAQ,EAAE,CAAC,CAAC;AAAA,EAC3C;AACF;AAEA,SAAS,iBAAiB,UAAU,UAAU,OAAO,aAAa;AAChE,MAAI,UAAU,sBAAsB,QAAQ;AAC5C,MAAI,UAAU,sBAAsB,KAAK,EAAE,IAAI,CAAC,MAAM,WAAW,CAAC,CAAC;AACnE,MAAI,cAAc,MAAM,GAAG;AACzB,cAAU,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC,GAAG,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC;AAAA,EAC3D;AACA,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAS,QAAQ,CAAC,CAAC,IAAI,QAAQ,CAAC;AAAA,EAClC;AACF;AAEA,SAAS,eAAe,UAAU,UAAU,OAAO;AACjD,MAAI,UAAU,oBAAoB,QAAQ;AAC1C,MAAI,UAAU,oBAAoB,KAAK,EAAE,IAAI,CAAC,MAAM,WAAW,CAAC,CAAC;AACjE,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAS,QAAQ,CAAC,CAAC,IAAI,QAAQ,CAAC;AAAA,EAClC;AACF;AAEA,SAAS,6BAA6B,MAAM;AAC1C,MAAI,QAAQ,KAAK,IAAI,CAAC,MAAM,WAAW,CAAC,CAAC;AAEzC,MAAI,SAAS,MAAM,CAAC,EACjB,KAAK,EACL,IAAI,CAAC,GAAG,MAAM,iBAAiB,OAAO,CAAC,CAAC;AAC3C,MAAI,UAAU,OAAO,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,CAAC;AAC9C,MAAI,KAAK,QAAQ,OAAO,QAAQ,IAAI,CAAC,OAAO,IAAI,KAAK,EAAE,CAAC;AACxD,MAAI,KAAK,MAAM,EAAE,EACd,KAAK,EACL,IAAI,CAAC,GAAG,MAAM,eAAe,OAAO,CAAC,CAAC;AACzC,MAAI,KAAK,MAAM,EAAE,EACd,KAAK,EACL;AAAA,IAAI,CAAC,GAAG,MACP,uBAAuB,QAAQ,KAAK,uBAAuB,CAAC,CAAC,CAAC;AAAA,EAChE;AACF,MAAI,KAAK,MAAM,EAAE,EACd,KAAK,EACL;AAAA,IAAI,CAAC,GAAG,MACP,uBAAuB,QAAQ,KAAK,uBAAuB,CAAC,CAAC,CAAC;AAAA,EAChE;AACF,SAAO,EAAE,IAAQ,IAAQ,IAAQ,GAAO;AAC1C;AAEA,IAAI,QAAQ;AAAA,EACV;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,IAAI,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AAExD,IAAI,oBAAoB,MAAM,IAAI,4BAA4B;AAqB9D,SAAS,eAAe;AACtB,MAAI,WAAW,MAAM,EAAE;AACvB,MAAI,KAAK,wBAAwB,CAAC;AAClC,KAAG,KAAK,CAAC;AACT,MAAI,KAAK,MAAM,CAAC,EACb,KAAK,EACL,IAAI,CAAC,MAAM,gBAAgB,CAAC,CAAC;AAChC,KAAG,KAAK,GAAG,OAAO,CAAC,GAAG,MAAM,IAAI,CAAC,CAAC;AAClC,KAAG,KAAK,CAAC;AACT,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,qBAAiB,UAAU,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAAA,EAC5C;AAEA,MAAI,KAAK,wBAAwB,EAAE;AACnC,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,mBAAe,UAAU,GAAG,GAAG,CAAC,CAAC;AAAA,EACnC;AAEA,MAAI,IAAI,mBAAmB,EAAE,EAAE,IAAI,CAAC,MAAO,IAAI,IAAK,CAAC;AACrD,MAAI,IAAI,mBAAmB,EAAE,EAAE,IAAI,CAAC,MAAM,KAAM,IAAI,IAAK,EAAE;AAC3D,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,aAAS,uBAAuB,CAAC,CAAC,IAAI,EAAE,CAAC;AACzC,aAAS,uBAAuB,CAAC,CAAC,IAAI,EAAE,CAAC;AAAA,EAC3C;AACA,SAAO;AACT;AAEA,SAAS,wBAAwB,eAAe,UAAU,OAAO;AAC/D,MAAI,SAAS;AACX,UAAM,IAAI;AACV,UAAM,IAAI;AACV,UAAM,IAAI;AACV,UAAM,IAAI;AACV,UAAM,IAAI;AACV,UAAM,KAAK;AACX,UAAM,IAAI;AACV,UAAM,KAAK;AACX,oBAAgB,cAAc,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC;AAClD,QAAI,WAAW,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,EAAE;AACxC,QAAI,YAAY;AAAA,MACd,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,IAAI,GAAG,CAAC;AAAA,MACzB,CAAC,IAAI,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,CAAC;AAAA,MACzB,CAAC,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE;AAAA,MACzB,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,EAAE;AAAA,IAC3B;AACA,gBAAY,UAAU,OAAO,UAAU,IAAI,CAAC,MAAM,mBAAmB,CAAC,CAAC,CAAC;AACxE,aAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC7C,UAAI,cAAc,CAAC,EAAE,CAAC,IAAI,GAAG;AAE3B,sBAAc,CAAC,EAAE,CAAC,IAAI,SAAS,cAAc,CAAC,EAAE,CAAC,CAAC;AAAA,MACpD,OAAO;AAEL,YAAI,IAAI,SAAS,cAAc,CAAC,EAAE,CAAC,CAAC;AACpC,YAAI,IAAI,cAAc,CAAC,EAAE,CAAC;AAC1B,sBAAc,CAAC,EAAE,CAAC,IAAI;AACtB,mBAAW,QAAQ,MAAM,IAAI,UAAU,IAAI,CAAC,IAAI,UAAU,CAAC,GAAG,QAAQ;AAAA,MAExE;AAAA,IACF;AAAA,EACF;AACA,MAAI,QAAQ,UAAU,oBAAoB,MAAM,GAAG,IAAI;AACvD,MAAI,WAAW,CAAC,KAAK,IAAI,GAAG;AAC5B,MAAI,IAAI,cAAc,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,MAAM,CAAC,IAAI,SAAS,CAAC,CAAC;AAC5D,SAAO,EAAE,KAAK,GAAG;AACnB;AAMA,SAAS,oBAAoB,OAAO,eAAe;AACjD,WAAS,CAAC,GAAG,CAAC,KAAK,eAAe;AAChC,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,cAAQ,QAAQ,OAAO,MAAM,CAAC,CAAC;AAAA,IACjC;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,qBAAqB,eAAe;AAC3C,SAAO,cAAc,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,KAAK,CAAC,CAAC,EAAE,QAAQ;AACjE;AAEA,SAAS,uBAAuB,eAAe,aAAa,OAAO;AACjE,MAAI,cAAc,WAAW,GAAG;AAC9B,WAAO,CAAC;AAAA,EACV;AACA,MAAI,aAAa,CAAC;AAClB,MAAI,YAAY;AAChB,WAAS,CAAC,GAAG,CAAC,KAAK,eAAe;AAChC,QAAI,aAAa,UAAU,CAAC,MAAM,GAAG;AAEnC,gBAAU,CAAC,KAAK;AAChB,gBAAU,CAAC,KAAK;AAChB,UAAI,UAAU,CAAC,MAAM,GAAG;AACtB,mBAAW,IAAI;AACf,oBACE,WAAW,WAAW,IAClB,SACA,WAAW,WAAW,SAAS,CAAC;AAAA,MACxC;AAAA,IACF,WACE,WAAW,UAAU,MACpB,UAAU,CAAC,IAAI,OAAO,KACvB,WAAW,WAAW,SAAS,CAAC,EAAE,CAAC,MAAM,GACzC;AAEA,iBAAW,WAAW,SAAS,CAAC,EAAE,CAAC,KAAK;AACxC,iBAAW,WAAW,SAAS,CAAC,EAAE,CAAC,KAAK;AACxC,UAAI,WAAW,WAAW,SAAS,CAAC,EAAE,CAAC,MAAM,GAAG;AAC9C,mBAAW,OAAO,WAAW,SAAS,GAAG,CAAC;AAAA,MAC5C;AAAA,IACF,OAAO;AACL,kBAAY,CAAC,GAAG,CAAC;AACjB,iBAAW,KAAK,SAAS;AAAA,IAC3B;AAAA,EACF;AACA,MAAI,cAAc,GAAG,aAAa,OAAO,GAAG,UAAU,IAAI;AACxD,YAAQ,IAAI,cAAc,aAAa,OAAO,UAAU,EAAE;AAAA,EAC5D;AACA,SAAO;AACT;AAEA,SAAS,iCAAiC;AACxC,SAAO;AAAA,IACL,qBAAqB,MAAM,aAAa,GAAG,IAAI,CAAC;AAAA,IAChD;AAAA,EACF;AACF;AA8DA,SAAS,8BAA8B,GAAG,IAAI,IAAI,IAAI,IAAI,cAAc;AACtE,MAAI,IAAI,GAAG,GAAG,IAAI,IAAI,IAAI,EAAE;AAC5B,MAAI,SAAS,aAAa;AAC1B,MAAI,CAAC,KAAK,GAAG,IAAI,6BAA6B,GAAG,IAAI,IAAI,IAAI,EAAE;AAC/D,MAAI,SAAS,MAAM,MAAM,EACtB,KAAK,EACL,IAAI,MAAM,IAAI,YAAY,CAAC,CAAC;AAC/B,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,IAAI,IAAI,CAAC;AACb,QAAI,MAAM,MAAM,CAAC;AACjB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,CAAC,IAAK,KAAM,IAAI,IAAM;AAAA,IAC5B;AACA,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAI,OAAO,QAAQ,KAAK,aAAa,CAAC,CAAC;AACvC,UAAI,KAAK,KAAK,OAAO,CAAC,KAAK,GAAG,MAAM,MAAO,KAAM,IAAI,GAAK,CAAC;AAC3D,aAAO,CAAC,EAAE,CAAC,IAAI,IAAI,EAAE;AAAA,IACvB;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,+BAA+B,cAAc;AACpD,MAAI,IAAI,aAAa,CAAC,EAAE;AACxB,MAAI,SAAS,aAAa;AAC1B,MAAI,SAAS,MAAM,MAAM,EACtB,KAAK,EACL,IAAI,MAAM,IAAI,YAAY,CAAC,CAAC;AAC/B,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,aAAO,CAAC,EAAE,aAAa,CAAC,EAAE,CAAC,CAAC,IAAI;AAAA,IAIlC;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,gBAAgB,SAAS,SAAS;AACzC,MAAI,KAAK,QAAQ,CAAC,EAAE;AACpB,MAAI,KAAK,QAAQ,CAAC,EAAE;AACpB,MAAI,SAAS,QAAQ;AACrB,MAAI,WAAW,MAAM,MAAM,EACxB,KAAK,EACL,IAAI,MAAM,IAAI,YAAY,KAAK,EAAE,CAAC;AACrC,WAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,aAAS,IAAI,GAAG,IAAI,IAAI,KAAK;AAC3B,UAAI,QAAQ,IAAI,KAAK;AACrB,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,iBAAS,CAAC,EAAE,KAAK,IAAI,QAAQ,CAAC,EAAE,CAAC,IAAI,KAAK,QAAQ,CAAC,EAAE,CAAC;AAAA,MACxD;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,iBAAiB,QAAQ,QAAQ;AAGxC,MAAI,SAAS,OAAO;AACpB,MAAI,IAAI,OAAO,CAAC,EAAE;AAClB,MAAI,YAAY,IAAI,WAAW,CAAC;AAChC,YAAU,MAAM,IAAI;AACpB,MAAI,OAAO;AACX,SAAO,CAAC,MAAM;AACZ,WAAO;AACP,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,CAAC,UAAU,CAAC,GAAG;AACjB;AAAA,MACF;AACA,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,YAAI,CAAC,UAAU,OAAO,CAAC,EAAE,CAAC,CAAC,GAAG;AAC5B,oBAAU,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI;AAC1B,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,MAAI,MAAM,IAAI,WAAW,CAAC,EAAE,KAAK,EAAE;AACnC,WAAS,IAAI,GAAG,UAAU,GAAG,IAAI,GAAG,KAAK;AACvC,QAAI,CAAC,UAAU,CAAC,GAAG;AACjB;AAAA,IACF;AACA,QAAI,CAAC,IAAI;AACT;AAAA,EACF;AACA,SAAO,CAAC,OAAO,IAAI,CAAC,UAAU,mBAAmB,OAAO,SAAS,CAAC,GAAG,GAAG;AAC1E;AAEA,SAAS,mBAAmB,QAAQ,SAAS;AAC3C,MAAI,SAAS,OAAO;AACpB,MAAI,IAAI,OAAO,CAAC,EAAE;AAClB,MAAI,eAAe,IAAI,WAAW,CAAC,EAAE,KAAK,EAAE;AAC5C,UAAQ,QAAQ,CAAC,MAAM;AACrB,iBAAa,CAAC,IAAI;AAAA,EACpB,CAAC;AACD,MAAI,YAAY,CAAC,OAAO;AACxB,WAAS,QAAQ,GAAG,QAAQ,UAAU,QAAQ,SAAS;AACrD,QAAI,cAAc,UAAU,KAAK;AACjC,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,UAAI,IAAI,OAAO,CAAC,EAAE,YAAY,CAAC,CAAC;AAChC,UAAI,aAAa,CAAC,MAAM,IAAI;AAC1B;AAAA,MACF;AACA,UAAI,kBAAkB,YAAY,IAAI,CAAC,MAAM,OAAO,CAAC,EAAE,CAAC,CAAC;AACzD,UAAI,YAAY,UAAU;AAC1B,gBAAU,KAAK,eAAe;AAC9B,eAAS,KAAK,iBAAiB;AAC7B,YAAI,aAAa,CAAC,MAAM,IAAI;AAC1B,gBAAM,IAAI,MAAM,oBAAoB;AAAA,QACtC;AACA,qBAAa,CAAC,IAAI;AAAA,MACpB;AAAA,IACF;AAAA,EACF;AACA,MAAI,SAAS,UAAU;AACvB,MAAI,cAAc,MAAM,MAAM,EAC3B,KAAK,EACL,IAAI,MAAM,IAAI,WAAW,MAAM,CAAC;AACnC,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,aAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,kBAAY,CAAC,EAAE,CAAC,IAAI,aAAa,OAAO,CAAC,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA,IAC7D;AAAA,EACF;AACA,SAAO,CAAC,aAAa,YAAY;AACnC;AAEA,SAAS,mCAAmC,QAAQ,GAAG,GAAG;AACxD,MAAI,IAAI,OAAO,CAAC,EAAE;AAClB,MAAI,SAAS,OAAO;AACpB,MAAI,aAAa,IAAI,WAAW,CAAC,EAAE,KAAK,EAAE;AAC1C,aAAW,CAAC,IAAI;AAChB,aAAW,CAAC,IAAI;AAChB,MAAI,OAAO;AACX,SAAO,CAAC,MAAM;AACZ,WAAO;AACP,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,WAAW,CAAC,MAAM,IAAI;AACxB;AAAA,MACF;AACA,UAAI,IAAI,WAAW,CAAC;AACpB,eAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,YAAI,IAAI,IAAI;AACZ,YAAI,QAAQ,OAAO,CAAC,EAAE,CAAC;AACvB,YAAI,QAAQ,OAAO,CAAC,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;AAMlC,YAAI,WAAW,KAAK,MAAM,IAAI;AAC5B,iBAAO;AACP,qBAAW,KAAK,IAAI;AACpB,qBAAW,KAAK,IAAI;AAAA,QACtB,WAAW,WAAW,KAAK,MAAM,OAAO;AACtC,gBAAM,IAAI,MAAM,gDAAgD;AAAA,QAClE;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,IAAI,QAAQ,aAAa;AAChC,MAAI,IAAI,OAAO,CAAC,EAAE;AAClB,MAAI,SAAS,OAAO;AACpB,MAAI,SAAS,IAAI,UAAU,CAAC,EAAE,KAAK,EAAE;AACrC,WAAS,SAAS,aAAa;AAC7B,WAAO,KAAK,IAAI;AAAA,EAClB;AACA,MAAI,QAAQ;AACZ,MAAI,OAAO;AACX,SAAO,CAAC,MAAM;AACZ,WAAO;AACP,aAAS,QAAQ,GAAG,QAAQ,GAAG,SAAS;AACtC,UAAI,OAAO,KAAK,MAAM,OAAO;AAC3B;AAAA,MACF;AACA,eAAS,aAAa,GAAG,aAAa,QAAQ,cAAc;AAC1D,YAAI,YAAY,OAAO,UAAU,EAAE,KAAK;AACxC,eAAO,cAAc,OAAO;AAC1B,cAAI,OAAO,SAAS,MAAM,IAAI;AAC5B,mBAAO;AACP,mBAAO,SAAS,IAAI,QAAQ;AAAA,UAC9B;AACA,sBAAY,OAAO,UAAU,EAAE,SAAS;AAAA,QAC1C;AAAA,MACF;AAAA,IACF;AACA;AAAA,EACF;AACA,SAAO;AACT;AAoEA,SAAS,MAAM,UAAU,WAAW,OAAO;AACzC,MAAI,YAAY,iBAAiB,QAAQ,EAAE,KAAK,EAAE;AAClD,MAAI,YAAY,oBAAoB,UAAU,SAAS;AACvD,MAAI,aACF,WAAW,mCAAmC,8BAC9C,SAAS;AACX,MAAI,WAAW,uBAAuB,UAAU,OAAO,SAAS,GAAG,KAAK;AACxE,MACE,oBAAoB,UAAU,QAAQ,EAAE,KAAK,EAAE,MAAM,aAAa,KAAK,EAAE,GACzE;AACA,YAAQ,IAAI,iBAAiB;AAC7B,YAAQ,IAAI,QAAQ;AACpB,YAAQ,IAAI,SAAS;AACrB,YAAQ,IAAI,SAAS;AACrB,YAAQ,IAAI,SAAS;AACrB,YAAQ,IAAI,oBAAoB,UAAU,QAAQ,CAAC;AAAA,EACrD;AACA,SAAO;AACT;AAEA,IAAI,iBAAiB,CAAC;AACtB,IAAI,iBAAiB,CAAC;AAItB,IAAI,2BAA2B,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AACtD,SAAS,aAAa,UAAU;AAC9B,MAAI,CAAC,KAAK,GAAG,IAAI,6BAA6B,IAAI,GAAG,GAAG,GAAG,CAAC;AAC5D,MAAI,KAAK,MAAM,EAAE,EACd,KAAK,EACL,IAAI,CAAC,GAAG,MAAM,eAAe,UAAU,CAAC,CAAC;AAC5C,MAAI,aACF,GAAG,QAAQ,CAAC,IACZ,KAAK,GAAG,QAAQ,CAAC,IACjB,MAAM,IAAI,GAAG,QAAQ,EAAE,IACvB,MAAM,IAAI,GAAG,QAAQ,EAAE;AACzB,MAAI,CAAC,SAAS,OAAO,IAAI,CAAC,wBAAwB,sBAAsB,EAAE;AAAA,IACxE,CAAC,oBAAoB;AACnB,UAAI,MAAM,gBAAgB;AAAA,QACxB,CAAC,MAAM,yBAAyB,SAAS,CAAC,CAAC;AAAA,MAC7C;AACA,aAAO,IAAI,IAAI,OAAO,CAAC,KAAK,GAAG,MAAM,MAAO,KAAM,IAAI,GAAK,CAAC,CAAC;AAAA,IAC/D;AAAA,EACF;AACA,SAAO,CAAC,YAAY,SAAS,OAAO;AACtC;AAEA,SAAS,8BAA8B;AACrC,MAAI,eAAe,aAAa;AAC9B,WAAO,eAAe;AAAA,EACxB;AACA,MAAI,KAAK,+BAA+B,kBAAkB,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;AAC1E,MAAI,KAAK,gBAAgB,IAAI,EAAE;AAC/B,MAAI,KAAK,gBAAgB,IAAI,EAAE;AAC/B,SAAQ,eAAe,cAAc;AACvC;AAEA,SAAS,8BAA8B;AACrC,MAAI,eAAe,aAAa;AAC9B,WAAO,eAAe;AAAA,EACxB;AACA,SAAQ,eAAe,cAAc,IAAI,4BAA4B,GAAG;AAAA,IACtE,IAAI,KAAK,IAAI,MAAM,IAAI,KAAK,MAAM,IAAI;AAAA,EACxC,CAAC;AACH;AAEA,SAAS,iCAAiC;AACxC,MAAI,eAAe,gBAAgB;AACjC,WAAO,eAAe;AAAA,EACxB;AACA,SAAQ,eAAe,iBAAiB;AAAA,IACtC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,kBAAkB,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,EACnC;AACF;AAEA,SAAS,iCAAiC;AACxC,MAAI,eAAe,gBAAgB;AACjC,WAAO,eAAe;AAAA,EACxB;AACA,SAAQ,eAAe,iBAAiB;AAAA,IACtC;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,kBAAkB,IAAI,CAAC,MAAM,EAAE,EAAE;AAAA,EACnC;AACF;AAEA,SAAS,gCAAgC;AAGvC,MAAI,eAAe,eAAe;AAChC,WAAO,eAAe;AAAA,EACxB;AACA,MAAI,CAAC,KAAK,GAAG,IAAI,6BAA6B,IAAI,GAAG,GAAG,GAAG,CAAC;AAC5D,MAAI,cAAc,IACf,OAAO,CAAC,MAAM;AACb,QAAI,KAAM,KAAK,KAAM;AACrB,QAAI,KAAM,KAAK,KAAM;AACrB,WAAO,OAAO,KAAK,OAAO;AAAA,EAC5B,CAAC,EACA,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;AACpB,SAAQ,eAAe,gBAAgB;AAAA,IACrC,+BAA+B;AAAA,IAC/B;AAAA,EACF;AACF;AAEA,UAAU,iBAAiB,UAAU;AACnC,MAAI,UAAU;AAAA,IACZ,4BAA4B;AAAA,IAC5B,+BAA+B;AAAA,IAC/B,+BAA+B;AAAA,EACjC;AACA,MAAI,UAAU;AAAA,IACZ,4BAA4B;AAAA,IAC5B,8BAA8B;AAAA,IAC9B,8BAA8B;AAAA,EAChC;AACA,SAAO,qBAAqB,aAAa,QAAQ,GAAG,SAAS,SAAS,EAAE;AAC1E;AAEA,UAAU,qBAAqB,SAAS,SAAS,SAAS,YAAY;AACpE,MAAI,UAAU,QAAQ;AACtB,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,SAAS,KAAK;AAChC,YAAQ,KAAK,IAAI,OAAO,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;AAAA,EAChD;AACA,SAAO,SAAS,YAAY;AAE1B,WAAO,sBAAsB,SAAS,SAAS,SAAS,OAAO,EAAE;AACjE;AAAA,EACF;AACF;AAEA,UAAU,sBAAsB,SAAS,SAAS,SAAS,OAAO,MAAM;AACtE,MAAI,UAAU;AACd,MAAI,SAAS;AACb,MAAI,YAAY,KAAK;AAAA,IACnB,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;AAAA,IACrB,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;AAAA,IACrB,QAAQ,CAAC,EAAE,QAAQ,CAAC,CAAC;AAAA,EACvB;AAEA,MAAI,YAAY,OAAO;AACrB;AAAA,EACF;AACA,MAAI,UAAU,GAAG;AACf,UAAM,CAAC;AACP;AAAA,EACF;AACA,MAAI,cAAc,KAAK,UAAU,GAAG;AAClC;AAAA,EACF;AACA,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,QAAI,MAAM,MAAM;AACd;AAAA,IACF;AACA,QAAI,MAAM,OAAO,GAAG;AAClB;AAAA,IACF;AACA,QAAI,cAAc,CAAC;AACnB,gBAAY,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;AACzC,gBAAY,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;AACzC,gBAAY,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;AACzC,QAAI,IAAI;AACR,WAAO,QAAQ,KAAK,CAAC,GAAG,MAAM,QAAQ,CAAC,MAAM,YAAY,CAAC,CAAC,GAAG;AAC5D,UAAI,cAAc;AAAA,QAChB;AAAA,QACA;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,QACR;AAAA,MACF;AACA,aAAO,MAAM;AACX,YAAI,EAAE,OAAO,SAAS,KAAK,IAAI,YAAY,KAAK;AAChD,YAAI,MAAM;AACR;AAAA,QACF;AACA,cAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,OAAO;AAAA,MAC/B;AACA,kBAAY,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;AAC7C,kBAAY,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;AAC7C,kBAAY,CAAC,IAAI,QAAQ,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,CAAC;AAC7C;AAAA,IACF;AAAA,EACF;AACF;AAIA,IAAI,2BAA2B,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;AAGtD,IAAI,wBAAwB,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,EAAE;AAC3D,IAAI,cAAc;AAAA,EAChB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAgBA,SAAS,aAAa,UAAU;AAC9B,MAAI,CAAC,KAAK,GAAG,IAAI,6BAA6B,IAAI,GAAG,GAAG,GAAG,CAAC;AAC5D,MAAI,KAAK,MAAM,CAAC,EACb,KAAK,EACL,IAAI,CAAC,GAAG,MAAM,eAAe,UAAU,CAAC,CAAC;AAC5C,MAAI,aAAa,GAAG,QAAQ,CAAC,IAAI,IAAI,GAAG,QAAQ,CAAC,IAAI,KAAK,IAAI,GAAG,QAAQ,CAAC;AAC1E,MAAI,UAAU,MAAM,CAAC,EAClB,KAAK,EACL,IAAI,CAAC,GAAG,MAAM,iBAAiB,UAAU,CAAC,CAAC;AAC9C,MAAI,kBAAkB;AAAA,IACpB,QACG,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,IAAI,IAAI,CAAC,EACzB,OAAO,QAAQ,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,IAAI,KAAK,IAAI,EAAE,CAAC;AAAA,EACpD;AACA,MAAI,aAAa,gBAAgB,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC;AAC7D,MAAI,aAAa,gBAAgB,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAO,IAAI,IAAK,CAAC;AACnE,MAAI,eACF,yBAAyB,UAAU,IAAI,KACtC,WAAW,CAAC,IAAI,WAAW,CAAC,KAC7B,KAAK,WAAW,CAAC,IAAI,WAAW,CAAC,KACjC,IAAI,WAAW,CAAC;AAClB,MAAI,CAAC,SAAS,OAAO,IAAI,CAAC,wBAAwB,sBAAsB,EAAE;AAAA,IACxE,CAAC,oBAAoB;AACnB,UAAI,MAAM,QAAQ,iBAAiB,qBAAqB,EAAE;AAAA,QACxD,CAAC,MAAM,yBAAyB,SAAS,CAAC,CAAC;AAAA,MAC7C;AACA,aAAO,IAAI,IAAI,OAAO,CAAC,KAAK,GAAG,MAAM,MAAO,KAAM,IAAI,GAAK,CAAC,CAAC;AAAA,IAC/D;AAAA,EACF;AAGA,8BAA4B;AAC5B,wCAAsC;AACtC,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA,4BAA4B,YAAY,IACtC,KAAK,0BAA0B,UAAU;AAAA,EAC7C;AACF;AAEA,UAAU,iBAAiB,UAAU;AACnC,SAAO,qBAAqB,aAAa,QAAQ,GAAG,EAAE;AACxD;AAMA,SAAS,iCAAiC;AACxC,MAAI,eAAe,eAAe;AAChC,WAAO,eAAe;AAAA,EACxB;AACA,MAAI,IAAI;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,kBACG,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,MAAM,mBAAmB,EAAE,IAAI,WAAW,CAAC;AAAA,EACrD;AACA,MAAI,IAAI;AAAA,IACN;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,kBACG,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,MAAM,mBAAmB,EAAE,IAAI,WAAW,CAAC;AAAA,EACrD;AACA,SAAQ,eAAe,gBAAgB,CAAC,GAAG,CAAC;AAC9C;AAEA,IAAI;AACJ,SAAS,8BAA8B;AACrC,MAAI,eAAe,aAAa;AAC9B,WAAO,eAAe;AAAA,EACxB;AACA,MAAI,IAAI;AAAA,IACN,kBAAkB,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,MAAM,GAAG,CAAC,CAAC;AAAA,EAC3D;AACA,MAAI,MAAM,gBAAgB,GAAG,gBAAgB,GAAG,CAAC,CAAC;AAClD,MAAI;AACJ,GAAC,aAAa,yBAAyB,IAAI,iBAAiB,KAAK,GAAK;AACtE,SAAQ,eAAe,cAAc;AACvC;AAEA,SAAS,gCAAgC;AACvC,MAAI,eAAe,eAAe;AAChC,WAAO,eAAe;AAAA,EACxB;AACA,QAAM,YAAY,UAAU,CAAC,IAAI;AACjC,QAAM,IAAI,YAAY;AACtB,QAAM,OAAO;AAAA,IACX;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AAEA,MAAI,SAAS,MAAM,CAAC,EACjB,KAAK,EACL,IAAI,MAAM,IAAI,YAAY,CAAC,CAAC;AAC/B,MAAI,eAAe,kBAChB,MAAM,GAAG,CAAC,EACV,IAAI,CAAC,MAAM,mBAAmB,mBAAmB,EAAE,IAAI,IAAI,CAAC,CAAC;AAEhE,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,IAAI,yBAAyB,KAAK,GAAG,CAAC;AAC1C,QAAI,IAAI,CAAC,GAAG,GAAG,IAAI,GAAI,KAAK,IAAK,GAAI,KAAK,IAAK,CAAC;AAChD,MAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;AACxB,QAAI,KAAK,MAAM,EAAE;AACjB,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,SAAG,CAAC,IAAI,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;AACtB,SAAG,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC,IAAI;AAAA,IACjC;AACA,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,MAAM,QAAQ,aAAa,CAAC,GAAG,EAAE;AACrC,UAAI,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC;AACzC,UAAI,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAO,IAAI,IAAK,CAAC;AAC/C,UAAI,qBAAqB,GAAG,CAAC,IAAI,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC,IAAI,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC;AACxE,aAAO,CAAC,EAAE,CAAC,IAAI,yBAAyB,EAAE,IAAI,IAAI;AAAA,IACpD;AAAA,EACF;AACA,SAAQ,eAAe,gBAAgB;AAKzC;AAEA,IAAI;AACJ,SAAS,wCAAwC;AAC/C,MAAI,eAAe,uBAAuB;AACxC,WAAO,eAAe;AAAA,EACxB;AACA,GAAC,eAAe,uBAAuB,2BAA2B,IAChE;AAAA,IACE,8BAA8B;AAAA,IAC9B,0BAA0B;AAAA,EAC5B;AACF,SAAO,eAAe;AACxB;AAEA,SAAS,4BAA4B;AACnC,MAAI,eAAe,WAAW;AAC5B,WAAO,eAAe;AAAA,EACxB;AACA,MAAI,IAAI,sCAAsC;AAC9C,MAAI,IAAI,4BAA4B;AACpC,SAAQ,eAAe,YAAY,gBAAgB,GAAG,CAAC;AACzD;AAEA,IAAI;AACJ,SAAS,gCAAgC;AACvC,MAAI,sBAAsB;AACxB,WAAO;AAAA,EACT;AACA,QAAM,YAAY,aAAa,YAAY,EAAE,CAAC;AAC9C,SAAQ,uBAAuB;AAAA,IAC7B,0BAA0B;AAAA,IAC1B;AAAA,IACA;AAAA,EACF;AACF;AAEA,SAAS,4BAA4B;AACnC,MAAI,CAAC,KAAK,GAAG,IAAI,6BAA6B,IAAI,GAAG,GAAG,GAAG,CAAC;AAC5D,SAAO,IAAI,OAAO,CAAC,OAAQ,KAAK,KAAM,QAAQ,EAAE,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;AAerE;AAEA,SAAS,4BAA4B;AACnC,MAAI,SAAS,8BAA8B;AAC3C,MAAI,IAAI,OAAO,CAAC,EAAE;AAClB,MAAI,QAAQ,MAAM,CAAC,EAAE,KAAK,KAAK;AAC/B,QAAM,CAAC,IAAI;AACX,MAAI,OAAO;AACX,SAAO,CAAC,MAAM;AACZ,WAAO;AACP,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,UAAI,MAAM,CAAC,GAAG;AACZ,YAAI,CAAC,MAAM,OAAO,CAAC,EAAE,CAAC,CAAC,GAAG;AACxB,iBAAO;AACP,gBAAM,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI;AAAA,QACxB;AACA,YAAI,CAAC,MAAM,OAAO,CAAC,EAAE,CAAC,CAAC,GAAG;AACxB,iBAAO;AACP,gBAAM,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI;AAAA,QACxB;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO,MAAM,IAAI,CAAC,GAAG,MAAM,CAAC,EAAE,OAAO,CAAC,MAAM,MAAM,CAAC,CAAC;AACtD;AAEA,SAAS,6BAA6B;AACpC,MAAI,eAAe,YAAY;AAC7B,WAAO,eAAe;AAAA,EACxB;AACA,QAAM,CAAC,UAAU,QAAQ,IAAI,+BAA+B;AAC5D,QAAM,YAAY,0BAA0B;AAC5C,QAAM,KAAK;AACX,QAAM,MAAM,KAAK;AACjB,QAAM,IAAI,KAAK;AACf,QAAM,YAAY,aAAa,YAAY,EAAE,CAAC;AAC9C,QAAM,YAAY;AAClB,MAAI,SAAS,IAAI,UAAU,CAAC,EAAE,KAAK,SAAS;AAC5C,WAAS,YAAY,0BAA0B,GAAG;AAChD,WAAO,WAAW,KAAK,SAAS,IAAI;AAAA,EACtC;AACA,WAAS,QAAQ,GAAG,QAAQ,YAAY,GAAG,SAAS;AAClD,aACM,QAAQ,OAAO,QAAQ,KAAK,GAChC,UAAU,IACV,QAAQ,OAAO,QAAQ,OAAO,QAAQ,CAAC,GACvC;AACA,UAAI,IAAI,QAAQ;AAChB,UAAI,KAAM,QAAQ,KAAM;AACxB,eAAS,aAAa,GAAG,aAAa,GAAG,cAAc;AACrD,YAAI,QAAQ,SAAS,UAAU,EAAE,CAAC;AAClC,YAAI,SAAS,UAAU,UAAU,EAAE,EAAE;AACrC,YAAI,YAAY,QAAQ,KAAK;AAC7B,YAAI,OAAO,SAAS,MAAM,WAAW;AACnC,iBAAO,SAAS,IAAI,QAAQ;AAAA,QAC9B;AACA,gBAAQ,SAAS,UAAU,EAAE,KAAK;AAClC,iBAAS,UAAU,UAAU,EAAE,MAAM;AACrC,oBAAY,QAAQ,KAAK;AACzB,YAAI,OAAO,SAAS,MAAM,WAAW;AACnC,iBAAO,SAAS,IAAI,QAAQ;AAAA,QAC9B;AAAA,MACF;AAAA,IACF;AAAA,EACF;AAGA,SAAQ,eAAe,aAAa;AACtC;AAEA,UAAU,qBAAqB,SAAS,YAAY;AAClD,MAAI,CAAC,UAAU,QAAQ,IAAI,+BAA+B;AAC1D,MAAI,YAAY,0BAA0B;AAC1C,MAAI,aAAa,2BAA2B;AAC5C,MAAI,aAAa,8BAA8B;AAC/C,MAAI,CAAC,GAAG,GAAG,EAAE,IAAI;AACjB,MAAI,YAAY,WAAW,EAAE;AAC7B,MAAI,QAAQ,KAAK;AAAA,IACf,WAAW,IAAI,OAAO,EAAE;AAAA,IACxB,WAAW,IAAI,OAAO,SAAS;AAAA,EACjC;AACA,SAAO,SAAS,YAAY;AAE1B,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA;AAAA,EACF;AACF;AAEA,UAAU,sBACR,GACA,GACA,IACA,UACA,UACA,WACA,YACA,YACA,OACA,MACA;AACA,MAAI,IAAI,KAAK;AAAA,IACX,WAAW,IAAI,OAAO,EAAE;AAAA,IACxB,WAAW,IAAI,OAAO,WAAW,EAAE,CAAC;AAAA,EACtC;AACA,MAAI,IAAI,OAAO;AACb;AAAA,EACF;AACA,MAAI,UAAU,GAAG;AACf,UAAM,CAAC;AACP;AAAA,EACF,WAAW,MAAM,GAAG;AAClB;AAAA,EACF;AACA,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,QAAI,MAAM,MAAM;AACd;AAAA,IACF;AACA,QAAI,QAAQ;AACZ,QAAI,QAAQ;AACZ,QAAI,SAAS;AACb,aAAS,IAAI,GAAG,KAAK,GAAG,KAAK;AAC3B,cAAQ,SAAS,CAAC,EAAE,KAAK;AACzB,cAAQ,SAAS,CAAC,EAAE,KAAK;AACzB,eAAS,UAAU,CAAC,EAAE,MAAM;AAC5B,UAAI,cAAc;AAAA,QAChB;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA,QAAQ;AAAA,QACR;AAAA,MACF;AACA,aAAO,MAAM;AACX,YAAI,EAAE,OAAO,SAAS,KAAK,IAAI,YAAY,KAAK;AAChD,YAAI,MAAM;AACR;AAAA,QACF;AACA,cAAM,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,OAAO;AAAA,MAC/B;AAAA,IACF;AAAA,EACF;AACF;AAIA,IAAI,6BAA6B,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,EAAE;AAEvD,IAAI,mBAAmB;AAAA,EACrB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,IAAI,wBAAwB;AAAA,EAC1B,CAAC,CAAC,GAAG,CAAC,CAAC;AAAA;AAAA,EACP,CAAC,CAAC,GAAG,CAAC,CAAC;AAAA;AAAA;AAAA,EAGP;AAAA,IACE,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACP;AAAA,EACA;AAAA,IACE,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACP;AAAA,EACA;AAAA,IACE,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACP;AAAA,EACA;AAAA,IACE,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACP;AAAA;AAAA,EAGA;AAAA,IACE,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACP;AAAA,EACA;AAAA,IACE,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACP;AAAA;AAAA,EAGA;AAAA,IACE,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACP;AAAA,EACA;AAAA,IACE,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACP;AAAA,EACA;AAAA,IACE,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACP;AAAA,EACA;AAAA,IACE,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACP;AAAA;AAAA,EAGA;AAAA,IACE,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACP;AAAA,EACA;AAAA,IACE,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACP;AAAA,EACA;AAAA,IACE,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACP;AAAA,EACA;AAAA,IACE,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACP;AAAA;AAAA,EAGA;AAAA,IACE,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACP;AAAA,EACA;AAAA,IACE,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,IACL,CAAC,GAAG,CAAC;AAAA,EACP;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAWF;AACA,wBAAwB,sBAAsB;AAAA,EAC5C,sBAAsB,IAAI,CAAC,QAAQ,qBAAqB,GAAG,CAAC;AAC9D;AACA,IAAI,qBAAqB,sBAAsB;AAmC/C,IAAI,mCAAmC,sBAAsB;AAAA,EAAI,CAAC,QAChE,oBAAoB,wBAAwB,CAAC,GAAG,EAAE,GAAG,GAAG;AAC1D;AACA,IAAI,iCAAiC,iCAAiC;AAAA,EACpE;AACF;AACA,IAAI,0BACF,iCAAiC,IAAI,iBAAiB;AAExD,SAAS,kBAAkB,UAAU;AACnC,MAAI,CAAC,KAAK,GAAG,IAAI,6BAA6B,GAAG,GAAG,GAAG,GAAG,CAAC;AAC3D,MAAI,KAAK,MAAM,CAAC,EACb,KAAK,EACL,IAAI,CAAC,GAAG,MAAM,eAAe,UAAU,CAAC,CAAC;AAC5C,MAAI,aAAa,yBAAyB,EAAE;AAC5C,MAAI,UAAU,MAAM,CAAC,EAClB,KAAK,EACL,IAAI,CAAC,GAAG,MAAM,iBAAiB,UAAU,CAAC,CAAC;AAC9C,MAAI,eACF,yBAAyB,QAAQ,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,IACrD,QAAQ,KAAK,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;AACnC,MAAI,CAAC,SAAS,OAAO,IAAI,CAAC,wBAAwB,sBAAsB,EAAE;AAAA,IACxE,CAAC,oBAAoB;AACnB,UAAI,MAAM,QAAQ,iBAAiB,0BAA0B,EAAE;AAAA,QAC7D,CAAC,MAAM,SAAS,CAAC,IAAI;AAAA,MACvB;AACA,aAAO,IAAI,IAAI,OAAO,CAAC,KAAK,GAAG,MAAM,MAAO,KAAM,IAAI,GAAK,CAAC,CAAC;AAAA,IAC/D;AAAA,EACF;AACA,SAAO,CAAC,UAAU,MAAM,SAAS,eAAe,KAAK,UAAU;AACjE;AAEA,SAAS,mCAAmC;AAC1C,MAAI,eAAe,kBAAkB;AACnC,WAAO,eAAe;AAAA,EACxB;AACA,QAAM,YAAY,UAAU,CAAC,IAAI;AACjC,MAAI,SAAS,MAAM,kBAAkB,EAClC,KAAK,EACL,IAAI,MAAM,IAAI,YAAY,SAAS,CAAC;AACvC,MAAI,eAAe,+BAA+B;AAAA,IAAI,CAAC,MACrD,EAAE,GAAG,MAAM,GAAG,CAAC;AAAA,EACjB;AACA,WAAS,IAAI,GAAG,IAAI,WAAW,KAAK;AAClC,QAAI,IAAI,yBAAyB,GAAG,CAAC;AACrC,aAAS,IAAI,GAAG,IAAI,oBAAoB,KAAK;AAC3C,aAAO,CAAC,EAAE,CAAC,IAAI,yBAAyB,QAAQ,GAAG,aAAa,CAAC,CAAC,CAAC;AAAA,IACrE;AAAA,EACF;AACA,SAAQ,eAAe,mBAAmB;AAC5C;AAGA,SAAS,qCAAqC;AAC5C,MAAI,eAAe,oBAAoB;AACrC,WAAO,eAAe;AAAA,EACxB;AACA,QAAM,YAAY,UAAU,CAAC,IAAI;AACjC,QAAM,IAAI,YAAY;AACtB,QAAM,OAAO;AAAA,IACX;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,MAAI,SAAS,MAAM,kBAAkB,EAClC,KAAK,EACL,IAAI,MAAM,IAAI,YAAY,CAAC,CAAC;AAC/B,MAAI,eAAe,+BAA+B;AAAA,IAAI,CAAC,MACrD,mBAAmB,EAAE,IAAI,IAAI,EAAE,MAAM,GAAG,CAAC;AAAA,EAC3C;AACA,WAAS,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;AAC7B,QAAI,IAAI,yBAAyB,KAAK,GAAG,CAAC;AAC1C,QAAI,KAAK,EAAE,OAAO,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;AACrC,aAAS,IAAI,GAAG,IAAI,oBAAoB,KAAK;AAC3C,UAAI,MAAM,QAAQ,IAAI,aAAa,CAAC,CAAC;AACrC,UAAI,KAAK,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC;AAC7B,UAAI,KAAK,IAAI,KAAK,CAAC,MAAM,IAAI,MAAM,CAAC,KAAK;AACzC,aAAO,CAAC,EAAE,CAAC,IAAI,yBAAyB,EAAE,IAAI,IAAI;AAClD,aAAO,CAAC,EAAE,IAAI,CAAC,IAAI,yBAAyB,EAAE,IAAI,KAAK,KAAK;AAAA,IAC9D;AAAA,EACF;AACA,SAAQ,eAAe,qBAAqB;AAC9C;AAEA,SAAS,yCAAyC;AAChD,MAAI,eAAe,wBAAwB;AACzC,WAAO,eAAe;AAAA,EACxB;AACA,SAAQ,eAAe,yBAAyB;AAAA,IAC9C,mCAAmC;AAAA,IACnC,iCAAiC;AAAA,EACnC;AACF;AAEA,SAAS,qCAAqC;AAC5C,MAAI,eAAe,oBAAoB;AACrC,WAAO,eAAe;AAAA,EACxB;AACA,MAAI,WAAW;AAAA,IACb;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,+BAA+B;AAAA,MAAI,CAAC,MAClC,mBAAmB,EAAE,IAAI,gBAAgB;AAAA,IAC3C;AAAA,EACF;AACA,MAAI,WAAW;AAAA,IACb;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,+BAA+B;AAAA,MAAI,CAAC,MAClC,mBAAmB,EAAE,IAAI,gBAAgB;AAAA,IAC3C;AAAA,EACF;AACA,iBAAe,sBAAsB;AACrC,iBAAe,sBAAsB;AACrC,SAAQ,eAAe,qBAAqB;AAAA,IAC1C;AAAA,IACA;AAAA,EACF;AACF;AAuDA,IAAI;AACJ,SAAS,iCAAiC;AACxC,MAAI,uBAAuB;AACzB,WAAO;AAAA,EACT;AACA,QAAM,YAAY,mCAAmC;AACrD,QAAM,WAAW,eAAe;AAChC,QAAM,YAAY,uCAAuC;AACzD,QAAM,KAAK,SAAS,CAAC,EAAE;AACvB,QAAM,MAAM,UAAU,CAAC,EAAE;AACzB,QAAM,IAAI,KAAK;AACf,QAAM,YAAY;AAClB,QAAM,cAAc,sBAAsB,IAAI,CAAC,QAAQ,IAAI,MAAM;AACjE,QAAM,QAAQ,IAAI,UAAU,CAAC,EAAE,KAAK,SAAS;AAC7C,QAAM,iBAAiB,kBAAkB,YAAY;AACrD,QAAO,eAAe,CAAC,IAAI,KAAM,KAAK,eAAe,CAAC,CAAC,IAAI;AAC3D,MAAI,QAAQ;AACZ,MAAI,OAAO;AACX,SAAO,CAAC,QAAQ,QAAQ,YAAY,GAAG;AACrC,WAAO;AAEP,QAAI,eAAe,MAAM,kBAAkB,EACxC,KAAK,EACL,IAAI,CAAC,GAAG,MAAM,CAAC,EACf,OAAO,CAAC,MAAM,YAAY,CAAC,IAAI,QAAQ,SAAS;AACnD,iBAAa,KAAK,CAAC,GAAG,OAAO,YAAY,CAAC,IAAI,YAAY,EAAE,CAAC;AAC7D,QAAI,UAAU,QAAQ,aAAa,YAAY;AAC/C,QAAI,kBAAkB,QAAQ,UAAU,YAAY;AACpD,QAAI,mBAAmB,QAAQ,WAAW,YAAY;AACtD,QAAI,SAAS,aAAa;AAE1B,aACM,QAAQ,MAAM,QAAQ,KAAK,GAC/B,UAAU,IACV,QAAQ,MAAM,QAAQ,OAAO,QAAQ,CAAC,GACtC;AACA,UAAI,IAAI,QAAQ;AAChB,UAAI,KAAM,QAAQ,KAAM;AACxB,eAAS,KAAK,GAAG,KAAK,QAAQ,MAAM;AAClC,YAAI,SAAS,QAAQ,EAAE;AACvB,YAAI,QAAQ,gBAAgB,EAAE,EAAE,CAAC;AACjC,YAAI,SAAS,iBAAiB,EAAE,EAAE,EAAE;AACpC,YAAI,YAAY,QAAQ,KAAK;AAC7B,YAAI,MAAM,SAAS,IAAI,QAAQ,QAAQ;AACrC,iBAAO;AACP,gBAAM,SAAS,IAAI,QAAQ;AAAA,QAC7B;AAAA,MACF;AAAA,IACF;AACA;AAAA,EACF;AACA,SAAQ,wBAAwB;AAClC;AAEA,IAAI;AACJ,SAAS,qCAAqC;AAC5C,MAAI,2BAA2B;AAC7B,WAAO;AAAA,EACT;AACA,QAAM,YAAY,uCAAuC,EAAE,MAAM,GAAG,CAAC;AACrE,QAAM,iBAAiB,kBAAkB,YAAY;AACrD,SAAQ,4BAA4B;AAAA,IAClC;AAAA,IACA,eAAe,CAAC;AAAA,IAChB,eAAe,CAAC;AAAA,EAClB;AACF;AAgCA,SAAS,kBAAkB,UAAU,UAAU,kBAAkB,QAAQ,GAAG;AAE1E,MAAI,CAAC,IAAI,EAAE,IAAI;AACf,MAAI,IAAI,KAAK;AACb,MAAI,IAAI,KAAK,MAAM,KAAK,GAAG;AAC3B,MAAI,YAAY,mCAAmC;AACnD,MAAI,WAAW,eAAe;AAC9B,MAAI,WAAW,eAAe;AAC9B,MAAI,YAAY,uCAAuC;AACvD,MAAI,YAAY,+BAA+B;AAC/C,MAAI,gBAAgB,mCAAmC;AACvD,MAAI,QAAQ;AACZ,SAAO,MAAM;AACX,QAAI,MAAM;AAAA,MACR;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,aAAS,YAAY,KAAK;AACxB,aAAO,SAAS,IAAI,CAAC,MAAM,sBAAsB,CAAC,CAAC,EAAE,KAAK;AAAA,IAC5D;AACA;AAAA,EACF;AACF;AAEA,SAAS,2BACP,UACA,UAAU,kBAAkB,QAAQ,GACpC;AAEA,MAAI,CAAC,IAAI,EAAE,IAAI;AACf,MAAI,IAAI,KAAK;AACb,MAAI,IAAI,KAAK,MAAM,KAAK,GAAG;AAC3B,MAAI,YAAY,mCAAmC;AACnD,MAAI,WAAW,eAAe;AAC9B,MAAI,WAAW,eAAe;AAC9B,MAAI,YAAY,uCAAuC;AAEvD,MAAI,YAAY,+BAA+B;AAC/C,MAAI,gBAAgB,mCAAmC;AACvD,MAAI,UAAU,kBAAkB,QAAQ,EAAE;AAC1C,MAAI,aAAa;AACjB,MAAI;AAEJ,WAAS,QAAQ,SAAS,SAAS,UAAU,GAAG,SAAS;AACvD,QAAI,MAAM;AAAA,MACR;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,aAAS,YAAY,KAAK;AACxB,UAAI,WAAW,SAAS,IAAI,CAAC,MAAM,sBAAsB,CAAC,CAAC,EAAE,KAAK;AAClE,UAAI,aAAa,uBAAuB,QAAQ;AAChD,UAAI,QAAQ,kBAAkB,UAAU;AACxC,UAAI,QAAQ,YAAY;AACtB,qBAAa;AACb,wBAAgB;AAAA,MAGlB;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,oBAAoB,GAAG;AAC9B,UAAS,IAAI,MAAM,IAAI,KAAM;AAO/B;AAEA,SAAS,kBAAkB,KAAK;AAC9B,MAAI,SAAS,wBAAwB,KAAK,IAAI,EAAE,QAAQ,MAAM,EAAE,EAAE,MAAM,GAAG;AAC3E,SACE,IAAI,SACJ,aAAa,MAAM,EAChB,IAAI,mBAAmB,EACvB,OAAO,CAAC,GAAG,MAAM,IAAI,GAAG,CAAC;AAEhC;AAEA,SAAS,aAAa,KAAK;AAQzB,MAAI,IAAI,SAAS,GAAG;AAClB,WAAO,CAAC;AAAA,EACV;AACA,MAAI,IAAI,IAAI;AACZ,MAAI,IAAI,CAAC;AACT,WAASC,KAAI,GAAGA,KAAI,IAAI,GAAGA,MAAK;AAC9B,MAAEA,EAAC,IAAI,IAAIA,EAAC,MAAM,IAAIA,KAAI,CAAC;AAAA,EAC7B;AACA,IAAE,KAAK,KAAK;AACZ,MAAI,IAAI;AACR,MAAI,OAAO,CAAC;AACZ,SAAO,IAAI,IAAI,GAAG;AAChB,QAAI,EAAE,QAAQ,MAAM,IAAI,CAAC;AACzB,QAAI,MAAM,IAAI;AACZ;AAAA,IACF;AACA,QAAI,IAAI,EAAE,QAAQ,OAAO,IAAI,CAAC;AAC9B,SAAK,KAAK,IAAI,CAAC;AACf,QAAI;AAAA,EACN;AACA,SAAO;AACT;AAEA,UAAU,sBACR,GACA,GACA,IACA,UACA,UACA,WACA,WACA,eACA,OACA,OAAO,IACP;AACA,MAAI,QAAQ,UAAU,IAAI,MAAM,EAAE;AAClC,MAAI,QAAQ,UAAU,IAAI,MAAM,cAAc,EAAE,CAAC;AACjD,MAAI,IAAI,KAAK,IAAI,OAAO,KAAK;AAE7B,MAAI,IAAI,OAAO;AACb;AAAA,EACF;AACA,MAAI,UAAU,GAAG;AACf,UAAM,CAAC;AACP;AAAA,EACF;AACA,MAAI,MAAM,GAAG;AACX;AAAA,EACF;AACA,WAAS,IAAI,GAAG,IAAI,oBAAoB,KAAK;AAC3C,QAAI,MAAM,QAAQ,wBAAwB,CAAC,KAAK,GAAG;AACjD;AAAA,IACF;AACA,QAAI,QAAQ,SAAS,CAAC,EAAE,CAAC;AACzB,QAAI,QAAQ,SAAS,CAAC,EAAE,CAAC;AACzB,QAAI,SAAS,UAAU,CAAC,EAAE,EAAE;AAC5B,QAAI,YAAY,QAAQ,sBAAsB,CAAC,EAAE;AACjD,QAAI,YAAY,GAAG;AACjB;AAAA,IACF;AACA,QAAI,cAAc;AAAA,MAChB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACF;AACA,WAAO,MAAM;AACX,UAAI,EAAE,OAAO,SAAS,KAAK,IAAI,YAAY,KAAK;AAChD,UAAI,MAAM;AACR;AAAA,MACF;AACA,YAAM,CAAC,CAAC,EAAE,OAAO,OAAO;AAAA,IAC1B;AAAA,EACF;AACF;AAIA,SAAS,6BACP,UACA,kBAAkB,KAClB,MAAM,IACN;AACA,MAAI,OAAO,CAAC;AACZ,MAAI,MAAM,iBAAiB,QAAQ;AACnC,MAAI,cAAc,QAAQ,UAAU,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC;AAC5D,MAAI,SAAS,iBAAiB,WAAW;AACzC,MAAI,OAAO,MAAM,GAAI;AAErB,WAAS,IAAI,GAAG,IAAI,iBAAiB,KAAK;AACxC;AACE,UAAI,EAAE,OAAO,KAAK,IAAI,IAAI,KAAK;AAC/B,UAAI,CAAC,MAAM;AACT,YAAI,wBAAwB,oBAAoB,UAAU,KAAK;AAC/D,YAAI,WAAW,MAAM,OAAO,kBAAkB,qBAAqB,CAAC;AACpE,YAAI,SAAS,UAAU,KAAK;AAC1B,iBAAO;AAAA,QACT,WAAW,SAAS,SAAS,KAAK,QAAQ;AACxC,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AACA;AACE,UAAI,EAAE,OAAO,KAAK,IAAI,OAAO,KAAK;AAClC,UAAI,CAAC,MAAM;AACT,YAAI,wBAAwB,oBAAoB,aAAa,KAAK;AAClE,YAAI,WAAW,MACZ,OAAO,kBAAkB,qBAAqB,CAAC,EAC/C,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;AAC7B,YAAI,SAAS,UAAU,KAAK;AAC1B,iBAAO;AAAA,QACT,WAAW,SAAS,SAAS,KAAK,QAAQ;AACxC,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,iCACP,UACA,kBAAkB,IAClB,MAAM,IACN;AACA,MAAI,OAAO,CAAC;AACZ,MAAI,MAAM,iBAAiB,QAAQ;AACnC,MAAI,cAAc,QAAQ,UAAU,MAAM,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC;AAC5D,MAAI,SAAS,iBAAiB,WAAW;AACzC,MAAI;AACJ,MAAI,aAAa;AACjB,WAAS,IAAI,GAAG,IAAI,iBAAiB,KAAK;AACxC;AACE,UAAI,EAAE,OAAO,KAAK,IAAI,IAAI,KAAK;AAC/B,UAAI,CAAC,MAAM;AACT,YAAI,wBAAwB,oBAAoB,UAAU,KAAK;AAC/D,YAAI,WAAW;AAAA,UACb,MAAM,OAAO,2BAA2B,qBAAqB,CAAC;AAAA,QAChE;AACA,YAAI,QAAQ,kBAAkB,QAAQ;AACtC,YAAI,SAAS,KAAK;AAChB,iBAAO;AAAA,QACT,WAAW,QAAQ,YAAY;AAC7B,iBAAO;AACP,uBAAa;AAAA,QACf;AAAA,MACF;AAAA,IACF;AACA;AACE,UAAI,EAAE,OAAO,KAAK,IAAI,OAAO,KAAK;AAClC,UAAI,CAAC,MAAM;AACT,YAAI,wBAAwB,oBAAoB,aAAa,KAAK;AAClE,YAAI,WAAW;AAAA,UACb,MAAM,OAAO,2BAA2B,qBAAqB,CAAC;AAAA,QAChE;AACA,mBAAW,SAAS,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;AAC9C,YAAI,QAAQ,kBAAkB,QAAQ;AACtC,YAAI,SAAS,KAAK;AAChB,iBAAO;AAAA,QACT,WAAW,QAAQ,YAAY;AAC7B,iBAAO;AACP,uBAAa;AAAA,QACf;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,0BAA0B;AACxC,SAAO,+BAA+B;AACxC;",
-  "names": ["evenpermutation8_to_index", "index_to_evenpermutation8", "C", "i"]
-}